2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
27 #include "xfs_mount.h"
28 #include "xfs_da_format.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_attr_sf.h"
31 #include "xfs_inode.h"
32 #include "xfs_alloc.h"
33 #include "xfs_trans.h"
34 #include "xfs_inode_item.h"
36 #include "xfs_bmap_util.h"
37 #include "xfs_bmap_btree.h"
39 #include "xfs_attr_leaf.h"
40 #include "xfs_attr_remote.h"
41 #include "xfs_error.h"
42 #include "xfs_quota.h"
43 #include "xfs_trans_space.h"
44 #include "xfs_trace.h"
45 #include "xfs_dinode.h"
50 * Provide the external interfaces to manage attribute lists.
53 /*========================================================================
54 * Function prototypes for the kernel.
55 *========================================================================*/
58 * Internal routines when attribute list fits inside the inode.
60 STATIC
int xfs_attr_shortform_addname(xfs_da_args_t
*args
);
63 * Internal routines when attribute list is one block.
65 STATIC
int xfs_attr_leaf_get(xfs_da_args_t
*args
);
66 STATIC
int xfs_attr_leaf_addname(xfs_da_args_t
*args
);
67 STATIC
int xfs_attr_leaf_removename(xfs_da_args_t
*args
);
70 * Internal routines when attribute list is more than one block.
72 STATIC
int xfs_attr_node_get(xfs_da_args_t
*args
);
73 STATIC
int xfs_attr_node_addname(xfs_da_args_t
*args
);
74 STATIC
int xfs_attr_node_removename(xfs_da_args_t
*args
);
75 STATIC
int xfs_attr_fillstate(xfs_da_state_t
*state
);
76 STATIC
int xfs_attr_refillstate(xfs_da_state_t
*state
);
80 xfs_attr_name_to_xname(
81 struct xfs_name
*xname
,
82 const unsigned char *aname
)
87 xname
->len
= strlen((char *)aname
);
88 if (xname
->len
>= MAXNAMELEN
)
89 return EFAULT
; /* match IRIX behaviour */
98 if (!XFS_IFORK_Q(ip
) ||
99 (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
&&
100 ip
->i_d
.di_anextents
== 0))
105 /*========================================================================
106 * Overall external interface routines.
107 *========================================================================*/
111 struct xfs_inode
*ip
,
112 struct xfs_name
*name
,
113 unsigned char *value
,
120 if (!xfs_inode_hasattr(ip
))
124 * Fill in the arg structure for this request.
126 memset((char *)&args
, 0, sizeof(args
));
127 args
.name
= name
->name
;
128 args
.namelen
= name
->len
;
130 args
.valuelen
= *valuelenp
;
132 args
.hashval
= xfs_da_hashname(args
.name
, args
.namelen
);
134 args
.whichfork
= XFS_ATTR_FORK
;
137 * Decide on what work routines to call based on the inode size.
139 if (ip
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
140 error
= xfs_attr_shortform_getvalue(&args
);
141 } else if (xfs_bmap_one_block(ip
, XFS_ATTR_FORK
)) {
142 error
= xfs_attr_leaf_get(&args
);
144 error
= xfs_attr_node_get(&args
);
148 * Return the number of bytes in the value to the caller.
150 *valuelenp
= args
.valuelen
;
160 const unsigned char *name
,
161 unsigned char *value
,
166 struct xfs_name xname
;
169 XFS_STATS_INC(xs_attr_get
);
171 if (XFS_FORCED_SHUTDOWN(ip
->i_mount
))
174 error
= xfs_attr_name_to_xname(&xname
, name
);
178 lock_mode
= xfs_ilock_attr_map_shared(ip
);
179 error
= xfs_attr_get_int(ip
, &xname
, value
, valuelenp
, flags
);
180 xfs_iunlock(ip
, lock_mode
);
185 * Calculate how many blocks we need for the new attribute,
189 struct xfs_inode
*ip
,
194 struct xfs_mount
*mp
= ip
->i_mount
;
199 * Determine space new attribute will use, and if it would be
200 * "local" or "remote" (note: local != inline).
202 size
= xfs_attr_leaf_newentsize(namelen
, valuelen
,
203 mp
->m_sb
.sb_blocksize
, local
);
205 nblks
= XFS_DAENTER_SPACE_RES(mp
, XFS_ATTR_FORK
);
207 if (size
> (mp
->m_sb
.sb_blocksize
>> 1)) {
208 /* Double split possible */
213 * Out of line attribute, cannot double split, but
214 * make room for the attribute value itself.
216 uint dblocks
= xfs_attr3_rmt_blocks(mp
, valuelen
);
218 nblks
+= XFS_NEXTENTADD_SPACE_RES(mp
, dblocks
, XFS_ATTR_FORK
);
226 struct xfs_inode
*dp
,
227 struct xfs_name
*name
,
228 unsigned char *value
,
233 xfs_fsblock_t firstblock
;
234 xfs_bmap_free_t flist
;
235 int error
, err2
, committed
;
236 struct xfs_mount
*mp
= dp
->i_mount
;
237 struct xfs_trans_res tres
;
238 int rsvd
= (flags
& ATTR_ROOT
) != 0;
242 * Attach the dquots to the inode.
244 error
= xfs_qm_dqattach(dp
, 0);
249 * If the inode doesn't have an attribute fork, add one.
250 * (inode must not be locked when we call this routine)
252 if (XFS_IFORK_Q(dp
) == 0) {
253 int sf_size
= sizeof(xfs_attr_sf_hdr_t
) +
254 XFS_ATTR_SF_ENTSIZE_BYNAME(name
->len
, valuelen
);
256 if ((error
= xfs_bmap_add_attrfork(dp
, sf_size
, rsvd
)))
261 * Fill in the arg structure for this request.
263 memset((char *)&args
, 0, sizeof(args
));
264 args
.name
= name
->name
;
265 args
.namelen
= name
->len
;
267 args
.valuelen
= valuelen
;
269 args
.hashval
= xfs_da_hashname(args
.name
, args
.namelen
);
271 args
.firstblock
= &firstblock
;
273 args
.whichfork
= XFS_ATTR_FORK
;
274 args
.op_flags
= XFS_DA_OP_ADDNAME
| XFS_DA_OP_OKNOENT
;
276 /* Size is now blocks for attribute data */
277 args
.total
= xfs_attr_calc_size(dp
, name
->len
, valuelen
, &local
);
280 * Start our first transaction of the day.
282 * All future transactions during this code must be "chained" off
283 * this one via the trans_dup() call. All transactions will contain
284 * the inode, and the inode will always be marked with trans_ihold().
285 * Since the inode will be locked in all transactions, we must log
286 * the inode in every transaction to let it float upward through
289 args
.trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTR_SET
);
292 * Root fork attributes can use reserved data blocks for this
293 * operation if necessary
297 args
.trans
->t_flags
|= XFS_TRANS_RESERVE
;
299 tres
.tr_logres
= M_RES(mp
)->tr_attrsetm
.tr_logres
+
300 M_RES(mp
)->tr_attrsetrt
.tr_logres
* args
.total
;
301 tres
.tr_logcount
= XFS_ATTRSET_LOG_COUNT
;
302 tres
.tr_logflags
= XFS_TRANS_PERM_LOG_RES
;
303 error
= xfs_trans_reserve(args
.trans
, &tres
, args
.total
, 0);
305 xfs_trans_cancel(args
.trans
, 0);
308 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
310 error
= xfs_trans_reserve_quota_nblks(args
.trans
, dp
, args
.total
, 0,
311 rsvd
? XFS_QMOPT_RES_REGBLKS
| XFS_QMOPT_FORCE_RES
:
312 XFS_QMOPT_RES_REGBLKS
);
314 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
315 xfs_trans_cancel(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
319 xfs_trans_ijoin(args
.trans
, dp
, 0);
322 * If the attribute list is non-existent or a shortform list,
323 * upgrade it to a single-leaf-block attribute list.
325 if ((dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) ||
326 ((dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
) &&
327 (dp
->i_d
.di_anextents
== 0))) {
330 * Build initial attribute list (if required).
332 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
)
333 xfs_attr_shortform_create(&args
);
336 * Try to add the attr to the attribute list in
339 error
= xfs_attr_shortform_addname(&args
);
340 if (error
!= ENOSPC
) {
342 * Commit the shortform mods, and we're done.
343 * NOTE: this is also the error path (EEXIST, etc).
345 ASSERT(args
.trans
!= NULL
);
348 * If this is a synchronous mount, make sure that
349 * the transaction goes to disk before returning
352 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
353 xfs_trans_set_sync(args
.trans
);
356 if (!error
&& (flags
& ATTR_KERNOTIME
) == 0) {
357 xfs_trans_ichgtime(args
.trans
, dp
,
360 err2
= xfs_trans_commit(args
.trans
,
361 XFS_TRANS_RELEASE_LOG_RES
);
362 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
364 return(error
== 0 ? err2
: error
);
368 * It won't fit in the shortform, transform to a leaf block.
369 * GROT: another possible req'mt for a double-split btree op.
371 xfs_bmap_init(args
.flist
, args
.firstblock
);
372 error
= xfs_attr_shortform_to_leaf(&args
);
374 error
= xfs_bmap_finish(&args
.trans
, args
.flist
,
380 xfs_bmap_cancel(&flist
);
385 * bmap_finish() may have committed the last trans and started
386 * a new one. We need the inode to be in all transactions.
389 xfs_trans_ijoin(args
.trans
, dp
, 0);
392 * Commit the leaf transformation. We'll need another (linked)
393 * transaction to add the new attribute to the leaf.
396 error
= xfs_trans_roll(&args
.trans
, dp
);
402 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
403 error
= xfs_attr_leaf_addname(&args
);
405 error
= xfs_attr_node_addname(&args
);
412 * If this is a synchronous mount, make sure that the
413 * transaction goes to disk before returning to the user.
415 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
416 xfs_trans_set_sync(args
.trans
);
419 if ((flags
& ATTR_KERNOTIME
) == 0)
420 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
423 * Commit the last in the sequence of transactions.
425 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
426 error
= xfs_trans_commit(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
427 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
433 xfs_trans_cancel(args
.trans
,
434 XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
435 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
442 const unsigned char *name
,
443 unsigned char *value
,
448 struct xfs_name xname
;
450 XFS_STATS_INC(xs_attr_set
);
452 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
455 error
= xfs_attr_name_to_xname(&xname
, name
);
459 return xfs_attr_set_int(dp
, &xname
, value
, valuelen
, flags
);
463 * Generic handler routine to remove a name from an attribute list.
464 * Transitions attribute list from Btree to shortform as necessary.
467 xfs_attr_remove_int(xfs_inode_t
*dp
, struct xfs_name
*name
, int flags
)
470 xfs_fsblock_t firstblock
;
471 xfs_bmap_free_t flist
;
473 xfs_mount_t
*mp
= dp
->i_mount
;
476 * Fill in the arg structure for this request.
478 memset((char *)&args
, 0, sizeof(args
));
479 args
.name
= name
->name
;
480 args
.namelen
= name
->len
;
482 args
.hashval
= xfs_da_hashname(args
.name
, args
.namelen
);
484 args
.firstblock
= &firstblock
;
487 args
.whichfork
= XFS_ATTR_FORK
;
490 * we have no control over the attribute names that userspace passes us
491 * to remove, so we have to allow the name lookup prior to attribute
494 args
.op_flags
= XFS_DA_OP_OKNOENT
;
497 * Attach the dquots to the inode.
499 error
= xfs_qm_dqattach(dp
, 0);
504 * Start our first transaction of the day.
506 * All future transactions during this code must be "chained" off
507 * this one via the trans_dup() call. All transactions will contain
508 * the inode, and the inode will always be marked with trans_ihold().
509 * Since the inode will be locked in all transactions, we must log
510 * the inode in every transaction to let it float upward through
513 args
.trans
= xfs_trans_alloc(mp
, XFS_TRANS_ATTR_RM
);
516 * Root fork attributes can use reserved data blocks for this
517 * operation if necessary
520 if (flags
& ATTR_ROOT
)
521 args
.trans
->t_flags
|= XFS_TRANS_RESERVE
;
523 error
= xfs_trans_reserve(args
.trans
, &M_RES(mp
)->tr_attrrm
,
524 XFS_ATTRRM_SPACE_RES(mp
), 0);
526 xfs_trans_cancel(args
.trans
, 0);
530 xfs_ilock(dp
, XFS_ILOCK_EXCL
);
532 * No need to make quota reservations here. We expect to release some
533 * blocks not allocate in the common case.
535 xfs_trans_ijoin(args
.trans
, dp
, 0);
538 * Decide on what work routines to call based on the inode size.
540 if (!xfs_inode_hasattr(dp
)) {
541 error
= XFS_ERROR(ENOATTR
);
544 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_LOCAL
) {
545 ASSERT(dp
->i_afp
->if_flags
& XFS_IFINLINE
);
546 error
= xfs_attr_shortform_remove(&args
);
550 } else if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
551 error
= xfs_attr_leaf_removename(&args
);
553 error
= xfs_attr_node_removename(&args
);
560 * If this is a synchronous mount, make sure that the
561 * transaction goes to disk before returning to the user.
563 if (mp
->m_flags
& XFS_MOUNT_WSYNC
) {
564 xfs_trans_set_sync(args
.trans
);
567 if ((flags
& ATTR_KERNOTIME
) == 0)
568 xfs_trans_ichgtime(args
.trans
, dp
, XFS_ICHGTIME_CHG
);
571 * Commit the last in the sequence of transactions.
573 xfs_trans_log_inode(args
.trans
, dp
, XFS_ILOG_CORE
);
574 error
= xfs_trans_commit(args
.trans
, XFS_TRANS_RELEASE_LOG_RES
);
575 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
581 xfs_trans_cancel(args
.trans
,
582 XFS_TRANS_RELEASE_LOG_RES
|XFS_TRANS_ABORT
);
583 xfs_iunlock(dp
, XFS_ILOCK_EXCL
);
590 const unsigned char *name
,
594 struct xfs_name xname
;
596 XFS_STATS_INC(xs_attr_remove
);
598 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
601 error
= xfs_attr_name_to_xname(&xname
, name
);
605 xfs_ilock(dp
, XFS_ILOCK_SHARED
);
606 if (!xfs_inode_hasattr(dp
)) {
607 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
608 return XFS_ERROR(ENOATTR
);
610 xfs_iunlock(dp
, XFS_ILOCK_SHARED
);
612 return xfs_attr_remove_int(dp
, &xname
, flags
);
616 /*========================================================================
617 * External routines when attribute list is inside the inode
618 *========================================================================*/
621 * Add a name to the shortform attribute list structure
622 * This is the external routine.
625 xfs_attr_shortform_addname(xfs_da_args_t
*args
)
627 int newsize
, forkoff
, retval
;
629 trace_xfs_attr_sf_addname(args
);
631 retval
= xfs_attr_shortform_lookup(args
);
632 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
634 } else if (retval
== EEXIST
) {
635 if (args
->flags
& ATTR_CREATE
)
637 retval
= xfs_attr_shortform_remove(args
);
641 if (args
->namelen
>= XFS_ATTR_SF_ENTSIZE_MAX
||
642 args
->valuelen
>= XFS_ATTR_SF_ENTSIZE_MAX
)
643 return(XFS_ERROR(ENOSPC
));
645 newsize
= XFS_ATTR_SF_TOTSIZE(args
->dp
);
646 newsize
+= XFS_ATTR_SF_ENTSIZE_BYNAME(args
->namelen
, args
->valuelen
);
648 forkoff
= xfs_attr_shortform_bytesfit(args
->dp
, newsize
);
650 return(XFS_ERROR(ENOSPC
));
652 xfs_attr_shortform_add(args
, forkoff
);
657 /*========================================================================
658 * External routines when attribute list is one block
659 *========================================================================*/
662 * Add a name to the leaf attribute list structure
664 * This leaf block cannot have a "remote" value, we only call this routine
665 * if bmap_one_block() says there is only one block (ie: no remote blks).
668 xfs_attr_leaf_addname(xfs_da_args_t
*args
)
672 int retval
, error
, committed
, forkoff
;
674 trace_xfs_attr_leaf_addname(args
);
677 * Read the (only) block in the attribute list in.
681 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
686 * Look up the given attribute in the leaf block. Figure out if
687 * the given flags produce an error or call for an atomic rename.
689 retval
= xfs_attr3_leaf_lookup_int(bp
, args
);
690 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
691 xfs_trans_brelse(args
->trans
, bp
);
693 } else if (retval
== EEXIST
) {
694 if (args
->flags
& ATTR_CREATE
) { /* pure create op */
695 xfs_trans_brelse(args
->trans
, bp
);
699 trace_xfs_attr_leaf_replace(args
);
701 /* save the attribute state for later removal*/
702 args
->op_flags
|= XFS_DA_OP_RENAME
; /* an atomic rename */
703 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
704 args
->index2
= args
->index
;
705 args
->rmtblkno2
= args
->rmtblkno
;
706 args
->rmtblkcnt2
= args
->rmtblkcnt
;
707 args
->rmtvaluelen2
= args
->rmtvaluelen
;
710 * clear the remote attr state now that it is saved so that the
711 * values reflect the state of the attribute we are about to
712 * add, not the attribute we just found and will remove later.
716 args
->rmtvaluelen
= 0;
720 * Add the attribute to the leaf block, transitioning to a Btree
723 retval
= xfs_attr3_leaf_add(bp
, args
);
724 if (retval
== ENOSPC
) {
726 * Promote the attribute list to the Btree format, then
727 * Commit that transaction so that the node_addname() call
728 * can manage its own transactions.
730 xfs_bmap_init(args
->flist
, args
->firstblock
);
731 error
= xfs_attr3_leaf_to_node(args
);
733 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
739 xfs_bmap_cancel(args
->flist
);
744 * bmap_finish() may have committed the last trans and started
745 * a new one. We need the inode to be in all transactions.
748 xfs_trans_ijoin(args
->trans
, dp
, 0);
751 * Commit the current trans (including the inode) and start
754 error
= xfs_trans_roll(&args
->trans
, dp
);
759 * Fob the whole rest of the problem off on the Btree code.
761 error
= xfs_attr_node_addname(args
);
766 * Commit the transaction that added the attr name so that
767 * later routines can manage their own transactions.
769 error
= xfs_trans_roll(&args
->trans
, dp
);
774 * If there was an out-of-line value, allocate the blocks we
775 * identified for its storage and copy the value. This is done
776 * after we create the attribute so that we don't overflow the
777 * maximum size of a transaction and/or hit a deadlock.
779 if (args
->rmtblkno
> 0) {
780 error
= xfs_attr_rmtval_set(args
);
786 * If this is an atomic rename operation, we must "flip" the
787 * incomplete flags on the "new" and "old" attribute/value pairs
788 * so that one disappears and one appears atomically. Then we
789 * must remove the "old" attribute/value pair.
791 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
793 * In a separate transaction, set the incomplete flag on the
794 * "old" attr and clear the incomplete flag on the "new" attr.
796 error
= xfs_attr3_leaf_flipflags(args
);
801 * Dismantle the "old" attribute/value pair by removing
802 * a "remote" value (if it exists).
804 args
->index
= args
->index2
;
805 args
->blkno
= args
->blkno2
;
806 args
->rmtblkno
= args
->rmtblkno2
;
807 args
->rmtblkcnt
= args
->rmtblkcnt2
;
808 args
->rmtvaluelen
= args
->rmtvaluelen2
;
809 if (args
->rmtblkno
) {
810 error
= xfs_attr_rmtval_remove(args
);
816 * Read in the block containing the "old" attr, then
817 * remove the "old" attr from that block (neat, huh!)
819 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
,
824 xfs_attr3_leaf_remove(bp
, args
);
827 * If the result is small enough, shrink it all into the inode.
829 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
830 xfs_bmap_init(args
->flist
, args
->firstblock
);
831 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
832 /* bp is gone due to xfs_da_shrink_inode */
834 error
= xfs_bmap_finish(&args
->trans
,
841 xfs_bmap_cancel(args
->flist
);
846 * bmap_finish() may have committed the last trans
847 * and started a new one. We need the inode to be
848 * in all transactions.
851 xfs_trans_ijoin(args
->trans
, dp
, 0);
855 * Commit the remove and start the next trans in series.
857 error
= xfs_trans_roll(&args
->trans
, dp
);
859 } else if (args
->rmtblkno
> 0) {
861 * Added a "remote" value, just clear the incomplete flag.
863 error
= xfs_attr3_leaf_clearflag(args
);
869 * Remove a name from the leaf attribute list structure
871 * This leaf block cannot have a "remote" value, we only call this routine
872 * if bmap_one_block() says there is only one block (ie: no remote blks).
875 xfs_attr_leaf_removename(xfs_da_args_t
*args
)
879 int error
, committed
, forkoff
;
881 trace_xfs_attr_leaf_removename(args
);
884 * Remove the attribute.
888 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
892 error
= xfs_attr3_leaf_lookup_int(bp
, args
);
893 if (error
== ENOATTR
) {
894 xfs_trans_brelse(args
->trans
, bp
);
898 xfs_attr3_leaf_remove(bp
, args
);
901 * If the result is small enough, shrink it all into the inode.
903 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
904 xfs_bmap_init(args
->flist
, args
->firstblock
);
905 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
906 /* bp is gone due to xfs_da_shrink_inode */
908 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
914 xfs_bmap_cancel(args
->flist
);
919 * bmap_finish() may have committed the last trans and started
920 * a new one. We need the inode to be in all transactions.
923 xfs_trans_ijoin(args
->trans
, dp
, 0);
929 * Look up a name in a leaf attribute list structure.
931 * This leaf block cannot have a "remote" value, we only call this routine
932 * if bmap_one_block() says there is only one block (ie: no remote blks).
935 xfs_attr_leaf_get(xfs_da_args_t
*args
)
940 trace_xfs_attr_leaf_get(args
);
943 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
947 error
= xfs_attr3_leaf_lookup_int(bp
, args
);
948 if (error
!= EEXIST
) {
949 xfs_trans_brelse(args
->trans
, bp
);
952 error
= xfs_attr3_leaf_getvalue(bp
, args
);
953 xfs_trans_brelse(args
->trans
, bp
);
954 if (!error
&& (args
->rmtblkno
> 0) && !(args
->flags
& ATTR_KERNOVAL
)) {
955 error
= xfs_attr_rmtval_get(args
);
960 /*========================================================================
961 * External routines when attribute list size > XFS_LBSIZE(mp).
962 *========================================================================*/
965 * Add a name to a Btree-format attribute list.
967 * This will involve walking down the Btree, and may involve splitting
968 * leaf nodes and even splitting intermediate nodes up to and including
969 * the root node (a special case of an intermediate node).
971 * "Remote" attribute values confuse the issue and atomic rename operations
972 * add a whole extra layer of confusion on top of that.
975 xfs_attr_node_addname(xfs_da_args_t
*args
)
977 xfs_da_state_t
*state
;
978 xfs_da_state_blk_t
*blk
;
981 int committed
, retval
, error
;
983 trace_xfs_attr_node_addname(args
);
986 * Fill in bucket of arguments/results/context to carry around.
991 state
= xfs_da_state_alloc();
994 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
995 state
->node_ents
= state
->mp
->m_attr_node_ents
;
998 * Search to see if name already exists, and get back a pointer
999 * to where it should go.
1001 error
= xfs_da3_node_lookup_int(state
, &retval
);
1004 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1005 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1006 if ((args
->flags
& ATTR_REPLACE
) && (retval
== ENOATTR
)) {
1008 } else if (retval
== EEXIST
) {
1009 if (args
->flags
& ATTR_CREATE
)
1012 trace_xfs_attr_node_replace(args
);
1014 /* save the attribute state for later removal*/
1015 args
->op_flags
|= XFS_DA_OP_RENAME
; /* atomic rename op */
1016 args
->blkno2
= args
->blkno
; /* set 2nd entry info*/
1017 args
->index2
= args
->index
;
1018 args
->rmtblkno2
= args
->rmtblkno
;
1019 args
->rmtblkcnt2
= args
->rmtblkcnt
;
1020 args
->rmtvaluelen2
= args
->rmtvaluelen
;
1023 * clear the remote attr state now that it is saved so that the
1024 * values reflect the state of the attribute we are about to
1025 * add, not the attribute we just found and will remove later.
1028 args
->rmtblkcnt
= 0;
1029 args
->rmtvaluelen
= 0;
1032 retval
= xfs_attr3_leaf_add(blk
->bp
, state
->args
);
1033 if (retval
== ENOSPC
) {
1034 if (state
->path
.active
== 1) {
1036 * Its really a single leaf node, but it had
1037 * out-of-line values so it looked like it *might*
1038 * have been a b-tree.
1040 xfs_da_state_free(state
);
1042 xfs_bmap_init(args
->flist
, args
->firstblock
);
1043 error
= xfs_attr3_leaf_to_node(args
);
1045 error
= xfs_bmap_finish(&args
->trans
,
1052 xfs_bmap_cancel(args
->flist
);
1057 * bmap_finish() may have committed the last trans
1058 * and started a new one. We need the inode to be
1059 * in all transactions.
1062 xfs_trans_ijoin(args
->trans
, dp
, 0);
1065 * Commit the node conversion and start the next
1066 * trans in the chain.
1068 error
= xfs_trans_roll(&args
->trans
, dp
);
1076 * Split as many Btree elements as required.
1077 * This code tracks the new and old attr's location
1078 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1079 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1081 xfs_bmap_init(args
->flist
, args
->firstblock
);
1082 error
= xfs_da3_split(state
);
1084 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1090 xfs_bmap_cancel(args
->flist
);
1095 * bmap_finish() may have committed the last trans and started
1096 * a new one. We need the inode to be in all transactions.
1099 xfs_trans_ijoin(args
->trans
, dp
, 0);
1102 * Addition succeeded, update Btree hashvals.
1104 xfs_da3_fixhashpath(state
, &state
->path
);
1108 * Kill the state structure, we're done with it and need to
1109 * allow the buffers to come back later.
1111 xfs_da_state_free(state
);
1115 * Commit the leaf addition or btree split and start the next
1116 * trans in the chain.
1118 error
= xfs_trans_roll(&args
->trans
, dp
);
1123 * If there was an out-of-line value, allocate the blocks we
1124 * identified for its storage and copy the value. This is done
1125 * after we create the attribute so that we don't overflow the
1126 * maximum size of a transaction and/or hit a deadlock.
1128 if (args
->rmtblkno
> 0) {
1129 error
= xfs_attr_rmtval_set(args
);
1135 * If this is an atomic rename operation, we must "flip" the
1136 * incomplete flags on the "new" and "old" attribute/value pairs
1137 * so that one disappears and one appears atomically. Then we
1138 * must remove the "old" attribute/value pair.
1140 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
1142 * In a separate transaction, set the incomplete flag on the
1143 * "old" attr and clear the incomplete flag on the "new" attr.
1145 error
= xfs_attr3_leaf_flipflags(args
);
1150 * Dismantle the "old" attribute/value pair by removing
1151 * a "remote" value (if it exists).
1153 args
->index
= args
->index2
;
1154 args
->blkno
= args
->blkno2
;
1155 args
->rmtblkno
= args
->rmtblkno2
;
1156 args
->rmtblkcnt
= args
->rmtblkcnt2
;
1157 args
->rmtvaluelen
= args
->rmtvaluelen2
;
1158 if (args
->rmtblkno
) {
1159 error
= xfs_attr_rmtval_remove(args
);
1165 * Re-find the "old" attribute entry after any split ops.
1166 * The INCOMPLETE flag means that we will find the "old"
1167 * attr, not the "new" one.
1169 args
->flags
|= XFS_ATTR_INCOMPLETE
;
1170 state
= xfs_da_state_alloc();
1173 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1174 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1176 error
= xfs_da3_node_lookup_int(state
, &retval
);
1181 * Remove the name and update the hashvals in the tree.
1183 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1184 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1185 error
= xfs_attr3_leaf_remove(blk
->bp
, args
);
1186 xfs_da3_fixhashpath(state
, &state
->path
);
1189 * Check to see if the tree needs to be collapsed.
1191 if (retval
&& (state
->path
.active
> 1)) {
1192 xfs_bmap_init(args
->flist
, args
->firstblock
);
1193 error
= xfs_da3_join(state
);
1195 error
= xfs_bmap_finish(&args
->trans
,
1202 xfs_bmap_cancel(args
->flist
);
1207 * bmap_finish() may have committed the last trans
1208 * and started a new one. We need the inode to be
1209 * in all transactions.
1212 xfs_trans_ijoin(args
->trans
, dp
, 0);
1216 * Commit and start the next trans in the chain.
1218 error
= xfs_trans_roll(&args
->trans
, dp
);
1222 } else if (args
->rmtblkno
> 0) {
1224 * Added a "remote" value, just clear the incomplete flag.
1226 error
= xfs_attr3_leaf_clearflag(args
);
1234 xfs_da_state_free(state
);
1241 * Remove a name from a B-tree attribute list.
1243 * This will involve walking down the Btree, and may involve joining
1244 * leaf nodes and even joining intermediate nodes up to and including
1245 * the root node (a special case of an intermediate node).
1248 xfs_attr_node_removename(xfs_da_args_t
*args
)
1250 xfs_da_state_t
*state
;
1251 xfs_da_state_blk_t
*blk
;
1254 int retval
, error
, committed
, forkoff
;
1256 trace_xfs_attr_node_removename(args
);
1259 * Tie a string around our finger to remind us where we are.
1262 state
= xfs_da_state_alloc();
1264 state
->mp
= dp
->i_mount
;
1265 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1266 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1269 * Search to see if name exists, and get back a pointer to it.
1271 error
= xfs_da3_node_lookup_int(state
, &retval
);
1272 if (error
|| (retval
!= EEXIST
)) {
1279 * If there is an out-of-line value, de-allocate the blocks.
1280 * This is done before we remove the attribute so that we don't
1281 * overflow the maximum size of a transaction and/or hit a deadlock.
1283 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1284 ASSERT(blk
->bp
!= NULL
);
1285 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1286 if (args
->rmtblkno
> 0) {
1288 * Fill in disk block numbers in the state structure
1289 * so that we can get the buffers back after we commit
1290 * several transactions in the following calls.
1292 error
= xfs_attr_fillstate(state
);
1297 * Mark the attribute as INCOMPLETE, then bunmapi() the
1300 error
= xfs_attr3_leaf_setflag(args
);
1303 error
= xfs_attr_rmtval_remove(args
);
1308 * Refill the state structure with buffers, the prior calls
1309 * released our buffers.
1311 error
= xfs_attr_refillstate(state
);
1317 * Remove the name and update the hashvals in the tree.
1319 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1320 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1321 retval
= xfs_attr3_leaf_remove(blk
->bp
, args
);
1322 xfs_da3_fixhashpath(state
, &state
->path
);
1325 * Check to see if the tree needs to be collapsed.
1327 if (retval
&& (state
->path
.active
> 1)) {
1328 xfs_bmap_init(args
->flist
, args
->firstblock
);
1329 error
= xfs_da3_join(state
);
1331 error
= xfs_bmap_finish(&args
->trans
, args
->flist
,
1337 xfs_bmap_cancel(args
->flist
);
1342 * bmap_finish() may have committed the last trans and started
1343 * a new one. We need the inode to be in all transactions.
1346 xfs_trans_ijoin(args
->trans
, dp
, 0);
1349 * Commit the Btree join operation and start a new trans.
1351 error
= xfs_trans_roll(&args
->trans
, dp
);
1357 * If the result is small enough, push it all into the inode.
1359 if (xfs_bmap_one_block(dp
, XFS_ATTR_FORK
)) {
1361 * Have to get rid of the copy of this dabuf in the state.
1363 ASSERT(state
->path
.active
== 1);
1364 ASSERT(state
->path
.blk
[0].bp
);
1365 state
->path
.blk
[0].bp
= NULL
;
1367 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, 0, -1, &bp
);
1371 if ((forkoff
= xfs_attr_shortform_allfit(bp
, dp
))) {
1372 xfs_bmap_init(args
->flist
, args
->firstblock
);
1373 error
= xfs_attr3_leaf_to_shortform(bp
, args
, forkoff
);
1374 /* bp is gone due to xfs_da_shrink_inode */
1376 error
= xfs_bmap_finish(&args
->trans
,
1383 xfs_bmap_cancel(args
->flist
);
1388 * bmap_finish() may have committed the last trans
1389 * and started a new one. We need the inode to be
1390 * in all transactions.
1393 xfs_trans_ijoin(args
->trans
, dp
, 0);
1395 xfs_trans_brelse(args
->trans
, bp
);
1400 xfs_da_state_free(state
);
1405 * Fill in the disk block numbers in the state structure for the buffers
1406 * that are attached to the state structure.
1407 * This is done so that we can quickly reattach ourselves to those buffers
1408 * after some set of transaction commits have released these buffers.
1411 xfs_attr_fillstate(xfs_da_state_t
*state
)
1413 xfs_da_state_path_t
*path
;
1414 xfs_da_state_blk_t
*blk
;
1417 trace_xfs_attr_fillstate(state
->args
);
1420 * Roll down the "path" in the state structure, storing the on-disk
1421 * block number for those buffers in the "path".
1423 path
= &state
->path
;
1424 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1425 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1427 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1430 blk
->disk_blkno
= 0;
1435 * Roll down the "altpath" in the state structure, storing the on-disk
1436 * block number for those buffers in the "altpath".
1438 path
= &state
->altpath
;
1439 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1440 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1442 blk
->disk_blkno
= XFS_BUF_ADDR(blk
->bp
);
1445 blk
->disk_blkno
= 0;
1453 * Reattach the buffers to the state structure based on the disk block
1454 * numbers stored in the state structure.
1455 * This is done after some set of transaction commits have released those
1456 * buffers from our grip.
1459 xfs_attr_refillstate(xfs_da_state_t
*state
)
1461 xfs_da_state_path_t
*path
;
1462 xfs_da_state_blk_t
*blk
;
1465 trace_xfs_attr_refillstate(state
->args
);
1468 * Roll down the "path" in the state structure, storing the on-disk
1469 * block number for those buffers in the "path".
1471 path
= &state
->path
;
1472 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1473 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1474 if (blk
->disk_blkno
) {
1475 error
= xfs_da3_node_read(state
->args
->trans
,
1477 blk
->blkno
, blk
->disk_blkno
,
1478 &blk
->bp
, XFS_ATTR_FORK
);
1487 * Roll down the "altpath" in the state structure, storing the on-disk
1488 * block number for those buffers in the "altpath".
1490 path
= &state
->altpath
;
1491 ASSERT((path
->active
>= 0) && (path
->active
< XFS_DA_NODE_MAXDEPTH
));
1492 for (blk
= path
->blk
, level
= 0; level
< path
->active
; blk
++, level
++) {
1493 if (blk
->disk_blkno
) {
1494 error
= xfs_da3_node_read(state
->args
->trans
,
1496 blk
->blkno
, blk
->disk_blkno
,
1497 &blk
->bp
, XFS_ATTR_FORK
);
1509 * Look up a filename in a node attribute list.
1511 * This routine gets called for any attribute fork that has more than one
1512 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1513 * "remote" values taking up more blocks.
1516 xfs_attr_node_get(xfs_da_args_t
*args
)
1518 xfs_da_state_t
*state
;
1519 xfs_da_state_blk_t
*blk
;
1523 trace_xfs_attr_node_get(args
);
1525 state
= xfs_da_state_alloc();
1527 state
->mp
= args
->dp
->i_mount
;
1528 state
->blocksize
= state
->mp
->m_sb
.sb_blocksize
;
1529 state
->node_ents
= state
->mp
->m_attr_node_ents
;
1532 * Search to see if name exists, and get back a pointer to it.
1534 error
= xfs_da3_node_lookup_int(state
, &retval
);
1537 } else if (retval
== EEXIST
) {
1538 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1539 ASSERT(blk
->bp
!= NULL
);
1540 ASSERT(blk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1543 * Get the value, local or "remote"
1545 retval
= xfs_attr3_leaf_getvalue(blk
->bp
, args
);
1546 if (!retval
&& (args
->rmtblkno
> 0)
1547 && !(args
->flags
& ATTR_KERNOVAL
)) {
1548 retval
= xfs_attr_rmtval_get(args
);
1553 * If not in a transaction, we have to release all the buffers.
1555 for (i
= 0; i
< state
->path
.active
; i
++) {
1556 xfs_trans_brelse(args
->trans
, state
->path
.blk
[i
].bp
);
1557 state
->path
.blk
[i
].bp
= NULL
;
1560 xfs_da_state_free(state
);