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