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_bit.h" 1430f712c9SDave Chinner #include "xfs_sb.h" 1530f712c9SDave Chinner #include "xfs_mount.h" 1630f712c9SDave Chinner #include "xfs_da_format.h" 1730f712c9SDave Chinner #include "xfs_da_btree.h" 1830f712c9SDave Chinner #include "xfs_inode.h" 1930f712c9SDave Chinner #include "xfs_trans.h" 2030f712c9SDave Chinner #include "xfs_inode_item.h" 2130f712c9SDave Chinner #include "xfs_bmap_btree.h" 2230f712c9SDave Chinner #include "xfs_bmap.h" 2330f712c9SDave Chinner #include "xfs_attr_sf.h" 2430f712c9SDave Chinner #include "xfs_attr_remote.h" 2530f712c9SDave Chinner #include "xfs_attr.h" 2630f712c9SDave Chinner #include "xfs_attr_leaf.h" 2730f712c9SDave Chinner #include "xfs_error.h" 2830f712c9SDave Chinner #include "xfs_trace.h" 2930f712c9SDave Chinner #include "xfs_buf_item.h" 3030f712c9SDave Chinner #include "xfs_cksum.h" 3130f712c9SDave Chinner #include "xfs_dir2.h" 32a45086e2SBrian Foster #include "xfs_log.h" 3330f712c9SDave Chinner 3430f712c9SDave Chinner 3530f712c9SDave Chinner /* 3630f712c9SDave Chinner * xfs_attr_leaf.c 3730f712c9SDave Chinner * 3830f712c9SDave Chinner * Routines to implement leaf blocks of attributes as Btrees of hashed names. 3930f712c9SDave Chinner */ 4030f712c9SDave Chinner 4130f712c9SDave Chinner /*======================================================================== 4230f712c9SDave Chinner * Function prototypes for the kernel. 4330f712c9SDave Chinner *========================================================================*/ 4430f712c9SDave Chinner 4530f712c9SDave Chinner /* 4630f712c9SDave Chinner * Routines used for growing the Btree. 4730f712c9SDave Chinner */ 4830f712c9SDave Chinner STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args, 4930f712c9SDave Chinner xfs_dablk_t which_block, struct xfs_buf **bpp); 5030f712c9SDave Chinner STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer, 5130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 5230f712c9SDave Chinner struct xfs_da_args *args, int freemap_index); 5330f712c9SDave Chinner STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args, 5430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 5530f712c9SDave Chinner struct xfs_buf *leaf_buffer); 5630f712c9SDave Chinner STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state, 5730f712c9SDave Chinner xfs_da_state_blk_t *blk1, 5830f712c9SDave Chinner xfs_da_state_blk_t *blk2); 5930f712c9SDave Chinner STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state, 6030f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_1, 6130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 6230f712c9SDave Chinner xfs_da_state_blk_t *leaf_blk_2, 6330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 6430f712c9SDave Chinner int *number_entries_in_blk1, 6530f712c9SDave Chinner int *number_usedbytes_in_blk1); 6630f712c9SDave Chinner 6730f712c9SDave Chinner /* 6830f712c9SDave Chinner * Utility routines. 6930f712c9SDave Chinner */ 7030f712c9SDave Chinner STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args, 7130f712c9SDave Chinner struct xfs_attr_leafblock *src_leaf, 7230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start, 7330f712c9SDave Chinner struct xfs_attr_leafblock *dst_leaf, 7430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start, 7530f712c9SDave Chinner int move_count); 7630f712c9SDave Chinner STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index); 7730f712c9SDave Chinner 78e87021a2SBrian Foster /* 79e87021a2SBrian Foster * attr3 block 'firstused' conversion helpers. 80e87021a2SBrian Foster * 81e87021a2SBrian Foster * firstused refers to the offset of the first used byte of the nameval region 82e87021a2SBrian Foster * of an attr leaf block. The region starts at the tail of the block and expands 83e87021a2SBrian Foster * backwards towards the middle. As such, firstused is initialized to the block 84e87021a2SBrian Foster * size for an empty leaf block and is reduced from there. 85e87021a2SBrian Foster * 86e87021a2SBrian Foster * The attr3 block size is pegged to the fsb size and the maximum fsb is 64k. 87e87021a2SBrian Foster * The in-core firstused field is 32-bit and thus supports the maximum fsb size. 88e87021a2SBrian Foster * The on-disk field is only 16-bit, however, and overflows at 64k. Since this 89e87021a2SBrian Foster * only occurs at exactly 64k, we use zero as a magic on-disk value to represent 90e87021a2SBrian Foster * the attr block size. The following helpers manage the conversion between the 91e87021a2SBrian Foster * in-core and on-disk formats. 92e87021a2SBrian Foster */ 93e87021a2SBrian Foster 94e87021a2SBrian Foster static void 95e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk( 96e87021a2SBrian Foster struct xfs_da_geometry *geo, 97e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *to, 98e87021a2SBrian Foster struct xfs_attr_leafblock *from) 99e87021a2SBrian Foster { 100e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 101e87021a2SBrian Foster 102e87021a2SBrian Foster if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 103e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) from; 104e87021a2SBrian Foster to->firstused = be16_to_cpu(hdr3->firstused); 105e87021a2SBrian Foster } else { 106e87021a2SBrian Foster to->firstused = be16_to_cpu(from->hdr.firstused); 107e87021a2SBrian Foster } 108e87021a2SBrian Foster 109e87021a2SBrian Foster /* 110e87021a2SBrian Foster * Convert from the magic fsb size value to actual blocksize. This 111e87021a2SBrian Foster * should only occur for empty blocks when the block size overflows 112e87021a2SBrian Foster * 16-bits. 113e87021a2SBrian Foster */ 114e87021a2SBrian Foster if (to->firstused == XFS_ATTR3_LEAF_NULLOFF) { 115e87021a2SBrian Foster ASSERT(!to->count && !to->usedbytes); 116e87021a2SBrian Foster ASSERT(geo->blksize > USHRT_MAX); 117e87021a2SBrian Foster to->firstused = geo->blksize; 118e87021a2SBrian Foster } 119e87021a2SBrian Foster } 120e87021a2SBrian Foster 121e87021a2SBrian Foster static void 122e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk( 123e87021a2SBrian Foster struct xfs_da_geometry *geo, 124e87021a2SBrian Foster struct xfs_attr_leafblock *to, 125e87021a2SBrian Foster struct xfs_attr3_icleaf_hdr *from) 126e87021a2SBrian Foster { 127e87021a2SBrian Foster struct xfs_attr3_leaf_hdr *hdr3; 128e87021a2SBrian Foster uint32_t firstused; 129e87021a2SBrian Foster 130e87021a2SBrian Foster /* magic value should only be seen on disk */ 131e87021a2SBrian Foster ASSERT(from->firstused != XFS_ATTR3_LEAF_NULLOFF); 132e87021a2SBrian Foster 133e87021a2SBrian Foster /* 134e87021a2SBrian Foster * Scale down the 32-bit in-core firstused value to the 16-bit on-disk 135e87021a2SBrian Foster * value. This only overflows at the max supported value of 64k. Use the 136e87021a2SBrian Foster * magic on-disk value to represent block size in this case. 137e87021a2SBrian Foster */ 138e87021a2SBrian Foster firstused = from->firstused; 139e87021a2SBrian Foster if (firstused > USHRT_MAX) { 140e87021a2SBrian Foster ASSERT(from->firstused == geo->blksize); 141e87021a2SBrian Foster firstused = XFS_ATTR3_LEAF_NULLOFF; 142e87021a2SBrian Foster } 143e87021a2SBrian Foster 144e87021a2SBrian Foster if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 145e87021a2SBrian Foster hdr3 = (struct xfs_attr3_leaf_hdr *) to; 146e87021a2SBrian Foster hdr3->firstused = cpu_to_be16(firstused); 147e87021a2SBrian Foster } else { 148e87021a2SBrian Foster to->hdr.firstused = cpu_to_be16(firstused); 149e87021a2SBrian Foster } 150e87021a2SBrian Foster } 151e87021a2SBrian Foster 15230f712c9SDave Chinner void 15330f712c9SDave Chinner xfs_attr3_leaf_hdr_from_disk( 1542f661241SBrian Foster struct xfs_da_geometry *geo, 15530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *to, 15630f712c9SDave Chinner struct xfs_attr_leafblock *from) 15730f712c9SDave Chinner { 15830f712c9SDave Chinner int i; 15930f712c9SDave Chinner 16030f712c9SDave Chinner ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) || 16130f712c9SDave Chinner from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)); 16230f712c9SDave Chinner 16330f712c9SDave Chinner if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) { 16430f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from; 16530f712c9SDave Chinner 16630f712c9SDave Chinner to->forw = be32_to_cpu(hdr3->info.hdr.forw); 16730f712c9SDave Chinner to->back = be32_to_cpu(hdr3->info.hdr.back); 16830f712c9SDave Chinner to->magic = be16_to_cpu(hdr3->info.hdr.magic); 16930f712c9SDave Chinner to->count = be16_to_cpu(hdr3->count); 17030f712c9SDave Chinner to->usedbytes = be16_to_cpu(hdr3->usedbytes); 171e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 17230f712c9SDave Chinner to->holes = hdr3->holes; 17330f712c9SDave Chinner 17430f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 17530f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base); 17630f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size); 17730f712c9SDave Chinner } 17830f712c9SDave Chinner return; 17930f712c9SDave Chinner } 18030f712c9SDave Chinner to->forw = be32_to_cpu(from->hdr.info.forw); 18130f712c9SDave Chinner to->back = be32_to_cpu(from->hdr.info.back); 18230f712c9SDave Chinner to->magic = be16_to_cpu(from->hdr.info.magic); 18330f712c9SDave Chinner to->count = be16_to_cpu(from->hdr.count); 18430f712c9SDave Chinner to->usedbytes = be16_to_cpu(from->hdr.usedbytes); 185e87021a2SBrian Foster xfs_attr3_leaf_firstused_from_disk(geo, to, from); 18630f712c9SDave Chinner to->holes = from->hdr.holes; 18730f712c9SDave Chinner 18830f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 18930f712c9SDave Chinner to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base); 19030f712c9SDave Chinner to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size); 19130f712c9SDave Chinner } 19230f712c9SDave Chinner } 19330f712c9SDave Chinner 19430f712c9SDave Chinner void 19530f712c9SDave Chinner xfs_attr3_leaf_hdr_to_disk( 1962f661241SBrian Foster struct xfs_da_geometry *geo, 19730f712c9SDave Chinner struct xfs_attr_leafblock *to, 19830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *from) 19930f712c9SDave Chinner { 20030f712c9SDave Chinner int i; 20130f712c9SDave Chinner 20230f712c9SDave Chinner ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC || 20330f712c9SDave Chinner from->magic == XFS_ATTR3_LEAF_MAGIC); 20430f712c9SDave Chinner 20530f712c9SDave Chinner if (from->magic == XFS_ATTR3_LEAF_MAGIC) { 20630f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to; 20730f712c9SDave Chinner 20830f712c9SDave Chinner hdr3->info.hdr.forw = cpu_to_be32(from->forw); 20930f712c9SDave Chinner hdr3->info.hdr.back = cpu_to_be32(from->back); 21030f712c9SDave Chinner hdr3->info.hdr.magic = cpu_to_be16(from->magic); 21130f712c9SDave Chinner hdr3->count = cpu_to_be16(from->count); 21230f712c9SDave Chinner hdr3->usedbytes = cpu_to_be16(from->usedbytes); 213e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 21430f712c9SDave Chinner hdr3->holes = from->holes; 21530f712c9SDave Chinner hdr3->pad1 = 0; 21630f712c9SDave Chinner 21730f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 21830f712c9SDave Chinner hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base); 21930f712c9SDave Chinner hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size); 22030f712c9SDave Chinner } 22130f712c9SDave Chinner return; 22230f712c9SDave Chinner } 22330f712c9SDave Chinner to->hdr.info.forw = cpu_to_be32(from->forw); 22430f712c9SDave Chinner to->hdr.info.back = cpu_to_be32(from->back); 22530f712c9SDave Chinner to->hdr.info.magic = cpu_to_be16(from->magic); 22630f712c9SDave Chinner to->hdr.count = cpu_to_be16(from->count); 22730f712c9SDave Chinner to->hdr.usedbytes = cpu_to_be16(from->usedbytes); 228e87021a2SBrian Foster xfs_attr3_leaf_firstused_to_disk(geo, to, from); 22930f712c9SDave Chinner to->hdr.holes = from->holes; 23030f712c9SDave Chinner to->hdr.pad1 = 0; 23130f712c9SDave Chinner 23230f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 23330f712c9SDave Chinner to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base); 23430f712c9SDave Chinner to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size); 23530f712c9SDave Chinner } 23630f712c9SDave Chinner } 23730f712c9SDave Chinner 238a6a781a5SDarrick J. Wong static xfs_failaddr_t 23930f712c9SDave Chinner xfs_attr3_leaf_verify( 24030f712c9SDave Chinner struct xfs_buf *bp) 24130f712c9SDave Chinner { 24279a69bf8SDarrick J. Wong struct xfs_attr3_icleaf_hdr ichdr; 24330f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 24430f712c9SDave Chinner struct xfs_attr_leafblock *leaf = bp->b_addr; 2452e1d2337SEric Sandeen struct xfs_perag *pag = bp->b_pag; 24679a69bf8SDarrick J. Wong struct xfs_attr_leaf_entry *entries; 24730f712c9SDave Chinner 2482f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); 24930f712c9SDave Chinner 25030f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 25130f712c9SDave Chinner struct xfs_da3_node_hdr *hdr3 = bp->b_addr; 25230f712c9SDave Chinner 25330f712c9SDave Chinner if (ichdr.magic != XFS_ATTR3_LEAF_MAGIC) 254a6a781a5SDarrick J. Wong return __this_address; 25530f712c9SDave Chinner 256ce748eaaSEric Sandeen if (!uuid_equal(&hdr3->info.uuid, &mp->m_sb.sb_meta_uuid)) 257a6a781a5SDarrick J. Wong return __this_address; 25830f712c9SDave Chinner if (be64_to_cpu(hdr3->info.blkno) != bp->b_bn) 259a6a781a5SDarrick J. Wong return __this_address; 260a45086e2SBrian Foster if (!xfs_log_check_lsn(mp, be64_to_cpu(hdr3->info.lsn))) 261a6a781a5SDarrick J. Wong return __this_address; 26230f712c9SDave Chinner } else { 26330f712c9SDave Chinner if (ichdr.magic != XFS_ATTR_LEAF_MAGIC) 264a6a781a5SDarrick J. Wong return __this_address; 26530f712c9SDave Chinner } 2662e1d2337SEric Sandeen /* 2672e1d2337SEric Sandeen * In recovery there is a transient state where count == 0 is valid 2682e1d2337SEric Sandeen * because we may have transitioned an empty shortform attr to a leaf 2692e1d2337SEric Sandeen * if the attr didn't fit in shortform. 2702e1d2337SEric Sandeen */ 2712e1d2337SEric Sandeen if (pag && pag->pagf_init && ichdr.count == 0) 272a6a781a5SDarrick J. Wong return __this_address; 27330f712c9SDave Chinner 27479a69bf8SDarrick J. Wong /* 27579a69bf8SDarrick J. Wong * firstused is the block offset of the first name info structure. 27679a69bf8SDarrick J. Wong * Make sure it doesn't go off the block or crash into the header. 27779a69bf8SDarrick J. Wong */ 27879a69bf8SDarrick J. Wong if (ichdr.firstused > mp->m_attr_geo->blksize) 27979a69bf8SDarrick J. Wong return __this_address; 28079a69bf8SDarrick J. Wong if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) 28179a69bf8SDarrick J. Wong return __this_address; 28279a69bf8SDarrick J. Wong 28379a69bf8SDarrick J. Wong /* Make sure the entries array doesn't crash into the name info. */ 28479a69bf8SDarrick J. Wong entries = xfs_attr3_leaf_entryp(bp->b_addr); 28579a69bf8SDarrick J. Wong if ((char *)&entries[ichdr.count] > 28679a69bf8SDarrick J. Wong (char *)bp->b_addr + ichdr.firstused) 28779a69bf8SDarrick J. Wong return __this_address; 28879a69bf8SDarrick J. Wong 28930f712c9SDave Chinner /* XXX: need to range check rest of attr header values */ 29030f712c9SDave Chinner /* XXX: hash order check? */ 29130f712c9SDave Chinner 292a6a781a5SDarrick J. Wong return NULL; 29330f712c9SDave Chinner } 29430f712c9SDave Chinner 29530f712c9SDave Chinner static void 29630f712c9SDave Chinner xfs_attr3_leaf_write_verify( 29730f712c9SDave Chinner struct xfs_buf *bp) 29830f712c9SDave Chinner { 29930f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 300fb1755a6SCarlos Maiolino struct xfs_buf_log_item *bip = bp->b_log_item; 30130f712c9SDave Chinner struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr; 302bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 30330f712c9SDave Chinner 304bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 305bc1a09b8SDarrick J. Wong if (fa) { 306bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 30730f712c9SDave Chinner return; 30830f712c9SDave Chinner } 30930f712c9SDave Chinner 31030f712c9SDave Chinner if (!xfs_sb_version_hascrc(&mp->m_sb)) 31130f712c9SDave Chinner return; 31230f712c9SDave Chinner 31330f712c9SDave Chinner if (bip) 31430f712c9SDave Chinner hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); 31530f712c9SDave Chinner 31630f712c9SDave Chinner xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF); 31730f712c9SDave Chinner } 31830f712c9SDave Chinner 31930f712c9SDave Chinner /* 32030f712c9SDave Chinner * leaf/node format detection on trees is sketchy, so a node read can be done on 32130f712c9SDave Chinner * leaf level blocks when detection identifies the tree as a node format tree 32230f712c9SDave Chinner * incorrectly. In this case, we need to swap the verifier to match the correct 32330f712c9SDave Chinner * format of the block being read. 32430f712c9SDave Chinner */ 32530f712c9SDave Chinner static void 32630f712c9SDave Chinner xfs_attr3_leaf_read_verify( 32730f712c9SDave Chinner struct xfs_buf *bp) 32830f712c9SDave Chinner { 32930f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 330bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 33130f712c9SDave Chinner 33230f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb) && 33330f712c9SDave Chinner !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF)) 334bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSBADCRC, __this_address); 335bc1a09b8SDarrick J. Wong else { 336bc1a09b8SDarrick J. Wong fa = xfs_attr3_leaf_verify(bp); 337bc1a09b8SDarrick J. Wong if (fa) 338bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 339bc1a09b8SDarrick J. Wong } 34030f712c9SDave Chinner } 34130f712c9SDave Chinner 34230f712c9SDave Chinner const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = { 343233135b7SEric Sandeen .name = "xfs_attr3_leaf", 34430f712c9SDave Chinner .verify_read = xfs_attr3_leaf_read_verify, 34530f712c9SDave Chinner .verify_write = xfs_attr3_leaf_write_verify, 346b5572597SDarrick J. Wong .verify_struct = xfs_attr3_leaf_verify, 34730f712c9SDave Chinner }; 34830f712c9SDave Chinner 34930f712c9SDave Chinner int 35030f712c9SDave Chinner xfs_attr3_leaf_read( 35130f712c9SDave Chinner struct xfs_trans *tp, 35230f712c9SDave Chinner struct xfs_inode *dp, 35330f712c9SDave Chinner xfs_dablk_t bno, 35430f712c9SDave Chinner xfs_daddr_t mappedbno, 35530f712c9SDave Chinner struct xfs_buf **bpp) 35630f712c9SDave Chinner { 35730f712c9SDave Chinner int err; 35830f712c9SDave Chinner 35930f712c9SDave Chinner err = xfs_da_read_buf(tp, dp, bno, mappedbno, bpp, 36030f712c9SDave Chinner XFS_ATTR_FORK, &xfs_attr3_leaf_buf_ops); 361cd87d867SDarrick J. Wong if (!err && tp && *bpp) 36230f712c9SDave Chinner xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF); 36330f712c9SDave Chinner return err; 36430f712c9SDave Chinner } 36530f712c9SDave Chinner 36630f712c9SDave Chinner /*======================================================================== 36730f712c9SDave Chinner * Namespace helper routines 36830f712c9SDave Chinner *========================================================================*/ 36930f712c9SDave Chinner 37030f712c9SDave Chinner /* 37130f712c9SDave Chinner * If namespace bits don't match return 0. 37230f712c9SDave Chinner * If all match then return 1. 37330f712c9SDave Chinner */ 37430f712c9SDave Chinner STATIC int 37530f712c9SDave Chinner xfs_attr_namesp_match(int arg_flags, int ondisk_flags) 37630f712c9SDave Chinner { 37730f712c9SDave Chinner return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags); 37830f712c9SDave Chinner } 37930f712c9SDave Chinner 38030f712c9SDave Chinner 38130f712c9SDave Chinner /*======================================================================== 38230f712c9SDave Chinner * External routines when attribute fork size < XFS_LITINO(mp). 38330f712c9SDave Chinner *========================================================================*/ 38430f712c9SDave Chinner 38530f712c9SDave Chinner /* 38630f712c9SDave Chinner * Query whether the requested number of additional bytes of extended 38730f712c9SDave Chinner * attribute space will be able to fit inline. 38830f712c9SDave Chinner * 38930f712c9SDave Chinner * Returns zero if not, else the di_forkoff fork offset to be used in the 39030f712c9SDave Chinner * literal area for attribute data once the new bytes have been added. 39130f712c9SDave Chinner * 39230f712c9SDave Chinner * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value; 39330f712c9SDave Chinner * special case for dev/uuid inodes, they have fixed size data forks. 39430f712c9SDave Chinner */ 39530f712c9SDave Chinner int 39630f712c9SDave Chinner xfs_attr_shortform_bytesfit(xfs_inode_t *dp, int bytes) 39730f712c9SDave Chinner { 39830f712c9SDave Chinner int offset; 39930f712c9SDave Chinner int minforkoff; /* lower limit on valid forkoff locations */ 40030f712c9SDave Chinner int maxforkoff; /* upper limit on valid forkoff locations */ 40130f712c9SDave Chinner int dsize; 40230f712c9SDave Chinner xfs_mount_t *mp = dp->i_mount; 40330f712c9SDave Chinner 40430f712c9SDave Chinner /* rounded down */ 40530f712c9SDave Chinner offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3; 40630f712c9SDave Chinner 40742b67dc6SChristoph Hellwig if (dp->i_d.di_format == XFS_DINODE_FMT_DEV) { 40830f712c9SDave Chinner minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3; 40930f712c9SDave Chinner return (offset >= minforkoff) ? minforkoff : 0; 41030f712c9SDave Chinner } 41130f712c9SDave Chinner 41230f712c9SDave Chinner /* 41330f712c9SDave Chinner * If the requested numbers of bytes is smaller or equal to the 41430f712c9SDave Chinner * current attribute fork size we can always proceed. 41530f712c9SDave Chinner * 41630f712c9SDave Chinner * Note that if_bytes in the data fork might actually be larger than 41730f712c9SDave Chinner * the current data fork size is due to delalloc extents. In that 41830f712c9SDave Chinner * case either the extent count will go down when they are converted 41930f712c9SDave Chinner * to real extents, or the delalloc conversion will take care of the 42030f712c9SDave Chinner * literal area rebalancing. 42130f712c9SDave Chinner */ 42230f712c9SDave Chinner if (bytes <= XFS_IFORK_ASIZE(dp)) 42330f712c9SDave Chinner return dp->i_d.di_forkoff; 42430f712c9SDave Chinner 42530f712c9SDave Chinner /* 42630f712c9SDave Chinner * For attr2 we can try to move the forkoff if there is space in the 42730f712c9SDave Chinner * literal area, but for the old format we are done if there is no 42830f712c9SDave Chinner * space in the fixed attribute fork. 42930f712c9SDave Chinner */ 43030f712c9SDave Chinner if (!(mp->m_flags & XFS_MOUNT_ATTR2)) 43130f712c9SDave Chinner return 0; 43230f712c9SDave Chinner 43330f712c9SDave Chinner dsize = dp->i_df.if_bytes; 43430f712c9SDave Chinner 43530f712c9SDave Chinner switch (dp->i_d.di_format) { 43630f712c9SDave Chinner case XFS_DINODE_FMT_EXTENTS: 43730f712c9SDave Chinner /* 43830f712c9SDave Chinner * If there is no attr fork and the data fork is extents, 43930f712c9SDave Chinner * determine if creating the default attr fork will result 44030f712c9SDave Chinner * in the extents form migrating to btree. If so, the 44130f712c9SDave Chinner * minimum offset only needs to be the space required for 44230f712c9SDave Chinner * the btree root. 44330f712c9SDave Chinner */ 44430f712c9SDave Chinner if (!dp->i_d.di_forkoff && dp->i_df.if_bytes > 44530f712c9SDave Chinner xfs_default_attroffset(dp)) 44630f712c9SDave Chinner dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS); 44730f712c9SDave Chinner break; 44830f712c9SDave Chinner case XFS_DINODE_FMT_BTREE: 44930f712c9SDave Chinner /* 45030f712c9SDave Chinner * If we have a data btree then keep forkoff if we have one, 45130f712c9SDave Chinner * otherwise we are adding a new attr, so then we set 45230f712c9SDave Chinner * minforkoff to where the btree root can finish so we have 45330f712c9SDave Chinner * plenty of room for attrs 45430f712c9SDave Chinner */ 45530f712c9SDave Chinner if (dp->i_d.di_forkoff) { 45630f712c9SDave Chinner if (offset < dp->i_d.di_forkoff) 45730f712c9SDave Chinner return 0; 45830f712c9SDave Chinner return dp->i_d.di_forkoff; 45930f712c9SDave Chinner } 46030f712c9SDave Chinner dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot); 46130f712c9SDave Chinner break; 46230f712c9SDave Chinner } 46330f712c9SDave Chinner 46430f712c9SDave Chinner /* 46530f712c9SDave Chinner * A data fork btree root must have space for at least 46630f712c9SDave Chinner * MINDBTPTRS key/ptr pairs if the data fork is small or empty. 46730f712c9SDave Chinner */ 4689bb54cb5SDave Chinner minforkoff = max(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS)); 46930f712c9SDave Chinner minforkoff = roundup(minforkoff, 8) >> 3; 47030f712c9SDave Chinner 47130f712c9SDave Chinner /* attr fork btree root can have at least this many key/ptr pairs */ 47230f712c9SDave Chinner maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) - 47330f712c9SDave Chinner XFS_BMDR_SPACE_CALC(MINABTPTRS); 47430f712c9SDave Chinner maxforkoff = maxforkoff >> 3; /* rounded down */ 47530f712c9SDave Chinner 47630f712c9SDave Chinner if (offset >= maxforkoff) 47730f712c9SDave Chinner return maxforkoff; 47830f712c9SDave Chinner if (offset >= minforkoff) 47930f712c9SDave Chinner return offset; 48030f712c9SDave Chinner return 0; 48130f712c9SDave Chinner } 48230f712c9SDave Chinner 48330f712c9SDave Chinner /* 48430f712c9SDave Chinner * Switch on the ATTR2 superblock bit (implies also FEATURES2) 48530f712c9SDave Chinner */ 48630f712c9SDave Chinner STATIC void 48730f712c9SDave Chinner xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp) 48830f712c9SDave Chinner { 48930f712c9SDave Chinner if ((mp->m_flags & XFS_MOUNT_ATTR2) && 49030f712c9SDave Chinner !(xfs_sb_version_hasattr2(&mp->m_sb))) { 49130f712c9SDave Chinner spin_lock(&mp->m_sb_lock); 49230f712c9SDave Chinner if (!xfs_sb_version_hasattr2(&mp->m_sb)) { 49330f712c9SDave Chinner xfs_sb_version_addattr2(&mp->m_sb); 49430f712c9SDave Chinner spin_unlock(&mp->m_sb_lock); 49561e63ecbSDave Chinner xfs_log_sb(tp); 49630f712c9SDave Chinner } else 49730f712c9SDave Chinner spin_unlock(&mp->m_sb_lock); 49830f712c9SDave Chinner } 49930f712c9SDave Chinner } 50030f712c9SDave Chinner 50130f712c9SDave Chinner /* 50230f712c9SDave Chinner * Create the initial contents of a shortform attribute list. 50330f712c9SDave Chinner */ 50430f712c9SDave Chinner void 50530f712c9SDave Chinner xfs_attr_shortform_create(xfs_da_args_t *args) 50630f712c9SDave Chinner { 50730f712c9SDave Chinner xfs_attr_sf_hdr_t *hdr; 50830f712c9SDave Chinner xfs_inode_t *dp; 50930f712c9SDave Chinner xfs_ifork_t *ifp; 51030f712c9SDave Chinner 51130f712c9SDave Chinner trace_xfs_attr_sf_create(args); 51230f712c9SDave Chinner 51330f712c9SDave Chinner dp = args->dp; 51430f712c9SDave Chinner ASSERT(dp != NULL); 51530f712c9SDave Chinner ifp = dp->i_afp; 51630f712c9SDave Chinner ASSERT(ifp != NULL); 51730f712c9SDave Chinner ASSERT(ifp->if_bytes == 0); 51830f712c9SDave Chinner if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) { 51930f712c9SDave Chinner ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */ 52030f712c9SDave Chinner dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL; 52130f712c9SDave Chinner ifp->if_flags |= XFS_IFINLINE; 52230f712c9SDave Chinner } else { 52330f712c9SDave Chinner ASSERT(ifp->if_flags & XFS_IFINLINE); 52430f712c9SDave Chinner } 52530f712c9SDave Chinner xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK); 52630f712c9SDave Chinner hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data; 52730f712c9SDave Chinner hdr->count = 0; 52830f712c9SDave Chinner hdr->totsize = cpu_to_be16(sizeof(*hdr)); 52930f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 53030f712c9SDave Chinner } 53130f712c9SDave Chinner 53230f712c9SDave Chinner /* 53330f712c9SDave Chinner * Add a name/value pair to the shortform attribute list. 53430f712c9SDave Chinner * Overflow from the inode has already been checked for. 53530f712c9SDave Chinner */ 53630f712c9SDave Chinner void 53730f712c9SDave Chinner xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff) 53830f712c9SDave Chinner { 53930f712c9SDave Chinner xfs_attr_shortform_t *sf; 54030f712c9SDave Chinner xfs_attr_sf_entry_t *sfe; 54130f712c9SDave Chinner int i, offset, size; 54230f712c9SDave Chinner xfs_mount_t *mp; 54330f712c9SDave Chinner xfs_inode_t *dp; 54430f712c9SDave Chinner xfs_ifork_t *ifp; 54530f712c9SDave Chinner 54630f712c9SDave Chinner trace_xfs_attr_sf_add(args); 54730f712c9SDave Chinner 54830f712c9SDave Chinner dp = args->dp; 54930f712c9SDave Chinner mp = dp->i_mount; 55030f712c9SDave Chinner dp->i_d.di_forkoff = forkoff; 55130f712c9SDave Chinner 55230f712c9SDave Chinner ifp = dp->i_afp; 55330f712c9SDave Chinner ASSERT(ifp->if_flags & XFS_IFINLINE); 55430f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 55530f712c9SDave Chinner sfe = &sf->list[0]; 55630f712c9SDave Chinner for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { 55730f712c9SDave Chinner #ifdef DEBUG 55830f712c9SDave Chinner if (sfe->namelen != args->namelen) 55930f712c9SDave Chinner continue; 56030f712c9SDave Chinner if (memcmp(args->name, sfe->nameval, args->namelen) != 0) 56130f712c9SDave Chinner continue; 56230f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 56330f712c9SDave Chinner continue; 56430f712c9SDave Chinner ASSERT(0); 56530f712c9SDave Chinner #endif 56630f712c9SDave Chinner } 56730f712c9SDave Chinner 56830f712c9SDave Chinner offset = (char *)sfe - (char *)sf; 56930f712c9SDave Chinner size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen); 57030f712c9SDave Chinner xfs_idata_realloc(dp, size, XFS_ATTR_FORK); 57130f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 57230f712c9SDave Chinner sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset); 57330f712c9SDave Chinner 57430f712c9SDave Chinner sfe->namelen = args->namelen; 57530f712c9SDave Chinner sfe->valuelen = args->valuelen; 57630f712c9SDave Chinner sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags); 57730f712c9SDave Chinner memcpy(sfe->nameval, args->name, args->namelen); 57830f712c9SDave Chinner memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen); 57930f712c9SDave Chinner sf->hdr.count++; 58030f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, size); 58130f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA); 58230f712c9SDave Chinner 58330f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 58430f712c9SDave Chinner } 58530f712c9SDave Chinner 58630f712c9SDave Chinner /* 58730f712c9SDave Chinner * After the last attribute is removed revert to original inode format, 58830f712c9SDave Chinner * making all literal area available to the data fork once more. 58930f712c9SDave Chinner */ 5906dfe5a04SDave Chinner void 5916dfe5a04SDave Chinner xfs_attr_fork_remove( 59230f712c9SDave Chinner struct xfs_inode *ip, 59330f712c9SDave Chinner struct xfs_trans *tp) 59430f712c9SDave Chinner { 59530f712c9SDave Chinner xfs_idestroy_fork(ip, XFS_ATTR_FORK); 59630f712c9SDave Chinner ip->i_d.di_forkoff = 0; 59730f712c9SDave Chinner ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS; 59830f712c9SDave Chinner 59930f712c9SDave Chinner ASSERT(ip->i_d.di_anextents == 0); 60030f712c9SDave Chinner ASSERT(ip->i_afp == NULL); 60130f712c9SDave Chinner 60230f712c9SDave Chinner xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); 60330f712c9SDave Chinner } 60430f712c9SDave Chinner 60530f712c9SDave Chinner /* 60630f712c9SDave Chinner * Remove an attribute from the shortform attribute list structure. 60730f712c9SDave Chinner */ 60830f712c9SDave Chinner int 60930f712c9SDave Chinner xfs_attr_shortform_remove(xfs_da_args_t *args) 61030f712c9SDave Chinner { 61130f712c9SDave Chinner xfs_attr_shortform_t *sf; 61230f712c9SDave Chinner xfs_attr_sf_entry_t *sfe; 61330f712c9SDave Chinner int base, size=0, end, totsize, i; 61430f712c9SDave Chinner xfs_mount_t *mp; 61530f712c9SDave Chinner xfs_inode_t *dp; 61630f712c9SDave Chinner 61730f712c9SDave Chinner trace_xfs_attr_sf_remove(args); 61830f712c9SDave Chinner 61930f712c9SDave Chinner dp = args->dp; 62030f712c9SDave Chinner mp = dp->i_mount; 62130f712c9SDave Chinner base = sizeof(xfs_attr_sf_hdr_t); 62230f712c9SDave Chinner sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data; 62330f712c9SDave Chinner sfe = &sf->list[0]; 62430f712c9SDave Chinner end = sf->hdr.count; 62530f712c9SDave Chinner for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), 62630f712c9SDave Chinner base += size, i++) { 62730f712c9SDave Chinner size = XFS_ATTR_SF_ENTSIZE(sfe); 62830f712c9SDave Chinner if (sfe->namelen != args->namelen) 62930f712c9SDave Chinner continue; 63030f712c9SDave Chinner if (memcmp(sfe->nameval, args->name, args->namelen) != 0) 63130f712c9SDave Chinner continue; 63230f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 63330f712c9SDave Chinner continue; 63430f712c9SDave Chinner break; 63530f712c9SDave Chinner } 63630f712c9SDave Chinner if (i == end) 6372451337dSDave Chinner return -ENOATTR; 63830f712c9SDave Chinner 63930f712c9SDave Chinner /* 64030f712c9SDave Chinner * Fix up the attribute fork data, covering the hole 64130f712c9SDave Chinner */ 64230f712c9SDave Chinner end = base + size; 64330f712c9SDave Chinner totsize = be16_to_cpu(sf->hdr.totsize); 64430f712c9SDave Chinner if (end != totsize) 64530f712c9SDave Chinner memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end); 64630f712c9SDave Chinner sf->hdr.count--; 64730f712c9SDave Chinner be16_add_cpu(&sf->hdr.totsize, -size); 64830f712c9SDave Chinner 64930f712c9SDave Chinner /* 65030f712c9SDave Chinner * Fix up the start offset of the attribute fork 65130f712c9SDave Chinner */ 65230f712c9SDave Chinner totsize -= size; 65330f712c9SDave Chinner if (totsize == sizeof(xfs_attr_sf_hdr_t) && 65430f712c9SDave Chinner (mp->m_flags & XFS_MOUNT_ATTR2) && 65530f712c9SDave Chinner (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) && 65630f712c9SDave Chinner !(args->op_flags & XFS_DA_OP_ADDNAME)) { 6576dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 65830f712c9SDave Chinner } else { 65930f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 66030f712c9SDave Chinner dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize); 66130f712c9SDave Chinner ASSERT(dp->i_d.di_forkoff); 66230f712c9SDave Chinner ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) || 66330f712c9SDave Chinner (args->op_flags & XFS_DA_OP_ADDNAME) || 66430f712c9SDave Chinner !(mp->m_flags & XFS_MOUNT_ATTR2) || 66530f712c9SDave Chinner dp->i_d.di_format == XFS_DINODE_FMT_BTREE); 66630f712c9SDave Chinner xfs_trans_log_inode(args->trans, dp, 66730f712c9SDave Chinner XFS_ILOG_CORE | XFS_ILOG_ADATA); 66830f712c9SDave Chinner } 66930f712c9SDave Chinner 67030f712c9SDave Chinner xfs_sbversion_add_attr2(mp, args->trans); 67130f712c9SDave Chinner 67230f712c9SDave Chinner return 0; 67330f712c9SDave Chinner } 67430f712c9SDave Chinner 67530f712c9SDave Chinner /* 67630f712c9SDave Chinner * Look up a name in a shortform attribute list structure. 67730f712c9SDave Chinner */ 67830f712c9SDave Chinner /*ARGSUSED*/ 67930f712c9SDave Chinner int 68030f712c9SDave Chinner xfs_attr_shortform_lookup(xfs_da_args_t *args) 68130f712c9SDave Chinner { 68230f712c9SDave Chinner xfs_attr_shortform_t *sf; 68330f712c9SDave Chinner xfs_attr_sf_entry_t *sfe; 68430f712c9SDave Chinner int i; 68530f712c9SDave Chinner xfs_ifork_t *ifp; 68630f712c9SDave Chinner 68730f712c9SDave Chinner trace_xfs_attr_sf_lookup(args); 68830f712c9SDave Chinner 68930f712c9SDave Chinner ifp = args->dp->i_afp; 69030f712c9SDave Chinner ASSERT(ifp->if_flags & XFS_IFINLINE); 69130f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 69230f712c9SDave Chinner sfe = &sf->list[0]; 69330f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 69430f712c9SDave Chinner sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { 69530f712c9SDave Chinner if (sfe->namelen != args->namelen) 69630f712c9SDave Chinner continue; 69730f712c9SDave Chinner if (memcmp(args->name, sfe->nameval, args->namelen) != 0) 69830f712c9SDave Chinner continue; 69930f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 70030f712c9SDave Chinner continue; 7012451337dSDave Chinner return -EEXIST; 70230f712c9SDave Chinner } 7032451337dSDave Chinner return -ENOATTR; 70430f712c9SDave Chinner } 70530f712c9SDave Chinner 70630f712c9SDave Chinner /* 70730f712c9SDave Chinner * Look up a name in a shortform attribute list structure. 70830f712c9SDave Chinner */ 70930f712c9SDave Chinner /*ARGSUSED*/ 71030f712c9SDave Chinner int 71130f712c9SDave Chinner xfs_attr_shortform_getvalue(xfs_da_args_t *args) 71230f712c9SDave Chinner { 71330f712c9SDave Chinner xfs_attr_shortform_t *sf; 71430f712c9SDave Chinner xfs_attr_sf_entry_t *sfe; 71530f712c9SDave Chinner int i; 71630f712c9SDave Chinner 71730f712c9SDave Chinner ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE); 71830f712c9SDave Chinner sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data; 71930f712c9SDave Chinner sfe = &sf->list[0]; 72030f712c9SDave Chinner for (i = 0; i < sf->hdr.count; 72130f712c9SDave Chinner sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) { 72230f712c9SDave Chinner if (sfe->namelen != args->namelen) 72330f712c9SDave Chinner continue; 72430f712c9SDave Chinner if (memcmp(args->name, sfe->nameval, args->namelen) != 0) 72530f712c9SDave Chinner continue; 72630f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, sfe->flags)) 72730f712c9SDave Chinner continue; 72830f712c9SDave Chinner if (args->flags & ATTR_KERNOVAL) { 72930f712c9SDave Chinner args->valuelen = sfe->valuelen; 7302451337dSDave Chinner return -EEXIST; 73130f712c9SDave Chinner } 73230f712c9SDave Chinner if (args->valuelen < sfe->valuelen) { 73330f712c9SDave Chinner args->valuelen = sfe->valuelen; 7342451337dSDave Chinner return -ERANGE; 73530f712c9SDave Chinner } 73630f712c9SDave Chinner args->valuelen = sfe->valuelen; 73730f712c9SDave Chinner memcpy(args->value, &sfe->nameval[args->namelen], 73830f712c9SDave Chinner args->valuelen); 7392451337dSDave Chinner return -EEXIST; 74030f712c9SDave Chinner } 7412451337dSDave Chinner return -ENOATTR; 74230f712c9SDave Chinner } 74330f712c9SDave Chinner 74430f712c9SDave Chinner /* 7456e643cd0SDarrick J. Wong * Convert from using the shortform to the leaf. On success, return the 7466e643cd0SDarrick J. Wong * buffer so that we can keep it locked until we're totally done with it. 74730f712c9SDave Chinner */ 74830f712c9SDave Chinner int 7496e643cd0SDarrick J. Wong xfs_attr_shortform_to_leaf( 7506e643cd0SDarrick J. Wong struct xfs_da_args *args, 7516e643cd0SDarrick J. Wong struct xfs_buf **leaf_bp) 75230f712c9SDave Chinner { 75332a9b7c6SBrian Foster struct xfs_inode *dp; 75432a9b7c6SBrian Foster struct xfs_attr_shortform *sf; 75532a9b7c6SBrian Foster struct xfs_attr_sf_entry *sfe; 75632a9b7c6SBrian Foster struct xfs_da_args nargs; 75730f712c9SDave Chinner char *tmpbuffer; 75830f712c9SDave Chinner int error, i, size; 75930f712c9SDave Chinner xfs_dablk_t blkno; 76030f712c9SDave Chinner struct xfs_buf *bp; 76132a9b7c6SBrian Foster struct xfs_ifork *ifp; 76230f712c9SDave Chinner 76330f712c9SDave Chinner trace_xfs_attr_sf_to_leaf(args); 76430f712c9SDave Chinner 76530f712c9SDave Chinner dp = args->dp; 76630f712c9SDave Chinner ifp = dp->i_afp; 76730f712c9SDave Chinner sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data; 76830f712c9SDave Chinner size = be16_to_cpu(sf->hdr.totsize); 76930f712c9SDave Chinner tmpbuffer = kmem_alloc(size, KM_SLEEP); 77030f712c9SDave Chinner ASSERT(tmpbuffer != NULL); 77130f712c9SDave Chinner memcpy(tmpbuffer, ifp->if_u1.if_data, size); 77230f712c9SDave Chinner sf = (xfs_attr_shortform_t *)tmpbuffer; 77330f712c9SDave Chinner 77430f712c9SDave Chinner xfs_idata_realloc(dp, -size, XFS_ATTR_FORK); 77530f712c9SDave Chinner xfs_bmap_local_to_extents_empty(dp, XFS_ATTR_FORK); 77630f712c9SDave Chinner 77730f712c9SDave Chinner bp = NULL; 77830f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 77930f712c9SDave Chinner if (error) { 78030f712c9SDave Chinner /* 78130f712c9SDave Chinner * If we hit an IO error middle of the transaction inside 78230f712c9SDave Chinner * grow_inode(), we may have inconsistent data. Bail out. 78330f712c9SDave Chinner */ 7842451337dSDave Chinner if (error == -EIO) 78530f712c9SDave Chinner goto out; 78630f712c9SDave Chinner xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */ 78730f712c9SDave Chinner memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */ 78830f712c9SDave Chinner goto out; 78930f712c9SDave Chinner } 79030f712c9SDave Chinner 79130f712c9SDave Chinner ASSERT(blkno == 0); 79230f712c9SDave Chinner error = xfs_attr3_leaf_create(args, blkno, &bp); 79330f712c9SDave Chinner if (error) { 794bb3d48dcSEric Sandeen /* xfs_attr3_leaf_create may not have instantiated a block */ 795bb3d48dcSEric Sandeen if (bp && (xfs_da_shrink_inode(args, 0, bp) != 0)) 79630f712c9SDave Chinner goto out; 79730f712c9SDave Chinner xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */ 79830f712c9SDave Chinner memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */ 79930f712c9SDave Chinner goto out; 80030f712c9SDave Chinner } 80130f712c9SDave Chinner 80230f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 80330f712c9SDave Chinner nargs.dp = dp; 80430f712c9SDave Chinner nargs.geo = args->geo; 80530f712c9SDave Chinner nargs.total = args->total; 80630f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 80730f712c9SDave Chinner nargs.trans = args->trans; 80830f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 80930f712c9SDave Chinner 81030f712c9SDave Chinner sfe = &sf->list[0]; 81130f712c9SDave Chinner for (i = 0; i < sf->hdr.count; i++) { 81230f712c9SDave Chinner nargs.name = sfe->nameval; 81330f712c9SDave Chinner nargs.namelen = sfe->namelen; 81430f712c9SDave Chinner nargs.value = &sfe->nameval[nargs.namelen]; 81530f712c9SDave Chinner nargs.valuelen = sfe->valuelen; 81630f712c9SDave Chinner nargs.hashval = xfs_da_hashname(sfe->nameval, 81730f712c9SDave Chinner sfe->namelen); 81830f712c9SDave Chinner nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags); 81930f712c9SDave Chinner error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */ 8202451337dSDave Chinner ASSERT(error == -ENOATTR); 82130f712c9SDave Chinner error = xfs_attr3_leaf_add(bp, &nargs); 8222451337dSDave Chinner ASSERT(error != -ENOSPC); 82330f712c9SDave Chinner if (error) 82430f712c9SDave Chinner goto out; 82530f712c9SDave Chinner sfe = XFS_ATTR_SF_NEXTENTRY(sfe); 82630f712c9SDave Chinner } 82730f712c9SDave Chinner error = 0; 8286e643cd0SDarrick J. Wong *leaf_bp = bp; 82930f712c9SDave Chinner out: 83030f712c9SDave Chinner kmem_free(tmpbuffer); 83130f712c9SDave Chinner return error; 83230f712c9SDave Chinner } 83330f712c9SDave Chinner 83430f712c9SDave Chinner /* 83530f712c9SDave Chinner * Check a leaf attribute block to see if all the entries would fit into 83630f712c9SDave Chinner * a shortform attribute list. 83730f712c9SDave Chinner */ 83830f712c9SDave Chinner int 83930f712c9SDave Chinner xfs_attr_shortform_allfit( 84030f712c9SDave Chinner struct xfs_buf *bp, 84130f712c9SDave Chinner struct xfs_inode *dp) 84230f712c9SDave Chinner { 84330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 84430f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 84530f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 84630f712c9SDave Chinner struct xfs_attr3_icleaf_hdr leafhdr; 84730f712c9SDave Chinner int bytes; 84830f712c9SDave Chinner int i; 8492f661241SBrian Foster struct xfs_mount *mp = bp->b_target->bt_mount; 85030f712c9SDave Chinner 85130f712c9SDave Chinner leaf = bp->b_addr; 8522f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &leafhdr, leaf); 85330f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 85430f712c9SDave Chinner 85530f712c9SDave Chinner bytes = sizeof(struct xfs_attr_sf_hdr); 85630f712c9SDave Chinner for (i = 0; i < leafhdr.count; entry++, i++) { 85730f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 85830f712c9SDave Chinner continue; /* don't copy partial entries */ 85930f712c9SDave Chinner if (!(entry->flags & XFS_ATTR_LOCAL)) 86030f712c9SDave Chinner return 0; 86130f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 86230f712c9SDave Chinner if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX) 86330f712c9SDave Chinner return 0; 86430f712c9SDave Chinner if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX) 86530f712c9SDave Chinner return 0; 86630f712c9SDave Chinner bytes += sizeof(struct xfs_attr_sf_entry) - 1 86730f712c9SDave Chinner + name_loc->namelen 86830f712c9SDave Chinner + be16_to_cpu(name_loc->valuelen); 86930f712c9SDave Chinner } 87030f712c9SDave Chinner if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) && 87130f712c9SDave Chinner (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) && 87230f712c9SDave Chinner (bytes == sizeof(struct xfs_attr_sf_hdr))) 87330f712c9SDave Chinner return -1; 87430f712c9SDave Chinner return xfs_attr_shortform_bytesfit(dp, bytes); 87530f712c9SDave Chinner } 87630f712c9SDave Chinner 8771e1bbd8eSDarrick J. Wong /* Verify the consistency of an inline attribute fork. */ 8781e1bbd8eSDarrick J. Wong xfs_failaddr_t 8791e1bbd8eSDarrick J. Wong xfs_attr_shortform_verify( 8801e1bbd8eSDarrick J. Wong struct xfs_inode *ip) 8811e1bbd8eSDarrick J. Wong { 8821e1bbd8eSDarrick J. Wong struct xfs_attr_shortform *sfp; 8831e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *sfep; 8841e1bbd8eSDarrick J. Wong struct xfs_attr_sf_entry *next_sfep; 8851e1bbd8eSDarrick J. Wong char *endp; 8861e1bbd8eSDarrick J. Wong struct xfs_ifork *ifp; 8871e1bbd8eSDarrick J. Wong int i; 8881e1bbd8eSDarrick J. Wong int size; 8891e1bbd8eSDarrick J. Wong 8901e1bbd8eSDarrick J. Wong ASSERT(ip->i_d.di_aformat == XFS_DINODE_FMT_LOCAL); 8911e1bbd8eSDarrick J. Wong ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK); 8921e1bbd8eSDarrick J. Wong sfp = (struct xfs_attr_shortform *)ifp->if_u1.if_data; 8931e1bbd8eSDarrick J. Wong size = ifp->if_bytes; 8941e1bbd8eSDarrick J. Wong 8951e1bbd8eSDarrick J. Wong /* 8961e1bbd8eSDarrick J. Wong * Give up if the attribute is way too short. 8971e1bbd8eSDarrick J. Wong */ 8981e1bbd8eSDarrick J. Wong if (size < sizeof(struct xfs_attr_sf_hdr)) 8991e1bbd8eSDarrick J. Wong return __this_address; 9001e1bbd8eSDarrick J. Wong 9011e1bbd8eSDarrick J. Wong endp = (char *)sfp + size; 9021e1bbd8eSDarrick J. Wong 9031e1bbd8eSDarrick J. Wong /* Check all reported entries */ 9041e1bbd8eSDarrick J. Wong sfep = &sfp->list[0]; 9051e1bbd8eSDarrick J. Wong for (i = 0; i < sfp->hdr.count; i++) { 9061e1bbd8eSDarrick J. Wong /* 9071e1bbd8eSDarrick J. Wong * struct xfs_attr_sf_entry has a variable length. 9081e1bbd8eSDarrick J. Wong * Check the fixed-offset parts of the structure are 9091e1bbd8eSDarrick J. Wong * within the data buffer. 9101e1bbd8eSDarrick J. Wong */ 9111e1bbd8eSDarrick J. Wong if (((char *)sfep + sizeof(*sfep)) >= endp) 9121e1bbd8eSDarrick J. Wong return __this_address; 9131e1bbd8eSDarrick J. Wong 9141e1bbd8eSDarrick J. Wong /* Don't allow names with known bad length. */ 9151e1bbd8eSDarrick J. Wong if (sfep->namelen == 0) 9161e1bbd8eSDarrick J. Wong return __this_address; 9171e1bbd8eSDarrick J. Wong 9181e1bbd8eSDarrick J. Wong /* 9191e1bbd8eSDarrick J. Wong * Check that the variable-length part of the structure is 9201e1bbd8eSDarrick J. Wong * within the data buffer. The next entry starts after the 9211e1bbd8eSDarrick J. Wong * name component, so nextentry is an acceptable test. 9221e1bbd8eSDarrick J. Wong */ 9231e1bbd8eSDarrick J. Wong next_sfep = XFS_ATTR_SF_NEXTENTRY(sfep); 9241e1bbd8eSDarrick J. Wong if ((char *)next_sfep > endp) 9251e1bbd8eSDarrick J. Wong return __this_address; 9261e1bbd8eSDarrick J. Wong 9271e1bbd8eSDarrick J. Wong /* 9281e1bbd8eSDarrick J. Wong * Check for unknown flags. Short form doesn't support 9291e1bbd8eSDarrick J. Wong * the incomplete or local bits, so we can use the namespace 9301e1bbd8eSDarrick J. Wong * mask here. 9311e1bbd8eSDarrick J. Wong */ 9321e1bbd8eSDarrick J. Wong if (sfep->flags & ~XFS_ATTR_NSP_ONDISK_MASK) 9331e1bbd8eSDarrick J. Wong return __this_address; 9341e1bbd8eSDarrick J. Wong 9351e1bbd8eSDarrick J. Wong /* 9361e1bbd8eSDarrick J. Wong * Check for invalid namespace combinations. We only allow 9371e1bbd8eSDarrick J. Wong * one namespace flag per xattr, so we can just count the 9381e1bbd8eSDarrick J. Wong * bits (i.e. hweight) here. 9391e1bbd8eSDarrick J. Wong */ 9401e1bbd8eSDarrick J. Wong if (hweight8(sfep->flags & XFS_ATTR_NSP_ONDISK_MASK) > 1) 9411e1bbd8eSDarrick J. Wong return __this_address; 9421e1bbd8eSDarrick J. Wong 9431e1bbd8eSDarrick J. Wong sfep = next_sfep; 9441e1bbd8eSDarrick J. Wong } 9451e1bbd8eSDarrick J. Wong if ((void *)sfep != (void *)endp) 9461e1bbd8eSDarrick J. Wong return __this_address; 9471e1bbd8eSDarrick J. Wong 9481e1bbd8eSDarrick J. Wong return NULL; 9491e1bbd8eSDarrick J. Wong } 9501e1bbd8eSDarrick J. Wong 95130f712c9SDave Chinner /* 95230f712c9SDave Chinner * Convert a leaf attribute list to shortform attribute list 95330f712c9SDave Chinner */ 95430f712c9SDave Chinner int 95530f712c9SDave Chinner xfs_attr3_leaf_to_shortform( 95630f712c9SDave Chinner struct xfs_buf *bp, 95730f712c9SDave Chinner struct xfs_da_args *args, 95830f712c9SDave Chinner int forkoff) 95930f712c9SDave Chinner { 96030f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 96130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 96230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 96330f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 96430f712c9SDave Chinner struct xfs_da_args nargs; 96530f712c9SDave Chinner struct xfs_inode *dp = args->dp; 96630f712c9SDave Chinner char *tmpbuffer; 96730f712c9SDave Chinner int error; 96830f712c9SDave Chinner int i; 96930f712c9SDave Chinner 97030f712c9SDave Chinner trace_xfs_attr_leaf_to_sf(args); 97130f712c9SDave Chinner 97230f712c9SDave Chinner tmpbuffer = kmem_alloc(args->geo->blksize, KM_SLEEP); 97330f712c9SDave Chinner if (!tmpbuffer) 9742451337dSDave Chinner return -ENOMEM; 97530f712c9SDave Chinner 97630f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 97730f712c9SDave Chinner 97830f712c9SDave Chinner leaf = (xfs_attr_leafblock_t *)tmpbuffer; 9792f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 98030f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 98130f712c9SDave Chinner 98230f712c9SDave Chinner /* XXX (dgc): buffer is about to be marked stale - why zero it? */ 98330f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 98430f712c9SDave Chinner 98530f712c9SDave Chinner /* 98630f712c9SDave Chinner * Clean out the prior contents of the attribute list. 98730f712c9SDave Chinner */ 98830f712c9SDave Chinner error = xfs_da_shrink_inode(args, 0, bp); 98930f712c9SDave Chinner if (error) 99030f712c9SDave Chinner goto out; 99130f712c9SDave Chinner 99230f712c9SDave Chinner if (forkoff == -1) { 99330f712c9SDave Chinner ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2); 99430f712c9SDave Chinner ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE); 9956dfe5a04SDave Chinner xfs_attr_fork_remove(dp, args->trans); 99630f712c9SDave Chinner goto out; 99730f712c9SDave Chinner } 99830f712c9SDave Chinner 99930f712c9SDave Chinner xfs_attr_shortform_create(args); 100030f712c9SDave Chinner 100130f712c9SDave Chinner /* 100230f712c9SDave Chinner * Copy the attributes 100330f712c9SDave Chinner */ 100430f712c9SDave Chinner memset((char *)&nargs, 0, sizeof(nargs)); 100530f712c9SDave Chinner nargs.geo = args->geo; 100630f712c9SDave Chinner nargs.dp = dp; 100730f712c9SDave Chinner nargs.total = args->total; 100830f712c9SDave Chinner nargs.whichfork = XFS_ATTR_FORK; 100930f712c9SDave Chinner nargs.trans = args->trans; 101030f712c9SDave Chinner nargs.op_flags = XFS_DA_OP_OKNOENT; 101130f712c9SDave Chinner 101230f712c9SDave Chinner for (i = 0; i < ichdr.count; entry++, i++) { 101330f712c9SDave Chinner if (entry->flags & XFS_ATTR_INCOMPLETE) 101430f712c9SDave Chinner continue; /* don't copy partial entries */ 101530f712c9SDave Chinner if (!entry->nameidx) 101630f712c9SDave Chinner continue; 101730f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_LOCAL); 101830f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, i); 101930f712c9SDave Chinner nargs.name = name_loc->nameval; 102030f712c9SDave Chinner nargs.namelen = name_loc->namelen; 102130f712c9SDave Chinner nargs.value = &name_loc->nameval[nargs.namelen]; 102230f712c9SDave Chinner nargs.valuelen = be16_to_cpu(name_loc->valuelen); 102330f712c9SDave Chinner nargs.hashval = be32_to_cpu(entry->hashval); 102430f712c9SDave Chinner nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags); 102530f712c9SDave Chinner xfs_attr_shortform_add(&nargs, forkoff); 102630f712c9SDave Chinner } 102730f712c9SDave Chinner error = 0; 102830f712c9SDave Chinner 102930f712c9SDave Chinner out: 103030f712c9SDave Chinner kmem_free(tmpbuffer); 103130f712c9SDave Chinner return error; 103230f712c9SDave Chinner } 103330f712c9SDave Chinner 103430f712c9SDave Chinner /* 103530f712c9SDave Chinner * Convert from using a single leaf to a root node and a leaf. 103630f712c9SDave Chinner */ 103730f712c9SDave Chinner int 103830f712c9SDave Chinner xfs_attr3_leaf_to_node( 103930f712c9SDave Chinner struct xfs_da_args *args) 104030f712c9SDave Chinner { 104130f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 104230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr icleafhdr; 104330f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 104430f712c9SDave Chinner struct xfs_da_node_entry *btree; 104530f712c9SDave Chinner struct xfs_da3_icnode_hdr icnodehdr; 104630f712c9SDave Chinner struct xfs_da_intnode *node; 104730f712c9SDave Chinner struct xfs_inode *dp = args->dp; 104830f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 104930f712c9SDave Chinner struct xfs_buf *bp1 = NULL; 105030f712c9SDave Chinner struct xfs_buf *bp2 = NULL; 105130f712c9SDave Chinner xfs_dablk_t blkno; 105230f712c9SDave Chinner int error; 105330f712c9SDave Chinner 105430f712c9SDave Chinner trace_xfs_attr_leaf_to_node(args); 105530f712c9SDave Chinner 105630f712c9SDave Chinner error = xfs_da_grow_inode(args, &blkno); 105730f712c9SDave Chinner if (error) 105830f712c9SDave Chinner goto out; 105930f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, dp, 0, -1, &bp1); 106030f712c9SDave Chinner if (error) 106130f712c9SDave Chinner goto out; 106230f712c9SDave Chinner 106330f712c9SDave Chinner error = xfs_da_get_buf(args->trans, dp, blkno, -1, &bp2, XFS_ATTR_FORK); 106430f712c9SDave Chinner if (error) 106530f712c9SDave Chinner goto out; 106630f712c9SDave Chinner 106730f712c9SDave Chinner /* copy leaf to new buffer, update identifiers */ 106830f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF); 106930f712c9SDave Chinner bp2->b_ops = bp1->b_ops; 107030f712c9SDave Chinner memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize); 107130f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 107230f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp2->b_addr; 107330f712c9SDave Chinner hdr3->blkno = cpu_to_be64(bp2->b_bn); 107430f712c9SDave Chinner } 107530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1); 107630f712c9SDave Chinner 107730f712c9SDave Chinner /* 107830f712c9SDave Chinner * Set up the new root node. 107930f712c9SDave Chinner */ 108030f712c9SDave Chinner error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK); 108130f712c9SDave Chinner if (error) 108230f712c9SDave Chinner goto out; 108330f712c9SDave Chinner node = bp1->b_addr; 108430f712c9SDave Chinner dp->d_ops->node_hdr_from_disk(&icnodehdr, node); 108530f712c9SDave Chinner btree = dp->d_ops->node_tree_p(node); 108630f712c9SDave Chinner 108730f712c9SDave Chinner leaf = bp2->b_addr; 10882f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &icleafhdr, leaf); 108930f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 109030f712c9SDave Chinner 109130f712c9SDave Chinner /* both on-disk, don't endian-flip twice */ 109230f712c9SDave Chinner btree[0].hashval = entries[icleafhdr.count - 1].hashval; 109330f712c9SDave Chinner btree[0].before = cpu_to_be32(blkno); 109430f712c9SDave Chinner icnodehdr.count = 1; 109530f712c9SDave Chinner dp->d_ops->node_hdr_to_disk(node, &icnodehdr); 109630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1); 109730f712c9SDave Chinner error = 0; 109830f712c9SDave Chinner out: 109930f712c9SDave Chinner return error; 110030f712c9SDave Chinner } 110130f712c9SDave Chinner 110230f712c9SDave Chinner /*======================================================================== 110330f712c9SDave Chinner * Routines used for growing the Btree. 110430f712c9SDave Chinner *========================================================================*/ 110530f712c9SDave Chinner 110630f712c9SDave Chinner /* 110730f712c9SDave Chinner * Create the initial contents of a leaf attribute list 110830f712c9SDave Chinner * or a leaf in a node attribute list. 110930f712c9SDave Chinner */ 111030f712c9SDave Chinner STATIC int 111130f712c9SDave Chinner xfs_attr3_leaf_create( 111230f712c9SDave Chinner struct xfs_da_args *args, 111330f712c9SDave Chinner xfs_dablk_t blkno, 111430f712c9SDave Chinner struct xfs_buf **bpp) 111530f712c9SDave Chinner { 111630f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 111730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 111830f712c9SDave Chinner struct xfs_inode *dp = args->dp; 111930f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 112030f712c9SDave Chinner struct xfs_buf *bp; 112130f712c9SDave Chinner int error; 112230f712c9SDave Chinner 112330f712c9SDave Chinner trace_xfs_attr_leaf_create(args); 112430f712c9SDave Chinner 112530f712c9SDave Chinner error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp, 112630f712c9SDave Chinner XFS_ATTR_FORK); 112730f712c9SDave Chinner if (error) 112830f712c9SDave Chinner return error; 112930f712c9SDave Chinner bp->b_ops = &xfs_attr3_leaf_buf_ops; 113030f712c9SDave Chinner xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF); 113130f712c9SDave Chinner leaf = bp->b_addr; 113230f712c9SDave Chinner memset(leaf, 0, args->geo->blksize); 113330f712c9SDave Chinner 113430f712c9SDave Chinner memset(&ichdr, 0, sizeof(ichdr)); 113530f712c9SDave Chinner ichdr.firstused = args->geo->blksize; 113630f712c9SDave Chinner 113730f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 113830f712c9SDave Chinner struct xfs_da3_blkinfo *hdr3 = bp->b_addr; 113930f712c9SDave Chinner 114030f712c9SDave Chinner ichdr.magic = XFS_ATTR3_LEAF_MAGIC; 114130f712c9SDave Chinner 114230f712c9SDave Chinner hdr3->blkno = cpu_to_be64(bp->b_bn); 114330f712c9SDave Chinner hdr3->owner = cpu_to_be64(dp->i_ino); 1144ce748eaaSEric Sandeen uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); 114530f712c9SDave Chinner 114630f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr); 114730f712c9SDave Chinner } else { 114830f712c9SDave Chinner ichdr.magic = XFS_ATTR_LEAF_MAGIC; 114930f712c9SDave Chinner ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr); 115030f712c9SDave Chinner } 115130f712c9SDave Chinner ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base; 115230f712c9SDave Chinner 11532f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 115430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1); 115530f712c9SDave Chinner 115630f712c9SDave Chinner *bpp = bp; 115730f712c9SDave Chinner return 0; 115830f712c9SDave Chinner } 115930f712c9SDave Chinner 116030f712c9SDave Chinner /* 116130f712c9SDave Chinner * Split the leaf node, rebalance, then add the new entry. 116230f712c9SDave Chinner */ 116330f712c9SDave Chinner int 116430f712c9SDave Chinner xfs_attr3_leaf_split( 116530f712c9SDave Chinner struct xfs_da_state *state, 116630f712c9SDave Chinner struct xfs_da_state_blk *oldblk, 116730f712c9SDave Chinner struct xfs_da_state_blk *newblk) 116830f712c9SDave Chinner { 116930f712c9SDave Chinner xfs_dablk_t blkno; 117030f712c9SDave Chinner int error; 117130f712c9SDave Chinner 117230f712c9SDave Chinner trace_xfs_attr_leaf_split(state->args); 117330f712c9SDave Chinner 117430f712c9SDave Chinner /* 117530f712c9SDave Chinner * Allocate space for a new leaf node. 117630f712c9SDave Chinner */ 117730f712c9SDave Chinner ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC); 117830f712c9SDave Chinner error = xfs_da_grow_inode(state->args, &blkno); 117930f712c9SDave Chinner if (error) 118030f712c9SDave Chinner return error; 118130f712c9SDave Chinner error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp); 118230f712c9SDave Chinner if (error) 118330f712c9SDave Chinner return error; 118430f712c9SDave Chinner newblk->blkno = blkno; 118530f712c9SDave Chinner newblk->magic = XFS_ATTR_LEAF_MAGIC; 118630f712c9SDave Chinner 118730f712c9SDave Chinner /* 118830f712c9SDave Chinner * Rebalance the entries across the two leaves. 118930f712c9SDave Chinner * NOTE: rebalance() currently depends on the 2nd block being empty. 119030f712c9SDave Chinner */ 119130f712c9SDave Chinner xfs_attr3_leaf_rebalance(state, oldblk, newblk); 119230f712c9SDave Chinner error = xfs_da3_blk_link(state, oldblk, newblk); 119330f712c9SDave Chinner if (error) 119430f712c9SDave Chinner return error; 119530f712c9SDave Chinner 119630f712c9SDave Chinner /* 119730f712c9SDave Chinner * Save info on "old" attribute for "atomic rename" ops, leaf_add() 119830f712c9SDave Chinner * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the 119930f712c9SDave Chinner * "new" attrs info. Will need the "old" info to remove it later. 120030f712c9SDave Chinner * 120130f712c9SDave Chinner * Insert the "new" entry in the correct block. 120230f712c9SDave Chinner */ 120330f712c9SDave Chinner if (state->inleaf) { 120430f712c9SDave Chinner trace_xfs_attr_leaf_add_old(state->args); 120530f712c9SDave Chinner error = xfs_attr3_leaf_add(oldblk->bp, state->args); 120630f712c9SDave Chinner } else { 120730f712c9SDave Chinner trace_xfs_attr_leaf_add_new(state->args); 120830f712c9SDave Chinner error = xfs_attr3_leaf_add(newblk->bp, state->args); 120930f712c9SDave Chinner } 121030f712c9SDave Chinner 121130f712c9SDave Chinner /* 121230f712c9SDave Chinner * Update last hashval in each block since we added the name. 121330f712c9SDave Chinner */ 121430f712c9SDave Chinner oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL); 121530f712c9SDave Chinner newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL); 121630f712c9SDave Chinner return error; 121730f712c9SDave Chinner } 121830f712c9SDave Chinner 121930f712c9SDave Chinner /* 122030f712c9SDave Chinner * Add a name to the leaf attribute list structure. 122130f712c9SDave Chinner */ 122230f712c9SDave Chinner int 122330f712c9SDave Chinner xfs_attr3_leaf_add( 122430f712c9SDave Chinner struct xfs_buf *bp, 122530f712c9SDave Chinner struct xfs_da_args *args) 122630f712c9SDave Chinner { 122730f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 122830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 122930f712c9SDave Chinner int tablesize; 123030f712c9SDave Chinner int entsize; 123130f712c9SDave Chinner int sum; 123230f712c9SDave Chinner int tmp; 123330f712c9SDave Chinner int i; 123430f712c9SDave Chinner 123530f712c9SDave Chinner trace_xfs_attr_leaf_add(args); 123630f712c9SDave Chinner 123730f712c9SDave Chinner leaf = bp->b_addr; 12382f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 123930f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr.count); 124030f712c9SDave Chinner entsize = xfs_attr_leaf_newentsize(args, NULL); 124130f712c9SDave Chinner 124230f712c9SDave Chinner /* 124330f712c9SDave Chinner * Search through freemap for first-fit on new name length. 124430f712c9SDave Chinner * (may need to figure in size of entry struct too) 124530f712c9SDave Chinner */ 124630f712c9SDave Chinner tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t) 124730f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 124830f712c9SDave Chinner for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) { 124930f712c9SDave Chinner if (tablesize > ichdr.firstused) { 125030f712c9SDave Chinner sum += ichdr.freemap[i].size; 125130f712c9SDave Chinner continue; 125230f712c9SDave Chinner } 125330f712c9SDave Chinner if (!ichdr.freemap[i].size) 125430f712c9SDave Chinner continue; /* no space in this map */ 125530f712c9SDave Chinner tmp = entsize; 125630f712c9SDave Chinner if (ichdr.freemap[i].base < ichdr.firstused) 125730f712c9SDave Chinner tmp += sizeof(xfs_attr_leaf_entry_t); 125830f712c9SDave Chinner if (ichdr.freemap[i].size >= tmp) { 125930f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i); 126030f712c9SDave Chinner goto out_log_hdr; 126130f712c9SDave Chinner } 126230f712c9SDave Chinner sum += ichdr.freemap[i].size; 126330f712c9SDave Chinner } 126430f712c9SDave Chinner 126530f712c9SDave Chinner /* 126630f712c9SDave Chinner * If there are no holes in the address space of the block, 126730f712c9SDave Chinner * and we don't have enough freespace, then compaction will do us 126830f712c9SDave Chinner * no good and we should just give up. 126930f712c9SDave Chinner */ 127030f712c9SDave Chinner if (!ichdr.holes && sum < entsize) 12712451337dSDave Chinner return -ENOSPC; 127230f712c9SDave Chinner 127330f712c9SDave Chinner /* 127430f712c9SDave Chinner * Compact the entries to coalesce free space. 127530f712c9SDave Chinner * This may change the hdr->count via dropping INCOMPLETE entries. 127630f712c9SDave Chinner */ 127730f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr, bp); 127830f712c9SDave Chinner 127930f712c9SDave Chinner /* 128030f712c9SDave Chinner * After compaction, the block is guaranteed to have only one 128130f712c9SDave Chinner * free region, in freemap[0]. If it is not big enough, give up. 128230f712c9SDave Chinner */ 128330f712c9SDave Chinner if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) { 12842451337dSDave Chinner tmp = -ENOSPC; 128530f712c9SDave Chinner goto out_log_hdr; 128630f712c9SDave Chinner } 128730f712c9SDave Chinner 128830f712c9SDave Chinner tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0); 128930f712c9SDave Chinner 129030f712c9SDave Chinner out_log_hdr: 12912f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 129230f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 129330f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 129430f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 129530f712c9SDave Chinner return tmp; 129630f712c9SDave Chinner } 129730f712c9SDave Chinner 129830f712c9SDave Chinner /* 129930f712c9SDave Chinner * Add a name to a leaf attribute list structure. 130030f712c9SDave Chinner */ 130130f712c9SDave Chinner STATIC int 130230f712c9SDave Chinner xfs_attr3_leaf_add_work( 130330f712c9SDave Chinner struct xfs_buf *bp, 130430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr, 130530f712c9SDave Chinner struct xfs_da_args *args, 130630f712c9SDave Chinner int mapindex) 130730f712c9SDave Chinner { 130830f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 130930f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 131030f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 131130f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 131230f712c9SDave Chinner struct xfs_mount *mp; 131330f712c9SDave Chinner int tmp; 131430f712c9SDave Chinner int i; 131530f712c9SDave Chinner 131630f712c9SDave Chinner trace_xfs_attr_leaf_add_work(args); 131730f712c9SDave Chinner 131830f712c9SDave Chinner leaf = bp->b_addr; 131930f712c9SDave Chinner ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE); 132030f712c9SDave Chinner ASSERT(args->index >= 0 && args->index <= ichdr->count); 132130f712c9SDave Chinner 132230f712c9SDave Chinner /* 132330f712c9SDave Chinner * Force open some space in the entry array and fill it in. 132430f712c9SDave Chinner */ 132530f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 132630f712c9SDave Chinner if (args->index < ichdr->count) { 132730f712c9SDave Chinner tmp = ichdr->count - args->index; 132830f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 132930f712c9SDave Chinner memmove(entry + 1, entry, tmp); 133030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 133130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry))); 133230f712c9SDave Chinner } 133330f712c9SDave Chinner ichdr->count++; 133430f712c9SDave Chinner 133530f712c9SDave Chinner /* 133630f712c9SDave Chinner * Allocate space for the new string (at the end of the run). 133730f712c9SDave Chinner */ 133830f712c9SDave Chinner mp = args->trans->t_mountp; 133930f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize); 134030f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0); 134130f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size >= 134230f712c9SDave Chinner xfs_attr_leaf_newentsize(args, NULL)); 134330f712c9SDave Chinner ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize); 134430f712c9SDave Chinner ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0); 134530f712c9SDave Chinner 134630f712c9SDave Chinner ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp); 134730f712c9SDave Chinner 134830f712c9SDave Chinner entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base + 134930f712c9SDave Chinner ichdr->freemap[mapindex].size); 135030f712c9SDave Chinner entry->hashval = cpu_to_be32(args->hashval); 135130f712c9SDave Chinner entry->flags = tmp ? XFS_ATTR_LOCAL : 0; 135230f712c9SDave Chinner entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags); 135330f712c9SDave Chinner if (args->op_flags & XFS_DA_OP_RENAME) { 135430f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 135530f712c9SDave Chinner if ((args->blkno2 == args->blkno) && 135630f712c9SDave Chinner (args->index2 <= args->index)) { 135730f712c9SDave Chinner args->index2++; 135830f712c9SDave Chinner } 135930f712c9SDave Chinner } 136030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 136130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 136230f712c9SDave Chinner ASSERT((args->index == 0) || 136330f712c9SDave Chinner (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval))); 136430f712c9SDave Chinner ASSERT((args->index == ichdr->count - 1) || 136530f712c9SDave Chinner (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval))); 136630f712c9SDave Chinner 136730f712c9SDave Chinner /* 136830f712c9SDave Chinner * For "remote" attribute values, simply note that we need to 136930f712c9SDave Chinner * allocate space for the "remote" value. We can't actually 137030f712c9SDave Chinner * allocate the extents in this transaction, and we can't decide 137130f712c9SDave Chinner * which blocks they should be as we might allocate more blocks 137230f712c9SDave Chinner * as part of this transaction (a split operation for example). 137330f712c9SDave Chinner */ 137430f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 137530f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 137630f712c9SDave Chinner name_loc->namelen = args->namelen; 137730f712c9SDave Chinner name_loc->valuelen = cpu_to_be16(args->valuelen); 137830f712c9SDave Chinner memcpy((char *)name_loc->nameval, args->name, args->namelen); 137930f712c9SDave Chinner memcpy((char *)&name_loc->nameval[args->namelen], args->value, 138030f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 138130f712c9SDave Chinner } else { 138230f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 138330f712c9SDave Chinner name_rmt->namelen = args->namelen; 138430f712c9SDave Chinner memcpy((char *)name_rmt->name, args->name, args->namelen); 138530f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 138630f712c9SDave Chinner /* just in case */ 138730f712c9SDave Chinner name_rmt->valuelen = 0; 138830f712c9SDave Chinner name_rmt->valueblk = 0; 138930f712c9SDave Chinner args->rmtblkno = 1; 139030f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen); 139130f712c9SDave Chinner args->rmtvaluelen = args->valuelen; 139230f712c9SDave Chinner } 139330f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 139430f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 139530f712c9SDave Chinner xfs_attr_leaf_entsize(leaf, args->index))); 139630f712c9SDave Chinner 139730f712c9SDave Chinner /* 139830f712c9SDave Chinner * Update the control info for this leaf node 139930f712c9SDave Chinner */ 140030f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < ichdr->firstused) 140130f712c9SDave Chinner ichdr->firstused = be16_to_cpu(entry->nameidx); 140230f712c9SDave Chinner 140330f712c9SDave Chinner ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t) 140430f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf)); 140530f712c9SDave Chinner tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t) 140630f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 140730f712c9SDave Chinner 140830f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 140930f712c9SDave Chinner if (ichdr->freemap[i].base == tmp) { 141030f712c9SDave Chinner ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t); 141130f712c9SDave Chinner ichdr->freemap[i].size -= sizeof(xfs_attr_leaf_entry_t); 141230f712c9SDave Chinner } 141330f712c9SDave Chinner } 141430f712c9SDave Chinner ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index); 141530f712c9SDave Chinner return 0; 141630f712c9SDave Chinner } 141730f712c9SDave Chinner 141830f712c9SDave Chinner /* 141930f712c9SDave Chinner * Garbage collect a leaf attribute list block by copying it to a new buffer. 142030f712c9SDave Chinner */ 142130f712c9SDave Chinner STATIC void 142230f712c9SDave Chinner xfs_attr3_leaf_compact( 142330f712c9SDave Chinner struct xfs_da_args *args, 142430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_dst, 142530f712c9SDave Chinner struct xfs_buf *bp) 142630f712c9SDave Chinner { 142730f712c9SDave Chinner struct xfs_attr_leafblock *leaf_src; 142830f712c9SDave Chinner struct xfs_attr_leafblock *leaf_dst; 142930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr_src; 143030f712c9SDave Chinner struct xfs_trans *trans = args->trans; 143130f712c9SDave Chinner char *tmpbuffer; 143230f712c9SDave Chinner 143330f712c9SDave Chinner trace_xfs_attr_leaf_compact(args); 143430f712c9SDave Chinner 143530f712c9SDave Chinner tmpbuffer = kmem_alloc(args->geo->blksize, KM_SLEEP); 143630f712c9SDave Chinner memcpy(tmpbuffer, bp->b_addr, args->geo->blksize); 143730f712c9SDave Chinner memset(bp->b_addr, 0, args->geo->blksize); 143830f712c9SDave Chinner leaf_src = (xfs_attr_leafblock_t *)tmpbuffer; 143930f712c9SDave Chinner leaf_dst = bp->b_addr; 144030f712c9SDave Chinner 144130f712c9SDave Chinner /* 144230f712c9SDave Chinner * Copy the on-disk header back into the destination buffer to ensure 144330f712c9SDave Chinner * all the information in the header that is not part of the incore 144430f712c9SDave Chinner * header structure is preserved. 144530f712c9SDave Chinner */ 144630f712c9SDave Chinner memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src)); 144730f712c9SDave Chinner 144830f712c9SDave Chinner /* Initialise the incore headers */ 144930f712c9SDave Chinner ichdr_src = *ichdr_dst; /* struct copy */ 145030f712c9SDave Chinner ichdr_dst->firstused = args->geo->blksize; 145130f712c9SDave Chinner ichdr_dst->usedbytes = 0; 145230f712c9SDave Chinner ichdr_dst->count = 0; 145330f712c9SDave Chinner ichdr_dst->holes = 0; 145430f712c9SDave Chinner ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src); 145530f712c9SDave Chinner ichdr_dst->freemap[0].size = ichdr_dst->firstused - 145630f712c9SDave Chinner ichdr_dst->freemap[0].base; 145730f712c9SDave Chinner 145830f712c9SDave Chinner /* write the header back to initialise the underlying buffer */ 14592f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf_dst, ichdr_dst); 146030f712c9SDave Chinner 146130f712c9SDave Chinner /* 146230f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 146330f712c9SDave Chinner * but allocate name/value pairs packed and in sequence. 146430f712c9SDave Chinner */ 146530f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0, 146630f712c9SDave Chinner leaf_dst, ichdr_dst, 0, ichdr_src.count); 146730f712c9SDave Chinner /* 146830f712c9SDave Chinner * this logs the entire buffer, but the caller must write the header 146930f712c9SDave Chinner * back to the buffer when it is finished modifying it. 147030f712c9SDave Chinner */ 147130f712c9SDave Chinner xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1); 147230f712c9SDave Chinner 147330f712c9SDave Chinner kmem_free(tmpbuffer); 147430f712c9SDave Chinner } 147530f712c9SDave Chinner 147630f712c9SDave Chinner /* 147730f712c9SDave Chinner * Compare two leaf blocks "order". 147830f712c9SDave Chinner * Return 0 unless leaf2 should go before leaf1. 147930f712c9SDave Chinner */ 148030f712c9SDave Chinner static int 148130f712c9SDave Chinner xfs_attr3_leaf_order( 148230f712c9SDave Chinner struct xfs_buf *leaf1_bp, 148330f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf1hdr, 148430f712c9SDave Chinner struct xfs_buf *leaf2_bp, 148530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *leaf2hdr) 148630f712c9SDave Chinner { 148730f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 148830f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 148930f712c9SDave Chinner 149030f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr); 149130f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr); 149230f712c9SDave Chinner if (leaf1hdr->count > 0 && leaf2hdr->count > 0 && 149330f712c9SDave Chinner ((be32_to_cpu(entries2[0].hashval) < 149430f712c9SDave Chinner be32_to_cpu(entries1[0].hashval)) || 149530f712c9SDave Chinner (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) < 149630f712c9SDave Chinner be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) { 149730f712c9SDave Chinner return 1; 149830f712c9SDave Chinner } 149930f712c9SDave Chinner return 0; 150030f712c9SDave Chinner } 150130f712c9SDave Chinner 150230f712c9SDave Chinner int 150330f712c9SDave Chinner xfs_attr_leaf_order( 150430f712c9SDave Chinner struct xfs_buf *leaf1_bp, 150530f712c9SDave Chinner struct xfs_buf *leaf2_bp) 150630f712c9SDave Chinner { 150730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 150830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 15092f661241SBrian Foster struct xfs_mount *mp = leaf1_bp->b_target->bt_mount; 151030f712c9SDave Chinner 15112f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr1, leaf1_bp->b_addr); 15122f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr2, leaf2_bp->b_addr); 151330f712c9SDave Chinner return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2); 151430f712c9SDave Chinner } 151530f712c9SDave Chinner 151630f712c9SDave Chinner /* 151730f712c9SDave Chinner * Redistribute the attribute list entries between two leaf nodes, 151830f712c9SDave Chinner * taking into account the size of the new entry. 151930f712c9SDave Chinner * 152030f712c9SDave Chinner * NOTE: if new block is empty, then it will get the upper half of the 152130f712c9SDave Chinner * old block. At present, all (one) callers pass in an empty second block. 152230f712c9SDave Chinner * 152330f712c9SDave Chinner * This code adjusts the args->index/blkno and args->index2/blkno2 fields 152430f712c9SDave Chinner * to match what it is doing in splitting the attribute leaf block. Those 152530f712c9SDave Chinner * values are used in "atomic rename" operations on attributes. Note that 152630f712c9SDave Chinner * the "new" and "old" values can end up in different blocks. 152730f712c9SDave Chinner */ 152830f712c9SDave Chinner STATIC void 152930f712c9SDave Chinner xfs_attr3_leaf_rebalance( 153030f712c9SDave Chinner struct xfs_da_state *state, 153130f712c9SDave Chinner struct xfs_da_state_blk *blk1, 153230f712c9SDave Chinner struct xfs_da_state_blk *blk2) 153330f712c9SDave Chinner { 153430f712c9SDave Chinner struct xfs_da_args *args; 153530f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 153630f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 153730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 153830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 153930f712c9SDave Chinner struct xfs_attr_leaf_entry *entries1; 154030f712c9SDave Chinner struct xfs_attr_leaf_entry *entries2; 154130f712c9SDave Chinner int count; 154230f712c9SDave Chinner int totallen; 154330f712c9SDave Chinner int max; 154430f712c9SDave Chinner int space; 154530f712c9SDave Chinner int swap; 154630f712c9SDave Chinner 154730f712c9SDave Chinner /* 154830f712c9SDave Chinner * Set up environment. 154930f712c9SDave Chinner */ 155030f712c9SDave Chinner ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC); 155130f712c9SDave Chinner ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC); 155230f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 155330f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 15542f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr1, leaf1); 15552f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, leaf2); 155630f712c9SDave Chinner ASSERT(ichdr2.count == 0); 155730f712c9SDave Chinner args = state->args; 155830f712c9SDave Chinner 155930f712c9SDave Chinner trace_xfs_attr_leaf_rebalance(args); 156030f712c9SDave Chinner 156130f712c9SDave Chinner /* 156230f712c9SDave Chinner * Check ordering of blocks, reverse if it makes things simpler. 156330f712c9SDave Chinner * 156430f712c9SDave Chinner * NOTE: Given that all (current) callers pass in an empty 156530f712c9SDave Chinner * second block, this code should never set "swap". 156630f712c9SDave Chinner */ 156730f712c9SDave Chinner swap = 0; 156830f712c9SDave Chinner if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) { 15691d5bebbaSGustavo A. R. Silva swap(blk1, blk2); 157030f712c9SDave Chinner 15711d5bebbaSGustavo A. R. Silva /* swap structures rather than reconverting them */ 15721d5bebbaSGustavo A. R. Silva swap(ichdr1, ichdr2); 157330f712c9SDave Chinner 157430f712c9SDave Chinner leaf1 = blk1->bp->b_addr; 157530f712c9SDave Chinner leaf2 = blk2->bp->b_addr; 157630f712c9SDave Chinner swap = 1; 157730f712c9SDave Chinner } 157830f712c9SDave Chinner 157930f712c9SDave Chinner /* 158030f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 158130f712c9SDave Chinner * byte usage between the two blocks to a minimum. Then get 158230f712c9SDave Chinner * the direction to copy and the number of elements to move. 158330f712c9SDave Chinner * 158430f712c9SDave Chinner * "inleaf" is true if the new entry should be inserted into blk1. 158530f712c9SDave Chinner * If "swap" is also true, then reverse the sense of "inleaf". 158630f712c9SDave Chinner */ 158730f712c9SDave Chinner state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1, 158830f712c9SDave Chinner blk2, &ichdr2, 158930f712c9SDave Chinner &count, &totallen); 159030f712c9SDave Chinner if (swap) 159130f712c9SDave Chinner state->inleaf = !state->inleaf; 159230f712c9SDave Chinner 159330f712c9SDave Chinner /* 159430f712c9SDave Chinner * Move any entries required from leaf to leaf: 159530f712c9SDave Chinner */ 159630f712c9SDave Chinner if (count < ichdr1.count) { 159730f712c9SDave Chinner /* 159830f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 159930f712c9SDave Chinner */ 160030f712c9SDave Chinner /* number entries being moved */ 160130f712c9SDave Chinner count = ichdr1.count - count; 160230f712c9SDave Chinner space = ichdr1.usedbytes - totallen; 160330f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 160430f712c9SDave Chinner 160530f712c9SDave Chinner /* 160630f712c9SDave Chinner * leaf2 is the destination, compact it if it looks tight. 160730f712c9SDave Chinner */ 160830f712c9SDave Chinner max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1); 160930f712c9SDave Chinner max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t); 161030f712c9SDave Chinner if (space > max) 161130f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp); 161230f712c9SDave Chinner 161330f712c9SDave Chinner /* 161430f712c9SDave Chinner * Move high entries from leaf1 to low end of leaf2. 161530f712c9SDave Chinner */ 161630f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf1, &ichdr1, 161730f712c9SDave Chinner ichdr1.count - count, leaf2, &ichdr2, 0, count); 161830f712c9SDave Chinner 161930f712c9SDave Chinner } else if (count > ichdr1.count) { 162030f712c9SDave Chinner /* 162130f712c9SDave Chinner * I assert that since all callers pass in an empty 162230f712c9SDave Chinner * second buffer, this code should never execute. 162330f712c9SDave Chinner */ 162430f712c9SDave Chinner ASSERT(0); 162530f712c9SDave Chinner 162630f712c9SDave Chinner /* 162730f712c9SDave Chinner * Figure the total bytes to be added to the destination leaf. 162830f712c9SDave Chinner */ 162930f712c9SDave Chinner /* number entries being moved */ 163030f712c9SDave Chinner count -= ichdr1.count; 163130f712c9SDave Chinner space = totallen - ichdr1.usedbytes; 163230f712c9SDave Chinner space += count * sizeof(xfs_attr_leaf_entry_t); 163330f712c9SDave Chinner 163430f712c9SDave Chinner /* 163530f712c9SDave Chinner * leaf1 is the destination, compact it if it looks tight. 163630f712c9SDave Chinner */ 163730f712c9SDave Chinner max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1); 163830f712c9SDave Chinner max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t); 163930f712c9SDave Chinner if (space > max) 164030f712c9SDave Chinner xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp); 164130f712c9SDave Chinner 164230f712c9SDave Chinner /* 164330f712c9SDave Chinner * Move low entries from leaf2 to high end of leaf1. 164430f712c9SDave Chinner */ 164530f712c9SDave Chinner xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1, 164630f712c9SDave Chinner ichdr1.count, count); 164730f712c9SDave Chinner } 164830f712c9SDave Chinner 16492f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf1, &ichdr1); 16502f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, leaf2, &ichdr2); 165130f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1); 165230f712c9SDave Chinner xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1); 165330f712c9SDave Chinner 165430f712c9SDave Chinner /* 165530f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 165630f712c9SDave Chinner */ 165730f712c9SDave Chinner entries1 = xfs_attr3_leaf_entryp(leaf1); 165830f712c9SDave Chinner entries2 = xfs_attr3_leaf_entryp(leaf2); 165930f712c9SDave Chinner blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval); 166030f712c9SDave Chinner blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval); 166130f712c9SDave Chinner 166230f712c9SDave Chinner /* 166330f712c9SDave Chinner * Adjust the expected index for insertion. 166430f712c9SDave Chinner * NOTE: this code depends on the (current) situation that the 166530f712c9SDave Chinner * second block was originally empty. 166630f712c9SDave Chinner * 166730f712c9SDave Chinner * If the insertion point moved to the 2nd block, we must adjust 166830f712c9SDave Chinner * the index. We must also track the entry just following the 166930f712c9SDave Chinner * new entry for use in an "atomic rename" operation, that entry 167030f712c9SDave Chinner * is always the "old" entry and the "new" entry is what we are 167130f712c9SDave Chinner * inserting. The index/blkno fields refer to the "old" entry, 167230f712c9SDave Chinner * while the index2/blkno2 fields refer to the "new" entry. 167330f712c9SDave Chinner */ 167430f712c9SDave Chinner if (blk1->index > ichdr1.count) { 167530f712c9SDave Chinner ASSERT(state->inleaf == 0); 167630f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 167730f712c9SDave Chinner args->index = args->index2 = blk2->index; 167830f712c9SDave Chinner args->blkno = args->blkno2 = blk2->blkno; 167930f712c9SDave Chinner } else if (blk1->index == ichdr1.count) { 168030f712c9SDave Chinner if (state->inleaf) { 168130f712c9SDave Chinner args->index = blk1->index; 168230f712c9SDave Chinner args->blkno = blk1->blkno; 168330f712c9SDave Chinner args->index2 = 0; 168430f712c9SDave Chinner args->blkno2 = blk2->blkno; 168530f712c9SDave Chinner } else { 168630f712c9SDave Chinner /* 168730f712c9SDave Chinner * On a double leaf split, the original attr location 168830f712c9SDave Chinner * is already stored in blkno2/index2, so don't 168930f712c9SDave Chinner * overwrite it overwise we corrupt the tree. 169030f712c9SDave Chinner */ 169130f712c9SDave Chinner blk2->index = blk1->index - ichdr1.count; 169230f712c9SDave Chinner args->index = blk2->index; 169330f712c9SDave Chinner args->blkno = blk2->blkno; 169430f712c9SDave Chinner if (!state->extravalid) { 169530f712c9SDave Chinner /* 169630f712c9SDave Chinner * set the new attr location to match the old 169730f712c9SDave Chinner * one and let the higher level split code 169830f712c9SDave Chinner * decide where in the leaf to place it. 169930f712c9SDave Chinner */ 170030f712c9SDave Chinner args->index2 = blk2->index; 170130f712c9SDave Chinner args->blkno2 = blk2->blkno; 170230f712c9SDave Chinner } 170330f712c9SDave Chinner } 170430f712c9SDave Chinner } else { 170530f712c9SDave Chinner ASSERT(state->inleaf == 1); 170630f712c9SDave Chinner args->index = args->index2 = blk1->index; 170730f712c9SDave Chinner args->blkno = args->blkno2 = blk1->blkno; 170830f712c9SDave Chinner } 170930f712c9SDave Chinner } 171030f712c9SDave Chinner 171130f712c9SDave Chinner /* 171230f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 171330f712c9SDave Chinner * byte usage between the two blocks to a minimum. 171430f712c9SDave Chinner * GROT: Is this really necessary? With other than a 512 byte blocksize, 171530f712c9SDave Chinner * GROT: there will always be enough room in either block for a new entry. 171630f712c9SDave Chinner * GROT: Do a double-split for this case? 171730f712c9SDave Chinner */ 171830f712c9SDave Chinner STATIC int 171930f712c9SDave Chinner xfs_attr3_leaf_figure_balance( 172030f712c9SDave Chinner struct xfs_da_state *state, 172130f712c9SDave Chinner struct xfs_da_state_blk *blk1, 172230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr1, 172330f712c9SDave Chinner struct xfs_da_state_blk *blk2, 172430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr2, 172530f712c9SDave Chinner int *countarg, 172630f712c9SDave Chinner int *usedbytesarg) 172730f712c9SDave Chinner { 172830f712c9SDave Chinner struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr; 172930f712c9SDave Chinner struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr; 173030f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 173130f712c9SDave Chinner int count; 173230f712c9SDave Chinner int max; 173330f712c9SDave Chinner int index; 173430f712c9SDave Chinner int totallen = 0; 173530f712c9SDave Chinner int half; 173630f712c9SDave Chinner int lastdelta; 173730f712c9SDave Chinner int foundit = 0; 173830f712c9SDave Chinner int tmp; 173930f712c9SDave Chinner 174030f712c9SDave Chinner /* 174130f712c9SDave Chinner * Examine entries until we reduce the absolute difference in 174230f712c9SDave Chinner * byte usage between the two blocks to a minimum. 174330f712c9SDave Chinner */ 174430f712c9SDave Chinner max = ichdr1->count + ichdr2->count; 174530f712c9SDave Chinner half = (max + 1) * sizeof(*entry); 174630f712c9SDave Chinner half += ichdr1->usedbytes + ichdr2->usedbytes + 174730f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 174830f712c9SDave Chinner half /= 2; 174930f712c9SDave Chinner lastdelta = state->args->geo->blksize; 175030f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 175130f712c9SDave Chinner for (count = index = 0; count < max; entry++, index++, count++) { 175230f712c9SDave Chinner 175330f712c9SDave Chinner #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A)) 175430f712c9SDave Chinner /* 175530f712c9SDave Chinner * The new entry is in the first block, account for it. 175630f712c9SDave Chinner */ 175730f712c9SDave Chinner if (count == blk1->index) { 175830f712c9SDave Chinner tmp = totallen + sizeof(*entry) + 175930f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 176030f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 176130f712c9SDave Chinner break; 176230f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 176330f712c9SDave Chinner totallen = tmp; 176430f712c9SDave Chinner foundit = 1; 176530f712c9SDave Chinner } 176630f712c9SDave Chinner 176730f712c9SDave Chinner /* 176830f712c9SDave Chinner * Wrap around into the second block if necessary. 176930f712c9SDave Chinner */ 177030f712c9SDave Chinner if (count == ichdr1->count) { 177130f712c9SDave Chinner leaf1 = leaf2; 177230f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf1); 177330f712c9SDave Chinner index = 0; 177430f712c9SDave Chinner } 177530f712c9SDave Chinner 177630f712c9SDave Chinner /* 177730f712c9SDave Chinner * Figure out if next leaf entry would be too much. 177830f712c9SDave Chinner */ 177930f712c9SDave Chinner tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1, 178030f712c9SDave Chinner index); 178130f712c9SDave Chinner if (XFS_ATTR_ABS(half - tmp) > lastdelta) 178230f712c9SDave Chinner break; 178330f712c9SDave Chinner lastdelta = XFS_ATTR_ABS(half - tmp); 178430f712c9SDave Chinner totallen = tmp; 178530f712c9SDave Chinner #undef XFS_ATTR_ABS 178630f712c9SDave Chinner } 178730f712c9SDave Chinner 178830f712c9SDave Chinner /* 178930f712c9SDave Chinner * Calculate the number of usedbytes that will end up in lower block. 179030f712c9SDave Chinner * If new entry not in lower block, fix up the count. 179130f712c9SDave Chinner */ 179230f712c9SDave Chinner totallen -= count * sizeof(*entry); 179330f712c9SDave Chinner if (foundit) { 179430f712c9SDave Chinner totallen -= sizeof(*entry) + 179530f712c9SDave Chinner xfs_attr_leaf_newentsize(state->args, NULL); 179630f712c9SDave Chinner } 179730f712c9SDave Chinner 179830f712c9SDave Chinner *countarg = count; 179930f712c9SDave Chinner *usedbytesarg = totallen; 180030f712c9SDave Chinner return foundit; 180130f712c9SDave Chinner } 180230f712c9SDave Chinner 180330f712c9SDave Chinner /*======================================================================== 180430f712c9SDave Chinner * Routines used for shrinking the Btree. 180530f712c9SDave Chinner *========================================================================*/ 180630f712c9SDave Chinner 180730f712c9SDave Chinner /* 180830f712c9SDave Chinner * Check a leaf block and its neighbors to see if the block should be 180930f712c9SDave Chinner * collapsed into one or the other neighbor. Always keep the block 181030f712c9SDave Chinner * with the smaller block number. 181130f712c9SDave Chinner * If the current block is over 50% full, don't try to join it, return 0. 181230f712c9SDave Chinner * If the block is empty, fill in the state structure and return 2. 181330f712c9SDave Chinner * If it can be collapsed, fill in the state structure and return 1. 181430f712c9SDave Chinner * If nothing can be done, return 0. 181530f712c9SDave Chinner * 181630f712c9SDave Chinner * GROT: allow for INCOMPLETE entries in calculation. 181730f712c9SDave Chinner */ 181830f712c9SDave Chinner int 181930f712c9SDave Chinner xfs_attr3_leaf_toosmall( 182030f712c9SDave Chinner struct xfs_da_state *state, 182130f712c9SDave Chinner int *action) 182230f712c9SDave Chinner { 182330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 182430f712c9SDave Chinner struct xfs_da_state_blk *blk; 182530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 182630f712c9SDave Chinner struct xfs_buf *bp; 182730f712c9SDave Chinner xfs_dablk_t blkno; 182830f712c9SDave Chinner int bytes; 182930f712c9SDave Chinner int forward; 183030f712c9SDave Chinner int error; 183130f712c9SDave Chinner int retval; 183230f712c9SDave Chinner int i; 183330f712c9SDave Chinner 183430f712c9SDave Chinner trace_xfs_attr_leaf_toosmall(state->args); 183530f712c9SDave Chinner 183630f712c9SDave Chinner /* 183730f712c9SDave Chinner * Check for the degenerate case of the block being over 50% full. 183830f712c9SDave Chinner * If so, it's not worth even looking to see if we might be able 183930f712c9SDave Chinner * to coalesce with a sibling. 184030f712c9SDave Chinner */ 184130f712c9SDave Chinner blk = &state->path.blk[ state->path.active-1 ]; 184230f712c9SDave Chinner leaf = blk->bp->b_addr; 18432f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr, leaf); 184430f712c9SDave Chinner bytes = xfs_attr3_leaf_hdr_size(leaf) + 184530f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t) + 184630f712c9SDave Chinner ichdr.usedbytes; 184730f712c9SDave Chinner if (bytes > (state->args->geo->blksize >> 1)) { 184830f712c9SDave Chinner *action = 0; /* blk over 50%, don't try to join */ 184930f712c9SDave Chinner return 0; 185030f712c9SDave Chinner } 185130f712c9SDave Chinner 185230f712c9SDave Chinner /* 185330f712c9SDave Chinner * Check for the degenerate case of the block being empty. 185430f712c9SDave Chinner * If the block is empty, we'll simply delete it, no need to 185530f712c9SDave Chinner * coalesce it with a sibling block. We choose (arbitrarily) 185630f712c9SDave Chinner * to merge with the forward block unless it is NULL. 185730f712c9SDave Chinner */ 185830f712c9SDave Chinner if (ichdr.count == 0) { 185930f712c9SDave Chinner /* 186030f712c9SDave Chinner * Make altpath point to the block we want to keep and 186130f712c9SDave Chinner * path point to the block we want to drop (this one). 186230f712c9SDave Chinner */ 186330f712c9SDave Chinner forward = (ichdr.forw != 0); 186430f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 186530f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 186630f712c9SDave Chinner 0, &retval); 186730f712c9SDave Chinner if (error) 186830f712c9SDave Chinner return error; 186930f712c9SDave Chinner if (retval) { 187030f712c9SDave Chinner *action = 0; 187130f712c9SDave Chinner } else { 187230f712c9SDave Chinner *action = 2; 187330f712c9SDave Chinner } 187430f712c9SDave Chinner return 0; 187530f712c9SDave Chinner } 187630f712c9SDave Chinner 187730f712c9SDave Chinner /* 187830f712c9SDave Chinner * Examine each sibling block to see if we can coalesce with 187930f712c9SDave Chinner * at least 25% free space to spare. We need to figure out 188030f712c9SDave Chinner * whether to merge with the forward or the backward block. 188130f712c9SDave Chinner * We prefer coalescing with the lower numbered sibling so as 188230f712c9SDave Chinner * to shrink an attribute list over time. 188330f712c9SDave Chinner */ 188430f712c9SDave Chinner /* start with smaller blk num */ 188530f712c9SDave Chinner forward = ichdr.forw < ichdr.back; 188630f712c9SDave Chinner for (i = 0; i < 2; forward = !forward, i++) { 188730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 188830f712c9SDave Chinner if (forward) 188930f712c9SDave Chinner blkno = ichdr.forw; 189030f712c9SDave Chinner else 189130f712c9SDave Chinner blkno = ichdr.back; 189230f712c9SDave Chinner if (blkno == 0) 189330f712c9SDave Chinner continue; 189430f712c9SDave Chinner error = xfs_attr3_leaf_read(state->args->trans, state->args->dp, 189530f712c9SDave Chinner blkno, -1, &bp); 189630f712c9SDave Chinner if (error) 189730f712c9SDave Chinner return error; 189830f712c9SDave Chinner 18992f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &ichdr2, bp->b_addr); 190030f712c9SDave Chinner 190130f712c9SDave Chinner bytes = state->args->geo->blksize - 190230f712c9SDave Chinner (state->args->geo->blksize >> 2) - 190330f712c9SDave Chinner ichdr.usedbytes - ichdr2.usedbytes - 190430f712c9SDave Chinner ((ichdr.count + ichdr2.count) * 190530f712c9SDave Chinner sizeof(xfs_attr_leaf_entry_t)) - 190630f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf); 190730f712c9SDave Chinner 190830f712c9SDave Chinner xfs_trans_brelse(state->args->trans, bp); 190930f712c9SDave Chinner if (bytes >= 0) 191030f712c9SDave Chinner break; /* fits with at least 25% to spare */ 191130f712c9SDave Chinner } 191230f712c9SDave Chinner if (i >= 2) { 191330f712c9SDave Chinner *action = 0; 191430f712c9SDave Chinner return 0; 191530f712c9SDave Chinner } 191630f712c9SDave Chinner 191730f712c9SDave Chinner /* 191830f712c9SDave Chinner * Make altpath point to the block we want to keep (the lower 191930f712c9SDave Chinner * numbered block) and path point to the block we want to drop. 192030f712c9SDave Chinner */ 192130f712c9SDave Chinner memcpy(&state->altpath, &state->path, sizeof(state->path)); 192230f712c9SDave Chinner if (blkno < blk->blkno) { 192330f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->altpath, forward, 192430f712c9SDave Chinner 0, &retval); 192530f712c9SDave Chinner } else { 192630f712c9SDave Chinner error = xfs_da3_path_shift(state, &state->path, forward, 192730f712c9SDave Chinner 0, &retval); 192830f712c9SDave Chinner } 192930f712c9SDave Chinner if (error) 193030f712c9SDave Chinner return error; 193130f712c9SDave Chinner if (retval) { 193230f712c9SDave Chinner *action = 0; 193330f712c9SDave Chinner } else { 193430f712c9SDave Chinner *action = 1; 193530f712c9SDave Chinner } 193630f712c9SDave Chinner return 0; 193730f712c9SDave Chinner } 193830f712c9SDave Chinner 193930f712c9SDave Chinner /* 194030f712c9SDave Chinner * Remove a name from the leaf attribute list structure. 194130f712c9SDave Chinner * 194230f712c9SDave Chinner * Return 1 if leaf is less than 37% full, 0 if >= 37% full. 194330f712c9SDave Chinner * If two leaves are 37% full, when combined they will leave 25% free. 194430f712c9SDave Chinner */ 194530f712c9SDave Chinner int 194630f712c9SDave Chinner xfs_attr3_leaf_remove( 194730f712c9SDave Chinner struct xfs_buf *bp, 194830f712c9SDave Chinner struct xfs_da_args *args) 194930f712c9SDave Chinner { 195030f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 195130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 195230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 195330f712c9SDave Chinner int before; 195430f712c9SDave Chinner int after; 195530f712c9SDave Chinner int smallest; 195630f712c9SDave Chinner int entsize; 195730f712c9SDave Chinner int tablesize; 195830f712c9SDave Chinner int tmp; 195930f712c9SDave Chinner int i; 196030f712c9SDave Chinner 196130f712c9SDave Chinner trace_xfs_attr_leaf_remove(args); 196230f712c9SDave Chinner 196330f712c9SDave Chinner leaf = bp->b_addr; 19642f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 196530f712c9SDave Chinner 196630f712c9SDave Chinner ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8); 196730f712c9SDave Chinner ASSERT(args->index >= 0 && args->index < ichdr.count); 196830f712c9SDave Chinner ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) + 196930f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf)); 197030f712c9SDave Chinner 197130f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 197230f712c9SDave Chinner 197330f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 197430f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 197530f712c9SDave Chinner 197630f712c9SDave Chinner /* 197730f712c9SDave Chinner * Scan through free region table: 197830f712c9SDave Chinner * check for adjacency of free'd entry with an existing one, 197930f712c9SDave Chinner * find smallest free region in case we need to replace it, 198030f712c9SDave Chinner * adjust any map that borders the entry table, 198130f712c9SDave Chinner */ 198230f712c9SDave Chinner tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t) 198330f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf); 198430f712c9SDave Chinner tmp = ichdr.freemap[0].size; 198530f712c9SDave Chinner before = after = -1; 198630f712c9SDave Chinner smallest = XFS_ATTR_LEAF_MAPSIZE - 1; 198730f712c9SDave Chinner entsize = xfs_attr_leaf_entsize(leaf, args->index); 198830f712c9SDave Chinner for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) { 198930f712c9SDave Chinner ASSERT(ichdr.freemap[i].base < args->geo->blksize); 199030f712c9SDave Chinner ASSERT(ichdr.freemap[i].size < args->geo->blksize); 199130f712c9SDave Chinner if (ichdr.freemap[i].base == tablesize) { 199230f712c9SDave Chinner ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t); 199330f712c9SDave Chinner ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t); 199430f712c9SDave Chinner } 199530f712c9SDave Chinner 199630f712c9SDave Chinner if (ichdr.freemap[i].base + ichdr.freemap[i].size == 199730f712c9SDave Chinner be16_to_cpu(entry->nameidx)) { 199830f712c9SDave Chinner before = i; 199930f712c9SDave Chinner } else if (ichdr.freemap[i].base == 200030f712c9SDave Chinner (be16_to_cpu(entry->nameidx) + entsize)) { 200130f712c9SDave Chinner after = i; 200230f712c9SDave Chinner } else if (ichdr.freemap[i].size < tmp) { 200330f712c9SDave Chinner tmp = ichdr.freemap[i].size; 200430f712c9SDave Chinner smallest = i; 200530f712c9SDave Chinner } 200630f712c9SDave Chinner } 200730f712c9SDave Chinner 200830f712c9SDave Chinner /* 200930f712c9SDave Chinner * Coalesce adjacent freemap regions, 201030f712c9SDave Chinner * or replace the smallest region. 201130f712c9SDave Chinner */ 201230f712c9SDave Chinner if ((before >= 0) || (after >= 0)) { 201330f712c9SDave Chinner if ((before >= 0) && (after >= 0)) { 201430f712c9SDave Chinner ichdr.freemap[before].size += entsize; 201530f712c9SDave Chinner ichdr.freemap[before].size += ichdr.freemap[after].size; 201630f712c9SDave Chinner ichdr.freemap[after].base = 0; 201730f712c9SDave Chinner ichdr.freemap[after].size = 0; 201830f712c9SDave Chinner } else if (before >= 0) { 201930f712c9SDave Chinner ichdr.freemap[before].size += entsize; 202030f712c9SDave Chinner } else { 202130f712c9SDave Chinner ichdr.freemap[after].base = be16_to_cpu(entry->nameidx); 202230f712c9SDave Chinner ichdr.freemap[after].size += entsize; 202330f712c9SDave Chinner } 202430f712c9SDave Chinner } else { 202530f712c9SDave Chinner /* 202630f712c9SDave Chinner * Replace smallest region (if it is smaller than free'd entry) 202730f712c9SDave Chinner */ 202830f712c9SDave Chinner if (ichdr.freemap[smallest].size < entsize) { 202930f712c9SDave Chinner ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx); 203030f712c9SDave Chinner ichdr.freemap[smallest].size = entsize; 203130f712c9SDave Chinner } 203230f712c9SDave Chinner } 203330f712c9SDave Chinner 203430f712c9SDave Chinner /* 203530f712c9SDave Chinner * Did we remove the first entry? 203630f712c9SDave Chinner */ 203730f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) == ichdr.firstused) 203830f712c9SDave Chinner smallest = 1; 203930f712c9SDave Chinner else 204030f712c9SDave Chinner smallest = 0; 204130f712c9SDave Chinner 204230f712c9SDave Chinner /* 204330f712c9SDave Chinner * Compress the remaining entries and zero out the removed stuff. 204430f712c9SDave Chinner */ 204530f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize); 204630f712c9SDave Chinner ichdr.usedbytes -= entsize; 204730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 204830f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index), 204930f712c9SDave Chinner entsize)); 205030f712c9SDave Chinner 205130f712c9SDave Chinner tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t); 205230f712c9SDave Chinner memmove(entry, entry + 1, tmp); 205330f712c9SDave Chinner ichdr.count--; 205430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 205530f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t))); 205630f712c9SDave Chinner 205730f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count]; 205830f712c9SDave Chinner memset(entry, 0, sizeof(xfs_attr_leaf_entry_t)); 205930f712c9SDave Chinner 206030f712c9SDave Chinner /* 206130f712c9SDave Chinner * If we removed the first entry, re-find the first used byte 206230f712c9SDave Chinner * in the name area. Note that if the entry was the "firstused", 206330f712c9SDave Chinner * then we don't have a "hole" in our block resulting from 206430f712c9SDave Chinner * removing the name. 206530f712c9SDave Chinner */ 206630f712c9SDave Chinner if (smallest) { 206730f712c9SDave Chinner tmp = args->geo->blksize; 206830f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(leaf); 206930f712c9SDave Chinner for (i = ichdr.count - 1; i >= 0; entry++, i--) { 207030f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused); 207130f712c9SDave Chinner ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize); 207230f712c9SDave Chinner 207330f712c9SDave Chinner if (be16_to_cpu(entry->nameidx) < tmp) 207430f712c9SDave Chinner tmp = be16_to_cpu(entry->nameidx); 207530f712c9SDave Chinner } 207630f712c9SDave Chinner ichdr.firstused = tmp; 207766db8104SBrian Foster ASSERT(ichdr.firstused != 0); 207830f712c9SDave Chinner } else { 207930f712c9SDave Chinner ichdr.holes = 1; /* mark as needing compaction */ 208030f712c9SDave Chinner } 20812f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(args->geo, leaf, &ichdr); 208230f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 208330f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, &leaf->hdr, 208430f712c9SDave Chinner xfs_attr3_leaf_hdr_size(leaf))); 208530f712c9SDave Chinner 208630f712c9SDave Chinner /* 208730f712c9SDave Chinner * Check if leaf is less than 50% full, caller may want to 208830f712c9SDave Chinner * "join" the leaf with a sibling if so. 208930f712c9SDave Chinner */ 209030f712c9SDave Chinner tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) + 209130f712c9SDave Chinner ichdr.count * sizeof(xfs_attr_leaf_entry_t); 209230f712c9SDave Chinner 209330f712c9SDave Chinner return tmp < args->geo->magicpct; /* leaf is < 37% full */ 209430f712c9SDave Chinner } 209530f712c9SDave Chinner 209630f712c9SDave Chinner /* 209730f712c9SDave Chinner * Move all the attribute list entries from drop_leaf into save_leaf. 209830f712c9SDave Chinner */ 209930f712c9SDave Chinner void 210030f712c9SDave Chinner xfs_attr3_leaf_unbalance( 210130f712c9SDave Chinner struct xfs_da_state *state, 210230f712c9SDave Chinner struct xfs_da_state_blk *drop_blk, 210330f712c9SDave Chinner struct xfs_da_state_blk *save_blk) 210430f712c9SDave Chinner { 210530f712c9SDave Chinner struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr; 210630f712c9SDave Chinner struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr; 210730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr drophdr; 210830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr savehdr; 210930f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 211030f712c9SDave Chinner 211130f712c9SDave Chinner trace_xfs_attr_leaf_unbalance(state->args); 211230f712c9SDave Chinner 211330f712c9SDave Chinner drop_leaf = drop_blk->bp->b_addr; 211430f712c9SDave Chinner save_leaf = save_blk->bp->b_addr; 21152f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &drophdr, drop_leaf); 21162f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(state->args->geo, &savehdr, save_leaf); 211730f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(drop_leaf); 211830f712c9SDave Chinner 211930f712c9SDave Chinner /* 212030f712c9SDave Chinner * Save last hashval from dying block for later Btree fixup. 212130f712c9SDave Chinner */ 212230f712c9SDave Chinner drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval); 212330f712c9SDave Chinner 212430f712c9SDave Chinner /* 212530f712c9SDave Chinner * Check if we need a temp buffer, or can we do it in place. 212630f712c9SDave Chinner * Note that we don't check "leaf" for holes because we will 212730f712c9SDave Chinner * always be dropping it, toosmall() decided that for us already. 212830f712c9SDave Chinner */ 212930f712c9SDave Chinner if (savehdr.holes == 0) { 213030f712c9SDave Chinner /* 213130f712c9SDave Chinner * dest leaf has no holes, so we add there. May need 213230f712c9SDave Chinner * to make some room in the entry array. 213330f712c9SDave Chinner */ 213430f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 213530f712c9SDave Chinner drop_blk->bp, &drophdr)) { 213630f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 213730f712c9SDave Chinner drop_leaf, &drophdr, 0, 213830f712c9SDave Chinner save_leaf, &savehdr, 0, 213930f712c9SDave Chinner drophdr.count); 214030f712c9SDave Chinner } else { 214130f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 214230f712c9SDave Chinner drop_leaf, &drophdr, 0, 214330f712c9SDave Chinner save_leaf, &savehdr, 214430f712c9SDave Chinner savehdr.count, drophdr.count); 214530f712c9SDave Chinner } 214630f712c9SDave Chinner } else { 214730f712c9SDave Chinner /* 214830f712c9SDave Chinner * Destination has holes, so we make a temporary copy 214930f712c9SDave Chinner * of the leaf and add them both to that. 215030f712c9SDave Chinner */ 215130f712c9SDave Chinner struct xfs_attr_leafblock *tmp_leaf; 215230f712c9SDave Chinner struct xfs_attr3_icleaf_hdr tmphdr; 215330f712c9SDave Chinner 215430f712c9SDave Chinner tmp_leaf = kmem_zalloc(state->args->geo->blksize, KM_SLEEP); 215530f712c9SDave Chinner 215630f712c9SDave Chinner /* 215730f712c9SDave Chinner * Copy the header into the temp leaf so that all the stuff 215830f712c9SDave Chinner * not in the incore header is present and gets copied back in 215930f712c9SDave Chinner * once we've moved all the entries. 216030f712c9SDave Chinner */ 216130f712c9SDave Chinner memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf)); 216230f712c9SDave Chinner 216330f712c9SDave Chinner memset(&tmphdr, 0, sizeof(tmphdr)); 216430f712c9SDave Chinner tmphdr.magic = savehdr.magic; 216530f712c9SDave Chinner tmphdr.forw = savehdr.forw; 216630f712c9SDave Chinner tmphdr.back = savehdr.back; 216730f712c9SDave Chinner tmphdr.firstused = state->args->geo->blksize; 216830f712c9SDave Chinner 216930f712c9SDave Chinner /* write the header to the temp buffer to initialise it */ 21702f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, tmp_leaf, &tmphdr); 217130f712c9SDave Chinner 217230f712c9SDave Chinner if (xfs_attr3_leaf_order(save_blk->bp, &savehdr, 217330f712c9SDave Chinner drop_blk->bp, &drophdr)) { 217430f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 217530f712c9SDave Chinner drop_leaf, &drophdr, 0, 217630f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 217730f712c9SDave Chinner drophdr.count); 217830f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 217930f712c9SDave Chinner save_leaf, &savehdr, 0, 218030f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 218130f712c9SDave Chinner savehdr.count); 218230f712c9SDave Chinner } else { 218330f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 218430f712c9SDave Chinner save_leaf, &savehdr, 0, 218530f712c9SDave Chinner tmp_leaf, &tmphdr, 0, 218630f712c9SDave Chinner savehdr.count); 218730f712c9SDave Chinner xfs_attr3_leaf_moveents(state->args, 218830f712c9SDave Chinner drop_leaf, &drophdr, 0, 218930f712c9SDave Chinner tmp_leaf, &tmphdr, tmphdr.count, 219030f712c9SDave Chinner drophdr.count); 219130f712c9SDave Chinner } 219230f712c9SDave Chinner memcpy(save_leaf, tmp_leaf, state->args->geo->blksize); 219330f712c9SDave Chinner savehdr = tmphdr; /* struct copy */ 219430f712c9SDave Chinner kmem_free(tmp_leaf); 219530f712c9SDave Chinner } 219630f712c9SDave Chinner 21972f661241SBrian Foster xfs_attr3_leaf_hdr_to_disk(state->args->geo, save_leaf, &savehdr); 219830f712c9SDave Chinner xfs_trans_log_buf(state->args->trans, save_blk->bp, 0, 219930f712c9SDave Chinner state->args->geo->blksize - 1); 220030f712c9SDave Chinner 220130f712c9SDave Chinner /* 220230f712c9SDave Chinner * Copy out last hashval in each block for B-tree code. 220330f712c9SDave Chinner */ 220430f712c9SDave Chinner entry = xfs_attr3_leaf_entryp(save_leaf); 220530f712c9SDave Chinner save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval); 220630f712c9SDave Chinner } 220730f712c9SDave Chinner 220830f712c9SDave Chinner /*======================================================================== 220930f712c9SDave Chinner * Routines used for finding things in the Btree. 221030f712c9SDave Chinner *========================================================================*/ 221130f712c9SDave Chinner 221230f712c9SDave Chinner /* 221330f712c9SDave Chinner * Look up a name in a leaf attribute list structure. 221430f712c9SDave Chinner * This is the internal routine, it uses the caller's buffer. 221530f712c9SDave Chinner * 221630f712c9SDave Chinner * Note that duplicate keys are allowed, but only check within the 221730f712c9SDave Chinner * current leaf node. The Btree code must check in adjacent leaf nodes. 221830f712c9SDave Chinner * 221930f712c9SDave Chinner * Return in args->index the index into the entry[] array of either 222030f712c9SDave Chinner * the found entry, or where the entry should have been (insert before 222130f712c9SDave Chinner * that entry). 222230f712c9SDave Chinner * 222330f712c9SDave Chinner * Don't change the args->value unless we find the attribute. 222430f712c9SDave Chinner */ 222530f712c9SDave Chinner int 222630f712c9SDave Chinner xfs_attr3_leaf_lookup_int( 222730f712c9SDave Chinner struct xfs_buf *bp, 222830f712c9SDave Chinner struct xfs_da_args *args) 222930f712c9SDave Chinner { 223030f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 223130f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 223230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 223330f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 223430f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 223530f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 223630f712c9SDave Chinner xfs_dahash_t hashval; 223730f712c9SDave Chinner int probe; 223830f712c9SDave Chinner int span; 223930f712c9SDave Chinner 224030f712c9SDave Chinner trace_xfs_attr_leaf_lookup(args); 224130f712c9SDave Chinner 224230f712c9SDave Chinner leaf = bp->b_addr; 22432f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 224430f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 22458ba92d43SDarrick J. Wong if (ichdr.count >= args->geo->blksize / 8) 22468ba92d43SDarrick J. Wong return -EFSCORRUPTED; 224730f712c9SDave Chinner 224830f712c9SDave Chinner /* 224930f712c9SDave Chinner * Binary search. (note: small blocks will skip this loop) 225030f712c9SDave Chinner */ 225130f712c9SDave Chinner hashval = args->hashval; 225230f712c9SDave Chinner probe = span = ichdr.count / 2; 225330f712c9SDave Chinner for (entry = &entries[probe]; span > 4; entry = &entries[probe]) { 225430f712c9SDave Chinner span /= 2; 225530f712c9SDave Chinner if (be32_to_cpu(entry->hashval) < hashval) 225630f712c9SDave Chinner probe += span; 225730f712c9SDave Chinner else if (be32_to_cpu(entry->hashval) > hashval) 225830f712c9SDave Chinner probe -= span; 225930f712c9SDave Chinner else 226030f712c9SDave Chinner break; 226130f712c9SDave Chinner } 22628ba92d43SDarrick J. Wong if (!(probe >= 0 && (!ichdr.count || probe < ichdr.count))) 22638ba92d43SDarrick J. Wong return -EFSCORRUPTED; 22648ba92d43SDarrick J. Wong if (!(span <= 4 || be32_to_cpu(entry->hashval) == hashval)) 22658ba92d43SDarrick J. Wong return -EFSCORRUPTED; 226630f712c9SDave Chinner 226730f712c9SDave Chinner /* 226830f712c9SDave Chinner * Since we may have duplicate hashval's, find the first matching 226930f712c9SDave Chinner * hashval in the leaf. 227030f712c9SDave Chinner */ 227130f712c9SDave Chinner while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) { 227230f712c9SDave Chinner entry--; 227330f712c9SDave Chinner probe--; 227430f712c9SDave Chinner } 227530f712c9SDave Chinner while (probe < ichdr.count && 227630f712c9SDave Chinner be32_to_cpu(entry->hashval) < hashval) { 227730f712c9SDave Chinner entry++; 227830f712c9SDave Chinner probe++; 227930f712c9SDave Chinner } 228030f712c9SDave Chinner if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) { 228130f712c9SDave Chinner args->index = probe; 22822451337dSDave Chinner return -ENOATTR; 228330f712c9SDave Chinner } 228430f712c9SDave Chinner 228530f712c9SDave Chinner /* 228630f712c9SDave Chinner * Duplicate keys may be present, so search all of them for a match. 228730f712c9SDave Chinner */ 228830f712c9SDave Chinner for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval); 228930f712c9SDave Chinner entry++, probe++) { 229030f712c9SDave Chinner /* 229130f712c9SDave Chinner * GROT: Add code to remove incomplete entries. 229230f712c9SDave Chinner */ 229330f712c9SDave Chinner /* 229430f712c9SDave Chinner * If we are looking for INCOMPLETE entries, show only those. 229530f712c9SDave Chinner * If we are looking for complete entries, show only those. 229630f712c9SDave Chinner */ 229730f712c9SDave Chinner if ((args->flags & XFS_ATTR_INCOMPLETE) != 229830f712c9SDave Chinner (entry->flags & XFS_ATTR_INCOMPLETE)) { 229930f712c9SDave Chinner continue; 230030f712c9SDave Chinner } 230130f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 230230f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, probe); 230330f712c9SDave Chinner if (name_loc->namelen != args->namelen) 230430f712c9SDave Chinner continue; 230530f712c9SDave Chinner if (memcmp(args->name, name_loc->nameval, 230630f712c9SDave Chinner args->namelen) != 0) 230730f712c9SDave Chinner continue; 230830f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, entry->flags)) 230930f712c9SDave Chinner continue; 231030f712c9SDave Chinner args->index = probe; 23112451337dSDave Chinner return -EEXIST; 231230f712c9SDave Chinner } else { 231330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, probe); 231430f712c9SDave Chinner if (name_rmt->namelen != args->namelen) 231530f712c9SDave Chinner continue; 231630f712c9SDave Chinner if (memcmp(args->name, name_rmt->name, 231730f712c9SDave Chinner args->namelen) != 0) 231830f712c9SDave Chinner continue; 231930f712c9SDave Chinner if (!xfs_attr_namesp_match(args->flags, entry->flags)) 232030f712c9SDave Chinner continue; 232130f712c9SDave Chinner args->index = probe; 232230f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 232330f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 232430f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks( 232530f712c9SDave Chinner args->dp->i_mount, 232630f712c9SDave Chinner args->rmtvaluelen); 23272451337dSDave Chinner return -EEXIST; 232830f712c9SDave Chinner } 232930f712c9SDave Chinner } 233030f712c9SDave Chinner args->index = probe; 23312451337dSDave Chinner return -ENOATTR; 233230f712c9SDave Chinner } 233330f712c9SDave Chinner 233430f712c9SDave Chinner /* 233530f712c9SDave Chinner * Get the value associated with an attribute name from a leaf attribute 233630f712c9SDave Chinner * list structure. 233730f712c9SDave Chinner */ 233830f712c9SDave Chinner int 233930f712c9SDave Chinner xfs_attr3_leaf_getvalue( 234030f712c9SDave Chinner struct xfs_buf *bp, 234130f712c9SDave Chinner struct xfs_da_args *args) 234230f712c9SDave Chinner { 234330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 234430f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 234530f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 234630f712c9SDave Chinner struct xfs_attr_leaf_name_local *name_loc; 234730f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 234830f712c9SDave Chinner int valuelen; 234930f712c9SDave Chinner 235030f712c9SDave Chinner leaf = bp->b_addr; 23512f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 235230f712c9SDave Chinner ASSERT(ichdr.count < args->geo->blksize / 8); 235330f712c9SDave Chinner ASSERT(args->index < ichdr.count); 235430f712c9SDave Chinner 235530f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 235630f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 235730f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 235830f712c9SDave Chinner ASSERT(name_loc->namelen == args->namelen); 235930f712c9SDave Chinner ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0); 236030f712c9SDave Chinner valuelen = be16_to_cpu(name_loc->valuelen); 236130f712c9SDave Chinner if (args->flags & ATTR_KERNOVAL) { 236230f712c9SDave Chinner args->valuelen = valuelen; 236330f712c9SDave Chinner return 0; 236430f712c9SDave Chinner } 236530f712c9SDave Chinner if (args->valuelen < valuelen) { 236630f712c9SDave Chinner args->valuelen = valuelen; 23672451337dSDave Chinner return -ERANGE; 236830f712c9SDave Chinner } 236930f712c9SDave Chinner args->valuelen = valuelen; 237030f712c9SDave Chinner memcpy(args->value, &name_loc->nameval[args->namelen], valuelen); 237130f712c9SDave Chinner } else { 237230f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 237330f712c9SDave Chinner ASSERT(name_rmt->namelen == args->namelen); 237430f712c9SDave Chinner ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0); 237530f712c9SDave Chinner args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen); 237630f712c9SDave Chinner args->rmtblkno = be32_to_cpu(name_rmt->valueblk); 237730f712c9SDave Chinner args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount, 237830f712c9SDave Chinner args->rmtvaluelen); 237930f712c9SDave Chinner if (args->flags & ATTR_KERNOVAL) { 238030f712c9SDave Chinner args->valuelen = args->rmtvaluelen; 238130f712c9SDave Chinner return 0; 238230f712c9SDave Chinner } 238330f712c9SDave Chinner if (args->valuelen < args->rmtvaluelen) { 238430f712c9SDave Chinner args->valuelen = args->rmtvaluelen; 23852451337dSDave Chinner return -ERANGE; 238630f712c9SDave Chinner } 238730f712c9SDave Chinner args->valuelen = args->rmtvaluelen; 238830f712c9SDave Chinner } 238930f712c9SDave Chinner return 0; 239030f712c9SDave Chinner } 239130f712c9SDave Chinner 239230f712c9SDave Chinner /*======================================================================== 239330f712c9SDave Chinner * Utility routines. 239430f712c9SDave Chinner *========================================================================*/ 239530f712c9SDave Chinner 239630f712c9SDave Chinner /* 239730f712c9SDave Chinner * Move the indicated entries from one leaf to another. 239830f712c9SDave Chinner * NOTE: this routine modifies both source and destination leaves. 239930f712c9SDave Chinner */ 240030f712c9SDave Chinner /*ARGSUSED*/ 240130f712c9SDave Chinner STATIC void 240230f712c9SDave Chinner xfs_attr3_leaf_moveents( 240330f712c9SDave Chinner struct xfs_da_args *args, 240430f712c9SDave Chinner struct xfs_attr_leafblock *leaf_s, 240530f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_s, 240630f712c9SDave Chinner int start_s, 240730f712c9SDave Chinner struct xfs_attr_leafblock *leaf_d, 240830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr *ichdr_d, 240930f712c9SDave Chinner int start_d, 241030f712c9SDave Chinner int count) 241130f712c9SDave Chinner { 241230f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_s; 241330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry_d; 241430f712c9SDave Chinner int desti; 241530f712c9SDave Chinner int tmp; 241630f712c9SDave Chinner int i; 241730f712c9SDave Chinner 241830f712c9SDave Chinner /* 241930f712c9SDave Chinner * Check for nothing to do. 242030f712c9SDave Chinner */ 242130f712c9SDave Chinner if (count == 0) 242230f712c9SDave Chinner return; 242330f712c9SDave Chinner 242430f712c9SDave Chinner /* 242530f712c9SDave Chinner * Set up environment. 242630f712c9SDave Chinner */ 242730f712c9SDave Chinner ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC || 242830f712c9SDave Chinner ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC); 242930f712c9SDave Chinner ASSERT(ichdr_s->magic == ichdr_d->magic); 243030f712c9SDave Chinner ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8); 243130f712c9SDave Chinner ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s)) 243230f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_s)); 243330f712c9SDave Chinner ASSERT(ichdr_d->count < args->geo->blksize / 8); 243430f712c9SDave Chinner ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d)) 243530f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d)); 243630f712c9SDave Chinner 243730f712c9SDave Chinner ASSERT(start_s < ichdr_s->count); 243830f712c9SDave Chinner ASSERT(start_d <= ichdr_d->count); 243930f712c9SDave Chinner ASSERT(count <= ichdr_s->count); 244030f712c9SDave Chinner 244130f712c9SDave Chinner 244230f712c9SDave Chinner /* 244330f712c9SDave Chinner * Move the entries in the destination leaf up to make a hole? 244430f712c9SDave Chinner */ 244530f712c9SDave Chinner if (start_d < ichdr_d->count) { 244630f712c9SDave Chinner tmp = ichdr_d->count - start_d; 244730f712c9SDave Chinner tmp *= sizeof(xfs_attr_leaf_entry_t); 244830f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 244930f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count]; 245030f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 245130f712c9SDave Chinner } 245230f712c9SDave Chinner 245330f712c9SDave Chinner /* 245430f712c9SDave Chinner * Copy all entry's in the same (sorted) order, 245530f712c9SDave Chinner * but allocate attribute info packed and in sequence. 245630f712c9SDave Chinner */ 245730f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 245830f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d]; 245930f712c9SDave Chinner desti = start_d; 246030f712c9SDave Chinner for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) { 246130f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused); 246230f712c9SDave Chinner tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i); 246330f712c9SDave Chinner #ifdef GROT 246430f712c9SDave Chinner /* 246530f712c9SDave Chinner * Code to drop INCOMPLETE entries. Difficult to use as we 246630f712c9SDave Chinner * may also need to change the insertion index. Code turned 246730f712c9SDave Chinner * off for 6.2, should be revisited later. 246830f712c9SDave Chinner */ 246930f712c9SDave Chinner if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */ 247030f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 247130f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 247230f712c9SDave Chinner ichdr_s->count -= 1; 247330f712c9SDave Chinner entry_d--; /* to compensate for ++ in loop hdr */ 247430f712c9SDave Chinner desti--; 247530f712c9SDave Chinner if ((start_s + i) < offset) 247630f712c9SDave Chinner result++; /* insertion index adjustment */ 247730f712c9SDave Chinner } else { 247830f712c9SDave Chinner #endif /* GROT */ 247930f712c9SDave Chinner ichdr_d->firstused -= tmp; 248030f712c9SDave Chinner /* both on-disk, don't endian flip twice */ 248130f712c9SDave Chinner entry_d->hashval = entry_s->hashval; 248230f712c9SDave Chinner entry_d->nameidx = cpu_to_be16(ichdr_d->firstused); 248330f712c9SDave Chinner entry_d->flags = entry_s->flags; 248430f712c9SDave Chinner ASSERT(be16_to_cpu(entry_d->nameidx) + tmp 248530f712c9SDave Chinner <= args->geo->blksize); 248630f712c9SDave Chinner memmove(xfs_attr3_leaf_name(leaf_d, desti), 248730f712c9SDave Chinner xfs_attr3_leaf_name(leaf_s, start_s + i), tmp); 248830f712c9SDave Chinner ASSERT(be16_to_cpu(entry_s->nameidx) + tmp 248930f712c9SDave Chinner <= args->geo->blksize); 249030f712c9SDave Chinner memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp); 249130f712c9SDave Chinner ichdr_s->usedbytes -= tmp; 249230f712c9SDave Chinner ichdr_d->usedbytes += tmp; 249330f712c9SDave Chinner ichdr_s->count -= 1; 249430f712c9SDave Chinner ichdr_d->count += 1; 249530f712c9SDave Chinner tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t) 249630f712c9SDave Chinner + xfs_attr3_leaf_hdr_size(leaf_d); 249730f712c9SDave Chinner ASSERT(ichdr_d->firstused >= tmp); 249830f712c9SDave Chinner #ifdef GROT 249930f712c9SDave Chinner } 250030f712c9SDave Chinner #endif /* GROT */ 250130f712c9SDave Chinner } 250230f712c9SDave Chinner 250330f712c9SDave Chinner /* 250430f712c9SDave Chinner * Zero out the entries we just copied. 250530f712c9SDave Chinner */ 250630f712c9SDave Chinner if (start_s == ichdr_s->count) { 250730f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 250830f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 250930f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 251030f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 251130f712c9SDave Chinner memset(entry_s, 0, tmp); 251230f712c9SDave Chinner } else { 251330f712c9SDave Chinner /* 251430f712c9SDave Chinner * Move the remaining entries down to fill the hole, 251530f712c9SDave Chinner * then zero the entries at the top. 251630f712c9SDave Chinner */ 251730f712c9SDave Chinner tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t); 251830f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count]; 251930f712c9SDave Chinner entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s]; 252030f712c9SDave Chinner memmove(entry_d, entry_s, tmp); 252130f712c9SDave Chinner 252230f712c9SDave Chinner tmp = count * sizeof(xfs_attr_leaf_entry_t); 252330f712c9SDave Chinner entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count]; 252430f712c9SDave Chinner ASSERT(((char *)entry_s + tmp) <= 252530f712c9SDave Chinner ((char *)leaf_s + args->geo->blksize)); 252630f712c9SDave Chinner memset(entry_s, 0, tmp); 252730f712c9SDave Chinner } 252830f712c9SDave Chinner 252930f712c9SDave Chinner /* 253030f712c9SDave Chinner * Fill in the freemap information 253130f712c9SDave Chinner */ 253230f712c9SDave Chinner ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d); 253330f712c9SDave Chinner ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t); 253430f712c9SDave Chinner ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base; 253530f712c9SDave Chinner ichdr_d->freemap[1].base = 0; 253630f712c9SDave Chinner ichdr_d->freemap[2].base = 0; 253730f712c9SDave Chinner ichdr_d->freemap[1].size = 0; 253830f712c9SDave Chinner ichdr_d->freemap[2].size = 0; 253930f712c9SDave Chinner ichdr_s->holes = 1; /* leaf may not be compact */ 254030f712c9SDave Chinner } 254130f712c9SDave Chinner 254230f712c9SDave Chinner /* 254330f712c9SDave Chinner * Pick up the last hashvalue from a leaf block. 254430f712c9SDave Chinner */ 254530f712c9SDave Chinner xfs_dahash_t 254630f712c9SDave Chinner xfs_attr_leaf_lasthash( 254730f712c9SDave Chinner struct xfs_buf *bp, 254830f712c9SDave Chinner int *count) 254930f712c9SDave Chinner { 255030f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 255130f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 25522f661241SBrian Foster struct xfs_mount *mp = bp->b_target->bt_mount; 255330f712c9SDave Chinner 25542f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, bp->b_addr); 255530f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(bp->b_addr); 255630f712c9SDave Chinner if (count) 255730f712c9SDave Chinner *count = ichdr.count; 255830f712c9SDave Chinner if (!ichdr.count) 255930f712c9SDave Chinner return 0; 256030f712c9SDave Chinner return be32_to_cpu(entries[ichdr.count - 1].hashval); 256130f712c9SDave Chinner } 256230f712c9SDave Chinner 256330f712c9SDave Chinner /* 256430f712c9SDave Chinner * Calculate the number of bytes used to store the indicated attribute 256530f712c9SDave Chinner * (whether local or remote only calculate bytes in this block). 256630f712c9SDave Chinner */ 256730f712c9SDave Chinner STATIC int 256830f712c9SDave Chinner xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) 256930f712c9SDave Chinner { 257030f712c9SDave Chinner struct xfs_attr_leaf_entry *entries; 257130f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 257230f712c9SDave Chinner xfs_attr_leaf_name_remote_t *name_rmt; 257330f712c9SDave Chinner int size; 257430f712c9SDave Chinner 257530f712c9SDave Chinner entries = xfs_attr3_leaf_entryp(leaf); 257630f712c9SDave Chinner if (entries[index].flags & XFS_ATTR_LOCAL) { 257730f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, index); 257830f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(name_loc->namelen, 257930f712c9SDave Chinner be16_to_cpu(name_loc->valuelen)); 258030f712c9SDave Chinner } else { 258130f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, index); 258230f712c9SDave Chinner size = xfs_attr_leaf_entsize_remote(name_rmt->namelen); 258330f712c9SDave Chinner } 258430f712c9SDave Chinner return size; 258530f712c9SDave Chinner } 258630f712c9SDave Chinner 258730f712c9SDave Chinner /* 258830f712c9SDave Chinner * Calculate the number of bytes that would be required to store the new 258930f712c9SDave Chinner * attribute (whether local or remote only calculate bytes in this block). 259030f712c9SDave Chinner * This routine decides as a side effect whether the attribute will be 259130f712c9SDave Chinner * a "local" or a "remote" attribute. 259230f712c9SDave Chinner */ 259330f712c9SDave Chinner int 259430f712c9SDave Chinner xfs_attr_leaf_newentsize( 259530f712c9SDave Chinner struct xfs_da_args *args, 259630f712c9SDave Chinner int *local) 259730f712c9SDave Chinner { 259830f712c9SDave Chinner int size; 259930f712c9SDave Chinner 260030f712c9SDave Chinner size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen); 260130f712c9SDave Chinner if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) { 260230f712c9SDave Chinner if (local) 260330f712c9SDave Chinner *local = 1; 260430f712c9SDave Chinner return size; 260530f712c9SDave Chinner } 260630f712c9SDave Chinner if (local) 260730f712c9SDave Chinner *local = 0; 260830f712c9SDave Chinner return xfs_attr_leaf_entsize_remote(args->namelen); 260930f712c9SDave Chinner } 261030f712c9SDave Chinner 261130f712c9SDave Chinner 261230f712c9SDave Chinner /*======================================================================== 261330f712c9SDave Chinner * Manage the INCOMPLETE flag in a leaf entry 261430f712c9SDave Chinner *========================================================================*/ 261530f712c9SDave Chinner 261630f712c9SDave Chinner /* 261730f712c9SDave Chinner * Clear the INCOMPLETE flag on an entry in a leaf block. 261830f712c9SDave Chinner */ 261930f712c9SDave Chinner int 262030f712c9SDave Chinner xfs_attr3_leaf_clearflag( 262130f712c9SDave Chinner struct xfs_da_args *args) 262230f712c9SDave Chinner { 262330f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 262430f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 262530f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 262630f712c9SDave Chinner struct xfs_buf *bp; 262730f712c9SDave Chinner int error; 262830f712c9SDave Chinner #ifdef DEBUG 262930f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 263030f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 263130f712c9SDave Chinner int namelen; 263230f712c9SDave Chinner char *name; 263330f712c9SDave Chinner #endif /* DEBUG */ 263430f712c9SDave Chinner 263530f712c9SDave Chinner trace_xfs_attr_leaf_clearflag(args); 263630f712c9SDave Chinner /* 263730f712c9SDave Chinner * Set up the operation. 263830f712c9SDave Chinner */ 263930f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); 264030f712c9SDave Chinner if (error) 264130f712c9SDave Chinner return error; 264230f712c9SDave Chinner 264330f712c9SDave Chinner leaf = bp->b_addr; 264430f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 264530f712c9SDave Chinner ASSERT(entry->flags & XFS_ATTR_INCOMPLETE); 264630f712c9SDave Chinner 264730f712c9SDave Chinner #ifdef DEBUG 26482f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 264930f712c9SDave Chinner ASSERT(args->index < ichdr.count); 265030f712c9SDave Chinner ASSERT(args->index >= 0); 265130f712c9SDave Chinner 265230f712c9SDave Chinner if (entry->flags & XFS_ATTR_LOCAL) { 265330f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf, args->index); 265430f712c9SDave Chinner namelen = name_loc->namelen; 265530f712c9SDave Chinner name = (char *)name_loc->nameval; 265630f712c9SDave Chinner } else { 265730f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 265830f712c9SDave Chinner namelen = name_rmt->namelen; 265930f712c9SDave Chinner name = (char *)name_rmt->name; 266030f712c9SDave Chinner } 266130f712c9SDave Chinner ASSERT(be32_to_cpu(entry->hashval) == args->hashval); 266230f712c9SDave Chinner ASSERT(namelen == args->namelen); 266330f712c9SDave Chinner ASSERT(memcmp(name, args->name, namelen) == 0); 266430f712c9SDave Chinner #endif /* DEBUG */ 266530f712c9SDave Chinner 266630f712c9SDave Chinner entry->flags &= ~XFS_ATTR_INCOMPLETE; 266730f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 266830f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 266930f712c9SDave Chinner 267030f712c9SDave Chinner if (args->rmtblkno) { 267130f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0); 267230f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 267330f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 267430f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 267530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 267630f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 267730f712c9SDave Chinner } 267830f712c9SDave Chinner 267930f712c9SDave Chinner /* 268030f712c9SDave Chinner * Commit the flag value change and start the next trans in series. 268130f712c9SDave Chinner */ 2682411350dfSChristoph Hellwig return xfs_trans_roll_inode(&args->trans, args->dp); 268330f712c9SDave Chinner } 268430f712c9SDave Chinner 268530f712c9SDave Chinner /* 268630f712c9SDave Chinner * Set the INCOMPLETE flag on an entry in a leaf block. 268730f712c9SDave Chinner */ 268830f712c9SDave Chinner int 268930f712c9SDave Chinner xfs_attr3_leaf_setflag( 269030f712c9SDave Chinner struct xfs_da_args *args) 269130f712c9SDave Chinner { 269230f712c9SDave Chinner struct xfs_attr_leafblock *leaf; 269330f712c9SDave Chinner struct xfs_attr_leaf_entry *entry; 269430f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 269530f712c9SDave Chinner struct xfs_buf *bp; 269630f712c9SDave Chinner int error; 269730f712c9SDave Chinner #ifdef DEBUG 269830f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr; 269930f712c9SDave Chinner #endif 270030f712c9SDave Chinner 270130f712c9SDave Chinner trace_xfs_attr_leaf_setflag(args); 270230f712c9SDave Chinner 270330f712c9SDave Chinner /* 270430f712c9SDave Chinner * Set up the operation. 270530f712c9SDave Chinner */ 270630f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp); 270730f712c9SDave Chinner if (error) 270830f712c9SDave Chinner return error; 270930f712c9SDave Chinner 271030f712c9SDave Chinner leaf = bp->b_addr; 271130f712c9SDave Chinner #ifdef DEBUG 27122f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr, leaf); 271330f712c9SDave Chinner ASSERT(args->index < ichdr.count); 271430f712c9SDave Chinner ASSERT(args->index >= 0); 271530f712c9SDave Chinner #endif 271630f712c9SDave Chinner entry = &xfs_attr3_leaf_entryp(leaf)[args->index]; 271730f712c9SDave Chinner 271830f712c9SDave Chinner ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0); 271930f712c9SDave Chinner entry->flags |= XFS_ATTR_INCOMPLETE; 272030f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 272130f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry))); 272230f712c9SDave Chinner if ((entry->flags & XFS_ATTR_LOCAL) == 0) { 272330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index); 272430f712c9SDave Chinner name_rmt->valueblk = 0; 272530f712c9SDave Chinner name_rmt->valuelen = 0; 272630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 272730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt))); 272830f712c9SDave Chinner } 272930f712c9SDave Chinner 273030f712c9SDave Chinner /* 273130f712c9SDave Chinner * Commit the flag value change and start the next trans in series. 273230f712c9SDave Chinner */ 2733411350dfSChristoph Hellwig return xfs_trans_roll_inode(&args->trans, args->dp); 273430f712c9SDave Chinner } 273530f712c9SDave Chinner 273630f712c9SDave Chinner /* 273730f712c9SDave Chinner * In a single transaction, clear the INCOMPLETE flag on the leaf entry 273830f712c9SDave Chinner * given by args->blkno/index and set the INCOMPLETE flag on the leaf 273930f712c9SDave Chinner * entry given by args->blkno2/index2. 274030f712c9SDave Chinner * 274130f712c9SDave Chinner * Note that they could be in different blocks, or in the same block. 274230f712c9SDave Chinner */ 274330f712c9SDave Chinner int 274430f712c9SDave Chinner xfs_attr3_leaf_flipflags( 274530f712c9SDave Chinner struct xfs_da_args *args) 274630f712c9SDave Chinner { 274730f712c9SDave Chinner struct xfs_attr_leafblock *leaf1; 274830f712c9SDave Chinner struct xfs_attr_leafblock *leaf2; 274930f712c9SDave Chinner struct xfs_attr_leaf_entry *entry1; 275030f712c9SDave Chinner struct xfs_attr_leaf_entry *entry2; 275130f712c9SDave Chinner struct xfs_attr_leaf_name_remote *name_rmt; 275230f712c9SDave Chinner struct xfs_buf *bp1; 275330f712c9SDave Chinner struct xfs_buf *bp2; 275430f712c9SDave Chinner int error; 275530f712c9SDave Chinner #ifdef DEBUG 275630f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr1; 275730f712c9SDave Chinner struct xfs_attr3_icleaf_hdr ichdr2; 275830f712c9SDave Chinner xfs_attr_leaf_name_local_t *name_loc; 275930f712c9SDave Chinner int namelen1, namelen2; 276030f712c9SDave Chinner char *name1, *name2; 276130f712c9SDave Chinner #endif /* DEBUG */ 276230f712c9SDave Chinner 276330f712c9SDave Chinner trace_xfs_attr_leaf_flipflags(args); 276430f712c9SDave Chinner 276530f712c9SDave Chinner /* 276630f712c9SDave Chinner * Read the block containing the "old" attr 276730f712c9SDave Chinner */ 276830f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp1); 276930f712c9SDave Chinner if (error) 277030f712c9SDave Chinner return error; 277130f712c9SDave Chinner 277230f712c9SDave Chinner /* 277330f712c9SDave Chinner * Read the block containing the "new" attr, if it is different 277430f712c9SDave Chinner */ 277530f712c9SDave Chinner if (args->blkno2 != args->blkno) { 277630f712c9SDave Chinner error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2, 277730f712c9SDave Chinner -1, &bp2); 277830f712c9SDave Chinner if (error) 277930f712c9SDave Chinner return error; 278030f712c9SDave Chinner } else { 278130f712c9SDave Chinner bp2 = bp1; 278230f712c9SDave Chinner } 278330f712c9SDave Chinner 278430f712c9SDave Chinner leaf1 = bp1->b_addr; 278530f712c9SDave Chinner entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index]; 278630f712c9SDave Chinner 278730f712c9SDave Chinner leaf2 = bp2->b_addr; 278830f712c9SDave Chinner entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2]; 278930f712c9SDave Chinner 279030f712c9SDave Chinner #ifdef DEBUG 27912f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr1, leaf1); 279230f712c9SDave Chinner ASSERT(args->index < ichdr1.count); 279330f712c9SDave Chinner ASSERT(args->index >= 0); 279430f712c9SDave Chinner 27952f661241SBrian Foster xfs_attr3_leaf_hdr_from_disk(args->geo, &ichdr2, leaf2); 279630f712c9SDave Chinner ASSERT(args->index2 < ichdr2.count); 279730f712c9SDave Chinner ASSERT(args->index2 >= 0); 279830f712c9SDave Chinner 279930f712c9SDave Chinner if (entry1->flags & XFS_ATTR_LOCAL) { 280030f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf1, args->index); 280130f712c9SDave Chinner namelen1 = name_loc->namelen; 280230f712c9SDave Chinner name1 = (char *)name_loc->nameval; 280330f712c9SDave Chinner } else { 280430f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 280530f712c9SDave Chinner namelen1 = name_rmt->namelen; 280630f712c9SDave Chinner name1 = (char *)name_rmt->name; 280730f712c9SDave Chinner } 280830f712c9SDave Chinner if (entry2->flags & XFS_ATTR_LOCAL) { 280930f712c9SDave Chinner name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2); 281030f712c9SDave Chinner namelen2 = name_loc->namelen; 281130f712c9SDave Chinner name2 = (char *)name_loc->nameval; 281230f712c9SDave Chinner } else { 281330f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 281430f712c9SDave Chinner namelen2 = name_rmt->namelen; 281530f712c9SDave Chinner name2 = (char *)name_rmt->name; 281630f712c9SDave Chinner } 281730f712c9SDave Chinner ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval)); 281830f712c9SDave Chinner ASSERT(namelen1 == namelen2); 281930f712c9SDave Chinner ASSERT(memcmp(name1, name2, namelen1) == 0); 282030f712c9SDave Chinner #endif /* DEBUG */ 282130f712c9SDave Chinner 282230f712c9SDave Chinner ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE); 282330f712c9SDave Chinner ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0); 282430f712c9SDave Chinner 282530f712c9SDave Chinner entry1->flags &= ~XFS_ATTR_INCOMPLETE; 282630f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 282730f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1))); 282830f712c9SDave Chinner if (args->rmtblkno) { 282930f712c9SDave Chinner ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0); 283030f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index); 283130f712c9SDave Chinner name_rmt->valueblk = cpu_to_be32(args->rmtblkno); 283230f712c9SDave Chinner name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen); 283330f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp1, 283430f712c9SDave Chinner XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt))); 283530f712c9SDave Chinner } 283630f712c9SDave Chinner 283730f712c9SDave Chinner entry2->flags |= XFS_ATTR_INCOMPLETE; 283830f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 283930f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2))); 284030f712c9SDave Chinner if ((entry2->flags & XFS_ATTR_LOCAL) == 0) { 284130f712c9SDave Chinner name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2); 284230f712c9SDave Chinner name_rmt->valueblk = 0; 284330f712c9SDave Chinner name_rmt->valuelen = 0; 284430f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp2, 284530f712c9SDave Chinner XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt))); 284630f712c9SDave Chinner } 284730f712c9SDave Chinner 284830f712c9SDave Chinner /* 284930f712c9SDave Chinner * Commit the flag value change and start the next trans in series. 285030f712c9SDave Chinner */ 2851411350dfSChristoph Hellwig error = xfs_trans_roll_inode(&args->trans, args->dp); 285230f712c9SDave Chinner 285330f712c9SDave Chinner return error; 285430f712c9SDave Chinner } 2855