Loading...
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}
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
19#include "xfs.h"
20#include "xfs_fs.h"
21#include "xfs_types.h"
22#include "xfs_bit.h"
23#include "xfs_log.h"
24#include "xfs_trans.h"
25#include "xfs_sb.h"
26#include "xfs_ag.h"
27#include "xfs_mount.h"
28#include "xfs_da_btree.h"
29#include "xfs_bmap_btree.h"
30#include "xfs_attr_sf.h"
31#include "xfs_dinode.h"
32#include "xfs_inode.h"
33#include "xfs_alloc.h"
34#include "xfs_inode_item.h"
35#include "xfs_bmap.h"
36#include "xfs_attr.h"
37#include "xfs_attr_leaf.h"
38#include "xfs_error.h"
39#include "xfs_quota.h"
40#include "xfs_trans_space.h"
41#include "xfs_vnodeops.h"
42#include "xfs_trace.h"
43
44/*
45 * xfs_attr.c
46 *
47 * Provide the external interfaces to manage attribute lists.
48 */
49
50/*========================================================================
51 * Function prototypes for the kernel.
52 *========================================================================*/
53
54/*
55 * Internal routines when attribute list fits inside the inode.
56 */
57STATIC int xfs_attr_shortform_addname(xfs_da_args_t *args);
58
59/*
60 * Internal routines when attribute list is one block.
61 */
62STATIC int xfs_attr_leaf_get(xfs_da_args_t *args);
63STATIC int xfs_attr_leaf_addname(xfs_da_args_t *args);
64STATIC int xfs_attr_leaf_removename(xfs_da_args_t *args);
65STATIC int xfs_attr_leaf_list(xfs_attr_list_context_t *context);
66
67/*
68 * Internal routines when attribute list is more than one block.
69 */
70STATIC int xfs_attr_node_get(xfs_da_args_t *args);
71STATIC int xfs_attr_node_addname(xfs_da_args_t *args);
72STATIC int xfs_attr_node_removename(xfs_da_args_t *args);
73STATIC int xfs_attr_node_list(xfs_attr_list_context_t *context);
74STATIC int xfs_attr_fillstate(xfs_da_state_t *state);
75STATIC int xfs_attr_refillstate(xfs_da_state_t *state);
76
77/*
78 * Routines to manipulate out-of-line attribute values.
79 */
80STATIC int xfs_attr_rmtval_set(xfs_da_args_t *args);
81STATIC int xfs_attr_rmtval_remove(xfs_da_args_t *args);
82
83#define ATTR_RMTVALUE_MAPSIZE 1 /* # of map entries at once */
84
85STATIC int
86xfs_attr_name_to_xname(
87 struct xfs_name *xname,
88 const unsigned char *aname)
89{
90 if (!aname)
91 return EINVAL;
92 xname->name = aname;
93 xname->len = strlen((char *)aname);
94 if (xname->len >= MAXNAMELEN)
95 return EFAULT; /* match IRIX behaviour */
96
97 return 0;
98}
99
100STATIC int
101xfs_inode_hasattr(
102 struct xfs_inode *ip)
103{
104 if (!XFS_IFORK_Q(ip) ||
105 (ip->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS &&
106 ip->i_d.di_anextents == 0))
107 return 0;
108 return 1;
109}
110
111/*========================================================================
112 * Overall external interface routines.
113 *========================================================================*/
114
115STATIC int
116xfs_attr_get_int(
117 struct xfs_inode *ip,
118 struct xfs_name *name,
119 unsigned char *value,
120 int *valuelenp,
121 int flags)
122{
123 xfs_da_args_t args;
124 int error;
125
126 if (!xfs_inode_hasattr(ip))
127 return ENOATTR;
128
129 /*
130 * Fill in the arg structure for this request.
131 */
132 memset((char *)&args, 0, sizeof(args));
133 args.name = name->name;
134 args.namelen = name->len;
135 args.value = value;
136 args.valuelen = *valuelenp;
137 args.flags = flags;
138 args.hashval = xfs_da_hashname(args.name, args.namelen);
139 args.dp = ip;
140 args.whichfork = XFS_ATTR_FORK;
141
142 /*
143 * Decide on what work routines to call based on the inode size.
144 */
145 if (ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
146 error = xfs_attr_shortform_getvalue(&args);
147 } else if (xfs_bmap_one_block(ip, XFS_ATTR_FORK)) {
148 error = xfs_attr_leaf_get(&args);
149 } else {
150 error = xfs_attr_node_get(&args);
151 }
152
153 /*
154 * Return the number of bytes in the value to the caller.
155 */
156 *valuelenp = args.valuelen;
157
158 if (error == EEXIST)
159 error = 0;
160 return(error);
161}
162
163int
164xfs_attr_get(
165 xfs_inode_t *ip,
166 const unsigned char *name,
167 unsigned char *value,
168 int *valuelenp,
169 int flags)
170{
171 int error;
172 struct xfs_name xname;
173
174 XFS_STATS_INC(xs_attr_get);
175
176 if (XFS_FORCED_SHUTDOWN(ip->i_mount))
177 return(EIO);
178
179 error = xfs_attr_name_to_xname(&xname, name);
180 if (error)
181 return error;
182
183 xfs_ilock(ip, XFS_ILOCK_SHARED);
184 error = xfs_attr_get_int(ip, &xname, value, valuelenp, flags);
185 xfs_iunlock(ip, XFS_ILOCK_SHARED);
186 return(error);
187}
188
189/*
190 * Calculate how many blocks we need for the new attribute,
191 */
192STATIC int
193xfs_attr_calc_size(
194 struct xfs_inode *ip,
195 int namelen,
196 int valuelen,
197 int *local)
198{
199 struct xfs_mount *mp = ip->i_mount;
200 int size;
201 int nblks;
202
203 /*
204 * Determine space new attribute will use, and if it would be
205 * "local" or "remote" (note: local != inline).
206 */
207 size = xfs_attr_leaf_newentsize(namelen, valuelen,
208 mp->m_sb.sb_blocksize, local);
209
210 nblks = XFS_DAENTER_SPACE_RES(mp, XFS_ATTR_FORK);
211 if (*local) {
212 if (size > (mp->m_sb.sb_blocksize >> 1)) {
213 /* Double split possible */
214 nblks *= 2;
215 }
216 } else {
217 /*
218 * Out of line attribute, cannot double split, but
219 * make room for the attribute value itself.
220 */
221 uint dblocks = XFS_B_TO_FSB(mp, valuelen);
222 nblks += dblocks;
223 nblks += XFS_NEXTENTADD_SPACE_RES(mp, dblocks, XFS_ATTR_FORK);
224 }
225
226 return nblks;
227}
228
229STATIC int
230xfs_attr_set_int(
231 struct xfs_inode *dp,
232 struct xfs_name *name,
233 unsigned char *value,
234 int valuelen,
235 int flags)
236{
237 xfs_da_args_t args;
238 xfs_fsblock_t firstblock;
239 xfs_bmap_free_t flist;
240 int error, err2, committed;
241 xfs_mount_t *mp = dp->i_mount;
242 int rsvd = (flags & ATTR_ROOT) != 0;
243 int local;
244
245 /*
246 * Attach the dquots to the inode.
247 */
248 error = xfs_qm_dqattach(dp, 0);
249 if (error)
250 return error;
251
252 /*
253 * If the inode doesn't have an attribute fork, add one.
254 * (inode must not be locked when we call this routine)
255 */
256 if (XFS_IFORK_Q(dp) == 0) {
257 int sf_size = sizeof(xfs_attr_sf_hdr_t) +
258 XFS_ATTR_SF_ENTSIZE_BYNAME(name->len, valuelen);
259
260 if ((error = xfs_bmap_add_attrfork(dp, sf_size, rsvd)))
261 return(error);
262 }
263
264 /*
265 * Fill in the arg structure for this request.
266 */
267 memset((char *)&args, 0, sizeof(args));
268 args.name = name->name;
269 args.namelen = name->len;
270 args.value = value;
271 args.valuelen = valuelen;
272 args.flags = flags;
273 args.hashval = xfs_da_hashname(args.name, args.namelen);
274 args.dp = dp;
275 args.firstblock = &firstblock;
276 args.flist = &flist;
277 args.whichfork = XFS_ATTR_FORK;
278 args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
279
280 /* Size is now blocks for attribute data */
281 args.total = xfs_attr_calc_size(dp, name->len, valuelen, &local);
282
283 /*
284 * Start our first transaction of the day.
285 *
286 * All future transactions during this code must be "chained" off
287 * this one via the trans_dup() call. All transactions will contain
288 * the inode, and the inode will always be marked with trans_ihold().
289 * Since the inode will be locked in all transactions, we must log
290 * the inode in every transaction to let it float upward through
291 * the log.
292 */
293 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_SET);
294
295 /*
296 * Root fork attributes can use reserved data blocks for this
297 * operation if necessary
298 */
299
300 if (rsvd)
301 args.trans->t_flags |= XFS_TRANS_RESERVE;
302
303 if ((error = xfs_trans_reserve(args.trans, args.total,
304 XFS_ATTRSET_LOG_RES(mp, args.total), 0,
305 XFS_TRANS_PERM_LOG_RES, XFS_ATTRSET_LOG_COUNT))) {
306 xfs_trans_cancel(args.trans, 0);
307 return(error);
308 }
309 xfs_ilock(dp, XFS_ILOCK_EXCL);
310
311 error = xfs_trans_reserve_quota_nblks(args.trans, dp, args.total, 0,
312 rsvd ? XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES :
313 XFS_QMOPT_RES_REGBLKS);
314 if (error) {
315 xfs_iunlock(dp, XFS_ILOCK_EXCL);
316 xfs_trans_cancel(args.trans, XFS_TRANS_RELEASE_LOG_RES);
317 return (error);
318 }
319
320 xfs_trans_ijoin(args.trans, dp, 0);
321
322 /*
323 * If the attribute list is non-existent or a shortform list,
324 * upgrade it to a single-leaf-block attribute list.
325 */
326 if ((dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) ||
327 ((dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) &&
328 (dp->i_d.di_anextents == 0))) {
329
330 /*
331 * Build initial attribute list (if required).
332 */
333 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS)
334 xfs_attr_shortform_create(&args);
335
336 /*
337 * Try to add the attr to the attribute list in
338 * the inode.
339 */
340 error = xfs_attr_shortform_addname(&args);
341 if (error != ENOSPC) {
342 /*
343 * Commit the shortform mods, and we're done.
344 * NOTE: this is also the error path (EEXIST, etc).
345 */
346 ASSERT(args.trans != NULL);
347
348 /*
349 * If this is a synchronous mount, make sure that
350 * the transaction goes to disk before returning
351 * to the user.
352 */
353 if (mp->m_flags & XFS_MOUNT_WSYNC) {
354 xfs_trans_set_sync(args.trans);
355 }
356
357 if (!error && (flags & ATTR_KERNOTIME) == 0) {
358 xfs_trans_ichgtime(args.trans, dp,
359 XFS_ICHGTIME_CHG);
360 }
361 err2 = xfs_trans_commit(args.trans,
362 XFS_TRANS_RELEASE_LOG_RES);
363 xfs_iunlock(dp, XFS_ILOCK_EXCL);
364
365 return(error == 0 ? err2 : error);
366 }
367
368 /*
369 * It won't fit in the shortform, transform to a leaf block.
370 * GROT: another possible req'mt for a double-split btree op.
371 */
372 xfs_bmap_init(args.flist, args.firstblock);
373 error = xfs_attr_shortform_to_leaf(&args);
374 if (!error) {
375 error = xfs_bmap_finish(&args.trans, args.flist,
376 &committed);
377 }
378 if (error) {
379 ASSERT(committed);
380 args.trans = NULL;
381 xfs_bmap_cancel(&flist);
382 goto out;
383 }
384
385 /*
386 * bmap_finish() may have committed the last trans and started
387 * a new one. We need the inode to be in all transactions.
388 */
389 if (committed)
390 xfs_trans_ijoin(args.trans, dp, 0);
391
392 /*
393 * Commit the leaf transformation. We'll need another (linked)
394 * transaction to add the new attribute to the leaf.
395 */
396
397 error = xfs_trans_roll(&args.trans, dp);
398 if (error)
399 goto out;
400
401 }
402
403 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
404 error = xfs_attr_leaf_addname(&args);
405 } else {
406 error = xfs_attr_node_addname(&args);
407 }
408 if (error) {
409 goto out;
410 }
411
412 /*
413 * If this is a synchronous mount, make sure that the
414 * transaction goes to disk before returning to the user.
415 */
416 if (mp->m_flags & XFS_MOUNT_WSYNC) {
417 xfs_trans_set_sync(args.trans);
418 }
419
420 if ((flags & ATTR_KERNOTIME) == 0)
421 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
422
423 /*
424 * Commit the last in the sequence of transactions.
425 */
426 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
427 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
428 xfs_iunlock(dp, XFS_ILOCK_EXCL);
429
430 return(error);
431
432out:
433 if (args.trans)
434 xfs_trans_cancel(args.trans,
435 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
436 xfs_iunlock(dp, XFS_ILOCK_EXCL);
437 return(error);
438}
439
440int
441xfs_attr_set(
442 xfs_inode_t *dp,
443 const unsigned char *name,
444 unsigned char *value,
445 int valuelen,
446 int flags)
447{
448 int error;
449 struct xfs_name xname;
450
451 XFS_STATS_INC(xs_attr_set);
452
453 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
454 return (EIO);
455
456 error = xfs_attr_name_to_xname(&xname, name);
457 if (error)
458 return error;
459
460 return xfs_attr_set_int(dp, &xname, value, valuelen, flags);
461}
462
463/*
464 * Generic handler routine to remove a name from an attribute list.
465 * Transitions attribute list from Btree to shortform as necessary.
466 */
467STATIC int
468xfs_attr_remove_int(xfs_inode_t *dp, struct xfs_name *name, int flags)
469{
470 xfs_da_args_t args;
471 xfs_fsblock_t firstblock;
472 xfs_bmap_free_t flist;
473 int error;
474 xfs_mount_t *mp = dp->i_mount;
475
476 /*
477 * Fill in the arg structure for this request.
478 */
479 memset((char *)&args, 0, sizeof(args));
480 args.name = name->name;
481 args.namelen = name->len;
482 args.flags = flags;
483 args.hashval = xfs_da_hashname(args.name, args.namelen);
484 args.dp = dp;
485 args.firstblock = &firstblock;
486 args.flist = &flist;
487 args.total = 0;
488 args.whichfork = XFS_ATTR_FORK;
489
490 /*
491 * we have no control over the attribute names that userspace passes us
492 * to remove, so we have to allow the name lookup prior to attribute
493 * removal to fail.
494 */
495 args.op_flags = XFS_DA_OP_OKNOENT;
496
497 /*
498 * Attach the dquots to the inode.
499 */
500 error = xfs_qm_dqattach(dp, 0);
501 if (error)
502 return error;
503
504 /*
505 * Start our first transaction of the day.
506 *
507 * All future transactions during this code must be "chained" off
508 * this one via the trans_dup() call. All transactions will contain
509 * the inode, and the inode will always be marked with trans_ihold().
510 * Since the inode will be locked in all transactions, we must log
511 * the inode in every transaction to let it float upward through
512 * the log.
513 */
514 args.trans = xfs_trans_alloc(mp, XFS_TRANS_ATTR_RM);
515
516 /*
517 * Root fork attributes can use reserved data blocks for this
518 * operation if necessary
519 */
520
521 if (flags & ATTR_ROOT)
522 args.trans->t_flags |= XFS_TRANS_RESERVE;
523
524 if ((error = xfs_trans_reserve(args.trans,
525 XFS_ATTRRM_SPACE_RES(mp),
526 XFS_ATTRRM_LOG_RES(mp),
527 0, XFS_TRANS_PERM_LOG_RES,
528 XFS_ATTRRM_LOG_COUNT))) {
529 xfs_trans_cancel(args.trans, 0);
530 return(error);
531 }
532
533 xfs_ilock(dp, XFS_ILOCK_EXCL);
534 /*
535 * No need to make quota reservations here. We expect to release some
536 * blocks not allocate in the common case.
537 */
538 xfs_trans_ijoin(args.trans, dp, 0);
539
540 /*
541 * Decide on what work routines to call based on the inode size.
542 */
543 if (!xfs_inode_hasattr(dp)) {
544 error = XFS_ERROR(ENOATTR);
545 goto out;
546 }
547 if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
548 ASSERT(dp->i_afp->if_flags & XFS_IFINLINE);
549 error = xfs_attr_shortform_remove(&args);
550 if (error) {
551 goto out;
552 }
553 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
554 error = xfs_attr_leaf_removename(&args);
555 } else {
556 error = xfs_attr_node_removename(&args);
557 }
558 if (error) {
559 goto out;
560 }
561
562 /*
563 * If this is a synchronous mount, make sure that the
564 * transaction goes to disk before returning to the user.
565 */
566 if (mp->m_flags & XFS_MOUNT_WSYNC) {
567 xfs_trans_set_sync(args.trans);
568 }
569
570 if ((flags & ATTR_KERNOTIME) == 0)
571 xfs_trans_ichgtime(args.trans, dp, XFS_ICHGTIME_CHG);
572
573 /*
574 * Commit the last in the sequence of transactions.
575 */
576 xfs_trans_log_inode(args.trans, dp, XFS_ILOG_CORE);
577 error = xfs_trans_commit(args.trans, XFS_TRANS_RELEASE_LOG_RES);
578 xfs_iunlock(dp, XFS_ILOCK_EXCL);
579
580 return(error);
581
582out:
583 if (args.trans)
584 xfs_trans_cancel(args.trans,
585 XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
586 xfs_iunlock(dp, XFS_ILOCK_EXCL);
587 return(error);
588}
589
590int
591xfs_attr_remove(
592 xfs_inode_t *dp,
593 const unsigned char *name,
594 int flags)
595{
596 int error;
597 struct xfs_name xname;
598
599 XFS_STATS_INC(xs_attr_remove);
600
601 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
602 return (EIO);
603
604 error = xfs_attr_name_to_xname(&xname, name);
605 if (error)
606 return error;
607
608 xfs_ilock(dp, XFS_ILOCK_SHARED);
609 if (!xfs_inode_hasattr(dp)) {
610 xfs_iunlock(dp, XFS_ILOCK_SHARED);
611 return XFS_ERROR(ENOATTR);
612 }
613 xfs_iunlock(dp, XFS_ILOCK_SHARED);
614
615 return xfs_attr_remove_int(dp, &xname, flags);
616}
617
618int
619xfs_attr_list_int(xfs_attr_list_context_t *context)
620{
621 int error;
622 xfs_inode_t *dp = context->dp;
623
624 XFS_STATS_INC(xs_attr_list);
625
626 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
627 return EIO;
628
629 xfs_ilock(dp, XFS_ILOCK_SHARED);
630
631 /*
632 * Decide on what work routines to call based on the inode size.
633 */
634 if (!xfs_inode_hasattr(dp)) {
635 error = 0;
636 } else if (dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
637 error = xfs_attr_shortform_list(context);
638 } else if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
639 error = xfs_attr_leaf_list(context);
640 } else {
641 error = xfs_attr_node_list(context);
642 }
643
644 xfs_iunlock(dp, XFS_ILOCK_SHARED);
645
646 return error;
647}
648
649#define ATTR_ENTBASESIZE /* minimum bytes used by an attr */ \
650 (((struct attrlist_ent *) 0)->a_name - (char *) 0)
651#define ATTR_ENTSIZE(namelen) /* actual bytes used by an attr */ \
652 ((ATTR_ENTBASESIZE + (namelen) + 1 + sizeof(u_int32_t)-1) \
653 & ~(sizeof(u_int32_t)-1))
654
655/*
656 * Format an attribute and copy it out to the user's buffer.
657 * Take care to check values and protect against them changing later,
658 * we may be reading them directly out of a user buffer.
659 */
660/*ARGSUSED*/
661STATIC int
662xfs_attr_put_listent(
663 xfs_attr_list_context_t *context,
664 int flags,
665 unsigned char *name,
666 int namelen,
667 int valuelen,
668 unsigned char *value)
669{
670 struct attrlist *alist = (struct attrlist *)context->alist;
671 attrlist_ent_t *aep;
672 int arraytop;
673
674 ASSERT(!(context->flags & ATTR_KERNOVAL));
675 ASSERT(context->count >= 0);
676 ASSERT(context->count < (ATTR_MAX_VALUELEN/8));
677 ASSERT(context->firstu >= sizeof(*alist));
678 ASSERT(context->firstu <= context->bufsize);
679
680 /*
681 * Only list entries in the right namespace.
682 */
683 if (((context->flags & ATTR_SECURE) == 0) !=
684 ((flags & XFS_ATTR_SECURE) == 0))
685 return 0;
686 if (((context->flags & ATTR_ROOT) == 0) !=
687 ((flags & XFS_ATTR_ROOT) == 0))
688 return 0;
689
690 arraytop = sizeof(*alist) +
691 context->count * sizeof(alist->al_offset[0]);
692 context->firstu -= ATTR_ENTSIZE(namelen);
693 if (context->firstu < arraytop) {
694 trace_xfs_attr_list_full(context);
695 alist->al_more = 1;
696 context->seen_enough = 1;
697 return 1;
698 }
699
700 aep = (attrlist_ent_t *)&context->alist[context->firstu];
701 aep->a_valuelen = valuelen;
702 memcpy(aep->a_name, name, namelen);
703 aep->a_name[namelen] = 0;
704 alist->al_offset[context->count++] = context->firstu;
705 alist->al_count = context->count;
706 trace_xfs_attr_list_add(context);
707 return 0;
708}
709
710/*
711 * Generate a list of extended attribute names and optionally
712 * also value lengths. Positive return value follows the XFS
713 * convention of being an error, zero or negative return code
714 * is the length of the buffer returned (negated), indicating
715 * success.
716 */
717int
718xfs_attr_list(
719 xfs_inode_t *dp,
720 char *buffer,
721 int bufsize,
722 int flags,
723 attrlist_cursor_kern_t *cursor)
724{
725 xfs_attr_list_context_t context;
726 struct attrlist *alist;
727 int error;
728
729 /*
730 * Validate the cursor.
731 */
732 if (cursor->pad1 || cursor->pad2)
733 return(XFS_ERROR(EINVAL));
734 if ((cursor->initted == 0) &&
735 (cursor->hashval || cursor->blkno || cursor->offset))
736 return XFS_ERROR(EINVAL);
737
738 /*
739 * Check for a properly aligned buffer.
740 */
741 if (((long)buffer) & (sizeof(int)-1))
742 return XFS_ERROR(EFAULT);
743 if (flags & ATTR_KERNOVAL)
744 bufsize = 0;
745
746 /*
747 * Initialize the output buffer.
748 */
749 memset(&context, 0, sizeof(context));
750 context.dp = dp;
751 context.cursor = cursor;
752 context.resynch = 1;
753 context.flags = flags;
754 context.alist = buffer;
755 context.bufsize = (bufsize & ~(sizeof(int)-1)); /* align */
756 context.firstu = context.bufsize;
757 context.put_listent = xfs_attr_put_listent;
758
759 alist = (struct attrlist *)context.alist;
760 alist->al_count = 0;
761 alist->al_more = 0;
762 alist->al_offset[0] = context.bufsize;
763
764 error = xfs_attr_list_int(&context);
765 ASSERT(error >= 0);
766 return error;
767}
768
769int /* error */
770xfs_attr_inactive(xfs_inode_t *dp)
771{
772 xfs_trans_t *trans;
773 xfs_mount_t *mp;
774 int error;
775
776 mp = dp->i_mount;
777 ASSERT(! XFS_NOT_DQATTACHED(mp, dp));
778
779 xfs_ilock(dp, XFS_ILOCK_SHARED);
780 if (!xfs_inode_hasattr(dp) ||
781 dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
782 xfs_iunlock(dp, XFS_ILOCK_SHARED);
783 return 0;
784 }
785 xfs_iunlock(dp, XFS_ILOCK_SHARED);
786
787 /*
788 * Start our first transaction of the day.
789 *
790 * All future transactions during this code must be "chained" off
791 * this one via the trans_dup() call. All transactions will contain
792 * the inode, and the inode will always be marked with trans_ihold().
793 * Since the inode will be locked in all transactions, we must log
794 * the inode in every transaction to let it float upward through
795 * the log.
796 */
797 trans = xfs_trans_alloc(mp, XFS_TRANS_ATTRINVAL);
798 if ((error = xfs_trans_reserve(trans, 0, XFS_ATTRINVAL_LOG_RES(mp), 0,
799 XFS_TRANS_PERM_LOG_RES,
800 XFS_ATTRINVAL_LOG_COUNT))) {
801 xfs_trans_cancel(trans, 0);
802 return(error);
803 }
804 xfs_ilock(dp, XFS_ILOCK_EXCL);
805
806 /*
807 * No need to make quota reservations here. We expect to release some
808 * blocks, not allocate, in the common case.
809 */
810 xfs_trans_ijoin(trans, dp, 0);
811
812 /*
813 * Decide on what work routines to call based on the inode size.
814 */
815 if (!xfs_inode_hasattr(dp) ||
816 dp->i_d.di_aformat == XFS_DINODE_FMT_LOCAL) {
817 error = 0;
818 goto out;
819 }
820 error = xfs_attr_root_inactive(&trans, dp);
821 if (error)
822 goto out;
823
824 error = xfs_itruncate_extents(&trans, dp, XFS_ATTR_FORK, 0);
825 if (error)
826 goto out;
827
828 error = xfs_trans_commit(trans, XFS_TRANS_RELEASE_LOG_RES);
829 xfs_iunlock(dp, XFS_ILOCK_EXCL);
830
831 return(error);
832
833out:
834 xfs_trans_cancel(trans, XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT);
835 xfs_iunlock(dp, XFS_ILOCK_EXCL);
836 return(error);
837}
838
839
840
841/*========================================================================
842 * External routines when attribute list is inside the inode
843 *========================================================================*/
844
845/*
846 * Add a name to the shortform attribute list structure
847 * This is the external routine.
848 */
849STATIC int
850xfs_attr_shortform_addname(xfs_da_args_t *args)
851{
852 int newsize, forkoff, retval;
853
854 trace_xfs_attr_sf_addname(args);
855
856 retval = xfs_attr_shortform_lookup(args);
857 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
858 return(retval);
859 } else if (retval == EEXIST) {
860 if (args->flags & ATTR_CREATE)
861 return(retval);
862 retval = xfs_attr_shortform_remove(args);
863 ASSERT(retval == 0);
864 }
865
866 if (args->namelen >= XFS_ATTR_SF_ENTSIZE_MAX ||
867 args->valuelen >= XFS_ATTR_SF_ENTSIZE_MAX)
868 return(XFS_ERROR(ENOSPC));
869
870 newsize = XFS_ATTR_SF_TOTSIZE(args->dp);
871 newsize += XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
872
873 forkoff = xfs_attr_shortform_bytesfit(args->dp, newsize);
874 if (!forkoff)
875 return(XFS_ERROR(ENOSPC));
876
877 xfs_attr_shortform_add(args, forkoff);
878 return(0);
879}
880
881
882/*========================================================================
883 * External routines when attribute list is one block
884 *========================================================================*/
885
886/*
887 * Add a name to the leaf attribute list structure
888 *
889 * This leaf block cannot have a "remote" value, we only call this routine
890 * if bmap_one_block() says there is only one block (ie: no remote blks).
891 */
892STATIC int
893xfs_attr_leaf_addname(xfs_da_args_t *args)
894{
895 xfs_inode_t *dp;
896 xfs_dabuf_t *bp;
897 int retval, error, committed, forkoff;
898
899 trace_xfs_attr_leaf_addname(args);
900
901 /*
902 * Read the (only) block in the attribute list in.
903 */
904 dp = args->dp;
905 args->blkno = 0;
906 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
907 XFS_ATTR_FORK);
908 if (error)
909 return(error);
910 ASSERT(bp != NULL);
911
912 /*
913 * Look up the given attribute in the leaf block. Figure out if
914 * the given flags produce an error or call for an atomic rename.
915 */
916 retval = xfs_attr_leaf_lookup_int(bp, args);
917 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
918 xfs_da_brelse(args->trans, bp);
919 return(retval);
920 } else if (retval == EEXIST) {
921 if (args->flags & ATTR_CREATE) { /* pure create op */
922 xfs_da_brelse(args->trans, bp);
923 return(retval);
924 }
925
926 trace_xfs_attr_leaf_replace(args);
927
928 args->op_flags |= XFS_DA_OP_RENAME; /* an atomic rename */
929 args->blkno2 = args->blkno; /* set 2nd entry info*/
930 args->index2 = args->index;
931 args->rmtblkno2 = args->rmtblkno;
932 args->rmtblkcnt2 = args->rmtblkcnt;
933 }
934
935 /*
936 * Add the attribute to the leaf block, transitioning to a Btree
937 * if required.
938 */
939 retval = xfs_attr_leaf_add(bp, args);
940 xfs_da_buf_done(bp);
941 if (retval == ENOSPC) {
942 /*
943 * Promote the attribute list to the Btree format, then
944 * Commit that transaction so that the node_addname() call
945 * can manage its own transactions.
946 */
947 xfs_bmap_init(args->flist, args->firstblock);
948 error = xfs_attr_leaf_to_node(args);
949 if (!error) {
950 error = xfs_bmap_finish(&args->trans, args->flist,
951 &committed);
952 }
953 if (error) {
954 ASSERT(committed);
955 args->trans = NULL;
956 xfs_bmap_cancel(args->flist);
957 return(error);
958 }
959
960 /*
961 * bmap_finish() may have committed the last trans and started
962 * a new one. We need the inode to be in all transactions.
963 */
964 if (committed)
965 xfs_trans_ijoin(args->trans, dp, 0);
966
967 /*
968 * Commit the current trans (including the inode) and start
969 * a new one.
970 */
971 error = xfs_trans_roll(&args->trans, dp);
972 if (error)
973 return (error);
974
975 /*
976 * Fob the whole rest of the problem off on the Btree code.
977 */
978 error = xfs_attr_node_addname(args);
979 return(error);
980 }
981
982 /*
983 * Commit the transaction that added the attr name so that
984 * later routines can manage their own transactions.
985 */
986 error = xfs_trans_roll(&args->trans, dp);
987 if (error)
988 return (error);
989
990 /*
991 * If there was an out-of-line value, allocate the blocks we
992 * identified for its storage and copy the value. This is done
993 * after we create the attribute so that we don't overflow the
994 * maximum size of a transaction and/or hit a deadlock.
995 */
996 if (args->rmtblkno > 0) {
997 error = xfs_attr_rmtval_set(args);
998 if (error)
999 return(error);
1000 }
1001
1002 /*
1003 * If this is an atomic rename operation, we must "flip" the
1004 * incomplete flags on the "new" and "old" attribute/value pairs
1005 * so that one disappears and one appears atomically. Then we
1006 * must remove the "old" attribute/value pair.
1007 */
1008 if (args->op_flags & XFS_DA_OP_RENAME) {
1009 /*
1010 * In a separate transaction, set the incomplete flag on the
1011 * "old" attr and clear the incomplete flag on the "new" attr.
1012 */
1013 error = xfs_attr_leaf_flipflags(args);
1014 if (error)
1015 return(error);
1016
1017 /*
1018 * Dismantle the "old" attribute/value pair by removing
1019 * a "remote" value (if it exists).
1020 */
1021 args->index = args->index2;
1022 args->blkno = args->blkno2;
1023 args->rmtblkno = args->rmtblkno2;
1024 args->rmtblkcnt = args->rmtblkcnt2;
1025 if (args->rmtblkno) {
1026 error = xfs_attr_rmtval_remove(args);
1027 if (error)
1028 return(error);
1029 }
1030
1031 /*
1032 * Read in the block containing the "old" attr, then
1033 * remove the "old" attr from that block (neat, huh!)
1034 */
1035 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1,
1036 &bp, XFS_ATTR_FORK);
1037 if (error)
1038 return(error);
1039 ASSERT(bp != NULL);
1040 (void)xfs_attr_leaf_remove(bp, args);
1041
1042 /*
1043 * If the result is small enough, shrink it all into the inode.
1044 */
1045 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1046 xfs_bmap_init(args->flist, args->firstblock);
1047 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1048 /* bp is gone due to xfs_da_shrink_inode */
1049 if (!error) {
1050 error = xfs_bmap_finish(&args->trans,
1051 args->flist,
1052 &committed);
1053 }
1054 if (error) {
1055 ASSERT(committed);
1056 args->trans = NULL;
1057 xfs_bmap_cancel(args->flist);
1058 return(error);
1059 }
1060
1061 /*
1062 * bmap_finish() may have committed the last trans
1063 * and started a new one. We need the inode to be
1064 * in all transactions.
1065 */
1066 if (committed)
1067 xfs_trans_ijoin(args->trans, dp, 0);
1068 } else
1069 xfs_da_buf_done(bp);
1070
1071 /*
1072 * Commit the remove and start the next trans in series.
1073 */
1074 error = xfs_trans_roll(&args->trans, dp);
1075
1076 } else if (args->rmtblkno > 0) {
1077 /*
1078 * Added a "remote" value, just clear the incomplete flag.
1079 */
1080 error = xfs_attr_leaf_clearflag(args);
1081 }
1082 return(error);
1083}
1084
1085/*
1086 * Remove a name from the leaf attribute list structure
1087 *
1088 * This leaf block cannot have a "remote" value, we only call this routine
1089 * if bmap_one_block() says there is only one block (ie: no remote blks).
1090 */
1091STATIC int
1092xfs_attr_leaf_removename(xfs_da_args_t *args)
1093{
1094 xfs_inode_t *dp;
1095 xfs_dabuf_t *bp;
1096 int error, committed, forkoff;
1097
1098 trace_xfs_attr_leaf_removename(args);
1099
1100 /*
1101 * Remove the attribute.
1102 */
1103 dp = args->dp;
1104 args->blkno = 0;
1105 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
1106 XFS_ATTR_FORK);
1107 if (error) {
1108 return(error);
1109 }
1110
1111 ASSERT(bp != NULL);
1112 error = xfs_attr_leaf_lookup_int(bp, args);
1113 if (error == ENOATTR) {
1114 xfs_da_brelse(args->trans, bp);
1115 return(error);
1116 }
1117
1118 (void)xfs_attr_leaf_remove(bp, args);
1119
1120 /*
1121 * If the result is small enough, shrink it all into the inode.
1122 */
1123 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1124 xfs_bmap_init(args->flist, args->firstblock);
1125 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1126 /* bp is gone due to xfs_da_shrink_inode */
1127 if (!error) {
1128 error = xfs_bmap_finish(&args->trans, args->flist,
1129 &committed);
1130 }
1131 if (error) {
1132 ASSERT(committed);
1133 args->trans = NULL;
1134 xfs_bmap_cancel(args->flist);
1135 return(error);
1136 }
1137
1138 /*
1139 * bmap_finish() may have committed the last trans and started
1140 * a new one. We need the inode to be in all transactions.
1141 */
1142 if (committed)
1143 xfs_trans_ijoin(args->trans, dp, 0);
1144 } else
1145 xfs_da_buf_done(bp);
1146 return(0);
1147}
1148
1149/*
1150 * Look up a name in a leaf attribute list structure.
1151 *
1152 * This leaf block cannot have a "remote" value, we only call this routine
1153 * if bmap_one_block() says there is only one block (ie: no remote blks).
1154 */
1155STATIC int
1156xfs_attr_leaf_get(xfs_da_args_t *args)
1157{
1158 xfs_dabuf_t *bp;
1159 int error;
1160
1161 args->blkno = 0;
1162 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
1163 XFS_ATTR_FORK);
1164 if (error)
1165 return(error);
1166 ASSERT(bp != NULL);
1167
1168 error = xfs_attr_leaf_lookup_int(bp, args);
1169 if (error != EEXIST) {
1170 xfs_da_brelse(args->trans, bp);
1171 return(error);
1172 }
1173 error = xfs_attr_leaf_getvalue(bp, args);
1174 xfs_da_brelse(args->trans, bp);
1175 if (!error && (args->rmtblkno > 0) && !(args->flags & ATTR_KERNOVAL)) {
1176 error = xfs_attr_rmtval_get(args);
1177 }
1178 return(error);
1179}
1180
1181/*
1182 * Copy out attribute entries for attr_list(), for leaf attribute lists.
1183 */
1184STATIC int
1185xfs_attr_leaf_list(xfs_attr_list_context_t *context)
1186{
1187 xfs_attr_leafblock_t *leaf;
1188 int error;
1189 xfs_dabuf_t *bp;
1190
1191 context->cursor->blkno = 0;
1192 error = xfs_da_read_buf(NULL, context->dp, 0, -1, &bp, XFS_ATTR_FORK);
1193 if (error)
1194 return XFS_ERROR(error);
1195 ASSERT(bp != NULL);
1196 leaf = bp->data;
1197 if (unlikely(leaf->hdr.info.magic != cpu_to_be16(XFS_ATTR_LEAF_MAGIC))) {
1198 XFS_CORRUPTION_ERROR("xfs_attr_leaf_list", XFS_ERRLEVEL_LOW,
1199 context->dp->i_mount, leaf);
1200 xfs_da_brelse(NULL, bp);
1201 return XFS_ERROR(EFSCORRUPTED);
1202 }
1203
1204 error = xfs_attr_leaf_list_int(bp, context);
1205 xfs_da_brelse(NULL, bp);
1206 return XFS_ERROR(error);
1207}
1208
1209
1210/*========================================================================
1211 * External routines when attribute list size > XFS_LBSIZE(mp).
1212 *========================================================================*/
1213
1214/*
1215 * Add a name to a Btree-format attribute list.
1216 *
1217 * This will involve walking down the Btree, and may involve splitting
1218 * leaf nodes and even splitting intermediate nodes up to and including
1219 * the root node (a special case of an intermediate node).
1220 *
1221 * "Remote" attribute values confuse the issue and atomic rename operations
1222 * add a whole extra layer of confusion on top of that.
1223 */
1224STATIC int
1225xfs_attr_node_addname(xfs_da_args_t *args)
1226{
1227 xfs_da_state_t *state;
1228 xfs_da_state_blk_t *blk;
1229 xfs_inode_t *dp;
1230 xfs_mount_t *mp;
1231 int committed, retval, error;
1232
1233 trace_xfs_attr_node_addname(args);
1234
1235 /*
1236 * Fill in bucket of arguments/results/context to carry around.
1237 */
1238 dp = args->dp;
1239 mp = dp->i_mount;
1240restart:
1241 state = xfs_da_state_alloc();
1242 state->args = args;
1243 state->mp = mp;
1244 state->blocksize = state->mp->m_sb.sb_blocksize;
1245 state->node_ents = state->mp->m_attr_node_ents;
1246
1247 /*
1248 * Search to see if name already exists, and get back a pointer
1249 * to where it should go.
1250 */
1251 error = xfs_da_node_lookup_int(state, &retval);
1252 if (error)
1253 goto out;
1254 blk = &state->path.blk[ state->path.active-1 ];
1255 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1256 if ((args->flags & ATTR_REPLACE) && (retval == ENOATTR)) {
1257 goto out;
1258 } else if (retval == EEXIST) {
1259 if (args->flags & ATTR_CREATE)
1260 goto out;
1261
1262 trace_xfs_attr_node_replace(args);
1263
1264 args->op_flags |= XFS_DA_OP_RENAME; /* atomic rename op */
1265 args->blkno2 = args->blkno; /* set 2nd entry info*/
1266 args->index2 = args->index;
1267 args->rmtblkno2 = args->rmtblkno;
1268 args->rmtblkcnt2 = args->rmtblkcnt;
1269 args->rmtblkno = 0;
1270 args->rmtblkcnt = 0;
1271 }
1272
1273 retval = xfs_attr_leaf_add(blk->bp, state->args);
1274 if (retval == ENOSPC) {
1275 if (state->path.active == 1) {
1276 /*
1277 * Its really a single leaf node, but it had
1278 * out-of-line values so it looked like it *might*
1279 * have been a b-tree.
1280 */
1281 xfs_da_state_free(state);
1282 xfs_bmap_init(args->flist, args->firstblock);
1283 error = xfs_attr_leaf_to_node(args);
1284 if (!error) {
1285 error = xfs_bmap_finish(&args->trans,
1286 args->flist,
1287 &committed);
1288 }
1289 if (error) {
1290 ASSERT(committed);
1291 args->trans = NULL;
1292 xfs_bmap_cancel(args->flist);
1293 goto out;
1294 }
1295
1296 /*
1297 * bmap_finish() may have committed the last trans
1298 * and started a new one. We need the inode to be
1299 * in all transactions.
1300 */
1301 if (committed)
1302 xfs_trans_ijoin(args->trans, dp, 0);
1303
1304 /*
1305 * Commit the node conversion and start the next
1306 * trans in the chain.
1307 */
1308 error = xfs_trans_roll(&args->trans, dp);
1309 if (error)
1310 goto out;
1311
1312 goto restart;
1313 }
1314
1315 /*
1316 * Split as many Btree elements as required.
1317 * This code tracks the new and old attr's location
1318 * in the index/blkno/rmtblkno/rmtblkcnt fields and
1319 * in the index2/blkno2/rmtblkno2/rmtblkcnt2 fields.
1320 */
1321 xfs_bmap_init(args->flist, args->firstblock);
1322 error = xfs_da_split(state);
1323 if (!error) {
1324 error = xfs_bmap_finish(&args->trans, args->flist,
1325 &committed);
1326 }
1327 if (error) {
1328 ASSERT(committed);
1329 args->trans = NULL;
1330 xfs_bmap_cancel(args->flist);
1331 goto out;
1332 }
1333
1334 /*
1335 * bmap_finish() may have committed the last trans and started
1336 * a new one. We need the inode to be in all transactions.
1337 */
1338 if (committed)
1339 xfs_trans_ijoin(args->trans, dp, 0);
1340 } else {
1341 /*
1342 * Addition succeeded, update Btree hashvals.
1343 */
1344 xfs_da_fixhashpath(state, &state->path);
1345 }
1346
1347 /*
1348 * Kill the state structure, we're done with it and need to
1349 * allow the buffers to come back later.
1350 */
1351 xfs_da_state_free(state);
1352 state = NULL;
1353
1354 /*
1355 * Commit the leaf addition or btree split and start the next
1356 * trans in the chain.
1357 */
1358 error = xfs_trans_roll(&args->trans, dp);
1359 if (error)
1360 goto out;
1361
1362 /*
1363 * If there was an out-of-line value, allocate the blocks we
1364 * identified for its storage and copy the value. This is done
1365 * after we create the attribute so that we don't overflow the
1366 * maximum size of a transaction and/or hit a deadlock.
1367 */
1368 if (args->rmtblkno > 0) {
1369 error = xfs_attr_rmtval_set(args);
1370 if (error)
1371 return(error);
1372 }
1373
1374 /*
1375 * If this is an atomic rename operation, we must "flip" the
1376 * incomplete flags on the "new" and "old" attribute/value pairs
1377 * so that one disappears and one appears atomically. Then we
1378 * must remove the "old" attribute/value pair.
1379 */
1380 if (args->op_flags & XFS_DA_OP_RENAME) {
1381 /*
1382 * In a separate transaction, set the incomplete flag on the
1383 * "old" attr and clear the incomplete flag on the "new" attr.
1384 */
1385 error = xfs_attr_leaf_flipflags(args);
1386 if (error)
1387 goto out;
1388
1389 /*
1390 * Dismantle the "old" attribute/value pair by removing
1391 * a "remote" value (if it exists).
1392 */
1393 args->index = args->index2;
1394 args->blkno = args->blkno2;
1395 args->rmtblkno = args->rmtblkno2;
1396 args->rmtblkcnt = args->rmtblkcnt2;
1397 if (args->rmtblkno) {
1398 error = xfs_attr_rmtval_remove(args);
1399 if (error)
1400 return(error);
1401 }
1402
1403 /*
1404 * Re-find the "old" attribute entry after any split ops.
1405 * The INCOMPLETE flag means that we will find the "old"
1406 * attr, not the "new" one.
1407 */
1408 args->flags |= XFS_ATTR_INCOMPLETE;
1409 state = xfs_da_state_alloc();
1410 state->args = args;
1411 state->mp = mp;
1412 state->blocksize = state->mp->m_sb.sb_blocksize;
1413 state->node_ents = state->mp->m_attr_node_ents;
1414 state->inleaf = 0;
1415 error = xfs_da_node_lookup_int(state, &retval);
1416 if (error)
1417 goto out;
1418
1419 /*
1420 * Remove the name and update the hashvals in the tree.
1421 */
1422 blk = &state->path.blk[ state->path.active-1 ];
1423 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1424 error = xfs_attr_leaf_remove(blk->bp, args);
1425 xfs_da_fixhashpath(state, &state->path);
1426
1427 /*
1428 * Check to see if the tree needs to be collapsed.
1429 */
1430 if (retval && (state->path.active > 1)) {
1431 xfs_bmap_init(args->flist, args->firstblock);
1432 error = xfs_da_join(state);
1433 if (!error) {
1434 error = xfs_bmap_finish(&args->trans,
1435 args->flist,
1436 &committed);
1437 }
1438 if (error) {
1439 ASSERT(committed);
1440 args->trans = NULL;
1441 xfs_bmap_cancel(args->flist);
1442 goto out;
1443 }
1444
1445 /*
1446 * bmap_finish() may have committed the last trans
1447 * and started a new one. We need the inode to be
1448 * in all transactions.
1449 */
1450 if (committed)
1451 xfs_trans_ijoin(args->trans, dp, 0);
1452 }
1453
1454 /*
1455 * Commit and start the next trans in the chain.
1456 */
1457 error = xfs_trans_roll(&args->trans, dp);
1458 if (error)
1459 goto out;
1460
1461 } else if (args->rmtblkno > 0) {
1462 /*
1463 * Added a "remote" value, just clear the incomplete flag.
1464 */
1465 error = xfs_attr_leaf_clearflag(args);
1466 if (error)
1467 goto out;
1468 }
1469 retval = error = 0;
1470
1471out:
1472 if (state)
1473 xfs_da_state_free(state);
1474 if (error)
1475 return(error);
1476 return(retval);
1477}
1478
1479/*
1480 * Remove a name from a B-tree attribute list.
1481 *
1482 * This will involve walking down the Btree, and may involve joining
1483 * leaf nodes and even joining intermediate nodes up to and including
1484 * the root node (a special case of an intermediate node).
1485 */
1486STATIC int
1487xfs_attr_node_removename(xfs_da_args_t *args)
1488{
1489 xfs_da_state_t *state;
1490 xfs_da_state_blk_t *blk;
1491 xfs_inode_t *dp;
1492 xfs_dabuf_t *bp;
1493 int retval, error, committed, forkoff;
1494
1495 trace_xfs_attr_node_removename(args);
1496
1497 /*
1498 * Tie a string around our finger to remind us where we are.
1499 */
1500 dp = args->dp;
1501 state = xfs_da_state_alloc();
1502 state->args = args;
1503 state->mp = dp->i_mount;
1504 state->blocksize = state->mp->m_sb.sb_blocksize;
1505 state->node_ents = state->mp->m_attr_node_ents;
1506
1507 /*
1508 * Search to see if name exists, and get back a pointer to it.
1509 */
1510 error = xfs_da_node_lookup_int(state, &retval);
1511 if (error || (retval != EEXIST)) {
1512 if (error == 0)
1513 error = retval;
1514 goto out;
1515 }
1516
1517 /*
1518 * If there is an out-of-line value, de-allocate the blocks.
1519 * This is done before we remove the attribute so that we don't
1520 * overflow the maximum size of a transaction and/or hit a deadlock.
1521 */
1522 blk = &state->path.blk[ state->path.active-1 ];
1523 ASSERT(blk->bp != NULL);
1524 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1525 if (args->rmtblkno > 0) {
1526 /*
1527 * Fill in disk block numbers in the state structure
1528 * so that we can get the buffers back after we commit
1529 * several transactions in the following calls.
1530 */
1531 error = xfs_attr_fillstate(state);
1532 if (error)
1533 goto out;
1534
1535 /*
1536 * Mark the attribute as INCOMPLETE, then bunmapi() the
1537 * remote value.
1538 */
1539 error = xfs_attr_leaf_setflag(args);
1540 if (error)
1541 goto out;
1542 error = xfs_attr_rmtval_remove(args);
1543 if (error)
1544 goto out;
1545
1546 /*
1547 * Refill the state structure with buffers, the prior calls
1548 * released our buffers.
1549 */
1550 error = xfs_attr_refillstate(state);
1551 if (error)
1552 goto out;
1553 }
1554
1555 /*
1556 * Remove the name and update the hashvals in the tree.
1557 */
1558 blk = &state->path.blk[ state->path.active-1 ];
1559 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1560 retval = xfs_attr_leaf_remove(blk->bp, args);
1561 xfs_da_fixhashpath(state, &state->path);
1562
1563 /*
1564 * Check to see if the tree needs to be collapsed.
1565 */
1566 if (retval && (state->path.active > 1)) {
1567 xfs_bmap_init(args->flist, args->firstblock);
1568 error = xfs_da_join(state);
1569 if (!error) {
1570 error = xfs_bmap_finish(&args->trans, args->flist,
1571 &committed);
1572 }
1573 if (error) {
1574 ASSERT(committed);
1575 args->trans = NULL;
1576 xfs_bmap_cancel(args->flist);
1577 goto out;
1578 }
1579
1580 /*
1581 * bmap_finish() may have committed the last trans and started
1582 * a new one. We need the inode to be in all transactions.
1583 */
1584 if (committed)
1585 xfs_trans_ijoin(args->trans, dp, 0);
1586
1587 /*
1588 * Commit the Btree join operation and start a new trans.
1589 */
1590 error = xfs_trans_roll(&args->trans, dp);
1591 if (error)
1592 goto out;
1593 }
1594
1595 /*
1596 * If the result is small enough, push it all into the inode.
1597 */
1598 if (xfs_bmap_one_block(dp, XFS_ATTR_FORK)) {
1599 /*
1600 * Have to get rid of the copy of this dabuf in the state.
1601 */
1602 ASSERT(state->path.active == 1);
1603 ASSERT(state->path.blk[0].bp);
1604 xfs_da_buf_done(state->path.blk[0].bp);
1605 state->path.blk[0].bp = NULL;
1606
1607 error = xfs_da_read_buf(args->trans, args->dp, 0, -1, &bp,
1608 XFS_ATTR_FORK);
1609 if (error)
1610 goto out;
1611 ASSERT((((xfs_attr_leafblock_t *)bp->data)->hdr.info.magic) ==
1612 cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1613
1614 if ((forkoff = xfs_attr_shortform_allfit(bp, dp))) {
1615 xfs_bmap_init(args->flist, args->firstblock);
1616 error = xfs_attr_leaf_to_shortform(bp, args, forkoff);
1617 /* bp is gone due to xfs_da_shrink_inode */
1618 if (!error) {
1619 error = xfs_bmap_finish(&args->trans,
1620 args->flist,
1621 &committed);
1622 }
1623 if (error) {
1624 ASSERT(committed);
1625 args->trans = NULL;
1626 xfs_bmap_cancel(args->flist);
1627 goto out;
1628 }
1629
1630 /*
1631 * bmap_finish() may have committed the last trans
1632 * and started a new one. We need the inode to be
1633 * in all transactions.
1634 */
1635 if (committed)
1636 xfs_trans_ijoin(args->trans, dp, 0);
1637 } else
1638 xfs_da_brelse(args->trans, bp);
1639 }
1640 error = 0;
1641
1642out:
1643 xfs_da_state_free(state);
1644 return(error);
1645}
1646
1647/*
1648 * Fill in the disk block numbers in the state structure for the buffers
1649 * that are attached to the state structure.
1650 * This is done so that we can quickly reattach ourselves to those buffers
1651 * after some set of transaction commits have released these buffers.
1652 */
1653STATIC int
1654xfs_attr_fillstate(xfs_da_state_t *state)
1655{
1656 xfs_da_state_path_t *path;
1657 xfs_da_state_blk_t *blk;
1658 int level;
1659
1660 /*
1661 * Roll down the "path" in the state structure, storing the on-disk
1662 * block number for those buffers in the "path".
1663 */
1664 path = &state->path;
1665 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1666 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1667 if (blk->bp) {
1668 blk->disk_blkno = xfs_da_blkno(blk->bp);
1669 xfs_da_buf_done(blk->bp);
1670 blk->bp = NULL;
1671 } else {
1672 blk->disk_blkno = 0;
1673 }
1674 }
1675
1676 /*
1677 * Roll down the "altpath" in the state structure, storing the on-disk
1678 * block number for those buffers in the "altpath".
1679 */
1680 path = &state->altpath;
1681 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1682 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1683 if (blk->bp) {
1684 blk->disk_blkno = xfs_da_blkno(blk->bp);
1685 xfs_da_buf_done(blk->bp);
1686 blk->bp = NULL;
1687 } else {
1688 blk->disk_blkno = 0;
1689 }
1690 }
1691
1692 return(0);
1693}
1694
1695/*
1696 * Reattach the buffers to the state structure based on the disk block
1697 * numbers stored in the state structure.
1698 * This is done after some set of transaction commits have released those
1699 * buffers from our grip.
1700 */
1701STATIC int
1702xfs_attr_refillstate(xfs_da_state_t *state)
1703{
1704 xfs_da_state_path_t *path;
1705 xfs_da_state_blk_t *blk;
1706 int level, error;
1707
1708 /*
1709 * Roll down the "path" in the state structure, storing the on-disk
1710 * block number for those buffers in the "path".
1711 */
1712 path = &state->path;
1713 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1714 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1715 if (blk->disk_blkno) {
1716 error = xfs_da_read_buf(state->args->trans,
1717 state->args->dp,
1718 blk->blkno, blk->disk_blkno,
1719 &blk->bp, XFS_ATTR_FORK);
1720 if (error)
1721 return(error);
1722 } else {
1723 blk->bp = NULL;
1724 }
1725 }
1726
1727 /*
1728 * Roll down the "altpath" in the state structure, storing the on-disk
1729 * block number for those buffers in the "altpath".
1730 */
1731 path = &state->altpath;
1732 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
1733 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
1734 if (blk->disk_blkno) {
1735 error = xfs_da_read_buf(state->args->trans,
1736 state->args->dp,
1737 blk->blkno, blk->disk_blkno,
1738 &blk->bp, XFS_ATTR_FORK);
1739 if (error)
1740 return(error);
1741 } else {
1742 blk->bp = NULL;
1743 }
1744 }
1745
1746 return(0);
1747}
1748
1749/*
1750 * Look up a filename in a node attribute list.
1751 *
1752 * This routine gets called for any attribute fork that has more than one
1753 * block, ie: both true Btree attr lists and for single-leaf-blocks with
1754 * "remote" values taking up more blocks.
1755 */
1756STATIC int
1757xfs_attr_node_get(xfs_da_args_t *args)
1758{
1759 xfs_da_state_t *state;
1760 xfs_da_state_blk_t *blk;
1761 int error, retval;
1762 int i;
1763
1764 state = xfs_da_state_alloc();
1765 state->args = args;
1766 state->mp = args->dp->i_mount;
1767 state->blocksize = state->mp->m_sb.sb_blocksize;
1768 state->node_ents = state->mp->m_attr_node_ents;
1769
1770 /*
1771 * Search to see if name exists, and get back a pointer to it.
1772 */
1773 error = xfs_da_node_lookup_int(state, &retval);
1774 if (error) {
1775 retval = error;
1776 } else if (retval == EEXIST) {
1777 blk = &state->path.blk[ state->path.active-1 ];
1778 ASSERT(blk->bp != NULL);
1779 ASSERT(blk->magic == XFS_ATTR_LEAF_MAGIC);
1780
1781 /*
1782 * Get the value, local or "remote"
1783 */
1784 retval = xfs_attr_leaf_getvalue(blk->bp, args);
1785 if (!retval && (args->rmtblkno > 0)
1786 && !(args->flags & ATTR_KERNOVAL)) {
1787 retval = xfs_attr_rmtval_get(args);
1788 }
1789 }
1790
1791 /*
1792 * If not in a transaction, we have to release all the buffers.
1793 */
1794 for (i = 0; i < state->path.active; i++) {
1795 xfs_da_brelse(args->trans, state->path.blk[i].bp);
1796 state->path.blk[i].bp = NULL;
1797 }
1798
1799 xfs_da_state_free(state);
1800 return(retval);
1801}
1802
1803STATIC int /* error */
1804xfs_attr_node_list(xfs_attr_list_context_t *context)
1805{
1806 attrlist_cursor_kern_t *cursor;
1807 xfs_attr_leafblock_t *leaf;
1808 xfs_da_intnode_t *node;
1809 xfs_da_node_entry_t *btree;
1810 int error, i;
1811 xfs_dabuf_t *bp;
1812
1813 cursor = context->cursor;
1814 cursor->initted = 1;
1815
1816 /*
1817 * Do all sorts of validation on the passed-in cursor structure.
1818 * If anything is amiss, ignore the cursor and look up the hashval
1819 * starting from the btree root.
1820 */
1821 bp = NULL;
1822 if (cursor->blkno > 0) {
1823 error = xfs_da_read_buf(NULL, context->dp, cursor->blkno, -1,
1824 &bp, XFS_ATTR_FORK);
1825 if ((error != 0) && (error != EFSCORRUPTED))
1826 return(error);
1827 if (bp) {
1828 node = bp->data;
1829 switch (be16_to_cpu(node->hdr.info.magic)) {
1830 case XFS_DA_NODE_MAGIC:
1831 trace_xfs_attr_list_wrong_blk(context);
1832 xfs_da_brelse(NULL, bp);
1833 bp = NULL;
1834 break;
1835 case XFS_ATTR_LEAF_MAGIC:
1836 leaf = bp->data;
1837 if (cursor->hashval > be32_to_cpu(leaf->entries[
1838 be16_to_cpu(leaf->hdr.count)-1].hashval)) {
1839 trace_xfs_attr_list_wrong_blk(context);
1840 xfs_da_brelse(NULL, bp);
1841 bp = NULL;
1842 } else if (cursor->hashval <=
1843 be32_to_cpu(leaf->entries[0].hashval)) {
1844 trace_xfs_attr_list_wrong_blk(context);
1845 xfs_da_brelse(NULL, bp);
1846 bp = NULL;
1847 }
1848 break;
1849 default:
1850 trace_xfs_attr_list_wrong_blk(context);
1851 xfs_da_brelse(NULL, bp);
1852 bp = NULL;
1853 }
1854 }
1855 }
1856
1857 /*
1858 * We did not find what we expected given the cursor's contents,
1859 * so we start from the top and work down based on the hash value.
1860 * Note that start of node block is same as start of leaf block.
1861 */
1862 if (bp == NULL) {
1863 cursor->blkno = 0;
1864 for (;;) {
1865 error = xfs_da_read_buf(NULL, context->dp,
1866 cursor->blkno, -1, &bp,
1867 XFS_ATTR_FORK);
1868 if (error)
1869 return(error);
1870 if (unlikely(bp == NULL)) {
1871 XFS_ERROR_REPORT("xfs_attr_node_list(2)",
1872 XFS_ERRLEVEL_LOW,
1873 context->dp->i_mount);
1874 return(XFS_ERROR(EFSCORRUPTED));
1875 }
1876 node = bp->data;
1877 if (node->hdr.info.magic ==
1878 cpu_to_be16(XFS_ATTR_LEAF_MAGIC))
1879 break;
1880 if (unlikely(node->hdr.info.magic !=
1881 cpu_to_be16(XFS_DA_NODE_MAGIC))) {
1882 XFS_CORRUPTION_ERROR("xfs_attr_node_list(3)",
1883 XFS_ERRLEVEL_LOW,
1884 context->dp->i_mount,
1885 node);
1886 xfs_da_brelse(NULL, bp);
1887 return(XFS_ERROR(EFSCORRUPTED));
1888 }
1889 btree = node->btree;
1890 for (i = 0; i < be16_to_cpu(node->hdr.count);
1891 btree++, i++) {
1892 if (cursor->hashval
1893 <= be32_to_cpu(btree->hashval)) {
1894 cursor->blkno = be32_to_cpu(btree->before);
1895 trace_xfs_attr_list_node_descend(context,
1896 btree);
1897 break;
1898 }
1899 }
1900 if (i == be16_to_cpu(node->hdr.count)) {
1901 xfs_da_brelse(NULL, bp);
1902 return(0);
1903 }
1904 xfs_da_brelse(NULL, bp);
1905 }
1906 }
1907 ASSERT(bp != NULL);
1908
1909 /*
1910 * Roll upward through the blocks, processing each leaf block in
1911 * order. As long as there is space in the result buffer, keep
1912 * adding the information.
1913 */
1914 for (;;) {
1915 leaf = bp->data;
1916 if (unlikely(leaf->hdr.info.magic !=
1917 cpu_to_be16(XFS_ATTR_LEAF_MAGIC))) {
1918 XFS_CORRUPTION_ERROR("xfs_attr_node_list(4)",
1919 XFS_ERRLEVEL_LOW,
1920 context->dp->i_mount, leaf);
1921 xfs_da_brelse(NULL, bp);
1922 return(XFS_ERROR(EFSCORRUPTED));
1923 }
1924 error = xfs_attr_leaf_list_int(bp, context);
1925 if (error) {
1926 xfs_da_brelse(NULL, bp);
1927 return error;
1928 }
1929 if (context->seen_enough || leaf->hdr.info.forw == 0)
1930 break;
1931 cursor->blkno = be32_to_cpu(leaf->hdr.info.forw);
1932 xfs_da_brelse(NULL, bp);
1933 error = xfs_da_read_buf(NULL, context->dp, cursor->blkno, -1,
1934 &bp, XFS_ATTR_FORK);
1935 if (error)
1936 return(error);
1937 if (unlikely((bp == NULL))) {
1938 XFS_ERROR_REPORT("xfs_attr_node_list(5)",
1939 XFS_ERRLEVEL_LOW,
1940 context->dp->i_mount);
1941 return(XFS_ERROR(EFSCORRUPTED));
1942 }
1943 }
1944 xfs_da_brelse(NULL, bp);
1945 return(0);
1946}
1947
1948
1949/*========================================================================
1950 * External routines for manipulating out-of-line attribute values.
1951 *========================================================================*/
1952
1953/*
1954 * Read the value associated with an attribute from the out-of-line buffer
1955 * that we stored it in.
1956 */
1957int
1958xfs_attr_rmtval_get(xfs_da_args_t *args)
1959{
1960 xfs_bmbt_irec_t map[ATTR_RMTVALUE_MAPSIZE];
1961 xfs_mount_t *mp;
1962 xfs_daddr_t dblkno;
1963 void *dst;
1964 xfs_buf_t *bp;
1965 int nmap, error, tmp, valuelen, blkcnt, i;
1966 xfs_dablk_t lblkno;
1967
1968 ASSERT(!(args->flags & ATTR_KERNOVAL));
1969
1970 mp = args->dp->i_mount;
1971 dst = args->value;
1972 valuelen = args->valuelen;
1973 lblkno = args->rmtblkno;
1974 while (valuelen > 0) {
1975 nmap = ATTR_RMTVALUE_MAPSIZE;
1976 error = xfs_bmapi_read(args->dp, (xfs_fileoff_t)lblkno,
1977 args->rmtblkcnt, map, &nmap,
1978 XFS_BMAPI_ATTRFORK);
1979 if (error)
1980 return(error);
1981 ASSERT(nmap >= 1);
1982
1983 for (i = 0; (i < nmap) && (valuelen > 0); i++) {
1984 ASSERT((map[i].br_startblock != DELAYSTARTBLOCK) &&
1985 (map[i].br_startblock != HOLESTARTBLOCK));
1986 dblkno = XFS_FSB_TO_DADDR(mp, map[i].br_startblock);
1987 blkcnt = XFS_FSB_TO_BB(mp, map[i].br_blockcount);
1988 error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp,
1989 dblkno, blkcnt, 0, &bp);
1990 if (error)
1991 return(error);
1992
1993 tmp = min_t(int, valuelen, BBTOB(bp->b_length));
1994 xfs_buf_iomove(bp, 0, tmp, dst, XBRW_READ);
1995 xfs_buf_relse(bp);
1996 dst += tmp;
1997 valuelen -= tmp;
1998
1999 lblkno += map[i].br_blockcount;
2000 }
2001 }
2002 ASSERT(valuelen == 0);
2003 return(0);
2004}
2005
2006/*
2007 * Write the value associated with an attribute into the out-of-line buffer
2008 * that we have defined for it.
2009 */
2010STATIC int
2011xfs_attr_rmtval_set(xfs_da_args_t *args)
2012{
2013 xfs_mount_t *mp;
2014 xfs_fileoff_t lfileoff;
2015 xfs_inode_t *dp;
2016 xfs_bmbt_irec_t map;
2017 xfs_daddr_t dblkno;
2018 void *src;
2019 xfs_buf_t *bp;
2020 xfs_dablk_t lblkno;
2021 int blkcnt, valuelen, nmap, error, tmp, committed;
2022
2023 dp = args->dp;
2024 mp = dp->i_mount;
2025 src = args->value;
2026
2027 /*
2028 * Find a "hole" in the attribute address space large enough for
2029 * us to drop the new attribute's value into.
2030 */
2031 blkcnt = XFS_B_TO_FSB(mp, args->valuelen);
2032 lfileoff = 0;
2033 error = xfs_bmap_first_unused(args->trans, args->dp, blkcnt, &lfileoff,
2034 XFS_ATTR_FORK);
2035 if (error) {
2036 return(error);
2037 }
2038 args->rmtblkno = lblkno = (xfs_dablk_t)lfileoff;
2039 args->rmtblkcnt = blkcnt;
2040
2041 /*
2042 * Roll through the "value", allocating blocks on disk as required.
2043 */
2044 while (blkcnt > 0) {
2045 /*
2046 * Allocate a single extent, up to the size of the value.
2047 */
2048 xfs_bmap_init(args->flist, args->firstblock);
2049 nmap = 1;
2050 error = xfs_bmapi_write(args->trans, dp, (xfs_fileoff_t)lblkno,
2051 blkcnt,
2052 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2053 args->firstblock, args->total, &map, &nmap,
2054 args->flist);
2055 if (!error) {
2056 error = xfs_bmap_finish(&args->trans, args->flist,
2057 &committed);
2058 }
2059 if (error) {
2060 ASSERT(committed);
2061 args->trans = NULL;
2062 xfs_bmap_cancel(args->flist);
2063 return(error);
2064 }
2065
2066 /*
2067 * bmap_finish() may have committed the last trans and started
2068 * a new one. We need the inode to be in all transactions.
2069 */
2070 if (committed)
2071 xfs_trans_ijoin(args->trans, dp, 0);
2072
2073 ASSERT(nmap == 1);
2074 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2075 (map.br_startblock != HOLESTARTBLOCK));
2076 lblkno += map.br_blockcount;
2077 blkcnt -= map.br_blockcount;
2078
2079 /*
2080 * Start the next trans in the chain.
2081 */
2082 error = xfs_trans_roll(&args->trans, dp);
2083 if (error)
2084 return (error);
2085 }
2086
2087 /*
2088 * Roll through the "value", copying the attribute value to the
2089 * already-allocated blocks. Blocks are written synchronously
2090 * so that we can know they are all on disk before we turn off
2091 * the INCOMPLETE flag.
2092 */
2093 lblkno = args->rmtblkno;
2094 valuelen = args->valuelen;
2095 while (valuelen > 0) {
2096 int buflen;
2097
2098 /*
2099 * Try to remember where we decided to put the value.
2100 */
2101 xfs_bmap_init(args->flist, args->firstblock);
2102 nmap = 1;
2103 error = xfs_bmapi_read(dp, (xfs_fileoff_t)lblkno,
2104 args->rmtblkcnt, &map, &nmap,
2105 XFS_BMAPI_ATTRFORK);
2106 if (error)
2107 return(error);
2108 ASSERT(nmap == 1);
2109 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2110 (map.br_startblock != HOLESTARTBLOCK));
2111
2112 dblkno = XFS_FSB_TO_DADDR(mp, map.br_startblock),
2113 blkcnt = XFS_FSB_TO_BB(mp, map.br_blockcount);
2114
2115 bp = xfs_buf_get(mp->m_ddev_targp, dblkno, blkcnt, 0);
2116 if (!bp)
2117 return ENOMEM;
2118
2119 buflen = BBTOB(bp->b_length);
2120 tmp = min_t(int, valuelen, buflen);
2121 xfs_buf_iomove(bp, 0, tmp, src, XBRW_WRITE);
2122 if (tmp < buflen)
2123 xfs_buf_zero(bp, tmp, buflen - tmp);
2124
2125 error = xfs_bwrite(bp); /* GROT: NOTE: synchronous write */
2126 xfs_buf_relse(bp);
2127 if (error)
2128 return error;
2129 src += tmp;
2130 valuelen -= tmp;
2131
2132 lblkno += map.br_blockcount;
2133 }
2134 ASSERT(valuelen == 0);
2135 return(0);
2136}
2137
2138/*
2139 * Remove the value associated with an attribute by deleting the
2140 * out-of-line buffer that it is stored on.
2141 */
2142STATIC int
2143xfs_attr_rmtval_remove(xfs_da_args_t *args)
2144{
2145 xfs_mount_t *mp;
2146 xfs_bmbt_irec_t map;
2147 xfs_buf_t *bp;
2148 xfs_daddr_t dblkno;
2149 xfs_dablk_t lblkno;
2150 int valuelen, blkcnt, nmap, error, done, committed;
2151
2152 mp = args->dp->i_mount;
2153
2154 /*
2155 * Roll through the "value", invalidating the attribute value's
2156 * blocks.
2157 */
2158 lblkno = args->rmtblkno;
2159 valuelen = args->rmtblkcnt;
2160 while (valuelen > 0) {
2161 /*
2162 * Try to remember where we decided to put the value.
2163 */
2164 nmap = 1;
2165 error = xfs_bmapi_read(args->dp, (xfs_fileoff_t)lblkno,
2166 args->rmtblkcnt, &map, &nmap,
2167 XFS_BMAPI_ATTRFORK);
2168 if (error)
2169 return(error);
2170 ASSERT(nmap == 1);
2171 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
2172 (map.br_startblock != HOLESTARTBLOCK));
2173
2174 dblkno = XFS_FSB_TO_DADDR(mp, map.br_startblock),
2175 blkcnt = XFS_FSB_TO_BB(mp, map.br_blockcount);
2176
2177 /*
2178 * If the "remote" value is in the cache, remove it.
2179 */
2180 bp = xfs_incore(mp->m_ddev_targp, dblkno, blkcnt, XBF_TRYLOCK);
2181 if (bp) {
2182 xfs_buf_stale(bp);
2183 xfs_buf_relse(bp);
2184 bp = NULL;
2185 }
2186
2187 valuelen -= map.br_blockcount;
2188
2189 lblkno += map.br_blockcount;
2190 }
2191
2192 /*
2193 * Keep de-allocating extents until the remote-value region is gone.
2194 */
2195 lblkno = args->rmtblkno;
2196 blkcnt = args->rmtblkcnt;
2197 done = 0;
2198 while (!done) {
2199 xfs_bmap_init(args->flist, args->firstblock);
2200 error = xfs_bunmapi(args->trans, args->dp, lblkno, blkcnt,
2201 XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2202 1, args->firstblock, args->flist,
2203 &done);
2204 if (!error) {
2205 error = xfs_bmap_finish(&args->trans, args->flist,
2206 &committed);
2207 }
2208 if (error) {
2209 ASSERT(committed);
2210 args->trans = NULL;
2211 xfs_bmap_cancel(args->flist);
2212 return(error);
2213 }
2214
2215 /*
2216 * bmap_finish() may have committed the last trans and started
2217 * a new one. We need the inode to be in all transactions.
2218 */
2219 if (committed)
2220 xfs_trans_ijoin(args->trans, args->dp, 0);
2221
2222 /*
2223 * Close out trans and start the next one in the chain.
2224 */
2225 error = xfs_trans_roll(&args->trans, args->dp);
2226 if (error)
2227 return (error);
2228 }
2229 return(0);
2230}