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"
27 #include "xfs_mount.h"
28 #include "xfs_da_format.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_attr_sf.h"
31 #include "xfs_inode.h"
32 #include "xfs_alloc.h"
33 #include "xfs_trans.h"
34 #include "xfs_inode_item.h"
36 #include "xfs_bmap_util.h"
37 #include "xfs_bmap_btree.h"
39 #include "xfs_attr_leaf.h"
40 #include "xfs_attr_remote.h"
41 #include "xfs_error.h"
42 #include "xfs_quota.h"
43 #include "xfs_trans_space.h"
44 #include "xfs_trace.h"
45 #include "xfs_dinode.h"
50 * Provide the external interfaces to manage attribute lists.
53 /*========================================================================
54 * Function prototypes for the kernel.
55 *========================================================================*/
58 * Internal routines when attribute list fits inside the inode.
60 STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args);
63 * Internal routines when attribute list is one block.
65 STATIC int xfs_attr_leaf_get(xfs_da_args_t *args);
66 STATIC int xfs_attr_leaf_addname(xfs_da_args_t *args);
67 STATIC int xfs_attr_leaf_removename(xfs_da_args_t *args);
70 * Internal routines when attribute list is more than one block.
72 STATIC int xfs_attr_node_get(xfs_da_args_t *args);
73 STATIC int xfs_attr_node_addname(xfs_da_args_t *args);
74 STATIC int xfs_attr_node_removename(xfs_da_args_t *args);
75 STATIC int xfs_attr_fillstate(xfs_da_state_t *state);
76 STATIC int xfs_attr_refillstate(xfs_da_state_t *state);
80 xfs_attr_name_to_xname(
81 struct xfs_name *xname,
82 const unsigned char *aname)
87 xname->len = strlen((char *)aname);
88 if (xname->len >= MAXNAMELEN)
89 return EFAULT; /* match IRIX behaviour */
98 if (!XFS_IFORK_Q(ip) ||
99 (ip->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS &&
100 ip->i_d.di_anextents == 0))
105 /*========================================================================
106 * Overall external interface routines.
107 *========================================================================*/
111 struct xfs_inode *ip,
112 struct xfs_name *name,
113 unsigned char *value,
120 if (!xfs_inode_hasattr(ip))
124 * Fill in the arg structure for this request.
126 memset((char *)&args, 0, sizeof(args));
127 args.name = name->name;
128 args.namelen = name->len;
130 args.valuelen = *valuelenp;
132 args.hashval = xfs_da_hashname(args.name, args.namelen);
134 args.whichfork = XFS_ATTR_FORK;
137 * Decide on what work routines to call based on the inode size.
139 if (ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
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);
144 error = xfs_attr_node_get(&args);
148 * Return the number of bytes in the value to the caller.
150 *valuelenp = args.valuelen;
160 const unsigned char *name,
161 unsigned char *value,
166 struct xfs_name xname;
169 XFS_STATS_INC(xs_attr_get);
171 if (XFS_FORCED_SHUTDOWN(ip->i_mount))
174 error = xfs_attr_name_to_xname(&xname, name);
178 lock_mode = xfs_ilock_attr_map_shared(ip);
179 error = xfs_attr_get_int(ip, &xname, value, valuelenp, flags);
180 xfs_iunlock(ip, lock_mode);
185 * Calculate how many blocks we need for the new attribute,
189 struct xfs_inode *ip,
194 struct xfs_mount *mp = ip->i_mount;
199 * Determine space new attribute will use, and if it would be
200 * "local" or "remote" (note: local != inline).
202 size = xfs_attr_leaf_newentsize(namelen, valuelen,
203 mp->m_sb.sb_blocksize, local);
205 nblks = XFS_DAENTER_SPACE_RES(mp, XFS_ATTR_FORK);
207 if (size > (mp->m_sb.sb_blocksize >> 1)) {
208 /* Double split possible */
213 * Out of line attribute, cannot double split, but
214 * make room for the attribute value itself.
216 uint dblocks = XFS_B_TO_FSB(mp, valuelen);
218 nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK);
226 struct xfs_inode *dp,
227 const unsigned char *name,
228 unsigned char *value,
232 struct xfs_mount *mp = dp->i_mount;
233 struct xfs_da_args args;
234 struct xfs_bmap_free flist;
235 struct xfs_trans_res tres;
236 struct xfs_name xname;
237 xfs_fsblock_t firstblock;
238 int rsvd = (flags & ATTR_ROOT) != 0;
239 int error, err2, committed, local;
241 XFS_STATS_INC(xs_attr_set);
243 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
246 error = xfs_attr_name_to_xname(&xname, name);
250 error = xfs_qm_dqattach(dp, 0);
255 * If the inode doesn't have an attribute fork, add one.
256 * (inode must not be locked when we call this routine)
258 if (XFS_IFORK_Q(dp) == 0) {
259 int sf_size = sizeof(xfs_attr_sf_hdr_t) +
260 XFS_ATTR_SF_ENTSIZE_BYNAME(xname.len, valuelen);
262 error = xfs_bmap_add_attrfork(dp, sf_size, rsvd);
267 memset(&args, 0, sizeof(args));
268 args.name = xname.name;
269 args.namelen = xname.len;
271 args.valuelen = valuelen;
273 args.hashval = xfs_da_hashname(args.name, args.namelen);
275 args.firstblock = &firstblock;
277 args.whichfork = XFS_ATTR_FORK;
278 args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
280 /* Size is now blocks for attribute data */
281 args.total = xfs_attr_calc_size(dp, xname.len, valuelen, &local);
284 * Start our first transaction of the day.
286 * All future transactions during this code must be "chained" off
287 * this one via the trans_dup() call. All transactions will contain
288 * the inode, and the inode will always be marked with trans_ihold().
289 * Since the inode will be locked in all transactions, we must log
290 * the inode in every transaction to let it float upward through
293 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_SET);
296 * Root fork attributes can use reserved data blocks for this
297 * operation if necessary
301 args.trans->t_flags |= XFS_TRANS_RESERVE;
303 tres.tr_logres = M_RES(mp)->tr_attrsetm.tr_logres +
304 M_RES(mp)->tr_attrsetrt.tr_logres * args.total;
305 tres.tr_logcount = XFS_ATTRSET_LOG_COUNT;
306 tres.tr_logflags = XFS_TRANS_PERM_LOG_RES;
307 error = xfs_trans_reserve(args.trans, &tres, args.total, 0);
309 xfs_trans_cancel(args.trans, 0);
312 xfs_ilock(dp, XFS_ILOCK_EXCL);
314 error = xfs_trans_reserve_quota_nblks(args.trans, dp, args.total, 0,
315 rsvd ? XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
316 XFS_QMOPT_RES_REGBLKS);
318 xfs_iunlock(dp, XFS_ILOCK_EXCL);
319 xfs_trans_cancel(args.trans, XFS_TRANS_RELEASE_LOG_RES);
323 xfs_trans_ijoin(args.trans, dp, 0);
326 * If the attribute list is non-existent or a shortform list,
327 * upgrade it to a single-leaf-block attribute list.
329 if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL ||
330 (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS &&
331 dp->i_d.di_anextents == 0)) {
334 * Build initial attribute list (if required).
336 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS)
337 xfs_attr_shortform_create(&args);
340 * Try to add the attr to the attribute list in
343 error = xfs_attr_shortform_addname(&args);
344 if (error != ENOSPC) {
346 * Commit the shortform mods, and we're done.
347 * NOTE: this is also the error path (EEXIST, etc).
349 ASSERT(args.trans != NULL);
352 * If this is a synchronous mount, make sure that
353 * the transaction goes to disk before returning
356 if (mp->m_flags & XFS_MOUNT_WSYNC)
357 xfs_trans_set_sync(args.trans);
359 if (!error && (flags & ATTR_KERNOTIME) == 0) {
360 xfs_trans_ichgtime(args.trans, dp,
363 err2 = xfs_trans_commit(args.trans,
364 XFS_TRANS_RELEASE_LOG_RES);
365 xfs_iunlock(dp, XFS_ILOCK_EXCL);
367 return error ? error : err2;
371 * It won't fit in the shortform, transform to a leaf block.
372 * GROT: another possible req'mt for a double-split btree op.
374 xfs_bmap_init(args.flist, args.firstblock);
375 error = xfs_attr_shortform_to_leaf(&args);
377 error = xfs_bmap_finish(&args.trans, args.flist,
383 xfs_bmap_cancel(&flist);
388 * bmap_finish() may have committed the last trans and started
389 * a new one. We need the inode to be in all transactions.
392 xfs_trans_ijoin(args.trans, dp, 0);
395 * Commit the leaf transformation. We'll need another (linked)
396 * transaction to add the new attribute to the leaf.
399 error = xfs_trans_roll(&args.trans, dp);
405 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK))
406 error = xfs_attr_leaf_addname(&args);
408 error = xfs_attr_node_addname(&args);
413 * If this is a synchronous mount, make sure that the
414 * transaction goes to disk before returning to the user.
416 if (mp->m_flags & XFS_MOUNT_WSYNC)
417 xfs_trans_set_sync(args.trans);
419 if ((flags & ATTR_KERNOTIME) == 0)
420 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
423 * Commit the last in the sequence of transactions.
425 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
426 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
427 xfs_iunlock(dp, XFS_ILOCK_EXCL);
433 xfs_trans_cancel(args.trans,
434 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
436 xfs_iunlock(dp, XFS_ILOCK_EXCL);
441 * Generic handler routine to remove a name from an attribute list.
442 * Transitions attribute list from Btree to shortform as necessary.
445 xfs_attr_remove_int(xfs_inode_t *dp, struct xfs_name *name, int flags)
448 xfs_fsblock_t firstblock;
449 xfs_bmap_free_t flist;
451 xfs_mount_t *mp = dp->i_mount;
454 * Fill in the arg structure for this request.
456 memset((char *)&args, 0, sizeof(args));
457 args.name = name->name;
458 args.namelen = name->len;
460 args.hashval = xfs_da_hashname(args.name, args.namelen);
462 args.firstblock = &firstblock;
465 args.whichfork = XFS_ATTR_FORK;
468 * we have no control over the attribute names that userspace passes us
469 * to remove, so we have to allow the name lookup prior to attribute
472 args.op_flags = XFS_DA_OP_OKNOENT;
475 * Attach the dquots to the inode.
477 error = xfs_qm_dqattach(dp, 0);
482 * Start our first transaction of the day.
484 * All future transactions during this code must be "chained" off
485 * this one via the trans_dup() call. All transactions will contain
486 * the inode, and the inode will always be marked with trans_ihold().
487 * Since the inode will be locked in all transactions, we must log
488 * the inode in every transaction to let it float upward through
491 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM);
494 * Root fork attributes can use reserved data blocks for this
495 * operation if necessary
498 if (flags & ATTR_ROOT)
499 args.trans->t_flags |= XFS_TRANS_RESERVE;
501 error = xfs_trans_reserve(args.trans, &M_RES(mp)->tr_attrrm,
502 XFS_ATTRRM_SPACE_RES(mp), 0);
504 xfs_trans_cancel(args.trans, 0);
508 xfs_ilock(dp, XFS_ILOCK_EXCL);
510 * No need to make quota reservations here. We expect to release some
511 * blocks not allocate in the common case.
513 xfs_trans_ijoin(args.trans, dp, 0);
516 * Decide on what work routines to call based on the inode size.
518 if (!xfs_inode_hasattr(dp)) {
519 error = XFS_ERROR(ENOATTR);
522 if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
523 ASSERT(dp->i_afp->if_flags & XFS_IFINLINE);
524 error = xfs_attr_shortform_remove(&args);
528 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
529 error = xfs_attr_leaf_removename(&args);
531 error = xfs_attr_node_removename(&args);
538 * If this is a synchronous mount, make sure that the
539 * transaction goes to disk before returning to the user.
541 if (mp->m_flags & XFS_MOUNT_WSYNC) {
542 xfs_trans_set_sync(args.trans);
545 if ((flags & ATTR_KERNOTIME) == 0)
546 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
549 * Commit the last in the sequence of transactions.
551 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
552 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
553 xfs_iunlock(dp, XFS_ILOCK_EXCL);
559 xfs_trans_cancel(args.trans,
560 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
561 xfs_iunlock(dp, XFS_ILOCK_EXCL);
568 const unsigned char *name,
572 struct xfs_name xname;
574 XFS_STATS_INC(xs_attr_remove);
576 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
579 error = xfs_attr_name_to_xname(&xname, name);
583 xfs_ilock(dp, XFS_ILOCK_SHARED);
584 if (!xfs_inode_hasattr(dp)) {
585 xfs_iunlock(dp, XFS_ILOCK_SHARED);
586 return XFS_ERROR(ENOATTR);
588 xfs_iunlock(dp, XFS_ILOCK_SHARED);
590 return xfs_attr_remove_int(dp, &xname, flags);
594 /*========================================================================
595 * External routines when attribute list is inside the inode
596 *========================================================================*/
599 * Add a name to the shortform attribute list structure
600 * This is the external routine.
603 xfs_attr_shortform_addname(xfs_da_args_t *args)
605 int newsize, forkoff, retval;
607 trace_xfs_attr_sf_addname(args);
609 retval = xfs_attr_shortform_lookup(args);
610 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
612 } else if (retval == EEXIST) {
613 if (args->flags & ATTR_CREATE)
615 retval = xfs_attr_shortform_remove(args);
619 if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX ||
620 args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX)
621 return(XFS_ERROR(ENOSPC));
623 newsize = XFS_ATTR_SF_TOTSIZE(args->dp);
624 newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
626 forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize);
628 return(XFS_ERROR(ENOSPC));
630 xfs_attr_shortform_add(args, forkoff);
635 /*========================================================================
636 * External routines when attribute list is one block
637 *========================================================================*/
640 * Add a name to the leaf attribute list structure
642 * This leaf block cannot have a "remote" value, we only call this routine
643 * if bmap_one_block() says there is only one block (ie: no remote blks).
646 xfs_attr_leaf_addname(xfs_da_args_t *args)
650 int retval, error, committed, forkoff;
652 trace_xfs_attr_leaf_addname(args);
655 * Read the (only) block in the attribute list in.
659 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
664 * Look up the given attribute in the leaf block. Figure out if
665 * the given flags produce an error or call for an atomic rename.
667 retval = xfs_attr3_leaf_lookup_int(bp, args);
668 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
669 xfs_trans_brelse(args->trans, bp);
671 } else if (retval == EEXIST) {
672 if (args->flags & ATTR_CREATE) { /* pure create op */
673 xfs_trans_brelse(args->trans, bp);
677 trace_xfs_attr_leaf_replace(args);
679 args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */
680 args->blkno2 = args->blkno; /* set 2nd entry info*/
681 args->index2 = args->index;
682 args->rmtblkno2 = args->rmtblkno;
683 args->rmtblkcnt2 = args->rmtblkcnt;
687 * Add the attribute to the leaf block, transitioning to a Btree
690 retval = xfs_attr3_leaf_add(bp, args);
691 if (retval == ENOSPC) {
693 * Promote the attribute list to the Btree format, then
694 * Commit that transaction so that the node_addname() call
695 * can manage its own transactions.
697 xfs_bmap_init(args->flist, args->firstblock);
698 error = xfs_attr3_leaf_to_node(args);
700 error = xfs_bmap_finish(&args->trans, args->flist,
706 xfs_bmap_cancel(args->flist);
711 * bmap_finish() may have committed the last trans and started
712 * a new one. We need the inode to be in all transactions.
715 xfs_trans_ijoin(args->trans, dp, 0);
718 * Commit the current trans (including the inode) and start
721 error = xfs_trans_roll(&args->trans, dp);
726 * Fob the whole rest of the problem off on the Btree code.
728 error = xfs_attr_node_addname(args);
733 * Commit the transaction that added the attr name so that
734 * later routines can manage their own transactions.
736 error = xfs_trans_roll(&args->trans, dp);
741 * If there was an out-of-line value, allocate the blocks we
742 * identified for its storage and copy the value. This is done
743 * after we create the attribute so that we don't overflow the
744 * maximum size of a transaction and/or hit a deadlock.
746 if (args->rmtblkno > 0) {
747 error = xfs_attr_rmtval_set(args);
753 * If this is an atomic rename operation, we must "flip" the
754 * incomplete flags on the "new" and "old" attribute/value pairs
755 * so that one disappears and one appears atomically. Then we
756 * must remove the "old" attribute/value pair.
758 if (args->op_flags & XFS_DA_OP_RENAME) {
760 * In a separate transaction, set the incomplete flag on the
761 * "old" attr and clear the incomplete flag on the "new" attr.
763 error = xfs_attr3_leaf_flipflags(args);
768 * Dismantle the "old" attribute/value pair by removing
769 * a "remote" value (if it exists).
771 args->index = args->index2;
772 args->blkno = args->blkno2;
773 args->rmtblkno = args->rmtblkno2;
774 args->rmtblkcnt = args->rmtblkcnt2;
775 if (args->rmtblkno) {
776 error = xfs_attr_rmtval_remove(args);
782 * Read in the block containing the "old" attr, then
783 * remove the "old" attr from that block (neat, huh!)
785 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno,
790 xfs_attr3_leaf_remove(bp, args);
793 * If the result is small enough, shrink it all into the inode.
795 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
796 xfs_bmap_init(args->flist, args->firstblock);
797 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
798 /* bp is gone due to xfs_da_shrink_inode */
800 error = xfs_bmap_finish(&args->trans,
807 xfs_bmap_cancel(args->flist);
812 * bmap_finish() may have committed the last trans
813 * and started a new one. We need the inode to be
814 * in all transactions.
817 xfs_trans_ijoin(args->trans, dp, 0);
821 * Commit the remove and start the next trans in series.
823 error = xfs_trans_roll(&args->trans, dp);
825 } else if (args->rmtblkno > 0) {
827 * Added a "remote" value, just clear the incomplete flag.
829 error = xfs_attr3_leaf_clearflag(args);
835 * Remove a name from the leaf attribute list structure
837 * This leaf block cannot have a "remote" value, we only call this routine
838 * if bmap_one_block() says there is only one block (ie: no remote blks).
841 xfs_attr_leaf_removename(xfs_da_args_t *args)
845 int error, committed, forkoff;
847 trace_xfs_attr_leaf_removename(args);
850 * Remove the attribute.
854 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
858 error = xfs_attr3_leaf_lookup_int(bp, args);
859 if (error == ENOATTR) {
860 xfs_trans_brelse(args->trans, bp);
864 xfs_attr3_leaf_remove(bp, args);
867 * If the result is small enough, shrink it all into the inode.
869 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
870 xfs_bmap_init(args->flist, args->firstblock);
871 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
872 /* bp is gone due to xfs_da_shrink_inode */
874 error = xfs_bmap_finish(&args->trans, args->flist,
880 xfs_bmap_cancel(args->flist);
885 * bmap_finish() may have committed the last trans and started
886 * a new one. We need the inode to be in all transactions.
889 xfs_trans_ijoin(args->trans, dp, 0);
895 * Look up a name in a leaf attribute list structure.
897 * This leaf block cannot have a "remote" value, we only call this routine
898 * if bmap_one_block() says there is only one block (ie: no remote blks).
901 xfs_attr_leaf_get(xfs_da_args_t *args)
906 trace_xfs_attr_leaf_get(args);
909 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
913 error = xfs_attr3_leaf_lookup_int(bp, args);
914 if (error != EEXIST) {
915 xfs_trans_brelse(args->trans, bp);
918 error = xfs_attr3_leaf_getvalue(bp, args);
919 xfs_trans_brelse(args->trans, bp);
920 if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) {
921 error = xfs_attr_rmtval_get(args);
926 /*========================================================================
927 * External routines when attribute list size > XFS_LBSIZE(mp).
928 *========================================================================*/
931 * Add a name to a Btree-format attribute list.
933 * This will involve walking down the Btree, and may involve splitting
934 * leaf nodes and even splitting intermediate nodes up to and including
935 * the root node (a special case of an intermediate node).
937 * "Remote" attribute values confuse the issue and atomic rename operations
938 * add a whole extra layer of confusion on top of that.
941 xfs_attr_node_addname(xfs_da_args_t *args)
943 xfs_da_state_t *state;
944 xfs_da_state_blk_t *blk;
947 int committed, retval, error;
949 trace_xfs_attr_node_addname(args);
952 * Fill in bucket of arguments/results/context to carry around.
957 state = xfs_da_state_alloc();
960 state->blocksize = state->mp->m_sb.sb_blocksize;
961 state->node_ents = state->mp->m_attr_node_ents;
964 * Search to see if name already exists, and get back a pointer
965 * to where it should go.
967 error = xfs_da3_node_lookup_int(state, &retval);
970 blk = &state->path.blk[ state->path.active-1 ];
971 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
972 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
974 } else if (retval == EEXIST) {
975 if (args->flags & ATTR_CREATE)
978 trace_xfs_attr_node_replace(args);
980 args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */
981 args->blkno2 = args->blkno; /* set 2nd entry info*/
982 args->index2 = args->index;
983 args->rmtblkno2 = args->rmtblkno;
984 args->rmtblkcnt2 = args->rmtblkcnt;
989 retval = xfs_attr3_leaf_add(blk->bp, state->args);
990 if (retval == ENOSPC) {
991 if (state->path.active == 1) {
993 * Its really a single leaf node, but it had
994 * out-of-line values so it looked like it *might*
995 * have been a b-tree.
997 xfs_da_state_free(state);
999 xfs_bmap_init(args->flist, args->firstblock);
1000 error = xfs_attr3_leaf_to_node(args);
1002 error = xfs_bmap_finish(&args->trans,
1009 xfs_bmap_cancel(args->flist);
1014 * bmap_finish() may have committed the last trans
1015 * and started a new one. We need the inode to be
1016 * in all transactions.
1019 xfs_trans_ijoin(args->trans, dp, 0);
1022 * Commit the node conversion and start the next
1023 * trans in the chain.
1025 error = xfs_trans_roll(&args->trans, dp);
1033 * Split as many Btree elements as required.
1034 * This code tracks the new and old attr's location
1035 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1036 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1038 xfs_bmap_init(args->flist, args->firstblock);
1039 error = xfs_da3_split(state);
1041 error = xfs_bmap_finish(&args->trans, args->flist,
1047 xfs_bmap_cancel(args->flist);
1052 * bmap_finish() may have committed the last trans and started
1053 * a new one. We need the inode to be in all transactions.
1056 xfs_trans_ijoin(args->trans, dp, 0);
1059 * Addition succeeded, update Btree hashvals.
1061 xfs_da3_fixhashpath(state, &state->path);
1065 * Kill the state structure, we're done with it and need to
1066 * allow the buffers to come back later.
1068 xfs_da_state_free(state);
1072 * Commit the leaf addition or btree split and start the next
1073 * trans in the chain.
1075 error = xfs_trans_roll(&args->trans, dp);
1080 * If there was an out-of-line value, allocate the blocks we
1081 * identified for its storage and copy the value. This is done
1082 * after we create the attribute so that we don't overflow the
1083 * maximum size of a transaction and/or hit a deadlock.
1085 if (args->rmtblkno > 0) {
1086 error = xfs_attr_rmtval_set(args);
1092 * If this is an atomic rename operation, we must "flip" the
1093 * incomplete flags on the "new" and "old" attribute/value pairs
1094 * so that one disappears and one appears atomically. Then we
1095 * must remove the "old" attribute/value pair.
1097 if (args->op_flags & XFS_DA_OP_RENAME) {
1099 * In a separate transaction, set the incomplete flag on the
1100 * "old" attr and clear the incomplete flag on the "new" attr.
1102 error = xfs_attr3_leaf_flipflags(args);
1107 * Dismantle the "old" attribute/value pair by removing
1108 * a "remote" value (if it exists).
1110 args->index = args->index2;
1111 args->blkno = args->blkno2;
1112 args->rmtblkno = args->rmtblkno2;
1113 args->rmtblkcnt = args->rmtblkcnt2;
1114 if (args->rmtblkno) {
1115 error = xfs_attr_rmtval_remove(args);
1121 * Re-find the "old" attribute entry after any split ops.
1122 * The INCOMPLETE flag means that we will find the "old"
1123 * attr, not the "new" one.
1125 args->flags |= XFS_ATTR_INCOMPLETE;
1126 state = xfs_da_state_alloc();
1129 state->blocksize = state->mp->m_sb.sb_blocksize;
1130 state->node_ents = state->mp->m_attr_node_ents;
1132 error = xfs_da3_node_lookup_int(state, &retval);
1137 * Remove the name and update the hashvals in the tree.
1139 blk = &state->path.blk[ state->path.active-1 ];
1140 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1141 error = xfs_attr3_leaf_remove(blk->bp, args);
1142 xfs_da3_fixhashpath(state, &state->path);
1145 * Check to see if the tree needs to be collapsed.
1147 if (retval && (state->path.active > 1)) {
1148 xfs_bmap_init(args->flist, args->firstblock);
1149 error = xfs_da3_join(state);
1151 error = xfs_bmap_finish(&args->trans,
1158 xfs_bmap_cancel(args->flist);
1163 * bmap_finish() may have committed the last trans
1164 * and started a new one. We need the inode to be
1165 * in all transactions.
1168 xfs_trans_ijoin(args->trans, dp, 0);
1172 * Commit and start the next trans in the chain.
1174 error = xfs_trans_roll(&args->trans, dp);
1178 } else if (args->rmtblkno > 0) {
1180 * Added a "remote" value, just clear the incomplete flag.
1182 error = xfs_attr3_leaf_clearflag(args);
1190 xfs_da_state_free(state);
1197 * Remove a name from a B-tree attribute list.
1199 * This will involve walking down the Btree, and may involve joining
1200 * leaf nodes and even joining intermediate nodes up to and including
1201 * the root node (a special case of an intermediate node).
1204 xfs_attr_node_removename(xfs_da_args_t *args)
1206 xfs_da_state_t *state;
1207 xfs_da_state_blk_t *blk;
1210 int retval, error, committed, forkoff;
1212 trace_xfs_attr_node_removename(args);
1215 * Tie a string around our finger to remind us where we are.
1218 state = xfs_da_state_alloc();
1220 state->mp = dp->i_mount;
1221 state->blocksize = state->mp->m_sb.sb_blocksize;
1222 state->node_ents = state->mp->m_attr_node_ents;
1225 * Search to see if name exists, and get back a pointer to it.
1227 error = xfs_da3_node_lookup_int(state, &retval);
1228 if (error || (retval != EEXIST)) {
1235 * If there is an out-of-line value, de-allocate the blocks.
1236 * This is done before we remove the attribute so that we don't
1237 * overflow the maximum size of a transaction and/or hit a deadlock.
1239 blk = &state->path.blk[ state->path.active-1 ];
1240 ASSERT(blk->bp != NULL);
1241 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1242 if (args->rmtblkno > 0) {
1244 * Fill in disk block numbers in the state structure
1245 * so that we can get the buffers back after we commit
1246 * several transactions in the following calls.
1248 error = xfs_attr_fillstate(state);
1253 * Mark the attribute as INCOMPLETE, then bunmapi() the
1256 error = xfs_attr3_leaf_setflag(args);
1259 error = xfs_attr_rmtval_remove(args);
1264 * Refill the state structure with buffers, the prior calls
1265 * released our buffers.
1267 error = xfs_attr_refillstate(state);
1273 * Remove the name and update the hashvals in the tree.
1275 blk = &state->path.blk[ state->path.active-1 ];
1276 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1277 retval = xfs_attr3_leaf_remove(blk->bp, args);
1278 xfs_da3_fixhashpath(state, &state->path);
1281 * Check to see if the tree needs to be collapsed.
1283 if (retval && (state->path.active > 1)) {
1284 xfs_bmap_init(args->flist, args->firstblock);
1285 error = xfs_da3_join(state);
1287 error = xfs_bmap_finish(&args->trans, args->flist,
1293 xfs_bmap_cancel(args->flist);
1298 * bmap_finish() may have committed the last trans and started
1299 * a new one. We need the inode to be in all transactions.
1302 xfs_trans_ijoin(args->trans, dp, 0);
1305 * Commit the Btree join operation and start a new trans.
1307 error = xfs_trans_roll(&args->trans, dp);
1313 * If the result is small enough, push it all into the inode.
1315 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1317 * Have to get rid of the copy of this dabuf in the state.
1319 ASSERT(state->path.active == 1);
1320 ASSERT(state->path.blk[0].bp);
1321 state->path.blk[0].bp = NULL;
1323 error = xfs_attr3_leaf_read(args->trans, args->dp, 0, -1, &bp);
1327 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1328 xfs_bmap_init(args->flist, args->firstblock);
1329 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
1330 /* bp is gone due to xfs_da_shrink_inode */
1332 error = xfs_bmap_finish(&args->trans,
1339 xfs_bmap_cancel(args->flist);
1344 * bmap_finish() may have committed the last trans
1345 * and started a new one. We need the inode to be
1346 * in all transactions.
1349 xfs_trans_ijoin(args->trans, dp, 0);
1351 xfs_trans_brelse(args->trans, bp);
1356 xfs_da_state_free(state);
1361 * Fill in the disk block numbers in the state structure for the buffers
1362 * that are attached to the state structure.
1363 * This is done so that we can quickly reattach ourselves to those buffers
1364 * after some set of transaction commits have released these buffers.
1367 xfs_attr_fillstate(xfs_da_state_t *state)
1369 xfs_da_state_path_t *path;
1370 xfs_da_state_blk_t *blk;
1373 trace_xfs_attr_fillstate(state->args);
1376 * Roll down the "path" in the state structure, storing the on-disk
1377 * block number for those buffers in the "path".
1379 path = &state->path;
1380 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1381 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1383 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1386 blk->disk_blkno = 0;
1391 * Roll down the "altpath" in the state structure, storing the on-disk
1392 * block number for those buffers in the "altpath".
1394 path = &state->altpath;
1395 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1396 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1398 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1401 blk->disk_blkno = 0;
1409 * Reattach the buffers to the state structure based on the disk block
1410 * numbers stored in the state structure.
1411 * This is done after some set of transaction commits have released those
1412 * buffers from our grip.
1415 xfs_attr_refillstate(xfs_da_state_t *state)
1417 xfs_da_state_path_t *path;
1418 xfs_da_state_blk_t *blk;
1421 trace_xfs_attr_refillstate(state->args);
1424 * Roll down the "path" in the state structure, storing the on-disk
1425 * block number for those buffers in the "path".
1427 path = &state->path;
1428 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1429 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1430 if (blk->disk_blkno) {
1431 error = xfs_da3_node_read(state->args->trans,
1433 blk->blkno, blk->disk_blkno,
1434 &blk->bp, XFS_ATTR_FORK);
1443 * Roll down the "altpath" in the state structure, storing the on-disk
1444 * block number for those buffers in the "altpath".
1446 path = &state->altpath;
1447 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1448 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1449 if (blk->disk_blkno) {
1450 error = xfs_da3_node_read(state->args->trans,
1452 blk->blkno, blk->disk_blkno,
1453 &blk->bp, XFS_ATTR_FORK);
1465 * Look up a filename in a node attribute list.
1467 * This routine gets called for any attribute fork that has more than one
1468 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1469 * "remote" values taking up more blocks.
1472 xfs_attr_node_get(xfs_da_args_t *args)
1474 xfs_da_state_t *state;
1475 xfs_da_state_blk_t *blk;
1479 trace_xfs_attr_node_get(args);
1481 state = xfs_da_state_alloc();
1483 state->mp = args->dp->i_mount;
1484 state->blocksize = state->mp->m_sb.sb_blocksize;
1485 state->node_ents = state->mp->m_attr_node_ents;
1488 * Search to see if name exists, and get back a pointer to it.
1490 error = xfs_da3_node_lookup_int(state, &retval);
1493 } else if (retval == EEXIST) {
1494 blk = &state->path.blk[ state->path.active-1 ];
1495 ASSERT(blk->bp != NULL);
1496 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1499 * Get the value, local or "remote"
1501 retval = xfs_attr3_leaf_getvalue(blk->bp, args);
1502 if (!retval && (args->rmtblkno > 0)
1503 && !(args->flags & ATTR_KERNOVAL)) {
1504 retval = xfs_attr_rmtval_get(args);
1509 * If not in a transaction, we have to release all the buffers.
1511 for (i = 0; i < state->path.active; i++) {
1512 xfs_trans_brelse(args->trans, state->path.blk[i].bp);
1513 state->path.blk[i].bp = NULL;
1516 xfs_da_state_free(state);