130f712c9SDave Chinner /* 230f712c9SDave Chinner * Copyright (c) 2000-2003,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_format.h" 2230f712c9SDave Chinner #include "xfs_log_format.h" 2330f712c9SDave Chinner #include "xfs_trans_resv.h" 2430f712c9SDave Chinner #include "xfs_mount.h" 2530f712c9SDave Chinner #include "xfs_da_format.h" 2630f712c9SDave Chinner #include "xfs_da_btree.h" 2730f712c9SDave Chinner #include "xfs_inode.h" 2830f712c9SDave Chinner #include "xfs_bmap.h" 2930f712c9SDave Chinner #include "xfs_dir2.h" 3030f712c9SDave Chinner #include "xfs_dir2_priv.h" 3130f712c9SDave Chinner #include "xfs_error.h" 3230f712c9SDave Chinner #include "xfs_trace.h" 3330f712c9SDave Chinner #include "xfs_trans.h" 3430f712c9SDave Chinner #include "xfs_buf_item.h" 3530f712c9SDave Chinner #include "xfs_cksum.h" 36a45086e2SBrian Foster #include "xfs_log.h" 3730f712c9SDave Chinner 3830f712c9SDave Chinner /* 3930f712c9SDave Chinner * Local function declarations. 4030f712c9SDave Chinner */ 4130f712c9SDave Chinner static int xfs_dir2_leaf_lookup_int(xfs_da_args_t *args, struct xfs_buf **lbpp, 4230f712c9SDave Chinner int *indexp, struct xfs_buf **dbpp); 4330f712c9SDave Chinner static void xfs_dir3_leaf_log_bests(struct xfs_da_args *args, 4430f712c9SDave Chinner struct xfs_buf *bp, int first, int last); 4530f712c9SDave Chinner static void xfs_dir3_leaf_log_tail(struct xfs_da_args *args, 4630f712c9SDave Chinner struct xfs_buf *bp); 4730f712c9SDave Chinner 4830f712c9SDave Chinner /* 4930f712c9SDave Chinner * Check the internal consistency of a leaf1 block. 5030f712c9SDave Chinner * Pop an assert if something is wrong. 5130f712c9SDave Chinner */ 5230f712c9SDave Chinner #ifdef DEBUG 53a6a781a5SDarrick J. Wong static xfs_failaddr_t 5430f712c9SDave Chinner xfs_dir3_leaf1_check( 5530f712c9SDave Chinner struct xfs_inode *dp, 5630f712c9SDave Chinner struct xfs_buf *bp) 5730f712c9SDave Chinner { 5830f712c9SDave Chinner struct xfs_dir2_leaf *leaf = bp->b_addr; 5930f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 6030f712c9SDave Chinner 6130f712c9SDave Chinner dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 6230f712c9SDave Chinner 6330f712c9SDave Chinner if (leafhdr.magic == XFS_DIR3_LEAF1_MAGIC) { 6430f712c9SDave Chinner struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; 6530f712c9SDave Chinner if (be64_to_cpu(leaf3->info.blkno) != bp->b_bn) 66a6a781a5SDarrick J. Wong return __this_address; 6730f712c9SDave Chinner } else if (leafhdr.magic != XFS_DIR2_LEAF1_MAGIC) 68a6a781a5SDarrick J. Wong return __this_address; 6930f712c9SDave Chinner 7030f712c9SDave Chinner return xfs_dir3_leaf_check_int(dp->i_mount, dp, &leafhdr, leaf); 7130f712c9SDave Chinner } 72a6a781a5SDarrick J. Wong 73a6a781a5SDarrick J. Wong static inline void 74a6a781a5SDarrick J. Wong xfs_dir3_leaf_check( 75a6a781a5SDarrick J. Wong struct xfs_inode *dp, 76a6a781a5SDarrick J. Wong struct xfs_buf *bp) 77a6a781a5SDarrick J. Wong { 78a6a781a5SDarrick J. Wong xfs_failaddr_t fa; 79a6a781a5SDarrick J. Wong 80a6a781a5SDarrick J. Wong fa = xfs_dir3_leaf1_check(dp, bp); 81a6a781a5SDarrick J. Wong if (!fa) 82a6a781a5SDarrick J. Wong return; 83a6a781a5SDarrick J. Wong xfs_corruption_error(__func__, XFS_ERRLEVEL_LOW, dp->i_mount, 84a6a781a5SDarrick J. Wong bp->b_addr, __FILE__, __LINE__, fa); 85a6a781a5SDarrick J. Wong ASSERT(0); 86a6a781a5SDarrick J. Wong } 8730f712c9SDave Chinner #else 8830f712c9SDave Chinner #define xfs_dir3_leaf_check(dp, bp) 8930f712c9SDave Chinner #endif 9030f712c9SDave Chinner 91a6a781a5SDarrick J. Wong xfs_failaddr_t 9230f712c9SDave Chinner xfs_dir3_leaf_check_int( 9330f712c9SDave Chinner struct xfs_mount *mp, 9430f712c9SDave Chinner struct xfs_inode *dp, 9530f712c9SDave Chinner struct xfs_dir3_icleaf_hdr *hdr, 9630f712c9SDave Chinner struct xfs_dir2_leaf *leaf) 9730f712c9SDave Chinner { 9830f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 9930f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; 10030f712c9SDave Chinner int stale; 10130f712c9SDave Chinner int i; 10230f712c9SDave Chinner const struct xfs_dir_ops *ops; 10330f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 10430f712c9SDave Chinner struct xfs_da_geometry *geo = mp->m_dir_geo; 10530f712c9SDave Chinner 10630f712c9SDave Chinner /* 10730f712c9SDave Chinner * we can be passed a null dp here from a verifier, so we need to go the 10830f712c9SDave Chinner * hard way to get them. 10930f712c9SDave Chinner */ 11030f712c9SDave Chinner ops = xfs_dir_get_ops(mp, dp); 11130f712c9SDave Chinner 11230f712c9SDave Chinner if (!hdr) { 11330f712c9SDave Chinner ops->leaf_hdr_from_disk(&leafhdr, leaf); 11430f712c9SDave Chinner hdr = &leafhdr; 11530f712c9SDave Chinner } 11630f712c9SDave Chinner 11730f712c9SDave Chinner ents = ops->leaf_ents_p(leaf); 11830f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(geo, leaf); 11930f712c9SDave Chinner 12030f712c9SDave Chinner /* 12130f712c9SDave Chinner * XXX (dgc): This value is not restrictive enough. 12230f712c9SDave Chinner * Should factor in the size of the bests table as well. 12330f712c9SDave Chinner * We can deduce a value for that from di_size. 12430f712c9SDave Chinner */ 12530f712c9SDave Chinner if (hdr->count > ops->leaf_max_ents(geo)) 126a6a781a5SDarrick J. Wong return __this_address; 12730f712c9SDave Chinner 12830f712c9SDave Chinner /* Leaves and bests don't overlap in leaf format. */ 12930f712c9SDave Chinner if ((hdr->magic == XFS_DIR2_LEAF1_MAGIC || 13030f712c9SDave Chinner hdr->magic == XFS_DIR3_LEAF1_MAGIC) && 13130f712c9SDave Chinner (char *)&ents[hdr->count] > (char *)xfs_dir2_leaf_bests_p(ltp)) 132a6a781a5SDarrick J. Wong return __this_address; 13330f712c9SDave Chinner 13430f712c9SDave Chinner /* Check hash value order, count stale entries. */ 13530f712c9SDave Chinner for (i = stale = 0; i < hdr->count; i++) { 13630f712c9SDave Chinner if (i + 1 < hdr->count) { 13730f712c9SDave Chinner if (be32_to_cpu(ents[i].hashval) > 13830f712c9SDave Chinner be32_to_cpu(ents[i + 1].hashval)) 139a6a781a5SDarrick J. Wong return __this_address; 14030f712c9SDave Chinner } 14130f712c9SDave Chinner if (ents[i].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) 14230f712c9SDave Chinner stale++; 14330f712c9SDave Chinner } 14430f712c9SDave Chinner if (hdr->stale != stale) 145a6a781a5SDarrick J. Wong return __this_address; 146a6a781a5SDarrick J. Wong return NULL; 14730f712c9SDave Chinner } 14830f712c9SDave Chinner 14930f712c9SDave Chinner /* 15030f712c9SDave Chinner * We verify the magic numbers before decoding the leaf header so that on debug 15130f712c9SDave Chinner * kernels we don't get assertion failures in xfs_dir3_leaf_hdr_from_disk() due 15230f712c9SDave Chinner * to incorrect magic numbers. 15330f712c9SDave Chinner */ 154a6a781a5SDarrick J. Wong static xfs_failaddr_t 15530f712c9SDave Chinner xfs_dir3_leaf_verify( 15630f712c9SDave Chinner struct xfs_buf *bp, 157c8ce540dSDarrick J. Wong uint16_t magic) 15830f712c9SDave Chinner { 15930f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 16030f712c9SDave Chinner struct xfs_dir2_leaf *leaf = bp->b_addr; 16130f712c9SDave Chinner 16230f712c9SDave Chinner ASSERT(magic == XFS_DIR2_LEAF1_MAGIC || magic == XFS_DIR2_LEAFN_MAGIC); 16330f712c9SDave Chinner 16430f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 16530f712c9SDave Chinner struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; 166c8ce540dSDarrick J. Wong uint16_t magic3; 16730f712c9SDave Chinner 16830f712c9SDave Chinner magic3 = (magic == XFS_DIR2_LEAF1_MAGIC) ? XFS_DIR3_LEAF1_MAGIC 16930f712c9SDave Chinner : XFS_DIR3_LEAFN_MAGIC; 17030f712c9SDave Chinner 17130f712c9SDave Chinner if (leaf3->info.hdr.magic != cpu_to_be16(magic3)) 172a6a781a5SDarrick J. Wong return __this_address; 173ce748eaaSEric Sandeen if (!uuid_equal(&leaf3->info.uuid, &mp->m_sb.sb_meta_uuid)) 174a6a781a5SDarrick J. Wong return __this_address; 17530f712c9SDave Chinner if (be64_to_cpu(leaf3->info.blkno) != bp->b_bn) 176a6a781a5SDarrick J. Wong return __this_address; 177a45086e2SBrian Foster if (!xfs_log_check_lsn(mp, be64_to_cpu(leaf3->info.lsn))) 178a6a781a5SDarrick J. Wong return __this_address; 17930f712c9SDave Chinner } else { 18030f712c9SDave Chinner if (leaf->hdr.info.magic != cpu_to_be16(magic)) 181a6a781a5SDarrick J. Wong return __this_address; 18230f712c9SDave Chinner } 18330f712c9SDave Chinner 18430f712c9SDave Chinner return xfs_dir3_leaf_check_int(mp, NULL, NULL, leaf); 18530f712c9SDave Chinner } 18630f712c9SDave Chinner 18730f712c9SDave Chinner static void 18830f712c9SDave Chinner __read_verify( 18930f712c9SDave Chinner struct xfs_buf *bp, 190c8ce540dSDarrick J. Wong uint16_t magic) 19130f712c9SDave Chinner { 19230f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 193bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 19430f712c9SDave Chinner 19530f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb) && 19630f712c9SDave Chinner !xfs_buf_verify_cksum(bp, XFS_DIR3_LEAF_CRC_OFF)) 197bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSBADCRC, __this_address); 198bc1a09b8SDarrick J. Wong else { 199bc1a09b8SDarrick J. Wong fa = xfs_dir3_leaf_verify(bp, magic); 200bc1a09b8SDarrick J. Wong if (fa) 201bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 202bc1a09b8SDarrick J. Wong } 20330f712c9SDave Chinner } 20430f712c9SDave Chinner 20530f712c9SDave Chinner static void 20630f712c9SDave Chinner __write_verify( 20730f712c9SDave Chinner struct xfs_buf *bp, 208c8ce540dSDarrick J. Wong uint16_t magic) 20930f712c9SDave Chinner { 21030f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 21130f712c9SDave Chinner struct xfs_buf_log_item *bip = bp->b_fspriv; 21230f712c9SDave Chinner struct xfs_dir3_leaf_hdr *hdr3 = bp->b_addr; 213bc1a09b8SDarrick J. Wong xfs_failaddr_t fa; 21430f712c9SDave Chinner 215bc1a09b8SDarrick J. Wong fa = xfs_dir3_leaf_verify(bp, magic); 216bc1a09b8SDarrick J. Wong if (fa) { 217bc1a09b8SDarrick J. Wong xfs_verifier_error(bp, -EFSCORRUPTED, fa); 21830f712c9SDave Chinner return; 21930f712c9SDave Chinner } 22030f712c9SDave Chinner 22130f712c9SDave Chinner if (!xfs_sb_version_hascrc(&mp->m_sb)) 22230f712c9SDave Chinner return; 22330f712c9SDave Chinner 22430f712c9SDave Chinner if (bip) 22530f712c9SDave Chinner hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); 22630f712c9SDave Chinner 22730f712c9SDave Chinner xfs_buf_update_cksum(bp, XFS_DIR3_LEAF_CRC_OFF); 22830f712c9SDave Chinner } 22930f712c9SDave Chinner 23030f712c9SDave Chinner static void 23130f712c9SDave Chinner xfs_dir3_leaf1_read_verify( 23230f712c9SDave Chinner struct xfs_buf *bp) 23330f712c9SDave Chinner { 23430f712c9SDave Chinner __read_verify(bp, XFS_DIR2_LEAF1_MAGIC); 23530f712c9SDave Chinner } 23630f712c9SDave Chinner 23730f712c9SDave Chinner static void 23830f712c9SDave Chinner xfs_dir3_leaf1_write_verify( 23930f712c9SDave Chinner struct xfs_buf *bp) 24030f712c9SDave Chinner { 24130f712c9SDave Chinner __write_verify(bp, XFS_DIR2_LEAF1_MAGIC); 24230f712c9SDave Chinner } 24330f712c9SDave Chinner 24430f712c9SDave Chinner static void 24530f712c9SDave Chinner xfs_dir3_leafn_read_verify( 24630f712c9SDave Chinner struct xfs_buf *bp) 24730f712c9SDave Chinner { 24830f712c9SDave Chinner __read_verify(bp, XFS_DIR2_LEAFN_MAGIC); 24930f712c9SDave Chinner } 25030f712c9SDave Chinner 25130f712c9SDave Chinner static void 25230f712c9SDave Chinner xfs_dir3_leafn_write_verify( 25330f712c9SDave Chinner struct xfs_buf *bp) 25430f712c9SDave Chinner { 25530f712c9SDave Chinner __write_verify(bp, XFS_DIR2_LEAFN_MAGIC); 25630f712c9SDave Chinner } 25730f712c9SDave Chinner 25830f712c9SDave Chinner const struct xfs_buf_ops xfs_dir3_leaf1_buf_ops = { 259233135b7SEric Sandeen .name = "xfs_dir3_leaf1", 26030f712c9SDave Chinner .verify_read = xfs_dir3_leaf1_read_verify, 26130f712c9SDave Chinner .verify_write = xfs_dir3_leaf1_write_verify, 26230f712c9SDave Chinner }; 26330f712c9SDave Chinner 26430f712c9SDave Chinner const struct xfs_buf_ops xfs_dir3_leafn_buf_ops = { 265233135b7SEric Sandeen .name = "xfs_dir3_leafn", 26630f712c9SDave Chinner .verify_read = xfs_dir3_leafn_read_verify, 26730f712c9SDave Chinner .verify_write = xfs_dir3_leafn_write_verify, 26830f712c9SDave Chinner }; 26930f712c9SDave Chinner 27026788097SDarrick J. Wong int 27130f712c9SDave Chinner xfs_dir3_leaf_read( 27230f712c9SDave Chinner struct xfs_trans *tp, 27330f712c9SDave Chinner struct xfs_inode *dp, 27430f712c9SDave Chinner xfs_dablk_t fbno, 27530f712c9SDave Chinner xfs_daddr_t mappedbno, 27630f712c9SDave Chinner struct xfs_buf **bpp) 27730f712c9SDave Chinner { 27830f712c9SDave Chinner int err; 27930f712c9SDave Chinner 28030f712c9SDave Chinner err = xfs_da_read_buf(tp, dp, fbno, mappedbno, bpp, 28130f712c9SDave Chinner XFS_DATA_FORK, &xfs_dir3_leaf1_buf_ops); 282cd87d867SDarrick J. Wong if (!err && tp && *bpp) 28330f712c9SDave Chinner xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAF1_BUF); 28430f712c9SDave Chinner return err; 28530f712c9SDave Chinner } 28630f712c9SDave Chinner 28730f712c9SDave Chinner int 28830f712c9SDave Chinner xfs_dir3_leafn_read( 28930f712c9SDave Chinner struct xfs_trans *tp, 29030f712c9SDave Chinner struct xfs_inode *dp, 29130f712c9SDave Chinner xfs_dablk_t fbno, 29230f712c9SDave Chinner xfs_daddr_t mappedbno, 29330f712c9SDave Chinner struct xfs_buf **bpp) 29430f712c9SDave Chinner { 29530f712c9SDave Chinner int err; 29630f712c9SDave Chinner 29730f712c9SDave Chinner err = xfs_da_read_buf(tp, dp, fbno, mappedbno, bpp, 29830f712c9SDave Chinner XFS_DATA_FORK, &xfs_dir3_leafn_buf_ops); 299cd87d867SDarrick J. Wong if (!err && tp && *bpp) 30030f712c9SDave Chinner xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAFN_BUF); 30130f712c9SDave Chinner return err; 30230f712c9SDave Chinner } 30330f712c9SDave Chinner 30430f712c9SDave Chinner /* 30530f712c9SDave Chinner * Initialize a new leaf block, leaf1 or leafn magic accepted. 30630f712c9SDave Chinner */ 30730f712c9SDave Chinner static void 30830f712c9SDave Chinner xfs_dir3_leaf_init( 30930f712c9SDave Chinner struct xfs_mount *mp, 31030f712c9SDave Chinner struct xfs_trans *tp, 31130f712c9SDave Chinner struct xfs_buf *bp, 31230f712c9SDave Chinner xfs_ino_t owner, 313c8ce540dSDarrick J. Wong uint16_t type) 31430f712c9SDave Chinner { 31530f712c9SDave Chinner struct xfs_dir2_leaf *leaf = bp->b_addr; 31630f712c9SDave Chinner 31730f712c9SDave Chinner ASSERT(type == XFS_DIR2_LEAF1_MAGIC || type == XFS_DIR2_LEAFN_MAGIC); 31830f712c9SDave Chinner 31930f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 32030f712c9SDave Chinner struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; 32130f712c9SDave Chinner 32230f712c9SDave Chinner memset(leaf3, 0, sizeof(*leaf3)); 32330f712c9SDave Chinner 32430f712c9SDave Chinner leaf3->info.hdr.magic = (type == XFS_DIR2_LEAF1_MAGIC) 32530f712c9SDave Chinner ? cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) 32630f712c9SDave Chinner : cpu_to_be16(XFS_DIR3_LEAFN_MAGIC); 32730f712c9SDave Chinner leaf3->info.blkno = cpu_to_be64(bp->b_bn); 32830f712c9SDave Chinner leaf3->info.owner = cpu_to_be64(owner); 329ce748eaaSEric Sandeen uuid_copy(&leaf3->info.uuid, &mp->m_sb.sb_meta_uuid); 33030f712c9SDave Chinner } else { 33130f712c9SDave Chinner memset(leaf, 0, sizeof(*leaf)); 33230f712c9SDave Chinner leaf->hdr.info.magic = cpu_to_be16(type); 33330f712c9SDave Chinner } 33430f712c9SDave Chinner 33530f712c9SDave Chinner /* 33630f712c9SDave Chinner * If it's a leaf-format directory initialize the tail. 33730f712c9SDave Chinner * Caller is responsible for initialising the bests table. 33830f712c9SDave Chinner */ 33930f712c9SDave Chinner if (type == XFS_DIR2_LEAF1_MAGIC) { 34030f712c9SDave Chinner struct xfs_dir2_leaf_tail *ltp; 34130f712c9SDave Chinner 34230f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(mp->m_dir_geo, leaf); 34330f712c9SDave Chinner ltp->bestcount = 0; 34430f712c9SDave Chinner bp->b_ops = &xfs_dir3_leaf1_buf_ops; 34530f712c9SDave Chinner xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAF1_BUF); 34630f712c9SDave Chinner } else { 34730f712c9SDave Chinner bp->b_ops = &xfs_dir3_leafn_buf_ops; 34830f712c9SDave Chinner xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAFN_BUF); 34930f712c9SDave Chinner } 35030f712c9SDave Chinner } 35130f712c9SDave Chinner 35230f712c9SDave Chinner int 35330f712c9SDave Chinner xfs_dir3_leaf_get_buf( 35430f712c9SDave Chinner xfs_da_args_t *args, 35530f712c9SDave Chinner xfs_dir2_db_t bno, 35630f712c9SDave Chinner struct xfs_buf **bpp, 357c8ce540dSDarrick J. Wong uint16_t magic) 35830f712c9SDave Chinner { 35930f712c9SDave Chinner struct xfs_inode *dp = args->dp; 36030f712c9SDave Chinner struct xfs_trans *tp = args->trans; 36130f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 36230f712c9SDave Chinner struct xfs_buf *bp; 36330f712c9SDave Chinner int error; 36430f712c9SDave Chinner 36530f712c9SDave Chinner ASSERT(magic == XFS_DIR2_LEAF1_MAGIC || magic == XFS_DIR2_LEAFN_MAGIC); 36630f712c9SDave Chinner ASSERT(bno >= xfs_dir2_byte_to_db(args->geo, XFS_DIR2_LEAF_OFFSET) && 36730f712c9SDave Chinner bno < xfs_dir2_byte_to_db(args->geo, XFS_DIR2_FREE_OFFSET)); 36830f712c9SDave Chinner 36930f712c9SDave Chinner error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(args->geo, bno), 37030f712c9SDave Chinner -1, &bp, XFS_DATA_FORK); 37130f712c9SDave Chinner if (error) 37230f712c9SDave Chinner return error; 37330f712c9SDave Chinner 37430f712c9SDave Chinner xfs_dir3_leaf_init(mp, tp, bp, dp->i_ino, magic); 37530f712c9SDave Chinner xfs_dir3_leaf_log_header(args, bp); 37630f712c9SDave Chinner if (magic == XFS_DIR2_LEAF1_MAGIC) 37730f712c9SDave Chinner xfs_dir3_leaf_log_tail(args, bp); 37830f712c9SDave Chinner *bpp = bp; 37930f712c9SDave Chinner return 0; 38030f712c9SDave Chinner } 38130f712c9SDave Chinner 38230f712c9SDave Chinner /* 38330f712c9SDave Chinner * Convert a block form directory to a leaf form directory. 38430f712c9SDave Chinner */ 38530f712c9SDave Chinner int /* error */ 38630f712c9SDave Chinner xfs_dir2_block_to_leaf( 38730f712c9SDave Chinner xfs_da_args_t *args, /* operation arguments */ 38830f712c9SDave Chinner struct xfs_buf *dbp) /* input block's buffer */ 38930f712c9SDave Chinner { 39030f712c9SDave Chinner __be16 *bestsp; /* leaf's bestsp entries */ 39130f712c9SDave Chinner xfs_dablk_t blkno; /* leaf block's bno */ 39230f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 39330f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; /* block's leaf entries */ 39430f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block's tail */ 39530f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 39630f712c9SDave Chinner int error; /* error return code */ 39730f712c9SDave Chinner struct xfs_buf *lbp; /* leaf block's buffer */ 39830f712c9SDave Chinner xfs_dir2_db_t ldb; /* leaf block's bno */ 39930f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 40030f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* leaf's tail */ 40130f712c9SDave Chinner int needlog; /* need to log block header */ 40230f712c9SDave Chinner int needscan; /* need to rescan bestfree */ 40330f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 40430f712c9SDave Chinner struct xfs_dir2_data_free *bf; 40530f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 40630f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 40730f712c9SDave Chinner 40830f712c9SDave Chinner trace_xfs_dir2_block_to_leaf(args); 40930f712c9SDave Chinner 41030f712c9SDave Chinner dp = args->dp; 41130f712c9SDave Chinner tp = args->trans; 41230f712c9SDave Chinner /* 41330f712c9SDave Chinner * Add the leaf block to the inode. 41430f712c9SDave Chinner * This interface will only put blocks in the leaf/node range. 41530f712c9SDave Chinner * Since that's empty now, we'll get the root (block 0 in range). 41630f712c9SDave Chinner */ 41730f712c9SDave Chinner if ((error = xfs_da_grow_inode(args, &blkno))) { 41830f712c9SDave Chinner return error; 41930f712c9SDave Chinner } 42030f712c9SDave Chinner ldb = xfs_dir2_da_to_db(args->geo, blkno); 42130f712c9SDave Chinner ASSERT(ldb == xfs_dir2_byte_to_db(args->geo, XFS_DIR2_LEAF_OFFSET)); 42230f712c9SDave Chinner /* 42330f712c9SDave Chinner * Initialize the leaf block, get a buffer for it. 42430f712c9SDave Chinner */ 42530f712c9SDave Chinner error = xfs_dir3_leaf_get_buf(args, ldb, &lbp, XFS_DIR2_LEAF1_MAGIC); 42630f712c9SDave Chinner if (error) 42730f712c9SDave Chinner return error; 42830f712c9SDave Chinner 42930f712c9SDave Chinner leaf = lbp->b_addr; 43030f712c9SDave Chinner hdr = dbp->b_addr; 43130f712c9SDave Chinner xfs_dir3_data_check(dp, dbp); 43230f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 43330f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 43430f712c9SDave Chinner bf = dp->d_ops->data_bestfree_p(hdr); 43530f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 43630f712c9SDave Chinner 43730f712c9SDave Chinner /* 43830f712c9SDave Chinner * Set the counts in the leaf header. 43930f712c9SDave Chinner */ 44030f712c9SDave Chinner dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 44130f712c9SDave Chinner leafhdr.count = be32_to_cpu(btp->count); 44230f712c9SDave Chinner leafhdr.stale = be32_to_cpu(btp->stale); 44330f712c9SDave Chinner dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); 44430f712c9SDave Chinner xfs_dir3_leaf_log_header(args, lbp); 44530f712c9SDave Chinner 44630f712c9SDave Chinner /* 44730f712c9SDave Chinner * Could compact these but I think we always do the conversion 44830f712c9SDave Chinner * after squeezing out stale entries. 44930f712c9SDave Chinner */ 45030f712c9SDave Chinner memcpy(ents, blp, be32_to_cpu(btp->count) * sizeof(xfs_dir2_leaf_entry_t)); 45130f712c9SDave Chinner xfs_dir3_leaf_log_ents(args, lbp, 0, leafhdr.count - 1); 45230f712c9SDave Chinner needscan = 0; 45330f712c9SDave Chinner needlog = 1; 45430f712c9SDave Chinner /* 45530f712c9SDave Chinner * Make the space formerly occupied by the leaf entries and block 45630f712c9SDave Chinner * tail be free. 45730f712c9SDave Chinner */ 45830f712c9SDave Chinner xfs_dir2_data_make_free(args, dbp, 45930f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr), 46030f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)hdr + args->geo->blksize - 46130f712c9SDave Chinner (char *)blp), 46230f712c9SDave Chinner &needlog, &needscan); 46330f712c9SDave Chinner /* 46430f712c9SDave Chinner * Fix up the block header, make it a data block. 46530f712c9SDave Chinner */ 46630f712c9SDave Chinner dbp->b_ops = &xfs_dir3_data_buf_ops; 46730f712c9SDave Chinner xfs_trans_buf_set_type(tp, dbp, XFS_BLFT_DIR_DATA_BUF); 46830f712c9SDave Chinner if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC)) 46930f712c9SDave Chinner hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC); 47030f712c9SDave Chinner else 47130f712c9SDave Chinner hdr->magic = cpu_to_be32(XFS_DIR3_DATA_MAGIC); 47230f712c9SDave Chinner 47330f712c9SDave Chinner if (needscan) 47430f712c9SDave Chinner xfs_dir2_data_freescan(dp, hdr, &needlog); 47530f712c9SDave Chinner /* 47630f712c9SDave Chinner * Set up leaf tail and bests table. 47730f712c9SDave Chinner */ 47830f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 47930f712c9SDave Chinner ltp->bestcount = cpu_to_be32(1); 48030f712c9SDave Chinner bestsp = xfs_dir2_leaf_bests_p(ltp); 48130f712c9SDave Chinner bestsp[0] = bf[0].length; 48230f712c9SDave Chinner /* 48330f712c9SDave Chinner * Log the data header and leaf bests table. 48430f712c9SDave Chinner */ 48530f712c9SDave Chinner if (needlog) 48630f712c9SDave Chinner xfs_dir2_data_log_header(args, dbp); 48730f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 48830f712c9SDave Chinner xfs_dir3_data_check(dp, dbp); 48930f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, 0, 0); 49030f712c9SDave Chinner return 0; 49130f712c9SDave Chinner } 49230f712c9SDave Chinner 49330f712c9SDave Chinner STATIC void 49430f712c9SDave Chinner xfs_dir3_leaf_find_stale( 49530f712c9SDave Chinner struct xfs_dir3_icleaf_hdr *leafhdr, 49630f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents, 49730f712c9SDave Chinner int index, 49830f712c9SDave Chinner int *lowstale, 49930f712c9SDave Chinner int *highstale) 50030f712c9SDave Chinner { 50130f712c9SDave Chinner /* 50230f712c9SDave Chinner * Find the first stale entry before our index, if any. 50330f712c9SDave Chinner */ 50430f712c9SDave Chinner for (*lowstale = index - 1; *lowstale >= 0; --*lowstale) { 50530f712c9SDave Chinner if (ents[*lowstale].address == 50630f712c9SDave Chinner cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) 50730f712c9SDave Chinner break; 50830f712c9SDave Chinner } 50930f712c9SDave Chinner 51030f712c9SDave Chinner /* 51130f712c9SDave Chinner * Find the first stale entry at or after our index, if any. 51230f712c9SDave Chinner * Stop if the result would require moving more entries than using 51330f712c9SDave Chinner * lowstale. 51430f712c9SDave Chinner */ 51530f712c9SDave Chinner for (*highstale = index; *highstale < leafhdr->count; ++*highstale) { 51630f712c9SDave Chinner if (ents[*highstale].address == 51730f712c9SDave Chinner cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) 51830f712c9SDave Chinner break; 51930f712c9SDave Chinner if (*lowstale >= 0 && index - *lowstale <= *highstale - index) 52030f712c9SDave Chinner break; 52130f712c9SDave Chinner } 52230f712c9SDave Chinner } 52330f712c9SDave Chinner 52430f712c9SDave Chinner struct xfs_dir2_leaf_entry * 52530f712c9SDave Chinner xfs_dir3_leaf_find_entry( 52630f712c9SDave Chinner struct xfs_dir3_icleaf_hdr *leafhdr, 52730f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents, 52830f712c9SDave Chinner int index, /* leaf table position */ 52930f712c9SDave Chinner int compact, /* need to compact leaves */ 53030f712c9SDave Chinner int lowstale, /* index of prev stale leaf */ 53130f712c9SDave Chinner int highstale, /* index of next stale leaf */ 53230f712c9SDave Chinner int *lfloglow, /* low leaf logging index */ 53330f712c9SDave Chinner int *lfloghigh) /* high leaf logging index */ 53430f712c9SDave Chinner { 53530f712c9SDave Chinner if (!leafhdr->stale) { 53630f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry table pointer */ 53730f712c9SDave Chinner 53830f712c9SDave Chinner /* 53930f712c9SDave Chinner * Now we need to make room to insert the leaf entry. 54030f712c9SDave Chinner * 54130f712c9SDave Chinner * If there are no stale entries, just insert a hole at index. 54230f712c9SDave Chinner */ 54330f712c9SDave Chinner lep = &ents[index]; 54430f712c9SDave Chinner if (index < leafhdr->count) 54530f712c9SDave Chinner memmove(lep + 1, lep, 54630f712c9SDave Chinner (leafhdr->count - index) * sizeof(*lep)); 54730f712c9SDave Chinner 54830f712c9SDave Chinner /* 54930f712c9SDave Chinner * Record low and high logging indices for the leaf. 55030f712c9SDave Chinner */ 55130f712c9SDave Chinner *lfloglow = index; 55230f712c9SDave Chinner *lfloghigh = leafhdr->count++; 55330f712c9SDave Chinner return lep; 55430f712c9SDave Chinner } 55530f712c9SDave Chinner 55630f712c9SDave Chinner /* 55730f712c9SDave Chinner * There are stale entries. 55830f712c9SDave Chinner * 55930f712c9SDave Chinner * We will use one of them for the new entry. It's probably not at 56030f712c9SDave Chinner * the right location, so we'll have to shift some up or down first. 56130f712c9SDave Chinner * 56230f712c9SDave Chinner * If we didn't compact before, we need to find the nearest stale 56330f712c9SDave Chinner * entries before and after our insertion point. 56430f712c9SDave Chinner */ 56530f712c9SDave Chinner if (compact == 0) 56630f712c9SDave Chinner xfs_dir3_leaf_find_stale(leafhdr, ents, index, 56730f712c9SDave Chinner &lowstale, &highstale); 56830f712c9SDave Chinner 56930f712c9SDave Chinner /* 57030f712c9SDave Chinner * If the low one is better, use it. 57130f712c9SDave Chinner */ 57230f712c9SDave Chinner if (lowstale >= 0 && 57330f712c9SDave Chinner (highstale == leafhdr->count || 57430f712c9SDave Chinner index - lowstale - 1 < highstale - index)) { 57530f712c9SDave Chinner ASSERT(index - lowstale - 1 >= 0); 57630f712c9SDave Chinner ASSERT(ents[lowstale].address == 57730f712c9SDave Chinner cpu_to_be32(XFS_DIR2_NULL_DATAPTR)); 57830f712c9SDave Chinner 57930f712c9SDave Chinner /* 58030f712c9SDave Chinner * Copy entries up to cover the stale entry and make room 58130f712c9SDave Chinner * for the new entry. 58230f712c9SDave Chinner */ 58330f712c9SDave Chinner if (index - lowstale - 1 > 0) { 58430f712c9SDave Chinner memmove(&ents[lowstale], &ents[lowstale + 1], 58530f712c9SDave Chinner (index - lowstale - 1) * 58630f712c9SDave Chinner sizeof(xfs_dir2_leaf_entry_t)); 58730f712c9SDave Chinner } 58830f712c9SDave Chinner *lfloglow = MIN(lowstale, *lfloglow); 58930f712c9SDave Chinner *lfloghigh = MAX(index - 1, *lfloghigh); 59030f712c9SDave Chinner leafhdr->stale--; 59130f712c9SDave Chinner return &ents[index - 1]; 59230f712c9SDave Chinner } 59330f712c9SDave Chinner 59430f712c9SDave Chinner /* 59530f712c9SDave Chinner * The high one is better, so use that one. 59630f712c9SDave Chinner */ 59730f712c9SDave Chinner ASSERT(highstale - index >= 0); 59830f712c9SDave Chinner ASSERT(ents[highstale].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)); 59930f712c9SDave Chinner 60030f712c9SDave Chinner /* 60130f712c9SDave Chinner * Copy entries down to cover the stale entry and make room for the 60230f712c9SDave Chinner * new entry. 60330f712c9SDave Chinner */ 60430f712c9SDave Chinner if (highstale - index > 0) { 60530f712c9SDave Chinner memmove(&ents[index + 1], &ents[index], 60630f712c9SDave Chinner (highstale - index) * sizeof(xfs_dir2_leaf_entry_t)); 60730f712c9SDave Chinner } 60830f712c9SDave Chinner *lfloglow = MIN(index, *lfloglow); 60930f712c9SDave Chinner *lfloghigh = MAX(highstale, *lfloghigh); 61030f712c9SDave Chinner leafhdr->stale--; 61130f712c9SDave Chinner return &ents[index]; 61230f712c9SDave Chinner } 61330f712c9SDave Chinner 61430f712c9SDave Chinner /* 61530f712c9SDave Chinner * Add an entry to a leaf form directory. 61630f712c9SDave Chinner */ 61730f712c9SDave Chinner int /* error */ 61830f712c9SDave Chinner xfs_dir2_leaf_addname( 61930f712c9SDave Chinner xfs_da_args_t *args) /* operation arguments */ 62030f712c9SDave Chinner { 62130f712c9SDave Chinner __be16 *bestsp; /* freespace table in leaf */ 62230f712c9SDave Chinner int compact; /* need to compact leaves */ 62330f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* data block header */ 62430f712c9SDave Chinner struct xfs_buf *dbp; /* data block buffer */ 62530f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* data block entry */ 62630f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 62730f712c9SDave Chinner xfs_dir2_data_unused_t *dup; /* data unused entry */ 62830f712c9SDave Chinner int error; /* error return value */ 62930f712c9SDave Chinner int grown; /* allocated new data block */ 63030f712c9SDave Chinner int highstale; /* index of next stale leaf */ 63130f712c9SDave Chinner int i; /* temporary, index */ 63230f712c9SDave Chinner int index; /* leaf table position */ 63330f712c9SDave Chinner struct xfs_buf *lbp; /* leaf's buffer */ 63430f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 63530f712c9SDave Chinner int length; /* length of new entry */ 63630f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry table pointer */ 63730f712c9SDave Chinner int lfloglow; /* low leaf logging index */ 63830f712c9SDave Chinner int lfloghigh; /* high leaf logging index */ 63930f712c9SDave Chinner int lowstale; /* index of prev stale leaf */ 64030f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* leaf tail pointer */ 64130f712c9SDave Chinner int needbytes; /* leaf block bytes needed */ 64230f712c9SDave Chinner int needlog; /* need to log data header */ 64330f712c9SDave Chinner int needscan; /* need to rescan data free */ 64430f712c9SDave Chinner __be16 *tagp; /* end of data entry */ 64530f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 64630f712c9SDave Chinner xfs_dir2_db_t use_block; /* data block number */ 64730f712c9SDave Chinner struct xfs_dir2_data_free *bf; /* bestfree table */ 64830f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 64930f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 65030f712c9SDave Chinner 65130f712c9SDave Chinner trace_xfs_dir2_leaf_addname(args); 65230f712c9SDave Chinner 65330f712c9SDave Chinner dp = args->dp; 65430f712c9SDave Chinner tp = args->trans; 65530f712c9SDave Chinner 65630f712c9SDave Chinner error = xfs_dir3_leaf_read(tp, dp, args->geo->leafblk, -1, &lbp); 65730f712c9SDave Chinner if (error) 65830f712c9SDave Chinner return error; 65930f712c9SDave Chinner 66030f712c9SDave Chinner /* 66130f712c9SDave Chinner * Look up the entry by hash value and name. 66230f712c9SDave Chinner * We know it's not there, our caller has already done a lookup. 66330f712c9SDave Chinner * So the index is of the entry to insert in front of. 66430f712c9SDave Chinner * But if there are dup hash values the index is of the first of those. 66530f712c9SDave Chinner */ 66630f712c9SDave Chinner index = xfs_dir2_leaf_search_hash(args, lbp); 66730f712c9SDave Chinner leaf = lbp->b_addr; 66830f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 66930f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 67030f712c9SDave Chinner dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 67130f712c9SDave Chinner bestsp = xfs_dir2_leaf_bests_p(ltp); 67230f712c9SDave Chinner length = dp->d_ops->data_entsize(args->namelen); 67330f712c9SDave Chinner 67430f712c9SDave Chinner /* 67530f712c9SDave Chinner * See if there are any entries with the same hash value 67630f712c9SDave Chinner * and space in their block for the new entry. 67730f712c9SDave Chinner * This is good because it puts multiple same-hash value entries 67830f712c9SDave Chinner * in a data block, improving the lookup of those entries. 67930f712c9SDave Chinner */ 68030f712c9SDave Chinner for (use_block = -1, lep = &ents[index]; 68130f712c9SDave Chinner index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; 68230f712c9SDave Chinner index++, lep++) { 68330f712c9SDave Chinner if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR) 68430f712c9SDave Chinner continue; 68530f712c9SDave Chinner i = xfs_dir2_dataptr_to_db(args->geo, be32_to_cpu(lep->address)); 68630f712c9SDave Chinner ASSERT(i < be32_to_cpu(ltp->bestcount)); 68730f712c9SDave Chinner ASSERT(bestsp[i] != cpu_to_be16(NULLDATAOFF)); 68830f712c9SDave Chinner if (be16_to_cpu(bestsp[i]) >= length) { 68930f712c9SDave Chinner use_block = i; 69030f712c9SDave Chinner break; 69130f712c9SDave Chinner } 69230f712c9SDave Chinner } 69330f712c9SDave Chinner /* 69430f712c9SDave Chinner * Didn't find a block yet, linear search all the data blocks. 69530f712c9SDave Chinner */ 69630f712c9SDave Chinner if (use_block == -1) { 69730f712c9SDave Chinner for (i = 0; i < be32_to_cpu(ltp->bestcount); i++) { 69830f712c9SDave Chinner /* 69930f712c9SDave Chinner * Remember a block we see that's missing. 70030f712c9SDave Chinner */ 70130f712c9SDave Chinner if (bestsp[i] == cpu_to_be16(NULLDATAOFF) && 70230f712c9SDave Chinner use_block == -1) 70330f712c9SDave Chinner use_block = i; 70430f712c9SDave Chinner else if (be16_to_cpu(bestsp[i]) >= length) { 70530f712c9SDave Chinner use_block = i; 70630f712c9SDave Chinner break; 70730f712c9SDave Chinner } 70830f712c9SDave Chinner } 70930f712c9SDave Chinner } 71030f712c9SDave Chinner /* 71130f712c9SDave Chinner * How many bytes do we need in the leaf block? 71230f712c9SDave Chinner */ 71330f712c9SDave Chinner needbytes = 0; 71430f712c9SDave Chinner if (!leafhdr.stale) 71530f712c9SDave Chinner needbytes += sizeof(xfs_dir2_leaf_entry_t); 71630f712c9SDave Chinner if (use_block == -1) 71730f712c9SDave Chinner needbytes += sizeof(xfs_dir2_data_off_t); 71830f712c9SDave Chinner 71930f712c9SDave Chinner /* 72030f712c9SDave Chinner * Now kill use_block if it refers to a missing block, so we 72130f712c9SDave Chinner * can use it as an indication of allocation needed. 72230f712c9SDave Chinner */ 72330f712c9SDave Chinner if (use_block != -1 && bestsp[use_block] == cpu_to_be16(NULLDATAOFF)) 72430f712c9SDave Chinner use_block = -1; 72530f712c9SDave Chinner /* 72630f712c9SDave Chinner * If we don't have enough free bytes but we can make enough 72730f712c9SDave Chinner * by compacting out stale entries, we'll do that. 72830f712c9SDave Chinner */ 72930f712c9SDave Chinner if ((char *)bestsp - (char *)&ents[leafhdr.count] < needbytes && 73030f712c9SDave Chinner leafhdr.stale > 1) 73130f712c9SDave Chinner compact = 1; 73230f712c9SDave Chinner 73330f712c9SDave Chinner /* 73430f712c9SDave Chinner * Otherwise if we don't have enough free bytes we need to 73530f712c9SDave Chinner * convert to node form. 73630f712c9SDave Chinner */ 73730f712c9SDave Chinner else if ((char *)bestsp - (char *)&ents[leafhdr.count] < needbytes) { 73830f712c9SDave Chinner /* 73930f712c9SDave Chinner * Just checking or no space reservation, give up. 74030f712c9SDave Chinner */ 74130f712c9SDave Chinner if ((args->op_flags & XFS_DA_OP_JUSTCHECK) || 74230f712c9SDave Chinner args->total == 0) { 74330f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 7442451337dSDave Chinner return -ENOSPC; 74530f712c9SDave Chinner } 74630f712c9SDave Chinner /* 74730f712c9SDave Chinner * Convert to node form. 74830f712c9SDave Chinner */ 74930f712c9SDave Chinner error = xfs_dir2_leaf_to_node(args, lbp); 75030f712c9SDave Chinner if (error) 75130f712c9SDave Chinner return error; 75230f712c9SDave Chinner /* 75330f712c9SDave Chinner * Then add the new entry. 75430f712c9SDave Chinner */ 75530f712c9SDave Chinner return xfs_dir2_node_addname(args); 75630f712c9SDave Chinner } 75730f712c9SDave Chinner /* 75830f712c9SDave Chinner * Otherwise it will fit without compaction. 75930f712c9SDave Chinner */ 76030f712c9SDave Chinner else 76130f712c9SDave Chinner compact = 0; 76230f712c9SDave Chinner /* 76330f712c9SDave Chinner * If just checking, then it will fit unless we needed to allocate 76430f712c9SDave Chinner * a new data block. 76530f712c9SDave Chinner */ 76630f712c9SDave Chinner if (args->op_flags & XFS_DA_OP_JUSTCHECK) { 76730f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 7682451337dSDave Chinner return use_block == -1 ? -ENOSPC : 0; 76930f712c9SDave Chinner } 77030f712c9SDave Chinner /* 77130f712c9SDave Chinner * If no allocations are allowed, return now before we've 77230f712c9SDave Chinner * changed anything. 77330f712c9SDave Chinner */ 77430f712c9SDave Chinner if (args->total == 0 && use_block == -1) { 77530f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 7762451337dSDave Chinner return -ENOSPC; 77730f712c9SDave Chinner } 77830f712c9SDave Chinner /* 77930f712c9SDave Chinner * Need to compact the leaf entries, removing stale ones. 78030f712c9SDave Chinner * Leave one stale entry behind - the one closest to our 78130f712c9SDave Chinner * insertion index - and we'll shift that one to our insertion 78230f712c9SDave Chinner * point later. 78330f712c9SDave Chinner */ 78430f712c9SDave Chinner if (compact) { 78530f712c9SDave Chinner xfs_dir3_leaf_compact_x1(&leafhdr, ents, &index, &lowstale, 78630f712c9SDave Chinner &highstale, &lfloglow, &lfloghigh); 78730f712c9SDave Chinner } 78830f712c9SDave Chinner /* 78930f712c9SDave Chinner * There are stale entries, so we'll need log-low and log-high 79030f712c9SDave Chinner * impossibly bad values later. 79130f712c9SDave Chinner */ 79230f712c9SDave Chinner else if (leafhdr.stale) { 79330f712c9SDave Chinner lfloglow = leafhdr.count; 79430f712c9SDave Chinner lfloghigh = -1; 79530f712c9SDave Chinner } 79630f712c9SDave Chinner /* 79730f712c9SDave Chinner * If there was no data block space found, we need to allocate 79830f712c9SDave Chinner * a new one. 79930f712c9SDave Chinner */ 80030f712c9SDave Chinner if (use_block == -1) { 80130f712c9SDave Chinner /* 80230f712c9SDave Chinner * Add the new data block. 80330f712c9SDave Chinner */ 80430f712c9SDave Chinner if ((error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, 80530f712c9SDave Chinner &use_block))) { 80630f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 80730f712c9SDave Chinner return error; 80830f712c9SDave Chinner } 80930f712c9SDave Chinner /* 81030f712c9SDave Chinner * Initialize the block. 81130f712c9SDave Chinner */ 81230f712c9SDave Chinner if ((error = xfs_dir3_data_init(args, use_block, &dbp))) { 81330f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 81430f712c9SDave Chinner return error; 81530f712c9SDave Chinner } 81630f712c9SDave Chinner /* 81730f712c9SDave Chinner * If we're adding a new data block on the end we need to 81830f712c9SDave Chinner * extend the bests table. Copy it up one entry. 81930f712c9SDave Chinner */ 82030f712c9SDave Chinner if (use_block >= be32_to_cpu(ltp->bestcount)) { 82130f712c9SDave Chinner bestsp--; 82230f712c9SDave Chinner memmove(&bestsp[0], &bestsp[1], 82330f712c9SDave Chinner be32_to_cpu(ltp->bestcount) * sizeof(bestsp[0])); 82430f712c9SDave Chinner be32_add_cpu(<p->bestcount, 1); 82530f712c9SDave Chinner xfs_dir3_leaf_log_tail(args, lbp); 82630f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, 0, 82730f712c9SDave Chinner be32_to_cpu(ltp->bestcount) - 1); 82830f712c9SDave Chinner } 82930f712c9SDave Chinner /* 83030f712c9SDave Chinner * If we're filling in a previously empty block just log it. 83130f712c9SDave Chinner */ 83230f712c9SDave Chinner else 83330f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, use_block, use_block); 83430f712c9SDave Chinner hdr = dbp->b_addr; 83530f712c9SDave Chinner bf = dp->d_ops->data_bestfree_p(hdr); 83630f712c9SDave Chinner bestsp[use_block] = bf[0].length; 83730f712c9SDave Chinner grown = 1; 83830f712c9SDave Chinner } else { 83930f712c9SDave Chinner /* 84030f712c9SDave Chinner * Already had space in some data block. 84130f712c9SDave Chinner * Just read that one in. 84230f712c9SDave Chinner */ 84330f712c9SDave Chinner error = xfs_dir3_data_read(tp, dp, 84430f712c9SDave Chinner xfs_dir2_db_to_da(args->geo, use_block), 84530f712c9SDave Chinner -1, &dbp); 84630f712c9SDave Chinner if (error) { 84730f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 84830f712c9SDave Chinner return error; 84930f712c9SDave Chinner } 85030f712c9SDave Chinner hdr = dbp->b_addr; 85130f712c9SDave Chinner bf = dp->d_ops->data_bestfree_p(hdr); 85230f712c9SDave Chinner grown = 0; 85330f712c9SDave Chinner } 85430f712c9SDave Chinner /* 85530f712c9SDave Chinner * Point to the biggest freespace in our data block. 85630f712c9SDave Chinner */ 85730f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *) 85830f712c9SDave Chinner ((char *)hdr + be16_to_cpu(bf[0].offset)); 85930f712c9SDave Chinner ASSERT(be16_to_cpu(dup->length) >= length); 86030f712c9SDave Chinner needscan = needlog = 0; 86130f712c9SDave Chinner /* 86230f712c9SDave Chinner * Mark the initial part of our freespace in use for the new entry. 86330f712c9SDave Chinner */ 86430f712c9SDave Chinner xfs_dir2_data_use_free(args, dbp, dup, 86530f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), length, 86630f712c9SDave Chinner &needlog, &needscan); 86730f712c9SDave Chinner /* 86830f712c9SDave Chinner * Initialize our new entry (at last). 86930f712c9SDave Chinner */ 87030f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)dup; 87130f712c9SDave Chinner dep->inumber = cpu_to_be64(args->inumber); 87230f712c9SDave Chinner dep->namelen = args->namelen; 87330f712c9SDave Chinner memcpy(dep->name, args->name, dep->namelen); 87430f712c9SDave Chinner dp->d_ops->data_put_ftype(dep, args->filetype); 87530f712c9SDave Chinner tagp = dp->d_ops->data_entry_tag_p(dep); 87630f712c9SDave Chinner *tagp = cpu_to_be16((char *)dep - (char *)hdr); 87730f712c9SDave Chinner /* 87830f712c9SDave Chinner * Need to scan fix up the bestfree table. 87930f712c9SDave Chinner */ 88030f712c9SDave Chinner if (needscan) 88130f712c9SDave Chinner xfs_dir2_data_freescan(dp, hdr, &needlog); 88230f712c9SDave Chinner /* 88330f712c9SDave Chinner * Need to log the data block's header. 88430f712c9SDave Chinner */ 88530f712c9SDave Chinner if (needlog) 88630f712c9SDave Chinner xfs_dir2_data_log_header(args, dbp); 88730f712c9SDave Chinner xfs_dir2_data_log_entry(args, dbp, dep); 88830f712c9SDave Chinner /* 88930f712c9SDave Chinner * If the bests table needs to be changed, do it. 89030f712c9SDave Chinner * Log the change unless we've already done that. 89130f712c9SDave Chinner */ 89230f712c9SDave Chinner if (be16_to_cpu(bestsp[use_block]) != be16_to_cpu(bf[0].length)) { 89330f712c9SDave Chinner bestsp[use_block] = bf[0].length; 89430f712c9SDave Chinner if (!grown) 89530f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, use_block, use_block); 89630f712c9SDave Chinner } 89730f712c9SDave Chinner 89830f712c9SDave Chinner lep = xfs_dir3_leaf_find_entry(&leafhdr, ents, index, compact, lowstale, 89930f712c9SDave Chinner highstale, &lfloglow, &lfloghigh); 90030f712c9SDave Chinner 90130f712c9SDave Chinner /* 90230f712c9SDave Chinner * Fill in the new leaf entry. 90330f712c9SDave Chinner */ 90430f712c9SDave Chinner lep->hashval = cpu_to_be32(args->hashval); 90530f712c9SDave Chinner lep->address = cpu_to_be32( 90630f712c9SDave Chinner xfs_dir2_db_off_to_dataptr(args->geo, use_block, 90730f712c9SDave Chinner be16_to_cpu(*tagp))); 90830f712c9SDave Chinner /* 90930f712c9SDave Chinner * Log the leaf fields and give up the buffers. 91030f712c9SDave Chinner */ 91130f712c9SDave Chinner dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); 91230f712c9SDave Chinner xfs_dir3_leaf_log_header(args, lbp); 91330f712c9SDave Chinner xfs_dir3_leaf_log_ents(args, lbp, lfloglow, lfloghigh); 91430f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 91530f712c9SDave Chinner xfs_dir3_data_check(dp, dbp); 91630f712c9SDave Chinner return 0; 91730f712c9SDave Chinner } 91830f712c9SDave Chinner 91930f712c9SDave Chinner /* 92030f712c9SDave Chinner * Compact out any stale entries in the leaf. 92130f712c9SDave Chinner * Log the header and changed leaf entries, if any. 92230f712c9SDave Chinner */ 92330f712c9SDave Chinner void 92430f712c9SDave Chinner xfs_dir3_leaf_compact( 92530f712c9SDave Chinner xfs_da_args_t *args, /* operation arguments */ 92630f712c9SDave Chinner struct xfs_dir3_icleaf_hdr *leafhdr, 92730f712c9SDave Chinner struct xfs_buf *bp) /* leaf buffer */ 92830f712c9SDave Chinner { 92930f712c9SDave Chinner int from; /* source leaf index */ 93030f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 93130f712c9SDave Chinner int loglow; /* first leaf entry to log */ 93230f712c9SDave Chinner int to; /* target leaf index */ 93330f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 93430f712c9SDave Chinner struct xfs_inode *dp = args->dp; 93530f712c9SDave Chinner 93630f712c9SDave Chinner leaf = bp->b_addr; 93730f712c9SDave Chinner if (!leafhdr->stale) 93830f712c9SDave Chinner return; 93930f712c9SDave Chinner 94030f712c9SDave Chinner /* 94130f712c9SDave Chinner * Compress out the stale entries in place. 94230f712c9SDave Chinner */ 94330f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 94430f712c9SDave Chinner for (from = to = 0, loglow = -1; from < leafhdr->count; from++) { 94530f712c9SDave Chinner if (ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) 94630f712c9SDave Chinner continue; 94730f712c9SDave Chinner /* 94830f712c9SDave Chinner * Only actually copy the entries that are different. 94930f712c9SDave Chinner */ 95030f712c9SDave Chinner if (from > to) { 95130f712c9SDave Chinner if (loglow == -1) 95230f712c9SDave Chinner loglow = to; 95330f712c9SDave Chinner ents[to] = ents[from]; 95430f712c9SDave Chinner } 95530f712c9SDave Chinner to++; 95630f712c9SDave Chinner } 95730f712c9SDave Chinner /* 95830f712c9SDave Chinner * Update and log the header, log the leaf entries. 95930f712c9SDave Chinner */ 96030f712c9SDave Chinner ASSERT(leafhdr->stale == from - to); 96130f712c9SDave Chinner leafhdr->count -= leafhdr->stale; 96230f712c9SDave Chinner leafhdr->stale = 0; 96330f712c9SDave Chinner 96430f712c9SDave Chinner dp->d_ops->leaf_hdr_to_disk(leaf, leafhdr); 96530f712c9SDave Chinner xfs_dir3_leaf_log_header(args, bp); 96630f712c9SDave Chinner if (loglow != -1) 96730f712c9SDave Chinner xfs_dir3_leaf_log_ents(args, bp, loglow, to - 1); 96830f712c9SDave Chinner } 96930f712c9SDave Chinner 97030f712c9SDave Chinner /* 97130f712c9SDave Chinner * Compact the leaf entries, removing stale ones. 97230f712c9SDave Chinner * Leave one stale entry behind - the one closest to our 97330f712c9SDave Chinner * insertion index - and the caller will shift that one to our insertion 97430f712c9SDave Chinner * point later. 97530f712c9SDave Chinner * Return new insertion index, where the remaining stale entry is, 97630f712c9SDave Chinner * and leaf logging indices. 97730f712c9SDave Chinner */ 97830f712c9SDave Chinner void 97930f712c9SDave Chinner xfs_dir3_leaf_compact_x1( 98030f712c9SDave Chinner struct xfs_dir3_icleaf_hdr *leafhdr, 98130f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents, 98230f712c9SDave Chinner int *indexp, /* insertion index */ 98330f712c9SDave Chinner int *lowstalep, /* out: stale entry before us */ 98430f712c9SDave Chinner int *highstalep, /* out: stale entry after us */ 98530f712c9SDave Chinner int *lowlogp, /* out: low log index */ 98630f712c9SDave Chinner int *highlogp) /* out: high log index */ 98730f712c9SDave Chinner { 98830f712c9SDave Chinner int from; /* source copy index */ 98930f712c9SDave Chinner int highstale; /* stale entry at/after index */ 99030f712c9SDave Chinner int index; /* insertion index */ 99130f712c9SDave Chinner int keepstale; /* source index of kept stale */ 99230f712c9SDave Chinner int lowstale; /* stale entry before index */ 99330f712c9SDave Chinner int newindex=0; /* new insertion index */ 99430f712c9SDave Chinner int to; /* destination copy index */ 99530f712c9SDave Chinner 99630f712c9SDave Chinner ASSERT(leafhdr->stale > 1); 99730f712c9SDave Chinner index = *indexp; 99830f712c9SDave Chinner 99930f712c9SDave Chinner xfs_dir3_leaf_find_stale(leafhdr, ents, index, &lowstale, &highstale); 100030f712c9SDave Chinner 100130f712c9SDave Chinner /* 100230f712c9SDave Chinner * Pick the better of lowstale and highstale. 100330f712c9SDave Chinner */ 100430f712c9SDave Chinner if (lowstale >= 0 && 100530f712c9SDave Chinner (highstale == leafhdr->count || 100630f712c9SDave Chinner index - lowstale <= highstale - index)) 100730f712c9SDave Chinner keepstale = lowstale; 100830f712c9SDave Chinner else 100930f712c9SDave Chinner keepstale = highstale; 101030f712c9SDave Chinner /* 101130f712c9SDave Chinner * Copy the entries in place, removing all the stale entries 101230f712c9SDave Chinner * except keepstale. 101330f712c9SDave Chinner */ 101430f712c9SDave Chinner for (from = to = 0; from < leafhdr->count; from++) { 101530f712c9SDave Chinner /* 101630f712c9SDave Chinner * Notice the new value of index. 101730f712c9SDave Chinner */ 101830f712c9SDave Chinner if (index == from) 101930f712c9SDave Chinner newindex = to; 102030f712c9SDave Chinner if (from != keepstale && 102130f712c9SDave Chinner ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) { 102230f712c9SDave Chinner if (from == to) 102330f712c9SDave Chinner *lowlogp = to; 102430f712c9SDave Chinner continue; 102530f712c9SDave Chinner } 102630f712c9SDave Chinner /* 102730f712c9SDave Chinner * Record the new keepstale value for the insertion. 102830f712c9SDave Chinner */ 102930f712c9SDave Chinner if (from == keepstale) 103030f712c9SDave Chinner lowstale = highstale = to; 103130f712c9SDave Chinner /* 103230f712c9SDave Chinner * Copy only the entries that have moved. 103330f712c9SDave Chinner */ 103430f712c9SDave Chinner if (from > to) 103530f712c9SDave Chinner ents[to] = ents[from]; 103630f712c9SDave Chinner to++; 103730f712c9SDave Chinner } 103830f712c9SDave Chinner ASSERT(from > to); 103930f712c9SDave Chinner /* 104030f712c9SDave Chinner * If the insertion point was past the last entry, 104130f712c9SDave Chinner * set the new insertion point accordingly. 104230f712c9SDave Chinner */ 104330f712c9SDave Chinner if (index == from) 104430f712c9SDave Chinner newindex = to; 104530f712c9SDave Chinner *indexp = newindex; 104630f712c9SDave Chinner /* 104730f712c9SDave Chinner * Adjust the leaf header values. 104830f712c9SDave Chinner */ 104930f712c9SDave Chinner leafhdr->count -= from - to; 105030f712c9SDave Chinner leafhdr->stale = 1; 105130f712c9SDave Chinner /* 105230f712c9SDave Chinner * Remember the low/high stale value only in the "right" 105330f712c9SDave Chinner * direction. 105430f712c9SDave Chinner */ 105530f712c9SDave Chinner if (lowstale >= newindex) 105630f712c9SDave Chinner lowstale = -1; 105730f712c9SDave Chinner else 105830f712c9SDave Chinner highstale = leafhdr->count; 105930f712c9SDave Chinner *highlogp = leafhdr->count - 1; 106030f712c9SDave Chinner *lowstalep = lowstale; 106130f712c9SDave Chinner *highstalep = highstale; 106230f712c9SDave Chinner } 106330f712c9SDave Chinner 106430f712c9SDave Chinner /* 106530f712c9SDave Chinner * Log the bests entries indicated from a leaf1 block. 106630f712c9SDave Chinner */ 106730f712c9SDave Chinner static void 106830f712c9SDave Chinner xfs_dir3_leaf_log_bests( 106930f712c9SDave Chinner struct xfs_da_args *args, 107030f712c9SDave Chinner struct xfs_buf *bp, /* leaf buffer */ 107130f712c9SDave Chinner int first, /* first entry to log */ 107230f712c9SDave Chinner int last) /* last entry to log */ 107330f712c9SDave Chinner { 107430f712c9SDave Chinner __be16 *firstb; /* pointer to first entry */ 107530f712c9SDave Chinner __be16 *lastb; /* pointer to last entry */ 107630f712c9SDave Chinner struct xfs_dir2_leaf *leaf = bp->b_addr; 107730f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ 107830f712c9SDave Chinner 107930f712c9SDave Chinner ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || 108030f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC)); 108130f712c9SDave Chinner 108230f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 108330f712c9SDave Chinner firstb = xfs_dir2_leaf_bests_p(ltp) + first; 108430f712c9SDave Chinner lastb = xfs_dir2_leaf_bests_p(ltp) + last; 108530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 108630f712c9SDave Chinner (uint)((char *)firstb - (char *)leaf), 108730f712c9SDave Chinner (uint)((char *)lastb - (char *)leaf + sizeof(*lastb) - 1)); 108830f712c9SDave Chinner } 108930f712c9SDave Chinner 109030f712c9SDave Chinner /* 109130f712c9SDave Chinner * Log the leaf entries indicated from a leaf1 or leafn block. 109230f712c9SDave Chinner */ 109330f712c9SDave Chinner void 109430f712c9SDave Chinner xfs_dir3_leaf_log_ents( 109530f712c9SDave Chinner struct xfs_da_args *args, 109630f712c9SDave Chinner struct xfs_buf *bp, 109730f712c9SDave Chinner int first, 109830f712c9SDave Chinner int last) 109930f712c9SDave Chinner { 110030f712c9SDave Chinner xfs_dir2_leaf_entry_t *firstlep; /* pointer to first entry */ 110130f712c9SDave Chinner xfs_dir2_leaf_entry_t *lastlep; /* pointer to last entry */ 110230f712c9SDave Chinner struct xfs_dir2_leaf *leaf = bp->b_addr; 110330f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 110430f712c9SDave Chinner 110530f712c9SDave Chinner ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || 110630f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) || 110730f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || 110830f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)); 110930f712c9SDave Chinner 111030f712c9SDave Chinner ents = args->dp->d_ops->leaf_ents_p(leaf); 111130f712c9SDave Chinner firstlep = &ents[first]; 111230f712c9SDave Chinner lastlep = &ents[last]; 111330f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 111430f712c9SDave Chinner (uint)((char *)firstlep - (char *)leaf), 111530f712c9SDave Chinner (uint)((char *)lastlep - (char *)leaf + sizeof(*lastlep) - 1)); 111630f712c9SDave Chinner } 111730f712c9SDave Chinner 111830f712c9SDave Chinner /* 111930f712c9SDave Chinner * Log the header of the leaf1 or leafn block. 112030f712c9SDave Chinner */ 112130f712c9SDave Chinner void 112230f712c9SDave Chinner xfs_dir3_leaf_log_header( 112330f712c9SDave Chinner struct xfs_da_args *args, 112430f712c9SDave Chinner struct xfs_buf *bp) 112530f712c9SDave Chinner { 112630f712c9SDave Chinner struct xfs_dir2_leaf *leaf = bp->b_addr; 112730f712c9SDave Chinner 112830f712c9SDave Chinner ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || 112930f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) || 113030f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || 113130f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)); 113230f712c9SDave Chinner 113330f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, 113430f712c9SDave Chinner (uint)((char *)&leaf->hdr - (char *)leaf), 113530f712c9SDave Chinner args->dp->d_ops->leaf_hdr_size - 1); 113630f712c9SDave Chinner } 113730f712c9SDave Chinner 113830f712c9SDave Chinner /* 113930f712c9SDave Chinner * Log the tail of the leaf1 block. 114030f712c9SDave Chinner */ 114130f712c9SDave Chinner STATIC void 114230f712c9SDave Chinner xfs_dir3_leaf_log_tail( 114330f712c9SDave Chinner struct xfs_da_args *args, 114430f712c9SDave Chinner struct xfs_buf *bp) 114530f712c9SDave Chinner { 114630f712c9SDave Chinner struct xfs_dir2_leaf *leaf = bp->b_addr; 114730f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ 114830f712c9SDave Chinner 114930f712c9SDave Chinner ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) || 115030f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) || 115130f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || 115230f712c9SDave Chinner leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)); 115330f712c9SDave Chinner 115430f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 115530f712c9SDave Chinner xfs_trans_log_buf(args->trans, bp, (uint)((char *)ltp - (char *)leaf), 115630f712c9SDave Chinner (uint)(args->geo->blksize - 1)); 115730f712c9SDave Chinner } 115830f712c9SDave Chinner 115930f712c9SDave Chinner /* 116030f712c9SDave Chinner * Look up the entry referred to by args in the leaf format directory. 116130f712c9SDave Chinner * Most of the work is done by the xfs_dir2_leaf_lookup_int routine which 116230f712c9SDave Chinner * is also used by the node-format code. 116330f712c9SDave Chinner */ 116430f712c9SDave Chinner int 116530f712c9SDave Chinner xfs_dir2_leaf_lookup( 116630f712c9SDave Chinner xfs_da_args_t *args) /* operation arguments */ 116730f712c9SDave Chinner { 116830f712c9SDave Chinner struct xfs_buf *dbp; /* data block buffer */ 116930f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* data block entry */ 117030f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 117130f712c9SDave Chinner int error; /* error return code */ 117230f712c9SDave Chinner int index; /* found entry index */ 117330f712c9SDave Chinner struct xfs_buf *lbp; /* leaf buffer */ 117430f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 117530f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry */ 117630f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 117730f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 117830f712c9SDave Chinner 117930f712c9SDave Chinner trace_xfs_dir2_leaf_lookup(args); 118030f712c9SDave Chinner 118130f712c9SDave Chinner /* 118230f712c9SDave Chinner * Look up name in the leaf block, returning both buffers and index. 118330f712c9SDave Chinner */ 118430f712c9SDave Chinner if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) { 118530f712c9SDave Chinner return error; 118630f712c9SDave Chinner } 118730f712c9SDave Chinner tp = args->trans; 118830f712c9SDave Chinner dp = args->dp; 118930f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 119030f712c9SDave Chinner leaf = lbp->b_addr; 119130f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 119230f712c9SDave Chinner /* 119330f712c9SDave Chinner * Get to the leaf entry and contained data entry address. 119430f712c9SDave Chinner */ 119530f712c9SDave Chinner lep = &ents[index]; 119630f712c9SDave Chinner 119730f712c9SDave Chinner /* 119830f712c9SDave Chinner * Point to the data entry. 119930f712c9SDave Chinner */ 120030f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *) 120130f712c9SDave Chinner ((char *)dbp->b_addr + 120230f712c9SDave Chinner xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address))); 120330f712c9SDave Chinner /* 120430f712c9SDave Chinner * Return the found inode number & CI name if appropriate 120530f712c9SDave Chinner */ 120630f712c9SDave Chinner args->inumber = be64_to_cpu(dep->inumber); 120730f712c9SDave Chinner args->filetype = dp->d_ops->data_get_ftype(dep); 120830f712c9SDave Chinner error = xfs_dir_cilookup_result(args, dep->name, dep->namelen); 120930f712c9SDave Chinner xfs_trans_brelse(tp, dbp); 121030f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 121130f712c9SDave Chinner return error; 121230f712c9SDave Chinner } 121330f712c9SDave Chinner 121430f712c9SDave Chinner /* 121530f712c9SDave Chinner * Look up name/hash in the leaf block. 121630f712c9SDave Chinner * Fill in indexp with the found index, and dbpp with the data buffer. 121730f712c9SDave Chinner * If not found dbpp will be NULL, and ENOENT comes back. 121830f712c9SDave Chinner * lbpp will always be filled in with the leaf buffer unless there's an error. 121930f712c9SDave Chinner */ 122030f712c9SDave Chinner static int /* error */ 122130f712c9SDave Chinner xfs_dir2_leaf_lookup_int( 122230f712c9SDave Chinner xfs_da_args_t *args, /* operation arguments */ 122330f712c9SDave Chinner struct xfs_buf **lbpp, /* out: leaf buffer */ 122430f712c9SDave Chinner int *indexp, /* out: index in leaf block */ 122530f712c9SDave Chinner struct xfs_buf **dbpp) /* out: data buffer */ 122630f712c9SDave Chinner { 122730f712c9SDave Chinner xfs_dir2_db_t curdb = -1; /* current data block number */ 122830f712c9SDave Chinner struct xfs_buf *dbp = NULL; /* data buffer */ 122930f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* data entry */ 123030f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 123130f712c9SDave Chinner int error; /* error return code */ 123230f712c9SDave Chinner int index; /* index in leaf block */ 123330f712c9SDave Chinner struct xfs_buf *lbp; /* leaf buffer */ 123430f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry */ 123530f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 123630f712c9SDave Chinner xfs_mount_t *mp; /* filesystem mount point */ 123730f712c9SDave Chinner xfs_dir2_db_t newdb; /* new data block number */ 123830f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 123930f712c9SDave Chinner xfs_dir2_db_t cidb = -1; /* case match data block no. */ 124030f712c9SDave Chinner enum xfs_dacmp cmp; /* name compare result */ 124130f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 124230f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 124330f712c9SDave Chinner 124430f712c9SDave Chinner dp = args->dp; 124530f712c9SDave Chinner tp = args->trans; 124630f712c9SDave Chinner mp = dp->i_mount; 124730f712c9SDave Chinner 124830f712c9SDave Chinner error = xfs_dir3_leaf_read(tp, dp, args->geo->leafblk, -1, &lbp); 124930f712c9SDave Chinner if (error) 125030f712c9SDave Chinner return error; 125130f712c9SDave Chinner 125230f712c9SDave Chinner *lbpp = lbp; 125330f712c9SDave Chinner leaf = lbp->b_addr; 125430f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 125530f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 125630f712c9SDave Chinner dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 125730f712c9SDave Chinner 125830f712c9SDave Chinner /* 125930f712c9SDave Chinner * Look for the first leaf entry with our hash value. 126030f712c9SDave Chinner */ 126130f712c9SDave Chinner index = xfs_dir2_leaf_search_hash(args, lbp); 126230f712c9SDave Chinner /* 126330f712c9SDave Chinner * Loop over all the entries with the right hash value 126430f712c9SDave Chinner * looking to match the name. 126530f712c9SDave Chinner */ 126630f712c9SDave Chinner for (lep = &ents[index]; 126730f712c9SDave Chinner index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; 126830f712c9SDave Chinner lep++, index++) { 126930f712c9SDave Chinner /* 127030f712c9SDave Chinner * Skip over stale leaf entries. 127130f712c9SDave Chinner */ 127230f712c9SDave Chinner if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR) 127330f712c9SDave Chinner continue; 127430f712c9SDave Chinner /* 127530f712c9SDave Chinner * Get the new data block number. 127630f712c9SDave Chinner */ 127730f712c9SDave Chinner newdb = xfs_dir2_dataptr_to_db(args->geo, 127830f712c9SDave Chinner be32_to_cpu(lep->address)); 127930f712c9SDave Chinner /* 128030f712c9SDave Chinner * If it's not the same as the old data block number, 128130f712c9SDave Chinner * need to pitch the old one and read the new one. 128230f712c9SDave Chinner */ 128330f712c9SDave Chinner if (newdb != curdb) { 128430f712c9SDave Chinner if (dbp) 128530f712c9SDave Chinner xfs_trans_brelse(tp, dbp); 128630f712c9SDave Chinner error = xfs_dir3_data_read(tp, dp, 128730f712c9SDave Chinner xfs_dir2_db_to_da(args->geo, newdb), 128830f712c9SDave Chinner -1, &dbp); 128930f712c9SDave Chinner if (error) { 129030f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 129130f712c9SDave Chinner return error; 129230f712c9SDave Chinner } 129330f712c9SDave Chinner curdb = newdb; 129430f712c9SDave Chinner } 129530f712c9SDave Chinner /* 129630f712c9SDave Chinner * Point to the data entry. 129730f712c9SDave Chinner */ 129830f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)((char *)dbp->b_addr + 129930f712c9SDave Chinner xfs_dir2_dataptr_to_off(args->geo, 130030f712c9SDave Chinner be32_to_cpu(lep->address))); 130130f712c9SDave Chinner /* 130230f712c9SDave Chinner * Compare name and if it's an exact match, return the index 130330f712c9SDave Chinner * and buffer. If it's the first case-insensitive match, store 130430f712c9SDave Chinner * the index and buffer and continue looking for an exact match. 130530f712c9SDave Chinner */ 130630f712c9SDave Chinner cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen); 130730f712c9SDave Chinner if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) { 130830f712c9SDave Chinner args->cmpresult = cmp; 130930f712c9SDave Chinner *indexp = index; 131030f712c9SDave Chinner /* case exact match: return the current buffer. */ 131130f712c9SDave Chinner if (cmp == XFS_CMP_EXACT) { 131230f712c9SDave Chinner *dbpp = dbp; 131330f712c9SDave Chinner return 0; 131430f712c9SDave Chinner } 131530f712c9SDave Chinner cidb = curdb; 131630f712c9SDave Chinner } 131730f712c9SDave Chinner } 131830f712c9SDave Chinner ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); 131930f712c9SDave Chinner /* 132030f712c9SDave Chinner * Here, we can only be doing a lookup (not a rename or remove). 132130f712c9SDave Chinner * If a case-insensitive match was found earlier, re-read the 132230f712c9SDave Chinner * appropriate data block if required and return it. 132330f712c9SDave Chinner */ 132430f712c9SDave Chinner if (args->cmpresult == XFS_CMP_CASE) { 132530f712c9SDave Chinner ASSERT(cidb != -1); 132630f712c9SDave Chinner if (cidb != curdb) { 132730f712c9SDave Chinner xfs_trans_brelse(tp, dbp); 132830f712c9SDave Chinner error = xfs_dir3_data_read(tp, dp, 132930f712c9SDave Chinner xfs_dir2_db_to_da(args->geo, cidb), 133030f712c9SDave Chinner -1, &dbp); 133130f712c9SDave Chinner if (error) { 133230f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 133330f712c9SDave Chinner return error; 133430f712c9SDave Chinner } 133530f712c9SDave Chinner } 133630f712c9SDave Chinner *dbpp = dbp; 133730f712c9SDave Chinner return 0; 133830f712c9SDave Chinner } 133930f712c9SDave Chinner /* 13402451337dSDave Chinner * No match found, return -ENOENT. 134130f712c9SDave Chinner */ 134230f712c9SDave Chinner ASSERT(cidb == -1); 134330f712c9SDave Chinner if (dbp) 134430f712c9SDave Chinner xfs_trans_brelse(tp, dbp); 134530f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 13462451337dSDave Chinner return -ENOENT; 134730f712c9SDave Chinner } 134830f712c9SDave Chinner 134930f712c9SDave Chinner /* 135030f712c9SDave Chinner * Remove an entry from a leaf format directory. 135130f712c9SDave Chinner */ 135230f712c9SDave Chinner int /* error */ 135330f712c9SDave Chinner xfs_dir2_leaf_removename( 135430f712c9SDave Chinner xfs_da_args_t *args) /* operation arguments */ 135530f712c9SDave Chinner { 135630f712c9SDave Chinner __be16 *bestsp; /* leaf block best freespace */ 135730f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* data block header */ 135830f712c9SDave Chinner xfs_dir2_db_t db; /* data block number */ 135930f712c9SDave Chinner struct xfs_buf *dbp; /* data block buffer */ 136030f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* data entry structure */ 136130f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 136230f712c9SDave Chinner int error; /* error return code */ 136330f712c9SDave Chinner xfs_dir2_db_t i; /* temporary data block # */ 136430f712c9SDave Chinner int index; /* index into leaf entries */ 136530f712c9SDave Chinner struct xfs_buf *lbp; /* leaf buffer */ 136630f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 136730f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry */ 136830f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ 136930f712c9SDave Chinner int needlog; /* need to log data header */ 137030f712c9SDave Chinner int needscan; /* need to rescan data frees */ 137130f712c9SDave Chinner xfs_dir2_data_off_t oldbest; /* old value of best free */ 137230f712c9SDave Chinner struct xfs_dir2_data_free *bf; /* bestfree table */ 137330f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 137430f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 137530f712c9SDave Chinner 137630f712c9SDave Chinner trace_xfs_dir2_leaf_removename(args); 137730f712c9SDave Chinner 137830f712c9SDave Chinner /* 137930f712c9SDave Chinner * Lookup the leaf entry, get the leaf and data blocks read in. 138030f712c9SDave Chinner */ 138130f712c9SDave Chinner if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) { 138230f712c9SDave Chinner return error; 138330f712c9SDave Chinner } 138430f712c9SDave Chinner dp = args->dp; 138530f712c9SDave Chinner leaf = lbp->b_addr; 138630f712c9SDave Chinner hdr = dbp->b_addr; 138730f712c9SDave Chinner xfs_dir3_data_check(dp, dbp); 138830f712c9SDave Chinner bf = dp->d_ops->data_bestfree_p(hdr); 138930f712c9SDave Chinner dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 139030f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 139130f712c9SDave Chinner /* 139230f712c9SDave Chinner * Point to the leaf entry, use that to point to the data entry. 139330f712c9SDave Chinner */ 139430f712c9SDave Chinner lep = &ents[index]; 139530f712c9SDave Chinner db = xfs_dir2_dataptr_to_db(args->geo, be32_to_cpu(lep->address)); 139630f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)((char *)hdr + 139730f712c9SDave Chinner xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address))); 139830f712c9SDave Chinner needscan = needlog = 0; 139930f712c9SDave Chinner oldbest = be16_to_cpu(bf[0].length); 140030f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 140130f712c9SDave Chinner bestsp = xfs_dir2_leaf_bests_p(ltp); 140230f712c9SDave Chinner ASSERT(be16_to_cpu(bestsp[db]) == oldbest); 140330f712c9SDave Chinner /* 140430f712c9SDave Chinner * Mark the former data entry unused. 140530f712c9SDave Chinner */ 140630f712c9SDave Chinner xfs_dir2_data_make_free(args, dbp, 140730f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr), 140830f712c9SDave Chinner dp->d_ops->data_entsize(dep->namelen), &needlog, &needscan); 140930f712c9SDave Chinner /* 141030f712c9SDave Chinner * We just mark the leaf entry stale by putting a null in it. 141130f712c9SDave Chinner */ 141230f712c9SDave Chinner leafhdr.stale++; 141330f712c9SDave Chinner dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); 141430f712c9SDave Chinner xfs_dir3_leaf_log_header(args, lbp); 141530f712c9SDave Chinner 141630f712c9SDave Chinner lep->address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); 141730f712c9SDave Chinner xfs_dir3_leaf_log_ents(args, lbp, index, index); 141830f712c9SDave Chinner 141930f712c9SDave Chinner /* 142030f712c9SDave Chinner * Scan the freespace in the data block again if necessary, 142130f712c9SDave Chinner * log the data block header if necessary. 142230f712c9SDave Chinner */ 142330f712c9SDave Chinner if (needscan) 142430f712c9SDave Chinner xfs_dir2_data_freescan(dp, hdr, &needlog); 142530f712c9SDave Chinner if (needlog) 142630f712c9SDave Chinner xfs_dir2_data_log_header(args, dbp); 142730f712c9SDave Chinner /* 142830f712c9SDave Chinner * If the longest freespace in the data block has changed, 142930f712c9SDave Chinner * put the new value in the bests table and log that. 143030f712c9SDave Chinner */ 143130f712c9SDave Chinner if (be16_to_cpu(bf[0].length) != oldbest) { 143230f712c9SDave Chinner bestsp[db] = bf[0].length; 143330f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, db, db); 143430f712c9SDave Chinner } 143530f712c9SDave Chinner xfs_dir3_data_check(dp, dbp); 143630f712c9SDave Chinner /* 143730f712c9SDave Chinner * If the data block is now empty then get rid of the data block. 143830f712c9SDave Chinner */ 143930f712c9SDave Chinner if (be16_to_cpu(bf[0].length) == 144030f712c9SDave Chinner args->geo->blksize - dp->d_ops->data_entry_offset) { 144130f712c9SDave Chinner ASSERT(db != args->geo->datablk); 144230f712c9SDave Chinner if ((error = xfs_dir2_shrink_inode(args, db, dbp))) { 144330f712c9SDave Chinner /* 144430f712c9SDave Chinner * Nope, can't get rid of it because it caused 144530f712c9SDave Chinner * allocation of a bmap btree block to do so. 144630f712c9SDave Chinner * Just go on, returning success, leaving the 144730f712c9SDave Chinner * empty block in place. 144830f712c9SDave Chinner */ 14492451337dSDave Chinner if (error == -ENOSPC && args->total == 0) 145030f712c9SDave Chinner error = 0; 145130f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 145230f712c9SDave Chinner return error; 145330f712c9SDave Chinner } 145430f712c9SDave Chinner dbp = NULL; 145530f712c9SDave Chinner /* 145630f712c9SDave Chinner * If this is the last data block then compact the 145730f712c9SDave Chinner * bests table by getting rid of entries. 145830f712c9SDave Chinner */ 145930f712c9SDave Chinner if (db == be32_to_cpu(ltp->bestcount) - 1) { 146030f712c9SDave Chinner /* 146130f712c9SDave Chinner * Look for the last active entry (i). 146230f712c9SDave Chinner */ 146330f712c9SDave Chinner for (i = db - 1; i > 0; i--) { 146430f712c9SDave Chinner if (bestsp[i] != cpu_to_be16(NULLDATAOFF)) 146530f712c9SDave Chinner break; 146630f712c9SDave Chinner } 146730f712c9SDave Chinner /* 146830f712c9SDave Chinner * Copy the table down so inactive entries at the 146930f712c9SDave Chinner * end are removed. 147030f712c9SDave Chinner */ 147130f712c9SDave Chinner memmove(&bestsp[db - i], bestsp, 147230f712c9SDave Chinner (be32_to_cpu(ltp->bestcount) - (db - i)) * sizeof(*bestsp)); 147330f712c9SDave Chinner be32_add_cpu(<p->bestcount, -(db - i)); 147430f712c9SDave Chinner xfs_dir3_leaf_log_tail(args, lbp); 147530f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, 0, 147630f712c9SDave Chinner be32_to_cpu(ltp->bestcount) - 1); 147730f712c9SDave Chinner } else 147830f712c9SDave Chinner bestsp[db] = cpu_to_be16(NULLDATAOFF); 147930f712c9SDave Chinner } 148030f712c9SDave Chinner /* 148130f712c9SDave Chinner * If the data block was not the first one, drop it. 148230f712c9SDave Chinner */ 148330f712c9SDave Chinner else if (db != args->geo->datablk) 148430f712c9SDave Chinner dbp = NULL; 148530f712c9SDave Chinner 148630f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 148730f712c9SDave Chinner /* 148830f712c9SDave Chinner * See if we can convert to block form. 148930f712c9SDave Chinner */ 149030f712c9SDave Chinner return xfs_dir2_leaf_to_block(args, lbp, dbp); 149130f712c9SDave Chinner } 149230f712c9SDave Chinner 149330f712c9SDave Chinner /* 149430f712c9SDave Chinner * Replace the inode number in a leaf format directory entry. 149530f712c9SDave Chinner */ 149630f712c9SDave Chinner int /* error */ 149730f712c9SDave Chinner xfs_dir2_leaf_replace( 149830f712c9SDave Chinner xfs_da_args_t *args) /* operation arguments */ 149930f712c9SDave Chinner { 150030f712c9SDave Chinner struct xfs_buf *dbp; /* data block buffer */ 150130f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* data block entry */ 150230f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 150330f712c9SDave Chinner int error; /* error return code */ 150430f712c9SDave Chinner int index; /* index of leaf entry */ 150530f712c9SDave Chinner struct xfs_buf *lbp; /* leaf buffer */ 150630f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 150730f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry */ 150830f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 150930f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 151030f712c9SDave Chinner 151130f712c9SDave Chinner trace_xfs_dir2_leaf_replace(args); 151230f712c9SDave Chinner 151330f712c9SDave Chinner /* 151430f712c9SDave Chinner * Look up the entry. 151530f712c9SDave Chinner */ 151630f712c9SDave Chinner if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) { 151730f712c9SDave Chinner return error; 151830f712c9SDave Chinner } 151930f712c9SDave Chinner dp = args->dp; 152030f712c9SDave Chinner leaf = lbp->b_addr; 152130f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 152230f712c9SDave Chinner /* 152330f712c9SDave Chinner * Point to the leaf entry, get data address from it. 152430f712c9SDave Chinner */ 152530f712c9SDave Chinner lep = &ents[index]; 152630f712c9SDave Chinner /* 152730f712c9SDave Chinner * Point to the data entry. 152830f712c9SDave Chinner */ 152930f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *) 153030f712c9SDave Chinner ((char *)dbp->b_addr + 153130f712c9SDave Chinner xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address))); 153230f712c9SDave Chinner ASSERT(args->inumber != be64_to_cpu(dep->inumber)); 153330f712c9SDave Chinner /* 153430f712c9SDave Chinner * Put the new inode number in, log it. 153530f712c9SDave Chinner */ 153630f712c9SDave Chinner dep->inumber = cpu_to_be64(args->inumber); 153730f712c9SDave Chinner dp->d_ops->data_put_ftype(dep, args->filetype); 153830f712c9SDave Chinner tp = args->trans; 153930f712c9SDave Chinner xfs_dir2_data_log_entry(args, dbp, dep); 154030f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 154130f712c9SDave Chinner xfs_trans_brelse(tp, lbp); 154230f712c9SDave Chinner return 0; 154330f712c9SDave Chinner } 154430f712c9SDave Chinner 154530f712c9SDave Chinner /* 154630f712c9SDave Chinner * Return index in the leaf block (lbp) which is either the first 154730f712c9SDave Chinner * one with this hash value, or if there are none, the insert point 154830f712c9SDave Chinner * for that hash value. 154930f712c9SDave Chinner */ 155030f712c9SDave Chinner int /* index value */ 155130f712c9SDave Chinner xfs_dir2_leaf_search_hash( 155230f712c9SDave Chinner xfs_da_args_t *args, /* operation arguments */ 155330f712c9SDave Chinner struct xfs_buf *lbp) /* leaf buffer */ 155430f712c9SDave Chinner { 155530f712c9SDave Chinner xfs_dahash_t hash=0; /* hash from this entry */ 155630f712c9SDave Chinner xfs_dahash_t hashwant; /* hash value looking for */ 155730f712c9SDave Chinner int high; /* high leaf index */ 155830f712c9SDave Chinner int low; /* low leaf index */ 155930f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 156030f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry */ 156130f712c9SDave Chinner int mid=0; /* current leaf index */ 156230f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 156330f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 156430f712c9SDave Chinner 156530f712c9SDave Chinner leaf = lbp->b_addr; 156630f712c9SDave Chinner ents = args->dp->d_ops->leaf_ents_p(leaf); 156730f712c9SDave Chinner args->dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 156830f712c9SDave Chinner 156930f712c9SDave Chinner /* 157030f712c9SDave Chinner * Note, the table cannot be empty, so we have to go through the loop. 157130f712c9SDave Chinner * Binary search the leaf entries looking for our hash value. 157230f712c9SDave Chinner */ 157330f712c9SDave Chinner for (lep = ents, low = 0, high = leafhdr.count - 1, 157430f712c9SDave Chinner hashwant = args->hashval; 157530f712c9SDave Chinner low <= high; ) { 157630f712c9SDave Chinner mid = (low + high) >> 1; 157730f712c9SDave Chinner if ((hash = be32_to_cpu(lep[mid].hashval)) == hashwant) 157830f712c9SDave Chinner break; 157930f712c9SDave Chinner if (hash < hashwant) 158030f712c9SDave Chinner low = mid + 1; 158130f712c9SDave Chinner else 158230f712c9SDave Chinner high = mid - 1; 158330f712c9SDave Chinner } 158430f712c9SDave Chinner /* 158530f712c9SDave Chinner * Found one, back up through all the equal hash values. 158630f712c9SDave Chinner */ 158730f712c9SDave Chinner if (hash == hashwant) { 158830f712c9SDave Chinner while (mid > 0 && be32_to_cpu(lep[mid - 1].hashval) == hashwant) { 158930f712c9SDave Chinner mid--; 159030f712c9SDave Chinner } 159130f712c9SDave Chinner } 159230f712c9SDave Chinner /* 159330f712c9SDave Chinner * Need to point to an entry higher than ours. 159430f712c9SDave Chinner */ 159530f712c9SDave Chinner else if (hash < hashwant) 159630f712c9SDave Chinner mid++; 159730f712c9SDave Chinner return mid; 159830f712c9SDave Chinner } 159930f712c9SDave Chinner 160030f712c9SDave Chinner /* 160130f712c9SDave Chinner * Trim off a trailing data block. We know it's empty since the leaf 160230f712c9SDave Chinner * freespace table says so. 160330f712c9SDave Chinner */ 160430f712c9SDave Chinner int /* error */ 160530f712c9SDave Chinner xfs_dir2_leaf_trim_data( 160630f712c9SDave Chinner xfs_da_args_t *args, /* operation arguments */ 160730f712c9SDave Chinner struct xfs_buf *lbp, /* leaf buffer */ 160830f712c9SDave Chinner xfs_dir2_db_t db) /* data block number */ 160930f712c9SDave Chinner { 161030f712c9SDave Chinner __be16 *bestsp; /* leaf bests table */ 161130f712c9SDave Chinner struct xfs_buf *dbp; /* data block buffer */ 161230f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 161330f712c9SDave Chinner int error; /* error return value */ 161430f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 161530f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ 161630f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 161730f712c9SDave Chinner 161830f712c9SDave Chinner dp = args->dp; 161930f712c9SDave Chinner tp = args->trans; 162030f712c9SDave Chinner /* 162130f712c9SDave Chinner * Read the offending data block. We need its buffer. 162230f712c9SDave Chinner */ 162330f712c9SDave Chinner error = xfs_dir3_data_read(tp, dp, xfs_dir2_db_to_da(args->geo, db), 162430f712c9SDave Chinner -1, &dbp); 162530f712c9SDave Chinner if (error) 162630f712c9SDave Chinner return error; 162730f712c9SDave Chinner 162830f712c9SDave Chinner leaf = lbp->b_addr; 162930f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 163030f712c9SDave Chinner 163130f712c9SDave Chinner #ifdef DEBUG 163230f712c9SDave Chinner { 163330f712c9SDave Chinner struct xfs_dir2_data_hdr *hdr = dbp->b_addr; 163430f712c9SDave Chinner struct xfs_dir2_data_free *bf = dp->d_ops->data_bestfree_p(hdr); 163530f712c9SDave Chinner 163630f712c9SDave Chinner ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || 163730f712c9SDave Chinner hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)); 163830f712c9SDave Chinner ASSERT(be16_to_cpu(bf[0].length) == 163930f712c9SDave Chinner args->geo->blksize - dp->d_ops->data_entry_offset); 164030f712c9SDave Chinner ASSERT(db == be32_to_cpu(ltp->bestcount) - 1); 164130f712c9SDave Chinner } 164230f712c9SDave Chinner #endif 164330f712c9SDave Chinner 164430f712c9SDave Chinner /* 164530f712c9SDave Chinner * Get rid of the data block. 164630f712c9SDave Chinner */ 164730f712c9SDave Chinner if ((error = xfs_dir2_shrink_inode(args, db, dbp))) { 16482451337dSDave Chinner ASSERT(error != -ENOSPC); 164930f712c9SDave Chinner xfs_trans_brelse(tp, dbp); 165030f712c9SDave Chinner return error; 165130f712c9SDave Chinner } 165230f712c9SDave Chinner /* 165330f712c9SDave Chinner * Eliminate the last bests entry from the table. 165430f712c9SDave Chinner */ 165530f712c9SDave Chinner bestsp = xfs_dir2_leaf_bests_p(ltp); 165630f712c9SDave Chinner be32_add_cpu(<p->bestcount, -1); 165730f712c9SDave Chinner memmove(&bestsp[1], &bestsp[0], be32_to_cpu(ltp->bestcount) * sizeof(*bestsp)); 165830f712c9SDave Chinner xfs_dir3_leaf_log_tail(args, lbp); 165930f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); 166030f712c9SDave Chinner return 0; 166130f712c9SDave Chinner } 166230f712c9SDave Chinner 166330f712c9SDave Chinner static inline size_t 166430f712c9SDave Chinner xfs_dir3_leaf_size( 166530f712c9SDave Chinner struct xfs_dir3_icleaf_hdr *hdr, 166630f712c9SDave Chinner int counts) 166730f712c9SDave Chinner { 166830f712c9SDave Chinner int entries; 166930f712c9SDave Chinner int hdrsize; 167030f712c9SDave Chinner 167130f712c9SDave Chinner entries = hdr->count - hdr->stale; 167230f712c9SDave Chinner if (hdr->magic == XFS_DIR2_LEAF1_MAGIC || 167330f712c9SDave Chinner hdr->magic == XFS_DIR2_LEAFN_MAGIC) 167430f712c9SDave Chinner hdrsize = sizeof(struct xfs_dir2_leaf_hdr); 167530f712c9SDave Chinner else 167630f712c9SDave Chinner hdrsize = sizeof(struct xfs_dir3_leaf_hdr); 167730f712c9SDave Chinner 167830f712c9SDave Chinner return hdrsize + entries * sizeof(xfs_dir2_leaf_entry_t) 167930f712c9SDave Chinner + counts * sizeof(xfs_dir2_data_off_t) 168030f712c9SDave Chinner + sizeof(xfs_dir2_leaf_tail_t); 168130f712c9SDave Chinner } 168230f712c9SDave Chinner 168330f712c9SDave Chinner /* 168430f712c9SDave Chinner * Convert node form directory to leaf form directory. 168530f712c9SDave Chinner * The root of the node form dir needs to already be a LEAFN block. 168630f712c9SDave Chinner * Just return if we can't do anything. 168730f712c9SDave Chinner */ 168830f712c9SDave Chinner int /* error */ 168930f712c9SDave Chinner xfs_dir2_node_to_leaf( 169030f712c9SDave Chinner xfs_da_state_t *state) /* directory operation state */ 169130f712c9SDave Chinner { 169230f712c9SDave Chinner xfs_da_args_t *args; /* operation arguments */ 169330f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 169430f712c9SDave Chinner int error; /* error return code */ 169530f712c9SDave Chinner struct xfs_buf *fbp; /* buffer for freespace block */ 169630f712c9SDave Chinner xfs_fileoff_t fo; /* freespace file offset */ 169730f712c9SDave Chinner xfs_dir2_free_t *free; /* freespace structure */ 169830f712c9SDave Chinner struct xfs_buf *lbp; /* buffer for leaf block */ 169930f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* tail of leaf structure */ 170030f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 170130f712c9SDave Chinner xfs_mount_t *mp; /* filesystem mount point */ 170230f712c9SDave Chinner int rval; /* successful free trim? */ 170330f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 170430f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 170530f712c9SDave Chinner struct xfs_dir3_icfree_hdr freehdr; 170630f712c9SDave Chinner 170730f712c9SDave Chinner /* 170830f712c9SDave Chinner * There's more than a leaf level in the btree, so there must 170930f712c9SDave Chinner * be multiple leafn blocks. Give up. 171030f712c9SDave Chinner */ 171130f712c9SDave Chinner if (state->path.active > 1) 171230f712c9SDave Chinner return 0; 171330f712c9SDave Chinner args = state->args; 171430f712c9SDave Chinner 171530f712c9SDave Chinner trace_xfs_dir2_node_to_leaf(args); 171630f712c9SDave Chinner 171730f712c9SDave Chinner mp = state->mp; 171830f712c9SDave Chinner dp = args->dp; 171930f712c9SDave Chinner tp = args->trans; 172030f712c9SDave Chinner /* 172130f712c9SDave Chinner * Get the last offset in the file. 172230f712c9SDave Chinner */ 172330f712c9SDave Chinner if ((error = xfs_bmap_last_offset(dp, &fo, XFS_DATA_FORK))) { 172430f712c9SDave Chinner return error; 172530f712c9SDave Chinner } 172630f712c9SDave Chinner fo -= args->geo->fsbcount; 172730f712c9SDave Chinner /* 172830f712c9SDave Chinner * If there are freespace blocks other than the first one, 172930f712c9SDave Chinner * take this opportunity to remove trailing empty freespace blocks 173030f712c9SDave Chinner * that may have been left behind during no-space-reservation 173130f712c9SDave Chinner * operations. 173230f712c9SDave Chinner */ 173330f712c9SDave Chinner while (fo > args->geo->freeblk) { 173430f712c9SDave Chinner if ((error = xfs_dir2_node_trim_free(args, fo, &rval))) { 173530f712c9SDave Chinner return error; 173630f712c9SDave Chinner } 173730f712c9SDave Chinner if (rval) 173830f712c9SDave Chinner fo -= args->geo->fsbcount; 173930f712c9SDave Chinner else 174030f712c9SDave Chinner return 0; 174130f712c9SDave Chinner } 174230f712c9SDave Chinner /* 174330f712c9SDave Chinner * Now find the block just before the freespace block. 174430f712c9SDave Chinner */ 174530f712c9SDave Chinner if ((error = xfs_bmap_last_before(tp, dp, &fo, XFS_DATA_FORK))) { 174630f712c9SDave Chinner return error; 174730f712c9SDave Chinner } 174830f712c9SDave Chinner /* 174930f712c9SDave Chinner * If it's not the single leaf block, give up. 175030f712c9SDave Chinner */ 175130f712c9SDave Chinner if (XFS_FSB_TO_B(mp, fo) > XFS_DIR2_LEAF_OFFSET + args->geo->blksize) 175230f712c9SDave Chinner return 0; 175330f712c9SDave Chinner lbp = state->path.blk[0].bp; 175430f712c9SDave Chinner leaf = lbp->b_addr; 175530f712c9SDave Chinner dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 175630f712c9SDave Chinner 175730f712c9SDave Chinner ASSERT(leafhdr.magic == XFS_DIR2_LEAFN_MAGIC || 175830f712c9SDave Chinner leafhdr.magic == XFS_DIR3_LEAFN_MAGIC); 175930f712c9SDave Chinner 176030f712c9SDave Chinner /* 176130f712c9SDave Chinner * Read the freespace block. 176230f712c9SDave Chinner */ 176330f712c9SDave Chinner error = xfs_dir2_free_read(tp, dp, args->geo->freeblk, &fbp); 176430f712c9SDave Chinner if (error) 176530f712c9SDave Chinner return error; 176630f712c9SDave Chinner free = fbp->b_addr; 176730f712c9SDave Chinner dp->d_ops->free_hdr_from_disk(&freehdr, free); 176830f712c9SDave Chinner 176930f712c9SDave Chinner ASSERT(!freehdr.firstdb); 177030f712c9SDave Chinner 177130f712c9SDave Chinner /* 177230f712c9SDave Chinner * Now see if the leafn and free data will fit in a leaf1. 177330f712c9SDave Chinner * If not, release the buffer and give up. 177430f712c9SDave Chinner */ 177530f712c9SDave Chinner if (xfs_dir3_leaf_size(&leafhdr, freehdr.nvalid) > args->geo->blksize) { 177630f712c9SDave Chinner xfs_trans_brelse(tp, fbp); 177730f712c9SDave Chinner return 0; 177830f712c9SDave Chinner } 177930f712c9SDave Chinner 178030f712c9SDave Chinner /* 178130f712c9SDave Chinner * If the leaf has any stale entries in it, compress them out. 178230f712c9SDave Chinner */ 178330f712c9SDave Chinner if (leafhdr.stale) 178430f712c9SDave Chinner xfs_dir3_leaf_compact(args, &leafhdr, lbp); 178530f712c9SDave Chinner 178630f712c9SDave Chinner lbp->b_ops = &xfs_dir3_leaf1_buf_ops; 178730f712c9SDave Chinner xfs_trans_buf_set_type(tp, lbp, XFS_BLFT_DIR_LEAF1_BUF); 178830f712c9SDave Chinner leafhdr.magic = (leafhdr.magic == XFS_DIR2_LEAFN_MAGIC) 178930f712c9SDave Chinner ? XFS_DIR2_LEAF1_MAGIC 179030f712c9SDave Chinner : XFS_DIR3_LEAF1_MAGIC; 179130f712c9SDave Chinner 179230f712c9SDave Chinner /* 179330f712c9SDave Chinner * Set up the leaf tail from the freespace block. 179430f712c9SDave Chinner */ 179530f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 179630f712c9SDave Chinner ltp->bestcount = cpu_to_be32(freehdr.nvalid); 179730f712c9SDave Chinner 179830f712c9SDave Chinner /* 179930f712c9SDave Chinner * Set up the leaf bests table. 180030f712c9SDave Chinner */ 180130f712c9SDave Chinner memcpy(xfs_dir2_leaf_bests_p(ltp), dp->d_ops->free_bests_p(free), 180230f712c9SDave Chinner freehdr.nvalid * sizeof(xfs_dir2_data_off_t)); 180330f712c9SDave Chinner 180430f712c9SDave Chinner dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); 180530f712c9SDave Chinner xfs_dir3_leaf_log_header(args, lbp); 180630f712c9SDave Chinner xfs_dir3_leaf_log_bests(args, lbp, 0, be32_to_cpu(ltp->bestcount) - 1); 180730f712c9SDave Chinner xfs_dir3_leaf_log_tail(args, lbp); 180830f712c9SDave Chinner xfs_dir3_leaf_check(dp, lbp); 180930f712c9SDave Chinner 181030f712c9SDave Chinner /* 181130f712c9SDave Chinner * Get rid of the freespace block. 181230f712c9SDave Chinner */ 181330f712c9SDave Chinner error = xfs_dir2_shrink_inode(args, 181430f712c9SDave Chinner xfs_dir2_byte_to_db(args->geo, XFS_DIR2_FREE_OFFSET), 181530f712c9SDave Chinner fbp); 181630f712c9SDave Chinner if (error) { 181730f712c9SDave Chinner /* 181830f712c9SDave Chinner * This can't fail here because it can only happen when 181930f712c9SDave Chinner * punching out the middle of an extent, and this is an 182030f712c9SDave Chinner * isolated block. 182130f712c9SDave Chinner */ 18222451337dSDave Chinner ASSERT(error != -ENOSPC); 182330f712c9SDave Chinner return error; 182430f712c9SDave Chinner } 182530f712c9SDave Chinner fbp = NULL; 182630f712c9SDave Chinner /* 182730f712c9SDave Chinner * Now see if we can convert the single-leaf directory 182830f712c9SDave Chinner * down to a block form directory. 182930f712c9SDave Chinner * This routine always kills the dabuf for the leaf, so 183030f712c9SDave Chinner * eliminate it from the path. 183130f712c9SDave Chinner */ 183230f712c9SDave Chinner error = xfs_dir2_leaf_to_block(args, lbp, NULL); 183330f712c9SDave Chinner state->path.blk[0].bp = NULL; 183430f712c9SDave Chinner return error; 183530f712c9SDave Chinner } 1836