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