]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blob - fs/xfs/xfs_attr.c
projects / mirror_ubuntu-zesty-kernel.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge branch 'tda998x-fixes' of git://ftp.arm.linux.org.uk/~rmk/linux-cubox into...
[mirror_ubuntu-zesty-kernel.git] / fs / xfs / xfs_attr.c
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 */
60 STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args);
61
62 /*
63 * Internal routines when attribute list is one block.
64 */
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);
68
69 /*
70 * Internal routines when attribute list is more than one block.
71 */
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);
77
78
79 STATIC int
80 xfs_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
94 int
95 xfs_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
109 STATIC int
110 xfs_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
157 int
158 xfs_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 */
187 STATIC int
188 xfs_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_B_TO_FSB(mp, valuelen);
217 nblks += dblocks;
218 nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK);
219 }
220
221 return nblks;
222 }
223
224 STATIC int
225 xfs_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
431 out:
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
439 int
440 xfs_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 */
466 STATIC int
467 xfs_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
579 out:
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
587 int
588 xfs_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 */
624 STATIC int
625 xfs_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 */
667 STATIC int
668 xfs_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 args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */
702 args->blkno2 = args->blkno; /* set 2nd entry info*/
703 args->index2 = args->index;
704 args->rmtblkno2 = args->rmtblkno;
705 args->rmtblkcnt2 = args->rmtblkcnt;
706 }
707
708 /*
709 * Add the attribute to the leaf block, transitioning to a Btree
710 * if required.
711 */
712 retval = xfs_attr3_leaf_add(bp, args);
713 if (retval == ENOSPC) {
714 /*
715 * Promote the attribute list to the Btree format, then
716 * Commit that transaction so that the node_addname() call
717 * can manage its own transactions.
718 */
719 xfs_bmap_init(args->flist, args->firstblock);
720 error = xfs_attr3_leaf_to_node(args);
721 if (!error) {
722 error = xfs_bmap_finish(&args->trans, args->flist,
723 &committed);
724 }
725 if (error) {
726 ASSERT(committed);
727 args->trans = NULL;
728 xfs_bmap_cancel(args->flist);
729 return(error);
730 }
731
732 /*
733 * bmap_finish() may have committed the last trans and started
734 * a new one. We need the inode to be in all transactions.
735 */
736 if (committed)
737 xfs_trans_ijoin(args->trans, dp, 0);
738
739 /*
740 * Commit the current trans (including the inode) and start
741 * a new one.
742 */
743 error = xfs_trans_roll(&args->trans, dp);
744 if (error)
745 return (error);
746
747 /*
748 * Fob the whole rest of the problem off on the Btree code.
749 */
750 error = xfs_attr_node_addname(args);
751 return(error);
752 }
753
754 /*
755 * Commit the transaction that added the attr name so that
756 * later routines can manage their own transactions.
757 */
758 error = xfs_trans_roll(&args->trans, dp);
759 if (error)
760 return (error);
761
762 /*
763 * If there was an out-of-line value, allocate the blocks we
764 * identified for its storage and copy the value. This is done
765 * after we create the attribute so that we don't overflow the
766 * maximum size of a transaction and/or hit a deadlock.
767 */
768 if (args->rmtblkno > 0) {
769 error = xfs_attr_rmtval_set(args);
770 if (error)
771 return(error);
772 }
773
774 /*
775 * If this is an atomic rename operation, we must "flip" the
776 * incomplete flags on the "new" and "old" attribute/value pairs
777 * so that one disappears and one appears atomically. Then we
778 * must remove the "old" attribute/value pair.
779 */
780 if (args->op_flags & XFS_DA_OP_RENAME) {
781 /*
782 * In a separate transaction, set the incomplete flag on the
783 * "old" attr and clear the incomplete flag on the "new" attr.
784 */
785 error = xfs_attr3_leaf_flipflags(args);
786 if (error)
787 return(error);
788
789 /*
790 * Dismantle the "old" attribute/value pair by removing
791 * a "remote" value (if it exists).
792 */
793 args->index = args->index2;
794 args->blkno = args->blkno2;
795 args->rmtblkno = args->rmtblkno2;
796 args->rmtblkcnt = args->rmtblkcnt2;
797 if (args->rmtblkno) {
798 error = xfs_attr_rmtval_remove(args);
799 if (error)
800 return(error);
801 }
802
803 /*
804 * Read in the block containing the "old" attr, then
805 * remove the "old" attr from that block (neat, huh!)
806 */
807 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno,
808 -1, &bp);
809 if (error)
810 return error;
811
812 xfs_attr3_leaf_remove(bp, args);
813
814 /*
815 * If the result is small enough, shrink it all into the inode.
816 */
817 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
818 xfs_bmap_init(args->flist, args->firstblock);
819 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
820 /* bp is gone due to xfs_da_shrink_inode */
821 if (!error) {
822 error = xfs_bmap_finish(&args->trans,
823 args->flist,
824 &committed);
825 }
826 if (error) {
827 ASSERT(committed);
828 args->trans = NULL;
829 xfs_bmap_cancel(args->flist);
830 return(error);
831 }
832
833 /*
834 * bmap_finish() may have committed the last trans
835 * and started a new one. We need the inode to be
836 * in all transactions.
837 */
838 if (committed)
839 xfs_trans_ijoin(args->trans, dp, 0);
840 }
841
842 /*
843 * Commit the remove and start the next trans in series.
844 */
845 error = xfs_trans_roll(&args->trans, dp);
846
847 } else if (args->rmtblkno > 0) {
848 /*
849 * Added a "remote" value, just clear the incomplete flag.
850 */
851 error = xfs_attr3_leaf_clearflag(args);
852 }
853 return error;
854 }
855
856 /*
857 * Remove a name from the leaf attribute list structure
858 *
859 * This leaf block cannot have a "remote" value, we only call this routine
860 * if bmap_one_block() says there is only one block (ie: no remote blks).
861 */
862 STATIC int
863 xfs_attr_leaf_removename(xfs_da_args_t *args)
864 {
865 xfs_inode_t *dp;
866 struct xfs_buf *bp;
867 int error, committed, forkoff;
868
869 trace_xfs_attr_leaf_removename(args);
870
871 /*
872 * Remove the attribute.
873 */
874 dp = args->dp;
875 args->blkno = 0;
876 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
877 if (error)
878 return error;
879
880 error = xfs_attr3_leaf_lookup_int(bp, args);
881 if (error == ENOATTR) {
882 xfs_trans_brelse(args->trans, bp);
883 return error;
884 }
885
886 xfs_attr3_leaf_remove(bp, args);
887
888 /*
889 * If the result is small enough, shrink it all into the inode.
890 */
891 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
892 xfs_bmap_init(args->flist, args->firstblock);
893 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
894 /* bp is gone due to xfs_da_shrink_inode */
895 if (!error) {
896 error = xfs_bmap_finish(&args->trans, args->flist,
897 &committed);
898 }
899 if (error) {
900 ASSERT(committed);
901 args->trans = NULL;
902 xfs_bmap_cancel(args->flist);
903 return error;
904 }
905
906 /*
907 * bmap_finish() may have committed the last trans and started
908 * a new one. We need the inode to be in all transactions.
909 */
910 if (committed)
911 xfs_trans_ijoin(args->trans, dp, 0);
912 }
913 return 0;
914 }
915
916 /*
917 * Look up a name in a leaf attribute list structure.
918 *
919 * This leaf block cannot have a "remote" value, we only call this routine
920 * if bmap_one_block() says there is only one block (ie: no remote blks).
921 */
922 STATIC int
923 xfs_attr_leaf_get(xfs_da_args_t *args)
924 {
925 struct xfs_buf *bp;
926 int error;
927
928 trace_xfs_attr_leaf_get(args);
929
930 args->blkno = 0;
931 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
932 if (error)
933 return error;
934
935 error = xfs_attr3_leaf_lookup_int(bp, args);
936 if (error != EEXIST) {
937 xfs_trans_brelse(args->trans, bp);
938 return error;
939 }
940 error = xfs_attr3_leaf_getvalue(bp, args);
941 xfs_trans_brelse(args->trans, bp);
942 if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) {
943 error = xfs_attr_rmtval_get(args);
944 }
945 return error;
946 }
947
948 /*========================================================================
949 * External routines when attribute list size > XFS_LBSIZE(mp).
950 *========================================================================*/
951
952 /*
953 * Add a name to a Btree-format attribute list.
954 *
955 * This will involve walking down the Btree, and may involve splitting
956 * leaf nodes and even splitting intermediate nodes up to and including
957 * the root node (a special case of an intermediate node).
958 *
959 * "Remote" attribute values confuse the issue and atomic rename operations
960 * add a whole extra layer of confusion on top of that.
961 */
962 STATIC int
963 xfs_attr_node_addname(xfs_da_args_t *args)
964 {
965 xfs_da_state_t *state;
966 xfs_da_state_blk_t *blk;
967 xfs_inode_t *dp;
968 xfs_mount_t *mp;
969 int committed, retval, error;
970
971 trace_xfs_attr_node_addname(args);
972
973 /*
974 * Fill in bucket of arguments/results/context to carry around.
975 */
976 dp = args->dp;
977 mp = dp->i_mount;
978 restart:
979 state = xfs_da_state_alloc();
980 state->args = args;
981 state->mp = mp;
982 state->blocksize = state->mp->m_sb.sb_blocksize;
983 state->node_ents = state->mp->m_attr_node_ents;
984
985 /*
986 * Search to see if name already exists, and get back a pointer
987 * to where it should go.
988 */
989 error = xfs_da3_node_lookup_int(state, &retval);
990 if (error)
991 goto out;
992 blk = &state->path.blk[ state->path.active-1 ];
993 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
994 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
995 goto out;
996 } else if (retval == EEXIST) {
997 if (args->flags & ATTR_CREATE)
998 goto out;
999
1000 trace_xfs_attr_node_replace(args);
1001
1002 args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */
1003 args->blkno2 = args->blkno; /* set 2nd entry info*/
1004 args->index2 = args->index;
1005 args->rmtblkno2 = args->rmtblkno;
1006 args->rmtblkcnt2 = args->rmtblkcnt;
1007 args->rmtblkno = 0;
1008 args->rmtblkcnt = 0;
1009 }
1010
1011 retval = xfs_attr3_leaf_add(blk->bp, state->args);
1012 if (retval == ENOSPC) {
1013 if (state->path.active == 1) {
1014 /*
1015 * Its really a single leaf node, but it had
1016 * out-of-line values so it looked like it *might*
1017 * have been a b-tree.
1018 */
1019 xfs_da_state_free(state);
1020 state = NULL;
1021 xfs_bmap_init(args->flist, args->firstblock);
1022 error = xfs_attr3_leaf_to_node(args);
1023 if (!error) {
1024 error = xfs_bmap_finish(&args->trans,
1025 args->flist,
1026 &committed);
1027 }
1028 if (error) {
1029 ASSERT(committed);
1030 args->trans = NULL;
1031 xfs_bmap_cancel(args->flist);
1032 goto out;
1033 }
1034
1035 /*
1036 * bmap_finish() may have committed the last trans
1037 * and started a new one. We need the inode to be
1038 * in all transactions.
1039 */
1040 if (committed)
1041 xfs_trans_ijoin(args->trans, dp, 0);
1042
1043 /*
1044 * Commit the node conversion and start the next
1045 * trans in the chain.
1046 */
1047 error = xfs_trans_roll(&args->trans, dp);
1048 if (error)
1049 goto out;
1050
1051 goto restart;
1052 }
1053
1054 /*
1055 * Split as many Btree elements as required.
1056 * This code tracks the new and old attr's location
1057 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1058 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1059 */
1060 xfs_bmap_init(args->flist, args->firstblock);
1061 error = xfs_da3_split(state);
1062 if (!error) {
1063 error = xfs_bmap_finish(&args->trans, args->flist,
1064 &committed);
1065 }
1066 if (error) {
1067 ASSERT(committed);
1068 args->trans = NULL;
1069 xfs_bmap_cancel(args->flist);
1070 goto out;
1071 }
1072
1073 /*
1074 * bmap_finish() may have committed the last trans and started
1075 * a new one. We need the inode to be in all transactions.
1076 */
1077 if (committed)
1078 xfs_trans_ijoin(args->trans, dp, 0);
1079 } else {
1080 /*
1081 * Addition succeeded, update Btree hashvals.
1082 */
1083 xfs_da3_fixhashpath(state, &state->path);
1084 }
1085
1086 /*
1087 * Kill the state structure, we're done with it and need to
1088 * allow the buffers to come back later.
1089 */
1090 xfs_da_state_free(state);
1091 state = NULL;
1092
1093 /*
1094 * Commit the leaf addition or btree split and start the next
1095 * trans in the chain.
1096 */
1097 error = xfs_trans_roll(&args->trans, dp);
1098 if (error)
1099 goto out;
1100
1101 /*
1102 * If there was an out-of-line value, allocate the blocks we
1103 * identified for its storage and copy the value. This is done
1104 * after we create the attribute so that we don't overflow the
1105 * maximum size of a transaction and/or hit a deadlock.
1106 */
1107 if (args->rmtblkno > 0) {
1108 error = xfs_attr_rmtval_set(args);
1109 if (error)
1110 return(error);
1111 }
1112
1113 /*
1114 * If this is an atomic rename operation, we must "flip" the
1115 * incomplete flags on the "new" and "old" attribute/value pairs
1116 * so that one disappears and one appears atomically. Then we
1117 * must remove the "old" attribute/value pair.
1118 */
1119 if (args->op_flags & XFS_DA_OP_RENAME) {
1120 /*
1121 * In a separate transaction, set the incomplete flag on the
1122 * "old" attr and clear the incomplete flag on the "new" attr.
1123 */
1124 error = xfs_attr3_leaf_flipflags(args);
1125 if (error)
1126 goto out;
1127
1128 /*
1129 * Dismantle the "old" attribute/value pair by removing
1130 * a "remote" value (if it exists).
1131 */
1132 args->index = args->index2;
1133 args->blkno = args->blkno2;
1134 args->rmtblkno = args->rmtblkno2;
1135 args->rmtblkcnt = args->rmtblkcnt2;
1136 if (args->rmtblkno) {
1137 error = xfs_attr_rmtval_remove(args);
1138 if (error)
1139 return(error);
1140 }
1141
1142 /*
1143 * Re-find the "old" attribute entry after any split ops.
1144 * The INCOMPLETE flag means that we will find the "old"
1145 * attr, not the "new" one.
1146 */
1147 args->flags |= XFS_ATTR_INCOMPLETE;
1148 state = xfs_da_state_alloc();
1149 state->args = args;
1150 state->mp = mp;
1151 state->blocksize = state->mp->m_sb.sb_blocksize;
1152 state->node_ents = state->mp->m_attr_node_ents;
1153 state->inleaf = 0;
1154 error = xfs_da3_node_lookup_int(state, &retval);
1155 if (error)
1156 goto out;
1157
1158 /*
1159 * Remove the name and update the hashvals in the tree.
1160 */
1161 blk = &state->path.blk[ state->path.active-1 ];
1162 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1163 error = xfs_attr3_leaf_remove(blk->bp, args);
1164 xfs_da3_fixhashpath(state, &state->path);
1165
1166 /*
1167 * Check to see if the tree needs to be collapsed.
1168 */
1169 if (retval && (state->path.active > 1)) {
1170 xfs_bmap_init(args->flist, args->firstblock);
1171 error = xfs_da3_join(state);
1172 if (!error) {
1173 error = xfs_bmap_finish(&args->trans,
1174 args->flist,
1175 &committed);
1176 }
1177 if (error) {
1178 ASSERT(committed);
1179 args->trans = NULL;
1180 xfs_bmap_cancel(args->flist);
1181 goto out;
1182 }
1183
1184 /*
1185 * bmap_finish() may have committed the last trans
1186 * and started a new one. We need the inode to be
1187 * in all transactions.
1188 */
1189 if (committed)
1190 xfs_trans_ijoin(args->trans, dp, 0);
1191 }
1192
1193 /*
1194 * Commit and start the next trans in the chain.
1195 */
1196 error = xfs_trans_roll(&args->trans, dp);
1197 if (error)
1198 goto out;
1199
1200 } else if (args->rmtblkno > 0) {
1201 /*
1202 * Added a "remote" value, just clear the incomplete flag.
1203 */
1204 error = xfs_attr3_leaf_clearflag(args);
1205 if (error)
1206 goto out;
1207 }
1208 retval = error = 0;
1209
1210 out:
1211 if (state)
1212 xfs_da_state_free(state);
1213 if (error)
1214 return(error);
1215 return(retval);
1216 }
1217
1218 /*
1219 * Remove a name from a B-tree attribute list.
1220 *
1221 * This will involve walking down the Btree, and may involve joining
1222 * leaf nodes and even joining intermediate nodes up to and including
1223 * the root node (a special case of an intermediate node).
1224 */
1225 STATIC int
1226 xfs_attr_node_removename(xfs_da_args_t *args)
1227 {
1228 xfs_da_state_t *state;
1229 xfs_da_state_blk_t *blk;
1230 xfs_inode_t *dp;
1231 struct xfs_buf *bp;
1232 int retval, error, committed, forkoff;
1233
1234 trace_xfs_attr_node_removename(args);
1235
1236 /*
1237 * Tie a string around our finger to remind us where we are.
1238 */
1239 dp = args->dp;
1240 state = xfs_da_state_alloc();
1241 state->args = args;
1242 state->mp = dp->i_mount;
1243 state->blocksize = state->mp->m_sb.sb_blocksize;
1244 state->node_ents = state->mp->m_attr_node_ents;
1245
1246 /*
1247 * Search to see if name exists, and get back a pointer to it.
1248 */
1249 error = xfs_da3_node_lookup_int(state, &retval);
1250 if (error || (retval != EEXIST)) {
1251 if (error == 0)
1252 error = retval;
1253 goto out;
1254 }
1255
1256 /*
1257 * If there is an out-of-line value, de-allocate the blocks.
1258 * This is done before we remove the attribute so that we don't
1259 * overflow the maximum size of a transaction and/or hit a deadlock.
1260 */
1261 blk = &state->path.blk[ state->path.active-1 ];
1262 ASSERT(blk->bp != NULL);
1263 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1264 if (args->rmtblkno > 0) {
1265 /*
1266 * Fill in disk block numbers in the state structure
1267 * so that we can get the buffers back after we commit
1268 * several transactions in the following calls.
1269 */
1270 error = xfs_attr_fillstate(state);
1271 if (error)
1272 goto out;
1273
1274 /*
1275 * Mark the attribute as INCOMPLETE, then bunmapi() the
1276 * remote value.
1277 */
1278 error = xfs_attr3_leaf_setflag(args);
1279 if (error)
1280 goto out;
1281 error = xfs_attr_rmtval_remove(args);
1282 if (error)
1283 goto out;
1284
1285 /*
1286 * Refill the state structure with buffers, the prior calls
1287 * released our buffers.
1288 */
1289 error = xfs_attr_refillstate(state);
1290 if (error)
1291 goto out;
1292 }
1293
1294 /*
1295 * Remove the name and update the hashvals in the tree.
1296 */
1297 blk = &state->path.blk[ state->path.active-1 ];
1298 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1299 retval = xfs_attr3_leaf_remove(blk->bp, args);
1300 xfs_da3_fixhashpath(state, &state->path);
1301
1302 /*
1303 * Check to see if the tree needs to be collapsed.
1304 */
1305 if (retval && (state->path.active > 1)) {
1306 xfs_bmap_init(args->flist, args->firstblock);
1307 error = xfs_da3_join(state);
1308 if (!error) {
1309 error = xfs_bmap_finish(&args->trans, args->flist,
1310 &committed);
1311 }
1312 if (error) {
1313 ASSERT(committed);
1314 args->trans = NULL;
1315 xfs_bmap_cancel(args->flist);
1316 goto out;
1317 }
1318
1319 /*
1320 * bmap_finish() may have committed the last trans and started
1321 * a new one. We need the inode to be in all transactions.
1322 */
1323 if (committed)
1324 xfs_trans_ijoin(args->trans, dp, 0);
1325
1326 /*
1327 * Commit the Btree join operation and start a new trans.
1328 */
1329 error = xfs_trans_roll(&args->trans, dp);
1330 if (error)
1331 goto out;
1332 }
1333
1334 /*
1335 * If the result is small enough, push it all into the inode.
1336 */
1337 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1338 /*
1339 * Have to get rid of the copy of this dabuf in the state.
1340 */
1341 ASSERT(state->path.active == 1);
1342 ASSERT(state->path.blk[0].bp);
1343 state->path.blk[0].bp = NULL;
1344
1345 error = xfs_attr3_leaf_read(args->trans, args->dp, 0, -1, &bp);
1346 if (error)
1347 goto out;
1348
1349 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1350 xfs_bmap_init(args->flist, args->firstblock);
1351 error = xfs_attr3_leaf_to_shortform(bp, args, forkoff);
1352 /* bp is gone due to xfs_da_shrink_inode */
1353 if (!error) {
1354 error = xfs_bmap_finish(&args->trans,
1355 args->flist,
1356 &committed);
1357 }
1358 if (error) {
1359 ASSERT(committed);
1360 args->trans = NULL;
1361 xfs_bmap_cancel(args->flist);
1362 goto out;
1363 }
1364
1365 /*
1366 * bmap_finish() may have committed the last trans
1367 * and started a new one. We need the inode to be
1368 * in all transactions.
1369 */
1370 if (committed)
1371 xfs_trans_ijoin(args->trans, dp, 0);
1372 } else
1373 xfs_trans_brelse(args->trans, bp);
1374 }
1375 error = 0;
1376
1377 out:
1378 xfs_da_state_free(state);
1379 return(error);
1380 }
1381
1382 /*
1383 * Fill in the disk block numbers in the state structure for the buffers
1384 * that are attached to the state structure.
1385 * This is done so that we can quickly reattach ourselves to those buffers
1386 * after some set of transaction commits have released these buffers.
1387 */
1388 STATIC int
1389 xfs_attr_fillstate(xfs_da_state_t *state)
1390 {
1391 xfs_da_state_path_t *path;
1392 xfs_da_state_blk_t *blk;
1393 int level;
1394
1395 trace_xfs_attr_fillstate(state->args);
1396
1397 /*
1398 * Roll down the "path" in the state structure, storing the on-disk
1399 * block number for those buffers in the "path".
1400 */
1401 path = &state->path;
1402 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1403 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1404 if (blk->bp) {
1405 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1406 blk->bp = NULL;
1407 } else {
1408 blk->disk_blkno = 0;
1409 }
1410 }
1411
1412 /*
1413 * Roll down the "altpath" in the state structure, storing the on-disk
1414 * block number for those buffers in the "altpath".
1415 */
1416 path = &state->altpath;
1417 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1418 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1419 if (blk->bp) {
1420 blk->disk_blkno = XFS_BUF_ADDR(blk->bp);
1421 blk->bp = NULL;
1422 } else {
1423 blk->disk_blkno = 0;
1424 }
1425 }
1426
1427 return(0);
1428 }
1429
1430 /*
1431 * Reattach the buffers to the state structure based on the disk block
1432 * numbers stored in the state structure.
1433 * This is done after some set of transaction commits have released those
1434 * buffers from our grip.
1435 */
1436 STATIC int
1437 xfs_attr_refillstate(xfs_da_state_t *state)
1438 {
1439 xfs_da_state_path_t *path;
1440 xfs_da_state_blk_t *blk;
1441 int level, error;
1442
1443 trace_xfs_attr_refillstate(state->args);
1444
1445 /*
1446 * Roll down the "path" in the state structure, storing the on-disk
1447 * block number for those buffers in the "path".
1448 */
1449 path = &state->path;
1450 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1451 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1452 if (blk->disk_blkno) {
1453 error = xfs_da3_node_read(state->args->trans,
1454 state->args->dp,
1455 blk->blkno, blk->disk_blkno,
1456 &blk->bp, XFS_ATTR_FORK);
1457 if (error)
1458 return(error);
1459 } else {
1460 blk->bp = NULL;
1461 }
1462 }
1463
1464 /*
1465 * Roll down the "altpath" in the state structure, storing the on-disk
1466 * block number for those buffers in the "altpath".
1467 */
1468 path = &state->altpath;
1469 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1470 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1471 if (blk->disk_blkno) {
1472 error = xfs_da3_node_read(state->args->trans,
1473 state->args->dp,
1474 blk->blkno, blk->disk_blkno,
1475 &blk->bp, XFS_ATTR_FORK);
1476 if (error)
1477 return(error);
1478 } else {
1479 blk->bp = NULL;
1480 }
1481 }
1482
1483 return(0);
1484 }
1485
1486 /*
1487 * Look up a filename in a node attribute list.
1488 *
1489 * This routine gets called for any attribute fork that has more than one
1490 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1491 * "remote" values taking up more blocks.
1492 */
1493 STATIC int
1494 xfs_attr_node_get(xfs_da_args_t *args)
1495 {
1496 xfs_da_state_t *state;
1497 xfs_da_state_blk_t *blk;
1498 int error, retval;
1499 int i;
1500
1501 trace_xfs_attr_node_get(args);
1502
1503 state = xfs_da_state_alloc();
1504 state->args = args;
1505 state->mp = args->dp->i_mount;
1506 state->blocksize = state->mp->m_sb.sb_blocksize;
1507 state->node_ents = state->mp->m_attr_node_ents;
1508
1509 /*
1510 * Search to see if name exists, and get back a pointer to it.
1511 */
1512 error = xfs_da3_node_lookup_int(state, &retval);
1513 if (error) {
1514 retval = error;
1515 } else if (retval == EEXIST) {
1516 blk = &state->path.blk[ state->path.active-1 ];
1517 ASSERT(blk->bp != NULL);
1518 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1519
1520 /*
1521 * Get the value, local or "remote"
1522 */
1523 retval = xfs_attr3_leaf_getvalue(blk->bp, args);
1524 if (!retval && (args->rmtblkno > 0)
1525 && !(args->flags & ATTR_KERNOVAL)) {
1526 retval = xfs_attr_rmtval_get(args);
1527 }
1528 }
1529
1530 /*
1531 * If not in a transaction, we have to release all the buffers.
1532 */
1533 for (i = 0; i < state->path.active; i++) {
1534 xfs_trans_brelse(args->trans, state->path.blk[i].bp);
1535 state->path.blk[i].bp = NULL;
1536 }
1537
1538 xfs_da_state_free(state);
1539 return(retval);
1540 }
ubuntu-zesty-kernel mirror