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
21 #include "xfs_types.h"
25 #include "xfs_trans.h"
28 #include "xfs_mount.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_attr_sf.h"
32 #include "xfs_dinode.h"
33 #include "xfs_inode.h"
34 #include "xfs_alloc.h"
35 #include "xfs_inode_item.h"
38 #include "xfs_attr_leaf.h"
39 #include "xfs_error.h"
40 #include "xfs_quota.h"
41 #include "xfs_trans_space.h"
43 #include "xfs_vnodeops.h"
44 #include "xfs_trace.h"
49 * Provide the external interfaces to manage attribute lists.
52 /*========================================================================
53 * Function prototypes for the kernel.
54 *========================================================================*/
57 * Internal routines when attribute list fits inside the inode.
59 STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args);
62 * Internal routines when attribute list is one block.
64 STATIC int xfs_attr_leaf_get(xfs_da_args_t *args);
65 STATIC int xfs_attr_leaf_addname(xfs_da_args_t *args);
66 STATIC int xfs_attr_leaf_removename(xfs_da_args_t *args);
67 STATIC int xfs_attr_leaf_list(xfs_attr_list_context_t *context);
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_node_list(xfs_attr_list_context_t *context);
76 STATIC int xfs_attr_fillstate(xfs_da_state_t *state);
77 STATIC int xfs_attr_refillstate(xfs_da_state_t *state);
80 * Routines to manipulate out-of-line attribute values.
82 STATIC int xfs_attr_rmtval_set(xfs_da_args_t *args);
83 STATIC int xfs_attr_rmtval_remove(xfs_da_args_t *args);
85 #define ATTR_RMTVALUE_MAPSIZE 1 /* # of map entries at once */
88 xfs_attr_name_to_xname(
89 struct xfs_name *xname,
90 const unsigned char *aname)
95 xname->len = strlen((char *)aname);
96 if (xname->len >= MAXNAMELEN)
97 return EFAULT; /* match IRIX behaviour */
104 struct xfs_inode *ip)
106 if (!XFS_IFORK_Q(ip) ||
107 (ip->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS &&
108 ip->i_d.di_anextents == 0))
113 /*========================================================================
114 * Overall external interface routines.
115 *========================================================================*/
119 struct xfs_inode *ip,
120 struct xfs_name *name,
121 unsigned char *value,
128 if (!xfs_inode_hasattr(ip))
132 * Fill in the arg structure for this request.
134 memset((char *)&args, 0, sizeof(args));
135 args.name = name->name;
136 args.namelen = name->len;
138 args.valuelen = *valuelenp;
140 args.hashval = xfs_da_hashname(args.name, args.namelen);
142 args.whichfork = XFS_ATTR_FORK;
145 * Decide on what work routines to call based on the inode size.
147 if (ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
148 error = xfs_attr_shortform_getvalue(&args);
149 } else if (xfs_bmap_one_block(ip, XFS_ATTR_FORK)) {
150 error = xfs_attr_leaf_get(&args);
152 error = xfs_attr_node_get(&args);
156 * Return the number of bytes in the value to the caller.
158 *valuelenp = args.valuelen;
168 const unsigned char *name,
169 unsigned char *value,
174 struct xfs_name xname;
176 XFS_STATS_INC(xs_attr_get);
178 if (XFS_FORCED_SHUTDOWN(ip->i_mount))
181 error = xfs_attr_name_to_xname(&xname, name);
185 xfs_ilock(ip, XFS_ILOCK_SHARED);
186 error = xfs_attr_get_int(ip, &xname, value, valuelenp, flags);
187 xfs_iunlock(ip, XFS_ILOCK_SHARED);
192 * Calculate how many blocks we need for the new attribute,
196 struct xfs_inode *ip,
201 struct xfs_mount *mp = ip->i_mount;
206 * Determine space new attribute will use, and if it would be
207 * "local" or "remote" (note: local != inline).
209 size = xfs_attr_leaf_newentsize(namelen, valuelen,
210 mp->m_sb.sb_blocksize, local);
212 nblks = XFS_DAENTER_SPACE_RES(mp, XFS_ATTR_FORK);
214 if (size > (mp->m_sb.sb_blocksize >> 1)) {
215 /* Double split possible */
220 * Out of line attribute, cannot double split, but
221 * make room for the attribute value itself.
223 uint dblocks = XFS_B_TO_FSB(mp, valuelen);
225 nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK);
233 struct xfs_inode *dp,
234 struct xfs_name *name,
235 unsigned char *value,
240 xfs_fsblock_t firstblock;
241 xfs_bmap_free_t flist;
242 int error, err2, committed;
243 xfs_mount_t *mp = dp->i_mount;
244 int rsvd = (flags & ATTR_ROOT) != 0;
248 * Attach the dquots to the inode.
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(name->len, valuelen);
262 if ((error = xfs_bmap_add_attrfork(dp, sf_size, rsvd)))
267 * Fill in the arg structure for this request.
269 memset((char *)&args, 0, sizeof(args));
270 args.name = name->name;
271 args.namelen = name->len;
273 args.valuelen = valuelen;
275 args.hashval = xfs_da_hashname(args.name, args.namelen);
277 args.firstblock = &firstblock;
279 args.whichfork = XFS_ATTR_FORK;
280 args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
282 /* Size is now blocks for attribute data */
283 args.total = xfs_attr_calc_size(dp, name->len, valuelen, &local);
286 * Start our first transaction of the day.
288 * All future transactions during this code must be "chained" off
289 * this one via the trans_dup() call. All transactions will contain
290 * the inode, and the inode will always be marked with trans_ihold().
291 * Since the inode will be locked in all transactions, we must log
292 * the inode in every transaction to let it float upward through
295 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_SET);
298 * Root fork attributes can use reserved data blocks for this
299 * operation if necessary
303 args.trans->t_flags |= XFS_TRANS_RESERVE;
305 if ((error = xfs_trans_reserve(args.trans, args.total,
306 XFS_ATTRSET_LOG_RES(mp, args.total), 0,
307 XFS_TRANS_PERM_LOG_RES, XFS_ATTRSET_LOG_COUNT))) {
308 xfs_trans_cancel(args.trans, 0);
311 xfs_ilock(dp, XFS_ILOCK_EXCL);
313 error = xfs_trans_reserve_quota_nblks(args.trans, dp, args.total, 0,
314 rsvd ? XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
315 XFS_QMOPT_RES_REGBLKS);
317 xfs_iunlock(dp, XFS_ILOCK_EXCL);
318 xfs_trans_cancel(args.trans, XFS_TRANS_RELEASE_LOG_RES);
322 xfs_trans_ijoin(args.trans, dp);
325 * If the attribute list is non-existent or a shortform list,
326 * upgrade it to a single-leaf-block attribute list.
328 if ((dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) ||
329 ((dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) &&
330 (dp->i_d.di_anextents == 0))) {
333 * Build initial attribute list (if required).
335 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS)
336 xfs_attr_shortform_create(&args);
339 * Try to add the attr to the attribute list in
342 error = xfs_attr_shortform_addname(&args);
343 if (error != ENOSPC) {
345 * Commit the shortform mods, and we're done.
346 * NOTE: this is also the error path (EEXIST, etc).
348 ASSERT(args.trans != NULL);
351 * If this is a synchronous mount, make sure that
352 * the transaction goes to disk before returning
355 if (mp->m_flags & XFS_MOUNT_WSYNC) {
356 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 == 0 ? err2 : error);
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);
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);
415 * If this is a synchronous mount, make sure that the
416 * transaction goes to disk before returning to the user.
418 if (mp->m_flags & XFS_MOUNT_WSYNC) {
419 xfs_trans_set_sync(args.trans);
422 if ((flags & ATTR_KERNOTIME) == 0)
423 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
426 * Commit the last in the sequence of transactions.
428 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
429 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
430 xfs_iunlock(dp, XFS_ILOCK_EXCL);
436 xfs_trans_cancel(args.trans,
437 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
438 xfs_iunlock(dp, XFS_ILOCK_EXCL);
445 const unsigned char *name,
446 unsigned char *value,
451 struct xfs_name xname;
453 XFS_STATS_INC(xs_attr_set);
455 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
458 error = xfs_attr_name_to_xname(&xname, name);
462 return xfs_attr_set_int(dp, &xname, value, valuelen, flags);
466 * Generic handler routine to remove a name from an attribute list.
467 * Transitions attribute list from Btree to shortform as necessary.
470 xfs_attr_remove_int(xfs_inode_t *dp, struct xfs_name *name, int flags)
473 xfs_fsblock_t firstblock;
474 xfs_bmap_free_t flist;
476 xfs_mount_t *mp = dp->i_mount;
479 * Fill in the arg structure for this request.
481 memset((char *)&args, 0, sizeof(args));
482 args.name = name->name;
483 args.namelen = name->len;
485 args.hashval = xfs_da_hashname(args.name, args.namelen);
487 args.firstblock = &firstblock;
490 args.whichfork = XFS_ATTR_FORK;
493 * we have no control over the attribute names that userspace passes us
494 * to remove, so we have to allow the name lookup prior to attribute
497 args.op_flags = XFS_DA_OP_OKNOENT;
500 * Attach the dquots to the inode.
502 error = xfs_qm_dqattach(dp, 0);
507 * Start our first transaction of the day.
509 * All future transactions during this code must be "chained" off
510 * this one via the trans_dup() call. All transactions will contain
511 * the inode, and the inode will always be marked with trans_ihold().
512 * Since the inode will be locked in all transactions, we must log
513 * the inode in every transaction to let it float upward through
516 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM);
519 * Root fork attributes can use reserved data blocks for this
520 * operation if necessary
523 if (flags & ATTR_ROOT)
524 args.trans->t_flags |= XFS_TRANS_RESERVE;
526 if ((error = xfs_trans_reserve(args.trans,
527 XFS_ATTRRM_SPACE_RES(mp),
528 XFS_ATTRRM_LOG_RES(mp),
529 0, XFS_TRANS_PERM_LOG_RES,
530 XFS_ATTRRM_LOG_COUNT))) {
531 xfs_trans_cancel(args.trans, 0);
535 xfs_ilock(dp, XFS_ILOCK_EXCL);
537 * No need to make quota reservations here. We expect to release some
538 * blocks not allocate in the common case.
540 xfs_trans_ijoin(args.trans, dp);
543 * Decide on what work routines to call based on the inode size.
545 if (!xfs_inode_hasattr(dp)) {
546 error = XFS_ERROR(ENOATTR);
549 if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
550 ASSERT(dp->i_afp->if_flags & XFS_IFINLINE);
551 error = xfs_attr_shortform_remove(&args);
555 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
556 error = xfs_attr_leaf_removename(&args);
558 error = xfs_attr_node_removename(&args);
565 * If this is a synchronous mount, make sure that the
566 * transaction goes to disk before returning to the user.
568 if (mp->m_flags & XFS_MOUNT_WSYNC) {
569 xfs_trans_set_sync(args.trans);
572 if ((flags & ATTR_KERNOTIME) == 0)
573 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
576 * Commit the last in the sequence of transactions.
578 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
579 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
580 xfs_iunlock(dp, XFS_ILOCK_EXCL);
586 xfs_trans_cancel(args.trans,
587 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
588 xfs_iunlock(dp, XFS_ILOCK_EXCL);
595 const unsigned char *name,
599 struct xfs_name xname;
601 XFS_STATS_INC(xs_attr_remove);
603 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
606 error = xfs_attr_name_to_xname(&xname, name);
610 xfs_ilock(dp, XFS_ILOCK_SHARED);
611 if (!xfs_inode_hasattr(dp)) {
612 xfs_iunlock(dp, XFS_ILOCK_SHARED);
613 return XFS_ERROR(ENOATTR);
615 xfs_iunlock(dp, XFS_ILOCK_SHARED);
617 return xfs_attr_remove_int(dp, &xname, flags);
621 xfs_attr_list_int(xfs_attr_list_context_t *context)
624 xfs_inode_t *dp = context->dp;
626 XFS_STATS_INC(xs_attr_list);
628 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
631 xfs_ilock(dp, XFS_ILOCK_SHARED);
634 * Decide on what work routines to call based on the inode size.
636 if (!xfs_inode_hasattr(dp)) {
638 } else if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
639 error = xfs_attr_shortform_list(context);
640 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
641 error = xfs_attr_leaf_list(context);
643 error = xfs_attr_node_list(context);
646 xfs_iunlock(dp, XFS_ILOCK_SHARED);
651 #define ATTR_ENTBASESIZE /* minimum bytes used by an attr */ \
652 (((struct attrlist_ent *) 0)->a_name - (char *) 0)
653 #define ATTR_ENTSIZE(namelen) /* actual bytes used by an attr */ \
654 ((ATTR_ENTBASESIZE + (namelen) + 1 + sizeof(u_int32_t)-1) \
655 & ~(sizeof(u_int32_t)-1))
658 * Format an attribute and copy it out to the user's buffer.
659 * Take care to check values and protect against them changing later,
660 * we may be reading them directly out of a user buffer.
664 xfs_attr_put_listent(
665 xfs_attr_list_context_t *context,
670 unsigned char *value)
672 struct attrlist *alist = (struct attrlist *)context->alist;
676 ASSERT(!(context->flags & ATTR_KERNOVAL));
677 ASSERT(context->count >= 0);
678 ASSERT(context->count < (ATTR_MAX_VALUELEN/8));
679 ASSERT(context->firstu >= sizeof(*alist));
680 ASSERT(context->firstu <= context->bufsize);
683 * Only list entries in the right namespace.
685 if (((context->flags & ATTR_SECURE) == 0) !=
686 ((flags & XFS_ATTR_SECURE) == 0))
688 if (((context->flags & ATTR_ROOT) == 0) !=
689 ((flags & XFS_ATTR_ROOT) == 0))
692 arraytop = sizeof(*alist) +
693 context->count * sizeof(alist->al_offset[0]);
694 context->firstu -= ATTR_ENTSIZE(namelen);
695 if (context->firstu < arraytop) {
696 trace_xfs_attr_list_full(context);
698 context->seen_enough = 1;
702 aep = (attrlist_ent_t *)&context->alist[context->firstu];
703 aep->a_valuelen = valuelen;
704 memcpy(aep->a_name, name, namelen);
705 aep->a_name[namelen] = 0;
706 alist->al_offset[context->count++] = context->firstu;
707 alist->al_count = context->count;
708 trace_xfs_attr_list_add(context);
713 * Generate a list of extended attribute names and optionally
714 * also value lengths. Positive return value follows the XFS
715 * convention of being an error, zero or negative return code
716 * is the length of the buffer returned (negated), indicating
725 attrlist_cursor_kern_t *cursor)
727 xfs_attr_list_context_t context;
728 struct attrlist *alist;
732 * Validate the cursor.
734 if (cursor->pad1 || cursor->pad2)
735 return(XFS_ERROR(EINVAL));
736 if ((cursor->initted == 0) &&
737 (cursor->hashval || cursor->blkno || cursor->offset))
738 return XFS_ERROR(EINVAL);
741 * Check for a properly aligned buffer.
743 if (((long)buffer) & (sizeof(int)-1))
744 return XFS_ERROR(EFAULT);
745 if (flags & ATTR_KERNOVAL)
749 * Initialize the output buffer.
751 memset(&context, 0, sizeof(context));
753 context.cursor = cursor;
755 context.flags = flags;
756 context.alist = buffer;
757 context.bufsize = (bufsize & ~(sizeof(int)-1)); /* align */
758 context.firstu = context.bufsize;
759 context.put_listent = xfs_attr_put_listent;
761 alist = (struct attrlist *)context.alist;
764 alist->al_offset[0] = context.bufsize;
766 error = xfs_attr_list_int(&context);
772 xfs_attr_inactive(xfs_inode_t *dp)
779 ASSERT(! XFS_NOT_DQATTACHED(mp, dp));
781 xfs_ilock(dp, XFS_ILOCK_SHARED);
782 if (!xfs_inode_hasattr(dp) ||
783 dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
784 xfs_iunlock(dp, XFS_ILOCK_SHARED);
787 xfs_iunlock(dp, XFS_ILOCK_SHARED);
790 * Start our first transaction of the day.
792 * All future transactions during this code must be "chained" off
793 * this one via the trans_dup() call. All transactions will contain
794 * the inode, and the inode will always be marked with trans_ihold().
795 * Since the inode will be locked in all transactions, we must log
796 * the inode in every transaction to let it float upward through
799 trans = xfs_trans_alloc(mp, XFS_TRANS_ATTRINVAL);
800 if ((error = xfs_trans_reserve(trans, 0, XFS_ATTRINVAL_LOG_RES(mp), 0,
801 XFS_TRANS_PERM_LOG_RES,
802 XFS_ATTRINVAL_LOG_COUNT))) {
803 xfs_trans_cancel(trans, 0);
806 xfs_ilock(dp, XFS_ILOCK_EXCL);
809 * No need to make quota reservations here. We expect to release some
810 * blocks, not allocate, in the common case.
812 xfs_trans_ijoin(trans, dp);
815 * Decide on what work routines to call based on the inode size.
817 if (!xfs_inode_hasattr(dp) ||
818 dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
822 error = xfs_attr_root_inactive(&trans, dp);
827 * Signal synchronous inactive transactions unless this is a
828 * synchronous mount filesystem in which case we know that we're here
829 * because we've been called out of xfs_inactive which means that the
830 * last reference is gone and the unlink transaction has already hit
831 * the disk so async inactive transactions are safe.
833 if (!(mp->m_flags & XFS_MOUNT_WSYNC)) {
834 if (dp->i_d.di_anextents > 0)
835 xfs_trans_set_sync(trans);
838 error = xfs_itruncate_extents(&trans, dp, XFS_ATTR_FORK, 0);
843 * Commit the last in the sequence of transactions.
845 xfs_trans_log_inode(trans, dp, XFS_ILOG_CORE);
846 error = xfs_trans_commit(trans, XFS_TRANS_RELEASE_LOG_RES);
847 xfs_iunlock(dp, XFS_ILOCK_EXCL);
852 xfs_trans_cancel(trans, XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
853 xfs_iunlock(dp, XFS_ILOCK_EXCL);
859 /*========================================================================
860 * External routines when attribute list is inside the inode
861 *========================================================================*/
864 * Add a name to the shortform attribute list structure
865 * This is the external routine.
868 xfs_attr_shortform_addname(xfs_da_args_t *args)
870 int newsize, forkoff, retval;
872 retval = xfs_attr_shortform_lookup(args);
873 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
875 } else if (retval == EEXIST) {
876 if (args->flags & ATTR_CREATE)
878 retval = xfs_attr_shortform_remove(args);
882 if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX ||
883 args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX)
884 return(XFS_ERROR(ENOSPC));
886 newsize = XFS_ATTR_SF_TOTSIZE(args->dp);
887 newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
889 forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize);
891 return(XFS_ERROR(ENOSPC));
893 xfs_attr_shortform_add(args, forkoff);
898 /*========================================================================
899 * External routines when attribute list is one block
900 *========================================================================*/
903 * Add a name to the leaf attribute list structure
905 * This leaf block cannot have a "remote" value, we only call this routine
906 * if bmap_one_block() says there is only one block (ie: no remote blks).
909 xfs_attr_leaf_addname(xfs_da_args_t *args)
913 int retval, error, committed, forkoff;
916 * Read the (only) block in the attribute list in.
920 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
927 * Look up the given attribute in the leaf block. Figure out if
928 * the given flags produce an error or call for an atomic rename.
930 retval = xfs_attr_leaf_lookup_int(bp, args);
931 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
932 xfs_da_brelse(args->trans, bp);
934 } else if (retval == EEXIST) {
935 if (args->flags & ATTR_CREATE) { /* pure create op */
936 xfs_da_brelse(args->trans, bp);
939 args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */
940 args->blkno2 = args->blkno; /* set 2nd entry info*/
941 args->index2 = args->index;
942 args->rmtblkno2 = args->rmtblkno;
943 args->rmtblkcnt2 = args->rmtblkcnt;
947 * Add the attribute to the leaf block, transitioning to a Btree
950 retval = xfs_attr_leaf_add(bp, args);
952 if (retval == ENOSPC) {
954 * Promote the attribute list to the Btree format, then
955 * Commit that transaction so that the node_addname() call
956 * can manage its own transactions.
958 xfs_bmap_init(args->flist, args->firstblock);
959 error = xfs_attr_leaf_to_node(args);
961 error = xfs_bmap_finish(&args->trans, args->flist,
967 xfs_bmap_cancel(args->flist);
972 * bmap_finish() may have committed the last trans and started
973 * a new one. We need the inode to be in all transactions.
976 xfs_trans_ijoin(args->trans, dp);
979 * Commit the current trans (including the inode) and start
982 error = xfs_trans_roll(&args->trans, dp);
987 * Fob the whole rest of the problem off on the Btree code.
989 error = xfs_attr_node_addname(args);
994 * Commit the transaction that added the attr name so that
995 * later routines can manage their own transactions.
997 error = xfs_trans_roll(&args->trans, dp);
1002 * If there was an out-of-line value, allocate the blocks we
1003 * identified for its storage and copy the value. This is done
1004 * after we create the attribute so that we don't overflow the
1005 * maximum size of a transaction and/or hit a deadlock.
1007 if (args->rmtblkno > 0) {
1008 error = xfs_attr_rmtval_set(args);
1014 * If this is an atomic rename operation, we must "flip" the
1015 * incomplete flags on the "new" and "old" attribute/value pairs
1016 * so that one disappears and one appears atomically. Then we
1017 * must remove the "old" attribute/value pair.
1019 if (args->op_flags & XFS_DA_OP_RENAME) {
1021 * In a separate transaction, set the incomplete flag on the
1022 * "old" attr and clear the incomplete flag on the "new" attr.
1024 error = xfs_attr_leaf_flipflags(args);
1029 * Dismantle the "old" attribute/value pair by removing
1030 * a "remote" value (if it exists).
1032 args->index = args->index2;
1033 args->blkno = args->blkno2;
1034 args->rmtblkno = args->rmtblkno2;
1035 args->rmtblkcnt = args->rmtblkcnt2;
1036 if (args->rmtblkno) {
1037 error = xfs_attr_rmtval_remove(args);
1043 * Read in the block containing the "old" attr, then
1044 * remove the "old" attr from that block (neat, huh!)
1046 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1,
1047 &bp, XFS_ATTR_FORK);
1051 (void)xfs_attr_leaf_remove(bp, args);
1054 * If the result is small enough, shrink it all into the inode.
1056 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1057 xfs_bmap_init(args->flist, args->firstblock);
1058 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1059 /* bp is gone due to xfs_da_shrink_inode */
1061 error = xfs_bmap_finish(&args->trans,
1068 xfs_bmap_cancel(args->flist);
1073 * bmap_finish() may have committed the last trans
1074 * and started a new one. We need the inode to be
1075 * in all transactions.
1078 xfs_trans_ijoin(args->trans, dp);
1080 xfs_da_buf_done(bp);
1083 * Commit the remove and start the next trans in series.
1085 error = xfs_trans_roll(&args->trans, dp);
1087 } else if (args->rmtblkno > 0) {
1089 * Added a "remote" value, just clear the incomplete flag.
1091 error = xfs_attr_leaf_clearflag(args);
1097 * Remove a name from the leaf attribute list structure
1099 * This leaf block cannot have a "remote" value, we only call this routine
1100 * if bmap_one_block() says there is only one block (ie: no remote blks).
1103 xfs_attr_leaf_removename(xfs_da_args_t *args)
1107 int error, committed, forkoff;
1110 * Remove the attribute.
1114 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
1121 error = xfs_attr_leaf_lookup_int(bp, args);
1122 if (error == ENOATTR) {
1123 xfs_da_brelse(args->trans, bp);
1127 (void)xfs_attr_leaf_remove(bp, args);
1130 * If the result is small enough, shrink it all into the inode.
1132 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1133 xfs_bmap_init(args->flist, args->firstblock);
1134 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1135 /* bp is gone due to xfs_da_shrink_inode */
1137 error = xfs_bmap_finish(&args->trans, args->flist,
1143 xfs_bmap_cancel(args->flist);
1148 * bmap_finish() may have committed the last trans and started
1149 * a new one. We need the inode to be in all transactions.
1152 xfs_trans_ijoin(args->trans, dp);
1154 xfs_da_buf_done(bp);
1159 * Look up a name in a leaf attribute list structure.
1161 * This leaf block cannot have a "remote" value, we only call this routine
1162 * if bmap_one_block() says there is only one block (ie: no remote blks).
1165 xfs_attr_leaf_get(xfs_da_args_t *args)
1171 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
1177 error = xfs_attr_leaf_lookup_int(bp, args);
1178 if (error != EEXIST) {
1179 xfs_da_brelse(args->trans, bp);
1182 error = xfs_attr_leaf_getvalue(bp, args);
1183 xfs_da_brelse(args->trans, bp);
1184 if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) {
1185 error = xfs_attr_rmtval_get(args);
1191 * Copy out attribute entries for attr_list(), for leaf attribute lists.
1194 xfs_attr_leaf_list(xfs_attr_list_context_t *context)
1196 xfs_attr_leafblock_t *leaf;
1200 context->cursor->blkno = 0;
1201 error = xfs_da_read_buf(NULL, context->dp, 0, -1, &bp, XFS_ATTR_FORK);
1203 return XFS_ERROR(error);
1206 if (unlikely(be16_to_cpu(leaf->hdr.info.magic) != XFS_ATTR_LEAF_MAGIC)) {
1207 XFS_CORRUPTION_ERROR("xfs_attr_leaf_list", XFS_ERRLEVEL_LOW,
1208 context->dp->i_mount, leaf);
1209 xfs_da_brelse(NULL, bp);
1210 return XFS_ERROR(EFSCORRUPTED);
1213 error = xfs_attr_leaf_list_int(bp, context);
1214 xfs_da_brelse(NULL, bp);
1215 return XFS_ERROR(error);
1219 /*========================================================================
1220 * External routines when attribute list size > XFS_LBSIZE(mp).
1221 *========================================================================*/
1224 * Add a name to a Btree-format attribute list.
1226 * This will involve walking down the Btree, and may involve splitting
1227 * leaf nodes and even splitting intermediate nodes up to and including
1228 * the root node (a special case of an intermediate node).
1230 * "Remote" attribute values confuse the issue and atomic rename operations
1231 * add a whole extra layer of confusion on top of that.
1234 xfs_attr_node_addname(xfs_da_args_t *args)
1236 xfs_da_state_t *state;
1237 xfs_da_state_blk_t *blk;
1240 int committed, retval, error;
1243 * Fill in bucket of arguments/results/context to carry around.
1248 state = xfs_da_state_alloc();
1251 state->blocksize = state->mp->m_sb.sb_blocksize;
1252 state->node_ents = state->mp->m_attr_node_ents;
1255 * Search to see if name already exists, and get back a pointer
1256 * to where it should go.
1258 error = xfs_da_node_lookup_int(state, &retval);
1261 blk = &state->path.blk[ state->path.active-1 ];
1262 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1263 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
1265 } else if (retval == EEXIST) {
1266 if (args->flags & ATTR_CREATE)
1268 args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */
1269 args->blkno2 = args->blkno; /* set 2nd entry info*/
1270 args->index2 = args->index;
1271 args->rmtblkno2 = args->rmtblkno;
1272 args->rmtblkcnt2 = args->rmtblkcnt;
1274 args->rmtblkcnt = 0;
1277 retval = xfs_attr_leaf_add(blk->bp, state->args);
1278 if (retval == ENOSPC) {
1279 if (state->path.active == 1) {
1281 * Its really a single leaf node, but it had
1282 * out-of-line values so it looked like it *might*
1283 * have been a b-tree.
1285 xfs_da_state_free(state);
1286 xfs_bmap_init(args->flist, args->firstblock);
1287 error = xfs_attr_leaf_to_node(args);
1289 error = xfs_bmap_finish(&args->trans,
1296 xfs_bmap_cancel(args->flist);
1301 * bmap_finish() may have committed the last trans
1302 * and started a new one. We need the inode to be
1303 * in all transactions.
1306 xfs_trans_ijoin(args->trans, dp);
1309 * Commit the node conversion and start the next
1310 * trans in the chain.
1312 error = xfs_trans_roll(&args->trans, dp);
1320 * Split as many Btree elements as required.
1321 * This code tracks the new and old attr's location
1322 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1323 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1325 xfs_bmap_init(args->flist, args->firstblock);
1326 error = xfs_da_split(state);
1328 error = xfs_bmap_finish(&args->trans, args->flist,
1334 xfs_bmap_cancel(args->flist);
1339 * bmap_finish() may have committed the last trans and started
1340 * a new one. We need the inode to be in all transactions.
1343 xfs_trans_ijoin(args->trans, dp);
1346 * Addition succeeded, update Btree hashvals.
1348 xfs_da_fixhashpath(state, &state->path);
1352 * Kill the state structure, we're done with it and need to
1353 * allow the buffers to come back later.
1355 xfs_da_state_free(state);
1359 * Commit the leaf addition or btree split and start the next
1360 * trans in the chain.
1362 error = xfs_trans_roll(&args->trans, dp);
1367 * If there was an out-of-line value, allocate the blocks we
1368 * identified for its storage and copy the value. This is done
1369 * after we create the attribute so that we don't overflow the
1370 * maximum size of a transaction and/or hit a deadlock.
1372 if (args->rmtblkno > 0) {
1373 error = xfs_attr_rmtval_set(args);
1379 * If this is an atomic rename operation, we must "flip" the
1380 * incomplete flags on the "new" and "old" attribute/value pairs
1381 * so that one disappears and one appears atomically. Then we
1382 * must remove the "old" attribute/value pair.
1384 if (args->op_flags & XFS_DA_OP_RENAME) {
1386 * In a separate transaction, set the incomplete flag on the
1387 * "old" attr and clear the incomplete flag on the "new" attr.
1389 error = xfs_attr_leaf_flipflags(args);
1394 * Dismantle the "old" attribute/value pair by removing
1395 * a "remote" value (if it exists).
1397 args->index = args->index2;
1398 args->blkno = args->blkno2;
1399 args->rmtblkno = args->rmtblkno2;
1400 args->rmtblkcnt = args->rmtblkcnt2;
1401 if (args->rmtblkno) {
1402 error = xfs_attr_rmtval_remove(args);
1408 * Re-find the "old" attribute entry after any split ops.
1409 * The INCOMPLETE flag means that we will find the "old"
1410 * attr, not the "new" one.
1412 args->flags |= XFS_ATTR_INCOMPLETE;
1413 state = xfs_da_state_alloc();
1416 state->blocksize = state->mp->m_sb.sb_blocksize;
1417 state->node_ents = state->mp->m_attr_node_ents;
1419 error = xfs_da_node_lookup_int(state, &retval);
1424 * Remove the name and update the hashvals in the tree.
1426 blk = &state->path.blk[ state->path.active-1 ];
1427 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1428 error = xfs_attr_leaf_remove(blk->bp, args);
1429 xfs_da_fixhashpath(state, &state->path);
1432 * Check to see if the tree needs to be collapsed.
1434 if (retval && (state->path.active > 1)) {
1435 xfs_bmap_init(args->flist, args->firstblock);
1436 error = xfs_da_join(state);
1438 error = xfs_bmap_finish(&args->trans,
1445 xfs_bmap_cancel(args->flist);
1450 * bmap_finish() may have committed the last trans
1451 * and started a new one. We need the inode to be
1452 * in all transactions.
1455 xfs_trans_ijoin(args->trans, dp);
1459 * Commit and start the next trans in the chain.
1461 error = xfs_trans_roll(&args->trans, dp);
1465 } else if (args->rmtblkno > 0) {
1467 * Added a "remote" value, just clear the incomplete flag.
1469 error = xfs_attr_leaf_clearflag(args);
1477 xfs_da_state_free(state);
1484 * Remove a name from a B-tree attribute list.
1486 * This will involve walking down the Btree, and may involve joining
1487 * leaf nodes and even joining intermediate nodes up to and including
1488 * the root node (a special case of an intermediate node).
1491 xfs_attr_node_removename(xfs_da_args_t *args)
1493 xfs_da_state_t *state;
1494 xfs_da_state_blk_t *blk;
1497 int retval, error, committed, forkoff;
1500 * Tie a string around our finger to remind us where we are.
1503 state = xfs_da_state_alloc();
1505 state->mp = dp->i_mount;
1506 state->blocksize = state->mp->m_sb.sb_blocksize;
1507 state->node_ents = state->mp->m_attr_node_ents;
1510 * Search to see if name exists, and get back a pointer to it.
1512 error = xfs_da_node_lookup_int(state, &retval);
1513 if (error || (retval != EEXIST)) {
1520 * If there is an out-of-line value, de-allocate the blocks.
1521 * This is done before we remove the attribute so that we don't
1522 * overflow the maximum size of a transaction and/or hit a deadlock.
1524 blk = &state->path.blk[ state->path.active-1 ];
1525 ASSERT(blk->bp != NULL);
1526 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1527 if (args->rmtblkno > 0) {
1529 * Fill in disk block numbers in the state structure
1530 * so that we can get the buffers back after we commit
1531 * several transactions in the following calls.
1533 error = xfs_attr_fillstate(state);
1538 * Mark the attribute as INCOMPLETE, then bunmapi() the
1541 error = xfs_attr_leaf_setflag(args);
1544 error = xfs_attr_rmtval_remove(args);
1549 * Refill the state structure with buffers, the prior calls
1550 * released our buffers.
1552 error = xfs_attr_refillstate(state);
1558 * Remove the name and update the hashvals in the tree.
1560 blk = &state->path.blk[ state->path.active-1 ];
1561 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1562 retval = xfs_attr_leaf_remove(blk->bp, args);
1563 xfs_da_fixhashpath(state, &state->path);
1566 * Check to see if the tree needs to be collapsed.
1568 if (retval && (state->path.active > 1)) {
1569 xfs_bmap_init(args->flist, args->firstblock);
1570 error = xfs_da_join(state);
1572 error = xfs_bmap_finish(&args->trans, args->flist,
1578 xfs_bmap_cancel(args->flist);
1583 * bmap_finish() may have committed the last trans and started
1584 * a new one. We need the inode to be in all transactions.
1587 xfs_trans_ijoin(args->trans, dp);
1590 * Commit the Btree join operation and start a new trans.
1592 error = xfs_trans_roll(&args->trans, dp);
1598 * If the result is small enough, push it all into the inode.
1600 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1602 * Have to get rid of the copy of this dabuf in the state.
1604 ASSERT(state->path.active == 1);
1605 ASSERT(state->path.blk[0].bp);
1606 xfs_da_buf_done(state->path.blk[0].bp);
1607 state->path.blk[0].bp = NULL;
1609 error = xfs_da_read_buf(args->trans, args->dp, 0, -1, &bp,
1613 ASSERT(be16_to_cpu(((xfs_attr_leafblock_t *)
1614 bp->data)->hdr.info.magic)
1615 == XFS_ATTR_LEAF_MAGIC);
1617 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1618 xfs_bmap_init(args->flist, args->firstblock);
1619 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1620 /* bp is gone due to xfs_da_shrink_inode */
1622 error = xfs_bmap_finish(&args->trans,
1629 xfs_bmap_cancel(args->flist);
1634 * bmap_finish() may have committed the last trans
1635 * and started a new one. We need the inode to be
1636 * in all transactions.
1639 xfs_trans_ijoin(args->trans, dp);
1641 xfs_da_brelse(args->trans, bp);
1646 xfs_da_state_free(state);
1651 * Fill in the disk block numbers in the state structure for the buffers
1652 * that are attached to the state structure.
1653 * This is done so that we can quickly reattach ourselves to those buffers
1654 * after some set of transaction commits have released these buffers.
1657 xfs_attr_fillstate(xfs_da_state_t *state)
1659 xfs_da_state_path_t *path;
1660 xfs_da_state_blk_t *blk;
1664 * Roll down the "path" in the state structure, storing the on-disk
1665 * block number for those buffers in the "path".
1667 path = &state->path;
1668 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1669 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1671 blk->disk_blkno = xfs_da_blkno(blk->bp);
1672 xfs_da_buf_done(blk->bp);
1675 blk->disk_blkno = 0;
1680 * Roll down the "altpath" in the state structure, storing the on-disk
1681 * block number for those buffers in the "altpath".
1683 path = &state->altpath;
1684 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1685 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1687 blk->disk_blkno = xfs_da_blkno(blk->bp);
1688 xfs_da_buf_done(blk->bp);
1691 blk->disk_blkno = 0;
1699 * Reattach the buffers to the state structure based on the disk block
1700 * numbers stored in the state structure.
1701 * This is done after some set of transaction commits have released those
1702 * buffers from our grip.
1705 xfs_attr_refillstate(xfs_da_state_t *state)
1707 xfs_da_state_path_t *path;
1708 xfs_da_state_blk_t *blk;
1712 * Roll down the "path" in the state structure, storing the on-disk
1713 * block number for those buffers in the "path".
1715 path = &state->path;
1716 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1717 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1718 if (blk->disk_blkno) {
1719 error = xfs_da_read_buf(state->args->trans,
1721 blk->blkno, blk->disk_blkno,
1722 &blk->bp, XFS_ATTR_FORK);
1731 * Roll down the "altpath" in the state structure, storing the on-disk
1732 * block number for those buffers in the "altpath".
1734 path = &state->altpath;
1735 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1736 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1737 if (blk->disk_blkno) {
1738 error = xfs_da_read_buf(state->args->trans,
1740 blk->blkno, blk->disk_blkno,
1741 &blk->bp, XFS_ATTR_FORK);
1753 * Look up a filename in a node attribute list.
1755 * This routine gets called for any attribute fork that has more than one
1756 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1757 * "remote" values taking up more blocks.
1760 xfs_attr_node_get(xfs_da_args_t *args)
1762 xfs_da_state_t *state;
1763 xfs_da_state_blk_t *blk;
1767 state = xfs_da_state_alloc();
1769 state->mp = args->dp->i_mount;
1770 state->blocksize = state->mp->m_sb.sb_blocksize;
1771 state->node_ents = state->mp->m_attr_node_ents;
1774 * Search to see if name exists, and get back a pointer to it.
1776 error = xfs_da_node_lookup_int(state, &retval);
1779 } else if (retval == EEXIST) {
1780 blk = &state->path.blk[ state->path.active-1 ];
1781 ASSERT(blk->bp != NULL);
1782 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1785 * Get the value, local or "remote"
1787 retval = xfs_attr_leaf_getvalue(blk->bp, args);
1788 if (!retval && (args->rmtblkno > 0)
1789 && !(args->flags & ATTR_KERNOVAL)) {
1790 retval = xfs_attr_rmtval_get(args);
1795 * If not in a transaction, we have to release all the buffers.
1797 for (i = 0; i < state->path.active; i++) {
1798 xfs_da_brelse(args->trans, state->path.blk[i].bp);
1799 state->path.blk[i].bp = NULL;
1802 xfs_da_state_free(state);
1806 STATIC int /* error */
1807 xfs_attr_node_list(xfs_attr_list_context_t *context)
1809 attrlist_cursor_kern_t *cursor;
1810 xfs_attr_leafblock_t *leaf;
1811 xfs_da_intnode_t *node;
1812 xfs_da_node_entry_t *btree;
1816 cursor = context->cursor;
1817 cursor->initted = 1;
1820 * Do all sorts of validation on the passed-in cursor structure.
1821 * If anything is amiss, ignore the cursor and look up the hashval
1822 * starting from the btree root.
1825 if (cursor->blkno > 0) {
1826 error = xfs_da_read_buf(NULL, context->dp, cursor->blkno, -1,
1827 &bp, XFS_ATTR_FORK);
1828 if ((error != 0) && (error != EFSCORRUPTED))
1832 switch (be16_to_cpu(node->hdr.info.magic)) {
1833 case XFS_DA_NODE_MAGIC:
1834 trace_xfs_attr_list_wrong_blk(context);
1835 xfs_da_brelse(NULL, bp);
1838 case XFS_ATTR_LEAF_MAGIC:
1840 if (cursor->hashval > be32_to_cpu(leaf->entries[
1841 be16_to_cpu(leaf->hdr.count)-1].hashval)) {
1842 trace_xfs_attr_list_wrong_blk(context);
1843 xfs_da_brelse(NULL, bp);
1845 } else if (cursor->hashval <=
1846 be32_to_cpu(leaf->entries[0].hashval)) {
1847 trace_xfs_attr_list_wrong_blk(context);
1848 xfs_da_brelse(NULL, bp);
1853 trace_xfs_attr_list_wrong_blk(context);
1854 xfs_da_brelse(NULL, bp);
1861 * We did not find what we expected given the cursor's contents,
1862 * so we start from the top and work down based on the hash value.
1863 * Note that start of node block is same as start of leaf block.
1868 error = xfs_da_read_buf(NULL, context->dp,
1869 cursor->blkno, -1, &bp,
1873 if (unlikely(bp == NULL)) {
1874 XFS_ERROR_REPORT("xfs_attr_node_list(2)",
1876 context->dp->i_mount);
1877 return(XFS_ERROR(EFSCORRUPTED));
1880 if (be16_to_cpu(node->hdr.info.magic)
1881 == XFS_ATTR_LEAF_MAGIC)
1883 if (unlikely(be16_to_cpu(node->hdr.info.magic)
1884 != XFS_DA_NODE_MAGIC)) {
1885 XFS_CORRUPTION_ERROR("xfs_attr_node_list(3)",
1887 context->dp->i_mount,
1889 xfs_da_brelse(NULL, bp);
1890 return(XFS_ERROR(EFSCORRUPTED));
1892 btree = node->btree;
1893 for (i = 0; i < be16_to_cpu(node->hdr.count);
1896 <= be32_to_cpu(btree->hashval)) {
1897 cursor->blkno = be32_to_cpu(btree->before);
1898 trace_xfs_attr_list_node_descend(context,
1903 if (i == be16_to_cpu(node->hdr.count)) {
1904 xfs_da_brelse(NULL, bp);
1907 xfs_da_brelse(NULL, bp);
1913 * Roll upward through the blocks, processing each leaf block in
1914 * order. As long as there is space in the result buffer, keep
1915 * adding the information.
1919 if (unlikely(be16_to_cpu(leaf->hdr.info.magic)
1920 != XFS_ATTR_LEAF_MAGIC)) {
1921 XFS_CORRUPTION_ERROR("xfs_attr_node_list(4)",
1923 context->dp->i_mount, leaf);
1924 xfs_da_brelse(NULL, bp);
1925 return(XFS_ERROR(EFSCORRUPTED));
1927 error = xfs_attr_leaf_list_int(bp, context);
1929 xfs_da_brelse(NULL, bp);
1932 if (context->seen_enough || leaf->hdr.info.forw == 0)
1934 cursor->blkno = be32_to_cpu(leaf->hdr.info.forw);
1935 xfs_da_brelse(NULL, bp);
1936 error = xfs_da_read_buf(NULL, context->dp, cursor->blkno, -1,
1937 &bp, XFS_ATTR_FORK);
1940 if (unlikely((bp == NULL))) {
1941 XFS_ERROR_REPORT("xfs_attr_node_list(5)",
1943 context->dp->i_mount);
1944 return(XFS_ERROR(EFSCORRUPTED));
1947 xfs_da_brelse(NULL, bp);
1952 /*========================================================================
1953 * External routines for manipulating out-of-line attribute values.
1954 *========================================================================*/
1957 * Read the value associated with an attribute from the out-of-line buffer
1958 * that we stored it in.
1961 xfs_attr_rmtval_get(xfs_da_args_t *args)
1963 xfs_bmbt_irec_t map[ATTR_RMTVALUE_MAPSIZE];
1968 int nmap, error, tmp, valuelen, blkcnt, i;
1971 ASSERT(!(args->flags & ATTR_KERNOVAL));
1973 mp = args->dp->i_mount;
1975 valuelen = args->valuelen;
1976 lblkno = args->rmtblkno;
1977 while (valuelen > 0) {
1978 nmap = ATTR_RMTVALUE_MAPSIZE;
1979 error = xfs_bmapi(args->trans, args->dp, (xfs_fileoff_t)lblkno,
1981 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
1982 NULL, 0, map, &nmap, NULL);
1987 for (i = 0; (i < nmap) && (valuelen > 0); i++) {
1988 ASSERT((map[i].br_startblock != DELAYSTARTBLOCK) &&
1989 (map[i].br_startblock != HOLESTARTBLOCK));
1990 dblkno = XFS_FSB_TO_DADDR(mp, map[i].br_startblock);
1991 blkcnt = XFS_FSB_TO_BB(mp, map[i].br_blockcount);
1992 error = xfs_read_buf(mp, mp->m_ddev_targp, dblkno,
1993 blkcnt, XBF_LOCK | XBF_DONT_BLOCK,
1998 tmp = (valuelen < XFS_BUF_SIZE(bp))
1999 ? valuelen : XFS_BUF_SIZE(bp);
2000 xfs_buf_iomove(bp, 0, tmp, dst, XBRW_READ);
2005 lblkno += map[i].br_blockcount;
2008 ASSERT(valuelen == 0);
2013 * Write the value associated with an attribute into the out-of-line buffer
2014 * that we have defined for it.
2017 xfs_attr_rmtval_set(xfs_da_args_t *args)
2020 xfs_fileoff_t lfileoff;
2022 xfs_bmbt_irec_t map;
2027 int blkcnt, valuelen, nmap, error, tmp, committed;
2034 * Find a "hole" in the attribute address space large enough for
2035 * us to drop the new attribute's value into.
2037 blkcnt = XFS_B_TO_FSB(mp, args->valuelen);
2039 error = xfs_bmap_first_unused(args->trans, args->dp, blkcnt, &lfileoff,
2044 args->rmtblkno = lblkno = (xfs_dablk_t)lfileoff;
2045 args->rmtblkcnt = blkcnt;
2048 * Roll through the "value", allocating blocks on disk as required.
2050 while (blkcnt > 0) {
2052 * Allocate a single extent, up to the size of the value.
2054 xfs_bmap_init(args->flist, args->firstblock);
2056 error = xfs_bmapi(args->trans, dp, (xfs_fileoff_t)lblkno,
2058 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA |
2060 args->firstblock, args->total, &map, &nmap,
2063 error = xfs_bmap_finish(&args->trans, args->flist,
2069 xfs_bmap_cancel(args->flist);
2074 * bmap_finish() may have committed the last trans and started
2075 * a new one. We need the inode to be in all transactions.
2078 xfs_trans_ijoin(args->trans, dp);
2081 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2082 (map.br_startblock != HOLESTARTBLOCK));
2083 lblkno += map.br_blockcount;
2084 blkcnt -= map.br_blockcount;
2087 * Start the next trans in the chain.
2089 error = xfs_trans_roll(&args->trans, dp);
2095 * Roll through the "value", copying the attribute value to the
2096 * already-allocated blocks. Blocks are written synchronously
2097 * so that we can know they are all on disk before we turn off
2098 * the INCOMPLETE flag.
2100 lblkno = args->rmtblkno;
2101 valuelen = args->valuelen;
2102 while (valuelen > 0) {
2104 * Try to remember where we decided to put the value.
2106 xfs_bmap_init(args->flist, args->firstblock);
2108 error = xfs_bmapi(NULL, dp, (xfs_fileoff_t)lblkno,
2110 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2111 args->firstblock, 0, &map, &nmap,
2117 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2118 (map.br_startblock != HOLESTARTBLOCK));
2120 dblkno = XFS_FSB_TO_DADDR(mp, map.br_startblock),
2121 blkcnt = XFS_FSB_TO_BB(mp, map.br_blockcount);
2123 bp = xfs_buf_get(mp->m_ddev_targp, dblkno, blkcnt,
2124 XBF_LOCK | XBF_DONT_BLOCK);
2126 ASSERT(!XFS_BUF_GETERROR(bp));
2128 tmp = (valuelen < XFS_BUF_SIZE(bp)) ? valuelen :
2130 xfs_buf_iomove(bp, 0, tmp, src, XBRW_WRITE);
2131 if (tmp < XFS_BUF_SIZE(bp))
2132 xfs_buf_zero(bp, tmp, XFS_BUF_SIZE(bp) - tmp);
2133 if ((error = xfs_bwrite(mp, bp))) {/* GROT: NOTE: synchronous write */
2139 lblkno += map.br_blockcount;
2141 ASSERT(valuelen == 0);
2146 * Remove the value associated with an attribute by deleting the
2147 * out-of-line buffer that it is stored on.
2150 xfs_attr_rmtval_remove(xfs_da_args_t *args)
2153 xfs_bmbt_irec_t map;
2157 int valuelen, blkcnt, nmap, error, done, committed;
2159 mp = args->dp->i_mount;
2162 * Roll through the "value", invalidating the attribute value's
2165 lblkno = args->rmtblkno;
2166 valuelen = args->rmtblkcnt;
2167 while (valuelen > 0) {
2169 * Try to remember where we decided to put the value.
2171 xfs_bmap_init(args->flist, args->firstblock);
2173 error = xfs_bmapi(NULL, args->dp, (xfs_fileoff_t)lblkno,
2175 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2176 args->firstblock, 0, &map, &nmap,
2182 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2183 (map.br_startblock != HOLESTARTBLOCK));
2185 dblkno = XFS_FSB_TO_DADDR(mp, map.br_startblock),
2186 blkcnt = XFS_FSB_TO_BB(mp, map.br_blockcount);
2189 * If the "remote" value is in the cache, remove it.
2191 bp = xfs_incore(mp->m_ddev_targp, dblkno, blkcnt, XBF_TRYLOCK);
2194 XFS_BUF_UNDELAYWRITE(bp);
2199 valuelen -= map.br_blockcount;
2201 lblkno += map.br_blockcount;
2205 * Keep de-allocating extents until the remote-value region is gone.
2207 lblkno = args->rmtblkno;
2208 blkcnt = args->rmtblkcnt;
2211 xfs_bmap_init(args->flist, args->firstblock);
2212 error = xfs_bunmapi(args->trans, args->dp, lblkno, blkcnt,
2213 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2214 1, args->firstblock, args->flist,
2217 error = xfs_bmap_finish(&args->trans, args->flist,
2223 xfs_bmap_cancel(args->flist);
2228 * bmap_finish() may have committed the last trans and started
2229 * a new one. We need the inode to be in all transactions.
2232 xfs_trans_ijoin(args->trans, args->dp);
2235 * Close out trans and start the next one in the chain.
2237 error = xfs_trans_roll(&args->trans, args->dp);