linux/fs/xfs/xfs_ialloc_btree.c
<<
>>
Prefs
   1/*
   2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
   3 * All Rights Reserved.
   4 *
   5 * This program is free software; you can redistribute it and/or
   6 * modify it under the terms of the GNU General Public License as
   7 * published by the Free Software Foundation.
   8 *
   9 * This program is distributed in the hope that it would be useful,
  10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 * GNU General Public License for more details.
  13 *
  14 * You should have received a copy of the GNU General Public License
  15 * along with this program; if not, write the Free Software Foundation,
  16 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
  17 */
  18#include "xfs.h"
  19#include "xfs_fs.h"
  20#include "xfs_types.h"
  21#include "xfs_bit.h"
  22#include "xfs_log.h"
  23#include "xfs_trans.h"
  24#include "xfs_sb.h"
  25#include "xfs_ag.h"
  26#include "xfs_mount.h"
  27#include "xfs_bmap_btree.h"
  28#include "xfs_alloc_btree.h"
  29#include "xfs_ialloc_btree.h"
  30#include "xfs_dinode.h"
  31#include "xfs_inode.h"
  32#include "xfs_btree.h"
  33#include "xfs_ialloc.h"
  34#include "xfs_alloc.h"
  35#include "xfs_error.h"
  36#include "xfs_trace.h"
  37#include "xfs_cksum.h"
  38
  39
  40STATIC int
  41xfs_inobt_get_minrecs(
  42        struct xfs_btree_cur    *cur,
  43        int                     level)
  44{
  45        return cur->bc_mp->m_inobt_mnr[level != 0];
  46}
  47
  48STATIC struct xfs_btree_cur *
  49xfs_inobt_dup_cursor(
  50        struct xfs_btree_cur    *cur)
  51{
  52        return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
  53                        cur->bc_private.a.agbp, cur->bc_private.a.agno);
  54}
  55
  56STATIC void
  57xfs_inobt_set_root(
  58        struct xfs_btree_cur    *cur,
  59        union xfs_btree_ptr     *nptr,
  60        int                     inc)    /* level change */
  61{
  62        struct xfs_buf          *agbp = cur->bc_private.a.agbp;
  63        struct xfs_agi          *agi = XFS_BUF_TO_AGI(agbp);
  64
  65        agi->agi_root = nptr->s;
  66        be32_add_cpu(&agi->agi_level, inc);
  67        xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
  68}
  69
  70STATIC int
  71xfs_inobt_alloc_block(
  72        struct xfs_btree_cur    *cur,
  73        union xfs_btree_ptr     *start,
  74        union xfs_btree_ptr     *new,
  75        int                     length,
  76        int                     *stat)
  77{
  78        xfs_alloc_arg_t         args;           /* block allocation args */
  79        int                     error;          /* error return value */
  80        xfs_agblock_t           sbno = be32_to_cpu(start->s);
  81
  82        XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
  83
  84        memset(&args, 0, sizeof(args));
  85        args.tp = cur->bc_tp;
  86        args.mp = cur->bc_mp;
  87        args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
  88        args.minlen = 1;
  89        args.maxlen = 1;
  90        args.prod = 1;
  91        args.type = XFS_ALLOCTYPE_NEAR_BNO;
  92
  93        error = xfs_alloc_vextent(&args);
  94        if (error) {
  95                XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
  96                return error;
  97        }
  98        if (args.fsbno == NULLFSBLOCK) {
  99                XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
 100                *stat = 0;
 101                return 0;
 102        }
 103        ASSERT(args.len == 1);
 104        XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
 105
 106        new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
 107        *stat = 1;
 108        return 0;
 109}
 110
 111STATIC int
 112xfs_inobt_free_block(
 113        struct xfs_btree_cur    *cur,
 114        struct xfs_buf          *bp)
 115{
 116        xfs_fsblock_t           fsbno;
 117        int                     error;
 118
 119        fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
 120        error = xfs_free_extent(cur->bc_tp, fsbno, 1);
 121        if (error)
 122                return error;
 123
 124        xfs_trans_binval(cur->bc_tp, bp);
 125        return error;
 126}
 127
 128STATIC int
 129xfs_inobt_get_maxrecs(
 130        struct xfs_btree_cur    *cur,
 131        int                     level)
 132{
 133        return cur->bc_mp->m_inobt_mxr[level != 0];
 134}
 135
 136STATIC void
 137xfs_inobt_init_key_from_rec(
 138        union xfs_btree_key     *key,
 139        union xfs_btree_rec     *rec)
 140{
 141        key->inobt.ir_startino = rec->inobt.ir_startino;
 142}
 143
 144STATIC void
 145xfs_inobt_init_rec_from_key(
 146        union xfs_btree_key     *key,
 147        union xfs_btree_rec     *rec)
 148{
 149        rec->inobt.ir_startino = key->inobt.ir_startino;
 150}
 151
 152STATIC void
 153xfs_inobt_init_rec_from_cur(
 154        struct xfs_btree_cur    *cur,
 155        union xfs_btree_rec     *rec)
 156{
 157        rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
 158        rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
 159        rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
 160}
 161
 162/*
 163 * initial value of ptr for lookup
 164 */
 165STATIC void
 166xfs_inobt_init_ptr_from_cur(
 167        struct xfs_btree_cur    *cur,
 168        union xfs_btree_ptr     *ptr)
 169{
 170        struct xfs_agi          *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
 171
 172        ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
 173
 174        ptr->s = agi->agi_root;
 175}
 176
 177STATIC __int64_t
 178xfs_inobt_key_diff(
 179        struct xfs_btree_cur    *cur,
 180        union xfs_btree_key     *key)
 181{
 182        return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
 183                          cur->bc_rec.i.ir_startino;
 184}
 185
 186static int
 187xfs_inobt_verify(
 188        struct xfs_buf          *bp)
 189{
 190        struct xfs_mount        *mp = bp->b_target->bt_mount;
 191        struct xfs_btree_block  *block = XFS_BUF_TO_BLOCK(bp);
 192        struct xfs_perag        *pag = bp->b_pag;
 193        unsigned int            level;
 194
 195        /*
 196         * During growfs operations, we can't verify the exact owner as the
 197         * perag is not fully initialised and hence not attached to the buffer.
 198         *
 199         * Similarly, during log recovery we will have a perag structure
 200         * attached, but the agi information will not yet have been initialised
 201         * from the on disk AGI. We don't currently use any of this information,
 202         * but beware of the landmine (i.e. need to check pag->pagi_init) if we
 203         * ever do.
 204         */
 205        switch (block->bb_magic) {
 206        case cpu_to_be32(XFS_IBT_CRC_MAGIC):
 207                if (!xfs_sb_version_hascrc(&mp->m_sb))
 208                        return false;
 209                if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
 210                        return false;
 211                if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
 212                        return false;
 213                if (pag &&
 214                    be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
 215                        return false;
 216                /* fall through */
 217        case cpu_to_be32(XFS_IBT_MAGIC):
 218                break;
 219        default:
 220                return 0;
 221        }
 222
 223        /* numrecs and level verification */
 224        level = be16_to_cpu(block->bb_level);
 225        if (level >= mp->m_in_maxlevels)
 226                return false;
 227        if (be16_to_cpu(block->bb_numrecs) > mp->m_inobt_mxr[level != 0])
 228                return false;
 229
 230        /* sibling pointer verification */
 231        if (!block->bb_u.s.bb_leftsib ||
 232            (be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
 233             block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
 234                return false;
 235        if (!block->bb_u.s.bb_rightsib ||
 236            (be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
 237             block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
 238                return false;
 239
 240        return true;
 241}
 242
 243static void
 244xfs_inobt_read_verify(
 245        struct xfs_buf  *bp)
 246{
 247        if (!(xfs_btree_sblock_verify_crc(bp) &&
 248              xfs_inobt_verify(bp))) {
 249                trace_xfs_btree_corrupt(bp, _RET_IP_);
 250                XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW,
 251                                     bp->b_target->bt_mount, bp->b_addr);
 252                xfs_buf_ioerror(bp, EFSCORRUPTED);
 253        }
 254}
 255
 256static void
 257xfs_inobt_write_verify(
 258        struct xfs_buf  *bp)
 259{
 260        if (!xfs_inobt_verify(bp)) {
 261                trace_xfs_btree_corrupt(bp, _RET_IP_);
 262                XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW,
 263                                     bp->b_target->bt_mount, bp->b_addr);
 264                xfs_buf_ioerror(bp, EFSCORRUPTED);
 265        }
 266        xfs_btree_sblock_calc_crc(bp);
 267
 268}
 269
 270const struct xfs_buf_ops xfs_inobt_buf_ops = {
 271        .verify_read = xfs_inobt_read_verify,
 272        .verify_write = xfs_inobt_write_verify,
 273};
 274
 275#if defined(DEBUG) || defined(XFS_WARN)
 276STATIC int
 277xfs_inobt_keys_inorder(
 278        struct xfs_btree_cur    *cur,
 279        union xfs_btree_key     *k1,
 280        union xfs_btree_key     *k2)
 281{
 282        return be32_to_cpu(k1->inobt.ir_startino) <
 283                be32_to_cpu(k2->inobt.ir_startino);
 284}
 285
 286STATIC int
 287xfs_inobt_recs_inorder(
 288        struct xfs_btree_cur    *cur,
 289        union xfs_btree_rec     *r1,
 290        union xfs_btree_rec     *r2)
 291{
 292        return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
 293                be32_to_cpu(r2->inobt.ir_startino);
 294}
 295#endif  /* DEBUG */
 296
 297static const struct xfs_btree_ops xfs_inobt_ops = {
 298        .rec_len                = sizeof(xfs_inobt_rec_t),
 299        .key_len                = sizeof(xfs_inobt_key_t),
 300
 301        .dup_cursor             = xfs_inobt_dup_cursor,
 302        .set_root               = xfs_inobt_set_root,
 303        .alloc_block            = xfs_inobt_alloc_block,
 304        .free_block             = xfs_inobt_free_block,
 305        .get_minrecs            = xfs_inobt_get_minrecs,
 306        .get_maxrecs            = xfs_inobt_get_maxrecs,
 307        .init_key_from_rec      = xfs_inobt_init_key_from_rec,
 308        .init_rec_from_key      = xfs_inobt_init_rec_from_key,
 309        .init_rec_from_cur      = xfs_inobt_init_rec_from_cur,
 310        .init_ptr_from_cur      = xfs_inobt_init_ptr_from_cur,
 311        .key_diff               = xfs_inobt_key_diff,
 312        .buf_ops                = &xfs_inobt_buf_ops,
 313#if defined(DEBUG) || defined(XFS_WARN)
 314        .keys_inorder           = xfs_inobt_keys_inorder,
 315        .recs_inorder           = xfs_inobt_recs_inorder,
 316#endif
 317};
 318
 319/*
 320 * Allocate a new inode btree cursor.
 321 */
 322struct xfs_btree_cur *                          /* new inode btree cursor */
 323xfs_inobt_init_cursor(
 324        struct xfs_mount        *mp,            /* file system mount point */
 325        struct xfs_trans        *tp,            /* transaction pointer */
 326        struct xfs_buf          *agbp,          /* buffer for agi structure */
 327        xfs_agnumber_t          agno)           /* allocation group number */
 328{
 329        struct xfs_agi          *agi = XFS_BUF_TO_AGI(agbp);
 330        struct xfs_btree_cur    *cur;
 331
 332        cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
 333
 334        cur->bc_tp = tp;
 335        cur->bc_mp = mp;
 336        cur->bc_nlevels = be32_to_cpu(agi->agi_level);
 337        cur->bc_btnum = XFS_BTNUM_INO;
 338        cur->bc_blocklog = mp->m_sb.sb_blocklog;
 339
 340        cur->bc_ops = &xfs_inobt_ops;
 341        if (xfs_sb_version_hascrc(&mp->m_sb))
 342                cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
 343
 344        cur->bc_private.a.agbp = agbp;
 345        cur->bc_private.a.agno = agno;
 346
 347        return cur;
 348}
 349
 350/*
 351 * Calculate number of records in an inobt btree block.
 352 */
 353int
 354xfs_inobt_maxrecs(
 355        struct xfs_mount        *mp,
 356        int                     blocklen,
 357        int                     leaf)
 358{
 359        blocklen -= XFS_INOBT_BLOCK_LEN(mp);
 360
 361        if (leaf)
 362                return blocklen / sizeof(xfs_inobt_rec_t);
 363        return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
 364}
 365
lxr.linux.no kindly hosted by Redpill Linpro AS, provider of Linux consulting and operations services since 1995.