xfs_rename.c 9.2 KB

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