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