xfs_rename.c 15 KB

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