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