xfs_rename.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354
  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_mount.h"
  28. #include "xfs_da_btree.h"
  29. #include "xfs_bmap_btree.h"
  30. #include "xfs_dinode.h"
  31. #include "xfs_inode.h"
  32. #include "xfs_inode_item.h"
  33. #include "xfs_bmap.h"
  34. #include "xfs_error.h"
  35. #include "xfs_quota.h"
  36. #include "xfs_utils.h"
  37. #include "xfs_trans_space.h"
  38. #include "xfs_vnodeops.h"
  39. #include "xfs_trace.h"
  40. /*
  41. * Enter all inodes for a rename transaction into a sorted array.
  42. */
  43. STATIC void
  44. xfs_sort_for_rename(
  45. xfs_inode_t *dp1, /* in: old (source) directory inode */
  46. xfs_inode_t *dp2, /* in: new (target) directory inode */
  47. xfs_inode_t *ip1, /* in: inode of old entry */
  48. xfs_inode_t *ip2, /* in: inode of new entry, if it
  49. already exists, NULL otherwise. */
  50. xfs_inode_t **i_tab,/* out: array of inode returned, sorted */
  51. int *num_inodes) /* out: number of inodes in array */
  52. {
  53. xfs_inode_t *temp;
  54. int i, j;
  55. /*
  56. * i_tab contains a list of pointers to inodes. We initialize
  57. * the table here & we'll sort it. We will then use it to
  58. * order the acquisition of the inode locks.
  59. *
  60. * Note that the table may contain duplicates. e.g., dp1 == dp2.
  61. */
  62. i_tab[0] = dp1;
  63. i_tab[1] = dp2;
  64. i_tab[2] = ip1;
  65. if (ip2) {
  66. *num_inodes = 4;
  67. i_tab[3] = ip2;
  68. } else {
  69. *num_inodes = 3;
  70. i_tab[3] = NULL;
  71. }
  72. /*
  73. * Sort the elements via bubble sort. (Remember, there are at
  74. * most 4 elements to sort, so this is adequate.)
  75. */
  76. for (i = 0; i < *num_inodes; i++) {
  77. for (j = 1; j < *num_inodes; j++) {
  78. if (i_tab[j]->i_ino < i_tab[j-1]->i_ino) {
  79. temp = i_tab[j];
  80. i_tab[j] = i_tab[j-1];
  81. i_tab[j-1] = temp;
  82. }
  83. }
  84. }
  85. }
  86. /*
  87. * xfs_rename
  88. */
  89. int
  90. xfs_rename(
  91. xfs_inode_t *src_dp,
  92. struct xfs_name *src_name,
  93. xfs_inode_t *src_ip,
  94. xfs_inode_t *target_dp,
  95. struct xfs_name *target_name,
  96. xfs_inode_t *target_ip)
  97. {
  98. xfs_trans_t *tp = NULL;
  99. xfs_mount_t *mp = src_dp->i_mount;
  100. int new_parent; /* moving to a new dir */
  101. int src_is_directory; /* src_name is a directory */
  102. int error;
  103. xfs_bmap_free_t free_list;
  104. xfs_fsblock_t first_block;
  105. int cancel_flags;
  106. int committed;
  107. xfs_inode_t *inodes[4];
  108. int spaceres;
  109. int num_inodes;
  110. xfs_itrace_entry(src_dp);
  111. xfs_itrace_entry(target_dp);
  112. new_parent = (src_dp != target_dp);
  113. src_is_directory = ((src_ip->i_d.di_mode & S_IFMT) == S_IFDIR);
  114. if (src_is_directory) {
  115. /*
  116. * Check for link count overflow on target_dp
  117. */
  118. if (target_ip == NULL && new_parent &&
  119. target_dp->i_d.di_nlink >= XFS_MAXLINK) {
  120. error = XFS_ERROR(EMLINK);
  121. goto std_return;
  122. }
  123. }
  124. xfs_sort_for_rename(src_dp, target_dp, src_ip, target_ip,
  125. inodes, &num_inodes);
  126. xfs_bmap_init(&free_list, &first_block);
  127. tp = xfs_trans_alloc(mp, XFS_TRANS_RENAME);
  128. cancel_flags = XFS_TRANS_RELEASE_LOG_RES;
  129. spaceres = XFS_RENAME_SPACE_RES(mp, target_name->len);
  130. error = xfs_trans_reserve(tp, spaceres, XFS_RENAME_LOG_RES(mp), 0,
  131. XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
  132. if (error == ENOSPC) {
  133. spaceres = 0;
  134. error = xfs_trans_reserve(tp, 0, XFS_RENAME_LOG_RES(mp), 0,
  135. XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
  136. }
  137. if (error) {
  138. xfs_trans_cancel(tp, 0);
  139. goto std_return;
  140. }
  141. /*
  142. * Attach the dquots to the inodes
  143. */
  144. error = xfs_qm_vop_rename_dqattach(inodes);
  145. if (error) {
  146. xfs_trans_cancel(tp, cancel_flags);
  147. goto std_return;
  148. }
  149. /*
  150. * Lock all the participating inodes. Depending upon whether
  151. * the target_name exists in the target directory, and
  152. * whether the target directory is the same as the source
  153. * directory, we can lock from 2 to 4 inodes.
  154. */
  155. xfs_lock_inodes(inodes, num_inodes, XFS_ILOCK_EXCL);
  156. /*
  157. * Join all the inodes to the transaction. From this point on,
  158. * we can rely on either trans_commit or trans_cancel to unlock
  159. * them.
  160. */
  161. xfs_trans_ijoin_ref(tp, src_dp, XFS_ILOCK_EXCL);
  162. if (new_parent)
  163. xfs_trans_ijoin_ref(tp, target_dp, XFS_ILOCK_EXCL);
  164. xfs_trans_ijoin_ref(tp, src_ip, XFS_ILOCK_EXCL);
  165. if (target_ip)
  166. xfs_trans_ijoin_ref(tp, target_ip, XFS_ILOCK_EXCL);
  167. /*
  168. * If we are using project inheritance, we only allow renames
  169. * into our tree when the project IDs are the same; else the
  170. * tree quota mechanism would be circumvented.
  171. */
  172. if (unlikely((target_dp->i_d.di_flags & XFS_DIFLAG_PROJINHERIT) &&
  173. (target_dp->i_d.di_projid != src_ip->i_d.di_projid))) {
  174. error = XFS_ERROR(EXDEV);
  175. goto error_return;
  176. }
  177. /*
  178. * Set up the target.
  179. */
  180. if (target_ip == NULL) {
  181. /*
  182. * If there's no space reservation, check the entry will
  183. * fit before actually inserting it.
  184. */
  185. error = xfs_dir_canenter(tp, target_dp, target_name, spaceres);
  186. if (error)
  187. goto error_return;
  188. /*
  189. * If target does not exist and the rename crosses
  190. * directories, adjust the target directory link count
  191. * to account for the ".." reference from the new entry.
  192. */
  193. error = xfs_dir_createname(tp, target_dp, target_name,
  194. src_ip->i_ino, &first_block,
  195. &free_list, spaceres);
  196. if (error == ENOSPC)
  197. goto error_return;
  198. if (error)
  199. goto abort_return;
  200. xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  201. if (new_parent && src_is_directory) {
  202. error = xfs_bumplink(tp, target_dp);
  203. if (error)
  204. goto abort_return;
  205. }
  206. } else { /* target_ip != NULL */
  207. /*
  208. * If target exists and it's a directory, check that both
  209. * target and source are directories and that target can be
  210. * destroyed, or that neither is a directory.
  211. */
  212. if ((target_ip->i_d.di_mode & S_IFMT) == S_IFDIR) {
  213. /*
  214. * Make sure target dir is empty.
  215. */
  216. if (!(xfs_dir_isempty(target_ip)) ||
  217. (target_ip->i_d.di_nlink > 2)) {
  218. error = XFS_ERROR(EEXIST);
  219. goto error_return;
  220. }
  221. }
  222. /*
  223. * Link the source inode under the target name.
  224. * If the source inode is a directory and we are moving
  225. * it across directories, its ".." entry will be
  226. * inconsistent until we replace that down below.
  227. *
  228. * In case there is already an entry with the same
  229. * name at the destination directory, remove it first.
  230. */
  231. error = xfs_dir_replace(tp, target_dp, target_name,
  232. src_ip->i_ino,
  233. &first_block, &free_list, spaceres);
  234. if (error)
  235. goto abort_return;
  236. xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  237. /*
  238. * Decrement the link count on the target since the target
  239. * dir no longer points to it.
  240. */
  241. error = xfs_droplink(tp, target_ip);
  242. if (error)
  243. goto abort_return;
  244. if (src_is_directory) {
  245. /*
  246. * Drop the link from the old "." entry.
  247. */
  248. error = xfs_droplink(tp, target_ip);
  249. if (error)
  250. goto abort_return;
  251. }
  252. } /* target_ip != NULL */
  253. /*
  254. * Remove the source.
  255. */
  256. if (new_parent && src_is_directory) {
  257. /*
  258. * Rewrite the ".." entry to point to the new
  259. * directory.
  260. */
  261. error = xfs_dir_replace(tp, src_ip, &xfs_name_dotdot,
  262. target_dp->i_ino,
  263. &first_block, &free_list, spaceres);
  264. ASSERT(error != EEXIST);
  265. if (error)
  266. goto abort_return;
  267. }
  268. /*
  269. * We always want to hit the ctime on the source inode.
  270. *
  271. * This isn't strictly required by the standards since the source
  272. * inode isn't really being changed, but old unix file systems did
  273. * it and some incremental backup programs won't work without it.
  274. */
  275. xfs_ichgtime(src_ip, XFS_ICHGTIME_CHG);
  276. /*
  277. * Adjust the link count on src_dp. This is necessary when
  278. * renaming a directory, either within one parent when
  279. * the target existed, or across two parent directories.
  280. */
  281. if (src_is_directory && (new_parent || target_ip != NULL)) {
  282. /*
  283. * Decrement link count on src_directory since the
  284. * entry that's moved no longer points to it.
  285. */
  286. error = xfs_droplink(tp, src_dp);
  287. if (error)
  288. goto abort_return;
  289. }
  290. error = xfs_dir_removename(tp, src_dp, src_name, src_ip->i_ino,
  291. &first_block, &free_list, spaceres);
  292. if (error)
  293. goto abort_return;
  294. xfs_ichgtime(src_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  295. xfs_trans_log_inode(tp, src_dp, XFS_ILOG_CORE);
  296. if (new_parent)
  297. xfs_trans_log_inode(tp, target_dp, XFS_ILOG_CORE);
  298. /*
  299. * If this is a synchronous mount, make sure that the
  300. * rename transaction goes to disk before returning to
  301. * the user.
  302. */
  303. if (mp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC)) {
  304. xfs_trans_set_sync(tp);
  305. }
  306. error = xfs_bmap_finish(&tp, &free_list, &committed);
  307. if (error) {
  308. xfs_bmap_cancel(&free_list);
  309. xfs_trans_cancel(tp, (XFS_TRANS_RELEASE_LOG_RES |
  310. XFS_TRANS_ABORT));
  311. goto std_return;
  312. }
  313. /*
  314. * trans_commit will unlock src_ip, target_ip & decrement
  315. * the vnode references.
  316. */
  317. return xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
  318. abort_return:
  319. cancel_flags |= XFS_TRANS_ABORT;
  320. error_return:
  321. xfs_bmap_cancel(&free_list);
  322. xfs_trans_cancel(tp, cancel_flags);
  323. std_return:
  324. return error;
  325. }