xfs_utils.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472
  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_dir.h"
  28. #include "xfs_dir2.h"
  29. #include "xfs_dmapi.h"
  30. #include "xfs_mount.h"
  31. #include "xfs_bmap_btree.h"
  32. #include "xfs_dir_sf.h"
  33. #include "xfs_dir2_sf.h"
  34. #include "xfs_attr_sf.h"
  35. #include "xfs_dinode.h"
  36. #include "xfs_inode.h"
  37. #include "xfs_inode_item.h"
  38. #include "xfs_bmap.h"
  39. #include "xfs_error.h"
  40. #include "xfs_quota.h"
  41. #include "xfs_rw.h"
  42. #include "xfs_itable.h"
  43. #include "xfs_utils.h"
  44. /*
  45. * xfs_get_dir_entry is used to get a reference to an inode given
  46. * its parent directory inode and the name of the file. It does
  47. * not lock the child inode, and it unlocks the directory before
  48. * returning. The directory's generation number is returned for
  49. * use by a later call to xfs_lock_dir_and_entry.
  50. */
  51. int
  52. xfs_get_dir_entry(
  53. vname_t *dentry,
  54. xfs_inode_t **ipp)
  55. {
  56. vnode_t *vp;
  57. vp = VNAME_TO_VNODE(dentry);
  58. *ipp = xfs_vtoi(vp);
  59. if (!*ipp)
  60. return XFS_ERROR(ENOENT);
  61. VN_HOLD(vp);
  62. return 0;
  63. }
  64. int
  65. xfs_dir_lookup_int(
  66. bhv_desc_t *dir_bdp,
  67. uint lock_mode,
  68. vname_t *dentry,
  69. xfs_ino_t *inum,
  70. xfs_inode_t **ipp)
  71. {
  72. vnode_t *dir_vp;
  73. xfs_inode_t *dp;
  74. int error;
  75. dir_vp = BHV_TO_VNODE(dir_bdp);
  76. vn_trace_entry(dir_vp, __FUNCTION__, (inst_t *)__return_address);
  77. dp = XFS_BHVTOI(dir_bdp);
  78. error = XFS_DIR_LOOKUP(dp->i_mount, NULL, dp,
  79. VNAME(dentry), VNAMELEN(dentry), inum);
  80. if (!error) {
  81. /*
  82. * Unlock the directory. We do this because we can't
  83. * hold the directory lock while doing the vn_get()
  84. * in xfs_iget(). Doing so could cause us to hold
  85. * a lock while waiting for the inode to finish
  86. * being inactive while it's waiting for a log
  87. * reservation in the inactive routine.
  88. */
  89. xfs_iunlock(dp, lock_mode);
  90. error = xfs_iget(dp->i_mount, NULL, *inum, 0, 0, ipp, 0);
  91. xfs_ilock(dp, lock_mode);
  92. if (error) {
  93. *ipp = NULL;
  94. } else if ((*ipp)->i_d.di_mode == 0) {
  95. /*
  96. * The inode has been freed. Something is
  97. * wrong so just get out of here.
  98. */
  99. xfs_iunlock(dp, lock_mode);
  100. xfs_iput_new(*ipp, 0);
  101. *ipp = NULL;
  102. xfs_ilock(dp, lock_mode);
  103. error = XFS_ERROR(ENOENT);
  104. }
  105. }
  106. return error;
  107. }
  108. /*
  109. * Allocates a new inode from disk and return a pointer to the
  110. * incore copy. This routine will internally commit the current
  111. * transaction and allocate a new one if the Space Manager needed
  112. * to do an allocation to replenish the inode free-list.
  113. *
  114. * This routine is designed to be called from xfs_create and
  115. * xfs_create_dir.
  116. *
  117. */
  118. int
  119. xfs_dir_ialloc(
  120. xfs_trans_t **tpp, /* input: current transaction;
  121. output: may be a new transaction. */
  122. xfs_inode_t *dp, /* directory within whose allocate
  123. the inode. */
  124. mode_t mode,
  125. xfs_nlink_t nlink,
  126. xfs_dev_t rdev,
  127. cred_t *credp,
  128. prid_t prid, /* project id */
  129. int okalloc, /* ok to allocate new space */
  130. xfs_inode_t **ipp, /* pointer to inode; it will be
  131. locked. */
  132. int *committed)
  133. {
  134. xfs_trans_t *tp;
  135. xfs_trans_t *ntp;
  136. xfs_inode_t *ip;
  137. xfs_buf_t *ialloc_context = NULL;
  138. boolean_t call_again = B_FALSE;
  139. int code;
  140. uint log_res;
  141. uint log_count;
  142. void *dqinfo;
  143. uint tflags;
  144. tp = *tpp;
  145. ASSERT(tp->t_flags & XFS_TRANS_PERM_LOG_RES);
  146. /*
  147. * xfs_ialloc will return a pointer to an incore inode if
  148. * the Space Manager has an available inode on the free
  149. * list. Otherwise, it will do an allocation and replenish
  150. * the freelist. Since we can only do one allocation per
  151. * transaction without deadlocks, we will need to commit the
  152. * current transaction and start a new one. We will then
  153. * need to call xfs_ialloc again to get the inode.
  154. *
  155. * If xfs_ialloc did an allocation to replenish the freelist,
  156. * it returns the bp containing the head of the freelist as
  157. * ialloc_context. We will hold a lock on it across the
  158. * transaction commit so that no other process can steal
  159. * the inode(s) that we've just allocated.
  160. */
  161. code = xfs_ialloc(tp, dp, mode, nlink, rdev, credp, prid, okalloc,
  162. &ialloc_context, &call_again, &ip);
  163. /*
  164. * Return an error if we were unable to allocate a new inode.
  165. * This should only happen if we run out of space on disk or
  166. * encounter a disk error.
  167. */
  168. if (code) {
  169. *ipp = NULL;
  170. return code;
  171. }
  172. if (!call_again && (ip == NULL)) {
  173. *ipp = NULL;
  174. return XFS_ERROR(ENOSPC);
  175. }
  176. /*
  177. * If call_again is set, then we were unable to get an
  178. * inode in one operation. We need to commit the current
  179. * transaction and call xfs_ialloc() again. It is guaranteed
  180. * to succeed the second time.
  181. */
  182. if (call_again) {
  183. /*
  184. * Normally, xfs_trans_commit releases all the locks.
  185. * We call bhold to hang on to the ialloc_context across
  186. * the commit. Holding this buffer prevents any other
  187. * processes from doing any allocations in this
  188. * allocation group.
  189. */
  190. xfs_trans_bhold(tp, ialloc_context);
  191. /*
  192. * Save the log reservation so we can use
  193. * them in the next transaction.
  194. */
  195. log_res = xfs_trans_get_log_res(tp);
  196. log_count = xfs_trans_get_log_count(tp);
  197. /*
  198. * We want the quota changes to be associated with the next
  199. * transaction, NOT this one. So, detach the dqinfo from this
  200. * and attach it to the next transaction.
  201. */
  202. dqinfo = NULL;
  203. tflags = 0;
  204. if (tp->t_dqinfo) {
  205. dqinfo = (void *)tp->t_dqinfo;
  206. tp->t_dqinfo = NULL;
  207. tflags = tp->t_flags & XFS_TRANS_DQ_DIRTY;
  208. tp->t_flags &= ~(XFS_TRANS_DQ_DIRTY);
  209. }
  210. ntp = xfs_trans_dup(tp);
  211. code = xfs_trans_commit(tp, 0, NULL);
  212. tp = ntp;
  213. if (committed != NULL) {
  214. *committed = 1;
  215. }
  216. /*
  217. * If we get an error during the commit processing,
  218. * release the buffer that is still held and return
  219. * to the caller.
  220. */
  221. if (code) {
  222. xfs_buf_relse(ialloc_context);
  223. if (dqinfo) {
  224. tp->t_dqinfo = dqinfo;
  225. XFS_TRANS_FREE_DQINFO(tp->t_mountp, tp);
  226. }
  227. *tpp = ntp;
  228. *ipp = NULL;
  229. return code;
  230. }
  231. code = xfs_trans_reserve(tp, 0, log_res, 0,
  232. XFS_TRANS_PERM_LOG_RES, log_count);
  233. /*
  234. * Re-attach the quota info that we detached from prev trx.
  235. */
  236. if (dqinfo) {
  237. tp->t_dqinfo = dqinfo;
  238. tp->t_flags |= tflags;
  239. }
  240. if (code) {
  241. xfs_buf_relse(ialloc_context);
  242. *tpp = ntp;
  243. *ipp = NULL;
  244. return code;
  245. }
  246. xfs_trans_bjoin(tp, ialloc_context);
  247. /*
  248. * Call ialloc again. Since we've locked out all
  249. * other allocations in this allocation group,
  250. * this call should always succeed.
  251. */
  252. code = xfs_ialloc(tp, dp, mode, nlink, rdev, credp, prid,
  253. okalloc, &ialloc_context, &call_again, &ip);
  254. /*
  255. * If we get an error at this point, return to the caller
  256. * so that the current transaction can be aborted.
  257. */
  258. if (code) {
  259. *tpp = tp;
  260. *ipp = NULL;
  261. return code;
  262. }
  263. ASSERT ((!call_again) && (ip != NULL));
  264. } else {
  265. if (committed != NULL) {
  266. *committed = 0;
  267. }
  268. }
  269. *ipp = ip;
  270. *tpp = tp;
  271. return 0;
  272. }
  273. /*
  274. * Decrement the link count on an inode & log the change.
  275. * If this causes the link count to go to zero, initiate the
  276. * logging activity required to truncate a file.
  277. */
  278. int /* error */
  279. xfs_droplink(
  280. xfs_trans_t *tp,
  281. xfs_inode_t *ip)
  282. {
  283. int error;
  284. xfs_ichgtime(ip, XFS_ICHGTIME_CHG);
  285. ASSERT (ip->i_d.di_nlink > 0);
  286. ip->i_d.di_nlink--;
  287. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  288. error = 0;
  289. if (ip->i_d.di_nlink == 0) {
  290. /*
  291. * We're dropping the last link to this file.
  292. * Move the on-disk inode to the AGI unlinked list.
  293. * From xfs_inactive() we will pull the inode from
  294. * the list and free it.
  295. */
  296. error = xfs_iunlink(tp, ip);
  297. }
  298. return error;
  299. }
  300. /*
  301. * This gets called when the inode's version needs to be changed from 1 to 2.
  302. * Currently this happens when the nlink field overflows the old 16-bit value
  303. * or when chproj is called to change the project for the first time.
  304. * As a side effect the superblock version will also get rev'd
  305. * to contain the NLINK bit.
  306. */
  307. void
  308. xfs_bump_ino_vers2(
  309. xfs_trans_t *tp,
  310. xfs_inode_t *ip)
  311. {
  312. xfs_mount_t *mp;
  313. unsigned long s;
  314. ASSERT(ismrlocked (&ip->i_lock, MR_UPDATE));
  315. ASSERT(ip->i_d.di_version == XFS_DINODE_VERSION_1);
  316. ip->i_d.di_version = XFS_DINODE_VERSION_2;
  317. ip->i_d.di_onlink = 0;
  318. memset(&(ip->i_d.di_pad[0]), 0, sizeof(ip->i_d.di_pad));
  319. mp = tp->t_mountp;
  320. if (!XFS_SB_VERSION_HASNLINK(&mp->m_sb)) {
  321. s = XFS_SB_LOCK(mp);
  322. if (!XFS_SB_VERSION_HASNLINK(&mp->m_sb)) {
  323. XFS_SB_VERSION_ADDNLINK(&mp->m_sb);
  324. XFS_SB_UNLOCK(mp, s);
  325. xfs_mod_sb(tp, XFS_SB_VERSIONNUM);
  326. } else {
  327. XFS_SB_UNLOCK(mp, s);
  328. }
  329. }
  330. /* Caller must log the inode */
  331. }
  332. /*
  333. * Increment the link count on an inode & log the change.
  334. */
  335. int
  336. xfs_bumplink(
  337. xfs_trans_t *tp,
  338. xfs_inode_t *ip)
  339. {
  340. if (ip->i_d.di_nlink >= XFS_MAXLINK)
  341. return XFS_ERROR(EMLINK);
  342. xfs_ichgtime(ip, XFS_ICHGTIME_CHG);
  343. ASSERT(ip->i_d.di_nlink > 0);
  344. ip->i_d.di_nlink++;
  345. if ((ip->i_d.di_version == XFS_DINODE_VERSION_1) &&
  346. (ip->i_d.di_nlink > XFS_MAXLINK_1)) {
  347. /*
  348. * The inode has increased its number of links beyond
  349. * what can fit in an old format inode. It now needs
  350. * to be converted to a version 2 inode with a 32 bit
  351. * link count. If this is the first inode in the file
  352. * system to do this, then we need to bump the superblock
  353. * version number as well.
  354. */
  355. xfs_bump_ino_vers2(tp, ip);
  356. }
  357. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  358. return 0;
  359. }
  360. /*
  361. * Try to truncate the given file to 0 length. Currently called
  362. * only out of xfs_remove when it has to truncate a file to free
  363. * up space for the remove to proceed.
  364. */
  365. int
  366. xfs_truncate_file(
  367. xfs_mount_t *mp,
  368. xfs_inode_t *ip)
  369. {
  370. xfs_trans_t *tp;
  371. int error;
  372. #ifdef QUOTADEBUG
  373. /*
  374. * This is called to truncate the quotainodes too.
  375. */
  376. if (XFS_IS_UQUOTA_ON(mp)) {
  377. if (ip->i_ino != mp->m_sb.sb_uquotino)
  378. ASSERT(ip->i_udquot);
  379. }
  380. if (XFS_IS_OQUOTA_ON(mp)) {
  381. if (ip->i_ino != mp->m_sb.sb_gquotino)
  382. ASSERT(ip->i_gdquot);
  383. }
  384. #endif
  385. /*
  386. * Make the call to xfs_itruncate_start before starting the
  387. * transaction, because we cannot make the call while we're
  388. * in a transaction.
  389. */
  390. xfs_ilock(ip, XFS_IOLOCK_EXCL);
  391. xfs_itruncate_start(ip, XFS_ITRUNC_DEFINITE, (xfs_fsize_t)0);
  392. tp = xfs_trans_alloc(mp, XFS_TRANS_TRUNCATE_FILE);
  393. if ((error = xfs_trans_reserve(tp, 0, XFS_ITRUNCATE_LOG_RES(mp), 0,
  394. XFS_TRANS_PERM_LOG_RES,
  395. XFS_ITRUNCATE_LOG_COUNT))) {
  396. xfs_trans_cancel(tp, 0);
  397. xfs_iunlock(ip, XFS_IOLOCK_EXCL);
  398. return error;
  399. }
  400. /*
  401. * Follow the normal truncate locking protocol. Since we
  402. * hold the inode in the transaction, we know that it's number
  403. * of references will stay constant.
  404. */
  405. xfs_ilock(ip, XFS_ILOCK_EXCL);
  406. xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
  407. xfs_trans_ihold(tp, ip);
  408. /*
  409. * Signal a sync xaction. The only case where that isn't
  410. * the case is if we're truncating an already unlinked file
  411. * on a wsync fs. In that case, we know the blocks can't
  412. * reappear in the file because the links to file are
  413. * permanently toast. Currently, we're always going to
  414. * want a sync transaction because this code is being
  415. * called from places where nlink is guaranteed to be 1
  416. * but I'm leaving the tests in to protect against future
  417. * changes -- rcc.
  418. */
  419. error = xfs_itruncate_finish(&tp, ip, (xfs_fsize_t)0,
  420. XFS_DATA_FORK,
  421. ((ip->i_d.di_nlink != 0 ||
  422. !(mp->m_flags & XFS_MOUNT_WSYNC))
  423. ? 1 : 0));
  424. if (error) {
  425. xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES |
  426. XFS_TRANS_ABORT);
  427. } else {
  428. xfs_ichgtime(ip, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  429. error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES,
  430. NULL);
  431. }
  432. xfs_iunlock(ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
  433. return error;
  434. }