1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
4 * Copyright (c) 2013 Red Hat, Inc.
9 #include "xfs_shared.h"
10 #include "xfs_format.h"
11 #include "xfs_log_format.h"
12 #include "xfs_trans_resv.h"
14 #include "xfs_mount.h"
15 #include "xfs_da_format.h"
16 #include "xfs_da_btree.h"
17 #include "xfs_inode.h"
18 #include "xfs_trans.h"
19 #include "xfs_bmap_btree.h"
21 #include "xfs_attr_sf.h"
23 #include "xfs_attr_remote.h"
24 #include "xfs_attr_leaf.h"
25 #include "xfs_error.h"
26 #include "xfs_trace.h"
27 #include "xfs_buf_item.h"
31 #include "xfs_errortag.h"
37 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
40 /*========================================================================
41 * Function prototypes for the kernel.
42 *========================================================================*/
45 * Routines used for growing the Btree.
47 STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args,
48 xfs_dablk_t which_block, struct xfs_buf **bpp);
49 STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer,
50 struct xfs_attr3_icleaf_hdr *ichdr,
51 struct xfs_da_args *args, int freemap_index);
52 STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args,
53 struct xfs_attr3_icleaf_hdr *ichdr,
54 struct xfs_buf *leaf_buffer);
55 STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state,
56 xfs_da_state_blk_t *blk1,
57 xfs_da_state_blk_t *blk2);
58 STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state,
59 xfs_da_state_blk_t *leaf_blk_1,
60 struct xfs_attr3_icleaf_hdr *ichdr1,
61 xfs_da_state_blk_t *leaf_blk_2,
62 struct xfs_attr3_icleaf_hdr *ichdr2,
63 int *number_entries_in_blk1,
64 int *number_usedbytes_in_blk1);
69 STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args,
70 struct xfs_attr_leafblock *src_leaf,
71 struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start,
72 struct xfs_attr_leafblock *dst_leaf,
73 struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start,
75 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
78 * attr3 block 'firstused' conversion helpers.
80 * firstused refers to the offset of the first used byte of the nameval region
81 * of an attr leaf block. The region starts at the tail of the block and expands
82 * backwards towards the middle. As such, firstused is initialized to the block
83 * size for an empty leaf block and is reduced from there.
85 * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k.
86 * The in-core firstused field is 32-bit and thus supports the maximum fsb size.
87 * The on-disk field is only 16-bit, however, and overflows at 64k. Since this
88 * only occurs at exactly 64k, we use zero as a magic on-disk value to represent
89 * the attr block size. The following helpers manage the conversion between the
90 * in-core and on-disk formats.
94 xfs_attr3_leaf_firstused_from_disk(
95 struct xfs_da_geometry *geo,
96 struct xfs_attr3_icleaf_hdr *to,
97 struct xfs_attr_leafblock *from)
99 struct xfs_attr3_leaf_hdr *hdr3;
101 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
102 hdr3 = (struct xfs_attr3_leaf_hdr *) from;
103 to->firstused = be16_to_cpu(hdr3->firstused);
105 to->firstused = be16_to_cpu(from->hdr.firstused);
109 * Convert from the magic fsb size value to actual blocksize. This
110 * should only occur for empty blocks when the block size overflows
113 if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) {
114 ASSERT(!to->count && !to->usedbytes);
115 ASSERT(geo->blksize > USHRT_MAX);
116 to->firstused = geo->blksize;
121 xfs_attr3_leaf_firstused_to_disk(
122 struct xfs_da_geometry *geo,
123 struct xfs_attr_leafblock *to,
124 struct xfs_attr3_icleaf_hdr *from)
126 struct xfs_attr3_leaf_hdr *hdr3;
129 /* magic value should only be seen on disk */
130 ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF);
133 * Scale down the 32-bit in-core firstused value to the 16-bit on-disk
134 * value. This only overflows at the max supported value of 64k. Use the
135 * magic on-disk value to represent block size in this case.
137 firstused = from->firstused;
138 if (firstused > USHRT_MAX) {
139 ASSERT(from->firstused == geo->blksize);
140 firstused = XFS_ATTR3_LEAF_NULLOFF;
143 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
144 hdr3 = (struct xfs_attr3_leaf_hdr *) to;
145 hdr3->firstused = cpu_to_be16(firstused);
147 to->hdr.firstused = cpu_to_be16(firstused);
152 xfs_attr3_leaf_hdr_from_disk(
153 struct xfs_da_geometry *geo,
154 struct xfs_attr3_icleaf_hdr *to,
155 struct xfs_attr_leafblock *from)
159 ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) ||
160 from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC));
162 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
163 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from;
165 to->forw = be32_to_cpu(hdr3->info.hdr.forw);
166 to->back = be32_to_cpu(hdr3->info.hdr.back);
167 to->magic = be16_to_cpu(hdr3->info.hdr.magic);
168 to->count = be16_to_cpu(hdr3->count);
169 to->usedbytes = be16_to_cpu(hdr3->usedbytes);
170 xfs_attr3_leaf_firstused_from_disk(geo, to, from);
171 to->holes = hdr3->holes;
173 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
174 to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base);
175 to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size);
179 to->forw = be32_to_cpu(from->hdr.info.forw);
180 to->back = be32_to_cpu(from->hdr.info.back);
181 to->magic = be16_to_cpu(from->hdr.info.magic);
182 to->count = be16_to_cpu(from->hdr.count);
183 to->usedbytes = be16_to_cpu(from->hdr.usedbytes);
184 xfs_attr3_leaf_firstused_from_disk(geo, to, from);
185 to->holes = from->hdr.holes;
187 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
188 to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base);
189 to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size);
194 xfs_attr3_leaf_hdr_to_disk(
195 struct xfs_da_geometry *geo,
196 struct xfs_attr_leafblock *to,
197 struct xfs_attr3_icleaf_hdr *from)
201 ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC ||
202 from->magic == XFS_ATTR3_LEAF_MAGIC);
204 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
205 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to;
207 hdr3->info.hdr.forw = cpu_to_be32(from->forw);
208 hdr3->info.hdr.back = cpu_to_be32(from->back);
209 hdr3->info.hdr.magic = cpu_to_be16(from->magic);
210 hdr3->count = cpu_to_be16(from->count);
211 hdr3->usedbytes = cpu_to_be16(from->usedbytes);
212 xfs_attr3_leaf_firstused_to_disk(geo, to, from);
213 hdr3->holes = from->holes;
216 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
217 hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base);
218 hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size);
222 to->hdr.info.forw = cpu_to_be32(from->forw);
223 to->hdr.info.back = cpu_to_be32(from->back);
224 to->hdr.info.magic = cpu_to_be16(from->magic);
225 to->hdr.count = cpu_to_be16(from->count);
226 to->hdr.usedbytes = cpu_to_be16(from->usedbytes);
227 xfs_attr3_leaf_firstused_to_disk(geo, to, from);
228 to->hdr.holes = from->holes;
231 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
232 to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base);
233 to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size);
237 static xfs_failaddr_t
238 xfs_attr3_leaf_verify_entry(
239 struct xfs_mount *mp,
241 struct xfs_attr_leafblock *leaf,
242 struct xfs_attr3_icleaf_hdr *leafhdr,
243 struct xfs_attr_leaf_entry *ent,
247 struct xfs_attr_leaf_name_local *lentry;
248 struct xfs_attr_leaf_name_remote *rentry;
250 unsigned int nameidx;
251 unsigned int namesize;
254 /* hash order check */
255 hashval = be32_to_cpu(ent->hashval);
256 if (hashval < *last_hashval)
257 return __this_address;
258 *last_hashval = hashval;
260 nameidx = be16_to_cpu(ent->nameidx);
261 if (nameidx < leafhdr->firstused || nameidx >= mp->m_attr_geo->blksize)
262 return __this_address;
265 * Check the name information. The namelen fields are u8 so we can't
266 * possibly exceed the maximum name length of 255 bytes.
268 if (ent->flags & XFS_ATTR_LOCAL) {
269 lentry = xfs_attr3_leaf_name_local(leaf, idx);
270 namesize = xfs_attr_leaf_entsize_local(lentry->namelen,
271 be16_to_cpu(lentry->valuelen));
272 name_end = (char *)lentry + namesize;
273 if (lentry->namelen == 0)
274 return __this_address;
276 rentry = xfs_attr3_leaf_name_remote(leaf, idx);
277 namesize = xfs_attr_leaf_entsize_remote(rentry->namelen);
278 name_end = (char *)rentry + namesize;
279 if (rentry->namelen == 0)
280 return __this_address;
281 if (!(ent->flags & XFS_ATTR_INCOMPLETE) &&
282 rentry->valueblk == 0)
283 return __this_address;
286 if (name_end > buf_end)
287 return __this_address;
293 * Validate an attribute leaf block.
295 * Empty leaf blocks can occur under the following circumstances:
297 * 1. setxattr adds a new extended attribute to a file;
298 * 2. The file has zero existing attributes;
299 * 3. The attribute is too large to fit in the attribute fork;
300 * 4. The attribute is small enough to fit in a leaf block;
301 * 5. A log flush occurs after committing the transaction that creates
302 * the (empty) leaf block; and
303 * 6. The filesystem goes down after the log flush but before the new
304 * attribute can be committed to the leaf block.
306 * Hence we need to ensure that we don't fail the validation purely
307 * because the leaf is empty.
309 static xfs_failaddr_t
310 xfs_attr3_leaf_verify(
313 struct xfs_attr3_icleaf_hdr ichdr;
314 struct xfs_mount *mp = bp->b_mount;
315 struct xfs_attr_leafblock *leaf = bp->b_addr;
316 struct xfs_attr_leaf_entry *entries;
317 struct xfs_attr_leaf_entry *ent;
319 uint32_t end; /* must be 32bit - see below */
320 __u32 last_hashval = 0;
324 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
326 fa = xfs_da3_blkinfo_verify(bp, bp->b_addr);
331 * firstused is the block offset of the first name info structure.
332 * Make sure it doesn't go off the block or crash into the header.
334 if (ichdr.firstused > mp->m_attr_geo->blksize)
335 return __this_address;
336 if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf))
337 return __this_address;
339 /* Make sure the entries array doesn't crash into the name info. */
340 entries = xfs_attr3_leaf_entryp(bp->b_addr);
341 if ((char *)&entries[ichdr.count] >
342 (char *)bp->b_addr + ichdr.firstused)
343 return __this_address;
346 * NOTE: This verifier historically failed empty leaf buffers because
347 * we expect the fork to be in another format. Empty attr fork format
348 * conversions are possible during xattr set, however, and format
349 * conversion is not atomic with the xattr set that triggers it. We
350 * cannot assume leaf blocks are non-empty until that is addressed.
352 buf_end = (char *)bp->b_addr + mp->m_attr_geo->blksize;
353 for (i = 0, ent = entries; i < ichdr.count; ent++, i++) {
354 fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr,
355 ent, i, &last_hashval);
361 * Quickly check the freemap information. Attribute data has to be
362 * aligned to 4-byte boundaries, and likewise for the free space.
364 * Note that for 64k block size filesystems, the freemap entries cannot
365 * overflow as they are only be16 fields. However, when checking end
366 * pointer of the freemap, we have to be careful to detect overflows and
367 * so use uint32_t for those checks.
369 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
370 if (ichdr.freemap[i].base > mp->m_attr_geo->blksize)
371 return __this_address;
372 if (ichdr.freemap[i].base & 0x3)
373 return __this_address;
374 if (ichdr.freemap[i].size > mp->m_attr_geo->blksize)
375 return __this_address;
376 if (ichdr.freemap[i].size & 0x3)
377 return __this_address;
379 /* be care of 16 bit overflows here */
380 end = (uint32_t)ichdr.freemap[i].base + ichdr.freemap[i].size;
381 if (end < ichdr.freemap[i].base)
382 return __this_address;
383 if (end > mp->m_attr_geo->blksize)
384 return __this_address;
391 xfs_attr3_leaf_write_verify(
394 struct xfs_mount *mp = bp->b_mount;
395 struct xfs_buf_log_item *bip = bp->b_log_item;
396 struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr;
399 fa = xfs_attr3_leaf_verify(bp);
401 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
405 if (!xfs_has_crc(mp))
409 hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn);
411 xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF);
415 * leaf/node format detection on trees is sketchy, so a node read can be done on
416 * leaf level blocks when detection identifies the tree as a node format tree
417 * incorrectly. In this case, we need to swap the verifier to match the correct
418 * format of the block being read.
421 xfs_attr3_leaf_read_verify(
424 struct xfs_mount *mp = bp->b_mount;
427 if (xfs_has_crc(mp) &&
428 !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF))
429 xfs_verifier_error(bp, -EFSBADCRC, __this_address);
431 fa = xfs_attr3_leaf_verify(bp);
433 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
437 const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = {
438 .name = "xfs_attr3_leaf",
439 .magic16 = { cpu_to_be16(XFS_ATTR_LEAF_MAGIC),
440 cpu_to_be16(XFS_ATTR3_LEAF_MAGIC) },
441 .verify_read = xfs_attr3_leaf_read_verify,
442 .verify_write = xfs_attr3_leaf_write_verify,
443 .verify_struct = xfs_attr3_leaf_verify,
448 struct xfs_trans *tp,
449 struct xfs_inode *dp,
451 struct xfs_buf **bpp)
455 err = xfs_da_read_buf(tp, dp, bno, 0, bpp, XFS_ATTR_FORK,
456 &xfs_attr3_leaf_buf_ops);
457 if (!err && tp && *bpp)
458 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF);
462 /*========================================================================
463 * Namespace helper routines
464 *========================================================================*/
467 * If we are in log recovery, then we want the lookup to ignore the INCOMPLETE
468 * flag on disk - if there's an incomplete attr then recovery needs to tear it
469 * down. If there's no incomplete attr, then recovery needs to tear that attr
470 * down to replace it with the attr that has been logged. In this case, the
471 * INCOMPLETE flag will not be set in attr->attr_filter, but rather
472 * XFS_DA_OP_RECOVERY will be set in args->op_flags.
476 struct xfs_da_args *args,
482 if (args->namelen != namelen)
484 if (memcmp(args->name, name, namelen) != 0)
487 /* Recovery ignores the INCOMPLETE flag. */
488 if ((args->op_flags & XFS_DA_OP_RECOVERY) &&
489 args->attr_filter == (flags & XFS_ATTR_NSP_ONDISK_MASK))
492 /* All remaining matches need to be filtered by INCOMPLETE state. */
493 if (args->attr_filter !=
494 (flags & (XFS_ATTR_NSP_ONDISK_MASK | XFS_ATTR_INCOMPLETE)))
501 struct xfs_da_args *args,
502 unsigned char *value,
506 * No copy if all we have to do is get the length
508 if (!args->valuelen) {
509 args->valuelen = valuelen;
514 * No copy if the length of the existing buffer is too small
516 if (args->valuelen < valuelen) {
517 args->valuelen = valuelen;
522 args->value = kvmalloc(valuelen, GFP_KERNEL | __GFP_NOLOCKDEP);
526 args->valuelen = valuelen;
528 /* remote block xattr requires IO for copy-in */
530 return xfs_attr_rmtval_get(args);
533 * This is to prevent a GCC warning because the remote xattr case
534 * doesn't have a value to pass in. In that case, we never reach here,
535 * but GCC can't work that out and so throws a "passing NULL to
540 memcpy(args->value, value, valuelen);
544 /*========================================================================
545 * External routines when attribute fork size < XFS_LITINO(mp).
546 *========================================================================*/
549 * Query whether the total requested number of attr fork bytes of extended
550 * attribute space will be able to fit inline.
552 * Returns zero if not, else the i_forkoff fork offset to be used in the
553 * literal area for attribute data once the new bytes have been added.
555 * i_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
556 * special case for dev/uuid inodes, they have fixed size data forks.
559 xfs_attr_shortform_bytesfit(
560 struct xfs_inode *dp,
563 struct xfs_mount *mp = dp->i_mount;
570 * Check if the new size could fit at all first:
572 if (bytes > XFS_LITINO(mp))
576 offset = (XFS_LITINO(mp) - bytes) >> 3;
578 if (dp->i_df.if_format == XFS_DINODE_FMT_DEV) {
579 minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
580 return (offset >= minforkoff) ? minforkoff : 0;
584 * If the requested numbers of bytes is smaller or equal to the
585 * current attribute fork size we can always proceed.
587 * Note that if_bytes in the data fork might actually be larger than
588 * the current data fork size is due to delalloc extents. In that
589 * case either the extent count will go down when they are converted
590 * to real extents, or the delalloc conversion will take care of the
591 * literal area rebalancing.
593 if (bytes <= xfs_inode_attr_fork_size(dp))
594 return dp->i_forkoff;
597 * For attr2 we can try to move the forkoff if there is space in the
598 * literal area, but for the old format we are done if there is no
599 * space in the fixed attribute fork.
601 if (!xfs_has_attr2(mp))
604 dsize = dp->i_df.if_bytes;
606 switch (dp->i_df.if_format) {
607 case XFS_DINODE_FMT_EXTENTS:
609 * If there is no attr fork and the data fork is extents,
610 * determine if creating the default attr fork will result
611 * in the extents form migrating to btree. If so, the
612 * minimum offset only needs to be the space required for
615 if (!dp->i_forkoff && dp->i_df.if_bytes >
616 xfs_default_attroffset(dp))
617 dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
619 case XFS_DINODE_FMT_BTREE:
621 * If we have a data btree then keep forkoff if we have one,
622 * otherwise we are adding a new attr, so then we set
623 * minforkoff to where the btree root can finish so we have
624 * plenty of room for attrs
627 if (offset < dp->i_forkoff)
629 return dp->i_forkoff;
631 dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot);
636 * A data fork btree root must have space for at least
637 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
639 minforkoff = max_t(int64_t, dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
640 minforkoff = roundup(minforkoff, 8) >> 3;
642 /* attr fork btree root can have at least this many key/ptr pairs */
643 maxforkoff = XFS_LITINO(mp) - XFS_BMDR_SPACE_CALC(MINABTPTRS);
644 maxforkoff = maxforkoff >> 3; /* rounded down */
646 if (offset >= maxforkoff)
648 if (offset >= minforkoff)
654 * Switch on the ATTR2 superblock bit (implies also FEATURES2) unless:
655 * - noattr2 mount option is set,
656 * - on-disk version bit says it is already set, or
657 * - the attr2 mount option is not set to enable automatic upgrade from attr1.
660 xfs_sbversion_add_attr2(
661 struct xfs_mount *mp,
662 struct xfs_trans *tp)
664 if (xfs_has_noattr2(mp))
666 if (mp->m_sb.sb_features2 & XFS_SB_VERSION2_ATTR2BIT)
668 if (!xfs_has_attr2(mp))
671 spin_lock(&mp->m_sb_lock);
673 spin_unlock(&mp->m_sb_lock);
678 * Create the initial contents of a shortform attribute list.
681 xfs_attr_shortform_create(
682 struct xfs_da_args *args)
684 struct xfs_inode *dp = args->dp;
685 struct xfs_ifork *ifp = &dp->i_af;
686 struct xfs_attr_sf_hdr *hdr;
688 trace_xfs_attr_sf_create(args);
690 ASSERT(ifp->if_bytes == 0);
691 if (ifp->if_format == XFS_DINODE_FMT_EXTENTS)
692 ifp->if_format = XFS_DINODE_FMT_LOCAL;
693 xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
694 hdr = (struct xfs_attr_sf_hdr *)ifp->if_u1.if_data;
695 memset(hdr, 0, sizeof(*hdr));
696 hdr->totsize = cpu_to_be16(sizeof(*hdr));
697 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
701 * Return -EEXIST if attr is found, or -ENOATTR if not
702 * args: args containing attribute name and namelen
703 * sfep: If not null, pointer will be set to the last attr entry found on
704 -EEXIST. On -ENOATTR pointer is left at the last entry in the list
705 * basep: If not null, pointer is set to the byte offset of the entry in the
706 * list on -EEXIST. On -ENOATTR, pointer is left at the byte offset of
707 * the last entry in the list
710 xfs_attr_sf_findname(
711 struct xfs_da_args *args,
712 struct xfs_attr_sf_entry **sfep,
715 struct xfs_attr_shortform *sf;
716 struct xfs_attr_sf_entry *sfe;
717 unsigned int base = sizeof(struct xfs_attr_sf_hdr);
722 sf = (struct xfs_attr_shortform *)args->dp->i_af.if_u1.if_data;
725 for (i = 0; i < end; sfe = xfs_attr_sf_nextentry(sfe),
727 size = xfs_attr_sf_entsize(sfe);
728 if (!xfs_attr_match(args, sfe->namelen, sfe->nameval,
746 * Add a name/value pair to the shortform attribute list.
747 * Overflow from the inode has already been checked for.
750 xfs_attr_shortform_add(
751 struct xfs_da_args *args,
754 struct xfs_attr_shortform *sf;
755 struct xfs_attr_sf_entry *sfe;
757 struct xfs_mount *mp;
758 struct xfs_inode *dp;
759 struct xfs_ifork *ifp;
761 trace_xfs_attr_sf_add(args);
765 dp->i_forkoff = forkoff;
768 ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL);
769 sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data;
770 if (xfs_attr_sf_findname(args, &sfe, NULL) == -EEXIST)
773 offset = (char *)sfe - (char *)sf;
774 size = xfs_attr_sf_entsize_byname(args->namelen, args->valuelen);
775 xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
776 sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data;
777 sfe = (struct xfs_attr_sf_entry *)((char *)sf + offset);
779 sfe->namelen = args->namelen;
780 sfe->valuelen = args->valuelen;
781 sfe->flags = args->attr_filter;
782 memcpy(sfe->nameval, args->name, args->namelen);
783 memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
785 be16_add_cpu(&sf->hdr.totsize, size);
786 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
788 xfs_sbversion_add_attr2(mp, args->trans);
792 * After the last attribute is removed revert to original inode format,
793 * making all literal area available to the data fork once more.
796 xfs_attr_fork_remove(
797 struct xfs_inode *ip,
798 struct xfs_trans *tp)
800 ASSERT(ip->i_af.if_nextents == 0);
802 xfs_ifork_zap_attr(ip);
804 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
808 * Remove an attribute from the shortform attribute list structure.
811 xfs_attr_sf_removename(
812 struct xfs_da_args *args)
814 struct xfs_attr_shortform *sf;
815 struct xfs_attr_sf_entry *sfe;
816 int size = 0, end, totsize;
818 struct xfs_mount *mp;
819 struct xfs_inode *dp;
822 trace_xfs_attr_sf_remove(args);
826 sf = (struct xfs_attr_shortform *)dp->i_af.if_u1.if_data;
828 error = xfs_attr_sf_findname(args, &sfe, &base);
831 * If we are recovering an operation, finding nothing to
832 * remove is not an error - it just means there was nothing
835 if (error == -ENOATTR && (args->op_flags & XFS_DA_OP_RECOVERY))
837 if (error != -EEXIST)
839 size = xfs_attr_sf_entsize(sfe);
842 * Fix up the attribute fork data, covering the hole
845 totsize = be16_to_cpu(sf->hdr.totsize);
847 memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
849 be16_add_cpu(&sf->hdr.totsize, -size);
852 * Fix up the start offset of the attribute fork
855 if (totsize == sizeof(xfs_attr_sf_hdr_t) && xfs_has_attr2(mp) &&
856 (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) &&
857 !(args->op_flags & (XFS_DA_OP_ADDNAME | XFS_DA_OP_REPLACE))) {
858 xfs_attr_fork_remove(dp, args->trans);
860 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
861 dp->i_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
862 ASSERT(dp->i_forkoff);
863 ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
864 (args->op_flags & XFS_DA_OP_ADDNAME) ||
865 !xfs_has_attr2(mp) ||
866 dp->i_df.if_format == XFS_DINODE_FMT_BTREE);
867 xfs_trans_log_inode(args->trans, dp,
868 XFS_ILOG_CORE | XFS_ILOG_ADATA);
871 xfs_sbversion_add_attr2(mp, args->trans);
877 * Look up a name in a shortform attribute list structure.
881 xfs_attr_shortform_lookup(xfs_da_args_t *args)
883 struct xfs_attr_shortform *sf;
884 struct xfs_attr_sf_entry *sfe;
886 struct xfs_ifork *ifp;
888 trace_xfs_attr_sf_lookup(args);
890 ifp = &args->dp->i_af;
891 ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL);
892 sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data;
894 for (i = 0; i < sf->hdr.count;
895 sfe = xfs_attr_sf_nextentry(sfe), i++) {
896 if (xfs_attr_match(args, sfe->namelen, sfe->nameval,
904 * Retrieve the attribute value and length.
906 * If args->valuelen is zero, only the length needs to be returned. Unlike a
907 * lookup, we only return an error if the attribute does not exist or we can't
908 * retrieve the value.
911 xfs_attr_shortform_getvalue(
912 struct xfs_da_args *args)
914 struct xfs_attr_shortform *sf;
915 struct xfs_attr_sf_entry *sfe;
918 ASSERT(args->dp->i_af.if_format == XFS_DINODE_FMT_LOCAL);
919 sf = (struct xfs_attr_shortform *)args->dp->i_af.if_u1.if_data;
921 for (i = 0; i < sf->hdr.count;
922 sfe = xfs_attr_sf_nextentry(sfe), i++) {
923 if (xfs_attr_match(args, sfe->namelen, sfe->nameval,
925 return xfs_attr_copy_value(args,
926 &sfe->nameval[args->namelen], sfe->valuelen);
931 /* Convert from using the shortform to the leaf format. */
933 xfs_attr_shortform_to_leaf(
934 struct xfs_da_args *args)
936 struct xfs_inode *dp;
937 struct xfs_attr_shortform *sf;
938 struct xfs_attr_sf_entry *sfe;
939 struct xfs_da_args nargs;
944 struct xfs_ifork *ifp;
946 trace_xfs_attr_sf_to_leaf(args);
950 sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data;
951 size = be16_to_cpu(sf->hdr.totsize);
952 tmpbuffer = kmem_alloc(size, 0);
953 ASSERT(tmpbuffer != NULL);
954 memcpy(tmpbuffer, ifp->if_u1.if_data, size);
955 sf = (struct xfs_attr_shortform *)tmpbuffer;
957 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
958 xfs_bmap_local_to_extents_empty(args->trans, dp, XFS_ATTR_FORK);
961 error = xfs_da_grow_inode(args, &blkno);
966 error = xfs_attr3_leaf_create(args, blkno, &bp);
970 memset((char *)&nargs, 0, sizeof(nargs));
972 nargs.geo = args->geo;
973 nargs.total = args->total;
974 nargs.whichfork = XFS_ATTR_FORK;
975 nargs.trans = args->trans;
976 nargs.op_flags = XFS_DA_OP_OKNOENT;
979 for (i = 0; i < sf->hdr.count; i++) {
980 nargs.name = sfe->nameval;
981 nargs.namelen = sfe->namelen;
982 nargs.value = &sfe->nameval[nargs.namelen];
983 nargs.valuelen = sfe->valuelen;
984 nargs.hashval = xfs_da_hashname(sfe->nameval,
986 nargs.attr_filter = sfe->flags & XFS_ATTR_NSP_ONDISK_MASK;
987 error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */
988 ASSERT(error == -ENOATTR);
989 error = xfs_attr3_leaf_add(bp, &nargs);
990 ASSERT(error != -ENOSPC);
993 sfe = xfs_attr_sf_nextentry(sfe);
997 kmem_free(tmpbuffer);
1002 * Check a leaf attribute block to see if all the entries would fit into
1003 * a shortform attribute list.
1006 xfs_attr_shortform_allfit(
1008 struct xfs_inode *dp)
1010 struct xfs_attr_leafblock *leaf;
1011 struct xfs_attr_leaf_entry *entry;
1012 xfs_attr_leaf_name_local_t *name_loc;
1013 struct xfs_attr3_icleaf_hdr leafhdr;
1016 struct xfs_mount *mp = bp->b_mount;
1019 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf);
1020 entry = xfs_attr3_leaf_entryp(leaf);
1022 bytes = sizeof(struct xfs_attr_sf_hdr);
1023 for (i = 0; i < leafhdr.count; entry++, i++) {
1024 if (entry->flags & XFS_ATTR_INCOMPLETE)
1025 continue; /* don't copy partial entries */
1026 if (!(entry->flags & XFS_ATTR_LOCAL))
1028 name_loc = xfs_attr3_leaf_name_local(leaf, i);
1029 if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
1031 if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
1033 bytes += xfs_attr_sf_entsize_byname(name_loc->namelen,
1034 be16_to_cpu(name_loc->valuelen));
1036 if (xfs_has_attr2(dp->i_mount) &&
1037 (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) &&
1038 (bytes == sizeof(struct xfs_attr_sf_hdr)))
1040 return xfs_attr_shortform_bytesfit(dp, bytes);
1043 /* Verify the consistency of an inline attribute fork. */
1045 xfs_attr_shortform_verify(
1046 struct xfs_inode *ip)
1048 struct xfs_attr_shortform *sfp;
1049 struct xfs_attr_sf_entry *sfep;
1050 struct xfs_attr_sf_entry *next_sfep;
1052 struct xfs_ifork *ifp;
1056 ASSERT(ip->i_af.if_format == XFS_DINODE_FMT_LOCAL);
1057 ifp = xfs_ifork_ptr(ip, XFS_ATTR_FORK);
1058 sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data;
1059 size = ifp->if_bytes;
1062 * Give up if the attribute is way too short.
1064 if (size < sizeof(struct xfs_attr_sf_hdr))
1065 return __this_address;
1067 endp = (char *)sfp + size;
1069 /* Check all reported entries */
1070 sfep = &sfp->list[0];
1071 for (i = 0; i < sfp->hdr.count; i++) {
1073 * struct xfs_attr_sf_entry has a variable length.
1074 * Check the fixed-offset parts of the structure are
1075 * within the data buffer.
1076 * xfs_attr_sf_entry is defined with a 1-byte variable
1077 * array at the end, so we must subtract that off.
1079 if (((char *)sfep + sizeof(*sfep)) >= endp)
1080 return __this_address;
1082 /* Don't allow names with known bad length. */
1083 if (sfep->namelen == 0)
1084 return __this_address;
1087 * Check that the variable-length part of the structure is
1088 * within the data buffer. The next entry starts after the
1089 * name component, so nextentry is an acceptable test.
1091 next_sfep = xfs_attr_sf_nextentry(sfep);
1092 if ((char *)next_sfep > endp)
1093 return __this_address;
1096 * Check for unknown flags. Short form doesn't support
1097 * the incomplete or local bits, so we can use the namespace
1100 if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK)
1101 return __this_address;
1104 * Check for invalid namespace combinations. We only allow
1105 * one namespace flag per xattr, so we can just count the
1106 * bits (i.e. hweight) here.
1108 if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1)
1109 return __this_address;
1113 if ((void *)sfep != (void *)endp)
1114 return __this_address;
1120 * Convert a leaf attribute list to shortform attribute list
1123 xfs_attr3_leaf_to_shortform(
1125 struct xfs_da_args *args,
1128 struct xfs_attr_leafblock *leaf;
1129 struct xfs_attr3_icleaf_hdr ichdr;
1130 struct xfs_attr_leaf_entry *entry;
1131 struct xfs_attr_leaf_name_local *name_loc;
1132 struct xfs_da_args nargs;
1133 struct xfs_inode *dp = args->dp;
1138 trace_xfs_attr_leaf_to_sf(args);
1140 tmpbuffer = kmem_alloc(args->geo->blksize, 0);
1144 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
1146 leaf = (xfs_attr_leafblock_t *)tmpbuffer;
1147 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
1148 entry = xfs_attr3_leaf_entryp(leaf);
1150 /* XXX (dgc): buffer is about to be marked stale - why zero it? */
1151 memset(bp->b_addr, 0, args->geo->blksize);
1154 * Clean out the prior contents of the attribute list.
1156 error = xfs_da_shrink_inode(args, 0, bp);
1160 if (forkoff == -1) {
1162 * Don't remove the attr fork if this operation is the first
1163 * part of a attr replace operations. We're going to add a new
1164 * attr immediately, so we need to keep the attr fork around in
1167 if (!(args->op_flags & XFS_DA_OP_REPLACE)) {
1168 ASSERT(xfs_has_attr2(dp->i_mount));
1169 ASSERT(dp->i_df.if_format != XFS_DINODE_FMT_BTREE);
1170 xfs_attr_fork_remove(dp, args->trans);
1175 xfs_attr_shortform_create(args);
1178 * Copy the attributes
1180 memset((char *)&nargs, 0, sizeof(nargs));
1181 nargs.geo = args->geo;
1183 nargs.total = args->total;
1184 nargs.whichfork = XFS_ATTR_FORK;
1185 nargs.trans = args->trans;
1186 nargs.op_flags = XFS_DA_OP_OKNOENT;
1188 for (i = 0; i < ichdr.count; entry++, i++) {
1189 if (entry->flags & XFS_ATTR_INCOMPLETE)
1190 continue; /* don't copy partial entries */
1191 if (!entry->nameidx)
1193 ASSERT(entry->flags & XFS_ATTR_LOCAL);
1194 name_loc = xfs_attr3_leaf_name_local(leaf, i);
1195 nargs.name = name_loc->nameval;
1196 nargs.namelen = name_loc->namelen;
1197 nargs.value = &name_loc->nameval[nargs.namelen];
1198 nargs.valuelen = be16_to_cpu(name_loc->valuelen);
1199 nargs.hashval = be32_to_cpu(entry->hashval);
1200 nargs.attr_filter = entry->flags & XFS_ATTR_NSP_ONDISK_MASK;
1201 xfs_attr_shortform_add(&nargs, forkoff);
1206 kmem_free(tmpbuffer);
1211 * Convert from using a single leaf to a root node and a leaf.
1214 xfs_attr3_leaf_to_node(
1215 struct xfs_da_args *args)
1217 struct xfs_attr_leafblock *leaf;
1218 struct xfs_attr3_icleaf_hdr icleafhdr;
1219 struct xfs_attr_leaf_entry *entries;
1220 struct xfs_da3_icnode_hdr icnodehdr;
1221 struct xfs_da_intnode *node;
1222 struct xfs_inode *dp = args->dp;
1223 struct xfs_mount *mp = dp->i_mount;
1224 struct xfs_buf *bp1 = NULL;
1225 struct xfs_buf *bp2 = NULL;
1229 trace_xfs_attr_leaf_to_node(args);
1231 if (XFS_TEST_ERROR(false, mp, XFS_ERRTAG_ATTR_LEAF_TO_NODE)) {
1236 error = xfs_da_grow_inode(args, &blkno);
1239 error = xfs_attr3_leaf_read(args->trans, dp, 0, &bp1);
1243 error = xfs_da_get_buf(args->trans, dp, blkno, &bp2, XFS_ATTR_FORK);
1247 /* copy leaf to new buffer, update identifiers */
1248 xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF);
1249 bp2->b_ops = bp1->b_ops;
1250 memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize);
1251 if (xfs_has_crc(mp)) {
1252 struct xfs_da3_blkinfo *hdr3 = bp2->b_addr;
1253 hdr3->blkno = cpu_to_be64(xfs_buf_daddr(bp2));
1255 xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1);
1258 * Set up the new root node.
1260 error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
1264 xfs_da3_node_hdr_from_disk(mp, &icnodehdr, node);
1267 xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf);
1268 entries = xfs_attr3_leaf_entryp(leaf);
1270 /* both on-disk, don't endian-flip twice */
1271 icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval;
1272 icnodehdr.btree[0].before = cpu_to_be32(blkno);
1273 icnodehdr.count = 1;
1274 xfs_da3_node_hdr_to_disk(dp->i_mount, node, &icnodehdr);
1275 xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1);
1281 /*========================================================================
1282 * Routines used for growing the Btree.
1283 *========================================================================*/
1286 * Create the initial contents of a leaf attribute list
1287 * or a leaf in a node attribute list.
1290 xfs_attr3_leaf_create(
1291 struct xfs_da_args *args,
1293 struct xfs_buf **bpp)
1295 struct xfs_attr_leafblock *leaf;
1296 struct xfs_attr3_icleaf_hdr ichdr;
1297 struct xfs_inode *dp = args->dp;
1298 struct xfs_mount *mp = dp->i_mount;
1302 trace_xfs_attr_leaf_create(args);
1304 error = xfs_da_get_buf(args->trans, args->dp, blkno, &bp,
1308 bp->b_ops = &xfs_attr3_leaf_buf_ops;
1309 xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF);
1311 memset(leaf, 0, args->geo->blksize);
1313 memset(&ichdr, 0, sizeof(ichdr));
1314 ichdr.firstused = args->geo->blksize;
1316 if (xfs_has_crc(mp)) {
1317 struct xfs_da3_blkinfo *hdr3 = bp->b_addr;
1319 ichdr.magic = XFS_ATTR3_LEAF_MAGIC;
1321 hdr3->blkno = cpu_to_be64(xfs_buf_daddr(bp));
1322 hdr3->owner = cpu_to_be64(dp->i_ino);
1323 uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid);
1325 ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr);
1327 ichdr.magic = XFS_ATTR_LEAF_MAGIC;
1328 ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr);
1330 ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base;
1332 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
1333 xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1);
1340 * Split the leaf node, rebalance, then add the new entry.
1343 xfs_attr3_leaf_split(
1344 struct xfs_da_state *state,
1345 struct xfs_da_state_blk *oldblk,
1346 struct xfs_da_state_blk *newblk)
1351 trace_xfs_attr_leaf_split(state->args);
1354 * Allocate space for a new leaf node.
1356 ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
1357 error = xfs_da_grow_inode(state->args, &blkno);
1360 error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp);
1363 newblk->blkno = blkno;
1364 newblk->magic = XFS_ATTR_LEAF_MAGIC;
1367 * Rebalance the entries across the two leaves.
1368 * NOTE: rebalance() currently depends on the 2nd block being empty.
1370 xfs_attr3_leaf_rebalance(state, oldblk, newblk);
1371 error = xfs_da3_blk_link(state, oldblk, newblk);
1376 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
1377 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1378 * "new" attrs info. Will need the "old" info to remove it later.
1380 * Insert the "new" entry in the correct block.
1382 if (state->inleaf) {
1383 trace_xfs_attr_leaf_add_old(state->args);
1384 error = xfs_attr3_leaf_add(oldblk->bp, state->args);
1386 trace_xfs_attr_leaf_add_new(state->args);
1387 error = xfs_attr3_leaf_add(newblk->bp, state->args);
1391 * Update last hashval in each block since we added the name.
1393 oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
1394 newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
1399 * Add a name to the leaf attribute list structure.
1404 struct xfs_da_args *args)
1406 struct xfs_attr_leafblock *leaf;
1407 struct xfs_attr3_icleaf_hdr ichdr;
1414 trace_xfs_attr_leaf_add(args);
1417 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
1418 ASSERT(args->index >= 0 && args->index <= ichdr.count);
1419 entsize = xfs_attr_leaf_newentsize(args, NULL);
1422 * Search through freemap for first-fit on new name length.
1423 * (may need to figure in size of entry struct too)
1425 tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t)
1426 + xfs_attr3_leaf_hdr_size(leaf);
1427 for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) {
1428 if (tablesize > ichdr.firstused) {
1429 sum += ichdr.freemap[i].size;
1432 if (!ichdr.freemap[i].size)
1433 continue; /* no space in this map */
1435 if (ichdr.freemap[i].base < ichdr.firstused)
1436 tmp += sizeof(xfs_attr_leaf_entry_t);
1437 if (ichdr.freemap[i].size >= tmp) {
1438 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i);
1441 sum += ichdr.freemap[i].size;
1445 * If there are no holes in the address space of the block,
1446 * and we don't have enough freespace, then compaction will do us
1447 * no good and we should just give up.
1449 if (!ichdr.holes && sum < entsize)
1453 * Compact the entries to coalesce free space.
1454 * This may change the hdr->count via dropping INCOMPLETE entries.
1456 xfs_attr3_leaf_compact(args, &ichdr, bp);
1459 * After compaction, the block is guaranteed to have only one
1460 * free region, in freemap[0]. If it is not big enough, give up.
1462 if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) {
1467 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0);
1470 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
1471 xfs_trans_log_buf(args->trans, bp,
1472 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1473 xfs_attr3_leaf_hdr_size(leaf)));
1478 * Add a name to a leaf attribute list structure.
1481 xfs_attr3_leaf_add_work(
1483 struct xfs_attr3_icleaf_hdr *ichdr,
1484 struct xfs_da_args *args,
1487 struct xfs_attr_leafblock *leaf;
1488 struct xfs_attr_leaf_entry *entry;
1489 struct xfs_attr_leaf_name_local *name_loc;
1490 struct xfs_attr_leaf_name_remote *name_rmt;
1491 struct xfs_mount *mp;
1495 trace_xfs_attr_leaf_add_work(args);
1498 ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE);
1499 ASSERT(args->index >= 0 && args->index <= ichdr->count);
1502 * Force open some space in the entry array and fill it in.
1504 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1505 if (args->index < ichdr->count) {
1506 tmp = ichdr->count - args->index;
1507 tmp *= sizeof(xfs_attr_leaf_entry_t);
1508 memmove(entry + 1, entry, tmp);
1509 xfs_trans_log_buf(args->trans, bp,
1510 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1515 * Allocate space for the new string (at the end of the run).
1517 mp = args->trans->t_mountp;
1518 ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize);
1519 ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0);
1520 ASSERT(ichdr->freemap[mapindex].size >=
1521 xfs_attr_leaf_newentsize(args, NULL));
1522 ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize);
1523 ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0);
1525 ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp);
1527 entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base +
1528 ichdr->freemap[mapindex].size);
1529 entry->hashval = cpu_to_be32(args->hashval);
1530 entry->flags = args->attr_filter;
1532 entry->flags |= XFS_ATTR_LOCAL;
1533 if (args->op_flags & XFS_DA_OP_REPLACE) {
1534 if (!(args->op_flags & XFS_DA_OP_LOGGED))
1535 entry->flags |= XFS_ATTR_INCOMPLETE;
1536 if ((args->blkno2 == args->blkno) &&
1537 (args->index2 <= args->index)) {
1541 xfs_trans_log_buf(args->trans, bp,
1542 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
1543 ASSERT((args->index == 0) ||
1544 (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
1545 ASSERT((args->index == ichdr->count - 1) ||
1546 (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
1549 * For "remote" attribute values, simply note that we need to
1550 * allocate space for the "remote" value. We can't actually
1551 * allocate the extents in this transaction, and we can't decide
1552 * which blocks they should be as we might allocate more blocks
1553 * as part of this transaction (a split operation for example).
1555 if (entry->flags & XFS_ATTR_LOCAL) {
1556 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
1557 name_loc->namelen = args->namelen;
1558 name_loc->valuelen = cpu_to_be16(args->valuelen);
1559 memcpy((char *)name_loc->nameval, args->name, args->namelen);
1560 memcpy((char *)&name_loc->nameval[args->namelen], args->value,
1561 be16_to_cpu(name_loc->valuelen));
1563 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
1564 name_rmt->namelen = args->namelen;
1565 memcpy((char *)name_rmt->name, args->name, args->namelen);
1566 entry->flags |= XFS_ATTR_INCOMPLETE;
1568 name_rmt->valuelen = 0;
1569 name_rmt->valueblk = 0;
1571 args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen);
1572 args->rmtvaluelen = args->valuelen;
1574 xfs_trans_log_buf(args->trans, bp,
1575 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
1576 xfs_attr_leaf_entsize(leaf, args->index)));
1579 * Update the control info for this leaf node
1581 if (be16_to_cpu(entry->nameidx) < ichdr->firstused)
1582 ichdr->firstused = be16_to_cpu(entry->nameidx);
1584 ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t)
1585 + xfs_attr3_leaf_hdr_size(leaf));
1586 tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t)
1587 + xfs_attr3_leaf_hdr_size(leaf);
1589 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
1590 if (ichdr->freemap[i].base == tmp) {
1591 ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t);
1592 ichdr->freemap[i].size -=
1593 min_t(uint16_t, ichdr->freemap[i].size,
1594 sizeof(xfs_attr_leaf_entry_t));
1597 ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index);
1602 * Garbage collect a leaf attribute list block by copying it to a new buffer.
1605 xfs_attr3_leaf_compact(
1606 struct xfs_da_args *args,
1607 struct xfs_attr3_icleaf_hdr *ichdr_dst,
1610 struct xfs_attr_leafblock *leaf_src;
1611 struct xfs_attr_leafblock *leaf_dst;
1612 struct xfs_attr3_icleaf_hdr ichdr_src;
1613 struct xfs_trans *trans = args->trans;
1616 trace_xfs_attr_leaf_compact(args);
1618 tmpbuffer = kmem_alloc(args->geo->blksize, 0);
1619 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
1620 memset(bp->b_addr, 0, args->geo->blksize);
1621 leaf_src = (xfs_attr_leafblock_t *)tmpbuffer;
1622 leaf_dst = bp->b_addr;
1625 * Copy the on-disk header back into the destination buffer to ensure
1626 * all the information in the header that is not part of the incore
1627 * header structure is preserved.
1629 memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src));
1631 /* Initialise the incore headers */
1632 ichdr_src = *ichdr_dst; /* struct copy */
1633 ichdr_dst->firstused = args->geo->blksize;
1634 ichdr_dst->usedbytes = 0;
1635 ichdr_dst->count = 0;
1636 ichdr_dst->holes = 0;
1637 ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src);
1638 ichdr_dst->freemap[0].size = ichdr_dst->firstused -
1639 ichdr_dst->freemap[0].base;
1641 /* write the header back to initialise the underlying buffer */
1642 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst);
1645 * Copy all entry's in the same (sorted) order,
1646 * but allocate name/value pairs packed and in sequence.
1648 xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0,
1649 leaf_dst, ichdr_dst, 0, ichdr_src.count);
1651 * this logs the entire buffer, but the caller must write the header
1652 * back to the buffer when it is finished modifying it.
1654 xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1);
1656 kmem_free(tmpbuffer);
1660 * Compare two leaf blocks "order".
1661 * Return 0 unless leaf2 should go before leaf1.
1664 xfs_attr3_leaf_order(
1665 struct xfs_buf *leaf1_bp,
1666 struct xfs_attr3_icleaf_hdr *leaf1hdr,
1667 struct xfs_buf *leaf2_bp,
1668 struct xfs_attr3_icleaf_hdr *leaf2hdr)
1670 struct xfs_attr_leaf_entry *entries1;
1671 struct xfs_attr_leaf_entry *entries2;
1673 entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr);
1674 entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr);
1675 if (leaf1hdr->count > 0 && leaf2hdr->count > 0 &&
1676 ((be32_to_cpu(entries2[0].hashval) <
1677 be32_to_cpu(entries1[0].hashval)) ||
1678 (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) <
1679 be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) {
1686 xfs_attr_leaf_order(
1687 struct xfs_buf *leaf1_bp,
1688 struct xfs_buf *leaf2_bp)
1690 struct xfs_attr3_icleaf_hdr ichdr1;
1691 struct xfs_attr3_icleaf_hdr ichdr2;
1692 struct xfs_mount *mp = leaf1_bp->b_mount;
1694 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr);
1695 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr);
1696 return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2);
1700 * Redistribute the attribute list entries between two leaf nodes,
1701 * taking into account the size of the new entry.
1703 * NOTE: if new block is empty, then it will get the upper half of the
1704 * old block. At present, all (one) callers pass in an empty second block.
1706 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1707 * to match what it is doing in splitting the attribute leaf block. Those
1708 * values are used in "atomic rename" operations on attributes. Note that
1709 * the "new" and "old" values can end up in different blocks.
1712 xfs_attr3_leaf_rebalance(
1713 struct xfs_da_state *state,
1714 struct xfs_da_state_blk *blk1,
1715 struct xfs_da_state_blk *blk2)
1717 struct xfs_da_args *args;
1718 struct xfs_attr_leafblock *leaf1;
1719 struct xfs_attr_leafblock *leaf2;
1720 struct xfs_attr3_icleaf_hdr ichdr1;
1721 struct xfs_attr3_icleaf_hdr ichdr2;
1722 struct xfs_attr_leaf_entry *entries1;
1723 struct xfs_attr_leaf_entry *entries2;
1731 * Set up environment.
1733 ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
1734 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
1735 leaf1 = blk1->bp->b_addr;
1736 leaf2 = blk2->bp->b_addr;
1737 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1);
1738 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2);
1739 ASSERT(ichdr2.count == 0);
1742 trace_xfs_attr_leaf_rebalance(args);
1745 * Check ordering of blocks, reverse if it makes things simpler.
1747 * NOTE: Given that all (current) callers pass in an empty
1748 * second block, this code should never set "swap".
1751 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) {
1754 /* swap structures rather than reconverting them */
1755 swap(ichdr1, ichdr2);
1757 leaf1 = blk1->bp->b_addr;
1758 leaf2 = blk2->bp->b_addr;
1763 * Examine entries until we reduce the absolute difference in
1764 * byte usage between the two blocks to a minimum. Then get
1765 * the direction to copy and the number of elements to move.
1767 * "inleaf" is true if the new entry should be inserted into blk1.
1768 * If "swap" is also true, then reverse the sense of "inleaf".
1770 state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1,
1774 state->inleaf = !state->inleaf;
1777 * Move any entries required from leaf to leaf:
1779 if (count < ichdr1.count) {
1781 * Figure the total bytes to be added to the destination leaf.
1783 /* number entries being moved */
1784 count = ichdr1.count - count;
1785 space = ichdr1.usedbytes - totallen;
1786 space += count * sizeof(xfs_attr_leaf_entry_t);
1789 * leaf2 is the destination, compact it if it looks tight.
1791 max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1792 max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t);
1794 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp);
1797 * Move high entries from leaf1 to low end of leaf2.
1799 xfs_attr3_leaf_moveents(args, leaf1, &ichdr1,
1800 ichdr1.count - count, leaf2, &ichdr2, 0, count);
1802 } else if (count > ichdr1.count) {
1804 * I assert that since all callers pass in an empty
1805 * second buffer, this code should never execute.
1810 * Figure the total bytes to be added to the destination leaf.
1812 /* number entries being moved */
1813 count -= ichdr1.count;
1814 space = totallen - ichdr1.usedbytes;
1815 space += count * sizeof(xfs_attr_leaf_entry_t);
1818 * leaf1 is the destination, compact it if it looks tight.
1820 max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1821 max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t);
1823 xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp);
1826 * Move low entries from leaf2 to high end of leaf1.
1828 xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1,
1829 ichdr1.count, count);
1832 xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1);
1833 xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2);
1834 xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1);
1835 xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1);
1838 * Copy out last hashval in each block for B-tree code.
1840 entries1 = xfs_attr3_leaf_entryp(leaf1);
1841 entries2 = xfs_attr3_leaf_entryp(leaf2);
1842 blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval);
1843 blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval);
1846 * Adjust the expected index for insertion.
1847 * NOTE: this code depends on the (current) situation that the
1848 * second block was originally empty.
1850 * If the insertion point moved to the 2nd block, we must adjust
1851 * the index. We must also track the entry just following the
1852 * new entry for use in an "atomic rename" operation, that entry
1853 * is always the "old" entry and the "new" entry is what we are
1854 * inserting. The index/blkno fields refer to the "old" entry,
1855 * while the index2/blkno2 fields refer to the "new" entry.
1857 if (blk1->index > ichdr1.count) {
1858 ASSERT(state->inleaf == 0);
1859 blk2->index = blk1->index - ichdr1.count;
1860 args->index = args->index2 = blk2->index;
1861 args->blkno = args->blkno2 = blk2->blkno;
1862 } else if (blk1->index == ichdr1.count) {
1863 if (state->inleaf) {
1864 args->index = blk1->index;
1865 args->blkno = blk1->blkno;
1867 args->blkno2 = blk2->blkno;
1870 * On a double leaf split, the original attr location
1871 * is already stored in blkno2/index2, so don't
1872 * overwrite it overwise we corrupt the tree.
1874 blk2->index = blk1->index - ichdr1.count;
1875 args->index = blk2->index;
1876 args->blkno = blk2->blkno;
1877 if (!state->extravalid) {
1879 * set the new attr location to match the old
1880 * one and let the higher level split code
1881 * decide where in the leaf to place it.
1883 args->index2 = blk2->index;
1884 args->blkno2 = blk2->blkno;
1888 ASSERT(state->inleaf == 1);
1889 args->index = args->index2 = blk1->index;
1890 args->blkno = args->blkno2 = blk1->blkno;
1895 * Examine entries until we reduce the absolute difference in
1896 * byte usage between the two blocks to a minimum.
1897 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1898 * GROT: there will always be enough room in either block for a new entry.
1899 * GROT: Do a double-split for this case?
1902 xfs_attr3_leaf_figure_balance(
1903 struct xfs_da_state *state,
1904 struct xfs_da_state_blk *blk1,
1905 struct xfs_attr3_icleaf_hdr *ichdr1,
1906 struct xfs_da_state_blk *blk2,
1907 struct xfs_attr3_icleaf_hdr *ichdr2,
1911 struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr;
1912 struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr;
1913 struct xfs_attr_leaf_entry *entry;
1924 * Examine entries until we reduce the absolute difference in
1925 * byte usage between the two blocks to a minimum.
1927 max = ichdr1->count + ichdr2->count;
1928 half = (max + 1) * sizeof(*entry);
1929 half += ichdr1->usedbytes + ichdr2->usedbytes +
1930 xfs_attr_leaf_newentsize(state->args, NULL);
1932 lastdelta = state->args->geo->blksize;
1933 entry = xfs_attr3_leaf_entryp(leaf1);
1934 for (count = index = 0; count < max; entry++, index++, count++) {
1936 #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1938 * The new entry is in the first block, account for it.
1940 if (count == blk1->index) {
1941 tmp = totallen + sizeof(*entry) +
1942 xfs_attr_leaf_newentsize(state->args, NULL);
1943 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1945 lastdelta = XFS_ATTR_ABS(half - tmp);
1951 * Wrap around into the second block if necessary.
1953 if (count == ichdr1->count) {
1955 entry = xfs_attr3_leaf_entryp(leaf1);
1960 * Figure out if next leaf entry would be too much.
1962 tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
1964 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1966 lastdelta = XFS_ATTR_ABS(half - tmp);
1972 * Calculate the number of usedbytes that will end up in lower block.
1973 * If new entry not in lower block, fix up the count.
1975 totallen -= count * sizeof(*entry);
1977 totallen -= sizeof(*entry) +
1978 xfs_attr_leaf_newentsize(state->args, NULL);
1982 *usedbytesarg = totallen;
1986 /*========================================================================
1987 * Routines used for shrinking the Btree.
1988 *========================================================================*/
1991 * Check a leaf block and its neighbors to see if the block should be
1992 * collapsed into one or the other neighbor. Always keep the block
1993 * with the smaller block number.
1994 * If the current block is over 50% full, don't try to join it, return 0.
1995 * If the block is empty, fill in the state structure and return 2.
1996 * If it can be collapsed, fill in the state structure and return 1.
1997 * If nothing can be done, return 0.
1999 * GROT: allow for INCOMPLETE entries in calculation.
2002 xfs_attr3_leaf_toosmall(
2003 struct xfs_da_state *state,
2006 struct xfs_attr_leafblock *leaf;
2007 struct xfs_da_state_blk *blk;
2008 struct xfs_attr3_icleaf_hdr ichdr;
2017 trace_xfs_attr_leaf_toosmall(state->args);
2020 * Check for the degenerate case of the block being over 50% full.
2021 * If so, it's not worth even looking to see if we might be able
2022 * to coalesce with a sibling.
2024 blk = &state->path.blk[ state->path.active-1 ];
2025 leaf = blk->bp->b_addr;
2026 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf);
2027 bytes = xfs_attr3_leaf_hdr_size(leaf) +
2028 ichdr.count * sizeof(xfs_attr_leaf_entry_t) +
2030 if (bytes > (state->args->geo->blksize >> 1)) {
2031 *action = 0; /* blk over 50%, don't try to join */
2036 * Check for the degenerate case of the block being empty.
2037 * If the block is empty, we'll simply delete it, no need to
2038 * coalesce it with a sibling block. We choose (arbitrarily)
2039 * to merge with the forward block unless it is NULL.
2041 if (ichdr.count == 0) {
2043 * Make altpath point to the block we want to keep and
2044 * path point to the block we want to drop (this one).
2046 forward = (ichdr.forw != 0);
2047 memcpy(&state->altpath, &state->path, sizeof(state->path));
2048 error = xfs_da3_path_shift(state, &state->altpath, forward,
2061 * Examine each sibling block to see if we can coalesce with
2062 * at least 25% free space to spare. We need to figure out
2063 * whether to merge with the forward or the backward block.
2064 * We prefer coalescing with the lower numbered sibling so as
2065 * to shrink an attribute list over time.
2067 /* start with smaller blk num */
2068 forward = ichdr.forw < ichdr.back;
2069 for (i = 0; i < 2; forward = !forward, i++) {
2070 struct xfs_attr3_icleaf_hdr ichdr2;
2077 error = xfs_attr3_leaf_read(state->args->trans, state->args->dp,
2082 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr);
2084 bytes = state->args->geo->blksize -
2085 (state->args->geo->blksize >> 2) -
2086 ichdr.usedbytes - ichdr2.usedbytes -
2087 ((ichdr.count + ichdr2.count) *
2088 sizeof(xfs_attr_leaf_entry_t)) -
2089 xfs_attr3_leaf_hdr_size(leaf);
2091 xfs_trans_brelse(state->args->trans, bp);
2093 break; /* fits with at least 25% to spare */
2101 * Make altpath point to the block we want to keep (the lower
2102 * numbered block) and path point to the block we want to drop.
2104 memcpy(&state->altpath, &state->path, sizeof(state->path));
2105 if (blkno < blk->blkno) {
2106 error = xfs_da3_path_shift(state, &state->altpath, forward,
2109 error = xfs_da3_path_shift(state, &state->path, forward,
2123 * Remove a name from the leaf attribute list structure.
2125 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
2126 * If two leaves are 37% full, when combined they will leave 25% free.
2129 xfs_attr3_leaf_remove(
2131 struct xfs_da_args *args)
2133 struct xfs_attr_leafblock *leaf;
2134 struct xfs_attr3_icleaf_hdr ichdr;
2135 struct xfs_attr_leaf_entry *entry;
2144 trace_xfs_attr_leaf_remove(args);
2147 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2149 ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8);
2150 ASSERT(args->index >= 0 && args->index < ichdr.count);
2151 ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) +
2152 xfs_attr3_leaf_hdr_size(leaf));
2154 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2156 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
2157 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
2160 * Scan through free region table:
2161 * check for adjacency of free'd entry with an existing one,
2162 * find smallest free region in case we need to replace it,
2163 * adjust any map that borders the entry table,
2165 tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t)
2166 + xfs_attr3_leaf_hdr_size(leaf);
2167 tmp = ichdr.freemap[0].size;
2168 before = after = -1;
2169 smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
2170 entsize = xfs_attr_leaf_entsize(leaf, args->index);
2171 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
2172 ASSERT(ichdr.freemap[i].base < args->geo->blksize);
2173 ASSERT(ichdr.freemap[i].size < args->geo->blksize);
2174 if (ichdr.freemap[i].base == tablesize) {
2175 ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t);
2176 ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t);
2179 if (ichdr.freemap[i].base + ichdr.freemap[i].size ==
2180 be16_to_cpu(entry->nameidx)) {
2182 } else if (ichdr.freemap[i].base ==
2183 (be16_to_cpu(entry->nameidx) + entsize)) {
2185 } else if (ichdr.freemap[i].size < tmp) {
2186 tmp = ichdr.freemap[i].size;
2192 * Coalesce adjacent freemap regions,
2193 * or replace the smallest region.
2195 if ((before >= 0) || (after >= 0)) {
2196 if ((before >= 0) && (after >= 0)) {
2197 ichdr.freemap[before].size += entsize;
2198 ichdr.freemap[before].size += ichdr.freemap[after].size;
2199 ichdr.freemap[after].base = 0;
2200 ichdr.freemap[after].size = 0;
2201 } else if (before >= 0) {
2202 ichdr.freemap[before].size += entsize;
2204 ichdr.freemap[after].base = be16_to_cpu(entry->nameidx);
2205 ichdr.freemap[after].size += entsize;
2209 * Replace smallest region (if it is smaller than free'd entry)
2211 if (ichdr.freemap[smallest].size < entsize) {
2212 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx);
2213 ichdr.freemap[smallest].size = entsize;
2218 * Did we remove the first entry?
2220 if (be16_to_cpu(entry->nameidx) == ichdr.firstused)
2226 * Compress the remaining entries and zero out the removed stuff.
2228 memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize);
2229 ichdr.usedbytes -= entsize;
2230 xfs_trans_log_buf(args->trans, bp,
2231 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
2234 tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t);
2235 memmove(entry, entry + 1, tmp);
2237 xfs_trans_log_buf(args->trans, bp,
2238 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t)));
2240 entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count];
2241 memset(entry, 0, sizeof(xfs_attr_leaf_entry_t));
2244 * If we removed the first entry, re-find the first used byte
2245 * in the name area. Note that if the entry was the "firstused",
2246 * then we don't have a "hole" in our block resulting from
2247 * removing the name.
2250 tmp = args->geo->blksize;
2251 entry = xfs_attr3_leaf_entryp(leaf);
2252 for (i = ichdr.count - 1; i >= 0; entry++, i--) {
2253 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
2254 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
2256 if (be16_to_cpu(entry->nameidx) < tmp)
2257 tmp = be16_to_cpu(entry->nameidx);
2259 ichdr.firstused = tmp;
2260 ASSERT(ichdr.firstused != 0);
2262 ichdr.holes = 1; /* mark as needing compaction */
2264 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
2265 xfs_trans_log_buf(args->trans, bp,
2266 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
2267 xfs_attr3_leaf_hdr_size(leaf)));
2270 * Check if leaf is less than 50% full, caller may want to
2271 * "join" the leaf with a sibling if so.
2273 tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) +
2274 ichdr.count * sizeof(xfs_attr_leaf_entry_t);
2276 return tmp < args->geo->magicpct; /* leaf is < 37% full */
2280 * Move all the attribute list entries from drop_leaf into save_leaf.
2283 xfs_attr3_leaf_unbalance(
2284 struct xfs_da_state *state,
2285 struct xfs_da_state_blk *drop_blk,
2286 struct xfs_da_state_blk *save_blk)
2288 struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr;
2289 struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr;
2290 struct xfs_attr3_icleaf_hdr drophdr;
2291 struct xfs_attr3_icleaf_hdr savehdr;
2292 struct xfs_attr_leaf_entry *entry;
2294 trace_xfs_attr_leaf_unbalance(state->args);
2296 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf);
2297 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf);
2298 entry = xfs_attr3_leaf_entryp(drop_leaf);
2301 * Save last hashval from dying block for later Btree fixup.
2303 drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval);
2306 * Check if we need a temp buffer, or can we do it in place.
2307 * Note that we don't check "leaf" for holes because we will
2308 * always be dropping it, toosmall() decided that for us already.
2310 if (savehdr.holes == 0) {
2312 * dest leaf has no holes, so we add there. May need
2313 * to make some room in the entry array.
2315 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2316 drop_blk->bp, &drophdr)) {
2317 xfs_attr3_leaf_moveents(state->args,
2318 drop_leaf, &drophdr, 0,
2319 save_leaf, &savehdr, 0,
2322 xfs_attr3_leaf_moveents(state->args,
2323 drop_leaf, &drophdr, 0,
2324 save_leaf, &savehdr,
2325 savehdr.count, drophdr.count);
2329 * Destination has holes, so we make a temporary copy
2330 * of the leaf and add them both to that.
2332 struct xfs_attr_leafblock *tmp_leaf;
2333 struct xfs_attr3_icleaf_hdr tmphdr;
2335 tmp_leaf = kmem_zalloc(state->args->geo->blksize, 0);
2338 * Copy the header into the temp leaf so that all the stuff
2339 * not in the incore header is present and gets copied back in
2340 * once we've moved all the entries.
2342 memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf));
2344 memset(&tmphdr, 0, sizeof(tmphdr));
2345 tmphdr.magic = savehdr.magic;
2346 tmphdr.forw = savehdr.forw;
2347 tmphdr.back = savehdr.back;
2348 tmphdr.firstused = state->args->geo->blksize;
2350 /* write the header to the temp buffer to initialise it */
2351 xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr);
2353 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2354 drop_blk->bp, &drophdr)) {
2355 xfs_attr3_leaf_moveents(state->args,
2356 drop_leaf, &drophdr, 0,
2357 tmp_leaf, &tmphdr, 0,
2359 xfs_attr3_leaf_moveents(state->args,
2360 save_leaf, &savehdr, 0,
2361 tmp_leaf, &tmphdr, tmphdr.count,
2364 xfs_attr3_leaf_moveents(state->args,
2365 save_leaf, &savehdr, 0,
2366 tmp_leaf, &tmphdr, 0,
2368 xfs_attr3_leaf_moveents(state->args,
2369 drop_leaf, &drophdr, 0,
2370 tmp_leaf, &tmphdr, tmphdr.count,
2373 memcpy(save_leaf, tmp_leaf, state->args->geo->blksize);
2374 savehdr = tmphdr; /* struct copy */
2375 kmem_free(tmp_leaf);
2378 xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr);
2379 xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
2380 state->args->geo->blksize - 1);
2383 * Copy out last hashval in each block for B-tree code.
2385 entry = xfs_attr3_leaf_entryp(save_leaf);
2386 save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval);
2389 /*========================================================================
2390 * Routines used for finding things in the Btree.
2391 *========================================================================*/
2394 * Look up a name in a leaf attribute list structure.
2395 * This is the internal routine, it uses the caller's buffer.
2397 * Note that duplicate keys are allowed, but only check within the
2398 * current leaf node. The Btree code must check in adjacent leaf nodes.
2400 * Return in args->index the index into the entry[] array of either
2401 * the found entry, or where the entry should have been (insert before
2404 * Don't change the args->value unless we find the attribute.
2407 xfs_attr3_leaf_lookup_int(
2409 struct xfs_da_args *args)
2411 struct xfs_attr_leafblock *leaf;
2412 struct xfs_attr3_icleaf_hdr ichdr;
2413 struct xfs_attr_leaf_entry *entry;
2414 struct xfs_attr_leaf_entry *entries;
2415 struct xfs_attr_leaf_name_local *name_loc;
2416 struct xfs_attr_leaf_name_remote *name_rmt;
2417 xfs_dahash_t hashval;
2421 trace_xfs_attr_leaf_lookup(args);
2424 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2425 entries = xfs_attr3_leaf_entryp(leaf);
2426 if (ichdr.count >= args->geo->blksize / 8) {
2427 xfs_buf_mark_corrupt(bp);
2428 return -EFSCORRUPTED;
2432 * Binary search. (note: small blocks will skip this loop)
2434 hashval = args->hashval;
2435 probe = span = ichdr.count / 2;
2436 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) {
2438 if (be32_to_cpu(entry->hashval) < hashval)
2440 else if (be32_to_cpu(entry->hashval) > hashval)
2445 if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count))) {
2446 xfs_buf_mark_corrupt(bp);
2447 return -EFSCORRUPTED;
2449 if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval)) {
2450 xfs_buf_mark_corrupt(bp);
2451 return -EFSCORRUPTED;
2455 * Since we may have duplicate hashval's, find the first matching
2456 * hashval in the leaf.
2458 while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) {
2462 while (probe < ichdr.count &&
2463 be32_to_cpu(entry->hashval) < hashval) {
2467 if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) {
2468 args->index = probe;
2473 * Duplicate keys may be present, so search all of them for a match.
2475 for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval);
2478 * GROT: Add code to remove incomplete entries.
2480 if (entry->flags & XFS_ATTR_LOCAL) {
2481 name_loc = xfs_attr3_leaf_name_local(leaf, probe);
2482 if (!xfs_attr_match(args, name_loc->namelen,
2483 name_loc->nameval, entry->flags))
2485 args->index = probe;
2488 name_rmt = xfs_attr3_leaf_name_remote(leaf, probe);
2489 if (!xfs_attr_match(args, name_rmt->namelen,
2490 name_rmt->name, entry->flags))
2492 args->index = probe;
2493 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
2494 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2495 args->rmtblkcnt = xfs_attr3_rmt_blocks(
2501 args->index = probe;
2506 * Get the value associated with an attribute name from a leaf attribute
2509 * If args->valuelen is zero, only the length needs to be returned. Unlike a
2510 * lookup, we only return an error if the attribute does not exist or we can't
2511 * retrieve the value.
2514 xfs_attr3_leaf_getvalue(
2516 struct xfs_da_args *args)
2518 struct xfs_attr_leafblock *leaf;
2519 struct xfs_attr3_icleaf_hdr ichdr;
2520 struct xfs_attr_leaf_entry *entry;
2521 struct xfs_attr_leaf_name_local *name_loc;
2522 struct xfs_attr_leaf_name_remote *name_rmt;
2525 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2526 ASSERT(ichdr.count < args->geo->blksize / 8);
2527 ASSERT(args->index < ichdr.count);
2529 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2530 if (entry->flags & XFS_ATTR_LOCAL) {
2531 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2532 ASSERT(name_loc->namelen == args->namelen);
2533 ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
2534 return xfs_attr_copy_value(args,
2535 &name_loc->nameval[args->namelen],
2536 be16_to_cpu(name_loc->valuelen));
2539 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2540 ASSERT(name_rmt->namelen == args->namelen);
2541 ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
2542 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
2543 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2544 args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount,
2546 return xfs_attr_copy_value(args, NULL, args->rmtvaluelen);
2549 /*========================================================================
2551 *========================================================================*/
2554 * Move the indicated entries from one leaf to another.
2555 * NOTE: this routine modifies both source and destination leaves.
2559 xfs_attr3_leaf_moveents(
2560 struct xfs_da_args *args,
2561 struct xfs_attr_leafblock *leaf_s,
2562 struct xfs_attr3_icleaf_hdr *ichdr_s,
2564 struct xfs_attr_leafblock *leaf_d,
2565 struct xfs_attr3_icleaf_hdr *ichdr_d,
2569 struct xfs_attr_leaf_entry *entry_s;
2570 struct xfs_attr_leaf_entry *entry_d;
2576 * Check for nothing to do.
2582 * Set up environment.
2584 ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC ||
2585 ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC);
2586 ASSERT(ichdr_s->magic == ichdr_d->magic);
2587 ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8);
2588 ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s))
2589 + xfs_attr3_leaf_hdr_size(leaf_s));
2590 ASSERT(ichdr_d->count < args->geo->blksize / 8);
2591 ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d))
2592 + xfs_attr3_leaf_hdr_size(leaf_d));
2594 ASSERT(start_s < ichdr_s->count);
2595 ASSERT(start_d <= ichdr_d->count);
2596 ASSERT(count <= ichdr_s->count);
2600 * Move the entries in the destination leaf up to make a hole?
2602 if (start_d < ichdr_d->count) {
2603 tmp = ichdr_d->count - start_d;
2604 tmp *= sizeof(xfs_attr_leaf_entry_t);
2605 entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2606 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count];
2607 memmove(entry_d, entry_s, tmp);
2611 * Copy all entry's in the same (sorted) order,
2612 * but allocate attribute info packed and in sequence.
2614 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2615 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2617 for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
2618 ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused);
2619 tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
2622 * Code to drop INCOMPLETE entries. Difficult to use as we
2623 * may also need to change the insertion index. Code turned
2624 * off for 6.2, should be revisited later.
2626 if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
2627 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2628 ichdr_s->usedbytes -= tmp;
2629 ichdr_s->count -= 1;
2630 entry_d--; /* to compensate for ++ in loop hdr */
2632 if ((start_s + i) < offset)
2633 result++; /* insertion index adjustment */
2636 ichdr_d->firstused -= tmp;
2637 /* both on-disk, don't endian flip twice */
2638 entry_d->hashval = entry_s->hashval;
2639 entry_d->nameidx = cpu_to_be16(ichdr_d->firstused);
2640 entry_d->flags = entry_s->flags;
2641 ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
2642 <= args->geo->blksize);
2643 memmove(xfs_attr3_leaf_name(leaf_d, desti),
2644 xfs_attr3_leaf_name(leaf_s, start_s + i), tmp);
2645 ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
2646 <= args->geo->blksize);
2647 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2648 ichdr_s->usedbytes -= tmp;
2649 ichdr_d->usedbytes += tmp;
2650 ichdr_s->count -= 1;
2651 ichdr_d->count += 1;
2652 tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t)
2653 + xfs_attr3_leaf_hdr_size(leaf_d);
2654 ASSERT(ichdr_d->firstused >= tmp);
2661 * Zero out the entries we just copied.
2663 if (start_s == ichdr_s->count) {
2664 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2665 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2666 ASSERT(((char *)entry_s + tmp) <=
2667 ((char *)leaf_s + args->geo->blksize));
2668 memset(entry_s, 0, tmp);
2671 * Move the remaining entries down to fill the hole,
2672 * then zero the entries at the top.
2674 tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t);
2675 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count];
2676 entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2677 memmove(entry_d, entry_s, tmp);
2679 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2680 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count];
2681 ASSERT(((char *)entry_s + tmp) <=
2682 ((char *)leaf_s + args->geo->blksize));
2683 memset(entry_s, 0, tmp);
2687 * Fill in the freemap information
2689 ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d);
2690 ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t);
2691 ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base;
2692 ichdr_d->freemap[1].base = 0;
2693 ichdr_d->freemap[2].base = 0;
2694 ichdr_d->freemap[1].size = 0;
2695 ichdr_d->freemap[2].size = 0;
2696 ichdr_s->holes = 1; /* leaf may not be compact */
2700 * Pick up the last hashvalue from a leaf block.
2703 xfs_attr_leaf_lasthash(
2707 struct xfs_attr3_icleaf_hdr ichdr;
2708 struct xfs_attr_leaf_entry *entries;
2709 struct xfs_mount *mp = bp->b_mount;
2711 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr);
2712 entries = xfs_attr3_leaf_entryp(bp->b_addr);
2714 *count = ichdr.count;
2717 return be32_to_cpu(entries[ichdr.count - 1].hashval);
2721 * Calculate the number of bytes used to store the indicated attribute
2722 * (whether local or remote only calculate bytes in this block).
2725 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2727 struct xfs_attr_leaf_entry *entries;
2728 xfs_attr_leaf_name_local_t *name_loc;
2729 xfs_attr_leaf_name_remote_t *name_rmt;
2732 entries = xfs_attr3_leaf_entryp(leaf);
2733 if (entries[index].flags & XFS_ATTR_LOCAL) {
2734 name_loc = xfs_attr3_leaf_name_local(leaf, index);
2735 size = xfs_attr_leaf_entsize_local(name_loc->namelen,
2736 be16_to_cpu(name_loc->valuelen));
2738 name_rmt = xfs_attr3_leaf_name_remote(leaf, index);
2739 size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
2745 * Calculate the number of bytes that would be required to store the new
2746 * attribute (whether local or remote only calculate bytes in this block).
2747 * This routine decides as a side effect whether the attribute will be
2748 * a "local" or a "remote" attribute.
2751 xfs_attr_leaf_newentsize(
2752 struct xfs_da_args *args,
2757 size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen);
2758 if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) {
2765 return xfs_attr_leaf_entsize_remote(args->namelen);
2769 /*========================================================================
2770 * Manage the INCOMPLETE flag in a leaf entry
2771 *========================================================================*/
2774 * Clear the INCOMPLETE flag on an entry in a leaf block.
2777 xfs_attr3_leaf_clearflag(
2778 struct xfs_da_args *args)
2780 struct xfs_attr_leafblock *leaf;
2781 struct xfs_attr_leaf_entry *entry;
2782 struct xfs_attr_leaf_name_remote *name_rmt;
2786 struct xfs_attr3_icleaf_hdr ichdr;
2787 xfs_attr_leaf_name_local_t *name_loc;
2792 trace_xfs_attr_leaf_clearflag(args);
2794 * Set up the operation.
2796 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp);
2801 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2802 ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);
2805 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2806 ASSERT(args->index < ichdr.count);
2807 ASSERT(args->index >= 0);
2809 if (entry->flags & XFS_ATTR_LOCAL) {
2810 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2811 namelen = name_loc->namelen;
2812 name = (char *)name_loc->nameval;
2814 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2815 namelen = name_rmt->namelen;
2816 name = (char *)name_rmt->name;
2818 ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
2819 ASSERT(namelen == args->namelen);
2820 ASSERT(memcmp(name, args->name, namelen) == 0);
2823 entry->flags &= ~XFS_ATTR_INCOMPLETE;
2824 xfs_trans_log_buf(args->trans, bp,
2825 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2827 if (args->rmtblkno) {
2828 ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
2829 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2830 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2831 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
2832 xfs_trans_log_buf(args->trans, bp,
2833 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2840 * Set the INCOMPLETE flag on an entry in a leaf block.
2843 xfs_attr3_leaf_setflag(
2844 struct xfs_da_args *args)
2846 struct xfs_attr_leafblock *leaf;
2847 struct xfs_attr_leaf_entry *entry;
2848 struct xfs_attr_leaf_name_remote *name_rmt;
2852 struct xfs_attr3_icleaf_hdr ichdr;
2855 trace_xfs_attr_leaf_setflag(args);
2858 * Set up the operation.
2860 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp);
2866 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2867 ASSERT(args->index < ichdr.count);
2868 ASSERT(args->index >= 0);
2870 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2872 ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
2873 entry->flags |= XFS_ATTR_INCOMPLETE;
2874 xfs_trans_log_buf(args->trans, bp,
2875 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2876 if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
2877 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2878 name_rmt->valueblk = 0;
2879 name_rmt->valuelen = 0;
2880 xfs_trans_log_buf(args->trans, bp,
2881 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2888 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2889 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2890 * entry given by args->blkno2/index2.
2892 * Note that they could be in different blocks, or in the same block.
2895 xfs_attr3_leaf_flipflags(
2896 struct xfs_da_args *args)
2898 struct xfs_attr_leafblock *leaf1;
2899 struct xfs_attr_leafblock *leaf2;
2900 struct xfs_attr_leaf_entry *entry1;
2901 struct xfs_attr_leaf_entry *entry2;
2902 struct xfs_attr_leaf_name_remote *name_rmt;
2903 struct xfs_buf *bp1;
2904 struct xfs_buf *bp2;
2907 struct xfs_attr3_icleaf_hdr ichdr1;
2908 struct xfs_attr3_icleaf_hdr ichdr2;
2909 xfs_attr_leaf_name_local_t *name_loc;
2910 int namelen1, namelen2;
2911 char *name1, *name2;
2914 trace_xfs_attr_leaf_flipflags(args);
2917 * Read the block containing the "old" attr
2919 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp1);
2924 * Read the block containing the "new" attr, if it is different
2926 if (args->blkno2 != args->blkno) {
2927 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2,
2935 leaf1 = bp1->b_addr;
2936 entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index];
2938 leaf2 = bp2->b_addr;
2939 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2];
2942 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1);
2943 ASSERT(args->index < ichdr1.count);
2944 ASSERT(args->index >= 0);
2946 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2);
2947 ASSERT(args->index2 < ichdr2.count);
2948 ASSERT(args->index2 >= 0);
2950 if (entry1->flags & XFS_ATTR_LOCAL) {
2951 name_loc = xfs_attr3_leaf_name_local(leaf1, args->index);
2952 namelen1 = name_loc->namelen;
2953 name1 = (char *)name_loc->nameval;
2955 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
2956 namelen1 = name_rmt->namelen;
2957 name1 = (char *)name_rmt->name;
2959 if (entry2->flags & XFS_ATTR_LOCAL) {
2960 name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2);
2961 namelen2 = name_loc->namelen;
2962 name2 = (char *)name_loc->nameval;
2964 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
2965 namelen2 = name_rmt->namelen;
2966 name2 = (char *)name_rmt->name;
2968 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
2969 ASSERT(namelen1 == namelen2);
2970 ASSERT(memcmp(name1, name2, namelen1) == 0);
2973 ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
2974 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);
2976 entry1->flags &= ~XFS_ATTR_INCOMPLETE;
2977 xfs_trans_log_buf(args->trans, bp1,
2978 XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
2979 if (args->rmtblkno) {
2980 ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
2981 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
2982 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2983 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
2984 xfs_trans_log_buf(args->trans, bp1,
2985 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
2988 entry2->flags |= XFS_ATTR_INCOMPLETE;
2989 xfs_trans_log_buf(args->trans, bp2,
2990 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
2991 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
2992 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
2993 name_rmt->valueblk = 0;
2994 name_rmt->valuelen = 0;
2995 xfs_trans_log_buf(args->trans, bp2,
2996 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));