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 error
= xfs_trans_reserve(args
.trans
, args
.total
,
304 XFS_ATTRSETM_LOG_RES(mp
) +
305 XFS_ATTRSETRT_LOG_RES(mp
) * args
.total
,
306 0, XFS_TRANS_PERM_LOG_RES
,
307 XFS_ATTRSET_LOG_COUNT
);
309 xfs_trans_cancel(args
.trans
, 0);
312 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
314 error
= xfs_trans_reserve_quota_nblks(args
.trans
, dp
, args
.total
, 0,
315 rsvd
? XFS_QMOPT_RES_REGBLKS
| XFS_QMOPT_FORCE_RES
:
316 XFS_QMOPT_RES_REGBLKS
);
318 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
319 xfs_trans_cancel(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
323 xfs_trans_ijoin(args
.trans
, dp
, 0);
326 * If the attribute list is non-existent or a shortform list,
327 * upgrade it to a single-leaf-block attribute list.
329 if ((dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) ||
330 ((dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
) &&
331 (dp
->i_d
.di_anextents
== 0))) {
334 * Build initial attribute list (if required).
336 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
)
337 xfs_attr_shortform_create(&args
);
340 * Try to add the attr to the attribute list in
343 error
= xfs_attr_shortform_addname(&args
);
344 if (error
!= ENOSPC
) {
346 * Commit the shortform mods, and we're done.
347 * NOTE: this is also the error path (EEXIST, etc).
349 ASSERT(args
.trans
!= NULL
);
352 * If this is a synchronous mount, make sure that
353 * the transaction goes to disk before returning
356 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
357 xfs_trans_set_sync(args
.trans
);
360 if (!error
&& (flags
& ATTR_KERNOTIME
) == 0) {
361 xfs_trans_ichgtime(args
.trans
, dp
,
364 err2
= xfs_trans_commit(args
.trans
,
365 XFS_TRANS_RELEASE_LOG_RES
);
366 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
368 return(error
== 0 ? err2
: error
);
372 * It won't fit in the shortform, transform to a leaf block.
373 * GROT: another possible req'mt for a double-split btree op.
375 xfs_bmap_init(args
.flist
, args
.firstblock
);
376 error
= xfs_attr_shortform_to_leaf(&args
);
378 error
= xfs_bmap_finish(&args
.trans
, args
.flist
,
384 xfs_bmap_cancel(&flist
);
389 * bmap_finish() may have committed the last trans and started
390 * a new one. We need the inode to be in all transactions.
393 xfs_trans_ijoin(args
.trans
, dp
, 0);
396 * Commit the leaf transformation. We'll need another (linked)
397 * transaction to add the new attribute to the leaf.
400 error
= xfs_trans_roll(&args
.trans
, dp
);
406 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
407 error
= xfs_attr_leaf_addname(&args
);
409 error
= xfs_attr_node_addname(&args
);
416 * If this is a synchronous mount, make sure that the
417 * transaction goes to disk before returning to the user.
419 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
420 xfs_trans_set_sync(args
.trans
);
423 if ((flags
& ATTR_KERNOTIME
) == 0)
424 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
427 * Commit the last in the sequence of transactions.
429 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
430 error
= xfs_trans_commit(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
431 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
437 xfs_trans_cancel(args
.trans
,
438 XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
439 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
446 const unsigned char *name
,
447 unsigned char *value
,
452 struct xfs_name xname
;
454 XFS_STATS_INC(xs_attr_set
);
456 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
459 error
= xfs_attr_name_to_xname(&xname
, name
);
463 return xfs_attr_set_int(dp
, &xname
, value
, valuelen
, flags
);
467 * Generic handler routine to remove a name from an attribute list.
468 * Transitions attribute list from Btree to shortform as necessary.
471 xfs_attr_remove_int(xfs_inode_t
*dp
, struct xfs_name
*name
, int flags
)
474 xfs_fsblock_t firstblock
;
475 xfs_bmap_free_t flist
;
477 xfs_mount_t
*mp
= dp
->i_mount
;
480 * Fill in the arg structure for this request.
482 memset((char *)&args
, 0, sizeof(args
));
483 args
.name
= name
->name
;
484 args
.namelen
= name
->len
;
486 args
.hashval
= xfs_da_hashname(args
.name
, args
.namelen
);
488 args
.firstblock
= &firstblock
;
491 args
.whichfork
= XFS_ATTR_FORK
;
494 * we have no control over the attribute names that userspace passes us
495 * to remove, so we have to allow the name lookup prior to attribute
498 args
.op_flags
= XFS_DA_OP_OKNOENT
;
501 * Attach the dquots to the inode.
503 error
= xfs_qm_dqattach(dp
, 0);
508 * Start our first transaction of the day.
510 * All future transactions during this code must be "chained" off
511 * this one via the trans_dup() call. All transactions will contain
512 * the inode, and the inode will always be marked with trans_ihold().
513 * Since the inode will be locked in all transactions, we must log
514 * the inode in every transaction to let it float upward through
517 args
.trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTR_RM
);
520 * Root fork attributes can use reserved data blocks for this
521 * operation if necessary
524 if (flags
& ATTR_ROOT
)
525 args
.trans
->t_flags
|= XFS_TRANS_RESERVE
;
527 if ((error
= xfs_trans_reserve(args
.trans
,
528 XFS_ATTRRM_SPACE_RES(mp
),
529 XFS_ATTRRM_LOG_RES(mp
),
530 0, XFS_TRANS_PERM_LOG_RES
,
531 XFS_ATTRRM_LOG_COUNT
))) {
532 xfs_trans_cancel(args
.trans
, 0);
536 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
538 * No need to make quota reservations here. We expect to release some
539 * blocks not allocate in the common case.
541 xfs_trans_ijoin(args
.trans
, dp
, 0);
544 * Decide on what work routines to call based on the inode size.
546 if (!xfs_inode_hasattr(dp
)) {
547 error
= XFS_ERROR(ENOATTR
);
550 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
551 ASSERT(dp
->i_afp
->if_flags
& XFS_IFINLINE
);
552 error
= xfs_attr_shortform_remove(&args
);
556 } else if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
557 error
= xfs_attr_leaf_removename(&args
);
559 error
= xfs_attr_node_removename(&args
);
566 * If this is a synchronous mount, make sure that the
567 * transaction goes to disk before returning to the user.
569 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
570 xfs_trans_set_sync(args
.trans
);
573 if ((flags
& ATTR_KERNOTIME
) == 0)
574 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
577 * Commit the last in the sequence of transactions.
579 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
580 error
= xfs_trans_commit(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
581 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
587 xfs_trans_cancel(args
.trans
,
588 XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
589 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
596 const unsigned char *name
,
600 struct xfs_name xname
;
602 XFS_STATS_INC(xs_attr_remove
);
604 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
607 error
= xfs_attr_name_to_xname(&xname
, name
);
611 xfs_ilock(dp
, XFS_ILOCK_SHARED
);
612 if (!xfs_inode_hasattr(dp
)) {
613 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
614 return XFS_ERROR(ENOATTR
);
616 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
618 return xfs_attr_remove_int(dp
, &xname
, flags
);
622 xfs_attr_list_int(xfs_attr_list_context_t
*context
)
625 xfs_inode_t
*dp
= context
->dp
;
627 XFS_STATS_INC(xs_attr_list
);
629 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
632 xfs_ilock(dp
, XFS_ILOCK_SHARED
);
635 * Decide on what work routines to call based on the inode size.
637 if (!xfs_inode_hasattr(dp
)) {
639 } else if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
640 error
= xfs_attr_shortform_list(context
);
641 } else if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
642 error
= xfs_attr_leaf_list(context
);
644 error
= xfs_attr_node_list(context
);
647 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
652 #define ATTR_ENTBASESIZE /* minimum bytes used by an attr */ \
653 (((struct attrlist_ent *) 0)->a_name - (char *) 0)
654 #define ATTR_ENTSIZE(namelen) /* actual bytes used by an attr */ \
655 ((ATTR_ENTBASESIZE + (namelen) + 1 + sizeof(u_int32_t)-1) \
656 & ~(sizeof(u_int32_t)-1))
659 * Format an attribute and copy it out to the user's buffer.
660 * Take care to check values and protect against them changing later,
661 * we may be reading them directly out of a user buffer.
665 xfs_attr_put_listent(
666 xfs_attr_list_context_t
*context
,
671 unsigned char *value
)
673 struct attrlist
*alist
= (struct attrlist
*)context
->alist
;
677 ASSERT(!(context
->flags
& ATTR_KERNOVAL
));
678 ASSERT(context
->count
>= 0);
679 ASSERT(context
->count
< (ATTR_MAX_VALUELEN
/8));
680 ASSERT(context
->firstu
>= sizeof(*alist
));
681 ASSERT(context
->firstu
<= context
->bufsize
);
684 * Only list entries in the right namespace.
686 if (((context
->flags
& ATTR_SECURE
) == 0) !=
687 ((flags
& XFS_ATTR_SECURE
) == 0))
689 if (((context
->flags
& ATTR_ROOT
) == 0) !=
690 ((flags
& XFS_ATTR_ROOT
) == 0))
693 arraytop
= sizeof(*alist
) +
694 context
->count
* sizeof(alist
->al_offset
[0]);
695 context
->firstu
-= ATTR_ENTSIZE(namelen
);
696 if (context
->firstu
< arraytop
) {
697 trace_xfs_attr_list_full(context
);
699 context
->seen_enough
= 1;
703 aep
= (attrlist_ent_t
*)&context
->alist
[context
->firstu
];
704 aep
->a_valuelen
= valuelen
;
705 memcpy(aep
->a_name
, name
, namelen
);
706 aep
->a_name
[namelen
] = 0;
707 alist
->al_offset
[context
->count
++] = context
->firstu
;
708 alist
->al_count
= context
->count
;
709 trace_xfs_attr_list_add(context
);
714 * Generate a list of extended attribute names and optionally
715 * also value lengths. Positive return value follows the XFS
716 * convention of being an error, zero or negative return code
717 * is the length of the buffer returned (negated), indicating
726 attrlist_cursor_kern_t
*cursor
)
728 xfs_attr_list_context_t context
;
729 struct attrlist
*alist
;
733 * Validate the cursor.
735 if (cursor
->pad1
|| cursor
->pad2
)
736 return(XFS_ERROR(EINVAL
));
737 if ((cursor
->initted
== 0) &&
738 (cursor
->hashval
|| cursor
->blkno
|| cursor
->offset
))
739 return XFS_ERROR(EINVAL
);
742 * Check for a properly aligned buffer.
744 if (((long)buffer
) & (sizeof(int)-1))
745 return XFS_ERROR(EFAULT
);
746 if (flags
& ATTR_KERNOVAL
)
750 * Initialize the output buffer.
752 memset(&context
, 0, sizeof(context
));
754 context
.cursor
= cursor
;
756 context
.flags
= flags
;
757 context
.alist
= buffer
;
758 context
.bufsize
= (bufsize
& ~(sizeof(int)-1)); /* align */
759 context
.firstu
= context
.bufsize
;
760 context
.put_listent
= xfs_attr_put_listent
;
762 alist
= (struct attrlist
*)context
.alist
;
765 alist
->al_offset
[0] = context
.bufsize
;
767 error
= xfs_attr_list_int(&context
);
773 xfs_attr_inactive(xfs_inode_t
*dp
)
780 ASSERT(! XFS_NOT_DQATTACHED(mp
, dp
));
782 xfs_ilock(dp
, XFS_ILOCK_SHARED
);
783 if (!xfs_inode_hasattr(dp
) ||
784 dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
785 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
788 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
791 * Start our first transaction of the day.
793 * All future transactions during this code must be "chained" off
794 * this one via the trans_dup() call. All transactions will contain
795 * the inode, and the inode will always be marked with trans_ihold().
796 * Since the inode will be locked in all transactions, we must log
797 * the inode in every transaction to let it float upward through
800 trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTRINVAL
);
801 if ((error
= xfs_trans_reserve(trans
, 0, XFS_ATTRINVAL_LOG_RES(mp
), 0,
802 XFS_TRANS_PERM_LOG_RES
,
803 XFS_ATTRINVAL_LOG_COUNT
))) {
804 xfs_trans_cancel(trans
, 0);
807 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
810 * No need to make quota reservations here. We expect to release some
811 * blocks, not allocate, in the common case.
813 xfs_trans_ijoin(trans
, dp
, 0);
816 * Decide on what work routines to call based on the inode size.
818 if (!xfs_inode_hasattr(dp
) ||
819 dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
823 error
= xfs_attr_root_inactive(&trans
, dp
);
827 error
= xfs_itruncate_extents(&trans
, dp
, XFS_ATTR_FORK
, 0);
831 error
= xfs_trans_commit(trans
, XFS_TRANS_RELEASE_LOG_RES
);
832 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
837 xfs_trans_cancel(trans
, XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
838 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
844 /*========================================================================
845 * External routines when attribute list is inside the inode
846 *========================================================================*/
849 * Add a name to the shortform attribute list structure
850 * This is the external routine.
853 xfs_attr_shortform_addname(xfs_da_args_t
*args
)
855 int newsize
, forkoff
, retval
;
857 trace_xfs_attr_sf_addname(args
);
859 retval
= xfs_attr_shortform_lookup(args
);
860 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
862 } else if (retval
== EEXIST
) {
863 if (args
->flags
& ATTR_CREATE
)
865 retval
= xfs_attr_shortform_remove(args
);
869 if (args
->namelen
>= XFS_ATTR_SF_ENTSIZE_MAX
||
870 args
->valuelen
>= XFS_ATTR_SF_ENTSIZE_MAX
)
871 return(XFS_ERROR(ENOSPC
));
873 newsize
= XFS_ATTR_SF_TOTSIZE(args
->dp
);
874 newsize
+= XFS_ATTR_SF_ENTSIZE_BYNAME(args
->namelen
, args
->valuelen
);
876 forkoff
= xfs_attr_shortform_bytesfit(args
->dp
, newsize
);
878 return(XFS_ERROR(ENOSPC
));
880 xfs_attr_shortform_add(args
, forkoff
);
885 /*========================================================================
886 * External routines when attribute list is one block
887 *========================================================================*/
890 * Add a name to the leaf attribute list structure
892 * This leaf block cannot have a "remote" value, we only call this routine
893 * if bmap_one_block() says there is only one block (ie: no remote blks).
896 xfs_attr_leaf_addname(xfs_da_args_t
*args
)
900 int retval
, error
, committed
, forkoff
;
902 trace_xfs_attr_leaf_addname(args
);
905 * Read the (only) block in the attribute list in.
909 error
= xfs_attr_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
914 * Look up the given attribute in the leaf block. Figure out if
915 * the given flags produce an error or call for an atomic rename.
917 retval
= xfs_attr_leaf_lookup_int(bp
, args
);
918 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
919 xfs_trans_brelse(args
->trans
, bp
);
921 } else if (retval
== EEXIST
) {
922 if (args
->flags
& ATTR_CREATE
) { /* pure create op */
923 xfs_trans_brelse(args
->trans
, bp
);
927 trace_xfs_attr_leaf_replace(args
);
929 args
->op_flags
|= XFS_DA_OP_RENAME
; /* an atomic rename */
930 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
931 args
->index2
= args
->index
;
932 args
->rmtblkno2
= args
->rmtblkno
;
933 args
->rmtblkcnt2
= args
->rmtblkcnt
;
937 * Add the attribute to the leaf block, transitioning to a Btree
940 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_attr_leaf_read(args
->trans
, args
->dp
, args
->blkno
,
1040 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);
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
;
1097 trace_xfs_attr_leaf_removename(args
);
1100 * Remove the attribute.
1104 error
= xfs_attr_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
1108 error
= xfs_attr_leaf_lookup_int(bp
, args
);
1109 if (error
== ENOATTR
) {
1110 xfs_trans_brelse(args
->trans
, bp
);
1114 xfs_attr_leaf_remove(bp
, args
);
1117 * If the result is small enough, shrink it all into the inode.
1119 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1120 xfs_bmap_init(args
->flist
, args
->firstblock
);
1121 error
= xfs_attr_leaf_to_shortform(bp
, args
, forkoff
);
1122 /* bp is gone due to xfs_da_shrink_inode */
1124 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1130 xfs_bmap_cancel(args
->flist
);
1135 * bmap_finish() may have committed the last trans and started
1136 * a new one. We need the inode to be in all transactions.
1139 xfs_trans_ijoin(args
->trans
, dp
, 0);
1145 * Look up a name in a leaf attribute list structure.
1147 * This leaf block cannot have a "remote" value, we only call this routine
1148 * if bmap_one_block() says there is only one block (ie: no remote blks).
1151 xfs_attr_leaf_get(xfs_da_args_t
*args
)
1156 trace_xfs_attr_leaf_get(args
);
1159 error
= xfs_attr_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
1163 error
= xfs_attr_leaf_lookup_int(bp
, args
);
1164 if (error
!= EEXIST
) {
1165 xfs_trans_brelse(args
->trans
, bp
);
1168 error
= xfs_attr_leaf_getvalue(bp
, args
);
1169 xfs_trans_brelse(args
->trans
, bp
);
1170 if (!error
&& (args
->rmtblkno
> 0) && !(args
->flags
& ATTR_KERNOVAL
)) {
1171 error
= xfs_attr_rmtval_get(args
);
1177 * Copy out attribute entries for attr_list(), for leaf attribute lists.
1180 xfs_attr_leaf_list(xfs_attr_list_context_t
*context
)
1185 trace_xfs_attr_leaf_list(context
);
1187 context
->cursor
->blkno
= 0;
1188 error
= xfs_attr_leaf_read(NULL
, context
->dp
, 0, -1, &bp
);
1190 return XFS_ERROR(error
);
1192 error
= xfs_attr_leaf_list_int(bp
, context
);
1193 xfs_trans_brelse(NULL
, bp
);
1194 return XFS_ERROR(error
);
1198 /*========================================================================
1199 * External routines when attribute list size > XFS_LBSIZE(mp).
1200 *========================================================================*/
1203 * Add a name to a Btree-format attribute list.
1205 * This will involve walking down the Btree, and may involve splitting
1206 * leaf nodes and even splitting intermediate nodes up to and including
1207 * the root node (a special case of an intermediate node).
1209 * "Remote" attribute values confuse the issue and atomic rename operations
1210 * add a whole extra layer of confusion on top of that.
1213 xfs_attr_node_addname(xfs_da_args_t
*args
)
1215 xfs_da_state_t
*state
;
1216 xfs_da_state_blk_t
*blk
;
1219 int committed
, retval
, error
;
1221 trace_xfs_attr_node_addname(args
);
1224 * Fill in bucket of arguments/results/context to carry around.
1229 state
= xfs_da_state_alloc();
1232 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1233 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1236 * Search to see if name already exists, and get back a pointer
1237 * to where it should go.
1239 error
= xfs_da_node_lookup_int(state
, &retval
);
1242 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1243 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1244 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
1246 } else if (retval
== EEXIST
) {
1247 if (args
->flags
& ATTR_CREATE
)
1250 trace_xfs_attr_node_replace(args
);
1252 args
->op_flags
|= XFS_DA_OP_RENAME
; /* atomic rename op */
1253 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
1254 args
->index2
= args
->index
;
1255 args
->rmtblkno2
= args
->rmtblkno
;
1256 args
->rmtblkcnt2
= args
->rmtblkcnt
;
1258 args
->rmtblkcnt
= 0;
1261 retval
= xfs_attr_leaf_add(blk
->bp
, state
->args
);
1262 if (retval
== ENOSPC
) {
1263 if (state
->path
.active
== 1) {
1265 * Its really a single leaf node, but it had
1266 * out-of-line values so it looked like it *might*
1267 * have been a b-tree.
1269 xfs_da_state_free(state
);
1270 xfs_bmap_init(args
->flist
, args
->firstblock
);
1271 error
= xfs_attr_leaf_to_node(args
);
1273 error
= xfs_bmap_finish(&args
->trans
,
1280 xfs_bmap_cancel(args
->flist
);
1285 * bmap_finish() may have committed the last trans
1286 * and started a new one. We need the inode to be
1287 * in all transactions.
1290 xfs_trans_ijoin(args
->trans
, dp
, 0);
1293 * Commit the node conversion and start the next
1294 * trans in the chain.
1296 error
= xfs_trans_roll(&args
->trans
, dp
);
1304 * Split as many Btree elements as required.
1305 * This code tracks the new and old attr's location
1306 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1307 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1309 xfs_bmap_init(args
->flist
, args
->firstblock
);
1310 error
= xfs_da_split(state
);
1312 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1318 xfs_bmap_cancel(args
->flist
);
1323 * bmap_finish() may have committed the last trans and started
1324 * a new one. We need the inode to be in all transactions.
1327 xfs_trans_ijoin(args
->trans
, dp
, 0);
1330 * Addition succeeded, update Btree hashvals.
1332 xfs_da_fixhashpath(state
, &state
->path
);
1336 * Kill the state structure, we're done with it and need to
1337 * allow the buffers to come back later.
1339 xfs_da_state_free(state
);
1343 * Commit the leaf addition or btree split and start the next
1344 * trans in the chain.
1346 error
= xfs_trans_roll(&args
->trans
, dp
);
1351 * If there was an out-of-line value, allocate the blocks we
1352 * identified for its storage and copy the value. This is done
1353 * after we create the attribute so that we don't overflow the
1354 * maximum size of a transaction and/or hit a deadlock.
1356 if (args
->rmtblkno
> 0) {
1357 error
= xfs_attr_rmtval_set(args
);
1363 * If this is an atomic rename operation, we must "flip" the
1364 * incomplete flags on the "new" and "old" attribute/value pairs
1365 * so that one disappears and one appears atomically. Then we
1366 * must remove the "old" attribute/value pair.
1368 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
1370 * In a separate transaction, set the incomplete flag on the
1371 * "old" attr and clear the incomplete flag on the "new" attr.
1373 error
= xfs_attr_leaf_flipflags(args
);
1378 * Dismantle the "old" attribute/value pair by removing
1379 * a "remote" value (if it exists).
1381 args
->index
= args
->index2
;
1382 args
->blkno
= args
->blkno2
;
1383 args
->rmtblkno
= args
->rmtblkno2
;
1384 args
->rmtblkcnt
= args
->rmtblkcnt2
;
1385 if (args
->rmtblkno
) {
1386 error
= xfs_attr_rmtval_remove(args
);
1392 * Re-find the "old" attribute entry after any split ops.
1393 * The INCOMPLETE flag means that we will find the "old"
1394 * attr, not the "new" one.
1396 args
->flags
|= XFS_ATTR_INCOMPLETE
;
1397 state
= xfs_da_state_alloc();
1400 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1401 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1403 error
= xfs_da_node_lookup_int(state
, &retval
);
1408 * Remove the name and update the hashvals in the tree.
1410 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1411 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1412 error
= xfs_attr_leaf_remove(blk
->bp
, args
);
1413 xfs_da_fixhashpath(state
, &state
->path
);
1416 * Check to see if the tree needs to be collapsed.
1418 if (retval
&& (state
->path
.active
> 1)) {
1419 xfs_bmap_init(args
->flist
, args
->firstblock
);
1420 error
= xfs_da_join(state
);
1422 error
= xfs_bmap_finish(&args
->trans
,
1429 xfs_bmap_cancel(args
->flist
);
1434 * bmap_finish() may have committed the last trans
1435 * and started a new one. We need the inode to be
1436 * in all transactions.
1439 xfs_trans_ijoin(args
->trans
, dp
, 0);
1443 * Commit and start the next trans in the chain.
1445 error
= xfs_trans_roll(&args
->trans
, dp
);
1449 } else if (args
->rmtblkno
> 0) {
1451 * Added a "remote" value, just clear the incomplete flag.
1453 error
= xfs_attr_leaf_clearflag(args
);
1461 xfs_da_state_free(state
);
1468 * Remove a name from a B-tree attribute list.
1470 * This will involve walking down the Btree, and may involve joining
1471 * leaf nodes and even joining intermediate nodes up to and including
1472 * the root node (a special case of an intermediate node).
1475 xfs_attr_node_removename(xfs_da_args_t
*args
)
1477 xfs_da_state_t
*state
;
1478 xfs_da_state_blk_t
*blk
;
1481 int retval
, error
, committed
, forkoff
;
1483 trace_xfs_attr_node_removename(args
);
1486 * Tie a string around our finger to remind us where we are.
1489 state
= xfs_da_state_alloc();
1491 state
->mp
= dp
->i_mount
;
1492 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1493 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1496 * Search to see if name exists, and get back a pointer to it.
1498 error
= xfs_da_node_lookup_int(state
, &retval
);
1499 if (error
|| (retval
!= EEXIST
)) {
1506 * If there is an out-of-line value, de-allocate the blocks.
1507 * This is done before we remove the attribute so that we don't
1508 * overflow the maximum size of a transaction and/or hit a deadlock.
1510 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1511 ASSERT(blk
->bp
!= NULL
);
1512 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1513 if (args
->rmtblkno
> 0) {
1515 * Fill in disk block numbers in the state structure
1516 * so that we can get the buffers back after we commit
1517 * several transactions in the following calls.
1519 error
= xfs_attr_fillstate(state
);
1524 * Mark the attribute as INCOMPLETE, then bunmapi() the
1527 error
= xfs_attr_leaf_setflag(args
);
1530 error
= xfs_attr_rmtval_remove(args
);
1535 * Refill the state structure with buffers, the prior calls
1536 * released our buffers.
1538 error
= xfs_attr_refillstate(state
);
1544 * Remove the name and update the hashvals in the tree.
1546 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1547 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1548 retval
= xfs_attr_leaf_remove(blk
->bp
, args
);
1549 xfs_da_fixhashpath(state
, &state
->path
);
1552 * Check to see if the tree needs to be collapsed.
1554 if (retval
&& (state
->path
.active
> 1)) {
1555 xfs_bmap_init(args
->flist
, args
->firstblock
);
1556 error
= xfs_da_join(state
);
1558 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1564 xfs_bmap_cancel(args
->flist
);
1569 * bmap_finish() may have committed the last trans and started
1570 * a new one. We need the inode to be in all transactions.
1573 xfs_trans_ijoin(args
->trans
, dp
, 0);
1576 * Commit the Btree join operation and start a new trans.
1578 error
= xfs_trans_roll(&args
->trans
, dp
);
1584 * If the result is small enough, push it all into the inode.
1586 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
1588 * Have to get rid of the copy of this dabuf in the state.
1590 ASSERT(state
->path
.active
== 1);
1591 ASSERT(state
->path
.blk
[0].bp
);
1592 state
->path
.blk
[0].bp
= NULL
;
1594 error
= xfs_attr_leaf_read(args
->trans
, args
->dp
, 0, -1, &bp
);
1598 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1599 xfs_bmap_init(args
->flist
, args
->firstblock
);
1600 error
= xfs_attr_leaf_to_shortform(bp
, args
, forkoff
);
1601 /* bp is gone due to xfs_da_shrink_inode */
1603 error
= xfs_bmap_finish(&args
->trans
,
1610 xfs_bmap_cancel(args
->flist
);
1615 * bmap_finish() may have committed the last trans
1616 * and started a new one. We need the inode to be
1617 * in all transactions.
1620 xfs_trans_ijoin(args
->trans
, dp
, 0);
1622 xfs_trans_brelse(args
->trans
, bp
);
1627 xfs_da_state_free(state
);
1632 * Fill in the disk block numbers in the state structure for the buffers
1633 * that are attached to the state structure.
1634 * This is done so that we can quickly reattach ourselves to those buffers
1635 * after some set of transaction commits have released these buffers.
1638 xfs_attr_fillstate(xfs_da_state_t
*state
)
1640 xfs_da_state_path_t
*path
;
1641 xfs_da_state_blk_t
*blk
;
1644 trace_xfs_attr_fillstate(state
->args
);
1647 * Roll down the "path" in the state structure, storing the on-disk
1648 * block number for those buffers in the "path".
1650 path
= &state
->path
;
1651 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1652 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1654 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1657 blk
->disk_blkno
= 0;
1662 * Roll down the "altpath" in the state structure, storing the on-disk
1663 * block number for those buffers in the "altpath".
1665 path
= &state
->altpath
;
1666 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1667 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1669 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1672 blk
->disk_blkno
= 0;
1680 * Reattach the buffers to the state structure based on the disk block
1681 * numbers stored in the state structure.
1682 * This is done after some set of transaction commits have released those
1683 * buffers from our grip.
1686 xfs_attr_refillstate(xfs_da_state_t
*state
)
1688 xfs_da_state_path_t
*path
;
1689 xfs_da_state_blk_t
*blk
;
1692 trace_xfs_attr_refillstate(state
->args
);
1695 * Roll down the "path" in the state structure, storing the on-disk
1696 * block number for those buffers in the "path".
1698 path
= &state
->path
;
1699 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1700 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1701 if (blk
->disk_blkno
) {
1702 error
= xfs_da_node_read(state
->args
->trans
,
1704 blk
->blkno
, blk
->disk_blkno
,
1705 &blk
->bp
, XFS_ATTR_FORK
);
1714 * Roll down the "altpath" in the state structure, storing the on-disk
1715 * block number for those buffers in the "altpath".
1717 path
= &state
->altpath
;
1718 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1719 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1720 if (blk
->disk_blkno
) {
1721 error
= xfs_da_node_read(state
->args
->trans
,
1723 blk
->blkno
, blk
->disk_blkno
,
1724 &blk
->bp
, XFS_ATTR_FORK
);
1736 * Look up a filename in a node attribute list.
1738 * This routine gets called for any attribute fork that has more than one
1739 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1740 * "remote" values taking up more blocks.
1743 xfs_attr_node_get(xfs_da_args_t
*args
)
1745 xfs_da_state_t
*state
;
1746 xfs_da_state_blk_t
*blk
;
1750 trace_xfs_attr_node_get(args
);
1752 state
= xfs_da_state_alloc();
1754 state
->mp
= args
->dp
->i_mount
;
1755 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1756 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1759 * Search to see if name exists, and get back a pointer to it.
1761 error
= xfs_da_node_lookup_int(state
, &retval
);
1764 } else if (retval
== EEXIST
) {
1765 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1766 ASSERT(blk
->bp
!= NULL
);
1767 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1770 * Get the value, local or "remote"
1772 retval
= xfs_attr_leaf_getvalue(blk
->bp
, args
);
1773 if (!retval
&& (args
->rmtblkno
> 0)
1774 && !(args
->flags
& ATTR_KERNOVAL
)) {
1775 retval
= xfs_attr_rmtval_get(args
);
1780 * If not in a transaction, we have to release all the buffers.
1782 for (i
= 0; i
< state
->path
.active
; i
++) {
1783 xfs_trans_brelse(args
->trans
, state
->path
.blk
[i
].bp
);
1784 state
->path
.blk
[i
].bp
= NULL
;
1787 xfs_da_state_free(state
);
1791 STATIC
int /* error */
1792 xfs_attr_node_list(xfs_attr_list_context_t
*context
)
1794 attrlist_cursor_kern_t
*cursor
;
1795 xfs_attr_leafblock_t
*leaf
;
1796 xfs_da_intnode_t
*node
;
1797 xfs_da_node_entry_t
*btree
;
1801 trace_xfs_attr_node_list(context
);
1803 cursor
= context
->cursor
;
1804 cursor
->initted
= 1;
1807 * Do all sorts of validation on the passed-in cursor structure.
1808 * If anything is amiss, ignore the cursor and look up the hashval
1809 * starting from the btree root.
1812 if (cursor
->blkno
> 0) {
1813 error
= xfs_da_node_read(NULL
, context
->dp
, cursor
->blkno
, -1,
1814 &bp
, XFS_ATTR_FORK
);
1815 if ((error
!= 0) && (error
!= EFSCORRUPTED
))
1819 switch (be16_to_cpu(node
->hdr
.info
.magic
)) {
1820 case XFS_DA_NODE_MAGIC
:
1821 trace_xfs_attr_list_wrong_blk(context
);
1822 xfs_trans_brelse(NULL
, bp
);
1825 case XFS_ATTR_LEAF_MAGIC
:
1827 if (cursor
->hashval
> be32_to_cpu(leaf
->entries
[
1828 be16_to_cpu(leaf
->hdr
.count
)-1].hashval
)) {
1829 trace_xfs_attr_list_wrong_blk(context
);
1830 xfs_trans_brelse(NULL
, bp
);
1832 } else if (cursor
->hashval
<=
1833 be32_to_cpu(leaf
->entries
[0].hashval
)) {
1834 trace_xfs_attr_list_wrong_blk(context
);
1835 xfs_trans_brelse(NULL
, bp
);
1840 trace_xfs_attr_list_wrong_blk(context
);
1841 xfs_trans_brelse(NULL
, bp
);
1848 * We did not find what we expected given the cursor's contents,
1849 * so we start from the top and work down based on the hash value.
1850 * Note that start of node block is same as start of leaf block.
1855 error
= xfs_da_node_read(NULL
, context
->dp
,
1856 cursor
->blkno
, -1, &bp
,
1861 if (node
->hdr
.info
.magic
==
1862 cpu_to_be16(XFS_ATTR_LEAF_MAGIC
))
1864 if (unlikely(node
->hdr
.info
.magic
!=
1865 cpu_to_be16(XFS_DA_NODE_MAGIC
))) {
1866 XFS_CORRUPTION_ERROR("xfs_attr_node_list(3)",
1868 context
->dp
->i_mount
,
1870 xfs_trans_brelse(NULL
, bp
);
1871 return(XFS_ERROR(EFSCORRUPTED
));
1873 btree
= node
->btree
;
1874 for (i
= 0; i
< be16_to_cpu(node
->hdr
.count
);
1877 <= be32_to_cpu(btree
->hashval
)) {
1878 cursor
->blkno
= be32_to_cpu(btree
->before
);
1879 trace_xfs_attr_list_node_descend(context
,
1884 if (i
== be16_to_cpu(node
->hdr
.count
)) {
1885 xfs_trans_brelse(NULL
, bp
);
1888 xfs_trans_brelse(NULL
, bp
);
1894 * Roll upward through the blocks, processing each leaf block in
1895 * order. As long as there is space in the result buffer, keep
1896 * adding the information.
1900 error
= xfs_attr_leaf_list_int(bp
, context
);
1902 xfs_trans_brelse(NULL
, bp
);
1905 if (context
->seen_enough
|| leaf
->hdr
.info
.forw
== 0)
1907 cursor
->blkno
= be32_to_cpu(leaf
->hdr
.info
.forw
);
1908 xfs_trans_brelse(NULL
, bp
);
1909 error
= xfs_attr_leaf_read(NULL
, context
->dp
, cursor
->blkno
, -1,
1914 xfs_trans_brelse(NULL
, bp
);
1919 /*========================================================================
1920 * External routines for manipulating out-of-line attribute values.
1921 *========================================================================*/
1924 * Read the value associated with an attribute from the out-of-line buffer
1925 * that we stored it in.
1928 xfs_attr_rmtval_get(xfs_da_args_t
*args
)
1930 xfs_bmbt_irec_t map
[ATTR_RMTVALUE_MAPSIZE
];
1935 int nmap
, error
, tmp
, valuelen
, blkcnt
, i
;
1938 trace_xfs_attr_rmtval_get(args
);
1940 ASSERT(!(args
->flags
& ATTR_KERNOVAL
));
1942 mp
= args
->dp
->i_mount
;
1944 valuelen
= args
->valuelen
;
1945 lblkno
= args
->rmtblkno
;
1946 while (valuelen
> 0) {
1947 nmap
= ATTR_RMTVALUE_MAPSIZE
;
1948 error
= xfs_bmapi_read(args
->dp
, (xfs_fileoff_t
)lblkno
,
1949 args
->rmtblkcnt
, map
, &nmap
,
1950 XFS_BMAPI_ATTRFORK
);
1955 for (i
= 0; (i
< nmap
) && (valuelen
> 0); i
++) {
1956 ASSERT((map
[i
].br_startblock
!= DELAYSTARTBLOCK
) &&
1957 (map
[i
].br_startblock
!= HOLESTARTBLOCK
));
1958 dblkno
= XFS_FSB_TO_DADDR(mp
, map
[i
].br_startblock
);
1959 blkcnt
= XFS_FSB_TO_BB(mp
, map
[i
].br_blockcount
);
1960 error
= xfs_trans_read_buf(mp
, NULL
, mp
->m_ddev_targp
,
1961 dblkno
, blkcnt
, 0, &bp
, NULL
);
1965 tmp
= min_t(int, valuelen
, BBTOB(bp
->b_length
));
1966 xfs_buf_iomove(bp
, 0, tmp
, dst
, XBRW_READ
);
1971 lblkno
+= map
[i
].br_blockcount
;
1974 ASSERT(valuelen
== 0);
1979 * Write the value associated with an attribute into the out-of-line buffer
1980 * that we have defined for it.
1983 xfs_attr_rmtval_set(xfs_da_args_t
*args
)
1986 xfs_fileoff_t lfileoff
;
1988 xfs_bmbt_irec_t map
;
1993 int blkcnt
, valuelen
, nmap
, error
, tmp
, committed
;
1995 trace_xfs_attr_rmtval_set(args
);
2002 * Find a "hole" in the attribute address space large enough for
2003 * us to drop the new attribute's value into.
2005 blkcnt
= XFS_B_TO_FSB(mp
, args
->valuelen
);
2007 error
= xfs_bmap_first_unused(args
->trans
, args
->dp
, blkcnt
, &lfileoff
,
2012 args
->rmtblkno
= lblkno
= (xfs_dablk_t
)lfileoff
;
2013 args
->rmtblkcnt
= blkcnt
;
2016 * Roll through the "value", allocating blocks on disk as required.
2018 while (blkcnt
> 0) {
2020 * Allocate a single extent, up to the size of the value.
2022 xfs_bmap_init(args
->flist
, args
->firstblock
);
2024 error
= xfs_bmapi_write(args
->trans
, dp
, (xfs_fileoff_t
)lblkno
,
2026 XFS_BMAPI_ATTRFORK
| XFS_BMAPI_METADATA
,
2027 args
->firstblock
, args
->total
, &map
, &nmap
,
2030 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
2036 xfs_bmap_cancel(args
->flist
);
2041 * bmap_finish() may have committed the last trans and started
2042 * a new one. We need the inode to be in all transactions.
2045 xfs_trans_ijoin(args
->trans
, dp
, 0);
2048 ASSERT((map
.br_startblock
!= DELAYSTARTBLOCK
) &&
2049 (map
.br_startblock
!= HOLESTARTBLOCK
));
2050 lblkno
+= map
.br_blockcount
;
2051 blkcnt
-= map
.br_blockcount
;
2054 * Start the next trans in the chain.
2056 error
= xfs_trans_roll(&args
->trans
, dp
);
2062 * Roll through the "value", copying the attribute value to the
2063 * already-allocated blocks. Blocks are written synchronously
2064 * so that we can know they are all on disk before we turn off
2065 * the INCOMPLETE flag.
2067 lblkno
= args
->rmtblkno
;
2068 valuelen
= args
->valuelen
;
2069 while (valuelen
> 0) {
2073 * Try to remember where we decided to put the value.
2075 xfs_bmap_init(args
->flist
, args
->firstblock
);
2077 error
= xfs_bmapi_read(dp
, (xfs_fileoff_t
)lblkno
,
2078 args
->rmtblkcnt
, &map
, &nmap
,
2079 XFS_BMAPI_ATTRFORK
);
2083 ASSERT((map
.br_startblock
!= DELAYSTARTBLOCK
) &&
2084 (map
.br_startblock
!= HOLESTARTBLOCK
));
2086 dblkno
= XFS_FSB_TO_DADDR(mp
, map
.br_startblock
),
2087 blkcnt
= XFS_FSB_TO_BB(mp
, map
.br_blockcount
);
2089 bp
= xfs_buf_get(mp
->m_ddev_targp
, dblkno
, blkcnt
, 0);
2093 buflen
= BBTOB(bp
->b_length
);
2094 tmp
= min_t(int, valuelen
, buflen
);
2095 xfs_buf_iomove(bp
, 0, tmp
, src
, XBRW_WRITE
);
2097 xfs_buf_zero(bp
, tmp
, buflen
- tmp
);
2099 error
= xfs_bwrite(bp
); /* GROT: NOTE: synchronous write */
2106 lblkno
+= map
.br_blockcount
;
2108 ASSERT(valuelen
== 0);
2113 * Remove the value associated with an attribute by deleting the
2114 * out-of-line buffer that it is stored on.
2117 xfs_attr_rmtval_remove(xfs_da_args_t
*args
)
2120 xfs_bmbt_irec_t map
;
2124 int valuelen
, blkcnt
, nmap
, error
, done
, committed
;
2126 trace_xfs_attr_rmtval_remove(args
);
2128 mp
= args
->dp
->i_mount
;
2131 * Roll through the "value", invalidating the attribute value's
2134 lblkno
= args
->rmtblkno
;
2135 valuelen
= args
->rmtblkcnt
;
2136 while (valuelen
> 0) {
2138 * Try to remember where we decided to put the value.
2141 error
= xfs_bmapi_read(args
->dp
, (xfs_fileoff_t
)lblkno
,
2142 args
->rmtblkcnt
, &map
, &nmap
,
2143 XFS_BMAPI_ATTRFORK
);
2147 ASSERT((map
.br_startblock
!= DELAYSTARTBLOCK
) &&
2148 (map
.br_startblock
!= HOLESTARTBLOCK
));
2150 dblkno
= XFS_FSB_TO_DADDR(mp
, map
.br_startblock
),
2151 blkcnt
= XFS_FSB_TO_BB(mp
, map
.br_blockcount
);
2154 * If the "remote" value is in the cache, remove it.
2156 bp
= xfs_incore(mp
->m_ddev_targp
, dblkno
, blkcnt
, XBF_TRYLOCK
);
2163 valuelen
-= map
.br_blockcount
;
2165 lblkno
+= map
.br_blockcount
;
2169 * Keep de-allocating extents until the remote-value region is gone.
2171 lblkno
= args
->rmtblkno
;
2172 blkcnt
= args
->rmtblkcnt
;
2175 xfs_bmap_init(args
->flist
, args
->firstblock
);
2176 error
= xfs_bunmapi(args
->trans
, args
->dp
, lblkno
, blkcnt
,
2177 XFS_BMAPI_ATTRFORK
| XFS_BMAPI_METADATA
,
2178 1, args
->firstblock
, args
->flist
,
2181 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
2187 xfs_bmap_cancel(args
->flist
);
2192 * bmap_finish() may have committed the last trans and started
2193 * a new one. We need the inode to be in all transactions.
2196 xfs_trans_ijoin(args
->trans
, args
->dp
, 0);
2199 * Close out trans and start the next one in the chain.
2201 error
= xfs_trans_roll(&args
->trans
, args
->dp
);