Loading...
Note: File does not exist in v4.10.11.
1/*
2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
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.
8 *
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.
13 *
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
17 */
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_sb.h"
26#include "xfs_ag.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"
35#include "xfs_bmap.h"
36#include "xfs_bmap_util.h"
37#include "xfs_bmap_btree.h"
38#include "xfs_attr.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"
46
47/*
48 * xfs_attr.c
49 *
50 * Provide the external interfaces to manage attribute lists.
51 */
52
53/*========================================================================
54 * Function prototypes for the kernel.
55 *========================================================================*/
56
57/*
58 * Internal routines when attribute list fits inside the inode.
59 */
60STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args);
61
62/*
63 * Internal routines when attribute list is one block.
64 */
65STATIC int xfs_attr_leaf_get(xfs_da_args_t *args);
66STATIC int xfs_attr_leaf_addname(xfs_da_args_t *args);
67STATIC int xfs_attr_leaf_removename(xfs_da_args_t *args);
68
69/*
70 * Internal routines when attribute list is more than one block.
71 */
72STATIC int xfs_attr_node_get(xfs_da_args_t *args);
73STATIC int xfs_attr_node_addname(xfs_da_args_t *args);
74STATIC int xfs_attr_node_removename(xfs_da_args_t *args);
75STATIC int xfs_attr_fillstate(xfs_da_state_t *state);
76STATIC int xfs_attr_refillstate(xfs_da_state_t *state);
77
78
79STATIC int
80xfs_attr_name_to_xname(
81 struct xfs_name *xname,
82 const unsigned char *aname)
83{
84 if (!aname)
85 return EINVAL;
86 xname->name = aname;
87 xname->len = strlen((char *)aname);
88 if (xname->len >= MAXNAMELEN)
89 return EFAULT; /* match IRIX behaviour */
90
91 return 0;
92}
93
94int
95xfs_inode_hasattr(
96 struct xfs_inode *ip)
97{
98 if (!XFS_IFORK_Q(ip) ||
99 (ip->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS &&
100 ip->i_d.di_anextents == 0))
101 return 0;
102 return 1;
103}
104
105/*========================================================================
106 * Overall external interface routines.
107 *========================================================================*/
108
109STATIC int
110xfs_attr_get_int(
111 struct xfs_inode *ip,
112 struct xfs_name *name,
113 unsigned char *value,
114 int *valuelenp,
115 int flags)
116{
117 xfs_da_args_t args;
118 int error;
119
120 if (!xfs_inode_hasattr(ip))
121 return ENOATTR;
122
123 /*
124 * Fill in the arg structure for this request.
125 */
126 memset((char *)&args, 0, sizeof(args));
127 args.name = name->name;
128 args.namelen = name->len;
129 args.value = value;
130 args.valuelen = *valuelenp;
131 args.flags = flags;
132 args.hashval = xfs_da_hashname(args.name, args.namelen);
133 args.dp = ip;
134 args.whichfork = XFS_ATTR_FORK;
135
136 /*
137 * Decide on what work routines to call based on the inode size.
138 */
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);
143 } else {
144 error = xfs_attr_node_get(&args);
145 }
146
147 /*
148 * Return the number of bytes in the value to the caller.
149 */
150 *valuelenp = args.valuelen;
151
152 if (error == EEXIST)
153 error = 0;
154 return(error);
155}
156
157int
158xfs_attr_get(
159 xfs_inode_t *ip,
160 const unsigned char *name,
161 unsigned char *value,
162 int *valuelenp,
163 int flags)
164{
165 int error;
166 struct xfs_name xname;
167 uint lock_mode;
168
169 XFS_STATS_INC(xs_attr_get);
170
171 if (XFS_FORCED_SHUTDOWN(ip->i_mount))
172 return(EIO);
173
174 error = xfs_attr_name_to_xname(&xname, name);
175 if (error)
176 return error;
177
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);
181 return(error);
182}
183
184/*
185 * Calculate how many blocks we need for the new attribute,
186 */
187STATIC int
188xfs_attr_calc_size(
189 struct xfs_inode *ip,
190 int namelen,
191 int valuelen,
192 int *local)
193{
194 struct xfs_mount *mp = ip->i_mount;
195 int size;
196 int nblks;
197
198 /*
199 * Determine space new attribute will use, and if it would be
200 * "local" or "remote" (note: local != inline).
201 */
202 size = xfs_attr_leaf_newentsize(namelen, valuelen,
203 mp->m_sb.sb_blocksize, local);
204
205 nblks = XFS_DAENTER_SPACE_RES(mp, XFS_ATTR_FORK);
206 if (*local) {
207 if (size > (mp->m_sb.sb_blocksize >> 1)) {
208 /* Double split possible */
209 nblks *= 2;
210 }
211 } else {
212 /*
213 * Out of line attribute, cannot double split, but
214 * make room for the attribute value itself.
215 */
216 uint dblocks = xfs_attr3_rmt_blocks(mp, valuelen);
217 nblks += dblocks;
218 nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK);
219 }
220
221 return nblks;
222}
223
224STATIC int
225xfs_attr_set_int(
226 struct xfs_inode *dp,
227 struct xfs_name *name,
228 unsigned char *value,
229 int valuelen,
230 int flags)
231{
232 xfs_da_args_t args;
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;
239 int local;
240
241 /*
242 * Attach the dquots to the inode.
243 */
244 error = xfs_qm_dqattach(dp, 0);
245 if (error)
246 return error;
247
248 /*
249 * If the inode doesn't have an attribute fork, add one.
250 * (inode must not be locked when we call this routine)
251 */
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);
255
256 if ((error = xfs_bmap_add_attrfork(dp, sf_size, rsvd)))
257 return(error);
258 }
259
260 /*
261 * Fill in the arg structure for this request.
262 */
263 memset((char *)&args, 0, sizeof(args));
264 args.name = name->name;
265 args.namelen = name->len;
266 args.value = value;
267 args.valuelen = valuelen;
268 args.flags = flags;
269 args.hashval = xfs_da_hashname(args.name, args.namelen);
270 args.dp = dp;
271 args.firstblock = &firstblock;
272 args.flist = &flist;
273 args.whichfork = XFS_ATTR_FORK;
274 args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
275
276 /* Size is now blocks for attribute data */
277 args.total = xfs_attr_calc_size(dp, name->len, valuelen, &local);
278
279 /*
280 * Start our first transaction of the day.
281 *
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
287 * the log.
288 */
289 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_SET);
290
291 /*
292 * Root fork attributes can use reserved data blocks for this
293 * operation if necessary
294 */
295
296 if (rsvd)
297 args.trans->t_flags |= XFS_TRANS_RESERVE;
298
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);
304 if (error) {
305 xfs_trans_cancel(args.trans, 0);
306 return(error);
307 }
308 xfs_ilock(dp, XFS_ILOCK_EXCL);
309
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);
313 if (error) {
314 xfs_iunlock(dp, XFS_ILOCK_EXCL);
315 xfs_trans_cancel(args.trans, XFS_TRANS_RELEASE_LOG_RES);
316 return (error);
317 }
318
319 xfs_trans_ijoin(args.trans, dp, 0);
320
321 /*
322 * If the attribute list is non-existent or a shortform list,
323 * upgrade it to a single-leaf-block attribute list.
324 */
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))) {
328
329 /*
330 * Build initial attribute list (if required).
331 */
332 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS)
333 xfs_attr_shortform_create(&args);
334
335 /*
336 * Try to add the attr to the attribute list in
337 * the inode.
338 */
339 error = xfs_attr_shortform_addname(&args);
340 if (error != ENOSPC) {
341 /*
342 * Commit the shortform mods, and we're done.
343 * NOTE: this is also the error path (EEXIST, etc).
344 */
345 ASSERT(args.trans != NULL);
346
347 /*
348 * If this is a synchronous mount, make sure that
349 * the transaction goes to disk before returning
350 * to the user.
351 */
352 if (mp->m_flags & XFS_MOUNT_WSYNC) {
353 xfs_trans_set_sync(args.trans);
354 }
355
356 if (!error && (flags & ATTR_KERNOTIME) == 0) {
357 xfs_trans_ichgtime(args.trans, dp,
358 XFS_ICHGTIME_CHG);
359 }
360 err2 = xfs_trans_commit(args.trans,
361 XFS_TRANS_RELEASE_LOG_RES);
362 xfs_iunlock(dp, XFS_ILOCK_EXCL);
363
364 return(error == 0 ? err2 : error);
365 }
366
367 /*
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.
370 */
371 xfs_bmap_init(args.flist, args.firstblock);
372 error = xfs_attr_shortform_to_leaf(&args);
373 if (!error) {
374 error = xfs_bmap_finish(&args.trans, args.flist,
375 &committed);
376 }
377 if (error) {
378 ASSERT(committed);
379 args.trans = NULL;
380 xfs_bmap_cancel(&flist);
381 goto out;
382 }
383
384 /*
385 * bmap_finish() may have committed the last trans and started
386 * a new one. We need the inode to be in all transactions.
387 */
388 if (committed)
389 xfs_trans_ijoin(args.trans, dp, 0);
390
391 /*
392 * Commit the leaf transformation. We'll need another (linked)
393 * transaction to add the new attribute to the leaf.
394 */
395
396 error = xfs_trans_roll(&args.trans, dp);
397 if (error)
398 goto out;
399
400 }
401
402 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
403 error = xfs_attr_leaf_addname(&args);
404 } else {
405 error = xfs_attr_node_addname(&args);
406 }
407 if (error) {
408 goto out;
409 }
410
411 /*
412 * If this is a synchronous mount, make sure that the
413 * transaction goes to disk before returning to the user.
414 */
415 if (mp->m_flags & XFS_MOUNT_WSYNC) {
416 xfs_trans_set_sync(args.trans);
417 }
418
419 if ((flags & ATTR_KERNOTIME) == 0)
420 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
421
422 /*
423 * Commit the last in the sequence of transactions.
424 */
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);
428
429 return(error);
430
431out:
432 if (args.trans)
433 xfs_trans_cancel(args.trans,
434 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
435 xfs_iunlock(dp, XFS_ILOCK_EXCL);
436 return(error);
437}
438
439int
440xfs_attr_set(
441 xfs_inode_t *dp,
442 const unsigned char *name,
443 unsigned char *value,
444 int valuelen,
445 int flags)
446{
447 int error;
448 struct xfs_name xname;
449
450 XFS_STATS_INC(xs_attr_set);
451
452 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
453 return (EIO);
454
455 error = xfs_attr_name_to_xname(&xname, name);
456 if (error)
457 return error;
458
459 return xfs_attr_set_int(dp, &xname, value, valuelen, flags);
460}
461
462/*
463 * Generic handler routine to remove a name from an attribute list.
464 * Transitions attribute list from Btree to shortform as necessary.
465 */
466STATIC int
467xfs_attr_remove_int(xfs_inode_t *dp, struct xfs_name *name, int flags)
468{
469 xfs_da_args_t args;
470 xfs_fsblock_t firstblock;
471 xfs_bmap_free_t flist;
472 int error;
473 xfs_mount_t *mp = dp->i_mount;
474
475 /*
476 * Fill in the arg structure for this request.
477 */
478 memset((char *)&args, 0, sizeof(args));
479 args.name = name->name;
480 args.namelen = name->len;
481 args.flags = flags;
482 args.hashval = xfs_da_hashname(args.name, args.namelen);
483 args.dp = dp;
484 args.firstblock = &firstblock;
485 args.flist = &flist;
486 args.total = 0;
487 args.whichfork = XFS_ATTR_FORK;
488
489 /*
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
492 * removal to fail.
493 */
494 args.op_flags = XFS_DA_OP_OKNOENT;
495
496 /*
497 * Attach the dquots to the inode.
498 */
499 error = xfs_qm_dqattach(dp, 0);
500 if (error)
501 return error;
502
503 /*
504 * Start our first transaction of the day.
505 *
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
511 * the log.
512 */
513 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM);
514
515 /*
516 * Root fork attributes can use reserved data blocks for this
517 * operation if necessary
518 */
519
520 if (flags & ATTR_ROOT)
521 args.trans->t_flags |= XFS_TRANS_RESERVE;
522
523 error = xfs_trans_reserve(args.trans, &M_RES(mp)->tr_attrrm,
524 XFS_ATTRRM_SPACE_RES(mp), 0);
525 if (error) {
526 xfs_trans_cancel(args.trans, 0);
527 return(error);
528 }
529
530 xfs_ilock(dp, XFS_ILOCK_EXCL);
531 /*
532 * No need to make quota reservations here. We expect to release some
533 * blocks not allocate in the common case.
534 */
535 xfs_trans_ijoin(args.trans, dp, 0);
536
537 /*
538 * Decide on what work routines to call based on the inode size.
539 */
540 if (!xfs_inode_hasattr(dp)) {
541 error = XFS_ERROR(ENOATTR);
542 goto out;
543 }
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);
547 if (error) {
548 goto out;
549 }
550 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
551 error = xfs_attr_leaf_removename(&args);
552 } else {
553 error = xfs_attr_node_removename(&args);
554 }
555 if (error) {
556 goto out;
557 }
558
559 /*
560 * If this is a synchronous mount, make sure that the
561 * transaction goes to disk before returning to the user.
562 */
563 if (mp->m_flags & XFS_MOUNT_WSYNC) {
564 xfs_trans_set_sync(args.trans);
565 }
566
567 if ((flags & ATTR_KERNOTIME) == 0)
568 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
569
570 /*
571 * Commit the last in the sequence of transactions.
572 */
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);
576
577 return(error);
578
579out:
580 if (args.trans)
581 xfs_trans_cancel(args.trans,
582 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
583 xfs_iunlock(dp, XFS_ILOCK_EXCL);
584 return(error);
585}
586
587int
588xfs_attr_remove(
589 xfs_inode_t *dp,
590 const unsigned char *name,
591 int flags)
592{
593 int error;
594 struct xfs_name xname;
595
596 XFS_STATS_INC(xs_attr_remove);
597
598 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
599 return (EIO);
600
601 error = xfs_attr_name_to_xname(&xname, name);
602 if (error)
603 return error;
604
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);
609 }
610 xfs_iunlock(dp, XFS_ILOCK_SHARED);
611
612 return xfs_attr_remove_int(dp, &xname, flags);
613}
614
615
616/*========================================================================
617 * External routines when attribute list is inside the inode
618 *========================================================================*/
619
620/*
621 * Add a name to the shortform attribute list structure
622 * This is the external routine.
623 */
624STATIC int
625xfs_attr_shortform_addname(xfs_da_args_t *args)
626{
627 int newsize, forkoff, retval;
628
629 trace_xfs_attr_sf_addname(args);
630
631 retval = xfs_attr_shortform_lookup(args);
632 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
633 return(retval);
634 } else if (retval == EEXIST) {
635 if (args->flags & ATTR_CREATE)
636 return(retval);
637 retval = xfs_attr_shortform_remove(args);
638 ASSERT(retval == 0);
639 }
640
641 if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX ||
642 args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX)
643 return(XFS_ERROR(ENOSPC));
644
645 newsize = XFS_ATTR_SF_TOTSIZE(args->dp);
646 newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
647
648 forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize);
649 if (!forkoff)
650 return(XFS_ERROR(ENOSPC));
651
652 xfs_attr_shortform_add(args, forkoff);
653 return(0);
654}
655
656
657/*========================================================================
658 * External routines when attribute list is one block
659 *========================================================================*/
660
661/*
662 * Add a name to the leaf attribute list structure
663 *
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).
666 */
667STATIC int
668xfs_attr_leaf_addname(xfs_da_args_t *args)
669{
670 xfs_inode_t *dp;
671 struct xfs_buf *bp;
672 int retval, error, committed, forkoff;
673
674 trace_xfs_attr_leaf_addname(args);
675
676 /*
677 * Read the (only) block in the attribute list in.
678 */
679 dp = args->dp;
680 args->blkno = 0;
681 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
682 if (error)
683 return error;
684
685 /*
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.
688 */
689 retval = xfs_attr3_leaf_lookup_int(bp, args);
690 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
691 xfs_trans_brelse(args->trans, bp);
692 return retval;
693 } else if (retval == EEXIST) {
694 if (args->flags & ATTR_CREATE) { /* pure create op */
695 xfs_trans_brelse(args->trans, bp);
696 return retval;
697 }
698
699 trace_xfs_attr_leaf_replace(args);
700
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;
708
709 /*
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.
713 */
714 args->rmtblkno = 0;
715 args->rmtblkcnt = 0;
716 args->rmtvaluelen = 0;
717 }
718
719 /*
720 * Add the attribute to the leaf block, transitioning to a Btree
721 * if required.
722 */
723 retval = xfs_attr3_leaf_add(bp, args);
724 if (retval == ENOSPC) {
725 /*
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.
729 */
730 xfs_bmap_init(args->flist, args->firstblock);
731 error = xfs_attr3_leaf_to_node(args);
732 if (!error) {
733 error = xfs_bmap_finish(&args->trans, args->flist,
734 &committed);
735 }
736 if (error) {
737 ASSERT(committed);
738 args->trans = NULL;
739 xfs_bmap_cancel(args->flist);
740 return(error);
741 }
742
743 /*
744 * bmap_finish() may have committed the last trans and started
745 * a new one. We need the inode to be in all transactions.
746 */
747 if (committed)
748 xfs_trans_ijoin(args->trans, dp, 0);
749
750 /*
751 * Commit the current trans (including the inode) and start
752 * a new one.
753 */
754 error = xfs_trans_roll(&args->trans, dp);
755 if (error)
756 return (error);
757
758 /*
759 * Fob the whole rest of the problem off on the Btree code.
760 */
761 error = xfs_attr_node_addname(args);
762 return(error);
763 }
764
765 /*
766 * Commit the transaction that added the attr name so that
767 * later routines can manage their own transactions.
768 */
769 error = xfs_trans_roll(&args->trans, dp);
770 if (error)
771 return (error);
772
773 /*
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.
778 */
779 if (args->rmtblkno > 0) {
780 error = xfs_attr_rmtval_set(args);
781 if (error)
782 return(error);
783 }
784
785 /*
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.
790 */
791 if (args->op_flags & XFS_DA_OP_RENAME) {
792 /*
793 * In a separate transaction, set the incomplete flag on the
794 * "old" attr and clear the incomplete flag on the "new" attr.
795 */
796 error = xfs_attr3_leaf_flipflags(args);
797 if (error)
798 return(error);
799
800 /*
801 * Dismantle the "old" attribute/value pair by removing
802 * a "remote" value (if it exists).
803 */
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);
811 if (error)
812 return(error);
813 }
814
815 /*
816 * Read in the block containing the "old" attr, then
817 * remove the "old" attr from that block (neat, huh!)
818 */
819 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno,
820 -1, &bp);
821 if (error)
822 return error;
823
824 xfs_attr3_leaf_remove(bp, args);
825
826 /*
827 * If the result is small enough, shrink it all into the inode.
828 */
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 */
833 if (!error) {
834 error = xfs_bmap_finish(&args->trans,
835 args->flist,
836 &committed);
837 }
838 if (error) {
839 ASSERT(committed);
840 args->trans = NULL;
841 xfs_bmap_cancel(args->flist);
842 return(error);
843 }
844
845 /*
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.
849 */
850 if (committed)
851 xfs_trans_ijoin(args->trans, dp, 0);
852 }
853
854 /*
855 * Commit the remove and start the next trans in series.
856 */
857 error = xfs_trans_roll(&args->trans, dp);
858
859 } else if (args->rmtblkno > 0) {
860 /*
861 * Added a "remote" value, just clear the incomplete flag.
862 */
863 error = xfs_attr3_leaf_clearflag(args);
864 }
865 return error;
866}
867
868/*
869 * Remove a name from the leaf attribute list structure
870 *
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).
873 */
874STATIC int
875xfs_attr_leaf_removename(xfs_da_args_t *args)
876{
877 xfs_inode_t *dp;
878 struct xfs_buf *bp;
879 int error, committed, forkoff;
880
881 trace_xfs_attr_leaf_removename(args);
882
883 /*
884 * Remove the attribute.
885 */
886 dp = args->dp;
887 args->blkno = 0;
888 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
889 if (error)
890 return error;
891
892 error = xfs_attr3_leaf_lookup_int(bp, args);
893 if (error == ENOATTR) {
894 xfs_trans_brelse(args->trans, bp);
895 return error;
896 }
897
898 xfs_attr3_leaf_remove(bp, args);
899
900 /*
901 * If the result is small enough, shrink it all into the inode.
902 */
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 */
907 if (!error) {
908 error = xfs_bmap_finish(&args->trans, args->flist,
909 &committed);
910 }
911 if (error) {
912 ASSERT(committed);
913 args->trans = NULL;
914 xfs_bmap_cancel(args->flist);
915 return error;
916 }
917
918 /*
919 * bmap_finish() may have committed the last trans and started
920 * a new one. We need the inode to be in all transactions.
921 */
922 if (committed)
923 xfs_trans_ijoin(args->trans, dp, 0);
924 }
925 return 0;
926}
927
928/*
929 * Look up a name in a leaf attribute list structure.
930 *
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).
933 */
934STATIC int
935xfs_attr_leaf_get(xfs_da_args_t *args)
936{
937 struct xfs_buf *bp;
938 int error;
939
940 trace_xfs_attr_leaf_get(args);
941
942 args->blkno = 0;
943 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
944 if (error)
945 return error;
946
947 error = xfs_attr3_leaf_lookup_int(bp, args);
948 if (error != EEXIST) {
949 xfs_trans_brelse(args->trans, bp);
950 return error;
951 }
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);
956 }
957 return error;
958}
959
960/*========================================================================
961 * External routines when attribute list size > XFS_LBSIZE(mp).
962 *========================================================================*/
963
964/*
965 * Add a name to a Btree-format attribute list.
966 *
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).
970 *
971 * "Remote" attribute values confuse the issue and atomic rename operations
972 * add a whole extra layer of confusion on top of that.
973 */
974STATIC int
975xfs_attr_node_addname(xfs_da_args_t *args)
976{
977 xfs_da_state_t *state;
978 xfs_da_state_blk_t *blk;
979 xfs_inode_t *dp;
980 xfs_mount_t *mp;
981 int committed, retval, error;
982
983 trace_xfs_attr_node_addname(args);
984
985 /*
986 * Fill in bucket of arguments/results/context to carry around.
987 */
988 dp = args->dp;
989 mp = dp->i_mount;
990restart:
991 state = xfs_da_state_alloc();
992 state->args = args;
993 state->mp = mp;
994 state->blocksize = state->mp->m_sb.sb_blocksize;
995 state->node_ents = state->mp->m_attr_node_ents;
996
997 /*
998 * Search to see if name already exists, and get back a pointer
999 * to where it should go.
1000 */
1001 error = xfs_da3_node_lookup_int(state, &retval);
1002 if (error)
1003 goto out;
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)) {
1007 goto out;
1008 } else if (retval == EEXIST) {
1009 if (args->flags & ATTR_CREATE)
1010 goto out;
1011
1012 trace_xfs_attr_node_replace(args);
1013
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;
1021
1022 /*
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.
1026 */
1027 args->rmtblkno = 0;
1028 args->rmtblkcnt = 0;
1029 args->rmtvaluelen = 0;
1030 }
1031
1032 retval = xfs_attr3_leaf_add(blk->bp, state->args);
1033 if (retval == ENOSPC) {
1034 if (state->path.active == 1) {
1035 /*
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.
1039 */
1040 xfs_da_state_free(state);
1041 state = NULL;
1042 xfs_bmap_init(args->flist, args->firstblock);
1043 error = xfs_attr3_leaf_to_node(args);
1044 if (!error) {
1045 error = xfs_bmap_finish(&args->trans,
1046 args->flist,
1047 &committed);
1048 }
1049 if (error) {
1050 ASSERT(committed);
1051 args->trans = NULL;
1052 xfs_bmap_cancel(args->flist);
1053 goto out;
1054 }
1055
1056 /*
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.
1060 */
1061 if (committed)
1062 xfs_trans_ijoin(args->trans, dp, 0);
1063
1064 /*
1065 * Commit the node conversion and start the next
1066 * trans in the chain.
1067 */
1068 error = xfs_trans_roll(&args->trans, dp);
1069 if (error)
1070 goto out;
1071
1072 goto restart;
1073 }
1074
1075 /*
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.
1080 */
1081 xfs_bmap_init(args->flist, args->firstblock);
1082 error = xfs_da3_split(state);
1083 if (!error) {
1084 error = xfs_bmap_finish(&args->trans, args->flist,
1085 &committed);
1086 }
1087 if (error) {
1088 ASSERT(committed);
1089 args->trans = NULL;
1090 xfs_bmap_cancel(args->flist);
1091 goto out;
1092 }
1093
1094 /*
1095 * bmap_finish() may have committed the last trans and started
1096 * a new one. We need the inode to be in all transactions.
1097 */
1098 if (committed)
1099 xfs_trans_ijoin(args->trans, dp, 0);
1100 } else {
1101 /*
1102 * Addition succeeded, update Btree hashvals.
1103 */
1104 xfs_da3_fixhashpath(state, &state->path);
1105 }
1106
1107 /*
1108 * Kill the state structure, we're done with it and need to
1109 * allow the buffers to come back later.
1110 */
1111 xfs_da_state_free(state);
1112 state = NULL;
1113
1114 /*
1115 * Commit the leaf addition or btree split and start the next
1116 * trans in the chain.
1117 */
1118 error = xfs_trans_roll(&args->trans, dp);
1119 if (error)
1120 goto out;
1121
1122 /*
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.
1127 */
1128 if (args->rmtblkno > 0) {
1129 error = xfs_attr_rmtval_set(args);
1130 if (error)
1131 return(error);
1132 }
1133
1134 /*
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.
1139 */
1140 if (args->op_flags & XFS_DA_OP_RENAME) {
1141 /*
1142 * In a separate transaction, set the incomplete flag on the
1143 * "old" attr and clear the incomplete flag on the "new" attr.
1144 */
1145 error = xfs_attr3_leaf_flipflags(args);
1146 if (error)
1147 goto out;
1148
1149 /*
1150 * Dismantle the "old" attribute/value pair by removing
1151 * a "remote" value (if it exists).
1152 */
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);
1160 if (error)
1161 return(error);
1162 }
1163
1164 /*
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.
1168 */
1169 args->flags |= XFS_ATTR_INCOMPLETE;
1170 state = xfs_da_state_alloc();
1171 state->args = args;
1172 state->mp = mp;
1173 state->blocksize = state->mp->m_sb.sb_blocksize;
1174 state->node_ents = state->mp->m_attr_node_ents;
1175 state->inleaf = 0;
1176 error = xfs_da3_node_lookup_int(state, &retval);
1177 if (error)
1178 goto out;
1179
1180 /*
1181 * Remove the name and update the hashvals in the tree.
1182 */
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);
1187
1188 /*
1189 * Check to see if the tree needs to be collapsed.
1190 */
1191 if (retval && (state->path.active > 1)) {
1192 xfs_bmap_init(args->flist, args->firstblock);
1193 error = xfs_da3_join(state);
1194 if (!error) {
1195 error = xfs_bmap_finish(&args->trans,
1196 args->flist,
1197 &committed);
1198 }
1199 if (error) {
1200 ASSERT(committed);
1201 args->trans = NULL;
1202 xfs_bmap_cancel(args->flist);
1203 goto out;
1204 }
1205
1206 /*
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.
1210 */
1211 if (committed)
1212 xfs_trans_ijoin(args->trans, dp, 0);
1213 }
1214
1215 /*
1216 * Commit and start the next trans in the chain.
1217 */
1218 error = xfs_trans_roll(&args->trans, dp);
1219 if (error)
1220 goto out;
1221
1222 } else if (args->rmtblkno > 0) {
1223 /*
1224 * Added a "remote" value, just clear the incomplete flag.
1225 */
1226 error = xfs_attr3_leaf_clearflag(args);
1227 if (error)
1228 goto out;
1229 }
1230 retval = error = 0;
1231
1232out:
1233 if (state)
1234 xfs_da_state_free(state);
1235 if (error)
1236 return(error);
1237 return(retval);
1238}
1239
1240/*
1241 * Remove a name from a B-tree attribute list.
1242 *
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).
1246 */
1247STATIC int
1248xfs_attr_node_removename(xfs_da_args_t *args)
1249{
1250 xfs_da_state_t *state;
1251 xfs_da_state_blk_t *blk;
1252 xfs_inode_t *dp;
1253 struct xfs_buf *bp;
1254 int retval, error, committed, forkoff;
1255
1256 trace_xfs_attr_node_removename(args);
1257
1258 /*
1259 * Tie a string around our finger to remind us where we are.
1260 */
1261 dp = args->dp;
1262 state = xfs_da_state_alloc();
1263 state->args = args;
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;
1267
1268 /*
1269 * Search to see if name exists, and get back a pointer to it.
1270 */
1271 error = xfs_da3_node_lookup_int(state, &retval);
1272 if (error || (retval != EEXIST)) {
1273 if (error == 0)
1274 error = retval;
1275 goto out;
1276 }
1277
1278 /*
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.
1282 */
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) {
1287 /*
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.
1291 */
1292 error = xfs_attr_fillstate(state);
1293 if (error)
1294 goto out;
1295
1296 /*
1297 * Mark the attribute as INCOMPLETE, then bunmapi() the
1298 * remote value.
1299 */
1300 error = xfs_attr3_leaf_setflag(args);
1301 if (error)
1302 goto out;
1303 error = xfs_attr_rmtval_remove(args);
1304 if (error)
1305 goto out;
1306
1307 /*
1308 * Refill the state structure with buffers, the prior calls
1309 * released our buffers.
1310 */
1311 error = xfs_attr_refillstate(state);
1312 if (error)
1313 goto out;
1314 }
1315
1316 /*
1317 * Remove the name and update the hashvals in the tree.
1318 */
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);
1323
1324 /*
1325 * Check to see if the tree needs to be collapsed.
1326 */
1327 if (retval && (state->path.active > 1)) {
1328 xfs_bmap_init(args->flist, args->firstblock);
1329 error = xfs_da3_join(state);
1330 if (!error) {
1331 error = xfs_bmap_finish(&args->trans, args->flist,
1332 &committed);
1333 }
1334 if (error) {
1335 ASSERT(committed);
1336 args->trans = NULL;
1337 xfs_bmap_cancel(args->flist);
1338 goto out;
1339 }
1340
1341 /*
1342 * bmap_finish() may have committed the last trans and started
1343 * a new one. We need the inode to be in all transactions.
1344 */
1345 if (committed)
1346 xfs_trans_ijoin(args->trans, dp, 0);
1347
1348 /*
1349 * Commit the Btree join operation and start a new trans.
1350 */
1351 error = xfs_trans_roll(&args->trans, dp);
1352 if (error)
1353 goto out;
1354 }
1355
1356 /*
1357 * If the result is small enough, push it all into the inode.
1358 */
1359 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1360 /*
1361 * Have to get rid of the copy of this dabuf in the state.
1362 */
1363 ASSERT(state->path.active == 1);
1364 ASSERT(state->path.blk[0].bp);
1365 state->path.blk[0].bp = NULL;
1366
1367 error = xfs_attr3_leaf_read(args->trans, args->dp, 0, -1, &bp);
1368 if (error)
1369 goto out;
1370
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 */
1375 if (!error) {
1376 error = xfs_bmap_finish(&args->trans,
1377 args->flist,
1378 &committed);
1379 }
1380 if (error) {
1381 ASSERT(committed);
1382 args->trans = NULL;
1383 xfs_bmap_cancel(args->flist);
1384 goto out;
1385 }
1386
1387 /*
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.
1391 */
1392 if (committed)
1393 xfs_trans_ijoin(args->trans, dp, 0);
1394 } else
1395 xfs_trans_brelse(args->trans, bp);
1396 }
1397 error = 0;
1398
1399out:
1400 xfs_da_state_free(state);
1401 return(error);
1402}
1403
1404/*
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.
1409 */
1410STATIC int
1411xfs_attr_fillstate(xfs_da_state_t *state)
1412{
1413 xfs_da_state_path_t *path;
1414 xfs_da_state_blk_t *blk;
1415 int level;
1416
1417 trace_xfs_attr_fillstate(state->args);
1418
1419 /*
1420 * Roll down the "path" in the state structure, storing the on-disk
1421 * block number for those buffers in the "path".
1422 */
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++) {
1426 if (blk->bp) {
1427 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1428 blk->bp = NULL;
1429 } else {
1430 blk->disk_blkno = 0;
1431 }
1432 }
1433
1434 /*
1435 * Roll down the "altpath" in the state structure, storing the on-disk
1436 * block number for those buffers in the "altpath".
1437 */
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++) {
1441 if (blk->bp) {
1442 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1443 blk->bp = NULL;
1444 } else {
1445 blk->disk_blkno = 0;
1446 }
1447 }
1448
1449 return(0);
1450}
1451
1452/*
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.
1457 */
1458STATIC int
1459xfs_attr_refillstate(xfs_da_state_t *state)
1460{
1461 xfs_da_state_path_t *path;
1462 xfs_da_state_blk_t *blk;
1463 int level, error;
1464
1465 trace_xfs_attr_refillstate(state->args);
1466
1467 /*
1468 * Roll down the "path" in the state structure, storing the on-disk
1469 * block number for those buffers in the "path".
1470 */
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,
1476 state->args->dp,
1477 blk->blkno, blk->disk_blkno,
1478 &blk->bp, XFS_ATTR_FORK);
1479 if (error)
1480 return(error);
1481 } else {
1482 blk->bp = NULL;
1483 }
1484 }
1485
1486 /*
1487 * Roll down the "altpath" in the state structure, storing the on-disk
1488 * block number for those buffers in the "altpath".
1489 */
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,
1495 state->args->dp,
1496 blk->blkno, blk->disk_blkno,
1497 &blk->bp, XFS_ATTR_FORK);
1498 if (error)
1499 return(error);
1500 } else {
1501 blk->bp = NULL;
1502 }
1503 }
1504
1505 return(0);
1506}
1507
1508/*
1509 * Look up a filename in a node attribute list.
1510 *
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.
1514 */
1515STATIC int
1516xfs_attr_node_get(xfs_da_args_t *args)
1517{
1518 xfs_da_state_t *state;
1519 xfs_da_state_blk_t *blk;
1520 int error, retval;
1521 int i;
1522
1523 trace_xfs_attr_node_get(args);
1524
1525 state = xfs_da_state_alloc();
1526 state->args = args;
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;
1530
1531 /*
1532 * Search to see if name exists, and get back a pointer to it.
1533 */
1534 error = xfs_da3_node_lookup_int(state, &retval);
1535 if (error) {
1536 retval = error;
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);
1541
1542 /*
1543 * Get the value, local or "remote"
1544 */
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);
1549 }
1550 }
1551
1552 /*
1553 * If not in a transaction, we have to release all the buffers.
1554 */
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;
1558 }
1559
1560 xfs_da_state_free(state);
1561 return(retval);
1562}