10b61f8a4SDave Chinner // SPDX-License-Identifier: GPL-2.0 230f712c9SDave Chinner /* 330f712c9SDave Chinner * Copyright (c) 2000-2005 Silicon Graphics, Inc. 430f712c9SDave Chinner * Copyright (c) 2013 Red Hat, Inc. 530f712c9SDave Chinner * All Rights Reserved. 630f712c9SDave Chinner */ 730f712c9SDave Chinner #include "xfs.h" 830f712c9SDave Chinner #include "xfs_fs.h" 930f712c9SDave Chinner #include "xfs_shared.h" 1030f712c9SDave Chinner #include "xfs_format.h" 1130f712c9SDave Chinner #include "xfs_log_format.h" 1230f712c9SDave Chinner #include "xfs_trans_resv.h" 1330f712c9SDave Chinner #include "xfs_sb.h" 1430f712c9SDave Chinner #include "xfs_mount.h" 1530f712c9SDave Chinner #include "xfs_da_format.h" 1630f712c9SDave Chinner #include "xfs_da_btree.h" 1730f712c9SDave Chinner #include "xfs_inode.h" 1830f712c9SDave Chinner #include "xfs_trans.h" 1930f712c9SDave Chinner #include "xfs_bmap_btree.h" 2030f712c9SDave Chinner #include "xfs_bmap.h" 2130f712c9SDave Chinner #include "xfs_attr_sf.h" 2230f712c9SDave Chinner #include "xfs_attr_remote.h" 2330f712c9SDave Chinner #include "xfs_attr.h" 2430f712c9SDave Chinner #include "xfs_attr_leaf.h" 2530f712c9SDave Chinner #include "xfs_error.h" 2630f712c9SDave Chinner #include "xfs_trace.h" 2730f712c9SDave Chinner #include "xfs_buf_item.h" 2830f712c9SDave Chinner #include "xfs_dir2.h" 29a45086e2SBrian Foster #include "xfs_log.h" 3030f712c9SDave Chinner 3130f712c9SDave Chinner 3230f712c9SDave Chinner /* 3330f712c9SDave Chinner * xfs_attr_leaf.c 3430f712c9SDave Chinner * 3530f712c9SDave Chinner * Routines to implement leaf blocks of attributes as Btrees of hashed names. 3630f712c9SDave Chinner */ 3730f712c9SDave Chinner 3830f712c9SDave Chinner /*======================================================================== 3930f712c9SDave Chinner * Function prototypes for the kernel. 4030f712c9SDave Chinner *========================================================================*/ 4130f712c9SDave Chinner 4230f712c9SDave Chinner /* 4330f712c9SDave Chinner * Routines used for growing the Btree. 4430f712c9SDave Chinner */ 4530f712c9SDave Chinner STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args, 4630f712c9SDave Chinner xfs_dablk_t which_block, struct xfs_buf **bpp); 4730f712c9SDave Chinner STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer, 4830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 4930f712c9SDave Chinner struct xfs_da_args *args, int freemap_index); 5030f712c9SDave Chinner STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args, 5130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 5230f712c9SDave Chinner struct xfs_buf *leaf_buffer); 5330f712c9SDave Chinner STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state, 5430f712c9SDave Chinner xfs_da_state_blk_t *blk1, 5530f712c9SDave Chinner xfs_da_state_blk_t *blk2); 5630f712c9SDave Chinner STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state, 5730f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_1, 5830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 5930f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_2, 6030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 6130f712c9SDave Chinner int *number_entries_in_blk1, 6230f712c9SDave Chinner int *number_usedbytes_in_blk1); 6330f712c9SDave Chinner 6430f712c9SDave Chinner /* 6530f712c9SDave Chinner * Utility routines. 6630f712c9SDave Chinner */ 6730f712c9SDave Chinner STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args, 6830f712c9SDave Chinner struct xfs_attr_leafblock *src_leaf, 6930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start, 7030f712c9SDave Chinner struct xfs_attr_leafblock *dst_leaf, 7130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start, 7230f712c9SDave Chinner int move_count); 7330f712c9SDave Chinner STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index); 7430f712c9SDave Chinner 75e87021a2SBrian Foster /* 76e87021a2SBrian Foster * attr3 block 'firstused' conversion helpers. 77e87021a2SBrian Foster * 78e87021a2SBrian Foster * firstused refers to the offset of the first used byte of the nameval region 79e87021a2SBrian Foster * of an attr leaf block. The region starts at the tail of the block and expands 80e87021a2SBrian Foster * backwards towards the middle. As such, firstused is initialized to the block 81e87021a2SBrian Foster * size for an empty leaf block and is reduced from there. 82e87021a2SBrian Foster * 83e87021a2SBrian Foster * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k. 84e87021a2SBrian Foster * The in-core firstused field is 32-bit and thus supports the maximum fsb size. 85e87021a2SBrian Foster * The on-disk field is only 16-bit, however, and overflows at 64k. Since this 86e87021a2SBrian Foster * only occurs at exactly 64k, we use zero as a magic on-disk value to represent 87e87021a2SBrian Foster * the attr block size. The following helpers manage the conversion between the 88e87021a2SBrian Foster * in-core and on-disk formats. 89e87021a2SBrian Foster */ 90e87021a2SBrian Foster 91e87021a2SBrian Foster static void 92e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk( 93e87021a2SBrian Foster struct xfs_da_geometry *geo, 94e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *to, 95e87021a2SBrian Foster struct xfs_attr_leafblock *from) 96e87021a2SBrian Foster { 97e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 98e87021a2SBrian Foster 99e87021a2SBrian Foster if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 100e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) from; 101e87021a2SBrian Foster to->firstused = be16_to_cpu(hdr3->firstused); 102e87021a2SBrian Foster } else { 103e87021a2SBrian Foster to->firstused = be16_to_cpu(from->hdr.firstused); 104e87021a2SBrian Foster } 105e87021a2SBrian Foster 106e87021a2SBrian Foster /* 107e87021a2SBrian Foster * Convert from the magic fsb size value to actual blocksize. This 108e87021a2SBrian Foster * should only occur for empty blocks when the block size overflows 109e87021a2SBrian Foster * 16-bits. 110e87021a2SBrian Foster */ 111e87021a2SBrian Foster if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) { 112e87021a2SBrian Foster ASSERT(!to->count && !to->usedbytes); 113e87021a2SBrian Foster ASSERT(geo->blksize > USHRT_MAX); 114e87021a2SBrian Foster to->firstused = geo->blksize; 115e87021a2SBrian Foster } 116e87021a2SBrian Foster } 117e87021a2SBrian Foster 118e87021a2SBrian Foster static void 119e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk( 120e87021a2SBrian Foster struct xfs_da_geometry *geo, 121e87021a2SBrian Foster struct xfs_attr_leafblock *to, 122e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *from) 123e87021a2SBrian Foster { 124e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 125e87021a2SBrian Foster uint32_t firstused; 126e87021a2SBrian Foster 127e87021a2SBrian Foster /* magic value should only be seen on disk */ 128e87021a2SBrian Foster ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF); 129e87021a2SBrian Foster 130e87021a2SBrian Foster /* 131e87021a2SBrian Foster * Scale down the 32-bit in-core firstused value to the 16-bit on-disk 132e87021a2SBrian Foster * value. This only overflows at the max supported value of 64k. Use the 133e87021a2SBrian Foster * magic on-disk value to represent block size in this case. 134e87021a2SBrian Foster */ 135e87021a2SBrian Foster firstused = from->firstused; 136e87021a2SBrian Foster if (firstused > USHRT_MAX) { 137e87021a2SBrian Foster ASSERT(from->firstused == geo->blksize); 138e87021a2SBrian Foster firstused = XFS_ATTR3_LEAF_NULLOFF; 139e87021a2SBrian Foster } 140e87021a2SBrian Foster 141e87021a2SBrian Foster if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 142e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) to; 143e87021a2SBrian Foster hdr3->firstused = cpu_to_be16(firstused); 144e87021a2SBrian Foster } else { 145e87021a2SBrian Foster to->hdr.firstused = cpu_to_be16(firstused); 146e87021a2SBrian Foster } 147e87021a2SBrian Foster } 148e87021a2SBrian Foster 14930f712c9SDave Chinner void 15030f712c9SDave Chinner xfs_attr3_leaf_hdr_from_disk( 1512f661241SBrian Foster struct xfs_da_geometry *geo, 15230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *to, 15330f712c9SDave Chinner struct xfs_attr_leafblock *from) 15430f712c9SDave Chinner { 15530f712c9SDave Chinner int i; 15630f712c9SDave Chinner 15730f712c9SDave Chinner ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) || 15830f712c9SDave Chinner from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)); 15930f712c9SDave Chinner 16030f712c9SDave Chinner if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 16130f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from; 16230f712c9SDave Chinner 16330f712c9SDave Chinner to->forw = be32_to_cpu(hdr3->info.hdr.forw); 16430f712c9SDave Chinner to->back = be32_to_cpu(hdr3->info.hdr.back); 16530f712c9SDave Chinner to->magic = be16_to_cpu(hdr3->info.hdr.magic); 16630f712c9SDave Chinner to->count = be16_to_cpu(hdr3->count); 16730f712c9SDave Chinner to->usedbytes = be16_to_cpu(hdr3->usedbytes); 168e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 16930f712c9SDave Chinner to->holes = hdr3->holes; 17030f712c9SDave Chinner 17130f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 17230f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base); 17330f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size); 17430f712c9SDave Chinner } 17530f712c9SDave Chinner return; 17630f712c9SDave Chinner } 17730f712c9SDave Chinner to->forw = be32_to_cpu(from->hdr.info.forw); 17830f712c9SDave Chinner to->back = be32_to_cpu(from->hdr.info.back); 17930f712c9SDave Chinner to->magic = be16_to_cpu(from->hdr.info.magic); 18030f712c9SDave Chinner to->count = be16_to_cpu(from->hdr.count); 18130f712c9SDave Chinner to->usedbytes = be16_to_cpu(from->hdr.usedbytes); 182e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 18330f712c9SDave Chinner to->holes = from->hdr.holes; 18430f712c9SDave Chinner 18530f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 18630f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base); 18730f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size); 18830f712c9SDave Chinner } 18930f712c9SDave Chinner } 19030f712c9SDave Chinner 19130f712c9SDave Chinner void 19230f712c9SDave Chinner xfs_attr3_leaf_hdr_to_disk( 1932f661241SBrian Foster struct xfs_da_geometry *geo, 19430f712c9SDave Chinner struct xfs_attr_leafblock *to, 19530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *from) 19630f712c9SDave Chinner { 19730f712c9SDave Chinner int i; 19830f712c9SDave Chinner 19930f712c9SDave Chinner ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC || 20030f712c9SDave Chinner from->magic == XFS_ATTR3_LEAF_MAGIC); 20130f712c9SDave Chinner 20230f712c9SDave Chinner if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 20330f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to; 20430f712c9SDave Chinner 20530f712c9SDave Chinner hdr3->info.hdr.forw = cpu_to_be32(from->forw); 20630f712c9SDave Chinner hdr3->info.hdr.back = cpu_to_be32(from->back); 20730f712c9SDave Chinner hdr3->info.hdr.magic = cpu_to_be16(from->magic); 20830f712c9SDave Chinner hdr3->count = cpu_to_be16(from->count); 20930f712c9SDave Chinner hdr3->usedbytes = cpu_to_be16(from->usedbytes); 210e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 21130f712c9SDave Chinner hdr3->holes = from->holes; 21230f712c9SDave Chinner hdr3->pad1 = 0; 21330f712c9SDave Chinner 21430f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 21530f712c9SDave Chinner hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base); 21630f712c9SDave Chinner hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size); 21730f712c9SDave Chinner } 21830f712c9SDave Chinner return; 21930f712c9SDave Chinner } 22030f712c9SDave Chinner to->hdr.info.forw = cpu_to_be32(from->forw); 22130f712c9SDave Chinner to->hdr.info.back = cpu_to_be32(from->back); 22230f712c9SDave Chinner to->hdr.info.magic = cpu_to_be16(from->magic); 22330f712c9SDave Chinner to->hdr.count = cpu_to_be16(from->count); 22430f712c9SDave Chinner to->hdr.usedbytes = cpu_to_be16(from->usedbytes); 225e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 22630f712c9SDave Chinner to->hdr.holes = from->holes; 22730f712c9SDave Chinner to->hdr.pad1 = 0; 22830f712c9SDave Chinner 22930f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 23030f712c9SDave Chinner to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base); 23130f712c9SDave Chinner to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size); 23230f712c9SDave Chinner } 23330f712c9SDave Chinner } 23430f712c9SDave Chinner 235a6a781a5SDarrick J. Wong static xfs_failaddr_t 236c8476065SDarrick J. Wong xfs_attr3_leaf_verify_entry( 237c8476065SDarrick J. Wong struct xfs_mount *mp, 238c8476065SDarrick J. Wong char *buf_end, 239c8476065SDarrick J. Wong struct xfs_attr_leafblock *leaf, 240c8476065SDarrick J. Wong struct xfs_attr3_icleaf_hdr *leafhdr, 241c8476065SDarrick J. Wong struct xfs_attr_leaf_entry *ent, 242c8476065SDarrick J. Wong int idx, 243c8476065SDarrick J. Wong __u32 *last_hashval) 244c8476065SDarrick J. Wong { 245c8476065SDarrick J. Wong struct xfs_attr_leaf_name_local *lentry; 246c8476065SDarrick J. Wong struct xfs_attr_leaf_name_remote *rentry; 247c8476065SDarrick J. Wong char *name_end; 248c8476065SDarrick J. Wong unsigned int nameidx; 249c8476065SDarrick J. Wong unsigned int namesize; 250c8476065SDarrick J. Wong __u32 hashval; 251c8476065SDarrick J. Wong 252c8476065SDarrick J. Wong /* hash order check */ 253c8476065SDarrick J. Wong hashval = be32_to_cpu(ent->hashval); 254c8476065SDarrick J. Wong if (hashval < *last_hashval) 255c8476065SDarrick J. Wong return __this_address; 256c8476065SDarrick J. Wong *last_hashval = hashval; 257c8476065SDarrick J. Wong 258c8476065SDarrick J. Wong nameidx = be16_to_cpu(ent->nameidx); 259c8476065SDarrick J. Wong if (nameidx < leafhdr->firstused || nameidx >= mp->m_attr_geo->blksize) 260c8476065SDarrick J. Wong return __this_address; 261c8476065SDarrick J. Wong 262c8476065SDarrick J. Wong /* 263c8476065SDarrick J. Wong * Check the name information. The namelen fields are u8 so we can't 264c8476065SDarrick J. Wong * possibly exceed the maximum name length of 255 bytes. 265c8476065SDarrick J. Wong */ 266c8476065SDarrick J. Wong if (ent->flags & XFS_ATTR_LOCAL) { 267c8476065SDarrick J. Wong lentry = xfs_attr3_leaf_name_local(leaf, idx); 268c8476065SDarrick J. Wong namesize = xfs_attr_leaf_entsize_local(lentry->namelen, 269c8476065SDarrick J. Wong be16_to_cpu(lentry->valuelen)); 270c8476065SDarrick J. Wong name_end = (char *)lentry + namesize; 271c8476065SDarrick J. Wong if (lentry->namelen == 0) 272c8476065SDarrick J. Wong return __this_address; 273c8476065SDarrick J. Wong } else { 274c8476065SDarrick J. Wong rentry = xfs_attr3_leaf_name_remote(leaf, idx); 275c8476065SDarrick J. Wong namesize = xfs_attr_leaf_entsize_remote(rentry->namelen); 276c8476065SDarrick J. Wong name_end = (char *)rentry + namesize; 277c8476065SDarrick J. Wong if (rentry->namelen == 0) 278c8476065SDarrick J. Wong return __this_address; 279c8476065SDarrick J. Wong if (!(ent->flags & XFS_ATTR_INCOMPLETE) && 280c8476065SDarrick J. Wong rentry->valueblk == 0) 281c8476065SDarrick J. Wong return __this_address; 282c8476065SDarrick J. Wong } 283c8476065SDarrick J. Wong 284c8476065SDarrick J. Wong if (name_end > buf_end) 285c8476065SDarrick J. Wong return __this_address; 286c8476065SDarrick J. Wong 287c8476065SDarrick J. Wong return NULL; 288c8476065SDarrick J. Wong } 289c8476065SDarrick J. Wong 290c8476065SDarrick J. Wong static xfs_failaddr_t 29130f712c9SDave Chinner xfs_attr3_leaf_verify( 29230f712c9SDave Chinner struct xfs_buf *bp) 29330f712c9SDave Chinner { 29479a69bf8SDarrick J. Wong struct xfs_attr3_icleaf_hdr ichdr; 295dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 29630f712c9SDave Chinner struct xfs_attr_leafblock *leaf = bp->b_addr; 29779a69bf8SDarrick J. Wong struct xfs_attr_leaf_entry *entries; 298c8476065SDarrick J. Wong struct xfs_attr_leaf_entry *ent; 299c8476065SDarrick J. Wong char *buf_end; 300837514f7SDave Chinner uint32_t end; /* must be 32bit - see below */ 301c8476065SDarrick J. Wong __u32 last_hashval = 0; 30265cfcc38SDarrick J. Wong int i; 3038764f983SBrian Foster xfs_failaddr_t fa; 30430f712c9SDave Chinner 3052f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); 30630f712c9SDave Chinner 3078764f983SBrian Foster fa = xfs_da3_blkinfo_verify(bp, bp->b_addr); 3088764f983SBrian Foster if (fa) 3098764f983SBrian Foster return fa; 31039708c20SBrian Foster 3112e1d2337SEric Sandeen /* 3122e1d2337SEric Sandeen * In recovery there is a transient state where count == 0 is valid 3132e1d2337SEric Sandeen * because we may have transitioned an empty shortform attr to a leaf 3142e1d2337SEric Sandeen * if the attr didn't fit in shortform. 3152e1d2337SEric Sandeen */ 3160c60d3aaSDarrick J. Wong if (!xfs_log_in_recovery(mp) && ichdr.count == 0) 317a6a781a5SDarrick J. Wong return __this_address; 31830f712c9SDave Chinner 31979a69bf8SDarrick J. Wong /* 32079a69bf8SDarrick J. Wong * firstused is the block offset of the first name info structure. 32179a69bf8SDarrick J. Wong * Make sure it doesn't go off the block or crash into the header. 32279a69bf8SDarrick J. Wong */ 32379a69bf8SDarrick J. Wong if (ichdr.firstused > mp->m_attr_geo->blksize) 32479a69bf8SDarrick J. Wong return __this_address; 32579a69bf8SDarrick J. Wong if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) 32679a69bf8SDarrick J. Wong return __this_address; 32779a69bf8SDarrick J. Wong 32879a69bf8SDarrick J. Wong /* Make sure the entries array doesn't crash into the name info. */ 32979a69bf8SDarrick J. Wong entries = xfs_attr3_leaf_entryp(bp->b_addr); 33079a69bf8SDarrick J. Wong if ((char *)&entries[ichdr.count] > 33179a69bf8SDarrick J. Wong (char *)bp->b_addr + ichdr.firstused) 33279a69bf8SDarrick J. Wong return __this_address; 33379a69bf8SDarrick J. Wong 334c8476065SDarrick J. Wong buf_end = (char *)bp->b_addr + mp->m_attr_geo->blksize; 335c8476065SDarrick J. Wong for (i = 0, ent = entries; i < ichdr.count; ent++, i++) { 336c8476065SDarrick J. Wong fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr, 337c8476065SDarrick J. Wong ent, i, &last_hashval); 338c8476065SDarrick J. Wong if (fa) 339c8476065SDarrick J. Wong return fa; 340c8476065SDarrick J. Wong } 34130f712c9SDave Chinner 34265cfcc38SDarrick J. Wong /* 34365cfcc38SDarrick J. Wong * Quickly check the freemap information. Attribute data has to be 34465cfcc38SDarrick J. Wong * aligned to 4-byte boundaries, and likewise for the free space. 345837514f7SDave Chinner * 346837514f7SDave Chinner * Note that for 64k block size filesystems, the freemap entries cannot 347837514f7SDave Chinner * overflow as they are only be16 fields. However, when checking end 348837514f7SDave Chinner * pointer of the freemap, we have to be careful to detect overflows and 349837514f7SDave Chinner * so use uint32_t for those checks. 35065cfcc38SDarrick J. Wong */ 35165cfcc38SDarrick J. Wong for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 35265cfcc38SDarrick J. Wong if (ichdr.freemap[i].base > mp->m_attr_geo->blksize) 35365cfcc38SDarrick J. Wong return __this_address; 35465cfcc38SDarrick J. Wong if (ichdr.freemap[i].base & 0x3) 35565cfcc38SDarrick J. Wong return __this_address; 35665cfcc38SDarrick J. Wong if (ichdr.freemap[i].size > mp->m_attr_geo->blksize) 35765cfcc38SDarrick J. Wong return __this_address; 35865cfcc38SDarrick J. Wong if (ichdr.freemap[i].size & 0x3) 35965cfcc38SDarrick J. Wong return __this_address; 360837514f7SDave Chinner 361837514f7SDave Chinner /* be care of 16 bit overflows here */ 362837514f7SDave Chinner end = (uint32_t)ichdr.freemap[i].base + ichdr.freemap[i].size; 36365cfcc38SDarrick J. Wong if (end < ichdr.freemap[i].base) 36465cfcc38SDarrick J. Wong return __this_address; 36565cfcc38SDarrick J. Wong if (end > mp->m_attr_geo->blksize) 36665cfcc38SDarrick J. Wong return __this_address; 36765cfcc38SDarrick J. Wong } 36865cfcc38SDarrick J. Wong 369a6a781a5SDarrick J. Wong return NULL; 37030f712c9SDave Chinner } 37130f712c9SDave Chinner 37230f712c9SDave Chinner static void 37330f712c9SDave Chinner xfs_attr3_leaf_write_verify( 37430f712c9SDave Chinner struct xfs_buf *bp) 37530f712c9SDave Chinner { 376dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 377fb1755a6SCarlos Maiolino struct xfs_buf_log_item *bip = bp->b_log_item; 37830f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr; 379bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 38030f712c9SDave Chinner 381bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 382bc1a09b8SDarrick J. Wong if (fa) { 383bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 38430f712c9SDave Chinner return; 38530f712c9SDave Chinner } 38630f712c9SDave Chinner 38730f712c9SDave Chinner if (!xfs_sb_version_hascrc(&mp->m_sb)) 38830f712c9SDave Chinner return; 38930f712c9SDave Chinner 39030f712c9SDave Chinner if (bip) 39130f712c9SDave Chinner hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); 39230f712c9SDave Chinner 39330f712c9SDave Chinner xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF); 39430f712c9SDave Chinner } 39530f712c9SDave Chinner 39630f712c9SDave Chinner /* 39730f712c9SDave Chinner * leaf/node format detection on trees is sketchy, so a node read can be done on 39830f712c9SDave Chinner * leaf level blocks when detection identifies the tree as a node format tree 39930f712c9SDave Chinner * incorrectly. In this case, we need to swap the verifier to match the correct 40030f712c9SDave Chinner * format of the block being read. 40130f712c9SDave Chinner */ 40230f712c9SDave Chinner static void 40330f712c9SDave Chinner xfs_attr3_leaf_read_verify( 40430f712c9SDave Chinner struct xfs_buf *bp) 40530f712c9SDave Chinner { 406dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 407bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 40830f712c9SDave Chinner 40930f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb) && 41030f712c9SDave Chinner !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF)) 411bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSBADCRC, __this_address); 412bc1a09b8SDarrick J. Wong else { 413bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 414bc1a09b8SDarrick J. Wong if (fa) 415bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 416bc1a09b8SDarrick J. Wong } 41730f712c9SDave Chinner } 41830f712c9SDave Chinner 41930f712c9SDave Chinner const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = { 420233135b7SEric Sandeen .name = "xfs_attr3_leaf", 42115baadf7SDarrick J. Wong .magic16 = { cpu_to_be16(XFS_ATTR_LEAF_MAGIC), 42239708c20SBrian Foster cpu_to_be16(XFS_ATTR3_LEAF_MAGIC) }, 42330f712c9SDave Chinner .verify_read = xfs_attr3_leaf_read_verify, 42430f712c9SDave Chinner .verify_write = xfs_attr3_leaf_write_verify, 425b5572597SDarrick J. Wong .verify_struct = xfs_attr3_leaf_verify, 42630f712c9SDave Chinner }; 42730f712c9SDave Chinner 42830f712c9SDave Chinner int 42930f712c9SDave Chinner xfs_attr3_leaf_read( 43030f712c9SDave Chinner struct xfs_trans *tp, 43130f712c9SDave Chinner struct xfs_inode *dp, 43230f712c9SDave Chinner xfs_dablk_t bno, 43330f712c9SDave Chinner struct xfs_buf **bpp) 43430f712c9SDave Chinner { 43530f712c9SDave Chinner int err; 43630f712c9SDave Chinner 437dfb87594SChristoph Hellwig err = xfs_da_read_buf(tp, dp, bno, -1, bpp, XFS_ATTR_FORK, 438dfb87594SChristoph Hellwig &xfs_attr3_leaf_buf_ops); 439cd87d867SDarrick J. Wong if (!err && tp && *bpp) 44030f712c9SDave Chinner xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF); 44130f712c9SDave Chinner return err; 44230f712c9SDave Chinner } 44330f712c9SDave Chinner 44430f712c9SDave Chinner /*======================================================================== 44530f712c9SDave Chinner * Namespace helper routines 44630f712c9SDave Chinner *========================================================================*/ 44730f712c9SDave Chinner 44830f712c9SDave Chinner /* 44930f712c9SDave Chinner * If namespace bits don't match return 0. 45030f712c9SDave Chinner * If all match then return 1. 45130f712c9SDave Chinner */ 45230f712c9SDave Chinner STATIC int 45330f712c9SDave Chinner xfs_attr_namesp_match(int arg_flags, int ondisk_flags) 45430f712c9SDave Chinner { 45530f712c9SDave Chinner return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags); 45630f712c9SDave Chinner } 45730f712c9SDave Chinner 4589df243a1SDave Chinner static int 4599df243a1SDave Chinner xfs_attr_copy_value( 4609df243a1SDave Chinner struct xfs_da_args *args, 4619df243a1SDave Chinner unsigned char *value, 4629df243a1SDave Chinner int valuelen) 4639df243a1SDave Chinner { 4649df243a1SDave Chinner /* 4659df243a1SDave Chinner * No copy if all we have to do is get the length 4669df243a1SDave Chinner */ 4679df243a1SDave Chinner if (args->flags & ATTR_KERNOVAL) { 4689df243a1SDave Chinner args->valuelen = valuelen; 4699df243a1SDave Chinner return 0; 4709df243a1SDave Chinner } 4719df243a1SDave Chinner 4729df243a1SDave Chinner /* 4739df243a1SDave Chinner * No copy if the length of the existing buffer is too small 4749df243a1SDave Chinner */ 4759df243a1SDave Chinner if (args->valuelen < valuelen) { 4769df243a1SDave Chinner args->valuelen = valuelen; 4779df243a1SDave Chinner return -ERANGE; 4789df243a1SDave Chinner } 479ddbca70cSDave Chinner 480ddbca70cSDave Chinner if (args->op_flags & XFS_DA_OP_ALLOCVAL) { 481ddbca70cSDave Chinner args->value = kmem_alloc_large(valuelen, 0); 482ddbca70cSDave Chinner if (!args->value) 483ddbca70cSDave Chinner return -ENOMEM; 484ddbca70cSDave Chinner } 4859df243a1SDave Chinner args->valuelen = valuelen; 4869df243a1SDave Chinner 4879df243a1SDave Chinner /* remote block xattr requires IO for copy-in */ 4889df243a1SDave Chinner if (args->rmtblkno) 4899df243a1SDave Chinner return xfs_attr_rmtval_get(args); 4909df243a1SDave Chinner 4919df243a1SDave Chinner /* 4929df243a1SDave Chinner * This is to prevent a GCC warning because the remote xattr case 4939df243a1SDave Chinner * doesn't have a value to pass in. In that case, we never reach here, 4949df243a1SDave Chinner * but GCC can't work that out and so throws a "passing NULL to 4959df243a1SDave Chinner * memcpy" warning. 4969df243a1SDave Chinner */ 4979df243a1SDave Chinner if (!value) 4989df243a1SDave Chinner return -EINVAL; 4999df243a1SDave Chinner memcpy(args->value, value, valuelen); 5009df243a1SDave Chinner return 0; 5019df243a1SDave Chinner } 50230f712c9SDave Chinner 50330f712c9SDave Chinner /*======================================================================== 50430f712c9SDave Chinner * External routines when attribute fork size < XFS_LITINO(mp). 50530f712c9SDave Chinner *========================================================================*/ 50630f712c9SDave Chinner 50730f712c9SDave Chinner /* 50830f712c9SDave Chinner * Query whether the requested number of additional bytes of extended 50930f712c9SDave Chinner * attribute space will be able to fit inline. 51030f712c9SDave Chinner * 51130f712c9SDave Chinner * Returns zero if not, else the di_forkoff fork offset to be used in the 51230f712c9SDave Chinner * literal area for attribute data once the new bytes have been added. 51330f712c9SDave Chinner * 51430f712c9SDave Chinner * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value; 51530f712c9SDave Chinner * special case for dev/uuid inodes, they have fixed size data forks. 51630f712c9SDave Chinner */ 51730f712c9SDave Chinner int 5183f8a4f1dSDave Chinner xfs_attr_shortform_bytesfit( 5193f8a4f1dSDave Chinner struct xfs_inode *dp, 5203f8a4f1dSDave Chinner int bytes) 52130f712c9SDave Chinner { 5223f8a4f1dSDave Chinner struct xfs_mount *mp = dp->i_mount; 5233f8a4f1dSDave Chinner int64_t dsize; 5243f8a4f1dSDave Chinner int minforkoff; 5253f8a4f1dSDave Chinner int maxforkoff; 52630f712c9SDave Chinner int offset; 52730f712c9SDave Chinner 52830f712c9SDave Chinner /* rounded down */ 52930f712c9SDave Chinner offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3; 53030f712c9SDave Chinner 53142b67dc6SChristoph Hellwig if (dp->i_d.di_format == XFS_DINODE_FMT_DEV) { 53230f712c9SDave Chinner minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3; 53330f712c9SDave Chinner return (offset >= minforkoff) ? minforkoff : 0; 53430f712c9SDave Chinner } 53530f712c9SDave Chinner 53630f712c9SDave Chinner /* 53730f712c9SDave Chinner * If the requested numbers of bytes is smaller or equal to the 53830f712c9SDave Chinner * current attribute fork size we can always proceed. 53930f712c9SDave Chinner * 54030f712c9SDave Chinner * Note that if_bytes in the data fork might actually be larger than 54130f712c9SDave Chinner * the current data fork size is due to delalloc extents. In that 54230f712c9SDave Chinner * case either the extent count will go down when they are converted 54330f712c9SDave Chinner * to real extents, or the delalloc conversion will take care of the 54430f712c9SDave Chinner * literal area rebalancing. 54530f712c9SDave Chinner */ 54630f712c9SDave Chinner if (bytes <= XFS_IFORK_ASIZE(dp)) 54730f712c9SDave Chinner return dp->i_d.di_forkoff; 54830f712c9SDave Chinner 54930f712c9SDave Chinner /* 55030f712c9SDave Chinner * For attr2 we can try to move the forkoff if there is space in the 55130f712c9SDave Chinner * literal area, but for the old format we are done if there is no 55230f712c9SDave Chinner * space in the fixed attribute fork. 55330f712c9SDave Chinner */ 55430f712c9SDave Chinner if (!(mp->m_flags & XFS_MOUNT_ATTR2)) 55530f712c9SDave Chinner return 0; 55630f712c9SDave Chinner 55730f712c9SDave Chinner dsize = dp->i_df.if_bytes; 55830f712c9SDave Chinner 55930f712c9SDave Chinner switch (dp->i_d.di_format) { 56030f712c9SDave Chinner case XFS_DINODE_FMT_EXTENTS: 56130f712c9SDave Chinner /* 56230f712c9SDave Chinner * If there is no attr fork and the data fork is extents, 56330f712c9SDave Chinner * determine if creating the default attr fork will result 56430f712c9SDave Chinner * in the extents form migrating to btree. If so, the 56530f712c9SDave Chinner * minimum offset only needs to be the space required for 56630f712c9SDave Chinner * the btree root. 56730f712c9SDave Chinner */ 56830f712c9SDave Chinner if (!dp->i_d.di_forkoff && dp->i_df.if_bytes > 56930f712c9SDave Chinner xfs_default_attroffset(dp)) 57030f712c9SDave Chinner dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS); 57130f712c9SDave Chinner break; 57230f712c9SDave Chinner case XFS_DINODE_FMT_BTREE: 57330f712c9SDave Chinner /* 57430f712c9SDave Chinner * If we have a data btree then keep forkoff if we have one, 57530f712c9SDave Chinner * otherwise we are adding a new attr, so then we set 57630f712c9SDave Chinner * minforkoff to where the btree root can finish so we have 57730f712c9SDave Chinner * plenty of room for attrs 57830f712c9SDave Chinner */ 57930f712c9SDave Chinner if (dp->i_d.di_forkoff) { 58030f712c9SDave Chinner if (offset < dp->i_d.di_forkoff) 58130f712c9SDave Chinner return 0; 58230f712c9SDave Chinner return dp->i_d.di_forkoff; 58330f712c9SDave Chinner } 58430f712c9SDave Chinner dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot); 58530f712c9SDave Chinner break; 58630f712c9SDave Chinner } 58730f712c9SDave Chinner 58830f712c9SDave Chinner /* 58930f712c9SDave Chinner * A data fork btree root must have space for at least 59030f712c9SDave Chinner * MINDBTPTRS key/ptr pairs if the data fork is small or empty. 59130f712c9SDave Chinner */ 5923f8a4f1dSDave Chinner minforkoff = max_t(int64_t, dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS)); 59330f712c9SDave Chinner minforkoff = roundup(minforkoff, 8) >> 3; 59430f712c9SDave Chinner 59530f712c9SDave Chinner /* attr fork btree root can have at least this many key/ptr pairs */ 59630f712c9SDave Chinner maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) - 59730f712c9SDave Chinner XFS_BMDR_SPACE_CALC(MINABTPTRS); 59830f712c9SDave Chinner maxforkoff = maxforkoff >> 3; /* rounded down */ 59930f712c9SDave Chinner 60030f712c9SDave Chinner if (offset >= maxforkoff) 60130f712c9SDave Chinner return maxforkoff; 60230f712c9SDave Chinner if (offset >= minforkoff) 60330f712c9SDave Chinner return offset; 60430f712c9SDave Chinner return 0; 60530f712c9SDave Chinner } 60630f712c9SDave Chinner 60730f712c9SDave Chinner /* 60830f712c9SDave Chinner * Switch on the ATTR2 superblock bit (implies also FEATURES2) 60930f712c9SDave Chinner */ 61030f712c9SDave Chinner STATIC void 61130f712c9SDave Chinner xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp) 61230f712c9SDave Chinner { 61330f712c9SDave Chinner if ((mp->m_flags & XFS_MOUNT_ATTR2) && 61430f712c9SDave Chinner !(xfs_sb_version_hasattr2(&mp->m_sb))) { 61530f712c9SDave Chinner spin_lock(&mp->m_sb_lock); 61630f712c9SDave Chinner if (!xfs_sb_version_hasattr2(&mp->m_sb)) { 61730f712c9SDave Chinner xfs_sb_version_addattr2(&mp->m_sb); 61830f712c9SDave Chinner spin_unlock(&mp->m_sb_lock); 61961e63ecbSDave Chinner xfs_log_sb(tp); 62030f712c9SDave Chinner } else 62130f712c9SDave Chinner spin_unlock(&mp->m_sb_lock); 62230f712c9SDave Chinner } 62330f712c9SDave Chinner } 62430f712c9SDave Chinner 62530f712c9SDave Chinner /* 62630f712c9SDave Chinner * Create the initial contents of a shortform attribute list. 62730f712c9SDave Chinner */ 62830f712c9SDave Chinner void 62930f712c9SDave Chinner xfs_attr_shortform_create(xfs_da_args_t *args) 63030f712c9SDave Chinner { 63130f712c9SDave Chinner xfs_attr_sf_hdr_t *hdr; 63230f712c9SDave Chinner xfs_inode_t *dp; 6333ba738dfSChristoph Hellwig struct xfs_ifork *ifp; 63430f712c9SDave Chinner 63530f712c9SDave Chinner trace_xfs_attr_sf_create(args); 63630f712c9SDave Chinner 63730f712c9SDave Chinner dp = args->dp; 63830f712c9SDave Chinner ASSERT(dp != NULL); 63930f712c9SDave Chinner ifp = dp->i_afp; 64030f712c9SDave Chinner ASSERT(ifp != NULL); 64130f712c9SDave Chinner ASSERT(ifp->if_bytes == 0); 64230f712c9SDave Chinner if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) { 64330f712c9SDave Chinner ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */ 64430f712c9SDave Chinner dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL; 64530f712c9SDave Chinner ifp->if_flags |= XFS_IFINLINE; 64630f712c9SDave Chinner } else { 64730f712c9SDave Chinner ASSERT(ifp->if_flags & XFS_IFINLINE); 64830f712c9SDave Chinner } 64930f712c9SDave Chinner xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK); 65030f712c9SDave Chinner hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data; 65130f712c9SDave Chinner hdr->count = 0; 65230f712c9SDave Chinner hdr->totsize = cpu_to_be16(sizeof(*hdr)); 65330f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 65430f712c9SDave Chinner } 65530f712c9SDave Chinner 65630f712c9SDave Chinner /* 65730f712c9SDave Chinner * Add a name/value pair to the shortform attribute list. 65830f712c9SDave Chinner * Overflow from the inode has already been checked for. 65930f712c9SDave Chinner */ 66030f712c9SDave Chinner void 66130f712c9SDave Chinner xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff) 66230f712c9SDave Chinner { 66330f712c9SDave Chinner xfs_attr_shortform_t *sf; 66430f712c9SDave Chinner xfs_attr_sf_entry_t *sfe; 66530f712c9SDave Chinner int i, offset, size; 66630f712c9SDave Chinner xfs_mount_t *mp; 66730f712c9SDave Chinner xfs_inode_t *dp; 6683ba738dfSChristoph Hellwig struct xfs_ifork *ifp; 66930f712c9SDave Chinner 67030f712c9SDave Chinner trace_xfs_attr_sf_add(args); 67130f712c9SDave Chinner 67230f712c9SDave Chinner dp = args->dp; 67330f712c9SDave Chinner mp = dp->i_mount; 67430f712c9SDave Chinner dp->i_d.di_forkoff = forkoff; 67530f712c9SDave Chinner 67630f712c9SDave Chinner ifp = dp->i_afp; 67730f712c9SDave Chinner ASSERT(ifp->if_flags & XFS_IFINLINE); 67830f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 67930f712c9SDave Chinner sfe = &sf->list[0]; 68030f712c9SDave Chinner for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { 68130f712c9SDave Chinner #ifdef DEBUG 68230f712c9SDave Chinner if (sfe->namelen != args->namelen) 68330f712c9SDave Chinner continue; 68430f712c9SDave Chinner if (memcmp(args->name, sfe->nameval, args->namelen) != 0) 68530f712c9SDave Chinner continue; 68630f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 68730f712c9SDave Chinner continue; 68830f712c9SDave Chinner ASSERT(0); 68930f712c9SDave Chinner #endif 69030f712c9SDave Chinner } 69130f712c9SDave Chinner 69230f712c9SDave Chinner offset = (char *)sfe - (char *)sf; 69330f712c9SDave Chinner size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen); 69430f712c9SDave Chinner xfs_idata_realloc(dp, size, XFS_ATTR_FORK); 69530f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 69630f712c9SDave Chinner sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset); 69730f712c9SDave Chinner 69830f712c9SDave Chinner sfe->namelen = args->namelen; 69930f712c9SDave Chinner sfe->valuelen = args->valuelen; 70030f712c9SDave Chinner sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags); 70130f712c9SDave Chinner memcpy(sfe->nameval, args->name, args->namelen); 70230f712c9SDave Chinner memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen); 70330f712c9SDave Chinner sf->hdr.count++; 70430f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, size); 70530f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 70630f712c9SDave Chinner 70730f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 70830f712c9SDave Chinner } 70930f712c9SDave Chinner 71030f712c9SDave Chinner /* 71130f712c9SDave Chinner * After the last attribute is removed revert to original inode format, 71230f712c9SDave Chinner * making all literal area available to the data fork once more. 71330f712c9SDave Chinner */ 7146dfe5a04SDave Chinner void 7156dfe5a04SDave Chinner xfs_attr_fork_remove( 71630f712c9SDave Chinner struct xfs_inode *ip, 71730f712c9SDave Chinner struct xfs_trans *tp) 71830f712c9SDave Chinner { 71930f712c9SDave Chinner xfs_idestroy_fork(ip, XFS_ATTR_FORK); 72030f712c9SDave Chinner ip->i_d.di_forkoff = 0; 72130f712c9SDave Chinner ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS; 72230f712c9SDave Chinner 72330f712c9SDave Chinner ASSERT(ip->i_d.di_anextents == 0); 72430f712c9SDave Chinner ASSERT(ip->i_afp == NULL); 72530f712c9SDave Chinner 72630f712c9SDave Chinner xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); 72730f712c9SDave Chinner } 72830f712c9SDave Chinner 72930f712c9SDave Chinner /* 73030f712c9SDave Chinner * Remove an attribute from the shortform attribute list structure. 73130f712c9SDave Chinner */ 73230f712c9SDave Chinner int 73330f712c9SDave Chinner xfs_attr_shortform_remove(xfs_da_args_t *args) 73430f712c9SDave Chinner { 73530f712c9SDave Chinner xfs_attr_shortform_t *sf; 73630f712c9SDave Chinner xfs_attr_sf_entry_t *sfe; 73730f712c9SDave Chinner int base, size=0, end, totsize, i; 73830f712c9SDave Chinner xfs_mount_t *mp; 73930f712c9SDave Chinner xfs_inode_t *dp; 74030f712c9SDave Chinner 74130f712c9SDave Chinner trace_xfs_attr_sf_remove(args); 74230f712c9SDave Chinner 74330f712c9SDave Chinner dp = args->dp; 74430f712c9SDave Chinner mp = dp->i_mount; 74530f712c9SDave Chinner base = sizeof(xfs_attr_sf_hdr_t); 74630f712c9SDave Chinner sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data; 74730f712c9SDave Chinner sfe = &sf->list[0]; 74830f712c9SDave Chinner end = sf->hdr.count; 74930f712c9SDave Chinner for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), 75030f712c9SDave Chinner base += size, i++) { 75130f712c9SDave Chinner size = XFS_ATTR_SF_ENTSIZE(sfe); 75230f712c9SDave Chinner if (sfe->namelen != args->namelen) 75330f712c9SDave Chinner continue; 75430f712c9SDave Chinner if (memcmp(sfe->nameval, args->name, args->namelen) != 0) 75530f712c9SDave Chinner continue; 75630f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 75730f712c9SDave Chinner continue; 75830f712c9SDave Chinner break; 75930f712c9SDave Chinner } 76030f712c9SDave Chinner if (i == end) 7612451337dSDave Chinner return -ENOATTR; 76230f712c9SDave Chinner 76330f712c9SDave Chinner /* 76430f712c9SDave Chinner * Fix up the attribute fork data, covering the hole 76530f712c9SDave Chinner */ 76630f712c9SDave Chinner end = base + size; 76730f712c9SDave Chinner totsize = be16_to_cpu(sf->hdr.totsize); 76830f712c9SDave Chinner if (end != totsize) 76930f712c9SDave Chinner memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end); 77030f712c9SDave Chinner sf->hdr.count--; 77130f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, -size); 77230f712c9SDave Chinner 77330f712c9SDave Chinner /* 77430f712c9SDave Chinner * Fix up the start offset of the attribute fork 77530f712c9SDave Chinner */ 77630f712c9SDave Chinner totsize -= size; 77730f712c9SDave Chinner if (totsize == sizeof(xfs_attr_sf_hdr_t) && 77830f712c9SDave Chinner (mp->m_flags & XFS_MOUNT_ATTR2) && 77930f712c9SDave Chinner (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) && 78030f712c9SDave Chinner !(args->op_flags & XFS_DA_OP_ADDNAME)) { 7816dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 78230f712c9SDave Chinner } else { 78330f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 78430f712c9SDave Chinner dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize); 78530f712c9SDave Chinner ASSERT(dp->i_d.di_forkoff); 78630f712c9SDave Chinner ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) || 78730f712c9SDave Chinner (args->op_flags & XFS_DA_OP_ADDNAME) || 78830f712c9SDave Chinner !(mp->m_flags & XFS_MOUNT_ATTR2) || 78930f712c9SDave Chinner dp->i_d.di_format == XFS_DINODE_FMT_BTREE); 79030f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, 79130f712c9SDave Chinner XFS_ILOG_CORE | XFS_ILOG_ADATA); 79230f712c9SDave Chinner } 79330f712c9SDave Chinner 79430f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 79530f712c9SDave Chinner 79630f712c9SDave Chinner return 0; 79730f712c9SDave Chinner } 79830f712c9SDave Chinner 79930f712c9SDave Chinner /* 80030f712c9SDave Chinner * Look up a name in a shortform attribute list structure. 80130f712c9SDave Chinner */ 80230f712c9SDave Chinner /*ARGSUSED*/ 80330f712c9SDave Chinner int 80430f712c9SDave Chinner xfs_attr_shortform_lookup(xfs_da_args_t *args) 80530f712c9SDave Chinner { 80630f712c9SDave Chinner xfs_attr_shortform_t *sf; 80730f712c9SDave Chinner xfs_attr_sf_entry_t *sfe; 80830f712c9SDave Chinner int i; 8093ba738dfSChristoph Hellwig struct xfs_ifork *ifp; 81030f712c9SDave Chinner 81130f712c9SDave Chinner trace_xfs_attr_sf_lookup(args); 81230f712c9SDave Chinner 81330f712c9SDave Chinner ifp = args->dp->i_afp; 81430f712c9SDave Chinner ASSERT(ifp->if_flags & XFS_IFINLINE); 81530f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 81630f712c9SDave Chinner sfe = &sf->list[0]; 81730f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 81830f712c9SDave Chinner sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { 81930f712c9SDave Chinner if (sfe->namelen != args->namelen) 82030f712c9SDave Chinner continue; 82130f712c9SDave Chinner if (memcmp(args->name, sfe->nameval, args->namelen) != 0) 82230f712c9SDave Chinner continue; 82330f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 82430f712c9SDave Chinner continue; 8252451337dSDave Chinner return -EEXIST; 82630f712c9SDave Chinner } 8272451337dSDave Chinner return -ENOATTR; 82830f712c9SDave Chinner } 82930f712c9SDave Chinner 83030f712c9SDave Chinner /* 831cf085a1bSJoe Perches * Retrieve the attribute value and length. 832728bcaa3SDave Chinner * 833728bcaa3SDave Chinner * If ATTR_KERNOVAL is specified, only the length needs to be returned. 834728bcaa3SDave Chinner * Unlike a lookup, we only return an error if the attribute does not 835728bcaa3SDave Chinner * exist or we can't retrieve the value. 83630f712c9SDave Chinner */ 83730f712c9SDave Chinner int 8389df243a1SDave Chinner xfs_attr_shortform_getvalue( 8399df243a1SDave Chinner struct xfs_da_args *args) 84030f712c9SDave Chinner { 8419df243a1SDave Chinner struct xfs_attr_shortform *sf; 8429df243a1SDave Chinner struct xfs_attr_sf_entry *sfe; 84330f712c9SDave Chinner int i; 84430f712c9SDave Chinner 84530f712c9SDave Chinner ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE); 84630f712c9SDave Chinner sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data; 84730f712c9SDave Chinner sfe = &sf->list[0]; 84830f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 84930f712c9SDave Chinner sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { 85030f712c9SDave Chinner if (sfe->namelen != args->namelen) 85130f712c9SDave Chinner continue; 85230f712c9SDave Chinner if (memcmp(args->name, sfe->nameval, args->namelen) != 0) 85330f712c9SDave Chinner continue; 85430f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 85530f712c9SDave Chinner continue; 8569df243a1SDave Chinner return xfs_attr_copy_value(args, &sfe->nameval[args->namelen], 8579df243a1SDave Chinner sfe->valuelen); 85830f712c9SDave Chinner } 8592451337dSDave Chinner return -ENOATTR; 86030f712c9SDave Chinner } 86130f712c9SDave Chinner 86230f712c9SDave Chinner /* 8636e643cd0SDarrick J. Wong * Convert from using the shortform to the leaf. On success, return the 8646e643cd0SDarrick J. Wong * buffer so that we can keep it locked until we're totally done with it. 86530f712c9SDave Chinner */ 86630f712c9SDave Chinner int 8676e643cd0SDarrick J. Wong xfs_attr_shortform_to_leaf( 8686e643cd0SDarrick J. Wong struct xfs_da_args *args, 8696e643cd0SDarrick J. Wong struct xfs_buf **leaf_bp) 87030f712c9SDave Chinner { 87132a9b7c6SBrian Foster struct xfs_inode *dp; 87232a9b7c6SBrian Foster struct xfs_attr_shortform *sf; 87332a9b7c6SBrian Foster struct xfs_attr_sf_entry *sfe; 87432a9b7c6SBrian Foster struct xfs_da_args nargs; 87530f712c9SDave Chinner char *tmpbuffer; 87630f712c9SDave Chinner int error, i, size; 87730f712c9SDave Chinner xfs_dablk_t blkno; 87830f712c9SDave Chinner struct xfs_buf *bp; 87932a9b7c6SBrian Foster struct xfs_ifork *ifp; 88030f712c9SDave Chinner 88130f712c9SDave Chinner trace_xfs_attr_sf_to_leaf(args); 88230f712c9SDave Chinner 88330f712c9SDave Chinner dp = args->dp; 88430f712c9SDave Chinner ifp = dp->i_afp; 88530f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 88630f712c9SDave Chinner size = be16_to_cpu(sf->hdr.totsize); 887707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(size, 0); 88830f712c9SDave Chinner ASSERT(tmpbuffer != NULL); 88930f712c9SDave Chinner memcpy(tmpbuffer, ifp->if_u1.if_data, size); 89030f712c9SDave Chinner sf = (xfs_attr_shortform_t *)tmpbuffer; 89130f712c9SDave Chinner 89230f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 893aeea4b75SBrian Foster xfs_bmap_local_to_extents_empty(args->trans, dp, XFS_ATTR_FORK); 89430f712c9SDave Chinner 89530f712c9SDave Chinner bp = NULL; 89630f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 897603efebdSBrian Foster if (error) 89830f712c9SDave Chinner goto out; 89930f712c9SDave Chinner 90030f712c9SDave Chinner ASSERT(blkno == 0); 90130f712c9SDave Chinner error = xfs_attr3_leaf_create(args, blkno, &bp); 902603efebdSBrian Foster if (error) 90330f712c9SDave Chinner goto out; 90430f712c9SDave Chinner 90530f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 90630f712c9SDave Chinner nargs.dp = dp; 90730f712c9SDave Chinner nargs.geo = args->geo; 90830f712c9SDave Chinner nargs.total = args->total; 90930f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 91030f712c9SDave Chinner nargs.trans = args->trans; 91130f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 91230f712c9SDave Chinner 91330f712c9SDave Chinner sfe = &sf->list[0]; 91430f712c9SDave Chinner for (i = 0; i < sf->hdr.count; i++) { 91530f712c9SDave Chinner nargs.name = sfe->nameval; 91630f712c9SDave Chinner nargs.namelen = sfe->namelen; 91730f712c9SDave Chinner nargs.value = &sfe->nameval[nargs.namelen]; 91830f712c9SDave Chinner nargs.valuelen = sfe->valuelen; 91930f712c9SDave Chinner nargs.hashval = xfs_da_hashname(sfe->nameval, 92030f712c9SDave Chinner sfe->namelen); 92130f712c9SDave Chinner nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags); 92230f712c9SDave Chinner error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */ 9232451337dSDave Chinner ASSERT(error == -ENOATTR); 92430f712c9SDave Chinner error = xfs_attr3_leaf_add(bp, &nargs); 9252451337dSDave Chinner ASSERT(error != -ENOSPC); 92630f712c9SDave Chinner if (error) 92730f712c9SDave Chinner goto out; 92830f712c9SDave Chinner sfe = XFS_ATTR_SF_NEXTENTRY(sfe); 92930f712c9SDave Chinner } 93030f712c9SDave Chinner error = 0; 9316e643cd0SDarrick J. Wong *leaf_bp = bp; 93230f712c9SDave Chinner out: 93330f712c9SDave Chinner kmem_free(tmpbuffer); 93430f712c9SDave Chinner return error; 93530f712c9SDave Chinner } 93630f712c9SDave Chinner 93730f712c9SDave Chinner /* 93830f712c9SDave Chinner * Check a leaf attribute block to see if all the entries would fit into 93930f712c9SDave Chinner * a shortform attribute list. 94030f712c9SDave Chinner */ 94130f712c9SDave Chinner int 94230f712c9SDave Chinner xfs_attr_shortform_allfit( 94330f712c9SDave Chinner struct xfs_buf *bp, 94430f712c9SDave Chinner struct xfs_inode *dp) 94530f712c9SDave Chinner { 94630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 94730f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 94830f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 94930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr leafhdr; 95030f712c9SDave Chinner int bytes; 95130f712c9SDave Chinner int i; 952dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 95330f712c9SDave Chinner 95430f712c9SDave Chinner leaf = bp->b_addr; 9552f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf); 95630f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 95730f712c9SDave Chinner 95830f712c9SDave Chinner bytes = sizeof(struct xfs_attr_sf_hdr); 95930f712c9SDave Chinner for (i = 0; i < leafhdr.count; entry++, i++) { 96030f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 96130f712c9SDave Chinner continue; /* don't copy partial entries */ 96230f712c9SDave Chinner if (!(entry->flags & XFS_ATTR_LOCAL)) 96330f712c9SDave Chinner return 0; 96430f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 96530f712c9SDave Chinner if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX) 96630f712c9SDave Chinner return 0; 96730f712c9SDave Chinner if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX) 96830f712c9SDave Chinner return 0; 96930f712c9SDave Chinner bytes += sizeof(struct xfs_attr_sf_entry) - 1 97030f712c9SDave Chinner + name_loc->namelen 97130f712c9SDave Chinner + be16_to_cpu(name_loc->valuelen); 97230f712c9SDave Chinner } 97330f712c9SDave Chinner if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) && 97430f712c9SDave Chinner (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) && 97530f712c9SDave Chinner (bytes == sizeof(struct xfs_attr_sf_hdr))) 97630f712c9SDave Chinner return -1; 97730f712c9SDave Chinner return xfs_attr_shortform_bytesfit(dp, bytes); 97830f712c9SDave Chinner } 97930f712c9SDave Chinner 9801e1bbd8eSDarrick J. Wong /* Verify the consistency of an inline attribute fork. */ 9811e1bbd8eSDarrick J. Wong xfs_failaddr_t 9821e1bbd8eSDarrick J. Wong xfs_attr_shortform_verify( 9831e1bbd8eSDarrick J. Wong struct xfs_inode *ip) 9841e1bbd8eSDarrick J. Wong { 9851e1bbd8eSDarrick J. Wong struct xfs_attr_shortform *sfp; 9861e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *sfep; 9871e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *next_sfep; 9881e1bbd8eSDarrick J. Wong char *endp; 9891e1bbd8eSDarrick J. Wong struct xfs_ifork *ifp; 9901e1bbd8eSDarrick J. Wong int i; 9913f8a4f1dSDave Chinner int64_t size; 9921e1bbd8eSDarrick J. Wong 9931e1bbd8eSDarrick J. Wong ASSERT(ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL); 9941e1bbd8eSDarrick J. Wong ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK); 9951e1bbd8eSDarrick J. Wong sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 9961e1bbd8eSDarrick J. Wong size = ifp->if_bytes; 9971e1bbd8eSDarrick J. Wong 9981e1bbd8eSDarrick J. Wong /* 9991e1bbd8eSDarrick J. Wong * Give up if the attribute is way too short. 10001e1bbd8eSDarrick J. Wong */ 10011e1bbd8eSDarrick J. Wong if (size < sizeof(struct xfs_attr_sf_hdr)) 10021e1bbd8eSDarrick J. Wong return __this_address; 10031e1bbd8eSDarrick J. Wong 10041e1bbd8eSDarrick J. Wong endp = (char *)sfp + size; 10051e1bbd8eSDarrick J. Wong 10061e1bbd8eSDarrick J. Wong /* Check all reported entries */ 10071e1bbd8eSDarrick J. Wong sfep = &sfp->list[0]; 10081e1bbd8eSDarrick J. Wong for (i = 0; i < sfp->hdr.count; i++) { 10091e1bbd8eSDarrick J. Wong /* 10101e1bbd8eSDarrick J. Wong * struct xfs_attr_sf_entry has a variable length. 10111e1bbd8eSDarrick J. Wong * Check the fixed-offset parts of the structure are 10121e1bbd8eSDarrick J. Wong * within the data buffer. 10131e1bbd8eSDarrick J. Wong */ 10141e1bbd8eSDarrick J. Wong if (((char *)sfep + sizeof(*sfep)) >= endp) 10151e1bbd8eSDarrick J. Wong return __this_address; 10161e1bbd8eSDarrick J. Wong 10171e1bbd8eSDarrick J. Wong /* Don't allow names with known bad length. */ 10181e1bbd8eSDarrick J. Wong if (sfep->namelen == 0) 10191e1bbd8eSDarrick J. Wong return __this_address; 10201e1bbd8eSDarrick J. Wong 10211e1bbd8eSDarrick J. Wong /* 10221e1bbd8eSDarrick J. Wong * Check that the variable-length part of the structure is 10231e1bbd8eSDarrick J. Wong * within the data buffer. The next entry starts after the 10241e1bbd8eSDarrick J. Wong * name component, so nextentry is an acceptable test. 10251e1bbd8eSDarrick J. Wong */ 10261e1bbd8eSDarrick J. Wong next_sfep = XFS_ATTR_SF_NEXTENTRY(sfep); 10271e1bbd8eSDarrick J. Wong if ((char *)next_sfep > endp) 10281e1bbd8eSDarrick J. Wong return __this_address; 10291e1bbd8eSDarrick J. Wong 10301e1bbd8eSDarrick J. Wong /* 10311e1bbd8eSDarrick J. Wong * Check for unknown flags. Short form doesn't support 10321e1bbd8eSDarrick J. Wong * the incomplete or local bits, so we can use the namespace 10331e1bbd8eSDarrick J. Wong * mask here. 10341e1bbd8eSDarrick J. Wong */ 10351e1bbd8eSDarrick J. Wong if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK) 10361e1bbd8eSDarrick J. Wong return __this_address; 10371e1bbd8eSDarrick J. Wong 10381e1bbd8eSDarrick J. Wong /* 10391e1bbd8eSDarrick J. Wong * Check for invalid namespace combinations. We only allow 10401e1bbd8eSDarrick J. Wong * one namespace flag per xattr, so we can just count the 10411e1bbd8eSDarrick J. Wong * bits (i.e. hweight) here. 10421e1bbd8eSDarrick J. Wong */ 10431e1bbd8eSDarrick J. Wong if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1) 10441e1bbd8eSDarrick J. Wong return __this_address; 10451e1bbd8eSDarrick J. Wong 10461e1bbd8eSDarrick J. Wong sfep = next_sfep; 10471e1bbd8eSDarrick J. Wong } 10481e1bbd8eSDarrick J. Wong if ((void *)sfep != (void *)endp) 10491e1bbd8eSDarrick J. Wong return __this_address; 10501e1bbd8eSDarrick J. Wong 10511e1bbd8eSDarrick J. Wong return NULL; 10521e1bbd8eSDarrick J. Wong } 10531e1bbd8eSDarrick J. Wong 105430f712c9SDave Chinner /* 105530f712c9SDave Chinner * Convert a leaf attribute list to shortform attribute list 105630f712c9SDave Chinner */ 105730f712c9SDave Chinner int 105830f712c9SDave Chinner xfs_attr3_leaf_to_shortform( 105930f712c9SDave Chinner struct xfs_buf *bp, 106030f712c9SDave Chinner struct xfs_da_args *args, 106130f712c9SDave Chinner int forkoff) 106230f712c9SDave Chinner { 106330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 106430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 106530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 106630f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 106730f712c9SDave Chinner struct xfs_da_args nargs; 106830f712c9SDave Chinner struct xfs_inode *dp = args->dp; 106930f712c9SDave Chinner char *tmpbuffer; 107030f712c9SDave Chinner int error; 107130f712c9SDave Chinner int i; 107230f712c9SDave Chinner 107330f712c9SDave Chinner trace_xfs_attr_leaf_to_sf(args); 107430f712c9SDave Chinner 1075707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(args->geo->blksize, 0); 107630f712c9SDave Chinner if (!tmpbuffer) 10772451337dSDave Chinner return -ENOMEM; 107830f712c9SDave Chinner 107930f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 108030f712c9SDave Chinner 108130f712c9SDave Chinner leaf = (xfs_attr_leafblock_t *)tmpbuffer; 10822f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 108330f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 108430f712c9SDave Chinner 108530f712c9SDave Chinner /* XXX (dgc): buffer is about to be marked stale - why zero it? */ 108630f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 108730f712c9SDave Chinner 108830f712c9SDave Chinner /* 108930f712c9SDave Chinner * Clean out the prior contents of the attribute list. 109030f712c9SDave Chinner */ 109130f712c9SDave Chinner error = xfs_da_shrink_inode(args, 0, bp); 109230f712c9SDave Chinner if (error) 109330f712c9SDave Chinner goto out; 109430f712c9SDave Chinner 109530f712c9SDave Chinner if (forkoff == -1) { 109630f712c9SDave Chinner ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2); 109730f712c9SDave Chinner ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE); 10986dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 109930f712c9SDave Chinner goto out; 110030f712c9SDave Chinner } 110130f712c9SDave Chinner 110230f712c9SDave Chinner xfs_attr_shortform_create(args); 110330f712c9SDave Chinner 110430f712c9SDave Chinner /* 110530f712c9SDave Chinner * Copy the attributes 110630f712c9SDave Chinner */ 110730f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 110830f712c9SDave Chinner nargs.geo = args->geo; 110930f712c9SDave Chinner nargs.dp = dp; 111030f712c9SDave Chinner nargs.total = args->total; 111130f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 111230f712c9SDave Chinner nargs.trans = args->trans; 111330f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 111430f712c9SDave Chinner 111530f712c9SDave Chinner for (i = 0; i < ichdr.count; entry++, i++) { 111630f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 111730f712c9SDave Chinner continue; /* don't copy partial entries */ 111830f712c9SDave Chinner if (!entry->nameidx) 111930f712c9SDave Chinner continue; 112030f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_LOCAL); 112130f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 112230f712c9SDave Chinner nargs.name = name_loc->nameval; 112330f712c9SDave Chinner nargs.namelen = name_loc->namelen; 112430f712c9SDave Chinner nargs.value = &name_loc->nameval[nargs.namelen]; 112530f712c9SDave Chinner nargs.valuelen = be16_to_cpu(name_loc->valuelen); 112630f712c9SDave Chinner nargs.hashval = be32_to_cpu(entry->hashval); 112730f712c9SDave Chinner nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags); 112830f712c9SDave Chinner xfs_attr_shortform_add(&nargs, forkoff); 112930f712c9SDave Chinner } 113030f712c9SDave Chinner error = 0; 113130f712c9SDave Chinner 113230f712c9SDave Chinner out: 113330f712c9SDave Chinner kmem_free(tmpbuffer); 113430f712c9SDave Chinner return error; 113530f712c9SDave Chinner } 113630f712c9SDave Chinner 113730f712c9SDave Chinner /* 113830f712c9SDave Chinner * Convert from using a single leaf to a root node and a leaf. 113930f712c9SDave Chinner */ 114030f712c9SDave Chinner int 114130f712c9SDave Chinner xfs_attr3_leaf_to_node( 114230f712c9SDave Chinner struct xfs_da_args *args) 114330f712c9SDave Chinner { 114430f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 114530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr icleafhdr; 114630f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 114730f712c9SDave Chinner struct xfs_da3_icnode_hdr icnodehdr; 114830f712c9SDave Chinner struct xfs_da_intnode *node; 114930f712c9SDave Chinner struct xfs_inode *dp = args->dp; 115030f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 115130f712c9SDave Chinner struct xfs_buf *bp1 = NULL; 115230f712c9SDave Chinner struct xfs_buf *bp2 = NULL; 115330f712c9SDave Chinner xfs_dablk_t blkno; 115430f712c9SDave Chinner int error; 115530f712c9SDave Chinner 115630f712c9SDave Chinner trace_xfs_attr_leaf_to_node(args); 115730f712c9SDave Chinner 115830f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 115930f712c9SDave Chinner if (error) 116030f712c9SDave Chinner goto out; 1161dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, dp, 0, &bp1); 116230f712c9SDave Chinner if (error) 116330f712c9SDave Chinner goto out; 116430f712c9SDave Chinner 116530f712c9SDave Chinner error = xfs_da_get_buf(args->trans, dp, blkno, -1, &bp2, XFS_ATTR_FORK); 116630f712c9SDave Chinner if (error) 116730f712c9SDave Chinner goto out; 116830f712c9SDave Chinner 116930f712c9SDave Chinner /* copy leaf to new buffer, update identifiers */ 117030f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF); 117130f712c9SDave Chinner bp2->b_ops = bp1->b_ops; 117230f712c9SDave Chinner memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize); 117330f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 117430f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp2->b_addr; 117530f712c9SDave Chinner hdr3->blkno = cpu_to_be64(bp2->b_bn); 117630f712c9SDave Chinner } 117730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1); 117830f712c9SDave Chinner 117930f712c9SDave Chinner /* 118030f712c9SDave Chinner * Set up the new root node. 118130f712c9SDave Chinner */ 118230f712c9SDave Chinner error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK); 118330f712c9SDave Chinner if (error) 118430f712c9SDave Chinner goto out; 118530f712c9SDave Chinner node = bp1->b_addr; 1186f475dc4dSChristoph Hellwig xfs_da3_node_hdr_from_disk(mp, &icnodehdr, node); 118730f712c9SDave Chinner 118830f712c9SDave Chinner leaf = bp2->b_addr; 11892f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf); 119030f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 119130f712c9SDave Chinner 119230f712c9SDave Chinner /* both on-disk, don't endian-flip twice */ 119351908ca7SChristoph Hellwig icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval; 119451908ca7SChristoph Hellwig icnodehdr.btree[0].before = cpu_to_be32(blkno); 119530f712c9SDave Chinner icnodehdr.count = 1; 1196e1c8af1eSChristoph Hellwig xfs_da3_node_hdr_to_disk(dp->i_mount, node, &icnodehdr); 119730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1); 119830f712c9SDave Chinner error = 0; 119930f712c9SDave Chinner out: 120030f712c9SDave Chinner return error; 120130f712c9SDave Chinner } 120230f712c9SDave Chinner 120330f712c9SDave Chinner /*======================================================================== 120430f712c9SDave Chinner * Routines used for growing the Btree. 120530f712c9SDave Chinner *========================================================================*/ 120630f712c9SDave Chinner 120730f712c9SDave Chinner /* 120830f712c9SDave Chinner * Create the initial contents of a leaf attribute list 120930f712c9SDave Chinner * or a leaf in a node attribute list. 121030f712c9SDave Chinner */ 121130f712c9SDave Chinner STATIC int 121230f712c9SDave Chinner xfs_attr3_leaf_create( 121330f712c9SDave Chinner struct xfs_da_args *args, 121430f712c9SDave Chinner xfs_dablk_t blkno, 121530f712c9SDave Chinner struct xfs_buf **bpp) 121630f712c9SDave Chinner { 121730f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 121830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 121930f712c9SDave Chinner struct xfs_inode *dp = args->dp; 122030f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 122130f712c9SDave Chinner struct xfs_buf *bp; 122230f712c9SDave Chinner int error; 122330f712c9SDave Chinner 122430f712c9SDave Chinner trace_xfs_attr_leaf_create(args); 122530f712c9SDave Chinner 122630f712c9SDave Chinner error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp, 122730f712c9SDave Chinner XFS_ATTR_FORK); 122830f712c9SDave Chinner if (error) 122930f712c9SDave Chinner return error; 123030f712c9SDave Chinner bp->b_ops = &xfs_attr3_leaf_buf_ops; 123130f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF); 123230f712c9SDave Chinner leaf = bp->b_addr; 123330f712c9SDave Chinner memset(leaf, 0, args->geo->blksize); 123430f712c9SDave Chinner 123530f712c9SDave Chinner memset(&ichdr, 0, sizeof(ichdr)); 123630f712c9SDave Chinner ichdr.firstused = args->geo->blksize; 123730f712c9SDave Chinner 123830f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 123930f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp->b_addr; 124030f712c9SDave Chinner 124130f712c9SDave Chinner ichdr.magic = XFS_ATTR3_LEAF_MAGIC; 124230f712c9SDave Chinner 124330f712c9SDave Chinner hdr3->blkno = cpu_to_be64(bp->b_bn); 124430f712c9SDave Chinner hdr3->owner = cpu_to_be64(dp->i_ino); 1245ce748eaaSEric Sandeen uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); 124630f712c9SDave Chinner 124730f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr); 124830f712c9SDave Chinner } else { 124930f712c9SDave Chinner ichdr.magic = XFS_ATTR_LEAF_MAGIC; 125030f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr); 125130f712c9SDave Chinner } 125230f712c9SDave Chinner ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base; 125330f712c9SDave Chinner 12542f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 125530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1); 125630f712c9SDave Chinner 125730f712c9SDave Chinner *bpp = bp; 125830f712c9SDave Chinner return 0; 125930f712c9SDave Chinner } 126030f712c9SDave Chinner 126130f712c9SDave Chinner /* 126230f712c9SDave Chinner * Split the leaf node, rebalance, then add the new entry. 126330f712c9SDave Chinner */ 126430f712c9SDave Chinner int 126530f712c9SDave Chinner xfs_attr3_leaf_split( 126630f712c9SDave Chinner struct xfs_da_state *state, 126730f712c9SDave Chinner struct xfs_da_state_blk *oldblk, 126830f712c9SDave Chinner struct xfs_da_state_blk *newblk) 126930f712c9SDave Chinner { 127030f712c9SDave Chinner xfs_dablk_t blkno; 127130f712c9SDave Chinner int error; 127230f712c9SDave Chinner 127330f712c9SDave Chinner trace_xfs_attr_leaf_split(state->args); 127430f712c9SDave Chinner 127530f712c9SDave Chinner /* 127630f712c9SDave Chinner * Allocate space for a new leaf node. 127730f712c9SDave Chinner */ 127830f712c9SDave Chinner ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC); 127930f712c9SDave Chinner error = xfs_da_grow_inode(state->args, &blkno); 128030f712c9SDave Chinner if (error) 128130f712c9SDave Chinner return error; 128230f712c9SDave Chinner error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp); 128330f712c9SDave Chinner if (error) 128430f712c9SDave Chinner return error; 128530f712c9SDave Chinner newblk->blkno = blkno; 128630f712c9SDave Chinner newblk->magic = XFS_ATTR_LEAF_MAGIC; 128730f712c9SDave Chinner 128830f712c9SDave Chinner /* 128930f712c9SDave Chinner * Rebalance the entries across the two leaves. 129030f712c9SDave Chinner * NOTE: rebalance() currently depends on the 2nd block being empty. 129130f712c9SDave Chinner */ 129230f712c9SDave Chinner xfs_attr3_leaf_rebalance(state, oldblk, newblk); 129330f712c9SDave Chinner error = xfs_da3_blk_link(state, oldblk, newblk); 129430f712c9SDave Chinner if (error) 129530f712c9SDave Chinner return error; 129630f712c9SDave Chinner 129730f712c9SDave Chinner /* 129830f712c9SDave Chinner * Save info on "old" attribute for "atomic rename" ops, leaf_add() 129930f712c9SDave Chinner * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the 130030f712c9SDave Chinner * "new" attrs info. Will need the "old" info to remove it later. 130130f712c9SDave Chinner * 130230f712c9SDave Chinner * Insert the "new" entry in the correct block. 130330f712c9SDave Chinner */ 130430f712c9SDave Chinner if (state->inleaf) { 130530f712c9SDave Chinner trace_xfs_attr_leaf_add_old(state->args); 130630f712c9SDave Chinner error = xfs_attr3_leaf_add(oldblk->bp, state->args); 130730f712c9SDave Chinner } else { 130830f712c9SDave Chinner trace_xfs_attr_leaf_add_new(state->args); 130930f712c9SDave Chinner error = xfs_attr3_leaf_add(newblk->bp, state->args); 131030f712c9SDave Chinner } 131130f712c9SDave Chinner 131230f712c9SDave Chinner /* 131330f712c9SDave Chinner * Update last hashval in each block since we added the name. 131430f712c9SDave Chinner */ 131530f712c9SDave Chinner oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL); 131630f712c9SDave Chinner newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL); 131730f712c9SDave Chinner return error; 131830f712c9SDave Chinner } 131930f712c9SDave Chinner 132030f712c9SDave Chinner /* 132130f712c9SDave Chinner * Add a name to the leaf attribute list structure. 132230f712c9SDave Chinner */ 132330f712c9SDave Chinner int 132430f712c9SDave Chinner xfs_attr3_leaf_add( 132530f712c9SDave Chinner struct xfs_buf *bp, 132630f712c9SDave Chinner struct xfs_da_args *args) 132730f712c9SDave Chinner { 132830f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 132930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 133030f712c9SDave Chinner int tablesize; 133130f712c9SDave Chinner int entsize; 133230f712c9SDave Chinner int sum; 133330f712c9SDave Chinner int tmp; 133430f712c9SDave Chinner int i; 133530f712c9SDave Chinner 133630f712c9SDave Chinner trace_xfs_attr_leaf_add(args); 133730f712c9SDave Chinner 133830f712c9SDave Chinner leaf = bp->b_addr; 13392f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 134030f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr.count); 134130f712c9SDave Chinner entsize = xfs_attr_leaf_newentsize(args, NULL); 134230f712c9SDave Chinner 134330f712c9SDave Chinner /* 134430f712c9SDave Chinner * Search through freemap for first-fit on new name length. 134530f712c9SDave Chinner * (may need to figure in size of entry struct too) 134630f712c9SDave Chinner */ 134730f712c9SDave Chinner tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t) 134830f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 134930f712c9SDave Chinner for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) { 135030f712c9SDave Chinner if (tablesize > ichdr.firstused) { 135130f712c9SDave Chinner sum += ichdr.freemap[i].size; 135230f712c9SDave Chinner continue; 135330f712c9SDave Chinner } 135430f712c9SDave Chinner if (!ichdr.freemap[i].size) 135530f712c9SDave Chinner continue; /* no space in this map */ 135630f712c9SDave Chinner tmp = entsize; 135730f712c9SDave Chinner if (ichdr.freemap[i].base < ichdr.firstused) 135830f712c9SDave Chinner tmp += sizeof(xfs_attr_leaf_entry_t); 135930f712c9SDave Chinner if (ichdr.freemap[i].size >= tmp) { 136030f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i); 136130f712c9SDave Chinner goto out_log_hdr; 136230f712c9SDave Chinner } 136330f712c9SDave Chinner sum += ichdr.freemap[i].size; 136430f712c9SDave Chinner } 136530f712c9SDave Chinner 136630f712c9SDave Chinner /* 136730f712c9SDave Chinner * If there are no holes in the address space of the block, 136830f712c9SDave Chinner * and we don't have enough freespace, then compaction will do us 136930f712c9SDave Chinner * no good and we should just give up. 137030f712c9SDave Chinner */ 137130f712c9SDave Chinner if (!ichdr.holes && sum < entsize) 13722451337dSDave Chinner return -ENOSPC; 137330f712c9SDave Chinner 137430f712c9SDave Chinner /* 137530f712c9SDave Chinner * Compact the entries to coalesce free space. 137630f712c9SDave Chinner * This may change the hdr->count via dropping INCOMPLETE entries. 137730f712c9SDave Chinner */ 137830f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr, bp); 137930f712c9SDave Chinner 138030f712c9SDave Chinner /* 138130f712c9SDave Chinner * After compaction, the block is guaranteed to have only one 138230f712c9SDave Chinner * free region, in freemap[0]. If it is not big enough, give up. 138330f712c9SDave Chinner */ 138430f712c9SDave Chinner if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) { 13852451337dSDave Chinner tmp = -ENOSPC; 138630f712c9SDave Chinner goto out_log_hdr; 138730f712c9SDave Chinner } 138830f712c9SDave Chinner 138930f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0); 139030f712c9SDave Chinner 139130f712c9SDave Chinner out_log_hdr: 13922f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 139330f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 139430f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 139530f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 139630f712c9SDave Chinner return tmp; 139730f712c9SDave Chinner } 139830f712c9SDave Chinner 139930f712c9SDave Chinner /* 140030f712c9SDave Chinner * Add a name to a leaf attribute list structure. 140130f712c9SDave Chinner */ 140230f712c9SDave Chinner STATIC int 140330f712c9SDave Chinner xfs_attr3_leaf_add_work( 140430f712c9SDave Chinner struct xfs_buf *bp, 140530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 140630f712c9SDave Chinner struct xfs_da_args *args, 140730f712c9SDave Chinner int mapindex) 140830f712c9SDave Chinner { 140930f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 141030f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 141130f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 141230f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 141330f712c9SDave Chinner struct xfs_mount *mp; 141430f712c9SDave Chinner int tmp; 141530f712c9SDave Chinner int i; 141630f712c9SDave Chinner 141730f712c9SDave Chinner trace_xfs_attr_leaf_add_work(args); 141830f712c9SDave Chinner 141930f712c9SDave Chinner leaf = bp->b_addr; 142030f712c9SDave Chinner ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE); 142130f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr->count); 142230f712c9SDave Chinner 142330f712c9SDave Chinner /* 142430f712c9SDave Chinner * Force open some space in the entry array and fill it in. 142530f712c9SDave Chinner */ 142630f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 142730f712c9SDave Chinner if (args->index < ichdr->count) { 142830f712c9SDave Chinner tmp = ichdr->count - args->index; 142930f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 143030f712c9SDave Chinner memmove(entry + 1, entry, tmp); 143130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 143230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry))); 143330f712c9SDave Chinner } 143430f712c9SDave Chinner ichdr->count++; 143530f712c9SDave Chinner 143630f712c9SDave Chinner /* 143730f712c9SDave Chinner * Allocate space for the new string (at the end of the run). 143830f712c9SDave Chinner */ 143930f712c9SDave Chinner mp = args->trans->t_mountp; 144030f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize); 144130f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0); 144230f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size >= 144330f712c9SDave Chinner xfs_attr_leaf_newentsize(args, NULL)); 144430f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize); 144530f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0); 144630f712c9SDave Chinner 144730f712c9SDave Chinner ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp); 144830f712c9SDave Chinner 144930f712c9SDave Chinner entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base + 145030f712c9SDave Chinner ichdr->freemap[mapindex].size); 145130f712c9SDave Chinner entry->hashval = cpu_to_be32(args->hashval); 145230f712c9SDave Chinner entry->flags = tmp ? XFS_ATTR_LOCAL : 0; 145330f712c9SDave Chinner entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags); 145430f712c9SDave Chinner if (args->op_flags & XFS_DA_OP_RENAME) { 145530f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 145630f712c9SDave Chinner if ((args->blkno2 == args->blkno) && 145730f712c9SDave Chinner (args->index2 <= args->index)) { 145830f712c9SDave Chinner args->index2++; 145930f712c9SDave Chinner } 146030f712c9SDave Chinner } 146130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 146230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 146330f712c9SDave Chinner ASSERT((args->index == 0) || 146430f712c9SDave Chinner (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval))); 146530f712c9SDave Chinner ASSERT((args->index == ichdr->count - 1) || 146630f712c9SDave Chinner (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval))); 146730f712c9SDave Chinner 146830f712c9SDave Chinner /* 146930f712c9SDave Chinner * For "remote" attribute values, simply note that we need to 147030f712c9SDave Chinner * allocate space for the "remote" value. We can't actually 147130f712c9SDave Chinner * allocate the extents in this transaction, and we can't decide 147230f712c9SDave Chinner * which blocks they should be as we might allocate more blocks 147330f712c9SDave Chinner * as part of this transaction (a split operation for example). 147430f712c9SDave Chinner */ 147530f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 147630f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 147730f712c9SDave Chinner name_loc->namelen = args->namelen; 147830f712c9SDave Chinner name_loc->valuelen = cpu_to_be16(args->valuelen); 147930f712c9SDave Chinner memcpy((char *)name_loc->nameval, args->name, args->namelen); 148030f712c9SDave Chinner memcpy((char *)&name_loc->nameval[args->namelen], args->value, 148130f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 148230f712c9SDave Chinner } else { 148330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 148430f712c9SDave Chinner name_rmt->namelen = args->namelen; 148530f712c9SDave Chinner memcpy((char *)name_rmt->name, args->name, args->namelen); 148630f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 148730f712c9SDave Chinner /* just in case */ 148830f712c9SDave Chinner name_rmt->valuelen = 0; 148930f712c9SDave Chinner name_rmt->valueblk = 0; 149030f712c9SDave Chinner args->rmtblkno = 1; 149130f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen); 149230f712c9SDave Chinner args->rmtvaluelen = args->valuelen; 149330f712c9SDave Chinner } 149430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 149530f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 149630f712c9SDave Chinner xfs_attr_leaf_entsize(leaf, args->index))); 149730f712c9SDave Chinner 149830f712c9SDave Chinner /* 149930f712c9SDave Chinner * Update the control info for this leaf node 150030f712c9SDave Chinner */ 150130f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < ichdr->firstused) 150230f712c9SDave Chinner ichdr->firstused = be16_to_cpu(entry->nameidx); 150330f712c9SDave Chinner 150430f712c9SDave Chinner ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t) 150530f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf)); 150630f712c9SDave Chinner tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t) 150730f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 150830f712c9SDave Chinner 150930f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 151030f712c9SDave Chinner if (ichdr->freemap[i].base == tmp) { 151130f712c9SDave Chinner ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t); 15122a2b5932SBrian Foster ichdr->freemap[i].size -= 15132a2b5932SBrian Foster min_t(uint16_t, ichdr->freemap[i].size, 15142a2b5932SBrian Foster sizeof(xfs_attr_leaf_entry_t)); 151530f712c9SDave Chinner } 151630f712c9SDave Chinner } 151730f712c9SDave Chinner ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index); 151830f712c9SDave Chinner return 0; 151930f712c9SDave Chinner } 152030f712c9SDave Chinner 152130f712c9SDave Chinner /* 152230f712c9SDave Chinner * Garbage collect a leaf attribute list block by copying it to a new buffer. 152330f712c9SDave Chinner */ 152430f712c9SDave Chinner STATIC void 152530f712c9SDave Chinner xfs_attr3_leaf_compact( 152630f712c9SDave Chinner struct xfs_da_args *args, 152730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_dst, 152830f712c9SDave Chinner struct xfs_buf *bp) 152930f712c9SDave Chinner { 153030f712c9SDave Chinner struct xfs_attr_leafblock *leaf_src; 153130f712c9SDave Chinner struct xfs_attr_leafblock *leaf_dst; 153230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr_src; 153330f712c9SDave Chinner struct xfs_trans *trans = args->trans; 153430f712c9SDave Chinner char *tmpbuffer; 153530f712c9SDave Chinner 153630f712c9SDave Chinner trace_xfs_attr_leaf_compact(args); 153730f712c9SDave Chinner 1538707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(args->geo->blksize, 0); 153930f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 154030f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 154130f712c9SDave Chinner leaf_src = (xfs_attr_leafblock_t *)tmpbuffer; 154230f712c9SDave Chinner leaf_dst = bp->b_addr; 154330f712c9SDave Chinner 154430f712c9SDave Chinner /* 154530f712c9SDave Chinner * Copy the on-disk header back into the destination buffer to ensure 154630f712c9SDave Chinner * all the information in the header that is not part of the incore 154730f712c9SDave Chinner * header structure is preserved. 154830f712c9SDave Chinner */ 154930f712c9SDave Chinner memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src)); 155030f712c9SDave Chinner 155130f712c9SDave Chinner /* Initialise the incore headers */ 155230f712c9SDave Chinner ichdr_src = *ichdr_dst; /* struct copy */ 155330f712c9SDave Chinner ichdr_dst->firstused = args->geo->blksize; 155430f712c9SDave Chinner ichdr_dst->usedbytes = 0; 155530f712c9SDave Chinner ichdr_dst->count = 0; 155630f712c9SDave Chinner ichdr_dst->holes = 0; 155730f712c9SDave Chinner ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src); 155830f712c9SDave Chinner ichdr_dst->freemap[0].size = ichdr_dst->firstused - 155930f712c9SDave Chinner ichdr_dst->freemap[0].base; 156030f712c9SDave Chinner 156130f712c9SDave Chinner /* write the header back to initialise the underlying buffer */ 15622f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst); 156330f712c9SDave Chinner 156430f712c9SDave Chinner /* 156530f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 156630f712c9SDave Chinner * but allocate name/value pairs packed and in sequence. 156730f712c9SDave Chinner */ 156830f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0, 156930f712c9SDave Chinner leaf_dst, ichdr_dst, 0, ichdr_src.count); 157030f712c9SDave Chinner /* 157130f712c9SDave Chinner * this logs the entire buffer, but the caller must write the header 157230f712c9SDave Chinner * back to the buffer when it is finished modifying it. 157330f712c9SDave Chinner */ 157430f712c9SDave Chinner xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1); 157530f712c9SDave Chinner 157630f712c9SDave Chinner kmem_free(tmpbuffer); 157730f712c9SDave Chinner } 157830f712c9SDave Chinner 157930f712c9SDave Chinner /* 158030f712c9SDave Chinner * Compare two leaf blocks "order". 158130f712c9SDave Chinner * Return 0 unless leaf2 should go before leaf1. 158230f712c9SDave Chinner */ 158330f712c9SDave Chinner static int 158430f712c9SDave Chinner xfs_attr3_leaf_order( 158530f712c9SDave Chinner struct xfs_buf *leaf1_bp, 158630f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf1hdr, 158730f712c9SDave Chinner struct xfs_buf *leaf2_bp, 158830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf2hdr) 158930f712c9SDave Chinner { 159030f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 159130f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 159230f712c9SDave Chinner 159330f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr); 159430f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr); 159530f712c9SDave Chinner if (leaf1hdr->count > 0 && leaf2hdr->count > 0 && 159630f712c9SDave Chinner ((be32_to_cpu(entries2[0].hashval) < 159730f712c9SDave Chinner be32_to_cpu(entries1[0].hashval)) || 159830f712c9SDave Chinner (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) < 159930f712c9SDave Chinner be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) { 160030f712c9SDave Chinner return 1; 160130f712c9SDave Chinner } 160230f712c9SDave Chinner return 0; 160330f712c9SDave Chinner } 160430f712c9SDave Chinner 160530f712c9SDave Chinner int 160630f712c9SDave Chinner xfs_attr_leaf_order( 160730f712c9SDave Chinner struct xfs_buf *leaf1_bp, 160830f712c9SDave Chinner struct xfs_buf *leaf2_bp) 160930f712c9SDave Chinner { 161030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 161130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 1612dbd329f1SChristoph Hellwig struct xfs_mount *mp = leaf1_bp->b_mount; 161330f712c9SDave Chinner 16142f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr); 16152f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr); 161630f712c9SDave Chinner return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2); 161730f712c9SDave Chinner } 161830f712c9SDave Chinner 161930f712c9SDave Chinner /* 162030f712c9SDave Chinner * Redistribute the attribute list entries between two leaf nodes, 162130f712c9SDave Chinner * taking into account the size of the new entry. 162230f712c9SDave Chinner * 162330f712c9SDave Chinner * NOTE: if new block is empty, then it will get the upper half of the 162430f712c9SDave Chinner * old block. At present, all (one) callers pass in an empty second block. 162530f712c9SDave Chinner * 162630f712c9SDave Chinner * This code adjusts the args->index/blkno and args->index2/blkno2 fields 162730f712c9SDave Chinner * to match what it is doing in splitting the attribute leaf block. Those 162830f712c9SDave Chinner * values are used in "atomic rename" operations on attributes. Note that 162930f712c9SDave Chinner * the "new" and "old" values can end up in different blocks. 163030f712c9SDave Chinner */ 163130f712c9SDave Chinner STATIC void 163230f712c9SDave Chinner xfs_attr3_leaf_rebalance( 163330f712c9SDave Chinner struct xfs_da_state *state, 163430f712c9SDave Chinner struct xfs_da_state_blk *blk1, 163530f712c9SDave Chinner struct xfs_da_state_blk *blk2) 163630f712c9SDave Chinner { 163730f712c9SDave Chinner struct xfs_da_args *args; 163830f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 163930f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 164030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 164130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 164230f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 164330f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 164430f712c9SDave Chinner int count; 164530f712c9SDave Chinner int totallen; 164630f712c9SDave Chinner int max; 164730f712c9SDave Chinner int space; 164830f712c9SDave Chinner int swap; 164930f712c9SDave Chinner 165030f712c9SDave Chinner /* 165130f712c9SDave Chinner * Set up environment. 165230f712c9SDave Chinner */ 165330f712c9SDave Chinner ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC); 165430f712c9SDave Chinner ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC); 165530f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 165630f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 16572f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1); 16582f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2); 165930f712c9SDave Chinner ASSERT(ichdr2.count == 0); 166030f712c9SDave Chinner args = state->args; 166130f712c9SDave Chinner 166230f712c9SDave Chinner trace_xfs_attr_leaf_rebalance(args); 166330f712c9SDave Chinner 166430f712c9SDave Chinner /* 166530f712c9SDave Chinner * Check ordering of blocks, reverse if it makes things simpler. 166630f712c9SDave Chinner * 166730f712c9SDave Chinner * NOTE: Given that all (current) callers pass in an empty 166830f712c9SDave Chinner * second block, this code should never set "swap". 166930f712c9SDave Chinner */ 167030f712c9SDave Chinner swap = 0; 167130f712c9SDave Chinner if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) { 16721d5bebbaSGustavo A. R. Silva swap(blk1, blk2); 167330f712c9SDave Chinner 16741d5bebbaSGustavo A. R. Silva /* swap structures rather than reconverting them */ 16751d5bebbaSGustavo A. R. Silva swap(ichdr1, ichdr2); 167630f712c9SDave Chinner 167730f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 167830f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 167930f712c9SDave Chinner swap = 1; 168030f712c9SDave Chinner } 168130f712c9SDave Chinner 168230f712c9SDave Chinner /* 168330f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 168430f712c9SDave Chinner * byte usage between the two blocks to a minimum. Then get 168530f712c9SDave Chinner * the direction to copy and the number of elements to move. 168630f712c9SDave Chinner * 168730f712c9SDave Chinner * "inleaf" is true if the new entry should be inserted into blk1. 168830f712c9SDave Chinner * If "swap" is also true, then reverse the sense of "inleaf". 168930f712c9SDave Chinner */ 169030f712c9SDave Chinner state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1, 169130f712c9SDave Chinner blk2, &ichdr2, 169230f712c9SDave Chinner &count, &totallen); 169330f712c9SDave Chinner if (swap) 169430f712c9SDave Chinner state->inleaf = !state->inleaf; 169530f712c9SDave Chinner 169630f712c9SDave Chinner /* 169730f712c9SDave Chinner * Move any entries required from leaf to leaf: 169830f712c9SDave Chinner */ 169930f712c9SDave Chinner if (count < ichdr1.count) { 170030f712c9SDave Chinner /* 170130f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 170230f712c9SDave Chinner */ 170330f712c9SDave Chinner /* number entries being moved */ 170430f712c9SDave Chinner count = ichdr1.count - count; 170530f712c9SDave Chinner space = ichdr1.usedbytes - totallen; 170630f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 170730f712c9SDave Chinner 170830f712c9SDave Chinner /* 170930f712c9SDave Chinner * leaf2 is the destination, compact it if it looks tight. 171030f712c9SDave Chinner */ 171130f712c9SDave Chinner max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1); 171230f712c9SDave Chinner max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t); 171330f712c9SDave Chinner if (space > max) 171430f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp); 171530f712c9SDave Chinner 171630f712c9SDave Chinner /* 171730f712c9SDave Chinner * Move high entries from leaf1 to low end of leaf2. 171830f712c9SDave Chinner */ 171930f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf1, &ichdr1, 172030f712c9SDave Chinner ichdr1.count - count, leaf2, &ichdr2, 0, count); 172130f712c9SDave Chinner 172230f712c9SDave Chinner } else if (count > ichdr1.count) { 172330f712c9SDave Chinner /* 172430f712c9SDave Chinner * I assert that since all callers pass in an empty 172530f712c9SDave Chinner * second buffer, this code should never execute. 172630f712c9SDave Chinner */ 172730f712c9SDave Chinner ASSERT(0); 172830f712c9SDave Chinner 172930f712c9SDave Chinner /* 173030f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 173130f712c9SDave Chinner */ 173230f712c9SDave Chinner /* number entries being moved */ 173330f712c9SDave Chinner count -= ichdr1.count; 173430f712c9SDave Chinner space = totallen - ichdr1.usedbytes; 173530f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 173630f712c9SDave Chinner 173730f712c9SDave Chinner /* 173830f712c9SDave Chinner * leaf1 is the destination, compact it if it looks tight. 173930f712c9SDave Chinner */ 174030f712c9SDave Chinner max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1); 174130f712c9SDave Chinner max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t); 174230f712c9SDave Chinner if (space > max) 174330f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp); 174430f712c9SDave Chinner 174530f712c9SDave Chinner /* 174630f712c9SDave Chinner * Move low entries from leaf2 to high end of leaf1. 174730f712c9SDave Chinner */ 174830f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1, 174930f712c9SDave Chinner ichdr1.count, count); 175030f712c9SDave Chinner } 175130f712c9SDave Chinner 17522f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1); 17532f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2); 175430f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1); 175530f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1); 175630f712c9SDave Chinner 175730f712c9SDave Chinner /* 175830f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 175930f712c9SDave Chinner */ 176030f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1); 176130f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2); 176230f712c9SDave Chinner blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval); 176330f712c9SDave Chinner blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval); 176430f712c9SDave Chinner 176530f712c9SDave Chinner /* 176630f712c9SDave Chinner * Adjust the expected index for insertion. 176730f712c9SDave Chinner * NOTE: this code depends on the (current) situation that the 176830f712c9SDave Chinner * second block was originally empty. 176930f712c9SDave Chinner * 177030f712c9SDave Chinner * If the insertion point moved to the 2nd block, we must adjust 177130f712c9SDave Chinner * the index. We must also track the entry just following the 177230f712c9SDave Chinner * new entry for use in an "atomic rename" operation, that entry 177330f712c9SDave Chinner * is always the "old" entry and the "new" entry is what we are 177430f712c9SDave Chinner * inserting. The index/blkno fields refer to the "old" entry, 177530f712c9SDave Chinner * while the index2/blkno2 fields refer to the "new" entry. 177630f712c9SDave Chinner */ 177730f712c9SDave Chinner if (blk1->index > ichdr1.count) { 177830f712c9SDave Chinner ASSERT(state->inleaf == 0); 177930f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 178030f712c9SDave Chinner args->index = args->index2 = blk2->index; 178130f712c9SDave Chinner args->blkno = args->blkno2 = blk2->blkno; 178230f712c9SDave Chinner } else if (blk1->index == ichdr1.count) { 178330f712c9SDave Chinner if (state->inleaf) { 178430f712c9SDave Chinner args->index = blk1->index; 178530f712c9SDave Chinner args->blkno = blk1->blkno; 178630f712c9SDave Chinner args->index2 = 0; 178730f712c9SDave Chinner args->blkno2 = blk2->blkno; 178830f712c9SDave Chinner } else { 178930f712c9SDave Chinner /* 179030f712c9SDave Chinner * On a double leaf split, the original attr location 179130f712c9SDave Chinner * is already stored in blkno2/index2, so don't 179230f712c9SDave Chinner * overwrite it overwise we corrupt the tree. 179330f712c9SDave Chinner */ 179430f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 179530f712c9SDave Chinner args->index = blk2->index; 179630f712c9SDave Chinner args->blkno = blk2->blkno; 179730f712c9SDave Chinner if (!state->extravalid) { 179830f712c9SDave Chinner /* 179930f712c9SDave Chinner * set the new attr location to match the old 180030f712c9SDave Chinner * one and let the higher level split code 180130f712c9SDave Chinner * decide where in the leaf to place it. 180230f712c9SDave Chinner */ 180330f712c9SDave Chinner args->index2 = blk2->index; 180430f712c9SDave Chinner args->blkno2 = blk2->blkno; 180530f712c9SDave Chinner } 180630f712c9SDave Chinner } 180730f712c9SDave Chinner } else { 180830f712c9SDave Chinner ASSERT(state->inleaf == 1); 180930f712c9SDave Chinner args->index = args->index2 = blk1->index; 181030f712c9SDave Chinner args->blkno = args->blkno2 = blk1->blkno; 181130f712c9SDave Chinner } 181230f712c9SDave Chinner } 181330f712c9SDave Chinner 181430f712c9SDave Chinner /* 181530f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 181630f712c9SDave Chinner * byte usage between the two blocks to a minimum. 181730f712c9SDave Chinner * GROT: Is this really necessary? With other than a 512 byte blocksize, 181830f712c9SDave Chinner * GROT: there will always be enough room in either block for a new entry. 181930f712c9SDave Chinner * GROT: Do a double-split for this case? 182030f712c9SDave Chinner */ 182130f712c9SDave Chinner STATIC int 182230f712c9SDave Chinner xfs_attr3_leaf_figure_balance( 182330f712c9SDave Chinner struct xfs_da_state *state, 182430f712c9SDave Chinner struct xfs_da_state_blk *blk1, 182530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 182630f712c9SDave Chinner struct xfs_da_state_blk *blk2, 182730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 182830f712c9SDave Chinner int *countarg, 182930f712c9SDave Chinner int *usedbytesarg) 183030f712c9SDave Chinner { 183130f712c9SDave Chinner struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr; 183230f712c9SDave Chinner struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr; 183330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 183430f712c9SDave Chinner int count; 183530f712c9SDave Chinner int max; 183630f712c9SDave Chinner int index; 183730f712c9SDave Chinner int totallen = 0; 183830f712c9SDave Chinner int half; 183930f712c9SDave Chinner int lastdelta; 184030f712c9SDave Chinner int foundit = 0; 184130f712c9SDave Chinner int tmp; 184230f712c9SDave Chinner 184330f712c9SDave Chinner /* 184430f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 184530f712c9SDave Chinner * byte usage between the two blocks to a minimum. 184630f712c9SDave Chinner */ 184730f712c9SDave Chinner max = ichdr1->count + ichdr2->count; 184830f712c9SDave Chinner half = (max + 1) * sizeof(*entry); 184930f712c9SDave Chinner half += ichdr1->usedbytes + ichdr2->usedbytes + 185030f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 185130f712c9SDave Chinner half /= 2; 185230f712c9SDave Chinner lastdelta = state->args->geo->blksize; 185330f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 185430f712c9SDave Chinner for (count = index = 0; count < max; entry++, index++, count++) { 185530f712c9SDave Chinner 185630f712c9SDave Chinner #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A)) 185730f712c9SDave Chinner /* 185830f712c9SDave Chinner * The new entry is in the first block, account for it. 185930f712c9SDave Chinner */ 186030f712c9SDave Chinner if (count == blk1->index) { 186130f712c9SDave Chinner tmp = totallen + sizeof(*entry) + 186230f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 186330f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 186430f712c9SDave Chinner break; 186530f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 186630f712c9SDave Chinner totallen = tmp; 186730f712c9SDave Chinner foundit = 1; 186830f712c9SDave Chinner } 186930f712c9SDave Chinner 187030f712c9SDave Chinner /* 187130f712c9SDave Chinner * Wrap around into the second block if necessary. 187230f712c9SDave Chinner */ 187330f712c9SDave Chinner if (count == ichdr1->count) { 187430f712c9SDave Chinner leaf1 = leaf2; 187530f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 187630f712c9SDave Chinner index = 0; 187730f712c9SDave Chinner } 187830f712c9SDave Chinner 187930f712c9SDave Chinner /* 188030f712c9SDave Chinner * Figure out if next leaf entry would be too much. 188130f712c9SDave Chinner */ 188230f712c9SDave Chinner tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1, 188330f712c9SDave Chinner index); 188430f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 188530f712c9SDave Chinner break; 188630f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 188730f712c9SDave Chinner totallen = tmp; 188830f712c9SDave Chinner #undef XFS_ATTR_ABS 188930f712c9SDave Chinner } 189030f712c9SDave Chinner 189130f712c9SDave Chinner /* 189230f712c9SDave Chinner * Calculate the number of usedbytes that will end up in lower block. 189330f712c9SDave Chinner * If new entry not in lower block, fix up the count. 189430f712c9SDave Chinner */ 189530f712c9SDave Chinner totallen -= count * sizeof(*entry); 189630f712c9SDave Chinner if (foundit) { 189730f712c9SDave Chinner totallen -= sizeof(*entry) + 189830f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 189930f712c9SDave Chinner } 190030f712c9SDave Chinner 190130f712c9SDave Chinner *countarg = count; 190230f712c9SDave Chinner *usedbytesarg = totallen; 190330f712c9SDave Chinner return foundit; 190430f712c9SDave Chinner } 190530f712c9SDave Chinner 190630f712c9SDave Chinner /*======================================================================== 190730f712c9SDave Chinner * Routines used for shrinking the Btree. 190830f712c9SDave Chinner *========================================================================*/ 190930f712c9SDave Chinner 191030f712c9SDave Chinner /* 191130f712c9SDave Chinner * Check a leaf block and its neighbors to see if the block should be 191230f712c9SDave Chinner * collapsed into one or the other neighbor. Always keep the block 191330f712c9SDave Chinner * with the smaller block number. 191430f712c9SDave Chinner * If the current block is over 50% full, don't try to join it, return 0. 191530f712c9SDave Chinner * If the block is empty, fill in the state structure and return 2. 191630f712c9SDave Chinner * If it can be collapsed, fill in the state structure and return 1. 191730f712c9SDave Chinner * If nothing can be done, return 0. 191830f712c9SDave Chinner * 191930f712c9SDave Chinner * GROT: allow for INCOMPLETE entries in calculation. 192030f712c9SDave Chinner */ 192130f712c9SDave Chinner int 192230f712c9SDave Chinner xfs_attr3_leaf_toosmall( 192330f712c9SDave Chinner struct xfs_da_state *state, 192430f712c9SDave Chinner int *action) 192530f712c9SDave Chinner { 192630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 192730f712c9SDave Chinner struct xfs_da_state_blk *blk; 192830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 192930f712c9SDave Chinner struct xfs_buf *bp; 193030f712c9SDave Chinner xfs_dablk_t blkno; 193130f712c9SDave Chinner int bytes; 193230f712c9SDave Chinner int forward; 193330f712c9SDave Chinner int error; 193430f712c9SDave Chinner int retval; 193530f712c9SDave Chinner int i; 193630f712c9SDave Chinner 193730f712c9SDave Chinner trace_xfs_attr_leaf_toosmall(state->args); 193830f712c9SDave Chinner 193930f712c9SDave Chinner /* 194030f712c9SDave Chinner * Check for the degenerate case of the block being over 50% full. 194130f712c9SDave Chinner * If so, it's not worth even looking to see if we might be able 194230f712c9SDave Chinner * to coalesce with a sibling. 194330f712c9SDave Chinner */ 194430f712c9SDave Chinner blk = &state->path.blk[ state->path.active-1 ]; 194530f712c9SDave Chinner leaf = blk->bp->b_addr; 19462f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf); 194730f712c9SDave Chinner bytes = xfs_attr3_leaf_hdr_size(leaf) + 194830f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t) + 194930f712c9SDave Chinner ichdr.usedbytes; 195030f712c9SDave Chinner if (bytes > (state->args->geo->blksize >> 1)) { 195130f712c9SDave Chinner *action = 0; /* blk over 50%, don't try to join */ 195230f712c9SDave Chinner return 0; 195330f712c9SDave Chinner } 195430f712c9SDave Chinner 195530f712c9SDave Chinner /* 195630f712c9SDave Chinner * Check for the degenerate case of the block being empty. 195730f712c9SDave Chinner * If the block is empty, we'll simply delete it, no need to 195830f712c9SDave Chinner * coalesce it with a sibling block. We choose (arbitrarily) 195930f712c9SDave Chinner * to merge with the forward block unless it is NULL. 196030f712c9SDave Chinner */ 196130f712c9SDave Chinner if (ichdr.count == 0) { 196230f712c9SDave Chinner /* 196330f712c9SDave Chinner * Make altpath point to the block we want to keep and 196430f712c9SDave Chinner * path point to the block we want to drop (this one). 196530f712c9SDave Chinner */ 196630f712c9SDave Chinner forward = (ichdr.forw != 0); 196730f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 196830f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 196930f712c9SDave Chinner 0, &retval); 197030f712c9SDave Chinner if (error) 197130f712c9SDave Chinner return error; 197230f712c9SDave Chinner if (retval) { 197330f712c9SDave Chinner *action = 0; 197430f712c9SDave Chinner } else { 197530f712c9SDave Chinner *action = 2; 197630f712c9SDave Chinner } 197730f712c9SDave Chinner return 0; 197830f712c9SDave Chinner } 197930f712c9SDave Chinner 198030f712c9SDave Chinner /* 198130f712c9SDave Chinner * Examine each sibling block to see if we can coalesce with 198230f712c9SDave Chinner * at least 25% free space to spare. We need to figure out 198330f712c9SDave Chinner * whether to merge with the forward or the backward block. 198430f712c9SDave Chinner * We prefer coalescing with the lower numbered sibling so as 198530f712c9SDave Chinner * to shrink an attribute list over time. 198630f712c9SDave Chinner */ 198730f712c9SDave Chinner /* start with smaller blk num */ 198830f712c9SDave Chinner forward = ichdr.forw < ichdr.back; 198930f712c9SDave Chinner for (i = 0; i < 2; forward = !forward, i++) { 199030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 199130f712c9SDave Chinner if (forward) 199230f712c9SDave Chinner blkno = ichdr.forw; 199330f712c9SDave Chinner else 199430f712c9SDave Chinner blkno = ichdr.back; 199530f712c9SDave Chinner if (blkno == 0) 199630f712c9SDave Chinner continue; 199730f712c9SDave Chinner error = xfs_attr3_leaf_read(state->args->trans, state->args->dp, 1998dfb87594SChristoph Hellwig blkno, &bp); 199930f712c9SDave Chinner if (error) 200030f712c9SDave Chinner return error; 200130f712c9SDave Chinner 20022f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr); 200330f712c9SDave Chinner 200430f712c9SDave Chinner bytes = state->args->geo->blksize - 200530f712c9SDave Chinner (state->args->geo->blksize >> 2) - 200630f712c9SDave Chinner ichdr.usedbytes - ichdr2.usedbytes - 200730f712c9SDave Chinner ((ichdr.count + ichdr2.count) * 200830f712c9SDave Chinner sizeof(xfs_attr_leaf_entry_t)) - 200930f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf); 201030f712c9SDave Chinner 201130f712c9SDave Chinner xfs_trans_brelse(state->args->trans, bp); 201230f712c9SDave Chinner if (bytes >= 0) 201330f712c9SDave Chinner break; /* fits with at least 25% to spare */ 201430f712c9SDave Chinner } 201530f712c9SDave Chinner if (i >= 2) { 201630f712c9SDave Chinner *action = 0; 201730f712c9SDave Chinner return 0; 201830f712c9SDave Chinner } 201930f712c9SDave Chinner 202030f712c9SDave Chinner /* 202130f712c9SDave Chinner * Make altpath point to the block we want to keep (the lower 202230f712c9SDave Chinner * numbered block) and path point to the block we want to drop. 202330f712c9SDave Chinner */ 202430f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 202530f712c9SDave Chinner if (blkno < blk->blkno) { 202630f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 202730f712c9SDave Chinner 0, &retval); 202830f712c9SDave Chinner } else { 202930f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->path, forward, 203030f712c9SDave Chinner 0, &retval); 203130f712c9SDave Chinner } 203230f712c9SDave Chinner if (error) 203330f712c9SDave Chinner return error; 203430f712c9SDave Chinner if (retval) { 203530f712c9SDave Chinner *action = 0; 203630f712c9SDave Chinner } else { 203730f712c9SDave Chinner *action = 1; 203830f712c9SDave Chinner } 203930f712c9SDave Chinner return 0; 204030f712c9SDave Chinner } 204130f712c9SDave Chinner 204230f712c9SDave Chinner /* 204330f712c9SDave Chinner * Remove a name from the leaf attribute list structure. 204430f712c9SDave Chinner * 204530f712c9SDave Chinner * Return 1 if leaf is less than 37% full, 0 if >= 37% full. 204630f712c9SDave Chinner * If two leaves are 37% full, when combined they will leave 25% free. 204730f712c9SDave Chinner */ 204830f712c9SDave Chinner int 204930f712c9SDave Chinner xfs_attr3_leaf_remove( 205030f712c9SDave Chinner struct xfs_buf *bp, 205130f712c9SDave Chinner struct xfs_da_args *args) 205230f712c9SDave Chinner { 205330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 205430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 205530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 205630f712c9SDave Chinner int before; 205730f712c9SDave Chinner int after; 205830f712c9SDave Chinner int smallest; 205930f712c9SDave Chinner int entsize; 206030f712c9SDave Chinner int tablesize; 206130f712c9SDave Chinner int tmp; 206230f712c9SDave Chinner int i; 206330f712c9SDave Chinner 206430f712c9SDave Chinner trace_xfs_attr_leaf_remove(args); 206530f712c9SDave Chinner 206630f712c9SDave Chinner leaf = bp->b_addr; 20672f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 206830f712c9SDave Chinner 206930f712c9SDave Chinner ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8); 207030f712c9SDave Chinner ASSERT(args->index >= 0 && args->index < ichdr.count); 207130f712c9SDave Chinner ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) + 207230f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf)); 207330f712c9SDave Chinner 207430f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 207530f712c9SDave Chinner 207630f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 207730f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 207830f712c9SDave Chinner 207930f712c9SDave Chinner /* 208030f712c9SDave Chinner * Scan through free region table: 208130f712c9SDave Chinner * check for adjacency of free'd entry with an existing one, 208230f712c9SDave Chinner * find smallest free region in case we need to replace it, 208330f712c9SDave Chinner * adjust any map that borders the entry table, 208430f712c9SDave Chinner */ 208530f712c9SDave Chinner tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t) 208630f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 208730f712c9SDave Chinner tmp = ichdr.freemap[0].size; 208830f712c9SDave Chinner before = after = -1; 208930f712c9SDave Chinner smallest = XFS_ATTR_LEAF_MAPSIZE - 1; 209030f712c9SDave Chinner entsize = xfs_attr_leaf_entsize(leaf, args->index); 209130f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 209230f712c9SDave Chinner ASSERT(ichdr.freemap[i].base < args->geo->blksize); 209330f712c9SDave Chinner ASSERT(ichdr.freemap[i].size < args->geo->blksize); 209430f712c9SDave Chinner if (ichdr.freemap[i].base == tablesize) { 209530f712c9SDave Chinner ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t); 209630f712c9SDave Chinner ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t); 209730f712c9SDave Chinner } 209830f712c9SDave Chinner 209930f712c9SDave Chinner if (ichdr.freemap[i].base + ichdr.freemap[i].size == 210030f712c9SDave Chinner be16_to_cpu(entry->nameidx)) { 210130f712c9SDave Chinner before = i; 210230f712c9SDave Chinner } else if (ichdr.freemap[i].base == 210330f712c9SDave Chinner (be16_to_cpu(entry->nameidx) + entsize)) { 210430f712c9SDave Chinner after = i; 210530f712c9SDave Chinner } else if (ichdr.freemap[i].size < tmp) { 210630f712c9SDave Chinner tmp = ichdr.freemap[i].size; 210730f712c9SDave Chinner smallest = i; 210830f712c9SDave Chinner } 210930f712c9SDave Chinner } 211030f712c9SDave Chinner 211130f712c9SDave Chinner /* 211230f712c9SDave Chinner * Coalesce adjacent freemap regions, 211330f712c9SDave Chinner * or replace the smallest region. 211430f712c9SDave Chinner */ 211530f712c9SDave Chinner if ((before >= 0) || (after >= 0)) { 211630f712c9SDave Chinner if ((before >= 0) && (after >= 0)) { 211730f712c9SDave Chinner ichdr.freemap[before].size += entsize; 211830f712c9SDave Chinner ichdr.freemap[before].size += ichdr.freemap[after].size; 211930f712c9SDave Chinner ichdr.freemap[after].base = 0; 212030f712c9SDave Chinner ichdr.freemap[after].size = 0; 212130f712c9SDave Chinner } else if (before >= 0) { 212230f712c9SDave Chinner ichdr.freemap[before].size += entsize; 212330f712c9SDave Chinner } else { 212430f712c9SDave Chinner ichdr.freemap[after].base = be16_to_cpu(entry->nameidx); 212530f712c9SDave Chinner ichdr.freemap[after].size += entsize; 212630f712c9SDave Chinner } 212730f712c9SDave Chinner } else { 212830f712c9SDave Chinner /* 212930f712c9SDave Chinner * Replace smallest region (if it is smaller than free'd entry) 213030f712c9SDave Chinner */ 213130f712c9SDave Chinner if (ichdr.freemap[smallest].size < entsize) { 213230f712c9SDave Chinner ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx); 213330f712c9SDave Chinner ichdr.freemap[smallest].size = entsize; 213430f712c9SDave Chinner } 213530f712c9SDave Chinner } 213630f712c9SDave Chinner 213730f712c9SDave Chinner /* 213830f712c9SDave Chinner * Did we remove the first entry? 213930f712c9SDave Chinner */ 214030f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) == ichdr.firstused) 214130f712c9SDave Chinner smallest = 1; 214230f712c9SDave Chinner else 214330f712c9SDave Chinner smallest = 0; 214430f712c9SDave Chinner 214530f712c9SDave Chinner /* 214630f712c9SDave Chinner * Compress the remaining entries and zero out the removed stuff. 214730f712c9SDave Chinner */ 214830f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize); 214930f712c9SDave Chinner ichdr.usedbytes -= entsize; 215030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 215130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 215230f712c9SDave Chinner entsize)); 215330f712c9SDave Chinner 215430f712c9SDave Chinner tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t); 215530f712c9SDave Chinner memmove(entry, entry + 1, tmp); 215630f712c9SDave Chinner ichdr.count--; 215730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 215830f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t))); 215930f712c9SDave Chinner 216030f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count]; 216130f712c9SDave Chinner memset(entry, 0, sizeof(xfs_attr_leaf_entry_t)); 216230f712c9SDave Chinner 216330f712c9SDave Chinner /* 216430f712c9SDave Chinner * If we removed the first entry, re-find the first used byte 216530f712c9SDave Chinner * in the name area. Note that if the entry was the "firstused", 216630f712c9SDave Chinner * then we don't have a "hole" in our block resulting from 216730f712c9SDave Chinner * removing the name. 216830f712c9SDave Chinner */ 216930f712c9SDave Chinner if (smallest) { 217030f712c9SDave Chinner tmp = args->geo->blksize; 217130f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 217230f712c9SDave Chinner for (i = ichdr.count - 1; i >= 0; entry++, i--) { 217330f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 217430f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 217530f712c9SDave Chinner 217630f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < tmp) 217730f712c9SDave Chinner tmp = be16_to_cpu(entry->nameidx); 217830f712c9SDave Chinner } 217930f712c9SDave Chinner ichdr.firstused = tmp; 218066db8104SBrian Foster ASSERT(ichdr.firstused != 0); 218130f712c9SDave Chinner } else { 218230f712c9SDave Chinner ichdr.holes = 1; /* mark as needing compaction */ 218330f712c9SDave Chinner } 21842f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 218530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 218630f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 218730f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 218830f712c9SDave Chinner 218930f712c9SDave Chinner /* 219030f712c9SDave Chinner * Check if leaf is less than 50% full, caller may want to 219130f712c9SDave Chinner * "join" the leaf with a sibling if so. 219230f712c9SDave Chinner */ 219330f712c9SDave Chinner tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) + 219430f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t); 219530f712c9SDave Chinner 219630f712c9SDave Chinner return tmp < args->geo->magicpct; /* leaf is < 37% full */ 219730f712c9SDave Chinner } 219830f712c9SDave Chinner 219930f712c9SDave Chinner /* 220030f712c9SDave Chinner * Move all the attribute list entries from drop_leaf into save_leaf. 220130f712c9SDave Chinner */ 220230f712c9SDave Chinner void 220330f712c9SDave Chinner xfs_attr3_leaf_unbalance( 220430f712c9SDave Chinner struct xfs_da_state *state, 220530f712c9SDave Chinner struct xfs_da_state_blk *drop_blk, 220630f712c9SDave Chinner struct xfs_da_state_blk *save_blk) 220730f712c9SDave Chinner { 220830f712c9SDave Chinner struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr; 220930f712c9SDave Chinner struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr; 221030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr drophdr; 221130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr savehdr; 221230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 221330f712c9SDave Chinner 221430f712c9SDave Chinner trace_xfs_attr_leaf_unbalance(state->args); 221530f712c9SDave Chinner 221630f712c9SDave Chinner drop_leaf = drop_blk->bp->b_addr; 221730f712c9SDave Chinner save_leaf = save_blk->bp->b_addr; 22182f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf); 22192f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf); 222030f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(drop_leaf); 222130f712c9SDave Chinner 222230f712c9SDave Chinner /* 222330f712c9SDave Chinner * Save last hashval from dying block for later Btree fixup. 222430f712c9SDave Chinner */ 222530f712c9SDave Chinner drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval); 222630f712c9SDave Chinner 222730f712c9SDave Chinner /* 222830f712c9SDave Chinner * Check if we need a temp buffer, or can we do it in place. 222930f712c9SDave Chinner * Note that we don't check "leaf" for holes because we will 223030f712c9SDave Chinner * always be dropping it, toosmall() decided that for us already. 223130f712c9SDave Chinner */ 223230f712c9SDave Chinner if (savehdr.holes == 0) { 223330f712c9SDave Chinner /* 223430f712c9SDave Chinner * dest leaf has no holes, so we add there. May need 223530f712c9SDave Chinner * to make some room in the entry array. 223630f712c9SDave Chinner */ 223730f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 223830f712c9SDave Chinner drop_blk->bp, &drophdr)) { 223930f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 224030f712c9SDave Chinner drop_leaf, &drophdr, 0, 224130f712c9SDave Chinner save_leaf, &savehdr, 0, 224230f712c9SDave Chinner drophdr.count); 224330f712c9SDave Chinner } else { 224430f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 224530f712c9SDave Chinner drop_leaf, &drophdr, 0, 224630f712c9SDave Chinner save_leaf, &savehdr, 224730f712c9SDave Chinner savehdr.count, drophdr.count); 224830f712c9SDave Chinner } 224930f712c9SDave Chinner } else { 225030f712c9SDave Chinner /* 225130f712c9SDave Chinner * Destination has holes, so we make a temporary copy 225230f712c9SDave Chinner * of the leaf and add them both to that. 225330f712c9SDave Chinner */ 225430f712c9SDave Chinner struct xfs_attr_leafblock *tmp_leaf; 225530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr tmphdr; 225630f712c9SDave Chinner 2257707e0ddaSTetsuo Handa tmp_leaf = kmem_zalloc(state->args->geo->blksize, 0); 225830f712c9SDave Chinner 225930f712c9SDave Chinner /* 226030f712c9SDave Chinner * Copy the header into the temp leaf so that all the stuff 226130f712c9SDave Chinner * not in the incore header is present and gets copied back in 226230f712c9SDave Chinner * once we've moved all the entries. 226330f712c9SDave Chinner */ 226430f712c9SDave Chinner memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf)); 226530f712c9SDave Chinner 226630f712c9SDave Chinner memset(&tmphdr, 0, sizeof(tmphdr)); 226730f712c9SDave Chinner tmphdr.magic = savehdr.magic; 226830f712c9SDave Chinner tmphdr.forw = savehdr.forw; 226930f712c9SDave Chinner tmphdr.back = savehdr.back; 227030f712c9SDave Chinner tmphdr.firstused = state->args->geo->blksize; 227130f712c9SDave Chinner 227230f712c9SDave Chinner /* write the header to the temp buffer to initialise it */ 22732f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr); 227430f712c9SDave Chinner 227530f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 227630f712c9SDave Chinner drop_blk->bp, &drophdr)) { 227730f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 227830f712c9SDave Chinner drop_leaf, &drophdr, 0, 227930f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 228030f712c9SDave Chinner drophdr.count); 228130f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 228230f712c9SDave Chinner save_leaf, &savehdr, 0, 228330f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 228430f712c9SDave Chinner savehdr.count); 228530f712c9SDave Chinner } else { 228630f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 228730f712c9SDave Chinner save_leaf, &savehdr, 0, 228830f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 228930f712c9SDave Chinner savehdr.count); 229030f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 229130f712c9SDave Chinner drop_leaf, &drophdr, 0, 229230f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 229330f712c9SDave Chinner drophdr.count); 229430f712c9SDave Chinner } 229530f712c9SDave Chinner memcpy(save_leaf, tmp_leaf, state->args->geo->blksize); 229630f712c9SDave Chinner savehdr = tmphdr; /* struct copy */ 229730f712c9SDave Chinner kmem_free(tmp_leaf); 229830f712c9SDave Chinner } 229930f712c9SDave Chinner 23002f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr); 230130f712c9SDave Chinner xfs_trans_log_buf(state->args->trans, save_blk->bp, 0, 230230f712c9SDave Chinner state->args->geo->blksize - 1); 230330f712c9SDave Chinner 230430f712c9SDave Chinner /* 230530f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 230630f712c9SDave Chinner */ 230730f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(save_leaf); 230830f712c9SDave Chinner save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval); 230930f712c9SDave Chinner } 231030f712c9SDave Chinner 231130f712c9SDave Chinner /*======================================================================== 231230f712c9SDave Chinner * Routines used for finding things in the Btree. 231330f712c9SDave Chinner *========================================================================*/ 231430f712c9SDave Chinner 231530f712c9SDave Chinner /* 231630f712c9SDave Chinner * Look up a name in a leaf attribute list structure. 231730f712c9SDave Chinner * This is the internal routine, it uses the caller's buffer. 231830f712c9SDave Chinner * 231930f712c9SDave Chinner * Note that duplicate keys are allowed, but only check within the 232030f712c9SDave Chinner * current leaf node. The Btree code must check in adjacent leaf nodes. 232130f712c9SDave Chinner * 232230f712c9SDave Chinner * Return in args->index the index into the entry[] array of either 232330f712c9SDave Chinner * the found entry, or where the entry should have been (insert before 232430f712c9SDave Chinner * that entry). 232530f712c9SDave Chinner * 232630f712c9SDave Chinner * Don't change the args->value unless we find the attribute. 232730f712c9SDave Chinner */ 232830f712c9SDave Chinner int 232930f712c9SDave Chinner xfs_attr3_leaf_lookup_int( 233030f712c9SDave Chinner struct xfs_buf *bp, 233130f712c9SDave Chinner struct xfs_da_args *args) 233230f712c9SDave Chinner { 233330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 233430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 233530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 233630f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 233730f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 233830f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 233930f712c9SDave Chinner xfs_dahash_t hashval; 234030f712c9SDave Chinner int probe; 234130f712c9SDave Chinner int span; 234230f712c9SDave Chinner 234330f712c9SDave Chinner trace_xfs_attr_leaf_lookup(args); 234430f712c9SDave Chinner 234530f712c9SDave Chinner leaf = bp->b_addr; 23462f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 234730f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 2348a5155b87SDarrick J. Wong if (ichdr.count >= args->geo->blksize / 8) { 2349a5155b87SDarrick J. Wong xfs_buf_corruption_error(bp); 23508ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2351a5155b87SDarrick J. Wong } 235230f712c9SDave Chinner 235330f712c9SDave Chinner /* 235430f712c9SDave Chinner * Binary search. (note: small blocks will skip this loop) 235530f712c9SDave Chinner */ 235630f712c9SDave Chinner hashval = args->hashval; 235730f712c9SDave Chinner probe = span = ichdr.count / 2; 235830f712c9SDave Chinner for (entry = &entries[probe]; span > 4; entry = &entries[probe]) { 235930f712c9SDave Chinner span /= 2; 236030f712c9SDave Chinner if (be32_to_cpu(entry->hashval) < hashval) 236130f712c9SDave Chinner probe += span; 236230f712c9SDave Chinner else if (be32_to_cpu(entry->hashval) > hashval) 236330f712c9SDave Chinner probe -= span; 236430f712c9SDave Chinner else 236530f712c9SDave Chinner break; 236630f712c9SDave Chinner } 2367a5155b87SDarrick J. Wong if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count))) { 2368a5155b87SDarrick J. Wong xfs_buf_corruption_error(bp); 23698ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2370a5155b87SDarrick J. Wong } 2371a5155b87SDarrick J. Wong if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval)) { 2372a5155b87SDarrick J. Wong xfs_buf_corruption_error(bp); 23738ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2374a5155b87SDarrick J. Wong } 237530f712c9SDave Chinner 237630f712c9SDave Chinner /* 237730f712c9SDave Chinner * Since we may have duplicate hashval's, find the first matching 237830f712c9SDave Chinner * hashval in the leaf. 237930f712c9SDave Chinner */ 238030f712c9SDave Chinner while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) { 238130f712c9SDave Chinner entry--; 238230f712c9SDave Chinner probe--; 238330f712c9SDave Chinner } 238430f712c9SDave Chinner while (probe < ichdr.count && 238530f712c9SDave Chinner be32_to_cpu(entry->hashval) < hashval) { 238630f712c9SDave Chinner entry++; 238730f712c9SDave Chinner probe++; 238830f712c9SDave Chinner } 238930f712c9SDave Chinner if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) { 239030f712c9SDave Chinner args->index = probe; 23912451337dSDave Chinner return -ENOATTR; 239230f712c9SDave Chinner } 239330f712c9SDave Chinner 239430f712c9SDave Chinner /* 239530f712c9SDave Chinner * Duplicate keys may be present, so search all of them for a match. 239630f712c9SDave Chinner */ 239730f712c9SDave Chinner for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval); 239830f712c9SDave Chinner entry++, probe++) { 239930f712c9SDave Chinner /* 240030f712c9SDave Chinner * GROT: Add code to remove incomplete entries. 240130f712c9SDave Chinner */ 240230f712c9SDave Chinner /* 240330f712c9SDave Chinner * If we are looking for INCOMPLETE entries, show only those. 240430f712c9SDave Chinner * If we are looking for complete entries, show only those. 240530f712c9SDave Chinner */ 240630f712c9SDave Chinner if ((args->flags & XFS_ATTR_INCOMPLETE) != 240730f712c9SDave Chinner (entry->flags & XFS_ATTR_INCOMPLETE)) { 240830f712c9SDave Chinner continue; 240930f712c9SDave Chinner } 241030f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 241130f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, probe); 241230f712c9SDave Chinner if (name_loc->namelen != args->namelen) 241330f712c9SDave Chinner continue; 241430f712c9SDave Chinner if (memcmp(args->name, name_loc->nameval, 241530f712c9SDave Chinner args->namelen) != 0) 241630f712c9SDave Chinner continue; 241730f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, entry->flags)) 241830f712c9SDave Chinner continue; 241930f712c9SDave Chinner args->index = probe; 24202451337dSDave Chinner return -EEXIST; 242130f712c9SDave Chinner } else { 242230f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, probe); 242330f712c9SDave Chinner if (name_rmt->namelen != args->namelen) 242430f712c9SDave Chinner continue; 242530f712c9SDave Chinner if (memcmp(args->name, name_rmt->name, 242630f712c9SDave Chinner args->namelen) != 0) 242730f712c9SDave Chinner continue; 242830f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, entry->flags)) 242930f712c9SDave Chinner continue; 243030f712c9SDave Chinner args->index = probe; 243130f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 243230f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 243330f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks( 243430f712c9SDave Chinner args->dp->i_mount, 243530f712c9SDave Chinner args->rmtvaluelen); 24362451337dSDave Chinner return -EEXIST; 243730f712c9SDave Chinner } 243830f712c9SDave Chinner } 243930f712c9SDave Chinner args->index = probe; 24402451337dSDave Chinner return -ENOATTR; 244130f712c9SDave Chinner } 244230f712c9SDave Chinner 244330f712c9SDave Chinner /* 244430f712c9SDave Chinner * Get the value associated with an attribute name from a leaf attribute 244530f712c9SDave Chinner * list structure. 2446728bcaa3SDave Chinner * 2447728bcaa3SDave Chinner * If ATTR_KERNOVAL is specified, only the length needs to be returned. 2448728bcaa3SDave Chinner * Unlike a lookup, we only return an error if the attribute does not 2449728bcaa3SDave Chinner * exist or we can't retrieve the value. 245030f712c9SDave Chinner */ 245130f712c9SDave Chinner int 245230f712c9SDave Chinner xfs_attr3_leaf_getvalue( 245330f712c9SDave Chinner struct xfs_buf *bp, 245430f712c9SDave Chinner struct xfs_da_args *args) 245530f712c9SDave Chinner { 245630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 245730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 245830f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 245930f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 246030f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 246130f712c9SDave Chinner 246230f712c9SDave Chinner leaf = bp->b_addr; 24632f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 246430f712c9SDave Chinner ASSERT(ichdr.count < args->geo->blksize / 8); 246530f712c9SDave Chinner ASSERT(args->index < ichdr.count); 246630f712c9SDave Chinner 246730f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 246830f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 246930f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 247030f712c9SDave Chinner ASSERT(name_loc->namelen == args->namelen); 247130f712c9SDave Chinner ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0); 24729df243a1SDave Chinner return xfs_attr_copy_value(args, 24739df243a1SDave Chinner &name_loc->nameval[args->namelen], 24749df243a1SDave Chinner be16_to_cpu(name_loc->valuelen)); 2475a0e959d3SDave Chinner } 2476a0e959d3SDave Chinner 247730f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 247830f712c9SDave Chinner ASSERT(name_rmt->namelen == args->namelen); 247930f712c9SDave Chinner ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0); 248030f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 248130f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 248230f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount, 248330f712c9SDave Chinner args->rmtvaluelen); 24849df243a1SDave Chinner return xfs_attr_copy_value(args, NULL, args->rmtvaluelen); 248530f712c9SDave Chinner } 248630f712c9SDave Chinner 248730f712c9SDave Chinner /*======================================================================== 248830f712c9SDave Chinner * Utility routines. 248930f712c9SDave Chinner *========================================================================*/ 249030f712c9SDave Chinner 249130f712c9SDave Chinner /* 249230f712c9SDave Chinner * Move the indicated entries from one leaf to another. 249330f712c9SDave Chinner * NOTE: this routine modifies both source and destination leaves. 249430f712c9SDave Chinner */ 249530f712c9SDave Chinner /*ARGSUSED*/ 249630f712c9SDave Chinner STATIC void 249730f712c9SDave Chinner xfs_attr3_leaf_moveents( 249830f712c9SDave Chinner struct xfs_da_args *args, 249930f712c9SDave Chinner struct xfs_attr_leafblock *leaf_s, 250030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_s, 250130f712c9SDave Chinner int start_s, 250230f712c9SDave Chinner struct xfs_attr_leafblock *leaf_d, 250330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_d, 250430f712c9SDave Chinner int start_d, 250530f712c9SDave Chinner int count) 250630f712c9SDave Chinner { 250730f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_s; 250830f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_d; 250930f712c9SDave Chinner int desti; 251030f712c9SDave Chinner int tmp; 251130f712c9SDave Chinner int i; 251230f712c9SDave Chinner 251330f712c9SDave Chinner /* 251430f712c9SDave Chinner * Check for nothing to do. 251530f712c9SDave Chinner */ 251630f712c9SDave Chinner if (count == 0) 251730f712c9SDave Chinner return; 251830f712c9SDave Chinner 251930f712c9SDave Chinner /* 252030f712c9SDave Chinner * Set up environment. 252130f712c9SDave Chinner */ 252230f712c9SDave Chinner ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC || 252330f712c9SDave Chinner ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC); 252430f712c9SDave Chinner ASSERT(ichdr_s->magic == ichdr_d->magic); 252530f712c9SDave Chinner ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8); 252630f712c9SDave Chinner ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s)) 252730f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_s)); 252830f712c9SDave Chinner ASSERT(ichdr_d->count < args->geo->blksize / 8); 252930f712c9SDave Chinner ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d)) 253030f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d)); 253130f712c9SDave Chinner 253230f712c9SDave Chinner ASSERT(start_s < ichdr_s->count); 253330f712c9SDave Chinner ASSERT(start_d <= ichdr_d->count); 253430f712c9SDave Chinner ASSERT(count <= ichdr_s->count); 253530f712c9SDave Chinner 253630f712c9SDave Chinner 253730f712c9SDave Chinner /* 253830f712c9SDave Chinner * Move the entries in the destination leaf up to make a hole? 253930f712c9SDave Chinner */ 254030f712c9SDave Chinner if (start_d < ichdr_d->count) { 254130f712c9SDave Chinner tmp = ichdr_d->count - start_d; 254230f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 254330f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 254430f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count]; 254530f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 254630f712c9SDave Chinner } 254730f712c9SDave Chinner 254830f712c9SDave Chinner /* 254930f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 255030f712c9SDave Chinner * but allocate attribute info packed and in sequence. 255130f712c9SDave Chinner */ 255230f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 255330f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 255430f712c9SDave Chinner desti = start_d; 255530f712c9SDave Chinner for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) { 255630f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused); 255730f712c9SDave Chinner tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i); 255830f712c9SDave Chinner #ifdef GROT 255930f712c9SDave Chinner /* 256030f712c9SDave Chinner * Code to drop INCOMPLETE entries. Difficult to use as we 256130f712c9SDave Chinner * may also need to change the insertion index. Code turned 256230f712c9SDave Chinner * off for 6.2, should be revisited later. 256330f712c9SDave Chinner */ 256430f712c9SDave Chinner if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */ 256530f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 256630f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 256730f712c9SDave Chinner ichdr_s->count -= 1; 256830f712c9SDave Chinner entry_d--; /* to compensate for ++ in loop hdr */ 256930f712c9SDave Chinner desti--; 257030f712c9SDave Chinner if ((start_s + i) < offset) 257130f712c9SDave Chinner result++; /* insertion index adjustment */ 257230f712c9SDave Chinner } else { 257330f712c9SDave Chinner #endif /* GROT */ 257430f712c9SDave Chinner ichdr_d->firstused -= tmp; 257530f712c9SDave Chinner /* both on-disk, don't endian flip twice */ 257630f712c9SDave Chinner entry_d->hashval = entry_s->hashval; 257730f712c9SDave Chinner entry_d->nameidx = cpu_to_be16(ichdr_d->firstused); 257830f712c9SDave Chinner entry_d->flags = entry_s->flags; 257930f712c9SDave Chinner ASSERT(be16_to_cpu(entry_d->nameidx) + tmp 258030f712c9SDave Chinner <= args->geo->blksize); 258130f712c9SDave Chinner memmove(xfs_attr3_leaf_name(leaf_d, desti), 258230f712c9SDave Chinner xfs_attr3_leaf_name(leaf_s, start_s + i), tmp); 258330f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) + tmp 258430f712c9SDave Chinner <= args->geo->blksize); 258530f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 258630f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 258730f712c9SDave Chinner ichdr_d->usedbytes += tmp; 258830f712c9SDave Chinner ichdr_s->count -= 1; 258930f712c9SDave Chinner ichdr_d->count += 1; 259030f712c9SDave Chinner tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t) 259130f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d); 259230f712c9SDave Chinner ASSERT(ichdr_d->firstused >= tmp); 259330f712c9SDave Chinner #ifdef GROT 259430f712c9SDave Chinner } 259530f712c9SDave Chinner #endif /* GROT */ 259630f712c9SDave Chinner } 259730f712c9SDave Chinner 259830f712c9SDave Chinner /* 259930f712c9SDave Chinner * Zero out the entries we just copied. 260030f712c9SDave Chinner */ 260130f712c9SDave Chinner if (start_s == ichdr_s->count) { 260230f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 260330f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 260430f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 260530f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 260630f712c9SDave Chinner memset(entry_s, 0, tmp); 260730f712c9SDave Chinner } else { 260830f712c9SDave Chinner /* 260930f712c9SDave Chinner * Move the remaining entries down to fill the hole, 261030f712c9SDave Chinner * then zero the entries at the top. 261130f712c9SDave Chinner */ 261230f712c9SDave Chinner tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t); 261330f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count]; 261430f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 261530f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 261630f712c9SDave Chinner 261730f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 261830f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count]; 261930f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 262030f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 262130f712c9SDave Chinner memset(entry_s, 0, tmp); 262230f712c9SDave Chinner } 262330f712c9SDave Chinner 262430f712c9SDave Chinner /* 262530f712c9SDave Chinner * Fill in the freemap information 262630f712c9SDave Chinner */ 262730f712c9SDave Chinner ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d); 262830f712c9SDave Chinner ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t); 262930f712c9SDave Chinner ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base; 263030f712c9SDave Chinner ichdr_d->freemap[1].base = 0; 263130f712c9SDave Chinner ichdr_d->freemap[2].base = 0; 263230f712c9SDave Chinner ichdr_d->freemap[1].size = 0; 263330f712c9SDave Chinner ichdr_d->freemap[2].size = 0; 263430f712c9SDave Chinner ichdr_s->holes = 1; /* leaf may not be compact */ 263530f712c9SDave Chinner } 263630f712c9SDave Chinner 263730f712c9SDave Chinner /* 263830f712c9SDave Chinner * Pick up the last hashvalue from a leaf block. 263930f712c9SDave Chinner */ 264030f712c9SDave Chinner xfs_dahash_t 264130f712c9SDave Chinner xfs_attr_leaf_lasthash( 264230f712c9SDave Chinner struct xfs_buf *bp, 264330f712c9SDave Chinner int *count) 264430f712c9SDave Chinner { 264530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 264630f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 2647dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 264830f712c9SDave Chinner 26492f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr); 265030f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(bp->b_addr); 265130f712c9SDave Chinner if (count) 265230f712c9SDave Chinner *count = ichdr.count; 265330f712c9SDave Chinner if (!ichdr.count) 265430f712c9SDave Chinner return 0; 265530f712c9SDave Chinner return be32_to_cpu(entries[ichdr.count - 1].hashval); 265630f712c9SDave Chinner } 265730f712c9SDave Chinner 265830f712c9SDave Chinner /* 265930f712c9SDave Chinner * Calculate the number of bytes used to store the indicated attribute 266030f712c9SDave Chinner * (whether local or remote only calculate bytes in this block). 266130f712c9SDave Chinner */ 266230f712c9SDave Chinner STATIC int 266330f712c9SDave Chinner xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) 266430f712c9SDave Chinner { 266530f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 266630f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 266730f712c9SDave Chinner xfs_attr_leaf_name_remote_t *name_rmt; 266830f712c9SDave Chinner int size; 266930f712c9SDave Chinner 267030f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 267130f712c9SDave Chinner if (entries[index].flags & XFS_ATTR_LOCAL) { 267230f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, index); 267330f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(name_loc->namelen, 267430f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 267530f712c9SDave Chinner } else { 267630f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, index); 267730f712c9SDave Chinner size = xfs_attr_leaf_entsize_remote(name_rmt->namelen); 267830f712c9SDave Chinner } 267930f712c9SDave Chinner return size; 268030f712c9SDave Chinner } 268130f712c9SDave Chinner 268230f712c9SDave Chinner /* 268330f712c9SDave Chinner * Calculate the number of bytes that would be required to store the new 268430f712c9SDave Chinner * attribute (whether local or remote only calculate bytes in this block). 268530f712c9SDave Chinner * This routine decides as a side effect whether the attribute will be 268630f712c9SDave Chinner * a "local" or a "remote" attribute. 268730f712c9SDave Chinner */ 268830f712c9SDave Chinner int 268930f712c9SDave Chinner xfs_attr_leaf_newentsize( 269030f712c9SDave Chinner struct xfs_da_args *args, 269130f712c9SDave Chinner int *local) 269230f712c9SDave Chinner { 269330f712c9SDave Chinner int size; 269430f712c9SDave Chinner 269530f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen); 269630f712c9SDave Chinner if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) { 269730f712c9SDave Chinner if (local) 269830f712c9SDave Chinner *local = 1; 269930f712c9SDave Chinner return size; 270030f712c9SDave Chinner } 270130f712c9SDave Chinner if (local) 270230f712c9SDave Chinner *local = 0; 270330f712c9SDave Chinner return xfs_attr_leaf_entsize_remote(args->namelen); 270430f712c9SDave Chinner } 270530f712c9SDave Chinner 270630f712c9SDave Chinner 270730f712c9SDave Chinner /*======================================================================== 270830f712c9SDave Chinner * Manage the INCOMPLETE flag in a leaf entry 270930f712c9SDave Chinner *========================================================================*/ 271030f712c9SDave Chinner 271130f712c9SDave Chinner /* 271230f712c9SDave Chinner * Clear the INCOMPLETE flag on an entry in a leaf block. 271330f712c9SDave Chinner */ 271430f712c9SDave Chinner int 271530f712c9SDave Chinner xfs_attr3_leaf_clearflag( 271630f712c9SDave Chinner struct xfs_da_args *args) 271730f712c9SDave Chinner { 271830f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 271930f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 272030f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 272130f712c9SDave Chinner struct xfs_buf *bp; 272230f712c9SDave Chinner int error; 272330f712c9SDave Chinner #ifdef DEBUG 272430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 272530f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 272630f712c9SDave Chinner int namelen; 272730f712c9SDave Chinner char *name; 272830f712c9SDave Chinner #endif /* DEBUG */ 272930f712c9SDave Chinner 273030f712c9SDave Chinner trace_xfs_attr_leaf_clearflag(args); 273130f712c9SDave Chinner /* 273230f712c9SDave Chinner * Set up the operation. 273330f712c9SDave Chinner */ 2734dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp); 273530f712c9SDave Chinner if (error) 273630f712c9SDave Chinner return error; 273730f712c9SDave Chinner 273830f712c9SDave Chinner leaf = bp->b_addr; 273930f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 274030f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_INCOMPLETE); 274130f712c9SDave Chinner 274230f712c9SDave Chinner #ifdef DEBUG 27432f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 274430f712c9SDave Chinner ASSERT(args->index < ichdr.count); 274530f712c9SDave Chinner ASSERT(args->index >= 0); 274630f712c9SDave Chinner 274730f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 274830f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 274930f712c9SDave Chinner namelen = name_loc->namelen; 275030f712c9SDave Chinner name = (char *)name_loc->nameval; 275130f712c9SDave Chinner } else { 275230f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 275330f712c9SDave Chinner namelen = name_rmt->namelen; 275430f712c9SDave Chinner name = (char *)name_rmt->name; 275530f712c9SDave Chinner } 275630f712c9SDave Chinner ASSERT(be32_to_cpu(entry->hashval) == args->hashval); 275730f712c9SDave Chinner ASSERT(namelen == args->namelen); 275830f712c9SDave Chinner ASSERT(memcmp(name, args->name, namelen) == 0); 275930f712c9SDave Chinner #endif /* DEBUG */ 276030f712c9SDave Chinner 276130f712c9SDave Chinner entry->flags &= ~XFS_ATTR_INCOMPLETE; 276230f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 276330f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 276430f712c9SDave Chinner 276530f712c9SDave Chinner if (args->rmtblkno) { 276630f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0); 276730f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 276830f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 276930f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 277030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 277130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 277230f712c9SDave Chinner } 277330f712c9SDave Chinner 277430f712c9SDave Chinner /* 277530f712c9SDave Chinner * Commit the flag value change and start the next trans in series. 277630f712c9SDave Chinner */ 2777411350dfSChristoph Hellwig return xfs_trans_roll_inode(&args->trans, args->dp); 277830f712c9SDave Chinner } 277930f712c9SDave Chinner 278030f712c9SDave Chinner /* 278130f712c9SDave Chinner * Set the INCOMPLETE flag on an entry in a leaf block. 278230f712c9SDave Chinner */ 278330f712c9SDave Chinner int 278430f712c9SDave Chinner xfs_attr3_leaf_setflag( 278530f712c9SDave Chinner struct xfs_da_args *args) 278630f712c9SDave Chinner { 278730f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 278830f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 278930f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 279030f712c9SDave Chinner struct xfs_buf *bp; 279130f712c9SDave Chinner int error; 279230f712c9SDave Chinner #ifdef DEBUG 279330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 279430f712c9SDave Chinner #endif 279530f712c9SDave Chinner 279630f712c9SDave Chinner trace_xfs_attr_leaf_setflag(args); 279730f712c9SDave Chinner 279830f712c9SDave Chinner /* 279930f712c9SDave Chinner * Set up the operation. 280030f712c9SDave Chinner */ 2801dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp); 280230f712c9SDave Chinner if (error) 280330f712c9SDave Chinner return error; 280430f712c9SDave Chinner 280530f712c9SDave Chinner leaf = bp->b_addr; 280630f712c9SDave Chinner #ifdef DEBUG 28072f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 280830f712c9SDave Chinner ASSERT(args->index < ichdr.count); 280930f712c9SDave Chinner ASSERT(args->index >= 0); 281030f712c9SDave Chinner #endif 281130f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 281230f712c9SDave Chinner 281330f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0); 281430f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 281530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 281630f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 281730f712c9SDave Chinner if ((entry->flags & XFS_ATTR_LOCAL) == 0) { 281830f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 281930f712c9SDave Chinner name_rmt->valueblk = 0; 282030f712c9SDave Chinner name_rmt->valuelen = 0; 282130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 282230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 282330f712c9SDave Chinner } 282430f712c9SDave Chinner 282530f712c9SDave Chinner /* 282630f712c9SDave Chinner * Commit the flag value change and start the next trans in series. 282730f712c9SDave Chinner */ 2828411350dfSChristoph Hellwig return xfs_trans_roll_inode(&args->trans, args->dp); 282930f712c9SDave Chinner } 283030f712c9SDave Chinner 283130f712c9SDave Chinner /* 283230f712c9SDave Chinner * In a single transaction, clear the INCOMPLETE flag on the leaf entry 283330f712c9SDave Chinner * given by args->blkno/index and set the INCOMPLETE flag on the leaf 283430f712c9SDave Chinner * entry given by args->blkno2/index2. 283530f712c9SDave Chinner * 283630f712c9SDave Chinner * Note that they could be in different blocks, or in the same block. 283730f712c9SDave Chinner */ 283830f712c9SDave Chinner int 283930f712c9SDave Chinner xfs_attr3_leaf_flipflags( 284030f712c9SDave Chinner struct xfs_da_args *args) 284130f712c9SDave Chinner { 284230f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 284330f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 284430f712c9SDave Chinner struct xfs_attr_leaf_entry *entry1; 284530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry2; 284630f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 284730f712c9SDave Chinner struct xfs_buf *bp1; 284830f712c9SDave Chinner struct xfs_buf *bp2; 284930f712c9SDave Chinner int error; 285030f712c9SDave Chinner #ifdef DEBUG 285130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 285230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 285330f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 285430f712c9SDave Chinner int namelen1, namelen2; 285530f712c9SDave Chinner char *name1, *name2; 285630f712c9SDave Chinner #endif /* DEBUG */ 285730f712c9SDave Chinner 285830f712c9SDave Chinner trace_xfs_attr_leaf_flipflags(args); 285930f712c9SDave Chinner 286030f712c9SDave Chinner /* 286130f712c9SDave Chinner * Read the block containing the "old" attr 286230f712c9SDave Chinner */ 2863dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp1); 286430f712c9SDave Chinner if (error) 286530f712c9SDave Chinner return error; 286630f712c9SDave Chinner 286730f712c9SDave Chinner /* 286830f712c9SDave Chinner * Read the block containing the "new" attr, if it is different 286930f712c9SDave Chinner */ 287030f712c9SDave Chinner if (args->blkno2 != args->blkno) { 287130f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2, 2872dfb87594SChristoph Hellwig &bp2); 287330f712c9SDave Chinner if (error) 287430f712c9SDave Chinner return error; 287530f712c9SDave Chinner } else { 287630f712c9SDave Chinner bp2 = bp1; 287730f712c9SDave Chinner } 287830f712c9SDave Chinner 287930f712c9SDave Chinner leaf1 = bp1->b_addr; 288030f712c9SDave Chinner entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index]; 288130f712c9SDave Chinner 288230f712c9SDave Chinner leaf2 = bp2->b_addr; 288330f712c9SDave Chinner entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2]; 288430f712c9SDave Chinner 288530f712c9SDave Chinner #ifdef DEBUG 28862f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1); 288730f712c9SDave Chinner ASSERT(args->index < ichdr1.count); 288830f712c9SDave Chinner ASSERT(args->index >= 0); 288930f712c9SDave Chinner 28902f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2); 289130f712c9SDave Chinner ASSERT(args->index2 < ichdr2.count); 289230f712c9SDave Chinner ASSERT(args->index2 >= 0); 289330f712c9SDave Chinner 289430f712c9SDave Chinner if (entry1->flags & XFS_ATTR_LOCAL) { 289530f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf1, args->index); 289630f712c9SDave Chinner namelen1 = name_loc->namelen; 289730f712c9SDave Chinner name1 = (char *)name_loc->nameval; 289830f712c9SDave Chinner } else { 289930f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 290030f712c9SDave Chinner namelen1 = name_rmt->namelen; 290130f712c9SDave Chinner name1 = (char *)name_rmt->name; 290230f712c9SDave Chinner } 290330f712c9SDave Chinner if (entry2->flags & XFS_ATTR_LOCAL) { 290430f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2); 290530f712c9SDave Chinner namelen2 = name_loc->namelen; 290630f712c9SDave Chinner name2 = (char *)name_loc->nameval; 290730f712c9SDave Chinner } else { 290830f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 290930f712c9SDave Chinner namelen2 = name_rmt->namelen; 291030f712c9SDave Chinner name2 = (char *)name_rmt->name; 291130f712c9SDave Chinner } 291230f712c9SDave Chinner ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval)); 291330f712c9SDave Chinner ASSERT(namelen1 == namelen2); 291430f712c9SDave Chinner ASSERT(memcmp(name1, name2, namelen1) == 0); 291530f712c9SDave Chinner #endif /* DEBUG */ 291630f712c9SDave Chinner 291730f712c9SDave Chinner ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE); 291830f712c9SDave Chinner ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0); 291930f712c9SDave Chinner 292030f712c9SDave Chinner entry1->flags &= ~XFS_ATTR_INCOMPLETE; 292130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 292230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1))); 292330f712c9SDave Chinner if (args->rmtblkno) { 292430f712c9SDave Chinner ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0); 292530f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 292630f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 292730f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 292830f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 292930f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt))); 293030f712c9SDave Chinner } 293130f712c9SDave Chinner 293230f712c9SDave Chinner entry2->flags |= XFS_ATTR_INCOMPLETE; 293330f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 293430f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2))); 293530f712c9SDave Chinner if ((entry2->flags & XFS_ATTR_LOCAL) == 0) { 293630f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 293730f712c9SDave Chinner name_rmt->valueblk = 0; 293830f712c9SDave Chinner name_rmt->valuelen = 0; 293930f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 294030f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt))); 294130f712c9SDave Chinner } 294230f712c9SDave Chinner 294330f712c9SDave Chinner /* 294430f712c9SDave Chinner * Commit the flag value change and start the next trans in series. 294530f712c9SDave Chinner */ 2946411350dfSChristoph Hellwig error = xfs_trans_roll_inode(&args->trans, args->dp); 294730f712c9SDave Chinner 294830f712c9SDave Chinner return error; 294930f712c9SDave Chinner } 2950