]>
git.ipfire.org Git - thirdparty/xfsprogs-dev.git/blob - libxfs/xfs_attr.c
0002c3ed82dd9badf588c422ac64d8f359459251
2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
18 #include "libxfs_priv.h"
20 #include "xfs_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
25 #include "xfs_mount.h"
26 #include "xfs_defer.h"
27 #include "xfs_da_format.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_attr_sf.h"
30 #include "xfs_inode.h"
31 #include "xfs_alloc.h"
32 #include "xfs_trans.h"
34 #include "xfs_bmap_btree.h"
35 #include "xfs_attr_leaf.h"
36 #include "xfs_attr_remote.h"
37 #include "xfs_trans_space.h"
38 #include "xfs_trace.h"
43 * Provide the external interfaces to manage attribute lists.
46 /*========================================================================
47 * Function prototypes for the kernel.
48 *========================================================================*/
51 * Internal routines when attribute list fits inside the inode.
53 STATIC
int xfs_attr_shortform_addname(xfs_da_args_t
*args
);
56 * Internal routines when attribute list is one block.
58 STATIC
int xfs_attr_leaf_get(xfs_da_args_t
*args
);
59 STATIC
int xfs_attr_leaf_addname(xfs_da_args_t
*args
);
60 STATIC
int xfs_attr_leaf_removename(xfs_da_args_t
*args
);
63 * Internal routines when attribute list is more than one block.
65 STATIC
int xfs_attr_node_get(xfs_da_args_t
*args
);
66 STATIC
int xfs_attr_node_addname(xfs_da_args_t
*args
);
67 STATIC
int xfs_attr_node_removename(xfs_da_args_t
*args
);
68 STATIC
int xfs_attr_fillstate(xfs_da_state_t
*state
);
69 STATIC
int xfs_attr_refillstate(xfs_da_state_t
*state
);
74 struct xfs_da_args
*args
,
76 const unsigned char *name
,
83 memset(args
, 0, sizeof(*args
));
84 args
->geo
= dp
->i_mount
->m_attr_geo
;
85 args
->whichfork
= XFS_ATTR_FORK
;
89 args
->namelen
= strlen((const char *)name
);
90 if (args
->namelen
>= MAXNAMELEN
)
91 return -EFAULT
; /* match IRIX behaviour */
93 args
->hashval
= xfs_da_hashname(args
->name
, args
->namelen
);
101 if (!XFS_IFORK_Q(ip
) ||
102 (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
&&
103 ip
->i_d
.di_anextents
== 0))
108 /*========================================================================
109 * Overall external interface routines.
110 *========================================================================*/
112 /* Retrieve an extended attribute and its value. Must have ilock. */
114 xfs_attr_get_ilocked(
115 struct xfs_inode
*ip
,
116 struct xfs_da_args
*args
)
118 ASSERT(xfs_isilocked(ip
, XFS_ILOCK_SHARED
| XFS_ILOCK_EXCL
));
120 if (!xfs_inode_hasattr(ip
))
122 else if (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
)
123 return xfs_attr_shortform_getvalue(args
);
124 else if (xfs_bmap_one_block(ip
, XFS_ATTR_FORK
))
125 return xfs_attr_leaf_get(args
);
127 return xfs_attr_node_get(args
);
130 /* Retrieve an extended attribute by name, and its value. */
133 struct xfs_inode
*ip
,
134 const unsigned char *name
,
135 unsigned char *value
,
139 struct xfs_da_args args
;
143 XFS_STATS_INC(ip
->i_mount
, xs_attr_get
);
145 if (XFS_FORCED_SHUTDOWN(ip
->i_mount
))
148 error
= xfs_attr_args_init(&args
, ip
, name
, flags
);
153 args
.valuelen
= *valuelenp
;
154 /* Entirely possible to look up a name which doesn't exist */
155 args
.op_flags
= XFS_DA_OP_OKNOENT
;
157 lock_mode
= xfs_ilock_attr_map_shared(ip
);
158 error
= xfs_attr_get_ilocked(ip
, &args
);
159 xfs_iunlock(ip
, lock_mode
);
161 *valuelenp
= args
.valuelen
;
162 return error
== -EEXIST
? 0 : error
;
166 * Calculate how many blocks we need for the new attribute,
170 struct xfs_da_args
*args
,
173 struct xfs_mount
*mp
= args
->dp
->i_mount
;
178 * Determine space new attribute will use, and if it would be
179 * "local" or "remote" (note: local != inline).
181 size
= xfs_attr_leaf_newentsize(args
, local
);
182 nblks
= XFS_DAENTER_SPACE_RES(mp
, XFS_ATTR_FORK
);
184 if (size
> (args
->geo
->blksize
/ 2)) {
185 /* Double split possible */
190 * Out of line attribute, cannot double split, but
191 * make room for the attribute value itself.
193 uint dblocks
= xfs_attr3_rmt_blocks(mp
, args
->valuelen
);
195 nblks
+= XFS_NEXTENTADD_SPACE_RES(mp
, dblocks
, XFS_ATTR_FORK
);
203 struct xfs_inode
*dp
,
204 const unsigned char *name
,
205 unsigned char *value
,
209 struct xfs_mount
*mp
= dp
->i_mount
;
210 struct xfs_buf
*leaf_bp
= NULL
;
211 struct xfs_da_args args
;
212 struct xfs_defer_ops dfops
;
213 struct xfs_trans_res tres
;
214 xfs_fsblock_t firstblock
;
215 int rsvd
= (flags
& ATTR_ROOT
) != 0;
216 int error
, err2
, local
;
218 XFS_STATS_INC(mp
, xs_attr_set
);
220 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
223 error
= xfs_attr_args_init(&args
, dp
, name
, flags
);
228 args
.valuelen
= valuelen
;
229 args
.firstblock
= &firstblock
;
231 args
.op_flags
= XFS_DA_OP_ADDNAME
| XFS_DA_OP_OKNOENT
;
232 args
.total
= xfs_attr_calc_size(&args
, &local
);
234 error
= xfs_qm_dqattach(dp
, 0);
239 * If the inode doesn't have an attribute fork, add one.
240 * (inode must not be locked when we call this routine)
242 if (XFS_IFORK_Q(dp
) == 0) {
243 int sf_size
= sizeof(xfs_attr_sf_hdr_t
) +
244 XFS_ATTR_SF_ENTSIZE_BYNAME(args
.namelen
, valuelen
);
246 error
= xfs_bmap_add_attrfork(dp
, sf_size
, rsvd
);
251 tres
.tr_logres
= M_RES(mp
)->tr_attrsetm
.tr_logres
+
252 M_RES(mp
)->tr_attrsetrt
.tr_logres
* args
.total
;
253 tres
.tr_logcount
= XFS_ATTRSET_LOG_COUNT
;
254 tres
.tr_logflags
= XFS_TRANS_PERM_LOG_RES
;
257 * Root fork attributes can use reserved data blocks for this
258 * operation if necessary
260 error
= xfs_trans_alloc(mp
, &tres
, args
.total
, 0,
261 rsvd
? XFS_TRANS_RESERVE
: 0, &args
.trans
);
265 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
266 error
= xfs_trans_reserve_quota_nblks(args
.trans
, dp
, args
.total
, 0,
267 rsvd
? XFS_QMOPT_RES_REGBLKS
| XFS_QMOPT_FORCE_RES
:
268 XFS_QMOPT_RES_REGBLKS
);
270 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
271 xfs_trans_cancel(args
.trans
);
275 xfs_trans_ijoin(args
.trans
, dp
, 0);
278 * If the attribute list is non-existent or a shortform list,
279 * upgrade it to a single-leaf-block attribute list.
281 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
||
282 (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
&&
283 dp
->i_d
.di_anextents
== 0)) {
286 * Build initial attribute list (if required).
288 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
)
289 xfs_attr_shortform_create(&args
);
292 * Try to add the attr to the attribute list in
295 error
= xfs_attr_shortform_addname(&args
);
296 if (error
!= -ENOSPC
) {
298 * Commit the shortform mods, and we're done.
299 * NOTE: this is also the error path (EEXIST, etc).
301 ASSERT(args
.trans
!= NULL
);
304 * If this is a synchronous mount, make sure that
305 * the transaction goes to disk before returning
308 if (mp
->m_flags
& XFS_MOUNT_WSYNC
)
309 xfs_trans_set_sync(args
.trans
);
311 if (!error
&& (flags
& ATTR_KERNOTIME
) == 0) {
312 xfs_trans_ichgtime(args
.trans
, dp
,
315 err2
= xfs_trans_commit(args
.trans
);
316 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
318 return error
? error
: err2
;
322 * It won't fit in the shortform, transform to a leaf block.
323 * GROT: another possible req'mt for a double-split btree op.
325 xfs_defer_init(args
.dfops
, args
.firstblock
);
326 error
= xfs_attr_shortform_to_leaf(&args
, &leaf_bp
);
328 goto out_defer_cancel
;
330 * Prevent the leaf buffer from being unlocked so that a
331 * concurrent AIL push cannot grab the half-baked leaf
332 * buffer and run into problems with the write verifier.
334 xfs_trans_bhold(args
.trans
, leaf_bp
);
335 xfs_defer_bjoin(args
.dfops
, leaf_bp
);
336 xfs_defer_ijoin(args
.dfops
, dp
);
337 error
= xfs_defer_finish(&args
.trans
, args
.dfops
);
339 goto out_defer_cancel
;
342 * Commit the leaf transformation. We'll need another (linked)
343 * transaction to add the new attribute to the leaf, which
344 * means that we have to hold & join the leaf buffer here too.
346 error
= xfs_trans_roll_inode(&args
.trans
, dp
);
349 xfs_trans_bjoin(args
.trans
, leaf_bp
);
353 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
))
354 error
= xfs_attr_leaf_addname(&args
);
356 error
= xfs_attr_node_addname(&args
);
361 * If this is a synchronous mount, make sure that the
362 * transaction goes to disk before returning to the user.
364 if (mp
->m_flags
& XFS_MOUNT_WSYNC
)
365 xfs_trans_set_sync(args
.trans
);
367 if ((flags
& ATTR_KERNOTIME
) == 0)
368 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
371 * Commit the last in the sequence of transactions.
373 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
374 error
= xfs_trans_commit(args
.trans
);
375 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
380 xfs_defer_cancel(&dfops
);
383 xfs_trans_brelse(args
.trans
, leaf_bp
);
385 xfs_trans_cancel(args
.trans
);
386 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
391 * Generic handler routine to remove a name from an attribute list.
392 * Transitions attribute list from Btree to shortform as necessary.
396 struct xfs_inode
*dp
,
397 const unsigned char *name
,
400 struct xfs_mount
*mp
= dp
->i_mount
;
401 struct xfs_da_args args
;
402 struct xfs_defer_ops dfops
;
403 xfs_fsblock_t firstblock
;
406 XFS_STATS_INC(mp
, xs_attr_remove
);
408 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
411 error
= xfs_attr_args_init(&args
, dp
, name
, flags
);
415 args
.firstblock
= &firstblock
;
419 * we have no control over the attribute names that userspace passes us
420 * to remove, so we have to allow the name lookup prior to attribute
423 args
.op_flags
= XFS_DA_OP_OKNOENT
;
425 error
= xfs_qm_dqattach(dp
, 0);
430 * Root fork attributes can use reserved data blocks for this
431 * operation if necessary
433 error
= xfs_trans_alloc(mp
, &M_RES(mp
)->tr_attrrm
,
434 XFS_ATTRRM_SPACE_RES(mp
), 0,
435 (flags
& ATTR_ROOT
) ? XFS_TRANS_RESERVE
: 0,
440 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
442 * No need to make quota reservations here. We expect to release some
443 * blocks not allocate in the common case.
445 xfs_trans_ijoin(args
.trans
, dp
, 0);
447 if (!xfs_inode_hasattr(dp
)) {
449 } else if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
450 ASSERT(dp
->i_afp
->if_flags
& XFS_IFINLINE
);
451 error
= xfs_attr_shortform_remove(&args
);
452 } else if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
453 error
= xfs_attr_leaf_removename(&args
);
455 error
= xfs_attr_node_removename(&args
);
462 * If this is a synchronous mount, make sure that the
463 * transaction goes to disk before returning to the user.
465 if (mp
->m_flags
& XFS_MOUNT_WSYNC
)
466 xfs_trans_set_sync(args
.trans
);
468 if ((flags
& ATTR_KERNOTIME
) == 0)
469 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
472 * Commit the last in the sequence of transactions.
474 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
475 error
= xfs_trans_commit(args
.trans
);
476 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
482 xfs_trans_cancel(args
.trans
);
483 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
487 /*========================================================================
488 * External routines when attribute list is inside the inode
489 *========================================================================*/
492 * Add a name to the shortform attribute list structure
493 * This is the external routine.
496 xfs_attr_shortform_addname(xfs_da_args_t
*args
)
498 int newsize
, forkoff
, retval
;
500 trace_xfs_attr_sf_addname(args
);
502 retval
= xfs_attr_shortform_lookup(args
);
503 if ((args
->flags
& ATTR_REPLACE
) && (retval
== -ENOATTR
)) {
505 } else if (retval
== -EEXIST
) {
506 if (args
->flags
& ATTR_CREATE
)
508 retval
= xfs_attr_shortform_remove(args
);
512 * Since we have removed the old attr, clear ATTR_REPLACE so
513 * that the leaf format add routine won't trip over the attr
516 args
->flags
&= ~ATTR_REPLACE
;
519 if (args
->namelen
>= XFS_ATTR_SF_ENTSIZE_MAX
||
520 args
->valuelen
>= XFS_ATTR_SF_ENTSIZE_MAX
)
523 newsize
= XFS_ATTR_SF_TOTSIZE(args
->dp
);
524 newsize
+= XFS_ATTR_SF_ENTSIZE_BYNAME(args
->namelen
, args
->valuelen
);
526 forkoff
= xfs_attr_shortform_bytesfit(args
->dp
, newsize
);
530 xfs_attr_shortform_add(args
, forkoff
);
535 /*========================================================================
536 * External routines when attribute list is one block
537 *========================================================================*/
540 * Add a name to the leaf attribute list structure
542 * This leaf block cannot have a "remote" value, we only call this routine
543 * if bmap_one_block() says there is only one block (ie: no remote blks).
546 xfs_attr_leaf_addname(xfs_da_args_t
*args
)
550 int retval
, error
, forkoff
;
552 trace_xfs_attr_leaf_addname(args
);
555 * Read the (only) block in the attribute list in.
559 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
564 * Look up the given attribute in the leaf block. Figure out if
565 * the given flags produce an error or call for an atomic rename.
567 retval
= xfs_attr3_leaf_lookup_int(bp
, args
);
568 if ((args
->flags
& ATTR_REPLACE
) && (retval
== -ENOATTR
)) {
569 xfs_trans_brelse(args
->trans
, bp
);
571 } else if (retval
== -EEXIST
) {
572 if (args
->flags
& ATTR_CREATE
) { /* pure create op */
573 xfs_trans_brelse(args
->trans
, bp
);
577 trace_xfs_attr_leaf_replace(args
);
579 /* save the attribute state for later removal*/
580 args
->op_flags
|= XFS_DA_OP_RENAME
; /* an atomic rename */
581 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
582 args
->index2
= args
->index
;
583 args
->rmtblkno2
= args
->rmtblkno
;
584 args
->rmtblkcnt2
= args
->rmtblkcnt
;
585 args
->rmtvaluelen2
= args
->rmtvaluelen
;
588 * clear the remote attr state now that it is saved so that the
589 * values reflect the state of the attribute we are about to
590 * add, not the attribute we just found and will remove later.
594 args
->rmtvaluelen
= 0;
598 * Add the attribute to the leaf block, transitioning to a Btree
601 retval
= xfs_attr3_leaf_add(bp
, args
);
602 if (retval
== -ENOSPC
) {
604 * Promote the attribute list to the Btree format, then
605 * Commit that transaction so that the node_addname() call
606 * can manage its own transactions.
608 xfs_defer_init(args
->dfops
, args
->firstblock
);
609 error
= xfs_attr3_leaf_to_node(args
);
611 goto out_defer_cancel
;
612 xfs_defer_ijoin(args
->dfops
, dp
);
613 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
615 goto out_defer_cancel
;
618 * Commit the current trans (including the inode) and start
621 error
= xfs_trans_roll_inode(&args
->trans
, dp
);
626 * Fob the whole rest of the problem off on the Btree code.
628 error
= xfs_attr_node_addname(args
);
633 * Commit the transaction that added the attr name so that
634 * later routines can manage their own transactions.
636 error
= xfs_trans_roll_inode(&args
->trans
, dp
);
641 * If there was an out-of-line value, allocate the blocks we
642 * identified for its storage and copy the value. This is done
643 * after we create the attribute so that we don't overflow the
644 * maximum size of a transaction and/or hit a deadlock.
646 if (args
->rmtblkno
> 0) {
647 error
= xfs_attr_rmtval_set(args
);
653 * If this is an atomic rename operation, we must "flip" the
654 * incomplete flags on the "new" and "old" attribute/value pairs
655 * so that one disappears and one appears atomically. Then we
656 * must remove the "old" attribute/value pair.
658 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
660 * In a separate transaction, set the incomplete flag on the
661 * "old" attr and clear the incomplete flag on the "new" attr.
663 error
= xfs_attr3_leaf_flipflags(args
);
668 * Dismantle the "old" attribute/value pair by removing
669 * a "remote" value (if it exists).
671 args
->index
= args
->index2
;
672 args
->blkno
= args
->blkno2
;
673 args
->rmtblkno
= args
->rmtblkno2
;
674 args
->rmtblkcnt
= args
->rmtblkcnt2
;
675 args
->rmtvaluelen
= args
->rmtvaluelen2
;
676 if (args
->rmtblkno
) {
677 error
= xfs_attr_rmtval_remove(args
);
683 * Read in the block containing the "old" attr, then
684 * remove the "old" attr from that block (neat, huh!)
686 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
,
691 xfs_attr3_leaf_remove(bp
, args
);
694 * If the result is small enough, shrink it all into the inode.
696 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
697 xfs_defer_init(args
->dfops
, args
->firstblock
);
698 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
699 /* bp is gone due to xfs_da_shrink_inode */
701 goto out_defer_cancel
;
702 xfs_defer_ijoin(args
->dfops
, dp
);
703 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
705 goto out_defer_cancel
;
709 * Commit the remove and start the next trans in series.
711 error
= xfs_trans_roll_inode(&args
->trans
, dp
);
713 } else if (args
->rmtblkno
> 0) {
715 * Added a "remote" value, just clear the incomplete flag.
717 error
= xfs_attr3_leaf_clearflag(args
);
721 xfs_defer_cancel(args
->dfops
);
726 * Remove a name from the leaf attribute list structure
728 * This leaf block cannot have a "remote" value, we only call this routine
729 * if bmap_one_block() says there is only one block (ie: no remote blks).
732 xfs_attr_leaf_removename(xfs_da_args_t
*args
)
738 trace_xfs_attr_leaf_removename(args
);
741 * Remove the attribute.
745 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
749 error
= xfs_attr3_leaf_lookup_int(bp
, args
);
750 if (error
== -ENOATTR
) {
751 xfs_trans_brelse(args
->trans
, bp
);
755 xfs_attr3_leaf_remove(bp
, args
);
758 * If the result is small enough, shrink it all into the inode.
760 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
761 xfs_defer_init(args
->dfops
, args
->firstblock
);
762 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
763 /* bp is gone due to xfs_da_shrink_inode */
765 goto out_defer_cancel
;
766 xfs_defer_ijoin(args
->dfops
, dp
);
767 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
769 goto out_defer_cancel
;
773 xfs_defer_cancel(args
->dfops
);
778 * Look up a name in a leaf attribute list structure.
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).
784 xfs_attr_leaf_get(xfs_da_args_t
*args
)
789 trace_xfs_attr_leaf_get(args
);
792 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
796 error
= xfs_attr3_leaf_lookup_int(bp
, args
);
797 if (error
!= -EEXIST
) {
798 xfs_trans_brelse(args
->trans
, bp
);
801 error
= xfs_attr3_leaf_getvalue(bp
, args
);
802 xfs_trans_brelse(args
->trans
, bp
);
803 if (!error
&& (args
->rmtblkno
> 0) && !(args
->flags
& ATTR_KERNOVAL
)) {
804 error
= xfs_attr_rmtval_get(args
);
809 /*========================================================================
810 * External routines when attribute list size > geo->blksize
811 *========================================================================*/
814 * Add a name to a Btree-format attribute list.
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).
820 * "Remote" attribute values confuse the issue and atomic rename operations
821 * add a whole extra layer of confusion on top of that.
824 xfs_attr_node_addname(xfs_da_args_t
*args
)
826 xfs_da_state_t
*state
;
827 xfs_da_state_blk_t
*blk
;
832 trace_xfs_attr_node_addname(args
);
835 * Fill in bucket of arguments/results/context to carry around.
840 state
= xfs_da_state_alloc();
845 * Search to see if name already exists, and get back a pointer
846 * to where it should go.
848 error
= xfs_da3_node_lookup_int(state
, &retval
);
851 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
852 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
853 if ((args
->flags
& ATTR_REPLACE
) && (retval
== -ENOATTR
)) {
855 } else if (retval
== -EEXIST
) {
856 if (args
->flags
& ATTR_CREATE
)
859 trace_xfs_attr_node_replace(args
);
861 /* save the attribute state for later removal*/
862 args
->op_flags
|= XFS_DA_OP_RENAME
; /* atomic rename op */
863 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
864 args
->index2
= args
->index
;
865 args
->rmtblkno2
= args
->rmtblkno
;
866 args
->rmtblkcnt2
= args
->rmtblkcnt
;
867 args
->rmtvaluelen2
= args
->rmtvaluelen
;
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.
876 args
->rmtvaluelen
= 0;
879 retval
= xfs_attr3_leaf_add(blk
->bp
, state
->args
);
880 if (retval
== -ENOSPC
) {
881 if (state
->path
.active
== 1) {
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.
887 xfs_da_state_free(state
);
889 xfs_defer_init(args
->dfops
, args
->firstblock
);
890 error
= xfs_attr3_leaf_to_node(args
);
892 goto out_defer_cancel
;
893 xfs_defer_ijoin(args
->dfops
, dp
);
894 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
896 goto out_defer_cancel
;
899 * Commit the node conversion and start the next
900 * trans in the chain.
902 error
= xfs_trans_roll_inode(&args
->trans
, dp
);
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.
915 xfs_defer_init(args
->dfops
, args
->firstblock
);
916 error
= xfs_da3_split(state
);
918 goto out_defer_cancel
;
919 xfs_defer_ijoin(args
->dfops
, dp
);
920 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
922 goto out_defer_cancel
;
925 * Addition succeeded, update Btree hashvals.
927 xfs_da3_fixhashpath(state
, &state
->path
);
931 * Kill the state structure, we're done with it and need to
932 * allow the buffers to come back later.
934 xfs_da_state_free(state
);
938 * Commit the leaf addition or btree split and start the next
939 * trans in the chain.
941 error
= xfs_trans_roll_inode(&args
->trans
, dp
);
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.
951 if (args
->rmtblkno
> 0) {
952 error
= xfs_attr_rmtval_set(args
);
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.
963 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
965 * In a separate transaction, set the incomplete flag on the
966 * "old" attr and clear the incomplete flag on the "new" attr.
968 error
= xfs_attr3_leaf_flipflags(args
);
973 * Dismantle the "old" attribute/value pair by removing
974 * a "remote" value (if it exists).
976 args
->index
= args
->index2
;
977 args
->blkno
= args
->blkno2
;
978 args
->rmtblkno
= args
->rmtblkno2
;
979 args
->rmtblkcnt
= args
->rmtblkcnt2
;
980 args
->rmtvaluelen
= args
->rmtvaluelen2
;
981 if (args
->rmtblkno
) {
982 error
= xfs_attr_rmtval_remove(args
);
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.
992 args
->flags
|= XFS_ATTR_INCOMPLETE
;
993 state
= xfs_da_state_alloc();
997 error
= xfs_da3_node_lookup_int(state
, &retval
);
1002 * Remove the name and update the hashvals in the tree.
1004 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1005 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1006 error
= xfs_attr3_leaf_remove(blk
->bp
, args
);
1007 xfs_da3_fixhashpath(state
, &state
->path
);
1010 * Check to see if the tree needs to be collapsed.
1012 if (retval
&& (state
->path
.active
> 1)) {
1013 xfs_defer_init(args
->dfops
, args
->firstblock
);
1014 error
= xfs_da3_join(state
);
1016 goto out_defer_cancel
;
1017 xfs_defer_ijoin(args
->dfops
, dp
);
1018 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
1020 goto out_defer_cancel
;
1024 * Commit and start the next trans in the chain.
1026 error
= xfs_trans_roll_inode(&args
->trans
, dp
);
1030 } else if (args
->rmtblkno
> 0) {
1032 * Added a "remote" value, just clear the incomplete flag.
1034 error
= xfs_attr3_leaf_clearflag(args
);
1042 xfs_da_state_free(state
);
1047 xfs_defer_cancel(args
->dfops
);
1052 * Remove a name from a B-tree attribute list.
1054 * This will involve walking down the Btree, and may involve joining
1055 * leaf nodes and even joining intermediate nodes up to and including
1056 * the root node (a special case of an intermediate node).
1059 xfs_attr_node_removename(xfs_da_args_t
*args
)
1061 xfs_da_state_t
*state
;
1062 xfs_da_state_blk_t
*blk
;
1065 int retval
, error
, forkoff
;
1067 trace_xfs_attr_node_removename(args
);
1070 * Tie a string around our finger to remind us where we are.
1073 state
= xfs_da_state_alloc();
1075 state
->mp
= dp
->i_mount
;
1078 * Search to see if name exists, and get back a pointer to it.
1080 error
= xfs_da3_node_lookup_int(state
, &retval
);
1081 if (error
|| (retval
!= -EEXIST
)) {
1088 * If there is an out-of-line value, de-allocate the blocks.
1089 * This is done before we remove the attribute so that we don't
1090 * overflow the maximum size of a transaction and/or hit a deadlock.
1092 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1093 ASSERT(blk
->bp
!= NULL
);
1094 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1095 if (args
->rmtblkno
> 0) {
1097 * Fill in disk block numbers in the state structure
1098 * so that we can get the buffers back after we commit
1099 * several transactions in the following calls.
1101 error
= xfs_attr_fillstate(state
);
1106 * Mark the attribute as INCOMPLETE, then bunmapi() the
1109 error
= xfs_attr3_leaf_setflag(args
);
1112 error
= xfs_attr_rmtval_remove(args
);
1117 * Refill the state structure with buffers, the prior calls
1118 * released our buffers.
1120 error
= xfs_attr_refillstate(state
);
1126 * Remove the name and update the hashvals in the tree.
1128 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1129 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1130 retval
= xfs_attr3_leaf_remove(blk
->bp
, args
);
1131 xfs_da3_fixhashpath(state
, &state
->path
);
1134 * Check to see if the tree needs to be collapsed.
1136 if (retval
&& (state
->path
.active
> 1)) {
1137 xfs_defer_init(args
->dfops
, args
->firstblock
);
1138 error
= xfs_da3_join(state
);
1140 goto out_defer_cancel
;
1141 xfs_defer_ijoin(args
->dfops
, dp
);
1142 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
1144 goto out_defer_cancel
;
1146 * Commit the Btree join operation and start a new trans.
1148 error
= xfs_trans_roll_inode(&args
->trans
, dp
);
1154 * If the result is small enough, push it all into the inode.
1156 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
1158 * Have to get rid of the copy of this dabuf in the state.
1160 ASSERT(state
->path
.active
== 1);
1161 ASSERT(state
->path
.blk
[0].bp
);
1162 state
->path
.blk
[0].bp
= NULL
;
1164 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, 0, -1, &bp
);
1168 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1169 xfs_defer_init(args
->dfops
, args
->firstblock
);
1170 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
1171 /* bp is gone due to xfs_da_shrink_inode */
1173 goto out_defer_cancel
;
1174 xfs_defer_ijoin(args
->dfops
, dp
);
1175 error
= xfs_defer_finish(&args
->trans
, args
->dfops
);
1177 goto out_defer_cancel
;
1179 xfs_trans_brelse(args
->trans
, bp
);
1184 xfs_da_state_free(state
);
1187 xfs_defer_cancel(args
->dfops
);
1192 * Fill in the disk block numbers in the state structure for the buffers
1193 * that are attached to the state structure.
1194 * This is done so that we can quickly reattach ourselves to those buffers
1195 * after some set of transaction commits have released these buffers.
1198 xfs_attr_fillstate(xfs_da_state_t
*state
)
1200 xfs_da_state_path_t
*path
;
1201 xfs_da_state_blk_t
*blk
;
1204 trace_xfs_attr_fillstate(state
->args
);
1207 * Roll down the "path" in the state structure, storing the on-disk
1208 * block number for those buffers in the "path".
1210 path
= &state
->path
;
1211 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1212 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1214 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1217 blk
->disk_blkno
= 0;
1222 * Roll down the "altpath" in the state structure, storing the on-disk
1223 * block number for those buffers in the "altpath".
1225 path
= &state
->altpath
;
1226 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1227 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1229 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1232 blk
->disk_blkno
= 0;
1240 * Reattach the buffers to the state structure based on the disk block
1241 * numbers stored in the state structure.
1242 * This is done after some set of transaction commits have released those
1243 * buffers from our grip.
1246 xfs_attr_refillstate(xfs_da_state_t
*state
)
1248 xfs_da_state_path_t
*path
;
1249 xfs_da_state_blk_t
*blk
;
1252 trace_xfs_attr_refillstate(state
->args
);
1255 * Roll down the "path" in the state structure, storing the on-disk
1256 * block number for those buffers in the "path".
1258 path
= &state
->path
;
1259 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1260 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1261 if (blk
->disk_blkno
) {
1262 error
= xfs_da3_node_read(state
->args
->trans
,
1264 blk
->blkno
, blk
->disk_blkno
,
1265 &blk
->bp
, XFS_ATTR_FORK
);
1274 * Roll down the "altpath" in the state structure, storing the on-disk
1275 * block number for those buffers in the "altpath".
1277 path
= &state
->altpath
;
1278 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1279 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1280 if (blk
->disk_blkno
) {
1281 error
= xfs_da3_node_read(state
->args
->trans
,
1283 blk
->blkno
, blk
->disk_blkno
,
1284 &blk
->bp
, XFS_ATTR_FORK
);
1296 * Look up a filename in a node attribute list.
1298 * This routine gets called for any attribute fork that has more than one
1299 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1300 * "remote" values taking up more blocks.
1303 xfs_attr_node_get(xfs_da_args_t
*args
)
1305 xfs_da_state_t
*state
;
1306 xfs_da_state_blk_t
*blk
;
1310 trace_xfs_attr_node_get(args
);
1312 state
= xfs_da_state_alloc();
1314 state
->mp
= args
->dp
->i_mount
;
1317 * Search to see if name exists, and get back a pointer to it.
1319 error
= xfs_da3_node_lookup_int(state
, &retval
);
1322 } else if (retval
== -EEXIST
) {
1323 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1324 ASSERT(blk
->bp
!= NULL
);
1325 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1328 * Get the value, local or "remote"
1330 retval
= xfs_attr3_leaf_getvalue(blk
->bp
, args
);
1331 if (!retval
&& (args
->rmtblkno
> 0)
1332 && !(args
->flags
& ATTR_KERNOVAL
)) {
1333 retval
= xfs_attr_rmtval_get(args
);
1338 * If not in a transaction, we have to release all the buffers.
1340 for (i
= 0; i
< state
->path
.active
; i
++) {
1341 xfs_trans_brelse(args
->trans
, state
->path
.blk
[i
].bp
);
1342 state
->path
.blk
[i
].bp
= NULL
;
1345 xfs_da_state_free(state
);