2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
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.
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.
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
20 #include "xfs_types.h"
23 #include "xfs_trans.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"
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"
45 * Given an array of up to 4 inode pointers, unlock the pointed to inodes.
46 * If there are fewer than 4 entries in the array, the empty entries will
47 * be at the end and will have NULL pointers in them.
56 xfs_iunlock(i_tab[0], lock_mode);
57 for (i = 1; i < 4; i++) {
62 * Watch out for duplicate entries in the table.
64 if (i_tab[i] != i_tab[i-1])
65 xfs_iunlock(i_tab[i], lock_mode);
70 * Enter all inodes for a rename transaction into a sorted array.
74 xfs_inode_t *dp1, /* in: old (source) directory inode */
75 xfs_inode_t *dp2, /* in: new (target) directory inode */
76 xfs_inode_t *ip1, /* in: inode of old entry */
77 xfs_inode_t *ip2, /* in: inode of new entry, if it
78 already exists, NULL otherwise. */
79 xfs_inode_t **i_tab,/* out: array of inode returned, sorted */
80 int *num_inodes) /* out: number of inodes in array */
86 * i_tab contains a list of pointers to inodes. We initialize
87 * the table here & we'll sort it. We will then use it to
88 * order the acquisition of the inode locks.
90 * Note that the table may contain duplicates. e.g., dp1 == dp2.
104 * Sort the elements via bubble sort. (Remember, there are at
105 * most 4 elements to sort, so this is adequate.)
107 for (i = 0; i < *num_inodes; i++) {
108 for (j = 1; j < *num_inodes; j++) {
109 if (i_tab[j]->i_ino < i_tab[j-1]->i_ino) {
111 i_tab[j] = i_tab[j-1];
124 struct xfs_name *src_name,
126 xfs_inode_t *target_dp,
127 struct xfs_name *target_name,
128 xfs_inode_t *target_ip)
130 xfs_trans_t *tp = NULL;
131 xfs_mount_t *mp = src_dp->i_mount;
132 int new_parent; /* moving to a new dir */
133 int src_is_directory; /* src_name is a directory */
135 xfs_bmap_free_t free_list;
136 xfs_fsblock_t first_block;
139 xfs_inode_t *inodes[4];
143 xfs_itrace_entry(src_dp);
144 xfs_itrace_entry(target_dp);
146 if (DM_EVENT_ENABLED(src_dp, DM_EVENT_RENAME) ||
147 DM_EVENT_ENABLED(target_dp, DM_EVENT_RENAME)) {
148 error = XFS_SEND_NAMESP(mp, DM_EVENT_RENAME,
149 src_dp, DM_RIGHT_NULL,
150 target_dp, DM_RIGHT_NULL,
151 src_name->name, target_name->name,
156 /* Return through std_return after this point. */
158 new_parent = (src_dp != target_dp);
159 src_is_directory = ((src_ip->i_d.di_mode & S_IFMT) == S_IFDIR);
161 if (src_is_directory) {
163 * Check for link count overflow on target_dp
165 if (target_ip == NULL && new_parent &&
166 target_dp->i_d.di_nlink >= XFS_MAXLINK) {
167 error = XFS_ERROR(EMLINK);
172 xfs_sort_for_rename(src_dp, target_dp, src_ip, target_ip,
173 inodes, &num_inodes);
175 XFS_BMAP_INIT(&free_list, &first_block);
176 tp = xfs_trans_alloc(mp, XFS_TRANS_RENAME);
177 cancel_flags = XFS_TRANS_RELEASE_LOG_RES;
178 spaceres = XFS_RENAME_SPACE_RES(mp, target_name->len);
179 error = xfs_trans_reserve(tp, spaceres, XFS_RENAME_LOG_RES(mp), 0,
180 XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
181 if (error == ENOSPC) {
183 error = xfs_trans_reserve(tp, 0, XFS_RENAME_LOG_RES(mp), 0,
184 XFS_TRANS_PERM_LOG_RES, XFS_RENAME_LOG_COUNT);
187 xfs_trans_cancel(tp, 0);
192 * Attach the dquots to the inodes
194 if ((error = XFS_QM_DQVOPRENAME(mp, inodes))) {
195 xfs_trans_cancel(tp, cancel_flags);
200 * Lock all the participating inodes. Depending upon whether
201 * the target_name exists in the target directory, and
202 * whether the target directory is the same as the source
203 * directory, we can lock from 2 to 4 inodes.
205 xfs_lock_inodes(inodes, num_inodes, XFS_ILOCK_EXCL);
208 * If we are using project inheritance, we only allow renames
209 * into our tree when the project IDs are the same; else the
210 * tree quota mechanism would be circumvented.
212 if (unlikely((target_dp->i_d.di_flags & XFS_DIFLAG_PROJINHERIT) &&
213 (target_dp->i_d.di_projid != src_ip->i_d.di_projid))) {
214 error = XFS_ERROR(EXDEV);
215 xfs_rename_unlock4(inodes, XFS_ILOCK_SHARED);
216 xfs_trans_cancel(tp, cancel_flags);
221 * Join all the inodes to the transaction. From this point on,
222 * we can rely on either trans_commit or trans_cancel to unlock
223 * them. Note that we need to add a vnode reference to the
224 * directories since trans_commit & trans_cancel will decrement
225 * them when they unlock the inodes. Also, we need to be careful
226 * not to add an inode to the transaction more than once.
229 xfs_trans_ijoin(tp, src_dp, XFS_ILOCK_EXCL);
233 xfs_trans_ijoin(tp, target_dp, XFS_ILOCK_EXCL);
237 xfs_trans_ijoin(tp, src_ip, XFS_ILOCK_EXCL);
241 xfs_trans_ijoin(tp, target_ip, XFS_ILOCK_EXCL);
247 if (target_ip == NULL) {
249 * If there's no space reservation, check the entry will
250 * fit before actually inserting it.
252 error = xfs_dir_canenter(tp, target_dp, target_name, spaceres);
256 * If target does not exist and the rename crosses
257 * directories, adjust the target directory link count
258 * to account for the ".." reference from the new entry.
260 error = xfs_dir_createname(tp, target_dp, target_name,
261 src_ip->i_ino, &first_block,
262 &free_list, spaceres);
267 xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
269 if (new_parent && src_is_directory) {
270 error = xfs_bumplink(tp, target_dp);
274 } else { /* target_ip != NULL */
276 * If target exists and it's a directory, check that both
277 * target and source are directories and that target can be
278 * destroyed, or that neither is a directory.
280 if ((target_ip->i_d.di_mode & S_IFMT) == S_IFDIR) {
282 * Make sure target dir is empty.
284 if (!(xfs_dir_isempty(target_ip)) ||
285 (target_ip->i_d.di_nlink > 2)) {
286 error = XFS_ERROR(EEXIST);
292 * Link the source inode under the target name.
293 * If the source inode is a directory and we are moving
294 * it across directories, its ".." entry will be
295 * inconsistent until we replace that down below.
297 * In case there is already an entry with the same
298 * name at the destination directory, remove it first.
300 error = xfs_dir_replace(tp, target_dp, target_name,
302 &first_block, &free_list, spaceres);
305 xfs_ichgtime(target_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
308 * Decrement the link count on the target since the target
309 * dir no longer points to it.
311 error = xfs_droplink(tp, target_ip);
315 if (src_is_directory) {
317 * Drop the link from the old "." entry.
319 error = xfs_droplink(tp, target_ip);
323 } /* target_ip != NULL */
328 if (new_parent && src_is_directory) {
330 * Rewrite the ".." entry to point to the new
333 error = xfs_dir_replace(tp, src_ip, &xfs_name_dotdot,
335 &first_block, &free_list, spaceres);
336 ASSERT(error != EEXIST);
339 xfs_ichgtime(src_ip, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
343 * We always want to hit the ctime on the source inode.
344 * We do it in the if clause above for the 'new_parent &&
345 * src_is_directory' case, and here we get all the other
346 * cases. This isn't strictly required by the standards
347 * since the source inode isn't really being changed,
348 * but old unix file systems did it and some incremental
349 * backup programs won't work without it.
351 xfs_ichgtime(src_ip, XFS_ICHGTIME_CHG);
355 * Adjust the link count on src_dp. This is necessary when
356 * renaming a directory, either within one parent when
357 * the target existed, or across two parent directories.
359 if (src_is_directory && (new_parent || target_ip != NULL)) {
362 * Decrement link count on src_directory since the
363 * entry that's moved no longer points to it.
365 error = xfs_droplink(tp, src_dp);
370 error = xfs_dir_removename(tp, src_dp, src_name, src_ip->i_ino,
371 &first_block, &free_list, spaceres);
374 xfs_ichgtime(src_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
377 * Update the generation counts on all the directory inodes
378 * that we're modifying.
381 xfs_trans_log_inode(tp, src_dp, XFS_ILOG_CORE);
385 xfs_trans_log_inode(tp, target_dp, XFS_ILOG_CORE);
389 * If this is a synchronous mount, make sure that the
390 * rename transaction goes to disk before returning to
393 if (mp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC)) {
394 xfs_trans_set_sync(tp);
397 error = xfs_bmap_finish(&tp, &free_list, &committed);
399 xfs_bmap_cancel(&free_list);
400 xfs_trans_cancel(tp, (XFS_TRANS_RELEASE_LOG_RES |
406 * trans_commit will unlock src_ip, target_ip & decrement
407 * the vnode references.
409 error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
411 /* Fall through to std_return with error = 0 or errno from
412 * xfs_trans_commit */
414 if (DM_EVENT_ENABLED(src_dp, DM_EVENT_POSTRENAME) ||
415 DM_EVENT_ENABLED(target_dp, DM_EVENT_POSTRENAME)) {
416 (void) XFS_SEND_NAMESP (mp, DM_EVENT_POSTRENAME,
417 src_dp, DM_RIGHT_NULL,
418 target_dp, DM_RIGHT_NULL,
419 src_name->name, target_name->name,
425 cancel_flags |= XFS_TRANS_ABORT;
428 xfs_bmap_cancel(&free_list);
429 xfs_trans_cancel(tp, cancel_flags);