130f712c9SDave Chinner /* 230f712c9SDave Chinner * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc. 330f712c9SDave Chinner * Copyright (c) 2013 Red Hat, Inc. 430f712c9SDave Chinner * All Rights Reserved. 530f712c9SDave Chinner * 630f712c9SDave Chinner * This program is free software; you can redistribute it and/or 730f712c9SDave Chinner * modify it under the terms of the GNU General Public License as 830f712c9SDave Chinner * published by the Free Software Foundation. 930f712c9SDave Chinner * 1030f712c9SDave Chinner * This program is distributed in the hope that it would be useful, 1130f712c9SDave Chinner * but WITHOUT ANY WARRANTY; without even the implied warranty of 1230f712c9SDave Chinner * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 1330f712c9SDave Chinner * GNU General Public License for more details. 1430f712c9SDave Chinner * 1530f712c9SDave Chinner * You should have received a copy of the GNU General Public License 1630f712c9SDave Chinner * along with this program; if not, write the Free Software Foundation, 1730f712c9SDave Chinner * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 1830f712c9SDave Chinner */ 1930f712c9SDave Chinner #include "xfs.h" 2030f712c9SDave Chinner #include "xfs_fs.h" 2130f712c9SDave Chinner #include "xfs_format.h" 2230f712c9SDave Chinner #include "xfs_log_format.h" 2330f712c9SDave Chinner #include "xfs_trans_resv.h" 2430f712c9SDave Chinner #include "xfs_mount.h" 2530f712c9SDave Chinner #include "xfs_da_format.h" 2630f712c9SDave Chinner #include "xfs_da_btree.h" 2730f712c9SDave Chinner #include "xfs_inode.h" 2830f712c9SDave Chinner #include "xfs_trans.h" 2930f712c9SDave Chinner #include "xfs_inode_item.h" 3030f712c9SDave Chinner #include "xfs_bmap.h" 3130f712c9SDave Chinner #include "xfs_buf_item.h" 3230f712c9SDave Chinner #include "xfs_dir2.h" 3330f712c9SDave Chinner #include "xfs_dir2_priv.h" 3430f712c9SDave Chinner #include "xfs_error.h" 3530f712c9SDave Chinner #include "xfs_trace.h" 3630f712c9SDave Chinner #include "xfs_cksum.h" 37a45086e2SBrian Foster #include "xfs_log.h" 3830f712c9SDave Chinner 3930f712c9SDave Chinner /* 4030f712c9SDave Chinner * Local function prototypes. 4130f712c9SDave Chinner */ 4230f712c9SDave Chinner static void xfs_dir2_block_log_leaf(xfs_trans_t *tp, struct xfs_buf *bp, 4330f712c9SDave Chinner int first, int last); 4430f712c9SDave Chinner static void xfs_dir2_block_log_tail(xfs_trans_t *tp, struct xfs_buf *bp); 4530f712c9SDave Chinner static int xfs_dir2_block_lookup_int(xfs_da_args_t *args, struct xfs_buf **bpp, 4630f712c9SDave Chinner int *entno); 4730f712c9SDave Chinner static int xfs_dir2_block_sort(const void *a, const void *b); 4830f712c9SDave Chinner 4930f712c9SDave Chinner static xfs_dahash_t xfs_dir_hash_dot, xfs_dir_hash_dotdot; 5030f712c9SDave Chinner 5130f712c9SDave Chinner /* 5230f712c9SDave Chinner * One-time startup routine called from xfs_init(). 5330f712c9SDave Chinner */ 5430f712c9SDave Chinner void 5530f712c9SDave Chinner xfs_dir_startup(void) 5630f712c9SDave Chinner { 5730f712c9SDave Chinner xfs_dir_hash_dot = xfs_da_hashname((unsigned char *)".", 1); 5830f712c9SDave Chinner xfs_dir_hash_dotdot = xfs_da_hashname((unsigned char *)"..", 2); 5930f712c9SDave Chinner } 6030f712c9SDave Chinner 6130f712c9SDave Chinner static bool 6230f712c9SDave Chinner xfs_dir3_block_verify( 6330f712c9SDave Chinner struct xfs_buf *bp) 6430f712c9SDave Chinner { 6530f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 6630f712c9SDave Chinner struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; 6730f712c9SDave Chinner 6830f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 6930f712c9SDave Chinner if (hdr3->magic != cpu_to_be32(XFS_DIR3_BLOCK_MAGIC)) 7030f712c9SDave Chinner return false; 71ce748eaaSEric Sandeen if (!uuid_equal(&hdr3->uuid, &mp->m_sb.sb_meta_uuid)) 7230f712c9SDave Chinner return false; 7330f712c9SDave Chinner if (be64_to_cpu(hdr3->blkno) != bp->b_bn) 7430f712c9SDave Chinner return false; 75a45086e2SBrian Foster if (!xfs_log_check_lsn(mp, be64_to_cpu(hdr3->lsn))) 76a45086e2SBrian Foster return false; 7730f712c9SDave Chinner } else { 7830f712c9SDave Chinner if (hdr3->magic != cpu_to_be32(XFS_DIR2_BLOCK_MAGIC)) 7930f712c9SDave Chinner return false; 8030f712c9SDave Chinner } 8130f712c9SDave Chinner if (__xfs_dir3_data_check(NULL, bp)) 8230f712c9SDave Chinner return false; 8330f712c9SDave Chinner return true; 8430f712c9SDave Chinner } 8530f712c9SDave Chinner 8630f712c9SDave Chinner static void 8730f712c9SDave Chinner xfs_dir3_block_read_verify( 8830f712c9SDave Chinner struct xfs_buf *bp) 8930f712c9SDave Chinner { 9030f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 9130f712c9SDave Chinner 9230f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb) && 9330f712c9SDave Chinner !xfs_buf_verify_cksum(bp, XFS_DIR3_DATA_CRC_OFF)) 942451337dSDave Chinner xfs_buf_ioerror(bp, -EFSBADCRC); 9530f712c9SDave Chinner else if (!xfs_dir3_block_verify(bp)) 962451337dSDave Chinner xfs_buf_ioerror(bp, -EFSCORRUPTED); 9730f712c9SDave Chinner 9830f712c9SDave Chinner if (bp->b_error) 9930f712c9SDave Chinner xfs_verifier_error(bp); 10030f712c9SDave Chinner } 10130f712c9SDave Chinner 10230f712c9SDave Chinner static void 10330f712c9SDave Chinner xfs_dir3_block_write_verify( 10430f712c9SDave Chinner struct xfs_buf *bp) 10530f712c9SDave Chinner { 10630f712c9SDave Chinner struct xfs_mount *mp = bp->b_target->bt_mount; 10730f712c9SDave Chinner struct xfs_buf_log_item *bip = bp->b_fspriv; 10830f712c9SDave Chinner struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; 10930f712c9SDave Chinner 11030f712c9SDave Chinner if (!xfs_dir3_block_verify(bp)) { 1112451337dSDave Chinner xfs_buf_ioerror(bp, -EFSCORRUPTED); 11230f712c9SDave Chinner xfs_verifier_error(bp); 11330f712c9SDave Chinner return; 11430f712c9SDave Chinner } 11530f712c9SDave Chinner 11630f712c9SDave Chinner if (!xfs_sb_version_hascrc(&mp->m_sb)) 11730f712c9SDave Chinner return; 11830f712c9SDave Chinner 11930f712c9SDave Chinner if (bip) 12030f712c9SDave Chinner hdr3->lsn = cpu_to_be64(bip->bli_item.li_lsn); 12130f712c9SDave Chinner 12230f712c9SDave Chinner xfs_buf_update_cksum(bp, XFS_DIR3_DATA_CRC_OFF); 12330f712c9SDave Chinner } 12430f712c9SDave Chinner 12530f712c9SDave Chinner const struct xfs_buf_ops xfs_dir3_block_buf_ops = { 126233135b7SEric Sandeen .name = "xfs_dir3_block", 12730f712c9SDave Chinner .verify_read = xfs_dir3_block_read_verify, 12830f712c9SDave Chinner .verify_write = xfs_dir3_block_write_verify, 12930f712c9SDave Chinner }; 13030f712c9SDave Chinner 13130f712c9SDave Chinner int 13230f712c9SDave Chinner xfs_dir3_block_read( 13330f712c9SDave Chinner struct xfs_trans *tp, 13430f712c9SDave Chinner struct xfs_inode *dp, 13530f712c9SDave Chinner struct xfs_buf **bpp) 13630f712c9SDave Chinner { 13730f712c9SDave Chinner struct xfs_mount *mp = dp->i_mount; 13830f712c9SDave Chinner int err; 13930f712c9SDave Chinner 14030f712c9SDave Chinner err = xfs_da_read_buf(tp, dp, mp->m_dir_geo->datablk, -1, bpp, 14130f712c9SDave Chinner XFS_DATA_FORK, &xfs_dir3_block_buf_ops); 142cd87d867SDarrick J. Wong if (!err && tp && *bpp) 14330f712c9SDave Chinner xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_BLOCK_BUF); 14430f712c9SDave Chinner return err; 14530f712c9SDave Chinner } 14630f712c9SDave Chinner 14730f712c9SDave Chinner static void 14830f712c9SDave Chinner xfs_dir3_block_init( 14930f712c9SDave Chinner struct xfs_mount *mp, 15030f712c9SDave Chinner struct xfs_trans *tp, 15130f712c9SDave Chinner struct xfs_buf *bp, 15230f712c9SDave Chinner struct xfs_inode *dp) 15330f712c9SDave Chinner { 15430f712c9SDave Chinner struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; 15530f712c9SDave Chinner 15630f712c9SDave Chinner bp->b_ops = &xfs_dir3_block_buf_ops; 15730f712c9SDave Chinner xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_BLOCK_BUF); 15830f712c9SDave Chinner 15930f712c9SDave Chinner if (xfs_sb_version_hascrc(&mp->m_sb)) { 16030f712c9SDave Chinner memset(hdr3, 0, sizeof(*hdr3)); 16130f712c9SDave Chinner hdr3->magic = cpu_to_be32(XFS_DIR3_BLOCK_MAGIC); 16230f712c9SDave Chinner hdr3->blkno = cpu_to_be64(bp->b_bn); 16330f712c9SDave Chinner hdr3->owner = cpu_to_be64(dp->i_ino); 164ce748eaaSEric Sandeen uuid_copy(&hdr3->uuid, &mp->m_sb.sb_meta_uuid); 16530f712c9SDave Chinner return; 16630f712c9SDave Chinner 16730f712c9SDave Chinner } 16830f712c9SDave Chinner hdr3->magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC); 16930f712c9SDave Chinner } 17030f712c9SDave Chinner 17130f712c9SDave Chinner static void 17230f712c9SDave Chinner xfs_dir2_block_need_space( 17330f712c9SDave Chinner struct xfs_inode *dp, 17430f712c9SDave Chinner struct xfs_dir2_data_hdr *hdr, 17530f712c9SDave Chinner struct xfs_dir2_block_tail *btp, 17630f712c9SDave Chinner struct xfs_dir2_leaf_entry *blp, 17730f712c9SDave Chinner __be16 **tagpp, 17830f712c9SDave Chinner struct xfs_dir2_data_unused **dupp, 17930f712c9SDave Chinner struct xfs_dir2_data_unused **enddupp, 18030f712c9SDave Chinner int *compact, 18130f712c9SDave Chinner int len) 18230f712c9SDave Chinner { 18330f712c9SDave Chinner struct xfs_dir2_data_free *bf; 18430f712c9SDave Chinner __be16 *tagp = NULL; 18530f712c9SDave Chinner struct xfs_dir2_data_unused *dup = NULL; 18630f712c9SDave Chinner struct xfs_dir2_data_unused *enddup = NULL; 18730f712c9SDave Chinner 18830f712c9SDave Chinner *compact = 0; 18930f712c9SDave Chinner bf = dp->d_ops->data_bestfree_p(hdr); 19030f712c9SDave Chinner 19130f712c9SDave Chinner /* 19230f712c9SDave Chinner * If there are stale entries we'll use one for the leaf. 19330f712c9SDave Chinner */ 19430f712c9SDave Chinner if (btp->stale) { 19530f712c9SDave Chinner if (be16_to_cpu(bf[0].length) >= len) { 19630f712c9SDave Chinner /* 19730f712c9SDave Chinner * The biggest entry enough to avoid compaction. 19830f712c9SDave Chinner */ 19930f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *) 20030f712c9SDave Chinner ((char *)hdr + be16_to_cpu(bf[0].offset)); 20130f712c9SDave Chinner goto out; 20230f712c9SDave Chinner } 20330f712c9SDave Chinner 20430f712c9SDave Chinner /* 20530f712c9SDave Chinner * Will need to compact to make this work. 20630f712c9SDave Chinner * Tag just before the first leaf entry. 20730f712c9SDave Chinner */ 20830f712c9SDave Chinner *compact = 1; 20930f712c9SDave Chinner tagp = (__be16 *)blp - 1; 21030f712c9SDave Chinner 21130f712c9SDave Chinner /* Data object just before the first leaf entry. */ 21230f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); 21330f712c9SDave Chinner 21430f712c9SDave Chinner /* 21530f712c9SDave Chinner * If it's not free then the data will go where the 21630f712c9SDave Chinner * leaf data starts now, if it works at all. 21730f712c9SDave Chinner */ 21830f712c9SDave Chinner if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { 21930f712c9SDave Chinner if (be16_to_cpu(dup->length) + (be32_to_cpu(btp->stale) - 1) * 22030f712c9SDave Chinner (uint)sizeof(*blp) < len) 22130f712c9SDave Chinner dup = NULL; 22230f712c9SDave Chinner } else if ((be32_to_cpu(btp->stale) - 1) * (uint)sizeof(*blp) < len) 22330f712c9SDave Chinner dup = NULL; 22430f712c9SDave Chinner else 22530f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *)blp; 22630f712c9SDave Chinner goto out; 22730f712c9SDave Chinner } 22830f712c9SDave Chinner 22930f712c9SDave Chinner /* 23030f712c9SDave Chinner * no stale entries, so just use free space. 23130f712c9SDave Chinner * Tag just before the first leaf entry. 23230f712c9SDave Chinner */ 23330f712c9SDave Chinner tagp = (__be16 *)blp - 1; 23430f712c9SDave Chinner 23530f712c9SDave Chinner /* Data object just before the first leaf entry. */ 23630f712c9SDave Chinner enddup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); 23730f712c9SDave Chinner 23830f712c9SDave Chinner /* 23930f712c9SDave Chinner * If it's not free then can't do this add without cleaning up: 24030f712c9SDave Chinner * the space before the first leaf entry needs to be free so it 24130f712c9SDave Chinner * can be expanded to hold the pointer to the new entry. 24230f712c9SDave Chinner */ 24330f712c9SDave Chinner if (be16_to_cpu(enddup->freetag) == XFS_DIR2_DATA_FREE_TAG) { 24430f712c9SDave Chinner /* 24530f712c9SDave Chinner * Check out the biggest freespace and see if it's the same one. 24630f712c9SDave Chinner */ 24730f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *) 24830f712c9SDave Chinner ((char *)hdr + be16_to_cpu(bf[0].offset)); 24930f712c9SDave Chinner if (dup != enddup) { 25030f712c9SDave Chinner /* 25130f712c9SDave Chinner * Not the same free entry, just check its length. 25230f712c9SDave Chinner */ 25330f712c9SDave Chinner if (be16_to_cpu(dup->length) < len) 25430f712c9SDave Chinner dup = NULL; 25530f712c9SDave Chinner goto out; 25630f712c9SDave Chinner } 25730f712c9SDave Chinner 25830f712c9SDave Chinner /* 25930f712c9SDave Chinner * It is the biggest freespace, can it hold the leaf too? 26030f712c9SDave Chinner */ 26130f712c9SDave Chinner if (be16_to_cpu(dup->length) < len + (uint)sizeof(*blp)) { 26230f712c9SDave Chinner /* 26330f712c9SDave Chinner * Yes, use the second-largest entry instead if it works. 26430f712c9SDave Chinner */ 26530f712c9SDave Chinner if (be16_to_cpu(bf[1].length) >= len) 26630f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *) 26730f712c9SDave Chinner ((char *)hdr + be16_to_cpu(bf[1].offset)); 26830f712c9SDave Chinner else 26930f712c9SDave Chinner dup = NULL; 27030f712c9SDave Chinner } 27130f712c9SDave Chinner } 27230f712c9SDave Chinner out: 27330f712c9SDave Chinner *tagpp = tagp; 27430f712c9SDave Chinner *dupp = dup; 27530f712c9SDave Chinner *enddupp = enddup; 27630f712c9SDave Chinner } 27730f712c9SDave Chinner 27830f712c9SDave Chinner /* 27930f712c9SDave Chinner * compact the leaf entries. 28030f712c9SDave Chinner * Leave the highest-numbered stale entry stale. 28130f712c9SDave Chinner * XXX should be the one closest to mid but mid is not yet computed. 28230f712c9SDave Chinner */ 28330f712c9SDave Chinner static void 28430f712c9SDave Chinner xfs_dir2_block_compact( 28530f712c9SDave Chinner struct xfs_da_args *args, 28630f712c9SDave Chinner struct xfs_buf *bp, 28730f712c9SDave Chinner struct xfs_dir2_data_hdr *hdr, 28830f712c9SDave Chinner struct xfs_dir2_block_tail *btp, 28930f712c9SDave Chinner struct xfs_dir2_leaf_entry *blp, 29030f712c9SDave Chinner int *needlog, 29130f712c9SDave Chinner int *lfloghigh, 29230f712c9SDave Chinner int *lfloglow) 29330f712c9SDave Chinner { 29430f712c9SDave Chinner int fromidx; /* source leaf index */ 29530f712c9SDave Chinner int toidx; /* target leaf index */ 29630f712c9SDave Chinner int needscan = 0; 29730f712c9SDave Chinner int highstale; /* high stale index */ 29830f712c9SDave Chinner 29930f712c9SDave Chinner fromidx = toidx = be32_to_cpu(btp->count) - 1; 30030f712c9SDave Chinner highstale = *lfloghigh = -1; 30130f712c9SDave Chinner for (; fromidx >= 0; fromidx--) { 30230f712c9SDave Chinner if (blp[fromidx].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) { 30330f712c9SDave Chinner if (highstale == -1) 30430f712c9SDave Chinner highstale = toidx; 30530f712c9SDave Chinner else { 30630f712c9SDave Chinner if (*lfloghigh == -1) 30730f712c9SDave Chinner *lfloghigh = toidx; 30830f712c9SDave Chinner continue; 30930f712c9SDave Chinner } 31030f712c9SDave Chinner } 31130f712c9SDave Chinner if (fromidx < toidx) 31230f712c9SDave Chinner blp[toidx] = blp[fromidx]; 31330f712c9SDave Chinner toidx--; 31430f712c9SDave Chinner } 31530f712c9SDave Chinner *lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1); 31630f712c9SDave Chinner *lfloghigh -= be32_to_cpu(btp->stale) - 1; 31730f712c9SDave Chinner be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1)); 31830f712c9SDave Chinner xfs_dir2_data_make_free(args, bp, 31930f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr), 32030f712c9SDave Chinner (xfs_dir2_data_aoff_t)((be32_to_cpu(btp->stale) - 1) * sizeof(*blp)), 32130f712c9SDave Chinner needlog, &needscan); 32230f712c9SDave Chinner btp->stale = cpu_to_be32(1); 32330f712c9SDave Chinner /* 32430f712c9SDave Chinner * If we now need to rebuild the bestfree map, do so. 32530f712c9SDave Chinner * This needs to happen before the next call to use_free. 32630f712c9SDave Chinner */ 32730f712c9SDave Chinner if (needscan) 32830f712c9SDave Chinner xfs_dir2_data_freescan(args->dp, hdr, needlog); 32930f712c9SDave Chinner } 33030f712c9SDave Chinner 33130f712c9SDave Chinner /* 33230f712c9SDave Chinner * Add an entry to a block directory. 33330f712c9SDave Chinner */ 33430f712c9SDave Chinner int /* error */ 33530f712c9SDave Chinner xfs_dir2_block_addname( 33630f712c9SDave Chinner xfs_da_args_t *args) /* directory op arguments */ 33730f712c9SDave Chinner { 33830f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 33930f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ 34030f712c9SDave Chinner struct xfs_buf *bp; /* buffer for block */ 34130f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block tail */ 34230f712c9SDave Chinner int compact; /* need to compact leaf ents */ 34330f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* block data entry */ 34430f712c9SDave Chinner xfs_inode_t *dp; /* directory inode */ 34530f712c9SDave Chinner xfs_dir2_data_unused_t *dup; /* block unused entry */ 34630f712c9SDave Chinner int error; /* error return value */ 34730f712c9SDave Chinner xfs_dir2_data_unused_t *enddup=NULL; /* unused at end of data */ 34830f712c9SDave Chinner xfs_dahash_t hash; /* hash value of found entry */ 34930f712c9SDave Chinner int high; /* high index for binary srch */ 35030f712c9SDave Chinner int highstale; /* high stale index */ 35130f712c9SDave Chinner int lfloghigh=0; /* last final leaf to log */ 35230f712c9SDave Chinner int lfloglow=0; /* first final leaf to log */ 35330f712c9SDave Chinner int len; /* length of the new entry */ 35430f712c9SDave Chinner int low; /* low index for binary srch */ 35530f712c9SDave Chinner int lowstale; /* low stale index */ 35630f712c9SDave Chinner int mid=0; /* midpoint for binary srch */ 35730f712c9SDave Chinner int needlog; /* need to log header */ 35830f712c9SDave Chinner int needscan; /* need to rescan freespace */ 35930f712c9SDave Chinner __be16 *tagp; /* pointer to tag value */ 36030f712c9SDave Chinner xfs_trans_t *tp; /* transaction structure */ 36130f712c9SDave Chinner 36230f712c9SDave Chinner trace_xfs_dir2_block_addname(args); 36330f712c9SDave Chinner 36430f712c9SDave Chinner dp = args->dp; 36530f712c9SDave Chinner tp = args->trans; 36630f712c9SDave Chinner 36730f712c9SDave Chinner /* Read the (one and only) directory block into bp. */ 36830f712c9SDave Chinner error = xfs_dir3_block_read(tp, dp, &bp); 36930f712c9SDave Chinner if (error) 37030f712c9SDave Chinner return error; 37130f712c9SDave Chinner 37230f712c9SDave Chinner len = dp->d_ops->data_entsize(args->namelen); 37330f712c9SDave Chinner 37430f712c9SDave Chinner /* 37530f712c9SDave Chinner * Set up pointers to parts of the block. 37630f712c9SDave Chinner */ 37730f712c9SDave Chinner hdr = bp->b_addr; 37830f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 37930f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 38030f712c9SDave Chinner 38130f712c9SDave Chinner /* 38230f712c9SDave Chinner * Find out if we can reuse stale entries or whether we need extra 38330f712c9SDave Chinner * space for entry and new leaf. 38430f712c9SDave Chinner */ 38530f712c9SDave Chinner xfs_dir2_block_need_space(dp, hdr, btp, blp, &tagp, &dup, 38630f712c9SDave Chinner &enddup, &compact, len); 38730f712c9SDave Chinner 38830f712c9SDave Chinner /* 38930f712c9SDave Chinner * Done everything we need for a space check now. 39030f712c9SDave Chinner */ 39130f712c9SDave Chinner if (args->op_flags & XFS_DA_OP_JUSTCHECK) { 39230f712c9SDave Chinner xfs_trans_brelse(tp, bp); 39330f712c9SDave Chinner if (!dup) 3942451337dSDave Chinner return -ENOSPC; 39530f712c9SDave Chinner return 0; 39630f712c9SDave Chinner } 39730f712c9SDave Chinner 39830f712c9SDave Chinner /* 39930f712c9SDave Chinner * If we don't have space for the new entry & leaf ... 40030f712c9SDave Chinner */ 40130f712c9SDave Chinner if (!dup) { 40230f712c9SDave Chinner /* Don't have a space reservation: return no-space. */ 40330f712c9SDave Chinner if (args->total == 0) 4042451337dSDave Chinner return -ENOSPC; 40530f712c9SDave Chinner /* 40630f712c9SDave Chinner * Convert to the next larger format. 40730f712c9SDave Chinner * Then add the new entry in that format. 40830f712c9SDave Chinner */ 40930f712c9SDave Chinner error = xfs_dir2_block_to_leaf(args, bp); 41030f712c9SDave Chinner if (error) 41130f712c9SDave Chinner return error; 41230f712c9SDave Chinner return xfs_dir2_leaf_addname(args); 41330f712c9SDave Chinner } 41430f712c9SDave Chinner 41530f712c9SDave Chinner needlog = needscan = 0; 41630f712c9SDave Chinner 41730f712c9SDave Chinner /* 41830f712c9SDave Chinner * If need to compact the leaf entries, do it now. 41930f712c9SDave Chinner */ 42030f712c9SDave Chinner if (compact) { 42130f712c9SDave Chinner xfs_dir2_block_compact(args, bp, hdr, btp, blp, &needlog, 42230f712c9SDave Chinner &lfloghigh, &lfloglow); 42330f712c9SDave Chinner /* recalculate blp post-compaction */ 42430f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 42530f712c9SDave Chinner } else if (btp->stale) { 42630f712c9SDave Chinner /* 42730f712c9SDave Chinner * Set leaf logging boundaries to impossible state. 42830f712c9SDave Chinner * For the no-stale case they're set explicitly. 42930f712c9SDave Chinner */ 43030f712c9SDave Chinner lfloglow = be32_to_cpu(btp->count); 43130f712c9SDave Chinner lfloghigh = -1; 43230f712c9SDave Chinner } 43330f712c9SDave Chinner 43430f712c9SDave Chinner /* 43530f712c9SDave Chinner * Find the slot that's first lower than our hash value, -1 if none. 43630f712c9SDave Chinner */ 43730f712c9SDave Chinner for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { 43830f712c9SDave Chinner mid = (low + high) >> 1; 43930f712c9SDave Chinner if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) 44030f712c9SDave Chinner break; 44130f712c9SDave Chinner if (hash < args->hashval) 44230f712c9SDave Chinner low = mid + 1; 44330f712c9SDave Chinner else 44430f712c9SDave Chinner high = mid - 1; 44530f712c9SDave Chinner } 44630f712c9SDave Chinner while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) { 44730f712c9SDave Chinner mid--; 44830f712c9SDave Chinner } 44930f712c9SDave Chinner /* 45030f712c9SDave Chinner * No stale entries, will use enddup space to hold new leaf. 45130f712c9SDave Chinner */ 45230f712c9SDave Chinner if (!btp->stale) { 45330f712c9SDave Chinner /* 45430f712c9SDave Chinner * Mark the space needed for the new leaf entry, now in use. 45530f712c9SDave Chinner */ 45630f712c9SDave Chinner xfs_dir2_data_use_free(args, bp, enddup, 45730f712c9SDave Chinner (xfs_dir2_data_aoff_t) 45830f712c9SDave Chinner ((char *)enddup - (char *)hdr + be16_to_cpu(enddup->length) - 45930f712c9SDave Chinner sizeof(*blp)), 46030f712c9SDave Chinner (xfs_dir2_data_aoff_t)sizeof(*blp), 46130f712c9SDave Chinner &needlog, &needscan); 46230f712c9SDave Chinner /* 46330f712c9SDave Chinner * Update the tail (entry count). 46430f712c9SDave Chinner */ 46530f712c9SDave Chinner be32_add_cpu(&btp->count, 1); 46630f712c9SDave Chinner /* 46730f712c9SDave Chinner * If we now need to rebuild the bestfree map, do so. 46830f712c9SDave Chinner * This needs to happen before the next call to use_free. 46930f712c9SDave Chinner */ 47030f712c9SDave Chinner if (needscan) { 47130f712c9SDave Chinner xfs_dir2_data_freescan(dp, hdr, &needlog); 47230f712c9SDave Chinner needscan = 0; 47330f712c9SDave Chinner } 47430f712c9SDave Chinner /* 47530f712c9SDave Chinner * Adjust pointer to the first leaf entry, we're about to move 47630f712c9SDave Chinner * the table up one to open up space for the new leaf entry. 47730f712c9SDave Chinner * Then adjust our index to match. 47830f712c9SDave Chinner */ 47930f712c9SDave Chinner blp--; 48030f712c9SDave Chinner mid++; 48130f712c9SDave Chinner if (mid) 48230f712c9SDave Chinner memmove(blp, &blp[1], mid * sizeof(*blp)); 48330f712c9SDave Chinner lfloglow = 0; 48430f712c9SDave Chinner lfloghigh = mid; 48530f712c9SDave Chinner } 48630f712c9SDave Chinner /* 48730f712c9SDave Chinner * Use a stale leaf for our new entry. 48830f712c9SDave Chinner */ 48930f712c9SDave Chinner else { 49030f712c9SDave Chinner for (lowstale = mid; 49130f712c9SDave Chinner lowstale >= 0 && 49230f712c9SDave Chinner blp[lowstale].address != 49330f712c9SDave Chinner cpu_to_be32(XFS_DIR2_NULL_DATAPTR); 49430f712c9SDave Chinner lowstale--) 49530f712c9SDave Chinner continue; 49630f712c9SDave Chinner for (highstale = mid + 1; 49730f712c9SDave Chinner highstale < be32_to_cpu(btp->count) && 49830f712c9SDave Chinner blp[highstale].address != 49930f712c9SDave Chinner cpu_to_be32(XFS_DIR2_NULL_DATAPTR) && 50030f712c9SDave Chinner (lowstale < 0 || mid - lowstale > highstale - mid); 50130f712c9SDave Chinner highstale++) 50230f712c9SDave Chinner continue; 50330f712c9SDave Chinner /* 50430f712c9SDave Chinner * Move entries toward the low-numbered stale entry. 50530f712c9SDave Chinner */ 50630f712c9SDave Chinner if (lowstale >= 0 && 50730f712c9SDave Chinner (highstale == be32_to_cpu(btp->count) || 50830f712c9SDave Chinner mid - lowstale <= highstale - mid)) { 50930f712c9SDave Chinner if (mid - lowstale) 51030f712c9SDave Chinner memmove(&blp[lowstale], &blp[lowstale + 1], 51130f712c9SDave Chinner (mid - lowstale) * sizeof(*blp)); 51230f712c9SDave Chinner lfloglow = MIN(lowstale, lfloglow); 51330f712c9SDave Chinner lfloghigh = MAX(mid, lfloghigh); 51430f712c9SDave Chinner } 51530f712c9SDave Chinner /* 51630f712c9SDave Chinner * Move entries toward the high-numbered stale entry. 51730f712c9SDave Chinner */ 51830f712c9SDave Chinner else { 51930f712c9SDave Chinner ASSERT(highstale < be32_to_cpu(btp->count)); 52030f712c9SDave Chinner mid++; 52130f712c9SDave Chinner if (highstale - mid) 52230f712c9SDave Chinner memmove(&blp[mid + 1], &blp[mid], 52330f712c9SDave Chinner (highstale - mid) * sizeof(*blp)); 52430f712c9SDave Chinner lfloglow = MIN(mid, lfloglow); 52530f712c9SDave Chinner lfloghigh = MAX(highstale, lfloghigh); 52630f712c9SDave Chinner } 52730f712c9SDave Chinner be32_add_cpu(&btp->stale, -1); 52830f712c9SDave Chinner } 52930f712c9SDave Chinner /* 53030f712c9SDave Chinner * Point to the new data entry. 53130f712c9SDave Chinner */ 53230f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)dup; 53330f712c9SDave Chinner /* 53430f712c9SDave Chinner * Fill in the leaf entry. 53530f712c9SDave Chinner */ 53630f712c9SDave Chinner blp[mid].hashval = cpu_to_be32(args->hashval); 53730f712c9SDave Chinner blp[mid].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( 53830f712c9SDave Chinner (char *)dep - (char *)hdr)); 53930f712c9SDave Chinner xfs_dir2_block_log_leaf(tp, bp, lfloglow, lfloghigh); 54030f712c9SDave Chinner /* 54130f712c9SDave Chinner * Mark space for the data entry used. 54230f712c9SDave Chinner */ 54330f712c9SDave Chinner xfs_dir2_data_use_free(args, bp, dup, 54430f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), 54530f712c9SDave Chinner (xfs_dir2_data_aoff_t)len, &needlog, &needscan); 54630f712c9SDave Chinner /* 54730f712c9SDave Chinner * Create the new data entry. 54830f712c9SDave Chinner */ 54930f712c9SDave Chinner dep->inumber = cpu_to_be64(args->inumber); 55030f712c9SDave Chinner dep->namelen = args->namelen; 55130f712c9SDave Chinner memcpy(dep->name, args->name, args->namelen); 55230f712c9SDave Chinner dp->d_ops->data_put_ftype(dep, args->filetype); 55330f712c9SDave Chinner tagp = dp->d_ops->data_entry_tag_p(dep); 55430f712c9SDave Chinner *tagp = cpu_to_be16((char *)dep - (char *)hdr); 55530f712c9SDave Chinner /* 55630f712c9SDave Chinner * Clean up the bestfree array and log the header, tail, and entry. 55730f712c9SDave Chinner */ 55830f712c9SDave Chinner if (needscan) 55930f712c9SDave Chinner xfs_dir2_data_freescan(dp, hdr, &needlog); 56030f712c9SDave Chinner if (needlog) 56130f712c9SDave Chinner xfs_dir2_data_log_header(args, bp); 56230f712c9SDave Chinner xfs_dir2_block_log_tail(tp, bp); 56330f712c9SDave Chinner xfs_dir2_data_log_entry(args, bp, dep); 56430f712c9SDave Chinner xfs_dir3_data_check(dp, bp); 56530f712c9SDave Chinner return 0; 56630f712c9SDave Chinner } 56730f712c9SDave Chinner 56830f712c9SDave Chinner /* 56930f712c9SDave Chinner * Log leaf entries from the block. 57030f712c9SDave Chinner */ 57130f712c9SDave Chinner static void 57230f712c9SDave Chinner xfs_dir2_block_log_leaf( 57330f712c9SDave Chinner xfs_trans_t *tp, /* transaction structure */ 57430f712c9SDave Chinner struct xfs_buf *bp, /* block buffer */ 57530f712c9SDave Chinner int first, /* index of first logged leaf */ 57630f712c9SDave Chinner int last) /* index of last logged leaf */ 57730f712c9SDave Chinner { 57830f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr = bp->b_addr; 57930f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; 58030f712c9SDave Chinner xfs_dir2_block_tail_t *btp; 58130f712c9SDave Chinner 58230f712c9SDave Chinner btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr); 58330f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 58430f712c9SDave Chinner xfs_trans_log_buf(tp, bp, (uint)((char *)&blp[first] - (char *)hdr), 58530f712c9SDave Chinner (uint)((char *)&blp[last + 1] - (char *)hdr - 1)); 58630f712c9SDave Chinner } 58730f712c9SDave Chinner 58830f712c9SDave Chinner /* 58930f712c9SDave Chinner * Log the block tail. 59030f712c9SDave Chinner */ 59130f712c9SDave Chinner static void 59230f712c9SDave Chinner xfs_dir2_block_log_tail( 59330f712c9SDave Chinner xfs_trans_t *tp, /* transaction structure */ 59430f712c9SDave Chinner struct xfs_buf *bp) /* block buffer */ 59530f712c9SDave Chinner { 59630f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr = bp->b_addr; 59730f712c9SDave Chinner xfs_dir2_block_tail_t *btp; 59830f712c9SDave Chinner 59930f712c9SDave Chinner btp = xfs_dir2_block_tail_p(tp->t_mountp->m_dir_geo, hdr); 60030f712c9SDave Chinner xfs_trans_log_buf(tp, bp, (uint)((char *)btp - (char *)hdr), 60130f712c9SDave Chinner (uint)((char *)(btp + 1) - (char *)hdr - 1)); 60230f712c9SDave Chinner } 60330f712c9SDave Chinner 60430f712c9SDave Chinner /* 60530f712c9SDave Chinner * Look up an entry in the block. This is the external routine, 60630f712c9SDave Chinner * xfs_dir2_block_lookup_int does the real work. 60730f712c9SDave Chinner */ 60830f712c9SDave Chinner int /* error */ 60930f712c9SDave Chinner xfs_dir2_block_lookup( 61030f712c9SDave Chinner xfs_da_args_t *args) /* dir lookup arguments */ 61130f712c9SDave Chinner { 61230f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 61330f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ 61430f712c9SDave Chinner struct xfs_buf *bp; /* block buffer */ 61530f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block tail */ 61630f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* block data entry */ 61730f712c9SDave Chinner xfs_inode_t *dp; /* incore inode */ 61830f712c9SDave Chinner int ent; /* entry index */ 61930f712c9SDave Chinner int error; /* error return value */ 62030f712c9SDave Chinner 62130f712c9SDave Chinner trace_xfs_dir2_block_lookup(args); 62230f712c9SDave Chinner 62330f712c9SDave Chinner /* 62430f712c9SDave Chinner * Get the buffer, look up the entry. 62530f712c9SDave Chinner * If not found (ENOENT) then return, have no buffer. 62630f712c9SDave Chinner */ 62730f712c9SDave Chinner if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) 62830f712c9SDave Chinner return error; 62930f712c9SDave Chinner dp = args->dp; 63030f712c9SDave Chinner hdr = bp->b_addr; 63130f712c9SDave Chinner xfs_dir3_data_check(dp, bp); 63230f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 63330f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 63430f712c9SDave Chinner /* 63530f712c9SDave Chinner * Get the offset from the leaf entry, to point to the data. 63630f712c9SDave Chinner */ 63730f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)((char *)hdr + 63830f712c9SDave Chinner xfs_dir2_dataptr_to_off(args->geo, 63930f712c9SDave Chinner be32_to_cpu(blp[ent].address))); 64030f712c9SDave Chinner /* 64130f712c9SDave Chinner * Fill in inode number, CI name if appropriate, release the block. 64230f712c9SDave Chinner */ 64330f712c9SDave Chinner args->inumber = be64_to_cpu(dep->inumber); 64430f712c9SDave Chinner args->filetype = dp->d_ops->data_get_ftype(dep); 64530f712c9SDave Chinner error = xfs_dir_cilookup_result(args, dep->name, dep->namelen); 64630f712c9SDave Chinner xfs_trans_brelse(args->trans, bp); 64730f712c9SDave Chinner return error; 64830f712c9SDave Chinner } 64930f712c9SDave Chinner 65030f712c9SDave Chinner /* 65130f712c9SDave Chinner * Internal block lookup routine. 65230f712c9SDave Chinner */ 65330f712c9SDave Chinner static int /* error */ 65430f712c9SDave Chinner xfs_dir2_block_lookup_int( 65530f712c9SDave Chinner xfs_da_args_t *args, /* dir lookup arguments */ 65630f712c9SDave Chinner struct xfs_buf **bpp, /* returned block buffer */ 65730f712c9SDave Chinner int *entno) /* returned entry number */ 65830f712c9SDave Chinner { 65930f712c9SDave Chinner xfs_dir2_dataptr_t addr; /* data entry address */ 66030f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 66130f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ 66230f712c9SDave Chinner struct xfs_buf *bp; /* block buffer */ 66330f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block tail */ 66430f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* block data entry */ 66530f712c9SDave Chinner xfs_inode_t *dp; /* incore inode */ 66630f712c9SDave Chinner int error; /* error return value */ 66730f712c9SDave Chinner xfs_dahash_t hash; /* found hash value */ 66830f712c9SDave Chinner int high; /* binary search high index */ 66930f712c9SDave Chinner int low; /* binary search low index */ 67030f712c9SDave Chinner int mid; /* binary search current idx */ 67130f712c9SDave Chinner xfs_mount_t *mp; /* filesystem mount point */ 67230f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 67330f712c9SDave Chinner enum xfs_dacmp cmp; /* comparison result */ 67430f712c9SDave Chinner 67530f712c9SDave Chinner dp = args->dp; 67630f712c9SDave Chinner tp = args->trans; 67730f712c9SDave Chinner mp = dp->i_mount; 67830f712c9SDave Chinner 67930f712c9SDave Chinner error = xfs_dir3_block_read(tp, dp, &bp); 68030f712c9SDave Chinner if (error) 68130f712c9SDave Chinner return error; 68230f712c9SDave Chinner 68330f712c9SDave Chinner hdr = bp->b_addr; 68430f712c9SDave Chinner xfs_dir3_data_check(dp, bp); 68530f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 68630f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 68730f712c9SDave Chinner /* 68830f712c9SDave Chinner * Loop doing a binary search for our hash value. 68930f712c9SDave Chinner * Find our entry, ENOENT if it's not there. 69030f712c9SDave Chinner */ 69130f712c9SDave Chinner for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { 69230f712c9SDave Chinner ASSERT(low <= high); 69330f712c9SDave Chinner mid = (low + high) >> 1; 69430f712c9SDave Chinner if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) 69530f712c9SDave Chinner break; 69630f712c9SDave Chinner if (hash < args->hashval) 69730f712c9SDave Chinner low = mid + 1; 69830f712c9SDave Chinner else 69930f712c9SDave Chinner high = mid - 1; 70030f712c9SDave Chinner if (low > high) { 70130f712c9SDave Chinner ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); 70230f712c9SDave Chinner xfs_trans_brelse(tp, bp); 7032451337dSDave Chinner return -ENOENT; 70430f712c9SDave Chinner } 70530f712c9SDave Chinner } 70630f712c9SDave Chinner /* 70730f712c9SDave Chinner * Back up to the first one with the right hash value. 70830f712c9SDave Chinner */ 70930f712c9SDave Chinner while (mid > 0 && be32_to_cpu(blp[mid - 1].hashval) == args->hashval) { 71030f712c9SDave Chinner mid--; 71130f712c9SDave Chinner } 71230f712c9SDave Chinner /* 71330f712c9SDave Chinner * Now loop forward through all the entries with the 71430f712c9SDave Chinner * right hash value looking for our name. 71530f712c9SDave Chinner */ 71630f712c9SDave Chinner do { 71730f712c9SDave Chinner if ((addr = be32_to_cpu(blp[mid].address)) == XFS_DIR2_NULL_DATAPTR) 71830f712c9SDave Chinner continue; 71930f712c9SDave Chinner /* 72030f712c9SDave Chinner * Get pointer to the entry from the leaf. 72130f712c9SDave Chinner */ 72230f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *) 72330f712c9SDave Chinner ((char *)hdr + xfs_dir2_dataptr_to_off(args->geo, addr)); 72430f712c9SDave Chinner /* 72530f712c9SDave Chinner * Compare name and if it's an exact match, return the index 72630f712c9SDave Chinner * and buffer. If it's the first case-insensitive match, store 72730f712c9SDave Chinner * the index and buffer and continue looking for an exact match. 72830f712c9SDave Chinner */ 72930f712c9SDave Chinner cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen); 73030f712c9SDave Chinner if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) { 73130f712c9SDave Chinner args->cmpresult = cmp; 73230f712c9SDave Chinner *bpp = bp; 73330f712c9SDave Chinner *entno = mid; 73430f712c9SDave Chinner if (cmp == XFS_CMP_EXACT) 73530f712c9SDave Chinner return 0; 73630f712c9SDave Chinner } 73730f712c9SDave Chinner } while (++mid < be32_to_cpu(btp->count) && 73830f712c9SDave Chinner be32_to_cpu(blp[mid].hashval) == hash); 73930f712c9SDave Chinner 74030f712c9SDave Chinner ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); 74130f712c9SDave Chinner /* 74230f712c9SDave Chinner * Here, we can only be doing a lookup (not a rename or replace). 74330f712c9SDave Chinner * If a case-insensitive match was found earlier, return success. 74430f712c9SDave Chinner */ 74530f712c9SDave Chinner if (args->cmpresult == XFS_CMP_CASE) 74630f712c9SDave Chinner return 0; 74730f712c9SDave Chinner /* 74830f712c9SDave Chinner * No match, release the buffer and return ENOENT. 74930f712c9SDave Chinner */ 75030f712c9SDave Chinner xfs_trans_brelse(tp, bp); 7512451337dSDave Chinner return -ENOENT; 75230f712c9SDave Chinner } 75330f712c9SDave Chinner 75430f712c9SDave Chinner /* 75530f712c9SDave Chinner * Remove an entry from a block format directory. 75630f712c9SDave Chinner * If that makes the block small enough to fit in shortform, transform it. 75730f712c9SDave Chinner */ 75830f712c9SDave Chinner int /* error */ 75930f712c9SDave Chinner xfs_dir2_block_removename( 76030f712c9SDave Chinner xfs_da_args_t *args) /* directory operation args */ 76130f712c9SDave Chinner { 76230f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 76330f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */ 76430f712c9SDave Chinner struct xfs_buf *bp; /* block buffer */ 76530f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block tail */ 76630f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* block data entry */ 76730f712c9SDave Chinner xfs_inode_t *dp; /* incore inode */ 76830f712c9SDave Chinner int ent; /* block leaf entry index */ 76930f712c9SDave Chinner int error; /* error return value */ 77030f712c9SDave Chinner int needlog; /* need to log block header */ 77130f712c9SDave Chinner int needscan; /* need to fixup bestfree */ 77230f712c9SDave Chinner xfs_dir2_sf_hdr_t sfh; /* shortform header */ 77330f712c9SDave Chinner int size; /* shortform size */ 77430f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 77530f712c9SDave Chinner 77630f712c9SDave Chinner trace_xfs_dir2_block_removename(args); 77730f712c9SDave Chinner 77830f712c9SDave Chinner /* 77930f712c9SDave Chinner * Look up the entry in the block. Gets the buffer and entry index. 78030f712c9SDave Chinner * It will always be there, the vnodeops level does a lookup first. 78130f712c9SDave Chinner */ 78230f712c9SDave Chinner if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { 78330f712c9SDave Chinner return error; 78430f712c9SDave Chinner } 78530f712c9SDave Chinner dp = args->dp; 78630f712c9SDave Chinner tp = args->trans; 78730f712c9SDave Chinner hdr = bp->b_addr; 78830f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 78930f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 79030f712c9SDave Chinner /* 79130f712c9SDave Chinner * Point to the data entry using the leaf entry. 79230f712c9SDave Chinner */ 79330f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)((char *)hdr + 79430f712c9SDave Chinner xfs_dir2_dataptr_to_off(args->geo, 79530f712c9SDave Chinner be32_to_cpu(blp[ent].address))); 79630f712c9SDave Chinner /* 79730f712c9SDave Chinner * Mark the data entry's space free. 79830f712c9SDave Chinner */ 79930f712c9SDave Chinner needlog = needscan = 0; 80030f712c9SDave Chinner xfs_dir2_data_make_free(args, bp, 80130f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr), 80230f712c9SDave Chinner dp->d_ops->data_entsize(dep->namelen), &needlog, &needscan); 80330f712c9SDave Chinner /* 80430f712c9SDave Chinner * Fix up the block tail. 80530f712c9SDave Chinner */ 80630f712c9SDave Chinner be32_add_cpu(&btp->stale, 1); 80730f712c9SDave Chinner xfs_dir2_block_log_tail(tp, bp); 80830f712c9SDave Chinner /* 80930f712c9SDave Chinner * Remove the leaf entry by marking it stale. 81030f712c9SDave Chinner */ 81130f712c9SDave Chinner blp[ent].address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); 81230f712c9SDave Chinner xfs_dir2_block_log_leaf(tp, bp, ent, ent); 81330f712c9SDave Chinner /* 81430f712c9SDave Chinner * Fix up bestfree, log the header if necessary. 81530f712c9SDave Chinner */ 81630f712c9SDave Chinner if (needscan) 81730f712c9SDave Chinner xfs_dir2_data_freescan(dp, hdr, &needlog); 81830f712c9SDave Chinner if (needlog) 81930f712c9SDave Chinner xfs_dir2_data_log_header(args, bp); 82030f712c9SDave Chinner xfs_dir3_data_check(dp, bp); 82130f712c9SDave Chinner /* 82230f712c9SDave Chinner * See if the size as a shortform is good enough. 82330f712c9SDave Chinner */ 82430f712c9SDave Chinner size = xfs_dir2_block_sfsize(dp, hdr, &sfh); 82530f712c9SDave Chinner if (size > XFS_IFORK_DSIZE(dp)) 82630f712c9SDave Chinner return 0; 82730f712c9SDave Chinner 82830f712c9SDave Chinner /* 82930f712c9SDave Chinner * If it works, do the conversion. 83030f712c9SDave Chinner */ 83130f712c9SDave Chinner return xfs_dir2_block_to_sf(args, bp, size, &sfh); 83230f712c9SDave Chinner } 83330f712c9SDave Chinner 83430f712c9SDave Chinner /* 83530f712c9SDave Chinner * Replace an entry in a V2 block directory. 83630f712c9SDave Chinner * Change the inode number to the new value. 83730f712c9SDave Chinner */ 83830f712c9SDave Chinner int /* error */ 83930f712c9SDave Chinner xfs_dir2_block_replace( 84030f712c9SDave Chinner xfs_da_args_t *args) /* directory operation args */ 84130f712c9SDave Chinner { 84230f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 84330f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ 84430f712c9SDave Chinner struct xfs_buf *bp; /* block buffer */ 84530f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block tail */ 84630f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* block data entry */ 84730f712c9SDave Chinner xfs_inode_t *dp; /* incore inode */ 84830f712c9SDave Chinner int ent; /* leaf entry index */ 84930f712c9SDave Chinner int error; /* error return value */ 85030f712c9SDave Chinner 85130f712c9SDave Chinner trace_xfs_dir2_block_replace(args); 85230f712c9SDave Chinner 85330f712c9SDave Chinner /* 85430f712c9SDave Chinner * Lookup the entry in the directory. Get buffer and entry index. 85530f712c9SDave Chinner * This will always succeed since the caller has already done a lookup. 85630f712c9SDave Chinner */ 85730f712c9SDave Chinner if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { 85830f712c9SDave Chinner return error; 85930f712c9SDave Chinner } 86030f712c9SDave Chinner dp = args->dp; 86130f712c9SDave Chinner hdr = bp->b_addr; 86230f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 86330f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 86430f712c9SDave Chinner /* 86530f712c9SDave Chinner * Point to the data entry we need to change. 86630f712c9SDave Chinner */ 86730f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)((char *)hdr + 86830f712c9SDave Chinner xfs_dir2_dataptr_to_off(args->geo, 86930f712c9SDave Chinner be32_to_cpu(blp[ent].address))); 87030f712c9SDave Chinner ASSERT(be64_to_cpu(dep->inumber) != args->inumber); 87130f712c9SDave Chinner /* 87230f712c9SDave Chinner * Change the inode number to the new value. 87330f712c9SDave Chinner */ 87430f712c9SDave Chinner dep->inumber = cpu_to_be64(args->inumber); 87530f712c9SDave Chinner dp->d_ops->data_put_ftype(dep, args->filetype); 87630f712c9SDave Chinner xfs_dir2_data_log_entry(args, bp, dep); 87730f712c9SDave Chinner xfs_dir3_data_check(dp, bp); 87830f712c9SDave Chinner return 0; 87930f712c9SDave Chinner } 88030f712c9SDave Chinner 88130f712c9SDave Chinner /* 88230f712c9SDave Chinner * Qsort comparison routine for the block leaf entries. 88330f712c9SDave Chinner */ 88430f712c9SDave Chinner static int /* sort order */ 88530f712c9SDave Chinner xfs_dir2_block_sort( 88630f712c9SDave Chinner const void *a, /* first leaf entry */ 88730f712c9SDave Chinner const void *b) /* second leaf entry */ 88830f712c9SDave Chinner { 88930f712c9SDave Chinner const xfs_dir2_leaf_entry_t *la; /* first leaf entry */ 89030f712c9SDave Chinner const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */ 89130f712c9SDave Chinner 89230f712c9SDave Chinner la = a; 89330f712c9SDave Chinner lb = b; 89430f712c9SDave Chinner return be32_to_cpu(la->hashval) < be32_to_cpu(lb->hashval) ? -1 : 89530f712c9SDave Chinner (be32_to_cpu(la->hashval) > be32_to_cpu(lb->hashval) ? 1 : 0); 89630f712c9SDave Chinner } 89730f712c9SDave Chinner 89830f712c9SDave Chinner /* 89930f712c9SDave Chinner * Convert a V2 leaf directory to a V2 block directory if possible. 90030f712c9SDave Chinner */ 90130f712c9SDave Chinner int /* error */ 90230f712c9SDave Chinner xfs_dir2_leaf_to_block( 90330f712c9SDave Chinner xfs_da_args_t *args, /* operation arguments */ 90430f712c9SDave Chinner struct xfs_buf *lbp, /* leaf buffer */ 90530f712c9SDave Chinner struct xfs_buf *dbp) /* data buffer */ 90630f712c9SDave Chinner { 90730f712c9SDave Chinner __be16 *bestsp; /* leaf bests table */ 90830f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 90930f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block tail */ 91030f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 91130f712c9SDave Chinner xfs_dir2_data_unused_t *dup; /* unused data entry */ 91230f712c9SDave Chinner int error; /* error return value */ 91330f712c9SDave Chinner int from; /* leaf from index */ 91430f712c9SDave Chinner xfs_dir2_leaf_t *leaf; /* leaf structure */ 91530f712c9SDave Chinner xfs_dir2_leaf_entry_t *lep; /* leaf entry */ 91630f712c9SDave Chinner xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ 91730f712c9SDave Chinner xfs_mount_t *mp; /* file system mount point */ 91830f712c9SDave Chinner int needlog; /* need to log data header */ 91930f712c9SDave Chinner int needscan; /* need to scan for bestfree */ 92030f712c9SDave Chinner xfs_dir2_sf_hdr_t sfh; /* shortform header */ 92130f712c9SDave Chinner int size; /* bytes used */ 92230f712c9SDave Chinner __be16 *tagp; /* end of entry (tag) */ 92330f712c9SDave Chinner int to; /* block/leaf to index */ 92430f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 92530f712c9SDave Chinner struct xfs_dir2_leaf_entry *ents; 92630f712c9SDave Chinner struct xfs_dir3_icleaf_hdr leafhdr; 92730f712c9SDave Chinner 92830f712c9SDave Chinner trace_xfs_dir2_leaf_to_block(args); 92930f712c9SDave Chinner 93030f712c9SDave Chinner dp = args->dp; 93130f712c9SDave Chinner tp = args->trans; 93230f712c9SDave Chinner mp = dp->i_mount; 93330f712c9SDave Chinner leaf = lbp->b_addr; 93430f712c9SDave Chinner dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); 93530f712c9SDave Chinner ents = dp->d_ops->leaf_ents_p(leaf); 93630f712c9SDave Chinner ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); 93730f712c9SDave Chinner 93830f712c9SDave Chinner ASSERT(leafhdr.magic == XFS_DIR2_LEAF1_MAGIC || 93930f712c9SDave Chinner leafhdr.magic == XFS_DIR3_LEAF1_MAGIC); 94030f712c9SDave Chinner /* 94130f712c9SDave Chinner * If there are data blocks other than the first one, take this 94230f712c9SDave Chinner * opportunity to remove trailing empty data blocks that may have 94330f712c9SDave Chinner * been left behind during no-space-reservation operations. 94430f712c9SDave Chinner * These will show up in the leaf bests table. 94530f712c9SDave Chinner */ 94630f712c9SDave Chinner while (dp->i_d.di_size > args->geo->blksize) { 94730f712c9SDave Chinner int hdrsz; 94830f712c9SDave Chinner 94930f712c9SDave Chinner hdrsz = dp->d_ops->data_entry_offset; 95030f712c9SDave Chinner bestsp = xfs_dir2_leaf_bests_p(ltp); 95130f712c9SDave Chinner if (be16_to_cpu(bestsp[be32_to_cpu(ltp->bestcount) - 1]) == 95230f712c9SDave Chinner args->geo->blksize - hdrsz) { 95330f712c9SDave Chinner if ((error = 95430f712c9SDave Chinner xfs_dir2_leaf_trim_data(args, lbp, 95530f712c9SDave Chinner (xfs_dir2_db_t)(be32_to_cpu(ltp->bestcount) - 1)))) 95630f712c9SDave Chinner return error; 95730f712c9SDave Chinner } else 95830f712c9SDave Chinner return 0; 95930f712c9SDave Chinner } 96030f712c9SDave Chinner /* 96130f712c9SDave Chinner * Read the data block if we don't already have it, give up if it fails. 96230f712c9SDave Chinner */ 96330f712c9SDave Chinner if (!dbp) { 96430f712c9SDave Chinner error = xfs_dir3_data_read(tp, dp, args->geo->datablk, -1, &dbp); 96530f712c9SDave Chinner if (error) 96630f712c9SDave Chinner return error; 96730f712c9SDave Chinner } 96830f712c9SDave Chinner hdr = dbp->b_addr; 96930f712c9SDave Chinner ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || 97030f712c9SDave Chinner hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)); 97130f712c9SDave Chinner 97230f712c9SDave Chinner /* 97330f712c9SDave Chinner * Size of the "leaf" area in the block. 97430f712c9SDave Chinner */ 97530f712c9SDave Chinner size = (uint)sizeof(xfs_dir2_block_tail_t) + 97630f712c9SDave Chinner (uint)sizeof(*lep) * (leafhdr.count - leafhdr.stale); 97730f712c9SDave Chinner /* 97830f712c9SDave Chinner * Look at the last data entry. 97930f712c9SDave Chinner */ 98030f712c9SDave Chinner tagp = (__be16 *)((char *)hdr + args->geo->blksize) - 1; 98130f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp)); 98230f712c9SDave Chinner /* 98330f712c9SDave Chinner * If it's not free or is too short we can't do it. 98430f712c9SDave Chinner */ 98530f712c9SDave Chinner if (be16_to_cpu(dup->freetag) != XFS_DIR2_DATA_FREE_TAG || 98630f712c9SDave Chinner be16_to_cpu(dup->length) < size) 98730f712c9SDave Chinner return 0; 98830f712c9SDave Chinner 98930f712c9SDave Chinner /* 99030f712c9SDave Chinner * Start converting it to block form. 99130f712c9SDave Chinner */ 99230f712c9SDave Chinner xfs_dir3_block_init(mp, tp, dbp, dp); 99330f712c9SDave Chinner 99430f712c9SDave Chinner needlog = 1; 99530f712c9SDave Chinner needscan = 0; 99630f712c9SDave Chinner /* 99730f712c9SDave Chinner * Use up the space at the end of the block (blp/btp). 99830f712c9SDave Chinner */ 99930f712c9SDave Chinner xfs_dir2_data_use_free(args, dbp, dup, args->geo->blksize - size, size, 100030f712c9SDave Chinner &needlog, &needscan); 100130f712c9SDave Chinner /* 100230f712c9SDave Chinner * Initialize the block tail. 100330f712c9SDave Chinner */ 100430f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 100530f712c9SDave Chinner btp->count = cpu_to_be32(leafhdr.count - leafhdr.stale); 100630f712c9SDave Chinner btp->stale = 0; 100730f712c9SDave Chinner xfs_dir2_block_log_tail(tp, dbp); 100830f712c9SDave Chinner /* 100930f712c9SDave Chinner * Initialize the block leaf area. We compact out stale entries. 101030f712c9SDave Chinner */ 101130f712c9SDave Chinner lep = xfs_dir2_block_leaf_p(btp); 101230f712c9SDave Chinner for (from = to = 0; from < leafhdr.count; from++) { 101330f712c9SDave Chinner if (ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) 101430f712c9SDave Chinner continue; 101530f712c9SDave Chinner lep[to++] = ents[from]; 101630f712c9SDave Chinner } 101730f712c9SDave Chinner ASSERT(to == be32_to_cpu(btp->count)); 101830f712c9SDave Chinner xfs_dir2_block_log_leaf(tp, dbp, 0, be32_to_cpu(btp->count) - 1); 101930f712c9SDave Chinner /* 102030f712c9SDave Chinner * Scan the bestfree if we need it and log the data block header. 102130f712c9SDave Chinner */ 102230f712c9SDave Chinner if (needscan) 102330f712c9SDave Chinner xfs_dir2_data_freescan(dp, hdr, &needlog); 102430f712c9SDave Chinner if (needlog) 102530f712c9SDave Chinner xfs_dir2_data_log_header(args, dbp); 102630f712c9SDave Chinner /* 102730f712c9SDave Chinner * Pitch the old leaf block. 102830f712c9SDave Chinner */ 102930f712c9SDave Chinner error = xfs_da_shrink_inode(args, args->geo->leafblk, lbp); 103030f712c9SDave Chinner if (error) 103130f712c9SDave Chinner return error; 103230f712c9SDave Chinner 103330f712c9SDave Chinner /* 103430f712c9SDave Chinner * Now see if the resulting block can be shrunken to shortform. 103530f712c9SDave Chinner */ 103630f712c9SDave Chinner size = xfs_dir2_block_sfsize(dp, hdr, &sfh); 103730f712c9SDave Chinner if (size > XFS_IFORK_DSIZE(dp)) 103830f712c9SDave Chinner return 0; 103930f712c9SDave Chinner 104030f712c9SDave Chinner return xfs_dir2_block_to_sf(args, dbp, size, &sfh); 104130f712c9SDave Chinner } 104230f712c9SDave Chinner 104330f712c9SDave Chinner /* 104430f712c9SDave Chinner * Convert the shortform directory to block form. 104530f712c9SDave Chinner */ 104630f712c9SDave Chinner int /* error */ 104730f712c9SDave Chinner xfs_dir2_sf_to_block( 104830f712c9SDave Chinner xfs_da_args_t *args) /* operation arguments */ 104930f712c9SDave Chinner { 105030f712c9SDave Chinner xfs_dir2_db_t blkno; /* dir-relative block # (0) */ 105130f712c9SDave Chinner xfs_dir2_data_hdr_t *hdr; /* block header */ 105230f712c9SDave Chinner xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ 105330f712c9SDave Chinner struct xfs_buf *bp; /* block buffer */ 105430f712c9SDave Chinner xfs_dir2_block_tail_t *btp; /* block tail pointer */ 105530f712c9SDave Chinner xfs_dir2_data_entry_t *dep; /* data entry pointer */ 105630f712c9SDave Chinner xfs_inode_t *dp; /* incore directory inode */ 105730f712c9SDave Chinner int dummy; /* trash */ 105830f712c9SDave Chinner xfs_dir2_data_unused_t *dup; /* unused entry pointer */ 105930f712c9SDave Chinner int endoffset; /* end of data objects */ 106030f712c9SDave Chinner int error; /* error return value */ 106130f712c9SDave Chinner int i; /* index */ 106230f712c9SDave Chinner xfs_mount_t *mp; /* filesystem mount point */ 106330f712c9SDave Chinner int needlog; /* need to log block header */ 106430f712c9SDave Chinner int needscan; /* need to scan block freespc */ 106530f712c9SDave Chinner int newoffset; /* offset from current entry */ 106630f712c9SDave Chinner int offset; /* target block offset */ 106730f712c9SDave Chinner xfs_dir2_sf_entry_t *sfep; /* sf entry pointer */ 106830f712c9SDave Chinner xfs_dir2_sf_hdr_t *oldsfp; /* old shortform header */ 106930f712c9SDave Chinner xfs_dir2_sf_hdr_t *sfp; /* shortform header */ 107030f712c9SDave Chinner __be16 *tagp; /* end of data entry */ 107130f712c9SDave Chinner xfs_trans_t *tp; /* transaction pointer */ 107230f712c9SDave Chinner struct xfs_name name; 107330f712c9SDave Chinner struct xfs_ifork *ifp; 107430f712c9SDave Chinner 107530f712c9SDave Chinner trace_xfs_dir2_sf_to_block(args); 107630f712c9SDave Chinner 107730f712c9SDave Chinner dp = args->dp; 107830f712c9SDave Chinner tp = args->trans; 107930f712c9SDave Chinner mp = dp->i_mount; 108030f712c9SDave Chinner ifp = XFS_IFORK_PTR(dp, XFS_DATA_FORK); 108130f712c9SDave Chinner ASSERT(ifp->if_flags & XFS_IFINLINE); 108230f712c9SDave Chinner /* 108330f712c9SDave Chinner * Bomb out if the shortform directory is way too short. 108430f712c9SDave Chinner */ 108530f712c9SDave Chinner if (dp->i_d.di_size < offsetof(xfs_dir2_sf_hdr_t, parent)) { 108630f712c9SDave Chinner ASSERT(XFS_FORCED_SHUTDOWN(mp)); 10872451337dSDave Chinner return -EIO; 108830f712c9SDave Chinner } 108930f712c9SDave Chinner 109030f712c9SDave Chinner oldsfp = (xfs_dir2_sf_hdr_t *)ifp->if_u1.if_data; 109130f712c9SDave Chinner 109230f712c9SDave Chinner ASSERT(ifp->if_bytes == dp->i_d.di_size); 109330f712c9SDave Chinner ASSERT(ifp->if_u1.if_data != NULL); 109430f712c9SDave Chinner ASSERT(dp->i_d.di_size >= xfs_dir2_sf_hdr_size(oldsfp->i8count)); 109530f712c9SDave Chinner ASSERT(dp->i_d.di_nextents == 0); 109630f712c9SDave Chinner 109730f712c9SDave Chinner /* 109830f712c9SDave Chinner * Copy the directory into a temporary buffer. 109930f712c9SDave Chinner * Then pitch the incore inode data so we can make extents. 110030f712c9SDave Chinner */ 110130f712c9SDave Chinner sfp = kmem_alloc(ifp->if_bytes, KM_SLEEP); 110230f712c9SDave Chinner memcpy(sfp, oldsfp, ifp->if_bytes); 110330f712c9SDave Chinner 110430f712c9SDave Chinner xfs_idata_realloc(dp, -ifp->if_bytes, XFS_DATA_FORK); 110530f712c9SDave Chinner xfs_bmap_local_to_extents_empty(dp, XFS_DATA_FORK); 110630f712c9SDave Chinner dp->i_d.di_size = 0; 110730f712c9SDave Chinner 110830f712c9SDave Chinner /* 110930f712c9SDave Chinner * Add block 0 to the inode. 111030f712c9SDave Chinner */ 111130f712c9SDave Chinner error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, &blkno); 111230f712c9SDave Chinner if (error) { 111330f712c9SDave Chinner kmem_free(sfp); 111430f712c9SDave Chinner return error; 111530f712c9SDave Chinner } 111630f712c9SDave Chinner /* 111730f712c9SDave Chinner * Initialize the data block, then convert it to block format. 111830f712c9SDave Chinner */ 111930f712c9SDave Chinner error = xfs_dir3_data_init(args, blkno, &bp); 112030f712c9SDave Chinner if (error) { 112130f712c9SDave Chinner kmem_free(sfp); 112230f712c9SDave Chinner return error; 112330f712c9SDave Chinner } 112430f712c9SDave Chinner xfs_dir3_block_init(mp, tp, bp, dp); 112530f712c9SDave Chinner hdr = bp->b_addr; 112630f712c9SDave Chinner 112730f712c9SDave Chinner /* 112830f712c9SDave Chinner * Compute size of block "tail" area. 112930f712c9SDave Chinner */ 113030f712c9SDave Chinner i = (uint)sizeof(*btp) + 113130f712c9SDave Chinner (sfp->count + 2) * (uint)sizeof(xfs_dir2_leaf_entry_t); 113230f712c9SDave Chinner /* 113330f712c9SDave Chinner * The whole thing is initialized to free by the init routine. 113430f712c9SDave Chinner * Say we're using the leaf and tail area. 113530f712c9SDave Chinner */ 113630f712c9SDave Chinner dup = dp->d_ops->data_unused_p(hdr); 113730f712c9SDave Chinner needlog = needscan = 0; 113830f712c9SDave Chinner xfs_dir2_data_use_free(args, bp, dup, args->geo->blksize - i, 113930f712c9SDave Chinner i, &needlog, &needscan); 114030f712c9SDave Chinner ASSERT(needscan == 0); 114130f712c9SDave Chinner /* 114230f712c9SDave Chinner * Fill in the tail. 114330f712c9SDave Chinner */ 114430f712c9SDave Chinner btp = xfs_dir2_block_tail_p(args->geo, hdr); 114530f712c9SDave Chinner btp->count = cpu_to_be32(sfp->count + 2); /* ., .. */ 114630f712c9SDave Chinner btp->stale = 0; 114730f712c9SDave Chinner blp = xfs_dir2_block_leaf_p(btp); 114830f712c9SDave Chinner endoffset = (uint)((char *)blp - (char *)hdr); 114930f712c9SDave Chinner /* 115030f712c9SDave Chinner * Remove the freespace, we'll manage it. 115130f712c9SDave Chinner */ 115230f712c9SDave Chinner xfs_dir2_data_use_free(args, bp, dup, 115330f712c9SDave Chinner (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), 115430f712c9SDave Chinner be16_to_cpu(dup->length), &needlog, &needscan); 115530f712c9SDave Chinner /* 115630f712c9SDave Chinner * Create entry for . 115730f712c9SDave Chinner */ 115830f712c9SDave Chinner dep = dp->d_ops->data_dot_entry_p(hdr); 115930f712c9SDave Chinner dep->inumber = cpu_to_be64(dp->i_ino); 116030f712c9SDave Chinner dep->namelen = 1; 116130f712c9SDave Chinner dep->name[0] = '.'; 116230f712c9SDave Chinner dp->d_ops->data_put_ftype(dep, XFS_DIR3_FT_DIR); 116330f712c9SDave Chinner tagp = dp->d_ops->data_entry_tag_p(dep); 116430f712c9SDave Chinner *tagp = cpu_to_be16((char *)dep - (char *)hdr); 116530f712c9SDave Chinner xfs_dir2_data_log_entry(args, bp, dep); 116630f712c9SDave Chinner blp[0].hashval = cpu_to_be32(xfs_dir_hash_dot); 116730f712c9SDave Chinner blp[0].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( 116830f712c9SDave Chinner (char *)dep - (char *)hdr)); 116930f712c9SDave Chinner /* 117030f712c9SDave Chinner * Create entry for .. 117130f712c9SDave Chinner */ 117230f712c9SDave Chinner dep = dp->d_ops->data_dotdot_entry_p(hdr); 117330f712c9SDave Chinner dep->inumber = cpu_to_be64(dp->d_ops->sf_get_parent_ino(sfp)); 117430f712c9SDave Chinner dep->namelen = 2; 117530f712c9SDave Chinner dep->name[0] = dep->name[1] = '.'; 117630f712c9SDave Chinner dp->d_ops->data_put_ftype(dep, XFS_DIR3_FT_DIR); 117730f712c9SDave Chinner tagp = dp->d_ops->data_entry_tag_p(dep); 117830f712c9SDave Chinner *tagp = cpu_to_be16((char *)dep - (char *)hdr); 117930f712c9SDave Chinner xfs_dir2_data_log_entry(args, bp, dep); 118030f712c9SDave Chinner blp[1].hashval = cpu_to_be32(xfs_dir_hash_dotdot); 118130f712c9SDave Chinner blp[1].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( 118230f712c9SDave Chinner (char *)dep - (char *)hdr)); 118330f712c9SDave Chinner offset = dp->d_ops->data_first_offset; 118430f712c9SDave Chinner /* 118530f712c9SDave Chinner * Loop over existing entries, stuff them in. 118630f712c9SDave Chinner */ 118730f712c9SDave Chinner i = 0; 118830f712c9SDave Chinner if (!sfp->count) 118930f712c9SDave Chinner sfep = NULL; 119030f712c9SDave Chinner else 119130f712c9SDave Chinner sfep = xfs_dir2_sf_firstentry(sfp); 119230f712c9SDave Chinner /* 119330f712c9SDave Chinner * Need to preserve the existing offset values in the sf directory. 119430f712c9SDave Chinner * Insert holes (unused entries) where necessary. 119530f712c9SDave Chinner */ 119630f712c9SDave Chinner while (offset < endoffset) { 119730f712c9SDave Chinner /* 119830f712c9SDave Chinner * sfep is null when we reach the end of the list. 119930f712c9SDave Chinner */ 120030f712c9SDave Chinner if (sfep == NULL) 120130f712c9SDave Chinner newoffset = endoffset; 120230f712c9SDave Chinner else 120330f712c9SDave Chinner newoffset = xfs_dir2_sf_get_offset(sfep); 120430f712c9SDave Chinner /* 120530f712c9SDave Chinner * There should be a hole here, make one. 120630f712c9SDave Chinner */ 120730f712c9SDave Chinner if (offset < newoffset) { 120830f712c9SDave Chinner dup = (xfs_dir2_data_unused_t *)((char *)hdr + offset); 120930f712c9SDave Chinner dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); 121030f712c9SDave Chinner dup->length = cpu_to_be16(newoffset - offset); 121130f712c9SDave Chinner *xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16( 121230f712c9SDave Chinner ((char *)dup - (char *)hdr)); 121330f712c9SDave Chinner xfs_dir2_data_log_unused(args, bp, dup); 121430f712c9SDave Chinner xfs_dir2_data_freeinsert(hdr, 121530f712c9SDave Chinner dp->d_ops->data_bestfree_p(hdr), 121630f712c9SDave Chinner dup, &dummy); 121730f712c9SDave Chinner offset += be16_to_cpu(dup->length); 121830f712c9SDave Chinner continue; 121930f712c9SDave Chinner } 122030f712c9SDave Chinner /* 122130f712c9SDave Chinner * Copy a real entry. 122230f712c9SDave Chinner */ 122330f712c9SDave Chinner dep = (xfs_dir2_data_entry_t *)((char *)hdr + newoffset); 122430f712c9SDave Chinner dep->inumber = cpu_to_be64(dp->d_ops->sf_get_ino(sfp, sfep)); 122530f712c9SDave Chinner dep->namelen = sfep->namelen; 122630f712c9SDave Chinner dp->d_ops->data_put_ftype(dep, dp->d_ops->sf_get_ftype(sfep)); 122730f712c9SDave Chinner memcpy(dep->name, sfep->name, dep->namelen); 122830f712c9SDave Chinner tagp = dp->d_ops->data_entry_tag_p(dep); 122930f712c9SDave Chinner *tagp = cpu_to_be16((char *)dep - (char *)hdr); 123030f712c9SDave Chinner xfs_dir2_data_log_entry(args, bp, dep); 123130f712c9SDave Chinner name.name = sfep->name; 123230f712c9SDave Chinner name.len = sfep->namelen; 123330f712c9SDave Chinner blp[2 + i].hashval = cpu_to_be32(mp->m_dirnameops-> 123430f712c9SDave Chinner hashname(&name)); 123530f712c9SDave Chinner blp[2 + i].address = cpu_to_be32(xfs_dir2_byte_to_dataptr( 123630f712c9SDave Chinner (char *)dep - (char *)hdr)); 123730f712c9SDave Chinner offset = (int)((char *)(tagp + 1) - (char *)hdr); 123830f712c9SDave Chinner if (++i == sfp->count) 123930f712c9SDave Chinner sfep = NULL; 124030f712c9SDave Chinner else 124130f712c9SDave Chinner sfep = dp->d_ops->sf_nextentry(sfp, sfep); 124230f712c9SDave Chinner } 124330f712c9SDave Chinner /* Done with the temporary buffer */ 124430f712c9SDave Chinner kmem_free(sfp); 124530f712c9SDave Chinner /* 124630f712c9SDave Chinner * Sort the leaf entries by hash value. 124730f712c9SDave Chinner */ 124830f712c9SDave Chinner xfs_sort(blp, be32_to_cpu(btp->count), sizeof(*blp), xfs_dir2_block_sort); 124930f712c9SDave Chinner /* 125030f712c9SDave Chinner * Log the leaf entry area and tail. 125130f712c9SDave Chinner * Already logged the header in data_init, ignore needlog. 125230f712c9SDave Chinner */ 125330f712c9SDave Chinner ASSERT(needscan == 0); 125430f712c9SDave Chinner xfs_dir2_block_log_leaf(tp, bp, 0, be32_to_cpu(btp->count) - 1); 125530f712c9SDave Chinner xfs_dir2_block_log_tail(tp, bp); 125630f712c9SDave Chinner xfs_dir3_data_check(dp, bp); 125730f712c9SDave Chinner return 0; 125830f712c9SDave Chinner } 1259