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"
24 #include "xfs_trans.h"
27 #include "xfs_mount.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_bmap_btree.h"
30 #include "xfs_attr_sf.h"
31 #include "xfs_dinode.h"
32 #include "xfs_inode.h"
33 #include "xfs_alloc.h"
34 #include "xfs_inode_item.h"
37 #include "xfs_attr_leaf.h"
38 #include "xfs_error.h"
39 #include "xfs_quota.h"
40 #include "xfs_trans_space.h"
41 #include "xfs_vnodeops.h"
42 #include "xfs_trace.h"
47 * Provide the external interfaces to manage attribute lists.
50 /*========================================================================
51 * Function prototypes for the kernel.
52 *========================================================================*/
55 * Internal routines when attribute list fits inside the inode.
57 STATIC
int xfs_attr_shortform_addname(xfs_da_args_t
*args
);
60 * Internal routines when attribute list is one block.
62 STATIC
int xfs_attr_leaf_get(xfs_da_args_t
*args
);
63 STATIC
int xfs_attr_leaf_addname(xfs_da_args_t
*args
);
64 STATIC
int xfs_attr_leaf_removename(xfs_da_args_t
*args
);
65 STATIC
int xfs_attr_leaf_list(xfs_attr_list_context_t
*context
);
68 * Internal routines when attribute list is more than one block.
70 STATIC
int xfs_attr_node_get(xfs_da_args_t
*args
);
71 STATIC
int xfs_attr_node_addname(xfs_da_args_t
*args
);
72 STATIC
int xfs_attr_node_removename(xfs_da_args_t
*args
);
73 STATIC
int xfs_attr_node_list(xfs_attr_list_context_t
*context
);
74 STATIC
int xfs_attr_fillstate(xfs_da_state_t
*state
);
75 STATIC
int xfs_attr_refillstate(xfs_da_state_t
*state
);
78 * Routines to manipulate out-of-line attribute values.
80 STATIC
int xfs_attr_rmtval_set(xfs_da_args_t
*args
);
81 STATIC
int xfs_attr_rmtval_remove(xfs_da_args_t
*args
);
83 #define ATTR_RMTVALUE_MAPSIZE 1 /* # of map entries at once */
86 xfs_attr_name_to_xname(
87 struct xfs_name
*xname
,
88 const unsigned char *aname
)
93 xname
->len
= strlen((char *)aname
);
94 if (xname
->len
>= MAXNAMELEN
)
95 return EFAULT
; /* match IRIX behaviour */
102 struct xfs_inode
*ip
)
104 if (!XFS_IFORK_Q(ip
) ||
105 (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
&&
106 ip
->i_d
.di_anextents
== 0))
111 /*========================================================================
112 * Overall external interface routines.
113 *========================================================================*/
117 struct xfs_inode
*ip
,
118 struct xfs_name
*name
,
119 unsigned char *value
,
126 if (!xfs_inode_hasattr(ip
))
130 * Fill in the arg structure for this request.
132 memset((char *)&args
, 0, sizeof(args
));
133 args
.name
= name
->name
;
134 args
.namelen
= name
->len
;
136 args
.valuelen
= *valuelenp
;
138 args
.hashval
= xfs_da_hashname(args
.name
, args
.namelen
);
140 args
.whichfork
= XFS_ATTR_FORK
;
143 * Decide on what work routines to call based on the inode size.
145 if (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
146 error
= xfs_attr_shortform_getvalue(&args
);
147 } else if (xfs_bmap_one_block(ip
, XFS_ATTR_FORK
)) {
148 error
= xfs_attr_leaf_get(&args
);
150 error
= xfs_attr_node_get(&args
);
154 * Return the number of bytes in the value to the caller.
156 *valuelenp
= args
.valuelen
;
166 const unsigned char *name
,
167 unsigned char *value
,
172 struct xfs_name xname
;
174 XFS_STATS_INC(xs_attr_get
);
176 if (XFS_FORCED_SHUTDOWN(ip
->i_mount
))
179 error
= xfs_attr_name_to_xname(&xname
, name
);
183 xfs_ilock(ip
, XFS_ILOCK_SHARED
);
184 error
= xfs_attr_get_int(ip
, &xname
, value
, valuelenp
, flags
);
185 xfs_iunlock(ip
, XFS_ILOCK_SHARED
);
190 * Calculate how many blocks we need for the new attribute,
194 struct xfs_inode
*ip
,
199 struct xfs_mount
*mp
= ip
->i_mount
;
204 * Determine space new attribute will use, and if it would be
205 * "local" or "remote" (note: local != inline).
207 size
= xfs_attr_leaf_newentsize(namelen
, valuelen
,
208 mp
->m_sb
.sb_blocksize
, local
);
210 nblks
= XFS_DAENTER_SPACE_RES(mp
, XFS_ATTR_FORK
);
212 if (size
> (mp
->m_sb
.sb_blocksize
>> 1)) {
213 /* Double split possible */
218 * Out of line attribute, cannot double split, but
219 * make room for the attribute value itself.
221 uint dblocks
= XFS_B_TO_FSB(mp
, valuelen
);
223 nblks
+= XFS_NEXTENTADD_SPACE_RES(mp
, dblocks
, XFS_ATTR_FORK
);
231 struct xfs_inode
*dp
,
232 struct xfs_name
*name
,
233 unsigned char *value
,
238 xfs_fsblock_t firstblock
;
239 xfs_bmap_free_t flist
;
240 int error
, err2
, committed
;
241 xfs_mount_t
*mp
= dp
->i_mount
;
242 int rsvd
= (flags
& ATTR_ROOT
) != 0;
246 * Attach the dquots to the inode.
248 error
= xfs_qm_dqattach(dp
, 0);
253 * If the inode doesn't have an attribute fork, add one.
254 * (inode must not be locked when we call this routine)
256 if (XFS_IFORK_Q(dp
) == 0) {
257 int sf_size
= sizeof(xfs_attr_sf_hdr_t
) +
258 XFS_ATTR_SF_ENTSIZE_BYNAME(name
->len
, valuelen
);
260 if ((error
= xfs_bmap_add_attrfork(dp
, sf_size
, rsvd
)))
265 * Fill in the arg structure for this request.
267 memset((char *)&args
, 0, sizeof(args
));
268 args
.name
= name
->name
;
269 args
.namelen
= name
->len
;
271 args
.valuelen
= valuelen
;
273 args
.hashval
= xfs_da_hashname(args
.name
, args
.namelen
);
275 args
.firstblock
= &firstblock
;
277 args
.whichfork
= XFS_ATTR_FORK
;
278 args
.op_flags
= XFS_DA_OP_ADDNAME
| XFS_DA_OP_OKNOENT
;
280 /* Size is now blocks for attribute data */
281 args
.total
= xfs_attr_calc_size(dp
, name
->len
, valuelen
, &local
);
284 * Start our first transaction of the day.
286 * All future transactions during this code must be "chained" off
287 * this one via the trans_dup() call. All transactions will contain
288 * the inode, and the inode will always be marked with trans_ihold().
289 * Since the inode will be locked in all transactions, we must log
290 * the inode in every transaction to let it float upward through
293 args
.trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTR_SET
);
296 * Root fork attributes can use reserved data blocks for this
297 * operation if necessary
301 args
.trans
->t_flags
|= XFS_TRANS_RESERVE
;
303 if ((error
= xfs_trans_reserve(args
.trans
, args
.total
,
304 XFS_ATTRSET_LOG_RES(mp
, args
.total
), 0,
305 XFS_TRANS_PERM_LOG_RES
, XFS_ATTRSET_LOG_COUNT
))) {
306 xfs_trans_cancel(args
.trans
, 0);
309 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
311 error
= xfs_trans_reserve_quota_nblks(args
.trans
, dp
, args
.total
, 0,
312 rsvd
? XFS_QMOPT_RES_REGBLKS
| XFS_QMOPT_FORCE_RES
:
313 XFS_QMOPT_RES_REGBLKS
);
315 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
316 xfs_trans_cancel(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
320 xfs_trans_ijoin(args
.trans
, dp
, 0);
323 * If the attribute list is non-existent or a shortform list,
324 * upgrade it to a single-leaf-block attribute list.
326 if ((dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) ||
327 ((dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
) &&
328 (dp
->i_d
.di_anextents
== 0))) {
331 * Build initial attribute list (if required).
333 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
)
334 xfs_attr_shortform_create(&args
);
337 * Try to add the attr to the attribute list in
340 error
= xfs_attr_shortform_addname(&args
);
341 if (error
!= ENOSPC
) {
343 * Commit the shortform mods, and we're done.
344 * NOTE: this is also the error path (EEXIST, etc).
346 ASSERT(args
.trans
!= NULL
);
349 * If this is a synchronous mount, make sure that
350 * the transaction goes to disk before returning
353 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
354 xfs_trans_set_sync(args
.trans
);
357 if (!error
&& (flags
& ATTR_KERNOTIME
) == 0) {
358 xfs_trans_ichgtime(args
.trans
, dp
,
361 err2
= xfs_trans_commit(args
.trans
,
362 XFS_TRANS_RELEASE_LOG_RES
);
363 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
365 return(error
== 0 ? err2
: error
);
369 * It won't fit in the shortform, transform to a leaf block.
370 * GROT: another possible req'mt for a double-split btree op.
372 xfs_bmap_init(args
.flist
, args
.firstblock
);
373 error
= xfs_attr_shortform_to_leaf(&args
);
375 error
= xfs_bmap_finish(&args
.trans
, args
.flist
,
381 xfs_bmap_cancel(&flist
);
386 * bmap_finish() may have committed the last trans and started
387 * a new one. We need the inode to be in all transactions.
390 xfs_trans_ijoin(args
.trans
, dp
, 0);
393 * Commit the leaf transformation. We'll need another (linked)
394 * transaction to add the new attribute to the leaf.
397 error
= xfs_trans_roll(&args
.trans
, dp
);
403 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
404 error
= xfs_attr_leaf_addname(&args
);
406 error
= xfs_attr_node_addname(&args
);
413 * If this is a synchronous mount, make sure that the
414 * transaction goes to disk before returning to the user.
416 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
417 xfs_trans_set_sync(args
.trans
);
420 if ((flags
& ATTR_KERNOTIME
) == 0)
421 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
424 * Commit the last in the sequence of transactions.
426 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
427 error
= xfs_trans_commit(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
428 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
434 xfs_trans_cancel(args
.trans
,
435 XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
436 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
443 const unsigned char *name
,
444 unsigned char *value
,
449 struct xfs_name xname
;
451 XFS_STATS_INC(xs_attr_set
);
453 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
456 error
= xfs_attr_name_to_xname(&xname
, name
);
460 return xfs_attr_set_int(dp
, &xname
, value
, valuelen
, flags
);
464 * Generic handler routine to remove a name from an attribute list.
465 * Transitions attribute list from Btree to shortform as necessary.
468 xfs_attr_remove_int(xfs_inode_t
*dp
, struct xfs_name
*name
, int flags
)
471 xfs_fsblock_t firstblock
;
472 xfs_bmap_free_t flist
;
474 xfs_mount_t
*mp
= dp
->i_mount
;
477 * Fill in the arg structure for this request.
479 memset((char *)&args
, 0, sizeof(args
));
480 args
.name
= name
->name
;
481 args
.namelen
= name
->len
;
483 args
.hashval
= xfs_da_hashname(args
.name
, args
.namelen
);
485 args
.firstblock
= &firstblock
;
488 args
.whichfork
= XFS_ATTR_FORK
;
491 * we have no control over the attribute names that userspace passes us
492 * to remove, so we have to allow the name lookup prior to attribute
495 args
.op_flags
= XFS_DA_OP_OKNOENT
;
498 * Attach the dquots to the inode.
500 error
= xfs_qm_dqattach(dp
, 0);
505 * Start our first transaction of the day.
507 * All future transactions during this code must be "chained" off
508 * this one via the trans_dup() call. All transactions will contain
509 * the inode, and the inode will always be marked with trans_ihold().
510 * Since the inode will be locked in all transactions, we must log
511 * the inode in every transaction to let it float upward through
514 args
.trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTR_RM
);
517 * Root fork attributes can use reserved data blocks for this
518 * operation if necessary
521 if (flags
& ATTR_ROOT
)
522 args
.trans
->t_flags
|= XFS_TRANS_RESERVE
;
524 if ((error
= xfs_trans_reserve(args
.trans
,
525 XFS_ATTRRM_SPACE_RES(mp
),
526 XFS_ATTRRM_LOG_RES(mp
),
527 0, XFS_TRANS_PERM_LOG_RES
,
528 XFS_ATTRRM_LOG_COUNT
))) {
529 xfs_trans_cancel(args
.trans
, 0);
533 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
535 * No need to make quota reservations here. We expect to release some
536 * blocks not allocate in the common case.
538 xfs_trans_ijoin(args
.trans
, dp
, 0);
541 * Decide on what work routines to call based on the inode size.
543 if (!xfs_inode_hasattr(dp
)) {
544 error
= XFS_ERROR(ENOATTR
);
547 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
548 ASSERT(dp
->i_afp
->if_flags
& XFS_IFINLINE
);
549 error
= xfs_attr_shortform_remove(&args
);
553 } else if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
554 error
= xfs_attr_leaf_removename(&args
);
556 error
= xfs_attr_node_removename(&args
);
563 * If this is a synchronous mount, make sure that the
564 * transaction goes to disk before returning to the user.
566 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
567 xfs_trans_set_sync(args
.trans
);
570 if ((flags
& ATTR_KERNOTIME
) == 0)
571 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
574 * Commit the last in the sequence of transactions.
576 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
577 error
= xfs_trans_commit(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
578 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
584 xfs_trans_cancel(args
.trans
,
585 XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
586 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
593 const unsigned char *name
,
597 struct xfs_name xname
;
599 XFS_STATS_INC(xs_attr_remove
);
601 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
604 error
= xfs_attr_name_to_xname(&xname
, name
);
608 xfs_ilock(dp
, XFS_ILOCK_SHARED
);
609 if (!xfs_inode_hasattr(dp
)) {
610 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
611 return XFS_ERROR(ENOATTR
);
613 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
615 return xfs_attr_remove_int(dp
, &xname
, flags
);
619 xfs_attr_list_int(xfs_attr_list_context_t
*context
)
622 xfs_inode_t
*dp
= context
->dp
;
624 XFS_STATS_INC(xs_attr_list
);
626 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
629 xfs_ilock(dp
, XFS_ILOCK_SHARED
);
632 * Decide on what work routines to call based on the inode size.
634 if (!xfs_inode_hasattr(dp
)) {
636 } else if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
637 error
= xfs_attr_shortform_list(context
);
638 } else if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
639 error
= xfs_attr_leaf_list(context
);
641 error
= xfs_attr_node_list(context
);
644 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
649 #define ATTR_ENTBASESIZE /* minimum bytes used by an attr */ \
650 (((struct attrlist_ent *) 0)->a_name - (char *) 0)
651 #define ATTR_ENTSIZE(namelen) /* actual bytes used by an attr */ \
652 ((ATTR_ENTBASESIZE + (namelen) + 1 + sizeof(u_int32_t)-1) \
653 & ~(sizeof(u_int32_t)-1))
656 * Format an attribute and copy it out to the user's buffer.
657 * Take care to check values and protect against them changing later,
658 * we may be reading them directly out of a user buffer.
662 xfs_attr_put_listent(
663 xfs_attr_list_context_t
*context
,
668 unsigned char *value
)
670 struct attrlist
*alist
= (struct attrlist
*)context
->alist
;
674 ASSERT(!(context
->flags
& ATTR_KERNOVAL
));
675 ASSERT(context
->count
>= 0);
676 ASSERT(context
->count
< (ATTR_MAX_VALUELEN
/8));
677 ASSERT(context
->firstu
>= sizeof(*alist
));
678 ASSERT(context
->firstu
<= context
->bufsize
);
681 * Only list entries in the right namespace.
683 if (((context
->flags
& ATTR_SECURE
) == 0) !=
684 ((flags
& XFS_ATTR_SECURE
) == 0))
686 if (((context
->flags
& ATTR_ROOT
) == 0) !=
687 ((flags
& XFS_ATTR_ROOT
) == 0))
690 arraytop
= sizeof(*alist
) +
691 context
->count
* sizeof(alist
->al_offset
[0]);
692 context
->firstu
-= ATTR_ENTSIZE(namelen
);
693 if (context
->firstu
< arraytop
) {
694 trace_xfs_attr_list_full(context
);
696 context
->seen_enough
= 1;
700 aep
= (attrlist_ent_t
*)&context
->alist
[context
->firstu
];
701 aep
->a_valuelen
= valuelen
;
702 memcpy(aep
->a_name
, name
, namelen
);
703 aep
->a_name
[namelen
] = 0;
704 alist
->al_offset
[context
->count
++] = context
->firstu
;
705 alist
->al_count
= context
->count
;
706 trace_xfs_attr_list_add(context
);
711 * Generate a list of extended attribute names and optionally
712 * also value lengths. Positive return value follows the XFS
713 * convention of being an error, zero or negative return code
714 * is the length of the buffer returned (negated), indicating
723 attrlist_cursor_kern_t
*cursor
)
725 xfs_attr_list_context_t context
;
726 struct attrlist
*alist
;
730 * Validate the cursor.
732 if (cursor
->pad1
|| cursor
->pad2
)
733 return(XFS_ERROR(EINVAL
));
734 if ((cursor
->initted
== 0) &&
735 (cursor
->hashval
|| cursor
->blkno
|| cursor
->offset
))
736 return XFS_ERROR(EINVAL
);
739 * Check for a properly aligned buffer.
741 if (((long)buffer
) & (sizeof(int)-1))
742 return XFS_ERROR(EFAULT
);
743 if (flags
& ATTR_KERNOVAL
)
747 * Initialize the output buffer.
749 memset(&context
, 0, sizeof(context
));
751 context
.cursor
= cursor
;
753 context
.flags
= flags
;
754 context
.alist
= buffer
;
755 context
.bufsize
= (bufsize
& ~(sizeof(int)-1)); /* align */
756 context
.firstu
= context
.bufsize
;
757 context
.put_listent
= xfs_attr_put_listent
;
759 alist
= (struct attrlist
*)context
.alist
;
762 alist
->al_offset
[0] = context
.bufsize
;
764 error
= xfs_attr_list_int(&context
);
770 xfs_attr_inactive(xfs_inode_t
*dp
)
777 ASSERT(! XFS_NOT_DQATTACHED(mp
, dp
));
779 xfs_ilock(dp
, XFS_ILOCK_SHARED
);
780 if (!xfs_inode_hasattr(dp
) ||
781 dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
782 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
785 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
788 * Start our first transaction of the day.
790 * All future transactions during this code must be "chained" off
791 * this one via the trans_dup() call. All transactions will contain
792 * the inode, and the inode will always be marked with trans_ihold().
793 * Since the inode will be locked in all transactions, we must log
794 * the inode in every transaction to let it float upward through
797 trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTRINVAL
);
798 if ((error
= xfs_trans_reserve(trans
, 0, XFS_ATTRINVAL_LOG_RES(mp
), 0,
799 XFS_TRANS_PERM_LOG_RES
,
800 XFS_ATTRINVAL_LOG_COUNT
))) {
801 xfs_trans_cancel(trans
, 0);
804 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
807 * No need to make quota reservations here. We expect to release some
808 * blocks, not allocate, in the common case.
810 xfs_trans_ijoin(trans
, dp
, 0);
813 * Decide on what work routines to call based on the inode size.
815 if (!xfs_inode_hasattr(dp
) ||
816 dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
820 error
= xfs_attr_root_inactive(&trans
, dp
);
824 error
= xfs_itruncate_extents(&trans
, dp
, XFS_ATTR_FORK
, 0);
828 error
= xfs_trans_commit(trans
, XFS_TRANS_RELEASE_LOG_RES
);
829 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
834 xfs_trans_cancel(trans
, XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
835 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
841 /*========================================================================
842 * External routines when attribute list is inside the inode
843 *========================================================================*/
846 * Add a name to the shortform attribute list structure
847 * This is the external routine.
850 xfs_attr_shortform_addname(xfs_da_args_t
*args
)
852 int newsize
, forkoff
, retval
;
854 trace_xfs_attr_sf_addname(args
);
856 retval
= xfs_attr_shortform_lookup(args
);
857 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
859 } else if (retval
== EEXIST
) {
860 if (args
->flags
& ATTR_CREATE
)
862 retval
= xfs_attr_shortform_remove(args
);
866 if (args
->namelen
>= XFS_ATTR_SF_ENTSIZE_MAX
||
867 args
->valuelen
>= XFS_ATTR_SF_ENTSIZE_MAX
)
868 return(XFS_ERROR(ENOSPC
));
870 newsize
= XFS_ATTR_SF_TOTSIZE(args
->dp
);
871 newsize
+= XFS_ATTR_SF_ENTSIZE_BYNAME(args
->namelen
, args
->valuelen
);
873 forkoff
= xfs_attr_shortform_bytesfit(args
->dp
, newsize
);
875 return(XFS_ERROR(ENOSPC
));
877 xfs_attr_shortform_add(args
, forkoff
);
882 /*========================================================================
883 * External routines when attribute list is one block
884 *========================================================================*/
887 * Add a name to the leaf attribute list structure
889 * This leaf block cannot have a "remote" value, we only call this routine
890 * if bmap_one_block() says there is only one block (ie: no remote blks).
893 xfs_attr_leaf_addname(xfs_da_args_t
*args
)
897 int retval
, error
, committed
, forkoff
;
899 trace_xfs_attr_leaf_addname(args
);
902 * Read the (only) block in the attribute list in.
906 error
= xfs_da_read_buf(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
,
913 * Look up the given attribute in the leaf block. Figure out if
914 * the given flags produce an error or call for an atomic rename.
916 retval
= xfs_attr_leaf_lookup_int(bp
, args
);
917 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
918 xfs_da_brelse(args
->trans
, bp
);
920 } else if (retval
== EEXIST
) {
921 if (args
->flags
& ATTR_CREATE
) { /* pure create op */
922 xfs_da_brelse(args
->trans
, bp
);
926 trace_xfs_attr_leaf_replace(args
);
928 args
->op_flags
|= XFS_DA_OP_RENAME
; /* an atomic rename */
929 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
930 args
->index2
= args
->index
;
931 args
->rmtblkno2
= args
->rmtblkno
;
932 args
->rmtblkcnt2
= args
->rmtblkcnt
;
936 * Add the attribute to the leaf block, transitioning to a Btree
939 retval
= xfs_attr_leaf_add(bp
, args
);
941 if (retval
== ENOSPC
) {
943 * Promote the attribute list to the Btree format, then
944 * Commit that transaction so that the node_addname() call
945 * can manage its own transactions.
947 xfs_bmap_init(args
->flist
, args
->firstblock
);
948 error
= xfs_attr_leaf_to_node(args
);
950 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
956 xfs_bmap_cancel(args
->flist
);
961 * bmap_finish() may have committed the last trans and started
962 * a new one. We need the inode to be in all transactions.
965 xfs_trans_ijoin(args
->trans
, dp
, 0);
968 * Commit the current trans (including the inode) and start
971 error
= xfs_trans_roll(&args
->trans
, dp
);
976 * Fob the whole rest of the problem off on the Btree code.
978 error
= xfs_attr_node_addname(args
);
983 * Commit the transaction that added the attr name so that
984 * later routines can manage their own transactions.
986 error
= xfs_trans_roll(&args
->trans
, dp
);
991 * If there was an out-of-line value, allocate the blocks we
992 * identified for its storage and copy the value. This is done
993 * after we create the attribute so that we don't overflow the
994 * maximum size of a transaction and/or hit a deadlock.
996 if (args
->rmtblkno
> 0) {
997 error
= xfs_attr_rmtval_set(args
);
1003 * If this is an atomic rename operation, we must "flip" the
1004 * incomplete flags on the "new" and "old" attribute/value pairs
1005 * so that one disappears and one appears atomically. Then we
1006 * must remove the "old" attribute/value pair.
1008 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
1010 * In a separate transaction, set the incomplete flag on the
1011 * "old" attr and clear the incomplete flag on the "new" attr.
1013 error
= xfs_attr_leaf_flipflags(args
);
1018 * Dismantle the "old" attribute/value pair by removing
1019 * a "remote" value (if it exists).
1021 args
->index
= args
->index2
;
1022 args
->blkno
= args
->blkno2
;
1023 args
->rmtblkno
= args
->rmtblkno2
;
1024 args
->rmtblkcnt
= args
->rmtblkcnt2
;
1025 if (args
->rmtblkno
) {
1026 error
= xfs_attr_rmtval_remove(args
);
1032 * Read in the block containing the "old" attr, then
1033 * remove the "old" attr from that block (neat, huh!)
1035 error
= xfs_da_read_buf(args
->trans
, args
->dp
, args
->blkno
, -1,
1036 &bp
, XFS_ATTR_FORK
);
1040 (void)xfs_attr_leaf_remove(bp
, args
);
1043 * If the result is small enough, shrink it all into the inode.
1045 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1046 xfs_bmap_init(args
->flist
, args
->firstblock
);
1047 error
= xfs_attr_leaf_to_shortform(bp
, args
, forkoff
);
1048 /* bp is gone due to xfs_da_shrink_inode */
1050 error
= xfs_bmap_finish(&args
->trans
,
1057 xfs_bmap_cancel(args
->flist
);
1062 * bmap_finish() may have committed the last trans
1063 * and started a new one. We need the inode to be
1064 * in all transactions.
1067 xfs_trans_ijoin(args
->trans
, dp
, 0);
1069 xfs_da_buf_done(bp
);
1072 * Commit the remove and start the next trans in series.
1074 error
= xfs_trans_roll(&args
->trans
, dp
);
1076 } else if (args
->rmtblkno
> 0) {
1078 * Added a "remote" value, just clear the incomplete flag.
1080 error
= xfs_attr_leaf_clearflag(args
);
1086 * Remove a name from the leaf attribute list structure
1088 * This leaf block cannot have a "remote" value, we only call this routine
1089 * if bmap_one_block() says there is only one block (ie: no remote blks).
1092 xfs_attr_leaf_removename(xfs_da_args_t
*args
)
1096 int error
, committed
, forkoff
;
1098 trace_xfs_attr_leaf_removename(args
);
1101 * Remove the attribute.
1105 error
= xfs_da_read_buf(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
,
1112 error
= xfs_attr_leaf_lookup_int(bp
, args
);
1113 if (error
== ENOATTR
) {
1114 xfs_da_brelse(args
->trans
, bp
);
1118 (void)xfs_attr_leaf_remove(bp
, args
);
1121 * If the result is small enough, shrink it all into the inode.
1123 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1124 xfs_bmap_init(args
->flist
, args
->firstblock
);
1125 error
= xfs_attr_leaf_to_shortform(bp
, args
, forkoff
);
1126 /* bp is gone due to xfs_da_shrink_inode */
1128 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1134 xfs_bmap_cancel(args
->flist
);
1139 * bmap_finish() may have committed the last trans and started
1140 * a new one. We need the inode to be in all transactions.
1143 xfs_trans_ijoin(args
->trans
, dp
, 0);
1145 xfs_da_buf_done(bp
);
1150 * Look up a name in a leaf attribute list structure.
1152 * This leaf block cannot have a "remote" value, we only call this routine
1153 * if bmap_one_block() says there is only one block (ie: no remote blks).
1156 xfs_attr_leaf_get(xfs_da_args_t
*args
)
1162 error
= xfs_da_read_buf(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
,
1168 error
= xfs_attr_leaf_lookup_int(bp
, args
);
1169 if (error
!= EEXIST
) {
1170 xfs_da_brelse(args
->trans
, bp
);
1173 error
= xfs_attr_leaf_getvalue(bp
, args
);
1174 xfs_da_brelse(args
->trans
, bp
);
1175 if (!error
&& (args
->rmtblkno
> 0) && !(args
->flags
& ATTR_KERNOVAL
)) {
1176 error
= xfs_attr_rmtval_get(args
);
1182 * Copy out attribute entries for attr_list(), for leaf attribute lists.
1185 xfs_attr_leaf_list(xfs_attr_list_context_t
*context
)
1187 xfs_attr_leafblock_t
*leaf
;
1191 context
->cursor
->blkno
= 0;
1192 error
= xfs_da_read_buf(NULL
, context
->dp
, 0, -1, &bp
, XFS_ATTR_FORK
);
1194 return XFS_ERROR(error
);
1197 if (unlikely(leaf
->hdr
.info
.magic
!= cpu_to_be16(XFS_ATTR_LEAF_MAGIC
))) {
1198 XFS_CORRUPTION_ERROR("xfs_attr_leaf_list", XFS_ERRLEVEL_LOW
,
1199 context
->dp
->i_mount
, leaf
);
1200 xfs_da_brelse(NULL
, bp
);
1201 return XFS_ERROR(EFSCORRUPTED
);
1204 error
= xfs_attr_leaf_list_int(bp
, context
);
1205 xfs_da_brelse(NULL
, bp
);
1206 return XFS_ERROR(error
);
1210 /*========================================================================
1211 * External routines when attribute list size > XFS_LBSIZE(mp).
1212 *========================================================================*/
1215 * Add a name to a Btree-format attribute list.
1217 * This will involve walking down the Btree, and may involve splitting
1218 * leaf nodes and even splitting intermediate nodes up to and including
1219 * the root node (a special case of an intermediate node).
1221 * "Remote" attribute values confuse the issue and atomic rename operations
1222 * add a whole extra layer of confusion on top of that.
1225 xfs_attr_node_addname(xfs_da_args_t
*args
)
1227 xfs_da_state_t
*state
;
1228 xfs_da_state_blk_t
*blk
;
1231 int committed
, retval
, error
;
1233 trace_xfs_attr_node_addname(args
);
1236 * Fill in bucket of arguments/results/context to carry around.
1241 state
= xfs_da_state_alloc();
1244 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1245 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1248 * Search to see if name already exists, and get back a pointer
1249 * to where it should go.
1251 error
= xfs_da_node_lookup_int(state
, &retval
);
1254 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1255 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1256 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
1258 } else if (retval
== EEXIST
) {
1259 if (args
->flags
& ATTR_CREATE
)
1262 trace_xfs_attr_node_replace(args
);
1264 args
->op_flags
|= XFS_DA_OP_RENAME
; /* atomic rename op */
1265 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
1266 args
->index2
= args
->index
;
1267 args
->rmtblkno2
= args
->rmtblkno
;
1268 args
->rmtblkcnt2
= args
->rmtblkcnt
;
1270 args
->rmtblkcnt
= 0;
1273 retval
= xfs_attr_leaf_add(blk
->bp
, state
->args
);
1274 if (retval
== ENOSPC
) {
1275 if (state
->path
.active
== 1) {
1277 * Its really a single leaf node, but it had
1278 * out-of-line values so it looked like it *might*
1279 * have been a b-tree.
1281 xfs_da_state_free(state
);
1282 xfs_bmap_init(args
->flist
, args
->firstblock
);
1283 error
= xfs_attr_leaf_to_node(args
);
1285 error
= xfs_bmap_finish(&args
->trans
,
1292 xfs_bmap_cancel(args
->flist
);
1297 * bmap_finish() may have committed the last trans
1298 * and started a new one. We need the inode to be
1299 * in all transactions.
1302 xfs_trans_ijoin(args
->trans
, dp
, 0);
1305 * Commit the node conversion and start the next
1306 * trans in the chain.
1308 error
= xfs_trans_roll(&args
->trans
, dp
);
1316 * Split as many Btree elements as required.
1317 * This code tracks the new and old attr's location
1318 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1319 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1321 xfs_bmap_init(args
->flist
, args
->firstblock
);
1322 error
= xfs_da_split(state
);
1324 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1330 xfs_bmap_cancel(args
->flist
);
1335 * bmap_finish() may have committed the last trans and started
1336 * a new one. We need the inode to be in all transactions.
1339 xfs_trans_ijoin(args
->trans
, dp
, 0);
1342 * Addition succeeded, update Btree hashvals.
1344 xfs_da_fixhashpath(state
, &state
->path
);
1348 * Kill the state structure, we're done with it and need to
1349 * allow the buffers to come back later.
1351 xfs_da_state_free(state
);
1355 * Commit the leaf addition or btree split and start the next
1356 * trans in the chain.
1358 error
= xfs_trans_roll(&args
->trans
, dp
);
1363 * If there was an out-of-line value, allocate the blocks we
1364 * identified for its storage and copy the value. This is done
1365 * after we create the attribute so that we don't overflow the
1366 * maximum size of a transaction and/or hit a deadlock.
1368 if (args
->rmtblkno
> 0) {
1369 error
= xfs_attr_rmtval_set(args
);
1375 * If this is an atomic rename operation, we must "flip" the
1376 * incomplete flags on the "new" and "old" attribute/value pairs
1377 * so that one disappears and one appears atomically. Then we
1378 * must remove the "old" attribute/value pair.
1380 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
1382 * In a separate transaction, set the incomplete flag on the
1383 * "old" attr and clear the incomplete flag on the "new" attr.
1385 error
= xfs_attr_leaf_flipflags(args
);
1390 * Dismantle the "old" attribute/value pair by removing
1391 * a "remote" value (if it exists).
1393 args
->index
= args
->index2
;
1394 args
->blkno
= args
->blkno2
;
1395 args
->rmtblkno
= args
->rmtblkno2
;
1396 args
->rmtblkcnt
= args
->rmtblkcnt2
;
1397 if (args
->rmtblkno
) {
1398 error
= xfs_attr_rmtval_remove(args
);
1404 * Re-find the "old" attribute entry after any split ops.
1405 * The INCOMPLETE flag means that we will find the "old"
1406 * attr, not the "new" one.
1408 args
->flags
|= XFS_ATTR_INCOMPLETE
;
1409 state
= xfs_da_state_alloc();
1412 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1413 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1415 error
= xfs_da_node_lookup_int(state
, &retval
);
1420 * Remove the name and update the hashvals in the tree.
1422 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1423 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1424 error
= xfs_attr_leaf_remove(blk
->bp
, args
);
1425 xfs_da_fixhashpath(state
, &state
->path
);
1428 * Check to see if the tree needs to be collapsed.
1430 if (retval
&& (state
->path
.active
> 1)) {
1431 xfs_bmap_init(args
->flist
, args
->firstblock
);
1432 error
= xfs_da_join(state
);
1434 error
= xfs_bmap_finish(&args
->trans
,
1441 xfs_bmap_cancel(args
->flist
);
1446 * bmap_finish() may have committed the last trans
1447 * and started a new one. We need the inode to be
1448 * in all transactions.
1451 xfs_trans_ijoin(args
->trans
, dp
, 0);
1455 * Commit and start the next trans in the chain.
1457 error
= xfs_trans_roll(&args
->trans
, dp
);
1461 } else if (args
->rmtblkno
> 0) {
1463 * Added a "remote" value, just clear the incomplete flag.
1465 error
= xfs_attr_leaf_clearflag(args
);
1473 xfs_da_state_free(state
);
1480 * Remove a name from a B-tree attribute list.
1482 * This will involve walking down the Btree, and may involve joining
1483 * leaf nodes and even joining intermediate nodes up to and including
1484 * the root node (a special case of an intermediate node).
1487 xfs_attr_node_removename(xfs_da_args_t
*args
)
1489 xfs_da_state_t
*state
;
1490 xfs_da_state_blk_t
*blk
;
1493 int retval
, error
, committed
, forkoff
;
1495 trace_xfs_attr_node_removename(args
);
1498 * Tie a string around our finger to remind us where we are.
1501 state
= xfs_da_state_alloc();
1503 state
->mp
= dp
->i_mount
;
1504 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1505 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1508 * Search to see if name exists, and get back a pointer to it.
1510 error
= xfs_da_node_lookup_int(state
, &retval
);
1511 if (error
|| (retval
!= EEXIST
)) {
1518 * If there is an out-of-line value, de-allocate the blocks.
1519 * This is done before we remove the attribute so that we don't
1520 * overflow the maximum size of a transaction and/or hit a deadlock.
1522 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1523 ASSERT(blk
->bp
!= NULL
);
1524 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1525 if (args
->rmtblkno
> 0) {
1527 * Fill in disk block numbers in the state structure
1528 * so that we can get the buffers back after we commit
1529 * several transactions in the following calls.
1531 error
= xfs_attr_fillstate(state
);
1536 * Mark the attribute as INCOMPLETE, then bunmapi() the
1539 error
= xfs_attr_leaf_setflag(args
);
1542 error
= xfs_attr_rmtval_remove(args
);
1547 * Refill the state structure with buffers, the prior calls
1548 * released our buffers.
1550 error
= xfs_attr_refillstate(state
);
1556 * Remove the name and update the hashvals in the tree.
1558 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1559 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1560 retval
= xfs_attr_leaf_remove(blk
->bp
, args
);
1561 xfs_da_fixhashpath(state
, &state
->path
);
1564 * Check to see if the tree needs to be collapsed.
1566 if (retval
&& (state
->path
.active
> 1)) {
1567 xfs_bmap_init(args
->flist
, args
->firstblock
);
1568 error
= xfs_da_join(state
);
1570 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1576 xfs_bmap_cancel(args
->flist
);
1581 * bmap_finish() may have committed the last trans and started
1582 * a new one. We need the inode to be in all transactions.
1585 xfs_trans_ijoin(args
->trans
, dp
, 0);
1588 * Commit the Btree join operation and start a new trans.
1590 error
= xfs_trans_roll(&args
->trans
, dp
);
1596 * If the result is small enough, push it all into the inode.
1598 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
1600 * Have to get rid of the copy of this dabuf in the state.
1602 ASSERT(state
->path
.active
== 1);
1603 ASSERT(state
->path
.blk
[0].bp
);
1604 xfs_da_buf_done(state
->path
.blk
[0].bp
);
1605 state
->path
.blk
[0].bp
= NULL
;
1607 error
= xfs_da_read_buf(args
->trans
, args
->dp
, 0, -1, &bp
,
1611 ASSERT((((xfs_attr_leafblock_t
*)bp
->data
)->hdr
.info
.magic
) ==
1612 cpu_to_be16(XFS_ATTR_LEAF_MAGIC
));
1614 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1615 xfs_bmap_init(args
->flist
, args
->firstblock
);
1616 error
= xfs_attr_leaf_to_shortform(bp
, args
, forkoff
);
1617 /* bp is gone due to xfs_da_shrink_inode */
1619 error
= xfs_bmap_finish(&args
->trans
,
1626 xfs_bmap_cancel(args
->flist
);
1631 * bmap_finish() may have committed the last trans
1632 * and started a new one. We need the inode to be
1633 * in all transactions.
1636 xfs_trans_ijoin(args
->trans
, dp
, 0);
1638 xfs_da_brelse(args
->trans
, bp
);
1643 xfs_da_state_free(state
);
1648 * Fill in the disk block numbers in the state structure for the buffers
1649 * that are attached to the state structure.
1650 * This is done so that we can quickly reattach ourselves to those buffers
1651 * after some set of transaction commits have released these buffers.
1654 xfs_attr_fillstate(xfs_da_state_t
*state
)
1656 xfs_da_state_path_t
*path
;
1657 xfs_da_state_blk_t
*blk
;
1661 * Roll down the "path" in the state structure, storing the on-disk
1662 * block number for those buffers in the "path".
1664 path
= &state
->path
;
1665 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1666 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1668 blk
->disk_blkno
= xfs_da_blkno(blk
->bp
);
1669 xfs_da_buf_done(blk
->bp
);
1672 blk
->disk_blkno
= 0;
1677 * Roll down the "altpath" in the state structure, storing the on-disk
1678 * block number for those buffers in the "altpath".
1680 path
= &state
->altpath
;
1681 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1682 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1684 blk
->disk_blkno
= xfs_da_blkno(blk
->bp
);
1685 xfs_da_buf_done(blk
->bp
);
1688 blk
->disk_blkno
= 0;
1696 * Reattach the buffers to the state structure based on the disk block
1697 * numbers stored in the state structure.
1698 * This is done after some set of transaction commits have released those
1699 * buffers from our grip.
1702 xfs_attr_refillstate(xfs_da_state_t
*state
)
1704 xfs_da_state_path_t
*path
;
1705 xfs_da_state_blk_t
*blk
;
1709 * Roll down the "path" in the state structure, storing the on-disk
1710 * block number for those buffers in the "path".
1712 path
= &state
->path
;
1713 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1714 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1715 if (blk
->disk_blkno
) {
1716 error
= xfs_da_read_buf(state
->args
->trans
,
1718 blk
->blkno
, blk
->disk_blkno
,
1719 &blk
->bp
, XFS_ATTR_FORK
);
1728 * Roll down the "altpath" in the state structure, storing the on-disk
1729 * block number for those buffers in the "altpath".
1731 path
= &state
->altpath
;
1732 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1733 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1734 if (blk
->disk_blkno
) {
1735 error
= xfs_da_read_buf(state
->args
->trans
,
1737 blk
->blkno
, blk
->disk_blkno
,
1738 &blk
->bp
, XFS_ATTR_FORK
);
1750 * Look up a filename in a node attribute list.
1752 * This routine gets called for any attribute fork that has more than one
1753 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1754 * "remote" values taking up more blocks.
1757 xfs_attr_node_get(xfs_da_args_t
*args
)
1759 xfs_da_state_t
*state
;
1760 xfs_da_state_blk_t
*blk
;
1764 state
= xfs_da_state_alloc();
1766 state
->mp
= args
->dp
->i_mount
;
1767 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1768 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1771 * Search to see if name exists, and get back a pointer to it.
1773 error
= xfs_da_node_lookup_int(state
, &retval
);
1776 } else if (retval
== EEXIST
) {
1777 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1778 ASSERT(blk
->bp
!= NULL
);
1779 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1782 * Get the value, local or "remote"
1784 retval
= xfs_attr_leaf_getvalue(blk
->bp
, args
);
1785 if (!retval
&& (args
->rmtblkno
> 0)
1786 && !(args
->flags
& ATTR_KERNOVAL
)) {
1787 retval
= xfs_attr_rmtval_get(args
);
1792 * If not in a transaction, we have to release all the buffers.
1794 for (i
= 0; i
< state
->path
.active
; i
++) {
1795 xfs_da_brelse(args
->trans
, state
->path
.blk
[i
].bp
);
1796 state
->path
.blk
[i
].bp
= NULL
;
1799 xfs_da_state_free(state
);
1803 STATIC
int /* error */
1804 xfs_attr_node_list(xfs_attr_list_context_t
*context
)
1806 attrlist_cursor_kern_t
*cursor
;
1807 xfs_attr_leafblock_t
*leaf
;
1808 xfs_da_intnode_t
*node
;
1809 xfs_da_node_entry_t
*btree
;
1813 cursor
= context
->cursor
;
1814 cursor
->initted
= 1;
1817 * Do all sorts of validation on the passed-in cursor structure.
1818 * If anything is amiss, ignore the cursor and look up the hashval
1819 * starting from the btree root.
1822 if (cursor
->blkno
> 0) {
1823 error
= xfs_da_read_buf(NULL
, context
->dp
, cursor
->blkno
, -1,
1824 &bp
, XFS_ATTR_FORK
);
1825 if ((error
!= 0) && (error
!= EFSCORRUPTED
))
1829 switch (be16_to_cpu(node
->hdr
.info
.magic
)) {
1830 case XFS_DA_NODE_MAGIC
:
1831 trace_xfs_attr_list_wrong_blk(context
);
1832 xfs_da_brelse(NULL
, bp
);
1835 case XFS_ATTR_LEAF_MAGIC
:
1837 if (cursor
->hashval
> be32_to_cpu(leaf
->entries
[
1838 be16_to_cpu(leaf
->hdr
.count
)-1].hashval
)) {
1839 trace_xfs_attr_list_wrong_blk(context
);
1840 xfs_da_brelse(NULL
, bp
);
1842 } else if (cursor
->hashval
<=
1843 be32_to_cpu(leaf
->entries
[0].hashval
)) {
1844 trace_xfs_attr_list_wrong_blk(context
);
1845 xfs_da_brelse(NULL
, bp
);
1850 trace_xfs_attr_list_wrong_blk(context
);
1851 xfs_da_brelse(NULL
, bp
);
1858 * We did not find what we expected given the cursor's contents,
1859 * so we start from the top and work down based on the hash value.
1860 * Note that start of node block is same as start of leaf block.
1865 error
= xfs_da_read_buf(NULL
, context
->dp
,
1866 cursor
->blkno
, -1, &bp
,
1870 if (unlikely(bp
== NULL
)) {
1871 XFS_ERROR_REPORT("xfs_attr_node_list(2)",
1873 context
->dp
->i_mount
);
1874 return(XFS_ERROR(EFSCORRUPTED
));
1877 if (node
->hdr
.info
.magic
==
1878 cpu_to_be16(XFS_ATTR_LEAF_MAGIC
))
1880 if (unlikely(node
->hdr
.info
.magic
!=
1881 cpu_to_be16(XFS_DA_NODE_MAGIC
))) {
1882 XFS_CORRUPTION_ERROR("xfs_attr_node_list(3)",
1884 context
->dp
->i_mount
,
1886 xfs_da_brelse(NULL
, bp
);
1887 return(XFS_ERROR(EFSCORRUPTED
));
1889 btree
= node
->btree
;
1890 for (i
= 0; i
< be16_to_cpu(node
->hdr
.count
);
1893 <= be32_to_cpu(btree
->hashval
)) {
1894 cursor
->blkno
= be32_to_cpu(btree
->before
);
1895 trace_xfs_attr_list_node_descend(context
,
1900 if (i
== be16_to_cpu(node
->hdr
.count
)) {
1901 xfs_da_brelse(NULL
, bp
);
1904 xfs_da_brelse(NULL
, bp
);
1910 * Roll upward through the blocks, processing each leaf block in
1911 * order. As long as there is space in the result buffer, keep
1912 * adding the information.
1916 if (unlikely(leaf
->hdr
.info
.magic
!=
1917 cpu_to_be16(XFS_ATTR_LEAF_MAGIC
))) {
1918 XFS_CORRUPTION_ERROR("xfs_attr_node_list(4)",
1920 context
->dp
->i_mount
, leaf
);
1921 xfs_da_brelse(NULL
, bp
);
1922 return(XFS_ERROR(EFSCORRUPTED
));
1924 error
= xfs_attr_leaf_list_int(bp
, context
);
1926 xfs_da_brelse(NULL
, bp
);
1929 if (context
->seen_enough
|| leaf
->hdr
.info
.forw
== 0)
1931 cursor
->blkno
= be32_to_cpu(leaf
->hdr
.info
.forw
);
1932 xfs_da_brelse(NULL
, bp
);
1933 error
= xfs_da_read_buf(NULL
, context
->dp
, cursor
->blkno
, -1,
1934 &bp
, XFS_ATTR_FORK
);
1937 if (unlikely((bp
== NULL
))) {
1938 XFS_ERROR_REPORT("xfs_attr_node_list(5)",
1940 context
->dp
->i_mount
);
1941 return(XFS_ERROR(EFSCORRUPTED
));
1944 xfs_da_brelse(NULL
, bp
);
1949 /*========================================================================
1950 * External routines for manipulating out-of-line attribute values.
1951 *========================================================================*/
1954 * Read the value associated with an attribute from the out-of-line buffer
1955 * that we stored it in.
1958 xfs_attr_rmtval_get(xfs_da_args_t
*args
)
1960 xfs_bmbt_irec_t map
[ATTR_RMTVALUE_MAPSIZE
];
1965 int nmap
, error
, tmp
, valuelen
, blkcnt
, i
;
1968 ASSERT(!(args
->flags
& ATTR_KERNOVAL
));
1970 mp
= args
->dp
->i_mount
;
1972 valuelen
= args
->valuelen
;
1973 lblkno
= args
->rmtblkno
;
1974 while (valuelen
> 0) {
1975 nmap
= ATTR_RMTVALUE_MAPSIZE
;
1976 error
= xfs_bmapi_read(args
->dp
, (xfs_fileoff_t
)lblkno
,
1977 args
->rmtblkcnt
, map
, &nmap
,
1978 XFS_BMAPI_ATTRFORK
);
1983 for (i
= 0; (i
< nmap
) && (valuelen
> 0); i
++) {
1984 ASSERT((map
[i
].br_startblock
!= DELAYSTARTBLOCK
) &&
1985 (map
[i
].br_startblock
!= HOLESTARTBLOCK
));
1986 dblkno
= XFS_FSB_TO_DADDR(mp
, map
[i
].br_startblock
);
1987 blkcnt
= XFS_FSB_TO_BB(mp
, map
[i
].br_blockcount
);
1988 error
= xfs_trans_read_buf(mp
, NULL
, mp
->m_ddev_targp
,
1989 dblkno
, blkcnt
, 0, &bp
);
1993 tmp
= min_t(int, valuelen
, BBTOB(bp
->b_length
));
1994 xfs_buf_iomove(bp
, 0, tmp
, dst
, XBRW_READ
);
1999 lblkno
+= map
[i
].br_blockcount
;
2002 ASSERT(valuelen
== 0);
2007 * Write the value associated with an attribute into the out-of-line buffer
2008 * that we have defined for it.
2011 xfs_attr_rmtval_set(xfs_da_args_t
*args
)
2014 xfs_fileoff_t lfileoff
;
2016 xfs_bmbt_irec_t map
;
2021 int blkcnt
, valuelen
, nmap
, error
, tmp
, committed
;
2028 * Find a "hole" in the attribute address space large enough for
2029 * us to drop the new attribute's value into.
2031 blkcnt
= XFS_B_TO_FSB(mp
, args
->valuelen
);
2033 error
= xfs_bmap_first_unused(args
->trans
, args
->dp
, blkcnt
, &lfileoff
,
2038 args
->rmtblkno
= lblkno
= (xfs_dablk_t
)lfileoff
;
2039 args
->rmtblkcnt
= blkcnt
;
2042 * Roll through the "value", allocating blocks on disk as required.
2044 while (blkcnt
> 0) {
2046 * Allocate a single extent, up to the size of the value.
2048 xfs_bmap_init(args
->flist
, args
->firstblock
);
2050 error
= xfs_bmapi_write(args
->trans
, dp
, (xfs_fileoff_t
)lblkno
,
2052 XFS_BMAPI_ATTRFORK
| XFS_BMAPI_METADATA
,
2053 args
->firstblock
, args
->total
, &map
, &nmap
,
2056 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
2062 xfs_bmap_cancel(args
->flist
);
2067 * bmap_finish() may have committed the last trans and started
2068 * a new one. We need the inode to be in all transactions.
2071 xfs_trans_ijoin(args
->trans
, dp
, 0);
2074 ASSERT((map
.br_startblock
!= DELAYSTARTBLOCK
) &&
2075 (map
.br_startblock
!= HOLESTARTBLOCK
));
2076 lblkno
+= map
.br_blockcount
;
2077 blkcnt
-= map
.br_blockcount
;
2080 * Start the next trans in the chain.
2082 error
= xfs_trans_roll(&args
->trans
, dp
);
2088 * Roll through the "value", copying the attribute value to the
2089 * already-allocated blocks. Blocks are written synchronously
2090 * so that we can know they are all on disk before we turn off
2091 * the INCOMPLETE flag.
2093 lblkno
= args
->rmtblkno
;
2094 valuelen
= args
->valuelen
;
2095 while (valuelen
> 0) {
2099 * Try to remember where we decided to put the value.
2101 xfs_bmap_init(args
->flist
, args
->firstblock
);
2103 error
= xfs_bmapi_read(dp
, (xfs_fileoff_t
)lblkno
,
2104 args
->rmtblkcnt
, &map
, &nmap
,
2105 XFS_BMAPI_ATTRFORK
);
2109 ASSERT((map
.br_startblock
!= DELAYSTARTBLOCK
) &&
2110 (map
.br_startblock
!= HOLESTARTBLOCK
));
2112 dblkno
= XFS_FSB_TO_DADDR(mp
, map
.br_startblock
),
2113 blkcnt
= XFS_FSB_TO_BB(mp
, map
.br_blockcount
);
2115 bp
= xfs_buf_get(mp
->m_ddev_targp
, dblkno
, blkcnt
, 0);
2119 buflen
= BBTOB(bp
->b_length
);
2120 tmp
= min_t(int, valuelen
, buflen
);
2121 xfs_buf_iomove(bp
, 0, tmp
, src
, XBRW_WRITE
);
2123 xfs_buf_zero(bp
, tmp
, buflen
- tmp
);
2125 error
= xfs_bwrite(bp
); /* GROT: NOTE: synchronous write */
2132 lblkno
+= map
.br_blockcount
;
2134 ASSERT(valuelen
== 0);
2139 * Remove the value associated with an attribute by deleting the
2140 * out-of-line buffer that it is stored on.
2143 xfs_attr_rmtval_remove(xfs_da_args_t
*args
)
2146 xfs_bmbt_irec_t map
;
2150 int valuelen
, blkcnt
, nmap
, error
, done
, committed
;
2152 mp
= args
->dp
->i_mount
;
2155 * Roll through the "value", invalidating the attribute value's
2158 lblkno
= args
->rmtblkno
;
2159 valuelen
= args
->rmtblkcnt
;
2160 while (valuelen
> 0) {
2162 * Try to remember where we decided to put the value.
2165 error
= xfs_bmapi_read(args
->dp
, (xfs_fileoff_t
)lblkno
,
2166 args
->rmtblkcnt
, &map
, &nmap
,
2167 XFS_BMAPI_ATTRFORK
);
2171 ASSERT((map
.br_startblock
!= DELAYSTARTBLOCK
) &&
2172 (map
.br_startblock
!= HOLESTARTBLOCK
));
2174 dblkno
= XFS_FSB_TO_DADDR(mp
, map
.br_startblock
),
2175 blkcnt
= XFS_FSB_TO_BB(mp
, map
.br_blockcount
);
2178 * If the "remote" value is in the cache, remove it.
2180 bp
= xfs_incore(mp
->m_ddev_targp
, dblkno
, blkcnt
, XBF_TRYLOCK
);
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
, 0);
2223 * Close out trans and start the next one in the chain.
2225 error
= xfs_trans_roll(&args
->trans
, args
->dp
);