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);
826 error = xfs_itruncate_finish(&trans, dp, 0LL, XFS_ATTR_FORK, 0);
831 * Commit the last in the sequence of transactions.
833 xfs_trans_log_inode(trans, dp, XFS_ILOG_CORE);
834 error = xfs_trans_commit(trans, XFS_TRANS_RELEASE_LOG_RES);
835 xfs_iunlock(dp, XFS_ILOCK_EXCL);
840 xfs_trans_cancel(trans, XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
841 xfs_iunlock(dp, XFS_ILOCK_EXCL);
847 /*========================================================================
848 * External routines when attribute list is inside the inode
849 *========================================================================*/
852 * Add a name to the shortform attribute list structure
853 * This is the external routine.
856 xfs_attr_shortform_addname(xfs_da_args_t *args)
858 int newsize, forkoff, retval;
860 retval = xfs_attr_shortform_lookup(args);
861 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
863 } else if (retval == EEXIST) {
864 if (args->flags & ATTR_CREATE)
866 retval = xfs_attr_shortform_remove(args);
870 if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX ||
871 args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX)
872 return(XFS_ERROR(ENOSPC));
874 newsize = XFS_ATTR_SF_TOTSIZE(args->dp);
875 newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
877 forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize);
879 return(XFS_ERROR(ENOSPC));
881 xfs_attr_shortform_add(args, forkoff);
886 /*========================================================================
887 * External routines when attribute list is one block
888 *========================================================================*/
891 * Add a name to the leaf attribute list structure
893 * This leaf block cannot have a "remote" value, we only call this routine
894 * if bmap_one_block() says there is only one block (ie: no remote blks).
897 xfs_attr_leaf_addname(xfs_da_args_t *args)
901 int retval, error, committed, forkoff;
904 * Read the (only) block in the attribute list in.
908 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
915 * Look up the given attribute in the leaf block. Figure out if
916 * the given flags produce an error or call for an atomic rename.
918 retval = xfs_attr_leaf_lookup_int(bp, args);
919 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
920 xfs_da_brelse(args->trans, bp);
922 } else if (retval == EEXIST) {
923 if (args->flags & ATTR_CREATE) { /* pure create op */
924 xfs_da_brelse(args->trans, bp);
927 args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */
928 args->blkno2 = args->blkno; /* set 2nd entry info*/
929 args->index2 = args->index;
930 args->rmtblkno2 = args->rmtblkno;
931 args->rmtblkcnt2 = args->rmtblkcnt;
935 * Add the attribute to the leaf block, transitioning to a Btree
938 retval = xfs_attr_leaf_add(bp, args);
940 if (retval == ENOSPC) {
942 * Promote the attribute list to the Btree format, then
943 * Commit that transaction so that the node_addname() call
944 * can manage its own transactions.
946 xfs_bmap_init(args->flist, args->firstblock);
947 error = xfs_attr_leaf_to_node(args);
949 error = xfs_bmap_finish(&args->trans, args->flist,
955 xfs_bmap_cancel(args->flist);
960 * bmap_finish() may have committed the last trans and started
961 * a new one. We need the inode to be in all transactions.
964 xfs_trans_ijoin(args->trans, dp);
967 * Commit the current trans (including the inode) and start
970 error = xfs_trans_roll(&args->trans, dp);
975 * Fob the whole rest of the problem off on the Btree code.
977 error = xfs_attr_node_addname(args);
982 * Commit the transaction that added the attr name so that
983 * later routines can manage their own transactions.
985 error = xfs_trans_roll(&args->trans, dp);
990 * If there was an out-of-line value, allocate the blocks we
991 * identified for its storage and copy the value. This is done
992 * after we create the attribute so that we don't overflow the
993 * maximum size of a transaction and/or hit a deadlock.
995 if (args->rmtblkno > 0) {
996 error = xfs_attr_rmtval_set(args);
1002 * If this is an atomic rename operation, we must "flip" the
1003 * incomplete flags on the "new" and "old" attribute/value pairs
1004 * so that one disappears and one appears atomically. Then we
1005 * must remove the "old" attribute/value pair.
1007 if (args->op_flags & XFS_DA_OP_RENAME) {
1009 * In a separate transaction, set the incomplete flag on the
1010 * "old" attr and clear the incomplete flag on the "new" attr.
1012 error = xfs_attr_leaf_flipflags(args);
1017 * Dismantle the "old" attribute/value pair by removing
1018 * a "remote" value (if it exists).
1020 args->index = args->index2;
1021 args->blkno = args->blkno2;
1022 args->rmtblkno = args->rmtblkno2;
1023 args->rmtblkcnt = args->rmtblkcnt2;
1024 if (args->rmtblkno) {
1025 error = xfs_attr_rmtval_remove(args);
1031 * Read in the block containing the "old" attr, then
1032 * remove the "old" attr from that block (neat, huh!)
1034 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1,
1035 &bp, XFS_ATTR_FORK);
1039 (void)xfs_attr_leaf_remove(bp, args);
1042 * If the result is small enough, shrink it all into the inode.
1044 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1045 xfs_bmap_init(args->flist, args->firstblock);
1046 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1047 /* bp is gone due to xfs_da_shrink_inode */
1049 error = xfs_bmap_finish(&args->trans,
1056 xfs_bmap_cancel(args->flist);
1061 * bmap_finish() may have committed the last trans
1062 * and started a new one. We need the inode to be
1063 * in all transactions.
1066 xfs_trans_ijoin(args->trans, dp);
1068 xfs_da_buf_done(bp);
1071 * Commit the remove and start the next trans in series.
1073 error = xfs_trans_roll(&args->trans, dp);
1075 } else if (args->rmtblkno > 0) {
1077 * Added a "remote" value, just clear the incomplete flag.
1079 error = xfs_attr_leaf_clearflag(args);
1085 * Remove a name from the leaf attribute list structure
1087 * This leaf block cannot have a "remote" value, we only call this routine
1088 * if bmap_one_block() says there is only one block (ie: no remote blks).
1091 xfs_attr_leaf_removename(xfs_da_args_t *args)
1095 int error, committed, forkoff;
1098 * Remove the attribute.
1102 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
1109 error = xfs_attr_leaf_lookup_int(bp, args);
1110 if (error == ENOATTR) {
1111 xfs_da_brelse(args->trans, bp);
1115 (void)xfs_attr_leaf_remove(bp, args);
1118 * If the result is small enough, shrink it all into the inode.
1120 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1121 xfs_bmap_init(args->flist, args->firstblock);
1122 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1123 /* bp is gone due to xfs_da_shrink_inode */
1125 error = xfs_bmap_finish(&args->trans, args->flist,
1131 xfs_bmap_cancel(args->flist);
1136 * bmap_finish() may have committed the last trans and started
1137 * a new one. We need the inode to be in all transactions.
1140 xfs_trans_ijoin(args->trans, dp);
1142 xfs_da_buf_done(bp);
1147 * Look up a name in a leaf attribute list structure.
1149 * This leaf block cannot have a "remote" value, we only call this routine
1150 * if bmap_one_block() says there is only one block (ie: no remote blks).
1153 xfs_attr_leaf_get(xfs_da_args_t *args)
1159 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
1165 error = xfs_attr_leaf_lookup_int(bp, args);
1166 if (error != EEXIST) {
1167 xfs_da_brelse(args->trans, bp);
1170 error = xfs_attr_leaf_getvalue(bp, args);
1171 xfs_da_brelse(args->trans, bp);
1172 if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) {
1173 error = xfs_attr_rmtval_get(args);
1179 * Copy out attribute entries for attr_list(), for leaf attribute lists.
1182 xfs_attr_leaf_list(xfs_attr_list_context_t *context)
1184 xfs_attr_leafblock_t *leaf;
1188 context->cursor->blkno = 0;
1189 error = xfs_da_read_buf(NULL, context->dp, 0, -1, &bp, XFS_ATTR_FORK);
1191 return XFS_ERROR(error);
1194 if (unlikely(be16_to_cpu(leaf->hdr.info.magic) != XFS_ATTR_LEAF_MAGIC)) {
1195 XFS_CORRUPTION_ERROR("xfs_attr_leaf_list", XFS_ERRLEVEL_LOW,
1196 context->dp->i_mount, leaf);
1197 xfs_da_brelse(NULL, bp);
1198 return XFS_ERROR(EFSCORRUPTED);
1201 error = xfs_attr_leaf_list_int(bp, context);
1202 xfs_da_brelse(NULL, bp);
1203 return XFS_ERROR(error);
1207 /*========================================================================
1208 * External routines when attribute list size > XFS_LBSIZE(mp).
1209 *========================================================================*/
1212 * Add a name to a Btree-format attribute list.
1214 * This will involve walking down the Btree, and may involve splitting
1215 * leaf nodes and even splitting intermediate nodes up to and including
1216 * the root node (a special case of an intermediate node).
1218 * "Remote" attribute values confuse the issue and atomic rename operations
1219 * add a whole extra layer of confusion on top of that.
1222 xfs_attr_node_addname(xfs_da_args_t *args)
1224 xfs_da_state_t *state;
1225 xfs_da_state_blk_t *blk;
1228 int committed, retval, error;
1231 * Fill in bucket of arguments/results/context to carry around.
1236 state = xfs_da_state_alloc();
1239 state->blocksize = state->mp->m_sb.sb_blocksize;
1240 state->node_ents = state->mp->m_attr_node_ents;
1243 * Search to see if name already exists, and get back a pointer
1244 * to where it should go.
1246 error = xfs_da_node_lookup_int(state, &retval);
1249 blk = &state->path.blk[ state->path.active-1 ];
1250 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1251 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
1253 } else if (retval == EEXIST) {
1254 if (args->flags & ATTR_CREATE)
1256 args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */
1257 args->blkno2 = args->blkno; /* set 2nd entry info*/
1258 args->index2 = args->index;
1259 args->rmtblkno2 = args->rmtblkno;
1260 args->rmtblkcnt2 = args->rmtblkcnt;
1262 args->rmtblkcnt = 0;
1265 retval = xfs_attr_leaf_add(blk->bp, state->args);
1266 if (retval == ENOSPC) {
1267 if (state->path.active == 1) {
1269 * Its really a single leaf node, but it had
1270 * out-of-line values so it looked like it *might*
1271 * have been a b-tree.
1273 xfs_da_state_free(state);
1274 xfs_bmap_init(args->flist, args->firstblock);
1275 error = xfs_attr_leaf_to_node(args);
1277 error = xfs_bmap_finish(&args->trans,
1284 xfs_bmap_cancel(args->flist);
1289 * bmap_finish() may have committed the last trans
1290 * and started a new one. We need the inode to be
1291 * in all transactions.
1294 xfs_trans_ijoin(args->trans, dp);
1297 * Commit the node conversion and start the next
1298 * trans in the chain.
1300 error = xfs_trans_roll(&args->trans, dp);
1308 * Split as many Btree elements as required.
1309 * This code tracks the new and old attr's location
1310 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1311 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1313 xfs_bmap_init(args->flist, args->firstblock);
1314 error = xfs_da_split(state);
1316 error = xfs_bmap_finish(&args->trans, args->flist,
1322 xfs_bmap_cancel(args->flist);
1327 * bmap_finish() may have committed the last trans and started
1328 * a new one. We need the inode to be in all transactions.
1331 xfs_trans_ijoin(args->trans, dp);
1334 * Addition succeeded, update Btree hashvals.
1336 xfs_da_fixhashpath(state, &state->path);
1340 * Kill the state structure, we're done with it and need to
1341 * allow the buffers to come back later.
1343 xfs_da_state_free(state);
1347 * Commit the leaf addition or btree split and start the next
1348 * trans in the chain.
1350 error = xfs_trans_roll(&args->trans, dp);
1355 * If there was an out-of-line value, allocate the blocks we
1356 * identified for its storage and copy the value. This is done
1357 * after we create the attribute so that we don't overflow the
1358 * maximum size of a transaction and/or hit a deadlock.
1360 if (args->rmtblkno > 0) {
1361 error = xfs_attr_rmtval_set(args);
1367 * If this is an atomic rename operation, we must "flip" the
1368 * incomplete flags on the "new" and "old" attribute/value pairs
1369 * so that one disappears and one appears atomically. Then we
1370 * must remove the "old" attribute/value pair.
1372 if (args->op_flags & XFS_DA_OP_RENAME) {
1374 * In a separate transaction, set the incomplete flag on the
1375 * "old" attr and clear the incomplete flag on the "new" attr.
1377 error = xfs_attr_leaf_flipflags(args);
1382 * Dismantle the "old" attribute/value pair by removing
1383 * a "remote" value (if it exists).
1385 args->index = args->index2;
1386 args->blkno = args->blkno2;
1387 args->rmtblkno = args->rmtblkno2;
1388 args->rmtblkcnt = args->rmtblkcnt2;
1389 if (args->rmtblkno) {
1390 error = xfs_attr_rmtval_remove(args);
1396 * Re-find the "old" attribute entry after any split ops.
1397 * The INCOMPLETE flag means that we will find the "old"
1398 * attr, not the "new" one.
1400 args->flags |= XFS_ATTR_INCOMPLETE;
1401 state = xfs_da_state_alloc();
1404 state->blocksize = state->mp->m_sb.sb_blocksize;
1405 state->node_ents = state->mp->m_attr_node_ents;
1407 error = xfs_da_node_lookup_int(state, &retval);
1412 * Remove the name and update the hashvals in the tree.
1414 blk = &state->path.blk[ state->path.active-1 ];
1415 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1416 error = xfs_attr_leaf_remove(blk->bp, args);
1417 xfs_da_fixhashpath(state, &state->path);
1420 * Check to see if the tree needs to be collapsed.
1422 if (retval && (state->path.active > 1)) {
1423 xfs_bmap_init(args->flist, args->firstblock);
1424 error = xfs_da_join(state);
1426 error = xfs_bmap_finish(&args->trans,
1433 xfs_bmap_cancel(args->flist);
1438 * bmap_finish() may have committed the last trans
1439 * and started a new one. We need the inode to be
1440 * in all transactions.
1443 xfs_trans_ijoin(args->trans, dp);
1447 * Commit and start the next trans in the chain.
1449 error = xfs_trans_roll(&args->trans, dp);
1453 } else if (args->rmtblkno > 0) {
1455 * Added a "remote" value, just clear the incomplete flag.
1457 error = xfs_attr_leaf_clearflag(args);
1465 xfs_da_state_free(state);
1472 * Remove a name from a B-tree attribute list.
1474 * This will involve walking down the Btree, and may involve joining
1475 * leaf nodes and even joining intermediate nodes up to and including
1476 * the root node (a special case of an intermediate node).
1479 xfs_attr_node_removename(xfs_da_args_t *args)
1481 xfs_da_state_t *state;
1482 xfs_da_state_blk_t *blk;
1485 int retval, error, committed, forkoff;
1488 * Tie a string around our finger to remind us where we are.
1491 state = xfs_da_state_alloc();
1493 state->mp = dp->i_mount;
1494 state->blocksize = state->mp->m_sb.sb_blocksize;
1495 state->node_ents = state->mp->m_attr_node_ents;
1498 * Search to see if name exists, and get back a pointer to it.
1500 error = xfs_da_node_lookup_int(state, &retval);
1501 if (error || (retval != EEXIST)) {
1508 * If there is an out-of-line value, de-allocate the blocks.
1509 * This is done before we remove the attribute so that we don't
1510 * overflow the maximum size of a transaction and/or hit a deadlock.
1512 blk = &state->path.blk[ state->path.active-1 ];
1513 ASSERT(blk->bp != NULL);
1514 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1515 if (args->rmtblkno > 0) {
1517 * Fill in disk block numbers in the state structure
1518 * so that we can get the buffers back after we commit
1519 * several transactions in the following calls.
1521 error = xfs_attr_fillstate(state);
1526 * Mark the attribute as INCOMPLETE, then bunmapi() the
1529 error = xfs_attr_leaf_setflag(args);
1532 error = xfs_attr_rmtval_remove(args);
1537 * Refill the state structure with buffers, the prior calls
1538 * released our buffers.
1540 error = xfs_attr_refillstate(state);
1546 * Remove the name and update the hashvals in the tree.
1548 blk = &state->path.blk[ state->path.active-1 ];
1549 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1550 retval = xfs_attr_leaf_remove(blk->bp, args);
1551 xfs_da_fixhashpath(state, &state->path);
1554 * Check to see if the tree needs to be collapsed.
1556 if (retval && (state->path.active > 1)) {
1557 xfs_bmap_init(args->flist, args->firstblock);
1558 error = xfs_da_join(state);
1560 error = xfs_bmap_finish(&args->trans, args->flist,
1566 xfs_bmap_cancel(args->flist);
1571 * bmap_finish() may have committed the last trans and started
1572 * a new one. We need the inode to be in all transactions.
1575 xfs_trans_ijoin(args->trans, dp);
1578 * Commit the Btree join operation and start a new trans.
1580 error = xfs_trans_roll(&args->trans, dp);
1586 * If the result is small enough, push it all into the inode.
1588 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1590 * Have to get rid of the copy of this dabuf in the state.
1592 ASSERT(state->path.active == 1);
1593 ASSERT(state->path.blk[0].bp);
1594 xfs_da_buf_done(state->path.blk[0].bp);
1595 state->path.blk[0].bp = NULL;
1597 error = xfs_da_read_buf(args->trans, args->dp, 0, -1, &bp,
1601 ASSERT(be16_to_cpu(((xfs_attr_leafblock_t *)
1602 bp->data)->hdr.info.magic)
1603 == XFS_ATTR_LEAF_MAGIC);
1605 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1606 xfs_bmap_init(args->flist, args->firstblock);
1607 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1608 /* bp is gone due to xfs_da_shrink_inode */
1610 error = xfs_bmap_finish(&args->trans,
1617 xfs_bmap_cancel(args->flist);
1622 * bmap_finish() may have committed the last trans
1623 * and started a new one. We need the inode to be
1624 * in all transactions.
1627 xfs_trans_ijoin(args->trans, dp);
1629 xfs_da_brelse(args->trans, bp);
1634 xfs_da_state_free(state);
1639 * Fill in the disk block numbers in the state structure for the buffers
1640 * that are attached to the state structure.
1641 * This is done so that we can quickly reattach ourselves to those buffers
1642 * after some set of transaction commits have released these buffers.
1645 xfs_attr_fillstate(xfs_da_state_t *state)
1647 xfs_da_state_path_t *path;
1648 xfs_da_state_blk_t *blk;
1652 * Roll down the "path" in the state structure, storing the on-disk
1653 * block number for those buffers in the "path".
1655 path = &state->path;
1656 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1657 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1659 blk->disk_blkno = xfs_da_blkno(blk->bp);
1660 xfs_da_buf_done(blk->bp);
1663 blk->disk_blkno = 0;
1668 * Roll down the "altpath" in the state structure, storing the on-disk
1669 * block number for those buffers in the "altpath".
1671 path = &state->altpath;
1672 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1673 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1675 blk->disk_blkno = xfs_da_blkno(blk->bp);
1676 xfs_da_buf_done(blk->bp);
1679 blk->disk_blkno = 0;
1687 * Reattach the buffers to the state structure based on the disk block
1688 * numbers stored in the state structure.
1689 * This is done after some set of transaction commits have released those
1690 * buffers from our grip.
1693 xfs_attr_refillstate(xfs_da_state_t *state)
1695 xfs_da_state_path_t *path;
1696 xfs_da_state_blk_t *blk;
1700 * Roll down the "path" in the state structure, storing the on-disk
1701 * block number for those buffers in the "path".
1703 path = &state->path;
1704 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1705 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1706 if (blk->disk_blkno) {
1707 error = xfs_da_read_buf(state->args->trans,
1709 blk->blkno, blk->disk_blkno,
1710 &blk->bp, XFS_ATTR_FORK);
1719 * Roll down the "altpath" in the state structure, storing the on-disk
1720 * block number for those buffers in the "altpath".
1722 path = &state->altpath;
1723 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1724 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1725 if (blk->disk_blkno) {
1726 error = xfs_da_read_buf(state->args->trans,
1728 blk->blkno, blk->disk_blkno,
1729 &blk->bp, XFS_ATTR_FORK);
1741 * Look up a filename in a node attribute list.
1743 * This routine gets called for any attribute fork that has more than one
1744 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1745 * "remote" values taking up more blocks.
1748 xfs_attr_node_get(xfs_da_args_t *args)
1750 xfs_da_state_t *state;
1751 xfs_da_state_blk_t *blk;
1755 state = xfs_da_state_alloc();
1757 state->mp = args->dp->i_mount;
1758 state->blocksize = state->mp->m_sb.sb_blocksize;
1759 state->node_ents = state->mp->m_attr_node_ents;
1762 * Search to see if name exists, and get back a pointer to it.
1764 error = xfs_da_node_lookup_int(state, &retval);
1767 } else if (retval == EEXIST) {
1768 blk = &state->path.blk[ state->path.active-1 ];
1769 ASSERT(blk->bp != NULL);
1770 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1773 * Get the value, local or "remote"
1775 retval = xfs_attr_leaf_getvalue(blk->bp, args);
1776 if (!retval && (args->rmtblkno > 0)
1777 && !(args->flags & ATTR_KERNOVAL)) {
1778 retval = xfs_attr_rmtval_get(args);
1783 * If not in a transaction, we have to release all the buffers.
1785 for (i = 0; i < state->path.active; i++) {
1786 xfs_da_brelse(args->trans, state->path.blk[i].bp);
1787 state->path.blk[i].bp = NULL;
1790 xfs_da_state_free(state);
1794 STATIC int /* error */
1795 xfs_attr_node_list(xfs_attr_list_context_t *context)
1797 attrlist_cursor_kern_t *cursor;
1798 xfs_attr_leafblock_t *leaf;
1799 xfs_da_intnode_t *node;
1800 xfs_da_node_entry_t *btree;
1804 cursor = context->cursor;
1805 cursor->initted = 1;
1808 * Do all sorts of validation on the passed-in cursor structure.
1809 * If anything is amiss, ignore the cursor and look up the hashval
1810 * starting from the btree root.
1813 if (cursor->blkno > 0) {
1814 error = xfs_da_read_buf(NULL, context->dp, cursor->blkno, -1,
1815 &bp, XFS_ATTR_FORK);
1816 if ((error != 0) && (error != EFSCORRUPTED))
1820 switch (be16_to_cpu(node->hdr.info.magic)) {
1821 case XFS_DA_NODE_MAGIC:
1822 trace_xfs_attr_list_wrong_blk(context);
1823 xfs_da_brelse(NULL, bp);
1826 case XFS_ATTR_LEAF_MAGIC:
1828 if (cursor->hashval > be32_to_cpu(leaf->entries[
1829 be16_to_cpu(leaf->hdr.count)-1].hashval)) {
1830 trace_xfs_attr_list_wrong_blk(context);
1831 xfs_da_brelse(NULL, bp);
1833 } else if (cursor->hashval <=
1834 be32_to_cpu(leaf->entries[0].hashval)) {
1835 trace_xfs_attr_list_wrong_blk(context);
1836 xfs_da_brelse(NULL, bp);
1841 trace_xfs_attr_list_wrong_blk(context);
1842 xfs_da_brelse(NULL, bp);
1849 * We did not find what we expected given the cursor's contents,
1850 * so we start from the top and work down based on the hash value.
1851 * Note that start of node block is same as start of leaf block.
1856 error = xfs_da_read_buf(NULL, context->dp,
1857 cursor->blkno, -1, &bp,
1861 if (unlikely(bp == NULL)) {
1862 XFS_ERROR_REPORT("xfs_attr_node_list(2)",
1864 context->dp->i_mount);
1865 return(XFS_ERROR(EFSCORRUPTED));
1868 if (be16_to_cpu(node->hdr.info.magic)
1869 == XFS_ATTR_LEAF_MAGIC)
1871 if (unlikely(be16_to_cpu(node->hdr.info.magic)
1872 != XFS_DA_NODE_MAGIC)) {
1873 XFS_CORRUPTION_ERROR("xfs_attr_node_list(3)",
1875 context->dp->i_mount,
1877 xfs_da_brelse(NULL, bp);
1878 return(XFS_ERROR(EFSCORRUPTED));
1880 btree = node->btree;
1881 for (i = 0; i < be16_to_cpu(node->hdr.count);
1884 <= be32_to_cpu(btree->hashval)) {
1885 cursor->blkno = be32_to_cpu(btree->before);
1886 trace_xfs_attr_list_node_descend(context,
1891 if (i == be16_to_cpu(node->hdr.count)) {
1892 xfs_da_brelse(NULL, bp);
1895 xfs_da_brelse(NULL, bp);
1901 * Roll upward through the blocks, processing each leaf block in
1902 * order. As long as there is space in the result buffer, keep
1903 * adding the information.
1907 if (unlikely(be16_to_cpu(leaf->hdr.info.magic)
1908 != XFS_ATTR_LEAF_MAGIC)) {
1909 XFS_CORRUPTION_ERROR("xfs_attr_node_list(4)",
1911 context->dp->i_mount, leaf);
1912 xfs_da_brelse(NULL, bp);
1913 return(XFS_ERROR(EFSCORRUPTED));
1915 error = xfs_attr_leaf_list_int(bp, context);
1917 xfs_da_brelse(NULL, bp);
1920 if (context->seen_enough || leaf->hdr.info.forw == 0)
1922 cursor->blkno = be32_to_cpu(leaf->hdr.info.forw);
1923 xfs_da_brelse(NULL, bp);
1924 error = xfs_da_read_buf(NULL, context->dp, cursor->blkno, -1,
1925 &bp, XFS_ATTR_FORK);
1928 if (unlikely((bp == NULL))) {
1929 XFS_ERROR_REPORT("xfs_attr_node_list(5)",
1931 context->dp->i_mount);
1932 return(XFS_ERROR(EFSCORRUPTED));
1935 xfs_da_brelse(NULL, bp);
1940 /*========================================================================
1941 * External routines for manipulating out-of-line attribute values.
1942 *========================================================================*/
1945 * Read the value associated with an attribute from the out-of-line buffer
1946 * that we stored it in.
1949 xfs_attr_rmtval_get(xfs_da_args_t *args)
1951 xfs_bmbt_irec_t map[ATTR_RMTVALUE_MAPSIZE];
1956 int nmap, error, tmp, valuelen, blkcnt, i;
1959 ASSERT(!(args->flags & ATTR_KERNOVAL));
1961 mp = args->dp->i_mount;
1963 valuelen = args->valuelen;
1964 lblkno = args->rmtblkno;
1965 while (valuelen > 0) {
1966 nmap = ATTR_RMTVALUE_MAPSIZE;
1967 error = xfs_bmapi(args->trans, args->dp, (xfs_fileoff_t)lblkno,
1969 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
1970 NULL, 0, map, &nmap, NULL);
1975 for (i = 0; (i < nmap) && (valuelen > 0); i++) {
1976 ASSERT((map[i].br_startblock != DELAYSTARTBLOCK) &&
1977 (map[i].br_startblock != HOLESTARTBLOCK));
1978 dblkno = XFS_FSB_TO_DADDR(mp, map[i].br_startblock);
1979 blkcnt = XFS_FSB_TO_BB(mp, map[i].br_blockcount);
1980 error = xfs_read_buf(mp, mp->m_ddev_targp, dblkno,
1981 blkcnt, XBF_LOCK | XBF_DONT_BLOCK,
1986 tmp = (valuelen < XFS_BUF_SIZE(bp))
1987 ? valuelen : XFS_BUF_SIZE(bp);
1988 xfs_buf_iomove(bp, 0, tmp, dst, XBRW_READ);
1993 lblkno += map[i].br_blockcount;
1996 ASSERT(valuelen == 0);
2001 * Write the value associated with an attribute into the out-of-line buffer
2002 * that we have defined for it.
2005 xfs_attr_rmtval_set(xfs_da_args_t *args)
2008 xfs_fileoff_t lfileoff;
2010 xfs_bmbt_irec_t map;
2015 int blkcnt, valuelen, nmap, error, tmp, committed;
2022 * Find a "hole" in the attribute address space large enough for
2023 * us to drop the new attribute's value into.
2025 blkcnt = XFS_B_TO_FSB(mp, args->valuelen);
2027 error = xfs_bmap_first_unused(args->trans, args->dp, blkcnt, &lfileoff,
2032 args->rmtblkno = lblkno = (xfs_dablk_t)lfileoff;
2033 args->rmtblkcnt = blkcnt;
2036 * Roll through the "value", allocating blocks on disk as required.
2038 while (blkcnt > 0) {
2040 * Allocate a single extent, up to the size of the value.
2042 xfs_bmap_init(args->flist, args->firstblock);
2044 error = xfs_bmapi(args->trans, dp, (xfs_fileoff_t)lblkno,
2046 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA |
2048 args->firstblock, args->total, &map, &nmap,
2051 error = xfs_bmap_finish(&args->trans, args->flist,
2057 xfs_bmap_cancel(args->flist);
2062 * bmap_finish() may have committed the last trans and started
2063 * a new one. We need the inode to be in all transactions.
2066 xfs_trans_ijoin(args->trans, dp);
2069 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2070 (map.br_startblock != HOLESTARTBLOCK));
2071 lblkno += map.br_blockcount;
2072 blkcnt -= map.br_blockcount;
2075 * Start the next trans in the chain.
2077 error = xfs_trans_roll(&args->trans, dp);
2083 * Roll through the "value", copying the attribute value to the
2084 * already-allocated blocks. Blocks are written synchronously
2085 * so that we can know they are all on disk before we turn off
2086 * the INCOMPLETE flag.
2088 lblkno = args->rmtblkno;
2089 valuelen = args->valuelen;
2090 while (valuelen > 0) {
2092 * Try to remember where we decided to put the value.
2094 xfs_bmap_init(args->flist, args->firstblock);
2096 error = xfs_bmapi(NULL, dp, (xfs_fileoff_t)lblkno,
2098 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2099 args->firstblock, 0, &map, &nmap,
2105 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2106 (map.br_startblock != HOLESTARTBLOCK));
2108 dblkno = XFS_FSB_TO_DADDR(mp, map.br_startblock),
2109 blkcnt = XFS_FSB_TO_BB(mp, map.br_blockcount);
2111 bp = xfs_buf_get(mp->m_ddev_targp, dblkno, blkcnt,
2112 XBF_LOCK | XBF_DONT_BLOCK);
2114 ASSERT(!XFS_BUF_GETERROR(bp));
2116 tmp = (valuelen < XFS_BUF_SIZE(bp)) ? valuelen :
2118 xfs_buf_iomove(bp, 0, tmp, src, XBRW_WRITE);
2119 if (tmp < XFS_BUF_SIZE(bp))
2120 xfs_buf_zero(bp, tmp, XFS_BUF_SIZE(bp) - tmp);
2121 if ((error = xfs_bwrite(mp, bp))) {/* GROT: NOTE: synchronous write */
2127 lblkno += map.br_blockcount;
2129 ASSERT(valuelen == 0);
2134 * Remove the value associated with an attribute by deleting the
2135 * out-of-line buffer that it is stored on.
2138 xfs_attr_rmtval_remove(xfs_da_args_t *args)
2141 xfs_bmbt_irec_t map;
2145 int valuelen, blkcnt, nmap, error, done, committed;
2147 mp = args->dp->i_mount;
2150 * Roll through the "value", invalidating the attribute value's
2153 lblkno = args->rmtblkno;
2154 valuelen = args->rmtblkcnt;
2155 while (valuelen > 0) {
2157 * Try to remember where we decided to put the value.
2159 xfs_bmap_init(args->flist, args->firstblock);
2161 error = xfs_bmapi(NULL, args->dp, (xfs_fileoff_t)lblkno,
2163 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2164 args->firstblock, 0, &map, &nmap,
2170 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2171 (map.br_startblock != HOLESTARTBLOCK));
2173 dblkno = XFS_FSB_TO_DADDR(mp, map.br_startblock),
2174 blkcnt = XFS_FSB_TO_BB(mp, map.br_blockcount);
2177 * If the "remote" value is in the cache, remove it.
2179 bp = xfs_incore(mp->m_ddev_targp, dblkno, blkcnt, XBF_TRYLOCK);
2182 XFS_BUF_UNDELAYWRITE(bp);
2187 valuelen -= map.br_blockcount;
2189 lblkno += map.br_blockcount;
2193 * Keep de-allocating extents until the remote-value region is gone.
2195 lblkno = args->rmtblkno;
2196 blkcnt = args->rmtblkcnt;
2199 xfs_bmap_init(args->flist, args->firstblock);
2200 error = xfs_bunmapi(args->trans, args->dp, lblkno, blkcnt,
2201 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2202 1, args->firstblock, args->flist,
2205 error = xfs_bmap_finish(&args->trans, args->flist,
2211 xfs_bmap_cancel(args->flist);
2216 * bmap_finish() may have committed the last trans and started
2217 * a new one. We need the inode to be in all transactions.
2220 xfs_trans_ijoin(args->trans, args->dp);
2223 * Close out trans and start the next one in the chain.
2225 error = xfs_trans_roll(&args->trans, args->dp);