10b61f8a4SDave Chinner // SPDX-License-Identifier: GPL-2.0 230f712c9SDave Chinner /* 330f712c9SDave Chinner * Copyright (c) 2000-2005 Silicon Graphics, Inc. 430f712c9SDave Chinner * Copyright (c) 2013 Red Hat, Inc. 530f712c9SDave Chinner * All Rights Reserved. 630f712c9SDave Chinner */ 730f712c9SDave Chinner #include "xfs.h" 830f712c9SDave Chinner #include "xfs_fs.h" 930f712c9SDave Chinner #include "xfs_shared.h" 1030f712c9SDave Chinner #include "xfs_format.h" 1130f712c9SDave Chinner #include "xfs_log_format.h" 1230f712c9SDave Chinner #include "xfs_trans_resv.h" 1330f712c9SDave Chinner #include "xfs_sb.h" 1430f712c9SDave Chinner #include "xfs_mount.h" 1530f712c9SDave Chinner #include "xfs_da_format.h" 1630f712c9SDave Chinner #include "xfs_da_btree.h" 1730f712c9SDave Chinner #include "xfs_inode.h" 1830f712c9SDave Chinner #include "xfs_trans.h" 1930f712c9SDave Chinner #include "xfs_bmap_btree.h" 2030f712c9SDave Chinner #include "xfs_bmap.h" 2130f712c9SDave Chinner #include "xfs_attr_sf.h" 2230f712c9SDave Chinner #include "xfs_attr_remote.h" 2330f712c9SDave Chinner #include "xfs_attr.h" 2430f712c9SDave Chinner #include "xfs_attr_leaf.h" 2530f712c9SDave Chinner #include "xfs_error.h" 2630f712c9SDave Chinner #include "xfs_trace.h" 2730f712c9SDave Chinner #include "xfs_buf_item.h" 2830f712c9SDave Chinner #include "xfs_dir2.h" 29a45086e2SBrian Foster #include "xfs_log.h" 30*9bbafc71SDave Chinner #include "xfs_ag.h" 3130f712c9SDave Chinner 3230f712c9SDave Chinner 3330f712c9SDave Chinner /* 3430f712c9SDave Chinner * xfs_attr_leaf.c 3530f712c9SDave Chinner * 3630f712c9SDave Chinner * Routines to implement leaf blocks of attributes as Btrees of hashed names. 3730f712c9SDave Chinner */ 3830f712c9SDave Chinner 3930f712c9SDave Chinner /*======================================================================== 4030f712c9SDave Chinner * Function prototypes for the kernel. 4130f712c9SDave Chinner *========================================================================*/ 4230f712c9SDave Chinner 4330f712c9SDave Chinner /* 4430f712c9SDave Chinner * Routines used for growing the Btree. 4530f712c9SDave Chinner */ 4630f712c9SDave Chinner STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args, 4730f712c9SDave Chinner xfs_dablk_t which_block, struct xfs_buf **bpp); 4830f712c9SDave Chinner STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer, 4930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 5030f712c9SDave Chinner struct xfs_da_args *args, int freemap_index); 5130f712c9SDave Chinner STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args, 5230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 5330f712c9SDave Chinner struct xfs_buf *leaf_buffer); 5430f712c9SDave Chinner STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state, 5530f712c9SDave Chinner xfs_da_state_blk_t *blk1, 5630f712c9SDave Chinner xfs_da_state_blk_t *blk2); 5730f712c9SDave Chinner STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state, 5830f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_1, 5930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 6030f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_2, 6130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 6230f712c9SDave Chinner int *number_entries_in_blk1, 6330f712c9SDave Chinner int *number_usedbytes_in_blk1); 6430f712c9SDave Chinner 6530f712c9SDave Chinner /* 6630f712c9SDave Chinner * Utility routines. 6730f712c9SDave Chinner */ 6830f712c9SDave Chinner STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args, 6930f712c9SDave Chinner struct xfs_attr_leafblock *src_leaf, 7030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start, 7130f712c9SDave Chinner struct xfs_attr_leafblock *dst_leaf, 7230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start, 7330f712c9SDave Chinner int move_count); 7430f712c9SDave Chinner STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index); 7530f712c9SDave Chinner 76e87021a2SBrian Foster /* 77e87021a2SBrian Foster * attr3 block 'firstused' conversion helpers. 78e87021a2SBrian Foster * 79e87021a2SBrian Foster * firstused refers to the offset of the first used byte of the nameval region 80e87021a2SBrian Foster * of an attr leaf block. The region starts at the tail of the block and expands 81e87021a2SBrian Foster * backwards towards the middle. As such, firstused is initialized to the block 82e87021a2SBrian Foster * size for an empty leaf block and is reduced from there. 83e87021a2SBrian Foster * 84e87021a2SBrian Foster * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k. 85e87021a2SBrian Foster * The in-core firstused field is 32-bit and thus supports the maximum fsb size. 86e87021a2SBrian Foster * The on-disk field is only 16-bit, however, and overflows at 64k. Since this 87e87021a2SBrian Foster * only occurs at exactly 64k, we use zero as a magic on-disk value to represent 88e87021a2SBrian Foster * the attr block size. The following helpers manage the conversion between the 89e87021a2SBrian Foster * in-core and on-disk formats. 90e87021a2SBrian Foster */ 91e87021a2SBrian Foster 92e87021a2SBrian Foster static void 93e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk( 94e87021a2SBrian Foster struct xfs_da_geometry *geo, 95e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *to, 96e87021a2SBrian Foster struct xfs_attr_leafblock *from) 97e87021a2SBrian Foster { 98e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 99e87021a2SBrian Foster 100e87021a2SBrian Foster if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 101e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) from; 102e87021a2SBrian Foster to->firstused = be16_to_cpu(hdr3->firstused); 103e87021a2SBrian Foster } else { 104e87021a2SBrian Foster to->firstused = be16_to_cpu(from->hdr.firstused); 105e87021a2SBrian Foster } 106e87021a2SBrian Foster 107e87021a2SBrian Foster /* 108e87021a2SBrian Foster * Convert from the magic fsb size value to actual blocksize. This 109e87021a2SBrian Foster * should only occur for empty blocks when the block size overflows 110e87021a2SBrian Foster * 16-bits. 111e87021a2SBrian Foster */ 112e87021a2SBrian Foster if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) { 113e87021a2SBrian Foster ASSERT(!to->count && !to->usedbytes); 114e87021a2SBrian Foster ASSERT(geo->blksize > USHRT_MAX); 115e87021a2SBrian Foster to->firstused = geo->blksize; 116e87021a2SBrian Foster } 117e87021a2SBrian Foster } 118e87021a2SBrian Foster 119e87021a2SBrian Foster static void 120e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk( 121e87021a2SBrian Foster struct xfs_da_geometry *geo, 122e87021a2SBrian Foster struct xfs_attr_leafblock *to, 123e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *from) 124e87021a2SBrian Foster { 125e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 126e87021a2SBrian Foster uint32_t firstused; 127e87021a2SBrian Foster 128e87021a2SBrian Foster /* magic value should only be seen on disk */ 129e87021a2SBrian Foster ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF); 130e87021a2SBrian Foster 131e87021a2SBrian Foster /* 132e87021a2SBrian Foster * Scale down the 32-bit in-core firstused value to the 16-bit on-disk 133e87021a2SBrian Foster * value. This only overflows at the max supported value of 64k. Use the 134e87021a2SBrian Foster * magic on-disk value to represent block size in this case. 135e87021a2SBrian Foster */ 136e87021a2SBrian Foster firstused = from->firstused; 137e87021a2SBrian Foster if (firstused > USHRT_MAX) { 138e87021a2SBrian Foster ASSERT(from->firstused == geo->blksize); 139e87021a2SBrian Foster firstused = XFS_ATTR3_LEAF_NULLOFF; 140e87021a2SBrian Foster } 141e87021a2SBrian Foster 142e87021a2SBrian Foster if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 143e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) to; 144e87021a2SBrian Foster hdr3->firstused = cpu_to_be16(firstused); 145e87021a2SBrian Foster } else { 146e87021a2SBrian Foster to->hdr.firstused = cpu_to_be16(firstused); 147e87021a2SBrian Foster } 148e87021a2SBrian Foster } 149e87021a2SBrian Foster 15030f712c9SDave Chinner void 15130f712c9SDave Chinner xfs_attr3_leaf_hdr_from_disk( 1522f661241SBrian Foster struct xfs_da_geometry *geo, 15330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *to, 15430f712c9SDave Chinner struct xfs_attr_leafblock *from) 15530f712c9SDave Chinner { 15630f712c9SDave Chinner int i; 15730f712c9SDave Chinner 15830f712c9SDave Chinner ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) || 15930f712c9SDave Chinner from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)); 16030f712c9SDave Chinner 16130f712c9SDave Chinner if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 16230f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from; 16330f712c9SDave Chinner 16430f712c9SDave Chinner to->forw = be32_to_cpu(hdr3->info.hdr.forw); 16530f712c9SDave Chinner to->back = be32_to_cpu(hdr3->info.hdr.back); 16630f712c9SDave Chinner to->magic = be16_to_cpu(hdr3->info.hdr.magic); 16730f712c9SDave Chinner to->count = be16_to_cpu(hdr3->count); 16830f712c9SDave Chinner to->usedbytes = be16_to_cpu(hdr3->usedbytes); 169e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 17030f712c9SDave Chinner to->holes = hdr3->holes; 17130f712c9SDave Chinner 17230f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 17330f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base); 17430f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size); 17530f712c9SDave Chinner } 17630f712c9SDave Chinner return; 17730f712c9SDave Chinner } 17830f712c9SDave Chinner to->forw = be32_to_cpu(from->hdr.info.forw); 17930f712c9SDave Chinner to->back = be32_to_cpu(from->hdr.info.back); 18030f712c9SDave Chinner to->magic = be16_to_cpu(from->hdr.info.magic); 18130f712c9SDave Chinner to->count = be16_to_cpu(from->hdr.count); 18230f712c9SDave Chinner to->usedbytes = be16_to_cpu(from->hdr.usedbytes); 183e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 18430f712c9SDave Chinner to->holes = from->hdr.holes; 18530f712c9SDave Chinner 18630f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 18730f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base); 18830f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size); 18930f712c9SDave Chinner } 19030f712c9SDave Chinner } 19130f712c9SDave Chinner 19230f712c9SDave Chinner void 19330f712c9SDave Chinner xfs_attr3_leaf_hdr_to_disk( 1942f661241SBrian Foster struct xfs_da_geometry *geo, 19530f712c9SDave Chinner struct xfs_attr_leafblock *to, 19630f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *from) 19730f712c9SDave Chinner { 19830f712c9SDave Chinner int i; 19930f712c9SDave Chinner 20030f712c9SDave Chinner ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC || 20130f712c9SDave Chinner from->magic == XFS_ATTR3_LEAF_MAGIC); 20230f712c9SDave Chinner 20330f712c9SDave Chinner if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 20430f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to; 20530f712c9SDave Chinner 20630f712c9SDave Chinner hdr3->info.hdr.forw = cpu_to_be32(from->forw); 20730f712c9SDave Chinner hdr3->info.hdr.back = cpu_to_be32(from->back); 20830f712c9SDave Chinner hdr3->info.hdr.magic = cpu_to_be16(from->magic); 20930f712c9SDave Chinner hdr3->count = cpu_to_be16(from->count); 21030f712c9SDave Chinner hdr3->usedbytes = cpu_to_be16(from->usedbytes); 211e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 21230f712c9SDave Chinner hdr3->holes = from->holes; 21330f712c9SDave Chinner hdr3->pad1 = 0; 21430f712c9SDave Chinner 21530f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 21630f712c9SDave Chinner hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base); 21730f712c9SDave Chinner hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size); 21830f712c9SDave Chinner } 21930f712c9SDave Chinner return; 22030f712c9SDave Chinner } 22130f712c9SDave Chinner to->hdr.info.forw = cpu_to_be32(from->forw); 22230f712c9SDave Chinner to->hdr.info.back = cpu_to_be32(from->back); 22330f712c9SDave Chinner to->hdr.info.magic = cpu_to_be16(from->magic); 22430f712c9SDave Chinner to->hdr.count = cpu_to_be16(from->count); 22530f712c9SDave Chinner to->hdr.usedbytes = cpu_to_be16(from->usedbytes); 226e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 22730f712c9SDave Chinner to->hdr.holes = from->holes; 22830f712c9SDave Chinner to->hdr.pad1 = 0; 22930f712c9SDave Chinner 23030f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 23130f712c9SDave Chinner to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base); 23230f712c9SDave Chinner to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size); 23330f712c9SDave Chinner } 23430f712c9SDave Chinner } 23530f712c9SDave Chinner 236a6a781a5SDarrick J. Wong static xfs_failaddr_t 237c8476065SDarrick J. Wong xfs_attr3_leaf_verify_entry( 238c8476065SDarrick J. Wong struct xfs_mount *mp, 239c8476065SDarrick J. Wong char *buf_end, 240c8476065SDarrick J. Wong struct xfs_attr_leafblock *leaf, 241c8476065SDarrick J. Wong struct xfs_attr3_icleaf_hdr *leafhdr, 242c8476065SDarrick J. Wong struct xfs_attr_leaf_entry *ent, 243c8476065SDarrick J. Wong int idx, 244c8476065SDarrick J. Wong __u32 *last_hashval) 245c8476065SDarrick J. Wong { 246c8476065SDarrick J. Wong struct xfs_attr_leaf_name_local *lentry; 247c8476065SDarrick J. Wong struct xfs_attr_leaf_name_remote *rentry; 248c8476065SDarrick J. Wong char *name_end; 249c8476065SDarrick J. Wong unsigned int nameidx; 250c8476065SDarrick J. Wong unsigned int namesize; 251c8476065SDarrick J. Wong __u32 hashval; 252c8476065SDarrick J. Wong 253c8476065SDarrick J. Wong /* hash order check */ 254c8476065SDarrick J. Wong hashval = be32_to_cpu(ent->hashval); 255c8476065SDarrick J. Wong if (hashval < *last_hashval) 256c8476065SDarrick J. Wong return __this_address; 257c8476065SDarrick J. Wong *last_hashval = hashval; 258c8476065SDarrick J. Wong 259c8476065SDarrick J. Wong nameidx = be16_to_cpu(ent->nameidx); 260c8476065SDarrick J. Wong if (nameidx < leafhdr->firstused || nameidx >= mp->m_attr_geo->blksize) 261c8476065SDarrick J. Wong return __this_address; 262c8476065SDarrick J. Wong 263c8476065SDarrick J. Wong /* 264c8476065SDarrick J. Wong * Check the name information. The namelen fields are u8 so we can't 265c8476065SDarrick J. Wong * possibly exceed the maximum name length of 255 bytes. 266c8476065SDarrick J. Wong */ 267c8476065SDarrick J. Wong if (ent->flags & XFS_ATTR_LOCAL) { 268c8476065SDarrick J. Wong lentry = xfs_attr3_leaf_name_local(leaf, idx); 269c8476065SDarrick J. Wong namesize = xfs_attr_leaf_entsize_local(lentry->namelen, 270c8476065SDarrick J. Wong be16_to_cpu(lentry->valuelen)); 271c8476065SDarrick J. Wong name_end = (char *)lentry + namesize; 272c8476065SDarrick J. Wong if (lentry->namelen == 0) 273c8476065SDarrick J. Wong return __this_address; 274c8476065SDarrick J. Wong } else { 275c8476065SDarrick J. Wong rentry = xfs_attr3_leaf_name_remote(leaf, idx); 276c8476065SDarrick J. Wong namesize = xfs_attr_leaf_entsize_remote(rentry->namelen); 277c8476065SDarrick J. Wong name_end = (char *)rentry + namesize; 278c8476065SDarrick J. Wong if (rentry->namelen == 0) 279c8476065SDarrick J. Wong return __this_address; 280c8476065SDarrick J. Wong if (!(ent->flags & XFS_ATTR_INCOMPLETE) && 281c8476065SDarrick J. Wong rentry->valueblk == 0) 282c8476065SDarrick J. Wong return __this_address; 283c8476065SDarrick J. Wong } 284c8476065SDarrick J. Wong 285c8476065SDarrick J. Wong if (name_end > buf_end) 286c8476065SDarrick J. Wong return __this_address; 287c8476065SDarrick J. Wong 288c8476065SDarrick J. Wong return NULL; 289c8476065SDarrick J. Wong } 290c8476065SDarrick J. Wong 291c8476065SDarrick J. Wong static xfs_failaddr_t 29230f712c9SDave Chinner xfs_attr3_leaf_verify( 29330f712c9SDave Chinner struct xfs_buf *bp) 29430f712c9SDave Chinner { 29579a69bf8SDarrick J. Wong struct xfs_attr3_icleaf_hdr ichdr; 296dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 29730f712c9SDave Chinner struct xfs_attr_leafblock *leaf = bp->b_addr; 29879a69bf8SDarrick J. Wong struct xfs_attr_leaf_entry *entries; 299c8476065SDarrick J. Wong struct xfs_attr_leaf_entry *ent; 300c8476065SDarrick J. Wong char *buf_end; 301837514f7SDave Chinner uint32_t end; /* must be 32bit - see below */ 302c8476065SDarrick J. Wong __u32 last_hashval = 0; 30365cfcc38SDarrick J. Wong int i; 3048764f983SBrian Foster xfs_failaddr_t fa; 30530f712c9SDave Chinner 3062f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); 30730f712c9SDave Chinner 3088764f983SBrian Foster fa = xfs_da3_blkinfo_verify(bp, bp->b_addr); 3098764f983SBrian Foster if (fa) 3108764f983SBrian Foster return fa; 31139708c20SBrian Foster 3122e1d2337SEric Sandeen /* 31379a69bf8SDarrick J. Wong * firstused is the block offset of the first name info structure. 31479a69bf8SDarrick J. Wong * Make sure it doesn't go off the block or crash into the header. 31579a69bf8SDarrick J. Wong */ 31679a69bf8SDarrick J. Wong if (ichdr.firstused > mp->m_attr_geo->blksize) 31779a69bf8SDarrick J. Wong return __this_address; 31879a69bf8SDarrick J. Wong if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) 31979a69bf8SDarrick J. Wong return __this_address; 32079a69bf8SDarrick J. Wong 32179a69bf8SDarrick J. Wong /* Make sure the entries array doesn't crash into the name info. */ 32279a69bf8SDarrick J. Wong entries = xfs_attr3_leaf_entryp(bp->b_addr); 32379a69bf8SDarrick J. Wong if ((char *)&entries[ichdr.count] > 32479a69bf8SDarrick J. Wong (char *)bp->b_addr + ichdr.firstused) 32579a69bf8SDarrick J. Wong return __this_address; 32679a69bf8SDarrick J. Wong 327f28cef9eSBrian Foster /* 328f28cef9eSBrian Foster * NOTE: This verifier historically failed empty leaf buffers because 329f28cef9eSBrian Foster * we expect the fork to be in another format. Empty attr fork format 330f28cef9eSBrian Foster * conversions are possible during xattr set, however, and format 331f28cef9eSBrian Foster * conversion is not atomic with the xattr set that triggers it. We 332f28cef9eSBrian Foster * cannot assume leaf blocks are non-empty until that is addressed. 333f28cef9eSBrian Foster */ 334c8476065SDarrick J. Wong buf_end = (char *)bp->b_addr + mp->m_attr_geo->blksize; 335c8476065SDarrick J. Wong for (i = 0, ent = entries; i < ichdr.count; ent++, i++) { 336c8476065SDarrick J. Wong fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr, 337c8476065SDarrick J. Wong ent, i, &last_hashval); 338c8476065SDarrick J. Wong if (fa) 339c8476065SDarrick J. Wong return fa; 340c8476065SDarrick J. Wong } 34130f712c9SDave Chinner 34265cfcc38SDarrick J. Wong /* 34365cfcc38SDarrick J. Wong * Quickly check the freemap information. Attribute data has to be 34465cfcc38SDarrick J. Wong * aligned to 4-byte boundaries, and likewise for the free space. 345837514f7SDave Chinner * 346837514f7SDave Chinner * Note that for 64k block size filesystems, the freemap entries cannot 347837514f7SDave Chinner * overflow as they are only be16 fields. However, when checking end 348837514f7SDave Chinner * pointer of the freemap, we have to be careful to detect overflows and 349837514f7SDave Chinner * so use uint32_t for those checks. 35065cfcc38SDarrick J. Wong */ 35165cfcc38SDarrick J. Wong for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 35265cfcc38SDarrick J. Wong if (ichdr.freemap[i].base > mp->m_attr_geo->blksize) 35365cfcc38SDarrick J. Wong return __this_address; 35465cfcc38SDarrick J. Wong if (ichdr.freemap[i].base & 0x3) 35565cfcc38SDarrick J. Wong return __this_address; 35665cfcc38SDarrick J. Wong if (ichdr.freemap[i].size > mp->m_attr_geo->blksize) 35765cfcc38SDarrick J. Wong return __this_address; 35865cfcc38SDarrick J. Wong if (ichdr.freemap[i].size & 0x3) 35965cfcc38SDarrick J. Wong return __this_address; 360837514f7SDave Chinner 361837514f7SDave Chinner /* be care of 16 bit overflows here */ 362837514f7SDave Chinner end = (uint32_t)ichdr.freemap[i].base + ichdr.freemap[i].size; 36365cfcc38SDarrick J. Wong if (end < ichdr.freemap[i].base) 36465cfcc38SDarrick J. Wong return __this_address; 36565cfcc38SDarrick J. Wong if (end > mp->m_attr_geo->blksize) 36665cfcc38SDarrick J. Wong return __this_address; 36765cfcc38SDarrick J. Wong } 36865cfcc38SDarrick J. Wong 369a6a781a5SDarrick J. Wong return NULL; 37030f712c9SDave Chinner } 37130f712c9SDave Chinner 37230f712c9SDave Chinner static void 37330f712c9SDave Chinner xfs_attr3_leaf_write_verify( 37430f712c9SDave Chinner struct xfs_buf *bp) 37530f712c9SDave Chinner { 376dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 377fb1755a6SCarlos Maiolino struct xfs_buf_log_item *bip = bp->b_log_item; 37830f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr; 379bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 38030f712c9SDave Chinner 381bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 382bc1a09b8SDarrick J. Wong if (fa) { 383bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 38430f712c9SDave Chinner return; 38530f712c9SDave Chinner } 38630f712c9SDave Chinner 38730f712c9SDave Chinner if (!xfs_sb_version_hascrc(&mp->m_sb)) 38830f712c9SDave Chinner return; 38930f712c9SDave Chinner 39030f712c9SDave Chinner if (bip) 39130f712c9SDave Chinner hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); 39230f712c9SDave Chinner 39330f712c9SDave Chinner xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF); 39430f712c9SDave Chinner } 39530f712c9SDave Chinner 39630f712c9SDave Chinner /* 39730f712c9SDave Chinner * leaf/node format detection on trees is sketchy, so a node read can be done on 39830f712c9SDave Chinner * leaf level blocks when detection identifies the tree as a node format tree 39930f712c9SDave Chinner * incorrectly. In this case, we need to swap the verifier to match the correct 40030f712c9SDave Chinner * format of the block being read. 40130f712c9SDave Chinner */ 40230f712c9SDave Chinner static void 40330f712c9SDave Chinner xfs_attr3_leaf_read_verify( 40430f712c9SDave Chinner struct xfs_buf *bp) 40530f712c9SDave Chinner { 406dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 407bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 40830f712c9SDave Chinner 40930f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb) && 41030f712c9SDave Chinner !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF)) 411bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSBADCRC, __this_address); 412bc1a09b8SDarrick J. Wong else { 413bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 414bc1a09b8SDarrick J. Wong if (fa) 415bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 416bc1a09b8SDarrick J. Wong } 41730f712c9SDave Chinner } 41830f712c9SDave Chinner 41930f712c9SDave Chinner const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = { 420233135b7SEric Sandeen .name = "xfs_attr3_leaf", 42115baadf7SDarrick J. Wong .magic16 = { cpu_to_be16(XFS_ATTR_LEAF_MAGIC), 42239708c20SBrian Foster cpu_to_be16(XFS_ATTR3_LEAF_MAGIC) }, 42330f712c9SDave Chinner .verify_read = xfs_attr3_leaf_read_verify, 42430f712c9SDave Chinner .verify_write = xfs_attr3_leaf_write_verify, 425b5572597SDarrick J. Wong .verify_struct = xfs_attr3_leaf_verify, 42630f712c9SDave Chinner }; 42730f712c9SDave Chinner 42830f712c9SDave Chinner int 42930f712c9SDave Chinner xfs_attr3_leaf_read( 43030f712c9SDave Chinner struct xfs_trans *tp, 43130f712c9SDave Chinner struct xfs_inode *dp, 43230f712c9SDave Chinner xfs_dablk_t bno, 43330f712c9SDave Chinner struct xfs_buf **bpp) 43430f712c9SDave Chinner { 43530f712c9SDave Chinner int err; 43630f712c9SDave Chinner 437cd2c9f1bSChristoph Hellwig err = xfs_da_read_buf(tp, dp, bno, 0, bpp, XFS_ATTR_FORK, 438dfb87594SChristoph Hellwig &xfs_attr3_leaf_buf_ops); 439cd87d867SDarrick J. Wong if (!err && tp && *bpp) 44030f712c9SDave Chinner xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF); 44130f712c9SDave Chinner return err; 44230f712c9SDave Chinner } 44330f712c9SDave Chinner 44430f712c9SDave Chinner /*======================================================================== 44530f712c9SDave Chinner * Namespace helper routines 44630f712c9SDave Chinner *========================================================================*/ 44730f712c9SDave Chinner 448377f16acSChristoph Hellwig static bool 449377f16acSChristoph Hellwig xfs_attr_match( 450377f16acSChristoph Hellwig struct xfs_da_args *args, 451377f16acSChristoph Hellwig uint8_t namelen, 452377f16acSChristoph Hellwig unsigned char *name, 453377f16acSChristoph Hellwig int flags) 45430f712c9SDave Chinner { 455377f16acSChristoph Hellwig if (args->namelen != namelen) 456377f16acSChristoph Hellwig return false; 457377f16acSChristoph Hellwig if (memcmp(args->name, name, namelen) != 0) 458377f16acSChristoph Hellwig return false; 459254f800fSChristoph Hellwig /* 460254f800fSChristoph Hellwig * If we are looking for incomplete entries, show only those, else only 461254f800fSChristoph Hellwig * show complete entries. 462254f800fSChristoph Hellwig */ 463254f800fSChristoph Hellwig if (args->attr_filter != 464254f800fSChristoph Hellwig (flags & (XFS_ATTR_NSP_ONDISK_MASK | XFS_ATTR_INCOMPLETE))) 465377f16acSChristoph Hellwig return false; 466377f16acSChristoph Hellwig return true; 46730f712c9SDave Chinner } 46830f712c9SDave Chinner 4699df243a1SDave Chinner static int 4709df243a1SDave Chinner xfs_attr_copy_value( 4719df243a1SDave Chinner struct xfs_da_args *args, 4729df243a1SDave Chinner unsigned char *value, 4739df243a1SDave Chinner int valuelen) 4749df243a1SDave Chinner { 4759df243a1SDave Chinner /* 4769df243a1SDave Chinner * No copy if all we have to do is get the length 4779df243a1SDave Chinner */ 478e513e25cSChristoph Hellwig if (!args->valuelen) { 4799df243a1SDave Chinner args->valuelen = valuelen; 4809df243a1SDave Chinner return 0; 4819df243a1SDave Chinner } 4829df243a1SDave Chinner 4839df243a1SDave Chinner /* 4849df243a1SDave Chinner * No copy if the length of the existing buffer is too small 4859df243a1SDave Chinner */ 4869df243a1SDave Chinner if (args->valuelen < valuelen) { 4879df243a1SDave Chinner args->valuelen = valuelen; 4889df243a1SDave Chinner return -ERANGE; 4899df243a1SDave Chinner } 490ddbca70cSDave Chinner 491d49db18bSChristoph Hellwig if (!args->value) { 4926dcde60eSDarrick J. Wong args->value = kmem_alloc_large(valuelen, KM_NOLOCKDEP); 493ddbca70cSDave Chinner if (!args->value) 494ddbca70cSDave Chinner return -ENOMEM; 495ddbca70cSDave Chinner } 4969df243a1SDave Chinner args->valuelen = valuelen; 4979df243a1SDave Chinner 4989df243a1SDave Chinner /* remote block xattr requires IO for copy-in */ 4999df243a1SDave Chinner if (args->rmtblkno) 5009df243a1SDave Chinner return xfs_attr_rmtval_get(args); 5019df243a1SDave Chinner 5029df243a1SDave Chinner /* 5039df243a1SDave Chinner * This is to prevent a GCC warning because the remote xattr case 5049df243a1SDave Chinner * doesn't have a value to pass in. In that case, we never reach here, 5059df243a1SDave Chinner * but GCC can't work that out and so throws a "passing NULL to 5069df243a1SDave Chinner * memcpy" warning. 5079df243a1SDave Chinner */ 5089df243a1SDave Chinner if (!value) 5099df243a1SDave Chinner return -EINVAL; 5109df243a1SDave Chinner memcpy(args->value, value, valuelen); 5119df243a1SDave Chinner return 0; 5129df243a1SDave Chinner } 51330f712c9SDave Chinner 51430f712c9SDave Chinner /*======================================================================== 51530f712c9SDave Chinner * External routines when attribute fork size < XFS_LITINO(mp). 51630f712c9SDave Chinner *========================================================================*/ 51730f712c9SDave Chinner 51830f712c9SDave Chinner /* 519ada49d64SGao Xiang * Query whether the total requested number of attr fork bytes of extended 52030f712c9SDave Chinner * attribute space will be able to fit inline. 52130f712c9SDave Chinner * 5227821ea30SChristoph Hellwig * Returns zero if not, else the i_forkoff fork offset to be used in the 52330f712c9SDave Chinner * literal area for attribute data once the new bytes have been added. 52430f712c9SDave Chinner * 5257821ea30SChristoph Hellwig * i_forkoff must be 8 byte aligned, hence is stored as a >>3 value; 52630f712c9SDave Chinner * special case for dev/uuid inodes, they have fixed size data forks. 52730f712c9SDave Chinner */ 52830f712c9SDave Chinner int 5293f8a4f1dSDave Chinner xfs_attr_shortform_bytesfit( 5303f8a4f1dSDave Chinner struct xfs_inode *dp, 5313f8a4f1dSDave Chinner int bytes) 53230f712c9SDave Chinner { 5333f8a4f1dSDave Chinner struct xfs_mount *mp = dp->i_mount; 5343f8a4f1dSDave Chinner int64_t dsize; 5353f8a4f1dSDave Chinner int minforkoff; 5363f8a4f1dSDave Chinner int maxforkoff; 53730f712c9SDave Chinner int offset; 53830f712c9SDave Chinner 539ada49d64SGao Xiang /* 540ada49d64SGao Xiang * Check if the new size could fit at all first: 541ada49d64SGao Xiang */ 542ada49d64SGao Xiang if (bytes > XFS_LITINO(mp)) 543ada49d64SGao Xiang return 0; 544ada49d64SGao Xiang 54530f712c9SDave Chinner /* rounded down */ 546e9e2eae8SChristoph Hellwig offset = (XFS_LITINO(mp) - bytes) >> 3; 54730f712c9SDave Chinner 548f7e67b20SChristoph Hellwig if (dp->i_df.if_format == XFS_DINODE_FMT_DEV) { 54930f712c9SDave Chinner minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3; 55030f712c9SDave Chinner return (offset >= minforkoff) ? minforkoff : 0; 55130f712c9SDave Chinner } 55230f712c9SDave Chinner 55330f712c9SDave Chinner /* 55430f712c9SDave Chinner * If the requested numbers of bytes is smaller or equal to the 55530f712c9SDave Chinner * current attribute fork size we can always proceed. 55630f712c9SDave Chinner * 55730f712c9SDave Chinner * Note that if_bytes in the data fork might actually be larger than 55830f712c9SDave Chinner * the current data fork size is due to delalloc extents. In that 55930f712c9SDave Chinner * case either the extent count will go down when they are converted 56030f712c9SDave Chinner * to real extents, or the delalloc conversion will take care of the 56130f712c9SDave Chinner * literal area rebalancing. 56230f712c9SDave Chinner */ 56330f712c9SDave Chinner if (bytes <= XFS_IFORK_ASIZE(dp)) 5647821ea30SChristoph Hellwig return dp->i_forkoff; 56530f712c9SDave Chinner 56630f712c9SDave Chinner /* 56730f712c9SDave Chinner * For attr2 we can try to move the forkoff if there is space in the 56830f712c9SDave Chinner * literal area, but for the old format we are done if there is no 56930f712c9SDave Chinner * space in the fixed attribute fork. 57030f712c9SDave Chinner */ 57130f712c9SDave Chinner if (!(mp->m_flags & XFS_MOUNT_ATTR2)) 57230f712c9SDave Chinner return 0; 57330f712c9SDave Chinner 57430f712c9SDave Chinner dsize = dp->i_df.if_bytes; 57530f712c9SDave Chinner 576f7e67b20SChristoph Hellwig switch (dp->i_df.if_format) { 57730f712c9SDave Chinner case XFS_DINODE_FMT_EXTENTS: 57830f712c9SDave Chinner /* 57930f712c9SDave Chinner * If there is no attr fork and the data fork is extents, 58030f712c9SDave Chinner * determine if creating the default attr fork will result 58130f712c9SDave Chinner * in the extents form migrating to btree. If so, the 58230f712c9SDave Chinner * minimum offset only needs to be the space required for 58330f712c9SDave Chinner * the btree root. 58430f712c9SDave Chinner */ 5857821ea30SChristoph Hellwig if (!dp->i_forkoff && dp->i_df.if_bytes > 58630f712c9SDave Chinner xfs_default_attroffset(dp)) 58730f712c9SDave Chinner dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS); 58830f712c9SDave Chinner break; 58930f712c9SDave Chinner case XFS_DINODE_FMT_BTREE: 59030f712c9SDave Chinner /* 59130f712c9SDave Chinner * If we have a data btree then keep forkoff if we have one, 59230f712c9SDave Chinner * otherwise we are adding a new attr, so then we set 59330f712c9SDave Chinner * minforkoff to where the btree root can finish so we have 59430f712c9SDave Chinner * plenty of room for attrs 59530f712c9SDave Chinner */ 5967821ea30SChristoph Hellwig if (dp->i_forkoff) { 5977821ea30SChristoph Hellwig if (offset < dp->i_forkoff) 59830f712c9SDave Chinner return 0; 5997821ea30SChristoph Hellwig return dp->i_forkoff; 60030f712c9SDave Chinner } 60130f712c9SDave Chinner dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot); 60230f712c9SDave Chinner break; 60330f712c9SDave Chinner } 60430f712c9SDave Chinner 60530f712c9SDave Chinner /* 60630f712c9SDave Chinner * A data fork btree root must have space for at least 60730f712c9SDave Chinner * MINDBTPTRS key/ptr pairs if the data fork is small or empty. 60830f712c9SDave Chinner */ 6093f8a4f1dSDave Chinner minforkoff = max_t(int64_t, dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS)); 61030f712c9SDave Chinner minforkoff = roundup(minforkoff, 8) >> 3; 61130f712c9SDave Chinner 61230f712c9SDave Chinner /* attr fork btree root can have at least this many key/ptr pairs */ 613e9e2eae8SChristoph Hellwig maxforkoff = XFS_LITINO(mp) - XFS_BMDR_SPACE_CALC(MINABTPTRS); 61430f712c9SDave Chinner maxforkoff = maxforkoff >> 3; /* rounded down */ 61530f712c9SDave Chinner 61630f712c9SDave Chinner if (offset >= maxforkoff) 61730f712c9SDave Chinner return maxforkoff; 61830f712c9SDave Chinner if (offset >= minforkoff) 61930f712c9SDave Chinner return offset; 62030f712c9SDave Chinner return 0; 62130f712c9SDave Chinner } 62230f712c9SDave Chinner 62330f712c9SDave Chinner /* 62430f712c9SDave Chinner * Switch on the ATTR2 superblock bit (implies also FEATURES2) 62530f712c9SDave Chinner */ 62630f712c9SDave Chinner STATIC void 62730f712c9SDave Chinner xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp) 62830f712c9SDave Chinner { 62930f712c9SDave Chinner if ((mp->m_flags & XFS_MOUNT_ATTR2) && 63030f712c9SDave Chinner !(xfs_sb_version_hasattr2(&mp->m_sb))) { 63130f712c9SDave Chinner spin_lock(&mp->m_sb_lock); 63230f712c9SDave Chinner if (!xfs_sb_version_hasattr2(&mp->m_sb)) { 63330f712c9SDave Chinner xfs_sb_version_addattr2(&mp->m_sb); 63430f712c9SDave Chinner spin_unlock(&mp->m_sb_lock); 63561e63ecbSDave Chinner xfs_log_sb(tp); 63630f712c9SDave Chinner } else 63730f712c9SDave Chinner spin_unlock(&mp->m_sb_lock); 63830f712c9SDave Chinner } 63930f712c9SDave Chinner } 64030f712c9SDave Chinner 64130f712c9SDave Chinner /* 64230f712c9SDave Chinner * Create the initial contents of a shortform attribute list. 64330f712c9SDave Chinner */ 64430f712c9SDave Chinner void 645f7e67b20SChristoph Hellwig xfs_attr_shortform_create( 646f7e67b20SChristoph Hellwig struct xfs_da_args *args) 64730f712c9SDave Chinner { 648f7e67b20SChristoph Hellwig struct xfs_inode *dp = args->dp; 649f7e67b20SChristoph Hellwig struct xfs_ifork *ifp = dp->i_afp; 650f7e67b20SChristoph Hellwig struct xfs_attr_sf_hdr *hdr; 65130f712c9SDave Chinner 65230f712c9SDave Chinner trace_xfs_attr_sf_create(args); 65330f712c9SDave Chinner 65430f712c9SDave Chinner ASSERT(ifp->if_bytes == 0); 655b2197a36SChristoph Hellwig if (ifp->if_format == XFS_DINODE_FMT_EXTENTS) 656f7e67b20SChristoph Hellwig ifp->if_format = XFS_DINODE_FMT_LOCAL; 65730f712c9SDave Chinner xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK); 658125eac24SDarrick J. Wong hdr = (struct xfs_attr_sf_hdr *)ifp->if_u1.if_data; 659125eac24SDarrick J. Wong memset(hdr, 0, sizeof(*hdr)); 66030f712c9SDave Chinner hdr->totsize = cpu_to_be16(sizeof(*hdr)); 66130f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 66230f712c9SDave Chinner } 66330f712c9SDave Chinner 66430f712c9SDave Chinner /* 66507120f1aSAllison Collins * Return -EEXIST if attr is found, or -ENOATTR if not 66607120f1aSAllison Collins * args: args containing attribute name and namelen 66707120f1aSAllison Collins * sfep: If not null, pointer will be set to the last attr entry found on 66807120f1aSAllison Collins -EEXIST. On -ENOATTR pointer is left at the last entry in the list 66907120f1aSAllison Collins * basep: If not null, pointer is set to the byte offset of the entry in the 67007120f1aSAllison Collins * list on -EEXIST. On -ENOATTR, pointer is left at the byte offset of 67107120f1aSAllison Collins * the last entry in the list 67207120f1aSAllison Collins */ 67307120f1aSAllison Collins int 67407120f1aSAllison Collins xfs_attr_sf_findname( 67507120f1aSAllison Collins struct xfs_da_args *args, 67607120f1aSAllison Collins struct xfs_attr_sf_entry **sfep, 67707120f1aSAllison Collins unsigned int *basep) 67807120f1aSAllison Collins { 67907120f1aSAllison Collins struct xfs_attr_shortform *sf; 68007120f1aSAllison Collins struct xfs_attr_sf_entry *sfe; 68107120f1aSAllison Collins unsigned int base = sizeof(struct xfs_attr_sf_hdr); 68207120f1aSAllison Collins int size = 0; 68307120f1aSAllison Collins int end; 68407120f1aSAllison Collins int i; 68507120f1aSAllison Collins 68607120f1aSAllison Collins sf = (struct xfs_attr_shortform *)args->dp->i_afp->if_u1.if_data; 68707120f1aSAllison Collins sfe = &sf->list[0]; 68807120f1aSAllison Collins end = sf->hdr.count; 689e01b7eedSCarlos Maiolino for (i = 0; i < end; sfe = xfs_attr_sf_nextentry(sfe), 69007120f1aSAllison Collins base += size, i++) { 691e01b7eedSCarlos Maiolino size = xfs_attr_sf_entsize(sfe); 69207120f1aSAllison Collins if (!xfs_attr_match(args, sfe->namelen, sfe->nameval, 69307120f1aSAllison Collins sfe->flags)) 69407120f1aSAllison Collins continue; 69507120f1aSAllison Collins break; 69607120f1aSAllison Collins } 69707120f1aSAllison Collins 69807120f1aSAllison Collins if (sfep != NULL) 69907120f1aSAllison Collins *sfep = sfe; 70007120f1aSAllison Collins 70107120f1aSAllison Collins if (basep != NULL) 70207120f1aSAllison Collins *basep = base; 70307120f1aSAllison Collins 70407120f1aSAllison Collins if (i == end) 70507120f1aSAllison Collins return -ENOATTR; 70607120f1aSAllison Collins return -EEXIST; 70707120f1aSAllison Collins } 70807120f1aSAllison Collins 70907120f1aSAllison Collins /* 71030f712c9SDave Chinner * Add a name/value pair to the shortform attribute list. 71130f712c9SDave Chinner * Overflow from the inode has already been checked for. 71230f712c9SDave Chinner */ 71330f712c9SDave Chinner void 71407120f1aSAllison Collins xfs_attr_shortform_add( 71507120f1aSAllison Collins struct xfs_da_args *args, 71607120f1aSAllison Collins int forkoff) 71730f712c9SDave Chinner { 71807120f1aSAllison Collins struct xfs_attr_shortform *sf; 71907120f1aSAllison Collins struct xfs_attr_sf_entry *sfe; 72007120f1aSAllison Collins int offset, size; 72107120f1aSAllison Collins struct xfs_mount *mp; 72207120f1aSAllison Collins struct xfs_inode *dp; 7233ba738dfSChristoph Hellwig struct xfs_ifork *ifp; 72430f712c9SDave Chinner 72530f712c9SDave Chinner trace_xfs_attr_sf_add(args); 72630f712c9SDave Chinner 72730f712c9SDave Chinner dp = args->dp; 72830f712c9SDave Chinner mp = dp->i_mount; 7297821ea30SChristoph Hellwig dp->i_forkoff = forkoff; 73030f712c9SDave Chinner 73130f712c9SDave Chinner ifp = dp->i_afp; 7320779f4a6SChristoph Hellwig ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL); 73347e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 73407120f1aSAllison Collins if (xfs_attr_sf_findname(args, &sfe, NULL) == -EEXIST) 73507120f1aSAllison Collins ASSERT(0); 73630f712c9SDave Chinner 73730f712c9SDave Chinner offset = (char *)sfe - (char *)sf; 738e01b7eedSCarlos Maiolino size = xfs_attr_sf_entsize_byname(args->namelen, args->valuelen); 73930f712c9SDave Chinner xfs_idata_realloc(dp, size, XFS_ATTR_FORK); 74047e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 7416337c844SCarlos Maiolino sfe = (struct xfs_attr_sf_entry *)((char *)sf + offset); 74230f712c9SDave Chinner 74330f712c9SDave Chinner sfe->namelen = args->namelen; 74430f712c9SDave Chinner sfe->valuelen = args->valuelen; 745d5f0f49aSChristoph Hellwig sfe->flags = args->attr_filter; 74630f712c9SDave Chinner memcpy(sfe->nameval, args->name, args->namelen); 74730f712c9SDave Chinner memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen); 74830f712c9SDave Chinner sf->hdr.count++; 74930f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, size); 75030f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 75130f712c9SDave Chinner 75230f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 75330f712c9SDave Chinner } 75430f712c9SDave Chinner 75530f712c9SDave Chinner /* 75630f712c9SDave Chinner * After the last attribute is removed revert to original inode format, 75730f712c9SDave Chinner * making all literal area available to the data fork once more. 75830f712c9SDave Chinner */ 7596dfe5a04SDave Chinner void 7606dfe5a04SDave Chinner xfs_attr_fork_remove( 76130f712c9SDave Chinner struct xfs_inode *ip, 76230f712c9SDave Chinner struct xfs_trans *tp) 76330f712c9SDave Chinner { 764daf83964SChristoph Hellwig ASSERT(ip->i_afp->if_nextents == 0); 765daf83964SChristoph Hellwig 766ef838512SChristoph Hellwig xfs_idestroy_fork(ip->i_afp); 767ef838512SChristoph Hellwig kmem_cache_free(xfs_ifork_zone, ip->i_afp); 768ef838512SChristoph Hellwig ip->i_afp = NULL; 7697821ea30SChristoph Hellwig ip->i_forkoff = 0; 77030f712c9SDave Chinner xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); 77130f712c9SDave Chinner } 77230f712c9SDave Chinner 77330f712c9SDave Chinner /* 77430f712c9SDave Chinner * Remove an attribute from the shortform attribute list structure. 77530f712c9SDave Chinner */ 77630f712c9SDave Chinner int 77707120f1aSAllison Collins xfs_attr_shortform_remove( 77807120f1aSAllison Collins struct xfs_da_args *args) 77930f712c9SDave Chinner { 78007120f1aSAllison Collins struct xfs_attr_shortform *sf; 78107120f1aSAllison Collins struct xfs_attr_sf_entry *sfe; 78207120f1aSAllison Collins int size = 0, end, totsize; 78307120f1aSAllison Collins unsigned int base; 78407120f1aSAllison Collins struct xfs_mount *mp; 78507120f1aSAllison Collins struct xfs_inode *dp; 78607120f1aSAllison Collins int error; 78730f712c9SDave Chinner 78830f712c9SDave Chinner trace_xfs_attr_sf_remove(args); 78930f712c9SDave Chinner 79030f712c9SDave Chinner dp = args->dp; 79130f712c9SDave Chinner mp = dp->i_mount; 79247e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)dp->i_afp->if_u1.if_data; 79307120f1aSAllison Collins 79407120f1aSAllison Collins error = xfs_attr_sf_findname(args, &sfe, &base); 79507120f1aSAllison Collins if (error != -EEXIST) 79607120f1aSAllison Collins return error; 797e01b7eedSCarlos Maiolino size = xfs_attr_sf_entsize(sfe); 79830f712c9SDave Chinner 79930f712c9SDave Chinner /* 80030f712c9SDave Chinner * Fix up the attribute fork data, covering the hole 80130f712c9SDave Chinner */ 80230f712c9SDave Chinner end = base + size; 80330f712c9SDave Chinner totsize = be16_to_cpu(sf->hdr.totsize); 80430f712c9SDave Chinner if (end != totsize) 80530f712c9SDave Chinner memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end); 80630f712c9SDave Chinner sf->hdr.count--; 80730f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, -size); 80830f712c9SDave Chinner 80930f712c9SDave Chinner /* 81030f712c9SDave Chinner * Fix up the start offset of the attribute fork 81130f712c9SDave Chinner */ 81230f712c9SDave Chinner totsize -= size; 81330f712c9SDave Chinner if (totsize == sizeof(xfs_attr_sf_hdr_t) && 81430f712c9SDave Chinner (mp->m_flags & XFS_MOUNT_ATTR2) && 815f7e67b20SChristoph Hellwig (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) && 81630f712c9SDave Chinner !(args->op_flags & XFS_DA_OP_ADDNAME)) { 8176dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 81830f712c9SDave Chinner } else { 81930f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 8207821ea30SChristoph Hellwig dp->i_forkoff = xfs_attr_shortform_bytesfit(dp, totsize); 8217821ea30SChristoph Hellwig ASSERT(dp->i_forkoff); 82230f712c9SDave Chinner ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) || 82330f712c9SDave Chinner (args->op_flags & XFS_DA_OP_ADDNAME) || 82430f712c9SDave Chinner !(mp->m_flags & XFS_MOUNT_ATTR2) || 825f7e67b20SChristoph Hellwig dp->i_df.if_format == XFS_DINODE_FMT_BTREE); 82630f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, 82730f712c9SDave Chinner XFS_ILOG_CORE | XFS_ILOG_ADATA); 82830f712c9SDave Chinner } 82930f712c9SDave Chinner 83030f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 83130f712c9SDave Chinner 83230f712c9SDave Chinner return 0; 83330f712c9SDave Chinner } 83430f712c9SDave Chinner 83530f712c9SDave Chinner /* 83630f712c9SDave Chinner * Look up a name in a shortform attribute list structure. 83730f712c9SDave Chinner */ 83830f712c9SDave Chinner /*ARGSUSED*/ 83930f712c9SDave Chinner int 84030f712c9SDave Chinner xfs_attr_shortform_lookup(xfs_da_args_t *args) 84130f712c9SDave Chinner { 84247e6cc10SCarlos Maiolino struct xfs_attr_shortform *sf; 8436337c844SCarlos Maiolino struct xfs_attr_sf_entry *sfe; 84430f712c9SDave Chinner int i; 8453ba738dfSChristoph Hellwig struct xfs_ifork *ifp; 84630f712c9SDave Chinner 84730f712c9SDave Chinner trace_xfs_attr_sf_lookup(args); 84830f712c9SDave Chinner 84930f712c9SDave Chinner ifp = args->dp->i_afp; 8500779f4a6SChristoph Hellwig ASSERT(ifp->if_format == XFS_DINODE_FMT_LOCAL); 85147e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 85230f712c9SDave Chinner sfe = &sf->list[0]; 85330f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 854e01b7eedSCarlos Maiolino sfe = xfs_attr_sf_nextentry(sfe), i++) { 855377f16acSChristoph Hellwig if (xfs_attr_match(args, sfe->namelen, sfe->nameval, 856377f16acSChristoph Hellwig sfe->flags)) 8572451337dSDave Chinner return -EEXIST; 85830f712c9SDave Chinner } 8592451337dSDave Chinner return -ENOATTR; 86030f712c9SDave Chinner } 86130f712c9SDave Chinner 86230f712c9SDave Chinner /* 863cf085a1bSJoe Perches * Retrieve the attribute value and length. 864728bcaa3SDave Chinner * 865e513e25cSChristoph Hellwig * If args->valuelen is zero, only the length needs to be returned. Unlike a 866e513e25cSChristoph Hellwig * lookup, we only return an error if the attribute does not exist or we can't 867e513e25cSChristoph Hellwig * retrieve the value. 86830f712c9SDave Chinner */ 86930f712c9SDave Chinner int 8709df243a1SDave Chinner xfs_attr_shortform_getvalue( 8719df243a1SDave Chinner struct xfs_da_args *args) 87230f712c9SDave Chinner { 8739df243a1SDave Chinner struct xfs_attr_shortform *sf; 8749df243a1SDave Chinner struct xfs_attr_sf_entry *sfe; 87530f712c9SDave Chinner int i; 87630f712c9SDave Chinner 8770779f4a6SChristoph Hellwig ASSERT(args->dp->i_afp->if_format == XFS_DINODE_FMT_LOCAL); 87847e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)args->dp->i_afp->if_u1.if_data; 87930f712c9SDave Chinner sfe = &sf->list[0]; 88030f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 881e01b7eedSCarlos Maiolino sfe = xfs_attr_sf_nextentry(sfe), i++) { 882377f16acSChristoph Hellwig if (xfs_attr_match(args, sfe->namelen, sfe->nameval, 883377f16acSChristoph Hellwig sfe->flags)) 884377f16acSChristoph Hellwig return xfs_attr_copy_value(args, 885377f16acSChristoph Hellwig &sfe->nameval[args->namelen], sfe->valuelen); 88630f712c9SDave Chinner } 8872451337dSDave Chinner return -ENOATTR; 88830f712c9SDave Chinner } 88930f712c9SDave Chinner 89030f712c9SDave Chinner /* 8916e643cd0SDarrick J. Wong * Convert from using the shortform to the leaf. On success, return the 8926e643cd0SDarrick J. Wong * buffer so that we can keep it locked until we're totally done with it. 89330f712c9SDave Chinner */ 89430f712c9SDave Chinner int 8956e643cd0SDarrick J. Wong xfs_attr_shortform_to_leaf( 8966e643cd0SDarrick J. Wong struct xfs_da_args *args, 8976e643cd0SDarrick J. Wong struct xfs_buf **leaf_bp) 89830f712c9SDave Chinner { 89932a9b7c6SBrian Foster struct xfs_inode *dp; 90032a9b7c6SBrian Foster struct xfs_attr_shortform *sf; 90132a9b7c6SBrian Foster struct xfs_attr_sf_entry *sfe; 90232a9b7c6SBrian Foster struct xfs_da_args nargs; 90330f712c9SDave Chinner char *tmpbuffer; 90430f712c9SDave Chinner int error, i, size; 90530f712c9SDave Chinner xfs_dablk_t blkno; 90630f712c9SDave Chinner struct xfs_buf *bp; 90732a9b7c6SBrian Foster struct xfs_ifork *ifp; 90830f712c9SDave Chinner 90930f712c9SDave Chinner trace_xfs_attr_sf_to_leaf(args); 91030f712c9SDave Chinner 91130f712c9SDave Chinner dp = args->dp; 91230f712c9SDave Chinner ifp = dp->i_afp; 91347e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 91430f712c9SDave Chinner size = be16_to_cpu(sf->hdr.totsize); 915707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(size, 0); 91630f712c9SDave Chinner ASSERT(tmpbuffer != NULL); 91730f712c9SDave Chinner memcpy(tmpbuffer, ifp->if_u1.if_data, size); 91847e6cc10SCarlos Maiolino sf = (struct xfs_attr_shortform *)tmpbuffer; 91930f712c9SDave Chinner 92030f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 921aeea4b75SBrian Foster xfs_bmap_local_to_extents_empty(args->trans, dp, XFS_ATTR_FORK); 92230f712c9SDave Chinner 92330f712c9SDave Chinner bp = NULL; 92430f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 925603efebdSBrian Foster if (error) 92630f712c9SDave Chinner goto out; 92730f712c9SDave Chinner 92830f712c9SDave Chinner ASSERT(blkno == 0); 92930f712c9SDave Chinner error = xfs_attr3_leaf_create(args, blkno, &bp); 930603efebdSBrian Foster if (error) 93130f712c9SDave Chinner goto out; 93230f712c9SDave Chinner 93330f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 93430f712c9SDave Chinner nargs.dp = dp; 93530f712c9SDave Chinner nargs.geo = args->geo; 93630f712c9SDave Chinner nargs.total = args->total; 93730f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 93830f712c9SDave Chinner nargs.trans = args->trans; 93930f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 94030f712c9SDave Chinner 94130f712c9SDave Chinner sfe = &sf->list[0]; 94230f712c9SDave Chinner for (i = 0; i < sf->hdr.count; i++) { 94330f712c9SDave Chinner nargs.name = sfe->nameval; 94430f712c9SDave Chinner nargs.namelen = sfe->namelen; 94530f712c9SDave Chinner nargs.value = &sfe->nameval[nargs.namelen]; 94630f712c9SDave Chinner nargs.valuelen = sfe->valuelen; 94730f712c9SDave Chinner nargs.hashval = xfs_da_hashname(sfe->nameval, 94830f712c9SDave Chinner sfe->namelen); 949d5f0f49aSChristoph Hellwig nargs.attr_filter = sfe->flags & XFS_ATTR_NSP_ONDISK_MASK; 95030f712c9SDave Chinner error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */ 9512451337dSDave Chinner ASSERT(error == -ENOATTR); 95230f712c9SDave Chinner error = xfs_attr3_leaf_add(bp, &nargs); 9532451337dSDave Chinner ASSERT(error != -ENOSPC); 95430f712c9SDave Chinner if (error) 95530f712c9SDave Chinner goto out; 956e01b7eedSCarlos Maiolino sfe = xfs_attr_sf_nextentry(sfe); 95730f712c9SDave Chinner } 95830f712c9SDave Chinner error = 0; 9596e643cd0SDarrick J. Wong *leaf_bp = bp; 96030f712c9SDave Chinner out: 96130f712c9SDave Chinner kmem_free(tmpbuffer); 96230f712c9SDave Chinner return error; 96330f712c9SDave Chinner } 96430f712c9SDave Chinner 96530f712c9SDave Chinner /* 96630f712c9SDave Chinner * Check a leaf attribute block to see if all the entries would fit into 96730f712c9SDave Chinner * a shortform attribute list. 96830f712c9SDave Chinner */ 96930f712c9SDave Chinner int 97030f712c9SDave Chinner xfs_attr_shortform_allfit( 97130f712c9SDave Chinner struct xfs_buf *bp, 97230f712c9SDave Chinner struct xfs_inode *dp) 97330f712c9SDave Chinner { 97430f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 97530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 97630f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 97730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr leafhdr; 97830f712c9SDave Chinner int bytes; 97930f712c9SDave Chinner int i; 980dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 98130f712c9SDave Chinner 98230f712c9SDave Chinner leaf = bp->b_addr; 9832f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf); 98430f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 98530f712c9SDave Chinner 98630f712c9SDave Chinner bytes = sizeof(struct xfs_attr_sf_hdr); 98730f712c9SDave Chinner for (i = 0; i < leafhdr.count; entry++, i++) { 98830f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 98930f712c9SDave Chinner continue; /* don't copy partial entries */ 99030f712c9SDave Chinner if (!(entry->flags & XFS_ATTR_LOCAL)) 99130f712c9SDave Chinner return 0; 99230f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 99330f712c9SDave Chinner if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX) 99430f712c9SDave Chinner return 0; 99530f712c9SDave Chinner if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX) 99630f712c9SDave Chinner return 0; 997e01b7eedSCarlos Maiolino bytes += xfs_attr_sf_entsize_byname(name_loc->namelen, 998c418dbc9SCarlos Maiolino be16_to_cpu(name_loc->valuelen)); 99930f712c9SDave Chinner } 100030f712c9SDave Chinner if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) && 1001f7e67b20SChristoph Hellwig (dp->i_df.if_format != XFS_DINODE_FMT_BTREE) && 100230f712c9SDave Chinner (bytes == sizeof(struct xfs_attr_sf_hdr))) 100330f712c9SDave Chinner return -1; 100430f712c9SDave Chinner return xfs_attr_shortform_bytesfit(dp, bytes); 100530f712c9SDave Chinner } 100630f712c9SDave Chinner 10071e1bbd8eSDarrick J. Wong /* Verify the consistency of an inline attribute fork. */ 10081e1bbd8eSDarrick J. Wong xfs_failaddr_t 10091e1bbd8eSDarrick J. Wong xfs_attr_shortform_verify( 10101e1bbd8eSDarrick J. Wong struct xfs_inode *ip) 10111e1bbd8eSDarrick J. Wong { 10121e1bbd8eSDarrick J. Wong struct xfs_attr_shortform *sfp; 10131e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *sfep; 10141e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *next_sfep; 10151e1bbd8eSDarrick J. Wong char *endp; 10161e1bbd8eSDarrick J. Wong struct xfs_ifork *ifp; 10171e1bbd8eSDarrick J. Wong int i; 10183f8a4f1dSDave Chinner int64_t size; 10191e1bbd8eSDarrick J. Wong 1020f7e67b20SChristoph Hellwig ASSERT(ip->i_afp->if_format == XFS_DINODE_FMT_LOCAL); 10211e1bbd8eSDarrick J. Wong ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK); 10221e1bbd8eSDarrick J. Wong sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 10231e1bbd8eSDarrick J. Wong size = ifp->if_bytes; 10241e1bbd8eSDarrick J. Wong 10251e1bbd8eSDarrick J. Wong /* 10261e1bbd8eSDarrick J. Wong * Give up if the attribute is way too short. 10271e1bbd8eSDarrick J. Wong */ 10281e1bbd8eSDarrick J. Wong if (size < sizeof(struct xfs_attr_sf_hdr)) 10291e1bbd8eSDarrick J. Wong return __this_address; 10301e1bbd8eSDarrick J. Wong 10311e1bbd8eSDarrick J. Wong endp = (char *)sfp + size; 10321e1bbd8eSDarrick J. Wong 10331e1bbd8eSDarrick J. Wong /* Check all reported entries */ 10341e1bbd8eSDarrick J. Wong sfep = &sfp->list[0]; 10351e1bbd8eSDarrick J. Wong for (i = 0; i < sfp->hdr.count; i++) { 10361e1bbd8eSDarrick J. Wong /* 10371e1bbd8eSDarrick J. Wong * struct xfs_attr_sf_entry has a variable length. 10381e1bbd8eSDarrick J. Wong * Check the fixed-offset parts of the structure are 10391e1bbd8eSDarrick J. Wong * within the data buffer. 1040f4020438SEric Sandeen * xfs_attr_sf_entry is defined with a 1-byte variable 1041f4020438SEric Sandeen * array at the end, so we must subtract that off. 10421e1bbd8eSDarrick J. Wong */ 1043c418dbc9SCarlos Maiolino if (((char *)sfep + sizeof(*sfep)) >= endp) 10441e1bbd8eSDarrick J. Wong return __this_address; 10451e1bbd8eSDarrick J. Wong 10461e1bbd8eSDarrick J. Wong /* Don't allow names with known bad length. */ 10471e1bbd8eSDarrick J. Wong if (sfep->namelen == 0) 10481e1bbd8eSDarrick J. Wong return __this_address; 10491e1bbd8eSDarrick J. Wong 10501e1bbd8eSDarrick J. Wong /* 10511e1bbd8eSDarrick J. Wong * Check that the variable-length part of the structure is 10521e1bbd8eSDarrick J. Wong * within the data buffer. The next entry starts after the 10531e1bbd8eSDarrick J. Wong * name component, so nextentry is an acceptable test. 10541e1bbd8eSDarrick J. Wong */ 1055e01b7eedSCarlos Maiolino next_sfep = xfs_attr_sf_nextentry(sfep); 10561e1bbd8eSDarrick J. Wong if ((char *)next_sfep > endp) 10571e1bbd8eSDarrick J. Wong return __this_address; 10581e1bbd8eSDarrick J. Wong 10591e1bbd8eSDarrick J. Wong /* 10601e1bbd8eSDarrick J. Wong * Check for unknown flags. Short form doesn't support 10611e1bbd8eSDarrick J. Wong * the incomplete or local bits, so we can use the namespace 10621e1bbd8eSDarrick J. Wong * mask here. 10631e1bbd8eSDarrick J. Wong */ 10641e1bbd8eSDarrick J. Wong if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK) 10651e1bbd8eSDarrick J. Wong return __this_address; 10661e1bbd8eSDarrick J. Wong 10671e1bbd8eSDarrick J. Wong /* 10681e1bbd8eSDarrick J. Wong * Check for invalid namespace combinations. We only allow 10691e1bbd8eSDarrick J. Wong * one namespace flag per xattr, so we can just count the 10701e1bbd8eSDarrick J. Wong * bits (i.e. hweight) here. 10711e1bbd8eSDarrick J. Wong */ 10721e1bbd8eSDarrick J. Wong if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1) 10731e1bbd8eSDarrick J. Wong return __this_address; 10741e1bbd8eSDarrick J. Wong 10751e1bbd8eSDarrick J. Wong sfep = next_sfep; 10761e1bbd8eSDarrick J. Wong } 10771e1bbd8eSDarrick J. Wong if ((void *)sfep != (void *)endp) 10781e1bbd8eSDarrick J. Wong return __this_address; 10791e1bbd8eSDarrick J. Wong 10801e1bbd8eSDarrick J. Wong return NULL; 10811e1bbd8eSDarrick J. Wong } 10821e1bbd8eSDarrick J. Wong 108330f712c9SDave Chinner /* 108430f712c9SDave Chinner * Convert a leaf attribute list to shortform attribute list 108530f712c9SDave Chinner */ 108630f712c9SDave Chinner int 108730f712c9SDave Chinner xfs_attr3_leaf_to_shortform( 108830f712c9SDave Chinner struct xfs_buf *bp, 108930f712c9SDave Chinner struct xfs_da_args *args, 109030f712c9SDave Chinner int forkoff) 109130f712c9SDave Chinner { 109230f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 109330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 109430f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 109530f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 109630f712c9SDave Chinner struct xfs_da_args nargs; 109730f712c9SDave Chinner struct xfs_inode *dp = args->dp; 109830f712c9SDave Chinner char *tmpbuffer; 109930f712c9SDave Chinner int error; 110030f712c9SDave Chinner int i; 110130f712c9SDave Chinner 110230f712c9SDave Chinner trace_xfs_attr_leaf_to_sf(args); 110330f712c9SDave Chinner 1104707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(args->geo->blksize, 0); 110530f712c9SDave Chinner if (!tmpbuffer) 11062451337dSDave Chinner return -ENOMEM; 110730f712c9SDave Chinner 110830f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 110930f712c9SDave Chinner 111030f712c9SDave Chinner leaf = (xfs_attr_leafblock_t *)tmpbuffer; 11112f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 111230f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 111330f712c9SDave Chinner 111430f712c9SDave Chinner /* XXX (dgc): buffer is about to be marked stale - why zero it? */ 111530f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 111630f712c9SDave Chinner 111730f712c9SDave Chinner /* 111830f712c9SDave Chinner * Clean out the prior contents of the attribute list. 111930f712c9SDave Chinner */ 112030f712c9SDave Chinner error = xfs_da_shrink_inode(args, 0, bp); 112130f712c9SDave Chinner if (error) 112230f712c9SDave Chinner goto out; 112330f712c9SDave Chinner 112430f712c9SDave Chinner if (forkoff == -1) { 112530f712c9SDave Chinner ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2); 1126f7e67b20SChristoph Hellwig ASSERT(dp->i_df.if_format != XFS_DINODE_FMT_BTREE); 11276dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 112830f712c9SDave Chinner goto out; 112930f712c9SDave Chinner } 113030f712c9SDave Chinner 113130f712c9SDave Chinner xfs_attr_shortform_create(args); 113230f712c9SDave Chinner 113330f712c9SDave Chinner /* 113430f712c9SDave Chinner * Copy the attributes 113530f712c9SDave Chinner */ 113630f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 113730f712c9SDave Chinner nargs.geo = args->geo; 113830f712c9SDave Chinner nargs.dp = dp; 113930f712c9SDave Chinner nargs.total = args->total; 114030f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 114130f712c9SDave Chinner nargs.trans = args->trans; 114230f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 114330f712c9SDave Chinner 114430f712c9SDave Chinner for (i = 0; i < ichdr.count; entry++, i++) { 114530f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 114630f712c9SDave Chinner continue; /* don't copy partial entries */ 114730f712c9SDave Chinner if (!entry->nameidx) 114830f712c9SDave Chinner continue; 114930f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_LOCAL); 115030f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 115130f712c9SDave Chinner nargs.name = name_loc->nameval; 115230f712c9SDave Chinner nargs.namelen = name_loc->namelen; 115330f712c9SDave Chinner nargs.value = &name_loc->nameval[nargs.namelen]; 115430f712c9SDave Chinner nargs.valuelen = be16_to_cpu(name_loc->valuelen); 115530f712c9SDave Chinner nargs.hashval = be32_to_cpu(entry->hashval); 1156d5f0f49aSChristoph Hellwig nargs.attr_filter = entry->flags & XFS_ATTR_NSP_ONDISK_MASK; 115730f712c9SDave Chinner xfs_attr_shortform_add(&nargs, forkoff); 115830f712c9SDave Chinner } 115930f712c9SDave Chinner error = 0; 116030f712c9SDave Chinner 116130f712c9SDave Chinner out: 116230f712c9SDave Chinner kmem_free(tmpbuffer); 116330f712c9SDave Chinner return error; 116430f712c9SDave Chinner } 116530f712c9SDave Chinner 116630f712c9SDave Chinner /* 116730f712c9SDave Chinner * Convert from using a single leaf to a root node and a leaf. 116830f712c9SDave Chinner */ 116930f712c9SDave Chinner int 117030f712c9SDave Chinner xfs_attr3_leaf_to_node( 117130f712c9SDave Chinner struct xfs_da_args *args) 117230f712c9SDave Chinner { 117330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 117430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr icleafhdr; 117530f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 117630f712c9SDave Chinner struct xfs_da3_icnode_hdr icnodehdr; 117730f712c9SDave Chinner struct xfs_da_intnode *node; 117830f712c9SDave Chinner struct xfs_inode *dp = args->dp; 117930f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 118030f712c9SDave Chinner struct xfs_buf *bp1 = NULL; 118130f712c9SDave Chinner struct xfs_buf *bp2 = NULL; 118230f712c9SDave Chinner xfs_dablk_t blkno; 118330f712c9SDave Chinner int error; 118430f712c9SDave Chinner 118530f712c9SDave Chinner trace_xfs_attr_leaf_to_node(args); 118630f712c9SDave Chinner 118730f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 118830f712c9SDave Chinner if (error) 118930f712c9SDave Chinner goto out; 1190dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, dp, 0, &bp1); 119130f712c9SDave Chinner if (error) 119230f712c9SDave Chinner goto out; 119330f712c9SDave Chinner 11942911edb6SChristoph Hellwig error = xfs_da_get_buf(args->trans, dp, blkno, &bp2, XFS_ATTR_FORK); 119530f712c9SDave Chinner if (error) 119630f712c9SDave Chinner goto out; 119730f712c9SDave Chinner 119830f712c9SDave Chinner /* copy leaf to new buffer, update identifiers */ 119930f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF); 120030f712c9SDave Chinner bp2->b_ops = bp1->b_ops; 120130f712c9SDave Chinner memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize); 120230f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 120330f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp2->b_addr; 120430f712c9SDave Chinner hdr3->blkno = cpu_to_be64(bp2->b_bn); 120530f712c9SDave Chinner } 120630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1); 120730f712c9SDave Chinner 120830f712c9SDave Chinner /* 120930f712c9SDave Chinner * Set up the new root node. 121030f712c9SDave Chinner */ 121130f712c9SDave Chinner error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK); 121230f712c9SDave Chinner if (error) 121330f712c9SDave Chinner goto out; 121430f712c9SDave Chinner node = bp1->b_addr; 1215f475dc4dSChristoph Hellwig xfs_da3_node_hdr_from_disk(mp, &icnodehdr, node); 121630f712c9SDave Chinner 121730f712c9SDave Chinner leaf = bp2->b_addr; 12182f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf); 121930f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 122030f712c9SDave Chinner 122130f712c9SDave Chinner /* both on-disk, don't endian-flip twice */ 122251908ca7SChristoph Hellwig icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval; 122351908ca7SChristoph Hellwig icnodehdr.btree[0].before = cpu_to_be32(blkno); 122430f712c9SDave Chinner icnodehdr.count = 1; 1225e1c8af1eSChristoph Hellwig xfs_da3_node_hdr_to_disk(dp->i_mount, node, &icnodehdr); 122630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1); 122730f712c9SDave Chinner error = 0; 122830f712c9SDave Chinner out: 122930f712c9SDave Chinner return error; 123030f712c9SDave Chinner } 123130f712c9SDave Chinner 123230f712c9SDave Chinner /*======================================================================== 123330f712c9SDave Chinner * Routines used for growing the Btree. 123430f712c9SDave Chinner *========================================================================*/ 123530f712c9SDave Chinner 123630f712c9SDave Chinner /* 123730f712c9SDave Chinner * Create the initial contents of a leaf attribute list 123830f712c9SDave Chinner * or a leaf in a node attribute list. 123930f712c9SDave Chinner */ 124030f712c9SDave Chinner STATIC int 124130f712c9SDave Chinner xfs_attr3_leaf_create( 124230f712c9SDave Chinner struct xfs_da_args *args, 124330f712c9SDave Chinner xfs_dablk_t blkno, 124430f712c9SDave Chinner struct xfs_buf **bpp) 124530f712c9SDave Chinner { 124630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 124730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 124830f712c9SDave Chinner struct xfs_inode *dp = args->dp; 124930f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 125030f712c9SDave Chinner struct xfs_buf *bp; 125130f712c9SDave Chinner int error; 125230f712c9SDave Chinner 125330f712c9SDave Chinner trace_xfs_attr_leaf_create(args); 125430f712c9SDave Chinner 12552911edb6SChristoph Hellwig error = xfs_da_get_buf(args->trans, args->dp, blkno, &bp, 125630f712c9SDave Chinner XFS_ATTR_FORK); 125730f712c9SDave Chinner if (error) 125830f712c9SDave Chinner return error; 125930f712c9SDave Chinner bp->b_ops = &xfs_attr3_leaf_buf_ops; 126030f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF); 126130f712c9SDave Chinner leaf = bp->b_addr; 126230f712c9SDave Chinner memset(leaf, 0, args->geo->blksize); 126330f712c9SDave Chinner 126430f712c9SDave Chinner memset(&ichdr, 0, sizeof(ichdr)); 126530f712c9SDave Chinner ichdr.firstused = args->geo->blksize; 126630f712c9SDave Chinner 126730f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 126830f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp->b_addr; 126930f712c9SDave Chinner 127030f712c9SDave Chinner ichdr.magic = XFS_ATTR3_LEAF_MAGIC; 127130f712c9SDave Chinner 127230f712c9SDave Chinner hdr3->blkno = cpu_to_be64(bp->b_bn); 127330f712c9SDave Chinner hdr3->owner = cpu_to_be64(dp->i_ino); 1274ce748eaaSEric Sandeen uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); 127530f712c9SDave Chinner 127630f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr); 127730f712c9SDave Chinner } else { 127830f712c9SDave Chinner ichdr.magic = XFS_ATTR_LEAF_MAGIC; 127930f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr); 128030f712c9SDave Chinner } 128130f712c9SDave Chinner ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base; 128230f712c9SDave Chinner 12832f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 128430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1); 128530f712c9SDave Chinner 128630f712c9SDave Chinner *bpp = bp; 128730f712c9SDave Chinner return 0; 128830f712c9SDave Chinner } 128930f712c9SDave Chinner 129030f712c9SDave Chinner /* 129130f712c9SDave Chinner * Split the leaf node, rebalance, then add the new entry. 129230f712c9SDave Chinner */ 129330f712c9SDave Chinner int 129430f712c9SDave Chinner xfs_attr3_leaf_split( 129530f712c9SDave Chinner struct xfs_da_state *state, 129630f712c9SDave Chinner struct xfs_da_state_blk *oldblk, 129730f712c9SDave Chinner struct xfs_da_state_blk *newblk) 129830f712c9SDave Chinner { 129930f712c9SDave Chinner xfs_dablk_t blkno; 130030f712c9SDave Chinner int error; 130130f712c9SDave Chinner 130230f712c9SDave Chinner trace_xfs_attr_leaf_split(state->args); 130330f712c9SDave Chinner 130430f712c9SDave Chinner /* 130530f712c9SDave Chinner * Allocate space for a new leaf node. 130630f712c9SDave Chinner */ 130730f712c9SDave Chinner ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC); 130830f712c9SDave Chinner error = xfs_da_grow_inode(state->args, &blkno); 130930f712c9SDave Chinner if (error) 131030f712c9SDave Chinner return error; 131130f712c9SDave Chinner error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp); 131230f712c9SDave Chinner if (error) 131330f712c9SDave Chinner return error; 131430f712c9SDave Chinner newblk->blkno = blkno; 131530f712c9SDave Chinner newblk->magic = XFS_ATTR_LEAF_MAGIC; 131630f712c9SDave Chinner 131730f712c9SDave Chinner /* 131830f712c9SDave Chinner * Rebalance the entries across the two leaves. 131930f712c9SDave Chinner * NOTE: rebalance() currently depends on the 2nd block being empty. 132030f712c9SDave Chinner */ 132130f712c9SDave Chinner xfs_attr3_leaf_rebalance(state, oldblk, newblk); 132230f712c9SDave Chinner error = xfs_da3_blk_link(state, oldblk, newblk); 132330f712c9SDave Chinner if (error) 132430f712c9SDave Chinner return error; 132530f712c9SDave Chinner 132630f712c9SDave Chinner /* 132730f712c9SDave Chinner * Save info on "old" attribute for "atomic rename" ops, leaf_add() 132830f712c9SDave Chinner * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the 132930f712c9SDave Chinner * "new" attrs info. Will need the "old" info to remove it later. 133030f712c9SDave Chinner * 133130f712c9SDave Chinner * Insert the "new" entry in the correct block. 133230f712c9SDave Chinner */ 133330f712c9SDave Chinner if (state->inleaf) { 133430f712c9SDave Chinner trace_xfs_attr_leaf_add_old(state->args); 133530f712c9SDave Chinner error = xfs_attr3_leaf_add(oldblk->bp, state->args); 133630f712c9SDave Chinner } else { 133730f712c9SDave Chinner trace_xfs_attr_leaf_add_new(state->args); 133830f712c9SDave Chinner error = xfs_attr3_leaf_add(newblk->bp, state->args); 133930f712c9SDave Chinner } 134030f712c9SDave Chinner 134130f712c9SDave Chinner /* 134230f712c9SDave Chinner * Update last hashval in each block since we added the name. 134330f712c9SDave Chinner */ 134430f712c9SDave Chinner oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL); 134530f712c9SDave Chinner newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL); 134630f712c9SDave Chinner return error; 134730f712c9SDave Chinner } 134830f712c9SDave Chinner 134930f712c9SDave Chinner /* 135030f712c9SDave Chinner * Add a name to the leaf attribute list structure. 135130f712c9SDave Chinner */ 135230f712c9SDave Chinner int 135330f712c9SDave Chinner xfs_attr3_leaf_add( 135430f712c9SDave Chinner struct xfs_buf *bp, 135530f712c9SDave Chinner struct xfs_da_args *args) 135630f712c9SDave Chinner { 135730f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 135830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 135930f712c9SDave Chinner int tablesize; 136030f712c9SDave Chinner int entsize; 136130f712c9SDave Chinner int sum; 136230f712c9SDave Chinner int tmp; 136330f712c9SDave Chinner int i; 136430f712c9SDave Chinner 136530f712c9SDave Chinner trace_xfs_attr_leaf_add(args); 136630f712c9SDave Chinner 136730f712c9SDave Chinner leaf = bp->b_addr; 13682f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 136930f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr.count); 137030f712c9SDave Chinner entsize = xfs_attr_leaf_newentsize(args, NULL); 137130f712c9SDave Chinner 137230f712c9SDave Chinner /* 137330f712c9SDave Chinner * Search through freemap for first-fit on new name length. 137430f712c9SDave Chinner * (may need to figure in size of entry struct too) 137530f712c9SDave Chinner */ 137630f712c9SDave Chinner tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t) 137730f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 137830f712c9SDave Chinner for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) { 137930f712c9SDave Chinner if (tablesize > ichdr.firstused) { 138030f712c9SDave Chinner sum += ichdr.freemap[i].size; 138130f712c9SDave Chinner continue; 138230f712c9SDave Chinner } 138330f712c9SDave Chinner if (!ichdr.freemap[i].size) 138430f712c9SDave Chinner continue; /* no space in this map */ 138530f712c9SDave Chinner tmp = entsize; 138630f712c9SDave Chinner if (ichdr.freemap[i].base < ichdr.firstused) 138730f712c9SDave Chinner tmp += sizeof(xfs_attr_leaf_entry_t); 138830f712c9SDave Chinner if (ichdr.freemap[i].size >= tmp) { 138930f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i); 139030f712c9SDave Chinner goto out_log_hdr; 139130f712c9SDave Chinner } 139230f712c9SDave Chinner sum += ichdr.freemap[i].size; 139330f712c9SDave Chinner } 139430f712c9SDave Chinner 139530f712c9SDave Chinner /* 139630f712c9SDave Chinner * If there are no holes in the address space of the block, 139730f712c9SDave Chinner * and we don't have enough freespace, then compaction will do us 139830f712c9SDave Chinner * no good and we should just give up. 139930f712c9SDave Chinner */ 140030f712c9SDave Chinner if (!ichdr.holes && sum < entsize) 14012451337dSDave Chinner return -ENOSPC; 140230f712c9SDave Chinner 140330f712c9SDave Chinner /* 140430f712c9SDave Chinner * Compact the entries to coalesce free space. 140530f712c9SDave Chinner * This may change the hdr->count via dropping INCOMPLETE entries. 140630f712c9SDave Chinner */ 140730f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr, bp); 140830f712c9SDave Chinner 140930f712c9SDave Chinner /* 141030f712c9SDave Chinner * After compaction, the block is guaranteed to have only one 141130f712c9SDave Chinner * free region, in freemap[0]. If it is not big enough, give up. 141230f712c9SDave Chinner */ 141330f712c9SDave Chinner if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) { 14142451337dSDave Chinner tmp = -ENOSPC; 141530f712c9SDave Chinner goto out_log_hdr; 141630f712c9SDave Chinner } 141730f712c9SDave Chinner 141830f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0); 141930f712c9SDave Chinner 142030f712c9SDave Chinner out_log_hdr: 14212f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 142230f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 142330f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 142430f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 142530f712c9SDave Chinner return tmp; 142630f712c9SDave Chinner } 142730f712c9SDave Chinner 142830f712c9SDave Chinner /* 142930f712c9SDave Chinner * Add a name to a leaf attribute list structure. 143030f712c9SDave Chinner */ 143130f712c9SDave Chinner STATIC int 143230f712c9SDave Chinner xfs_attr3_leaf_add_work( 143330f712c9SDave Chinner struct xfs_buf *bp, 143430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 143530f712c9SDave Chinner struct xfs_da_args *args, 143630f712c9SDave Chinner int mapindex) 143730f712c9SDave Chinner { 143830f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 143930f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 144030f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 144130f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 144230f712c9SDave Chinner struct xfs_mount *mp; 144330f712c9SDave Chinner int tmp; 144430f712c9SDave Chinner int i; 144530f712c9SDave Chinner 144630f712c9SDave Chinner trace_xfs_attr_leaf_add_work(args); 144730f712c9SDave Chinner 144830f712c9SDave Chinner leaf = bp->b_addr; 144930f712c9SDave Chinner ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE); 145030f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr->count); 145130f712c9SDave Chinner 145230f712c9SDave Chinner /* 145330f712c9SDave Chinner * Force open some space in the entry array and fill it in. 145430f712c9SDave Chinner */ 145530f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 145630f712c9SDave Chinner if (args->index < ichdr->count) { 145730f712c9SDave Chinner tmp = ichdr->count - args->index; 145830f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 145930f712c9SDave Chinner memmove(entry + 1, entry, tmp); 146030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 146130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry))); 146230f712c9SDave Chinner } 146330f712c9SDave Chinner ichdr->count++; 146430f712c9SDave Chinner 146530f712c9SDave Chinner /* 146630f712c9SDave Chinner * Allocate space for the new string (at the end of the run). 146730f712c9SDave Chinner */ 146830f712c9SDave Chinner mp = args->trans->t_mountp; 146930f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize); 147030f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0); 147130f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size >= 147230f712c9SDave Chinner xfs_attr_leaf_newentsize(args, NULL)); 147330f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize); 147430f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0); 147530f712c9SDave Chinner 147630f712c9SDave Chinner ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp); 147730f712c9SDave Chinner 147830f712c9SDave Chinner entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base + 147930f712c9SDave Chinner ichdr->freemap[mapindex].size); 148030f712c9SDave Chinner entry->hashval = cpu_to_be32(args->hashval); 1481d5f0f49aSChristoph Hellwig entry->flags = args->attr_filter; 1482d5f0f49aSChristoph Hellwig if (tmp) 1483d5f0f49aSChristoph Hellwig entry->flags |= XFS_ATTR_LOCAL; 148430f712c9SDave Chinner if (args->op_flags & XFS_DA_OP_RENAME) { 148530f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 148630f712c9SDave Chinner if ((args->blkno2 == args->blkno) && 148730f712c9SDave Chinner (args->index2 <= args->index)) { 148830f712c9SDave Chinner args->index2++; 148930f712c9SDave Chinner } 149030f712c9SDave Chinner } 149130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 149230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 149330f712c9SDave Chinner ASSERT((args->index == 0) || 149430f712c9SDave Chinner (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval))); 149530f712c9SDave Chinner ASSERT((args->index == ichdr->count - 1) || 149630f712c9SDave Chinner (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval))); 149730f712c9SDave Chinner 149830f712c9SDave Chinner /* 149930f712c9SDave Chinner * For "remote" attribute values, simply note that we need to 150030f712c9SDave Chinner * allocate space for the "remote" value. We can't actually 150130f712c9SDave Chinner * allocate the extents in this transaction, and we can't decide 150230f712c9SDave Chinner * which blocks they should be as we might allocate more blocks 150330f712c9SDave Chinner * as part of this transaction (a split operation for example). 150430f712c9SDave Chinner */ 150530f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 150630f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 150730f712c9SDave Chinner name_loc->namelen = args->namelen; 150830f712c9SDave Chinner name_loc->valuelen = cpu_to_be16(args->valuelen); 150930f712c9SDave Chinner memcpy((char *)name_loc->nameval, args->name, args->namelen); 151030f712c9SDave Chinner memcpy((char *)&name_loc->nameval[args->namelen], args->value, 151130f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 151230f712c9SDave Chinner } else { 151330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 151430f712c9SDave Chinner name_rmt->namelen = args->namelen; 151530f712c9SDave Chinner memcpy((char *)name_rmt->name, args->name, args->namelen); 151630f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 151730f712c9SDave Chinner /* just in case */ 151830f712c9SDave Chinner name_rmt->valuelen = 0; 151930f712c9SDave Chinner name_rmt->valueblk = 0; 152030f712c9SDave Chinner args->rmtblkno = 1; 152130f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen); 152230f712c9SDave Chinner args->rmtvaluelen = args->valuelen; 152330f712c9SDave Chinner } 152430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 152530f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 152630f712c9SDave Chinner xfs_attr_leaf_entsize(leaf, args->index))); 152730f712c9SDave Chinner 152830f712c9SDave Chinner /* 152930f712c9SDave Chinner * Update the control info for this leaf node 153030f712c9SDave Chinner */ 153130f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < ichdr->firstused) 153230f712c9SDave Chinner ichdr->firstused = be16_to_cpu(entry->nameidx); 153330f712c9SDave Chinner 153430f712c9SDave Chinner ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t) 153530f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf)); 153630f712c9SDave Chinner tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t) 153730f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 153830f712c9SDave Chinner 153930f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 154030f712c9SDave Chinner if (ichdr->freemap[i].base == tmp) { 154130f712c9SDave Chinner ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t); 15422a2b5932SBrian Foster ichdr->freemap[i].size -= 15432a2b5932SBrian Foster min_t(uint16_t, ichdr->freemap[i].size, 15442a2b5932SBrian Foster sizeof(xfs_attr_leaf_entry_t)); 154530f712c9SDave Chinner } 154630f712c9SDave Chinner } 154730f712c9SDave Chinner ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index); 154830f712c9SDave Chinner return 0; 154930f712c9SDave Chinner } 155030f712c9SDave Chinner 155130f712c9SDave Chinner /* 155230f712c9SDave Chinner * Garbage collect a leaf attribute list block by copying it to a new buffer. 155330f712c9SDave Chinner */ 155430f712c9SDave Chinner STATIC void 155530f712c9SDave Chinner xfs_attr3_leaf_compact( 155630f712c9SDave Chinner struct xfs_da_args *args, 155730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_dst, 155830f712c9SDave Chinner struct xfs_buf *bp) 155930f712c9SDave Chinner { 156030f712c9SDave Chinner struct xfs_attr_leafblock *leaf_src; 156130f712c9SDave Chinner struct xfs_attr_leafblock *leaf_dst; 156230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr_src; 156330f712c9SDave Chinner struct xfs_trans *trans = args->trans; 156430f712c9SDave Chinner char *tmpbuffer; 156530f712c9SDave Chinner 156630f712c9SDave Chinner trace_xfs_attr_leaf_compact(args); 156730f712c9SDave Chinner 1568707e0ddaSTetsuo Handa tmpbuffer = kmem_alloc(args->geo->blksize, 0); 156930f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 157030f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 157130f712c9SDave Chinner leaf_src = (xfs_attr_leafblock_t *)tmpbuffer; 157230f712c9SDave Chinner leaf_dst = bp->b_addr; 157330f712c9SDave Chinner 157430f712c9SDave Chinner /* 157530f712c9SDave Chinner * Copy the on-disk header back into the destination buffer to ensure 157630f712c9SDave Chinner * all the information in the header that is not part of the incore 157730f712c9SDave Chinner * header structure is preserved. 157830f712c9SDave Chinner */ 157930f712c9SDave Chinner memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src)); 158030f712c9SDave Chinner 158130f712c9SDave Chinner /* Initialise the incore headers */ 158230f712c9SDave Chinner ichdr_src = *ichdr_dst; /* struct copy */ 158330f712c9SDave Chinner ichdr_dst->firstused = args->geo->blksize; 158430f712c9SDave Chinner ichdr_dst->usedbytes = 0; 158530f712c9SDave Chinner ichdr_dst->count = 0; 158630f712c9SDave Chinner ichdr_dst->holes = 0; 158730f712c9SDave Chinner ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src); 158830f712c9SDave Chinner ichdr_dst->freemap[0].size = ichdr_dst->firstused - 158930f712c9SDave Chinner ichdr_dst->freemap[0].base; 159030f712c9SDave Chinner 159130f712c9SDave Chinner /* write the header back to initialise the underlying buffer */ 15922f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst); 159330f712c9SDave Chinner 159430f712c9SDave Chinner /* 159530f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 159630f712c9SDave Chinner * but allocate name/value pairs packed and in sequence. 159730f712c9SDave Chinner */ 159830f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0, 159930f712c9SDave Chinner leaf_dst, ichdr_dst, 0, ichdr_src.count); 160030f712c9SDave Chinner /* 160130f712c9SDave Chinner * this logs the entire buffer, but the caller must write the header 160230f712c9SDave Chinner * back to the buffer when it is finished modifying it. 160330f712c9SDave Chinner */ 160430f712c9SDave Chinner xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1); 160530f712c9SDave Chinner 160630f712c9SDave Chinner kmem_free(tmpbuffer); 160730f712c9SDave Chinner } 160830f712c9SDave Chinner 160930f712c9SDave Chinner /* 161030f712c9SDave Chinner * Compare two leaf blocks "order". 161130f712c9SDave Chinner * Return 0 unless leaf2 should go before leaf1. 161230f712c9SDave Chinner */ 161330f712c9SDave Chinner static int 161430f712c9SDave Chinner xfs_attr3_leaf_order( 161530f712c9SDave Chinner struct xfs_buf *leaf1_bp, 161630f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf1hdr, 161730f712c9SDave Chinner struct xfs_buf *leaf2_bp, 161830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf2hdr) 161930f712c9SDave Chinner { 162030f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 162130f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 162230f712c9SDave Chinner 162330f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr); 162430f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr); 162530f712c9SDave Chinner if (leaf1hdr->count > 0 && leaf2hdr->count > 0 && 162630f712c9SDave Chinner ((be32_to_cpu(entries2[0].hashval) < 162730f712c9SDave Chinner be32_to_cpu(entries1[0].hashval)) || 162830f712c9SDave Chinner (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) < 162930f712c9SDave Chinner be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) { 163030f712c9SDave Chinner return 1; 163130f712c9SDave Chinner } 163230f712c9SDave Chinner return 0; 163330f712c9SDave Chinner } 163430f712c9SDave Chinner 163530f712c9SDave Chinner int 163630f712c9SDave Chinner xfs_attr_leaf_order( 163730f712c9SDave Chinner struct xfs_buf *leaf1_bp, 163830f712c9SDave Chinner struct xfs_buf *leaf2_bp) 163930f712c9SDave Chinner { 164030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 164130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 1642dbd329f1SChristoph Hellwig struct xfs_mount *mp = leaf1_bp->b_mount; 164330f712c9SDave Chinner 16442f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr); 16452f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr); 164630f712c9SDave Chinner return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2); 164730f712c9SDave Chinner } 164830f712c9SDave Chinner 164930f712c9SDave Chinner /* 165030f712c9SDave Chinner * Redistribute the attribute list entries between two leaf nodes, 165130f712c9SDave Chinner * taking into account the size of the new entry. 165230f712c9SDave Chinner * 165330f712c9SDave Chinner * NOTE: if new block is empty, then it will get the upper half of the 165430f712c9SDave Chinner * old block. At present, all (one) callers pass in an empty second block. 165530f712c9SDave Chinner * 165630f712c9SDave Chinner * This code adjusts the args->index/blkno and args->index2/blkno2 fields 165730f712c9SDave Chinner * to match what it is doing in splitting the attribute leaf block. Those 165830f712c9SDave Chinner * values are used in "atomic rename" operations on attributes. Note that 165930f712c9SDave Chinner * the "new" and "old" values can end up in different blocks. 166030f712c9SDave Chinner */ 166130f712c9SDave Chinner STATIC void 166230f712c9SDave Chinner xfs_attr3_leaf_rebalance( 166330f712c9SDave Chinner struct xfs_da_state *state, 166430f712c9SDave Chinner struct xfs_da_state_blk *blk1, 166530f712c9SDave Chinner struct xfs_da_state_blk *blk2) 166630f712c9SDave Chinner { 166730f712c9SDave Chinner struct xfs_da_args *args; 166830f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 166930f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 167030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 167130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 167230f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 167330f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 167430f712c9SDave Chinner int count; 167530f712c9SDave Chinner int totallen; 167630f712c9SDave Chinner int max; 167730f712c9SDave Chinner int space; 167830f712c9SDave Chinner int swap; 167930f712c9SDave Chinner 168030f712c9SDave Chinner /* 168130f712c9SDave Chinner * Set up environment. 168230f712c9SDave Chinner */ 168330f712c9SDave Chinner ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC); 168430f712c9SDave Chinner ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC); 168530f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 168630f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 16872f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1); 16882f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2); 168930f712c9SDave Chinner ASSERT(ichdr2.count == 0); 169030f712c9SDave Chinner args = state->args; 169130f712c9SDave Chinner 169230f712c9SDave Chinner trace_xfs_attr_leaf_rebalance(args); 169330f712c9SDave Chinner 169430f712c9SDave Chinner /* 169530f712c9SDave Chinner * Check ordering of blocks, reverse if it makes things simpler. 169630f712c9SDave Chinner * 169730f712c9SDave Chinner * NOTE: Given that all (current) callers pass in an empty 169830f712c9SDave Chinner * second block, this code should never set "swap". 169930f712c9SDave Chinner */ 170030f712c9SDave Chinner swap = 0; 170130f712c9SDave Chinner if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) { 17021d5bebbaSGustavo A. R. Silva swap(blk1, blk2); 170330f712c9SDave Chinner 17041d5bebbaSGustavo A. R. Silva /* swap structures rather than reconverting them */ 17051d5bebbaSGustavo A. R. Silva swap(ichdr1, ichdr2); 170630f712c9SDave Chinner 170730f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 170830f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 170930f712c9SDave Chinner swap = 1; 171030f712c9SDave Chinner } 171130f712c9SDave Chinner 171230f712c9SDave Chinner /* 171330f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 171430f712c9SDave Chinner * byte usage between the two blocks to a minimum. Then get 171530f712c9SDave Chinner * the direction to copy and the number of elements to move. 171630f712c9SDave Chinner * 171730f712c9SDave Chinner * "inleaf" is true if the new entry should be inserted into blk1. 171830f712c9SDave Chinner * If "swap" is also true, then reverse the sense of "inleaf". 171930f712c9SDave Chinner */ 172030f712c9SDave Chinner state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1, 172130f712c9SDave Chinner blk2, &ichdr2, 172230f712c9SDave Chinner &count, &totallen); 172330f712c9SDave Chinner if (swap) 172430f712c9SDave Chinner state->inleaf = !state->inleaf; 172530f712c9SDave Chinner 172630f712c9SDave Chinner /* 172730f712c9SDave Chinner * Move any entries required from leaf to leaf: 172830f712c9SDave Chinner */ 172930f712c9SDave Chinner if (count < ichdr1.count) { 173030f712c9SDave Chinner /* 173130f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 173230f712c9SDave Chinner */ 173330f712c9SDave Chinner /* number entries being moved */ 173430f712c9SDave Chinner count = ichdr1.count - count; 173530f712c9SDave Chinner space = ichdr1.usedbytes - totallen; 173630f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 173730f712c9SDave Chinner 173830f712c9SDave Chinner /* 173930f712c9SDave Chinner * leaf2 is the destination, compact it if it looks tight. 174030f712c9SDave Chinner */ 174130f712c9SDave Chinner max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1); 174230f712c9SDave Chinner max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t); 174330f712c9SDave Chinner if (space > max) 174430f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp); 174530f712c9SDave Chinner 174630f712c9SDave Chinner /* 174730f712c9SDave Chinner * Move high entries from leaf1 to low end of leaf2. 174830f712c9SDave Chinner */ 174930f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf1, &ichdr1, 175030f712c9SDave Chinner ichdr1.count - count, leaf2, &ichdr2, 0, count); 175130f712c9SDave Chinner 175230f712c9SDave Chinner } else if (count > ichdr1.count) { 175330f712c9SDave Chinner /* 175430f712c9SDave Chinner * I assert that since all callers pass in an empty 175530f712c9SDave Chinner * second buffer, this code should never execute. 175630f712c9SDave Chinner */ 175730f712c9SDave Chinner ASSERT(0); 175830f712c9SDave Chinner 175930f712c9SDave Chinner /* 176030f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 176130f712c9SDave Chinner */ 176230f712c9SDave Chinner /* number entries being moved */ 176330f712c9SDave Chinner count -= ichdr1.count; 176430f712c9SDave Chinner space = totallen - ichdr1.usedbytes; 176530f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 176630f712c9SDave Chinner 176730f712c9SDave Chinner /* 176830f712c9SDave Chinner * leaf1 is the destination, compact it if it looks tight. 176930f712c9SDave Chinner */ 177030f712c9SDave Chinner max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1); 177130f712c9SDave Chinner max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t); 177230f712c9SDave Chinner if (space > max) 177330f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp); 177430f712c9SDave Chinner 177530f712c9SDave Chinner /* 177630f712c9SDave Chinner * Move low entries from leaf2 to high end of leaf1. 177730f712c9SDave Chinner */ 177830f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1, 177930f712c9SDave Chinner ichdr1.count, count); 178030f712c9SDave Chinner } 178130f712c9SDave Chinner 17822f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1); 17832f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2); 178430f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1); 178530f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1); 178630f712c9SDave Chinner 178730f712c9SDave Chinner /* 178830f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 178930f712c9SDave Chinner */ 179030f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1); 179130f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2); 179230f712c9SDave Chinner blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval); 179330f712c9SDave Chinner blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval); 179430f712c9SDave Chinner 179530f712c9SDave Chinner /* 179630f712c9SDave Chinner * Adjust the expected index for insertion. 179730f712c9SDave Chinner * NOTE: this code depends on the (current) situation that the 179830f712c9SDave Chinner * second block was originally empty. 179930f712c9SDave Chinner * 180030f712c9SDave Chinner * If the insertion point moved to the 2nd block, we must adjust 180130f712c9SDave Chinner * the index. We must also track the entry just following the 180230f712c9SDave Chinner * new entry for use in an "atomic rename" operation, that entry 180330f712c9SDave Chinner * is always the "old" entry and the "new" entry is what we are 180430f712c9SDave Chinner * inserting. The index/blkno fields refer to the "old" entry, 180530f712c9SDave Chinner * while the index2/blkno2 fields refer to the "new" entry. 180630f712c9SDave Chinner */ 180730f712c9SDave Chinner if (blk1->index > ichdr1.count) { 180830f712c9SDave Chinner ASSERT(state->inleaf == 0); 180930f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 181030f712c9SDave Chinner args->index = args->index2 = blk2->index; 181130f712c9SDave Chinner args->blkno = args->blkno2 = blk2->blkno; 181230f712c9SDave Chinner } else if (blk1->index == ichdr1.count) { 181330f712c9SDave Chinner if (state->inleaf) { 181430f712c9SDave Chinner args->index = blk1->index; 181530f712c9SDave Chinner args->blkno = blk1->blkno; 181630f712c9SDave Chinner args->index2 = 0; 181730f712c9SDave Chinner args->blkno2 = blk2->blkno; 181830f712c9SDave Chinner } else { 181930f712c9SDave Chinner /* 182030f712c9SDave Chinner * On a double leaf split, the original attr location 182130f712c9SDave Chinner * is already stored in blkno2/index2, so don't 182230f712c9SDave Chinner * overwrite it overwise we corrupt the tree. 182330f712c9SDave Chinner */ 182430f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 182530f712c9SDave Chinner args->index = blk2->index; 182630f712c9SDave Chinner args->blkno = blk2->blkno; 182730f712c9SDave Chinner if (!state->extravalid) { 182830f712c9SDave Chinner /* 182930f712c9SDave Chinner * set the new attr location to match the old 183030f712c9SDave Chinner * one and let the higher level split code 183130f712c9SDave Chinner * decide where in the leaf to place it. 183230f712c9SDave Chinner */ 183330f712c9SDave Chinner args->index2 = blk2->index; 183430f712c9SDave Chinner args->blkno2 = blk2->blkno; 183530f712c9SDave Chinner } 183630f712c9SDave Chinner } 183730f712c9SDave Chinner } else { 183830f712c9SDave Chinner ASSERT(state->inleaf == 1); 183930f712c9SDave Chinner args->index = args->index2 = blk1->index; 184030f712c9SDave Chinner args->blkno = args->blkno2 = blk1->blkno; 184130f712c9SDave Chinner } 184230f712c9SDave Chinner } 184330f712c9SDave Chinner 184430f712c9SDave Chinner /* 184530f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 184630f712c9SDave Chinner * byte usage between the two blocks to a minimum. 184730f712c9SDave Chinner * GROT: Is this really necessary? With other than a 512 byte blocksize, 184830f712c9SDave Chinner * GROT: there will always be enough room in either block for a new entry. 184930f712c9SDave Chinner * GROT: Do a double-split for this case? 185030f712c9SDave Chinner */ 185130f712c9SDave Chinner STATIC int 185230f712c9SDave Chinner xfs_attr3_leaf_figure_balance( 185330f712c9SDave Chinner struct xfs_da_state *state, 185430f712c9SDave Chinner struct xfs_da_state_blk *blk1, 185530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 185630f712c9SDave Chinner struct xfs_da_state_blk *blk2, 185730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 185830f712c9SDave Chinner int *countarg, 185930f712c9SDave Chinner int *usedbytesarg) 186030f712c9SDave Chinner { 186130f712c9SDave Chinner struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr; 186230f712c9SDave Chinner struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr; 186330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 186430f712c9SDave Chinner int count; 186530f712c9SDave Chinner int max; 186630f712c9SDave Chinner int index; 186730f712c9SDave Chinner int totallen = 0; 186830f712c9SDave Chinner int half; 186930f712c9SDave Chinner int lastdelta; 187030f712c9SDave Chinner int foundit = 0; 187130f712c9SDave Chinner int tmp; 187230f712c9SDave Chinner 187330f712c9SDave Chinner /* 187430f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 187530f712c9SDave Chinner * byte usage between the two blocks to a minimum. 187630f712c9SDave Chinner */ 187730f712c9SDave Chinner max = ichdr1->count + ichdr2->count; 187830f712c9SDave Chinner half = (max + 1) * sizeof(*entry); 187930f712c9SDave Chinner half += ichdr1->usedbytes + ichdr2->usedbytes + 188030f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 188130f712c9SDave Chinner half /= 2; 188230f712c9SDave Chinner lastdelta = state->args->geo->blksize; 188330f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 188430f712c9SDave Chinner for (count = index = 0; count < max; entry++, index++, count++) { 188530f712c9SDave Chinner 188630f712c9SDave Chinner #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A)) 188730f712c9SDave Chinner /* 188830f712c9SDave Chinner * The new entry is in the first block, account for it. 188930f712c9SDave Chinner */ 189030f712c9SDave Chinner if (count == blk1->index) { 189130f712c9SDave Chinner tmp = totallen + sizeof(*entry) + 189230f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 189330f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 189430f712c9SDave Chinner break; 189530f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 189630f712c9SDave Chinner totallen = tmp; 189730f712c9SDave Chinner foundit = 1; 189830f712c9SDave Chinner } 189930f712c9SDave Chinner 190030f712c9SDave Chinner /* 190130f712c9SDave Chinner * Wrap around into the second block if necessary. 190230f712c9SDave Chinner */ 190330f712c9SDave Chinner if (count == ichdr1->count) { 190430f712c9SDave Chinner leaf1 = leaf2; 190530f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 190630f712c9SDave Chinner index = 0; 190730f712c9SDave Chinner } 190830f712c9SDave Chinner 190930f712c9SDave Chinner /* 191030f712c9SDave Chinner * Figure out if next leaf entry would be too much. 191130f712c9SDave Chinner */ 191230f712c9SDave Chinner tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1, 191330f712c9SDave Chinner index); 191430f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 191530f712c9SDave Chinner break; 191630f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 191730f712c9SDave Chinner totallen = tmp; 191830f712c9SDave Chinner #undef XFS_ATTR_ABS 191930f712c9SDave Chinner } 192030f712c9SDave Chinner 192130f712c9SDave Chinner /* 192230f712c9SDave Chinner * Calculate the number of usedbytes that will end up in lower block. 192330f712c9SDave Chinner * If new entry not in lower block, fix up the count. 192430f712c9SDave Chinner */ 192530f712c9SDave Chinner totallen -= count * sizeof(*entry); 192630f712c9SDave Chinner if (foundit) { 192730f712c9SDave Chinner totallen -= sizeof(*entry) + 192830f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 192930f712c9SDave Chinner } 193030f712c9SDave Chinner 193130f712c9SDave Chinner *countarg = count; 193230f712c9SDave Chinner *usedbytesarg = totallen; 193330f712c9SDave Chinner return foundit; 193430f712c9SDave Chinner } 193530f712c9SDave Chinner 193630f712c9SDave Chinner /*======================================================================== 193730f712c9SDave Chinner * Routines used for shrinking the Btree. 193830f712c9SDave Chinner *========================================================================*/ 193930f712c9SDave Chinner 194030f712c9SDave Chinner /* 194130f712c9SDave Chinner * Check a leaf block and its neighbors to see if the block should be 194230f712c9SDave Chinner * collapsed into one or the other neighbor. Always keep the block 194330f712c9SDave Chinner * with the smaller block number. 194430f712c9SDave Chinner * If the current block is over 50% full, don't try to join it, return 0. 194530f712c9SDave Chinner * If the block is empty, fill in the state structure and return 2. 194630f712c9SDave Chinner * If it can be collapsed, fill in the state structure and return 1. 194730f712c9SDave Chinner * If nothing can be done, return 0. 194830f712c9SDave Chinner * 194930f712c9SDave Chinner * GROT: allow for INCOMPLETE entries in calculation. 195030f712c9SDave Chinner */ 195130f712c9SDave Chinner int 195230f712c9SDave Chinner xfs_attr3_leaf_toosmall( 195330f712c9SDave Chinner struct xfs_da_state *state, 195430f712c9SDave Chinner int *action) 195530f712c9SDave Chinner { 195630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 195730f712c9SDave Chinner struct xfs_da_state_blk *blk; 195830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 195930f712c9SDave Chinner struct xfs_buf *bp; 196030f712c9SDave Chinner xfs_dablk_t blkno; 196130f712c9SDave Chinner int bytes; 196230f712c9SDave Chinner int forward; 196330f712c9SDave Chinner int error; 196430f712c9SDave Chinner int retval; 196530f712c9SDave Chinner int i; 196630f712c9SDave Chinner 196730f712c9SDave Chinner trace_xfs_attr_leaf_toosmall(state->args); 196830f712c9SDave Chinner 196930f712c9SDave Chinner /* 197030f712c9SDave Chinner * Check for the degenerate case of the block being over 50% full. 197130f712c9SDave Chinner * If so, it's not worth even looking to see if we might be able 197230f712c9SDave Chinner * to coalesce with a sibling. 197330f712c9SDave Chinner */ 197430f712c9SDave Chinner blk = &state->path.blk[ state->path.active-1 ]; 197530f712c9SDave Chinner leaf = blk->bp->b_addr; 19762f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf); 197730f712c9SDave Chinner bytes = xfs_attr3_leaf_hdr_size(leaf) + 197830f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t) + 197930f712c9SDave Chinner ichdr.usedbytes; 198030f712c9SDave Chinner if (bytes > (state->args->geo->blksize >> 1)) { 198130f712c9SDave Chinner *action = 0; /* blk over 50%, don't try to join */ 198230f712c9SDave Chinner return 0; 198330f712c9SDave Chinner } 198430f712c9SDave Chinner 198530f712c9SDave Chinner /* 198630f712c9SDave Chinner * Check for the degenerate case of the block being empty. 198730f712c9SDave Chinner * If the block is empty, we'll simply delete it, no need to 198830f712c9SDave Chinner * coalesce it with a sibling block. We choose (arbitrarily) 198930f712c9SDave Chinner * to merge with the forward block unless it is NULL. 199030f712c9SDave Chinner */ 199130f712c9SDave Chinner if (ichdr.count == 0) { 199230f712c9SDave Chinner /* 199330f712c9SDave Chinner * Make altpath point to the block we want to keep and 199430f712c9SDave Chinner * path point to the block we want to drop (this one). 199530f712c9SDave Chinner */ 199630f712c9SDave Chinner forward = (ichdr.forw != 0); 199730f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 199830f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 199930f712c9SDave Chinner 0, &retval); 200030f712c9SDave Chinner if (error) 200130f712c9SDave Chinner return error; 200230f712c9SDave Chinner if (retval) { 200330f712c9SDave Chinner *action = 0; 200430f712c9SDave Chinner } else { 200530f712c9SDave Chinner *action = 2; 200630f712c9SDave Chinner } 200730f712c9SDave Chinner return 0; 200830f712c9SDave Chinner } 200930f712c9SDave Chinner 201030f712c9SDave Chinner /* 201130f712c9SDave Chinner * Examine each sibling block to see if we can coalesce with 201230f712c9SDave Chinner * at least 25% free space to spare. We need to figure out 201330f712c9SDave Chinner * whether to merge with the forward or the backward block. 201430f712c9SDave Chinner * We prefer coalescing with the lower numbered sibling so as 201530f712c9SDave Chinner * to shrink an attribute list over time. 201630f712c9SDave Chinner */ 201730f712c9SDave Chinner /* start with smaller blk num */ 201830f712c9SDave Chinner forward = ichdr.forw < ichdr.back; 201930f712c9SDave Chinner for (i = 0; i < 2; forward = !forward, i++) { 202030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 202130f712c9SDave Chinner if (forward) 202230f712c9SDave Chinner blkno = ichdr.forw; 202330f712c9SDave Chinner else 202430f712c9SDave Chinner blkno = ichdr.back; 202530f712c9SDave Chinner if (blkno == 0) 202630f712c9SDave Chinner continue; 202730f712c9SDave Chinner error = xfs_attr3_leaf_read(state->args->trans, state->args->dp, 2028dfb87594SChristoph Hellwig blkno, &bp); 202930f712c9SDave Chinner if (error) 203030f712c9SDave Chinner return error; 203130f712c9SDave Chinner 20322f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr); 203330f712c9SDave Chinner 203430f712c9SDave Chinner bytes = state->args->geo->blksize - 203530f712c9SDave Chinner (state->args->geo->blksize >> 2) - 203630f712c9SDave Chinner ichdr.usedbytes - ichdr2.usedbytes - 203730f712c9SDave Chinner ((ichdr.count + ichdr2.count) * 203830f712c9SDave Chinner sizeof(xfs_attr_leaf_entry_t)) - 203930f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf); 204030f712c9SDave Chinner 204130f712c9SDave Chinner xfs_trans_brelse(state->args->trans, bp); 204230f712c9SDave Chinner if (bytes >= 0) 204330f712c9SDave Chinner break; /* fits with at least 25% to spare */ 204430f712c9SDave Chinner } 204530f712c9SDave Chinner if (i >= 2) { 204630f712c9SDave Chinner *action = 0; 204730f712c9SDave Chinner return 0; 204830f712c9SDave Chinner } 204930f712c9SDave Chinner 205030f712c9SDave Chinner /* 205130f712c9SDave Chinner * Make altpath point to the block we want to keep (the lower 205230f712c9SDave Chinner * numbered block) and path point to the block we want to drop. 205330f712c9SDave Chinner */ 205430f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 205530f712c9SDave Chinner if (blkno < blk->blkno) { 205630f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 205730f712c9SDave Chinner 0, &retval); 205830f712c9SDave Chinner } else { 205930f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->path, forward, 206030f712c9SDave Chinner 0, &retval); 206130f712c9SDave Chinner } 206230f712c9SDave Chinner if (error) 206330f712c9SDave Chinner return error; 206430f712c9SDave Chinner if (retval) { 206530f712c9SDave Chinner *action = 0; 206630f712c9SDave Chinner } else { 206730f712c9SDave Chinner *action = 1; 206830f712c9SDave Chinner } 206930f712c9SDave Chinner return 0; 207030f712c9SDave Chinner } 207130f712c9SDave Chinner 207230f712c9SDave Chinner /* 207330f712c9SDave Chinner * Remove a name from the leaf attribute list structure. 207430f712c9SDave Chinner * 207530f712c9SDave Chinner * Return 1 if leaf is less than 37% full, 0 if >= 37% full. 207630f712c9SDave Chinner * If two leaves are 37% full, when combined they will leave 25% free. 207730f712c9SDave Chinner */ 207830f712c9SDave Chinner int 207930f712c9SDave Chinner xfs_attr3_leaf_remove( 208030f712c9SDave Chinner struct xfs_buf *bp, 208130f712c9SDave Chinner struct xfs_da_args *args) 208230f712c9SDave Chinner { 208330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 208430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 208530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 208630f712c9SDave Chinner int before; 208730f712c9SDave Chinner int after; 208830f712c9SDave Chinner int smallest; 208930f712c9SDave Chinner int entsize; 209030f712c9SDave Chinner int tablesize; 209130f712c9SDave Chinner int tmp; 209230f712c9SDave Chinner int i; 209330f712c9SDave Chinner 209430f712c9SDave Chinner trace_xfs_attr_leaf_remove(args); 209530f712c9SDave Chinner 209630f712c9SDave Chinner leaf = bp->b_addr; 20972f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 209830f712c9SDave Chinner 209930f712c9SDave Chinner ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8); 210030f712c9SDave Chinner ASSERT(args->index >= 0 && args->index < ichdr.count); 210130f712c9SDave Chinner ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) + 210230f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf)); 210330f712c9SDave Chinner 210430f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 210530f712c9SDave Chinner 210630f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 210730f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 210830f712c9SDave Chinner 210930f712c9SDave Chinner /* 211030f712c9SDave Chinner * Scan through free region table: 211130f712c9SDave Chinner * check for adjacency of free'd entry with an existing one, 211230f712c9SDave Chinner * find smallest free region in case we need to replace it, 211330f712c9SDave Chinner * adjust any map that borders the entry table, 211430f712c9SDave Chinner */ 211530f712c9SDave Chinner tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t) 211630f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 211730f712c9SDave Chinner tmp = ichdr.freemap[0].size; 211830f712c9SDave Chinner before = after = -1; 211930f712c9SDave Chinner smallest = XFS_ATTR_LEAF_MAPSIZE - 1; 212030f712c9SDave Chinner entsize = xfs_attr_leaf_entsize(leaf, args->index); 212130f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 212230f712c9SDave Chinner ASSERT(ichdr.freemap[i].base < args->geo->blksize); 212330f712c9SDave Chinner ASSERT(ichdr.freemap[i].size < args->geo->blksize); 212430f712c9SDave Chinner if (ichdr.freemap[i].base == tablesize) { 212530f712c9SDave Chinner ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t); 212630f712c9SDave Chinner ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t); 212730f712c9SDave Chinner } 212830f712c9SDave Chinner 212930f712c9SDave Chinner if (ichdr.freemap[i].base + ichdr.freemap[i].size == 213030f712c9SDave Chinner be16_to_cpu(entry->nameidx)) { 213130f712c9SDave Chinner before = i; 213230f712c9SDave Chinner } else if (ichdr.freemap[i].base == 213330f712c9SDave Chinner (be16_to_cpu(entry->nameidx) + entsize)) { 213430f712c9SDave Chinner after = i; 213530f712c9SDave Chinner } else if (ichdr.freemap[i].size < tmp) { 213630f712c9SDave Chinner tmp = ichdr.freemap[i].size; 213730f712c9SDave Chinner smallest = i; 213830f712c9SDave Chinner } 213930f712c9SDave Chinner } 214030f712c9SDave Chinner 214130f712c9SDave Chinner /* 214230f712c9SDave Chinner * Coalesce adjacent freemap regions, 214330f712c9SDave Chinner * or replace the smallest region. 214430f712c9SDave Chinner */ 214530f712c9SDave Chinner if ((before >= 0) || (after >= 0)) { 214630f712c9SDave Chinner if ((before >= 0) && (after >= 0)) { 214730f712c9SDave Chinner ichdr.freemap[before].size += entsize; 214830f712c9SDave Chinner ichdr.freemap[before].size += ichdr.freemap[after].size; 214930f712c9SDave Chinner ichdr.freemap[after].base = 0; 215030f712c9SDave Chinner ichdr.freemap[after].size = 0; 215130f712c9SDave Chinner } else if (before >= 0) { 215230f712c9SDave Chinner ichdr.freemap[before].size += entsize; 215330f712c9SDave Chinner } else { 215430f712c9SDave Chinner ichdr.freemap[after].base = be16_to_cpu(entry->nameidx); 215530f712c9SDave Chinner ichdr.freemap[after].size += entsize; 215630f712c9SDave Chinner } 215730f712c9SDave Chinner } else { 215830f712c9SDave Chinner /* 215930f712c9SDave Chinner * Replace smallest region (if it is smaller than free'd entry) 216030f712c9SDave Chinner */ 216130f712c9SDave Chinner if (ichdr.freemap[smallest].size < entsize) { 216230f712c9SDave Chinner ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx); 216330f712c9SDave Chinner ichdr.freemap[smallest].size = entsize; 216430f712c9SDave Chinner } 216530f712c9SDave Chinner } 216630f712c9SDave Chinner 216730f712c9SDave Chinner /* 216830f712c9SDave Chinner * Did we remove the first entry? 216930f712c9SDave Chinner */ 217030f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) == ichdr.firstused) 217130f712c9SDave Chinner smallest = 1; 217230f712c9SDave Chinner else 217330f712c9SDave Chinner smallest = 0; 217430f712c9SDave Chinner 217530f712c9SDave Chinner /* 217630f712c9SDave Chinner * Compress the remaining entries and zero out the removed stuff. 217730f712c9SDave Chinner */ 217830f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize); 217930f712c9SDave Chinner ichdr.usedbytes -= entsize; 218030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 218130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 218230f712c9SDave Chinner entsize)); 218330f712c9SDave Chinner 218430f712c9SDave Chinner tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t); 218530f712c9SDave Chinner memmove(entry, entry + 1, tmp); 218630f712c9SDave Chinner ichdr.count--; 218730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 218830f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t))); 218930f712c9SDave Chinner 219030f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count]; 219130f712c9SDave Chinner memset(entry, 0, sizeof(xfs_attr_leaf_entry_t)); 219230f712c9SDave Chinner 219330f712c9SDave Chinner /* 219430f712c9SDave Chinner * If we removed the first entry, re-find the first used byte 219530f712c9SDave Chinner * in the name area. Note that if the entry was the "firstused", 219630f712c9SDave Chinner * then we don't have a "hole" in our block resulting from 219730f712c9SDave Chinner * removing the name. 219830f712c9SDave Chinner */ 219930f712c9SDave Chinner if (smallest) { 220030f712c9SDave Chinner tmp = args->geo->blksize; 220130f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 220230f712c9SDave Chinner for (i = ichdr.count - 1; i >= 0; entry++, i--) { 220330f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 220430f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 220530f712c9SDave Chinner 220630f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < tmp) 220730f712c9SDave Chinner tmp = be16_to_cpu(entry->nameidx); 220830f712c9SDave Chinner } 220930f712c9SDave Chinner ichdr.firstused = tmp; 221066db8104SBrian Foster ASSERT(ichdr.firstused != 0); 221130f712c9SDave Chinner } else { 221230f712c9SDave Chinner ichdr.holes = 1; /* mark as needing compaction */ 221330f712c9SDave Chinner } 22142f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 221530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 221630f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 221730f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 221830f712c9SDave Chinner 221930f712c9SDave Chinner /* 222030f712c9SDave Chinner * Check if leaf is less than 50% full, caller may want to 222130f712c9SDave Chinner * "join" the leaf with a sibling if so. 222230f712c9SDave Chinner */ 222330f712c9SDave Chinner tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) + 222430f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t); 222530f712c9SDave Chinner 222630f712c9SDave Chinner return tmp < args->geo->magicpct; /* leaf is < 37% full */ 222730f712c9SDave Chinner } 222830f712c9SDave Chinner 222930f712c9SDave Chinner /* 223030f712c9SDave Chinner * Move all the attribute list entries from drop_leaf into save_leaf. 223130f712c9SDave Chinner */ 223230f712c9SDave Chinner void 223330f712c9SDave Chinner xfs_attr3_leaf_unbalance( 223430f712c9SDave Chinner struct xfs_da_state *state, 223530f712c9SDave Chinner struct xfs_da_state_blk *drop_blk, 223630f712c9SDave Chinner struct xfs_da_state_blk *save_blk) 223730f712c9SDave Chinner { 223830f712c9SDave Chinner struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr; 223930f712c9SDave Chinner struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr; 224030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr drophdr; 224130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr savehdr; 224230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 224330f712c9SDave Chinner 224430f712c9SDave Chinner trace_xfs_attr_leaf_unbalance(state->args); 224530f712c9SDave Chinner 224630f712c9SDave Chinner drop_leaf = drop_blk->bp->b_addr; 224730f712c9SDave Chinner save_leaf = save_blk->bp->b_addr; 22482f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf); 22492f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf); 225030f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(drop_leaf); 225130f712c9SDave Chinner 225230f712c9SDave Chinner /* 225330f712c9SDave Chinner * Save last hashval from dying block for later Btree fixup. 225430f712c9SDave Chinner */ 225530f712c9SDave Chinner drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval); 225630f712c9SDave Chinner 225730f712c9SDave Chinner /* 225830f712c9SDave Chinner * Check if we need a temp buffer, or can we do it in place. 225930f712c9SDave Chinner * Note that we don't check "leaf" for holes because we will 226030f712c9SDave Chinner * always be dropping it, toosmall() decided that for us already. 226130f712c9SDave Chinner */ 226230f712c9SDave Chinner if (savehdr.holes == 0) { 226330f712c9SDave Chinner /* 226430f712c9SDave Chinner * dest leaf has no holes, so we add there. May need 226530f712c9SDave Chinner * to make some room in the entry array. 226630f712c9SDave Chinner */ 226730f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 226830f712c9SDave Chinner drop_blk->bp, &drophdr)) { 226930f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 227030f712c9SDave Chinner drop_leaf, &drophdr, 0, 227130f712c9SDave Chinner save_leaf, &savehdr, 0, 227230f712c9SDave Chinner drophdr.count); 227330f712c9SDave Chinner } else { 227430f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 227530f712c9SDave Chinner drop_leaf, &drophdr, 0, 227630f712c9SDave Chinner save_leaf, &savehdr, 227730f712c9SDave Chinner savehdr.count, drophdr.count); 227830f712c9SDave Chinner } 227930f712c9SDave Chinner } else { 228030f712c9SDave Chinner /* 228130f712c9SDave Chinner * Destination has holes, so we make a temporary copy 228230f712c9SDave Chinner * of the leaf and add them both to that. 228330f712c9SDave Chinner */ 228430f712c9SDave Chinner struct xfs_attr_leafblock *tmp_leaf; 228530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr tmphdr; 228630f712c9SDave Chinner 2287707e0ddaSTetsuo Handa tmp_leaf = kmem_zalloc(state->args->geo->blksize, 0); 228830f712c9SDave Chinner 228930f712c9SDave Chinner /* 229030f712c9SDave Chinner * Copy the header into the temp leaf so that all the stuff 229130f712c9SDave Chinner * not in the incore header is present and gets copied back in 229230f712c9SDave Chinner * once we've moved all the entries. 229330f712c9SDave Chinner */ 229430f712c9SDave Chinner memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf)); 229530f712c9SDave Chinner 229630f712c9SDave Chinner memset(&tmphdr, 0, sizeof(tmphdr)); 229730f712c9SDave Chinner tmphdr.magic = savehdr.magic; 229830f712c9SDave Chinner tmphdr.forw = savehdr.forw; 229930f712c9SDave Chinner tmphdr.back = savehdr.back; 230030f712c9SDave Chinner tmphdr.firstused = state->args->geo->blksize; 230130f712c9SDave Chinner 230230f712c9SDave Chinner /* write the header to the temp buffer to initialise it */ 23032f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr); 230430f712c9SDave Chinner 230530f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 230630f712c9SDave Chinner drop_blk->bp, &drophdr)) { 230730f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 230830f712c9SDave Chinner drop_leaf, &drophdr, 0, 230930f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 231030f712c9SDave Chinner drophdr.count); 231130f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 231230f712c9SDave Chinner save_leaf, &savehdr, 0, 231330f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 231430f712c9SDave Chinner savehdr.count); 231530f712c9SDave Chinner } else { 231630f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 231730f712c9SDave Chinner save_leaf, &savehdr, 0, 231830f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 231930f712c9SDave Chinner savehdr.count); 232030f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 232130f712c9SDave Chinner drop_leaf, &drophdr, 0, 232230f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 232330f712c9SDave Chinner drophdr.count); 232430f712c9SDave Chinner } 232530f712c9SDave Chinner memcpy(save_leaf, tmp_leaf, state->args->geo->blksize); 232630f712c9SDave Chinner savehdr = tmphdr; /* struct copy */ 232730f712c9SDave Chinner kmem_free(tmp_leaf); 232830f712c9SDave Chinner } 232930f712c9SDave Chinner 23302f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr); 233130f712c9SDave Chinner xfs_trans_log_buf(state->args->trans, save_blk->bp, 0, 233230f712c9SDave Chinner state->args->geo->blksize - 1); 233330f712c9SDave Chinner 233430f712c9SDave Chinner /* 233530f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 233630f712c9SDave Chinner */ 233730f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(save_leaf); 233830f712c9SDave Chinner save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval); 233930f712c9SDave Chinner } 234030f712c9SDave Chinner 234130f712c9SDave Chinner /*======================================================================== 234230f712c9SDave Chinner * Routines used for finding things in the Btree. 234330f712c9SDave Chinner *========================================================================*/ 234430f712c9SDave Chinner 234530f712c9SDave Chinner /* 234630f712c9SDave Chinner * Look up a name in a leaf attribute list structure. 234730f712c9SDave Chinner * This is the internal routine, it uses the caller's buffer. 234830f712c9SDave Chinner * 234930f712c9SDave Chinner * Note that duplicate keys are allowed, but only check within the 235030f712c9SDave Chinner * current leaf node. The Btree code must check in adjacent leaf nodes. 235130f712c9SDave Chinner * 235230f712c9SDave Chinner * Return in args->index the index into the entry[] array of either 235330f712c9SDave Chinner * the found entry, or where the entry should have been (insert before 235430f712c9SDave Chinner * that entry). 235530f712c9SDave Chinner * 235630f712c9SDave Chinner * Don't change the args->value unless we find the attribute. 235730f712c9SDave Chinner */ 235830f712c9SDave Chinner int 235930f712c9SDave Chinner xfs_attr3_leaf_lookup_int( 236030f712c9SDave Chinner struct xfs_buf *bp, 236130f712c9SDave Chinner struct xfs_da_args *args) 236230f712c9SDave Chinner { 236330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 236430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 236530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 236630f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 236730f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 236830f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 236930f712c9SDave Chinner xfs_dahash_t hashval; 237030f712c9SDave Chinner int probe; 237130f712c9SDave Chinner int span; 237230f712c9SDave Chinner 237330f712c9SDave Chinner trace_xfs_attr_leaf_lookup(args); 237430f712c9SDave Chinner 237530f712c9SDave Chinner leaf = bp->b_addr; 23762f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 237730f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 2378a5155b87SDarrick J. Wong if (ichdr.count >= args->geo->blksize / 8) { 23798d57c216SDarrick J. Wong xfs_buf_mark_corrupt(bp); 23808ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2381a5155b87SDarrick J. Wong } 238230f712c9SDave Chinner 238330f712c9SDave Chinner /* 238430f712c9SDave Chinner * Binary search. (note: small blocks will skip this loop) 238530f712c9SDave Chinner */ 238630f712c9SDave Chinner hashval = args->hashval; 238730f712c9SDave Chinner probe = span = ichdr.count / 2; 238830f712c9SDave Chinner for (entry = &entries[probe]; span > 4; entry = &entries[probe]) { 238930f712c9SDave Chinner span /= 2; 239030f712c9SDave Chinner if (be32_to_cpu(entry->hashval) < hashval) 239130f712c9SDave Chinner probe += span; 239230f712c9SDave Chinner else if (be32_to_cpu(entry->hashval) > hashval) 239330f712c9SDave Chinner probe -= span; 239430f712c9SDave Chinner else 239530f712c9SDave Chinner break; 239630f712c9SDave Chinner } 2397a5155b87SDarrick J. Wong if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count))) { 23988d57c216SDarrick J. Wong xfs_buf_mark_corrupt(bp); 23998ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2400a5155b87SDarrick J. Wong } 2401a5155b87SDarrick J. Wong if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval)) { 24028d57c216SDarrick J. Wong xfs_buf_mark_corrupt(bp); 24038ba92d43SDarrick J. Wong return -EFSCORRUPTED; 2404a5155b87SDarrick J. Wong } 240530f712c9SDave Chinner 240630f712c9SDave Chinner /* 240730f712c9SDave Chinner * Since we may have duplicate hashval's, find the first matching 240830f712c9SDave Chinner * hashval in the leaf. 240930f712c9SDave Chinner */ 241030f712c9SDave Chinner while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) { 241130f712c9SDave Chinner entry--; 241230f712c9SDave Chinner probe--; 241330f712c9SDave Chinner } 241430f712c9SDave Chinner while (probe < ichdr.count && 241530f712c9SDave Chinner be32_to_cpu(entry->hashval) < hashval) { 241630f712c9SDave Chinner entry++; 241730f712c9SDave Chinner probe++; 241830f712c9SDave Chinner } 241930f712c9SDave Chinner if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) { 242030f712c9SDave Chinner args->index = probe; 24212451337dSDave Chinner return -ENOATTR; 242230f712c9SDave Chinner } 242330f712c9SDave Chinner 242430f712c9SDave Chinner /* 242530f712c9SDave Chinner * Duplicate keys may be present, so search all of them for a match. 242630f712c9SDave Chinner */ 242730f712c9SDave Chinner for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval); 242830f712c9SDave Chinner entry++, probe++) { 242930f712c9SDave Chinner /* 243030f712c9SDave Chinner * GROT: Add code to remove incomplete entries. 243130f712c9SDave Chinner */ 243230f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 243330f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, probe); 2434377f16acSChristoph Hellwig if (!xfs_attr_match(args, name_loc->namelen, 2435377f16acSChristoph Hellwig name_loc->nameval, entry->flags)) 243630f712c9SDave Chinner continue; 243730f712c9SDave Chinner args->index = probe; 24382451337dSDave Chinner return -EEXIST; 243930f712c9SDave Chinner } else { 244030f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, probe); 2441377f16acSChristoph Hellwig if (!xfs_attr_match(args, name_rmt->namelen, 2442377f16acSChristoph Hellwig name_rmt->name, entry->flags)) 244330f712c9SDave Chinner continue; 244430f712c9SDave Chinner args->index = probe; 244530f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 244630f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 244730f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks( 244830f712c9SDave Chinner args->dp->i_mount, 244930f712c9SDave Chinner args->rmtvaluelen); 24502451337dSDave Chinner return -EEXIST; 245130f712c9SDave Chinner } 245230f712c9SDave Chinner } 245330f712c9SDave Chinner args->index = probe; 24542451337dSDave Chinner return -ENOATTR; 245530f712c9SDave Chinner } 245630f712c9SDave Chinner 245730f712c9SDave Chinner /* 245830f712c9SDave Chinner * Get the value associated with an attribute name from a leaf attribute 245930f712c9SDave Chinner * list structure. 2460728bcaa3SDave Chinner * 2461e513e25cSChristoph Hellwig * If args->valuelen is zero, only the length needs to be returned. Unlike a 2462e513e25cSChristoph Hellwig * lookup, we only return an error if the attribute does not exist or we can't 2463e513e25cSChristoph Hellwig * retrieve the value. 246430f712c9SDave Chinner */ 246530f712c9SDave Chinner int 246630f712c9SDave Chinner xfs_attr3_leaf_getvalue( 246730f712c9SDave Chinner struct xfs_buf *bp, 246830f712c9SDave Chinner struct xfs_da_args *args) 246930f712c9SDave Chinner { 247030f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 247130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 247230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 247330f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 247430f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 247530f712c9SDave Chinner 247630f712c9SDave Chinner leaf = bp->b_addr; 24772f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 247830f712c9SDave Chinner ASSERT(ichdr.count < args->geo->blksize / 8); 247930f712c9SDave Chinner ASSERT(args->index < ichdr.count); 248030f712c9SDave Chinner 248130f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 248230f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 248330f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 248430f712c9SDave Chinner ASSERT(name_loc->namelen == args->namelen); 248530f712c9SDave Chinner ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0); 24869df243a1SDave Chinner return xfs_attr_copy_value(args, 24879df243a1SDave Chinner &name_loc->nameval[args->namelen], 24889df243a1SDave Chinner be16_to_cpu(name_loc->valuelen)); 2489a0e959d3SDave Chinner } 2490a0e959d3SDave Chinner 249130f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 249230f712c9SDave Chinner ASSERT(name_rmt->namelen == args->namelen); 249330f712c9SDave Chinner ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0); 249430f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 249530f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 249630f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount, 249730f712c9SDave Chinner args->rmtvaluelen); 24989df243a1SDave Chinner return xfs_attr_copy_value(args, NULL, args->rmtvaluelen); 249930f712c9SDave Chinner } 250030f712c9SDave Chinner 250130f712c9SDave Chinner /*======================================================================== 250230f712c9SDave Chinner * Utility routines. 250330f712c9SDave Chinner *========================================================================*/ 250430f712c9SDave Chinner 250530f712c9SDave Chinner /* 250630f712c9SDave Chinner * Move the indicated entries from one leaf to another. 250730f712c9SDave Chinner * NOTE: this routine modifies both source and destination leaves. 250830f712c9SDave Chinner */ 250930f712c9SDave Chinner /*ARGSUSED*/ 251030f712c9SDave Chinner STATIC void 251130f712c9SDave Chinner xfs_attr3_leaf_moveents( 251230f712c9SDave Chinner struct xfs_da_args *args, 251330f712c9SDave Chinner struct xfs_attr_leafblock *leaf_s, 251430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_s, 251530f712c9SDave Chinner int start_s, 251630f712c9SDave Chinner struct xfs_attr_leafblock *leaf_d, 251730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_d, 251830f712c9SDave Chinner int start_d, 251930f712c9SDave Chinner int count) 252030f712c9SDave Chinner { 252130f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_s; 252230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_d; 252330f712c9SDave Chinner int desti; 252430f712c9SDave Chinner int tmp; 252530f712c9SDave Chinner int i; 252630f712c9SDave Chinner 252730f712c9SDave Chinner /* 252830f712c9SDave Chinner * Check for nothing to do. 252930f712c9SDave Chinner */ 253030f712c9SDave Chinner if (count == 0) 253130f712c9SDave Chinner return; 253230f712c9SDave Chinner 253330f712c9SDave Chinner /* 253430f712c9SDave Chinner * Set up environment. 253530f712c9SDave Chinner */ 253630f712c9SDave Chinner ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC || 253730f712c9SDave Chinner ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC); 253830f712c9SDave Chinner ASSERT(ichdr_s->magic == ichdr_d->magic); 253930f712c9SDave Chinner ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8); 254030f712c9SDave Chinner ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s)) 254130f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_s)); 254230f712c9SDave Chinner ASSERT(ichdr_d->count < args->geo->blksize / 8); 254330f712c9SDave Chinner ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d)) 254430f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d)); 254530f712c9SDave Chinner 254630f712c9SDave Chinner ASSERT(start_s < ichdr_s->count); 254730f712c9SDave Chinner ASSERT(start_d <= ichdr_d->count); 254830f712c9SDave Chinner ASSERT(count <= ichdr_s->count); 254930f712c9SDave Chinner 255030f712c9SDave Chinner 255130f712c9SDave Chinner /* 255230f712c9SDave Chinner * Move the entries in the destination leaf up to make a hole? 255330f712c9SDave Chinner */ 255430f712c9SDave Chinner if (start_d < ichdr_d->count) { 255530f712c9SDave Chinner tmp = ichdr_d->count - start_d; 255630f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 255730f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 255830f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count]; 255930f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 256030f712c9SDave Chinner } 256130f712c9SDave Chinner 256230f712c9SDave Chinner /* 256330f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 256430f712c9SDave Chinner * but allocate attribute info packed and in sequence. 256530f712c9SDave Chinner */ 256630f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 256730f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 256830f712c9SDave Chinner desti = start_d; 256930f712c9SDave Chinner for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) { 257030f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused); 257130f712c9SDave Chinner tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i); 257230f712c9SDave Chinner #ifdef GROT 257330f712c9SDave Chinner /* 257430f712c9SDave Chinner * Code to drop INCOMPLETE entries. Difficult to use as we 257530f712c9SDave Chinner * may also need to change the insertion index. Code turned 257630f712c9SDave Chinner * off for 6.2, should be revisited later. 257730f712c9SDave Chinner */ 257830f712c9SDave Chinner if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */ 257930f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 258030f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 258130f712c9SDave Chinner ichdr_s->count -= 1; 258230f712c9SDave Chinner entry_d--; /* to compensate for ++ in loop hdr */ 258330f712c9SDave Chinner desti--; 258430f712c9SDave Chinner if ((start_s + i) < offset) 258530f712c9SDave Chinner result++; /* insertion index adjustment */ 258630f712c9SDave Chinner } else { 258730f712c9SDave Chinner #endif /* GROT */ 258830f712c9SDave Chinner ichdr_d->firstused -= tmp; 258930f712c9SDave Chinner /* both on-disk, don't endian flip twice */ 259030f712c9SDave Chinner entry_d->hashval = entry_s->hashval; 259130f712c9SDave Chinner entry_d->nameidx = cpu_to_be16(ichdr_d->firstused); 259230f712c9SDave Chinner entry_d->flags = entry_s->flags; 259330f712c9SDave Chinner ASSERT(be16_to_cpu(entry_d->nameidx) + tmp 259430f712c9SDave Chinner <= args->geo->blksize); 259530f712c9SDave Chinner memmove(xfs_attr3_leaf_name(leaf_d, desti), 259630f712c9SDave Chinner xfs_attr3_leaf_name(leaf_s, start_s + i), tmp); 259730f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) + tmp 259830f712c9SDave Chinner <= args->geo->blksize); 259930f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 260030f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 260130f712c9SDave Chinner ichdr_d->usedbytes += tmp; 260230f712c9SDave Chinner ichdr_s->count -= 1; 260330f712c9SDave Chinner ichdr_d->count += 1; 260430f712c9SDave Chinner tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t) 260530f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d); 260630f712c9SDave Chinner ASSERT(ichdr_d->firstused >= tmp); 260730f712c9SDave Chinner #ifdef GROT 260830f712c9SDave Chinner } 260930f712c9SDave Chinner #endif /* GROT */ 261030f712c9SDave Chinner } 261130f712c9SDave Chinner 261230f712c9SDave Chinner /* 261330f712c9SDave Chinner * Zero out the entries we just copied. 261430f712c9SDave Chinner */ 261530f712c9SDave Chinner if (start_s == ichdr_s->count) { 261630f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 261730f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 261830f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 261930f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 262030f712c9SDave Chinner memset(entry_s, 0, tmp); 262130f712c9SDave Chinner } else { 262230f712c9SDave Chinner /* 262330f712c9SDave Chinner * Move the remaining entries down to fill the hole, 262430f712c9SDave Chinner * then zero the entries at the top. 262530f712c9SDave Chinner */ 262630f712c9SDave Chinner tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t); 262730f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count]; 262830f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 262930f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 263030f712c9SDave Chinner 263130f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 263230f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count]; 263330f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 263430f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 263530f712c9SDave Chinner memset(entry_s, 0, tmp); 263630f712c9SDave Chinner } 263730f712c9SDave Chinner 263830f712c9SDave Chinner /* 263930f712c9SDave Chinner * Fill in the freemap information 264030f712c9SDave Chinner */ 264130f712c9SDave Chinner ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d); 264230f712c9SDave Chinner ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t); 264330f712c9SDave Chinner ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base; 264430f712c9SDave Chinner ichdr_d->freemap[1].base = 0; 264530f712c9SDave Chinner ichdr_d->freemap[2].base = 0; 264630f712c9SDave Chinner ichdr_d->freemap[1].size = 0; 264730f712c9SDave Chinner ichdr_d->freemap[2].size = 0; 264830f712c9SDave Chinner ichdr_s->holes = 1; /* leaf may not be compact */ 264930f712c9SDave Chinner } 265030f712c9SDave Chinner 265130f712c9SDave Chinner /* 265230f712c9SDave Chinner * Pick up the last hashvalue from a leaf block. 265330f712c9SDave Chinner */ 265430f712c9SDave Chinner xfs_dahash_t 265530f712c9SDave Chinner xfs_attr_leaf_lasthash( 265630f712c9SDave Chinner struct xfs_buf *bp, 265730f712c9SDave Chinner int *count) 265830f712c9SDave Chinner { 265930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 266030f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 2661dbd329f1SChristoph Hellwig struct xfs_mount *mp = bp->b_mount; 266230f712c9SDave Chinner 26632f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr); 266430f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(bp->b_addr); 266530f712c9SDave Chinner if (count) 266630f712c9SDave Chinner *count = ichdr.count; 266730f712c9SDave Chinner if (!ichdr.count) 266830f712c9SDave Chinner return 0; 266930f712c9SDave Chinner return be32_to_cpu(entries[ichdr.count - 1].hashval); 267030f712c9SDave Chinner } 267130f712c9SDave Chinner 267230f712c9SDave Chinner /* 267330f712c9SDave Chinner * Calculate the number of bytes used to store the indicated attribute 267430f712c9SDave Chinner * (whether local or remote only calculate bytes in this block). 267530f712c9SDave Chinner */ 267630f712c9SDave Chinner STATIC int 267730f712c9SDave Chinner xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) 267830f712c9SDave Chinner { 267930f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 268030f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 268130f712c9SDave Chinner xfs_attr_leaf_name_remote_t *name_rmt; 268230f712c9SDave Chinner int size; 268330f712c9SDave Chinner 268430f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 268530f712c9SDave Chinner if (entries[index].flags & XFS_ATTR_LOCAL) { 268630f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, index); 268730f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(name_loc->namelen, 268830f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 268930f712c9SDave Chinner } else { 269030f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, index); 269130f712c9SDave Chinner size = xfs_attr_leaf_entsize_remote(name_rmt->namelen); 269230f712c9SDave Chinner } 269330f712c9SDave Chinner return size; 269430f712c9SDave Chinner } 269530f712c9SDave Chinner 269630f712c9SDave Chinner /* 269730f712c9SDave Chinner * Calculate the number of bytes that would be required to store the new 269830f712c9SDave Chinner * attribute (whether local or remote only calculate bytes in this block). 269930f712c9SDave Chinner * This routine decides as a side effect whether the attribute will be 270030f712c9SDave Chinner * a "local" or a "remote" attribute. 270130f712c9SDave Chinner */ 270230f712c9SDave Chinner int 270330f712c9SDave Chinner xfs_attr_leaf_newentsize( 270430f712c9SDave Chinner struct xfs_da_args *args, 270530f712c9SDave Chinner int *local) 270630f712c9SDave Chinner { 270730f712c9SDave Chinner int size; 270830f712c9SDave Chinner 270930f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen); 271030f712c9SDave Chinner if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) { 271130f712c9SDave Chinner if (local) 271230f712c9SDave Chinner *local = 1; 271330f712c9SDave Chinner return size; 271430f712c9SDave Chinner } 271530f712c9SDave Chinner if (local) 271630f712c9SDave Chinner *local = 0; 271730f712c9SDave Chinner return xfs_attr_leaf_entsize_remote(args->namelen); 271830f712c9SDave Chinner } 271930f712c9SDave Chinner 272030f712c9SDave Chinner 272130f712c9SDave Chinner /*======================================================================== 272230f712c9SDave Chinner * Manage the INCOMPLETE flag in a leaf entry 272330f712c9SDave Chinner *========================================================================*/ 272430f712c9SDave Chinner 272530f712c9SDave Chinner /* 272630f712c9SDave Chinner * Clear the INCOMPLETE flag on an entry in a leaf block. 272730f712c9SDave Chinner */ 272830f712c9SDave Chinner int 272930f712c9SDave Chinner xfs_attr3_leaf_clearflag( 273030f712c9SDave Chinner struct xfs_da_args *args) 273130f712c9SDave Chinner { 273230f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 273330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 273430f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 273530f712c9SDave Chinner struct xfs_buf *bp; 273630f712c9SDave Chinner int error; 273730f712c9SDave Chinner #ifdef DEBUG 273830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 273930f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 274030f712c9SDave Chinner int namelen; 274130f712c9SDave Chinner char *name; 274230f712c9SDave Chinner #endif /* DEBUG */ 274330f712c9SDave Chinner 274430f712c9SDave Chinner trace_xfs_attr_leaf_clearflag(args); 274530f712c9SDave Chinner /* 274630f712c9SDave Chinner * Set up the operation. 274730f712c9SDave Chinner */ 2748dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp); 274930f712c9SDave Chinner if (error) 275030f712c9SDave Chinner return error; 275130f712c9SDave Chinner 275230f712c9SDave Chinner leaf = bp->b_addr; 275330f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 275430f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_INCOMPLETE); 275530f712c9SDave Chinner 275630f712c9SDave Chinner #ifdef DEBUG 27572f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 275830f712c9SDave Chinner ASSERT(args->index < ichdr.count); 275930f712c9SDave Chinner ASSERT(args->index >= 0); 276030f712c9SDave Chinner 276130f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 276230f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 276330f712c9SDave Chinner namelen = name_loc->namelen; 276430f712c9SDave Chinner name = (char *)name_loc->nameval; 276530f712c9SDave Chinner } else { 276630f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 276730f712c9SDave Chinner namelen = name_rmt->namelen; 276830f712c9SDave Chinner name = (char *)name_rmt->name; 276930f712c9SDave Chinner } 277030f712c9SDave Chinner ASSERT(be32_to_cpu(entry->hashval) == args->hashval); 277130f712c9SDave Chinner ASSERT(namelen == args->namelen); 277230f712c9SDave Chinner ASSERT(memcmp(name, args->name, namelen) == 0); 277330f712c9SDave Chinner #endif /* DEBUG */ 277430f712c9SDave Chinner 277530f712c9SDave Chinner entry->flags &= ~XFS_ATTR_INCOMPLETE; 277630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 277730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 277830f712c9SDave Chinner 277930f712c9SDave Chinner if (args->rmtblkno) { 278030f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0); 278130f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 278230f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 278330f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 278430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 278530f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 278630f712c9SDave Chinner } 278730f712c9SDave Chinner 27881fc618d7SAllison Collins return 0; 278930f712c9SDave Chinner } 279030f712c9SDave Chinner 279130f712c9SDave Chinner /* 279230f712c9SDave Chinner * Set the INCOMPLETE flag on an entry in a leaf block. 279330f712c9SDave Chinner */ 279430f712c9SDave Chinner int 279530f712c9SDave Chinner xfs_attr3_leaf_setflag( 279630f712c9SDave Chinner struct xfs_da_args *args) 279730f712c9SDave Chinner { 279830f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 279930f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 280030f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 280130f712c9SDave Chinner struct xfs_buf *bp; 280230f712c9SDave Chinner int error; 280330f712c9SDave Chinner #ifdef DEBUG 280430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 280530f712c9SDave Chinner #endif 280630f712c9SDave Chinner 280730f712c9SDave Chinner trace_xfs_attr_leaf_setflag(args); 280830f712c9SDave Chinner 280930f712c9SDave Chinner /* 281030f712c9SDave Chinner * Set up the operation. 281130f712c9SDave Chinner */ 2812dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp); 281330f712c9SDave Chinner if (error) 281430f712c9SDave Chinner return error; 281530f712c9SDave Chinner 281630f712c9SDave Chinner leaf = bp->b_addr; 281730f712c9SDave Chinner #ifdef DEBUG 28182f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 281930f712c9SDave Chinner ASSERT(args->index < ichdr.count); 282030f712c9SDave Chinner ASSERT(args->index >= 0); 282130f712c9SDave Chinner #endif 282230f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 282330f712c9SDave Chinner 282430f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0); 282530f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 282630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 282730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 282830f712c9SDave Chinner if ((entry->flags & XFS_ATTR_LOCAL) == 0) { 282930f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 283030f712c9SDave Chinner name_rmt->valueblk = 0; 283130f712c9SDave Chinner name_rmt->valuelen = 0; 283230f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 283330f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 283430f712c9SDave Chinner } 283530f712c9SDave Chinner 28360949d317SAllison Collins return 0; 283730f712c9SDave Chinner } 283830f712c9SDave Chinner 283930f712c9SDave Chinner /* 284030f712c9SDave Chinner * In a single transaction, clear the INCOMPLETE flag on the leaf entry 284130f712c9SDave Chinner * given by args->blkno/index and set the INCOMPLETE flag on the leaf 284230f712c9SDave Chinner * entry given by args->blkno2/index2. 284330f712c9SDave Chinner * 284430f712c9SDave Chinner * Note that they could be in different blocks, or in the same block. 284530f712c9SDave Chinner */ 284630f712c9SDave Chinner int 284730f712c9SDave Chinner xfs_attr3_leaf_flipflags( 284830f712c9SDave Chinner struct xfs_da_args *args) 284930f712c9SDave Chinner { 285030f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 285130f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 285230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry1; 285330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry2; 285430f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 285530f712c9SDave Chinner struct xfs_buf *bp1; 285630f712c9SDave Chinner struct xfs_buf *bp2; 285730f712c9SDave Chinner int error; 285830f712c9SDave Chinner #ifdef DEBUG 285930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 286030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 286130f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 286230f712c9SDave Chinner int namelen1, namelen2; 286330f712c9SDave Chinner char *name1, *name2; 286430f712c9SDave Chinner #endif /* DEBUG */ 286530f712c9SDave Chinner 286630f712c9SDave Chinner trace_xfs_attr_leaf_flipflags(args); 286730f712c9SDave Chinner 286830f712c9SDave Chinner /* 286930f712c9SDave Chinner * Read the block containing the "old" attr 287030f712c9SDave Chinner */ 2871dfb87594SChristoph Hellwig error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, &bp1); 287230f712c9SDave Chinner if (error) 287330f712c9SDave Chinner return error; 287430f712c9SDave Chinner 287530f712c9SDave Chinner /* 287630f712c9SDave Chinner * Read the block containing the "new" attr, if it is different 287730f712c9SDave Chinner */ 287830f712c9SDave Chinner if (args->blkno2 != args->blkno) { 287930f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2, 2880dfb87594SChristoph Hellwig &bp2); 288130f712c9SDave Chinner if (error) 288230f712c9SDave Chinner return error; 288330f712c9SDave Chinner } else { 288430f712c9SDave Chinner bp2 = bp1; 288530f712c9SDave Chinner } 288630f712c9SDave Chinner 288730f712c9SDave Chinner leaf1 = bp1->b_addr; 288830f712c9SDave Chinner entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index]; 288930f712c9SDave Chinner 289030f712c9SDave Chinner leaf2 = bp2->b_addr; 289130f712c9SDave Chinner entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2]; 289230f712c9SDave Chinner 289330f712c9SDave Chinner #ifdef DEBUG 28942f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1); 289530f712c9SDave Chinner ASSERT(args->index < ichdr1.count); 289630f712c9SDave Chinner ASSERT(args->index >= 0); 289730f712c9SDave Chinner 28982f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2); 289930f712c9SDave Chinner ASSERT(args->index2 < ichdr2.count); 290030f712c9SDave Chinner ASSERT(args->index2 >= 0); 290130f712c9SDave Chinner 290230f712c9SDave Chinner if (entry1->flags & XFS_ATTR_LOCAL) { 290330f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf1, args->index); 290430f712c9SDave Chinner namelen1 = name_loc->namelen; 290530f712c9SDave Chinner name1 = (char *)name_loc->nameval; 290630f712c9SDave Chinner } else { 290730f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 290830f712c9SDave Chinner namelen1 = name_rmt->namelen; 290930f712c9SDave Chinner name1 = (char *)name_rmt->name; 291030f712c9SDave Chinner } 291130f712c9SDave Chinner if (entry2->flags & XFS_ATTR_LOCAL) { 291230f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2); 291330f712c9SDave Chinner namelen2 = name_loc->namelen; 291430f712c9SDave Chinner name2 = (char *)name_loc->nameval; 291530f712c9SDave Chinner } else { 291630f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 291730f712c9SDave Chinner namelen2 = name_rmt->namelen; 291830f712c9SDave Chinner name2 = (char *)name_rmt->name; 291930f712c9SDave Chinner } 292030f712c9SDave Chinner ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval)); 292130f712c9SDave Chinner ASSERT(namelen1 == namelen2); 292230f712c9SDave Chinner ASSERT(memcmp(name1, name2, namelen1) == 0); 292330f712c9SDave Chinner #endif /* DEBUG */ 292430f712c9SDave Chinner 292530f712c9SDave Chinner ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE); 292630f712c9SDave Chinner ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0); 292730f712c9SDave Chinner 292830f712c9SDave Chinner entry1->flags &= ~XFS_ATTR_INCOMPLETE; 292930f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 293030f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1))); 293130f712c9SDave Chinner if (args->rmtblkno) { 293230f712c9SDave Chinner ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0); 293330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 293430f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 293530f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 293630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 293730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt))); 293830f712c9SDave Chinner } 293930f712c9SDave Chinner 294030f712c9SDave Chinner entry2->flags |= XFS_ATTR_INCOMPLETE; 294130f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 294230f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2))); 294330f712c9SDave Chinner if ((entry2->flags & XFS_ATTR_LOCAL) == 0) { 294430f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 294530f712c9SDave Chinner name_rmt->valueblk = 0; 294630f712c9SDave Chinner name_rmt->valuelen = 0; 294730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 294830f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt))); 294930f712c9SDave Chinner } 295030f712c9SDave Chinner 2951e3be1272SAllison Collins return 0; 295230f712c9SDave Chinner } 2953