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