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