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"
15 #include "xfs_mount.h"
16 #include "xfs_da_format.h"
17 #include "xfs_da_btree.h"
18 #include "xfs_inode.h"
19 #include "xfs_trans.h"
20 #include "xfs_inode_item.h"
21 #include "xfs_bmap_btree.h"
23 #include "xfs_attr_sf.h"
24 #include "xfs_attr_remote.h"
26 #include "xfs_attr_leaf.h"
27 #include "xfs_error.h"
28 #include "xfs_trace.h"
29 #include "xfs_buf_item.h"
30 #include "xfs_cksum.h"
38 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
41 /*========================================================================
42 * Function prototypes for the kernel.
43 *========================================================================*/
46 * Routines used for growing the Btree.
48 STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args,
49 xfs_dablk_t which_block, struct xfs_buf **bpp);
50 STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer,
51 struct xfs_attr3_icleaf_hdr *ichdr,
52 struct xfs_da_args *args, int freemap_index);
53 STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args,
54 struct xfs_attr3_icleaf_hdr *ichdr,
55 struct xfs_buf *leaf_buffer);
56 STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state,
57 xfs_da_state_blk_t *blk1,
58 xfs_da_state_blk_t *blk2);
59 STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state,
60 xfs_da_state_blk_t *leaf_blk_1,
61 struct xfs_attr3_icleaf_hdr *ichdr1,
62 xfs_da_state_blk_t *leaf_blk_2,
63 struct xfs_attr3_icleaf_hdr *ichdr2,
64 int *number_entries_in_blk1,
65 int *number_usedbytes_in_blk1);
70 STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args,
71 struct xfs_attr_leafblock *src_leaf,
72 struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start,
73 struct xfs_attr_leafblock *dst_leaf,
74 struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start,
76 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
79 * attr3 block 'firstused' conversion helpers.
81 * firstused refers to the offset of the first used byte of the nameval region
82 * of an attr leaf block. The region starts at the tail of the block and expands
83 * backwards towards the middle. As such, firstused is initialized to the block
84 * size for an empty leaf block and is reduced from there.
86 * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k.
87 * The in-core firstused field is 32-bit and thus supports the maximum fsb size.
88 * The on-disk field is only 16-bit, however, and overflows at 64k. Since this
89 * only occurs at exactly 64k, we use zero as a magic on-disk value to represent
90 * the attr block size. The following helpers manage the conversion between the
91 * in-core and on-disk formats.
95 xfs_attr3_leaf_firstused_from_disk(
96 struct xfs_da_geometry *geo,
97 struct xfs_attr3_icleaf_hdr *to,
98 struct xfs_attr_leafblock *from)
100 struct xfs_attr3_leaf_hdr *hdr3;
102 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
103 hdr3 = (struct xfs_attr3_leaf_hdr *) from;
104 to->firstused = be16_to_cpu(hdr3->firstused);
106 to->firstused = be16_to_cpu(from->hdr.firstused);
110 * Convert from the magic fsb size value to actual blocksize. This
111 * should only occur for empty blocks when the block size overflows
114 if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) {
115 ASSERT(!to->count && !to->usedbytes);
116 ASSERT(geo->blksize > USHRT_MAX);
117 to->firstused = geo->blksize;
122 xfs_attr3_leaf_firstused_to_disk(
123 struct xfs_da_geometry *geo,
124 struct xfs_attr_leafblock *to,
125 struct xfs_attr3_icleaf_hdr *from)
127 struct xfs_attr3_leaf_hdr *hdr3;
130 /* magic value should only be seen on disk */
131 ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF);
134 * Scale down the 32-bit in-core firstused value to the 16-bit on-disk
135 * value. This only overflows at the max supported value of 64k. Use the
136 * magic on-disk value to represent block size in this case.
138 firstused = from->firstused;
139 if (firstused > USHRT_MAX) {
140 ASSERT(from->firstused == geo->blksize);
141 firstused = XFS_ATTR3_LEAF_NULLOFF;
144 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
145 hdr3 = (struct xfs_attr3_leaf_hdr *) to;
146 hdr3->firstused = cpu_to_be16(firstused);
148 to->hdr.firstused = cpu_to_be16(firstused);
153 xfs_attr3_leaf_hdr_from_disk(
154 struct xfs_da_geometry *geo,
155 struct xfs_attr3_icleaf_hdr *to,
156 struct xfs_attr_leafblock *from)
160 ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) ||
161 from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC));
163 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
164 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from;
166 to->forw = be32_to_cpu(hdr3->info.hdr.forw);
167 to->back = be32_to_cpu(hdr3->info.hdr.back);
168 to->magic = be16_to_cpu(hdr3->info.hdr.magic);
169 to->count = be16_to_cpu(hdr3->count);
170 to->usedbytes = be16_to_cpu(hdr3->usedbytes);
171 xfs_attr3_leaf_firstused_from_disk(geo, to, from);
172 to->holes = hdr3->holes;
174 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
175 to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base);
176 to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size);
180 to->forw = be32_to_cpu(from->hdr.info.forw);
181 to->back = be32_to_cpu(from->hdr.info.back);
182 to->magic = be16_to_cpu(from->hdr.info.magic);
183 to->count = be16_to_cpu(from->hdr.count);
184 to->usedbytes = be16_to_cpu(from->hdr.usedbytes);
185 xfs_attr3_leaf_firstused_from_disk(geo, to, from);
186 to->holes = from->hdr.holes;
188 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
189 to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base);
190 to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size);
195 xfs_attr3_leaf_hdr_to_disk(
196 struct xfs_da_geometry *geo,
197 struct xfs_attr_leafblock *to,
198 struct xfs_attr3_icleaf_hdr *from)
202 ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC ||
203 from->magic == XFS_ATTR3_LEAF_MAGIC);
205 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
206 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to;
208 hdr3->info.hdr.forw = cpu_to_be32(from->forw);
209 hdr3->info.hdr.back = cpu_to_be32(from->back);
210 hdr3->info.hdr.magic = cpu_to_be16(from->magic);
211 hdr3->count = cpu_to_be16(from->count);
212 hdr3->usedbytes = cpu_to_be16(from->usedbytes);
213 xfs_attr3_leaf_firstused_to_disk(geo, to, from);
214 hdr3->holes = from->holes;
217 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
218 hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base);
219 hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size);
223 to->hdr.info.forw = cpu_to_be32(from->forw);
224 to->hdr.info.back = cpu_to_be32(from->back);
225 to->hdr.info.magic = cpu_to_be16(from->magic);
226 to->hdr.count = cpu_to_be16(from->count);
227 to->hdr.usedbytes = cpu_to_be16(from->usedbytes);
228 xfs_attr3_leaf_firstused_to_disk(geo, to, from);
229 to->hdr.holes = from->holes;
232 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
233 to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base);
234 to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size);
238 static xfs_failaddr_t
239 xfs_attr3_leaf_verify(
242 struct xfs_attr3_icleaf_hdr ichdr;
243 struct xfs_mount *mp = bp->b_target->bt_mount;
244 struct xfs_attr_leafblock *leaf = bp->b_addr;
245 struct xfs_perag *pag = bp->b_pag;
246 struct xfs_attr_leaf_entry *entries;
248 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf);
250 if (xfs_sb_version_hascrc(&mp->m_sb)) {
251 struct xfs_da3_node_hdr *hdr3 = bp->b_addr;
253 if (ichdr.magic != XFS_ATTR3_LEAF_MAGIC)
254 return __this_address;
256 if (!uuid_equal(&hdr3->info.uuid, &mp->m_sb.sb_meta_uuid))
257 return __this_address;
258 if (be64_to_cpu(hdr3->info.blkno) != bp->b_bn)
259 return __this_address;
260 if (!xfs_log_check_lsn(mp, be64_to_cpu(hdr3->info.lsn)))
261 return __this_address;
263 if (ichdr.magic != XFS_ATTR_LEAF_MAGIC)
264 return __this_address;
267 * In recovery there is a transient state where count == 0 is valid
268 * because we may have transitioned an empty shortform attr to a leaf
269 * if the attr didn't fit in shortform.
271 if (pag && pag->pagf_init && ichdr.count == 0)
272 return __this_address;
275 * firstused is the block offset of the first name info structure.
276 * Make sure it doesn't go off the block or crash into the header.
278 if (ichdr.firstused > mp->m_attr_geo->blksize)
279 return __this_address;
280 if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf))
281 return __this_address;
283 /* Make sure the entries array doesn't crash into the name info. */
284 entries = xfs_attr3_leaf_entryp(bp->b_addr);
285 if ((char *)&entries[ichdr.count] >
286 (char *)bp->b_addr + ichdr.firstused)
287 return __this_address;
289 /* XXX: need to range check rest of attr header values */
290 /* XXX: hash order check? */
296 xfs_attr3_leaf_write_verify(
299 struct xfs_mount *mp = bp->b_target->bt_mount;
300 struct xfs_buf_log_item *bip = bp->b_log_item;
301 struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr;
304 fa = xfs_attr3_leaf_verify(bp);
306 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
310 if (!xfs_sb_version_hascrc(&mp->m_sb))
314 hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn);
316 xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF);
320 * leaf/node format detection on trees is sketchy, so a node read can be done on
321 * leaf level blocks when detection identifies the tree as a node format tree
322 * incorrectly. In this case, we need to swap the verifier to match the correct
323 * format of the block being read.
326 xfs_attr3_leaf_read_verify(
329 struct xfs_mount *mp = bp->b_target->bt_mount;
332 if (xfs_sb_version_hascrc(&mp->m_sb) &&
333 !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF))
334 xfs_verifier_error(bp, -EFSBADCRC, __this_address);
336 fa = xfs_attr3_leaf_verify(bp);
338 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
342 const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = {
343 .name = "xfs_attr3_leaf",
344 .verify_read = xfs_attr3_leaf_read_verify,
345 .verify_write = xfs_attr3_leaf_write_verify,
346 .verify_struct = xfs_attr3_leaf_verify,
351 struct xfs_trans *tp,
352 struct xfs_inode *dp,
354 xfs_daddr_t mappedbno,
355 struct xfs_buf **bpp)
359 err = xfs_da_read_buf(tp, dp, bno, mappedbno, bpp,
360 XFS_ATTR_FORK, &xfs_attr3_leaf_buf_ops);
361 if (!err && tp && *bpp)
362 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF);
366 /*========================================================================
367 * Namespace helper routines
368 *========================================================================*/
371 * If namespace bits don't match return 0.
372 * If all match then return 1.
375 xfs_attr_namesp_match(int arg_flags, int ondisk_flags)
377 return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags);
381 /*========================================================================
382 * External routines when attribute fork size < XFS_LITINO(mp).
383 *========================================================================*/
386 * Query whether the requested number of additional bytes of extended
387 * attribute space will be able to fit inline.
389 * Returns zero if not, else the di_forkoff fork offset to be used in the
390 * literal area for attribute data once the new bytes have been added.
392 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
393 * special case for dev/uuid inodes, they have fixed size data forks.
396 xfs_attr_shortform_bytesfit(xfs_inode_t *dp, int bytes)
399 int minforkoff; /* lower limit on valid forkoff locations */
400 int maxforkoff; /* upper limit on valid forkoff locations */
402 xfs_mount_t *mp = dp->i_mount;
405 offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3;
407 if (dp->i_d.di_format == XFS_DINODE_FMT_DEV) {
408 minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
409 return (offset >= minforkoff) ? minforkoff : 0;
413 * If the requested numbers of bytes is smaller or equal to the
414 * current attribute fork size we can always proceed.
416 * Note that if_bytes in the data fork might actually be larger than
417 * the current data fork size is due to delalloc extents. In that
418 * case either the extent count will go down when they are converted
419 * to real extents, or the delalloc conversion will take care of the
420 * literal area rebalancing.
422 if (bytes <= XFS_IFORK_ASIZE(dp))
423 return dp->i_d.di_forkoff;
426 * For attr2 we can try to move the forkoff if there is space in the
427 * literal area, but for the old format we are done if there is no
428 * space in the fixed attribute fork.
430 if (!(mp->m_flags & XFS_MOUNT_ATTR2))
433 dsize = dp->i_df.if_bytes;
435 switch (dp->i_d.di_format) {
436 case XFS_DINODE_FMT_EXTENTS:
438 * If there is no attr fork and the data fork is extents,
439 * determine if creating the default attr fork will result
440 * in the extents form migrating to btree. If so, the
441 * minimum offset only needs to be the space required for
444 if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
445 xfs_default_attroffset(dp))
446 dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
448 case XFS_DINODE_FMT_BTREE:
450 * If we have a data btree then keep forkoff if we have one,
451 * otherwise we are adding a new attr, so then we set
452 * minforkoff to where the btree root can finish so we have
453 * plenty of room for attrs
455 if (dp->i_d.di_forkoff) {
456 if (offset < dp->i_d.di_forkoff)
458 return dp->i_d.di_forkoff;
460 dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot);
465 * A data fork btree root must have space for at least
466 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
468 minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
469 minforkoff = roundup(minforkoff, 8) >> 3;
471 /* attr fork btree root can have at least this many key/ptr pairs */
472 maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) -
473 XFS_BMDR_SPACE_CALC(MINABTPTRS);
474 maxforkoff = maxforkoff >> 3; /* rounded down */
476 if (offset >= maxforkoff)
478 if (offset >= minforkoff)
484 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
487 xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp)
489 if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
490 !(xfs_sb_version_hasattr2(&mp->m_sb))) {
491 spin_lock(&mp->m_sb_lock);
492 if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
493 xfs_sb_version_addattr2(&mp->m_sb);
494 spin_unlock(&mp->m_sb_lock);
497 spin_unlock(&mp->m_sb_lock);
502 * Create the initial contents of a shortform attribute list.
505 xfs_attr_shortform_create(xfs_da_args_t *args)
507 xfs_attr_sf_hdr_t *hdr;
511 trace_xfs_attr_sf_create(args);
517 ASSERT(ifp->if_bytes == 0);
518 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) {
519 ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */
520 dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL;
521 ifp->if_flags |= XFS_IFINLINE;
523 ASSERT(ifp->if_flags & XFS_IFINLINE);
525 xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
526 hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data;
528 hdr->totsize = cpu_to_be16(sizeof(*hdr));
529 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
533 * Add a name/value pair to the shortform attribute list.
534 * Overflow from the inode has already been checked for.
537 xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
539 xfs_attr_shortform_t *sf;
540 xfs_attr_sf_entry_t *sfe;
546 trace_xfs_attr_sf_add(args);
550 dp->i_d.di_forkoff = forkoff;
553 ASSERT(ifp->if_flags & XFS_IFINLINE);
554 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
556 for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
558 if (sfe->namelen != args->namelen)
560 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
562 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
568 offset = (char *)sfe - (char *)sf;
569 size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
570 xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
571 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
572 sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset);
574 sfe->namelen = args->namelen;
575 sfe->valuelen = args->valuelen;
576 sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
577 memcpy(sfe->nameval, args->name, args->namelen);
578 memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
580 be16_add_cpu(&sf->hdr.totsize, size);
581 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
583 xfs_sbversion_add_attr2(mp, args->trans);
587 * After the last attribute is removed revert to original inode format,
588 * making all literal area available to the data fork once more.
591 xfs_attr_fork_remove(
592 struct xfs_inode *ip,
593 struct xfs_trans *tp)
595 xfs_idestroy_fork(ip, XFS_ATTR_FORK);
596 ip->i_d.di_forkoff = 0;
597 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
599 ASSERT(ip->i_d.di_anextents == 0);
600 ASSERT(ip->i_afp == NULL);
602 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
606 * Remove an attribute from the shortform attribute list structure.
609 xfs_attr_shortform_remove(xfs_da_args_t *args)
611 xfs_attr_shortform_t *sf;
612 xfs_attr_sf_entry_t *sfe;
613 int base, size=0, end, totsize, i;
617 trace_xfs_attr_sf_remove(args);
621 base = sizeof(xfs_attr_sf_hdr_t);
622 sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
625 for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
627 size = XFS_ATTR_SF_ENTSIZE(sfe);
628 if (sfe->namelen != args->namelen)
630 if (memcmp(sfe->nameval, args->name, args->namelen) != 0)
632 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
640 * Fix up the attribute fork data, covering the hole
643 totsize = be16_to_cpu(sf->hdr.totsize);
645 memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
647 be16_add_cpu(&sf->hdr.totsize, -size);
650 * Fix up the start offset of the attribute fork
653 if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
654 (mp->m_flags & XFS_MOUNT_ATTR2) &&
655 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
656 !(args->op_flags & XFS_DA_OP_ADDNAME)) {
657 xfs_attr_fork_remove(dp, args->trans);
659 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
660 dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
661 ASSERT(dp->i_d.di_forkoff);
662 ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
663 (args->op_flags & XFS_DA_OP_ADDNAME) ||
664 !(mp->m_flags & XFS_MOUNT_ATTR2) ||
665 dp->i_d.di_format == XFS_DINODE_FMT_BTREE);
666 xfs_trans_log_inode(args->trans, dp,
667 XFS_ILOG_CORE | XFS_ILOG_ADATA);
670 xfs_sbversion_add_attr2(mp, args->trans);
676 * Look up a name in a shortform attribute list structure.
680 xfs_attr_shortform_lookup(xfs_da_args_t *args)
682 xfs_attr_shortform_t *sf;
683 xfs_attr_sf_entry_t *sfe;
687 trace_xfs_attr_sf_lookup(args);
689 ifp = args->dp->i_afp;
690 ASSERT(ifp->if_flags & XFS_IFINLINE);
691 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
693 for (i = 0; i < sf->hdr.count;
694 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
695 if (sfe->namelen != args->namelen)
697 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
699 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
707 * Look up a name in a shortform attribute list structure.
711 xfs_attr_shortform_getvalue(xfs_da_args_t *args)
713 xfs_attr_shortform_t *sf;
714 xfs_attr_sf_entry_t *sfe;
717 ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE);
718 sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data;
720 for (i = 0; i < sf->hdr.count;
721 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
722 if (sfe->namelen != args->namelen)
724 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
726 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
728 if (args->flags & ATTR_KERNOVAL) {
729 args->valuelen = sfe->valuelen;
732 if (args->valuelen < sfe->valuelen) {
733 args->valuelen = sfe->valuelen;
736 args->valuelen = sfe->valuelen;
737 memcpy(args->value, &sfe->nameval[args->namelen],
745 * Convert from using the shortform to the leaf. On success, return the
746 * buffer so that we can keep it locked until we're totally done with it.
749 xfs_attr_shortform_to_leaf(
750 struct xfs_da_args *args,
751 struct xfs_buf **leaf_bp)
754 xfs_attr_shortform_t *sf;
755 xfs_attr_sf_entry_t *sfe;
763 trace_xfs_attr_sf_to_leaf(args);
767 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
768 size = be16_to_cpu(sf->hdr.totsize);
769 tmpbuffer = kmem_alloc(size, KM_SLEEP);
770 ASSERT(tmpbuffer != NULL);
771 memcpy(tmpbuffer, ifp->if_u1.if_data, size);
772 sf = (xfs_attr_shortform_t *)tmpbuffer;
774 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
775 xfs_bmap_local_to_extents_empty(dp, XFS_ATTR_FORK);
778 error = xfs_da_grow_inode(args, &blkno);
781 * If we hit an IO error middle of the transaction inside
782 * grow_inode(), we may have inconsistent data. Bail out.
786 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
787 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
792 error = xfs_attr3_leaf_create(args, blkno, &bp);
794 error = xfs_da_shrink_inode(args, 0, bp);
798 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
799 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
803 memset((char *)&nargs, 0, sizeof(nargs));
805 nargs.geo = args->geo;
806 nargs.firstblock = args->firstblock;
807 nargs.dfops = args->dfops;
808 nargs.total = args->total;
809 nargs.whichfork = XFS_ATTR_FORK;
810 nargs.trans = args->trans;
811 nargs.op_flags = XFS_DA_OP_OKNOENT;
814 for (i = 0; i < sf->hdr.count; i++) {
815 nargs.name = sfe->nameval;
816 nargs.namelen = sfe->namelen;
817 nargs.value = &sfe->nameval[nargs.namelen];
818 nargs.valuelen = sfe->valuelen;
819 nargs.hashval = xfs_da_hashname(sfe->nameval,
821 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
822 error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */
823 ASSERT(error == -ENOATTR);
824 error = xfs_attr3_leaf_add(bp, &nargs);
825 ASSERT(error != -ENOSPC);
828 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
833 kmem_free(tmpbuffer);
838 * Check a leaf attribute block to see if all the entries would fit into
839 * a shortform attribute list.
842 xfs_attr_shortform_allfit(
844 struct xfs_inode *dp)
846 struct xfs_attr_leafblock *leaf;
847 struct xfs_attr_leaf_entry *entry;
848 xfs_attr_leaf_name_local_t *name_loc;
849 struct xfs_attr3_icleaf_hdr leafhdr;
852 struct xfs_mount *mp = bp->b_target->bt_mount;
855 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf);
856 entry = xfs_attr3_leaf_entryp(leaf);
858 bytes = sizeof(struct xfs_attr_sf_hdr);
859 for (i = 0; i < leafhdr.count; entry++, i++) {
860 if (entry->flags & XFS_ATTR_INCOMPLETE)
861 continue; /* don't copy partial entries */
862 if (!(entry->flags & XFS_ATTR_LOCAL))
864 name_loc = xfs_attr3_leaf_name_local(leaf, i);
865 if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
867 if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
869 bytes += sizeof(struct xfs_attr_sf_entry) - 1
871 + be16_to_cpu(name_loc->valuelen);
873 if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
874 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
875 (bytes == sizeof(struct xfs_attr_sf_hdr)))
877 return xfs_attr_shortform_bytesfit(dp, bytes);
880 /* Verify the consistency of an inline attribute fork. */
882 xfs_attr_shortform_verify(
883 struct xfs_inode *ip)
885 struct xfs_attr_shortform *sfp;
886 struct xfs_attr_sf_entry *sfep;
887 struct xfs_attr_sf_entry *next_sfep;
889 struct xfs_ifork *ifp;
893 ASSERT(ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL);
894 ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK);
895 sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data;
896 size = ifp->if_bytes;
899 * Give up if the attribute is way too short.
901 if (size < sizeof(struct xfs_attr_sf_hdr))
902 return __this_address;
904 endp = (char *)sfp + size;
906 /* Check all reported entries */
907 sfep = &sfp->list[0];
908 for (i = 0; i < sfp->hdr.count; i++) {
910 * struct xfs_attr_sf_entry has a variable length.
911 * Check the fixed-offset parts of the structure are
912 * within the data buffer.
914 if (((char *)sfep + sizeof(*sfep)) >= endp)
915 return __this_address;
917 /* Don't allow names with known bad length. */
918 if (sfep->namelen == 0)
919 return __this_address;
922 * Check that the variable-length part of the structure is
923 * within the data buffer. The next entry starts after the
924 * name component, so nextentry is an acceptable test.
926 next_sfep = XFS_ATTR_SF_NEXTENTRY(sfep);
927 if ((char *)next_sfep > endp)
928 return __this_address;
931 * Check for unknown flags. Short form doesn't support
932 * the incomplete or local bits, so we can use the namespace
935 if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK)
936 return __this_address;
939 * Check for invalid namespace combinations. We only allow
940 * one namespace flag per xattr, so we can just count the
941 * bits (i.e. hweight) here.
943 if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1)
944 return __this_address;
948 if ((void *)sfep != (void *)endp)
949 return __this_address;
955 * Convert a leaf attribute list to shortform attribute list
958 xfs_attr3_leaf_to_shortform(
960 struct xfs_da_args *args,
963 struct xfs_attr_leafblock *leaf;
964 struct xfs_attr3_icleaf_hdr ichdr;
965 struct xfs_attr_leaf_entry *entry;
966 struct xfs_attr_leaf_name_local *name_loc;
967 struct xfs_da_args nargs;
968 struct xfs_inode *dp = args->dp;
973 trace_xfs_attr_leaf_to_sf(args);
975 tmpbuffer = kmem_alloc(args->geo->blksize, KM_SLEEP);
979 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
981 leaf = (xfs_attr_leafblock_t *)tmpbuffer;
982 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
983 entry = xfs_attr3_leaf_entryp(leaf);
985 /* XXX (dgc): buffer is about to be marked stale - why zero it? */
986 memset(bp->b_addr, 0, args->geo->blksize);
989 * Clean out the prior contents of the attribute list.
991 error = xfs_da_shrink_inode(args, 0, bp);
996 ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
997 ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
998 xfs_attr_fork_remove(dp, args->trans);
1002 xfs_attr_shortform_create(args);
1005 * Copy the attributes
1007 memset((char *)&nargs, 0, sizeof(nargs));
1008 nargs.geo = args->geo;
1010 nargs.firstblock = args->firstblock;
1011 nargs.dfops = args->dfops;
1012 nargs.total = args->total;
1013 nargs.whichfork = XFS_ATTR_FORK;
1014 nargs.trans = args->trans;
1015 nargs.op_flags = XFS_DA_OP_OKNOENT;
1017 for (i = 0; i < ichdr.count; entry++, i++) {
1018 if (entry->flags & XFS_ATTR_INCOMPLETE)
1019 continue; /* don't copy partial entries */
1020 if (!entry->nameidx)
1022 ASSERT(entry->flags & XFS_ATTR_LOCAL);
1023 name_loc = xfs_attr3_leaf_name_local(leaf, i);
1024 nargs.name = name_loc->nameval;
1025 nargs.namelen = name_loc->namelen;
1026 nargs.value = &name_loc->nameval[nargs.namelen];
1027 nargs.valuelen = be16_to_cpu(name_loc->valuelen);
1028 nargs.hashval = be32_to_cpu(entry->hashval);
1029 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
1030 xfs_attr_shortform_add(&nargs, forkoff);
1035 kmem_free(tmpbuffer);
1040 * Convert from using a single leaf to a root node and a leaf.
1043 xfs_attr3_leaf_to_node(
1044 struct xfs_da_args *args)
1046 struct xfs_attr_leafblock *leaf;
1047 struct xfs_attr3_icleaf_hdr icleafhdr;
1048 struct xfs_attr_leaf_entry *entries;
1049 struct xfs_da_node_entry *btree;
1050 struct xfs_da3_icnode_hdr icnodehdr;
1051 struct xfs_da_intnode *node;
1052 struct xfs_inode *dp = args->dp;
1053 struct xfs_mount *mp = dp->i_mount;
1054 struct xfs_buf *bp1 = NULL;
1055 struct xfs_buf *bp2 = NULL;
1059 trace_xfs_attr_leaf_to_node(args);
1061 error = xfs_da_grow_inode(args, &blkno);
1064 error = xfs_attr3_leaf_read(args->trans, dp, 0, -1, &bp1);
1068 error = xfs_da_get_buf(args->trans, dp, blkno, -1, &bp2, XFS_ATTR_FORK);
1072 /* copy leaf to new buffer, update identifiers */
1073 xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF);
1074 bp2->b_ops = bp1->b_ops;
1075 memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize);
1076 if (xfs_sb_version_hascrc(&mp->m_sb)) {
1077 struct xfs_da3_blkinfo *hdr3 = bp2->b_addr;
1078 hdr3->blkno = cpu_to_be64(bp2->b_bn);
1080 xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1);
1083 * Set up the new root node.
1085 error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
1089 dp->d_ops->node_hdr_from_disk(&icnodehdr, node);
1090 btree = dp->d_ops->node_tree_p(node);
1093 xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf);
1094 entries = xfs_attr3_leaf_entryp(leaf);
1096 /* both on-disk, don't endian-flip twice */
1097 btree[0].hashval = entries[icleafhdr.count - 1].hashval;
1098 btree[0].before = cpu_to_be32(blkno);
1099 icnodehdr.count = 1;
1100 dp->d_ops->node_hdr_to_disk(node, &icnodehdr);
1101 xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1);
1107 /*========================================================================
1108 * Routines used for growing the Btree.
1109 *========================================================================*/
1112 * Create the initial contents of a leaf attribute list
1113 * or a leaf in a node attribute list.
1116 xfs_attr3_leaf_create(
1117 struct xfs_da_args *args,
1119 struct xfs_buf **bpp)
1121 struct xfs_attr_leafblock *leaf;
1122 struct xfs_attr3_icleaf_hdr ichdr;
1123 struct xfs_inode *dp = args->dp;
1124 struct xfs_mount *mp = dp->i_mount;
1128 trace_xfs_attr_leaf_create(args);
1130 error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp,
1134 bp->b_ops = &xfs_attr3_leaf_buf_ops;
1135 xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF);
1137 memset(leaf, 0, args->geo->blksize);
1139 memset(&ichdr, 0, sizeof(ichdr));
1140 ichdr.firstused = args->geo->blksize;
1142 if (xfs_sb_version_hascrc(&mp->m_sb)) {
1143 struct xfs_da3_blkinfo *hdr3 = bp->b_addr;
1145 ichdr.magic = XFS_ATTR3_LEAF_MAGIC;
1147 hdr3->blkno = cpu_to_be64(bp->b_bn);
1148 hdr3->owner = cpu_to_be64(dp->i_ino);
1149 uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid);
1151 ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr);
1153 ichdr.magic = XFS_ATTR_LEAF_MAGIC;
1154 ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr);
1156 ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base;
1158 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
1159 xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1);
1166 * Split the leaf node, rebalance, then add the new entry.
1169 xfs_attr3_leaf_split(
1170 struct xfs_da_state *state,
1171 struct xfs_da_state_blk *oldblk,
1172 struct xfs_da_state_blk *newblk)
1177 trace_xfs_attr_leaf_split(state->args);
1180 * Allocate space for a new leaf node.
1182 ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
1183 error = xfs_da_grow_inode(state->args, &blkno);
1186 error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp);
1189 newblk->blkno = blkno;
1190 newblk->magic = XFS_ATTR_LEAF_MAGIC;
1193 * Rebalance the entries across the two leaves.
1194 * NOTE: rebalance() currently depends on the 2nd block being empty.
1196 xfs_attr3_leaf_rebalance(state, oldblk, newblk);
1197 error = xfs_da3_blk_link(state, oldblk, newblk);
1202 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
1203 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1204 * "new" attrs info. Will need the "old" info to remove it later.
1206 * Insert the "new" entry in the correct block.
1208 if (state->inleaf) {
1209 trace_xfs_attr_leaf_add_old(state->args);
1210 error = xfs_attr3_leaf_add(oldblk->bp, state->args);
1212 trace_xfs_attr_leaf_add_new(state->args);
1213 error = xfs_attr3_leaf_add(newblk->bp, state->args);
1217 * Update last hashval in each block since we added the name.
1219 oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
1220 newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
1225 * Add a name to the leaf attribute list structure.
1230 struct xfs_da_args *args)
1232 struct xfs_attr_leafblock *leaf;
1233 struct xfs_attr3_icleaf_hdr ichdr;
1240 trace_xfs_attr_leaf_add(args);
1243 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
1244 ASSERT(args->index >= 0 && args->index <= ichdr.count);
1245 entsize = xfs_attr_leaf_newentsize(args, NULL);
1248 * Search through freemap for first-fit on new name length.
1249 * (may need to figure in size of entry struct too)
1251 tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t)
1252 + xfs_attr3_leaf_hdr_size(leaf);
1253 for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) {
1254 if (tablesize > ichdr.firstused) {
1255 sum += ichdr.freemap[i].size;
1258 if (!ichdr.freemap[i].size)
1259 continue; /* no space in this map */
1261 if (ichdr.freemap[i].base < ichdr.firstused)
1262 tmp += sizeof(xfs_attr_leaf_entry_t);
1263 if (ichdr.freemap[i].size >= tmp) {
1264 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i);
1267 sum += ichdr.freemap[i].size;
1271 * If there are no holes in the address space of the block,
1272 * and we don't have enough freespace, then compaction will do us
1273 * no good and we should just give up.
1275 if (!ichdr.holes && sum < entsize)
1279 * Compact the entries to coalesce free space.
1280 * This may change the hdr->count via dropping INCOMPLETE entries.
1282 xfs_attr3_leaf_compact(args, &ichdr, bp);
1285 * After compaction, the block is guaranteed to have only one
1286 * free region, in freemap[0]. If it is not big enough, give up.
1288 if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) {
1293 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0);
1296 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
1297 xfs_trans_log_buf(args->trans, bp,
1298 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1299 xfs_attr3_leaf_hdr_size(leaf)));
1304 * Add a name to a leaf attribute list structure.
1307 xfs_attr3_leaf_add_work(
1309 struct xfs_attr3_icleaf_hdr *ichdr,
1310 struct xfs_da_args *args,
1313 struct xfs_attr_leafblock *leaf;
1314 struct xfs_attr_leaf_entry *entry;
1315 struct xfs_attr_leaf_name_local *name_loc;
1316 struct xfs_attr_leaf_name_remote *name_rmt;
1317 struct xfs_mount *mp;
1321 trace_xfs_attr_leaf_add_work(args);
1324 ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE);
1325 ASSERT(args->index >= 0 && args->index <= ichdr->count);
1328 * Force open some space in the entry array and fill it in.
1330 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1331 if (args->index < ichdr->count) {
1332 tmp = ichdr->count - args->index;
1333 tmp *= sizeof(xfs_attr_leaf_entry_t);
1334 memmove(entry + 1, entry, tmp);
1335 xfs_trans_log_buf(args->trans, bp,
1336 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1341 * Allocate space for the new string (at the end of the run).
1343 mp = args->trans->t_mountp;
1344 ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize);
1345 ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0);
1346 ASSERT(ichdr->freemap[mapindex].size >=
1347 xfs_attr_leaf_newentsize(args, NULL));
1348 ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize);
1349 ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0);
1351 ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp);
1353 entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base +
1354 ichdr->freemap[mapindex].size);
1355 entry->hashval = cpu_to_be32(args->hashval);
1356 entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
1357 entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
1358 if (args->op_flags & XFS_DA_OP_RENAME) {
1359 entry->flags |= XFS_ATTR_INCOMPLETE;
1360 if ((args->blkno2 == args->blkno) &&
1361 (args->index2 <= args->index)) {
1365 xfs_trans_log_buf(args->trans, bp,
1366 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
1367 ASSERT((args->index == 0) ||
1368 (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
1369 ASSERT((args->index == ichdr->count - 1) ||
1370 (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
1373 * For "remote" attribute values, simply note that we need to
1374 * allocate space for the "remote" value. We can't actually
1375 * allocate the extents in this transaction, and we can't decide
1376 * which blocks they should be as we might allocate more blocks
1377 * as part of this transaction (a split operation for example).
1379 if (entry->flags & XFS_ATTR_LOCAL) {
1380 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
1381 name_loc->namelen = args->namelen;
1382 name_loc->valuelen = cpu_to_be16(args->valuelen);
1383 memcpy((char *)name_loc->nameval, args->name, args->namelen);
1384 memcpy((char *)&name_loc->nameval[args->namelen], args->value,
1385 be16_to_cpu(name_loc->valuelen));
1387 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
1388 name_rmt->namelen = args->namelen;
1389 memcpy((char *)name_rmt->name, args->name, args->namelen);
1390 entry->flags |= XFS_ATTR_INCOMPLETE;
1392 name_rmt->valuelen = 0;
1393 name_rmt->valueblk = 0;
1395 args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen);
1396 args->rmtvaluelen = args->valuelen;
1398 xfs_trans_log_buf(args->trans, bp,
1399 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
1400 xfs_attr_leaf_entsize(leaf, args->index)));
1403 * Update the control info for this leaf node
1405 if (be16_to_cpu(entry->nameidx) < ichdr->firstused)
1406 ichdr->firstused = be16_to_cpu(entry->nameidx);
1408 ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t)
1409 + xfs_attr3_leaf_hdr_size(leaf));
1410 tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t)
1411 + xfs_attr3_leaf_hdr_size(leaf);
1413 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
1414 if (ichdr->freemap[i].base == tmp) {
1415 ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t);
1416 ichdr->freemap[i].size -= sizeof(xfs_attr_leaf_entry_t);
1419 ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index);
1424 * Garbage collect a leaf attribute list block by copying it to a new buffer.
1427 xfs_attr3_leaf_compact(
1428 struct xfs_da_args *args,
1429 struct xfs_attr3_icleaf_hdr *ichdr_dst,
1432 struct xfs_attr_leafblock *leaf_src;
1433 struct xfs_attr_leafblock *leaf_dst;
1434 struct xfs_attr3_icleaf_hdr ichdr_src;
1435 struct xfs_trans *trans = args->trans;
1438 trace_xfs_attr_leaf_compact(args);
1440 tmpbuffer = kmem_alloc(args->geo->blksize, KM_SLEEP);
1441 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
1442 memset(bp->b_addr, 0, args->geo->blksize);
1443 leaf_src = (xfs_attr_leafblock_t *)tmpbuffer;
1444 leaf_dst = bp->b_addr;
1447 * Copy the on-disk header back into the destination buffer to ensure
1448 * all the information in the header that is not part of the incore
1449 * header structure is preserved.
1451 memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src));
1453 /* Initialise the incore headers */
1454 ichdr_src = *ichdr_dst; /* struct copy */
1455 ichdr_dst->firstused = args->geo->blksize;
1456 ichdr_dst->usedbytes = 0;
1457 ichdr_dst->count = 0;
1458 ichdr_dst->holes = 0;
1459 ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src);
1460 ichdr_dst->freemap[0].size = ichdr_dst->firstused -
1461 ichdr_dst->freemap[0].base;
1463 /* write the header back to initialise the underlying buffer */
1464 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst);
1467 * Copy all entry's in the same (sorted) order,
1468 * but allocate name/value pairs packed and in sequence.
1470 xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0,
1471 leaf_dst, ichdr_dst, 0, ichdr_src.count);
1473 * this logs the entire buffer, but the caller must write the header
1474 * back to the buffer when it is finished modifying it.
1476 xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1);
1478 kmem_free(tmpbuffer);
1482 * Compare two leaf blocks "order".
1483 * Return 0 unless leaf2 should go before leaf1.
1486 xfs_attr3_leaf_order(
1487 struct xfs_buf *leaf1_bp,
1488 struct xfs_attr3_icleaf_hdr *leaf1hdr,
1489 struct xfs_buf *leaf2_bp,
1490 struct xfs_attr3_icleaf_hdr *leaf2hdr)
1492 struct xfs_attr_leaf_entry *entries1;
1493 struct xfs_attr_leaf_entry *entries2;
1495 entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr);
1496 entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr);
1497 if (leaf1hdr->count > 0 && leaf2hdr->count > 0 &&
1498 ((be32_to_cpu(entries2[0].hashval) <
1499 be32_to_cpu(entries1[0].hashval)) ||
1500 (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) <
1501 be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) {
1508 xfs_attr_leaf_order(
1509 struct xfs_buf *leaf1_bp,
1510 struct xfs_buf *leaf2_bp)
1512 struct xfs_attr3_icleaf_hdr ichdr1;
1513 struct xfs_attr3_icleaf_hdr ichdr2;
1514 struct xfs_mount *mp = leaf1_bp->b_target->bt_mount;
1516 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr);
1517 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr);
1518 return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2);
1522 * Redistribute the attribute list entries between two leaf nodes,
1523 * taking into account the size of the new entry.
1525 * NOTE: if new block is empty, then it will get the upper half of the
1526 * old block. At present, all (one) callers pass in an empty second block.
1528 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1529 * to match what it is doing in splitting the attribute leaf block. Those
1530 * values are used in "atomic rename" operations on attributes. Note that
1531 * the "new" and "old" values can end up in different blocks.
1534 xfs_attr3_leaf_rebalance(
1535 struct xfs_da_state *state,
1536 struct xfs_da_state_blk *blk1,
1537 struct xfs_da_state_blk *blk2)
1539 struct xfs_da_args *args;
1540 struct xfs_attr_leafblock *leaf1;
1541 struct xfs_attr_leafblock *leaf2;
1542 struct xfs_attr3_icleaf_hdr ichdr1;
1543 struct xfs_attr3_icleaf_hdr ichdr2;
1544 struct xfs_attr_leaf_entry *entries1;
1545 struct xfs_attr_leaf_entry *entries2;
1553 * Set up environment.
1555 ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
1556 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
1557 leaf1 = blk1->bp->b_addr;
1558 leaf2 = blk2->bp->b_addr;
1559 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1);
1560 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2);
1561 ASSERT(ichdr2.count == 0);
1564 trace_xfs_attr_leaf_rebalance(args);
1567 * Check ordering of blocks, reverse if it makes things simpler.
1569 * NOTE: Given that all (current) callers pass in an empty
1570 * second block, this code should never set "swap".
1573 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) {
1574 struct xfs_da_state_blk *tmp_blk;
1575 struct xfs_attr3_icleaf_hdr tmp_ichdr;
1581 /* struct copies to swap them rather than reconverting */
1586 leaf1 = blk1->bp->b_addr;
1587 leaf2 = blk2->bp->b_addr;
1592 * Examine entries until we reduce the absolute difference in
1593 * byte usage between the two blocks to a minimum. Then get
1594 * the direction to copy and the number of elements to move.
1596 * "inleaf" is true if the new entry should be inserted into blk1.
1597 * If "swap" is also true, then reverse the sense of "inleaf".
1599 state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1,
1603 state->inleaf = !state->inleaf;
1606 * Move any entries required from leaf to leaf:
1608 if (count < ichdr1.count) {
1610 * Figure the total bytes to be added to the destination leaf.
1612 /* number entries being moved */
1613 count = ichdr1.count - count;
1614 space = ichdr1.usedbytes - totallen;
1615 space += count * sizeof(xfs_attr_leaf_entry_t);
1618 * leaf2 is the destination, compact it if it looks tight.
1620 max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1621 max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t);
1623 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp);
1626 * Move high entries from leaf1 to low end of leaf2.
1628 xfs_attr3_leaf_moveents(args, leaf1, &ichdr1,
1629 ichdr1.count - count, leaf2, &ichdr2, 0, count);
1631 } else if (count > ichdr1.count) {
1633 * I assert that since all callers pass in an empty
1634 * second buffer, this code should never execute.
1639 * Figure the total bytes to be added to the destination leaf.
1641 /* number entries being moved */
1642 count -= ichdr1.count;
1643 space = totallen - ichdr1.usedbytes;
1644 space += count * sizeof(xfs_attr_leaf_entry_t);
1647 * leaf1 is the destination, compact it if it looks tight.
1649 max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1650 max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t);
1652 xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp);
1655 * Move low entries from leaf2 to high end of leaf1.
1657 xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1,
1658 ichdr1.count, count);
1661 xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1);
1662 xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2);
1663 xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1);
1664 xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1);
1667 * Copy out last hashval in each block for B-tree code.
1669 entries1 = xfs_attr3_leaf_entryp(leaf1);
1670 entries2 = xfs_attr3_leaf_entryp(leaf2);
1671 blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval);
1672 blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval);
1675 * Adjust the expected index for insertion.
1676 * NOTE: this code depends on the (current) situation that the
1677 * second block was originally empty.
1679 * If the insertion point moved to the 2nd block, we must adjust
1680 * the index. We must also track the entry just following the
1681 * new entry for use in an "atomic rename" operation, that entry
1682 * is always the "old" entry and the "new" entry is what we are
1683 * inserting. The index/blkno fields refer to the "old" entry,
1684 * while the index2/blkno2 fields refer to the "new" entry.
1686 if (blk1->index > ichdr1.count) {
1687 ASSERT(state->inleaf == 0);
1688 blk2->index = blk1->index - ichdr1.count;
1689 args->index = args->index2 = blk2->index;
1690 args->blkno = args->blkno2 = blk2->blkno;
1691 } else if (blk1->index == ichdr1.count) {
1692 if (state->inleaf) {
1693 args->index = blk1->index;
1694 args->blkno = blk1->blkno;
1696 args->blkno2 = blk2->blkno;
1699 * On a double leaf split, the original attr location
1700 * is already stored in blkno2/index2, so don't
1701 * overwrite it overwise we corrupt the tree.
1703 blk2->index = blk1->index - ichdr1.count;
1704 args->index = blk2->index;
1705 args->blkno = blk2->blkno;
1706 if (!state->extravalid) {
1708 * set the new attr location to match the old
1709 * one and let the higher level split code
1710 * decide where in the leaf to place it.
1712 args->index2 = blk2->index;
1713 args->blkno2 = blk2->blkno;
1717 ASSERT(state->inleaf == 1);
1718 args->index = args->index2 = blk1->index;
1719 args->blkno = args->blkno2 = blk1->blkno;
1724 * Examine entries until we reduce the absolute difference in
1725 * byte usage between the two blocks to a minimum.
1726 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1727 * GROT: there will always be enough room in either block for a new entry.
1728 * GROT: Do a double-split for this case?
1731 xfs_attr3_leaf_figure_balance(
1732 struct xfs_da_state *state,
1733 struct xfs_da_state_blk *blk1,
1734 struct xfs_attr3_icleaf_hdr *ichdr1,
1735 struct xfs_da_state_blk *blk2,
1736 struct xfs_attr3_icleaf_hdr *ichdr2,
1740 struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr;
1741 struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr;
1742 struct xfs_attr_leaf_entry *entry;
1753 * Examine entries until we reduce the absolute difference in
1754 * byte usage between the two blocks to a minimum.
1756 max = ichdr1->count + ichdr2->count;
1757 half = (max + 1) * sizeof(*entry);
1758 half += ichdr1->usedbytes + ichdr2->usedbytes +
1759 xfs_attr_leaf_newentsize(state->args, NULL);
1761 lastdelta = state->args->geo->blksize;
1762 entry = xfs_attr3_leaf_entryp(leaf1);
1763 for (count = index = 0; count < max; entry++, index++, count++) {
1765 #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1767 * The new entry is in the first block, account for it.
1769 if (count == blk1->index) {
1770 tmp = totallen + sizeof(*entry) +
1771 xfs_attr_leaf_newentsize(state->args, NULL);
1772 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1774 lastdelta = XFS_ATTR_ABS(half - tmp);
1780 * Wrap around into the second block if necessary.
1782 if (count == ichdr1->count) {
1784 entry = xfs_attr3_leaf_entryp(leaf1);
1789 * Figure out if next leaf entry would be too much.
1791 tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
1793 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1795 lastdelta = XFS_ATTR_ABS(half - tmp);
1801 * Calculate the number of usedbytes that will end up in lower block.
1802 * If new entry not in lower block, fix up the count.
1804 totallen -= count * sizeof(*entry);
1806 totallen -= sizeof(*entry) +
1807 xfs_attr_leaf_newentsize(state->args, NULL);
1811 *usedbytesarg = totallen;
1815 /*========================================================================
1816 * Routines used for shrinking the Btree.
1817 *========================================================================*/
1820 * Check a leaf block and its neighbors to see if the block should be
1821 * collapsed into one or the other neighbor. Always keep the block
1822 * with the smaller block number.
1823 * If the current block is over 50% full, don't try to join it, return 0.
1824 * If the block is empty, fill in the state structure and return 2.
1825 * If it can be collapsed, fill in the state structure and return 1.
1826 * If nothing can be done, return 0.
1828 * GROT: allow for INCOMPLETE entries in calculation.
1831 xfs_attr3_leaf_toosmall(
1832 struct xfs_da_state *state,
1835 struct xfs_attr_leafblock *leaf;
1836 struct xfs_da_state_blk *blk;
1837 struct xfs_attr3_icleaf_hdr ichdr;
1846 trace_xfs_attr_leaf_toosmall(state->args);
1849 * Check for the degenerate case of the block being over 50% full.
1850 * If so, it's not worth even looking to see if we might be able
1851 * to coalesce with a sibling.
1853 blk = &state->path.blk[ state->path.active-1 ];
1854 leaf = blk->bp->b_addr;
1855 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf);
1856 bytes = xfs_attr3_leaf_hdr_size(leaf) +
1857 ichdr.count * sizeof(xfs_attr_leaf_entry_t) +
1859 if (bytes > (state->args->geo->blksize >> 1)) {
1860 *action = 0; /* blk over 50%, don't try to join */
1865 * Check for the degenerate case of the block being empty.
1866 * If the block is empty, we'll simply delete it, no need to
1867 * coalesce it with a sibling block. We choose (arbitrarily)
1868 * to merge with the forward block unless it is NULL.
1870 if (ichdr.count == 0) {
1872 * Make altpath point to the block we want to keep and
1873 * path point to the block we want to drop (this one).
1875 forward = (ichdr.forw != 0);
1876 memcpy(&state->altpath, &state->path, sizeof(state->path));
1877 error = xfs_da3_path_shift(state, &state->altpath, forward,
1890 * Examine each sibling block to see if we can coalesce with
1891 * at least 25% free space to spare. We need to figure out
1892 * whether to merge with the forward or the backward block.
1893 * We prefer coalescing with the lower numbered sibling so as
1894 * to shrink an attribute list over time.
1896 /* start with smaller blk num */
1897 forward = ichdr.forw < ichdr.back;
1898 for (i = 0; i < 2; forward = !forward, i++) {
1899 struct xfs_attr3_icleaf_hdr ichdr2;
1906 error = xfs_attr3_leaf_read(state->args->trans, state->args->dp,
1911 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr);
1913 bytes = state->args->geo->blksize -
1914 (state->args->geo->blksize >> 2) -
1915 ichdr.usedbytes - ichdr2.usedbytes -
1916 ((ichdr.count + ichdr2.count) *
1917 sizeof(xfs_attr_leaf_entry_t)) -
1918 xfs_attr3_leaf_hdr_size(leaf);
1920 xfs_trans_brelse(state->args->trans, bp);
1922 break; /* fits with at least 25% to spare */
1930 * Make altpath point to the block we want to keep (the lower
1931 * numbered block) and path point to the block we want to drop.
1933 memcpy(&state->altpath, &state->path, sizeof(state->path));
1934 if (blkno < blk->blkno) {
1935 error = xfs_da3_path_shift(state, &state->altpath, forward,
1938 error = xfs_da3_path_shift(state, &state->path, forward,
1952 * Remove a name from the leaf attribute list structure.
1954 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
1955 * If two leaves are 37% full, when combined they will leave 25% free.
1958 xfs_attr3_leaf_remove(
1960 struct xfs_da_args *args)
1962 struct xfs_attr_leafblock *leaf;
1963 struct xfs_attr3_icleaf_hdr ichdr;
1964 struct xfs_attr_leaf_entry *entry;
1973 trace_xfs_attr_leaf_remove(args);
1976 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
1978 ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8);
1979 ASSERT(args->index >= 0 && args->index < ichdr.count);
1980 ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) +
1981 xfs_attr3_leaf_hdr_size(leaf));
1983 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1985 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
1986 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
1989 * Scan through free region table:
1990 * check for adjacency of free'd entry with an existing one,
1991 * find smallest free region in case we need to replace it,
1992 * adjust any map that borders the entry table,
1994 tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t)
1995 + xfs_attr3_leaf_hdr_size(leaf);
1996 tmp = ichdr.freemap[0].size;
1997 before = after = -1;
1998 smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
1999 entsize = xfs_attr_leaf_entsize(leaf, args->index);
2000 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
2001 ASSERT(ichdr.freemap[i].base < args->geo->blksize);
2002 ASSERT(ichdr.freemap[i].size < args->geo->blksize);
2003 if (ichdr.freemap[i].base == tablesize) {
2004 ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t);
2005 ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t);
2008 if (ichdr.freemap[i].base + ichdr.freemap[i].size ==
2009 be16_to_cpu(entry->nameidx)) {
2011 } else if (ichdr.freemap[i].base ==
2012 (be16_to_cpu(entry->nameidx) + entsize)) {
2014 } else if (ichdr.freemap[i].size < tmp) {
2015 tmp = ichdr.freemap[i].size;
2021 * Coalesce adjacent freemap regions,
2022 * or replace the smallest region.
2024 if ((before >= 0) || (after >= 0)) {
2025 if ((before >= 0) && (after >= 0)) {
2026 ichdr.freemap[before].size += entsize;
2027 ichdr.freemap[before].size += ichdr.freemap[after].size;
2028 ichdr.freemap[after].base = 0;
2029 ichdr.freemap[after].size = 0;
2030 } else if (before >= 0) {
2031 ichdr.freemap[before].size += entsize;
2033 ichdr.freemap[after].base = be16_to_cpu(entry->nameidx);
2034 ichdr.freemap[after].size += entsize;
2038 * Replace smallest region (if it is smaller than free'd entry)
2040 if (ichdr.freemap[smallest].size < entsize) {
2041 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx);
2042 ichdr.freemap[smallest].size = entsize;
2047 * Did we remove the first entry?
2049 if (be16_to_cpu(entry->nameidx) == ichdr.firstused)
2055 * Compress the remaining entries and zero out the removed stuff.
2057 memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize);
2058 ichdr.usedbytes -= entsize;
2059 xfs_trans_log_buf(args->trans, bp,
2060 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
2063 tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t);
2064 memmove(entry, entry + 1, tmp);
2066 xfs_trans_log_buf(args->trans, bp,
2067 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t)));
2069 entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count];
2070 memset(entry, 0, sizeof(xfs_attr_leaf_entry_t));
2073 * If we removed the first entry, re-find the first used byte
2074 * in the name area. Note that if the entry was the "firstused",
2075 * then we don't have a "hole" in our block resulting from
2076 * removing the name.
2079 tmp = args->geo->blksize;
2080 entry = xfs_attr3_leaf_entryp(leaf);
2081 for (i = ichdr.count - 1; i >= 0; entry++, i--) {
2082 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
2083 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
2085 if (be16_to_cpu(entry->nameidx) < tmp)
2086 tmp = be16_to_cpu(entry->nameidx);
2088 ichdr.firstused = tmp;
2089 ASSERT(ichdr.firstused != 0);
2091 ichdr.holes = 1; /* mark as needing compaction */
2093 xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr);
2094 xfs_trans_log_buf(args->trans, bp,
2095 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
2096 xfs_attr3_leaf_hdr_size(leaf)));
2099 * Check if leaf is less than 50% full, caller may want to
2100 * "join" the leaf with a sibling if so.
2102 tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) +
2103 ichdr.count * sizeof(xfs_attr_leaf_entry_t);
2105 return tmp < args->geo->magicpct; /* leaf is < 37% full */
2109 * Move all the attribute list entries from drop_leaf into save_leaf.
2112 xfs_attr3_leaf_unbalance(
2113 struct xfs_da_state *state,
2114 struct xfs_da_state_blk *drop_blk,
2115 struct xfs_da_state_blk *save_blk)
2117 struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr;
2118 struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr;
2119 struct xfs_attr3_icleaf_hdr drophdr;
2120 struct xfs_attr3_icleaf_hdr savehdr;
2121 struct xfs_attr_leaf_entry *entry;
2123 trace_xfs_attr_leaf_unbalance(state->args);
2125 drop_leaf = drop_blk->bp->b_addr;
2126 save_leaf = save_blk->bp->b_addr;
2127 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf);
2128 xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf);
2129 entry = xfs_attr3_leaf_entryp(drop_leaf);
2132 * Save last hashval from dying block for later Btree fixup.
2134 drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval);
2137 * Check if we need a temp buffer, or can we do it in place.
2138 * Note that we don't check "leaf" for holes because we will
2139 * always be dropping it, toosmall() decided that for us already.
2141 if (savehdr.holes == 0) {
2143 * dest leaf has no holes, so we add there. May need
2144 * to make some room in the entry array.
2146 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2147 drop_blk->bp, &drophdr)) {
2148 xfs_attr3_leaf_moveents(state->args,
2149 drop_leaf, &drophdr, 0,
2150 save_leaf, &savehdr, 0,
2153 xfs_attr3_leaf_moveents(state->args,
2154 drop_leaf, &drophdr, 0,
2155 save_leaf, &savehdr,
2156 savehdr.count, drophdr.count);
2160 * Destination has holes, so we make a temporary copy
2161 * of the leaf and add them both to that.
2163 struct xfs_attr_leafblock *tmp_leaf;
2164 struct xfs_attr3_icleaf_hdr tmphdr;
2166 tmp_leaf = kmem_zalloc(state->args->geo->blksize, KM_SLEEP);
2169 * Copy the header into the temp leaf so that all the stuff
2170 * not in the incore header is present and gets copied back in
2171 * once we've moved all the entries.
2173 memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf));
2175 memset(&tmphdr, 0, sizeof(tmphdr));
2176 tmphdr.magic = savehdr.magic;
2177 tmphdr.forw = savehdr.forw;
2178 tmphdr.back = savehdr.back;
2179 tmphdr.firstused = state->args->geo->blksize;
2181 /* write the header to the temp buffer to initialise it */
2182 xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr);
2184 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2185 drop_blk->bp, &drophdr)) {
2186 xfs_attr3_leaf_moveents(state->args,
2187 drop_leaf, &drophdr, 0,
2188 tmp_leaf, &tmphdr, 0,
2190 xfs_attr3_leaf_moveents(state->args,
2191 save_leaf, &savehdr, 0,
2192 tmp_leaf, &tmphdr, tmphdr.count,
2195 xfs_attr3_leaf_moveents(state->args,
2196 save_leaf, &savehdr, 0,
2197 tmp_leaf, &tmphdr, 0,
2199 xfs_attr3_leaf_moveents(state->args,
2200 drop_leaf, &drophdr, 0,
2201 tmp_leaf, &tmphdr, tmphdr.count,
2204 memcpy(save_leaf, tmp_leaf, state->args->geo->blksize);
2205 savehdr = tmphdr; /* struct copy */
2206 kmem_free(tmp_leaf);
2209 xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr);
2210 xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
2211 state->args->geo->blksize - 1);
2214 * Copy out last hashval in each block for B-tree code.
2216 entry = xfs_attr3_leaf_entryp(save_leaf);
2217 save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval);
2220 /*========================================================================
2221 * Routines used for finding things in the Btree.
2222 *========================================================================*/
2225 * Look up a name in a leaf attribute list structure.
2226 * This is the internal routine, it uses the caller's buffer.
2228 * Note that duplicate keys are allowed, but only check within the
2229 * current leaf node. The Btree code must check in adjacent leaf nodes.
2231 * Return in args->index the index into the entry[] array of either
2232 * the found entry, or where the entry should have been (insert before
2235 * Don't change the args->value unless we find the attribute.
2238 xfs_attr3_leaf_lookup_int(
2240 struct xfs_da_args *args)
2242 struct xfs_attr_leafblock *leaf;
2243 struct xfs_attr3_icleaf_hdr ichdr;
2244 struct xfs_attr_leaf_entry *entry;
2245 struct xfs_attr_leaf_entry *entries;
2246 struct xfs_attr_leaf_name_local *name_loc;
2247 struct xfs_attr_leaf_name_remote *name_rmt;
2248 xfs_dahash_t hashval;
2252 trace_xfs_attr_leaf_lookup(args);
2255 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2256 entries = xfs_attr3_leaf_entryp(leaf);
2257 if (ichdr.count >= args->geo->blksize / 8)
2258 return -EFSCORRUPTED;
2261 * Binary search. (note: small blocks will skip this loop)
2263 hashval = args->hashval;
2264 probe = span = ichdr.count / 2;
2265 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) {
2267 if (be32_to_cpu(entry->hashval) < hashval)
2269 else if (be32_to_cpu(entry->hashval) > hashval)
2274 if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count)))
2275 return -EFSCORRUPTED;
2276 if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval))
2277 return -EFSCORRUPTED;
2280 * Since we may have duplicate hashval's, find the first matching
2281 * hashval in the leaf.
2283 while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) {
2287 while (probe < ichdr.count &&
2288 be32_to_cpu(entry->hashval) < hashval) {
2292 if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) {
2293 args->index = probe;
2298 * Duplicate keys may be present, so search all of them for a match.
2300 for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval);
2303 * GROT: Add code to remove incomplete entries.
2306 * If we are looking for INCOMPLETE entries, show only those.
2307 * If we are looking for complete entries, show only those.
2309 if ((args->flags & XFS_ATTR_INCOMPLETE) !=
2310 (entry->flags & XFS_ATTR_INCOMPLETE)) {
2313 if (entry->flags & XFS_ATTR_LOCAL) {
2314 name_loc = xfs_attr3_leaf_name_local(leaf, probe);
2315 if (name_loc->namelen != args->namelen)
2317 if (memcmp(args->name, name_loc->nameval,
2318 args->namelen) != 0)
2320 if (!xfs_attr_namesp_match(args->flags, entry->flags))
2322 args->index = probe;
2325 name_rmt = xfs_attr3_leaf_name_remote(leaf, probe);
2326 if (name_rmt->namelen != args->namelen)
2328 if (memcmp(args->name, name_rmt->name,
2329 args->namelen) != 0)
2331 if (!xfs_attr_namesp_match(args->flags, entry->flags))
2333 args->index = probe;
2334 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
2335 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2336 args->rmtblkcnt = xfs_attr3_rmt_blocks(
2342 args->index = probe;
2347 * Get the value associated with an attribute name from a leaf attribute
2351 xfs_attr3_leaf_getvalue(
2353 struct xfs_da_args *args)
2355 struct xfs_attr_leafblock *leaf;
2356 struct xfs_attr3_icleaf_hdr ichdr;
2357 struct xfs_attr_leaf_entry *entry;
2358 struct xfs_attr_leaf_name_local *name_loc;
2359 struct xfs_attr_leaf_name_remote *name_rmt;
2363 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2364 ASSERT(ichdr.count < args->geo->blksize / 8);
2365 ASSERT(args->index < ichdr.count);
2367 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2368 if (entry->flags & XFS_ATTR_LOCAL) {
2369 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2370 ASSERT(name_loc->namelen == args->namelen);
2371 ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
2372 valuelen = be16_to_cpu(name_loc->valuelen);
2373 if (args->flags & ATTR_KERNOVAL) {
2374 args->valuelen = valuelen;
2377 if (args->valuelen < valuelen) {
2378 args->valuelen = valuelen;
2381 args->valuelen = valuelen;
2382 memcpy(args->value, &name_loc->nameval[args->namelen], valuelen);
2384 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2385 ASSERT(name_rmt->namelen == args->namelen);
2386 ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
2387 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
2388 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
2389 args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount,
2391 if (args->flags & ATTR_KERNOVAL) {
2392 args->valuelen = args->rmtvaluelen;
2395 if (args->valuelen < args->rmtvaluelen) {
2396 args->valuelen = args->rmtvaluelen;
2399 args->valuelen = args->rmtvaluelen;
2404 /*========================================================================
2406 *========================================================================*/
2409 * Move the indicated entries from one leaf to another.
2410 * NOTE: this routine modifies both source and destination leaves.
2414 xfs_attr3_leaf_moveents(
2415 struct xfs_da_args *args,
2416 struct xfs_attr_leafblock *leaf_s,
2417 struct xfs_attr3_icleaf_hdr *ichdr_s,
2419 struct xfs_attr_leafblock *leaf_d,
2420 struct xfs_attr3_icleaf_hdr *ichdr_d,
2424 struct xfs_attr_leaf_entry *entry_s;
2425 struct xfs_attr_leaf_entry *entry_d;
2431 * Check for nothing to do.
2437 * Set up environment.
2439 ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC ||
2440 ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC);
2441 ASSERT(ichdr_s->magic == ichdr_d->magic);
2442 ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8);
2443 ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s))
2444 + xfs_attr3_leaf_hdr_size(leaf_s));
2445 ASSERT(ichdr_d->count < args->geo->blksize / 8);
2446 ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d))
2447 + xfs_attr3_leaf_hdr_size(leaf_d));
2449 ASSERT(start_s < ichdr_s->count);
2450 ASSERT(start_d <= ichdr_d->count);
2451 ASSERT(count <= ichdr_s->count);
2455 * Move the entries in the destination leaf up to make a hole?
2457 if (start_d < ichdr_d->count) {
2458 tmp = ichdr_d->count - start_d;
2459 tmp *= sizeof(xfs_attr_leaf_entry_t);
2460 entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2461 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count];
2462 memmove(entry_d, entry_s, tmp);
2466 * Copy all entry's in the same (sorted) order,
2467 * but allocate attribute info packed and in sequence.
2469 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2470 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2472 for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
2473 ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused);
2474 tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
2477 * Code to drop INCOMPLETE entries. Difficult to use as we
2478 * may also need to change the insertion index. Code turned
2479 * off for 6.2, should be revisited later.
2481 if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
2482 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2483 ichdr_s->usedbytes -= tmp;
2484 ichdr_s->count -= 1;
2485 entry_d--; /* to compensate for ++ in loop hdr */
2487 if ((start_s + i) < offset)
2488 result++; /* insertion index adjustment */
2491 ichdr_d->firstused -= tmp;
2492 /* both on-disk, don't endian flip twice */
2493 entry_d->hashval = entry_s->hashval;
2494 entry_d->nameidx = cpu_to_be16(ichdr_d->firstused);
2495 entry_d->flags = entry_s->flags;
2496 ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
2497 <= args->geo->blksize);
2498 memmove(xfs_attr3_leaf_name(leaf_d, desti),
2499 xfs_attr3_leaf_name(leaf_s, start_s + i), tmp);
2500 ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
2501 <= args->geo->blksize);
2502 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2503 ichdr_s->usedbytes -= tmp;
2504 ichdr_d->usedbytes += tmp;
2505 ichdr_s->count -= 1;
2506 ichdr_d->count += 1;
2507 tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t)
2508 + xfs_attr3_leaf_hdr_size(leaf_d);
2509 ASSERT(ichdr_d->firstused >= tmp);
2516 * Zero out the entries we just copied.
2518 if (start_s == ichdr_s->count) {
2519 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2520 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2521 ASSERT(((char *)entry_s + tmp) <=
2522 ((char *)leaf_s + args->geo->blksize));
2523 memset(entry_s, 0, tmp);
2526 * Move the remaining entries down to fill the hole,
2527 * then zero the entries at the top.
2529 tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t);
2530 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count];
2531 entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2532 memmove(entry_d, entry_s, tmp);
2534 tmp = count * sizeof(xfs_attr_leaf_entry_t);
2535 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count];
2536 ASSERT(((char *)entry_s + tmp) <=
2537 ((char *)leaf_s + args->geo->blksize));
2538 memset(entry_s, 0, tmp);
2542 * Fill in the freemap information
2544 ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d);
2545 ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t);
2546 ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base;
2547 ichdr_d->freemap[1].base = 0;
2548 ichdr_d->freemap[2].base = 0;
2549 ichdr_d->freemap[1].size = 0;
2550 ichdr_d->freemap[2].size = 0;
2551 ichdr_s->holes = 1; /* leaf may not be compact */
2555 * Pick up the last hashvalue from a leaf block.
2558 xfs_attr_leaf_lasthash(
2562 struct xfs_attr3_icleaf_hdr ichdr;
2563 struct xfs_attr_leaf_entry *entries;
2564 struct xfs_mount *mp = bp->b_target->bt_mount;
2566 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr);
2567 entries = xfs_attr3_leaf_entryp(bp->b_addr);
2569 *count = ichdr.count;
2572 return be32_to_cpu(entries[ichdr.count - 1].hashval);
2576 * Calculate the number of bytes used to store the indicated attribute
2577 * (whether local or remote only calculate bytes in this block).
2580 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2582 struct xfs_attr_leaf_entry *entries;
2583 xfs_attr_leaf_name_local_t *name_loc;
2584 xfs_attr_leaf_name_remote_t *name_rmt;
2587 entries = xfs_attr3_leaf_entryp(leaf);
2588 if (entries[index].flags & XFS_ATTR_LOCAL) {
2589 name_loc = xfs_attr3_leaf_name_local(leaf, index);
2590 size = xfs_attr_leaf_entsize_local(name_loc->namelen,
2591 be16_to_cpu(name_loc->valuelen));
2593 name_rmt = xfs_attr3_leaf_name_remote(leaf, index);
2594 size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
2600 * Calculate the number of bytes that would be required to store the new
2601 * attribute (whether local or remote only calculate bytes in this block).
2602 * This routine decides as a side effect whether the attribute will be
2603 * a "local" or a "remote" attribute.
2606 xfs_attr_leaf_newentsize(
2607 struct xfs_da_args *args,
2612 size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen);
2613 if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) {
2620 return xfs_attr_leaf_entsize_remote(args->namelen);
2624 /*========================================================================
2625 * Manage the INCOMPLETE flag in a leaf entry
2626 *========================================================================*/
2629 * Clear the INCOMPLETE flag on an entry in a leaf block.
2632 xfs_attr3_leaf_clearflag(
2633 struct xfs_da_args *args)
2635 struct xfs_attr_leafblock *leaf;
2636 struct xfs_attr_leaf_entry *entry;
2637 struct xfs_attr_leaf_name_remote *name_rmt;
2641 struct xfs_attr3_icleaf_hdr ichdr;
2642 xfs_attr_leaf_name_local_t *name_loc;
2647 trace_xfs_attr_leaf_clearflag(args);
2649 * Set up the operation.
2651 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
2656 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2657 ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);
2660 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2661 ASSERT(args->index < ichdr.count);
2662 ASSERT(args->index >= 0);
2664 if (entry->flags & XFS_ATTR_LOCAL) {
2665 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
2666 namelen = name_loc->namelen;
2667 name = (char *)name_loc->nameval;
2669 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2670 namelen = name_rmt->namelen;
2671 name = (char *)name_rmt->name;
2673 ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
2674 ASSERT(namelen == args->namelen);
2675 ASSERT(memcmp(name, args->name, namelen) == 0);
2678 entry->flags &= ~XFS_ATTR_INCOMPLETE;
2679 xfs_trans_log_buf(args->trans, bp,
2680 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2682 if (args->rmtblkno) {
2683 ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
2684 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2685 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2686 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
2687 xfs_trans_log_buf(args->trans, bp,
2688 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2692 * Commit the flag value change and start the next trans in series.
2694 return xfs_trans_roll_inode(&args->trans, args->dp);
2698 * Set the INCOMPLETE flag on an entry in a leaf block.
2701 xfs_attr3_leaf_setflag(
2702 struct xfs_da_args *args)
2704 struct xfs_attr_leafblock *leaf;
2705 struct xfs_attr_leaf_entry *entry;
2706 struct xfs_attr_leaf_name_remote *name_rmt;
2710 struct xfs_attr3_icleaf_hdr ichdr;
2713 trace_xfs_attr_leaf_setflag(args);
2716 * Set up the operation.
2718 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
2724 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf);
2725 ASSERT(args->index < ichdr.count);
2726 ASSERT(args->index >= 0);
2728 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
2730 ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
2731 entry->flags |= XFS_ATTR_INCOMPLETE;
2732 xfs_trans_log_buf(args->trans, bp,
2733 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2734 if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
2735 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
2736 name_rmt->valueblk = 0;
2737 name_rmt->valuelen = 0;
2738 xfs_trans_log_buf(args->trans, bp,
2739 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2743 * Commit the flag value change and start the next trans in series.
2745 return xfs_trans_roll_inode(&args->trans, args->dp);
2749 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2750 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2751 * entry given by args->blkno2/index2.
2753 * Note that they could be in different blocks, or in the same block.
2756 xfs_attr3_leaf_flipflags(
2757 struct xfs_da_args *args)
2759 struct xfs_attr_leafblock *leaf1;
2760 struct xfs_attr_leafblock *leaf2;
2761 struct xfs_attr_leaf_entry *entry1;
2762 struct xfs_attr_leaf_entry *entry2;
2763 struct xfs_attr_leaf_name_remote *name_rmt;
2764 struct xfs_buf *bp1;
2765 struct xfs_buf *bp2;
2768 struct xfs_attr3_icleaf_hdr ichdr1;
2769 struct xfs_attr3_icleaf_hdr ichdr2;
2770 xfs_attr_leaf_name_local_t *name_loc;
2771 int namelen1, namelen2;
2772 char *name1, *name2;
2775 trace_xfs_attr_leaf_flipflags(args);
2778 * Read the block containing the "old" attr
2780 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp1);
2785 * Read the block containing the "new" attr, if it is different
2787 if (args->blkno2 != args->blkno) {
2788 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2,
2796 leaf1 = bp1->b_addr;
2797 entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index];
2799 leaf2 = bp2->b_addr;
2800 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2];
2803 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1);
2804 ASSERT(args->index < ichdr1.count);
2805 ASSERT(args->index >= 0);
2807 xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2);
2808 ASSERT(args->index2 < ichdr2.count);
2809 ASSERT(args->index2 >= 0);
2811 if (entry1->flags & XFS_ATTR_LOCAL) {
2812 name_loc = xfs_attr3_leaf_name_local(leaf1, args->index);
2813 namelen1 = name_loc->namelen;
2814 name1 = (char *)name_loc->nameval;
2816 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
2817 namelen1 = name_rmt->namelen;
2818 name1 = (char *)name_rmt->name;
2820 if (entry2->flags & XFS_ATTR_LOCAL) {
2821 name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2);
2822 namelen2 = name_loc->namelen;
2823 name2 = (char *)name_loc->nameval;
2825 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
2826 namelen2 = name_rmt->namelen;
2827 name2 = (char *)name_rmt->name;
2829 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
2830 ASSERT(namelen1 == namelen2);
2831 ASSERT(memcmp(name1, name2, namelen1) == 0);
2834 ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
2835 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);
2837 entry1->flags &= ~XFS_ATTR_INCOMPLETE;
2838 xfs_trans_log_buf(args->trans, bp1,
2839 XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
2840 if (args->rmtblkno) {
2841 ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
2842 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
2843 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2844 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
2845 xfs_trans_log_buf(args->trans, bp1,
2846 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
2849 entry2->flags |= XFS_ATTR_INCOMPLETE;
2850 xfs_trans_log_buf(args->trans, bp2,
2851 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
2852 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
2853 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
2854 name_rmt->valueblk = 0;
2855 name_rmt->valuelen = 0;
2856 xfs_trans_log_buf(args->trans, bp2,
2857 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
2861 * Commit the flag value change and start the next trans in series.
2863 error = xfs_trans_roll_inode(&args->trans, args->dp);