Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
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 | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
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. | |
1da177e4 | 13 | * |
7b718769 NS |
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 | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
70a9883c | 20 | #include "xfs_shared.h" |
239880ef DC |
21 | #include "xfs_format.h" |
22 | #include "xfs_log_format.h" | |
23 | #include "xfs_trans_resv.h" | |
a844f451 | 24 | #include "xfs_bit.h" |
1da177e4 LT |
25 | #include "xfs_sb.h" |
26 | #include "xfs_ag.h" | |
1da177e4 | 27 | #include "xfs_mount.h" |
57062787 | 28 | #include "xfs_da_format.h" |
a844f451 | 29 | #include "xfs_da_btree.h" |
a844f451 | 30 | #include "xfs_attr_sf.h" |
1da177e4 | 31 | #include "xfs_inode.h" |
a844f451 | 32 | #include "xfs_alloc.h" |
239880ef | 33 | #include "xfs_trans.h" |
a844f451 | 34 | #include "xfs_inode_item.h" |
1da177e4 | 35 | #include "xfs_bmap.h" |
68988114 | 36 | #include "xfs_bmap_util.h" |
a4fbe6ab | 37 | #include "xfs_bmap_btree.h" |
1da177e4 LT |
38 | #include "xfs_attr.h" |
39 | #include "xfs_attr_leaf.h" | |
95920cd6 | 40 | #include "xfs_attr_remote.h" |
1da177e4 | 41 | #include "xfs_error.h" |
1da177e4 | 42 | #include "xfs_quota.h" |
1da177e4 | 43 | #include "xfs_trans_space.h" |
0b1b213f | 44 | #include "xfs_trace.h" |
a4fbe6ab | 45 | #include "xfs_dinode.h" |
1da177e4 LT |
46 | |
47 | /* | |
48 | * xfs_attr.c | |
49 | * | |
50 | * Provide the external interfaces to manage attribute lists. | |
51 | */ | |
52 | ||
53 | /*======================================================================== | |
54 | * Function prototypes for the kernel. | |
55 | *========================================================================*/ | |
56 | ||
57 | /* | |
58 | * Internal routines when attribute list fits inside the inode. | |
59 | */ | |
60 | STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args); | |
61 | ||
62 | /* | |
63 | * Internal routines when attribute list is one block. | |
64 | */ | |
ba0f32d4 | 65 | STATIC int xfs_attr_leaf_get(xfs_da_args_t *args); |
1da177e4 LT |
66 | STATIC int xfs_attr_leaf_addname(xfs_da_args_t *args); |
67 | STATIC int xfs_attr_leaf_removename(xfs_da_args_t *args); | |
1da177e4 LT |
68 | |
69 | /* | |
70 | * Internal routines when attribute list is more than one block. | |
71 | */ | |
ba0f32d4 | 72 | STATIC int xfs_attr_node_get(xfs_da_args_t *args); |
1da177e4 LT |
73 | STATIC int xfs_attr_node_addname(xfs_da_args_t *args); |
74 | STATIC int xfs_attr_node_removename(xfs_da_args_t *args); | |
1da177e4 LT |
75 | STATIC int xfs_attr_fillstate(xfs_da_state_t *state); |
76 | STATIC int xfs_attr_refillstate(xfs_da_state_t *state); | |
77 | ||
1da177e4 | 78 | |
e8b0ebaa | 79 | STATIC int |
67fd718f CH |
80 | xfs_attr_args_init( |
81 | struct xfs_da_args *args, | |
82 | struct xfs_inode *dp, | |
83 | const unsigned char *name, | |
84 | int flags) | |
e8b0ebaa | 85 | { |
67fd718f CH |
86 | |
87 | if (!name) | |
e8b0ebaa | 88 | return EINVAL; |
67fd718f CH |
89 | |
90 | memset(args, 0, sizeof(*args)); | |
0650b554 | 91 | args->geo = dp->i_mount->m_attr_geo; |
67fd718f CH |
92 | args->whichfork = XFS_ATTR_FORK; |
93 | args->dp = dp; | |
94 | args->flags = flags; | |
95 | args->name = name; | |
96 | args->namelen = strlen((const char *)name); | |
97 | if (args->namelen >= MAXNAMELEN) | |
e8b0ebaa BN |
98 | return EFAULT; /* match IRIX behaviour */ |
99 | ||
67fd718f | 100 | args->hashval = xfs_da_hashname(args->name, args->namelen); |
e8b0ebaa BN |
101 | return 0; |
102 | } | |
1da177e4 | 103 | |
abec5f2b | 104 | int |
caf8aabd CH |
105 | xfs_inode_hasattr( |
106 | struct xfs_inode *ip) | |
107 | { | |
108 | if (!XFS_IFORK_Q(ip) || | |
109 | (ip->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS && | |
110 | ip->i_d.di_anextents == 0)) | |
111 | return 0; | |
112 | return 1; | |
113 | } | |
114 | ||
1da177e4 LT |
115 | /*======================================================================== |
116 | * Overall external interface routines. | |
117 | *========================================================================*/ | |
118 | ||
b87d022c CH |
119 | int |
120 | xfs_attr_get( | |
e82fa0c7 | 121 | struct xfs_inode *ip, |
b87d022c | 122 | const unsigned char *name, |
a9273ca5 | 123 | unsigned char *value, |
e82fa0c7 CH |
124 | int *valuelenp, |
125 | int flags) | |
1da177e4 | 126 | { |
b87d022c | 127 | struct xfs_da_args args; |
b87d022c CH |
128 | uint lock_mode; |
129 | int error; | |
130 | ||
131 | XFS_STATS_INC(xs_attr_get); | |
132 | ||
133 | if (XFS_FORCED_SHUTDOWN(ip->i_mount)) | |
134 | return EIO; | |
1da177e4 | 135 | |
caf8aabd CH |
136 | if (!xfs_inode_hasattr(ip)) |
137 | return ENOATTR; | |
1da177e4 | 138 | |
67fd718f | 139 | error = xfs_attr_args_init(&args, ip, name, flags); |
b87d022c CH |
140 | if (error) |
141 | return error; | |
142 | ||
1da177e4 LT |
143 | args.value = value; |
144 | args.valuelen = *valuelenp; | |
1da177e4 | 145 | |
b87d022c CH |
146 | lock_mode = xfs_ilock_attr_map_shared(ip); |
147 | if (!xfs_inode_hasattr(ip)) | |
148 | error = ENOATTR; | |
149 | else if (ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) | |
1da177e4 | 150 | error = xfs_attr_shortform_getvalue(&args); |
b87d022c | 151 | else if (xfs_bmap_one_block(ip, XFS_ATTR_FORK)) |
1da177e4 | 152 | error = xfs_attr_leaf_get(&args); |
b87d022c | 153 | else |
1da177e4 | 154 | error = xfs_attr_node_get(&args); |
b87d022c | 155 | xfs_iunlock(ip, lock_mode); |
1da177e4 | 156 | |
1da177e4 | 157 | *valuelenp = args.valuelen; |
b87d022c | 158 | return error == EEXIST ? 0 : error; |
1da177e4 LT |
159 | } |
160 | ||
5e9da7b7 NS |
161 | /* |
162 | * Calculate how many blocks we need for the new attribute, | |
163 | */ | |
5d77c0dc | 164 | STATIC int |
5e9da7b7 | 165 | xfs_attr_calc_size( |
6c888af0 | 166 | struct xfs_da_args *args, |
5e9da7b7 NS |
167 | int *local) |
168 | { | |
6c888af0 | 169 | struct xfs_mount *mp = args->dp->i_mount; |
5e9da7b7 NS |
170 | int size; |
171 | int nblks; | |
172 | ||
173 | /* | |
174 | * Determine space new attribute will use, and if it would be | |
175 | * "local" or "remote" (note: local != inline). | |
176 | */ | |
c59f0ad2 | 177 | size = xfs_attr_leaf_newentsize(args, local); |
5e9da7b7 NS |
178 | nblks = XFS_DAENTER_SPACE_RES(mp, XFS_ATTR_FORK); |
179 | if (*local) { | |
33a60390 | 180 | if (size > (args->geo->blksize / 2)) { |
5e9da7b7 NS |
181 | /* Double split possible */ |
182 | nblks *= 2; | |
183 | } | |
184 | } else { | |
185 | /* | |
186 | * Out of line attribute, cannot double split, but | |
187 | * make room for the attribute value itself. | |
188 | */ | |
2d6dcc6d | 189 | uint dblocks = xfs_attr3_rmt_blocks(mp, args->valuelen); |
5e9da7b7 NS |
190 | nblks += dblocks; |
191 | nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK); | |
192 | } | |
193 | ||
194 | return nblks; | |
195 | } | |
196 | ||
c5b4ac39 CH |
197 | int |
198 | xfs_attr_set( | |
199 | struct xfs_inode *dp, | |
200 | const unsigned char *name, | |
201 | unsigned char *value, | |
202 | int valuelen, | |
203 | int flags) | |
1da177e4 | 204 | { |
3d3c8b52 | 205 | struct xfs_mount *mp = dp->i_mount; |
c5b4ac39 CH |
206 | struct xfs_da_args args; |
207 | struct xfs_bmap_free flist; | |
3d3c8b52 | 208 | struct xfs_trans_res tres; |
c5b4ac39 | 209 | xfs_fsblock_t firstblock; |
3d3c8b52 | 210 | int rsvd = (flags & ATTR_ROOT) != 0; |
c5b4ac39 CH |
211 | int error, err2, committed, local; |
212 | ||
213 | XFS_STATS_INC(xs_attr_set); | |
214 | ||
215 | if (XFS_FORCED_SHUTDOWN(dp->i_mount)) | |
216 | return EIO; | |
217 | ||
67fd718f | 218 | error = xfs_attr_args_init(&args, dp, name, flags); |
c5b4ac39 CH |
219 | if (error) |
220 | return error; | |
1da177e4 | 221 | |
67fd718f CH |
222 | args.value = value; |
223 | args.valuelen = valuelen; | |
224 | args.firstblock = &firstblock; | |
225 | args.flist = &flist; | |
226 | args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT; | |
6c888af0 | 227 | args.total = xfs_attr_calc_size(&args, &local); |
1da177e4 | 228 | |
7d095257 CH |
229 | error = xfs_qm_dqattach(dp, 0); |
230 | if (error) | |
231 | return error; | |
1da177e4 LT |
232 | |
233 | /* | |
234 | * If the inode doesn't have an attribute fork, add one. | |
235 | * (inode must not be locked when we call this routine) | |
236 | */ | |
237 | if (XFS_IFORK_Q(dp) == 0) { | |
e5889e90 | 238 | int sf_size = sizeof(xfs_attr_sf_hdr_t) + |
67fd718f | 239 | XFS_ATTR_SF_ENTSIZE_BYNAME(args.namelen, valuelen); |
e5889e90 | 240 | |
c5b4ac39 CH |
241 | error = xfs_bmap_add_attrfork(dp, sf_size, rsvd); |
242 | if (error) | |
243 | return error; | |
1da177e4 LT |
244 | } |
245 | ||
1da177e4 LT |
246 | /* |
247 | * Start our first transaction of the day. | |
248 | * | |
249 | * All future transactions during this code must be "chained" off | |
250 | * this one via the trans_dup() call. All transactions will contain | |
251 | * the inode, and the inode will always be marked with trans_ihold(). | |
252 | * Since the inode will be locked in all transactions, we must log | |
253 | * the inode in every transaction to let it float upward through | |
254 | * the log. | |
255 | */ | |
256 | args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_SET); | |
257 | ||
258 | /* | |
259 | * Root fork attributes can use reserved data blocks for this | |
260 | * operation if necessary | |
261 | */ | |
262 | ||
263 | if (rsvd) | |
264 | args.trans->t_flags |= XFS_TRANS_RESERVE; | |
265 | ||
3d3c8b52 JL |
266 | tres.tr_logres = M_RES(mp)->tr_attrsetm.tr_logres + |
267 | M_RES(mp)->tr_attrsetrt.tr_logres * args.total; | |
268 | tres.tr_logcount = XFS_ATTRSET_LOG_COUNT; | |
269 | tres.tr_logflags = XFS_TRANS_PERM_LOG_RES; | |
270 | error = xfs_trans_reserve(args.trans, &tres, args.total, 0); | |
a21cd503 | 271 | if (error) { |
1da177e4 | 272 | xfs_trans_cancel(args.trans, 0); |
c5b4ac39 | 273 | return error; |
1da177e4 LT |
274 | } |
275 | xfs_ilock(dp, XFS_ILOCK_EXCL); | |
276 | ||
7d095257 | 277 | error = xfs_trans_reserve_quota_nblks(args.trans, dp, args.total, 0, |
5e9da7b7 NS |
278 | rsvd ? XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES : |
279 | XFS_QMOPT_RES_REGBLKS); | |
1da177e4 LT |
280 | if (error) { |
281 | xfs_iunlock(dp, XFS_ILOCK_EXCL); | |
282 | xfs_trans_cancel(args.trans, XFS_TRANS_RELEASE_LOG_RES); | |
c5b4ac39 | 283 | return error; |
1da177e4 LT |
284 | } |
285 | ||
ddc3415a | 286 | xfs_trans_ijoin(args.trans, dp, 0); |
1da177e4 LT |
287 | |
288 | /* | |
c41564b5 | 289 | * If the attribute list is non-existent or a shortform list, |
1da177e4 LT |
290 | * upgrade it to a single-leaf-block attribute list. |
291 | */ | |
c5b4ac39 CH |
292 | if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL || |
293 | (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS && | |
294 | dp->i_d.di_anextents == 0)) { | |
1da177e4 LT |
295 | |
296 | /* | |
297 | * Build initial attribute list (if required). | |
298 | */ | |
299 | if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) | |
d8cc890d | 300 | xfs_attr_shortform_create(&args); |
1da177e4 LT |
301 | |
302 | /* | |
303 | * Try to add the attr to the attribute list in | |
304 | * the inode. | |
305 | */ | |
306 | error = xfs_attr_shortform_addname(&args); | |
307 | if (error != ENOSPC) { | |
308 | /* | |
309 | * Commit the shortform mods, and we're done. | |
310 | * NOTE: this is also the error path (EEXIST, etc). | |
311 | */ | |
312 | ASSERT(args.trans != NULL); | |
313 | ||
314 | /* | |
315 | * If this is a synchronous mount, make sure that | |
316 | * the transaction goes to disk before returning | |
317 | * to the user. | |
318 | */ | |
c5b4ac39 | 319 | if (mp->m_flags & XFS_MOUNT_WSYNC) |
1da177e4 | 320 | xfs_trans_set_sync(args.trans); |
dcd79a14 DC |
321 | |
322 | if (!error && (flags & ATTR_KERNOTIME) == 0) { | |
323 | xfs_trans_ichgtime(args.trans, dp, | |
324 | XFS_ICHGTIME_CHG); | |
325 | } | |
1da177e4 | 326 | err2 = xfs_trans_commit(args.trans, |
1c72bf90 | 327 | XFS_TRANS_RELEASE_LOG_RES); |
1da177e4 LT |
328 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
329 | ||
c5b4ac39 | 330 | return error ? error : err2; |
1da177e4 LT |
331 | } |
332 | ||
333 | /* | |
334 | * It won't fit in the shortform, transform to a leaf block. | |
335 | * GROT: another possible req'mt for a double-split btree op. | |
336 | */ | |
9d87c319 | 337 | xfs_bmap_init(args.flist, args.firstblock); |
1da177e4 LT |
338 | error = xfs_attr_shortform_to_leaf(&args); |
339 | if (!error) { | |
340 | error = xfs_bmap_finish(&args.trans, args.flist, | |
f7c99b6f | 341 | &committed); |
1da177e4 LT |
342 | } |
343 | if (error) { | |
344 | ASSERT(committed); | |
345 | args.trans = NULL; | |
346 | xfs_bmap_cancel(&flist); | |
347 | goto out; | |
348 | } | |
349 | ||
350 | /* | |
351 | * bmap_finish() may have committed the last trans and started | |
352 | * a new one. We need the inode to be in all transactions. | |
353 | */ | |
898621d5 | 354 | if (committed) |
ddc3415a | 355 | xfs_trans_ijoin(args.trans, dp, 0); |
1da177e4 LT |
356 | |
357 | /* | |
358 | * Commit the leaf transformation. We'll need another (linked) | |
359 | * transaction to add the new attribute to the leaf. | |
360 | */ | |
322ff6b8 NS |
361 | |
362 | error = xfs_trans_roll(&args.trans, dp); | |
363 | if (error) | |
1da177e4 LT |
364 | goto out; |
365 | ||
366 | } | |
367 | ||
c5b4ac39 | 368 | if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) |
1da177e4 | 369 | error = xfs_attr_leaf_addname(&args); |
c5b4ac39 | 370 | else |
1da177e4 | 371 | error = xfs_attr_node_addname(&args); |
c5b4ac39 | 372 | if (error) |
1da177e4 | 373 | goto out; |
1da177e4 LT |
374 | |
375 | /* | |
376 | * If this is a synchronous mount, make sure that the | |
377 | * transaction goes to disk before returning to the user. | |
378 | */ | |
c5b4ac39 | 379 | if (mp->m_flags & XFS_MOUNT_WSYNC) |
1da177e4 | 380 | xfs_trans_set_sync(args.trans); |
1da177e4 | 381 | |
dcd79a14 DC |
382 | if ((flags & ATTR_KERNOTIME) == 0) |
383 | xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG); | |
384 | ||
1da177e4 LT |
385 | /* |
386 | * Commit the last in the sequence of transactions. | |
387 | */ | |
388 | xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE); | |
1c72bf90 | 389 | error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES); |
1da177e4 LT |
390 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
391 | ||
c5b4ac39 | 392 | return error; |
1da177e4 LT |
393 | |
394 | out: | |
c5b4ac39 | 395 | if (args.trans) { |
1da177e4 LT |
396 | xfs_trans_cancel(args.trans, |
397 | XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT); | |
c5b4ac39 | 398 | } |
1da177e4 | 399 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
c5b4ac39 | 400 | return error; |
1da177e4 LT |
401 | } |
402 | ||
aa82daa0 NS |
403 | /* |
404 | * Generic handler routine to remove a name from an attribute list. | |
405 | * Transitions attribute list from Btree to shortform as necessary. | |
406 | */ | |
aa82daa0 | 407 | int |
1bc426a7 CH |
408 | xfs_attr_remove( |
409 | struct xfs_inode *dp, | |
410 | const unsigned char *name, | |
411 | int flags) | |
1da177e4 | 412 | { |
1bc426a7 CH |
413 | struct xfs_mount *mp = dp->i_mount; |
414 | struct xfs_da_args args; | |
415 | struct xfs_bmap_free flist; | |
1bc426a7 CH |
416 | xfs_fsblock_t firstblock; |
417 | int error; | |
1da177e4 | 418 | |
1bc426a7 | 419 | XFS_STATS_INC(xs_attr_remove); |
1da177e4 | 420 | |
aa82daa0 | 421 | if (XFS_FORCED_SHUTDOWN(dp->i_mount)) |
1bc426a7 CH |
422 | return EIO; |
423 | ||
424 | if (!xfs_inode_hasattr(dp)) | |
425 | return ENOATTR; | |
1da177e4 | 426 | |
67fd718f | 427 | error = xfs_attr_args_init(&args, dp, name, flags); |
e8b0ebaa BN |
428 | if (error) |
429 | return error; | |
430 | ||
1da177e4 LT |
431 | args.firstblock = &firstblock; |
432 | args.flist = &flist; | |
1da177e4 | 433 | |
4a338212 DC |
434 | /* |
435 | * we have no control over the attribute names that userspace passes us | |
436 | * to remove, so we have to allow the name lookup prior to attribute | |
437 | * removal to fail. | |
438 | */ | |
439 | args.op_flags = XFS_DA_OP_OKNOENT; | |
440 | ||
7d095257 CH |
441 | error = xfs_qm_dqattach(dp, 0); |
442 | if (error) | |
443 | return error; | |
1da177e4 LT |
444 | |
445 | /* | |
446 | * Start our first transaction of the day. | |
447 | * | |
448 | * All future transactions during this code must be "chained" off | |
449 | * this one via the trans_dup() call. All transactions will contain | |
450 | * the inode, and the inode will always be marked with trans_ihold(). | |
451 | * Since the inode will be locked in all transactions, we must log | |
452 | * the inode in every transaction to let it float upward through | |
453 | * the log. | |
454 | */ | |
455 | args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM); | |
456 | ||
457 | /* | |
458 | * Root fork attributes can use reserved data blocks for this | |
459 | * operation if necessary | |
460 | */ | |
461 | ||
462 | if (flags & ATTR_ROOT) | |
463 | args.trans->t_flags |= XFS_TRANS_RESERVE; | |
464 | ||
3d3c8b52 JL |
465 | error = xfs_trans_reserve(args.trans, &M_RES(mp)->tr_attrrm, |
466 | XFS_ATTRRM_SPACE_RES(mp), 0); | |
467 | if (error) { | |
1da177e4 | 468 | xfs_trans_cancel(args.trans, 0); |
1bc426a7 | 469 | return error; |
1da177e4 LT |
470 | } |
471 | ||
472 | xfs_ilock(dp, XFS_ILOCK_EXCL); | |
473 | /* | |
474 | * No need to make quota reservations here. We expect to release some | |
475 | * blocks not allocate in the common case. | |
476 | */ | |
ddc3415a | 477 | xfs_trans_ijoin(args.trans, dp, 0); |
1da177e4 | 478 | |
caf8aabd | 479 | if (!xfs_inode_hasattr(dp)) { |
b474c7ae | 480 | error = ENOATTR; |
1bc426a7 | 481 | } else if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) { |
1da177e4 LT |
482 | ASSERT(dp->i_afp->if_flags & XFS_IFINLINE); |
483 | error = xfs_attr_shortform_remove(&args); | |
1da177e4 LT |
484 | } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) { |
485 | error = xfs_attr_leaf_removename(&args); | |
486 | } else { | |
487 | error = xfs_attr_node_removename(&args); | |
488 | } | |
1bc426a7 CH |
489 | |
490 | if (error) | |
1da177e4 | 491 | goto out; |
1da177e4 LT |
492 | |
493 | /* | |
494 | * If this is a synchronous mount, make sure that the | |
495 | * transaction goes to disk before returning to the user. | |
496 | */ | |
1bc426a7 | 497 | if (mp->m_flags & XFS_MOUNT_WSYNC) |
1da177e4 | 498 | xfs_trans_set_sync(args.trans); |
1da177e4 | 499 | |
dcd79a14 DC |
500 | if ((flags & ATTR_KERNOTIME) == 0) |
501 | xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG); | |
502 | ||
1da177e4 LT |
503 | /* |
504 | * Commit the last in the sequence of transactions. | |
505 | */ | |
506 | xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE); | |
1c72bf90 | 507 | error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES); |
1da177e4 LT |
508 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
509 | ||
1bc426a7 | 510 | return error; |
1da177e4 LT |
511 | |
512 | out: | |
1bc426a7 | 513 | if (args.trans) { |
1da177e4 LT |
514 | xfs_trans_cancel(args.trans, |
515 | XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT); | |
aa82daa0 | 516 | } |
1bc426a7 CH |
517 | xfs_iunlock(dp, XFS_ILOCK_EXCL); |
518 | return error; | |
aa82daa0 NS |
519 | } |
520 | ||
1da177e4 LT |
521 | /*======================================================================== |
522 | * External routines when attribute list is inside the inode | |
523 | *========================================================================*/ | |
524 | ||
525 | /* | |
526 | * Add a name to the shortform attribute list structure | |
527 | * This is the external routine. | |
528 | */ | |
529 | STATIC int | |
530 | xfs_attr_shortform_addname(xfs_da_args_t *args) | |
531 | { | |
d8cc890d | 532 | int newsize, forkoff, retval; |
1da177e4 | 533 | |
5a5881cd DC |
534 | trace_xfs_attr_sf_addname(args); |
535 | ||
1da177e4 LT |
536 | retval = xfs_attr_shortform_lookup(args); |
537 | if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) { | |
d99831ff | 538 | return retval; |
1da177e4 LT |
539 | } else if (retval == EEXIST) { |
540 | if (args->flags & ATTR_CREATE) | |
d99831ff | 541 | return retval; |
1da177e4 LT |
542 | retval = xfs_attr_shortform_remove(args); |
543 | ASSERT(retval == 0); | |
544 | } | |
545 | ||
d8cc890d NS |
546 | if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX || |
547 | args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX) | |
b474c7ae | 548 | return ENOSPC; |
d8cc890d | 549 | |
1da177e4 LT |
550 | newsize = XFS_ATTR_SF_TOTSIZE(args->dp); |
551 | newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen); | |
d8cc890d NS |
552 | |
553 | forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize); | |
554 | if (!forkoff) | |
b474c7ae | 555 | return ENOSPC; |
d8cc890d NS |
556 | |
557 | xfs_attr_shortform_add(args, forkoff); | |
d99831ff | 558 | return 0; |
1da177e4 LT |
559 | } |
560 | ||
561 | ||
562 | /*======================================================================== | |
563 | * External routines when attribute list is one block | |
564 | *========================================================================*/ | |
565 | ||
566 | /* | |
567 | * Add a name to the leaf attribute list structure | |
568 | * | |
569 | * This leaf block cannot have a "remote" value, we only call this routine | |
570 | * if bmap_one_block() says there is only one block (ie: no remote blks). | |
571 | */ | |
a8272ce0 | 572 | STATIC int |
1da177e4 LT |
573 | xfs_attr_leaf_addname(xfs_da_args_t *args) |
574 | { | |
575 | xfs_inode_t *dp; | |
1d9025e5 | 576 | struct xfs_buf *bp; |
d8cc890d | 577 | int retval, error, committed, forkoff; |
1da177e4 | 578 | |
5a5881cd DC |
579 | trace_xfs_attr_leaf_addname(args); |
580 | ||
1da177e4 LT |
581 | /* |
582 | * Read the (only) block in the attribute list in. | |
583 | */ | |
584 | dp = args->dp; | |
585 | args->blkno = 0; | |
517c2220 | 586 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
1da177e4 | 587 | if (error) |
ad14c33a | 588 | return error; |
1da177e4 LT |
589 | |
590 | /* | |
591 | * Look up the given attribute in the leaf block. Figure out if | |
592 | * the given flags produce an error or call for an atomic rename. | |
593 | */ | |
517c2220 | 594 | retval = xfs_attr3_leaf_lookup_int(bp, args); |
1da177e4 | 595 | if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) { |
1d9025e5 | 596 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 597 | return retval; |
1da177e4 LT |
598 | } else if (retval == EEXIST) { |
599 | if (args->flags & ATTR_CREATE) { /* pure create op */ | |
1d9025e5 | 600 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 601 | return retval; |
1da177e4 | 602 | } |
5a5881cd DC |
603 | |
604 | trace_xfs_attr_leaf_replace(args); | |
605 | ||
8275cdd0 | 606 | /* save the attribute state for later removal*/ |
6a178100 | 607 | args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */ |
1da177e4 LT |
608 | args->blkno2 = args->blkno; /* set 2nd entry info*/ |
609 | args->index2 = args->index; | |
610 | args->rmtblkno2 = args->rmtblkno; | |
611 | args->rmtblkcnt2 = args->rmtblkcnt; | |
8275cdd0 DC |
612 | args->rmtvaluelen2 = args->rmtvaluelen; |
613 | ||
614 | /* | |
615 | * clear the remote attr state now that it is saved so that the | |
616 | * values reflect the state of the attribute we are about to | |
617 | * add, not the attribute we just found and will remove later. | |
618 | */ | |
619 | args->rmtblkno = 0; | |
620 | args->rmtblkcnt = 0; | |
621 | args->rmtvaluelen = 0; | |
1da177e4 LT |
622 | } |
623 | ||
624 | /* | |
625 | * Add the attribute to the leaf block, transitioning to a Btree | |
626 | * if required. | |
627 | */ | |
517c2220 | 628 | retval = xfs_attr3_leaf_add(bp, args); |
1da177e4 LT |
629 | if (retval == ENOSPC) { |
630 | /* | |
631 | * Promote the attribute list to the Btree format, then | |
632 | * Commit that transaction so that the node_addname() call | |
633 | * can manage its own transactions. | |
634 | */ | |
9d87c319 | 635 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 636 | error = xfs_attr3_leaf_to_node(args); |
1da177e4 LT |
637 | if (!error) { |
638 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 639 | &committed); |
1da177e4 LT |
640 | } |
641 | if (error) { | |
642 | ASSERT(committed); | |
643 | args->trans = NULL; | |
644 | xfs_bmap_cancel(args->flist); | |
d99831ff | 645 | return error; |
1da177e4 LT |
646 | } |
647 | ||
648 | /* | |
649 | * bmap_finish() may have committed the last trans and started | |
650 | * a new one. We need the inode to be in all transactions. | |
651 | */ | |
898621d5 | 652 | if (committed) |
ddc3415a | 653 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
654 | |
655 | /* | |
656 | * Commit the current trans (including the inode) and start | |
657 | * a new one. | |
658 | */ | |
322ff6b8 NS |
659 | error = xfs_trans_roll(&args->trans, dp); |
660 | if (error) | |
d99831ff | 661 | return error; |
1da177e4 LT |
662 | |
663 | /* | |
664 | * Fob the whole rest of the problem off on the Btree code. | |
665 | */ | |
666 | error = xfs_attr_node_addname(args); | |
d99831ff | 667 | return error; |
1da177e4 LT |
668 | } |
669 | ||
670 | /* | |
671 | * Commit the transaction that added the attr name so that | |
672 | * later routines can manage their own transactions. | |
673 | */ | |
322ff6b8 NS |
674 | error = xfs_trans_roll(&args->trans, dp); |
675 | if (error) | |
d99831ff | 676 | return error; |
1da177e4 LT |
677 | |
678 | /* | |
679 | * If there was an out-of-line value, allocate the blocks we | |
680 | * identified for its storage and copy the value. This is done | |
681 | * after we create the attribute so that we don't overflow the | |
682 | * maximum size of a transaction and/or hit a deadlock. | |
683 | */ | |
684 | if (args->rmtblkno > 0) { | |
685 | error = xfs_attr_rmtval_set(args); | |
686 | if (error) | |
d99831ff | 687 | return error; |
1da177e4 LT |
688 | } |
689 | ||
690 | /* | |
691 | * If this is an atomic rename operation, we must "flip" the | |
692 | * incomplete flags on the "new" and "old" attribute/value pairs | |
693 | * so that one disappears and one appears atomically. Then we | |
694 | * must remove the "old" attribute/value pair. | |
695 | */ | |
6a178100 | 696 | if (args->op_flags & XFS_DA_OP_RENAME) { |
1da177e4 LT |
697 | /* |
698 | * In a separate transaction, set the incomplete flag on the | |
699 | * "old" attr and clear the incomplete flag on the "new" attr. | |
700 | */ | |
517c2220 | 701 | error = xfs_attr3_leaf_flipflags(args); |
1da177e4 | 702 | if (error) |
d99831ff | 703 | return error; |
1da177e4 LT |
704 | |
705 | /* | |
706 | * Dismantle the "old" attribute/value pair by removing | |
707 | * a "remote" value (if it exists). | |
708 | */ | |
709 | args->index = args->index2; | |
710 | args->blkno = args->blkno2; | |
711 | args->rmtblkno = args->rmtblkno2; | |
712 | args->rmtblkcnt = args->rmtblkcnt2; | |
8275cdd0 | 713 | args->rmtvaluelen = args->rmtvaluelen2; |
1da177e4 LT |
714 | if (args->rmtblkno) { |
715 | error = xfs_attr_rmtval_remove(args); | |
716 | if (error) | |
d99831ff | 717 | return error; |
1da177e4 LT |
718 | } |
719 | ||
720 | /* | |
721 | * Read in the block containing the "old" attr, then | |
722 | * remove the "old" attr from that block (neat, huh!) | |
723 | */ | |
517c2220 | 724 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, |
ad14c33a | 725 | -1, &bp); |
1da177e4 | 726 | if (error) |
ad14c33a DC |
727 | return error; |
728 | ||
517c2220 | 729 | xfs_attr3_leaf_remove(bp, args); |
1da177e4 LT |
730 | |
731 | /* | |
732 | * If the result is small enough, shrink it all into the inode. | |
733 | */ | |
d8cc890d | 734 | if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) { |
9d87c319 | 735 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 736 | error = xfs_attr3_leaf_to_shortform(bp, args, forkoff); |
1da177e4 LT |
737 | /* bp is gone due to xfs_da_shrink_inode */ |
738 | if (!error) { | |
739 | error = xfs_bmap_finish(&args->trans, | |
740 | args->flist, | |
1da177e4 LT |
741 | &committed); |
742 | } | |
743 | if (error) { | |
744 | ASSERT(committed); | |
745 | args->trans = NULL; | |
746 | xfs_bmap_cancel(args->flist); | |
d99831ff | 747 | return error; |
1da177e4 LT |
748 | } |
749 | ||
750 | /* | |
751 | * bmap_finish() may have committed the last trans | |
752 | * and started a new one. We need the inode to be | |
753 | * in all transactions. | |
754 | */ | |
898621d5 | 755 | if (committed) |
ddc3415a | 756 | xfs_trans_ijoin(args->trans, dp, 0); |
1d9025e5 | 757 | } |
1da177e4 LT |
758 | |
759 | /* | |
760 | * Commit the remove and start the next trans in series. | |
761 | */ | |
322ff6b8 | 762 | error = xfs_trans_roll(&args->trans, dp); |
1da177e4 LT |
763 | |
764 | } else if (args->rmtblkno > 0) { | |
765 | /* | |
766 | * Added a "remote" value, just clear the incomplete flag. | |
767 | */ | |
517c2220 | 768 | error = xfs_attr3_leaf_clearflag(args); |
1da177e4 | 769 | } |
517c2220 | 770 | return error; |
1da177e4 LT |
771 | } |
772 | ||
773 | /* | |
774 | * Remove a name from the leaf attribute list structure | |
775 | * | |
776 | * This leaf block cannot have a "remote" value, we only call this routine | |
777 | * if bmap_one_block() says there is only one block (ie: no remote blks). | |
778 | */ | |
779 | STATIC int | |
780 | xfs_attr_leaf_removename(xfs_da_args_t *args) | |
781 | { | |
782 | xfs_inode_t *dp; | |
1d9025e5 | 783 | struct xfs_buf *bp; |
d8cc890d | 784 | int error, committed, forkoff; |
1da177e4 | 785 | |
5a5881cd DC |
786 | trace_xfs_attr_leaf_removename(args); |
787 | ||
1da177e4 LT |
788 | /* |
789 | * Remove the attribute. | |
790 | */ | |
791 | dp = args->dp; | |
792 | args->blkno = 0; | |
517c2220 | 793 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
ad14c33a DC |
794 | if (error) |
795 | return error; | |
1da177e4 | 796 | |
517c2220 | 797 | error = xfs_attr3_leaf_lookup_int(bp, args); |
1da177e4 | 798 | if (error == ENOATTR) { |
1d9025e5 | 799 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 800 | return error; |
1da177e4 LT |
801 | } |
802 | ||
517c2220 | 803 | xfs_attr3_leaf_remove(bp, args); |
1da177e4 LT |
804 | |
805 | /* | |
806 | * If the result is small enough, shrink it all into the inode. | |
807 | */ | |
d8cc890d | 808 | if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) { |
9d87c319 | 809 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 810 | error = xfs_attr3_leaf_to_shortform(bp, args, forkoff); |
1da177e4 LT |
811 | /* bp is gone due to xfs_da_shrink_inode */ |
812 | if (!error) { | |
813 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 814 | &committed); |
1da177e4 LT |
815 | } |
816 | if (error) { | |
817 | ASSERT(committed); | |
818 | args->trans = NULL; | |
819 | xfs_bmap_cancel(args->flist); | |
517c2220 | 820 | return error; |
1da177e4 LT |
821 | } |
822 | ||
823 | /* | |
824 | * bmap_finish() may have committed the last trans and started | |
825 | * a new one. We need the inode to be in all transactions. | |
826 | */ | |
898621d5 | 827 | if (committed) |
ddc3415a | 828 | xfs_trans_ijoin(args->trans, dp, 0); |
1d9025e5 | 829 | } |
517c2220 | 830 | return 0; |
1da177e4 LT |
831 | } |
832 | ||
833 | /* | |
834 | * Look up a name in a leaf attribute list structure. | |
835 | * | |
836 | * This leaf block cannot have a "remote" value, we only call this routine | |
837 | * if bmap_one_block() says there is only one block (ie: no remote blks). | |
838 | */ | |
ba0f32d4 | 839 | STATIC int |
1da177e4 LT |
840 | xfs_attr_leaf_get(xfs_da_args_t *args) |
841 | { | |
1d9025e5 | 842 | struct xfs_buf *bp; |
1da177e4 LT |
843 | int error; |
844 | ||
ee73259b DC |
845 | trace_xfs_attr_leaf_get(args); |
846 | ||
1da177e4 | 847 | args->blkno = 0; |
517c2220 | 848 | error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); |
1da177e4 | 849 | if (error) |
ad14c33a | 850 | return error; |
1da177e4 | 851 | |
517c2220 | 852 | error = xfs_attr3_leaf_lookup_int(bp, args); |
1da177e4 | 853 | if (error != EEXIST) { |
1d9025e5 | 854 | xfs_trans_brelse(args->trans, bp); |
517c2220 | 855 | return error; |
1da177e4 | 856 | } |
517c2220 | 857 | error = xfs_attr3_leaf_getvalue(bp, args); |
1d9025e5 | 858 | xfs_trans_brelse(args->trans, bp); |
1da177e4 LT |
859 | if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) { |
860 | error = xfs_attr_rmtval_get(args); | |
861 | } | |
517c2220 | 862 | return error; |
1da177e4 LT |
863 | } |
864 | ||
1da177e4 | 865 | /*======================================================================== |
c2c4c477 | 866 | * External routines when attribute list size > geo->blksize |
1da177e4 LT |
867 | *========================================================================*/ |
868 | ||
869 | /* | |
870 | * Add a name to a Btree-format attribute list. | |
871 | * | |
872 | * This will involve walking down the Btree, and may involve splitting | |
873 | * leaf nodes and even splitting intermediate nodes up to and including | |
874 | * the root node (a special case of an intermediate node). | |
875 | * | |
876 | * "Remote" attribute values confuse the issue and atomic rename operations | |
877 | * add a whole extra layer of confusion on top of that. | |
878 | */ | |
879 | STATIC int | |
880 | xfs_attr_node_addname(xfs_da_args_t *args) | |
881 | { | |
882 | xfs_da_state_t *state; | |
883 | xfs_da_state_blk_t *blk; | |
884 | xfs_inode_t *dp; | |
885 | xfs_mount_t *mp; | |
886 | int committed, retval, error; | |
887 | ||
5a5881cd DC |
888 | trace_xfs_attr_node_addname(args); |
889 | ||
1da177e4 LT |
890 | /* |
891 | * Fill in bucket of arguments/results/context to carry around. | |
892 | */ | |
893 | dp = args->dp; | |
894 | mp = dp->i_mount; | |
895 | restart: | |
896 | state = xfs_da_state_alloc(); | |
897 | state->args = args; | |
898 | state->mp = mp; | |
1da177e4 LT |
899 | |
900 | /* | |
901 | * Search to see if name already exists, and get back a pointer | |
902 | * to where it should go. | |
903 | */ | |
f5ea1100 | 904 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
905 | if (error) |
906 | goto out; | |
907 | blk = &state->path.blk[ state->path.active-1 ]; | |
908 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
909 | if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) { | |
910 | goto out; | |
911 | } else if (retval == EEXIST) { | |
912 | if (args->flags & ATTR_CREATE) | |
913 | goto out; | |
5a5881cd DC |
914 | |
915 | trace_xfs_attr_node_replace(args); | |
916 | ||
8275cdd0 | 917 | /* save the attribute state for later removal*/ |
6a178100 | 918 | args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */ |
1da177e4 LT |
919 | args->blkno2 = args->blkno; /* set 2nd entry info*/ |
920 | args->index2 = args->index; | |
921 | args->rmtblkno2 = args->rmtblkno; | |
922 | args->rmtblkcnt2 = args->rmtblkcnt; | |
8275cdd0 DC |
923 | args->rmtvaluelen2 = args->rmtvaluelen; |
924 | ||
925 | /* | |
926 | * clear the remote attr state now that it is saved so that the | |
927 | * values reflect the state of the attribute we are about to | |
928 | * add, not the attribute we just found and will remove later. | |
929 | */ | |
1da177e4 LT |
930 | args->rmtblkno = 0; |
931 | args->rmtblkcnt = 0; | |
8275cdd0 | 932 | args->rmtvaluelen = 0; |
1da177e4 LT |
933 | } |
934 | ||
517c2220 | 935 | retval = xfs_attr3_leaf_add(blk->bp, state->args); |
1da177e4 LT |
936 | if (retval == ENOSPC) { |
937 | if (state->path.active == 1) { | |
938 | /* | |
939 | * Its really a single leaf node, but it had | |
940 | * out-of-line values so it looked like it *might* | |
941 | * have been a b-tree. | |
942 | */ | |
943 | xfs_da_state_free(state); | |
6dd93e9e | 944 | state = NULL; |
9d87c319 | 945 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 946 | error = xfs_attr3_leaf_to_node(args); |
1da177e4 LT |
947 | if (!error) { |
948 | error = xfs_bmap_finish(&args->trans, | |
949 | args->flist, | |
1da177e4 LT |
950 | &committed); |
951 | } | |
952 | if (error) { | |
953 | ASSERT(committed); | |
954 | args->trans = NULL; | |
955 | xfs_bmap_cancel(args->flist); | |
956 | goto out; | |
957 | } | |
958 | ||
959 | /* | |
960 | * bmap_finish() may have committed the last trans | |
961 | * and started a new one. We need the inode to be | |
962 | * in all transactions. | |
963 | */ | |
898621d5 | 964 | if (committed) |
ddc3415a | 965 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
966 | |
967 | /* | |
968 | * Commit the node conversion and start the next | |
969 | * trans in the chain. | |
970 | */ | |
322ff6b8 NS |
971 | error = xfs_trans_roll(&args->trans, dp); |
972 | if (error) | |
1da177e4 LT |
973 | goto out; |
974 | ||
975 | goto restart; | |
976 | } | |
977 | ||
978 | /* | |
979 | * Split as many Btree elements as required. | |
980 | * This code tracks the new and old attr's location | |
981 | * in the index/blkno/rmtblkno/rmtblkcnt fields and | |
982 | * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields. | |
983 | */ | |
9d87c319 | 984 | xfs_bmap_init(args->flist, args->firstblock); |
f5ea1100 | 985 | error = xfs_da3_split(state); |
1da177e4 LT |
986 | if (!error) { |
987 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 988 | &committed); |
1da177e4 LT |
989 | } |
990 | if (error) { | |
991 | ASSERT(committed); | |
992 | args->trans = NULL; | |
993 | xfs_bmap_cancel(args->flist); | |
994 | goto out; | |
995 | } | |
996 | ||
997 | /* | |
998 | * bmap_finish() may have committed the last trans and started | |
999 | * a new one. We need the inode to be in all transactions. | |
1000 | */ | |
898621d5 | 1001 | if (committed) |
ddc3415a | 1002 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
1003 | } else { |
1004 | /* | |
1005 | * Addition succeeded, update Btree hashvals. | |
1006 | */ | |
f5ea1100 | 1007 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
1008 | } |
1009 | ||
1010 | /* | |
1011 | * Kill the state structure, we're done with it and need to | |
1012 | * allow the buffers to come back later. | |
1013 | */ | |
1014 | xfs_da_state_free(state); | |
1015 | state = NULL; | |
1016 | ||
1017 | /* | |
1018 | * Commit the leaf addition or btree split and start the next | |
1019 | * trans in the chain. | |
1020 | */ | |
322ff6b8 NS |
1021 | error = xfs_trans_roll(&args->trans, dp); |
1022 | if (error) | |
1da177e4 LT |
1023 | goto out; |
1024 | ||
1025 | /* | |
1026 | * If there was an out-of-line value, allocate the blocks we | |
1027 | * identified for its storage and copy the value. This is done | |
1028 | * after we create the attribute so that we don't overflow the | |
1029 | * maximum size of a transaction and/or hit a deadlock. | |
1030 | */ | |
1031 | if (args->rmtblkno > 0) { | |
1032 | error = xfs_attr_rmtval_set(args); | |
1033 | if (error) | |
d99831ff | 1034 | return error; |
1da177e4 LT |
1035 | } |
1036 | ||
1037 | /* | |
1038 | * If this is an atomic rename operation, we must "flip" the | |
1039 | * incomplete flags on the "new" and "old" attribute/value pairs | |
1040 | * so that one disappears and one appears atomically. Then we | |
1041 | * must remove the "old" attribute/value pair. | |
1042 | */ | |
6a178100 | 1043 | if (args->op_flags & XFS_DA_OP_RENAME) { |
1da177e4 LT |
1044 | /* |
1045 | * In a separate transaction, set the incomplete flag on the | |
1046 | * "old" attr and clear the incomplete flag on the "new" attr. | |
1047 | */ | |
517c2220 | 1048 | error = xfs_attr3_leaf_flipflags(args); |
1da177e4 LT |
1049 | if (error) |
1050 | goto out; | |
1051 | ||
1052 | /* | |
1053 | * Dismantle the "old" attribute/value pair by removing | |
1054 | * a "remote" value (if it exists). | |
1055 | */ | |
1056 | args->index = args->index2; | |
1057 | args->blkno = args->blkno2; | |
1058 | args->rmtblkno = args->rmtblkno2; | |
1059 | args->rmtblkcnt = args->rmtblkcnt2; | |
8275cdd0 | 1060 | args->rmtvaluelen = args->rmtvaluelen2; |
1da177e4 LT |
1061 | if (args->rmtblkno) { |
1062 | error = xfs_attr_rmtval_remove(args); | |
1063 | if (error) | |
d99831ff | 1064 | return error; |
1da177e4 LT |
1065 | } |
1066 | ||
1067 | /* | |
1068 | * Re-find the "old" attribute entry after any split ops. | |
1069 | * The INCOMPLETE flag means that we will find the "old" | |
1070 | * attr, not the "new" one. | |
1071 | */ | |
1072 | args->flags |= XFS_ATTR_INCOMPLETE; | |
1073 | state = xfs_da_state_alloc(); | |
1074 | state->args = args; | |
1075 | state->mp = mp; | |
1da177e4 | 1076 | state->inleaf = 0; |
f5ea1100 | 1077 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
1078 | if (error) |
1079 | goto out; | |
1080 | ||
1081 | /* | |
1082 | * Remove the name and update the hashvals in the tree. | |
1083 | */ | |
1084 | blk = &state->path.blk[ state->path.active-1 ]; | |
1085 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
517c2220 | 1086 | error = xfs_attr3_leaf_remove(blk->bp, args); |
f5ea1100 | 1087 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
1088 | |
1089 | /* | |
1090 | * Check to see if the tree needs to be collapsed. | |
1091 | */ | |
1092 | if (retval && (state->path.active > 1)) { | |
9d87c319 | 1093 | xfs_bmap_init(args->flist, args->firstblock); |
f5ea1100 | 1094 | error = xfs_da3_join(state); |
1da177e4 LT |
1095 | if (!error) { |
1096 | error = xfs_bmap_finish(&args->trans, | |
1097 | args->flist, | |
1da177e4 LT |
1098 | &committed); |
1099 | } | |
1100 | if (error) { | |
1101 | ASSERT(committed); | |
1102 | args->trans = NULL; | |
1103 | xfs_bmap_cancel(args->flist); | |
1104 | goto out; | |
1105 | } | |
1106 | ||
1107 | /* | |
1108 | * bmap_finish() may have committed the last trans | |
1109 | * and started a new one. We need the inode to be | |
1110 | * in all transactions. | |
1111 | */ | |
898621d5 | 1112 | if (committed) |
ddc3415a | 1113 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
1114 | } |
1115 | ||
1116 | /* | |
1117 | * Commit and start the next trans in the chain. | |
1118 | */ | |
322ff6b8 NS |
1119 | error = xfs_trans_roll(&args->trans, dp); |
1120 | if (error) | |
1da177e4 LT |
1121 | goto out; |
1122 | ||
1123 | } else if (args->rmtblkno > 0) { | |
1124 | /* | |
1125 | * Added a "remote" value, just clear the incomplete flag. | |
1126 | */ | |
517c2220 | 1127 | error = xfs_attr3_leaf_clearflag(args); |
1da177e4 LT |
1128 | if (error) |
1129 | goto out; | |
1130 | } | |
1131 | retval = error = 0; | |
1132 | ||
1133 | out: | |
1134 | if (state) | |
1135 | xfs_da_state_free(state); | |
1136 | if (error) | |
d99831ff ES |
1137 | return error; |
1138 | return retval; | |
1da177e4 LT |
1139 | } |
1140 | ||
1141 | /* | |
1142 | * Remove a name from a B-tree attribute list. | |
1143 | * | |
1144 | * This will involve walking down the Btree, and may involve joining | |
1145 | * leaf nodes and even joining intermediate nodes up to and including | |
1146 | * the root node (a special case of an intermediate node). | |
1147 | */ | |
1148 | STATIC int | |
1149 | xfs_attr_node_removename(xfs_da_args_t *args) | |
1150 | { | |
1151 | xfs_da_state_t *state; | |
1152 | xfs_da_state_blk_t *blk; | |
1153 | xfs_inode_t *dp; | |
1d9025e5 | 1154 | struct xfs_buf *bp; |
d8cc890d | 1155 | int retval, error, committed, forkoff; |
1da177e4 | 1156 | |
5a5881cd DC |
1157 | trace_xfs_attr_node_removename(args); |
1158 | ||
1da177e4 LT |
1159 | /* |
1160 | * Tie a string around our finger to remind us where we are. | |
1161 | */ | |
1162 | dp = args->dp; | |
1163 | state = xfs_da_state_alloc(); | |
1164 | state->args = args; | |
1165 | state->mp = dp->i_mount; | |
1da177e4 LT |
1166 | |
1167 | /* | |
1168 | * Search to see if name exists, and get back a pointer to it. | |
1169 | */ | |
f5ea1100 | 1170 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
1171 | if (error || (retval != EEXIST)) { |
1172 | if (error == 0) | |
1173 | error = retval; | |
1174 | goto out; | |
1175 | } | |
1176 | ||
1177 | /* | |
1178 | * If there is an out-of-line value, de-allocate the blocks. | |
1179 | * This is done before we remove the attribute so that we don't | |
1180 | * overflow the maximum size of a transaction and/or hit a deadlock. | |
1181 | */ | |
1182 | blk = &state->path.blk[ state->path.active-1 ]; | |
1183 | ASSERT(blk->bp != NULL); | |
1184 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
1185 | if (args->rmtblkno > 0) { | |
1186 | /* | |
1187 | * Fill in disk block numbers in the state structure | |
1188 | * so that we can get the buffers back after we commit | |
1189 | * several transactions in the following calls. | |
1190 | */ | |
1191 | error = xfs_attr_fillstate(state); | |
1192 | if (error) | |
1193 | goto out; | |
1194 | ||
1195 | /* | |
1196 | * Mark the attribute as INCOMPLETE, then bunmapi() the | |
1197 | * remote value. | |
1198 | */ | |
517c2220 | 1199 | error = xfs_attr3_leaf_setflag(args); |
1da177e4 LT |
1200 | if (error) |
1201 | goto out; | |
1202 | error = xfs_attr_rmtval_remove(args); | |
1203 | if (error) | |
1204 | goto out; | |
1205 | ||
1206 | /* | |
1207 | * Refill the state structure with buffers, the prior calls | |
1208 | * released our buffers. | |
1209 | */ | |
1210 | error = xfs_attr_refillstate(state); | |
1211 | if (error) | |
1212 | goto out; | |
1213 | } | |
1214 | ||
1215 | /* | |
1216 | * Remove the name and update the hashvals in the tree. | |
1217 | */ | |
1218 | blk = &state->path.blk[ state->path.active-1 ]; | |
1219 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
517c2220 | 1220 | retval = xfs_attr3_leaf_remove(blk->bp, args); |
f5ea1100 | 1221 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
1222 | |
1223 | /* | |
1224 | * Check to see if the tree needs to be collapsed. | |
1225 | */ | |
1226 | if (retval && (state->path.active > 1)) { | |
9d87c319 | 1227 | xfs_bmap_init(args->flist, args->firstblock); |
f5ea1100 | 1228 | error = xfs_da3_join(state); |
1da177e4 LT |
1229 | if (!error) { |
1230 | error = xfs_bmap_finish(&args->trans, args->flist, | |
f7c99b6f | 1231 | &committed); |
1da177e4 LT |
1232 | } |
1233 | if (error) { | |
1234 | ASSERT(committed); | |
1235 | args->trans = NULL; | |
1236 | xfs_bmap_cancel(args->flist); | |
1237 | goto out; | |
1238 | } | |
1239 | ||
1240 | /* | |
1241 | * bmap_finish() may have committed the last trans and started | |
1242 | * a new one. We need the inode to be in all transactions. | |
1243 | */ | |
898621d5 | 1244 | if (committed) |
ddc3415a | 1245 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 LT |
1246 | |
1247 | /* | |
1248 | * Commit the Btree join operation and start a new trans. | |
1249 | */ | |
322ff6b8 NS |
1250 | error = xfs_trans_roll(&args->trans, dp); |
1251 | if (error) | |
1da177e4 LT |
1252 | goto out; |
1253 | } | |
1254 | ||
1255 | /* | |
1256 | * If the result is small enough, push it all into the inode. | |
1257 | */ | |
1258 | if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) { | |
1259 | /* | |
1260 | * Have to get rid of the copy of this dabuf in the state. | |
1261 | */ | |
1262 | ASSERT(state->path.active == 1); | |
1263 | ASSERT(state->path.blk[0].bp); | |
1da177e4 LT |
1264 | state->path.blk[0].bp = NULL; |
1265 | ||
517c2220 | 1266 | error = xfs_attr3_leaf_read(args->trans, args->dp, 0, -1, &bp); |
1da177e4 LT |
1267 | if (error) |
1268 | goto out; | |
1da177e4 | 1269 | |
d8cc890d | 1270 | if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) { |
9d87c319 | 1271 | xfs_bmap_init(args->flist, args->firstblock); |
517c2220 | 1272 | error = xfs_attr3_leaf_to_shortform(bp, args, forkoff); |
1da177e4 LT |
1273 | /* bp is gone due to xfs_da_shrink_inode */ |
1274 | if (!error) { | |
1275 | error = xfs_bmap_finish(&args->trans, | |
1276 | args->flist, | |
1da177e4 LT |
1277 | &committed); |
1278 | } | |
1279 | if (error) { | |
1280 | ASSERT(committed); | |
1281 | args->trans = NULL; | |
1282 | xfs_bmap_cancel(args->flist); | |
1283 | goto out; | |
1284 | } | |
1285 | ||
1286 | /* | |
1287 | * bmap_finish() may have committed the last trans | |
1288 | * and started a new one. We need the inode to be | |
1289 | * in all transactions. | |
1290 | */ | |
898621d5 | 1291 | if (committed) |
ddc3415a | 1292 | xfs_trans_ijoin(args->trans, dp, 0); |
1da177e4 | 1293 | } else |
1d9025e5 | 1294 | xfs_trans_brelse(args->trans, bp); |
1da177e4 LT |
1295 | } |
1296 | error = 0; | |
1297 | ||
1298 | out: | |
1299 | xfs_da_state_free(state); | |
d99831ff | 1300 | return error; |
1da177e4 LT |
1301 | } |
1302 | ||
1303 | /* | |
1304 | * Fill in the disk block numbers in the state structure for the buffers | |
1305 | * that are attached to the state structure. | |
1306 | * This is done so that we can quickly reattach ourselves to those buffers | |
c41564b5 | 1307 | * after some set of transaction commits have released these buffers. |
1da177e4 LT |
1308 | */ |
1309 | STATIC int | |
1310 | xfs_attr_fillstate(xfs_da_state_t *state) | |
1311 | { | |
1312 | xfs_da_state_path_t *path; | |
1313 | xfs_da_state_blk_t *blk; | |
1314 | int level; | |
1315 | ||
ee73259b DC |
1316 | trace_xfs_attr_fillstate(state->args); |
1317 | ||
1da177e4 LT |
1318 | /* |
1319 | * Roll down the "path" in the state structure, storing the on-disk | |
1320 | * block number for those buffers in the "path". | |
1321 | */ | |
1322 | path = &state->path; | |
1323 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1324 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1325 | if (blk->bp) { | |
1d9025e5 | 1326 | blk->disk_blkno = XFS_BUF_ADDR(blk->bp); |
1da177e4 LT |
1327 | blk->bp = NULL; |
1328 | } else { | |
1329 | blk->disk_blkno = 0; | |
1330 | } | |
1331 | } | |
1332 | ||
1333 | /* | |
1334 | * Roll down the "altpath" in the state structure, storing the on-disk | |
1335 | * block number for those buffers in the "altpath". | |
1336 | */ | |
1337 | path = &state->altpath; | |
1338 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1339 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1340 | if (blk->bp) { | |
1d9025e5 | 1341 | blk->disk_blkno = XFS_BUF_ADDR(blk->bp); |
1da177e4 LT |
1342 | blk->bp = NULL; |
1343 | } else { | |
1344 | blk->disk_blkno = 0; | |
1345 | } | |
1346 | } | |
1347 | ||
d99831ff | 1348 | return 0; |
1da177e4 LT |
1349 | } |
1350 | ||
1351 | /* | |
1352 | * Reattach the buffers to the state structure based on the disk block | |
1353 | * numbers stored in the state structure. | |
c41564b5 | 1354 | * This is done after some set of transaction commits have released those |
1da177e4 LT |
1355 | * buffers from our grip. |
1356 | */ | |
1357 | STATIC int | |
1358 | xfs_attr_refillstate(xfs_da_state_t *state) | |
1359 | { | |
1360 | xfs_da_state_path_t *path; | |
1361 | xfs_da_state_blk_t *blk; | |
1362 | int level, error; | |
1363 | ||
ee73259b DC |
1364 | trace_xfs_attr_refillstate(state->args); |
1365 | ||
1da177e4 LT |
1366 | /* |
1367 | * Roll down the "path" in the state structure, storing the on-disk | |
1368 | * block number for those buffers in the "path". | |
1369 | */ | |
1370 | path = &state->path; | |
1371 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1372 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1373 | if (blk->disk_blkno) { | |
f5ea1100 | 1374 | error = xfs_da3_node_read(state->args->trans, |
1da177e4 LT |
1375 | state->args->dp, |
1376 | blk->blkno, blk->disk_blkno, | |
d9392a4b | 1377 | &blk->bp, XFS_ATTR_FORK); |
1da177e4 | 1378 | if (error) |
d99831ff | 1379 | return error; |
1da177e4 LT |
1380 | } else { |
1381 | blk->bp = NULL; | |
1382 | } | |
1383 | } | |
1384 | ||
1385 | /* | |
1386 | * Roll down the "altpath" in the state structure, storing the on-disk | |
1387 | * block number for those buffers in the "altpath". | |
1388 | */ | |
1389 | path = &state->altpath; | |
1390 | ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1391 | for (blk = path->blk, level = 0; level < path->active; blk++, level++) { | |
1392 | if (blk->disk_blkno) { | |
f5ea1100 | 1393 | error = xfs_da3_node_read(state->args->trans, |
1da177e4 LT |
1394 | state->args->dp, |
1395 | blk->blkno, blk->disk_blkno, | |
d9392a4b | 1396 | &blk->bp, XFS_ATTR_FORK); |
1da177e4 | 1397 | if (error) |
d99831ff | 1398 | return error; |
1da177e4 LT |
1399 | } else { |
1400 | blk->bp = NULL; | |
1401 | } | |
1402 | } | |
1403 | ||
d99831ff | 1404 | return 0; |
1da177e4 LT |
1405 | } |
1406 | ||
1407 | /* | |
1408 | * Look up a filename in a node attribute list. | |
1409 | * | |
1410 | * This routine gets called for any attribute fork that has more than one | |
1411 | * block, ie: both true Btree attr lists and for single-leaf-blocks with | |
1412 | * "remote" values taking up more blocks. | |
1413 | */ | |
ba0f32d4 | 1414 | STATIC int |
1da177e4 LT |
1415 | xfs_attr_node_get(xfs_da_args_t *args) |
1416 | { | |
1417 | xfs_da_state_t *state; | |
1418 | xfs_da_state_blk_t *blk; | |
1419 | int error, retval; | |
1420 | int i; | |
1421 | ||
ee73259b DC |
1422 | trace_xfs_attr_node_get(args); |
1423 | ||
1da177e4 LT |
1424 | state = xfs_da_state_alloc(); |
1425 | state->args = args; | |
1426 | state->mp = args->dp->i_mount; | |
1da177e4 LT |
1427 | |
1428 | /* | |
1429 | * Search to see if name exists, and get back a pointer to it. | |
1430 | */ | |
f5ea1100 | 1431 | error = xfs_da3_node_lookup_int(state, &retval); |
1da177e4 LT |
1432 | if (error) { |
1433 | retval = error; | |
1434 | } else if (retval == EEXIST) { | |
1435 | blk = &state->path.blk[ state->path.active-1 ]; | |
1436 | ASSERT(blk->bp != NULL); | |
1437 | ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC); | |
1438 | ||
1439 | /* | |
1440 | * Get the value, local or "remote" | |
1441 | */ | |
517c2220 | 1442 | retval = xfs_attr3_leaf_getvalue(blk->bp, args); |
1da177e4 LT |
1443 | if (!retval && (args->rmtblkno > 0) |
1444 | && !(args->flags & ATTR_KERNOVAL)) { | |
1445 | retval = xfs_attr_rmtval_get(args); | |
1446 | } | |
1447 | } | |
1448 | ||
1449 | /* | |
1450 | * If not in a transaction, we have to release all the buffers. | |
1451 | */ | |
1452 | for (i = 0; i < state->path.active; i++) { | |
1d9025e5 | 1453 | xfs_trans_brelse(args->trans, state->path.blk[i].bp); |
1da177e4 LT |
1454 | state->path.blk[i].bp = NULL; |
1455 | } | |
1456 | ||
1457 | xfs_da_state_free(state); | |
d99831ff | 1458 | return retval; |
1da177e4 | 1459 | } |