xfs_rename.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605
  1. /*
  2. * Copyright (c) 2000-2003,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_log.h"
  22. #include "xfs_inum.h"
  23. #include "xfs_trans.h"
  24. #include "xfs_sb.h"
  25. #include "xfs_ag.h"
  26. #include "xfs_dir2.h"
  27. #include "xfs_dmapi.h"
  28. #include "xfs_mount.h"
  29. #include "xfs_da_btree.h"
  30. #include "xfs_bmap_btree.h"
  31. #include "xfs_dir2_sf.h"
  32. #include "xfs_attr_sf.h"
  33. #include "xfs_dinode.h"
  34. #include "xfs_inode.h"
  35. #include "xfs_inode_item.h"
  36. #include "xfs_bmap.h"
  37. #include "xfs_error.h"
  38. #include "xfs_quota.h"
  39. #include "xfs_utils.h"
  40. #include "xfs_trans_space.h"
  41. #include "xfs_vnodeops.h"
  42. /*
  43. * Given an array of up to 4 inode pointers, unlock the pointed to inodes.
  44. * If there are fewer than 4 entries in the array, the empty entries will
  45. * be at the end and will have NULL pointers in them.
  46. */
  47. STATIC void
  48. xfs_rename_unlock4(
  49. xfs_inode_t **i_tab,
  50. uint lock_mode)
  51. {
  52. int i;
  53. xfs_iunlock(i_tab[0], lock_mode);
  54. for (i = 1; i < 4; i++) {
  55. if (i_tab[i] == NULL) {
  56. break;
  57. }
  58. /*
  59. * Watch out for duplicate entries in the table.
  60. */
  61. if (i_tab[i] != i_tab[i-1]) {
  62. xfs_iunlock(i_tab[i], lock_mode);
  63. }
  64. }
  65. }
  66. #ifdef DEBUG
  67. int xfs_rename_skip, xfs_rename_nskip;
  68. #endif
  69. /*
  70. * The following routine will acquire the locks required for a rename
  71. * operation. The code understands the semantics of renames and will
  72. * validate that name1 exists under dp1 & that name2 may or may not
  73. * exist under dp2.
  74. *
  75. * We are renaming dp1/name1 to dp2/name2.
  76. *
  77. * Return ENOENT if dp1 does not exist, other lookup errors, or 0 for success.
  78. */
  79. STATIC int
  80. xfs_lock_for_rename(
  81. xfs_inode_t *dp1, /* old (source) directory inode */
  82. xfs_inode_t *dp2, /* new (target) directory inode */
  83. bhv_vname_t *vname1,/* old entry name */
  84. bhv_vname_t *vname2,/* new entry name */
  85. xfs_inode_t **ipp1, /* inode of old entry */
  86. xfs_inode_t **ipp2, /* inode of new entry, if it
  87. already exists, NULL otherwise. */
  88. xfs_inode_t **i_tab,/* array of inode returned, sorted */
  89. int *num_inodes) /* number of inodes in array */
  90. {
  91. xfs_inode_t *ip1 = VNAME_TO_INODE(vname1);
  92. xfs_inode_t *ip2, *temp;
  93. xfs_ino_t inum1, inum2;
  94. int error;
  95. int i, j;
  96. uint lock_mode;
  97. int diff_dirs = (dp1 != dp2);
  98. ip2 = NULL;
  99. /*
  100. * First, find out the current inums of the entries so that we
  101. * can determine the initial locking order. We'll have to
  102. * sanity check stuff after all the locks have been acquired
  103. * to see if we still have the right inodes, directories, etc.
  104. */
  105. lock_mode = xfs_ilock_map_shared(dp1);
  106. IHOLD(ip1);
  107. xfs_itrace_ref(ip1);
  108. inum1 = ip1->i_ino;
  109. /*
  110. * Unlock dp1 and lock dp2 if they are different.
  111. */
  112. if (diff_dirs) {
  113. xfs_iunlock_map_shared(dp1, lock_mode);
  114. lock_mode = xfs_ilock_map_shared(dp2);
  115. }
  116. error = xfs_dir_lookup_int(dp2, lock_mode, vname2, &inum2, &ip2);
  117. if (error == ENOENT) { /* target does not need to exist. */
  118. inum2 = 0;
  119. } else if (error) {
  120. /*
  121. * If dp2 and dp1 are the same, the next line unlocks dp1.
  122. * Got it?
  123. */
  124. xfs_iunlock_map_shared(dp2, lock_mode);
  125. IRELE (ip1);
  126. return error;
  127. } else {
  128. xfs_itrace_ref(ip2);
  129. }
  130. /*
  131. * i_tab contains a list of pointers to inodes. We initialize
  132. * the table here & we'll sort it. We will then use it to
  133. * order the acquisition of the inode locks.
  134. *
  135. * Note that the table may contain duplicates. e.g., dp1 == dp2.
  136. */
  137. i_tab[0] = dp1;
  138. i_tab[1] = dp2;
  139. i_tab[2] = ip1;
  140. if (inum2 == 0) {
  141. *num_inodes = 3;
  142. i_tab[3] = NULL;
  143. } else {
  144. *num_inodes = 4;
  145. i_tab[3] = ip2;
  146. }
  147. /*
  148. * Sort the elements via bubble sort. (Remember, there are at
  149. * most 4 elements to sort, so this is adequate.)
  150. */
  151. for (i=0; i < *num_inodes; i++) {
  152. for (j=1; j < *num_inodes; j++) {
  153. if (i_tab[j]->i_ino < i_tab[j-1]->i_ino) {
  154. temp = i_tab[j];
  155. i_tab[j] = i_tab[j-1];
  156. i_tab[j-1] = temp;
  157. }
  158. }
  159. }
  160. /*
  161. * We have dp2 locked. If it isn't first, unlock it.
  162. * If it is first, tell xfs_lock_inodes so it can skip it
  163. * when locking. if dp1 == dp2, xfs_lock_inodes will skip both
  164. * since they are equal. xfs_lock_inodes needs all these inodes
  165. * so that it can unlock and retry if there might be a dead-lock
  166. * potential with the log.
  167. */
  168. if (i_tab[0] == dp2 && lock_mode == XFS_ILOCK_SHARED) {
  169. #ifdef DEBUG
  170. xfs_rename_skip++;
  171. #endif
  172. xfs_lock_inodes(i_tab, *num_inodes, 1, XFS_ILOCK_SHARED);
  173. } else {
  174. #ifdef DEBUG
  175. xfs_rename_nskip++;
  176. #endif
  177. xfs_iunlock_map_shared(dp2, lock_mode);
  178. xfs_lock_inodes(i_tab, *num_inodes, 0, XFS_ILOCK_SHARED);
  179. }
  180. /*
  181. * Set the return value. Null out any unused entries in i_tab.
  182. */
  183. *ipp1 = *ipp2 = NULL;
  184. for (i=0; i < *num_inodes; i++) {
  185. if (i_tab[i]->i_ino == inum1) {
  186. *ipp1 = i_tab[i];
  187. }
  188. if (i_tab[i]->i_ino == inum2) {
  189. *ipp2 = i_tab[i];
  190. }
  191. }
  192. for (;i < 4; i++) {
  193. i_tab[i] = NULL;
  194. }
  195. return 0;
  196. }
  197. /*
  198. * xfs_rename
  199. */
  200. int
  201. xfs_rename(
  202. xfs_inode_t *src_dp,
  203. bhv_vname_t *src_vname,
  204. xfs_inode_t *target_dp,
  205. bhv_vname_t *target_vname)
  206. {
  207. xfs_trans_t *tp;
  208. xfs_inode_t *src_ip, *target_ip;
  209. xfs_mount_t *mp = src_dp->i_mount;
  210. int new_parent; /* moving to a new dir */
  211. int src_is_directory; /* src_name is a directory */
  212. int error;
  213. xfs_bmap_free_t free_list;
  214. xfs_fsblock_t first_block;
  215. int cancel_flags;
  216. int committed;
  217. xfs_inode_t *inodes[4];
  218. int target_ip_dropped = 0; /* dropped target_ip link? */
  219. int spaceres;
  220. int target_link_zero = 0;
  221. int num_inodes;
  222. char *src_name = VNAME(src_vname);
  223. char *target_name = VNAME(target_vname);
  224. int src_namelen = VNAMELEN(src_vname);
  225. int target_namelen = VNAMELEN(target_vname);
  226. xfs_itrace_entry(src_dp);
  227. xfs_itrace_entry(target_dp);
  228. if (DM_EVENT_ENABLED(src_dp, DM_EVENT_RENAME) ||
  229. DM_EVENT_ENABLED(target_dp, DM_EVENT_RENAME)) {
  230. error = XFS_SEND_NAMESP(mp, DM_EVENT_RENAME,
  231. src_dp, DM_RIGHT_NULL,
  232. target_dp, DM_RIGHT_NULL,
  233. src_name, target_name,
  234. 0, 0, 0);
  235. if (error) {
  236. return error;
  237. }
  238. }
  239. /* Return through std_return after this point. */
  240. /*
  241. * Lock all the participating inodes. Depending upon whether
  242. * the target_name exists in the target directory, and
  243. * whether the target directory is the same as the source
  244. * directory, we can lock from 2 to 4 inodes.
  245. * xfs_lock_for_rename() will return ENOENT if src_name
  246. * does not exist in the source directory.
  247. */
  248. tp = NULL;
  249. error = xfs_lock_for_rename(src_dp, target_dp, src_vname,
  250. target_vname, &src_ip, &target_ip, inodes,
  251. &num_inodes);
  252. if (error) {
  253. /*
  254. * We have nothing locked, no inode references, and
  255. * no transaction, so just get out.
  256. */
  257. goto std_return;
  258. }
  259. ASSERT(src_ip != NULL);
  260. if ((src_ip->i_d.di_mode & S_IFMT) == S_IFDIR) {
  261. /*
  262. * Check for link count overflow on target_dp
  263. */
  264. if (target_ip == NULL && (src_dp != target_dp) &&
  265. target_dp->i_d.di_nlink >= XFS_MAXLINK) {
  266. error = XFS_ERROR(EMLINK);
  267. xfs_rename_unlock4(inodes, XFS_ILOCK_SHARED);
  268. goto rele_return;
  269. }
  270. }
  271. /*
  272. * If we are using project inheritance, we only allow renames
  273. * into our tree when the project IDs are the same; else the
  274. * tree quota mechanism would be circumvented.
  275. */
  276. if (unlikely((target_dp->i_d.di_flags & XFS_DIFLAG_PROJINHERIT) &&
  277. (target_dp->i_d.di_projid != src_ip->i_d.di_projid))) {
  278. error = XFS_ERROR(EXDEV);
  279. xfs_rename_unlock4(inodes, XFS_ILOCK_SHARED);
  280. goto rele_return;
  281. }
  282. new_parent = (src_dp != target_dp);
  283. src_is_directory = ((src_ip->i_d.di_mode & S_IFMT) == S_IFDIR);
  284. /*
  285. * Drop the locks on our inodes so that we can start the transaction.
  286. */
  287. xfs_rename_unlock4(inodes, XFS_ILOCK_SHARED);
  288. XFS_BMAP_INIT(&free_list, &first_block);
  289. tp = xfs_trans_alloc(mp, XFS_TRANS_RENAME);
  290. cancel_flags = XFS_TRANS_RELEASE_LOG_RES;
  291. spaceres = XFS_RENAME_SPACE_RES(mp, target_namelen);
  292. error = xfs_trans_reserve(tp, spaceres, XFS_RENAME_LOG_RES(mp), 0,
  293. XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
  294. if (error == ENOSPC) {
  295. spaceres = 0;
  296. error = xfs_trans_reserve(tp, 0, XFS_RENAME_LOG_RES(mp), 0,
  297. XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
  298. }
  299. if (error) {
  300. xfs_trans_cancel(tp, 0);
  301. goto rele_return;
  302. }
  303. /*
  304. * Attach the dquots to the inodes
  305. */
  306. if ((error = XFS_QM_DQVOPRENAME(mp, inodes))) {
  307. xfs_trans_cancel(tp, cancel_flags);
  308. goto rele_return;
  309. }
  310. /*
  311. * Reacquire the inode locks we dropped above.
  312. */
  313. xfs_lock_inodes(inodes, num_inodes, 0, XFS_ILOCK_EXCL);
  314. /*
  315. * Join all the inodes to the transaction. From this point on,
  316. * we can rely on either trans_commit or trans_cancel to unlock
  317. * them. Note that we need to add a vnode reference to the
  318. * directories since trans_commit & trans_cancel will decrement
  319. * them when they unlock the inodes. Also, we need to be careful
  320. * not to add an inode to the transaction more than once.
  321. */
  322. IHOLD(src_dp);
  323. xfs_trans_ijoin(tp, src_dp, XFS_ILOCK_EXCL);
  324. if (new_parent) {
  325. IHOLD(target_dp);
  326. xfs_trans_ijoin(tp, target_dp, XFS_ILOCK_EXCL);
  327. }
  328. if ((src_ip != src_dp) && (src_ip != target_dp)) {
  329. xfs_trans_ijoin(tp, src_ip, XFS_ILOCK_EXCL);
  330. }
  331. if ((target_ip != NULL) &&
  332. (target_ip != src_ip) &&
  333. (target_ip != src_dp) &&
  334. (target_ip != target_dp)) {
  335. xfs_trans_ijoin(tp, target_ip, XFS_ILOCK_EXCL);
  336. }
  337. /*
  338. * Set up the target.
  339. */
  340. if (target_ip == NULL) {
  341. /*
  342. * If there's no space reservation, check the entry will
  343. * fit before actually inserting it.
  344. */
  345. if (spaceres == 0 &&
  346. (error = xfs_dir_canenter(tp, target_dp, target_name,
  347. target_namelen)))
  348. goto error_return;
  349. /*
  350. * If target does not exist and the rename crosses
  351. * directories, adjust the target directory link count
  352. * to account for the ".." reference from the new entry.
  353. */
  354. error = xfs_dir_createname(tp, target_dp, target_name,
  355. target_namelen, src_ip->i_ino,
  356. &first_block, &free_list, spaceres);
  357. if (error == ENOSPC)
  358. goto error_return;
  359. if (error)
  360. goto abort_return;
  361. xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  362. if (new_parent && src_is_directory) {
  363. error = xfs_bumplink(tp, target_dp);
  364. if (error)
  365. goto abort_return;
  366. }
  367. } else { /* target_ip != NULL */
  368. /*
  369. * If target exists and it's a directory, check that both
  370. * target and source are directories and that target can be
  371. * destroyed, or that neither is a directory.
  372. */
  373. if ((target_ip->i_d.di_mode & S_IFMT) == S_IFDIR) {
  374. /*
  375. * Make sure target dir is empty.
  376. */
  377. if (!(xfs_dir_isempty(target_ip)) ||
  378. (target_ip->i_d.di_nlink > 2)) {
  379. error = XFS_ERROR(EEXIST);
  380. goto error_return;
  381. }
  382. }
  383. /*
  384. * Link the source inode under the target name.
  385. * If the source inode is a directory and we are moving
  386. * it across directories, its ".." entry will be
  387. * inconsistent until we replace that down below.
  388. *
  389. * In case there is already an entry with the same
  390. * name at the destination directory, remove it first.
  391. */
  392. error = xfs_dir_replace(tp, target_dp, target_name,
  393. target_namelen, src_ip->i_ino,
  394. &first_block, &free_list, spaceres);
  395. if (error)
  396. goto abort_return;
  397. xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  398. /*
  399. * Decrement the link count on the target since the target
  400. * dir no longer points to it.
  401. */
  402. error = xfs_droplink(tp, target_ip);
  403. if (error)
  404. goto abort_return;
  405. target_ip_dropped = 1;
  406. if (src_is_directory) {
  407. /*
  408. * Drop the link from the old "." entry.
  409. */
  410. error = xfs_droplink(tp, target_ip);
  411. if (error)
  412. goto abort_return;
  413. }
  414. /* Do this test while we still hold the locks */
  415. target_link_zero = (target_ip)->i_d.di_nlink==0;
  416. } /* target_ip != NULL */
  417. /*
  418. * Remove the source.
  419. */
  420. if (new_parent && src_is_directory) {
  421. /*
  422. * Rewrite the ".." entry to point to the new
  423. * directory.
  424. */
  425. error = xfs_dir_replace(tp, src_ip, "..", 2, target_dp->i_ino,
  426. &first_block, &free_list, spaceres);
  427. ASSERT(error != EEXIST);
  428. if (error)
  429. goto abort_return;
  430. xfs_ichgtime(src_ip, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  431. } else {
  432. /*
  433. * We always want to hit the ctime on the source inode.
  434. * We do it in the if clause above for the 'new_parent &&
  435. * src_is_directory' case, and here we get all the other
  436. * cases. This isn't strictly required by the standards
  437. * since the source inode isn't really being changed,
  438. * but old unix file systems did it and some incremental
  439. * backup programs won't work without it.
  440. */
  441. xfs_ichgtime(src_ip, XFS_ICHGTIME_CHG);
  442. }
  443. /*
  444. * Adjust the link count on src_dp. This is necessary when
  445. * renaming a directory, either within one parent when
  446. * the target existed, or across two parent directories.
  447. */
  448. if (src_is_directory && (new_parent || target_ip != NULL)) {
  449. /*
  450. * Decrement link count on src_directory since the
  451. * entry that's moved no longer points to it.
  452. */
  453. error = xfs_droplink(tp, src_dp);
  454. if (error)
  455. goto abort_return;
  456. }
  457. error = xfs_dir_removename(tp, src_dp, src_name, src_namelen,
  458. src_ip->i_ino, &first_block, &free_list, spaceres);
  459. if (error)
  460. goto abort_return;
  461. xfs_ichgtime(src_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  462. /*
  463. * Update the generation counts on all the directory inodes
  464. * that we're modifying.
  465. */
  466. src_dp->i_gen++;
  467. xfs_trans_log_inode(tp, src_dp, XFS_ILOG_CORE);
  468. if (new_parent) {
  469. target_dp->i_gen++;
  470. xfs_trans_log_inode(tp, target_dp, XFS_ILOG_CORE);
  471. }
  472. /*
  473. * If there was a target inode, take an extra reference on
  474. * it here so that it doesn't go to xfs_inactive() from
  475. * within the commit.
  476. */
  477. if (target_ip != NULL) {
  478. IHOLD(target_ip);
  479. }
  480. /*
  481. * If this is a synchronous mount, make sure that the
  482. * rename transaction goes to disk before returning to
  483. * the user.
  484. */
  485. if (mp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC)) {
  486. xfs_trans_set_sync(tp);
  487. }
  488. /*
  489. * Take refs. for vop_link_removed calls below. No need to worry
  490. * about directory refs. because the caller holds them.
  491. *
  492. * Do holds before the xfs_bmap_finish since it might rele them down
  493. * to zero.
  494. */
  495. if (target_ip_dropped)
  496. IHOLD(target_ip);
  497. IHOLD(src_ip);
  498. error = xfs_bmap_finish(&tp, &free_list, &committed);
  499. if (error) {
  500. xfs_bmap_cancel(&free_list);
  501. xfs_trans_cancel(tp, (XFS_TRANS_RELEASE_LOG_RES |
  502. XFS_TRANS_ABORT));
  503. if (target_ip != NULL) {
  504. IRELE(target_ip);
  505. }
  506. if (target_ip_dropped) {
  507. IRELE(target_ip);
  508. }
  509. IRELE(src_ip);
  510. goto std_return;
  511. }
  512. /*
  513. * trans_commit will unlock src_ip, target_ip & decrement
  514. * the vnode references.
  515. */
  516. error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
  517. if (target_ip != NULL)
  518. IRELE(target_ip);
  519. /*
  520. * Let interposed file systems know about removed links.
  521. */
  522. if (target_ip_dropped)
  523. IRELE(target_ip);
  524. IRELE(src_ip);
  525. /* Fall through to std_return with error = 0 or errno from
  526. * xfs_trans_commit */
  527. std_return:
  528. if (DM_EVENT_ENABLED(src_dp, DM_EVENT_POSTRENAME) ||
  529. DM_EVENT_ENABLED(target_dp, DM_EVENT_POSTRENAME)) {
  530. (void) XFS_SEND_NAMESP (mp, DM_EVENT_POSTRENAME,
  531. src_dp, DM_RIGHT_NULL,
  532. target_dp, DM_RIGHT_NULL,
  533. src_name, target_name,
  534. 0, error, 0);
  535. }
  536. return error;
  537. abort_return:
  538. cancel_flags |= XFS_TRANS_ABORT;
  539. /* FALLTHROUGH */
  540. error_return:
  541. xfs_bmap_cancel(&free_list);
  542. xfs_trans_cancel(tp, cancel_flags);
  543. goto std_return;
  544. rele_return:
  545. IRELE(src_ip);
  546. if (target_ip != NULL) {
  547. IRELE(target_ip);
  548. }
  549. goto std_return;
  550. }