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"
22 #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"
35 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
38 /*========================================================================
39 * Function prototypes for the kernel.
40 *========================================================================*/
43 * Routines used for growing the Btree.
45 STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args,
46 xfs_dablk_t which_block, struct xfs_buf **bpp);
47 STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer,
48 struct xfs_attr3_icleaf_hdr *ichdr,
49 struct xfs_da_args *args, int freemap_index);
50 STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args,
51 struct xfs_attr3_icleaf_hdr *ichdr,
52 struct xfs_buf *leaf_buffer);
53 STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state,
54 xfs_da_state_blk_t *blk1,
55 xfs_da_state_blk_t *blk2);
56 STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state,
57 xfs_da_state_blk_t *leaf_blk_1,
58 struct xfs_attr3_icleaf_hdr *ichdr1,
59 xfs_da_state_blk_t *leaf_blk_2,
60 struct xfs_attr3_icleaf_hdr *ichdr2,
61 int *number_entries_in_blk1,
62 int *number_usedbytes_in_blk1);
67 STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args,
68 struct xfs_attr_leafblock *src_leaf,
69 struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start,
70 struct xfs_attr_leafblock *dst_leaf,
71 struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start,
73 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
76 * attr3 block 'firstused' conversion helpers.
78 * firstused refers to the offset of the first used byte of the nameval region
79 * of an attr leaf block. The region starts at the tail of the block and expands
80 * backwards towards the middle. As such, firstused is initialized to the block
81 * size for an empty leaf block and is reduced from there.
83 * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k.
84 * The in-core firstused field is 32-bit and thus supports the maximum fsb size.
85 * The on-disk field is only 16-bit, however, and overflows at 64k. Since this
86 * only occurs at exactly 64k, we use zero as a magic on-disk value to represent
87 * the attr block size. The following helpers manage the conversion between the
88 * in-core and on-disk formats.
92 xfs_attr3_leaf_firstused_from_disk(
93 struct xfs_da_geometry *geo,
94 struct xfs_attr3_icleaf_hdr *to,
95 struct xfs_attr_leafblock *from)
97 struct xfs_attr3_leaf_hdr *hdr3;
99 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
100 hdr3 = (struct xfs_attr3_leaf_hdr *) from;
101 to->firstused = be16_to_cpu(hdr3->firstused);
103 to->firstused = be16_to_cpu(from->hdr.firstused);
107 * Convert from the magic fsb size value to actual blocksize. This
108 * should only occur for empty blocks when the block size overflows
111 if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) {
112 ASSERT(!to->count && !to->usedbytes);
113 ASSERT(geo->blksize > USHRT_MAX);
114 to->firstused = geo->blksize;
119 xfs_attr3_leaf_firstused_to_disk(
120 struct xfs_da_geometry *geo,
121 struct xfs_attr_leafblock *to,
122 struct xfs_attr3_icleaf_hdr *from)
124 struct xfs_attr3_leaf_hdr *hdr3;
127 /* magic value should only be seen on disk */
128 ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF);
131 * Scale down the 32-bit in-core firstused value to the 16-bit on-disk
132 * value. This only overflows at the max supported value of 64k. Use the
133 * magic on-disk value to represent block size in this case.
135 firstused = from->firstused;
136 if (firstused > USHRT_MAX) {
137 ASSERT(from->firstused == geo->blksize);
138 firstused = XFS_ATTR3_LEAF_NULLOFF;
141 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
142 hdr3 = (struct xfs_attr3_leaf_hdr *) to;
143 hdr3->firstused = cpu_to_be16(firstused);
145 to->hdr.firstused = cpu_to_be16(firstused);
150 xfs_attr3_leaf_hdr_from_disk(
151 struct xfs_da_geometry *geo,
152 struct xfs_attr3_icleaf_hdr *to,
153 struct xfs_attr_leafblock *from)
157 ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) ||
158 from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC));
160 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
161 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from;
163 to->forw = be32_to_cpu(hdr3->info.hdr.forw);
164 to->back = be32_to_cpu(hdr3->info.hdr.back);
165 to->magic = be16_to_cpu(hdr3->info.hdr.magic);
166 to->count = be16_to_cpu(hdr3->count);
167 to->usedbytes = be16_to_cpu(hdr3->usedbytes);
168 xfs_attr3_leaf_firstused_from_disk(geo, to, from);
169 to->holes = hdr3->holes;
171 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
172 to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base);
173 to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size);
177 to->forw = be32_to_cpu(from->hdr.info.forw);
178 to->back = be32_to_cpu(from->hdr.info.back);
179 to->magic = be16_to_cpu(from->hdr.info.magic);
180 to->count = be16_to_cpu(from->hdr.count);
181 to->usedbytes = be16_to_cpu(from->hdr.usedbytes);
182 xfs_attr3_leaf_firstused_from_disk(geo, to, from);
183 to->holes = from->hdr.holes;
185 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
186 to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base);
187 to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size);
192 xfs_attr3_leaf_hdr_to_disk(
193 struct xfs_da_geometry *geo,
194 struct xfs_attr_leafblock *to,
195 struct xfs_attr3_icleaf_hdr *from)
199 ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC ||
200 from->magic == XFS_ATTR3_LEAF_MAGIC);
202 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
203 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to;
205 hdr3->info.hdr.forw = cpu_to_be32(from->forw);
206 hdr3->info.hdr.back = cpu_to_be32(from->back);
207 hdr3->info.hdr.magic = cpu_to_be16(from->magic);
208 hdr3->count = cpu_to_be16(from->count);
209 hdr3->usedbytes = cpu_to_be16(from->usedbytes);
210 xfs_attr3_leaf_firstused_to_disk(geo, to, from);
211 hdr3->holes = from->holes;
214 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
215 hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base);
216 hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size);
220 to->hdr.info.forw = cpu_to_be32(from->forw);
221 to->hdr.info.back = cpu_to_be32(from->back);
222 to->hdr.info.magic = cpu_to_be16(from->magic);
223 to->hdr.count = cpu_to_be16(from->count);
224 to->hdr.usedbytes = cpu_to_be16(from->usedbytes);
225 xfs_attr3_leaf_firstused_to_disk(geo, to, from);
226 to->hdr.holes = from->holes;
229 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
230 to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base);
231 to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size);
235 static xfs_failaddr_t
236 xfs_attr3_leaf_verify_entry(
237 struct xfs_mount *mp,
239 struct xfs_attr_leafblock *leaf,
240 struct xfs_attr3_icleaf_hdr *leafhdr,
241 struct xfs_attr_leaf_entry *ent,
245 struct xfs_attr_leaf_name_local *lentry;
246 struct xfs_attr_leaf_name_remote *rentry;
248 unsigned int nameidx;
249 unsigned int namesize;
252 /* hash order check */
253 hashval = be32_to_cpu(ent->hashval);
254 if (hashval < *last_hashval)
255 return __this_address;
256 *last_hashval = hashval;
258 nameidx = be16_to_cpu(ent->nameidx);
259 if (nameidx < leafhdr->firstused || nameidx >= mp->m_attr_geo->blksize)
260 return __this_address;
263 * Check the name information. The namelen fields are u8 so we can't
264 * possibly exceed the maximum name length of 255 bytes.
266 if (ent->flags & XFS_ATTR_LOCAL) {
267 lentry = xfs_attr3_leaf_name_local(leaf, idx);
268 namesize = xfs_attr_leaf_entsize_local(lentry->namelen,
269 be16_to_cpu(lentry->valuelen));
270 name_end = (char *)lentry + namesize;
271 if (lentry->namelen == 0)
272 return __this_address;
274 rentry = xfs_attr3_leaf_name_remote(leaf, idx);
275 namesize = xfs_attr_leaf_entsize_remote(rentry->namelen);
276 name_end = (char *)rentry + namesize;
277 if (rentry->namelen == 0)
278 return __this_address;
279 if (!(ent->flags & XFS_ATTR_INCOMPLETE) &&
280 rentry->valueblk == 0)
281 return __this_address;
284 if (name_end > buf_end)
285 return __this_address;
290 static xfs_failaddr_t
291 xfs_attr3_leaf_verify(
294 struct xfs_attr3_icleaf_hdr ichdr;
295 struct xfs_mount *mp = bp->b_mount;
296 struct xfs_attr_leafblock *leaf = bp->b_addr;
297 struct xfs_attr_leaf_entry *entries;
298 struct xfs_attr_leaf_entry *ent;
300 uint32_t end; /* must be 32bit - see below */
301 __u32 last_hashval = 0;
305 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
307 fa = xfs_da3_blkinfo_verify(bp, bp->b_addr);
312 * firstused is the block offset of the first name info structure.
313 * Make sure it doesn't go off the block or crash into the header.
315 if (ichdr.firstused > mp->m_attr_geo->blksize)
316 return __this_address;
317 if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf))
318 return __this_address;
320 /* Make sure the entries array doesn't crash into the name info. */
321 entries = xfs_attr3_leaf_entryp(bp->b_addr);
322 if ((char *)&entries[ichdr.count] >
323 (char *)bp->b_addr + ichdr.firstused)
324 return __this_address;
327 * NOTE: This verifier historically failed empty leaf buffers because
328 * we expect the fork to be in another format. Empty attr fork format
329 * conversions are possible during xattr set, however, and format
330 * conversion is not atomic with the xattr set that triggers it. We
331 * cannot assume leaf blocks are non-empty until that is addressed.
333 buf_end = (char *)bp->b_addr + mp->m_attr_geo->blksize;
334 for (i = 0, ent = entries; i < ichdr.count; ent++, i++) {
335 fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr,
336 ent, i, &last_hashval);
342 * Quickly check the freemap information. Attribute data has to be
343 * aligned to 4-byte boundaries, and likewise for the free space.
345 * Note that for 64k block size filesystems, the freemap entries cannot
346 * overflow as they are only be16 fields. However, when checking end
347 * pointer of the freemap, we have to be careful to detect overflows and
348 * so use uint32_t for those checks.
350 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
351 if (ichdr.freemap[i].base > mp->m_attr_geo->blksize)
352 return __this_address;
353 if (ichdr.freemap[i].base & 0x3)
354 return __this_address;
355 if (ichdr.freemap[i].size > mp->m_attr_geo->blksize)
356 return __this_address;
357 if (ichdr.freemap[i].size & 0x3)
358 return __this_address;
360 /* be care of 16 bit overflows here */
361 end = (uint32_t)ichdr.freemap[i].base + ichdr.freemap[i].size;
362 if (end < ichdr.freemap[i].base)
363 return __this_address;
364 if (end > mp->m_attr_geo->blksize)
365 return __this_address;
372 xfs_attr3_leaf_write_verify(
375 struct xfs_mount *mp = bp->b_mount;
376 struct xfs_buf_log_item *bip = bp->b_log_item;
377 struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr;
380 fa = xfs_attr3_leaf_verify(bp);
382 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
386 if (!xfs_sb_version_hascrc(&mp->m_sb))
390 hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn);
392 xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF);
396 * leaf/node format detection on trees is sketchy, so a node read can be done on
397 * leaf level blocks when detection identifies the tree as a node format tree
398 * incorrectly. In this case, we need to swap the verifier to match the correct
399 * format of the block being read.
402 xfs_attr3_leaf_read_verify(
405 struct xfs_mount *mp = bp->b_mount;
408 if (xfs_sb_version_hascrc(&mp->m_sb) &&
409 !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF))
410 xfs_verifier_error(bp, -EFSBADCRC, __this_address);
412 fa = xfs_attr3_leaf_verify(bp);
414 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
418 const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = {
419 .name = "xfs_attr3_leaf",
420 .magic16 = { cpu_to_be16(XFS_ATTR_LEAF_MAGIC),
421 cpu_to_be16(XFS_ATTR3_LEAF_MAGIC) },
422 .verify_read = xfs_attr3_leaf_read_verify,
423 .verify_write = xfs_attr3_leaf_write_verify,
424 .verify_struct = xfs_attr3_leaf_verify,
429 struct xfs_trans *tp,
430 struct xfs_inode *dp,
432 struct xfs_buf **bpp)
436 err = xfs_da_read_buf(tp, dp, bno, 0, bpp, XFS_ATTR_FORK,
437 &xfs_attr3_leaf_buf_ops);
438 if (!err && tp && *bpp)
439 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF);
443 /*========================================================================
444 * Namespace helper routines
445 *========================================================================*/
449 struct xfs_da_args *args,
454 if (args->namelen != namelen)
456 if (memcmp(args->name, name, namelen) != 0)
459 * If we are looking for incomplete entries, show only those, else only
460 * show complete entries.
462 if (args->attr_filter !=
463 (flags & (XFS_ATTR_NSP_ONDISK_MASK | XFS_ATTR_INCOMPLETE)))
470 struct xfs_da_args *args,
471 unsigned char *value,
475 * No copy if all we have to do is get the length
477 if (!args->valuelen) {
478 args->valuelen = valuelen;
483 * No copy if the length of the existing buffer is too small
485 if (args->valuelen < valuelen) {
486 args->valuelen = valuelen;
491 args->value = kmem_alloc_large(valuelen, KM_NOLOCKDEP);
495 args->valuelen = valuelen;
497 /* remote block xattr requires IO for copy-in */
499 return xfs_attr_rmtval_get(args);
502 * This is to prevent a GCC warning because the remote xattr case
503 * doesn't have a value to pass in. In that case, we never reach here,
504 * but GCC can't work that out and so throws a "passing NULL to
509 memcpy(args->value, value, valuelen);
513 /*========================================================================
514 * External routines when attribute fork size < XFS_LITINO(mp).
515 *========================================================================*/
518 * Query whether the requested number of additional bytes of extended
519 * attribute space will be able to fit inline.
521 * Returns zero if not, else the di_forkoff fork offset to be used in the
522 * literal area for attribute data once the new bytes have been added.
524 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
525 * special case for dev/uuid inodes, they have fixed size data forks.
528 xfs_attr_shortform_bytesfit(
529 struct xfs_inode *dp,
532 struct xfs_mount *mp = dp->i_mount;
539 offset = (XFS_LITINO(mp) - bytes) >> 3;
541 if (dp->i_df.if_format == XFS_DINODE_FMT_DEV) {
542 minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
543 return (offset >= minforkoff) ? minforkoff : 0;
547 * If the requested numbers of bytes is smaller or equal to the
548 * current attribute fork size we can always proceed.
550 * Note that if_bytes in the data fork might actually be larger than
551 * the current data fork size is due to delalloc extents. In that
552 * case either the extent count will go down when they are converted
553 * to real extents, or the delalloc conversion will take care of the
554 * literal area rebalancing.
556 if (bytes <= XFS_IFORK_ASIZE(dp))
557 return dp->i_d.di_forkoff;
560 * For attr2 we can try to move the forkoff if there is space in the
561 * literal area, but for the old format we are done if there is no
562 * space in the fixed attribute fork.
564 if (!(mp->m_flags & XFS_MOUNT_ATTR2))
567 dsize = dp->i_df.if_bytes;
569 switch (dp->i_df.if_format) {
570 case XFS_DINODE_FMT_EXTENTS:
572 * If there is no attr fork and the data fork is extents,
573 * determine if creating the default attr fork will result
574 * in the extents form migrating to btree. If so, the
575 * minimum offset only needs to be the space required for
578 if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
579 xfs_default_attroffset(dp))
580 dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
582 case XFS_DINODE_FMT_BTREE:
584 * If we have a data btree then keep forkoff if we have one,
585 * otherwise we are adding a new attr, so then we set
586 * minforkoff to where the btree root can finish so we have
587 * plenty of room for attrs
589 if (dp->i_d.di_forkoff) {
590 if (offset < dp->i_d.di_forkoff)
592 return dp->i_d.di_forkoff;
594 dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot);
599 * A data fork btree root must have space for at least
600 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
602 minforkoff = max_t(int64_t, dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
603 minforkoff = roundup(minforkoff, 8) >> 3;
605 /* attr fork btree root can have at least this many key/ptr pairs */
606 maxforkoff = XFS_LITINO(mp) - XFS_BMDR_SPACE_CALC(MINABTPTRS);
607 maxforkoff = maxforkoff >> 3; /* rounded down */
609 if (offset >= maxforkoff)
611 if (offset >= minforkoff)
617 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
620 xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp)
622 if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
623 !(xfs_sb_version_hasattr2(&mp->m_sb))) {
624 spin_lock(&mp->m_sb_lock);
625 if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
626 xfs_sb_version_addattr2(&mp->m_sb);
627 spin_unlock(&mp->m_sb_lock);
630 spin_unlock(&mp->m_sb_lock);
635 * Create the initial contents of a shortform attribute list.
638 xfs_attr_shortform_create(
639 struct xfs_da_args *args)
641 struct xfs_inode *dp = args->dp;
642 struct xfs_ifork *ifp = dp->i_afp;
643 struct xfs_attr_sf_hdr *hdr;
645 trace_xfs_attr_sf_create(args);
647 ASSERT(ifp->if_bytes == 0);
648 if (ifp->if_format == XFS_DINODE_FMT_EXTENTS) {
649 ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */
650 ifp->if_format = XFS_DINODE_FMT_LOCAL;
651 ifp->if_flags |= XFS_IFINLINE;
653 ASSERT(ifp->if_flags & XFS_IFINLINE);
655 xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
656 hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data;
658 hdr->totsize = cpu_to_be16(sizeof(*hdr));
659 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
663 * Add a name/value pair to the shortform attribute list.
664 * Overflow from the inode has already been checked for.
667 xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
669 xfs_attr_shortform_t *sf;
670 xfs_attr_sf_entry_t *sfe;
674 struct xfs_ifork *ifp;
676 trace_xfs_attr_sf_add(args);
680 dp->i_d.di_forkoff = forkoff;
683 ASSERT(ifp->if_flags & XFS_IFINLINE);
684 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
686 for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
687 ASSERT(!xfs_attr_match(args, sfe->namelen, sfe->nameval,
691 offset = (char *)sfe - (char *)sf;
692 size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
693 xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
694 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
695 sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset);
697 sfe->namelen = args->namelen;
698 sfe->valuelen = args->valuelen;
699 sfe->flags = args->attr_filter;
700 memcpy(sfe->nameval, args->name, args->namelen);
701 memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
703 be16_add_cpu(&sf->hdr.totsize, size);
704 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
706 xfs_sbversion_add_attr2(mp, args->trans);
710 * After the last attribute is removed revert to original inode format,
711 * making all literal area available to the data fork once more.
714 xfs_attr_fork_remove(
715 struct xfs_inode *ip,
716 struct xfs_trans *tp)
718 ASSERT(ip->i_afp->if_nextents == 0);
720 xfs_idestroy_fork(ip->i_afp);
721 kmem_cache_free(xfs_ifork_zone, ip->i_afp);
723 ip->i_d.di_forkoff = 0;
724 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
728 * Remove an attribute from the shortform attribute list structure.
731 xfs_attr_shortform_remove(xfs_da_args_t *args)
733 xfs_attr_shortform_t *sf;
734 xfs_attr_sf_entry_t *sfe;
735 int base, size=0, end, totsize, i;
739 trace_xfs_attr_sf_remove(args);
743 base = sizeof(xfs_attr_sf_hdr_t);
744 sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
747 for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
749 size = XFS_ATTR_SF_ENTSIZE(sfe);
750 if (xfs_attr_match(args, sfe->namelen, sfe->nameval,
758 * Fix up the attribute fork data, covering the hole
761 totsize = be16_to_cpu(sf->hdr.totsize);
763 memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
765 be16_add_cpu(&sf->hdr.totsize, -size);
768 * Fix up the start offset of the attribute fork
771 if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
772 (mp->m_flags & XFS_MOUNT_ATTR2) &&
773 (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) &&
774 !(args->op_flags & XFS_DA_OP_ADDNAME)) {
775 xfs_attr_fork_remove(dp, args->trans);
777 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
778 dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
779 ASSERT(dp->i_d.di_forkoff);
780 ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
781 (args->op_flags & XFS_DA_OP_ADDNAME) ||
782 !(mp->m_flags & XFS_MOUNT_ATTR2) ||
783 dp->i_df.if_format == XFS_DINODE_FMT_BTREE);
784 xfs_trans_log_inode(args->trans, dp,
785 XFS_ILOG_CORE | XFS_ILOG_ADATA);
788 xfs_sbversion_add_attr2(mp, args->trans);
794 * Look up a name in a shortform attribute list structure.
798 xfs_attr_shortform_lookup(xfs_da_args_t *args)
800 xfs_attr_shortform_t *sf;
801 xfs_attr_sf_entry_t *sfe;
803 struct xfs_ifork *ifp;
805 trace_xfs_attr_sf_lookup(args);
807 ifp = args->dp->i_afp;
808 ASSERT(ifp->if_flags & XFS_IFINLINE);
809 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
811 for (i = 0; i < sf->hdr.count;
812 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
813 if (xfs_attr_match(args, sfe->namelen, sfe->nameval,
821 * Retrieve the attribute value and length.
823 * If args->valuelen is zero, only the length needs to be returned. Unlike a
824 * lookup, we only return an error if the attribute does not exist or we can't
825 * retrieve the value.
828 xfs_attr_shortform_getvalue(
829 struct xfs_da_args *args)
831 struct xfs_attr_shortform *sf;
832 struct xfs_attr_sf_entry *sfe;
835 ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE);
836 sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data;
838 for (i = 0; i < sf->hdr.count;
839 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
840 if (xfs_attr_match(args, sfe->namelen, sfe->nameval,
842 return xfs_attr_copy_value(args,
843 &sfe->nameval[args->namelen], sfe->valuelen);
849 * Convert from using the shortform to the leaf. On success, return the
850 * buffer so that we can keep it locked until we're totally done with it.
853 xfs_attr_shortform_to_leaf(
854 struct xfs_da_args *args,
855 struct xfs_buf **leaf_bp)
857 struct xfs_inode *dp;
858 struct xfs_attr_shortform *sf;
859 struct xfs_attr_sf_entry *sfe;
860 struct xfs_da_args nargs;
865 struct xfs_ifork *ifp;
867 trace_xfs_attr_sf_to_leaf(args);
871 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
872 size = be16_to_cpu(sf->hdr.totsize);
873 tmpbuffer = kmem_alloc(size, 0);
874 ASSERT(tmpbuffer != NULL);
875 memcpy(tmpbuffer, ifp->if_u1.if_data, size);
876 sf = (xfs_attr_shortform_t *)tmpbuffer;
878 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
879 xfs_bmap_local_to_extents_empty(args->trans, dp, XFS_ATTR_FORK);
882 error = xfs_da_grow_inode(args, &blkno);
887 error = xfs_attr3_leaf_create(args, blkno, &bp);
891 memset((char *)&nargs, 0, sizeof(nargs));
893 nargs.geo = args->geo;
894 nargs.total = args->total;
895 nargs.whichfork = XFS_ATTR_FORK;
896 nargs.trans = args->trans;
897 nargs.op_flags = XFS_DA_OP_OKNOENT;
900 for (i = 0; i < sf->hdr.count; i++) {
901 nargs.name = sfe->nameval;
902 nargs.namelen = sfe->namelen;
903 nargs.value = &sfe->nameval[nargs.namelen];
904 nargs.valuelen = sfe->valuelen;
905 nargs.hashval = xfs_da_hashname(sfe->nameval,
907 nargs.attr_filter = sfe->flags & XFS_ATTR_NSP_ONDISK_MASK;
908 error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */
909 ASSERT(error == -ENOATTR);
910 error = xfs_attr3_leaf_add(bp, &nargs);
911 ASSERT(error != -ENOSPC);
914 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
919 kmem_free(tmpbuffer);
924 * Check a leaf attribute block to see if all the entries would fit into
925 * a shortform attribute list.
928 xfs_attr_shortform_allfit(
930 struct xfs_inode *dp)
932 struct xfs_attr_leafblock *leaf;
933 struct xfs_attr_leaf_entry *entry;
934 xfs_attr_leaf_name_local_t *name_loc;
935 struct xfs_attr3_icleaf_hdr leafhdr;
938 struct xfs_mount *mp = bp->b_mount;
941 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf);
942 entry = xfs_attr3_leaf_entryp(leaf);
944 bytes = sizeof(struct xfs_attr_sf_hdr);
945 for (i = 0; i < leafhdr.count; entry++, i++) {
946 if (entry->flags & XFS_ATTR_INCOMPLETE)
947 continue; /* don't copy partial entries */
948 if (!(entry->flags & XFS_ATTR_LOCAL))
950 name_loc = xfs_attr3_leaf_name_local(leaf, i);
951 if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
953 if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
955 bytes += sizeof(struct xfs_attr_sf_entry) - 1
957 + be16_to_cpu(name_loc->valuelen);
959 if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
960 (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) &&
961 (bytes == sizeof(struct xfs_attr_sf_hdr)))
963 return xfs_attr_shortform_bytesfit(dp, bytes);
966 /* Verify the consistency of an inline attribute fork. */
968 xfs_attr_shortform_verify(
969 struct xfs_inode *ip)
971 struct xfs_attr_shortform *sfp;
972 struct xfs_attr_sf_entry *sfep;
973 struct xfs_attr_sf_entry *next_sfep;
975 struct xfs_ifork *ifp;
979 ASSERT(ip->i_afp->if_format == XFS_DINODE_FMT_LOCAL);
980 ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK);
981 sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data;
982 size = ifp->if_bytes;
985 * Give up if the attribute is way too short.
987 if (size < sizeof(struct xfs_attr_sf_hdr))
988 return __this_address;
990 endp = (char *)sfp + size;
992 /* Check all reported entries */
993 sfep = &sfp->list[0];
994 for (i = 0; i < sfp->hdr.count; i++) {
996 * struct xfs_attr_sf_entry has a variable length.
997 * Check the fixed-offset parts of the structure are
998 * within the data buffer.
1000 if (((char *)sfep + sizeof(*sfep)) >= endp)
1001 return __this_address;
1003 /* Don't allow names with known bad length. */
1004 if (sfep->namelen == 0)
1005 return __this_address;
1008 * Check that the variable-length part of the structure is
1009 * within the data buffer. The next entry starts after the
1010 * name component, so nextentry is an acceptable test.
1012 next_sfep = XFS_ATTR_SF_NEXTENTRY(sfep);
1013 if ((char *)next_sfep > endp)
1014 return __this_address;
1017 * Check for unknown flags. Short form doesn't support
1018 * the incomplete or local bits, so we can use the namespace
1021 if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK)
1022 return __this_address;
1025 * Check for invalid namespace combinations. We only allow
1026 * one namespace flag per xattr, so we can just count the
1027 * bits (i.e. hweight) here.
1029 if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1)
1030 return __this_address;
1034 if ((void *)sfep != (void *)endp)
1035 return __this_address;
1041 * Convert a leaf attribute list to shortform attribute list
1044 xfs_attr3_leaf_to_shortform(
1046 struct xfs_da_args *args,
1049 struct xfs_attr_leafblock *leaf;
1050 struct xfs_attr3_icleaf_hdr ichdr;
1051 struct xfs_attr_leaf_entry *entry;
1052 struct xfs_attr_leaf_name_local *name_loc;
1053 struct xfs_da_args nargs;
1054 struct xfs_inode *dp = args->dp;
1059 trace_xfs_attr_leaf_to_sf(args);
1061 tmpbuffer = kmem_alloc(args->geo->blksize, 0);
1065 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
1067 leaf = (xfs_attr_leafblock_t *)tmpbuffer;
1068 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
1069 entry = xfs_attr3_leaf_entryp(leaf);
1071 /* XXX (dgc): buffer is about to be marked stale - why zero it? */
1072 memset(bp->b_addr, 0, args->geo->blksize);
1075 * Clean out the prior contents of the attribute list.
1077 error = xfs_da_shrink_inode(args, 0, bp);
1081 if (forkoff == -1) {
1082 ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
1083 ASSERT(dp->i_df.if_format != XFS_DINODE_FMT_BTREE);
1084 xfs_attr_fork_remove(dp, args->trans);
1088 xfs_attr_shortform_create(args);
1091 * Copy the attributes
1093 memset((char *)&nargs, 0, sizeof(nargs));
1094 nargs.geo = args->geo;
1096 nargs.total = args->total;
1097 nargs.whichfork = XFS_ATTR_FORK;
1098 nargs.trans = args->trans;
1099 nargs.op_flags = XFS_DA_OP_OKNOENT;
1101 for (i = 0; i < ichdr.count; entry++, i++) {
1102 if (entry->flags & XFS_ATTR_INCOMPLETE)
1103 continue; /* don't copy partial entries */
1104 if (!entry->nameidx)
1106 ASSERT(entry->flags & XFS_ATTR_LOCAL);
1107 name_loc = xfs_attr3_leaf_name_local(leaf, i);
1108 nargs.name = name_loc->nameval;
1109 nargs.namelen = name_loc->namelen;
1110 nargs.value = &name_loc->nameval[nargs.namelen];
1111 nargs.valuelen = be16_to_cpu(name_loc->valuelen);
1112 nargs.hashval = be32_to_cpu(entry->hashval);
1113 nargs.attr_filter = entry->flags & XFS_ATTR_NSP_ONDISK_MASK;
1114 xfs_attr_shortform_add(&nargs, forkoff);
1119 kmem_free(tmpbuffer);
1124 * Convert from using a single leaf to a root node and a leaf.
1127 xfs_attr3_leaf_to_node(
1128 struct xfs_da_args *args)
1130 struct xfs_attr_leafblock *leaf;
1131 struct xfs_attr3_icleaf_hdr icleafhdr;
1132 struct xfs_attr_leaf_entry *entries;
1133 struct xfs_da3_icnode_hdr icnodehdr;
1134 struct xfs_da_intnode *node;
1135 struct xfs_inode *dp = args->dp;
1136 struct xfs_mount *mp = dp->i_mount;
1137 struct xfs_buf *bp1 = NULL;
1138 struct xfs_buf *bp2 = NULL;
1142 trace_xfs_attr_leaf_to_node(args);
1144 error = xfs_da_grow_inode(args, &blkno);
1147 error = xfs_attr3_leaf_read(args->trans, dp, 0, &bp1);
1151 error = xfs_da_get_buf(args->trans, dp, blkno, &bp2, XFS_ATTR_FORK);
1155 /* copy leaf to new buffer, update identifiers */
1156 xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF);
1157 bp2->b_ops = bp1->b_ops;
1158 memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize);
1159 if (xfs_sb_version_hascrc(&mp->m_sb)) {
1160 struct xfs_da3_blkinfo *hdr3 = bp2->b_addr;
1161 hdr3->blkno = cpu_to_be64(bp2->b_bn);
1163 xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1);
1166 * Set up the new root node.
1168 error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
1172 xfs_da3_node_hdr_from_disk(mp, &icnodehdr, node);
1175 xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf);
1176 entries = xfs_attr3_leaf_entryp(leaf);
1178 /* both on-disk, don't endian-flip twice */
1179 icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval;
1180 icnodehdr.btree[0].before = cpu_to_be32(blkno);
1181 icnodehdr.count = 1;
1182 xfs_da3_node_hdr_to_disk(dp->i_mount, node, &icnodehdr);
1183 xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1);
1189 /*========================================================================
1190 * Routines used for growing the Btree.
1191 *========================================================================*/
1194 * Create the initial contents of a leaf attribute list
1195 * or a leaf in a node attribute list.
1198 xfs_attr3_leaf_create(
1199 struct xfs_da_args *args,
1201 struct xfs_buf **bpp)
1203 struct xfs_attr_leafblock *leaf;
1204 struct xfs_attr3_icleaf_hdr ichdr;
1205 struct xfs_inode *dp = args->dp;
1206 struct xfs_mount *mp = dp->i_mount;
1210 trace_xfs_attr_leaf_create(args);
1212 error = xfs_da_get_buf(args->trans, args->dp, blkno, &bp,
1216 bp->b_ops = &xfs_attr3_leaf_buf_ops;
1217 xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF);
1219 memset(leaf, 0, args->geo->blksize);
1221 memset(&ichdr, 0, sizeof(ichdr));
1222 ichdr.firstused = args->geo->blksize;
1224 if (xfs_sb_version_hascrc(&mp->m_sb)) {
1225 struct xfs_da3_blkinfo *hdr3 = bp->b_addr;
1227 ichdr.magic = XFS_ATTR3_LEAF_MAGIC;
1229 hdr3->blkno = cpu_to_be64(bp->b_bn);
1230 hdr3->owner = cpu_to_be64(dp->i_ino);
1231 uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid);
1233 ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr);
1235 ichdr.magic = XFS_ATTR_LEAF_MAGIC;
1236 ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr);
1238 ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base;
1240 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
1241 xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1);
1248 * Split the leaf node, rebalance, then add the new entry.
1251 xfs_attr3_leaf_split(
1252 struct xfs_da_state *state,
1253 struct xfs_da_state_blk *oldblk,
1254 struct xfs_da_state_blk *newblk)
1259 trace_xfs_attr_leaf_split(state->args);
1262 * Allocate space for a new leaf node.
1264 ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
1265 error = xfs_da_grow_inode(state->args, &blkno);
1268 error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp);
1271 newblk->blkno = blkno;
1272 newblk->magic = XFS_ATTR_LEAF_MAGIC;
1275 * Rebalance the entries across the two leaves.
1276 * NOTE: rebalance() currently depends on the 2nd block being empty.
1278 xfs_attr3_leaf_rebalance(state, oldblk, newblk);
1279 error = xfs_da3_blk_link(state, oldblk, newblk);
1284 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
1285 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1286 * "new" attrs info. Will need the "old" info to remove it later.
1288 * Insert the "new" entry in the correct block.
1290 if (state->inleaf) {
1291 trace_xfs_attr_leaf_add_old(state->args);
1292 error = xfs_attr3_leaf_add(oldblk->bp, state->args);
1294 trace_xfs_attr_leaf_add_new(state->args);
1295 error = xfs_attr3_leaf_add(newblk->bp, state->args);
1299 * Update last hashval in each block since we added the name.
1301 oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
1302 newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
1307 * Add a name to the leaf attribute list structure.
1312 struct xfs_da_args *args)
1314 struct xfs_attr_leafblock *leaf;
1315 struct xfs_attr3_icleaf_hdr ichdr;
1322 trace_xfs_attr_leaf_add(args);
1325 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
1326 ASSERT(args->index >= 0 && args->index <= ichdr.count);
1327 entsize = xfs_attr_leaf_newentsize(args, NULL);
1330 * Search through freemap for first-fit on new name length.
1331 * (may need to figure in size of entry struct too)
1333 tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t)
1334 + xfs_attr3_leaf_hdr_size(leaf);
1335 for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) {
1336 if (tablesize > ichdr.firstused) {
1337 sum += ichdr.freemap[i].size;
1340 if (!ichdr.freemap[i].size)
1341 continue; /* no space in this map */
1343 if (ichdr.freemap[i].base < ichdr.firstused)
1344 tmp += sizeof(xfs_attr_leaf_entry_t);
1345 if (ichdr.freemap[i].size >= tmp) {
1346 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i);
1349 sum += ichdr.freemap[i].size;
1353 * If there are no holes in the address space of the block,
1354 * and we don't have enough freespace, then compaction will do us
1355 * no good and we should just give up.
1357 if (!ichdr.holes && sum < entsize)
1361 * Compact the entries to coalesce free space.
1362 * This may change the hdr->count via dropping INCOMPLETE entries.
1364 xfs_attr3_leaf_compact(args, &ichdr, bp);
1367 * After compaction, the block is guaranteed to have only one
1368 * free region, in freemap[0]. If it is not big enough, give up.
1370 if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) {
1375 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0);
1378 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
1379 xfs_trans_log_buf(args->trans, bp,
1380 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1381 xfs_attr3_leaf_hdr_size(leaf)));
1386 * Add a name to a leaf attribute list structure.
1389 xfs_attr3_leaf_add_work(
1391 struct xfs_attr3_icleaf_hdr *ichdr,
1392 struct xfs_da_args *args,
1395 struct xfs_attr_leafblock *leaf;
1396 struct xfs_attr_leaf_entry *entry;
1397 struct xfs_attr_leaf_name_local *name_loc;
1398 struct xfs_attr_leaf_name_remote *name_rmt;
1399 struct xfs_mount *mp;
1403 trace_xfs_attr_leaf_add_work(args);
1406 ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE);
1407 ASSERT(args->index >= 0 && args->index <= ichdr->count);
1410 * Force open some space in the entry array and fill it in.
1412 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1413 if (args->index < ichdr->count) {
1414 tmp = ichdr->count - args->index;
1415 tmp *= sizeof(xfs_attr_leaf_entry_t);
1416 memmove(entry + 1, entry, tmp);
1417 xfs_trans_log_buf(args->trans, bp,
1418 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1423 * Allocate space for the new string (at the end of the run).
1425 mp = args->trans->t_mountp;
1426 ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize);
1427 ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0);
1428 ASSERT(ichdr->freemap[mapindex].size >=
1429 xfs_attr_leaf_newentsize(args, NULL));
1430 ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize);
1431 ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0);
1433 ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp);
1435 entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base +
1436 ichdr->freemap[mapindex].size);
1437 entry->hashval = cpu_to_be32(args->hashval);
1438 entry->flags = args->attr_filter;
1440 entry->flags |= XFS_ATTR_LOCAL;
1441 if (args->op_flags & XFS_DA_OP_RENAME) {
1442 entry->flags |= XFS_ATTR_INCOMPLETE;
1443 if ((args->blkno2 == args->blkno) &&
1444 (args->index2 <= args->index)) {
1448 xfs_trans_log_buf(args->trans, bp,
1449 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
1450 ASSERT((args->index == 0) ||
1451 (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
1452 ASSERT((args->index == ichdr->count - 1) ||
1453 (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
1456 * For "remote" attribute values, simply note that we need to
1457 * allocate space for the "remote" value. We can't actually
1458 * allocate the extents in this transaction, and we can't decide
1459 * which blocks they should be as we might allocate more blocks
1460 * as part of this transaction (a split operation for example).
1462 if (entry->flags & XFS_ATTR_LOCAL) {
1463 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
1464 name_loc->namelen = args->namelen;
1465 name_loc->valuelen = cpu_to_be16(args->valuelen);
1466 memcpy((char *)name_loc->nameval, args->name, args->namelen);
1467 memcpy((char *)&name_loc->nameval[args->namelen], args->value,
1468 be16_to_cpu(name_loc->valuelen));
1470 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
1471 name_rmt->namelen = args->namelen;
1472 memcpy((char *)name_rmt->name, args->name, args->namelen);
1473 entry->flags |= XFS_ATTR_INCOMPLETE;
1475 name_rmt->valuelen = 0;
1476 name_rmt->valueblk = 0;
1478 args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen);
1479 args->rmtvaluelen = args->valuelen;
1481 xfs_trans_log_buf(args->trans, bp,
1482 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
1483 xfs_attr_leaf_entsize(leaf, args->index)));
1486 * Update the control info for this leaf node
1488 if (be16_to_cpu(entry->nameidx) < ichdr->firstused)
1489 ichdr->firstused = be16_to_cpu(entry->nameidx);
1491 ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t)
1492 + xfs_attr3_leaf_hdr_size(leaf));
1493 tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t)
1494 + xfs_attr3_leaf_hdr_size(leaf);
1496 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
1497 if (ichdr->freemap[i].base == tmp) {
1498 ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t);
1499 ichdr->freemap[i].size -=
1500 min_t(uint16_t, ichdr->freemap[i].size,
1501 sizeof(xfs_attr_leaf_entry_t));
1504 ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index);
1509 * Garbage collect a leaf attribute list block by copying it to a new buffer.
1512 xfs_attr3_leaf_compact(
1513 struct xfs_da_args *args,
1514 struct xfs_attr3_icleaf_hdr *ichdr_dst,
1517 struct xfs_attr_leafblock *leaf_src;
1518 struct xfs_attr_leafblock *leaf_dst;
1519 struct xfs_attr3_icleaf_hdr ichdr_src;
1520 struct xfs_trans *trans = args->trans;
1523 trace_xfs_attr_leaf_compact(args);
1525 tmpbuffer = kmem_alloc(args->geo->blksize, 0);
1526 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
1527 memset(bp->b_addr, 0, args->geo->blksize);
1528 leaf_src = (xfs_attr_leafblock_t *)tmpbuffer;
1529 leaf_dst = bp->b_addr;
1532 * Copy the on-disk header back into the destination buffer to ensure
1533 * all the information in the header that is not part of the incore
1534 * header structure is preserved.
1536 memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src));
1538 /* Initialise the incore headers */
1539 ichdr_src = *ichdr_dst; /* struct copy */
1540 ichdr_dst->firstused = args->geo->blksize;
1541 ichdr_dst->usedbytes = 0;
1542 ichdr_dst->count = 0;
1543 ichdr_dst->holes = 0;
1544 ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src);
1545 ichdr_dst->freemap[0].size = ichdr_dst->firstused -
1546 ichdr_dst->freemap[0].base;
1548 /* write the header back to initialise the underlying buffer */
1549 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst);
1552 * Copy all entry's in the same (sorted) order,
1553 * but allocate name/value pairs packed and in sequence.
1555 xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0,
1556 leaf_dst, ichdr_dst, 0, ichdr_src.count);
1558 * this logs the entire buffer, but the caller must write the header
1559 * back to the buffer when it is finished modifying it.
1561 xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1);
1563 kmem_free(tmpbuffer);
1567 * Compare two leaf blocks "order".
1568 * Return 0 unless leaf2 should go before leaf1.
1571 xfs_attr3_leaf_order(
1572 struct xfs_buf *leaf1_bp,
1573 struct xfs_attr3_icleaf_hdr *leaf1hdr,
1574 struct xfs_buf *leaf2_bp,
1575 struct xfs_attr3_icleaf_hdr *leaf2hdr)
1577 struct xfs_attr_leaf_entry *entries1;
1578 struct xfs_attr_leaf_entry *entries2;
1580 entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr);
1581 entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr);
1582 if (leaf1hdr->count > 0 && leaf2hdr->count > 0 &&
1583 ((be32_to_cpu(entries2[0].hashval) <
1584 be32_to_cpu(entries1[0].hashval)) ||
1585 (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) <
1586 be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) {
1593 xfs_attr_leaf_order(
1594 struct xfs_buf *leaf1_bp,
1595 struct xfs_buf *leaf2_bp)
1597 struct xfs_attr3_icleaf_hdr ichdr1;
1598 struct xfs_attr3_icleaf_hdr ichdr2;
1599 struct xfs_mount *mp = leaf1_bp->b_mount;
1601 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr);
1602 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr);
1603 return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2);
1607 * Redistribute the attribute list entries between two leaf nodes,
1608 * taking into account the size of the new entry.
1610 * NOTE: if new block is empty, then it will get the upper half of the
1611 * old block. At present, all (one) callers pass in an empty second block.
1613 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1614 * to match what it is doing in splitting the attribute leaf block. Those
1615 * values are used in "atomic rename" operations on attributes. Note that
1616 * the "new" and "old" values can end up in different blocks.
1619 xfs_attr3_leaf_rebalance(
1620 struct xfs_da_state *state,
1621 struct xfs_da_state_blk *blk1,
1622 struct xfs_da_state_blk *blk2)
1624 struct xfs_da_args *args;
1625 struct xfs_attr_leafblock *leaf1;
1626 struct xfs_attr_leafblock *leaf2;
1627 struct xfs_attr3_icleaf_hdr ichdr1;
1628 struct xfs_attr3_icleaf_hdr ichdr2;
1629 struct xfs_attr_leaf_entry *entries1;
1630 struct xfs_attr_leaf_entry *entries2;
1638 * Set up environment.
1640 ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
1641 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
1642 leaf1 = blk1->bp->b_addr;
1643 leaf2 = blk2->bp->b_addr;
1644 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1);
1645 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2);
1646 ASSERT(ichdr2.count == 0);
1649 trace_xfs_attr_leaf_rebalance(args);
1652 * Check ordering of blocks, reverse if it makes things simpler.
1654 * NOTE: Given that all (current) callers pass in an empty
1655 * second block, this code should never set "swap".
1658 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) {
1661 /* swap structures rather than reconverting them */
1662 swap(ichdr1, ichdr2);
1664 leaf1 = blk1->bp->b_addr;
1665 leaf2 = blk2->bp->b_addr;
1670 * Examine entries until we reduce the absolute difference in
1671 * byte usage between the two blocks to a minimum. Then get
1672 * the direction to copy and the number of elements to move.
1674 * "inleaf" is true if the new entry should be inserted into blk1.
1675 * If "swap" is also true, then reverse the sense of "inleaf".
1677 state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1,
1681 state->inleaf = !state->inleaf;
1684 * Move any entries required from leaf to leaf:
1686 if (count < ichdr1.count) {
1688 * Figure the total bytes to be added to the destination leaf.
1690 /* number entries being moved */
1691 count = ichdr1.count - count;
1692 space = ichdr1.usedbytes - totallen;
1693 space += count * sizeof(xfs_attr_leaf_entry_t);
1696 * leaf2 is the destination, compact it if it looks tight.
1698 max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1699 max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t);
1701 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp);
1704 * Move high entries from leaf1 to low end of leaf2.
1706 xfs_attr3_leaf_moveents(args, leaf1, &ichdr1,
1707 ichdr1.count - count, leaf2, &ichdr2, 0, count);
1709 } else if (count > ichdr1.count) {
1711 * I assert that since all callers pass in an empty
1712 * second buffer, this code should never execute.
1717 * Figure the total bytes to be added to the destination leaf.
1719 /* number entries being moved */
1720 count -= ichdr1.count;
1721 space = totallen - ichdr1.usedbytes;
1722 space += count * sizeof(xfs_attr_leaf_entry_t);
1725 * leaf1 is the destination, compact it if it looks tight.
1727 max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1728 max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t);
1730 xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp);
1733 * Move low entries from leaf2 to high end of leaf1.
1735 xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1,
1736 ichdr1.count, count);
1739 xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1);
1740 xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2);
1741 xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1);
1742 xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1);
1745 * Copy out last hashval in each block for B-tree code.
1747 entries1 = xfs_attr3_leaf_entryp(leaf1);
1748 entries2 = xfs_attr3_leaf_entryp(leaf2);
1749 blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval);
1750 blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval);
1753 * Adjust the expected index for insertion.
1754 * NOTE: this code depends on the (current) situation that the
1755 * second block was originally empty.
1757 * If the insertion point moved to the 2nd block, we must adjust
1758 * the index. We must also track the entry just following the
1759 * new entry for use in an "atomic rename" operation, that entry
1760 * is always the "old" entry and the "new" entry is what we are
1761 * inserting. The index/blkno fields refer to the "old" entry,
1762 * while the index2/blkno2 fields refer to the "new" entry.
1764 if (blk1->index > ichdr1.count) {
1765 ASSERT(state->inleaf == 0);
1766 blk2->index = blk1->index - ichdr1.count;
1767 args->index = args->index2 = blk2->index;
1768 args->blkno = args->blkno2 = blk2->blkno;
1769 } else if (blk1->index == ichdr1.count) {
1770 if (state->inleaf) {
1771 args->index = blk1->index;
1772 args->blkno = blk1->blkno;
1774 args->blkno2 = blk2->blkno;
1777 * On a double leaf split, the original attr location
1778 * is already stored in blkno2/index2, so don't
1779 * overwrite it overwise we corrupt the tree.
1781 blk2->index = blk1->index - ichdr1.count;
1782 args->index = blk2->index;
1783 args->blkno = blk2->blkno;
1784 if (!state->extravalid) {
1786 * set the new attr location to match the old
1787 * one and let the higher level split code
1788 * decide where in the leaf to place it.
1790 args->index2 = blk2->index;
1791 args->blkno2 = blk2->blkno;
1795 ASSERT(state->inleaf == 1);
1796 args->index = args->index2 = blk1->index;
1797 args->blkno = args->blkno2 = blk1->blkno;
1802 * Examine entries until we reduce the absolute difference in
1803 * byte usage between the two blocks to a minimum.
1804 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1805 * GROT: there will always be enough room in either block for a new entry.
1806 * GROT: Do a double-split for this case?
1809 xfs_attr3_leaf_figure_balance(
1810 struct xfs_da_state *state,
1811 struct xfs_da_state_blk *blk1,
1812 struct xfs_attr3_icleaf_hdr *ichdr1,
1813 struct xfs_da_state_blk *blk2,
1814 struct xfs_attr3_icleaf_hdr *ichdr2,
1818 struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr;
1819 struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr;
1820 struct xfs_attr_leaf_entry *entry;
1831 * Examine entries until we reduce the absolute difference in
1832 * byte usage between the two blocks to a minimum.
1834 max = ichdr1->count + ichdr2->count;
1835 half = (max + 1) * sizeof(*entry);
1836 half += ichdr1->usedbytes + ichdr2->usedbytes +
1837 xfs_attr_leaf_newentsize(state->args, NULL);
1839 lastdelta = state->args->geo->blksize;
1840 entry = xfs_attr3_leaf_entryp(leaf1);
1841 for (count = index = 0; count < max; entry++, index++, count++) {
1843 #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1845 * The new entry is in the first block, account for it.
1847 if (count == blk1->index) {
1848 tmp = totallen + sizeof(*entry) +
1849 xfs_attr_leaf_newentsize(state->args, NULL);
1850 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1852 lastdelta = XFS_ATTR_ABS(half - tmp);
1858 * Wrap around into the second block if necessary.
1860 if (count == ichdr1->count) {
1862 entry = xfs_attr3_leaf_entryp(leaf1);
1867 * Figure out if next leaf entry would be too much.
1869 tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
1871 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1873 lastdelta = XFS_ATTR_ABS(half - tmp);
1879 * Calculate the number of usedbytes that will end up in lower block.
1880 * If new entry not in lower block, fix up the count.
1882 totallen -= count * sizeof(*entry);
1884 totallen -= sizeof(*entry) +
1885 xfs_attr_leaf_newentsize(state->args, NULL);
1889 *usedbytesarg = totallen;
1893 /*========================================================================
1894 * Routines used for shrinking the Btree.
1895 *========================================================================*/
1898 * Check a leaf block and its neighbors to see if the block should be
1899 * collapsed into one or the other neighbor. Always keep the block
1900 * with the smaller block number.
1901 * If the current block is over 50% full, don't try to join it, return 0.
1902 * If the block is empty, fill in the state structure and return 2.
1903 * If it can be collapsed, fill in the state structure and return 1.
1904 * If nothing can be done, return 0.
1906 * GROT: allow for INCOMPLETE entries in calculation.
1909 xfs_attr3_leaf_toosmall(
1910 struct xfs_da_state *state,
1913 struct xfs_attr_leafblock *leaf;
1914 struct xfs_da_state_blk *blk;
1915 struct xfs_attr3_icleaf_hdr ichdr;
1924 trace_xfs_attr_leaf_toosmall(state->args);
1927 * Check for the degenerate case of the block being over 50% full.
1928 * If so, it's not worth even looking to see if we might be able
1929 * to coalesce with a sibling.
1931 blk = &state->path.blk[ state->path.active-1 ];
1932 leaf = blk->bp->b_addr;
1933 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf);
1934 bytes = xfs_attr3_leaf_hdr_size(leaf) +
1935 ichdr.count * sizeof(xfs_attr_leaf_entry_t) +
1937 if (bytes > (state->args->geo->blksize >> 1)) {
1938 *action = 0; /* blk over 50%, don't try to join */
1943 * Check for the degenerate case of the block being empty.
1944 * If the block is empty, we'll simply delete it, no need to
1945 * coalesce it with a sibling block. We choose (arbitrarily)
1946 * to merge with the forward block unless it is NULL.
1948 if (ichdr.count == 0) {
1950 * Make altpath point to the block we want to keep and
1951 * path point to the block we want to drop (this one).
1953 forward = (ichdr.forw != 0);
1954 memcpy(&state->altpath, &state->path, sizeof(state->path));
1955 error = xfs_da3_path_shift(state, &state->altpath, forward,
1968 * Examine each sibling block to see if we can coalesce with
1969 * at least 25% free space to spare. We need to figure out
1970 * whether to merge with the forward or the backward block.
1971 * We prefer coalescing with the lower numbered sibling so as
1972 * to shrink an attribute list over time.
1974 /* start with smaller blk num */
1975 forward = ichdr.forw < ichdr.back;
1976 for (i = 0; i < 2; forward = !forward, i++) {
1977 struct xfs_attr3_icleaf_hdr ichdr2;
1984 error = xfs_attr3_leaf_read(state->args->trans, state->args->dp,
1989 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr);
1991 bytes = state->args->geo->blksize -
1992 (state->args->geo->blksize >> 2) -
1993 ichdr.usedbytes - ichdr2.usedbytes -
1994 ((ichdr.count + ichdr2.count) *
1995 sizeof(xfs_attr_leaf_entry_t)) -
1996 xfs_attr3_leaf_hdr_size(leaf);
1998 xfs_trans_brelse(state->args->trans, bp);
2000 break; /* fits with at least 25% to spare */
2008 * Make altpath point to the block we want to keep (the lower
2009 * numbered block) and path point to the block we want to drop.
2011 memcpy(&state->altpath, &state->path, sizeof(state->path));
2012 if (blkno < blk->blkno) {
2013 error = xfs_da3_path_shift(state, &state->altpath, forward,
2016 error = xfs_da3_path_shift(state, &state->path, forward,
2030 * Remove a name from the leaf attribute list structure.
2032 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
2033 * If two leaves are 37% full, when combined they will leave 25% free.
2036 xfs_attr3_leaf_remove(
2038 struct xfs_da_args *args)
2040 struct xfs_attr_leafblock *leaf;
2041 struct xfs_attr3_icleaf_hdr ichdr;
2042 struct xfs_attr_leaf_entry *entry;
2051 trace_xfs_attr_leaf_remove(args);
2054 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2056 ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8);
2057 ASSERT(args->index >= 0 && args->index < ichdr.count);
2058 ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) +
2059 xfs_attr3_leaf_hdr_size(leaf));
2061 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2063 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
2064 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
2067 * Scan through free region table:
2068 * check for adjacency of free'd entry with an existing one,
2069 * find smallest free region in case we need to replace it,
2070 * adjust any map that borders the entry table,
2072 tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t)
2073 + xfs_attr3_leaf_hdr_size(leaf);
2074 tmp = ichdr.freemap[0].size;
2075 before = after = -1;
2076 smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
2077 entsize = xfs_attr_leaf_entsize(leaf, args->index);
2078 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
2079 ASSERT(ichdr.freemap[i].base < args->geo->blksize);
2080 ASSERT(ichdr.freemap[i].size < args->geo->blksize);
2081 if (ichdr.freemap[i].base == tablesize) {
2082 ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t);
2083 ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t);
2086 if (ichdr.freemap[i].base + ichdr.freemap[i].size ==
2087 be16_to_cpu(entry->nameidx)) {
2089 } else if (ichdr.freemap[i].base ==
2090 (be16_to_cpu(entry->nameidx) + entsize)) {
2092 } else if (ichdr.freemap[i].size < tmp) {
2093 tmp = ichdr.freemap[i].size;
2099 * Coalesce adjacent freemap regions,
2100 * or replace the smallest region.
2102 if ((before >= 0) || (after >= 0)) {
2103 if ((before >= 0) && (after >= 0)) {
2104 ichdr.freemap[before].size += entsize;
2105 ichdr.freemap[before].size += ichdr.freemap[after].size;
2106 ichdr.freemap[after].base = 0;
2107 ichdr.freemap[after].size = 0;
2108 } else if (before >= 0) {
2109 ichdr.freemap[before].size += entsize;
2111 ichdr.freemap[after].base = be16_to_cpu(entry->nameidx);
2112 ichdr.freemap[after].size += entsize;
2116 * Replace smallest region (if it is smaller than free'd entry)
2118 if (ichdr.freemap[smallest].size < entsize) {
2119 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx);
2120 ichdr.freemap[smallest].size = entsize;
2125 * Did we remove the first entry?
2127 if (be16_to_cpu(entry->nameidx) == ichdr.firstused)
2133 * Compress the remaining entries and zero out the removed stuff.
2135 memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize);
2136 ichdr.usedbytes -= entsize;
2137 xfs_trans_log_buf(args->trans, bp,
2138 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
2141 tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t);
2142 memmove(entry, entry + 1, tmp);
2144 xfs_trans_log_buf(args->trans, bp,
2145 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t)));
2147 entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count];
2148 memset(entry, 0, sizeof(xfs_attr_leaf_entry_t));
2151 * If we removed the first entry, re-find the first used byte
2152 * in the name area. Note that if the entry was the "firstused",
2153 * then we don't have a "hole" in our block resulting from
2154 * removing the name.
2157 tmp = args->geo->blksize;
2158 entry = xfs_attr3_leaf_entryp(leaf);
2159 for (i = ichdr.count - 1; i >= 0; entry++, i--) {
2160 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
2161 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
2163 if (be16_to_cpu(entry->nameidx) < tmp)
2164 tmp = be16_to_cpu(entry->nameidx);
2166 ichdr.firstused = tmp;
2167 ASSERT(ichdr.firstused != 0);
2169 ichdr.holes = 1; /* mark as needing compaction */
2171 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
2172 xfs_trans_log_buf(args->trans, bp,
2173 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
2174 xfs_attr3_leaf_hdr_size(leaf)));
2177 * Check if leaf is less than 50% full, caller may want to
2178 * "join" the leaf with a sibling if so.
2180 tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) +
2181 ichdr.count * sizeof(xfs_attr_leaf_entry_t);
2183 return tmp < args->geo->magicpct; /* leaf is < 37% full */
2187 * Move all the attribute list entries from drop_leaf into save_leaf.
2190 xfs_attr3_leaf_unbalance(
2191 struct xfs_da_state *state,
2192 struct xfs_da_state_blk *drop_blk,
2193 struct xfs_da_state_blk *save_blk)
2195 struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr;
2196 struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr;
2197 struct xfs_attr3_icleaf_hdr drophdr;
2198 struct xfs_attr3_icleaf_hdr savehdr;
2199 struct xfs_attr_leaf_entry *entry;
2201 trace_xfs_attr_leaf_unbalance(state->args);
2203 drop_leaf = drop_blk->bp->b_addr;
2204 save_leaf = save_blk->bp->b_addr;
2205 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf);
2206 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf);
2207 entry = xfs_attr3_leaf_entryp(drop_leaf);
2210 * Save last hashval from dying block for later Btree fixup.
2212 drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval);
2215 * Check if we need a temp buffer, or can we do it in place.
2216 * Note that we don't check "leaf" for holes because we will
2217 * always be dropping it, toosmall() decided that for us already.
2219 if (savehdr.holes == 0) {
2221 * dest leaf has no holes, so we add there. May need
2222 * to make some room in the entry array.
2224 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2225 drop_blk->bp, &drophdr)) {
2226 xfs_attr3_leaf_moveents(state->args,
2227 drop_leaf, &drophdr, 0,
2228 save_leaf, &savehdr, 0,
2231 xfs_attr3_leaf_moveents(state->args,
2232 drop_leaf, &drophdr, 0,
2233 save_leaf, &savehdr,
2234 savehdr.count, drophdr.count);
2238 * Destination has holes, so we make a temporary copy
2239 * of the leaf and add them both to that.
2241 struct xfs_attr_leafblock *tmp_leaf;
2242 struct xfs_attr3_icleaf_hdr tmphdr;
2244 tmp_leaf = kmem_zalloc(state->args->geo->blksize, 0);
2247 * Copy the header into the temp leaf so that all the stuff
2248 * not in the incore header is present and gets copied back in
2249 * once we've moved all the entries.
2251 memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf));
2253 memset(&tmphdr, 0, sizeof(tmphdr));
2254 tmphdr.magic = savehdr.magic;
2255 tmphdr.forw = savehdr.forw;
2256 tmphdr.back = savehdr.back;
2257 tmphdr.firstused = state->args->geo->blksize;
2259 /* write the header to the temp buffer to initialise it */
2260 xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr);
2262 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2263 drop_blk->bp, &drophdr)) {
2264 xfs_attr3_leaf_moveents(state->args,
2265 drop_leaf, &drophdr, 0,
2266 tmp_leaf, &tmphdr, 0,
2268 xfs_attr3_leaf_moveents(state->args,
2269 save_leaf, &savehdr, 0,
2270 tmp_leaf, &tmphdr, tmphdr.count,
2273 xfs_attr3_leaf_moveents(state->args,
2274 save_leaf, &savehdr, 0,
2275 tmp_leaf, &tmphdr, 0,
2277 xfs_attr3_leaf_moveents(state->args,
2278 drop_leaf, &drophdr, 0,
2279 tmp_leaf, &tmphdr, tmphdr.count,
2282 memcpy(save_leaf, tmp_leaf, state->args->geo->blksize);
2283 savehdr = tmphdr; /* struct copy */
2284 kmem_free(tmp_leaf);
2287 xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr);
2288 xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
2289 state->args->geo->blksize - 1);
2292 * Copy out last hashval in each block for B-tree code.
2294 entry = xfs_attr3_leaf_entryp(save_leaf);
2295 save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval);
2298 /*========================================================================
2299 * Routines used for finding things in the Btree.
2300 *========================================================================*/
2303 * Look up a name in a leaf attribute list structure.
2304 * This is the internal routine, it uses the caller's buffer.
2306 * Note that duplicate keys are allowed, but only check within the
2307 * current leaf node. The Btree code must check in adjacent leaf nodes.
2309 * Return in args->index the index into the entry[] array of either
2310 * the found entry, or where the entry should have been (insert before
2313 * Don't change the args->value unless we find the attribute.
2316 xfs_attr3_leaf_lookup_int(
2318 struct xfs_da_args *args)
2320 struct xfs_attr_leafblock *leaf;
2321 struct xfs_attr3_icleaf_hdr ichdr;
2322 struct xfs_attr_leaf_entry *entry;
2323 struct xfs_attr_leaf_entry *entries;
2324 struct xfs_attr_leaf_name_local *name_loc;
2325 struct xfs_attr_leaf_name_remote *name_rmt;
2326 xfs_dahash_t hashval;
2330 trace_xfs_attr_leaf_lookup(args);
2333 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2334 entries = xfs_attr3_leaf_entryp(leaf);
2335 if (ichdr.count >= args->geo->blksize / 8) {
2336 xfs_buf_mark_corrupt(bp);
2337 return -EFSCORRUPTED;
2341 * Binary search. (note: small blocks will skip this loop)
2343 hashval = args->hashval;
2344 probe = span = ichdr.count / 2;
2345 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) {
2347 if (be32_to_cpu(entry->hashval) < hashval)
2349 else if (be32_to_cpu(entry->hashval) > hashval)
2354 if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count))) {
2355 xfs_buf_mark_corrupt(bp);
2356 return -EFSCORRUPTED;
2358 if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval)) {
2359 xfs_buf_mark_corrupt(bp);
2360 return -EFSCORRUPTED;
2364 * Since we may have duplicate hashval's, find the first matching
2365 * hashval in the leaf.
2367 while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) {
2371 while (probe < ichdr.count &&
2372 be32_to_cpu(entry->hashval) < hashval) {
2376 if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) {
2377 args->index = probe;
2382 * Duplicate keys may be present, so search all of them for a match.
2384 for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval);
2387 * GROT: Add code to remove incomplete entries.
2389 if (entry->flags & XFS_ATTR_LOCAL) {
2390 name_loc = xfs_attr3_leaf_name_local(leaf, probe);
2391 if (!xfs_attr_match(args, name_loc->namelen,
2392 name_loc->nameval, entry->flags))
2394 args->index = probe;
2397 name_rmt = xfs_attr3_leaf_name_remote(leaf, probe);
2398 if (!xfs_attr_match(args, name_rmt->namelen,
2399 name_rmt->name, entry->flags))
2401 args->index = probe;
2402 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
2403 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2404 args->rmtblkcnt = xfs_attr3_rmt_blocks(
2410 args->index = probe;
2415 * Get the value associated with an attribute name from a leaf attribute
2418 * If args->valuelen is zero, only the length needs to be returned. Unlike a
2419 * lookup, we only return an error if the attribute does not exist or we can't
2420 * retrieve the value.
2423 xfs_attr3_leaf_getvalue(
2425 struct xfs_da_args *args)
2427 struct xfs_attr_leafblock *leaf;
2428 struct xfs_attr3_icleaf_hdr ichdr;
2429 struct xfs_attr_leaf_entry *entry;
2430 struct xfs_attr_leaf_name_local *name_loc;
2431 struct xfs_attr_leaf_name_remote *name_rmt;
2434 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2435 ASSERT(ichdr.count < args->geo->blksize / 8);
2436 ASSERT(args->index < ichdr.count);
2438 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2439 if (entry->flags & XFS_ATTR_LOCAL) {
2440 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2441 ASSERT(name_loc->namelen == args->namelen);
2442 ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
2443 return xfs_attr_copy_value(args,
2444 &name_loc->nameval[args->namelen],
2445 be16_to_cpu(name_loc->valuelen));
2448 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2449 ASSERT(name_rmt->namelen == args->namelen);
2450 ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
2451 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
2452 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2453 args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount,
2455 return xfs_attr_copy_value(args, NULL, args->rmtvaluelen);
2458 /*========================================================================
2460 *========================================================================*/
2463 * Move the indicated entries from one leaf to another.
2464 * NOTE: this routine modifies both source and destination leaves.
2468 xfs_attr3_leaf_moveents(
2469 struct xfs_da_args *args,
2470 struct xfs_attr_leafblock *leaf_s,
2471 struct xfs_attr3_icleaf_hdr *ichdr_s,
2473 struct xfs_attr_leafblock *leaf_d,
2474 struct xfs_attr3_icleaf_hdr *ichdr_d,
2478 struct xfs_attr_leaf_entry *entry_s;
2479 struct xfs_attr_leaf_entry *entry_d;
2485 * Check for nothing to do.
2491 * Set up environment.
2493 ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC ||
2494 ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC);
2495 ASSERT(ichdr_s->magic == ichdr_d->magic);
2496 ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8);
2497 ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s))
2498 + xfs_attr3_leaf_hdr_size(leaf_s));
2499 ASSERT(ichdr_d->count < args->geo->blksize / 8);
2500 ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d))
2501 + xfs_attr3_leaf_hdr_size(leaf_d));
2503 ASSERT(start_s < ichdr_s->count);
2504 ASSERT(start_d <= ichdr_d->count);
2505 ASSERT(count <= ichdr_s->count);
2509 * Move the entries in the destination leaf up to make a hole?
2511 if (start_d < ichdr_d->count) {
2512 tmp = ichdr_d->count - start_d;
2513 tmp *= sizeof(xfs_attr_leaf_entry_t);
2514 entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2515 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count];
2516 memmove(entry_d, entry_s, tmp);
2520 * Copy all entry's in the same (sorted) order,
2521 * but allocate attribute info packed and in sequence.
2523 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2524 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2526 for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
2527 ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused);
2528 tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
2531 * Code to drop INCOMPLETE entries. Difficult to use as we
2532 * may also need to change the insertion index. Code turned
2533 * off for 6.2, should be revisited later.
2535 if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
2536 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2537 ichdr_s->usedbytes -= tmp;
2538 ichdr_s->count -= 1;
2539 entry_d--; /* to compensate for ++ in loop hdr */
2541 if ((start_s + i) < offset)
2542 result++; /* insertion index adjustment */
2545 ichdr_d->firstused -= tmp;
2546 /* both on-disk, don't endian flip twice */
2547 entry_d->hashval = entry_s->hashval;
2548 entry_d->nameidx = cpu_to_be16(ichdr_d->firstused);
2549 entry_d->flags = entry_s->flags;
2550 ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
2551 <= args->geo->blksize);
2552 memmove(xfs_attr3_leaf_name(leaf_d, desti),
2553 xfs_attr3_leaf_name(leaf_s, start_s + i), tmp);
2554 ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
2555 <= args->geo->blksize);
2556 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2557 ichdr_s->usedbytes -= tmp;
2558 ichdr_d->usedbytes += tmp;
2559 ichdr_s->count -= 1;
2560 ichdr_d->count += 1;
2561 tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t)
2562 + xfs_attr3_leaf_hdr_size(leaf_d);
2563 ASSERT(ichdr_d->firstused >= tmp);
2570 * Zero out the entries we just copied.
2572 if (start_s == ichdr_s->count) {
2573 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2574 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2575 ASSERT(((char *)entry_s + tmp) <=
2576 ((char *)leaf_s + args->geo->blksize));
2577 memset(entry_s, 0, tmp);
2580 * Move the remaining entries down to fill the hole,
2581 * then zero the entries at the top.
2583 tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t);
2584 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count];
2585 entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2586 memmove(entry_d, entry_s, tmp);
2588 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2589 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count];
2590 ASSERT(((char *)entry_s + tmp) <=
2591 ((char *)leaf_s + args->geo->blksize));
2592 memset(entry_s, 0, tmp);
2596 * Fill in the freemap information
2598 ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d);
2599 ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t);
2600 ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base;
2601 ichdr_d->freemap[1].base = 0;
2602 ichdr_d->freemap[2].base = 0;
2603 ichdr_d->freemap[1].size = 0;
2604 ichdr_d->freemap[2].size = 0;
2605 ichdr_s->holes = 1; /* leaf may not be compact */
2609 * Pick up the last hashvalue from a leaf block.
2612 xfs_attr_leaf_lasthash(
2616 struct xfs_attr3_icleaf_hdr ichdr;
2617 struct xfs_attr_leaf_entry *entries;
2618 struct xfs_mount *mp = bp->b_mount;
2620 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr);
2621 entries = xfs_attr3_leaf_entryp(bp->b_addr);
2623 *count = ichdr.count;
2626 return be32_to_cpu(entries[ichdr.count - 1].hashval);
2630 * Calculate the number of bytes used to store the indicated attribute
2631 * (whether local or remote only calculate bytes in this block).
2634 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2636 struct xfs_attr_leaf_entry *entries;
2637 xfs_attr_leaf_name_local_t *name_loc;
2638 xfs_attr_leaf_name_remote_t *name_rmt;
2641 entries = xfs_attr3_leaf_entryp(leaf);
2642 if (entries[index].flags & XFS_ATTR_LOCAL) {
2643 name_loc = xfs_attr3_leaf_name_local(leaf, index);
2644 size = xfs_attr_leaf_entsize_local(name_loc->namelen,
2645 be16_to_cpu(name_loc->valuelen));
2647 name_rmt = xfs_attr3_leaf_name_remote(leaf, index);
2648 size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
2654 * Calculate the number of bytes that would be required to store the new
2655 * attribute (whether local or remote only calculate bytes in this block).
2656 * This routine decides as a side effect whether the attribute will be
2657 * a "local" or a "remote" attribute.
2660 xfs_attr_leaf_newentsize(
2661 struct xfs_da_args *args,
2666 size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen);
2667 if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) {
2674 return xfs_attr_leaf_entsize_remote(args->namelen);
2678 /*========================================================================
2679 * Manage the INCOMPLETE flag in a leaf entry
2680 *========================================================================*/
2683 * Clear the INCOMPLETE flag on an entry in a leaf block.
2686 xfs_attr3_leaf_clearflag(
2687 struct xfs_da_args *args)
2689 struct xfs_attr_leafblock *leaf;
2690 struct xfs_attr_leaf_entry *entry;
2691 struct xfs_attr_leaf_name_remote *name_rmt;
2695 struct xfs_attr3_icleaf_hdr ichdr;
2696 xfs_attr_leaf_name_local_t *name_loc;
2701 trace_xfs_attr_leaf_clearflag(args);
2703 * Set up the operation.
2705 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp);
2710 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2711 ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);
2714 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2715 ASSERT(args->index < ichdr.count);
2716 ASSERT(args->index >= 0);
2718 if (entry->flags & XFS_ATTR_LOCAL) {
2719 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2720 namelen = name_loc->namelen;
2721 name = (char *)name_loc->nameval;
2723 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2724 namelen = name_rmt->namelen;
2725 name = (char *)name_rmt->name;
2727 ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
2728 ASSERT(namelen == args->namelen);
2729 ASSERT(memcmp(name, args->name, namelen) == 0);
2732 entry->flags &= ~XFS_ATTR_INCOMPLETE;
2733 xfs_trans_log_buf(args->trans, bp,
2734 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2736 if (args->rmtblkno) {
2737 ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
2738 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2739 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2740 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
2741 xfs_trans_log_buf(args->trans, bp,
2742 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2746 * Commit the flag value change and start the next trans in series.
2748 return xfs_trans_roll_inode(&args->trans, args->dp);
2752 * Set the INCOMPLETE flag on an entry in a leaf block.
2755 xfs_attr3_leaf_setflag(
2756 struct xfs_da_args *args)
2758 struct xfs_attr_leafblock *leaf;
2759 struct xfs_attr_leaf_entry *entry;
2760 struct xfs_attr_leaf_name_remote *name_rmt;
2764 struct xfs_attr3_icleaf_hdr ichdr;
2767 trace_xfs_attr_leaf_setflag(args);
2770 * Set up the operation.
2772 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp);
2778 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2779 ASSERT(args->index < ichdr.count);
2780 ASSERT(args->index >= 0);
2782 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2784 ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
2785 entry->flags |= XFS_ATTR_INCOMPLETE;
2786 xfs_trans_log_buf(args->trans, bp,
2787 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2788 if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
2789 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2790 name_rmt->valueblk = 0;
2791 name_rmt->valuelen = 0;
2792 xfs_trans_log_buf(args->trans, bp,
2793 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2797 * Commit the flag value change and start the next trans in series.
2799 return xfs_trans_roll_inode(&args->trans, args->dp);
2803 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2804 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2805 * entry given by args->blkno2/index2.
2807 * Note that they could be in different blocks, or in the same block.
2810 xfs_attr3_leaf_flipflags(
2811 struct xfs_da_args *args)
2813 struct xfs_attr_leafblock *leaf1;
2814 struct xfs_attr_leafblock *leaf2;
2815 struct xfs_attr_leaf_entry *entry1;
2816 struct xfs_attr_leaf_entry *entry2;
2817 struct xfs_attr_leaf_name_remote *name_rmt;
2818 struct xfs_buf *bp1;
2819 struct xfs_buf *bp2;
2822 struct xfs_attr3_icleaf_hdr ichdr1;
2823 struct xfs_attr3_icleaf_hdr ichdr2;
2824 xfs_attr_leaf_name_local_t *name_loc;
2825 int namelen1, namelen2;
2826 char *name1, *name2;
2829 trace_xfs_attr_leaf_flipflags(args);
2832 * Read the block containing the "old" attr
2834 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp1);
2839 * Read the block containing the "new" attr, if it is different
2841 if (args->blkno2 != args->blkno) {
2842 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2,
2850 leaf1 = bp1->b_addr;
2851 entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index];
2853 leaf2 = bp2->b_addr;
2854 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2];
2857 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1);
2858 ASSERT(args->index < ichdr1.count);
2859 ASSERT(args->index >= 0);
2861 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2);
2862 ASSERT(args->index2 < ichdr2.count);
2863 ASSERT(args->index2 >= 0);
2865 if (entry1->flags & XFS_ATTR_LOCAL) {
2866 name_loc = xfs_attr3_leaf_name_local(leaf1, args->index);
2867 namelen1 = name_loc->namelen;
2868 name1 = (char *)name_loc->nameval;
2870 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
2871 namelen1 = name_rmt->namelen;
2872 name1 = (char *)name_rmt->name;
2874 if (entry2->flags & XFS_ATTR_LOCAL) {
2875 name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2);
2876 namelen2 = name_loc->namelen;
2877 name2 = (char *)name_loc->nameval;
2879 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
2880 namelen2 = name_rmt->namelen;
2881 name2 = (char *)name_rmt->name;
2883 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
2884 ASSERT(namelen1 == namelen2);
2885 ASSERT(memcmp(name1, name2, namelen1) == 0);
2888 ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
2889 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);
2891 entry1->flags &= ~XFS_ATTR_INCOMPLETE;
2892 xfs_trans_log_buf(args->trans, bp1,
2893 XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
2894 if (args->rmtblkno) {
2895 ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
2896 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
2897 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2898 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
2899 xfs_trans_log_buf(args->trans, bp1,
2900 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
2903 entry2->flags |= XFS_ATTR_INCOMPLETE;
2904 xfs_trans_log_buf(args->trans, bp2,
2905 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
2906 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
2907 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
2908 name_rmt->valueblk = 0;
2909 name_rmt->valuelen = 0;
2910 xfs_trans_log_buf(args->trans, bp2,
2911 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
2915 * Commit the flag value change and start the next trans in series.
2917 error = xfs_trans_roll_inode(&args->trans, args->dp);