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_TRANS_RELEASE_LOG_RES);
325 xfs_iunlock(dp, XFS_ILOCK_EXCL);
327 return error ? error : err2;
331 * It won't fit in the shortform, transform to a leaf block.
332 * GROT: another possible req'mt for a double-split btree op.
334 xfs_bmap_init(args.flist, args.firstblock);
335 error = xfs_attr_shortform_to_leaf(&args);
337 error = xfs_bmap_finish(&args.trans, args.flist,
343 xfs_bmap_cancel(&flist);
348 * bmap_finish() may have committed the last trans and started
349 * a new one. We need the inode to be in all transactions.
352 xfs_trans_ijoin(args.trans, dp, 0);
355 * Commit the leaf transformation. We'll need another (linked)
356 * transaction to add the new attribute to the leaf.
359 error = xfs_trans_roll(&args.trans, dp);
365 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK))
366 error = xfs_attr_leaf_addname(&args);
368 error = xfs_attr_node_addname(&args);
373 * If this is a synchronous mount, make sure that the
374 * transaction goes to disk before returning to the user.
376 if (mp->m_flags & XFS_MOUNT_WSYNC)
377 xfs_trans_set_sync(args.trans);
379 if ((flags & ATTR_KERNOTIME) == 0)
380 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
383 * Commit the last in the sequence of transactions.
385 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
386 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
387 xfs_iunlock(dp, XFS_ILOCK_EXCL);
393 xfs_trans_cancel(args.trans);
394 xfs_iunlock(dp, XFS_ILOCK_EXCL);
399 * Generic handler routine to remove a name from an attribute list.
400 * Transitions attribute list from Btree to shortform as necessary.
404 struct xfs_inode *dp,
405 const unsigned char *name,
408 struct xfs_mount *mp = dp->i_mount;
409 struct xfs_da_args args;
410 struct xfs_bmap_free flist;
411 xfs_fsblock_t firstblock;
414 XFS_STATS_INC(xs_attr_remove);
416 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
419 if (!xfs_inode_hasattr(dp))
422 error = xfs_attr_args_init(&args, dp, name, flags);
426 args.firstblock = &firstblock;
430 * we have no control over the attribute names that userspace passes us
431 * to remove, so we have to allow the name lookup prior to attribute
434 args.op_flags = XFS_DA_OP_OKNOENT;
436 error = xfs_qm_dqattach(dp, 0);
441 * Start our first transaction of the day.
443 * All future transactions during this code must be "chained" off
444 * this one via the trans_dup() call. All transactions will contain
445 * the inode, and the inode will always be marked with trans_ihold().
446 * Since the inode will be locked in all transactions, we must log
447 * the inode in every transaction to let it float upward through
450 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM);
453 * Root fork attributes can use reserved data blocks for this
454 * operation if necessary
457 if (flags & ATTR_ROOT)
458 args.trans->t_flags |= XFS_TRANS_RESERVE;
460 error = xfs_trans_reserve(args.trans, &M_RES(mp)->tr_attrrm,
461 XFS_ATTRRM_SPACE_RES(mp), 0);
463 xfs_trans_cancel(args.trans);
467 xfs_ilock(dp, XFS_ILOCK_EXCL);
469 * No need to make quota reservations here. We expect to release some
470 * blocks not allocate in the common case.
472 xfs_trans_ijoin(args.trans, dp, 0);
474 if (!xfs_inode_hasattr(dp)) {
476 } else if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
477 ASSERT(dp->i_afp->if_flags & XFS_IFINLINE);
478 error = xfs_attr_shortform_remove(&args);
479 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
480 error = xfs_attr_leaf_removename(&args);
482 error = xfs_attr_node_removename(&args);
489 * If this is a synchronous mount, make sure that the
490 * transaction goes to disk before returning to the user.
492 if (mp->m_flags & XFS_MOUNT_WSYNC)
493 xfs_trans_set_sync(args.trans);
495 if ((flags & ATTR_KERNOTIME) == 0)
496 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
499 * Commit the last in the sequence of transactions.
501 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
502 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
503 xfs_iunlock(dp, XFS_ILOCK_EXCL);
509 xfs_trans_cancel(args.trans);
510 xfs_iunlock(dp, XFS_ILOCK_EXCL);
514 /*========================================================================
515 * External routines when attribute list is inside the inode
516 *========================================================================*/
519 * Add a name to the shortform attribute list structure
520 * This is the external routine.
523 xfs_attr_shortform_addname(xfs_da_args_t *args)
525 int newsize, forkoff, retval;
527 trace_xfs_attr_sf_addname(args);
529 retval = xfs_attr_shortform_lookup(args);
530 if ((args->flags & ATTR_REPLACE) && (retval == -ENOATTR)) {
532 } else if (retval == -EEXIST) {
533 if (args->flags & ATTR_CREATE)
535 retval = xfs_attr_shortform_remove(args);
539 if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX ||
540 args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX)
543 newsize = XFS_ATTR_SF_TOTSIZE(args->dp);
544 newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
546 forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize);
550 xfs_attr_shortform_add(args, forkoff);
555 /*========================================================================
556 * External routines when attribute list is one block
557 *========================================================================*/
560 * Add a name to the leaf attribute list structure
562 * This leaf block cannot have a "remote" value, we only call this routine
563 * if bmap_one_block() says there is only one block (ie: no remote blks).
566 xfs_attr_leaf_addname(xfs_da_args_t *args)
570 int retval, error, committed, forkoff;
572 trace_xfs_attr_leaf_addname(args);
575 * Read the (only) block in the attribute list in.
579 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
584 * Look up the given attribute in the leaf block. Figure out if
585 * the given flags produce an error or call for an atomic rename.
587 retval = xfs_attr3_leaf_lookup_int(bp, args);
588 if ((args->flags & ATTR_REPLACE) && (retval == -ENOATTR)) {
589 xfs_trans_brelse(args->trans, bp);
591 } else if (retval == -EEXIST) {
592 if (args->flags & ATTR_CREATE) { /* pure create op */
593 xfs_trans_brelse(args->trans, bp);
597 trace_xfs_attr_leaf_replace(args);
599 /* save the attribute state for later removal*/
600 args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */
601 args->blkno2 = args->blkno; /* set 2nd entry info*/
602 args->index2 = args->index;
603 args->rmtblkno2 = args->rmtblkno;
604 args->rmtblkcnt2 = args->rmtblkcnt;
605 args->rmtvaluelen2 = args->rmtvaluelen;
608 * clear the remote attr state now that it is saved so that the
609 * values reflect the state of the attribute we are about to
610 * add, not the attribute we just found and will remove later.
614 args->rmtvaluelen = 0;
618 * Add the attribute to the leaf block, transitioning to a Btree
621 retval = xfs_attr3_leaf_add(bp, args);
622 if (retval == -ENOSPC) {
624 * Promote the attribute list to the Btree format, then
625 * Commit that transaction so that the node_addname() call
626 * can manage its own transactions.
628 xfs_bmap_init(args->flist, args->firstblock);
629 error = xfs_attr3_leaf_to_node(args);
631 error = xfs_bmap_finish(&args->trans, args->flist,
637 xfs_bmap_cancel(args->flist);
642 * bmap_finish() may have committed the last trans and started
643 * a new one. We need the inode to be in all transactions.
646 xfs_trans_ijoin(args->trans, dp, 0);
649 * Commit the current trans (including the inode) and start
652 error = xfs_trans_roll(&args->trans, dp);
657 * Fob the whole rest of the problem off on the Btree code.
659 error = xfs_attr_node_addname(args);
664 * Commit the transaction that added the attr name so that
665 * later routines can manage their own transactions.
667 error = xfs_trans_roll(&args->trans, dp);
672 * If there was an out-of-line value, allocate the blocks we
673 * identified for its storage and copy the value. This is done
674 * after we create the attribute so that we don't overflow the
675 * maximum size of a transaction and/or hit a deadlock.
677 if (args->rmtblkno > 0) {
678 error = xfs_attr_rmtval_set(args);
684 * If this is an atomic rename operation, we must "flip" the
685 * incomplete flags on the "new" and "old" attribute/value pairs
686 * so that one disappears and one appears atomically. Then we
687 * must remove the "old" attribute/value pair.
689 if (args->op_flags & XFS_DA_OP_RENAME) {
691 * In a separate transaction, set the incomplete flag on the
692 * "old" attr and clear the incomplete flag on the "new" attr.
694 error = xfs_attr3_leaf_flipflags(args);
699 * Dismantle the "old" attribute/value pair by removing
700 * a "remote" value (if it exists).
702 args->index = args->index2;
703 args->blkno = args->blkno2;
704 args->rmtblkno = args->rmtblkno2;
705 args->rmtblkcnt = args->rmtblkcnt2;
706 args->rmtvaluelen = args->rmtvaluelen2;
707 if (args->rmtblkno) {
708 error = xfs_attr_rmtval_remove(args);
714 * Read in the block containing the "old" attr, then
715 * remove the "old" attr from that block (neat, huh!)
717 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno,
722 xfs_attr3_leaf_remove(bp, args);
725 * If the result is small enough, shrink it all into the inode.
727 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
728 xfs_bmap_init(args->flist, args->firstblock);
729 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
730 /* bp is gone due to xfs_da_shrink_inode */
732 error = xfs_bmap_finish(&args->trans,
739 xfs_bmap_cancel(args->flist);
744 * bmap_finish() may have committed the last trans
745 * and started a new one. We need the inode to be
746 * in all transactions.
749 xfs_trans_ijoin(args->trans, dp, 0);
753 * Commit the remove and start the next trans in series.
755 error = xfs_trans_roll(&args->trans, dp);
757 } else if (args->rmtblkno > 0) {
759 * Added a "remote" value, just clear the incomplete flag.
761 error = xfs_attr3_leaf_clearflag(args);
767 * Remove a name from the leaf attribute list structure
769 * This leaf block cannot have a "remote" value, we only call this routine
770 * if bmap_one_block() says there is only one block (ie: no remote blks).
773 xfs_attr_leaf_removename(xfs_da_args_t *args)
777 int error, committed, forkoff;
779 trace_xfs_attr_leaf_removename(args);
782 * Remove the attribute.
786 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
790 error = xfs_attr3_leaf_lookup_int(bp, args);
791 if (error == -ENOATTR) {
792 xfs_trans_brelse(args->trans, bp);
796 xfs_attr3_leaf_remove(bp, args);
799 * If the result is small enough, shrink it all into the inode.
801 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
802 xfs_bmap_init(args->flist, args->firstblock);
803 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
804 /* bp is gone due to xfs_da_shrink_inode */
806 error = xfs_bmap_finish(&args->trans, args->flist,
812 xfs_bmap_cancel(args->flist);
817 * bmap_finish() may have committed the last trans and started
818 * a new one. We need the inode to be in all transactions.
821 xfs_trans_ijoin(args->trans, dp, 0);
827 * Look up a name in a leaf attribute list structure.
829 * This leaf block cannot have a "remote" value, we only call this routine
830 * if bmap_one_block() says there is only one block (ie: no remote blks).
833 xfs_attr_leaf_get(xfs_da_args_t *args)
838 trace_xfs_attr_leaf_get(args);
841 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
845 error = xfs_attr3_leaf_lookup_int(bp, args);
846 if (error != -EEXIST) {
847 xfs_trans_brelse(args->trans, bp);
850 error = xfs_attr3_leaf_getvalue(bp, args);
851 xfs_trans_brelse(args->trans, bp);
852 if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) {
853 error = xfs_attr_rmtval_get(args);
858 /*========================================================================
859 * External routines when attribute list size > geo->blksize
860 *========================================================================*/
863 * Add a name to a Btree-format attribute list.
865 * This will involve walking down the Btree, and may involve splitting
866 * leaf nodes and even splitting intermediate nodes up to and including
867 * the root node (a special case of an intermediate node).
869 * "Remote" attribute values confuse the issue and atomic rename operations
870 * add a whole extra layer of confusion on top of that.
873 xfs_attr_node_addname(xfs_da_args_t *args)
875 xfs_da_state_t *state;
876 xfs_da_state_blk_t *blk;
879 int committed, retval, error;
881 trace_xfs_attr_node_addname(args);
884 * Fill in bucket of arguments/results/context to carry around.
889 state = xfs_da_state_alloc();
894 * Search to see if name already exists, and get back a pointer
895 * to where it should go.
897 error = xfs_da3_node_lookup_int(state, &retval);
900 blk = &state->path.blk[ state->path.active-1 ];
901 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
902 if ((args->flags & ATTR_REPLACE) && (retval == -ENOATTR)) {
904 } else if (retval == -EEXIST) {
905 if (args->flags & ATTR_CREATE)
908 trace_xfs_attr_node_replace(args);
910 /* save the attribute state for later removal*/
911 args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */
912 args->blkno2 = args->blkno; /* set 2nd entry info*/
913 args->index2 = args->index;
914 args->rmtblkno2 = args->rmtblkno;
915 args->rmtblkcnt2 = args->rmtblkcnt;
916 args->rmtvaluelen2 = args->rmtvaluelen;
919 * clear the remote attr state now that it is saved so that the
920 * values reflect the state of the attribute we are about to
921 * add, not the attribute we just found and will remove later.
925 args->rmtvaluelen = 0;
928 retval = xfs_attr3_leaf_add(blk->bp, state->args);
929 if (retval == -ENOSPC) {
930 if (state->path.active == 1) {
932 * Its really a single leaf node, but it had
933 * out-of-line values so it looked like it *might*
934 * have been a b-tree.
936 xfs_da_state_free(state);
938 xfs_bmap_init(args->flist, args->firstblock);
939 error = xfs_attr3_leaf_to_node(args);
941 error = xfs_bmap_finish(&args->trans,
948 xfs_bmap_cancel(args->flist);
953 * bmap_finish() may have committed the last trans
954 * and started a new one. We need the inode to be
955 * in all transactions.
958 xfs_trans_ijoin(args->trans, dp, 0);
961 * Commit the node conversion and start the next
962 * trans in the chain.
964 error = xfs_trans_roll(&args->trans, dp);
972 * Split as many Btree elements as required.
973 * This code tracks the new and old attr's location
974 * in the index/blkno/rmtblkno/rmtblkcnt fields and
975 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
977 xfs_bmap_init(args->flist, args->firstblock);
978 error = xfs_da3_split(state);
980 error = xfs_bmap_finish(&args->trans, args->flist,
986 xfs_bmap_cancel(args->flist);
991 * bmap_finish() may have committed the last trans and started
992 * a new one. We need the inode to be in all transactions.
995 xfs_trans_ijoin(args->trans, dp, 0);
998 * Addition succeeded, update Btree hashvals.
1000 xfs_da3_fixhashpath(state, &state->path);
1004 * Kill the state structure, we're done with it and need to
1005 * allow the buffers to come back later.
1007 xfs_da_state_free(state);
1011 * Commit the leaf addition or btree split and start the next
1012 * trans in the chain.
1014 error = xfs_trans_roll(&args->trans, dp);
1019 * If there was an out-of-line value, allocate the blocks we
1020 * identified for its storage and copy the value. This is done
1021 * after we create the attribute so that we don't overflow the
1022 * maximum size of a transaction and/or hit a deadlock.
1024 if (args->rmtblkno > 0) {
1025 error = xfs_attr_rmtval_set(args);
1031 * If this is an atomic rename operation, we must "flip" the
1032 * incomplete flags on the "new" and "old" attribute/value pairs
1033 * so that one disappears and one appears atomically. Then we
1034 * must remove the "old" attribute/value pair.
1036 if (args->op_flags & XFS_DA_OP_RENAME) {
1038 * In a separate transaction, set the incomplete flag on the
1039 * "old" attr and clear the incomplete flag on the "new" attr.
1041 error = xfs_attr3_leaf_flipflags(args);
1046 * Dismantle the "old" attribute/value pair by removing
1047 * a "remote" value (if it exists).
1049 args->index = args->index2;
1050 args->blkno = args->blkno2;
1051 args->rmtblkno = args->rmtblkno2;
1052 args->rmtblkcnt = args->rmtblkcnt2;
1053 args->rmtvaluelen = args->rmtvaluelen2;
1054 if (args->rmtblkno) {
1055 error = xfs_attr_rmtval_remove(args);
1061 * Re-find the "old" attribute entry after any split ops.
1062 * The INCOMPLETE flag means that we will find the "old"
1063 * attr, not the "new" one.
1065 args->flags |= XFS_ATTR_INCOMPLETE;
1066 state = xfs_da_state_alloc();
1070 error = xfs_da3_node_lookup_int(state, &retval);
1075 * Remove the name and update the hashvals in the tree.
1077 blk = &state->path.blk[ state->path.active-1 ];
1078 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1079 error = xfs_attr3_leaf_remove(blk->bp, args);
1080 xfs_da3_fixhashpath(state, &state->path);
1083 * Check to see if the tree needs to be collapsed.
1085 if (retval && (state->path.active > 1)) {
1086 xfs_bmap_init(args->flist, args->firstblock);
1087 error = xfs_da3_join(state);
1089 error = xfs_bmap_finish(&args->trans,
1096 xfs_bmap_cancel(args->flist);
1101 * bmap_finish() may have committed the last trans
1102 * and started a new one. We need the inode to be
1103 * in all transactions.
1106 xfs_trans_ijoin(args->trans, dp, 0);
1110 * Commit and start the next trans in the chain.
1112 error = xfs_trans_roll(&args->trans, dp);
1116 } else if (args->rmtblkno > 0) {
1118 * Added a "remote" value, just clear the incomplete flag.
1120 error = xfs_attr3_leaf_clearflag(args);
1128 xfs_da_state_free(state);
1135 * Remove a name from a B-tree attribute list.
1137 * This will involve walking down the Btree, and may involve joining
1138 * leaf nodes and even joining intermediate nodes up to and including
1139 * the root node (a special case of an intermediate node).
1142 xfs_attr_node_removename(xfs_da_args_t *args)
1144 xfs_da_state_t *state;
1145 xfs_da_state_blk_t *blk;
1148 int retval, error, committed, forkoff;
1150 trace_xfs_attr_node_removename(args);
1153 * Tie a string around our finger to remind us where we are.
1156 state = xfs_da_state_alloc();
1158 state->mp = dp->i_mount;
1161 * Search to see if name exists, and get back a pointer to it.
1163 error = xfs_da3_node_lookup_int(state, &retval);
1164 if (error || (retval != -EEXIST)) {
1171 * If there is an out-of-line value, de-allocate the blocks.
1172 * This is done before we remove the attribute so that we don't
1173 * overflow the maximum size of a transaction and/or hit a deadlock.
1175 blk = &state->path.blk[ state->path.active-1 ];
1176 ASSERT(blk->bp != NULL);
1177 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1178 if (args->rmtblkno > 0) {
1180 * Fill in disk block numbers in the state structure
1181 * so that we can get the buffers back after we commit
1182 * several transactions in the following calls.
1184 error = xfs_attr_fillstate(state);
1189 * Mark the attribute as INCOMPLETE, then bunmapi() the
1192 error = xfs_attr3_leaf_setflag(args);
1195 error = xfs_attr_rmtval_remove(args);
1200 * Refill the state structure with buffers, the prior calls
1201 * released our buffers.
1203 error = xfs_attr_refillstate(state);
1209 * Remove the name and update the hashvals in the tree.
1211 blk = &state->path.blk[ state->path.active-1 ];
1212 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1213 retval = xfs_attr3_leaf_remove(blk->bp, args);
1214 xfs_da3_fixhashpath(state, &state->path);
1217 * Check to see if the tree needs to be collapsed.
1219 if (retval && (state->path.active > 1)) {
1220 xfs_bmap_init(args->flist, args->firstblock);
1221 error = xfs_da3_join(state);
1223 error = xfs_bmap_finish(&args->trans, args->flist,
1229 xfs_bmap_cancel(args->flist);
1234 * bmap_finish() may have committed the last trans and started
1235 * a new one. We need the inode to be in all transactions.
1238 xfs_trans_ijoin(args->trans, dp, 0);
1241 * Commit the Btree join operation and start a new trans.
1243 error = xfs_trans_roll(&args->trans, dp);
1249 * If the result is small enough, push it all into the inode.
1251 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1253 * Have to get rid of the copy of this dabuf in the state.
1255 ASSERT(state->path.active == 1);
1256 ASSERT(state->path.blk[0].bp);
1257 state->path.blk[0].bp = NULL;
1259 error = xfs_attr3_leaf_read(args->trans, args->dp, 0, -1, &bp);
1263 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1264 xfs_bmap_init(args->flist, args->firstblock);
1265 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
1266 /* bp is gone due to xfs_da_shrink_inode */
1268 error = xfs_bmap_finish(&args->trans,
1275 xfs_bmap_cancel(args->flist);
1280 * bmap_finish() may have committed the last trans
1281 * and started a new one. We need the inode to be
1282 * in all transactions.
1285 xfs_trans_ijoin(args->trans, dp, 0);
1287 xfs_trans_brelse(args->trans, bp);
1292 xfs_da_state_free(state);
1297 * Fill in the disk block numbers in the state structure for the buffers
1298 * that are attached to the state structure.
1299 * This is done so that we can quickly reattach ourselves to those buffers
1300 * after some set of transaction commits have released these buffers.
1303 xfs_attr_fillstate(xfs_da_state_t *state)
1305 xfs_da_state_path_t *path;
1306 xfs_da_state_blk_t *blk;
1309 trace_xfs_attr_fillstate(state->args);
1312 * Roll down the "path" in the state structure, storing the on-disk
1313 * block number for those buffers in the "path".
1315 path = &state->path;
1316 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1317 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1319 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1322 blk->disk_blkno = 0;
1327 * Roll down the "altpath" in the state structure, storing the on-disk
1328 * block number for those buffers in the "altpath".
1330 path = &state->altpath;
1331 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1332 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1334 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1337 blk->disk_blkno = 0;
1345 * Reattach the buffers to the state structure based on the disk block
1346 * numbers stored in the state structure.
1347 * This is done after some set of transaction commits have released those
1348 * buffers from our grip.
1351 xfs_attr_refillstate(xfs_da_state_t *state)
1353 xfs_da_state_path_t *path;
1354 xfs_da_state_blk_t *blk;
1357 trace_xfs_attr_refillstate(state->args);
1360 * Roll down the "path" in the state structure, storing the on-disk
1361 * block number for those buffers in the "path".
1363 path = &state->path;
1364 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1365 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1366 if (blk->disk_blkno) {
1367 error = xfs_da3_node_read(state->args->trans,
1369 blk->blkno, blk->disk_blkno,
1370 &blk->bp, XFS_ATTR_FORK);
1379 * Roll down the "altpath" in the state structure, storing the on-disk
1380 * block number for those buffers in the "altpath".
1382 path = &state->altpath;
1383 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1384 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1385 if (blk->disk_blkno) {
1386 error = xfs_da3_node_read(state->args->trans,
1388 blk->blkno, blk->disk_blkno,
1389 &blk->bp, XFS_ATTR_FORK);
1401 * Look up a filename in a node attribute list.
1403 * This routine gets called for any attribute fork that has more than one
1404 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1405 * "remote" values taking up more blocks.
1408 xfs_attr_node_get(xfs_da_args_t *args)
1410 xfs_da_state_t *state;
1411 xfs_da_state_blk_t *blk;
1415 trace_xfs_attr_node_get(args);
1417 state = xfs_da_state_alloc();
1419 state->mp = args->dp->i_mount;
1422 * Search to see if name exists, and get back a pointer to it.
1424 error = xfs_da3_node_lookup_int(state, &retval);
1427 } else if (retval == -EEXIST) {
1428 blk = &state->path.blk[ state->path.active-1 ];
1429 ASSERT(blk->bp != NULL);
1430 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1433 * Get the value, local or "remote"
1435 retval = xfs_attr3_leaf_getvalue(blk->bp, args);
1436 if (!retval && (args->rmtblkno > 0)
1437 && !(args->flags & ATTR_KERNOVAL)) {
1438 retval = xfs_attr_rmtval_get(args);
1443 * If not in a transaction, we have to release all the buffers.
1445 for (i = 0; i < state->path.active; i++) {
1446 xfs_trans_brelse(args->trans, state->path.blk[i].bp);
1447 state->path.blk[i].bp = NULL;
1450 xfs_da_state_free(state);