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.h" 232b74b03cSAllison Henderson #include "xfs_attr_remote.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" 309bbafc71SDave Chinner #include "xfs_ag.h" 31c5218a7cSAllison Henderson #include "xfs_errortag.h" 3230f712c9SDave Chinner 3330f712c9SDave Chinner 3430f712c9SDave Chinner /* 3530f712c9SDave Chinner * xfs_attr_leaf.c 3630f712c9SDave Chinner * 3730f712c9SDave Chinner * Routines to implement leaf blocks of attributes as Btrees of hashed names. 3830f712c9SDave Chinner */ 3930f712c9SDave Chinner 4030f712c9SDave Chinner /*======================================================================== 4130f712c9SDave Chinner * Function prototypes for the kernel. 4230f712c9SDave Chinner *========================================================================*/ 4330f712c9SDave Chinner 4430f712c9SDave Chinner /* 4530f712c9SDave Chinner * Routines used for growing the Btree. 4630f712c9SDave Chinner */ 4730f712c9SDave Chinner STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args, 4830f712c9SDave Chinner xfs_dablk_t which_block, struct xfs_buf **bpp); 4930f712c9SDave Chinner STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer, 5030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 5130f712c9SDave Chinner struct xfs_da_args *args, int freemap_index); 5230f712c9SDave Chinner STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args, 5330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 5430f712c9SDave Chinner struct xfs_buf *leaf_buffer); 5530f712c9SDave Chinner STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state, 5630f712c9SDave Chinner xfs_da_state_blk_t *blk1, 5730f712c9SDave Chinner xfs_da_state_blk_t *blk2); 5830f712c9SDave Chinner STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state, 5930f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_1, 6030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 6130f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_2, 6230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 6330f712c9SDave Chinner int *number_entries_in_blk1, 6430f712c9SDave Chinner int *number_usedbytes_in_blk1); 6530f712c9SDave Chinner 6630f712c9SDave Chinner /* 6730f712c9SDave Chinner * Utility routines. 6830f712c9SDave Chinner */ 6930f712c9SDave Chinner STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args, 7030f712c9SDave Chinner struct xfs_attr_leafblock *src_leaf, 7130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start, 7230f712c9SDave Chinner struct xfs_attr_leafblock *dst_leaf, 7330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start, 7430f712c9SDave Chinner int move_count); 7530f712c9SDave Chinner STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index); 7630f712c9SDave Chinner 77e87021a2SBrian Foster /* 78e87021a2SBrian Foster * attr3 block 'firstused' conversion helpers. 79e87021a2SBrian Foster * 80e87021a2SBrian Foster * firstused refers to the offset of the first used byte of the nameval region 81e87021a2SBrian Foster * of an attr leaf block. The region starts at the tail of the block and expands 82e87021a2SBrian Foster * backwards towards the middle. As such, firstused is initialized to the block 83e87021a2SBrian Foster * size for an empty leaf block and is reduced from there. 84e87021a2SBrian Foster * 85e87021a2SBrian Foster * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k. 86e87021a2SBrian Foster * The in-core firstused field is 32-bit and thus supports the maximum fsb size. 87e87021a2SBrian Foster * The on-disk field is only 16-bit, however, and overflows at 64k. Since this 88e87021a2SBrian Foster * only occurs at exactly 64k, we use zero as a magic on-disk value to represent 89e87021a2SBrian Foster * the attr block size. The following helpers manage the conversion between the 90e87021a2SBrian Foster * in-core and on-disk formats. 91e87021a2SBrian Foster */ 92e87021a2SBrian Foster 93e87021a2SBrian Foster static void 94e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk( 95e87021a2SBrian Foster struct xfs_da_geometry *geo, 96e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *to, 97e87021a2SBrian Foster struct xfs_attr_leafblock *from) 98e87021a2SBrian Foster { 99e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 100e87021a2SBrian Foster 101e87021a2SBrian Foster if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 102e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) from; 103e87021a2SBrian Foster to->firstused = be16_to_cpu(hdr3->firstused); 104e87021a2SBrian Foster } else { 105e87021a2SBrian Foster to->firstused = be16_to_cpu(from->hdr.firstused); 106e87021a2SBrian Foster } 107e87021a2SBrian Foster 108e87021a2SBrian Foster /* 109e87021a2SBrian Foster * Convert from the magic fsb size value to actual blocksize. This 110e87021a2SBrian Foster * should only occur for empty blocks when the block size overflows 111e87021a2SBrian Foster * 16-bits. 112e87021a2SBrian Foster */ 113e87021a2SBrian Foster if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) { 114e87021a2SBrian Foster ASSERT(!to->count && !to->usedbytes); 115e87021a2SBrian Foster ASSERT(geo->blksize > USHRT_MAX); 116e87021a2SBrian Foster to->firstused = geo->blksize; 117e87021a2SBrian Foster } 118e87021a2SBrian Foster } 119e87021a2SBrian Foster 120e87021a2SBrian Foster static void 121e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk( 122e87021a2SBrian Foster struct xfs_da_geometry *geo, 123e87021a2SBrian Foster struct xfs_attr_leafblock *to, 124e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *from) 125e87021a2SBrian Foster { 126e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 127e87021a2SBrian Foster uint32_t firstused; 128e87021a2SBrian Foster 129e87021a2SBrian Foster /* magic value should only be seen on disk */ 130e87021a2SBrian Foster ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF); 131e87021a2SBrian Foster 132e87021a2SBrian Foster /* 133e87021a2SBrian Foster * Scale down the 32-bit in-core firstused value to the 16-bit on-disk 134e87021a2SBrian Foster * value. This only overflows at the max supported value of 64k. Use the 135e87021a2SBrian Foster * magic on-disk value to represent block size in this case. 136e87021a2SBrian Foster */ 137e87021a2SBrian Foster firstused = from->firstused; 138e87021a2SBrian Foster if (firstused > USHRT_MAX) { 139e87021a2SBrian Foster ASSERT(from->firstused == geo->blksize); 140e87021a2SBrian Foster firstused = XFS_ATTR3_LEAF_NULLOFF; 141e87021a2SBrian Foster } 142e87021a2SBrian Foster 143e87021a2SBrian Foster if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 144e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) to; 145e87021a2SBrian Foster hdr3->firstused = cpu_to_be16(firstused); 146e87021a2SBrian Foster } else { 147e87021a2SBrian Foster to->hdr.firstused = cpu_to_be16(firstused); 148e87021a2SBrian Foster } 149e87021a2SBrian Foster } 150e87021a2SBrian Foster 15130f712c9SDave Chinner void 15230f712c9SDave Chinner xfs_attr3_leaf_hdr_from_disk( 1532f661241SBrian Foster struct xfs_da_geometry *geo, 15430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *to, 15530f712c9SDave Chinner struct xfs_attr_leafblock *from) 15630f712c9SDave Chinner { 15730f712c9SDave Chinner int i; 15830f712c9SDave Chinner 15930f712c9SDave Chinner ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) || 16030f712c9SDave Chinner from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)); 16130f712c9SDave Chinner 16230f712c9SDave Chinner if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 16330f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from; 16430f712c9SDave Chinner 16530f712c9SDave Chinner to->forw = be32_to_cpu(hdr3->info.hdr.forw); 16630f712c9SDave Chinner to->back = be32_to_cpu(hdr3->info.hdr.back); 16730f712c9SDave Chinner to->magic = be16_to_cpu(hdr3->info.hdr.magic); 16830f712c9SDave Chinner to->count = be16_to_cpu(hdr3->count); 16930f712c9SDave Chinner to->usedbytes = be16_to_cpu(hdr3->usedbytes); 170e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 17130f712c9SDave Chinner to->holes = hdr3->holes; 17230f712c9SDave Chinner 17330f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 17430f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base); 17530f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size); 17630f712c9SDave Chinner } 17730f712c9SDave Chinner return; 17830f712c9SDave Chinner } 17930f712c9SDave Chinner to->forw = be32_to_cpu(from->hdr.info.forw); 18030f712c9SDave Chinner to->back = be32_to_cpu(from->hdr.info.back); 18130f712c9SDave Chinner to->magic = be16_to_cpu(from->hdr.info.magic); 18230f712c9SDave Chinner to->count = be16_to_cpu(from->hdr.count); 18330f712c9SDave Chinner to->usedbytes = be16_to_cpu(from->hdr.usedbytes); 184e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 18530f712c9SDave Chinner to->holes = from->hdr.holes; 18630f712c9SDave Chinner 18730f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 18830f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base); 18930f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size); 19030f712c9SDave Chinner } 19130f712c9SDave Chinner } 19230f712c9SDave Chinner 19330f712c9SDave Chinner void 19430f712c9SDave Chinner xfs_attr3_leaf_hdr_to_disk( 1952f661241SBrian Foster struct xfs_da_geometry *geo, 19630f712c9SDave Chinner struct xfs_attr_leafblock *to, 19730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *from) 19830f712c9SDave Chinner { 19930f712c9SDave Chinner int i; 20030f712c9SDave Chinner 20130f712c9SDave Chinner ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC || 20230f712c9SDave Chinner from->magic == XFS_ATTR3_LEAF_MAGIC); 20330f712c9SDave Chinner 20430f712c9SDave Chinner if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 20530f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to; 20630f712c9SDave Chinner 20730f712c9SDave Chinner hdr3->info.hdr.forw = cpu_to_be32(from->forw); 20830f712c9SDave Chinner hdr3->info.hdr.back = cpu_to_be32(from->back); 20930f712c9SDave Chinner hdr3->info.hdr.magic = cpu_to_be16(from->magic); 21030f712c9SDave Chinner hdr3->count = cpu_to_be16(from->count); 21130f712c9SDave Chinner hdr3->usedbytes = cpu_to_be16(from->usedbytes); 212e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 21330f712c9SDave Chinner hdr3->holes = from->holes; 21430f712c9SDave Chinner hdr3->pad1 = 0; 21530f712c9SDave Chinner 21630f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 21730f712c9SDave Chinner hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base); 21830f712c9SDave Chinner hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size); 21930f712c9SDave Chinner } 22030f712c9SDave Chinner return; 22130f712c9SDave Chinner } 22230f712c9SDave Chinner to->hdr.info.forw = cpu_to_be32(from->forw); 22330f712c9SDave Chinner to->hdr.info.back = cpu_to_be32(from->back); 22430f712c9SDave Chinner to->hdr.info.magic = cpu_to_be16(from->magic); 22530f712c9SDave Chinner to->hdr.count = cpu_to_be16(from->count); 22630f712c9SDave Chinner to->hdr.usedbytes = cpu_to_be16(from->usedbytes); 227e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 22830f712c9SDave Chinner to->hdr.holes = from->holes; 22930f712c9SDave Chinner to->hdr.pad1 = 0; 23030f712c9SDave Chinner 23130f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 23230f712c9SDave Chinner to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base); 23330f712c9SDave Chinner to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size); 23430f712c9SDave Chinner } 23530f712c9SDave Chinner } 23630f712c9SDave Chinner 237a6a781a5SDarrick J. Wong static xfs_failaddr_t 238c8476065SDarrick J. Wong xfs_attr3_leaf_verify_entry( 239c8476065SDarrick J. Wong struct xfs_mount *mp, 240c8476065SDarrick J. Wong char *buf_end, 241c8476065SDarrick J. Wong struct xfs_attr_leafblock *leaf, 242c8476065SDarrick J. Wong struct xfs_attr3_icleaf_hdr *leafhdr, 243c8476065SDarrick J. Wong struct xfs_attr_leaf_entry *ent, 244c8476065SDarrick J. Wong int idx, 245c8476065SDarrick J. Wong __u32 *last_hashval) 246c8476065SDarrick J. Wong { 247c8476065SDarrick J. Wong struct xfs_attr_leaf_name_local *lentry; 248c8476065SDarrick J. Wong struct xfs_attr_leaf_name_remote *rentry; 249c8476065SDarrick J. Wong char *name_end; 250c8476065SDarrick J. Wong unsigned int nameidx; 251c8476065SDarrick J. Wong unsigned int namesize; 252c8476065SDarrick J. Wong __u32 hashval; 253c8476065SDarrick J. Wong 254c8476065SDarrick J. Wong /* hash order check */ 255c8476065SDarrick J. Wong hashval = be32_to_cpu(ent->hashval); 256c8476065SDarrick J. Wong if (hashval < *last_hashval) 257c8476065SDarrick J. Wong return __this_address; 258c8476065SDarrick J. Wong *last_hashval = hashval; 259c8476065SDarrick J. Wong 260c8476065SDarrick J. Wong nameidx = be16_to_cpu(ent->nameidx); 261c8476065SDarrick J. Wong if (nameidx < leafhdr->firstused || nameidx >= mp->m_attr_geo->blksize) 262c8476065SDarrick J. Wong return __this_address; 263c8476065SDarrick J. Wong 264c8476065SDarrick J. Wong /* 265c8476065SDarrick J. Wong * Check the name information. The namelen fields are u8 so we can't 266c8476065SDarrick J. Wong * possibly exceed the maximum name length of 255 bytes. 267c8476065SDarrick J. Wong */ 268c8476065SDarrick J. Wong if (ent->flags & XFS_ATTR_LOCAL) { 269c8476065SDarrick J. Wong lentry = xfs_attr3_leaf_name_local(leaf, idx); 270c8476065SDarrick J. Wong namesize = xfs_attr_leaf_entsize_local(lentry->namelen, 271c8476065SDarrick J. Wong be16_to_cpu(lentry->valuelen)); 272c8476065SDarrick J. Wong name_end = (char *)lentry + namesize; 273c8476065SDarrick J. Wong if (lentry->namelen == 0) 274c8476065SDarrick J. Wong return __this_address; 275c8476065SDarrick J. Wong } else { 276c8476065SDarrick J. Wong rentry = xfs_attr3_leaf_name_remote(leaf, idx); 277c8476065SDarrick J. Wong namesize = xfs_attr_leaf_entsize_remote(rentry->namelen); 278c8476065SDarrick J. Wong name_end = (char *)rentry + namesize; 279c8476065SDarrick J. Wong if (rentry->namelen == 0) 280c8476065SDarrick J. Wong return __this_address; 281c8476065SDarrick J. Wong if (!(ent->flags & XFS_ATTR_INCOMPLETE) && 282c8476065SDarrick J. Wong rentry->valueblk == 0) 283c8476065SDarrick J. Wong return __this_address; 284c8476065SDarrick J. Wong } 285c8476065SDarrick J. Wong 286c8476065SDarrick J. Wong if (name_end > buf_end) 287c8476065SDarrick J. Wong return __this_address; 288c8476065SDarrick J. Wong 289c8476065SDarrick J. Wong return NULL; 290c8476065SDarrick J. Wong } 291c8476065SDarrick J. Wong 292c8476065SDarrick J. Wong static xfs_failaddr_t 29330f712c9SDave Chinner xfs_attr3_leaf_verify( 29430f712c9SDave Chinner struct xfs_buf *bp) 29530f712c9SDave Chinner { 29679a69bf8SDarrick J. Wong struct xfs_attr3_icleaf_hdr ichdr; 297dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 29830f712c9SDave Chinner struct xfs_attr_leafblock *leaf = bp->b_addr; 29979a69bf8SDarrick J. Wong struct xfs_attr_leaf_entry *entries; 300c8476065SDarrick J. Wong struct xfs_attr_leaf_entry *ent; 301c8476065SDarrick J. Wong char *buf_end; 302837514f7SDave Chinner uint32_t end; /* must be 32bit - see below */ 303c8476065SDarrick J. Wong __u32 last_hashval = 0; 30465cfcc38SDarrick J. Wong int i; 3058764f983SBrian Foster xfs_failaddr_t fa; 30630f712c9SDave Chinner 3072f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); 30830f712c9SDave Chinner 3098764f983SBrian Foster fa = xfs_da3_blkinfo_verify(bp, bp->b_addr); 3108764f983SBrian Foster if (fa) 3118764f983SBrian Foster return fa; 31239708c20SBrian Foster 3132e1d2337SEric Sandeen /* 31479a69bf8SDarrick J. Wong * firstused is the block offset of the first name info structure. 31579a69bf8SDarrick J. Wong * Make sure it doesn't go off the block or crash into the header. 31679a69bf8SDarrick J. Wong */ 31779a69bf8SDarrick J. Wong if (ichdr.firstused > mp->m_attr_geo->blksize) 31879a69bf8SDarrick J. Wong return __this_address; 31979a69bf8SDarrick J. Wong if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) 32079a69bf8SDarrick J. Wong return __this_address; 32179a69bf8SDarrick J. Wong 32279a69bf8SDarrick J. Wong /* Make sure the entries array doesn't crash into the name info. */ 32379a69bf8SDarrick J. Wong entries = xfs_attr3_leaf_entryp(bp->b_addr); 32479a69bf8SDarrick J. Wong if ((char *)&entries[ichdr.count] > 32579a69bf8SDarrick J. Wong (char *)bp->b_addr + ichdr.firstused) 32679a69bf8SDarrick J. Wong return __this_address; 32779a69bf8SDarrick J. Wong 328f28cef9eSBrian Foster /* 329f28cef9eSBrian Foster * NOTE: This verifier historically failed empty leaf buffers because 330f28cef9eSBrian Foster * we expect the fork to be in another format. Empty attr fork format 331f28cef9eSBrian Foster * conversions are possible during xattr set, however, and format 332f28cef9eSBrian Foster * conversion is not atomic with the xattr set that triggers it. We 333f28cef9eSBrian Foster * cannot assume leaf blocks are non-empty until that is addressed. 334f28cef9eSBrian Foster */ 335c8476065SDarrick J. Wong buf_end = (char *)bp->b_addr + mp->m_attr_geo->blksize; 336c8476065SDarrick J. Wong for (i = 0, ent = entries; i < ichdr.count; ent++, i++) { 337c8476065SDarrick J. Wong fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr, 338c8476065SDarrick J. Wong ent, i, &last_hashval); 339c8476065SDarrick J. Wong if (fa) 340c8476065SDarrick J. Wong return fa; 341c8476065SDarrick J. Wong } 34230f712c9SDave Chinner 34365cfcc38SDarrick J. Wong /* 34465cfcc38SDarrick J. Wong * Quickly check the freemap information. Attribute data has to be 34565cfcc38SDarrick J. Wong * aligned to 4-byte boundaries, and likewise for the free space. 346837514f7SDave Chinner * 347837514f7SDave Chinner * Note that for 64k block size filesystems, the freemap entries cannot 348837514f7SDave Chinner * overflow as they are only be16 fields. However, when checking end 349837514f7SDave Chinner * pointer of the freemap, we have to be careful to detect overflows and 350837514f7SDave Chinner * so use uint32_t for those checks. 35165cfcc38SDarrick J. Wong */ 35265cfcc38SDarrick J. Wong for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 35365cfcc38SDarrick J. Wong if (ichdr.freemap[i].base > mp->m_attr_geo->blksize) 35465cfcc38SDarrick J. Wong return __this_address; 35565cfcc38SDarrick J. Wong if (ichdr.freemap[i].base & 0x3) 35665cfcc38SDarrick J. Wong return __this_address; 35765cfcc38SDarrick J. Wong if (ichdr.freemap[i].size > mp->m_attr_geo->blksize) 35865cfcc38SDarrick J. Wong return __this_address; 35965cfcc38SDarrick J. Wong if (ichdr.freemap[i].size & 0x3) 36065cfcc38SDarrick J. Wong return __this_address; 361837514f7SDave Chinner 362837514f7SDave Chinner /* be care of 16 bit overflows here */ 363837514f7SDave Chinner end = (uint32_t)ichdr.freemap[i].base + ichdr.freemap[i].size; 36465cfcc38SDarrick J. Wong if (end < ichdr.freemap[i].base) 36565cfcc38SDarrick J. Wong return __this_address; 36665cfcc38SDarrick J. Wong if (end > mp->m_attr_geo->blksize) 36765cfcc38SDarrick J. Wong return __this_address; 36865cfcc38SDarrick J. Wong } 36965cfcc38SDarrick J. Wong 370a6a781a5SDarrick J. Wong return NULL; 37130f712c9SDave Chinner } 37230f712c9SDave Chinner 37330f712c9SDave Chinner static void 37430f712c9SDave Chinner xfs_attr3_leaf_write_verify( 37530f712c9SDave Chinner struct xfs_buf *bp) 37630f712c9SDave Chinner { 377dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 378fb1755a6SCarlos Maiolino struct xfs_buf_log_item *bip = bp->b_log_item; 37930f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr; 380bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 38130f712c9SDave Chinner 382bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 383bc1a09b8SDarrick J. Wong if (fa) { 384bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 38530f712c9SDave Chinner return; 38630f712c9SDave Chinner } 38730f712c9SDave Chinner 38838c26bfdSDave Chinner if (!xfs_has_crc(mp)) 38930f712c9SDave Chinner return; 39030f712c9SDave Chinner 39130f712c9SDave Chinner if (bip) 39230f712c9SDave Chinner hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); 39330f712c9SDave Chinner 39430f712c9SDave Chinner xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF); 39530f712c9SDave Chinner } 39630f712c9SDave Chinner 39730f712c9SDave Chinner /* 39830f712c9SDave Chinner * leaf/node format detection on trees is sketchy, so a node read can be done on 39930f712c9SDave Chinner * leaf level blocks when detection identifies the tree as a node format tree 40030f712c9SDave Chinner * incorrectly. In this case, we need to swap the verifier to match the correct 40130f712c9SDave Chinner * format of the block being read. 40230f712c9SDave Chinner */ 40330f712c9SDave Chinner static void 40430f712c9SDave Chinner xfs_attr3_leaf_read_verify( 40530f712c9SDave Chinner struct xfs_buf *bp) 40630f712c9SDave Chinner { 407dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 408bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 40930f712c9SDave Chinner 41038c26bfdSDave Chinner if (xfs_has_crc(mp) && 41130f712c9SDave Chinner !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF)) 412bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSBADCRC, __this_address); 413bc1a09b8SDarrick J. Wong else { 414bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 415bc1a09b8SDarrick J. Wong if (fa) 416bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 417bc1a09b8SDarrick J. Wong } 41830f712c9SDave Chinner } 41930f712c9SDave Chinner 42030f712c9SDave Chinner const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = { 421233135b7SEric Sandeen .name = "xfs_attr3_leaf", 42215baadf7SDarrick J. Wong .magic16 = { cpu_to_be16(XFS_ATTR_LEAF_MAGIC), 42339708c20SBrian Foster cpu_to_be16(XFS_ATTR3_LEAF_MAGIC) }, 42430f712c9SDave Chinner .verify_read = xfs_attr3_leaf_read_verify, 42530f712c9SDave Chinner .verify_write = xfs_attr3_leaf_write_verify, 426b5572597SDarrick J. Wong .verify_struct = xfs_attr3_leaf_verify, 42730f712c9SDave Chinner }; 42830f712c9SDave Chinner 42930f712c9SDave Chinner int 43030f712c9SDave Chinner xfs_attr3_leaf_read( 43130f712c9SDave Chinner struct xfs_trans *tp, 43230f712c9SDave Chinner struct xfs_inode *dp, 43330f712c9SDave Chinner xfs_dablk_t bno, 43430f712c9SDave Chinner struct xfs_buf **bpp) 43530f712c9SDave Chinner { 43630f712c9SDave Chinner int err; 43730f712c9SDave Chinner 438cd2c9f1bSChristoph Hellwig err = xfs_da_read_buf(tp, dp, bno, 0, bpp, XFS_ATTR_FORK, 439dfb87594SChristoph Hellwig &xfs_attr3_leaf_buf_ops); 440cd87d867SDarrick J. Wong if (!err && tp && *bpp) 44130f712c9SDave Chinner xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF); 44230f712c9SDave Chinner return err; 44330f712c9SDave Chinner } 44430f712c9SDave Chinner 44530f712c9SDave Chinner /*======================================================================== 44630f712c9SDave Chinner * Namespace helper routines 44730f712c9SDave Chinner *========================================================================*/ 44830f712c9SDave Chinner 449*fdaf1bb3SDave Chinner /* 450*fdaf1bb3SDave Chinner * If we are in log recovery, then we want the lookup to ignore the INCOMPLETE 451*fdaf1bb3SDave Chinner * flag on disk - if there's an incomplete attr then recovery needs to tear it 452*fdaf1bb3SDave Chinner * down. If there's no incomplete attr, then recovery needs to tear that attr 453*fdaf1bb3SDave Chinner * down to replace it with the attr that has been logged. In this case, the 454*fdaf1bb3SDave Chinner * INCOMPLETE flag will not be set in attr->attr_filter, but rather 455*fdaf1bb3SDave Chinner * XFS_DA_OP_RECOVERY will be set in args->op_flags. 456*fdaf1bb3SDave Chinner */ 457377f16acSChristoph Hellwig static bool 458377f16acSChristoph Hellwig xfs_attr_match( 459377f16acSChristoph Hellwig struct xfs_da_args *args, 460377f16acSChristoph Hellwig uint8_t namelen, 461377f16acSChristoph Hellwig unsigned char *name, 462377f16acSChristoph Hellwig int flags) 46330f712c9SDave Chinner { 464*fdaf1bb3SDave Chinner 465377f16acSChristoph Hellwig if (args->namelen != namelen) 466377f16acSChristoph Hellwig return false; 467377f16acSChristoph Hellwig if (memcmp(args->name, name, namelen) != 0) 468377f16acSChristoph Hellwig return false; 469*fdaf1bb3SDave Chinner 470*fdaf1bb3SDave Chinner /* Recovery ignores the INCOMPLETE flag. */ 471*fdaf1bb3SDave Chinner if ((args->op_flags & XFS_DA_OP_RECOVERY) && 472*fdaf1bb3SDave Chinner args->attr_filter == (flags & XFS_ATTR_NSP_ONDISK_MASK)) 473*fdaf1bb3SDave Chinner return true; 474*fdaf1bb3SDave Chinner 475*fdaf1bb3SDave Chinner /* All remaining matches need to be filtered by INCOMPLETE state. */ 476254f800fSChristoph Hellwig if (args->attr_filter != 477254f800fSChristoph Hellwig (flags & (XFS_ATTR_NSP_ONDISK_MASK | XFS_ATTR_INCOMPLETE))) 478377f16acSChristoph Hellwig return false; 479377f16acSChristoph Hellwig return true; 48030f712c9SDave Chinner } 48130f712c9SDave Chinner 4829df243a1SDave Chinner static int 4839df243a1SDave Chinner xfs_attr_copy_value( 4849df243a1SDave Chinner struct xfs_da_args *args, 4859df243a1SDave Chinner unsigned char *value, 4869df243a1SDave Chinner int valuelen) 4879df243a1SDave Chinner { 4889df243a1SDave Chinner /* 4899df243a1SDave Chinner * No copy if all we have to do is get the length 4909df243a1SDave Chinner */ 491e513e25cSChristoph Hellwig if (!args->valuelen) { 4929df243a1SDave Chinner args->valuelen = valuelen; 4939df243a1SDave Chinner return 0; 4949df243a1SDave Chinner } 4959df243a1SDave Chinner 4969df243a1SDave Chinner /* 4979df243a1SDave Chinner * No copy if the length of the existing buffer is too small 4989df243a1SDave Chinner */ 4999df243a1SDave Chinner if (args->valuelen < valuelen) { 5009df243a1SDave Chinner args->valuelen = valuelen; 5019df243a1SDave Chinner return -ERANGE; 5029df243a1SDave Chinner } 503ddbca70cSDave Chinner 504d49db18bSChristoph Hellwig if (!args->value) { 505d634525dSDave Chinner args->value = kvmalloc(valuelen, GFP_KERNEL | __GFP_NOLOCKDEP); 506ddbca70cSDave Chinner if (!args->value) 507ddbca70cSDave Chinner return -ENOMEM; 508ddbca70cSDave Chinner } 5099df243a1SDave Chinner args->valuelen = valuelen; 5109df243a1SDave Chinner 5119df243a1SDave Chinner /* remote block xattr requires IO for copy-in */ 5129df243a1SDave Chinner if (args->rmtblkno) 5139df243a1SDave Chinner return xfs_attr_rmtval_get(args); 5149df243a1SDave Chinner 5159df243a1SDave Chinner /* 5169df243a1SDave Chinner * This is to prevent a GCC warning because the remote xattr case 5179df243a1SDave Chinner * doesn't have a value to pass in. In that case, we never reach here, 5189df243a1SDave Chinner * but GCC can't work that out and so throws a "passing NULL to 5199df243a1SDave Chinner * memcpy" warning. 5209df243a1SDave Chinner */ 5219df243a1SDave Chinner if (!value) 5229df243a1SDave Chinner return -EINVAL; 5239df243a1SDave Chinner memcpy(args->value, value, valuelen); 5249df243a1SDave Chinner return 0; 5259df243a1SDave Chinner } 52630f712c9SDave Chinner 52730f712c9SDave Chinner /*======================================================================== 52830f712c9SDave Chinner * External routines when attribute fork size < XFS_LITINO(mp). 52930f712c9SDave Chinner *========================================================================*/ 53030f712c9SDave Chinner 53130f712c9SDave Chinner /* 532ada49d64SGao Xiang * Query whether the total requested number of attr fork bytes of extended 53330f712c9SDave Chinner * attribute space will be able to fit inline. 53430f712c9SDave Chinner * 5357821ea30SChristoph Hellwig * Returns zero if not, else the i_forkoff fork offset to be used in the 53630f712c9SDave Chinner * literal area for attribute data once the new bytes have been added. 53730f712c9SDave Chinner * 5387821ea30SChristoph Hellwig * i_forkoff must be 8 byte aligned, hence is stored as a >>3 value; 53930f712c9SDave Chinner * special case for dev/uuid inodes, they have fixed size data forks. 54030f712c9SDave Chinner */ 54130f712c9SDave Chinner int 5423f8a4f1dSDave Chinner xfs_attr_shortform_bytesfit( 5433f8a4f1dSDave Chinner struct xfs_inode *dp, 5443f8a4f1dSDave Chinner int bytes) 54530f712c9SDave Chinner { 5463f8a4f1dSDave Chinner struct xfs_mount *mp = dp->i_mount; 5473f8a4f1dSDave Chinner int64_t dsize; 5483f8a4f1dSDave Chinner int minforkoff; 5493f8a4f1dSDave Chinner int maxforkoff; 55030f712c9SDave Chinner int offset; 55130f712c9SDave Chinner 552ada49d64SGao Xiang /* 553ada49d64SGao Xiang * Check if the new size could fit at all first: 554ada49d64SGao Xiang */ 555ada49d64SGao Xiang if (bytes > XFS_LITINO(mp)) 556ada49d64SGao Xiang return 0; 557ada49d64SGao Xiang 55830f712c9SDave Chinner /* rounded down */ 559e9e2eae8SChristoph Hellwig offset = (XFS_LITINO(mp) - bytes) >> 3; 56030f712c9SDave Chinner 561f7e67b20SChristoph Hellwig if (dp->i_df.if_format == XFS_DINODE_FMT_DEV) { 56230f712c9SDave Chinner minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3; 56330f712c9SDave Chinner return (offset >= minforkoff) ? minforkoff : 0; 56430f712c9SDave Chinner } 56530f712c9SDave Chinner 56630f712c9SDave Chinner /* 56730f712c9SDave Chinner * If the requested numbers of bytes is smaller or equal to the 56830f712c9SDave Chinner * current attribute fork size we can always proceed. 56930f712c9SDave Chinner * 57030f712c9SDave Chinner * Note that if_bytes in the data fork might actually be larger than 57130f712c9SDave Chinner * the current data fork size is due to delalloc extents. In that 57230f712c9SDave Chinner * case either the extent count will go down when they are converted 57330f712c9SDave Chinner * to real extents, or the delalloc conversion will take care of the 57430f712c9SDave Chinner * literal area rebalancing. 57530f712c9SDave Chinner */ 57630f712c9SDave Chinner if (bytes <= XFS_IFORK_ASIZE(dp)) 5777821ea30SChristoph Hellwig return dp->i_forkoff; 57830f712c9SDave Chinner 57930f712c9SDave Chinner /* 58030f712c9SDave Chinner * For attr2 we can try to move the forkoff if there is space in the 58130f712c9SDave Chinner * literal area, but for the old format we are done if there is no 58230f712c9SDave Chinner * space in the fixed attribute fork. 58330f712c9SDave Chinner */ 5840560f31aSDave Chinner if (!xfs_has_attr2(mp)) 58530f712c9SDave Chinner return 0; 58630f712c9SDave Chinner 58730f712c9SDave Chinner dsize = dp->i_df.if_bytes; 58830f712c9SDave Chinner 589f7e67b20SChristoph Hellwig switch (dp->i_df.if_format) { 59030f712c9SDave Chinner case XFS_DINODE_FMT_EXTENTS: 59130f712c9SDave Chinner /* 59230f712c9SDave Chinner * If there is no attr fork and the data fork is extents, 59330f712c9SDave Chinner * determine if creating the default attr fork will result 59430f712c9SDave Chinner * in the extents form migrating to btree. If so, the 59530f712c9SDave Chinner * minimum offset only needs to be the space required for 59630f712c9SDave Chinner * the btree root. 59730f712c9SDave Chinner */ 5987821ea30SChristoph Hellwig if (!dp->i_forkoff && dp->i_df.if_bytes > 59930f712c9SDave Chinner xfs_default_attroffset(dp)) 60030f712c9SDave Chinner dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS); 60130f712c9SDave Chinner break; 60230f712c9SDave Chinner case XFS_DINODE_FMT_BTREE: 60330f712c9SDave Chinner /* 60430f712c9SDave Chinner * If we have a data btree then keep forkoff if we have one, 60530f712c9SDave Chinner * otherwise we are adding a new attr, so then we set 60630f712c9SDave Chinner * minforkoff to where the btree root can finish so we have 60730f712c9SDave Chinner * plenty of room for attrs 60830f712c9SDave Chinner */ 6097821ea30SChristoph Hellwig if (dp->i_forkoff) { 6107821ea30SChristoph Hellwig if (offset < dp->i_forkoff) 61130f712c9SDave Chinner return 0; 6127821ea30SChristoph Hellwig return dp->i_forkoff; 61330f712c9SDave Chinner } 61430f712c9SDave Chinner dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot); 61530f712c9SDave Chinner break; 61630f712c9SDave Chinner } 61730f712c9SDave Chinner 61830f712c9SDave Chinner /* 61930f712c9SDave Chinner * A data fork btree root must have space for at least 62030f712c9SDave Chinner * MINDBTPTRS key/ptr pairs if the data fork is small or empty. 62130f712c9SDave Chinner */ 6223f8a4f1dSDave Chinner minforkoff = max_t(int64_t, dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS)); 62330f712c9SDave Chinner minforkoff = roundup(minforkoff, 8) >> 3; 62430f712c9SDave Chinner 62530f712c9SDave Chinner /* attr fork btree root can have at least this many key/ptr pairs */ 626e9e2eae8SChristoph Hellwig maxforkoff = XFS_LITINO(mp) - XFS_BMDR_SPACE_CALC(MINABTPTRS); 62730f712c9SDave Chinner maxforkoff = maxforkoff >> 3; /* rounded down */ 62830f712c9SDave Chinner 62930f712c9SDave Chinner if (offset >= maxforkoff) 63030f712c9SDave Chinner return maxforkoff; 63130f712c9SDave Chinner if (offset >= minforkoff) 63230f712c9SDave Chinner return offset; 63330f712c9SDave Chinner return 0; 63430f712c9SDave Chinner } 63530f712c9SDave Chinner 63630f712c9SDave Chinner /* 6370560f31aSDave Chinner * Switch on the ATTR2 superblock bit (implies also FEATURES2) unless: 6380560f31aSDave Chinner * - noattr2 mount option is set, 6390560f31aSDave Chinner * - on-disk version bit says it is already set, or 6400560f31aSDave Chinner * - the attr2 mount option is not set to enable automatic upgrade from attr1. 64130f712c9SDave Chinner */ 64230f712c9SDave Chinner STATIC void 6430560f31aSDave Chinner xfs_sbversion_add_attr2( 6440560f31aSDave Chinner struct xfs_mount *mp, 6450560f31aSDave Chinner struct xfs_trans *tp) 64630f712c9SDave Chinner { 6470560f31aSDave Chinner if (xfs_has_noattr2(mp)) 6480560f31aSDave Chinner return; 6490560f31aSDave Chinner if (mp->m_sb.sb_features2 & XFS_SB_VERSION2_ATTR2BIT) 6500560f31aSDave Chinner return; 6510560f31aSDave Chinner if (!xfs_has_attr2(mp)) 6520560f31aSDave Chinner return; 6530560f31aSDave Chinner 65430f712c9SDave Chinner spin_lock(&mp->m_sb_lock); 65538c26bfdSDave Chinner xfs_add_attr2(mp); 65630f712c9SDave Chinner spin_unlock(&mp->m_sb_lock); 65761e63ecbSDave Chinner xfs_log_sb(tp); 65830f712c9SDave Chinner } 65930f712c9SDave Chinner 66030f712c9SDave Chinner /* 66130f712c9SDave Chinner * Create the initial contents of a shortform attribute list. 66230f712c9SDave Chinner */ 66330f712c9SDave Chinner void 664f7e67b20SChristoph Hellwig xfs_attr_shortform_create( 665f7e67b20SChristoph Hellwig struct xfs_da_args *args) 66630f712c9SDave Chinner { 667f7e67b20SChristoph Hellwig struct xfs_inode *dp = args->dp; 668f7e67b20SChristoph Hellwig struct xfs_ifork *ifp = dp->i_afp; 669f7e67b20SChristoph Hellwig struct xfs_attr_sf_hdr *hdr; 67030f712c9SDave Chinner 67130f712c9SDave Chinner trace_xfs_attr_sf_create(args); 67230f712c9SDave Chinner 67330f712c9SDave Chinner ASSERT(ifp->if_bytes == 0); 674b2197a36SChristoph Hellwig if (ifp->if_format == XFS_DINODE_FMT_EXTENTS) 675f7e67b20SChristoph Hellwig ifp->if_format = XFS_DINODE_FMT_LOCAL; 67630f712c9SDave Chinner xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK); 677125eac24SDarrick J. Wong hdr = (struct xfs_attr_sf_hdr *)ifp->if_u1.if_data; 678125eac24SDarrick J. Wong memset(hdr, 0, sizeof(*hdr)); 67930f712c9SDave Chinner hdr->totsize = cpu_to_be16(sizeof(*hdr)); 68030f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 68130f712c9SDave Chinner } 68230f712c9SDave Chinner 68330f712c9SDave Chinner /* 68407120f1aSAllison Collins * Return -EEXIST if attr is found, or -ENOATTR if not 68507120f1aSAllison Collins * args: args containing attribute name and namelen 68607120f1aSAllison Collins * sfep: If not null, pointer will be set to the last attr entry found on 68707120f1aSAllison Collins -EEXIST. On -ENOATTR pointer is left at the last entry in the list 68807120f1aSAllison Collins * basep: If not null, pointer is set to the byte offset of the entry in the 68907120f1aSAllison Collins * list on -EEXIST. On -ENOATTR, pointer is left at the byte offset of 69007120f1aSAllison Collins * the last entry in the list 69107120f1aSAllison Collins */ 69207120f1aSAllison Collins int 69307120f1aSAllison Collins xfs_attr_sf_findname( 69407120f1aSAllison Collins struct xfs_da_args *args, 69507120f1aSAllison Collins struct xfs_attr_sf_entry **sfep, 69607120f1aSAllison Collins unsigned int *basep) 69707120f1aSAllison Collins { 69807120f1aSAllison Collins struct xfs_attr_shortform *sf; 69907120f1aSAllison Collins struct xfs_attr_sf_entry *sfe; 70007120f1aSAllison Collins unsigned int base = sizeof(struct xfs_attr_sf_hdr); 70107120f1aSAllison Collins int size = 0; 70207120f1aSAllison Collins int end; 70307120f1aSAllison Collins int i; 70407120f1aSAllison Collins 70507120f1aSAllison Collins sf = (struct xfs_attr_shortform *)args->dp->i_afp->if_u1.if_data; 70607120f1aSAllison Collins sfe = &sf->list[0]; 70707120f1aSAllison Collins end = sf->hdr.count; 708e01b7eedSCarlos Maiolino for (i = 0; i < end; sfe = xfs_attr_sf_nextentry(sfe), 70907120f1aSAllison Collins base += size, i++) { 710e01b7eedSCarlos Maiolino size = xfs_attr_sf_entsize(sfe); 71107120f1aSAllison Collins if (!xfs_attr_match(args, sfe->namelen, sfe->nameval, 71207120f1aSAllison Collins sfe->flags)) 71307120f1aSAllison Collins continue; 71407120f1aSAllison Collins break; 71507120f1aSAllison Collins } 71607120f1aSAllison Collins 71707120f1aSAllison Collins if (sfep != NULL) 71807120f1aSAllison Collins *sfep = sfe; 71907120f1aSAllison Collins 72007120f1aSAllison Collins if (basep != NULL) 72107120f1aSAllison Collins *basep = base; 72207120f1aSAllison Collins 72307120f1aSAllison Collins if (i == end) 72407120f1aSAllison Collins return -ENOATTR; 72507120f1aSAllison Collins return -EEXIST; 72607120f1aSAllison Collins } 72707120f1aSAllison Collins 72807120f1aSAllison Collins /* 72930f712c9SDave Chinner * Add a name/value pair to the shortform attribute list. 73030f712c9SDave Chinner * Overflow from the inode has already been checked for. 73130f712c9SDave Chinner */ 73230f712c9SDave Chinner void 73307120f1aSAllison Collins xfs_attr_shortform_add( 73407120f1aSAllison Collins struct xfs_da_args *args, 73507120f1aSAllison Collins int forkoff) 73630f712c9SDave Chinner { 73707120f1aSAllison Collins struct xfs_attr_shortform *sf; 73807120f1aSAllison Collins struct xfs_attr_sf_entry *sfe; 73907120f1aSAllison Collins int offset, size; 74007120f1aSAllison Collins struct xfs_mount *mp; 74107120f1aSAllison Collins struct xfs_inode *dp; 7423ba738dfSChristoph Hellwig struct xfs_ifork *ifp; 74330f712c9SDave Chinner 74430f712c9SDave Chinner trace_xfs_attr_sf_add(args); 74530f712c9SDave Chinner 74630f712c9SDave Chinner dp = args->dp; 74730f712c9SDave Chinner mp = dp->i_mount; 7487821ea30SChristoph Hellwig dp->i_forkoff = forkoff; 74930f712c9SDave Chinner 75030f712c9SDave Chinner ifp = dp->i_afp; 7510779f4a6SChristoph Hellwig ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL); 75247e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 75307120f1aSAllison Collins if (xfs_attr_sf_findname(args, &sfe, NULL) == -EEXIST) 75407120f1aSAllison Collins ASSERT(0); 75530f712c9SDave Chinner 75630f712c9SDave Chinner offset = (char *)sfe - (char *)sf; 757e01b7eedSCarlos Maiolino size = xfs_attr_sf_entsize_byname(args->namelen, args->valuelen); 75830f712c9SDave Chinner xfs_idata_realloc(dp, size, XFS_ATTR_FORK); 75947e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 7606337c844SCarlos Maiolino sfe = (struct xfs_attr_sf_entry *)((char *)sf + offset); 76130f712c9SDave Chinner 76230f712c9SDave Chinner sfe->namelen = args->namelen; 76330f712c9SDave Chinner sfe->valuelen = args->valuelen; 764d5f0f49aSChristoph Hellwig sfe->flags = args->attr_filter; 76530f712c9SDave Chinner memcpy(sfe->nameval, args->name, args->namelen); 76630f712c9SDave Chinner memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen); 76730f712c9SDave Chinner sf->hdr.count++; 76830f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, size); 76930f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 77030f712c9SDave Chinner 77130f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 77230f712c9SDave Chinner } 77330f712c9SDave Chinner 77430f712c9SDave Chinner /* 77530f712c9SDave Chinner * After the last attribute is removed revert to original inode format, 77630f712c9SDave Chinner * making all literal area available to the data fork once more. 77730f712c9SDave Chinner */ 7786dfe5a04SDave Chinner void 7796dfe5a04SDave Chinner xfs_attr_fork_remove( 78030f712c9SDave Chinner struct xfs_inode *ip, 78130f712c9SDave Chinner struct xfs_trans *tp) 78230f712c9SDave Chinner { 783daf83964SChristoph Hellwig ASSERT(ip->i_afp->if_nextents == 0); 784daf83964SChristoph Hellwig 785ef838512SChristoph Hellwig xfs_idestroy_fork(ip->i_afp); 786182696fbSDarrick J. Wong kmem_cache_free(xfs_ifork_cache, ip->i_afp); 787ef838512SChristoph Hellwig ip->i_afp = NULL; 7887821ea30SChristoph Hellwig ip->i_forkoff = 0; 78930f712c9SDave Chinner xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); 79030f712c9SDave Chinner } 79130f712c9SDave Chinner 79230f712c9SDave Chinner /* 79330f712c9SDave Chinner * Remove an attribute from the shortform attribute list structure. 79430f712c9SDave Chinner */ 79530f712c9SDave Chinner int 796816c8e39SAllison Henderson xfs_attr_sf_removename( 79707120f1aSAllison Collins struct xfs_da_args *args) 79830f712c9SDave Chinner { 79907120f1aSAllison Collins struct xfs_attr_shortform *sf; 80007120f1aSAllison Collins struct xfs_attr_sf_entry *sfe; 80107120f1aSAllison Collins int size = 0, end, totsize; 80207120f1aSAllison Collins unsigned int base; 80307120f1aSAllison Collins struct xfs_mount *mp; 80407120f1aSAllison Collins struct xfs_inode *dp; 80507120f1aSAllison Collins int error; 80630f712c9SDave Chinner 80730f712c9SDave Chinner trace_xfs_attr_sf_remove(args); 80830f712c9SDave Chinner 80930f712c9SDave Chinner dp = args->dp; 81030f712c9SDave Chinner mp = dp->i_mount; 81147e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)dp->i_afp->if_u1.if_data; 81207120f1aSAllison Collins 81307120f1aSAllison Collins error = xfs_attr_sf_findname(args, &sfe, &base); 814*fdaf1bb3SDave Chinner 815*fdaf1bb3SDave Chinner /* 816*fdaf1bb3SDave Chinner * If we are recovering an operation, finding nothing to 817*fdaf1bb3SDave Chinner * remove is not an error - it just means there was nothing 818*fdaf1bb3SDave Chinner * to clean up. 819*fdaf1bb3SDave Chinner */ 820*fdaf1bb3SDave Chinner if (error == -ENOATTR && (args->op_flags & XFS_DA_OP_RECOVERY)) 821*fdaf1bb3SDave Chinner return 0; 82207120f1aSAllison Collins if (error != -EEXIST) 82307120f1aSAllison Collins return error; 824e01b7eedSCarlos Maiolino size = xfs_attr_sf_entsize(sfe); 82530f712c9SDave Chinner 82630f712c9SDave Chinner /* 82730f712c9SDave Chinner * Fix up the attribute fork data, covering the hole 82830f712c9SDave Chinner */ 82930f712c9SDave Chinner end = base + size; 83030f712c9SDave Chinner totsize = be16_to_cpu(sf->hdr.totsize); 83130f712c9SDave Chinner if (end != totsize) 83230f712c9SDave Chinner memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end); 83330f712c9SDave Chinner sf->hdr.count--; 83430f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, -size); 83530f712c9SDave Chinner 83630f712c9SDave Chinner /* 83730f712c9SDave Chinner * Fix up the start offset of the attribute fork 83830f712c9SDave Chinner */ 83930f712c9SDave Chinner totsize -= size; 8400560f31aSDave Chinner if (totsize == sizeof(xfs_attr_sf_hdr_t) && xfs_has_attr2(mp) && 841f7e67b20SChristoph Hellwig (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) && 842*fdaf1bb3SDave Chinner !(args->op_flags & (XFS_DA_OP_ADDNAME | XFS_DA_OP_REPLACE))) { 8436dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 84430f712c9SDave Chinner } else { 84530f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 8467821ea30SChristoph Hellwig dp->i_forkoff = xfs_attr_shortform_bytesfit(dp, totsize); 8477821ea30SChristoph Hellwig ASSERT(dp->i_forkoff); 84830f712c9SDave Chinner ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) || 84930f712c9SDave Chinner (args->op_flags & XFS_DA_OP_ADDNAME) || 8500560f31aSDave Chinner !xfs_has_attr2(mp) || 851f7e67b20SChristoph Hellwig dp->i_df.if_format == XFS_DINODE_FMT_BTREE); 85230f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, 85330f712c9SDave Chinner XFS_ILOG_CORE | XFS_ILOG_ADATA); 85430f712c9SDave Chinner } 85530f712c9SDave Chinner 85630f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 85730f712c9SDave Chinner 85830f712c9SDave Chinner return 0; 85930f712c9SDave Chinner } 86030f712c9SDave Chinner 86130f712c9SDave Chinner /* 86230f712c9SDave Chinner * Look up a name in a shortform attribute list structure. 86330f712c9SDave Chinner */ 86430f712c9SDave Chinner /*ARGSUSED*/ 86530f712c9SDave Chinner int 86630f712c9SDave Chinner xfs_attr_shortform_lookup(xfs_da_args_t *args) 86730f712c9SDave Chinner { 86847e6cc10SCarlos Maiolino struct xfs_attr_shortform *sf; 8696337c844SCarlos Maiolino struct xfs_attr_sf_entry *sfe; 87030f712c9SDave Chinner int i; 8713ba738dfSChristoph Hellwig struct xfs_ifork *ifp; 87230f712c9SDave Chinner 87330f712c9SDave Chinner trace_xfs_attr_sf_lookup(args); 87430f712c9SDave Chinner 87530f712c9SDave Chinner ifp = args->dp->i_afp; 8760779f4a6SChristoph Hellwig ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL); 87747e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 87830f712c9SDave Chinner sfe = &sf->list[0]; 87930f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 880e01b7eedSCarlos Maiolino sfe = xfs_attr_sf_nextentry(sfe), i++) { 881377f16acSChristoph Hellwig if (xfs_attr_match(args, sfe->namelen, sfe->nameval, 882377f16acSChristoph Hellwig sfe->flags)) 8832451337dSDave Chinner return -EEXIST; 88430f712c9SDave Chinner } 8852451337dSDave Chinner return -ENOATTR; 88630f712c9SDave Chinner } 88730f712c9SDave Chinner 88830f712c9SDave Chinner /* 889cf085a1bSJoe Perches * Retrieve the attribute value and length. 890728bcaa3SDave Chinner * 891e513e25cSChristoph Hellwig * If args->valuelen is zero, only the length needs to be returned. Unlike a 892e513e25cSChristoph Hellwig * lookup, we only return an error if the attribute does not exist or we can't 893e513e25cSChristoph Hellwig * retrieve the value. 89430f712c9SDave Chinner */ 89530f712c9SDave Chinner int 8969df243a1SDave Chinner xfs_attr_shortform_getvalue( 8979df243a1SDave Chinner struct xfs_da_args *args) 89830f712c9SDave Chinner { 8999df243a1SDave Chinner struct xfs_attr_shortform *sf; 9009df243a1SDave Chinner struct xfs_attr_sf_entry *sfe; 90130f712c9SDave Chinner int i; 90230f712c9SDave Chinner 9030779f4a6SChristoph Hellwig ASSERT(args->dp->i_afp->if_format == XFS_DINODE_FMT_LOCAL); 90447e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)args->dp->i_afp->if_u1.if_data; 90530f712c9SDave Chinner sfe = &sf->list[0]; 90630f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 907e01b7eedSCarlos Maiolino sfe = xfs_attr_sf_nextentry(sfe), i++) { 908377f16acSChristoph Hellwig if (xfs_attr_match(args, sfe->namelen, sfe->nameval, 909377f16acSChristoph Hellwig sfe->flags)) 910377f16acSChristoph Hellwig return xfs_attr_copy_value(args, 911377f16acSChristoph Hellwig &sfe->nameval[args->namelen], sfe->valuelen); 91230f712c9SDave Chinner } 9132451337dSDave Chinner return -ENOATTR; 91430f712c9SDave Chinner } 91530f712c9SDave Chinner 91630f712c9SDave Chinner /* 9176e643cd0SDarrick J. Wong * Convert from using the shortform to the leaf. On success, return the 9186e643cd0SDarrick J. Wong * buffer so that we can keep it locked until we're totally done with it. 91930f712c9SDave Chinner */ 92030f712c9SDave Chinner int 9216e643cd0SDarrick J. Wong xfs_attr_shortform_to_leaf( 9226e643cd0SDarrick J. Wong struct xfs_da_args *args, 9236e643cd0SDarrick J. Wong struct xfs_buf **leaf_bp) 92430f712c9SDave Chinner { 92532a9b7c6SBrian Foster struct xfs_inode *dp; 92632a9b7c6SBrian Foster struct xfs_attr_shortform *sf; 92732a9b7c6SBrian Foster struct xfs_attr_sf_entry *sfe; 92832a9b7c6SBrian Foster struct xfs_da_args nargs; 92930f712c9SDave Chinner char *tmpbuffer; 93030f712c9SDave Chinner int error, i, size; 93130f712c9SDave Chinner xfs_dablk_t blkno; 93230f712c9SDave Chinner struct xfs_buf *bp; 93332a9b7c6SBrian Foster struct xfs_ifork *ifp; 93430f712c9SDave Chinner 93530f712c9SDave Chinner trace_xfs_attr_sf_to_leaf(args); 93630f712c9SDave Chinner 93730f712c9SDave Chinner dp = args->dp; 93830f712c9SDave Chinner ifp = dp->i_afp; 93947e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 94030f712c9SDave Chinner size = be16_to_cpu(sf->hdr.totsize); 941707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(size, 0); 94230f712c9SDave Chinner ASSERT(tmpbuffer != NULL); 94330f712c9SDave Chinner memcpy(tmpbuffer, ifp->if_u1.if_data, size); 94447e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)tmpbuffer; 94530f712c9SDave Chinner 94630f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 947aeea4b75SBrian Foster xfs_bmap_local_to_extents_empty(args->trans, dp, XFS_ATTR_FORK); 94830f712c9SDave Chinner 94930f712c9SDave Chinner bp = NULL; 95030f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 951603efebdSBrian Foster if (error) 95230f712c9SDave Chinner goto out; 95330f712c9SDave Chinner 95430f712c9SDave Chinner ASSERT(blkno == 0); 95530f712c9SDave Chinner error = xfs_attr3_leaf_create(args, blkno, &bp); 956603efebdSBrian Foster if (error) 95730f712c9SDave Chinner goto out; 95830f712c9SDave Chinner 95930f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 96030f712c9SDave Chinner nargs.dp = dp; 96130f712c9SDave Chinner nargs.geo = args->geo; 96230f712c9SDave Chinner nargs.total = args->total; 96330f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 96430f712c9SDave Chinner nargs.trans = args->trans; 96530f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 96630f712c9SDave Chinner 96730f712c9SDave Chinner sfe = &sf->list[0]; 96830f712c9SDave Chinner for (i = 0; i < sf->hdr.count; i++) { 96930f712c9SDave Chinner nargs.name = sfe->nameval; 97030f712c9SDave Chinner nargs.namelen = sfe->namelen; 97130f712c9SDave Chinner nargs.value = &sfe->nameval[nargs.namelen]; 97230f712c9SDave Chinner nargs.valuelen = sfe->valuelen; 97330f712c9SDave Chinner nargs.hashval = xfs_da_hashname(sfe->nameval, 97430f712c9SDave Chinner sfe->namelen); 975d5f0f49aSChristoph Hellwig nargs.attr_filter = sfe->flags & XFS_ATTR_NSP_ONDISK_MASK; 97630f712c9SDave Chinner error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */ 9772451337dSDave Chinner ASSERT(error == -ENOATTR); 97830f712c9SDave Chinner error = xfs_attr3_leaf_add(bp, &nargs); 9792451337dSDave Chinner ASSERT(error != -ENOSPC); 98030f712c9SDave Chinner if (error) 98130f712c9SDave Chinner goto out; 982e01b7eedSCarlos Maiolino sfe = xfs_attr_sf_nextentry(sfe); 98330f712c9SDave Chinner } 98430f712c9SDave Chinner error = 0; 9856e643cd0SDarrick J. Wong *leaf_bp = bp; 98630f712c9SDave Chinner out: 98730f712c9SDave Chinner kmem_free(tmpbuffer); 98830f712c9SDave Chinner return error; 98930f712c9SDave Chinner } 99030f712c9SDave Chinner 99130f712c9SDave Chinner /* 99230f712c9SDave Chinner * Check a leaf attribute block to see if all the entries would fit into 99330f712c9SDave Chinner * a shortform attribute list. 99430f712c9SDave Chinner */ 99530f712c9SDave Chinner int 99630f712c9SDave Chinner xfs_attr_shortform_allfit( 99730f712c9SDave Chinner struct xfs_buf *bp, 99830f712c9SDave Chinner struct xfs_inode *dp) 99930f712c9SDave Chinner { 100030f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 100130f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 100230f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 100330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr leafhdr; 100430f712c9SDave Chinner int bytes; 100530f712c9SDave Chinner int i; 1006dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 100730f712c9SDave Chinner 100830f712c9SDave Chinner leaf = bp->b_addr; 10092f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf); 101030f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 101130f712c9SDave Chinner 101230f712c9SDave Chinner bytes = sizeof(struct xfs_attr_sf_hdr); 101330f712c9SDave Chinner for (i = 0; i < leafhdr.count; entry++, i++) { 101430f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 101530f712c9SDave Chinner continue; /* don't copy partial entries */ 101630f712c9SDave Chinner if (!(entry->flags & XFS_ATTR_LOCAL)) 101730f712c9SDave Chinner return 0; 101830f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 101930f712c9SDave Chinner if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX) 102030f712c9SDave Chinner return 0; 102130f712c9SDave Chinner if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX) 102230f712c9SDave Chinner return 0; 1023e01b7eedSCarlos Maiolino bytes += xfs_attr_sf_entsize_byname(name_loc->namelen, 1024c418dbc9SCarlos Maiolino be16_to_cpu(name_loc->valuelen)); 102530f712c9SDave Chinner } 10260560f31aSDave Chinner if (xfs_has_attr2(dp->i_mount) && 1027f7e67b20SChristoph Hellwig (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) && 102830f712c9SDave Chinner (bytes == sizeof(struct xfs_attr_sf_hdr))) 102930f712c9SDave Chinner return -1; 103030f712c9SDave Chinner return xfs_attr_shortform_bytesfit(dp, bytes); 103130f712c9SDave Chinner } 103230f712c9SDave Chinner 10331e1bbd8eSDarrick J. Wong /* Verify the consistency of an inline attribute fork. */ 10341e1bbd8eSDarrick J. Wong xfs_failaddr_t 10351e1bbd8eSDarrick J. Wong xfs_attr_shortform_verify( 10361e1bbd8eSDarrick J. Wong struct xfs_inode *ip) 10371e1bbd8eSDarrick J. Wong { 10381e1bbd8eSDarrick J. Wong struct xfs_attr_shortform *sfp; 10391e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *sfep; 10401e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *next_sfep; 10411e1bbd8eSDarrick J. Wong char *endp; 10421e1bbd8eSDarrick J. Wong struct xfs_ifork *ifp; 10431e1bbd8eSDarrick J. Wong int i; 10443f8a4f1dSDave Chinner int64_t size; 10451e1bbd8eSDarrick J. Wong 1046f7e67b20SChristoph Hellwig ASSERT(ip->i_afp->if_format == XFS_DINODE_FMT_LOCAL); 10471e1bbd8eSDarrick J. Wong ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK); 10481e1bbd8eSDarrick J. Wong sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 10491e1bbd8eSDarrick J. Wong size = ifp->if_bytes; 10501e1bbd8eSDarrick J. Wong 10511e1bbd8eSDarrick J. Wong /* 10521e1bbd8eSDarrick J. Wong * Give up if the attribute is way too short. 10531e1bbd8eSDarrick J. Wong */ 10541e1bbd8eSDarrick J. Wong if (size < sizeof(struct xfs_attr_sf_hdr)) 10551e1bbd8eSDarrick J. Wong return __this_address; 10561e1bbd8eSDarrick J. Wong 10571e1bbd8eSDarrick J. Wong endp = (char *)sfp + size; 10581e1bbd8eSDarrick J. Wong 10591e1bbd8eSDarrick J. Wong /* Check all reported entries */ 10601e1bbd8eSDarrick J. Wong sfep = &sfp->list[0]; 10611e1bbd8eSDarrick J. Wong for (i = 0; i < sfp->hdr.count; i++) { 10621e1bbd8eSDarrick J. Wong /* 10631e1bbd8eSDarrick J. Wong * struct xfs_attr_sf_entry has a variable length. 10641e1bbd8eSDarrick J. Wong * Check the fixed-offset parts of the structure are 10651e1bbd8eSDarrick J. Wong * within the data buffer. 1066f4020438SEric Sandeen * xfs_attr_sf_entry is defined with a 1-byte variable 1067f4020438SEric Sandeen * array at the end, so we must subtract that off. 10681e1bbd8eSDarrick J. Wong */ 1069c418dbc9SCarlos Maiolino if (((char *)sfep + sizeof(*sfep)) >= endp) 10701e1bbd8eSDarrick J. Wong return __this_address; 10711e1bbd8eSDarrick J. Wong 10721e1bbd8eSDarrick J. Wong /* Don't allow names with known bad length. */ 10731e1bbd8eSDarrick J. Wong if (sfep->namelen == 0) 10741e1bbd8eSDarrick J. Wong return __this_address; 10751e1bbd8eSDarrick J. Wong 10761e1bbd8eSDarrick J. Wong /* 10771e1bbd8eSDarrick J. Wong * Check that the variable-length part of the structure is 10781e1bbd8eSDarrick J. Wong * within the data buffer. The next entry starts after the 10791e1bbd8eSDarrick J. Wong * name component, so nextentry is an acceptable test. 10801e1bbd8eSDarrick J. Wong */ 1081e01b7eedSCarlos Maiolino next_sfep = xfs_attr_sf_nextentry(sfep); 10821e1bbd8eSDarrick J. Wong if ((char *)next_sfep > endp) 10831e1bbd8eSDarrick J. Wong return __this_address; 10841e1bbd8eSDarrick J. Wong 10851e1bbd8eSDarrick J. Wong /* 10861e1bbd8eSDarrick J. Wong * Check for unknown flags. Short form doesn't support 10871e1bbd8eSDarrick J. Wong * the incomplete or local bits, so we can use the namespace 10881e1bbd8eSDarrick J. Wong * mask here. 10891e1bbd8eSDarrick J. Wong */ 10901e1bbd8eSDarrick J. Wong if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK) 10911e1bbd8eSDarrick J. Wong return __this_address; 10921e1bbd8eSDarrick J. Wong 10931e1bbd8eSDarrick J. Wong /* 10941e1bbd8eSDarrick J. Wong * Check for invalid namespace combinations. We only allow 10951e1bbd8eSDarrick J. Wong * one namespace flag per xattr, so we can just count the 10961e1bbd8eSDarrick J. Wong * bits (i.e. hweight) here. 10971e1bbd8eSDarrick J. Wong */ 10981e1bbd8eSDarrick J. Wong if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1) 10991e1bbd8eSDarrick J. Wong return __this_address; 11001e1bbd8eSDarrick J. Wong 11011e1bbd8eSDarrick J. Wong sfep = next_sfep; 11021e1bbd8eSDarrick J. Wong } 11031e1bbd8eSDarrick J. Wong if ((void *)sfep != (void *)endp) 11041e1bbd8eSDarrick J. Wong return __this_address; 11051e1bbd8eSDarrick J. Wong 11061e1bbd8eSDarrick J. Wong return NULL; 11071e1bbd8eSDarrick J. Wong } 11081e1bbd8eSDarrick J. Wong 110930f712c9SDave Chinner /* 111030f712c9SDave Chinner * Convert a leaf attribute list to shortform attribute list 111130f712c9SDave Chinner */ 111230f712c9SDave Chinner int 111330f712c9SDave Chinner xfs_attr3_leaf_to_shortform( 111430f712c9SDave Chinner struct xfs_buf *bp, 111530f712c9SDave Chinner struct xfs_da_args *args, 111630f712c9SDave Chinner int forkoff) 111730f712c9SDave Chinner { 111830f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 111930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 112030f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 112130f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 112230f712c9SDave Chinner struct xfs_da_args nargs; 112330f712c9SDave Chinner struct xfs_inode *dp = args->dp; 112430f712c9SDave Chinner char *tmpbuffer; 112530f712c9SDave Chinner int error; 112630f712c9SDave Chinner int i; 112730f712c9SDave Chinner 112830f712c9SDave Chinner trace_xfs_attr_leaf_to_sf(args); 112930f712c9SDave Chinner 1130707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(args->geo->blksize, 0); 113130f712c9SDave Chinner if (!tmpbuffer) 11322451337dSDave Chinner return -ENOMEM; 113330f712c9SDave Chinner 113430f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 113530f712c9SDave Chinner 113630f712c9SDave Chinner leaf = (xfs_attr_leafblock_t *)tmpbuffer; 11372f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 113830f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 113930f712c9SDave Chinner 114030f712c9SDave Chinner /* XXX (dgc): buffer is about to be marked stale - why zero it? */ 114130f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 114230f712c9SDave Chinner 114330f712c9SDave Chinner /* 114430f712c9SDave Chinner * Clean out the prior contents of the attribute list. 114530f712c9SDave Chinner */ 114630f712c9SDave Chinner error = xfs_da_shrink_inode(args, 0, bp); 114730f712c9SDave Chinner if (error) 114830f712c9SDave Chinner goto out; 114930f712c9SDave Chinner 115030f712c9SDave Chinner if (forkoff == -1) { 1151*fdaf1bb3SDave Chinner /* 1152*fdaf1bb3SDave Chinner * Don't remove the attr fork if this operation is the first 1153*fdaf1bb3SDave Chinner * part of a attr replace operations. We're going to add a new 1154*fdaf1bb3SDave Chinner * attr immediately, so we need to keep the attr fork around in 1155*fdaf1bb3SDave Chinner * this case. 1156*fdaf1bb3SDave Chinner */ 1157*fdaf1bb3SDave Chinner if (!(args->op_flags & XFS_DA_OP_REPLACE)) { 11580560f31aSDave Chinner ASSERT(xfs_has_attr2(dp->i_mount)); 1159f7e67b20SChristoph Hellwig ASSERT(dp->i_df.if_format != XFS_DINODE_FMT_BTREE); 11606dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 1161*fdaf1bb3SDave Chinner } 116230f712c9SDave Chinner goto out; 116330f712c9SDave Chinner } 116430f712c9SDave Chinner 116530f712c9SDave Chinner xfs_attr_shortform_create(args); 116630f712c9SDave Chinner 116730f712c9SDave Chinner /* 116830f712c9SDave Chinner * Copy the attributes 116930f712c9SDave Chinner */ 117030f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 117130f712c9SDave Chinner nargs.geo = args->geo; 117230f712c9SDave Chinner nargs.dp = dp; 117330f712c9SDave Chinner nargs.total = args->total; 117430f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 117530f712c9SDave Chinner nargs.trans = args->trans; 117630f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 117730f712c9SDave Chinner 117830f712c9SDave Chinner for (i = 0; i < ichdr.count; entry++, i++) { 117930f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 118030f712c9SDave Chinner continue; /* don't copy partial entries */ 118130f712c9SDave Chinner if (!entry->nameidx) 118230f712c9SDave Chinner continue; 118330f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_LOCAL); 118430f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 118530f712c9SDave Chinner nargs.name = name_loc->nameval; 118630f712c9SDave Chinner nargs.namelen = name_loc->namelen; 118730f712c9SDave Chinner nargs.value = &name_loc->nameval[nargs.namelen]; 118830f712c9SDave Chinner nargs.valuelen = be16_to_cpu(name_loc->valuelen); 118930f712c9SDave Chinner nargs.hashval = be32_to_cpu(entry->hashval); 1190d5f0f49aSChristoph Hellwig nargs.attr_filter = entry->flags & XFS_ATTR_NSP_ONDISK_MASK; 119130f712c9SDave Chinner xfs_attr_shortform_add(&nargs, forkoff); 119230f712c9SDave Chinner } 119330f712c9SDave Chinner error = 0; 119430f712c9SDave Chinner 119530f712c9SDave Chinner out: 119630f712c9SDave Chinner kmem_free(tmpbuffer); 119730f712c9SDave Chinner return error; 119830f712c9SDave Chinner } 119930f712c9SDave Chinner 120030f712c9SDave Chinner /* 120130f712c9SDave Chinner * Convert from using a single leaf to a root node and a leaf. 120230f712c9SDave Chinner */ 120330f712c9SDave Chinner int 120430f712c9SDave Chinner xfs_attr3_leaf_to_node( 120530f712c9SDave Chinner struct xfs_da_args *args) 120630f712c9SDave Chinner { 120730f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 120830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr icleafhdr; 120930f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 121030f712c9SDave Chinner struct xfs_da3_icnode_hdr icnodehdr; 121130f712c9SDave Chinner struct xfs_da_intnode *node; 121230f712c9SDave Chinner struct xfs_inode *dp = args->dp; 121330f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 121430f712c9SDave Chinner struct xfs_buf *bp1 = NULL; 121530f712c9SDave Chinner struct xfs_buf *bp2 = NULL; 121630f712c9SDave Chinner xfs_dablk_t blkno; 121730f712c9SDave Chinner int error; 121830f712c9SDave Chinner 121930f712c9SDave Chinner trace_xfs_attr_leaf_to_node(args); 122030f712c9SDave Chinner 1221c5218a7cSAllison Henderson if (XFS_TEST_ERROR(false, mp, XFS_ERRTAG_ATTR_LEAF_TO_NODE)) { 1222c5218a7cSAllison Henderson error = -EIO; 1223c5218a7cSAllison Henderson goto out; 1224c5218a7cSAllison Henderson } 1225c5218a7cSAllison Henderson 122630f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 122730f712c9SDave Chinner if (error) 122830f712c9SDave Chinner goto out; 1229dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, dp, 0, &bp1); 123030f712c9SDave Chinner if (error) 123130f712c9SDave Chinner goto out; 123230f712c9SDave Chinner 12332911edb6SChristoph Hellwig error = xfs_da_get_buf(args->trans, dp, blkno, &bp2, XFS_ATTR_FORK); 123430f712c9SDave Chinner if (error) 123530f712c9SDave Chinner goto out; 123630f712c9SDave Chinner 123730f712c9SDave Chinner /* copy leaf to new buffer, update identifiers */ 123830f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF); 123930f712c9SDave Chinner bp2->b_ops = bp1->b_ops; 124030f712c9SDave Chinner memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize); 124138c26bfdSDave Chinner if (xfs_has_crc(mp)) { 124230f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp2->b_addr; 12439343ee76SDave Chinner hdr3->blkno = cpu_to_be64(xfs_buf_daddr(bp2)); 124430f712c9SDave Chinner } 124530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1); 124630f712c9SDave Chinner 124730f712c9SDave Chinner /* 124830f712c9SDave Chinner * Set up the new root node. 124930f712c9SDave Chinner */ 125030f712c9SDave Chinner error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK); 125130f712c9SDave Chinner if (error) 125230f712c9SDave Chinner goto out; 125330f712c9SDave Chinner node = bp1->b_addr; 1254f475dc4dSChristoph Hellwig xfs_da3_node_hdr_from_disk(mp, &icnodehdr, node); 125530f712c9SDave Chinner 125630f712c9SDave Chinner leaf = bp2->b_addr; 12572f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf); 125830f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 125930f712c9SDave Chinner 126030f712c9SDave Chinner /* both on-disk, don't endian-flip twice */ 126151908ca7SChristoph Hellwig icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval; 126251908ca7SChristoph Hellwig icnodehdr.btree[0].before = cpu_to_be32(blkno); 126330f712c9SDave Chinner icnodehdr.count = 1; 1264e1c8af1eSChristoph Hellwig xfs_da3_node_hdr_to_disk(dp->i_mount, node, &icnodehdr); 126530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1); 126630f712c9SDave Chinner error = 0; 126730f712c9SDave Chinner out: 126830f712c9SDave Chinner return error; 126930f712c9SDave Chinner } 127030f712c9SDave Chinner 127130f712c9SDave Chinner /*======================================================================== 127230f712c9SDave Chinner * Routines used for growing the Btree. 127330f712c9SDave Chinner *========================================================================*/ 127430f712c9SDave Chinner 127530f712c9SDave Chinner /* 127630f712c9SDave Chinner * Create the initial contents of a leaf attribute list 127730f712c9SDave Chinner * or a leaf in a node attribute list. 127830f712c9SDave Chinner */ 127930f712c9SDave Chinner STATIC int 128030f712c9SDave Chinner xfs_attr3_leaf_create( 128130f712c9SDave Chinner struct xfs_da_args *args, 128230f712c9SDave Chinner xfs_dablk_t blkno, 128330f712c9SDave Chinner struct xfs_buf **bpp) 128430f712c9SDave Chinner { 128530f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 128630f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 128730f712c9SDave Chinner struct xfs_inode *dp = args->dp; 128830f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 128930f712c9SDave Chinner struct xfs_buf *bp; 129030f712c9SDave Chinner int error; 129130f712c9SDave Chinner 129230f712c9SDave Chinner trace_xfs_attr_leaf_create(args); 129330f712c9SDave Chinner 12942911edb6SChristoph Hellwig error = xfs_da_get_buf(args->trans, args->dp, blkno, &bp, 129530f712c9SDave Chinner XFS_ATTR_FORK); 129630f712c9SDave Chinner if (error) 129730f712c9SDave Chinner return error; 129830f712c9SDave Chinner bp->b_ops = &xfs_attr3_leaf_buf_ops; 129930f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF); 130030f712c9SDave Chinner leaf = bp->b_addr; 130130f712c9SDave Chinner memset(leaf, 0, args->geo->blksize); 130230f712c9SDave Chinner 130330f712c9SDave Chinner memset(&ichdr, 0, sizeof(ichdr)); 130430f712c9SDave Chinner ichdr.firstused = args->geo->blksize; 130530f712c9SDave Chinner 130638c26bfdSDave Chinner if (xfs_has_crc(mp)) { 130730f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp->b_addr; 130830f712c9SDave Chinner 130930f712c9SDave Chinner ichdr.magic = XFS_ATTR3_LEAF_MAGIC; 131030f712c9SDave Chinner 13119343ee76SDave Chinner hdr3->blkno = cpu_to_be64(xfs_buf_daddr(bp)); 131230f712c9SDave Chinner hdr3->owner = cpu_to_be64(dp->i_ino); 1313ce748eaaSEric Sandeen uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); 131430f712c9SDave Chinner 131530f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr); 131630f712c9SDave Chinner } else { 131730f712c9SDave Chinner ichdr.magic = XFS_ATTR_LEAF_MAGIC; 131830f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr); 131930f712c9SDave Chinner } 132030f712c9SDave Chinner ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base; 132130f712c9SDave Chinner 13222f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 132330f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1); 132430f712c9SDave Chinner 132530f712c9SDave Chinner *bpp = bp; 132630f712c9SDave Chinner return 0; 132730f712c9SDave Chinner } 132830f712c9SDave Chinner 132930f712c9SDave Chinner /* 133030f712c9SDave Chinner * Split the leaf node, rebalance, then add the new entry. 133130f712c9SDave Chinner */ 133230f712c9SDave Chinner int 133330f712c9SDave Chinner xfs_attr3_leaf_split( 133430f712c9SDave Chinner struct xfs_da_state *state, 133530f712c9SDave Chinner struct xfs_da_state_blk *oldblk, 133630f712c9SDave Chinner struct xfs_da_state_blk *newblk) 133730f712c9SDave Chinner { 133830f712c9SDave Chinner xfs_dablk_t blkno; 133930f712c9SDave Chinner int error; 134030f712c9SDave Chinner 134130f712c9SDave Chinner trace_xfs_attr_leaf_split(state->args); 134230f712c9SDave Chinner 134330f712c9SDave Chinner /* 134430f712c9SDave Chinner * Allocate space for a new leaf node. 134530f712c9SDave Chinner */ 134630f712c9SDave Chinner ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC); 134730f712c9SDave Chinner error = xfs_da_grow_inode(state->args, &blkno); 134830f712c9SDave Chinner if (error) 134930f712c9SDave Chinner return error; 135030f712c9SDave Chinner error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp); 135130f712c9SDave Chinner if (error) 135230f712c9SDave Chinner return error; 135330f712c9SDave Chinner newblk->blkno = blkno; 135430f712c9SDave Chinner newblk->magic = XFS_ATTR_LEAF_MAGIC; 135530f712c9SDave Chinner 135630f712c9SDave Chinner /* 135730f712c9SDave Chinner * Rebalance the entries across the two leaves. 135830f712c9SDave Chinner * NOTE: rebalance() currently depends on the 2nd block being empty. 135930f712c9SDave Chinner */ 136030f712c9SDave Chinner xfs_attr3_leaf_rebalance(state, oldblk, newblk); 136130f712c9SDave Chinner error = xfs_da3_blk_link(state, oldblk, newblk); 136230f712c9SDave Chinner if (error) 136330f712c9SDave Chinner return error; 136430f712c9SDave Chinner 136530f712c9SDave Chinner /* 136630f712c9SDave Chinner * Save info on "old" attribute for "atomic rename" ops, leaf_add() 136730f712c9SDave Chinner * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the 136830f712c9SDave Chinner * "new" attrs info. Will need the "old" info to remove it later. 136930f712c9SDave Chinner * 137030f712c9SDave Chinner * Insert the "new" entry in the correct block. 137130f712c9SDave Chinner */ 137230f712c9SDave Chinner if (state->inleaf) { 137330f712c9SDave Chinner trace_xfs_attr_leaf_add_old(state->args); 137430f712c9SDave Chinner error = xfs_attr3_leaf_add(oldblk->bp, state->args); 137530f712c9SDave Chinner } else { 137630f712c9SDave Chinner trace_xfs_attr_leaf_add_new(state->args); 137730f712c9SDave Chinner error = xfs_attr3_leaf_add(newblk->bp, state->args); 137830f712c9SDave Chinner } 137930f712c9SDave Chinner 138030f712c9SDave Chinner /* 138130f712c9SDave Chinner * Update last hashval in each block since we added the name. 138230f712c9SDave Chinner */ 138330f712c9SDave Chinner oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL); 138430f712c9SDave Chinner newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL); 138530f712c9SDave Chinner return error; 138630f712c9SDave Chinner } 138730f712c9SDave Chinner 138830f712c9SDave Chinner /* 138930f712c9SDave Chinner * Add a name to the leaf attribute list structure. 139030f712c9SDave Chinner */ 139130f712c9SDave Chinner int 139230f712c9SDave Chinner xfs_attr3_leaf_add( 139330f712c9SDave Chinner struct xfs_buf *bp, 139430f712c9SDave Chinner struct xfs_da_args *args) 139530f712c9SDave Chinner { 139630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 139730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 139830f712c9SDave Chinner int tablesize; 139930f712c9SDave Chinner int entsize; 140030f712c9SDave Chinner int sum; 140130f712c9SDave Chinner int tmp; 140230f712c9SDave Chinner int i; 140330f712c9SDave Chinner 140430f712c9SDave Chinner trace_xfs_attr_leaf_add(args); 140530f712c9SDave Chinner 140630f712c9SDave Chinner leaf = bp->b_addr; 14072f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 140830f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr.count); 140930f712c9SDave Chinner entsize = xfs_attr_leaf_newentsize(args, NULL); 141030f712c9SDave Chinner 141130f712c9SDave Chinner /* 141230f712c9SDave Chinner * Search through freemap for first-fit on new name length. 141330f712c9SDave Chinner * (may need to figure in size of entry struct too) 141430f712c9SDave Chinner */ 141530f712c9SDave Chinner tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t) 141630f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 141730f712c9SDave Chinner for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) { 141830f712c9SDave Chinner if (tablesize > ichdr.firstused) { 141930f712c9SDave Chinner sum += ichdr.freemap[i].size; 142030f712c9SDave Chinner continue; 142130f712c9SDave Chinner } 142230f712c9SDave Chinner if (!ichdr.freemap[i].size) 142330f712c9SDave Chinner continue; /* no space in this map */ 142430f712c9SDave Chinner tmp = entsize; 142530f712c9SDave Chinner if (ichdr.freemap[i].base < ichdr.firstused) 142630f712c9SDave Chinner tmp += sizeof(xfs_attr_leaf_entry_t); 142730f712c9SDave Chinner if (ichdr.freemap[i].size >= tmp) { 142830f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i); 142930f712c9SDave Chinner goto out_log_hdr; 143030f712c9SDave Chinner } 143130f712c9SDave Chinner sum += ichdr.freemap[i].size; 143230f712c9SDave Chinner } 143330f712c9SDave Chinner 143430f712c9SDave Chinner /* 143530f712c9SDave Chinner * If there are no holes in the address space of the block, 143630f712c9SDave Chinner * and we don't have enough freespace, then compaction will do us 143730f712c9SDave Chinner * no good and we should just give up. 143830f712c9SDave Chinner */ 143930f712c9SDave Chinner if (!ichdr.holes && sum < entsize) 14402451337dSDave Chinner return -ENOSPC; 144130f712c9SDave Chinner 144230f712c9SDave Chinner /* 144330f712c9SDave Chinner * Compact the entries to coalesce free space. 144430f712c9SDave Chinner * This may change the hdr->count via dropping INCOMPLETE entries. 144530f712c9SDave Chinner */ 144630f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr, bp); 144730f712c9SDave Chinner 144830f712c9SDave Chinner /* 144930f712c9SDave Chinner * After compaction, the block is guaranteed to have only one 145030f712c9SDave Chinner * free region, in freemap[0]. If it is not big enough, give up. 145130f712c9SDave Chinner */ 145230f712c9SDave Chinner if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) { 14532451337dSDave Chinner tmp = -ENOSPC; 145430f712c9SDave Chinner goto out_log_hdr; 145530f712c9SDave Chinner } 145630f712c9SDave Chinner 145730f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0); 145830f712c9SDave Chinner 145930f712c9SDave Chinner out_log_hdr: 14602f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 146130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 146230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 146330f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 146430f712c9SDave Chinner return tmp; 146530f712c9SDave Chinner } 146630f712c9SDave Chinner 146730f712c9SDave Chinner /* 146830f712c9SDave Chinner * Add a name to a leaf attribute list structure. 146930f712c9SDave Chinner */ 147030f712c9SDave Chinner STATIC int 147130f712c9SDave Chinner xfs_attr3_leaf_add_work( 147230f712c9SDave Chinner struct xfs_buf *bp, 147330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 147430f712c9SDave Chinner struct xfs_da_args *args, 147530f712c9SDave Chinner int mapindex) 147630f712c9SDave Chinner { 147730f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 147830f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 147930f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 148030f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 148130f712c9SDave Chinner struct xfs_mount *mp; 148230f712c9SDave Chinner int tmp; 148330f712c9SDave Chinner int i; 148430f712c9SDave Chinner 148530f712c9SDave Chinner trace_xfs_attr_leaf_add_work(args); 148630f712c9SDave Chinner 148730f712c9SDave Chinner leaf = bp->b_addr; 148830f712c9SDave Chinner ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE); 148930f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr->count); 149030f712c9SDave Chinner 149130f712c9SDave Chinner /* 149230f712c9SDave Chinner * Force open some space in the entry array and fill it in. 149330f712c9SDave Chinner */ 149430f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 149530f712c9SDave Chinner if (args->index < ichdr->count) { 149630f712c9SDave Chinner tmp = ichdr->count - args->index; 149730f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 149830f712c9SDave Chinner memmove(entry + 1, entry, tmp); 149930f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 150030f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry))); 150130f712c9SDave Chinner } 150230f712c9SDave Chinner ichdr->count++; 150330f712c9SDave Chinner 150430f712c9SDave Chinner /* 150530f712c9SDave Chinner * Allocate space for the new string (at the end of the run). 150630f712c9SDave Chinner */ 150730f712c9SDave Chinner mp = args->trans->t_mountp; 150830f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize); 150930f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0); 151030f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size >= 151130f712c9SDave Chinner xfs_attr_leaf_newentsize(args, NULL)); 151230f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize); 151330f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0); 151430f712c9SDave Chinner 151530f712c9SDave Chinner ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp); 151630f712c9SDave Chinner 151730f712c9SDave Chinner entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base + 151830f712c9SDave Chinner ichdr->freemap[mapindex].size); 151930f712c9SDave Chinner entry->hashval = cpu_to_be32(args->hashval); 1520d5f0f49aSChristoph Hellwig entry->flags = args->attr_filter; 1521d5f0f49aSChristoph Hellwig if (tmp) 1522d5f0f49aSChristoph Hellwig entry->flags |= XFS_ATTR_LOCAL; 1523e7f358deSDave Chinner if (args->op_flags & XFS_DA_OP_REPLACE) { 1524f38dc503SAllison Henderson if (!xfs_has_larp(mp)) 152530f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 152630f712c9SDave Chinner if ((args->blkno2 == args->blkno) && 152730f712c9SDave Chinner (args->index2 <= args->index)) { 152830f712c9SDave Chinner args->index2++; 152930f712c9SDave Chinner } 153030f712c9SDave Chinner } 153130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 153230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 153330f712c9SDave Chinner ASSERT((args->index == 0) || 153430f712c9SDave Chinner (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval))); 153530f712c9SDave Chinner ASSERT((args->index == ichdr->count - 1) || 153630f712c9SDave Chinner (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval))); 153730f712c9SDave Chinner 153830f712c9SDave Chinner /* 153930f712c9SDave Chinner * For "remote" attribute values, simply note that we need to 154030f712c9SDave Chinner * allocate space for the "remote" value. We can't actually 154130f712c9SDave Chinner * allocate the extents in this transaction, and we can't decide 154230f712c9SDave Chinner * which blocks they should be as we might allocate more blocks 154330f712c9SDave Chinner * as part of this transaction (a split operation for example). 154430f712c9SDave Chinner */ 154530f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 154630f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 154730f712c9SDave Chinner name_loc->namelen = args->namelen; 154830f712c9SDave Chinner name_loc->valuelen = cpu_to_be16(args->valuelen); 154930f712c9SDave Chinner memcpy((char *)name_loc->nameval, args->name, args->namelen); 155030f712c9SDave Chinner memcpy((char *)&name_loc->nameval[args->namelen], args->value, 155130f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 155230f712c9SDave Chinner } else { 155330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 155430f712c9SDave Chinner name_rmt->namelen = args->namelen; 155530f712c9SDave Chinner memcpy((char *)name_rmt->name, args->name, args->namelen); 155630f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 155730f712c9SDave Chinner /* just in case */ 155830f712c9SDave Chinner name_rmt->valuelen = 0; 155930f712c9SDave Chinner name_rmt->valueblk = 0; 156030f712c9SDave Chinner args->rmtblkno = 1; 156130f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen); 156230f712c9SDave Chinner args->rmtvaluelen = args->valuelen; 156330f712c9SDave Chinner } 156430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 156530f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 156630f712c9SDave Chinner xfs_attr_leaf_entsize(leaf, args->index))); 156730f712c9SDave Chinner 156830f712c9SDave Chinner /* 156930f712c9SDave Chinner * Update the control info for this leaf node 157030f712c9SDave Chinner */ 157130f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < ichdr->firstused) 157230f712c9SDave Chinner ichdr->firstused = be16_to_cpu(entry->nameidx); 157330f712c9SDave Chinner 157430f712c9SDave Chinner ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t) 157530f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf)); 157630f712c9SDave Chinner tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t) 157730f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 157830f712c9SDave Chinner 157930f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 158030f712c9SDave Chinner if (ichdr->freemap[i].base == tmp) { 158130f712c9SDave Chinner ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t); 15822a2b5932SBrian Foster ichdr->freemap[i].size -= 15832a2b5932SBrian Foster min_t(uint16_t, ichdr->freemap[i].size, 15842a2b5932SBrian Foster sizeof(xfs_attr_leaf_entry_t)); 158530f712c9SDave Chinner } 158630f712c9SDave Chinner } 158730f712c9SDave Chinner ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index); 158830f712c9SDave Chinner return 0; 158930f712c9SDave Chinner } 159030f712c9SDave Chinner 159130f712c9SDave Chinner /* 159230f712c9SDave Chinner * Garbage collect a leaf attribute list block by copying it to a new buffer. 159330f712c9SDave Chinner */ 159430f712c9SDave Chinner STATIC void 159530f712c9SDave Chinner xfs_attr3_leaf_compact( 159630f712c9SDave Chinner struct xfs_da_args *args, 159730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_dst, 159830f712c9SDave Chinner struct xfs_buf *bp) 159930f712c9SDave Chinner { 160030f712c9SDave Chinner struct xfs_attr_leafblock *leaf_src; 160130f712c9SDave Chinner struct xfs_attr_leafblock *leaf_dst; 160230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr_src; 160330f712c9SDave Chinner struct xfs_trans *trans = args->trans; 160430f712c9SDave Chinner char *tmpbuffer; 160530f712c9SDave Chinner 160630f712c9SDave Chinner trace_xfs_attr_leaf_compact(args); 160730f712c9SDave Chinner 1608707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(args->geo->blksize, 0); 160930f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 161030f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 161130f712c9SDave Chinner leaf_src = (xfs_attr_leafblock_t *)tmpbuffer; 161230f712c9SDave Chinner leaf_dst = bp->b_addr; 161330f712c9SDave Chinner 161430f712c9SDave Chinner /* 161530f712c9SDave Chinner * Copy the on-disk header back into the destination buffer to ensure 161630f712c9SDave Chinner * all the information in the header that is not part of the incore 161730f712c9SDave Chinner * header structure is preserved. 161830f712c9SDave Chinner */ 161930f712c9SDave Chinner memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src)); 162030f712c9SDave Chinner 162130f712c9SDave Chinner /* Initialise the incore headers */ 162230f712c9SDave Chinner ichdr_src = *ichdr_dst; /* struct copy */ 162330f712c9SDave Chinner ichdr_dst->firstused = args->geo->blksize; 162430f712c9SDave Chinner ichdr_dst->usedbytes = 0; 162530f712c9SDave Chinner ichdr_dst->count = 0; 162630f712c9SDave Chinner ichdr_dst->holes = 0; 162730f712c9SDave Chinner ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src); 162830f712c9SDave Chinner ichdr_dst->freemap[0].size = ichdr_dst->firstused - 162930f712c9SDave Chinner ichdr_dst->freemap[0].base; 163030f712c9SDave Chinner 163130f712c9SDave Chinner /* write the header back to initialise the underlying buffer */ 16322f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst); 163330f712c9SDave Chinner 163430f712c9SDave Chinner /* 163530f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 163630f712c9SDave Chinner * but allocate name/value pairs packed and in sequence. 163730f712c9SDave Chinner */ 163830f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0, 163930f712c9SDave Chinner leaf_dst, ichdr_dst, 0, ichdr_src.count); 164030f712c9SDave Chinner /* 164130f712c9SDave Chinner * this logs the entire buffer, but the caller must write the header 164230f712c9SDave Chinner * back to the buffer when it is finished modifying it. 164330f712c9SDave Chinner */ 164430f712c9SDave Chinner xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1); 164530f712c9SDave Chinner 164630f712c9SDave Chinner kmem_free(tmpbuffer); 164730f712c9SDave Chinner } 164830f712c9SDave Chinner 164930f712c9SDave Chinner /* 165030f712c9SDave Chinner * Compare two leaf blocks "order". 165130f712c9SDave Chinner * Return 0 unless leaf2 should go before leaf1. 165230f712c9SDave Chinner */ 165330f712c9SDave Chinner static int 165430f712c9SDave Chinner xfs_attr3_leaf_order( 165530f712c9SDave Chinner struct xfs_buf *leaf1_bp, 165630f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf1hdr, 165730f712c9SDave Chinner struct xfs_buf *leaf2_bp, 165830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf2hdr) 165930f712c9SDave Chinner { 166030f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 166130f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 166230f712c9SDave Chinner 166330f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr); 166430f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr); 166530f712c9SDave Chinner if (leaf1hdr->count > 0 && leaf2hdr->count > 0 && 166630f712c9SDave Chinner ((be32_to_cpu(entries2[0].hashval) < 166730f712c9SDave Chinner be32_to_cpu(entries1[0].hashval)) || 166830f712c9SDave Chinner (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) < 166930f712c9SDave Chinner be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) { 167030f712c9SDave Chinner return 1; 167130f712c9SDave Chinner } 167230f712c9SDave Chinner return 0; 167330f712c9SDave Chinner } 167430f712c9SDave Chinner 167530f712c9SDave Chinner int 167630f712c9SDave Chinner xfs_attr_leaf_order( 167730f712c9SDave Chinner struct xfs_buf *leaf1_bp, 167830f712c9SDave Chinner struct xfs_buf *leaf2_bp) 167930f712c9SDave Chinner { 168030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 168130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 1682dbd329f1SChristoph Hellwig struct xfs_mount *mp = leaf1_bp->b_mount; 168330f712c9SDave Chinner 16842f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr); 16852f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr); 168630f712c9SDave Chinner return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2); 168730f712c9SDave Chinner } 168830f712c9SDave Chinner 168930f712c9SDave Chinner /* 169030f712c9SDave Chinner * Redistribute the attribute list entries between two leaf nodes, 169130f712c9SDave Chinner * taking into account the size of the new entry. 169230f712c9SDave Chinner * 169330f712c9SDave Chinner * NOTE: if new block is empty, then it will get the upper half of the 169430f712c9SDave Chinner * old block. At present, all (one) callers pass in an empty second block. 169530f712c9SDave Chinner * 169630f712c9SDave Chinner * This code adjusts the args->index/blkno and args->index2/blkno2 fields 169730f712c9SDave Chinner * to match what it is doing in splitting the attribute leaf block. Those 169830f712c9SDave Chinner * values are used in "atomic rename" operations on attributes. Note that 169930f712c9SDave Chinner * the "new" and "old" values can end up in different blocks. 170030f712c9SDave Chinner */ 170130f712c9SDave Chinner STATIC void 170230f712c9SDave Chinner xfs_attr3_leaf_rebalance( 170330f712c9SDave Chinner struct xfs_da_state *state, 170430f712c9SDave Chinner struct xfs_da_state_blk *blk1, 170530f712c9SDave Chinner struct xfs_da_state_blk *blk2) 170630f712c9SDave Chinner { 170730f712c9SDave Chinner struct xfs_da_args *args; 170830f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 170930f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 171030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 171130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 171230f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 171330f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 171430f712c9SDave Chinner int count; 171530f712c9SDave Chinner int totallen; 171630f712c9SDave Chinner int max; 171730f712c9SDave Chinner int space; 171830f712c9SDave Chinner int swap; 171930f712c9SDave Chinner 172030f712c9SDave Chinner /* 172130f712c9SDave Chinner * Set up environment. 172230f712c9SDave Chinner */ 172330f712c9SDave Chinner ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC); 172430f712c9SDave Chinner ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC); 172530f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 172630f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 17272f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1); 17282f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2); 172930f712c9SDave Chinner ASSERT(ichdr2.count == 0); 173030f712c9SDave Chinner args = state->args; 173130f712c9SDave Chinner 173230f712c9SDave Chinner trace_xfs_attr_leaf_rebalance(args); 173330f712c9SDave Chinner 173430f712c9SDave Chinner /* 173530f712c9SDave Chinner * Check ordering of blocks, reverse if it makes things simpler. 173630f712c9SDave Chinner * 173730f712c9SDave Chinner * NOTE: Given that all (current) callers pass in an empty 173830f712c9SDave Chinner * second block, this code should never set "swap". 173930f712c9SDave Chinner */ 174030f712c9SDave Chinner swap = 0; 174130f712c9SDave Chinner if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) { 17421d5bebbaSGustavo A. R. Silva swap(blk1, blk2); 174330f712c9SDave Chinner 17441d5bebbaSGustavo A. R. Silva /* swap structures rather than reconverting them */ 17451d5bebbaSGustavo A. R. Silva swap(ichdr1, ichdr2); 174630f712c9SDave Chinner 174730f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 174830f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 174930f712c9SDave Chinner swap = 1; 175030f712c9SDave Chinner } 175130f712c9SDave Chinner 175230f712c9SDave Chinner /* 175330f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 175430f712c9SDave Chinner * byte usage between the two blocks to a minimum. Then get 175530f712c9SDave Chinner * the direction to copy and the number of elements to move. 175630f712c9SDave Chinner * 175730f712c9SDave Chinner * "inleaf" is true if the new entry should be inserted into blk1. 175830f712c9SDave Chinner * If "swap" is also true, then reverse the sense of "inleaf". 175930f712c9SDave Chinner */ 176030f712c9SDave Chinner state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1, 176130f712c9SDave Chinner blk2, &ichdr2, 176230f712c9SDave Chinner &count, &totallen); 176330f712c9SDave Chinner if (swap) 176430f712c9SDave Chinner state->inleaf = !state->inleaf; 176530f712c9SDave Chinner 176630f712c9SDave Chinner /* 176730f712c9SDave Chinner * Move any entries required from leaf to leaf: 176830f712c9SDave Chinner */ 176930f712c9SDave Chinner if (count < ichdr1.count) { 177030f712c9SDave Chinner /* 177130f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 177230f712c9SDave Chinner */ 177330f712c9SDave Chinner /* number entries being moved */ 177430f712c9SDave Chinner count = ichdr1.count - count; 177530f712c9SDave Chinner space = ichdr1.usedbytes - totallen; 177630f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 177730f712c9SDave Chinner 177830f712c9SDave Chinner /* 177930f712c9SDave Chinner * leaf2 is the destination, compact it if it looks tight. 178030f712c9SDave Chinner */ 178130f712c9SDave Chinner max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1); 178230f712c9SDave Chinner max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t); 178330f712c9SDave Chinner if (space > max) 178430f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp); 178530f712c9SDave Chinner 178630f712c9SDave Chinner /* 178730f712c9SDave Chinner * Move high entries from leaf1 to low end of leaf2. 178830f712c9SDave Chinner */ 178930f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf1, &ichdr1, 179030f712c9SDave Chinner ichdr1.count - count, leaf2, &ichdr2, 0, count); 179130f712c9SDave Chinner 179230f712c9SDave Chinner } else if (count > ichdr1.count) { 179330f712c9SDave Chinner /* 179430f712c9SDave Chinner * I assert that since all callers pass in an empty 179530f712c9SDave Chinner * second buffer, this code should never execute. 179630f712c9SDave Chinner */ 179730f712c9SDave Chinner ASSERT(0); 179830f712c9SDave Chinner 179930f712c9SDave Chinner /* 180030f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 180130f712c9SDave Chinner */ 180230f712c9SDave Chinner /* number entries being moved */ 180330f712c9SDave Chinner count -= ichdr1.count; 180430f712c9SDave Chinner space = totallen - ichdr1.usedbytes; 180530f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 180630f712c9SDave Chinner 180730f712c9SDave Chinner /* 180830f712c9SDave Chinner * leaf1 is the destination, compact it if it looks tight. 180930f712c9SDave Chinner */ 181030f712c9SDave Chinner max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1); 181130f712c9SDave Chinner max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t); 181230f712c9SDave Chinner if (space > max) 181330f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp); 181430f712c9SDave Chinner 181530f712c9SDave Chinner /* 181630f712c9SDave Chinner * Move low entries from leaf2 to high end of leaf1. 181730f712c9SDave Chinner */ 181830f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1, 181930f712c9SDave Chinner ichdr1.count, count); 182030f712c9SDave Chinner } 182130f712c9SDave Chinner 18222f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1); 18232f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2); 182430f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1); 182530f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1); 182630f712c9SDave Chinner 182730f712c9SDave Chinner /* 182830f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 182930f712c9SDave Chinner */ 183030f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1); 183130f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2); 183230f712c9SDave Chinner blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval); 183330f712c9SDave Chinner blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval); 183430f712c9SDave Chinner 183530f712c9SDave Chinner /* 183630f712c9SDave Chinner * Adjust the expected index for insertion. 183730f712c9SDave Chinner * NOTE: this code depends on the (current) situation that the 183830f712c9SDave Chinner * second block was originally empty. 183930f712c9SDave Chinner * 184030f712c9SDave Chinner * If the insertion point moved to the 2nd block, we must adjust 184130f712c9SDave Chinner * the index. We must also track the entry just following the 184230f712c9SDave Chinner * new entry for use in an "atomic rename" operation, that entry 184330f712c9SDave Chinner * is always the "old" entry and the "new" entry is what we are 184430f712c9SDave Chinner * inserting. The index/blkno fields refer to the "old" entry, 184530f712c9SDave Chinner * while the index2/blkno2 fields refer to the "new" entry. 184630f712c9SDave Chinner */ 184730f712c9SDave Chinner if (blk1->index > ichdr1.count) { 184830f712c9SDave Chinner ASSERT(state->inleaf == 0); 184930f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 185030f712c9SDave Chinner args->index = args->index2 = blk2->index; 185130f712c9SDave Chinner args->blkno = args->blkno2 = blk2->blkno; 185230f712c9SDave Chinner } else if (blk1->index == ichdr1.count) { 185330f712c9SDave Chinner if (state->inleaf) { 185430f712c9SDave Chinner args->index = blk1->index; 185530f712c9SDave Chinner args->blkno = blk1->blkno; 185630f712c9SDave Chinner args->index2 = 0; 185730f712c9SDave Chinner args->blkno2 = blk2->blkno; 185830f712c9SDave Chinner } else { 185930f712c9SDave Chinner /* 186030f712c9SDave Chinner * On a double leaf split, the original attr location 186130f712c9SDave Chinner * is already stored in blkno2/index2, so don't 186230f712c9SDave Chinner * overwrite it overwise we corrupt the tree. 186330f712c9SDave Chinner */ 186430f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 186530f712c9SDave Chinner args->index = blk2->index; 186630f712c9SDave Chinner args->blkno = blk2->blkno; 186730f712c9SDave Chinner if (!state->extravalid) { 186830f712c9SDave Chinner /* 186930f712c9SDave Chinner * set the new attr location to match the old 187030f712c9SDave Chinner * one and let the higher level split code 187130f712c9SDave Chinner * decide where in the leaf to place it. 187230f712c9SDave Chinner */ 187330f712c9SDave Chinner args->index2 = blk2->index; 187430f712c9SDave Chinner args->blkno2 = blk2->blkno; 187530f712c9SDave Chinner } 187630f712c9SDave Chinner } 187730f712c9SDave Chinner } else { 187830f712c9SDave Chinner ASSERT(state->inleaf == 1); 187930f712c9SDave Chinner args->index = args->index2 = blk1->index; 188030f712c9SDave Chinner args->blkno = args->blkno2 = blk1->blkno; 188130f712c9SDave Chinner } 188230f712c9SDave Chinner } 188330f712c9SDave Chinner 188430f712c9SDave Chinner /* 188530f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 188630f712c9SDave Chinner * byte usage between the two blocks to a minimum. 188730f712c9SDave Chinner * GROT: Is this really necessary? With other than a 512 byte blocksize, 188830f712c9SDave Chinner * GROT: there will always be enough room in either block for a new entry. 188930f712c9SDave Chinner * GROT: Do a double-split for this case? 189030f712c9SDave Chinner */ 189130f712c9SDave Chinner STATIC int 189230f712c9SDave Chinner xfs_attr3_leaf_figure_balance( 189330f712c9SDave Chinner struct xfs_da_state *state, 189430f712c9SDave Chinner struct xfs_da_state_blk *blk1, 189530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 189630f712c9SDave Chinner struct xfs_da_state_blk *blk2, 189730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 189830f712c9SDave Chinner int *countarg, 189930f712c9SDave Chinner int *usedbytesarg) 190030f712c9SDave Chinner { 190130f712c9SDave Chinner struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr; 190230f712c9SDave Chinner struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr; 190330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 190430f712c9SDave Chinner int count; 190530f712c9SDave Chinner int max; 190630f712c9SDave Chinner int index; 190730f712c9SDave Chinner int totallen = 0; 190830f712c9SDave Chinner int half; 190930f712c9SDave Chinner int lastdelta; 191030f712c9SDave Chinner int foundit = 0; 191130f712c9SDave Chinner int tmp; 191230f712c9SDave Chinner 191330f712c9SDave Chinner /* 191430f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 191530f712c9SDave Chinner * byte usage between the two blocks to a minimum. 191630f712c9SDave Chinner */ 191730f712c9SDave Chinner max = ichdr1->count + ichdr2->count; 191830f712c9SDave Chinner half = (max + 1) * sizeof(*entry); 191930f712c9SDave Chinner half += ichdr1->usedbytes + ichdr2->usedbytes + 192030f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 192130f712c9SDave Chinner half /= 2; 192230f712c9SDave Chinner lastdelta = state->args->geo->blksize; 192330f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 192430f712c9SDave Chinner for (count = index = 0; count < max; entry++, index++, count++) { 192530f712c9SDave Chinner 192630f712c9SDave Chinner #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A)) 192730f712c9SDave Chinner /* 192830f712c9SDave Chinner * The new entry is in the first block, account for it. 192930f712c9SDave Chinner */ 193030f712c9SDave Chinner if (count == blk1->index) { 193130f712c9SDave Chinner tmp = totallen + sizeof(*entry) + 193230f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 193330f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 193430f712c9SDave Chinner break; 193530f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 193630f712c9SDave Chinner totallen = tmp; 193730f712c9SDave Chinner foundit = 1; 193830f712c9SDave Chinner } 193930f712c9SDave Chinner 194030f712c9SDave Chinner /* 194130f712c9SDave Chinner * Wrap around into the second block if necessary. 194230f712c9SDave Chinner */ 194330f712c9SDave Chinner if (count == ichdr1->count) { 194430f712c9SDave Chinner leaf1 = leaf2; 194530f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 194630f712c9SDave Chinner index = 0; 194730f712c9SDave Chinner } 194830f712c9SDave Chinner 194930f712c9SDave Chinner /* 195030f712c9SDave Chinner * Figure out if next leaf entry would be too much. 195130f712c9SDave Chinner */ 195230f712c9SDave Chinner tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1, 195330f712c9SDave Chinner index); 195430f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 195530f712c9SDave Chinner break; 195630f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 195730f712c9SDave Chinner totallen = tmp; 195830f712c9SDave Chinner #undef XFS_ATTR_ABS 195930f712c9SDave Chinner } 196030f712c9SDave Chinner 196130f712c9SDave Chinner /* 196230f712c9SDave Chinner * Calculate the number of usedbytes that will end up in lower block. 196330f712c9SDave Chinner * If new entry not in lower block, fix up the count. 196430f712c9SDave Chinner */ 196530f712c9SDave Chinner totallen -= count * sizeof(*entry); 196630f712c9SDave Chinner if (foundit) { 196730f712c9SDave Chinner totallen -= sizeof(*entry) + 196830f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 196930f712c9SDave Chinner } 197030f712c9SDave Chinner 197130f712c9SDave Chinner *countarg = count; 197230f712c9SDave Chinner *usedbytesarg = totallen; 197330f712c9SDave Chinner return foundit; 197430f712c9SDave Chinner } 197530f712c9SDave Chinner 197630f712c9SDave Chinner /*======================================================================== 197730f712c9SDave Chinner * Routines used for shrinking the Btree. 197830f712c9SDave Chinner *========================================================================*/ 197930f712c9SDave Chinner 198030f712c9SDave Chinner /* 198130f712c9SDave Chinner * Check a leaf block and its neighbors to see if the block should be 198230f712c9SDave Chinner * collapsed into one or the other neighbor. Always keep the block 198330f712c9SDave Chinner * with the smaller block number. 198430f712c9SDave Chinner * If the current block is over 50% full, don't try to join it, return 0. 198530f712c9SDave Chinner * If the block is empty, fill in the state structure and return 2. 198630f712c9SDave Chinner * If it can be collapsed, fill in the state structure and return 1. 198730f712c9SDave Chinner * If nothing can be done, return 0. 198830f712c9SDave Chinner * 198930f712c9SDave Chinner * GROT: allow for INCOMPLETE entries in calculation. 199030f712c9SDave Chinner */ 199130f712c9SDave Chinner int 199230f712c9SDave Chinner xfs_attr3_leaf_toosmall( 199330f712c9SDave Chinner struct xfs_da_state *state, 199430f712c9SDave Chinner int *action) 199530f712c9SDave Chinner { 199630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 199730f712c9SDave Chinner struct xfs_da_state_blk *blk; 199830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 199930f712c9SDave Chinner struct xfs_buf *bp; 200030f712c9SDave Chinner xfs_dablk_t blkno; 200130f712c9SDave Chinner int bytes; 200230f712c9SDave Chinner int forward; 200330f712c9SDave Chinner int error; 200430f712c9SDave Chinner int retval; 200530f712c9SDave Chinner int i; 200630f712c9SDave Chinner 200730f712c9SDave Chinner trace_xfs_attr_leaf_toosmall(state->args); 200830f712c9SDave Chinner 200930f712c9SDave Chinner /* 201030f712c9SDave Chinner * Check for the degenerate case of the block being over 50% full. 201130f712c9SDave Chinner * If so, it's not worth even looking to see if we might be able 201230f712c9SDave Chinner * to coalesce with a sibling. 201330f712c9SDave Chinner */ 201430f712c9SDave Chinner blk = &state->path.blk[ state->path.active-1 ]; 201530f712c9SDave Chinner leaf = blk->bp->b_addr; 20162f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf); 201730f712c9SDave Chinner bytes = xfs_attr3_leaf_hdr_size(leaf) + 201830f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t) + 201930f712c9SDave Chinner ichdr.usedbytes; 202030f712c9SDave Chinner if (bytes > (state->args->geo->blksize >> 1)) { 202130f712c9SDave Chinner *action = 0; /* blk over 50%, don't try to join */ 202230f712c9SDave Chinner return 0; 202330f712c9SDave Chinner } 202430f712c9SDave Chinner 202530f712c9SDave Chinner /* 202630f712c9SDave Chinner * Check for the degenerate case of the block being empty. 202730f712c9SDave Chinner * If the block is empty, we'll simply delete it, no need to 202830f712c9SDave Chinner * coalesce it with a sibling block. We choose (arbitrarily) 202930f712c9SDave Chinner * to merge with the forward block unless it is NULL. 203030f712c9SDave Chinner */ 203130f712c9SDave Chinner if (ichdr.count == 0) { 203230f712c9SDave Chinner /* 203330f712c9SDave Chinner * Make altpath point to the block we want to keep and 203430f712c9SDave Chinner * path point to the block we want to drop (this one). 203530f712c9SDave Chinner */ 203630f712c9SDave Chinner forward = (ichdr.forw != 0); 203730f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 203830f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 203930f712c9SDave Chinner 0, &retval); 204030f712c9SDave Chinner if (error) 204130f712c9SDave Chinner return error; 204230f712c9SDave Chinner if (retval) { 204330f712c9SDave Chinner *action = 0; 204430f712c9SDave Chinner } else { 204530f712c9SDave Chinner *action = 2; 204630f712c9SDave Chinner } 204730f712c9SDave Chinner return 0; 204830f712c9SDave Chinner } 204930f712c9SDave Chinner 205030f712c9SDave Chinner /* 205130f712c9SDave Chinner * Examine each sibling block to see if we can coalesce with 205230f712c9SDave Chinner * at least 25% free space to spare. We need to figure out 205330f712c9SDave Chinner * whether to merge with the forward or the backward block. 205430f712c9SDave Chinner * We prefer coalescing with the lower numbered sibling so as 205530f712c9SDave Chinner * to shrink an attribute list over time. 205630f712c9SDave Chinner */ 205730f712c9SDave Chinner /* start with smaller blk num */ 205830f712c9SDave Chinner forward = ichdr.forw < ichdr.back; 205930f712c9SDave Chinner for (i = 0; i < 2; forward = !forward, i++) { 206030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 206130f712c9SDave Chinner if (forward) 206230f712c9SDave Chinner blkno = ichdr.forw; 206330f712c9SDave Chinner else 206430f712c9SDave Chinner blkno = ichdr.back; 206530f712c9SDave Chinner if (blkno == 0) 206630f712c9SDave Chinner continue; 206730f712c9SDave Chinner error = xfs_attr3_leaf_read(state->args->trans, state->args->dp, 2068dfb87594SChristoph Hellwig blkno, &bp); 206930f712c9SDave Chinner if (error) 207030f712c9SDave Chinner return error; 207130f712c9SDave Chinner 20722f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr); 207330f712c9SDave Chinner 207430f712c9SDave Chinner bytes = state->args->geo->blksize - 207530f712c9SDave Chinner (state->args->geo->blksize >> 2) - 207630f712c9SDave Chinner ichdr.usedbytes - ichdr2.usedbytes - 207730f712c9SDave Chinner ((ichdr.count + ichdr2.count) * 207830f712c9SDave Chinner sizeof(xfs_attr_leaf_entry_t)) - 207930f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf); 208030f712c9SDave Chinner 208130f712c9SDave Chinner xfs_trans_brelse(state->args->trans, bp); 208230f712c9SDave Chinner if (bytes >= 0) 208330f712c9SDave Chinner break; /* fits with at least 25% to spare */ 208430f712c9SDave Chinner } 208530f712c9SDave Chinner if (i >= 2) { 208630f712c9SDave Chinner *action = 0; 208730f712c9SDave Chinner return 0; 208830f712c9SDave Chinner } 208930f712c9SDave Chinner 209030f712c9SDave Chinner /* 209130f712c9SDave Chinner * Make altpath point to the block we want to keep (the lower 209230f712c9SDave Chinner * numbered block) and path point to the block we want to drop. 209330f712c9SDave Chinner */ 209430f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 209530f712c9SDave Chinner if (blkno < blk->blkno) { 209630f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 209730f712c9SDave Chinner 0, &retval); 209830f712c9SDave Chinner } else { 209930f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->path, forward, 210030f712c9SDave Chinner 0, &retval); 210130f712c9SDave Chinner } 210230f712c9SDave Chinner if (error) 210330f712c9SDave Chinner return error; 210430f712c9SDave Chinner if (retval) { 210530f712c9SDave Chinner *action = 0; 210630f712c9SDave Chinner } else { 210730f712c9SDave Chinner *action = 1; 210830f712c9SDave Chinner } 210930f712c9SDave Chinner return 0; 211030f712c9SDave Chinner } 211130f712c9SDave Chinner 211230f712c9SDave Chinner /* 211330f712c9SDave Chinner * Remove a name from the leaf attribute list structure. 211430f712c9SDave Chinner * 211530f712c9SDave Chinner * Return 1 if leaf is less than 37% full, 0 if >= 37% full. 211630f712c9SDave Chinner * If two leaves are 37% full, when combined they will leave 25% free. 211730f712c9SDave Chinner */ 211830f712c9SDave Chinner int 211930f712c9SDave Chinner xfs_attr3_leaf_remove( 212030f712c9SDave Chinner struct xfs_buf *bp, 212130f712c9SDave Chinner struct xfs_da_args *args) 212230f712c9SDave Chinner { 212330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 212430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 212530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 212630f712c9SDave Chinner int before; 212730f712c9SDave Chinner int after; 212830f712c9SDave Chinner int smallest; 212930f712c9SDave Chinner int entsize; 213030f712c9SDave Chinner int tablesize; 213130f712c9SDave Chinner int tmp; 213230f712c9SDave Chinner int i; 213330f712c9SDave Chinner 213430f712c9SDave Chinner trace_xfs_attr_leaf_remove(args); 213530f712c9SDave Chinner 213630f712c9SDave Chinner leaf = bp->b_addr; 21372f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 213830f712c9SDave Chinner 213930f712c9SDave Chinner ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8); 214030f712c9SDave Chinner ASSERT(args->index >= 0 && args->index < ichdr.count); 214130f712c9SDave Chinner ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) + 214230f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf)); 214330f712c9SDave Chinner 214430f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 214530f712c9SDave Chinner 214630f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 214730f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 214830f712c9SDave Chinner 214930f712c9SDave Chinner /* 215030f712c9SDave Chinner * Scan through free region table: 215130f712c9SDave Chinner * check for adjacency of free'd entry with an existing one, 215230f712c9SDave Chinner * find smallest free region in case we need to replace it, 215330f712c9SDave Chinner * adjust any map that borders the entry table, 215430f712c9SDave Chinner */ 215530f712c9SDave Chinner tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t) 215630f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 215730f712c9SDave Chinner tmp = ichdr.freemap[0].size; 215830f712c9SDave Chinner before = after = -1; 215930f712c9SDave Chinner smallest = XFS_ATTR_LEAF_MAPSIZE - 1; 216030f712c9SDave Chinner entsize = xfs_attr_leaf_entsize(leaf, args->index); 216130f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 216230f712c9SDave Chinner ASSERT(ichdr.freemap[i].base < args->geo->blksize); 216330f712c9SDave Chinner ASSERT(ichdr.freemap[i].size < args->geo->blksize); 216430f712c9SDave Chinner if (ichdr.freemap[i].base == tablesize) { 216530f712c9SDave Chinner ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t); 216630f712c9SDave Chinner ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t); 216730f712c9SDave Chinner } 216830f712c9SDave Chinner 216930f712c9SDave Chinner if (ichdr.freemap[i].base + ichdr.freemap[i].size == 217030f712c9SDave Chinner be16_to_cpu(entry->nameidx)) { 217130f712c9SDave Chinner before = i; 217230f712c9SDave Chinner } else if (ichdr.freemap[i].base == 217330f712c9SDave Chinner (be16_to_cpu(entry->nameidx) + entsize)) { 217430f712c9SDave Chinner after = i; 217530f712c9SDave Chinner } else if (ichdr.freemap[i].size < tmp) { 217630f712c9SDave Chinner tmp = ichdr.freemap[i].size; 217730f712c9SDave Chinner smallest = i; 217830f712c9SDave Chinner } 217930f712c9SDave Chinner } 218030f712c9SDave Chinner 218130f712c9SDave Chinner /* 218230f712c9SDave Chinner * Coalesce adjacent freemap regions, 218330f712c9SDave Chinner * or replace the smallest region. 218430f712c9SDave Chinner */ 218530f712c9SDave Chinner if ((before >= 0) || (after >= 0)) { 218630f712c9SDave Chinner if ((before >= 0) && (after >= 0)) { 218730f712c9SDave Chinner ichdr.freemap[before].size += entsize; 218830f712c9SDave Chinner ichdr.freemap[before].size += ichdr.freemap[after].size; 218930f712c9SDave Chinner ichdr.freemap[after].base = 0; 219030f712c9SDave Chinner ichdr.freemap[after].size = 0; 219130f712c9SDave Chinner } else if (before >= 0) { 219230f712c9SDave Chinner ichdr.freemap[before].size += entsize; 219330f712c9SDave Chinner } else { 219430f712c9SDave Chinner ichdr.freemap[after].base = be16_to_cpu(entry->nameidx); 219530f712c9SDave Chinner ichdr.freemap[after].size += entsize; 219630f712c9SDave Chinner } 219730f712c9SDave Chinner } else { 219830f712c9SDave Chinner /* 219930f712c9SDave Chinner * Replace smallest region (if it is smaller than free'd entry) 220030f712c9SDave Chinner */ 220130f712c9SDave Chinner if (ichdr.freemap[smallest].size < entsize) { 220230f712c9SDave Chinner ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx); 220330f712c9SDave Chinner ichdr.freemap[smallest].size = entsize; 220430f712c9SDave Chinner } 220530f712c9SDave Chinner } 220630f712c9SDave Chinner 220730f712c9SDave Chinner /* 220830f712c9SDave Chinner * Did we remove the first entry? 220930f712c9SDave Chinner */ 221030f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) == ichdr.firstused) 221130f712c9SDave Chinner smallest = 1; 221230f712c9SDave Chinner else 221330f712c9SDave Chinner smallest = 0; 221430f712c9SDave Chinner 221530f712c9SDave Chinner /* 221630f712c9SDave Chinner * Compress the remaining entries and zero out the removed stuff. 221730f712c9SDave Chinner */ 221830f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize); 221930f712c9SDave Chinner ichdr.usedbytes -= entsize; 222030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 222130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 222230f712c9SDave Chinner entsize)); 222330f712c9SDave Chinner 222430f712c9SDave Chinner tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t); 222530f712c9SDave Chinner memmove(entry, entry + 1, tmp); 222630f712c9SDave Chinner ichdr.count--; 222730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 222830f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t))); 222930f712c9SDave Chinner 223030f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count]; 223130f712c9SDave Chinner memset(entry, 0, sizeof(xfs_attr_leaf_entry_t)); 223230f712c9SDave Chinner 223330f712c9SDave Chinner /* 223430f712c9SDave Chinner * If we removed the first entry, re-find the first used byte 223530f712c9SDave Chinner * in the name area. Note that if the entry was the "firstused", 223630f712c9SDave Chinner * then we don't have a "hole" in our block resulting from 223730f712c9SDave Chinner * removing the name. 223830f712c9SDave Chinner */ 223930f712c9SDave Chinner if (smallest) { 224030f712c9SDave Chinner tmp = args->geo->blksize; 224130f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 224230f712c9SDave Chinner for (i = ichdr.count - 1; i >= 0; entry++, i--) { 224330f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 224430f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 224530f712c9SDave Chinner 224630f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < tmp) 224730f712c9SDave Chinner tmp = be16_to_cpu(entry->nameidx); 224830f712c9SDave Chinner } 224930f712c9SDave Chinner ichdr.firstused = tmp; 225066db8104SBrian Foster ASSERT(ichdr.firstused != 0); 225130f712c9SDave Chinner } else { 225230f712c9SDave Chinner ichdr.holes = 1; /* mark as needing compaction */ 225330f712c9SDave Chinner } 22542f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 225530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 225630f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 225730f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 225830f712c9SDave Chinner 225930f712c9SDave Chinner /* 226030f712c9SDave Chinner * Check if leaf is less than 50% full, caller may want to 226130f712c9SDave Chinner * "join" the leaf with a sibling if so. 226230f712c9SDave Chinner */ 226330f712c9SDave Chinner tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) + 226430f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t); 226530f712c9SDave Chinner 226630f712c9SDave Chinner return tmp < args->geo->magicpct; /* leaf is < 37% full */ 226730f712c9SDave Chinner } 226830f712c9SDave Chinner 226930f712c9SDave Chinner /* 227030f712c9SDave Chinner * Move all the attribute list entries from drop_leaf into save_leaf. 227130f712c9SDave Chinner */ 227230f712c9SDave Chinner void 227330f712c9SDave Chinner xfs_attr3_leaf_unbalance( 227430f712c9SDave Chinner struct xfs_da_state *state, 227530f712c9SDave Chinner struct xfs_da_state_blk *drop_blk, 227630f712c9SDave Chinner struct xfs_da_state_blk *save_blk) 227730f712c9SDave Chinner { 227830f712c9SDave Chinner struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr; 227930f712c9SDave Chinner struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr; 228030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr drophdr; 228130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr savehdr; 228230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 228330f712c9SDave Chinner 228430f712c9SDave Chinner trace_xfs_attr_leaf_unbalance(state->args); 228530f712c9SDave Chinner 228630f712c9SDave Chinner drop_leaf = drop_blk->bp->b_addr; 228730f712c9SDave Chinner save_leaf = save_blk->bp->b_addr; 22882f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf); 22892f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf); 229030f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(drop_leaf); 229130f712c9SDave Chinner 229230f712c9SDave Chinner /* 229330f712c9SDave Chinner * Save last hashval from dying block for later Btree fixup. 229430f712c9SDave Chinner */ 229530f712c9SDave Chinner drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval); 229630f712c9SDave Chinner 229730f712c9SDave Chinner /* 229830f712c9SDave Chinner * Check if we need a temp buffer, or can we do it in place. 229930f712c9SDave Chinner * Note that we don't check "leaf" for holes because we will 230030f712c9SDave Chinner * always be dropping it, toosmall() decided that for us already. 230130f712c9SDave Chinner */ 230230f712c9SDave Chinner if (savehdr.holes == 0) { 230330f712c9SDave Chinner /* 230430f712c9SDave Chinner * dest leaf has no holes, so we add there. May need 230530f712c9SDave Chinner * to make some room in the entry array. 230630f712c9SDave Chinner */ 230730f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 230830f712c9SDave Chinner drop_blk->bp, &drophdr)) { 230930f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 231030f712c9SDave Chinner drop_leaf, &drophdr, 0, 231130f712c9SDave Chinner save_leaf, &savehdr, 0, 231230f712c9SDave Chinner drophdr.count); 231330f712c9SDave Chinner } else { 231430f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 231530f712c9SDave Chinner drop_leaf, &drophdr, 0, 231630f712c9SDave Chinner save_leaf, &savehdr, 231730f712c9SDave Chinner savehdr.count, drophdr.count); 231830f712c9SDave Chinner } 231930f712c9SDave Chinner } else { 232030f712c9SDave Chinner /* 232130f712c9SDave Chinner * Destination has holes, so we make a temporary copy 232230f712c9SDave Chinner * of the leaf and add them both to that. 232330f712c9SDave Chinner */ 232430f712c9SDave Chinner struct xfs_attr_leafblock *tmp_leaf; 232530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr tmphdr; 232630f712c9SDave Chinner 2327707e0ddaSTetsuo Handa tmp_leaf = kmem_zalloc(state->args->geo->blksize, 0); 232830f712c9SDave Chinner 232930f712c9SDave Chinner /* 233030f712c9SDave Chinner * Copy the header into the temp leaf so that all the stuff 233130f712c9SDave Chinner * not in the incore header is present and gets copied back in 233230f712c9SDave Chinner * once we've moved all the entries. 233330f712c9SDave Chinner */ 233430f712c9SDave Chinner memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf)); 233530f712c9SDave Chinner 233630f712c9SDave Chinner memset(&tmphdr, 0, sizeof(tmphdr)); 233730f712c9SDave Chinner tmphdr.magic = savehdr.magic; 233830f712c9SDave Chinner tmphdr.forw = savehdr.forw; 233930f712c9SDave Chinner tmphdr.back = savehdr.back; 234030f712c9SDave Chinner tmphdr.firstused = state->args->geo->blksize; 234130f712c9SDave Chinner 234230f712c9SDave Chinner /* write the header to the temp buffer to initialise it */ 23432f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr); 234430f712c9SDave Chinner 234530f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 234630f712c9SDave Chinner drop_blk->bp, &drophdr)) { 234730f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 234830f712c9SDave Chinner drop_leaf, &drophdr, 0, 234930f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 235030f712c9SDave Chinner drophdr.count); 235130f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 235230f712c9SDave Chinner save_leaf, &savehdr, 0, 235330f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 235430f712c9SDave Chinner savehdr.count); 235530f712c9SDave Chinner } else { 235630f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 235730f712c9SDave Chinner save_leaf, &savehdr, 0, 235830f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 235930f712c9SDave Chinner savehdr.count); 236030f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 236130f712c9SDave Chinner drop_leaf, &drophdr, 0, 236230f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 236330f712c9SDave Chinner drophdr.count); 236430f712c9SDave Chinner } 236530f712c9SDave Chinner memcpy(save_leaf, tmp_leaf, state->args->geo->blksize); 236630f712c9SDave Chinner savehdr = tmphdr; /* struct copy */ 236730f712c9SDave Chinner kmem_free(tmp_leaf); 236830f712c9SDave Chinner } 236930f712c9SDave Chinner 23702f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr); 237130f712c9SDave Chinner xfs_trans_log_buf(state->args->trans, save_blk->bp, 0, 237230f712c9SDave Chinner state->args->geo->blksize - 1); 237330f712c9SDave Chinner 237430f712c9SDave Chinner /* 237530f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 237630f712c9SDave Chinner */ 237730f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(save_leaf); 237830f712c9SDave Chinner save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval); 237930f712c9SDave Chinner } 238030f712c9SDave Chinner 238130f712c9SDave Chinner /*======================================================================== 238230f712c9SDave Chinner * Routines used for finding things in the Btree. 238330f712c9SDave Chinner *========================================================================*/ 238430f712c9SDave Chinner 238530f712c9SDave Chinner /* 238630f712c9SDave Chinner * Look up a name in a leaf attribute list structure. 238730f712c9SDave Chinner * This is the internal routine, it uses the caller's buffer. 238830f712c9SDave Chinner * 238930f712c9SDave Chinner * Note that duplicate keys are allowed, but only check within the 239030f712c9SDave Chinner * current leaf node. The Btree code must check in adjacent leaf nodes. 239130f712c9SDave Chinner * 239230f712c9SDave Chinner * Return in args->index the index into the entry[] array of either 239330f712c9SDave Chinner * the found entry, or where the entry should have been (insert before 239430f712c9SDave Chinner * that entry). 239530f712c9SDave Chinner * 239630f712c9SDave Chinner * Don't change the args->value unless we find the attribute. 239730f712c9SDave Chinner */ 239830f712c9SDave Chinner int 239930f712c9SDave Chinner xfs_attr3_leaf_lookup_int( 240030f712c9SDave Chinner struct xfs_buf *bp, 240130f712c9SDave Chinner struct xfs_da_args *args) 240230f712c9SDave Chinner { 240330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 240430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 240530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 240630f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 240730f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 240830f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 240930f712c9SDave Chinner xfs_dahash_t hashval; 241030f712c9SDave Chinner int probe; 241130f712c9SDave Chinner int span; 241230f712c9SDave Chinner 241330f712c9SDave Chinner trace_xfs_attr_leaf_lookup(args); 241430f712c9SDave Chinner 241530f712c9SDave Chinner leaf = bp->b_addr; 24162f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 241730f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 2418a5155b87SDarrick J. Wong if (ichdr.count >= args->geo->blksize / 8) { 24198d57c216SDarrick J. Wong xfs_buf_mark_corrupt(bp); 24208ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2421a5155b87SDarrick J. Wong } 242230f712c9SDave Chinner 242330f712c9SDave Chinner /* 242430f712c9SDave Chinner * Binary search. (note: small blocks will skip this loop) 242530f712c9SDave Chinner */ 242630f712c9SDave Chinner hashval = args->hashval; 242730f712c9SDave Chinner probe = span = ichdr.count / 2; 242830f712c9SDave Chinner for (entry = &entries[probe]; span > 4; entry = &entries[probe]) { 242930f712c9SDave Chinner span /= 2; 243030f712c9SDave Chinner if (be32_to_cpu(entry->hashval) < hashval) 243130f712c9SDave Chinner probe += span; 243230f712c9SDave Chinner else if (be32_to_cpu(entry->hashval) > hashval) 243330f712c9SDave Chinner probe -= span; 243430f712c9SDave Chinner else 243530f712c9SDave Chinner break; 243630f712c9SDave Chinner } 2437a5155b87SDarrick J. Wong if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count))) { 24388d57c216SDarrick J. Wong xfs_buf_mark_corrupt(bp); 24398ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2440a5155b87SDarrick J. Wong } 2441a5155b87SDarrick J. Wong if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval)) { 24428d57c216SDarrick J. Wong xfs_buf_mark_corrupt(bp); 24438ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2444a5155b87SDarrick J. Wong } 244530f712c9SDave Chinner 244630f712c9SDave Chinner /* 244730f712c9SDave Chinner * Since we may have duplicate hashval's, find the first matching 244830f712c9SDave Chinner * hashval in the leaf. 244930f712c9SDave Chinner */ 245030f712c9SDave Chinner while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) { 245130f712c9SDave Chinner entry--; 245230f712c9SDave Chinner probe--; 245330f712c9SDave Chinner } 245430f712c9SDave Chinner while (probe < ichdr.count && 245530f712c9SDave Chinner be32_to_cpu(entry->hashval) < hashval) { 245630f712c9SDave Chinner entry++; 245730f712c9SDave Chinner probe++; 245830f712c9SDave Chinner } 245930f712c9SDave Chinner if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) { 246030f712c9SDave Chinner args->index = probe; 24612451337dSDave Chinner return -ENOATTR; 246230f712c9SDave Chinner } 246330f712c9SDave Chinner 246430f712c9SDave Chinner /* 246530f712c9SDave Chinner * Duplicate keys may be present, so search all of them for a match. 246630f712c9SDave Chinner */ 246730f712c9SDave Chinner for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval); 246830f712c9SDave Chinner entry++, probe++) { 246930f712c9SDave Chinner /* 247030f712c9SDave Chinner * GROT: Add code to remove incomplete entries. 247130f712c9SDave Chinner */ 247230f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 247330f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, probe); 2474377f16acSChristoph Hellwig if (!xfs_attr_match(args, name_loc->namelen, 2475377f16acSChristoph Hellwig name_loc->nameval, entry->flags)) 247630f712c9SDave Chinner continue; 247730f712c9SDave Chinner args->index = probe; 24782451337dSDave Chinner return -EEXIST; 247930f712c9SDave Chinner } else { 248030f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, probe); 2481377f16acSChristoph Hellwig if (!xfs_attr_match(args, name_rmt->namelen, 2482377f16acSChristoph Hellwig name_rmt->name, entry->flags)) 248330f712c9SDave Chinner continue; 248430f712c9SDave Chinner args->index = probe; 248530f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 248630f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 248730f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks( 248830f712c9SDave Chinner args->dp->i_mount, 248930f712c9SDave Chinner args->rmtvaluelen); 24902451337dSDave Chinner return -EEXIST; 249130f712c9SDave Chinner } 249230f712c9SDave Chinner } 249330f712c9SDave Chinner args->index = probe; 24942451337dSDave Chinner return -ENOATTR; 249530f712c9SDave Chinner } 249630f712c9SDave Chinner 249730f712c9SDave Chinner /* 249830f712c9SDave Chinner * Get the value associated with an attribute name from a leaf attribute 249930f712c9SDave Chinner * list structure. 2500728bcaa3SDave Chinner * 2501e513e25cSChristoph Hellwig * If args->valuelen is zero, only the length needs to be returned. Unlike a 2502e513e25cSChristoph Hellwig * lookup, we only return an error if the attribute does not exist or we can't 2503e513e25cSChristoph Hellwig * retrieve the value. 250430f712c9SDave Chinner */ 250530f712c9SDave Chinner int 250630f712c9SDave Chinner xfs_attr3_leaf_getvalue( 250730f712c9SDave Chinner struct xfs_buf *bp, 250830f712c9SDave Chinner struct xfs_da_args *args) 250930f712c9SDave Chinner { 251030f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 251130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 251230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 251330f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 251430f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 251530f712c9SDave Chinner 251630f712c9SDave Chinner leaf = bp->b_addr; 25172f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 251830f712c9SDave Chinner ASSERT(ichdr.count < args->geo->blksize / 8); 251930f712c9SDave Chinner ASSERT(args->index < ichdr.count); 252030f712c9SDave Chinner 252130f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 252230f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 252330f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 252430f712c9SDave Chinner ASSERT(name_loc->namelen == args->namelen); 252530f712c9SDave Chinner ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0); 25269df243a1SDave Chinner return xfs_attr_copy_value(args, 25279df243a1SDave Chinner &name_loc->nameval[args->namelen], 25289df243a1SDave Chinner be16_to_cpu(name_loc->valuelen)); 2529a0e959d3SDave Chinner } 2530a0e959d3SDave Chinner 253130f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 253230f712c9SDave Chinner ASSERT(name_rmt->namelen == args->namelen); 253330f712c9SDave Chinner ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0); 253430f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 253530f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 253630f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount, 253730f712c9SDave Chinner args->rmtvaluelen); 25389df243a1SDave Chinner return xfs_attr_copy_value(args, NULL, args->rmtvaluelen); 253930f712c9SDave Chinner } 254030f712c9SDave Chinner 254130f712c9SDave Chinner /*======================================================================== 254230f712c9SDave Chinner * Utility routines. 254330f712c9SDave Chinner *========================================================================*/ 254430f712c9SDave Chinner 254530f712c9SDave Chinner /* 254630f712c9SDave Chinner * Move the indicated entries from one leaf to another. 254730f712c9SDave Chinner * NOTE: this routine modifies both source and destination leaves. 254830f712c9SDave Chinner */ 254930f712c9SDave Chinner /*ARGSUSED*/ 255030f712c9SDave Chinner STATIC void 255130f712c9SDave Chinner xfs_attr3_leaf_moveents( 255230f712c9SDave Chinner struct xfs_da_args *args, 255330f712c9SDave Chinner struct xfs_attr_leafblock *leaf_s, 255430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_s, 255530f712c9SDave Chinner int start_s, 255630f712c9SDave Chinner struct xfs_attr_leafblock *leaf_d, 255730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_d, 255830f712c9SDave Chinner int start_d, 255930f712c9SDave Chinner int count) 256030f712c9SDave Chinner { 256130f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_s; 256230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_d; 256330f712c9SDave Chinner int desti; 256430f712c9SDave Chinner int tmp; 256530f712c9SDave Chinner int i; 256630f712c9SDave Chinner 256730f712c9SDave Chinner /* 256830f712c9SDave Chinner * Check for nothing to do. 256930f712c9SDave Chinner */ 257030f712c9SDave Chinner if (count == 0) 257130f712c9SDave Chinner return; 257230f712c9SDave Chinner 257330f712c9SDave Chinner /* 257430f712c9SDave Chinner * Set up environment. 257530f712c9SDave Chinner */ 257630f712c9SDave Chinner ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC || 257730f712c9SDave Chinner ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC); 257830f712c9SDave Chinner ASSERT(ichdr_s->magic == ichdr_d->magic); 257930f712c9SDave Chinner ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8); 258030f712c9SDave Chinner ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s)) 258130f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_s)); 258230f712c9SDave Chinner ASSERT(ichdr_d->count < args->geo->blksize / 8); 258330f712c9SDave Chinner ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d)) 258430f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d)); 258530f712c9SDave Chinner 258630f712c9SDave Chinner ASSERT(start_s < ichdr_s->count); 258730f712c9SDave Chinner ASSERT(start_d <= ichdr_d->count); 258830f712c9SDave Chinner ASSERT(count <= ichdr_s->count); 258930f712c9SDave Chinner 259030f712c9SDave Chinner 259130f712c9SDave Chinner /* 259230f712c9SDave Chinner * Move the entries in the destination leaf up to make a hole? 259330f712c9SDave Chinner */ 259430f712c9SDave Chinner if (start_d < ichdr_d->count) { 259530f712c9SDave Chinner tmp = ichdr_d->count - start_d; 259630f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 259730f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 259830f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count]; 259930f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 260030f712c9SDave Chinner } 260130f712c9SDave Chinner 260230f712c9SDave Chinner /* 260330f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 260430f712c9SDave Chinner * but allocate attribute info packed and in sequence. 260530f712c9SDave Chinner */ 260630f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 260730f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 260830f712c9SDave Chinner desti = start_d; 260930f712c9SDave Chinner for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) { 261030f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused); 261130f712c9SDave Chinner tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i); 261230f712c9SDave Chinner #ifdef GROT 261330f712c9SDave Chinner /* 261430f712c9SDave Chinner * Code to drop INCOMPLETE entries. Difficult to use as we 261530f712c9SDave Chinner * may also need to change the insertion index. Code turned 261630f712c9SDave Chinner * off for 6.2, should be revisited later. 261730f712c9SDave Chinner */ 261830f712c9SDave Chinner if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */ 261930f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 262030f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 262130f712c9SDave Chinner ichdr_s->count -= 1; 262230f712c9SDave Chinner entry_d--; /* to compensate for ++ in loop hdr */ 262330f712c9SDave Chinner desti--; 262430f712c9SDave Chinner if ((start_s + i) < offset) 262530f712c9SDave Chinner result++; /* insertion index adjustment */ 262630f712c9SDave Chinner } else { 262730f712c9SDave Chinner #endif /* GROT */ 262830f712c9SDave Chinner ichdr_d->firstused -= tmp; 262930f712c9SDave Chinner /* both on-disk, don't endian flip twice */ 263030f712c9SDave Chinner entry_d->hashval = entry_s->hashval; 263130f712c9SDave Chinner entry_d->nameidx = cpu_to_be16(ichdr_d->firstused); 263230f712c9SDave Chinner entry_d->flags = entry_s->flags; 263330f712c9SDave Chinner ASSERT(be16_to_cpu(entry_d->nameidx) + tmp 263430f712c9SDave Chinner <= args->geo->blksize); 263530f712c9SDave Chinner memmove(xfs_attr3_leaf_name(leaf_d, desti), 263630f712c9SDave Chinner xfs_attr3_leaf_name(leaf_s, start_s + i), tmp); 263730f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) + tmp 263830f712c9SDave Chinner <= args->geo->blksize); 263930f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 264030f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 264130f712c9SDave Chinner ichdr_d->usedbytes += tmp; 264230f712c9SDave Chinner ichdr_s->count -= 1; 264330f712c9SDave Chinner ichdr_d->count += 1; 264430f712c9SDave Chinner tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t) 264530f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d); 264630f712c9SDave Chinner ASSERT(ichdr_d->firstused >= tmp); 264730f712c9SDave Chinner #ifdef GROT 264830f712c9SDave Chinner } 264930f712c9SDave Chinner #endif /* GROT */ 265030f712c9SDave Chinner } 265130f712c9SDave Chinner 265230f712c9SDave Chinner /* 265330f712c9SDave Chinner * Zero out the entries we just copied. 265430f712c9SDave Chinner */ 265530f712c9SDave Chinner if (start_s == ichdr_s->count) { 265630f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 265730f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 265830f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 265930f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 266030f712c9SDave Chinner memset(entry_s, 0, tmp); 266130f712c9SDave Chinner } else { 266230f712c9SDave Chinner /* 266330f712c9SDave Chinner * Move the remaining entries down to fill the hole, 266430f712c9SDave Chinner * then zero the entries at the top. 266530f712c9SDave Chinner */ 266630f712c9SDave Chinner tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t); 266730f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count]; 266830f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 266930f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 267030f712c9SDave Chinner 267130f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 267230f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count]; 267330f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 267430f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 267530f712c9SDave Chinner memset(entry_s, 0, tmp); 267630f712c9SDave Chinner } 267730f712c9SDave Chinner 267830f712c9SDave Chinner /* 267930f712c9SDave Chinner * Fill in the freemap information 268030f712c9SDave Chinner */ 268130f712c9SDave Chinner ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d); 268230f712c9SDave Chinner ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t); 268330f712c9SDave Chinner ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base; 268430f712c9SDave Chinner ichdr_d->freemap[1].base = 0; 268530f712c9SDave Chinner ichdr_d->freemap[2].base = 0; 268630f712c9SDave Chinner ichdr_d->freemap[1].size = 0; 268730f712c9SDave Chinner ichdr_d->freemap[2].size = 0; 268830f712c9SDave Chinner ichdr_s->holes = 1; /* leaf may not be compact */ 268930f712c9SDave Chinner } 269030f712c9SDave Chinner 269130f712c9SDave Chinner /* 269230f712c9SDave Chinner * Pick up the last hashvalue from a leaf block. 269330f712c9SDave Chinner */ 269430f712c9SDave Chinner xfs_dahash_t 269530f712c9SDave Chinner xfs_attr_leaf_lasthash( 269630f712c9SDave Chinner struct xfs_buf *bp, 269730f712c9SDave Chinner int *count) 269830f712c9SDave Chinner { 269930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 270030f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 2701dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 270230f712c9SDave Chinner 27032f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr); 270430f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(bp->b_addr); 270530f712c9SDave Chinner if (count) 270630f712c9SDave Chinner *count = ichdr.count; 270730f712c9SDave Chinner if (!ichdr.count) 270830f712c9SDave Chinner return 0; 270930f712c9SDave Chinner return be32_to_cpu(entries[ichdr.count - 1].hashval); 271030f712c9SDave Chinner } 271130f712c9SDave Chinner 271230f712c9SDave Chinner /* 271330f712c9SDave Chinner * Calculate the number of bytes used to store the indicated attribute 271430f712c9SDave Chinner * (whether local or remote only calculate bytes in this block). 271530f712c9SDave Chinner */ 271630f712c9SDave Chinner STATIC int 271730f712c9SDave Chinner xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) 271830f712c9SDave Chinner { 271930f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 272030f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 272130f712c9SDave Chinner xfs_attr_leaf_name_remote_t *name_rmt; 272230f712c9SDave Chinner int size; 272330f712c9SDave Chinner 272430f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 272530f712c9SDave Chinner if (entries[index].flags & XFS_ATTR_LOCAL) { 272630f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, index); 272730f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(name_loc->namelen, 272830f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 272930f712c9SDave Chinner } else { 273030f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, index); 273130f712c9SDave Chinner size = xfs_attr_leaf_entsize_remote(name_rmt->namelen); 273230f712c9SDave Chinner } 273330f712c9SDave Chinner return size; 273430f712c9SDave Chinner } 273530f712c9SDave Chinner 273630f712c9SDave Chinner /* 273730f712c9SDave Chinner * Calculate the number of bytes that would be required to store the new 273830f712c9SDave Chinner * attribute (whether local or remote only calculate bytes in this block). 273930f712c9SDave Chinner * This routine decides as a side effect whether the attribute will be 274030f712c9SDave Chinner * a "local" or a "remote" attribute. 274130f712c9SDave Chinner */ 274230f712c9SDave Chinner int 274330f712c9SDave Chinner xfs_attr_leaf_newentsize( 274430f712c9SDave Chinner struct xfs_da_args *args, 274530f712c9SDave Chinner int *local) 274630f712c9SDave Chinner { 274730f712c9SDave Chinner int size; 274830f712c9SDave Chinner 274930f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen); 275030f712c9SDave Chinner if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) { 275130f712c9SDave Chinner if (local) 275230f712c9SDave Chinner *local = 1; 275330f712c9SDave Chinner return size; 275430f712c9SDave Chinner } 275530f712c9SDave Chinner if (local) 275630f712c9SDave Chinner *local = 0; 275730f712c9SDave Chinner return xfs_attr_leaf_entsize_remote(args->namelen); 275830f712c9SDave Chinner } 275930f712c9SDave Chinner 276030f712c9SDave Chinner 276130f712c9SDave Chinner /*======================================================================== 276230f712c9SDave Chinner * Manage the INCOMPLETE flag in a leaf entry 276330f712c9SDave Chinner *========================================================================*/ 276430f712c9SDave Chinner 276530f712c9SDave Chinner /* 276630f712c9SDave Chinner * Clear the INCOMPLETE flag on an entry in a leaf block. 276730f712c9SDave Chinner */ 276830f712c9SDave Chinner int 276930f712c9SDave Chinner xfs_attr3_leaf_clearflag( 277030f712c9SDave Chinner struct xfs_da_args *args) 277130f712c9SDave Chinner { 277230f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 277330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 277430f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 277530f712c9SDave Chinner struct xfs_buf *bp; 277630f712c9SDave Chinner int error; 277730f712c9SDave Chinner #ifdef DEBUG 277830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 277930f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 278030f712c9SDave Chinner int namelen; 278130f712c9SDave Chinner char *name; 278230f712c9SDave Chinner #endif /* DEBUG */ 278330f712c9SDave Chinner 278430f712c9SDave Chinner trace_xfs_attr_leaf_clearflag(args); 278530f712c9SDave Chinner /* 278630f712c9SDave Chinner * Set up the operation. 278730f712c9SDave Chinner */ 2788dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp); 278930f712c9SDave Chinner if (error) 279030f712c9SDave Chinner return error; 279130f712c9SDave Chinner 279230f712c9SDave Chinner leaf = bp->b_addr; 279330f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 279430f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_INCOMPLETE); 279530f712c9SDave Chinner 279630f712c9SDave Chinner #ifdef DEBUG 27972f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 279830f712c9SDave Chinner ASSERT(args->index < ichdr.count); 279930f712c9SDave Chinner ASSERT(args->index >= 0); 280030f712c9SDave Chinner 280130f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 280230f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 280330f712c9SDave Chinner namelen = name_loc->namelen; 280430f712c9SDave Chinner name = (char *)name_loc->nameval; 280530f712c9SDave Chinner } else { 280630f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 280730f712c9SDave Chinner namelen = name_rmt->namelen; 280830f712c9SDave Chinner name = (char *)name_rmt->name; 280930f712c9SDave Chinner } 281030f712c9SDave Chinner ASSERT(be32_to_cpu(entry->hashval) == args->hashval); 281130f712c9SDave Chinner ASSERT(namelen == args->namelen); 281230f712c9SDave Chinner ASSERT(memcmp(name, args->name, namelen) == 0); 281330f712c9SDave Chinner #endif /* DEBUG */ 281430f712c9SDave Chinner 281530f712c9SDave Chinner entry->flags &= ~XFS_ATTR_INCOMPLETE; 281630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 281730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 281830f712c9SDave Chinner 281930f712c9SDave Chinner if (args->rmtblkno) { 282030f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0); 282130f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 282230f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 282330f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 282430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 282530f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 282630f712c9SDave Chinner } 282730f712c9SDave Chinner 28281fc618d7SAllison Collins return 0; 282930f712c9SDave Chinner } 283030f712c9SDave Chinner 283130f712c9SDave Chinner /* 283230f712c9SDave Chinner * Set the INCOMPLETE flag on an entry in a leaf block. 283330f712c9SDave Chinner */ 283430f712c9SDave Chinner int 283530f712c9SDave Chinner xfs_attr3_leaf_setflag( 283630f712c9SDave Chinner struct xfs_da_args *args) 283730f712c9SDave Chinner { 283830f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 283930f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 284030f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 284130f712c9SDave Chinner struct xfs_buf *bp; 284230f712c9SDave Chinner int error; 284330f712c9SDave Chinner #ifdef DEBUG 284430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 284530f712c9SDave Chinner #endif 284630f712c9SDave Chinner 284730f712c9SDave Chinner trace_xfs_attr_leaf_setflag(args); 284830f712c9SDave Chinner 284930f712c9SDave Chinner /* 285030f712c9SDave Chinner * Set up the operation. 285130f712c9SDave Chinner */ 2852dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp); 285330f712c9SDave Chinner if (error) 285430f712c9SDave Chinner return error; 285530f712c9SDave Chinner 285630f712c9SDave Chinner leaf = bp->b_addr; 285730f712c9SDave Chinner #ifdef DEBUG 28582f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 285930f712c9SDave Chinner ASSERT(args->index < ichdr.count); 286030f712c9SDave Chinner ASSERT(args->index >= 0); 286130f712c9SDave Chinner #endif 286230f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 286330f712c9SDave Chinner 286430f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0); 286530f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 286630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 286730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 286830f712c9SDave Chinner if ((entry->flags & XFS_ATTR_LOCAL) == 0) { 286930f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 287030f712c9SDave Chinner name_rmt->valueblk = 0; 287130f712c9SDave Chinner name_rmt->valuelen = 0; 287230f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 287330f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 287430f712c9SDave Chinner } 287530f712c9SDave Chinner 28760949d317SAllison Collins return 0; 287730f712c9SDave Chinner } 287830f712c9SDave Chinner 287930f712c9SDave Chinner /* 288030f712c9SDave Chinner * In a single transaction, clear the INCOMPLETE flag on the leaf entry 288130f712c9SDave Chinner * given by args->blkno/index and set the INCOMPLETE flag on the leaf 288230f712c9SDave Chinner * entry given by args->blkno2/index2. 288330f712c9SDave Chinner * 288430f712c9SDave Chinner * Note that they could be in different blocks, or in the same block. 288530f712c9SDave Chinner */ 288630f712c9SDave Chinner int 288730f712c9SDave Chinner xfs_attr3_leaf_flipflags( 288830f712c9SDave Chinner struct xfs_da_args *args) 288930f712c9SDave Chinner { 289030f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 289130f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 289230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry1; 289330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry2; 289430f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 289530f712c9SDave Chinner struct xfs_buf *bp1; 289630f712c9SDave Chinner struct xfs_buf *bp2; 289730f712c9SDave Chinner int error; 289830f712c9SDave Chinner #ifdef DEBUG 289930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 290030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 290130f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 290230f712c9SDave Chinner int namelen1, namelen2; 290330f712c9SDave Chinner char *name1, *name2; 290430f712c9SDave Chinner #endif /* DEBUG */ 290530f712c9SDave Chinner 290630f712c9SDave Chinner trace_xfs_attr_leaf_flipflags(args); 290730f712c9SDave Chinner 290830f712c9SDave Chinner /* 290930f712c9SDave Chinner * Read the block containing the "old" attr 291030f712c9SDave Chinner */ 2911dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp1); 291230f712c9SDave Chinner if (error) 291330f712c9SDave Chinner return error; 291430f712c9SDave Chinner 291530f712c9SDave Chinner /* 291630f712c9SDave Chinner * Read the block containing the "new" attr, if it is different 291730f712c9SDave Chinner */ 291830f712c9SDave Chinner if (args->blkno2 != args->blkno) { 291930f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2, 2920dfb87594SChristoph Hellwig &bp2); 292130f712c9SDave Chinner if (error) 292230f712c9SDave Chinner return error; 292330f712c9SDave Chinner } else { 292430f712c9SDave Chinner bp2 = bp1; 292530f712c9SDave Chinner } 292630f712c9SDave Chinner 292730f712c9SDave Chinner leaf1 = bp1->b_addr; 292830f712c9SDave Chinner entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index]; 292930f712c9SDave Chinner 293030f712c9SDave Chinner leaf2 = bp2->b_addr; 293130f712c9SDave Chinner entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2]; 293230f712c9SDave Chinner 293330f712c9SDave Chinner #ifdef DEBUG 29342f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1); 293530f712c9SDave Chinner ASSERT(args->index < ichdr1.count); 293630f712c9SDave Chinner ASSERT(args->index >= 0); 293730f712c9SDave Chinner 29382f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2); 293930f712c9SDave Chinner ASSERT(args->index2 < ichdr2.count); 294030f712c9SDave Chinner ASSERT(args->index2 >= 0); 294130f712c9SDave Chinner 294230f712c9SDave Chinner if (entry1->flags & XFS_ATTR_LOCAL) { 294330f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf1, args->index); 294430f712c9SDave Chinner namelen1 = name_loc->namelen; 294530f712c9SDave Chinner name1 = (char *)name_loc->nameval; 294630f712c9SDave Chinner } else { 294730f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 294830f712c9SDave Chinner namelen1 = name_rmt->namelen; 294930f712c9SDave Chinner name1 = (char *)name_rmt->name; 295030f712c9SDave Chinner } 295130f712c9SDave Chinner if (entry2->flags & XFS_ATTR_LOCAL) { 295230f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2); 295330f712c9SDave Chinner namelen2 = name_loc->namelen; 295430f712c9SDave Chinner name2 = (char *)name_loc->nameval; 295530f712c9SDave Chinner } else { 295630f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 295730f712c9SDave Chinner namelen2 = name_rmt->namelen; 295830f712c9SDave Chinner name2 = (char *)name_rmt->name; 295930f712c9SDave Chinner } 296030f712c9SDave Chinner ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval)); 296130f712c9SDave Chinner ASSERT(namelen1 == namelen2); 296230f712c9SDave Chinner ASSERT(memcmp(name1, name2, namelen1) == 0); 296330f712c9SDave Chinner #endif /* DEBUG */ 296430f712c9SDave Chinner 296530f712c9SDave Chinner ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE); 296630f712c9SDave Chinner ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0); 296730f712c9SDave Chinner 296830f712c9SDave Chinner entry1->flags &= ~XFS_ATTR_INCOMPLETE; 296930f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 297030f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1))); 297130f712c9SDave Chinner if (args->rmtblkno) { 297230f712c9SDave Chinner ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0); 297330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 297430f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 297530f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 297630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 297730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt))); 297830f712c9SDave Chinner } 297930f712c9SDave Chinner 298030f712c9SDave Chinner entry2->flags |= XFS_ATTR_INCOMPLETE; 298130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 298230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2))); 298330f712c9SDave Chinner if ((entry2->flags & XFS_ATTR_LOCAL) == 0) { 298430f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 298530f712c9SDave Chinner name_rmt->valueblk = 0; 298630f712c9SDave Chinner name_rmt->valuelen = 0; 298730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 298830f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt))); 298930f712c9SDave Chinner } 299030f712c9SDave Chinner 2991e3be1272SAllison Collins return 0; 299230f712c9SDave Chinner } 2993