mmc: sdhci-of-arasan: Add the support for sdhci-5.1
[linux/fpc-iii.git] / fs / xfs / libxfs / xfs_attr.c
blob3349c9a1e84569201cb5df93ae39dd1941f72209
1 /*
2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
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
18 #include "xfs.h"
19 #include "xfs_fs.h"
20 #include "xfs_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
24 #include "xfs_bit.h"
25 #include "xfs_mount.h"
26 #include "xfs_da_format.h"
27 #include "xfs_da_btree.h"
28 #include "xfs_attr_sf.h"
29 #include "xfs_inode.h"
30 #include "xfs_alloc.h"
31 #include "xfs_trans.h"
32 #include "xfs_inode_item.h"
33 #include "xfs_bmap.h"
34 #include "xfs_bmap_util.h"
35 #include "xfs_bmap_btree.h"
36 #include "xfs_attr.h"
37 #include "xfs_attr_leaf.h"
38 #include "xfs_attr_remote.h"
39 #include "xfs_error.h"
40 #include "xfs_quota.h"
41 #include "xfs_trans_space.h"
42 #include "xfs_trace.h"
45 * xfs_attr.c
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);
67 * Internal routines when attribute list is more than one block.
69 STATIC int xfs_attr_node_get(xfs_da_args_t *args);
70 STATIC int xfs_attr_node_addname(xfs_da_args_t *args);
71 STATIC int xfs_attr_node_removename(xfs_da_args_t *args);
72 STATIC int xfs_attr_fillstate(xfs_da_state_t *state);
73 STATIC int xfs_attr_refillstate(xfs_da_state_t *state);
76 STATIC int
77 xfs_attr_args_init(
78 struct xfs_da_args *args,
79 struct xfs_inode *dp,
80 const unsigned char *name,
81 int flags)
84 if (!name)
85 return -EINVAL;
87 memset(args, 0, sizeof(*args));
88 args->geo = dp->i_mount->m_attr_geo;
89 args->whichfork = XFS_ATTR_FORK;
90 args->dp = dp;
91 args->flags = flags;
92 args->name = name;
93 args->namelen = strlen((const char *)name);
94 if (args->namelen >= MAXNAMELEN)
95 return -EFAULT; /* match IRIX behaviour */
97 args->hashval = xfs_da_hashname(args->name, args->namelen);
98 return 0;
102 xfs_inode_hasattr(
103 struct xfs_inode *ip)
105 if (!XFS_IFORK_Q(ip) ||
106 (ip->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS &&
107 ip->i_d.di_anextents == 0))
108 return 0;
109 return 1;
112 /*========================================================================
113 * Overall external interface routines.
114 *========================================================================*/
117 xfs_attr_get(
118 struct xfs_inode *ip,
119 const unsigned char *name,
120 unsigned char *value,
121 int *valuelenp,
122 int flags)
124 struct xfs_da_args args;
125 uint lock_mode;
126 int error;
128 XFS_STATS_INC(xs_attr_get);
130 if (XFS_FORCED_SHUTDOWN(ip->i_mount))
131 return -EIO;
133 if (!xfs_inode_hasattr(ip))
134 return -ENOATTR;
136 error = xfs_attr_args_init(&args, ip, name, flags);
137 if (error)
138 return error;
140 args.value = value;
141 args.valuelen = *valuelenp;
143 lock_mode = xfs_ilock_attr_map_shared(ip);
144 if (!xfs_inode_hasattr(ip))
145 error = -ENOATTR;
146 else if (ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL)
147 error = xfs_attr_shortform_getvalue(&args);
148 else if (xfs_bmap_one_block(ip, XFS_ATTR_FORK))
149 error = xfs_attr_leaf_get(&args);
150 else
151 error = xfs_attr_node_get(&args);
152 xfs_iunlock(ip, lock_mode);
154 *valuelenp = args.valuelen;
155 return error == -EEXIST ? 0 : error;
159 * Calculate how many blocks we need for the new attribute,
161 STATIC int
162 xfs_attr_calc_size(
163 struct xfs_da_args *args,
164 int *local)
166 struct xfs_mount *mp = args->dp->i_mount;
167 int size;
168 int nblks;
171 * Determine space new attribute will use, and if it would be
172 * "local" or "remote" (note: local != inline).
174 size = xfs_attr_leaf_newentsize(args, local);
175 nblks = XFS_DAENTER_SPACE_RES(mp, XFS_ATTR_FORK);
176 if (*local) {
177 if (size > (args->geo->blksize / 2)) {
178 /* Double split possible */
179 nblks *= 2;
181 } else {
183 * Out of line attribute, cannot double split, but
184 * make room for the attribute value itself.
186 uint dblocks = xfs_attr3_rmt_blocks(mp, args->valuelen);
187 nblks += dblocks;
188 nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK);
191 return nblks;
195 xfs_attr_set(
196 struct xfs_inode *dp,
197 const unsigned char *name,
198 unsigned char *value,
199 int valuelen,
200 int flags)
202 struct xfs_mount *mp = dp->i_mount;
203 struct xfs_da_args args;
204 struct xfs_bmap_free flist;
205 struct xfs_trans_res tres;
206 xfs_fsblock_t firstblock;
207 int rsvd = (flags & ATTR_ROOT) != 0;
208 int error, err2, committed, local;
210 XFS_STATS_INC(xs_attr_set);
212 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
213 return -EIO;
215 error = xfs_attr_args_init(&args, dp, name, flags);
216 if (error)
217 return error;
219 args.value = value;
220 args.valuelen = valuelen;
221 args.firstblock = &firstblock;
222 args.flist = &flist;
223 args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
224 args.total = xfs_attr_calc_size(&args, &local);
226 error = xfs_qm_dqattach(dp, 0);
227 if (error)
228 return error;
231 * If the inode doesn't have an attribute fork, add one.
232 * (inode must not be locked when we call this routine)
234 if (XFS_IFORK_Q(dp) == 0) {
235 int sf_size = sizeof(xfs_attr_sf_hdr_t) +
236 XFS_ATTR_SF_ENTSIZE_BYNAME(args.namelen, valuelen);
238 error = xfs_bmap_add_attrfork(dp, sf_size, rsvd);
239 if (error)
240 return error;
244 * Start our first transaction of the day.
246 * All future transactions during this code must be "chained" off
247 * this one via the trans_dup() call. All transactions will contain
248 * the inode, and the inode will always be marked with trans_ihold().
249 * Since the inode will be locked in all transactions, we must log
250 * the inode in every transaction to let it float upward through
251 * the log.
253 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_SET);
256 * Root fork attributes can use reserved data blocks for this
257 * operation if necessary
260 if (rsvd)
261 args.trans->t_flags |= XFS_TRANS_RESERVE;
263 tres.tr_logres = M_RES(mp)->tr_attrsetm.tr_logres +
264 M_RES(mp)->tr_attrsetrt.tr_logres * args.total;
265 tres.tr_logcount = XFS_ATTRSET_LOG_COUNT;
266 tres.tr_logflags = XFS_TRANS_PERM_LOG_RES;
267 error = xfs_trans_reserve(args.trans, &tres, args.total, 0);
268 if (error) {
269 xfs_trans_cancel(args.trans);
270 return error;
272 xfs_ilock(dp, XFS_ILOCK_EXCL);
274 error = xfs_trans_reserve_quota_nblks(args.trans, dp, args.total, 0,
275 rsvd ? XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
276 XFS_QMOPT_RES_REGBLKS);
277 if (error) {
278 xfs_iunlock(dp, XFS_ILOCK_EXCL);
279 xfs_trans_cancel(args.trans);
280 return error;
283 xfs_trans_ijoin(args.trans, dp, 0);
286 * If the attribute list is non-existent or a shortform list,
287 * upgrade it to a single-leaf-block attribute list.
289 if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL ||
290 (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS &&
291 dp->i_d.di_anextents == 0)) {
294 * Build initial attribute list (if required).
296 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS)
297 xfs_attr_shortform_create(&args);
300 * Try to add the attr to the attribute list in
301 * the inode.
303 error = xfs_attr_shortform_addname(&args);
304 if (error != -ENOSPC) {
306 * Commit the shortform mods, and we're done.
307 * NOTE: this is also the error path (EEXIST, etc).
309 ASSERT(args.trans != NULL);
312 * If this is a synchronous mount, make sure that
313 * the transaction goes to disk before returning
314 * to the user.
316 if (mp->m_flags & XFS_MOUNT_WSYNC)
317 xfs_trans_set_sync(args.trans);
319 if (!error && (flags & ATTR_KERNOTIME) == 0) {
320 xfs_trans_ichgtime(args.trans, dp,
321 XFS_ICHGTIME_CHG);
323 err2 = xfs_trans_commit(args.trans);
324 xfs_iunlock(dp, XFS_ILOCK_EXCL);
326 return error ? error : err2;
330 * It won't fit in the shortform, transform to a leaf block.
331 * GROT: another possible req'mt for a double-split btree op.
333 xfs_bmap_init(args.flist, args.firstblock);
334 error = xfs_attr_shortform_to_leaf(&args);
335 if (!error) {
336 error = xfs_bmap_finish(&args.trans, args.flist,
337 &committed);
339 if (error) {
340 ASSERT(committed);
341 args.trans = NULL;
342 xfs_bmap_cancel(&flist);
343 goto out;
347 * bmap_finish() may have committed the last trans and started
348 * a new one. We need the inode to be in all transactions.
350 if (committed)
351 xfs_trans_ijoin(args.trans, dp, 0);
354 * Commit the leaf transformation. We'll need another (linked)
355 * transaction to add the new attribute to the leaf.
358 error = xfs_trans_roll(&args.trans, dp);
359 if (error)
360 goto out;
364 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK))
365 error = xfs_attr_leaf_addname(&args);
366 else
367 error = xfs_attr_node_addname(&args);
368 if (error)
369 goto out;
372 * If this is a synchronous mount, make sure that the
373 * transaction goes to disk before returning to the user.
375 if (mp->m_flags & XFS_MOUNT_WSYNC)
376 xfs_trans_set_sync(args.trans);
378 if ((flags & ATTR_KERNOTIME) == 0)
379 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
382 * Commit the last in the sequence of transactions.
384 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
385 error = xfs_trans_commit(args.trans);
386 xfs_iunlock(dp, XFS_ILOCK_EXCL);
388 return error;
390 out:
391 if (args.trans)
392 xfs_trans_cancel(args.trans);
393 xfs_iunlock(dp, XFS_ILOCK_EXCL);
394 return error;
398 * Generic handler routine to remove a name from an attribute list.
399 * Transitions attribute list from Btree to shortform as necessary.
402 xfs_attr_remove(
403 struct xfs_inode *dp,
404 const unsigned char *name,
405 int flags)
407 struct xfs_mount *mp = dp->i_mount;
408 struct xfs_da_args args;
409 struct xfs_bmap_free flist;
410 xfs_fsblock_t firstblock;
411 int error;
413 XFS_STATS_INC(xs_attr_remove);
415 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
416 return -EIO;
418 if (!xfs_inode_hasattr(dp))
419 return -ENOATTR;
421 error = xfs_attr_args_init(&args, dp, name, flags);
422 if (error)
423 return error;
425 args.firstblock = &firstblock;
426 args.flist = &flist;
429 * we have no control over the attribute names that userspace passes us
430 * to remove, so we have to allow the name lookup prior to attribute
431 * removal to fail.
433 args.op_flags = XFS_DA_OP_OKNOENT;
435 error = xfs_qm_dqattach(dp, 0);
436 if (error)
437 return error;
440 * Start our first transaction of the day.
442 * All future transactions during this code must be "chained" off
443 * this one via the trans_dup() call. All transactions will contain
444 * the inode, and the inode will always be marked with trans_ihold().
445 * Since the inode will be locked in all transactions, we must log
446 * the inode in every transaction to let it float upward through
447 * the log.
449 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM);
452 * Root fork attributes can use reserved data blocks for this
453 * operation if necessary
456 if (flags & ATTR_ROOT)
457 args.trans->t_flags |= XFS_TRANS_RESERVE;
459 error = xfs_trans_reserve(args.trans, &M_RES(mp)->tr_attrrm,
460 XFS_ATTRRM_SPACE_RES(mp), 0);
461 if (error) {
462 xfs_trans_cancel(args.trans);
463 return error;
466 xfs_ilock(dp, XFS_ILOCK_EXCL);
468 * No need to make quota reservations here. We expect to release some
469 * blocks not allocate in the common case.
471 xfs_trans_ijoin(args.trans, dp, 0);
473 if (!xfs_inode_hasattr(dp)) {
474 error = -ENOATTR;
475 } else if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
476 ASSERT(dp->i_afp->if_flags & XFS_IFINLINE);
477 error = xfs_attr_shortform_remove(&args);
478 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
479 error = xfs_attr_leaf_removename(&args);
480 } else {
481 error = xfs_attr_node_removename(&args);
484 if (error)
485 goto out;
488 * If this is a synchronous mount, make sure that the
489 * transaction goes to disk before returning to the user.
491 if (mp->m_flags & XFS_MOUNT_WSYNC)
492 xfs_trans_set_sync(args.trans);
494 if ((flags & ATTR_KERNOTIME) == 0)
495 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
498 * Commit the last in the sequence of transactions.
500 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
501 error = xfs_trans_commit(args.trans);
502 xfs_iunlock(dp, XFS_ILOCK_EXCL);
504 return error;
506 out:
507 if (args.trans)
508 xfs_trans_cancel(args.trans);
509 xfs_iunlock(dp, XFS_ILOCK_EXCL);
510 return error;
513 /*========================================================================
514 * External routines when attribute list is inside the inode
515 *========================================================================*/
518 * Add a name to the shortform attribute list structure
519 * This is the external routine.
521 STATIC int
522 xfs_attr_shortform_addname(xfs_da_args_t *args)
524 int newsize, forkoff, retval;
526 trace_xfs_attr_sf_addname(args);
528 retval = xfs_attr_shortform_lookup(args);
529 if ((args->flags & ATTR_REPLACE) && (retval == -ENOATTR)) {
530 return retval;
531 } else if (retval == -EEXIST) {
532 if (args->flags & ATTR_CREATE)
533 return retval;
534 retval = xfs_attr_shortform_remove(args);
535 ASSERT(retval == 0);
538 if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX ||
539 args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX)
540 return -ENOSPC;
542 newsize = XFS_ATTR_SF_TOTSIZE(args->dp);
543 newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
545 forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize);
546 if (!forkoff)
547 return -ENOSPC;
549 xfs_attr_shortform_add(args, forkoff);
550 return 0;
554 /*========================================================================
555 * External routines when attribute list is one block
556 *========================================================================*/
559 * Add a name to the leaf attribute list structure
561 * This leaf block cannot have a "remote" value, we only call this routine
562 * if bmap_one_block() says there is only one block (ie: no remote blks).
564 STATIC int
565 xfs_attr_leaf_addname(xfs_da_args_t *args)
567 xfs_inode_t *dp;
568 struct xfs_buf *bp;
569 int retval, error, committed, forkoff;
571 trace_xfs_attr_leaf_addname(args);
574 * Read the (only) block in the attribute list in.
576 dp = args->dp;
577 args->blkno = 0;
578 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
579 if (error)
580 return error;
583 * Look up the given attribute in the leaf block. Figure out if
584 * the given flags produce an error or call for an atomic rename.
586 retval = xfs_attr3_leaf_lookup_int(bp, args);
587 if ((args->flags & ATTR_REPLACE) && (retval == -ENOATTR)) {
588 xfs_trans_brelse(args->trans, bp);
589 return retval;
590 } else if (retval == -EEXIST) {
591 if (args->flags & ATTR_CREATE) { /* pure create op */
592 xfs_trans_brelse(args->trans, bp);
593 return retval;
596 trace_xfs_attr_leaf_replace(args);
598 /* save the attribute state for later removal*/
599 args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */
600 args->blkno2 = args->blkno; /* set 2nd entry info*/
601 args->index2 = args->index;
602 args->rmtblkno2 = args->rmtblkno;
603 args->rmtblkcnt2 = args->rmtblkcnt;
604 args->rmtvaluelen2 = args->rmtvaluelen;
607 * clear the remote attr state now that it is saved so that the
608 * values reflect the state of the attribute we are about to
609 * add, not the attribute we just found and will remove later.
611 args->rmtblkno = 0;
612 args->rmtblkcnt = 0;
613 args->rmtvaluelen = 0;
617 * Add the attribute to the leaf block, transitioning to a Btree
618 * if required.
620 retval = xfs_attr3_leaf_add(bp, args);
621 if (retval == -ENOSPC) {
623 * Promote the attribute list to the Btree format, then
624 * Commit that transaction so that the node_addname() call
625 * can manage its own transactions.
627 xfs_bmap_init(args->flist, args->firstblock);
628 error = xfs_attr3_leaf_to_node(args);
629 if (!error) {
630 error = xfs_bmap_finish(&args->trans, args->flist,
631 &committed);
633 if (error) {
634 ASSERT(committed);
635 args->trans = NULL;
636 xfs_bmap_cancel(args->flist);
637 return error;
641 * bmap_finish() may have committed the last trans and started
642 * a new one. We need the inode to be in all transactions.
644 if (committed)
645 xfs_trans_ijoin(args->trans, dp, 0);
648 * Commit the current trans (including the inode) and start
649 * a new one.
651 error = xfs_trans_roll(&args->trans, dp);
652 if (error)
653 return error;
656 * Fob the whole rest of the problem off on the Btree code.
658 error = xfs_attr_node_addname(args);
659 return error;
663 * Commit the transaction that added the attr name so that
664 * later routines can manage their own transactions.
666 error = xfs_trans_roll(&args->trans, dp);
667 if (error)
668 return error;
671 * If there was an out-of-line value, allocate the blocks we
672 * identified for its storage and copy the value. This is done
673 * after we create the attribute so that we don't overflow the
674 * maximum size of a transaction and/or hit a deadlock.
676 if (args->rmtblkno > 0) {
677 error = xfs_attr_rmtval_set(args);
678 if (error)
679 return error;
683 * If this is an atomic rename operation, we must "flip" the
684 * incomplete flags on the "new" and "old" attribute/value pairs
685 * so that one disappears and one appears atomically. Then we
686 * must remove the "old" attribute/value pair.
688 if (args->op_flags & XFS_DA_OP_RENAME) {
690 * In a separate transaction, set the incomplete flag on the
691 * "old" attr and clear the incomplete flag on the "new" attr.
693 error = xfs_attr3_leaf_flipflags(args);
694 if (error)
695 return error;
698 * Dismantle the "old" attribute/value pair by removing
699 * a "remote" value (if it exists).
701 args->index = args->index2;
702 args->blkno = args->blkno2;
703 args->rmtblkno = args->rmtblkno2;
704 args->rmtblkcnt = args->rmtblkcnt2;
705 args->rmtvaluelen = args->rmtvaluelen2;
706 if (args->rmtblkno) {
707 error = xfs_attr_rmtval_remove(args);
708 if (error)
709 return error;
713 * Read in the block containing the "old" attr, then
714 * remove the "old" attr from that block (neat, huh!)
716 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno,
717 -1, &bp);
718 if (error)
719 return error;
721 xfs_attr3_leaf_remove(bp, args);
724 * If the result is small enough, shrink it all into the inode.
726 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
727 xfs_bmap_init(args->flist, args->firstblock);
728 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
729 /* bp is gone due to xfs_da_shrink_inode */
730 if (!error) {
731 error = xfs_bmap_finish(&args->trans,
732 args->flist,
733 &committed);
735 if (error) {
736 ASSERT(committed);
737 args->trans = NULL;
738 xfs_bmap_cancel(args->flist);
739 return error;
743 * bmap_finish() may have committed the last trans
744 * and started a new one. We need the inode to be
745 * in all transactions.
747 if (committed)
748 xfs_trans_ijoin(args->trans, dp, 0);
752 * Commit the remove and start the next trans in series.
754 error = xfs_trans_roll(&args->trans, dp);
756 } else if (args->rmtblkno > 0) {
758 * Added a "remote" value, just clear the incomplete flag.
760 error = xfs_attr3_leaf_clearflag(args);
762 return error;
766 * Remove a name from the leaf attribute list structure
768 * This leaf block cannot have a "remote" value, we only call this routine
769 * if bmap_one_block() says there is only one block (ie: no remote blks).
771 STATIC int
772 xfs_attr_leaf_removename(xfs_da_args_t *args)
774 xfs_inode_t *dp;
775 struct xfs_buf *bp;
776 int error, committed, forkoff;
778 trace_xfs_attr_leaf_removename(args);
781 * Remove the attribute.
783 dp = args->dp;
784 args->blkno = 0;
785 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
786 if (error)
787 return error;
789 error = xfs_attr3_leaf_lookup_int(bp, args);
790 if (error == -ENOATTR) {
791 xfs_trans_brelse(args->trans, bp);
792 return error;
795 xfs_attr3_leaf_remove(bp, args);
798 * If the result is small enough, shrink it all into the inode.
800 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
801 xfs_bmap_init(args->flist, args->firstblock);
802 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
803 /* bp is gone due to xfs_da_shrink_inode */
804 if (!error) {
805 error = xfs_bmap_finish(&args->trans, args->flist,
806 &committed);
808 if (error) {
809 ASSERT(committed);
810 args->trans = NULL;
811 xfs_bmap_cancel(args->flist);
812 return error;
816 * bmap_finish() may have committed the last trans and started
817 * a new one. We need the inode to be in all transactions.
819 if (committed)
820 xfs_trans_ijoin(args->trans, dp, 0);
822 return 0;
826 * Look up a name in a leaf attribute list structure.
828 * This leaf block cannot have a "remote" value, we only call this routine
829 * if bmap_one_block() says there is only one block (ie: no remote blks).
831 STATIC int
832 xfs_attr_leaf_get(xfs_da_args_t *args)
834 struct xfs_buf *bp;
835 int error;
837 trace_xfs_attr_leaf_get(args);
839 args->blkno = 0;
840 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
841 if (error)
842 return error;
844 error = xfs_attr3_leaf_lookup_int(bp, args);
845 if (error != -EEXIST) {
846 xfs_trans_brelse(args->trans, bp);
847 return error;
849 error = xfs_attr3_leaf_getvalue(bp, args);
850 xfs_trans_brelse(args->trans, bp);
851 if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) {
852 error = xfs_attr_rmtval_get(args);
854 return error;
857 /*========================================================================
858 * External routines when attribute list size > geo->blksize
859 *========================================================================*/
862 * Add a name to a Btree-format attribute list.
864 * This will involve walking down the Btree, and may involve splitting
865 * leaf nodes and even splitting intermediate nodes up to and including
866 * the root node (a special case of an intermediate node).
868 * "Remote" attribute values confuse the issue and atomic rename operations
869 * add a whole extra layer of confusion on top of that.
871 STATIC int
872 xfs_attr_node_addname(xfs_da_args_t *args)
874 xfs_da_state_t *state;
875 xfs_da_state_blk_t *blk;
876 xfs_inode_t *dp;
877 xfs_mount_t *mp;
878 int committed, retval, error;
880 trace_xfs_attr_node_addname(args);
883 * Fill in bucket of arguments/results/context to carry around.
885 dp = args->dp;
886 mp = dp->i_mount;
887 restart:
888 state = xfs_da_state_alloc();
889 state->args = args;
890 state->mp = mp;
893 * Search to see if name already exists, and get back a pointer
894 * to where it should go.
896 error = xfs_da3_node_lookup_int(state, &retval);
897 if (error)
898 goto out;
899 blk = &state->path.blk[ state->path.active-1 ];
900 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
901 if ((args->flags & ATTR_REPLACE) && (retval == -ENOATTR)) {
902 goto out;
903 } else if (retval == -EEXIST) {
904 if (args->flags & ATTR_CREATE)
905 goto out;
907 trace_xfs_attr_node_replace(args);
909 /* save the attribute state for later removal*/
910 args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */
911 args->blkno2 = args->blkno; /* set 2nd entry info*/
912 args->index2 = args->index;
913 args->rmtblkno2 = args->rmtblkno;
914 args->rmtblkcnt2 = args->rmtblkcnt;
915 args->rmtvaluelen2 = args->rmtvaluelen;
918 * clear the remote attr state now that it is saved so that the
919 * values reflect the state of the attribute we are about to
920 * add, not the attribute we just found and will remove later.
922 args->rmtblkno = 0;
923 args->rmtblkcnt = 0;
924 args->rmtvaluelen = 0;
927 retval = xfs_attr3_leaf_add(blk->bp, state->args);
928 if (retval == -ENOSPC) {
929 if (state->path.active == 1) {
931 * Its really a single leaf node, but it had
932 * out-of-line values so it looked like it *might*
933 * have been a b-tree.
935 xfs_da_state_free(state);
936 state = NULL;
937 xfs_bmap_init(args->flist, args->firstblock);
938 error = xfs_attr3_leaf_to_node(args);
939 if (!error) {
940 error = xfs_bmap_finish(&args->trans,
941 args->flist,
942 &committed);
944 if (error) {
945 ASSERT(committed);
946 args->trans = NULL;
947 xfs_bmap_cancel(args->flist);
948 goto out;
952 * bmap_finish() may have committed the last trans
953 * and started a new one. We need the inode to be
954 * in all transactions.
956 if (committed)
957 xfs_trans_ijoin(args->trans, dp, 0);
960 * Commit the node conversion and start the next
961 * trans in the chain.
963 error = xfs_trans_roll(&args->trans, dp);
964 if (error)
965 goto out;
967 goto restart;
971 * Split as many Btree elements as required.
972 * This code tracks the new and old attr's location
973 * in the index/blkno/rmtblkno/rmtblkcnt fields and
974 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
976 xfs_bmap_init(args->flist, args->firstblock);
977 error = xfs_da3_split(state);
978 if (!error) {
979 error = xfs_bmap_finish(&args->trans, args->flist,
980 &committed);
982 if (error) {
983 ASSERT(committed);
984 args->trans = NULL;
985 xfs_bmap_cancel(args->flist);
986 goto out;
990 * bmap_finish() may have committed the last trans and started
991 * a new one. We need the inode to be in all transactions.
993 if (committed)
994 xfs_trans_ijoin(args->trans, dp, 0);
995 } else {
997 * Addition succeeded, update Btree hashvals.
999 xfs_da3_fixhashpath(state, &state->path);
1003 * Kill the state structure, we're done with it and need to
1004 * allow the buffers to come back later.
1006 xfs_da_state_free(state);
1007 state = NULL;
1010 * Commit the leaf addition or btree split and start the next
1011 * trans in the chain.
1013 error = xfs_trans_roll(&args->trans, dp);
1014 if (error)
1015 goto out;
1018 * If there was an out-of-line value, allocate the blocks we
1019 * identified for its storage and copy the value. This is done
1020 * after we create the attribute so that we don't overflow the
1021 * maximum size of a transaction and/or hit a deadlock.
1023 if (args->rmtblkno > 0) {
1024 error = xfs_attr_rmtval_set(args);
1025 if (error)
1026 return error;
1030 * If this is an atomic rename operation, we must "flip" the
1031 * incomplete flags on the "new" and "old" attribute/value pairs
1032 * so that one disappears and one appears atomically. Then we
1033 * must remove the "old" attribute/value pair.
1035 if (args->op_flags & XFS_DA_OP_RENAME) {
1037 * In a separate transaction, set the incomplete flag on the
1038 * "old" attr and clear the incomplete flag on the "new" attr.
1040 error = xfs_attr3_leaf_flipflags(args);
1041 if (error)
1042 goto out;
1045 * Dismantle the "old" attribute/value pair by removing
1046 * a "remote" value (if it exists).
1048 args->index = args->index2;
1049 args->blkno = args->blkno2;
1050 args->rmtblkno = args->rmtblkno2;
1051 args->rmtblkcnt = args->rmtblkcnt2;
1052 args->rmtvaluelen = args->rmtvaluelen2;
1053 if (args->rmtblkno) {
1054 error = xfs_attr_rmtval_remove(args);
1055 if (error)
1056 return error;
1060 * Re-find the "old" attribute entry after any split ops.
1061 * The INCOMPLETE flag means that we will find the "old"
1062 * attr, not the "new" one.
1064 args->flags |= XFS_ATTR_INCOMPLETE;
1065 state = xfs_da_state_alloc();
1066 state->args = args;
1067 state->mp = mp;
1068 state->inleaf = 0;
1069 error = xfs_da3_node_lookup_int(state, &retval);
1070 if (error)
1071 goto out;
1074 * Remove the name and update the hashvals in the tree.
1076 blk = &state->path.blk[ state->path.active-1 ];
1077 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1078 error = xfs_attr3_leaf_remove(blk->bp, args);
1079 xfs_da3_fixhashpath(state, &state->path);
1082 * Check to see if the tree needs to be collapsed.
1084 if (retval && (state->path.active > 1)) {
1085 xfs_bmap_init(args->flist, args->firstblock);
1086 error = xfs_da3_join(state);
1087 if (!error) {
1088 error = xfs_bmap_finish(&args->trans,
1089 args->flist,
1090 &committed);
1092 if (error) {
1093 ASSERT(committed);
1094 args->trans = NULL;
1095 xfs_bmap_cancel(args->flist);
1096 goto out;
1100 * bmap_finish() may have committed the last trans
1101 * and started a new one. We need the inode to be
1102 * in all transactions.
1104 if (committed)
1105 xfs_trans_ijoin(args->trans, dp, 0);
1109 * Commit and start the next trans in the chain.
1111 error = xfs_trans_roll(&args->trans, dp);
1112 if (error)
1113 goto out;
1115 } else if (args->rmtblkno > 0) {
1117 * Added a "remote" value, just clear the incomplete flag.
1119 error = xfs_attr3_leaf_clearflag(args);
1120 if (error)
1121 goto out;
1123 retval = error = 0;
1125 out:
1126 if (state)
1127 xfs_da_state_free(state);
1128 if (error)
1129 return error;
1130 return retval;
1134 * Remove a name from a B-tree attribute list.
1136 * This will involve walking down the Btree, and may involve joining
1137 * leaf nodes and even joining intermediate nodes up to and including
1138 * the root node (a special case of an intermediate node).
1140 STATIC int
1141 xfs_attr_node_removename(xfs_da_args_t *args)
1143 xfs_da_state_t *state;
1144 xfs_da_state_blk_t *blk;
1145 xfs_inode_t *dp;
1146 struct xfs_buf *bp;
1147 int retval, error, committed, forkoff;
1149 trace_xfs_attr_node_removename(args);
1152 * Tie a string around our finger to remind us where we are.
1154 dp = args->dp;
1155 state = xfs_da_state_alloc();
1156 state->args = args;
1157 state->mp = dp->i_mount;
1160 * Search to see if name exists, and get back a pointer to it.
1162 error = xfs_da3_node_lookup_int(state, &retval);
1163 if (error || (retval != -EEXIST)) {
1164 if (error == 0)
1165 error = retval;
1166 goto out;
1170 * If there is an out-of-line value, de-allocate the blocks.
1171 * This is done before we remove the attribute so that we don't
1172 * overflow the maximum size of a transaction and/or hit a deadlock.
1174 blk = &state->path.blk[ state->path.active-1 ];
1175 ASSERT(blk->bp != NULL);
1176 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1177 if (args->rmtblkno > 0) {
1179 * Fill in disk block numbers in the state structure
1180 * so that we can get the buffers back after we commit
1181 * several transactions in the following calls.
1183 error = xfs_attr_fillstate(state);
1184 if (error)
1185 goto out;
1188 * Mark the attribute as INCOMPLETE, then bunmapi() the
1189 * remote value.
1191 error = xfs_attr3_leaf_setflag(args);
1192 if (error)
1193 goto out;
1194 error = xfs_attr_rmtval_remove(args);
1195 if (error)
1196 goto out;
1199 * Refill the state structure with buffers, the prior calls
1200 * released our buffers.
1202 error = xfs_attr_refillstate(state);
1203 if (error)
1204 goto out;
1208 * Remove the name and update the hashvals in the tree.
1210 blk = &state->path.blk[ state->path.active-1 ];
1211 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1212 retval = xfs_attr3_leaf_remove(blk->bp, args);
1213 xfs_da3_fixhashpath(state, &state->path);
1216 * Check to see if the tree needs to be collapsed.
1218 if (retval && (state->path.active > 1)) {
1219 xfs_bmap_init(args->flist, args->firstblock);
1220 error = xfs_da3_join(state);
1221 if (!error) {
1222 error = xfs_bmap_finish(&args->trans, args->flist,
1223 &committed);
1225 if (error) {
1226 ASSERT(committed);
1227 args->trans = NULL;
1228 xfs_bmap_cancel(args->flist);
1229 goto out;
1233 * bmap_finish() may have committed the last trans and started
1234 * a new one. We need the inode to be in all transactions.
1236 if (committed)
1237 xfs_trans_ijoin(args->trans, dp, 0);
1240 * Commit the Btree join operation and start a new trans.
1242 error = xfs_trans_roll(&args->trans, dp);
1243 if (error)
1244 goto out;
1248 * If the result is small enough, push it all into the inode.
1250 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1252 * Have to get rid of the copy of this dabuf in the state.
1254 ASSERT(state->path.active == 1);
1255 ASSERT(state->path.blk[0].bp);
1256 state->path.blk[0].bp = NULL;
1258 error = xfs_attr3_leaf_read(args->trans, args->dp, 0, -1, &bp);
1259 if (error)
1260 goto out;
1262 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1263 xfs_bmap_init(args->flist, args->firstblock);
1264 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
1265 /* bp is gone due to xfs_da_shrink_inode */
1266 if (!error) {
1267 error = xfs_bmap_finish(&args->trans,
1268 args->flist,
1269 &committed);
1271 if (error) {
1272 ASSERT(committed);
1273 args->trans = NULL;
1274 xfs_bmap_cancel(args->flist);
1275 goto out;
1279 * bmap_finish() may have committed the last trans
1280 * and started a new one. We need the inode to be
1281 * in all transactions.
1283 if (committed)
1284 xfs_trans_ijoin(args->trans, dp, 0);
1285 } else
1286 xfs_trans_brelse(args->trans, bp);
1288 error = 0;
1290 out:
1291 xfs_da_state_free(state);
1292 return error;
1296 * Fill in the disk block numbers in the state structure for the buffers
1297 * that are attached to the state structure.
1298 * This is done so that we can quickly reattach ourselves to those buffers
1299 * after some set of transaction commits have released these buffers.
1301 STATIC int
1302 xfs_attr_fillstate(xfs_da_state_t *state)
1304 xfs_da_state_path_t *path;
1305 xfs_da_state_blk_t *blk;
1306 int level;
1308 trace_xfs_attr_fillstate(state->args);
1311 * Roll down the "path" in the state structure, storing the on-disk
1312 * block number for those buffers in the "path".
1314 path = &state->path;
1315 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1316 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1317 if (blk->bp) {
1318 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1319 blk->bp = NULL;
1320 } else {
1321 blk->disk_blkno = 0;
1326 * Roll down the "altpath" in the state structure, storing the on-disk
1327 * block number for those buffers in the "altpath".
1329 path = &state->altpath;
1330 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1331 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1332 if (blk->bp) {
1333 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1334 blk->bp = NULL;
1335 } else {
1336 blk->disk_blkno = 0;
1340 return 0;
1344 * Reattach the buffers to the state structure based on the disk block
1345 * numbers stored in the state structure.
1346 * This is done after some set of transaction commits have released those
1347 * buffers from our grip.
1349 STATIC int
1350 xfs_attr_refillstate(xfs_da_state_t *state)
1352 xfs_da_state_path_t *path;
1353 xfs_da_state_blk_t *blk;
1354 int level, error;
1356 trace_xfs_attr_refillstate(state->args);
1359 * Roll down the "path" in the state structure, storing the on-disk
1360 * block number for those buffers in the "path".
1362 path = &state->path;
1363 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1364 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1365 if (blk->disk_blkno) {
1366 error = xfs_da3_node_read(state->args->trans,
1367 state->args->dp,
1368 blk->blkno, blk->disk_blkno,
1369 &blk->bp, XFS_ATTR_FORK);
1370 if (error)
1371 return error;
1372 } else {
1373 blk->bp = NULL;
1378 * Roll down the "altpath" in the state structure, storing the on-disk
1379 * block number for those buffers in the "altpath".
1381 path = &state->altpath;
1382 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1383 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1384 if (blk->disk_blkno) {
1385 error = xfs_da3_node_read(state->args->trans,
1386 state->args->dp,
1387 blk->blkno, blk->disk_blkno,
1388 &blk->bp, XFS_ATTR_FORK);
1389 if (error)
1390 return error;
1391 } else {
1392 blk->bp = NULL;
1396 return 0;
1400 * Look up a filename in a node attribute list.
1402 * This routine gets called for any attribute fork that has more than one
1403 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1404 * "remote" values taking up more blocks.
1406 STATIC int
1407 xfs_attr_node_get(xfs_da_args_t *args)
1409 xfs_da_state_t *state;
1410 xfs_da_state_blk_t *blk;
1411 int error, retval;
1412 int i;
1414 trace_xfs_attr_node_get(args);
1416 state = xfs_da_state_alloc();
1417 state->args = args;
1418 state->mp = args->dp->i_mount;
1421 * Search to see if name exists, and get back a pointer to it.
1423 error = xfs_da3_node_lookup_int(state, &retval);
1424 if (error) {
1425 retval = error;
1426 } else if (retval == -EEXIST) {
1427 blk = &state->path.blk[ state->path.active-1 ];
1428 ASSERT(blk->bp != NULL);
1429 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1432 * Get the value, local or "remote"
1434 retval = xfs_attr3_leaf_getvalue(blk->bp, args);
1435 if (!retval && (args->rmtblkno > 0)
1436 && !(args->flags & ATTR_KERNOVAL)) {
1437 retval = xfs_attr_rmtval_get(args);
1442 * If not in a transaction, we have to release all the buffers.
1444 for (i = 0; i < state->path.active; i++) {
1445 xfs_trans_brelse(args->trans, state->path.blk[i].bp);
1446 state->path.blk[i].bp = NULL;
1449 xfs_da_state_free(state);
1450 return retval;