xfs_utils.c 12 KB

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