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