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
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_da_format.h"
27 #include "xfs_da_btree.h"
28 #include "xfs_attr_sf.h"
29 #include "xfs_inode.h"
30 #include "xfs_alloc.h"
31 #include "xfs_trans.h"
32 #include "xfs_inode_item.h"
34 #include "xfs_bmap_util.h"
35 #include "xfs_bmap_btree.h"
37 #include "xfs_attr_leaf.h"
38 #include "xfs_attr_remote.h"
39 #include "xfs_error.h"
40 #include "xfs_quota.h"
41 #include "xfs_trans_space.h"
42 #include "xfs_trace.h"
47 * Provide the external interfaces to manage attribute lists.
50 /*========================================================================
51 * Function prototypes for the kernel.
52 *========================================================================*/
55 * Internal routines when attribute list fits inside the inode.
57 STATIC
int xfs_attr_shortform_addname(xfs_da_args_t
*args
);
60 * Internal routines when attribute list is one block.
62 STATIC
int xfs_attr_leaf_get(xfs_da_args_t
*args
);
63 STATIC
int xfs_attr_leaf_addname(xfs_da_args_t
*args
);
64 STATIC
int xfs_attr_leaf_removename(xfs_da_args_t
*args
);
67 * Internal routines when attribute list is more than one block.
69 STATIC
int xfs_attr_node_get(xfs_da_args_t
*args
);
70 STATIC
int xfs_attr_node_addname(xfs_da_args_t
*args
);
71 STATIC
int xfs_attr_node_removename(xfs_da_args_t
*args
);
72 STATIC
int xfs_attr_fillstate(xfs_da_state_t
*state
);
73 STATIC
int xfs_attr_refillstate(xfs_da_state_t
*state
);
78 struct xfs_da_args
*args
,
80 const unsigned char *name
,
87 memset(args
, 0, sizeof(*args
));
88 args
->geo
= dp
->i_mount
->m_attr_geo
;
89 args
->whichfork
= XFS_ATTR_FORK
;
93 args
->namelen
= strlen((const char *)name
);
94 if (args
->namelen
>= MAXNAMELEN
)
95 return -EFAULT
; /* match IRIX behaviour */
97 args
->hashval
= xfs_da_hashname(args
->name
, args
->namelen
);
103 struct xfs_inode
*ip
)
105 if (!XFS_IFORK_Q(ip
) ||
106 (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
&&
107 ip
->i_d
.di_anextents
== 0))
112 /*========================================================================
113 * Overall external interface routines.
114 *========================================================================*/
118 struct xfs_inode
*ip
,
119 const unsigned char *name
,
120 unsigned char *value
,
124 struct xfs_da_args args
;
128 XFS_STATS_INC(xs_attr_get
);
130 if (XFS_FORCED_SHUTDOWN(ip
->i_mount
))
133 if (!xfs_inode_hasattr(ip
))
136 error
= xfs_attr_args_init(&args
, ip
, name
, flags
);
141 args
.valuelen
= *valuelenp
;
143 lock_mode
= xfs_ilock_attr_map_shared(ip
);
144 if (!xfs_inode_hasattr(ip
))
146 else if (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
)
147 error
= xfs_attr_shortform_getvalue(&args
);
148 else if (xfs_bmap_one_block(ip
, XFS_ATTR_FORK
))
149 error
= xfs_attr_leaf_get(&args
);
151 error
= xfs_attr_node_get(&args
);
152 xfs_iunlock(ip
, lock_mode
);
154 *valuelenp
= args
.valuelen
;
155 return error
== -EEXIST
? 0 : error
;
159 * Calculate how many blocks we need for the new attribute,
163 struct xfs_da_args
*args
,
166 struct xfs_mount
*mp
= args
->dp
->i_mount
;
171 * Determine space new attribute will use, and if it would be
172 * "local" or "remote" (note: local != inline).
174 size
= xfs_attr_leaf_newentsize(args
, local
);
175 nblks
= XFS_DAENTER_SPACE_RES(mp
, XFS_ATTR_FORK
);
177 if (size
> (args
->geo
->blksize
/ 2)) {
178 /* Double split possible */
183 * Out of line attribute, cannot double split, but
184 * make room for the attribute value itself.
186 uint dblocks
= xfs_attr3_rmt_blocks(mp
, args
->valuelen
);
188 nblks
+= XFS_NEXTENTADD_SPACE_RES(mp
, dblocks
, XFS_ATTR_FORK
);
196 struct xfs_inode
*dp
,
197 const unsigned char *name
,
198 unsigned char *value
,
202 struct xfs_mount
*mp
= dp
->i_mount
;
203 struct xfs_da_args args
;
204 struct xfs_bmap_free flist
;
205 struct xfs_trans_res tres
;
206 xfs_fsblock_t firstblock
;
207 int rsvd
= (flags
& ATTR_ROOT
) != 0;
208 int error
, err2
, committed
, local
;
210 XFS_STATS_INC(xs_attr_set
);
212 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
215 error
= xfs_attr_args_init(&args
, dp
, name
, flags
);
220 args
.valuelen
= valuelen
;
221 args
.firstblock
= &firstblock
;
223 args
.op_flags
= XFS_DA_OP_ADDNAME
| XFS_DA_OP_OKNOENT
;
224 args
.total
= xfs_attr_calc_size(&args
, &local
);
226 error
= xfs_qm_dqattach(dp
, 0);
231 * If the inode doesn't have an attribute fork, add one.
232 * (inode must not be locked when we call this routine)
234 if (XFS_IFORK_Q(dp
) == 0) {
235 int sf_size
= sizeof(xfs_attr_sf_hdr_t
) +
236 XFS_ATTR_SF_ENTSIZE_BYNAME(args
.namelen
, valuelen
);
238 error
= xfs_bmap_add_attrfork(dp
, sf_size
, rsvd
);
244 * Start our first transaction of the day.
246 * All future transactions during this code must be "chained" off
247 * this one via the trans_dup() call. All transactions will contain
248 * the inode, and the inode will always be marked with trans_ihold().
249 * Since the inode will be locked in all transactions, we must log
250 * the inode in every transaction to let it float upward through
253 args
.trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTR_SET
);
256 * Root fork attributes can use reserved data blocks for this
257 * operation if necessary
261 args
.trans
->t_flags
|= XFS_TRANS_RESERVE
;
263 tres
.tr_logres
= M_RES(mp
)->tr_attrsetm
.tr_logres
+
264 M_RES(mp
)->tr_attrsetrt
.tr_logres
* args
.total
;
265 tres
.tr_logcount
= XFS_ATTRSET_LOG_COUNT
;
266 tres
.tr_logflags
= XFS_TRANS_PERM_LOG_RES
;
267 error
= xfs_trans_reserve(args
.trans
, &tres
, args
.total
, 0);
269 xfs_trans_cancel(args
.trans
);
272 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
274 error
= xfs_trans_reserve_quota_nblks(args
.trans
, dp
, args
.total
, 0,
275 rsvd
? XFS_QMOPT_RES_REGBLKS
| XFS_QMOPT_FORCE_RES
:
276 XFS_QMOPT_RES_REGBLKS
);
278 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
279 xfs_trans_cancel(args
.trans
);
283 xfs_trans_ijoin(args
.trans
, dp
, 0);
286 * If the attribute list is non-existent or a shortform list,
287 * upgrade it to a single-leaf-block attribute list.
289 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
||
290 (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
&&
291 dp
->i_d
.di_anextents
== 0)) {
294 * Build initial attribute list (if required).
296 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
)
297 xfs_attr_shortform_create(&args
);
300 * Try to add the attr to the attribute list in
303 error
= xfs_attr_shortform_addname(&args
);
304 if (error
!= -ENOSPC
) {
306 * Commit the shortform mods, and we're done.
307 * NOTE: this is also the error path (EEXIST, etc).
309 ASSERT(args
.trans
!= NULL
);
312 * If this is a synchronous mount, make sure that
313 * the transaction goes to disk before returning
316 if (mp
->m_flags
& XFS_MOUNT_WSYNC
)
317 xfs_trans_set_sync(args
.trans
);
319 if (!error
&& (flags
& ATTR_KERNOTIME
) == 0) {
320 xfs_trans_ichgtime(args
.trans
, dp
,
323 err2
= xfs_trans_commit(args
.trans
);
324 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
326 return error
? error
: err2
;
330 * It won't fit in the shortform, transform to a leaf block.
331 * GROT: another possible req'mt for a double-split btree op.
333 xfs_bmap_init(args
.flist
, args
.firstblock
);
334 error
= xfs_attr_shortform_to_leaf(&args
);
336 error
= xfs_bmap_finish(&args
.trans
, args
.flist
,
342 xfs_bmap_cancel(&flist
);
347 * bmap_finish() may have committed the last trans and started
348 * a new one. We need the inode to be in all transactions.
351 xfs_trans_ijoin(args
.trans
, dp
, 0);
354 * Commit the leaf transformation. We'll need another (linked)
355 * transaction to add the new attribute to the leaf.
358 error
= xfs_trans_roll(&args
.trans
, dp
);
364 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
))
365 error
= xfs_attr_leaf_addname(&args
);
367 error
= xfs_attr_node_addname(&args
);
372 * If this is a synchronous mount, make sure that the
373 * transaction goes to disk before returning to the user.
375 if (mp
->m_flags
& XFS_MOUNT_WSYNC
)
376 xfs_trans_set_sync(args
.trans
);
378 if ((flags
& ATTR_KERNOTIME
) == 0)
379 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
382 * Commit the last in the sequence of transactions.
384 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
385 error
= xfs_trans_commit(args
.trans
);
386 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
392 xfs_trans_cancel(args
.trans
);
393 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
398 * Generic handler routine to remove a name from an attribute list.
399 * Transitions attribute list from Btree to shortform as necessary.
403 struct xfs_inode
*dp
,
404 const unsigned char *name
,
407 struct xfs_mount
*mp
= dp
->i_mount
;
408 struct xfs_da_args args
;
409 struct xfs_bmap_free flist
;
410 xfs_fsblock_t firstblock
;
413 XFS_STATS_INC(xs_attr_remove
);
415 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
418 if (!xfs_inode_hasattr(dp
))
421 error
= xfs_attr_args_init(&args
, dp
, name
, flags
);
425 args
.firstblock
= &firstblock
;
429 * we have no control over the attribute names that userspace passes us
430 * to remove, so we have to allow the name lookup prior to attribute
433 args
.op_flags
= XFS_DA_OP_OKNOENT
;
435 error
= xfs_qm_dqattach(dp
, 0);
440 * Start our first transaction of the day.
442 * All future transactions during this code must be "chained" off
443 * this one via the trans_dup() call. All transactions will contain
444 * the inode, and the inode will always be marked with trans_ihold().
445 * Since the inode will be locked in all transactions, we must log
446 * the inode in every transaction to let it float upward through
449 args
.trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTR_RM
);
452 * Root fork attributes can use reserved data blocks for this
453 * operation if necessary
456 if (flags
& ATTR_ROOT
)
457 args
.trans
->t_flags
|= XFS_TRANS_RESERVE
;
459 error
= xfs_trans_reserve(args
.trans
, &M_RES(mp
)->tr_attrrm
,
460 XFS_ATTRRM_SPACE_RES(mp
), 0);
462 xfs_trans_cancel(args
.trans
);
466 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
468 * No need to make quota reservations here. We expect to release some
469 * blocks not allocate in the common case.
471 xfs_trans_ijoin(args
.trans
, dp
, 0);
473 if (!xfs_inode_hasattr(dp
)) {
475 } else if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
476 ASSERT(dp
->i_afp
->if_flags
& XFS_IFINLINE
);
477 error
= xfs_attr_shortform_remove(&args
);
478 } else if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
479 error
= xfs_attr_leaf_removename(&args
);
481 error
= xfs_attr_node_removename(&args
);
488 * If this is a synchronous mount, make sure that the
489 * transaction goes to disk before returning to the user.
491 if (mp
->m_flags
& XFS_MOUNT_WSYNC
)
492 xfs_trans_set_sync(args
.trans
);
494 if ((flags
& ATTR_KERNOTIME
) == 0)
495 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
498 * Commit the last in the sequence of transactions.
500 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
501 error
= xfs_trans_commit(args
.trans
);
502 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
508 xfs_trans_cancel(args
.trans
);
509 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
513 /*========================================================================
514 * External routines when attribute list is inside the inode
515 *========================================================================*/
518 * Add a name to the shortform attribute list structure
519 * This is the external routine.
522 xfs_attr_shortform_addname(xfs_da_args_t
*args
)
524 int newsize
, forkoff
, retval
;
526 trace_xfs_attr_sf_addname(args
);
528 retval
= xfs_attr_shortform_lookup(args
);
529 if ((args
->flags
& ATTR_REPLACE
) && (retval
== -ENOATTR
)) {
531 } else if (retval
== -EEXIST
) {
532 if (args
->flags
& ATTR_CREATE
)
534 retval
= xfs_attr_shortform_remove(args
);
538 if (args
->namelen
>= XFS_ATTR_SF_ENTSIZE_MAX
||
539 args
->valuelen
>= XFS_ATTR_SF_ENTSIZE_MAX
)
542 newsize
= XFS_ATTR_SF_TOTSIZE(args
->dp
);
543 newsize
+= XFS_ATTR_SF_ENTSIZE_BYNAME(args
->namelen
, args
->valuelen
);
545 forkoff
= xfs_attr_shortform_bytesfit(args
->dp
, newsize
);
549 xfs_attr_shortform_add(args
, forkoff
);
554 /*========================================================================
555 * External routines when attribute list is one block
556 *========================================================================*/
559 * Add a name to the leaf attribute list structure
561 * This leaf block cannot have a "remote" value, we only call this routine
562 * if bmap_one_block() says there is only one block (ie: no remote blks).
565 xfs_attr_leaf_addname(xfs_da_args_t
*args
)
569 int retval
, error
, committed
, forkoff
;
571 trace_xfs_attr_leaf_addname(args
);
574 * Read the (only) block in the attribute list in.
578 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
583 * Look up the given attribute in the leaf block. Figure out if
584 * the given flags produce an error or call for an atomic rename.
586 retval
= xfs_attr3_leaf_lookup_int(bp
, args
);
587 if ((args
->flags
& ATTR_REPLACE
) && (retval
== -ENOATTR
)) {
588 xfs_trans_brelse(args
->trans
, bp
);
590 } else if (retval
== -EEXIST
) {
591 if (args
->flags
& ATTR_CREATE
) { /* pure create op */
592 xfs_trans_brelse(args
->trans
, bp
);
596 trace_xfs_attr_leaf_replace(args
);
598 /* save the attribute state for later removal*/
599 args
->op_flags
|= XFS_DA_OP_RENAME
; /* an atomic rename */
600 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
601 args
->index2
= args
->index
;
602 args
->rmtblkno2
= args
->rmtblkno
;
603 args
->rmtblkcnt2
= args
->rmtblkcnt
;
604 args
->rmtvaluelen2
= args
->rmtvaluelen
;
607 * clear the remote attr state now that it is saved so that the
608 * values reflect the state of the attribute we are about to
609 * add, not the attribute we just found and will remove later.
613 args
->rmtvaluelen
= 0;
617 * Add the attribute to the leaf block, transitioning to a Btree
620 retval
= xfs_attr3_leaf_add(bp
, args
);
621 if (retval
== -ENOSPC
) {
623 * Promote the attribute list to the Btree format, then
624 * Commit that transaction so that the node_addname() call
625 * can manage its own transactions.
627 xfs_bmap_init(args
->flist
, args
->firstblock
);
628 error
= xfs_attr3_leaf_to_node(args
);
630 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
636 xfs_bmap_cancel(args
->flist
);
641 * bmap_finish() may have committed the last trans and started
642 * a new one. We need the inode to be in all transactions.
645 xfs_trans_ijoin(args
->trans
, dp
, 0);
648 * Commit the current trans (including the inode) and start
651 error
= xfs_trans_roll(&args
->trans
, dp
);
656 * Fob the whole rest of the problem off on the Btree code.
658 error
= xfs_attr_node_addname(args
);
663 * Commit the transaction that added the attr name so that
664 * later routines can manage their own transactions.
666 error
= xfs_trans_roll(&args
->trans
, dp
);
671 * If there was an out-of-line value, allocate the blocks we
672 * identified for its storage and copy the value. This is done
673 * after we create the attribute so that we don't overflow the
674 * maximum size of a transaction and/or hit a deadlock.
676 if (args
->rmtblkno
> 0) {
677 error
= xfs_attr_rmtval_set(args
);
683 * If this is an atomic rename operation, we must "flip" the
684 * incomplete flags on the "new" and "old" attribute/value pairs
685 * so that one disappears and one appears atomically. Then we
686 * must remove the "old" attribute/value pair.
688 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
690 * In a separate transaction, set the incomplete flag on the
691 * "old" attr and clear the incomplete flag on the "new" attr.
693 error
= xfs_attr3_leaf_flipflags(args
);
698 * Dismantle the "old" attribute/value pair by removing
699 * a "remote" value (if it exists).
701 args
->index
= args
->index2
;
702 args
->blkno
= args
->blkno2
;
703 args
->rmtblkno
= args
->rmtblkno2
;
704 args
->rmtblkcnt
= args
->rmtblkcnt2
;
705 args
->rmtvaluelen
= args
->rmtvaluelen2
;
706 if (args
->rmtblkno
) {
707 error
= xfs_attr_rmtval_remove(args
);
713 * Read in the block containing the "old" attr, then
714 * remove the "old" attr from that block (neat, huh!)
716 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
,
721 xfs_attr3_leaf_remove(bp
, args
);
724 * If the result is small enough, shrink it all into the inode.
726 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
727 xfs_bmap_init(args
->flist
, args
->firstblock
);
728 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
729 /* bp is gone due to xfs_da_shrink_inode */
731 error
= xfs_bmap_finish(&args
->trans
,
738 xfs_bmap_cancel(args
->flist
);
743 * bmap_finish() may have committed the last trans
744 * and started a new one. We need the inode to be
745 * in all transactions.
748 xfs_trans_ijoin(args
->trans
, dp
, 0);
752 * Commit the remove and start the next trans in series.
754 error
= xfs_trans_roll(&args
->trans
, dp
);
756 } else if (args
->rmtblkno
> 0) {
758 * Added a "remote" value, just clear the incomplete flag.
760 error
= xfs_attr3_leaf_clearflag(args
);
766 * Remove a name from the leaf attribute list structure
768 * This leaf block cannot have a "remote" value, we only call this routine
769 * if bmap_one_block() says there is only one block (ie: no remote blks).
772 xfs_attr_leaf_removename(xfs_da_args_t
*args
)
776 int error
, committed
, forkoff
;
778 trace_xfs_attr_leaf_removename(args
);
781 * Remove the attribute.
785 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
789 error
= xfs_attr3_leaf_lookup_int(bp
, args
);
790 if (error
== -ENOATTR
) {
791 xfs_trans_brelse(args
->trans
, bp
);
795 xfs_attr3_leaf_remove(bp
, args
);
798 * If the result is small enough, shrink it all into the inode.
800 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
801 xfs_bmap_init(args
->flist
, args
->firstblock
);
802 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
803 /* bp is gone due to xfs_da_shrink_inode */
805 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
811 xfs_bmap_cancel(args
->flist
);
816 * bmap_finish() may have committed the last trans and started
817 * a new one. We need the inode to be in all transactions.
820 xfs_trans_ijoin(args
->trans
, dp
, 0);
826 * Look up a name in a leaf attribute list structure.
828 * This leaf block cannot have a "remote" value, we only call this routine
829 * if bmap_one_block() says there is only one block (ie: no remote blks).
832 xfs_attr_leaf_get(xfs_da_args_t
*args
)
837 trace_xfs_attr_leaf_get(args
);
840 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
844 error
= xfs_attr3_leaf_lookup_int(bp
, args
);
845 if (error
!= -EEXIST
) {
846 xfs_trans_brelse(args
->trans
, bp
);
849 error
= xfs_attr3_leaf_getvalue(bp
, args
);
850 xfs_trans_brelse(args
->trans
, bp
);
851 if (!error
&& (args
->rmtblkno
> 0) && !(args
->flags
& ATTR_KERNOVAL
)) {
852 error
= xfs_attr_rmtval_get(args
);
857 /*========================================================================
858 * External routines when attribute list size > geo->blksize
859 *========================================================================*/
862 * Add a name to a Btree-format attribute list.
864 * This will involve walking down the Btree, and may involve splitting
865 * leaf nodes and even splitting intermediate nodes up to and including
866 * the root node (a special case of an intermediate node).
868 * "Remote" attribute values confuse the issue and atomic rename operations
869 * add a whole extra layer of confusion on top of that.
872 xfs_attr_node_addname(xfs_da_args_t
*args
)
874 xfs_da_state_t
*state
;
875 xfs_da_state_blk_t
*blk
;
878 int committed
, retval
, error
;
880 trace_xfs_attr_node_addname(args
);
883 * Fill in bucket of arguments/results/context to carry around.
888 state
= xfs_da_state_alloc();
893 * Search to see if name already exists, and get back a pointer
894 * to where it should go.
896 error
= xfs_da3_node_lookup_int(state
, &retval
);
899 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
900 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
901 if ((args
->flags
& ATTR_REPLACE
) && (retval
== -ENOATTR
)) {
903 } else if (retval
== -EEXIST
) {
904 if (args
->flags
& ATTR_CREATE
)
907 trace_xfs_attr_node_replace(args
);
909 /* save the attribute state for later removal*/
910 args
->op_flags
|= XFS_DA_OP_RENAME
; /* atomic rename op */
911 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
912 args
->index2
= args
->index
;
913 args
->rmtblkno2
= args
->rmtblkno
;
914 args
->rmtblkcnt2
= args
->rmtblkcnt
;
915 args
->rmtvaluelen2
= args
->rmtvaluelen
;
918 * clear the remote attr state now that it is saved so that the
919 * values reflect the state of the attribute we are about to
920 * add, not the attribute we just found and will remove later.
924 args
->rmtvaluelen
= 0;
927 retval
= xfs_attr3_leaf_add(blk
->bp
, state
->args
);
928 if (retval
== -ENOSPC
) {
929 if (state
->path
.active
== 1) {
931 * Its really a single leaf node, but it had
932 * out-of-line values so it looked like it *might*
933 * have been a b-tree.
935 xfs_da_state_free(state
);
937 xfs_bmap_init(args
->flist
, args
->firstblock
);
938 error
= xfs_attr3_leaf_to_node(args
);
940 error
= xfs_bmap_finish(&args
->trans
,
947 xfs_bmap_cancel(args
->flist
);
952 * bmap_finish() may have committed the last trans
953 * and started a new one. We need the inode to be
954 * in all transactions.
957 xfs_trans_ijoin(args
->trans
, dp
, 0);
960 * Commit the node conversion and start the next
961 * trans in the chain.
963 error
= xfs_trans_roll(&args
->trans
, dp
);
971 * Split as many Btree elements as required.
972 * This code tracks the new and old attr's location
973 * in the index/blkno/rmtblkno/rmtblkcnt fields and
974 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
976 xfs_bmap_init(args
->flist
, args
->firstblock
);
977 error
= xfs_da3_split(state
);
979 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
985 xfs_bmap_cancel(args
->flist
);
990 * bmap_finish() may have committed the last trans and started
991 * a new one. We need the inode to be in all transactions.
994 xfs_trans_ijoin(args
->trans
, dp
, 0);
997 * Addition succeeded, update Btree hashvals.
999 xfs_da3_fixhashpath(state
, &state
->path
);
1003 * Kill the state structure, we're done with it and need to
1004 * allow the buffers to come back later.
1006 xfs_da_state_free(state
);
1010 * Commit the leaf addition or btree split and start the next
1011 * trans in the chain.
1013 error
= xfs_trans_roll(&args
->trans
, dp
);
1018 * If there was an out-of-line value, allocate the blocks we
1019 * identified for its storage and copy the value. This is done
1020 * after we create the attribute so that we don't overflow the
1021 * maximum size of a transaction and/or hit a deadlock.
1023 if (args
->rmtblkno
> 0) {
1024 error
= xfs_attr_rmtval_set(args
);
1030 * If this is an atomic rename operation, we must "flip" the
1031 * incomplete flags on the "new" and "old" attribute/value pairs
1032 * so that one disappears and one appears atomically. Then we
1033 * must remove the "old" attribute/value pair.
1035 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
1037 * In a separate transaction, set the incomplete flag on the
1038 * "old" attr and clear the incomplete flag on the "new" attr.
1040 error
= xfs_attr3_leaf_flipflags(args
);
1045 * Dismantle the "old" attribute/value pair by removing
1046 * a "remote" value (if it exists).
1048 args
->index
= args
->index2
;
1049 args
->blkno
= args
->blkno2
;
1050 args
->rmtblkno
= args
->rmtblkno2
;
1051 args
->rmtblkcnt
= args
->rmtblkcnt2
;
1052 args
->rmtvaluelen
= args
->rmtvaluelen2
;
1053 if (args
->rmtblkno
) {
1054 error
= xfs_attr_rmtval_remove(args
);
1060 * Re-find the "old" attribute entry after any split ops.
1061 * The INCOMPLETE flag means that we will find the "old"
1062 * attr, not the "new" one.
1064 args
->flags
|= XFS_ATTR_INCOMPLETE
;
1065 state
= xfs_da_state_alloc();
1069 error
= xfs_da3_node_lookup_int(state
, &retval
);
1074 * Remove the name and update the hashvals in the tree.
1076 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1077 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1078 error
= xfs_attr3_leaf_remove(blk
->bp
, args
);
1079 xfs_da3_fixhashpath(state
, &state
->path
);
1082 * Check to see if the tree needs to be collapsed.
1084 if (retval
&& (state
->path
.active
> 1)) {
1085 xfs_bmap_init(args
->flist
, args
->firstblock
);
1086 error
= xfs_da3_join(state
);
1088 error
= xfs_bmap_finish(&args
->trans
,
1095 xfs_bmap_cancel(args
->flist
);
1100 * bmap_finish() may have committed the last trans
1101 * and started a new one. We need the inode to be
1102 * in all transactions.
1105 xfs_trans_ijoin(args
->trans
, dp
, 0);
1109 * Commit and start the next trans in the chain.
1111 error
= xfs_trans_roll(&args
->trans
, dp
);
1115 } else if (args
->rmtblkno
> 0) {
1117 * Added a "remote" value, just clear the incomplete flag.
1119 error
= xfs_attr3_leaf_clearflag(args
);
1127 xfs_da_state_free(state
);
1134 * Remove a name from a B-tree attribute list.
1136 * This will involve walking down the Btree, and may involve joining
1137 * leaf nodes and even joining intermediate nodes up to and including
1138 * the root node (a special case of an intermediate node).
1141 xfs_attr_node_removename(xfs_da_args_t
*args
)
1143 xfs_da_state_t
*state
;
1144 xfs_da_state_blk_t
*blk
;
1147 int retval
, error
, committed
, forkoff
;
1149 trace_xfs_attr_node_removename(args
);
1152 * Tie a string around our finger to remind us where we are.
1155 state
= xfs_da_state_alloc();
1157 state
->mp
= dp
->i_mount
;
1160 * Search to see if name exists, and get back a pointer to it.
1162 error
= xfs_da3_node_lookup_int(state
, &retval
);
1163 if (error
|| (retval
!= -EEXIST
)) {
1170 * If there is an out-of-line value, de-allocate the blocks.
1171 * This is done before we remove the attribute so that we don't
1172 * overflow the maximum size of a transaction and/or hit a deadlock.
1174 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1175 ASSERT(blk
->bp
!= NULL
);
1176 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1177 if (args
->rmtblkno
> 0) {
1179 * Fill in disk block numbers in the state structure
1180 * so that we can get the buffers back after we commit
1181 * several transactions in the following calls.
1183 error
= xfs_attr_fillstate(state
);
1188 * Mark the attribute as INCOMPLETE, then bunmapi() the
1191 error
= xfs_attr3_leaf_setflag(args
);
1194 error
= xfs_attr_rmtval_remove(args
);
1199 * Refill the state structure with buffers, the prior calls
1200 * released our buffers.
1202 error
= xfs_attr_refillstate(state
);
1208 * Remove the name and update the hashvals in the tree.
1210 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1211 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1212 retval
= xfs_attr3_leaf_remove(blk
->bp
, args
);
1213 xfs_da3_fixhashpath(state
, &state
->path
);
1216 * Check to see if the tree needs to be collapsed.
1218 if (retval
&& (state
->path
.active
> 1)) {
1219 xfs_bmap_init(args
->flist
, args
->firstblock
);
1220 error
= xfs_da3_join(state
);
1222 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1228 xfs_bmap_cancel(args
->flist
);
1233 * bmap_finish() may have committed the last trans and started
1234 * a new one. We need the inode to be in all transactions.
1237 xfs_trans_ijoin(args
->trans
, dp
, 0);
1240 * Commit the Btree join operation and start a new trans.
1242 error
= xfs_trans_roll(&args
->trans
, dp
);
1248 * If the result is small enough, push it all into the inode.
1250 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
1252 * Have to get rid of the copy of this dabuf in the state.
1254 ASSERT(state
->path
.active
== 1);
1255 ASSERT(state
->path
.blk
[0].bp
);
1256 state
->path
.blk
[0].bp
= NULL
;
1258 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, 0, -1, &bp
);
1262 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1263 xfs_bmap_init(args
->flist
, args
->firstblock
);
1264 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
1265 /* bp is gone due to xfs_da_shrink_inode */
1267 error
= xfs_bmap_finish(&args
->trans
,
1274 xfs_bmap_cancel(args
->flist
);
1279 * bmap_finish() may have committed the last trans
1280 * and started a new one. We need the inode to be
1281 * in all transactions.
1284 xfs_trans_ijoin(args
->trans
, dp
, 0);
1286 xfs_trans_brelse(args
->trans
, bp
);
1291 xfs_da_state_free(state
);
1296 * Fill in the disk block numbers in the state structure for the buffers
1297 * that are attached to the state structure.
1298 * This is done so that we can quickly reattach ourselves to those buffers
1299 * after some set of transaction commits have released these buffers.
1302 xfs_attr_fillstate(xfs_da_state_t
*state
)
1304 xfs_da_state_path_t
*path
;
1305 xfs_da_state_blk_t
*blk
;
1308 trace_xfs_attr_fillstate(state
->args
);
1311 * Roll down the "path" in the state structure, storing the on-disk
1312 * block number for those buffers in the "path".
1314 path
= &state
->path
;
1315 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1316 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1318 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1321 blk
->disk_blkno
= 0;
1326 * Roll down the "altpath" in the state structure, storing the on-disk
1327 * block number for those buffers in the "altpath".
1329 path
= &state
->altpath
;
1330 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1331 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1333 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1336 blk
->disk_blkno
= 0;
1344 * Reattach the buffers to the state structure based on the disk block
1345 * numbers stored in the state structure.
1346 * This is done after some set of transaction commits have released those
1347 * buffers from our grip.
1350 xfs_attr_refillstate(xfs_da_state_t
*state
)
1352 xfs_da_state_path_t
*path
;
1353 xfs_da_state_blk_t
*blk
;
1356 trace_xfs_attr_refillstate(state
->args
);
1359 * Roll down the "path" in the state structure, storing the on-disk
1360 * block number for those buffers in the "path".
1362 path
= &state
->path
;
1363 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1364 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1365 if (blk
->disk_blkno
) {
1366 error
= xfs_da3_node_read(state
->args
->trans
,
1368 blk
->blkno
, blk
->disk_blkno
,
1369 &blk
->bp
, XFS_ATTR_FORK
);
1378 * Roll down the "altpath" in the state structure, storing the on-disk
1379 * block number for those buffers in the "altpath".
1381 path
= &state
->altpath
;
1382 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1383 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1384 if (blk
->disk_blkno
) {
1385 error
= xfs_da3_node_read(state
->args
->trans
,
1387 blk
->blkno
, blk
->disk_blkno
,
1388 &blk
->bp
, XFS_ATTR_FORK
);
1400 * Look up a filename in a node attribute list.
1402 * This routine gets called for any attribute fork that has more than one
1403 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1404 * "remote" values taking up more blocks.
1407 xfs_attr_node_get(xfs_da_args_t
*args
)
1409 xfs_da_state_t
*state
;
1410 xfs_da_state_blk_t
*blk
;
1414 trace_xfs_attr_node_get(args
);
1416 state
= xfs_da_state_alloc();
1418 state
->mp
= args
->dp
->i_mount
;
1421 * Search to see if name exists, and get back a pointer to it.
1423 error
= xfs_da3_node_lookup_int(state
, &retval
);
1426 } else if (retval
== -EEXIST
) {
1427 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1428 ASSERT(blk
->bp
!= NULL
);
1429 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1432 * Get the value, local or "remote"
1434 retval
= xfs_attr3_leaf_getvalue(blk
->bp
, args
);
1435 if (!retval
&& (args
->rmtblkno
> 0)
1436 && !(args
->flags
& ATTR_KERNOVAL
)) {
1437 retval
= xfs_attr_rmtval_get(args
);
1442 * If not in a transaction, we have to release all the buffers.
1444 for (i
= 0; i
< state
->path
.active
; i
++) {
1445 xfs_trans_brelse(args
->trans
, state
->path
.blk
[i
].bp
);
1446 state
->path
.blk
[i
].bp
= NULL
;
1449 xfs_da_state_free(state
);