2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_types.h"
24 #include "xfs_trans.h"
27 #include "xfs_mount.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_bmap_btree.h"
30 #include "xfs_alloc_btree.h"
31 #include "xfs_ialloc_btree.h"
32 #include "xfs_alloc.h"
33 #include "xfs_btree.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_dinode.h"
36 #include "xfs_inode.h"
37 #include "xfs_inode_item.h"
40 #include "xfs_attr_leaf.h"
41 #include "xfs_error.h"
42 #include "xfs_trace.h"
47 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
50 /*========================================================================
51 * Function prototypes for the kernel.
52 *========================================================================*/
55 * Routines used for growing the Btree.
57 STATIC int xfs_attr_leaf_create(xfs_da_args_t *args, xfs_dablk_t which_block,
59 STATIC int xfs_attr_leaf_add_work(xfs_dabuf_t *leaf_buffer, xfs_da_args_t *args,
61 STATIC void xfs_attr_leaf_compact(xfs_trans_t *trans, xfs_dabuf_t *leaf_buffer);
62 STATIC void xfs_attr_leaf_rebalance(xfs_da_state_t *state,
63 xfs_da_state_blk_t *blk1,
64 xfs_da_state_blk_t *blk2);
65 STATIC int xfs_attr_leaf_figure_balance(xfs_da_state_t *state,
66 xfs_da_state_blk_t *leaf_blk_1,
67 xfs_da_state_blk_t *leaf_blk_2,
68 int *number_entries_in_blk1,
69 int *number_usedbytes_in_blk1);
72 * Routines used for shrinking the Btree.
74 STATIC int xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
75 xfs_dabuf_t *bp, int level);
76 STATIC int xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
78 STATIC int xfs_attr_leaf_freextent(xfs_trans_t **trans, xfs_inode_t *dp,
79 xfs_dablk_t blkno, int blkcnt);
84 STATIC void xfs_attr_leaf_moveents(xfs_attr_leafblock_t *src_leaf,
86 xfs_attr_leafblock_t *dst_leaf,
87 int dst_start, int move_count,
89 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
91 /*========================================================================
92 * Namespace helper routines
93 *========================================================================*/
96 * If namespace bits don't match return 0.
97 * If all match then return 1.
100 xfs_attr_namesp_match(int arg_flags, int ondisk_flags)
102 return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags);
106 /*========================================================================
107 * External routines when attribute fork size < XFS_LITINO(mp).
108 *========================================================================*/
111 * Query whether the requested number of additional bytes of extended
112 * attribute space will be able to fit inline.
114 * Returns zero if not, else the di_forkoff fork offset to be used in the
115 * literal area for attribute data once the new bytes have been added.
117 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
118 * special case for dev/uuid inodes, they have fixed size data forks.
121 xfs_attr_shortform_bytesfit(xfs_inode_t *dp, int bytes)
124 int minforkoff; /* lower limit on valid forkoff locations */
125 int maxforkoff; /* upper limit on valid forkoff locations */
127 xfs_mount_t *mp = dp->i_mount;
129 offset = (XFS_LITINO(mp) - bytes) >> 3; /* rounded down */
131 switch (dp->i_d.di_format) {
132 case XFS_DINODE_FMT_DEV:
133 minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
134 return (offset >= minforkoff) ? minforkoff : 0;
135 case XFS_DINODE_FMT_UUID:
136 minforkoff = roundup(sizeof(uuid_t), 8) >> 3;
137 return (offset >= minforkoff) ? minforkoff : 0;
141 * If the requested numbers of bytes is smaller or equal to the
142 * current attribute fork size we can always proceed.
144 * Note that if_bytes in the data fork might actually be larger than
145 * the current data fork size is due to delalloc extents. In that
146 * case either the extent count will go down when they are converted
147 * to real extents, or the delalloc conversion will take care of the
148 * literal area rebalancing.
150 if (bytes <= XFS_IFORK_ASIZE(dp))
151 return dp->i_d.di_forkoff;
154 * For attr2 we can try to move the forkoff if there is space in the
155 * literal area, but for the old format we are done if there is no
156 * space in the fixed attribute fork.
158 if (!(mp->m_flags & XFS_MOUNT_ATTR2))
161 dsize = dp->i_df.if_bytes;
163 switch (dp->i_d.di_format) {
164 case XFS_DINODE_FMT_EXTENTS:
166 * If there is no attr fork and the data fork is extents,
167 * determine if creating the default attr fork will result
168 * in the extents form migrating to btree. If so, the
169 * minimum offset only needs to be the space required for
172 if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
173 xfs_default_attroffset(dp))
174 dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
176 case XFS_DINODE_FMT_BTREE:
178 * If we have a data btree then keep forkoff if we have one,
179 * otherwise we are adding a new attr, so then we set
180 * minforkoff to where the btree root can finish so we have
181 * plenty of room for attrs
183 if (dp->i_d.di_forkoff) {
184 if (offset < dp->i_d.di_forkoff)
186 return dp->i_d.di_forkoff;
188 dsize = XFS_BMAP_BROOT_SPACE(dp->i_df.if_broot);
193 * A data fork btree root must have space for at least
194 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
196 minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
197 minforkoff = roundup(minforkoff, 8) >> 3;
199 /* attr fork btree root can have at least this many key/ptr pairs */
200 maxforkoff = XFS_LITINO(mp) - XFS_BMDR_SPACE_CALC(MINABTPTRS);
201 maxforkoff = maxforkoff >> 3; /* rounded down */
203 if (offset >= maxforkoff)
205 if (offset >= minforkoff)
211 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
214 xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp)
216 if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
217 !(xfs_sb_version_hasattr2(&mp->m_sb))) {
218 spin_lock(&mp->m_sb_lock);
219 if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
220 xfs_sb_version_addattr2(&mp->m_sb);
221 spin_unlock(&mp->m_sb_lock);
222 xfs_mod_sb(tp, XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
224 spin_unlock(&mp->m_sb_lock);
229 * Create the initial contents of a shortform attribute list.
232 xfs_attr_shortform_create(xfs_da_args_t *args)
234 xfs_attr_sf_hdr_t *hdr;
242 ASSERT(ifp->if_bytes == 0);
243 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) {
244 ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */
245 dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL;
246 ifp->if_flags |= XFS_IFINLINE;
248 ASSERT(ifp->if_flags & XFS_IFINLINE);
250 xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
251 hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data;
253 hdr->totsize = cpu_to_be16(sizeof(*hdr));
254 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
258 * Add a name/value pair to the shortform attribute list.
259 * Overflow from the inode has already been checked for.
262 xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
264 xfs_attr_shortform_t *sf;
265 xfs_attr_sf_entry_t *sfe;
273 dp->i_d.di_forkoff = forkoff;
274 dp->i_df.if_ext_max =
275 XFS_IFORK_DSIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);
276 dp->i_afp->if_ext_max =
277 XFS_IFORK_ASIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);
280 ASSERT(ifp->if_flags & XFS_IFINLINE);
281 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
283 for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
285 if (sfe->namelen != args->namelen)
287 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
289 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
295 offset = (char *)sfe - (char *)sf;
296 size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
297 xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
298 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
299 sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset);
301 sfe->namelen = args->namelen;
302 sfe->valuelen = args->valuelen;
303 sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
304 memcpy(sfe->nameval, args->name, args->namelen);
305 memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
307 be16_add_cpu(&sf->hdr.totsize, size);
308 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
310 xfs_sbversion_add_attr2(mp, args->trans);
314 * After the last attribute is removed revert to original inode format,
315 * making all literal area available to the data fork once more.
319 struct xfs_inode *ip,
320 struct xfs_trans *tp)
322 xfs_idestroy_fork(ip, XFS_ATTR_FORK);
323 ip->i_d.di_forkoff = 0;
324 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
326 ASSERT(ip->i_d.di_anextents == 0);
327 ASSERT(ip->i_afp == NULL);
329 ip->i_df.if_ext_max = XFS_IFORK_DSIZE(ip) / sizeof(xfs_bmbt_rec_t);
330 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
334 * Remove an attribute from the shortform attribute list structure.
337 xfs_attr_shortform_remove(xfs_da_args_t *args)
339 xfs_attr_shortform_t *sf;
340 xfs_attr_sf_entry_t *sfe;
341 int base, size=0, end, totsize, i;
347 base = sizeof(xfs_attr_sf_hdr_t);
348 sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
351 for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
353 size = XFS_ATTR_SF_ENTSIZE(sfe);
354 if (sfe->namelen != args->namelen)
356 if (memcmp(sfe->nameval, args->name, args->namelen) != 0)
358 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
363 return(XFS_ERROR(ENOATTR));
366 * Fix up the attribute fork data, covering the hole
369 totsize = be16_to_cpu(sf->hdr.totsize);
371 memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
373 be16_add_cpu(&sf->hdr.totsize, -size);
376 * Fix up the start offset of the attribute fork
379 if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
380 (mp->m_flags & XFS_MOUNT_ATTR2) &&
381 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
382 !(args->op_flags & XFS_DA_OP_ADDNAME)) {
383 xfs_attr_fork_reset(dp, args->trans);
385 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
386 dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
387 ASSERT(dp->i_d.di_forkoff);
388 ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
389 (args->op_flags & XFS_DA_OP_ADDNAME) ||
390 !(mp->m_flags & XFS_MOUNT_ATTR2) ||
391 dp->i_d.di_format == XFS_DINODE_FMT_BTREE);
392 dp->i_afp->if_ext_max =
393 XFS_IFORK_ASIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);
394 dp->i_df.if_ext_max =
395 XFS_IFORK_DSIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);
396 xfs_trans_log_inode(args->trans, dp,
397 XFS_ILOG_CORE | XFS_ILOG_ADATA);
400 xfs_sbversion_add_attr2(mp, args->trans);
406 * Look up a name in a shortform attribute list structure.
410 xfs_attr_shortform_lookup(xfs_da_args_t *args)
412 xfs_attr_shortform_t *sf;
413 xfs_attr_sf_entry_t *sfe;
417 ifp = args->dp->i_afp;
418 ASSERT(ifp->if_flags & XFS_IFINLINE);
419 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
421 for (i = 0; i < sf->hdr.count;
422 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
423 if (sfe->namelen != args->namelen)
425 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
427 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
429 return(XFS_ERROR(EEXIST));
431 return(XFS_ERROR(ENOATTR));
435 * Look up a name in a shortform attribute list structure.
439 xfs_attr_shortform_getvalue(xfs_da_args_t *args)
441 xfs_attr_shortform_t *sf;
442 xfs_attr_sf_entry_t *sfe;
445 ASSERT(args->dp->i_d.di_aformat == XFS_IFINLINE);
446 sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data;
448 for (i = 0; i < sf->hdr.count;
449 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
450 if (sfe->namelen != args->namelen)
452 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
454 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
456 if (args->flags & ATTR_KERNOVAL) {
457 args->valuelen = sfe->valuelen;
458 return(XFS_ERROR(EEXIST));
460 if (args->valuelen < sfe->valuelen) {
461 args->valuelen = sfe->valuelen;
462 return(XFS_ERROR(ERANGE));
464 args->valuelen = sfe->valuelen;
465 memcpy(args->value, &sfe->nameval[args->namelen],
467 return(XFS_ERROR(EEXIST));
469 return(XFS_ERROR(ENOATTR));
473 * Convert from using the shortform to the leaf.
476 xfs_attr_shortform_to_leaf(xfs_da_args_t *args)
479 xfs_attr_shortform_t *sf;
480 xfs_attr_sf_entry_t *sfe;
490 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
491 size = be16_to_cpu(sf->hdr.totsize);
492 tmpbuffer = kmem_alloc(size, KM_SLEEP);
493 ASSERT(tmpbuffer != NULL);
494 memcpy(tmpbuffer, ifp->if_u1.if_data, size);
495 sf = (xfs_attr_shortform_t *)tmpbuffer;
497 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
499 error = xfs_da_grow_inode(args, &blkno);
502 * If we hit an IO error middle of the transaction inside
503 * grow_inode(), we may have inconsistent data. Bail out.
507 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
508 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
513 error = xfs_attr_leaf_create(args, blkno, &bp);
515 error = xfs_da_shrink_inode(args, 0, bp);
519 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
520 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
524 memset((char *)&nargs, 0, sizeof(nargs));
526 nargs.firstblock = args->firstblock;
527 nargs.flist = args->flist;
528 nargs.total = args->total;
529 nargs.whichfork = XFS_ATTR_FORK;
530 nargs.trans = args->trans;
531 nargs.op_flags = XFS_DA_OP_OKNOENT;
534 for (i = 0; i < sf->hdr.count; i++) {
535 nargs.name = sfe->nameval;
536 nargs.namelen = sfe->namelen;
537 nargs.value = &sfe->nameval[nargs.namelen];
538 nargs.valuelen = sfe->valuelen;
539 nargs.hashval = xfs_da_hashname(sfe->nameval,
541 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
542 error = xfs_attr_leaf_lookup_int(bp, &nargs); /* set a->index */
543 ASSERT(error == ENOATTR);
544 error = xfs_attr_leaf_add(bp, &nargs);
545 ASSERT(error != ENOSPC);
548 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
555 kmem_free(tmpbuffer);
560 xfs_attr_shortform_compare(const void *a, const void *b)
562 xfs_attr_sf_sort_t *sa, *sb;
564 sa = (xfs_attr_sf_sort_t *)a;
565 sb = (xfs_attr_sf_sort_t *)b;
566 if (sa->hash < sb->hash) {
568 } else if (sa->hash > sb->hash) {
571 return(sa->entno - sb->entno);
576 #define XFS_ISRESET_CURSOR(cursor) \
577 (!((cursor)->initted) && !((cursor)->hashval) && \
578 !((cursor)->blkno) && !((cursor)->offset))
580 * Copy out entries of shortform attribute lists for attr_list().
581 * Shortform attribute lists are not stored in hashval sorted order.
582 * If the output buffer is not large enough to hold them all, then we
583 * we have to calculate each entries' hashvalue and sort them before
584 * we can begin returning them to the user.
588 xfs_attr_shortform_list(xfs_attr_list_context_t *context)
590 attrlist_cursor_kern_t *cursor;
591 xfs_attr_sf_sort_t *sbuf, *sbp;
592 xfs_attr_shortform_t *sf;
593 xfs_attr_sf_entry_t *sfe;
595 int sbsize, nsbuf, count, i;
598 ASSERT(context != NULL);
601 ASSERT(dp->i_afp != NULL);
602 sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
606 cursor = context->cursor;
607 ASSERT(cursor != NULL);
609 trace_xfs_attr_list_sf(context);
612 * If the buffer is large enough and the cursor is at the start,
613 * do not bother with sorting since we will return everything in
614 * one buffer and another call using the cursor won't need to be
616 * Note the generous fudge factor of 16 overhead bytes per entry.
617 * If bufsize is zero then put_listent must be a search function
618 * and can just scan through what we have.
620 if (context->bufsize == 0 ||
621 (XFS_ISRESET_CURSOR(cursor) &&
622 (dp->i_afp->if_bytes + sf->hdr.count * 16) < context->bufsize)) {
623 for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
624 error = context->put_listent(context,
629 &sfe->nameval[sfe->namelen]);
632 * Either search callback finished early or
633 * didn't fit it all in the buffer after all.
635 if (context->seen_enough)
640 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
642 trace_xfs_attr_list_sf_all(context);
646 /* do no more for a search callback */
647 if (context->bufsize == 0)
651 * It didn't all fit, so we have to sort everything on hashval.
653 sbsize = sf->hdr.count * sizeof(*sbuf);
654 sbp = sbuf = kmem_alloc(sbsize, KM_SLEEP | KM_NOFS);
657 * Scan the attribute list for the rest of the entries, storing
658 * the relevant info from only those that match into a buffer.
661 for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
663 ((char *)sfe < (char *)sf) ||
664 ((char *)sfe >= ((char *)sf + dp->i_afp->if_bytes)))) {
665 XFS_CORRUPTION_ERROR("xfs_attr_shortform_list",
667 context->dp->i_mount, sfe);
669 return XFS_ERROR(EFSCORRUPTED);
673 sbp->hash = xfs_da_hashname(sfe->nameval, sfe->namelen);
674 sbp->name = sfe->nameval;
675 sbp->namelen = sfe->namelen;
676 /* These are bytes, and both on-disk, don't endian-flip */
677 sbp->valuelen = sfe->valuelen;
678 sbp->flags = sfe->flags;
679 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
685 * Sort the entries on hash then entno.
687 xfs_sort(sbuf, nsbuf, sizeof(*sbuf), xfs_attr_shortform_compare);
690 * Re-find our place IN THE SORTED LIST.
695 for (sbp = sbuf, i = 0; i < nsbuf; i++, sbp++) {
696 if (sbp->hash == cursor->hashval) {
697 if (cursor->offset == count) {
701 } else if (sbp->hash > cursor->hashval) {
711 * Loop putting entries into the user buffer.
713 for ( ; i < nsbuf; i++, sbp++) {
714 if (cursor->hashval != sbp->hash) {
715 cursor->hashval = sbp->hash;
718 error = context->put_listent(context,
723 &sbp->name[sbp->namelen]);
728 if (context->seen_enough)
738 * Check a leaf attribute block to see if all the entries would fit into
739 * a shortform attribute list.
742 xfs_attr_shortform_allfit(xfs_dabuf_t *bp, xfs_inode_t *dp)
744 xfs_attr_leafblock_t *leaf;
745 xfs_attr_leaf_entry_t *entry;
746 xfs_attr_leaf_name_local_t *name_loc;
750 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
752 entry = &leaf->entries[0];
753 bytes = sizeof(struct xfs_attr_sf_hdr);
754 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
755 if (entry->flags & XFS_ATTR_INCOMPLETE)
756 continue; /* don't copy partial entries */
757 if (!(entry->flags & XFS_ATTR_LOCAL))
759 name_loc = xfs_attr_leaf_name_local(leaf, i);
760 if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
762 if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
764 bytes += sizeof(struct xfs_attr_sf_entry)-1
766 + be16_to_cpu(name_loc->valuelen);
768 if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
769 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
770 (bytes == sizeof(struct xfs_attr_sf_hdr)))
772 return(xfs_attr_shortform_bytesfit(dp, bytes));
776 * Convert a leaf attribute list to shortform attribute list
779 xfs_attr_leaf_to_shortform(xfs_dabuf_t *bp, xfs_da_args_t *args, int forkoff)
781 xfs_attr_leafblock_t *leaf;
782 xfs_attr_leaf_entry_t *entry;
783 xfs_attr_leaf_name_local_t *name_loc;
790 tmpbuffer = kmem_alloc(XFS_LBSIZE(dp->i_mount), KM_SLEEP);
791 ASSERT(tmpbuffer != NULL);
794 memcpy(tmpbuffer, bp->data, XFS_LBSIZE(dp->i_mount));
795 leaf = (xfs_attr_leafblock_t *)tmpbuffer;
796 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
797 memset(bp->data, 0, XFS_LBSIZE(dp->i_mount));
800 * Clean out the prior contents of the attribute list.
802 error = xfs_da_shrink_inode(args, 0, bp);
807 ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
808 ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
809 xfs_attr_fork_reset(dp, args->trans);
813 xfs_attr_shortform_create(args);
816 * Copy the attributes
818 memset((char *)&nargs, 0, sizeof(nargs));
820 nargs.firstblock = args->firstblock;
821 nargs.flist = args->flist;
822 nargs.total = args->total;
823 nargs.whichfork = XFS_ATTR_FORK;
824 nargs.trans = args->trans;
825 nargs.op_flags = XFS_DA_OP_OKNOENT;
826 entry = &leaf->entries[0];
827 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
828 if (entry->flags & XFS_ATTR_INCOMPLETE)
829 continue; /* don't copy partial entries */
832 ASSERT(entry->flags & XFS_ATTR_LOCAL);
833 name_loc = xfs_attr_leaf_name_local(leaf, i);
834 nargs.name = name_loc->nameval;
835 nargs.namelen = name_loc->namelen;
836 nargs.value = &name_loc->nameval[nargs.namelen];
837 nargs.valuelen = be16_to_cpu(name_loc->valuelen);
838 nargs.hashval = be32_to_cpu(entry->hashval);
839 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
840 xfs_attr_shortform_add(&nargs, forkoff);
845 kmem_free(tmpbuffer);
850 * Convert from using a single leaf to a root node and a leaf.
853 xfs_attr_leaf_to_node(xfs_da_args_t *args)
855 xfs_attr_leafblock_t *leaf;
856 xfs_da_intnode_t *node;
858 xfs_dabuf_t *bp1, *bp2;
864 error = xfs_da_grow_inode(args, &blkno);
867 error = xfs_da_read_buf(args->trans, args->dp, 0, -1, &bp1,
873 error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp2,
878 memcpy(bp2->data, bp1->data, XFS_LBSIZE(dp->i_mount));
879 xfs_da_buf_done(bp1);
881 xfs_da_log_buf(args->trans, bp2, 0, XFS_LBSIZE(dp->i_mount) - 1);
884 * Set up the new root node.
886 error = xfs_da_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
891 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
892 /* both on-disk, don't endian-flip twice */
893 node->btree[0].hashval =
894 leaf->entries[be16_to_cpu(leaf->hdr.count)-1 ].hashval;
895 node->btree[0].before = cpu_to_be32(blkno);
896 node->hdr.count = cpu_to_be16(1);
897 xfs_da_log_buf(args->trans, bp1, 0, XFS_LBSIZE(dp->i_mount) - 1);
901 xfs_da_buf_done(bp1);
903 xfs_da_buf_done(bp2);
908 /*========================================================================
909 * Routines used for growing the Btree.
910 *========================================================================*/
913 * Create the initial contents of a leaf attribute list
914 * or a leaf in a node attribute list.
917 xfs_attr_leaf_create(xfs_da_args_t *args, xfs_dablk_t blkno, xfs_dabuf_t **bpp)
919 xfs_attr_leafblock_t *leaf;
920 xfs_attr_leaf_hdr_t *hdr;
927 error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp,
933 memset((char *)leaf, 0, XFS_LBSIZE(dp->i_mount));
935 hdr->info.magic = cpu_to_be16(XFS_ATTR_LEAF_MAGIC);
936 hdr->firstused = cpu_to_be16(XFS_LBSIZE(dp->i_mount));
937 if (!hdr->firstused) {
938 hdr->firstused = cpu_to_be16(
939 XFS_LBSIZE(dp->i_mount) - XFS_ATTR_LEAF_NAME_ALIGN);
942 hdr->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
943 hdr->freemap[0].size = cpu_to_be16(be16_to_cpu(hdr->firstused) -
944 sizeof(xfs_attr_leaf_hdr_t));
946 xfs_da_log_buf(args->trans, bp, 0, XFS_LBSIZE(dp->i_mount) - 1);
953 * Split the leaf node, rebalance, then add the new entry.
956 xfs_attr_leaf_split(xfs_da_state_t *state, xfs_da_state_blk_t *oldblk,
957 xfs_da_state_blk_t *newblk)
963 * Allocate space for a new leaf node.
965 ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
966 error = xfs_da_grow_inode(state->args, &blkno);
969 error = xfs_attr_leaf_create(state->args, blkno, &newblk->bp);
972 newblk->blkno = blkno;
973 newblk->magic = XFS_ATTR_LEAF_MAGIC;
976 * Rebalance the entries across the two leaves.
977 * NOTE: rebalance() currently depends on the 2nd block being empty.
979 xfs_attr_leaf_rebalance(state, oldblk, newblk);
980 error = xfs_da_blk_link(state, oldblk, newblk);
985 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
986 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
987 * "new" attrs info. Will need the "old" info to remove it later.
989 * Insert the "new" entry in the correct block.
992 error = xfs_attr_leaf_add(oldblk->bp, state->args);
994 error = xfs_attr_leaf_add(newblk->bp, state->args);
997 * Update last hashval in each block since we added the name.
999 oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
1000 newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
1005 * Add a name to the leaf attribute list structure.
1008 xfs_attr_leaf_add(xfs_dabuf_t *bp, xfs_da_args_t *args)
1010 xfs_attr_leafblock_t *leaf;
1011 xfs_attr_leaf_hdr_t *hdr;
1012 xfs_attr_leaf_map_t *map;
1013 int tablesize, entsize, sum, tmp, i;
1016 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1017 ASSERT((args->index >= 0)
1018 && (args->index <= be16_to_cpu(leaf->hdr.count)));
1020 entsize = xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
1021 args->trans->t_mountp->m_sb.sb_blocksize, NULL);
1024 * Search through freemap for first-fit on new name length.
1025 * (may need to figure in size of entry struct too)
1027 tablesize = (be16_to_cpu(hdr->count) + 1)
1028 * sizeof(xfs_attr_leaf_entry_t)
1029 + sizeof(xfs_attr_leaf_hdr_t);
1030 map = &hdr->freemap[XFS_ATTR_LEAF_MAPSIZE-1];
1031 for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE-1; i >= 0; map--, i--) {
1032 if (tablesize > be16_to_cpu(hdr->firstused)) {
1033 sum += be16_to_cpu(map->size);
1037 continue; /* no space in this map */
1039 if (be16_to_cpu(map->base) < be16_to_cpu(hdr->firstused))
1040 tmp += sizeof(xfs_attr_leaf_entry_t);
1041 if (be16_to_cpu(map->size) >= tmp) {
1042 tmp = xfs_attr_leaf_add_work(bp, args, i);
1045 sum += be16_to_cpu(map->size);
1049 * If there are no holes in the address space of the block,
1050 * and we don't have enough freespace, then compaction will do us
1051 * no good and we should just give up.
1053 if (!hdr->holes && (sum < entsize))
1054 return(XFS_ERROR(ENOSPC));
1057 * Compact the entries to coalesce free space.
1058 * This may change the hdr->count via dropping INCOMPLETE entries.
1060 xfs_attr_leaf_compact(args->trans, bp);
1063 * After compaction, the block is guaranteed to have only one
1064 * free region, in freemap[0]. If it is not big enough, give up.
1066 if (be16_to_cpu(hdr->freemap[0].size)
1067 < (entsize + sizeof(xfs_attr_leaf_entry_t)))
1068 return(XFS_ERROR(ENOSPC));
1070 return(xfs_attr_leaf_add_work(bp, args, 0));
1074 * Add a name to a leaf attribute list structure.
1077 xfs_attr_leaf_add_work(xfs_dabuf_t *bp, xfs_da_args_t *args, int mapindex)
1079 xfs_attr_leafblock_t *leaf;
1080 xfs_attr_leaf_hdr_t *hdr;
1081 xfs_attr_leaf_entry_t *entry;
1082 xfs_attr_leaf_name_local_t *name_loc;
1083 xfs_attr_leaf_name_remote_t *name_rmt;
1084 xfs_attr_leaf_map_t *map;
1089 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1091 ASSERT((mapindex >= 0) && (mapindex < XFS_ATTR_LEAF_MAPSIZE));
1092 ASSERT((args->index >= 0) && (args->index <= be16_to_cpu(hdr->count)));
1095 * Force open some space in the entry array and fill it in.
1097 entry = &leaf->entries[args->index];
1098 if (args->index < be16_to_cpu(hdr->count)) {
1099 tmp = be16_to_cpu(hdr->count) - args->index;
1100 tmp *= sizeof(xfs_attr_leaf_entry_t);
1101 memmove((char *)(entry+1), (char *)entry, tmp);
1102 xfs_da_log_buf(args->trans, bp,
1103 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1105 be16_add_cpu(&hdr->count, 1);
1108 * Allocate space for the new string (at the end of the run).
1110 map = &hdr->freemap[mapindex];
1111 mp = args->trans->t_mountp;
1112 ASSERT(be16_to_cpu(map->base) < XFS_LBSIZE(mp));
1113 ASSERT((be16_to_cpu(map->base) & 0x3) == 0);
1114 ASSERT(be16_to_cpu(map->size) >=
1115 xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
1116 mp->m_sb.sb_blocksize, NULL));
1117 ASSERT(be16_to_cpu(map->size) < XFS_LBSIZE(mp));
1118 ASSERT((be16_to_cpu(map->size) & 0x3) == 0);
1119 be16_add_cpu(&map->size,
1120 -xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
1121 mp->m_sb.sb_blocksize, &tmp));
1122 entry->nameidx = cpu_to_be16(be16_to_cpu(map->base) +
1123 be16_to_cpu(map->size));
1124 entry->hashval = cpu_to_be32(args->hashval);
1125 entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
1126 entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
1127 if (args->op_flags & XFS_DA_OP_RENAME) {
1128 entry->flags |= XFS_ATTR_INCOMPLETE;
1129 if ((args->blkno2 == args->blkno) &&
1130 (args->index2 <= args->index)) {
1134 xfs_da_log_buf(args->trans, bp,
1135 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
1136 ASSERT((args->index == 0) ||
1137 (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
1138 ASSERT((args->index == be16_to_cpu(hdr->count)-1) ||
1139 (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
1142 * Copy the attribute name and value into the new space.
1144 * For "remote" attribute values, simply note that we need to
1145 * allocate space for the "remote" value. We can't actually
1146 * allocate the extents in this transaction, and we can't decide
1147 * which blocks they should be as we might allocate more blocks
1148 * as part of this transaction (a split operation for example).
1150 if (entry->flags & XFS_ATTR_LOCAL) {
1151 name_loc = xfs_attr_leaf_name_local(leaf, args->index);
1152 name_loc->namelen = args->namelen;
1153 name_loc->valuelen = cpu_to_be16(args->valuelen);
1154 memcpy((char *)name_loc->nameval, args->name, args->namelen);
1155 memcpy((char *)&name_loc->nameval[args->namelen], args->value,
1156 be16_to_cpu(name_loc->valuelen));
1158 name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
1159 name_rmt->namelen = args->namelen;
1160 memcpy((char *)name_rmt->name, args->name, args->namelen);
1161 entry->flags |= XFS_ATTR_INCOMPLETE;
1163 name_rmt->valuelen = 0;
1164 name_rmt->valueblk = 0;
1166 args->rmtblkcnt = XFS_B_TO_FSB(mp, args->valuelen);
1168 xfs_da_log_buf(args->trans, bp,
1169 XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
1170 xfs_attr_leaf_entsize(leaf, args->index)));
1173 * Update the control info for this leaf node
1175 if (be16_to_cpu(entry->nameidx) < be16_to_cpu(hdr->firstused)) {
1176 /* both on-disk, don't endian-flip twice */
1177 hdr->firstused = entry->nameidx;
1179 ASSERT(be16_to_cpu(hdr->firstused) >=
1180 ((be16_to_cpu(hdr->count) * sizeof(*entry)) + sizeof(*hdr)));
1181 tmp = (be16_to_cpu(hdr->count)-1) * sizeof(xfs_attr_leaf_entry_t)
1182 + sizeof(xfs_attr_leaf_hdr_t);
1183 map = &hdr->freemap[0];
1184 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; map++, i++) {
1185 if (be16_to_cpu(map->base) == tmp) {
1186 be16_add_cpu(&map->base, sizeof(xfs_attr_leaf_entry_t));
1187 be16_add_cpu(&map->size,
1188 -((int)sizeof(xfs_attr_leaf_entry_t)));
1191 be16_add_cpu(&hdr->usedbytes, xfs_attr_leaf_entsize(leaf, args->index));
1192 xfs_da_log_buf(args->trans, bp,
1193 XFS_DA_LOGRANGE(leaf, hdr, sizeof(*hdr)));
1198 * Garbage collect a leaf attribute list block by copying it to a new buffer.
1201 xfs_attr_leaf_compact(xfs_trans_t *trans, xfs_dabuf_t *bp)
1203 xfs_attr_leafblock_t *leaf_s, *leaf_d;
1204 xfs_attr_leaf_hdr_t *hdr_s, *hdr_d;
1208 mp = trans->t_mountp;
1209 tmpbuffer = kmem_alloc(XFS_LBSIZE(mp), KM_SLEEP);
1210 ASSERT(tmpbuffer != NULL);
1211 memcpy(tmpbuffer, bp->data, XFS_LBSIZE(mp));
1212 memset(bp->data, 0, XFS_LBSIZE(mp));
1215 * Copy basic information
1217 leaf_s = (xfs_attr_leafblock_t *)tmpbuffer;
1219 hdr_s = &leaf_s->hdr;
1220 hdr_d = &leaf_d->hdr;
1221 hdr_d->info = hdr_s->info; /* struct copy */
1222 hdr_d->firstused = cpu_to_be16(XFS_LBSIZE(mp));
1223 /* handle truncation gracefully */
1224 if (!hdr_d->firstused) {
1225 hdr_d->firstused = cpu_to_be16(
1226 XFS_LBSIZE(mp) - XFS_ATTR_LEAF_NAME_ALIGN);
1228 hdr_d->usedbytes = 0;
1231 hdr_d->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
1232 hdr_d->freemap[0].size = cpu_to_be16(be16_to_cpu(hdr_d->firstused) -
1233 sizeof(xfs_attr_leaf_hdr_t));
1236 * Copy all entry's in the same (sorted) order,
1237 * but allocate name/value pairs packed and in sequence.
1239 xfs_attr_leaf_moveents(leaf_s, 0, leaf_d, 0,
1240 be16_to_cpu(hdr_s->count), mp);
1241 xfs_da_log_buf(trans, bp, 0, XFS_LBSIZE(mp) - 1);
1243 kmem_free(tmpbuffer);
1247 * Redistribute the attribute list entries between two leaf nodes,
1248 * taking into account the size of the new entry.
1250 * NOTE: if new block is empty, then it will get the upper half of the
1251 * old block. At present, all (one) callers pass in an empty second block.
1253 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1254 * to match what it is doing in splitting the attribute leaf block. Those
1255 * values are used in "atomic rename" operations on attributes. Note that
1256 * the "new" and "old" values can end up in different blocks.
1259 xfs_attr_leaf_rebalance(xfs_da_state_t *state, xfs_da_state_blk_t *blk1,
1260 xfs_da_state_blk_t *blk2)
1262 xfs_da_args_t *args;
1263 xfs_da_state_blk_t *tmp_blk;
1264 xfs_attr_leafblock_t *leaf1, *leaf2;
1265 xfs_attr_leaf_hdr_t *hdr1, *hdr2;
1266 int count, totallen, max, space, swap;
1269 * Set up environment.
1271 ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
1272 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
1273 leaf1 = blk1->bp->data;
1274 leaf2 = blk2->bp->data;
1275 ASSERT(leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1276 ASSERT(leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1280 * Check ordering of blocks, reverse if it makes things simpler.
1282 * NOTE: Given that all (current) callers pass in an empty
1283 * second block, this code should never set "swap".
1286 if (xfs_attr_leaf_order(blk1->bp, blk2->bp)) {
1290 leaf1 = blk1->bp->data;
1291 leaf2 = blk2->bp->data;
1298 * Examine entries until we reduce the absolute difference in
1299 * byte usage between the two blocks to a minimum. Then get
1300 * the direction to copy and the number of elements to move.
1302 * "inleaf" is true if the new entry should be inserted into blk1.
1303 * If "swap" is also true, then reverse the sense of "inleaf".
1305 state->inleaf = xfs_attr_leaf_figure_balance(state, blk1, blk2,
1308 state->inleaf = !state->inleaf;
1311 * Move any entries required from leaf to leaf:
1313 if (count < be16_to_cpu(hdr1->count)) {
1315 * Figure the total bytes to be added to the destination leaf.
1317 /* number entries being moved */
1318 count = be16_to_cpu(hdr1->count) - count;
1319 space = be16_to_cpu(hdr1->usedbytes) - totallen;
1320 space += count * sizeof(xfs_attr_leaf_entry_t);
1323 * leaf2 is the destination, compact it if it looks tight.
1325 max = be16_to_cpu(hdr2->firstused)
1326 - sizeof(xfs_attr_leaf_hdr_t);
1327 max -= be16_to_cpu(hdr2->count) * sizeof(xfs_attr_leaf_entry_t);
1329 xfs_attr_leaf_compact(args->trans, blk2->bp);
1333 * Move high entries from leaf1 to low end of leaf2.
1335 xfs_attr_leaf_moveents(leaf1, be16_to_cpu(hdr1->count) - count,
1336 leaf2, 0, count, state->mp);
1338 xfs_da_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
1339 xfs_da_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
1340 } else if (count > be16_to_cpu(hdr1->count)) {
1342 * I assert that since all callers pass in an empty
1343 * second buffer, this code should never execute.
1347 * Figure the total bytes to be added to the destination leaf.
1349 /* number entries being moved */
1350 count -= be16_to_cpu(hdr1->count);
1351 space = totallen - be16_to_cpu(hdr1->usedbytes);
1352 space += count * sizeof(xfs_attr_leaf_entry_t);
1355 * leaf1 is the destination, compact it if it looks tight.
1357 max = be16_to_cpu(hdr1->firstused)
1358 - sizeof(xfs_attr_leaf_hdr_t);
1359 max -= be16_to_cpu(hdr1->count) * sizeof(xfs_attr_leaf_entry_t);
1361 xfs_attr_leaf_compact(args->trans, blk1->bp);
1365 * Move low entries from leaf2 to high end of leaf1.
1367 xfs_attr_leaf_moveents(leaf2, 0, leaf1,
1368 be16_to_cpu(hdr1->count), count, state->mp);
1370 xfs_da_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
1371 xfs_da_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
1375 * Copy out last hashval in each block for B-tree code.
1377 blk1->hashval = be32_to_cpu(
1378 leaf1->entries[be16_to_cpu(leaf1->hdr.count)-1].hashval);
1379 blk2->hashval = be32_to_cpu(
1380 leaf2->entries[be16_to_cpu(leaf2->hdr.count)-1].hashval);
1383 * Adjust the expected index for insertion.
1384 * NOTE: this code depends on the (current) situation that the
1385 * second block was originally empty.
1387 * If the insertion point moved to the 2nd block, we must adjust
1388 * the index. We must also track the entry just following the
1389 * new entry for use in an "atomic rename" operation, that entry
1390 * is always the "old" entry and the "new" entry is what we are
1391 * inserting. The index/blkno fields refer to the "old" entry,
1392 * while the index2/blkno2 fields refer to the "new" entry.
1394 if (blk1->index > be16_to_cpu(leaf1->hdr.count)) {
1395 ASSERT(state->inleaf == 0);
1396 blk2->index = blk1->index - be16_to_cpu(leaf1->hdr.count);
1397 args->index = args->index2 = blk2->index;
1398 args->blkno = args->blkno2 = blk2->blkno;
1399 } else if (blk1->index == be16_to_cpu(leaf1->hdr.count)) {
1400 if (state->inleaf) {
1401 args->index = blk1->index;
1402 args->blkno = blk1->blkno;
1404 args->blkno2 = blk2->blkno;
1406 blk2->index = blk1->index
1407 - be16_to_cpu(leaf1->hdr.count);
1408 args->index = args->index2 = blk2->index;
1409 args->blkno = args->blkno2 = blk2->blkno;
1412 ASSERT(state->inleaf == 1);
1413 args->index = args->index2 = blk1->index;
1414 args->blkno = args->blkno2 = blk1->blkno;
1419 * Examine entries until we reduce the absolute difference in
1420 * byte usage between the two blocks to a minimum.
1421 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1422 * GROT: there will always be enough room in either block for a new entry.
1423 * GROT: Do a double-split for this case?
1426 xfs_attr_leaf_figure_balance(xfs_da_state_t *state,
1427 xfs_da_state_blk_t *blk1,
1428 xfs_da_state_blk_t *blk2,
1429 int *countarg, int *usedbytesarg)
1431 xfs_attr_leafblock_t *leaf1, *leaf2;
1432 xfs_attr_leaf_hdr_t *hdr1, *hdr2;
1433 xfs_attr_leaf_entry_t *entry;
1434 int count, max, index, totallen, half;
1435 int lastdelta, foundit, tmp;
1438 * Set up environment.
1440 leaf1 = blk1->bp->data;
1441 leaf2 = blk2->bp->data;
1448 * Examine entries until we reduce the absolute difference in
1449 * byte usage between the two blocks to a minimum.
1451 max = be16_to_cpu(hdr1->count) + be16_to_cpu(hdr2->count);
1452 half = (max+1) * sizeof(*entry);
1453 half += be16_to_cpu(hdr1->usedbytes) +
1454 be16_to_cpu(hdr2->usedbytes) +
1455 xfs_attr_leaf_newentsize(
1456 state->args->namelen,
1457 state->args->valuelen,
1458 state->blocksize, NULL);
1460 lastdelta = state->blocksize;
1461 entry = &leaf1->entries[0];
1462 for (count = index = 0; count < max; entry++, index++, count++) {
1464 #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1466 * The new entry is in the first block, account for it.
1468 if (count == blk1->index) {
1469 tmp = totallen + sizeof(*entry) +
1470 xfs_attr_leaf_newentsize(
1471 state->args->namelen,
1472 state->args->valuelen,
1473 state->blocksize, NULL);
1474 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1476 lastdelta = XFS_ATTR_ABS(half - tmp);
1482 * Wrap around into the second block if necessary.
1484 if (count == be16_to_cpu(hdr1->count)) {
1486 entry = &leaf1->entries[0];
1491 * Figure out if next leaf entry would be too much.
1493 tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
1495 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1497 lastdelta = XFS_ATTR_ABS(half - tmp);
1503 * Calculate the number of usedbytes that will end up in lower block.
1504 * If new entry not in lower block, fix up the count.
1506 totallen -= count * sizeof(*entry);
1508 totallen -= sizeof(*entry) +
1509 xfs_attr_leaf_newentsize(
1510 state->args->namelen,
1511 state->args->valuelen,
1512 state->blocksize, NULL);
1516 *usedbytesarg = totallen;
1520 /*========================================================================
1521 * Routines used for shrinking the Btree.
1522 *========================================================================*/
1525 * Check a leaf block and its neighbors to see if the block should be
1526 * collapsed into one or the other neighbor. Always keep the block
1527 * with the smaller block number.
1528 * If the current block is over 50% full, don't try to join it, return 0.
1529 * If the block is empty, fill in the state structure and return 2.
1530 * If it can be collapsed, fill in the state structure and return 1.
1531 * If nothing can be done, return 0.
1533 * GROT: allow for INCOMPLETE entries in calculation.
1536 xfs_attr_leaf_toosmall(xfs_da_state_t *state, int *action)
1538 xfs_attr_leafblock_t *leaf;
1539 xfs_da_state_blk_t *blk;
1540 xfs_da_blkinfo_t *info;
1541 int count, bytes, forward, error, retval, i;
1546 * Check for the degenerate case of the block being over 50% full.
1547 * If so, it's not worth even looking to see if we might be able
1548 * to coalesce with a sibling.
1550 blk = &state->path.blk[ state->path.active-1 ];
1551 info = blk->bp->data;
1552 ASSERT(info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1553 leaf = (xfs_attr_leafblock_t *)info;
1554 count = be16_to_cpu(leaf->hdr.count);
1555 bytes = sizeof(xfs_attr_leaf_hdr_t) +
1556 count * sizeof(xfs_attr_leaf_entry_t) +
1557 be16_to_cpu(leaf->hdr.usedbytes);
1558 if (bytes > (state->blocksize >> 1)) {
1559 *action = 0; /* blk over 50%, don't try to join */
1564 * Check for the degenerate case of the block being empty.
1565 * If the block is empty, we'll simply delete it, no need to
1566 * coalesce it with a sibling block. We choose (arbitrarily)
1567 * to merge with the forward block unless it is NULL.
1571 * Make altpath point to the block we want to keep and
1572 * path point to the block we want to drop (this one).
1574 forward = (info->forw != 0);
1575 memcpy(&state->altpath, &state->path, sizeof(state->path));
1576 error = xfs_da_path_shift(state, &state->altpath, forward,
1589 * Examine each sibling block to see if we can coalesce with
1590 * at least 25% free space to spare. We need to figure out
1591 * whether to merge with the forward or the backward block.
1592 * We prefer coalescing with the lower numbered sibling so as
1593 * to shrink an attribute list over time.
1595 /* start with smaller blk num */
1596 forward = (be32_to_cpu(info->forw) < be32_to_cpu(info->back));
1597 for (i = 0; i < 2; forward = !forward, i++) {
1599 blkno = be32_to_cpu(info->forw);
1601 blkno = be32_to_cpu(info->back);
1604 error = xfs_da_read_buf(state->args->trans, state->args->dp,
1605 blkno, -1, &bp, XFS_ATTR_FORK);
1610 leaf = (xfs_attr_leafblock_t *)info;
1611 count = be16_to_cpu(leaf->hdr.count);
1612 bytes = state->blocksize - (state->blocksize>>2);
1613 bytes -= be16_to_cpu(leaf->hdr.usedbytes);
1615 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1616 count += be16_to_cpu(leaf->hdr.count);
1617 bytes -= be16_to_cpu(leaf->hdr.usedbytes);
1618 bytes -= count * sizeof(xfs_attr_leaf_entry_t);
1619 bytes -= sizeof(xfs_attr_leaf_hdr_t);
1620 xfs_da_brelse(state->args->trans, bp);
1622 break; /* fits with at least 25% to spare */
1630 * Make altpath point to the block we want to keep (the lower
1631 * numbered block) and path point to the block we want to drop.
1633 memcpy(&state->altpath, &state->path, sizeof(state->path));
1634 if (blkno < blk->blkno) {
1635 error = xfs_da_path_shift(state, &state->altpath, forward,
1638 error = xfs_da_path_shift(state, &state->path, forward,
1652 * Remove a name from the leaf attribute list structure.
1654 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
1655 * If two leaves are 37% full, when combined they will leave 25% free.
1658 xfs_attr_leaf_remove(xfs_dabuf_t *bp, xfs_da_args_t *args)
1660 xfs_attr_leafblock_t *leaf;
1661 xfs_attr_leaf_hdr_t *hdr;
1662 xfs_attr_leaf_map_t *map;
1663 xfs_attr_leaf_entry_t *entry;
1664 int before, after, smallest, entsize;
1665 int tablesize, tmp, i;
1669 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1671 mp = args->trans->t_mountp;
1672 ASSERT((be16_to_cpu(hdr->count) > 0)
1673 && (be16_to_cpu(hdr->count) < (XFS_LBSIZE(mp)/8)));
1674 ASSERT((args->index >= 0)
1675 && (args->index < be16_to_cpu(hdr->count)));
1676 ASSERT(be16_to_cpu(hdr->firstused) >=
1677 ((be16_to_cpu(hdr->count) * sizeof(*entry)) + sizeof(*hdr)));
1678 entry = &leaf->entries[args->index];
1679 ASSERT(be16_to_cpu(entry->nameidx) >= be16_to_cpu(hdr->firstused));
1680 ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
1683 * Scan through free region table:
1684 * check for adjacency of free'd entry with an existing one,
1685 * find smallest free region in case we need to replace it,
1686 * adjust any map that borders the entry table,
1688 tablesize = be16_to_cpu(hdr->count) * sizeof(xfs_attr_leaf_entry_t)
1689 + sizeof(xfs_attr_leaf_hdr_t);
1690 map = &hdr->freemap[0];
1691 tmp = be16_to_cpu(map->size);
1692 before = after = -1;
1693 smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
1694 entsize = xfs_attr_leaf_entsize(leaf, args->index);
1695 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; map++, i++) {
1696 ASSERT(be16_to_cpu(map->base) < XFS_LBSIZE(mp));
1697 ASSERT(be16_to_cpu(map->size) < XFS_LBSIZE(mp));
1698 if (be16_to_cpu(map->base) == tablesize) {
1699 be16_add_cpu(&map->base,
1700 -((int)sizeof(xfs_attr_leaf_entry_t)));
1701 be16_add_cpu(&map->size, sizeof(xfs_attr_leaf_entry_t));
1704 if ((be16_to_cpu(map->base) + be16_to_cpu(map->size))
1705 == be16_to_cpu(entry->nameidx)) {
1707 } else if (be16_to_cpu(map->base)
1708 == (be16_to_cpu(entry->nameidx) + entsize)) {
1710 } else if (be16_to_cpu(map->size) < tmp) {
1711 tmp = be16_to_cpu(map->size);
1717 * Coalesce adjacent freemap regions,
1718 * or replace the smallest region.
1720 if ((before >= 0) || (after >= 0)) {
1721 if ((before >= 0) && (after >= 0)) {
1722 map = &hdr->freemap[before];
1723 be16_add_cpu(&map->size, entsize);
1724 be16_add_cpu(&map->size,
1725 be16_to_cpu(hdr->freemap[after].size));
1726 hdr->freemap[after].base = 0;
1727 hdr->freemap[after].size = 0;
1728 } else if (before >= 0) {
1729 map = &hdr->freemap[before];
1730 be16_add_cpu(&map->size, entsize);
1732 map = &hdr->freemap[after];
1733 /* both on-disk, don't endian flip twice */
1734 map->base = entry->nameidx;
1735 be16_add_cpu(&map->size, entsize);
1739 * Replace smallest region (if it is smaller than free'd entry)
1741 map = &hdr->freemap[smallest];
1742 if (be16_to_cpu(map->size) < entsize) {
1743 map->base = cpu_to_be16(be16_to_cpu(entry->nameidx));
1744 map->size = cpu_to_be16(entsize);
1749 * Did we remove the first entry?
1751 if (be16_to_cpu(entry->nameidx) == be16_to_cpu(hdr->firstused))
1757 * Compress the remaining entries and zero out the removed stuff.
1759 memset(xfs_attr_leaf_name(leaf, args->index), 0, entsize);
1760 be16_add_cpu(&hdr->usedbytes, -entsize);
1761 xfs_da_log_buf(args->trans, bp,
1762 XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
1765 tmp = (be16_to_cpu(hdr->count) - args->index)
1766 * sizeof(xfs_attr_leaf_entry_t);
1767 memmove((char *)entry, (char *)(entry+1), tmp);
1768 be16_add_cpu(&hdr->count, -1);
1769 xfs_da_log_buf(args->trans, bp,
1770 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1771 entry = &leaf->entries[be16_to_cpu(hdr->count)];
1772 memset((char *)entry, 0, sizeof(xfs_attr_leaf_entry_t));
1775 * If we removed the first entry, re-find the first used byte
1776 * in the name area. Note that if the entry was the "firstused",
1777 * then we don't have a "hole" in our block resulting from
1778 * removing the name.
1781 tmp = XFS_LBSIZE(mp);
1782 entry = &leaf->entries[0];
1783 for (i = be16_to_cpu(hdr->count)-1; i >= 0; entry++, i--) {
1784 ASSERT(be16_to_cpu(entry->nameidx) >=
1785 be16_to_cpu(hdr->firstused));
1786 ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
1788 if (be16_to_cpu(entry->nameidx) < tmp)
1789 tmp = be16_to_cpu(entry->nameidx);
1791 hdr->firstused = cpu_to_be16(tmp);
1792 if (!hdr->firstused) {
1793 hdr->firstused = cpu_to_be16(
1794 tmp - XFS_ATTR_LEAF_NAME_ALIGN);
1797 hdr->holes = 1; /* mark as needing compaction */
1799 xfs_da_log_buf(args->trans, bp,
1800 XFS_DA_LOGRANGE(leaf, hdr, sizeof(*hdr)));
1803 * Check if leaf is less than 50% full, caller may want to
1804 * "join" the leaf with a sibling if so.
1806 tmp = sizeof(xfs_attr_leaf_hdr_t);
1807 tmp += be16_to_cpu(leaf->hdr.count) * sizeof(xfs_attr_leaf_entry_t);
1808 tmp += be16_to_cpu(leaf->hdr.usedbytes);
1809 return(tmp < mp->m_attr_magicpct); /* leaf is < 37% full */
1813 * Move all the attribute list entries from drop_leaf into save_leaf.
1816 xfs_attr_leaf_unbalance(xfs_da_state_t *state, xfs_da_state_blk_t *drop_blk,
1817 xfs_da_state_blk_t *save_blk)
1819 xfs_attr_leafblock_t *drop_leaf, *save_leaf, *tmp_leaf;
1820 xfs_attr_leaf_hdr_t *drop_hdr, *save_hdr, *tmp_hdr;
1825 * Set up environment.
1828 ASSERT(drop_blk->magic == XFS_ATTR_LEAF_MAGIC);
1829 ASSERT(save_blk->magic == XFS_ATTR_LEAF_MAGIC);
1830 drop_leaf = drop_blk->bp->data;
1831 save_leaf = save_blk->bp->data;
1832 ASSERT(drop_leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1833 ASSERT(save_leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1834 drop_hdr = &drop_leaf->hdr;
1835 save_hdr = &save_leaf->hdr;
1838 * Save last hashval from dying block for later Btree fixup.
1840 drop_blk->hashval = be32_to_cpu(
1841 drop_leaf->entries[be16_to_cpu(drop_leaf->hdr.count)-1].hashval);
1844 * Check if we need a temp buffer, or can we do it in place.
1845 * Note that we don't check "leaf" for holes because we will
1846 * always be dropping it, toosmall() decided that for us already.
1848 if (save_hdr->holes == 0) {
1850 * dest leaf has no holes, so we add there. May need
1851 * to make some room in the entry array.
1853 if (xfs_attr_leaf_order(save_blk->bp, drop_blk->bp)) {
1854 xfs_attr_leaf_moveents(drop_leaf, 0, save_leaf, 0,
1855 be16_to_cpu(drop_hdr->count), mp);
1857 xfs_attr_leaf_moveents(drop_leaf, 0, save_leaf,
1858 be16_to_cpu(save_hdr->count),
1859 be16_to_cpu(drop_hdr->count), mp);
1863 * Destination has holes, so we make a temporary copy
1864 * of the leaf and add them both to that.
1866 tmpbuffer = kmem_alloc(state->blocksize, KM_SLEEP);
1867 ASSERT(tmpbuffer != NULL);
1868 memset(tmpbuffer, 0, state->blocksize);
1869 tmp_leaf = (xfs_attr_leafblock_t *)tmpbuffer;
1870 tmp_hdr = &tmp_leaf->hdr;
1871 tmp_hdr->info = save_hdr->info; /* struct copy */
1873 tmp_hdr->firstused = cpu_to_be16(state->blocksize);
1874 if (!tmp_hdr->firstused) {
1875 tmp_hdr->firstused = cpu_to_be16(
1876 state->blocksize - XFS_ATTR_LEAF_NAME_ALIGN);
1878 tmp_hdr->usedbytes = 0;
1879 if (xfs_attr_leaf_order(save_blk->bp, drop_blk->bp)) {
1880 xfs_attr_leaf_moveents(drop_leaf, 0, tmp_leaf, 0,
1881 be16_to_cpu(drop_hdr->count), mp);
1882 xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf,
1883 be16_to_cpu(tmp_leaf->hdr.count),
1884 be16_to_cpu(save_hdr->count), mp);
1886 xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf, 0,
1887 be16_to_cpu(save_hdr->count), mp);
1888 xfs_attr_leaf_moveents(drop_leaf, 0, tmp_leaf,
1889 be16_to_cpu(tmp_leaf->hdr.count),
1890 be16_to_cpu(drop_hdr->count), mp);
1892 memcpy((char *)save_leaf, (char *)tmp_leaf, state->blocksize);
1893 kmem_free(tmpbuffer);
1896 xfs_da_log_buf(state->args->trans, save_blk->bp, 0,
1897 state->blocksize - 1);
1900 * Copy out last hashval in each block for B-tree code.
1902 save_blk->hashval = be32_to_cpu(
1903 save_leaf->entries[be16_to_cpu(save_leaf->hdr.count)-1].hashval);
1906 /*========================================================================
1907 * Routines used for finding things in the Btree.
1908 *========================================================================*/
1911 * Look up a name in a leaf attribute list structure.
1912 * This is the internal routine, it uses the caller's buffer.
1914 * Note that duplicate keys are allowed, but only check within the
1915 * current leaf node. The Btree code must check in adjacent leaf nodes.
1917 * Return in args->index the index into the entry[] array of either
1918 * the found entry, or where the entry should have been (insert before
1921 * Don't change the args->value unless we find the attribute.
1924 xfs_attr_leaf_lookup_int(xfs_dabuf_t *bp, xfs_da_args_t *args)
1926 xfs_attr_leafblock_t *leaf;
1927 xfs_attr_leaf_entry_t *entry;
1928 xfs_attr_leaf_name_local_t *name_loc;
1929 xfs_attr_leaf_name_remote_t *name_rmt;
1931 xfs_dahash_t hashval;
1934 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1935 ASSERT(be16_to_cpu(leaf->hdr.count)
1936 < (XFS_LBSIZE(args->dp->i_mount)/8));
1939 * Binary search. (note: small blocks will skip this loop)
1941 hashval = args->hashval;
1942 probe = span = be16_to_cpu(leaf->hdr.count) / 2;
1943 for (entry = &leaf->entries[probe]; span > 4;
1944 entry = &leaf->entries[probe]) {
1946 if (be32_to_cpu(entry->hashval) < hashval)
1948 else if (be32_to_cpu(entry->hashval) > hashval)
1953 ASSERT((probe >= 0) &&
1955 || (probe < be16_to_cpu(leaf->hdr.count))));
1956 ASSERT((span <= 4) || (be32_to_cpu(entry->hashval) == hashval));
1959 * Since we may have duplicate hashval's, find the first matching
1960 * hashval in the leaf.
1962 while ((probe > 0) && (be32_to_cpu(entry->hashval) >= hashval)) {
1966 while ((probe < be16_to_cpu(leaf->hdr.count)) &&
1967 (be32_to_cpu(entry->hashval) < hashval)) {
1971 if ((probe == be16_to_cpu(leaf->hdr.count)) ||
1972 (be32_to_cpu(entry->hashval) != hashval)) {
1973 args->index = probe;
1974 return(XFS_ERROR(ENOATTR));
1978 * Duplicate keys may be present, so search all of them for a match.
1980 for ( ; (probe < be16_to_cpu(leaf->hdr.count)) &&
1981 (be32_to_cpu(entry->hashval) == hashval);
1984 * GROT: Add code to remove incomplete entries.
1987 * If we are looking for INCOMPLETE entries, show only those.
1988 * If we are looking for complete entries, show only those.
1990 if ((args->flags & XFS_ATTR_INCOMPLETE) !=
1991 (entry->flags & XFS_ATTR_INCOMPLETE)) {
1994 if (entry->flags & XFS_ATTR_LOCAL) {
1995 name_loc = xfs_attr_leaf_name_local(leaf, probe);
1996 if (name_loc->namelen != args->namelen)
1998 if (memcmp(args->name, (char *)name_loc->nameval, args->namelen) != 0)
2000 if (!xfs_attr_namesp_match(args->flags, entry->flags))
2002 args->index = probe;
2003 return(XFS_ERROR(EEXIST));
2005 name_rmt = xfs_attr_leaf_name_remote(leaf, probe);
2006 if (name_rmt->namelen != args->namelen)
2008 if (memcmp(args->name, (char *)name_rmt->name,
2009 args->namelen) != 0)
2011 if (!xfs_attr_namesp_match(args->flags, entry->flags))
2013 args->index = probe;
2014 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2015 args->rmtblkcnt = XFS_B_TO_FSB(args->dp->i_mount,
2016 be32_to_cpu(name_rmt->valuelen));
2017 return(XFS_ERROR(EEXIST));
2020 args->index = probe;
2021 return(XFS_ERROR(ENOATTR));
2025 * Get the value associated with an attribute name from a leaf attribute
2029 xfs_attr_leaf_getvalue(xfs_dabuf_t *bp, xfs_da_args_t *args)
2032 xfs_attr_leafblock_t *leaf;
2033 xfs_attr_leaf_entry_t *entry;
2034 xfs_attr_leaf_name_local_t *name_loc;
2035 xfs_attr_leaf_name_remote_t *name_rmt;
2038 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2039 ASSERT(be16_to_cpu(leaf->hdr.count)
2040 < (XFS_LBSIZE(args->dp->i_mount)/8));
2041 ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
2043 entry = &leaf->entries[args->index];
2044 if (entry->flags & XFS_ATTR_LOCAL) {
2045 name_loc = xfs_attr_leaf_name_local(leaf, args->index);
2046 ASSERT(name_loc->namelen == args->namelen);
2047 ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
2048 valuelen = be16_to_cpu(name_loc->valuelen);
2049 if (args->flags & ATTR_KERNOVAL) {
2050 args->valuelen = valuelen;
2053 if (args->valuelen < valuelen) {
2054 args->valuelen = valuelen;
2055 return(XFS_ERROR(ERANGE));
2057 args->valuelen = valuelen;
2058 memcpy(args->value, &name_loc->nameval[args->namelen], valuelen);
2060 name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
2061 ASSERT(name_rmt->namelen == args->namelen);
2062 ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
2063 valuelen = be32_to_cpu(name_rmt->valuelen);
2064 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2065 args->rmtblkcnt = XFS_B_TO_FSB(args->dp->i_mount, valuelen);
2066 if (args->flags & ATTR_KERNOVAL) {
2067 args->valuelen = valuelen;
2070 if (args->valuelen < valuelen) {
2071 args->valuelen = valuelen;
2072 return(XFS_ERROR(ERANGE));
2074 args->valuelen = valuelen;
2079 /*========================================================================
2081 *========================================================================*/
2084 * Move the indicated entries from one leaf to another.
2085 * NOTE: this routine modifies both source and destination leaves.
2089 xfs_attr_leaf_moveents(xfs_attr_leafblock_t *leaf_s, int start_s,
2090 xfs_attr_leafblock_t *leaf_d, int start_d,
2091 int count, xfs_mount_t *mp)
2093 xfs_attr_leaf_hdr_t *hdr_s, *hdr_d;
2094 xfs_attr_leaf_entry_t *entry_s, *entry_d;
2098 * Check for nothing to do.
2104 * Set up environment.
2106 ASSERT(leaf_s->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2107 ASSERT(leaf_d->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2108 hdr_s = &leaf_s->hdr;
2109 hdr_d = &leaf_d->hdr;
2110 ASSERT((be16_to_cpu(hdr_s->count) > 0) &&
2111 (be16_to_cpu(hdr_s->count) < (XFS_LBSIZE(mp)/8)));
2112 ASSERT(be16_to_cpu(hdr_s->firstused) >=
2113 ((be16_to_cpu(hdr_s->count)
2114 * sizeof(*entry_s))+sizeof(*hdr_s)));
2115 ASSERT(be16_to_cpu(hdr_d->count) < (XFS_LBSIZE(mp)/8));
2116 ASSERT(be16_to_cpu(hdr_d->firstused) >=
2117 ((be16_to_cpu(hdr_d->count)
2118 * sizeof(*entry_d))+sizeof(*hdr_d)));
2120 ASSERT(start_s < be16_to_cpu(hdr_s->count));
2121 ASSERT(start_d <= be16_to_cpu(hdr_d->count));
2122 ASSERT(count <= be16_to_cpu(hdr_s->count));
2125 * Move the entries in the destination leaf up to make a hole?
2127 if (start_d < be16_to_cpu(hdr_d->count)) {
2128 tmp = be16_to_cpu(hdr_d->count) - start_d;
2129 tmp *= sizeof(xfs_attr_leaf_entry_t);
2130 entry_s = &leaf_d->entries[start_d];
2131 entry_d = &leaf_d->entries[start_d + count];
2132 memmove((char *)entry_d, (char *)entry_s, tmp);
2136 * Copy all entry's in the same (sorted) order,
2137 * but allocate attribute info packed and in sequence.
2139 entry_s = &leaf_s->entries[start_s];
2140 entry_d = &leaf_d->entries[start_d];
2142 for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
2143 ASSERT(be16_to_cpu(entry_s->nameidx)
2144 >= be16_to_cpu(hdr_s->firstused));
2145 tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
2148 * Code to drop INCOMPLETE entries. Difficult to use as we
2149 * may also need to change the insertion index. Code turned
2150 * off for 6.2, should be revisited later.
2152 if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
2153 memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2154 be16_add_cpu(&hdr_s->usedbytes, -tmp);
2155 be16_add_cpu(&hdr_s->count, -1);
2156 entry_d--; /* to compensate for ++ in loop hdr */
2158 if ((start_s + i) < offset)
2159 result++; /* insertion index adjustment */
2162 be16_add_cpu(&hdr_d->firstused, -tmp);
2163 /* both on-disk, don't endian flip twice */
2164 entry_d->hashval = entry_s->hashval;
2165 /* both on-disk, don't endian flip twice */
2166 entry_d->nameidx = hdr_d->firstused;
2167 entry_d->flags = entry_s->flags;
2168 ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
2170 memmove(xfs_attr_leaf_name(leaf_d, desti),
2171 xfs_attr_leaf_name(leaf_s, start_s + i), tmp);
2172 ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
2174 memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2175 be16_add_cpu(&hdr_s->usedbytes, -tmp);
2176 be16_add_cpu(&hdr_d->usedbytes, tmp);
2177 be16_add_cpu(&hdr_s->count, -1);
2178 be16_add_cpu(&hdr_d->count, 1);
2179 tmp = be16_to_cpu(hdr_d->count)
2180 * sizeof(xfs_attr_leaf_entry_t)
2181 + sizeof(xfs_attr_leaf_hdr_t);
2182 ASSERT(be16_to_cpu(hdr_d->firstused) >= tmp);
2189 * Zero out the entries we just copied.
2191 if (start_s == be16_to_cpu(hdr_s->count)) {
2192 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2193 entry_s = &leaf_s->entries[start_s];
2194 ASSERT(((char *)entry_s + tmp) <=
2195 ((char *)leaf_s + XFS_LBSIZE(mp)));
2196 memset((char *)entry_s, 0, tmp);
2199 * Move the remaining entries down to fill the hole,
2200 * then zero the entries at the top.
2202 tmp = be16_to_cpu(hdr_s->count) - count;
2203 tmp *= sizeof(xfs_attr_leaf_entry_t);
2204 entry_s = &leaf_s->entries[start_s + count];
2205 entry_d = &leaf_s->entries[start_s];
2206 memmove((char *)entry_d, (char *)entry_s, tmp);
2208 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2209 entry_s = &leaf_s->entries[be16_to_cpu(hdr_s->count)];
2210 ASSERT(((char *)entry_s + tmp) <=
2211 ((char *)leaf_s + XFS_LBSIZE(mp)));
2212 memset((char *)entry_s, 0, tmp);
2216 * Fill in the freemap information
2218 hdr_d->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
2219 be16_add_cpu(&hdr_d->freemap[0].base, be16_to_cpu(hdr_d->count) *
2220 sizeof(xfs_attr_leaf_entry_t));
2221 hdr_d->freemap[0].size = cpu_to_be16(be16_to_cpu(hdr_d->firstused)
2222 - be16_to_cpu(hdr_d->freemap[0].base));
2223 hdr_d->freemap[1].base = 0;
2224 hdr_d->freemap[2].base = 0;
2225 hdr_d->freemap[1].size = 0;
2226 hdr_d->freemap[2].size = 0;
2227 hdr_s->holes = 1; /* leaf may not be compact */
2231 * Compare two leaf blocks "order".
2232 * Return 0 unless leaf2 should go before leaf1.
2235 xfs_attr_leaf_order(xfs_dabuf_t *leaf1_bp, xfs_dabuf_t *leaf2_bp)
2237 xfs_attr_leafblock_t *leaf1, *leaf2;
2239 leaf1 = leaf1_bp->data;
2240 leaf2 = leaf2_bp->data;
2241 ASSERT((leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) &&
2242 (leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)));
2243 if ((be16_to_cpu(leaf1->hdr.count) > 0) &&
2244 (be16_to_cpu(leaf2->hdr.count) > 0) &&
2245 ((be32_to_cpu(leaf2->entries[0].hashval) <
2246 be32_to_cpu(leaf1->entries[0].hashval)) ||
2247 (be32_to_cpu(leaf2->entries[
2248 be16_to_cpu(leaf2->hdr.count)-1].hashval) <
2249 be32_to_cpu(leaf1->entries[
2250 be16_to_cpu(leaf1->hdr.count)-1].hashval)))) {
2257 * Pick up the last hashvalue from a leaf block.
2260 xfs_attr_leaf_lasthash(xfs_dabuf_t *bp, int *count)
2262 xfs_attr_leafblock_t *leaf;
2265 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2267 *count = be16_to_cpu(leaf->hdr.count);
2268 if (!leaf->hdr.count)
2270 return be32_to_cpu(leaf->entries[be16_to_cpu(leaf->hdr.count)-1].hashval);
2274 * Calculate the number of bytes used to store the indicated attribute
2275 * (whether local or remote only calculate bytes in this block).
2278 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2280 xfs_attr_leaf_name_local_t *name_loc;
2281 xfs_attr_leaf_name_remote_t *name_rmt;
2284 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2285 if (leaf->entries[index].flags & XFS_ATTR_LOCAL) {
2286 name_loc = xfs_attr_leaf_name_local(leaf, index);
2287 size = xfs_attr_leaf_entsize_local(name_loc->namelen,
2288 be16_to_cpu(name_loc->valuelen));
2290 name_rmt = xfs_attr_leaf_name_remote(leaf, index);
2291 size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
2297 * Calculate the number of bytes that would be required to store the new
2298 * attribute (whether local or remote only calculate bytes in this block).
2299 * This routine decides as a side effect whether the attribute will be
2300 * a "local" or a "remote" attribute.
2303 xfs_attr_leaf_newentsize(int namelen, int valuelen, int blocksize, int *local)
2307 size = xfs_attr_leaf_entsize_local(namelen, valuelen);
2308 if (size < xfs_attr_leaf_entsize_local_max(blocksize)) {
2313 size = xfs_attr_leaf_entsize_remote(namelen);
2322 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
2325 xfs_attr_leaf_list_int(xfs_dabuf_t *bp, xfs_attr_list_context_t *context)
2327 attrlist_cursor_kern_t *cursor;
2328 xfs_attr_leafblock_t *leaf;
2329 xfs_attr_leaf_entry_t *entry;
2334 cursor = context->cursor;
2335 cursor->initted = 1;
2337 trace_xfs_attr_list_leaf(context);
2340 * Re-find our place in the leaf block if this is a new syscall.
2342 if (context->resynch) {
2343 entry = &leaf->entries[0];
2344 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2345 if (be32_to_cpu(entry->hashval) == cursor->hashval) {
2346 if (cursor->offset == context->dupcnt) {
2347 context->dupcnt = 0;
2351 } else if (be32_to_cpu(entry->hashval) >
2353 context->dupcnt = 0;
2357 if (i == be16_to_cpu(leaf->hdr.count)) {
2358 trace_xfs_attr_list_notfound(context);
2362 entry = &leaf->entries[0];
2365 context->resynch = 0;
2368 * We have found our place, start copying out the new attributes.
2371 for ( ; (i < be16_to_cpu(leaf->hdr.count)); entry++, i++) {
2372 if (be32_to_cpu(entry->hashval) != cursor->hashval) {
2373 cursor->hashval = be32_to_cpu(entry->hashval);
2377 if (entry->flags & XFS_ATTR_INCOMPLETE)
2378 continue; /* skip incomplete entries */
2380 if (entry->flags & XFS_ATTR_LOCAL) {
2381 xfs_attr_leaf_name_local_t *name_loc =
2382 xfs_attr_leaf_name_local(leaf, i);
2384 retval = context->put_listent(context,
2387 (int)name_loc->namelen,
2388 be16_to_cpu(name_loc->valuelen),
2389 &name_loc->nameval[name_loc->namelen]);
2393 xfs_attr_leaf_name_remote_t *name_rmt =
2394 xfs_attr_leaf_name_remote(leaf, i);
2396 int valuelen = be32_to_cpu(name_rmt->valuelen);
2398 if (context->put_value) {
2401 memset((char *)&args, 0, sizeof(args));
2402 args.dp = context->dp;
2403 args.whichfork = XFS_ATTR_FORK;
2404 args.valuelen = valuelen;
2405 args.value = kmem_alloc(valuelen, KM_SLEEP | KM_NOFS);
2406 args.rmtblkno = be32_to_cpu(name_rmt->valueblk);
2407 args.rmtblkcnt = XFS_B_TO_FSB(args.dp->i_mount, valuelen);
2408 retval = xfs_attr_rmtval_get(&args);
2410 retval = context->put_listent(context,
2413 (int)name_rmt->namelen,
2416 kmem_free(args.value);
2418 retval = context->put_listent(context,
2421 (int)name_rmt->namelen,
2428 if (context->seen_enough)
2432 trace_xfs_attr_list_leaf_end(context);
2437 /*========================================================================
2438 * Manage the INCOMPLETE flag in a leaf entry
2439 *========================================================================*/
2442 * Clear the INCOMPLETE flag on an entry in a leaf block.
2445 xfs_attr_leaf_clearflag(xfs_da_args_t *args)
2447 xfs_attr_leafblock_t *leaf;
2448 xfs_attr_leaf_entry_t *entry;
2449 xfs_attr_leaf_name_remote_t *name_rmt;
2453 xfs_attr_leaf_name_local_t *name_loc;
2459 * Set up the operation.
2461 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
2469 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2470 ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
2471 ASSERT(args->index >= 0);
2472 entry = &leaf->entries[ args->index ];
2473 ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);
2476 if (entry->flags & XFS_ATTR_LOCAL) {
2477 name_loc = xfs_attr_leaf_name_local(leaf, args->index);
2478 namelen = name_loc->namelen;
2479 name = (char *)name_loc->nameval;
2481 name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
2482 namelen = name_rmt->namelen;
2483 name = (char *)name_rmt->name;
2485 ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
2486 ASSERT(namelen == args->namelen);
2487 ASSERT(memcmp(name, args->name, namelen) == 0);
2490 entry->flags &= ~XFS_ATTR_INCOMPLETE;
2491 xfs_da_log_buf(args->trans, bp,
2492 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2494 if (args->rmtblkno) {
2495 ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
2496 name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
2497 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2498 name_rmt->valuelen = cpu_to_be32(args->valuelen);
2499 xfs_da_log_buf(args->trans, bp,
2500 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2502 xfs_da_buf_done(bp);
2505 * Commit the flag value change and start the next trans in series.
2507 return xfs_trans_roll(&args->trans, args->dp);
2511 * Set the INCOMPLETE flag on an entry in a leaf block.
2514 xfs_attr_leaf_setflag(xfs_da_args_t *args)
2516 xfs_attr_leafblock_t *leaf;
2517 xfs_attr_leaf_entry_t *entry;
2518 xfs_attr_leaf_name_remote_t *name_rmt;
2523 * Set up the operation.
2525 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
2533 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2534 ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
2535 ASSERT(args->index >= 0);
2536 entry = &leaf->entries[ args->index ];
2538 ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
2539 entry->flags |= XFS_ATTR_INCOMPLETE;
2540 xfs_da_log_buf(args->trans, bp,
2541 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2542 if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
2543 name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
2544 name_rmt->valueblk = 0;
2545 name_rmt->valuelen = 0;
2546 xfs_da_log_buf(args->trans, bp,
2547 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2549 xfs_da_buf_done(bp);
2552 * Commit the flag value change and start the next trans in series.
2554 return xfs_trans_roll(&args->trans, args->dp);
2558 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2559 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2560 * entry given by args->blkno2/index2.
2562 * Note that they could be in different blocks, or in the same block.
2565 xfs_attr_leaf_flipflags(xfs_da_args_t *args)
2567 xfs_attr_leafblock_t *leaf1, *leaf2;
2568 xfs_attr_leaf_entry_t *entry1, *entry2;
2569 xfs_attr_leaf_name_remote_t *name_rmt;
2570 xfs_dabuf_t *bp1, *bp2;
2573 xfs_attr_leaf_name_local_t *name_loc;
2574 int namelen1, namelen2;
2575 char *name1, *name2;
2579 * Read the block containing the "old" attr
2581 error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp1,
2586 ASSERT(bp1 != NULL);
2589 * Read the block containing the "new" attr, if it is different
2591 if (args->blkno2 != args->blkno) {
2592 error = xfs_da_read_buf(args->trans, args->dp, args->blkno2,
2593 -1, &bp2, XFS_ATTR_FORK);
2597 ASSERT(bp2 != NULL);
2603 ASSERT(leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2604 ASSERT(args->index < be16_to_cpu(leaf1->hdr.count));
2605 ASSERT(args->index >= 0);
2606 entry1 = &leaf1->entries[ args->index ];
2609 ASSERT(leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2610 ASSERT(args->index2 < be16_to_cpu(leaf2->hdr.count));
2611 ASSERT(args->index2 >= 0);
2612 entry2 = &leaf2->entries[ args->index2 ];
2615 if (entry1->flags & XFS_ATTR_LOCAL) {
2616 name_loc = xfs_attr_leaf_name_local(leaf1, args->index);
2617 namelen1 = name_loc->namelen;
2618 name1 = (char *)name_loc->nameval;
2620 name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
2621 namelen1 = name_rmt->namelen;
2622 name1 = (char *)name_rmt->name;
2624 if (entry2->flags & XFS_ATTR_LOCAL) {
2625 name_loc = xfs_attr_leaf_name_local(leaf2, args->index2);
2626 namelen2 = name_loc->namelen;
2627 name2 = (char *)name_loc->nameval;
2629 name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
2630 namelen2 = name_rmt->namelen;
2631 name2 = (char *)name_rmt->name;
2633 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
2634 ASSERT(namelen1 == namelen2);
2635 ASSERT(memcmp(name1, name2, namelen1) == 0);
2638 ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
2639 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);
2641 entry1->flags &= ~XFS_ATTR_INCOMPLETE;
2642 xfs_da_log_buf(args->trans, bp1,
2643 XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
2644 if (args->rmtblkno) {
2645 ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
2646 name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
2647 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2648 name_rmt->valuelen = cpu_to_be32(args->valuelen);
2649 xfs_da_log_buf(args->trans, bp1,
2650 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
2653 entry2->flags |= XFS_ATTR_INCOMPLETE;
2654 xfs_da_log_buf(args->trans, bp2,
2655 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
2656 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
2657 name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
2658 name_rmt->valueblk = 0;
2659 name_rmt->valuelen = 0;
2660 xfs_da_log_buf(args->trans, bp2,
2661 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
2663 xfs_da_buf_done(bp1);
2665 xfs_da_buf_done(bp2);
2668 * Commit the flag value change and start the next trans in series.
2670 error = xfs_trans_roll(&args->trans, args->dp);
2675 /*========================================================================
2676 * Indiscriminately delete the entire attribute fork
2677 *========================================================================*/
2680 * Recurse (gasp!) through the attribute nodes until we find leaves.
2681 * We're doing a depth-first traversal in order to invalidate everything.
2684 xfs_attr_root_inactive(xfs_trans_t **trans, xfs_inode_t *dp)
2686 xfs_da_blkinfo_t *info;
2692 * Read block 0 to see what we have to work with.
2693 * We only get here if we have extents, since we remove
2694 * the extents in reverse order the extent containing
2695 * block 0 must still be there.
2697 error = xfs_da_read_buf(*trans, dp, 0, -1, &bp, XFS_ATTR_FORK);
2700 blkno = xfs_da_blkno(bp);
2703 * Invalidate the tree, even if the "tree" is only a single leaf block.
2704 * This is a depth-first traversal!
2707 if (info->magic == cpu_to_be16(XFS_DA_NODE_MAGIC)) {
2708 error = xfs_attr_node_inactive(trans, dp, bp, 1);
2709 } else if (info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) {
2710 error = xfs_attr_leaf_inactive(trans, dp, bp);
2712 error = XFS_ERROR(EIO);
2713 xfs_da_brelse(*trans, bp);
2719 * Invalidate the incore copy of the root block.
2721 error = xfs_da_get_buf(*trans, dp, 0, blkno, &bp, XFS_ATTR_FORK);
2724 xfs_da_binval(*trans, bp); /* remove from cache */
2726 * Commit the invalidate and start the next transaction.
2728 error = xfs_trans_roll(trans, dp);
2734 * Recurse (gasp!) through the attribute nodes until we find leaves.
2735 * We're doing a depth-first traversal in order to invalidate everything.
2738 xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp,
2741 xfs_da_blkinfo_t *info;
2742 xfs_da_intnode_t *node;
2743 xfs_dablk_t child_fsb;
2744 xfs_daddr_t parent_blkno, child_blkno;
2745 int error, count, i;
2746 xfs_dabuf_t *child_bp;
2749 * Since this code is recursive (gasp!) we must protect ourselves.
2751 if (level > XFS_DA_NODE_MAXDEPTH) {
2752 xfs_da_brelse(*trans, bp); /* no locks for later trans */
2753 return(XFS_ERROR(EIO));
2757 ASSERT(node->hdr.info.magic == cpu_to_be16(XFS_DA_NODE_MAGIC));
2758 parent_blkno = xfs_da_blkno(bp); /* save for re-read later */
2759 count = be16_to_cpu(node->hdr.count);
2761 xfs_da_brelse(*trans, bp);
2764 child_fsb = be32_to_cpu(node->btree[0].before);
2765 xfs_da_brelse(*trans, bp); /* no locks for later trans */
2768 * If this is the node level just above the leaves, simply loop
2769 * over the leaves removing all of them. If this is higher up
2770 * in the tree, recurse downward.
2772 for (i = 0; i < count; i++) {
2774 * Read the subsidiary block to see what we have to work with.
2775 * Don't do this in a transaction. This is a depth-first
2776 * traversal of the tree so we may deal with many blocks
2777 * before we come back to this one.
2779 error = xfs_da_read_buf(*trans, dp, child_fsb, -2, &child_bp,
2784 /* save for re-read later */
2785 child_blkno = xfs_da_blkno(child_bp);
2788 * Invalidate the subtree, however we have to.
2790 info = child_bp->data;
2791 if (info->magic == cpu_to_be16(XFS_DA_NODE_MAGIC)) {
2792 error = xfs_attr_node_inactive(trans, dp,
2794 } else if (info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) {
2795 error = xfs_attr_leaf_inactive(trans, dp,
2798 error = XFS_ERROR(EIO);
2799 xfs_da_brelse(*trans, child_bp);
2805 * Remove the subsidiary block from the cache
2808 error = xfs_da_get_buf(*trans, dp, 0, child_blkno,
2809 &child_bp, XFS_ATTR_FORK);
2812 xfs_da_binval(*trans, child_bp);
2816 * If we're not done, re-read the parent to get the next
2817 * child block number.
2819 if ((i+1) < count) {
2820 error = xfs_da_read_buf(*trans, dp, 0, parent_blkno,
2821 &bp, XFS_ATTR_FORK);
2824 child_fsb = be32_to_cpu(node->btree[i+1].before);
2825 xfs_da_brelse(*trans, bp);
2828 * Atomically commit the whole invalidate stuff.
2830 error = xfs_trans_roll(trans, dp);
2839 * Invalidate all of the "remote" value regions pointed to by a particular
2841 * Note that we must release the lock on the buffer so that we are not
2842 * caught holding something that the logging code wants to flush to disk.
2845 xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp)
2847 xfs_attr_leafblock_t *leaf;
2848 xfs_attr_leaf_entry_t *entry;
2849 xfs_attr_leaf_name_remote_t *name_rmt;
2850 xfs_attr_inactive_list_t *list, *lp;
2851 int error, count, size, tmp, i;
2854 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2857 * Count the number of "remote" value extents.
2860 entry = &leaf->entries[0];
2861 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2862 if (be16_to_cpu(entry->nameidx) &&
2863 ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2864 name_rmt = xfs_attr_leaf_name_remote(leaf, i);
2865 if (name_rmt->valueblk)
2871 * If there are no "remote" values, we're done.
2874 xfs_da_brelse(*trans, bp);
2879 * Allocate storage for a list of all the "remote" value extents.
2881 size = count * sizeof(xfs_attr_inactive_list_t);
2882 list = (xfs_attr_inactive_list_t *)kmem_alloc(size, KM_SLEEP);
2885 * Identify each of the "remote" value extents.
2888 entry = &leaf->entries[0];
2889 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2890 if (be16_to_cpu(entry->nameidx) &&
2891 ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2892 name_rmt = xfs_attr_leaf_name_remote(leaf, i);
2893 if (name_rmt->valueblk) {
2894 lp->valueblk = be32_to_cpu(name_rmt->valueblk);
2895 lp->valuelen = XFS_B_TO_FSB(dp->i_mount,
2896 be32_to_cpu(name_rmt->valuelen));
2901 xfs_da_brelse(*trans, bp); /* unlock for trans. in freextent() */
2904 * Invalidate each of the "remote" value extents.
2907 for (lp = list, i = 0; i < count; i++, lp++) {
2908 tmp = xfs_attr_leaf_freextent(trans, dp,
2909 lp->valueblk, lp->valuelen);
2912 error = tmp; /* save only the 1st errno */
2915 kmem_free((xfs_caddr_t)list);
2920 * Look at all the extents for this logical region,
2921 * invalidate any buffers that are incore/in transactions.
2924 xfs_attr_leaf_freextent(xfs_trans_t **trans, xfs_inode_t *dp,
2925 xfs_dablk_t blkno, int blkcnt)
2927 xfs_bmbt_irec_t map;
2929 int tblkcnt, dblkcnt, nmap, error;
2934 * Roll through the "value", invalidating the attribute value's
2939 while (tblkcnt > 0) {
2941 * Try to remember where we decided to put the value.
2944 error = xfs_bmapi_read(dp, (xfs_fileoff_t)tblkno, tblkcnt,
2945 &map, &nmap, XFS_BMAPI_ATTRFORK);
2950 ASSERT(map.br_startblock != DELAYSTARTBLOCK);
2953 * If it's a hole, these are already unmapped
2954 * so there's nothing to invalidate.
2956 if (map.br_startblock != HOLESTARTBLOCK) {
2958 dblkno = XFS_FSB_TO_DADDR(dp->i_mount,
2960 dblkcnt = XFS_FSB_TO_BB(dp->i_mount,
2962 bp = xfs_trans_get_buf(*trans,
2963 dp->i_mount->m_ddev_targp,
2964 dblkno, dblkcnt, XBF_LOCK);
2967 xfs_trans_binval(*trans, bp);
2969 * Roll to next transaction.
2971 error = xfs_trans_roll(trans, dp);
2976 tblkno += map.br_blockcount;
2977 tblkcnt -= map.br_blockcount;