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