xfs_utils.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322
  1. /*
  2. * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
  3. * All Rights Reserved.
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public License as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it would be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write the Free Software Foundation,
  16. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #include "xfs.h"
  19. #include "xfs_fs.h"
  20. #include "xfs_types.h"
  21. #include "xfs_bit.h"
  22. #include "xfs_log.h"
  23. #include "xfs_inum.h"
  24. #include "xfs_trans.h"
  25. #include "xfs_sb.h"
  26. #include "xfs_ag.h"
  27. #include "xfs_dir2.h"
  28. #include "xfs_mount.h"
  29. #include "xfs_bmap_btree.h"
  30. #include "xfs_dinode.h"
  31. #include "xfs_inode.h"
  32. #include "xfs_inode_item.h"
  33. #include "xfs_bmap.h"
  34. #include "xfs_error.h"
  35. #include "xfs_quota.h"
  36. #include "xfs_itable.h"
  37. #include "xfs_utils.h"
  38. /*
  39. * Allocates a new inode from disk and return a pointer to the
  40. * incore copy. This routine will internally commit the current
  41. * transaction and allocate a new one if the Space Manager needed
  42. * to do an allocation to replenish the inode free-list.
  43. *
  44. * This routine is designed to be called from xfs_create and
  45. * xfs_create_dir.
  46. *
  47. */
  48. int
  49. xfs_dir_ialloc(
  50. xfs_trans_t **tpp, /* input: current transaction;
  51. output: may be a new transaction. */
  52. xfs_inode_t *dp, /* directory within whose allocate
  53. the inode. */
  54. mode_t mode,
  55. xfs_nlink_t nlink,
  56. xfs_dev_t rdev,
  57. prid_t prid, /* project id */
  58. int okalloc, /* ok to allocate new space */
  59. xfs_inode_t **ipp, /* pointer to inode; it will be
  60. locked. */
  61. int *committed)
  62. {
  63. xfs_trans_t *tp;
  64. xfs_trans_t *ntp;
  65. xfs_inode_t *ip;
  66. xfs_buf_t *ialloc_context = NULL;
  67. boolean_t call_again = B_FALSE;
  68. int code;
  69. uint log_res;
  70. uint log_count;
  71. void *dqinfo;
  72. uint tflags;
  73. tp = *tpp;
  74. ASSERT(tp->t_flags & XFS_TRANS_PERM_LOG_RES);
  75. /*
  76. * xfs_ialloc will return a pointer to an incore inode if
  77. * the Space Manager has an available inode on the free
  78. * list. Otherwise, it will do an allocation and replenish
  79. * the freelist. Since we can only do one allocation per
  80. * transaction without deadlocks, we will need to commit the
  81. * current transaction and start a new one. We will then
  82. * need to call xfs_ialloc again to get the inode.
  83. *
  84. * If xfs_ialloc did an allocation to replenish the freelist,
  85. * it returns the bp containing the head of the freelist as
  86. * ialloc_context. We will hold a lock on it across the
  87. * transaction commit so that no other process can steal
  88. * the inode(s) that we've just allocated.
  89. */
  90. code = xfs_ialloc(tp, dp, mode, nlink, rdev, prid, okalloc,
  91. &ialloc_context, &call_again, &ip);
  92. /*
  93. * Return an error if we were unable to allocate a new inode.
  94. * This should only happen if we run out of space on disk or
  95. * encounter a disk error.
  96. */
  97. if (code) {
  98. *ipp = NULL;
  99. return code;
  100. }
  101. if (!call_again && (ip == NULL)) {
  102. *ipp = NULL;
  103. return XFS_ERROR(ENOSPC);
  104. }
  105. /*
  106. * If call_again is set, then we were unable to get an
  107. * inode in one operation. We need to commit the current
  108. * transaction and call xfs_ialloc() again. It is guaranteed
  109. * to succeed the second time.
  110. */
  111. if (call_again) {
  112. /*
  113. * Normally, xfs_trans_commit releases all the locks.
  114. * We call bhold to hang on to the ialloc_context across
  115. * the commit. Holding this buffer prevents any other
  116. * processes from doing any allocations in this
  117. * allocation group.
  118. */
  119. xfs_trans_bhold(tp, ialloc_context);
  120. /*
  121. * Save the log reservation so we can use
  122. * them in the next transaction.
  123. */
  124. log_res = xfs_trans_get_log_res(tp);
  125. log_count = xfs_trans_get_log_count(tp);
  126. /*
  127. * We want the quota changes to be associated with the next
  128. * transaction, NOT this one. So, detach the dqinfo from this
  129. * and attach it to the next transaction.
  130. */
  131. dqinfo = NULL;
  132. tflags = 0;
  133. if (tp->t_dqinfo) {
  134. dqinfo = (void *)tp->t_dqinfo;
  135. tp->t_dqinfo = NULL;
  136. tflags = tp->t_flags & XFS_TRANS_DQ_DIRTY;
  137. tp->t_flags &= ~(XFS_TRANS_DQ_DIRTY);
  138. }
  139. ntp = xfs_trans_dup(tp);
  140. code = xfs_trans_commit(tp, 0);
  141. tp = ntp;
  142. if (committed != NULL) {
  143. *committed = 1;
  144. }
  145. /*
  146. * If we get an error during the commit processing,
  147. * release the buffer that is still held and return
  148. * to the caller.
  149. */
  150. if (code) {
  151. xfs_buf_relse(ialloc_context);
  152. if (dqinfo) {
  153. tp->t_dqinfo = dqinfo;
  154. xfs_trans_free_dqinfo(tp);
  155. }
  156. *tpp = ntp;
  157. *ipp = NULL;
  158. return code;
  159. }
  160. /*
  161. * transaction commit worked ok so we can drop the extra ticket
  162. * reference that we gained in xfs_trans_dup()
  163. */
  164. xfs_log_ticket_put(tp->t_ticket);
  165. code = xfs_trans_reserve(tp, 0, log_res, 0,
  166. XFS_TRANS_PERM_LOG_RES, log_count);
  167. /*
  168. * Re-attach the quota info that we detached from prev trx.
  169. */
  170. if (dqinfo) {
  171. tp->t_dqinfo = dqinfo;
  172. tp->t_flags |= tflags;
  173. }
  174. if (code) {
  175. xfs_buf_relse(ialloc_context);
  176. *tpp = ntp;
  177. *ipp = NULL;
  178. return code;
  179. }
  180. xfs_trans_bjoin(tp, ialloc_context);
  181. /*
  182. * Call ialloc again. Since we've locked out all
  183. * other allocations in this allocation group,
  184. * this call should always succeed.
  185. */
  186. code = xfs_ialloc(tp, dp, mode, nlink, rdev, prid,
  187. okalloc, &ialloc_context, &call_again, &ip);
  188. /*
  189. * If we get an error at this point, return to the caller
  190. * so that the current transaction can be aborted.
  191. */
  192. if (code) {
  193. *tpp = tp;
  194. *ipp = NULL;
  195. return code;
  196. }
  197. ASSERT ((!call_again) && (ip != NULL));
  198. } else {
  199. if (committed != NULL) {
  200. *committed = 0;
  201. }
  202. }
  203. *ipp = ip;
  204. *tpp = tp;
  205. return 0;
  206. }
  207. /*
  208. * Decrement the link count on an inode & log the change.
  209. * If this causes the link count to go to zero, initiate the
  210. * logging activity required to truncate a file.
  211. */
  212. int /* error */
  213. xfs_droplink(
  214. xfs_trans_t *tp,
  215. xfs_inode_t *ip)
  216. {
  217. int error;
  218. xfs_trans_ichgtime(tp, ip, XFS_ICHGTIME_CHG);
  219. ASSERT (ip->i_d.di_nlink > 0);
  220. ip->i_d.di_nlink--;
  221. drop_nlink(VFS_I(ip));
  222. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  223. error = 0;
  224. if (ip->i_d.di_nlink == 0) {
  225. /*
  226. * We're dropping the last link to this file.
  227. * Move the on-disk inode to the AGI unlinked list.
  228. * From xfs_inactive() we will pull the inode from
  229. * the list and free it.
  230. */
  231. error = xfs_iunlink(tp, ip);
  232. }
  233. return error;
  234. }
  235. /*
  236. * This gets called when the inode's version needs to be changed from 1 to 2.
  237. * Currently this happens when the nlink field overflows the old 16-bit value
  238. * or when chproj is called to change the project for the first time.
  239. * As a side effect the superblock version will also get rev'd
  240. * to contain the NLINK bit.
  241. */
  242. void
  243. xfs_bump_ino_vers2(
  244. xfs_trans_t *tp,
  245. xfs_inode_t *ip)
  246. {
  247. xfs_mount_t *mp;
  248. ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
  249. ASSERT(ip->i_d.di_version == 1);
  250. ip->i_d.di_version = 2;
  251. ip->i_d.di_onlink = 0;
  252. memset(&(ip->i_d.di_pad[0]), 0, sizeof(ip->i_d.di_pad));
  253. mp = tp->t_mountp;
  254. if (!xfs_sb_version_hasnlink(&mp->m_sb)) {
  255. spin_lock(&mp->m_sb_lock);
  256. if (!xfs_sb_version_hasnlink(&mp->m_sb)) {
  257. xfs_sb_version_addnlink(&mp->m_sb);
  258. spin_unlock(&mp->m_sb_lock);
  259. xfs_mod_sb(tp, XFS_SB_VERSIONNUM);
  260. } else {
  261. spin_unlock(&mp->m_sb_lock);
  262. }
  263. }
  264. /* Caller must log the inode */
  265. }
  266. /*
  267. * Increment the link count on an inode & log the change.
  268. */
  269. int
  270. xfs_bumplink(
  271. xfs_trans_t *tp,
  272. xfs_inode_t *ip)
  273. {
  274. if (ip->i_d.di_nlink >= XFS_MAXLINK)
  275. return XFS_ERROR(EMLINK);
  276. xfs_trans_ichgtime(tp, ip, XFS_ICHGTIME_CHG);
  277. ASSERT(ip->i_d.di_nlink > 0);
  278. ip->i_d.di_nlink++;
  279. inc_nlink(VFS_I(ip));
  280. if ((ip->i_d.di_version == 1) &&
  281. (ip->i_d.di_nlink > XFS_MAXLINK_1)) {
  282. /*
  283. * The inode has increased its number of links beyond
  284. * what can fit in an old format inode. It now needs
  285. * to be converted to a version 2 inode with a 32 bit
  286. * link count. If this is the first inode in the file
  287. * system to do this, then we need to bump the superblock
  288. * version number as well.
  289. */
  290. xfs_bump_ino_vers2(tp, ip);
  291. }
  292. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  293. return 0;
  294. }