xfs_rename.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427
  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. * Watch out for duplicate entries in the table.
  59. */
  60. if (i_tab[i] != i_tab[i-1])
  61. xfs_iunlock(i_tab[i], lock_mode);
  62. }
  63. }
  64. /*
  65. * Enter all inodes for a rename transaction into a sorted array.
  66. */
  67. STATIC void
  68. xfs_sort_for_rename(
  69. xfs_inode_t *dp1, /* in: old (source) directory inode */
  70. xfs_inode_t *dp2, /* in: new (target) directory inode */
  71. xfs_inode_t *ip1, /* in: inode of old entry */
  72. xfs_inode_t *ip2, /* in: inode of new entry, if it
  73. already exists, NULL otherwise. */
  74. xfs_inode_t **i_tab,/* out: array of inode returned, sorted */
  75. int *num_inodes) /* out: number of inodes in array */
  76. {
  77. xfs_inode_t *temp;
  78. int i, j;
  79. /*
  80. * i_tab contains a list of pointers to inodes. We initialize
  81. * the table here & we'll sort it. We will then use it to
  82. * order the acquisition of the inode locks.
  83. *
  84. * Note that the table may contain duplicates. e.g., dp1 == dp2.
  85. */
  86. i_tab[0] = dp1;
  87. i_tab[1] = dp2;
  88. i_tab[2] = ip1;
  89. if (ip2) {
  90. *num_inodes = 4;
  91. i_tab[3] = ip2;
  92. } else {
  93. *num_inodes = 3;
  94. i_tab[3] = NULL;
  95. }
  96. /*
  97. * Sort the elements via bubble sort. (Remember, there are at
  98. * most 4 elements to sort, so this is adequate.)
  99. */
  100. for (i = 0; i < *num_inodes; i++) {
  101. for (j = 1; j < *num_inodes; j++) {
  102. if (i_tab[j]->i_ino < i_tab[j-1]->i_ino) {
  103. temp = i_tab[j];
  104. i_tab[j] = i_tab[j-1];
  105. i_tab[j-1] = temp;
  106. }
  107. }
  108. }
  109. }
  110. /*
  111. * xfs_rename
  112. */
  113. int
  114. xfs_rename(
  115. xfs_inode_t *src_dp,
  116. struct xfs_name *src_name,
  117. xfs_inode_t *src_ip,
  118. xfs_inode_t *target_dp,
  119. struct xfs_name *target_name,
  120. xfs_inode_t *target_ip)
  121. {
  122. xfs_trans_t *tp = NULL;
  123. xfs_mount_t *mp = src_dp->i_mount;
  124. int new_parent; /* moving to a new dir */
  125. int src_is_directory; /* src_name is a directory */
  126. int error;
  127. xfs_bmap_free_t free_list;
  128. xfs_fsblock_t first_block;
  129. int cancel_flags;
  130. int committed;
  131. xfs_inode_t *inodes[4];
  132. int spaceres;
  133. int num_inodes;
  134. xfs_itrace_entry(src_dp);
  135. xfs_itrace_entry(target_dp);
  136. if (DM_EVENT_ENABLED(src_dp, DM_EVENT_RENAME) ||
  137. DM_EVENT_ENABLED(target_dp, DM_EVENT_RENAME)) {
  138. error = XFS_SEND_NAMESP(mp, DM_EVENT_RENAME,
  139. src_dp, DM_RIGHT_NULL,
  140. target_dp, DM_RIGHT_NULL,
  141. src_name->name, target_name->name,
  142. 0, 0, 0);
  143. if (error)
  144. return error;
  145. }
  146. /* Return through std_return after this point. */
  147. new_parent = (src_dp != target_dp);
  148. src_is_directory = ((src_ip->i_d.di_mode & S_IFMT) == S_IFDIR);
  149. if (src_is_directory) {
  150. /*
  151. * Check for link count overflow on target_dp
  152. */
  153. if (target_ip == NULL && new_parent &&
  154. target_dp->i_d.di_nlink >= XFS_MAXLINK) {
  155. error = XFS_ERROR(EMLINK);
  156. goto std_return;
  157. }
  158. }
  159. xfs_sort_for_rename(src_dp, target_dp, src_ip, target_ip,
  160. inodes, &num_inodes);
  161. XFS_BMAP_INIT(&free_list, &first_block);
  162. tp = xfs_trans_alloc(mp, XFS_TRANS_RENAME);
  163. cancel_flags = XFS_TRANS_RELEASE_LOG_RES;
  164. spaceres = XFS_RENAME_SPACE_RES(mp, target_name->len);
  165. error = xfs_trans_reserve(tp, spaceres, XFS_RENAME_LOG_RES(mp), 0,
  166. XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
  167. if (error == ENOSPC) {
  168. spaceres = 0;
  169. error = xfs_trans_reserve(tp, 0, XFS_RENAME_LOG_RES(mp), 0,
  170. XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
  171. }
  172. if (error) {
  173. xfs_trans_cancel(tp, 0);
  174. goto std_return;
  175. }
  176. /*
  177. * Attach the dquots to the inodes
  178. */
  179. if ((error = XFS_QM_DQVOPRENAME(mp, inodes))) {
  180. xfs_trans_cancel(tp, cancel_flags);
  181. goto std_return;
  182. }
  183. /*
  184. * Lock all the participating inodes. Depending upon whether
  185. * the target_name exists in the target directory, and
  186. * whether the target directory is the same as the source
  187. * directory, we can lock from 2 to 4 inodes.
  188. */
  189. xfs_lock_inodes(inodes, num_inodes, XFS_ILOCK_EXCL);
  190. /*
  191. * If we are using project inheritance, we only allow renames
  192. * into our tree when the project IDs are the same; else the
  193. * tree quota mechanism would be circumvented.
  194. */
  195. if (unlikely((target_dp->i_d.di_flags & XFS_DIFLAG_PROJINHERIT) &&
  196. (target_dp->i_d.di_projid != src_ip->i_d.di_projid))) {
  197. error = XFS_ERROR(EXDEV);
  198. xfs_rename_unlock4(inodes, XFS_ILOCK_SHARED);
  199. xfs_trans_cancel(tp, cancel_flags);
  200. goto std_return;
  201. }
  202. /*
  203. * Join all the inodes to the transaction. From this point on,
  204. * we can rely on either trans_commit or trans_cancel to unlock
  205. * them. Note that we need to add a vnode reference to the
  206. * directories since trans_commit & trans_cancel will decrement
  207. * them when they unlock the inodes. Also, we need to be careful
  208. * not to add an inode to the transaction more than once.
  209. */
  210. IHOLD(src_dp);
  211. xfs_trans_ijoin(tp, src_dp, XFS_ILOCK_EXCL);
  212. if (new_parent) {
  213. IHOLD(target_dp);
  214. xfs_trans_ijoin(tp, target_dp, XFS_ILOCK_EXCL);
  215. }
  216. IHOLD(src_ip);
  217. xfs_trans_ijoin(tp, src_ip, XFS_ILOCK_EXCL);
  218. if (target_ip) {
  219. IHOLD(target_ip);
  220. xfs_trans_ijoin(tp, target_ip, XFS_ILOCK_EXCL);
  221. }
  222. /*
  223. * Set up the target.
  224. */
  225. if (target_ip == NULL) {
  226. /*
  227. * If there's no space reservation, check the entry will
  228. * fit before actually inserting it.
  229. */
  230. error = xfs_dir_canenter(tp, target_dp, target_name, spaceres);
  231. if (error)
  232. goto error_return;
  233. /*
  234. * If target does not exist and the rename crosses
  235. * directories, adjust the target directory link count
  236. * to account for the ".." reference from the new entry.
  237. */
  238. error = xfs_dir_createname(tp, target_dp, target_name,
  239. src_ip->i_ino, &first_block,
  240. &free_list, spaceres);
  241. if (error == ENOSPC)
  242. goto error_return;
  243. if (error)
  244. goto abort_return;
  245. xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  246. if (new_parent && src_is_directory) {
  247. error = xfs_bumplink(tp, target_dp);
  248. if (error)
  249. goto abort_return;
  250. }
  251. } else { /* target_ip != NULL */
  252. /*
  253. * If target exists and it's a directory, check that both
  254. * target and source are directories and that target can be
  255. * destroyed, or that neither is a directory.
  256. */
  257. if ((target_ip->i_d.di_mode & S_IFMT) == S_IFDIR) {
  258. /*
  259. * Make sure target dir is empty.
  260. */
  261. if (!(xfs_dir_isempty(target_ip)) ||
  262. (target_ip->i_d.di_nlink > 2)) {
  263. error = XFS_ERROR(EEXIST);
  264. goto error_return;
  265. }
  266. }
  267. /*
  268. * Link the source inode under the target name.
  269. * If the source inode is a directory and we are moving
  270. * it across directories, its ".." entry will be
  271. * inconsistent until we replace that down below.
  272. *
  273. * In case there is already an entry with the same
  274. * name at the destination directory, remove it first.
  275. */
  276. error = xfs_dir_replace(tp, target_dp, target_name,
  277. src_ip->i_ino,
  278. &first_block, &free_list, spaceres);
  279. if (error)
  280. goto abort_return;
  281. xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  282. /*
  283. * Decrement the link count on the target since the target
  284. * dir no longer points to it.
  285. */
  286. error = xfs_droplink(tp, target_ip);
  287. if (error)
  288. goto abort_return;
  289. if (src_is_directory) {
  290. /*
  291. * Drop the link from the old "." entry.
  292. */
  293. error = xfs_droplink(tp, target_ip);
  294. if (error)
  295. goto abort_return;
  296. }
  297. } /* target_ip != NULL */
  298. /*
  299. * Remove the source.
  300. */
  301. if (new_parent && src_is_directory) {
  302. /*
  303. * Rewrite the ".." entry to point to the new
  304. * directory.
  305. */
  306. error = xfs_dir_replace(tp, src_ip, &xfs_name_dotdot,
  307. target_dp->i_ino,
  308. &first_block, &free_list, spaceres);
  309. ASSERT(error != EEXIST);
  310. if (error)
  311. goto abort_return;
  312. }
  313. /*
  314. * We always want to hit the ctime on the source inode.
  315. *
  316. * This isn't strictly required by the standards since the source
  317. * inode isn't really being changed, but old unix file systems did
  318. * it and some incremental backup programs won't work without it.
  319. */
  320. xfs_ichgtime(src_ip, XFS_ICHGTIME_CHG);
  321. /*
  322. * Adjust the link count on src_dp. This is necessary when
  323. * renaming a directory, either within one parent when
  324. * the target existed, or across two parent directories.
  325. */
  326. if (src_is_directory && (new_parent || target_ip != NULL)) {
  327. /*
  328. * Decrement link count on src_directory since the
  329. * entry that's moved no longer points to it.
  330. */
  331. error = xfs_droplink(tp, src_dp);
  332. if (error)
  333. goto abort_return;
  334. }
  335. error = xfs_dir_removename(tp, src_dp, src_name, src_ip->i_ino,
  336. &first_block, &free_list, spaceres);
  337. if (error)
  338. goto abort_return;
  339. xfs_ichgtime(src_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  340. /*
  341. * Update the generation counts on all the directory inodes
  342. * that we're modifying.
  343. */
  344. src_dp->i_gen++;
  345. xfs_trans_log_inode(tp, src_dp, XFS_ILOG_CORE);
  346. if (new_parent) {
  347. target_dp->i_gen++;
  348. xfs_trans_log_inode(tp, target_dp, XFS_ILOG_CORE);
  349. }
  350. /*
  351. * If this is a synchronous mount, make sure that the
  352. * rename transaction goes to disk before returning to
  353. * the user.
  354. */
  355. if (mp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC)) {
  356. xfs_trans_set_sync(tp);
  357. }
  358. error = xfs_bmap_finish(&tp, &free_list, &committed);
  359. if (error) {
  360. xfs_bmap_cancel(&free_list);
  361. xfs_trans_cancel(tp, (XFS_TRANS_RELEASE_LOG_RES |
  362. XFS_TRANS_ABORT));
  363. goto std_return;
  364. }
  365. /*
  366. * trans_commit will unlock src_ip, target_ip & decrement
  367. * the vnode references.
  368. */
  369. error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
  370. /* Fall through to std_return with error = 0 or errno from
  371. * xfs_trans_commit */
  372. std_return:
  373. if (DM_EVENT_ENABLED(src_dp, DM_EVENT_POSTRENAME) ||
  374. DM_EVENT_ENABLED(target_dp, DM_EVENT_POSTRENAME)) {
  375. (void) XFS_SEND_NAMESP (mp, DM_EVENT_POSTRENAME,
  376. src_dp, DM_RIGHT_NULL,
  377. target_dp, DM_RIGHT_NULL,
  378. src_name->name, target_name->name,
  379. 0, error, 0);
  380. }
  381. return error;
  382. abort_return:
  383. cancel_flags |= XFS_TRANS_ABORT;
  384. /* FALLTHROUGH */
  385. error_return:
  386. xfs_bmap_cancel(&free_list);
  387. xfs_trans_cancel(tp, cancel_flags);
  388. goto std_return;
  389. }