fs/xfs/libxfs/xfs_ialloc_btree.c

   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_shared.h"
  21 #include "xfs_format.h"
  22 #include "xfs_log_format.h"
  23 #include "xfs_trans_resv.h"
  24 #include "xfs_bit.h"
  25 #include "xfs_sb.h"
  26 #include "xfs_mount.h"
  27 #include "xfs_inode.h"
  28 #include "xfs_btree.h"
  29 #include "xfs_ialloc.h"
  30 #include "xfs_ialloc_btree.h"
  31 #include "xfs_alloc.h"
  32 #include "xfs_error.h"
  33 #include "xfs_trace.h"
  34 #include "xfs_cksum.h"
  35 #include "xfs_trans.h"
  36
  37
  38 STATIC int
  39 xfs_inobt_get_minrecs(
  40         struct xfs_btree_cur    *cur,
  41         int                     level)
  42 {
  43         return cur->bc_mp->m_inobt_mnr[level != 0];
  44 }
  45
  46 STATIC struct xfs_btree_cur *
  47 xfs_inobt_dup_cursor(
  48         struct xfs_btree_cur    *cur)
  49 {
  50         return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
  51                         cur->bc_private.a.agbp, cur->bc_private.a.agno,
  52                         cur->bc_btnum);
  53 }
  54
  55 STATIC void
  56 xfs_inobt_set_root(
  57         struct xfs_btree_cur    *cur,
  58         union xfs_btree_ptr     *nptr,
  59         int                     inc)    /* level change */
  60 {
  61         struct xfs_buf          *agbp = cur->bc_private.a.agbp;
  62         struct xfs_agi          *agi = XFS_BUF_TO_AGI(agbp);
  63
  64         agi->agi_root = nptr->s;
  65         be32_add_cpu(&agi->agi_level, inc);
  66         xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
  67 }
  68
  69 STATIC void
  70 xfs_finobt_set_root(
  71         struct xfs_btree_cur    *cur,
  72         union xfs_btree_ptr     *nptr,
  73         int                     inc)    /* level change */
  74 {
  75         struct xfs_buf          *agbp = cur->bc_private.a.agbp;
  76         struct xfs_agi          *agi = XFS_BUF_TO_AGI(agbp);
  77
  78         agi->agi_free_root = nptr->s;
  79         be32_add_cpu(&agi->agi_free_level, inc);
  80         xfs_ialloc_log_agi(cur->bc_tp, agbp,
  81                            XFS_AGI_FREE_ROOT | XFS_AGI_FREE_LEVEL);
  82 }
  83
  84 STATIC int
  85 xfs_inobt_alloc_block(
  86         struct xfs_btree_cur    *cur,
  87         union xfs_btree_ptr     *start,
  88         union xfs_btree_ptr     *new,
  89         int                     *stat)
  90 {
  91         xfs_alloc_arg_t         args;           /* block allocation args */
  92         int                     error;          /* error return value */
  93         xfs_agblock_t           sbno = be32_to_cpu(start->s);
  94
  95         XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
  96
  97         memset(&args, 0, sizeof(args));
  98         args.tp = cur->bc_tp;
  99         args.mp = cur->bc_mp;
 100         args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
 101         args.minlen = 1;
 102         args.maxlen = 1;
 103         args.prod = 1;
 104         args.type = XFS_ALLOCTYPE_NEAR_BNO;
 105
 106         error = xfs_alloc_vextent(&args);
 107         if (error) {
 108                 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
 109                 return error;
 110         }
 111         if (args.fsbno == NULLFSBLOCK) {
 112                 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
 113                 *stat = 0;
 114                 return 0;
 115         }
 116         ASSERT(args.len == 1);
 117         XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
 118
 119         new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
 120         *stat = 1;
 121         return 0;
 122 }
 123
 124 STATIC int
 125 xfs_inobt_free_block(
 126         struct xfs_btree_cur    *cur,
 127         struct xfs_buf          *bp)
 128 {
 129         xfs_fsblock_t           fsbno;
 130         int                     error;
 131
 132         fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
 133         error = xfs_free_extent(cur->bc_tp, fsbno, 1);
 134         if (error)
 135                 return error;
 136
 137         xfs_trans_binval(cur->bc_tp, bp);
 138         return error;
 139 }
 140
 141 STATIC int
 142 xfs_inobt_get_maxrecs(
 143         struct xfs_btree_cur    *cur,
 144         int                     level)
 145 {
 146         return cur->bc_mp->m_inobt_mxr[level != 0];
 147 }
 148
 149 STATIC void
 150 xfs_inobt_init_key_from_rec(
 151         union xfs_btree_key     *key,
 152         union xfs_btree_rec     *rec)
 153 {
 154         key->inobt.ir_startino = rec->inobt.ir_startino;
 155 }
 156
 157 STATIC void
 158 xfs_inobt_init_rec_from_key(
 159         union xfs_btree_key     *key,
 160         union xfs_btree_rec     *rec)
 161 {
 162         rec->inobt.ir_startino = key->inobt.ir_startino;
 163 }
 164
 165 STATIC void
 166 xfs_inobt_init_rec_from_cur(
 167         struct xfs_btree_cur    *cur,
 168         union xfs_btree_rec     *rec)
 169 {
 170         rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
 171         rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
 172         rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
 173 }
 174
 175 /*
 176  * initial value of ptr for lookup
 177  */
 178 STATIC void
 179 xfs_inobt_init_ptr_from_cur(
 180         struct xfs_btree_cur    *cur,
 181         union xfs_btree_ptr     *ptr)
 182 {
 183         struct xfs_agi          *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
 184
 185         ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
 186
 187         ptr->s = agi->agi_root;
 188 }
 189
 190 STATIC void
 191 xfs_finobt_init_ptr_from_cur(
 192         struct xfs_btree_cur    *cur,
 193         union xfs_btree_ptr     *ptr)
 194 {
 195         struct xfs_agi          *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
 196
 197         ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
 198         ptr->s = agi->agi_free_root;
 199 }
 200
 201 STATIC __int64_t
 202 xfs_inobt_key_diff(
 203         struct xfs_btree_cur    *cur,
 204         union xfs_btree_key     *key)
 205 {
 206         return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
 207                           cur->bc_rec.i.ir_startino;
 208 }
 209
 210 static int
 211 xfs_inobt_verify(
 212         struct xfs_buf          *bp)
 213 {
 214         struct xfs_mount        *mp = bp->b_target->bt_mount;
 215         struct xfs_btree_block  *block = XFS_BUF_TO_BLOCK(bp);
 216         struct xfs_perag        *pag = bp->b_pag;
 217         unsigned int            level;
 218
 219         /*
 220          * During growfs operations, we can't verify the exact owner as the
 221          * perag is not fully initialised and hence not attached to the buffer.
 222          *
 223          * Similarly, during log recovery we will have a perag structure
 224          * attached, but the agi information will not yet have been initialised
 225          * from the on disk AGI. We don't currently use any of this information,
 226          * but beware of the landmine (i.e. need to check pag->pagi_init) if we
 227          * ever do.
 228          */
 229         switch (block->bb_magic) {
 230         case cpu_to_be32(XFS_IBT_CRC_MAGIC):
 231         case cpu_to_be32(XFS_FIBT_CRC_MAGIC):
 232                 if (!xfs_sb_version_hascrc(&mp->m_sb))
 233                         return false;
 234                 if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
 235                         return false;
 236                 if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
 237                         return false;
 238                 if (pag &&
 239                     be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
 240                         return false;
 241                 /* fall through */
 242         case cpu_to_be32(XFS_IBT_MAGIC):
 243         case cpu_to_be32(XFS_FIBT_MAGIC):
 244                 break;
 245         default:
 246                 return 0;
 247         }
 248
 249         /* numrecs and level verification */
 250         level = be16_to_cpu(block->bb_level);
 251         if (level >= mp->m_in_maxlevels)
 252                 return false;
 253         if (be16_to_cpu(block->bb_numrecs) > mp->m_inobt_mxr[level != 0])
 254                 return false;
 255
 256         /* sibling pointer verification */
 257         if (!block->bb_u.s.bb_leftsib ||
 258             (be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
 259              block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
 260                 return false;
 261         if (!block->bb_u.s.bb_rightsib ||
 262             (be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
 263              block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
 264                 return false;
 265
 266         return true;
 267 }
 268
 269 static void
 270 xfs_inobt_read_verify(
 271         struct xfs_buf  *bp)
 272 {
 273         if (!xfs_btree_sblock_verify_crc(bp))
 274                 xfs_buf_ioerror(bp, -EFSBADCRC);
 275         else if (!xfs_inobt_verify(bp))
 276                 xfs_buf_ioerror(bp, -EFSCORRUPTED);
 277
 278         if (bp->b_error) {
 279                 trace_xfs_btree_corrupt(bp, _RET_IP_);
 280                 xfs_verifier_error(bp);
 281         }
 282 }
 283
 284 static void
 285 xfs_inobt_write_verify(
 286         struct xfs_buf  *bp)
 287 {
 288         if (!xfs_inobt_verify(bp)) {
 289                 trace_xfs_btree_corrupt(bp, _RET_IP_);
 290                 xfs_buf_ioerror(bp, -EFSCORRUPTED);
 291                 xfs_verifier_error(bp);
 292                 return;
 293         }
 294         xfs_btree_sblock_calc_crc(bp);
 295
 296 }
 297
 298 const struct xfs_buf_ops xfs_inobt_buf_ops = {
 299         .verify_read = xfs_inobt_read_verify,
 300         .verify_write = xfs_inobt_write_verify,
 301 };
 302
 303 #if defined(DEBUG) || defined(XFS_WARN)
 304 STATIC int
 305 xfs_inobt_keys_inorder(
 306         struct xfs_btree_cur    *cur,
 307         union xfs_btree_key     *k1,
 308         union xfs_btree_key     *k2)
 309 {
 310         return be32_to_cpu(k1->inobt.ir_startino) <
 311                 be32_to_cpu(k2->inobt.ir_startino);
 312 }
 313
 314 STATIC int
 315 xfs_inobt_recs_inorder(
 316         struct xfs_btree_cur    *cur,
 317         union xfs_btree_rec     *r1,
 318         union xfs_btree_rec     *r2)
 319 {
 320         return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
 321                 be32_to_cpu(r2->inobt.ir_startino);
 322 }
 323 #endif  /* DEBUG */
 324
 325 static const struct xfs_btree_ops xfs_inobt_ops = {
 326         .rec_len                = sizeof(xfs_inobt_rec_t),
 327         .key_len                = sizeof(xfs_inobt_key_t),
 328
 329         .dup_cursor             = xfs_inobt_dup_cursor,
 330         .set_root               = xfs_inobt_set_root,
 331         .alloc_block            = xfs_inobt_alloc_block,
 332         .free_block             = xfs_inobt_free_block,
 333         .get_minrecs            = xfs_inobt_get_minrecs,
 334         .get_maxrecs            = xfs_inobt_get_maxrecs,
 335         .init_key_from_rec      = xfs_inobt_init_key_from_rec,
 336         .init_rec_from_key      = xfs_inobt_init_rec_from_key,
 337         .init_rec_from_cur      = xfs_inobt_init_rec_from_cur,
 338         .init_ptr_from_cur      = xfs_inobt_init_ptr_from_cur,
 339         .key_diff               = xfs_inobt_key_diff,
 340         .buf_ops                = &xfs_inobt_buf_ops,
 341 #if defined(DEBUG) || defined(XFS_WARN)
 342         .keys_inorder           = xfs_inobt_keys_inorder,
 343         .recs_inorder           = xfs_inobt_recs_inorder,
 344 #endif
 345 };
 346
 347 static const struct xfs_btree_ops xfs_finobt_ops = {
 348         .rec_len                = sizeof(xfs_inobt_rec_t),
 349         .key_len                = sizeof(xfs_inobt_key_t),
 350
 351         .dup_cursor             = xfs_inobt_dup_cursor,
 352         .set_root               = xfs_finobt_set_root,
 353         .alloc_block            = xfs_inobt_alloc_block,
 354         .free_block             = xfs_inobt_free_block,
 355         .get_minrecs            = xfs_inobt_get_minrecs,
 356         .get_maxrecs            = xfs_inobt_get_maxrecs,
 357         .init_key_from_rec      = xfs_inobt_init_key_from_rec,
 358         .init_rec_from_key      = xfs_inobt_init_rec_from_key,
 359         .init_rec_from_cur      = xfs_inobt_init_rec_from_cur,
 360         .init_ptr_from_cur      = xfs_finobt_init_ptr_from_cur,
 361         .key_diff               = xfs_inobt_key_diff,
 362         .buf_ops                = &xfs_inobt_buf_ops,
 363 #if defined(DEBUG) || defined(XFS_WARN)
 364         .keys_inorder           = xfs_inobt_keys_inorder,
 365         .recs_inorder           = xfs_inobt_recs_inorder,
 366 #endif
 367 };
 368
 369 /*
 370  * Allocate a new inode btree cursor.
 371  */
 372 struct xfs_btree_cur *                          /* new inode btree cursor */
 373 xfs_inobt_init_cursor(
 374         struct xfs_mount        *mp,            /* file system mount point */
 375         struct xfs_trans        *tp,            /* transaction pointer */
 376         struct xfs_buf          *agbp,          /* buffer for agi structure */
 377         xfs_agnumber_t          agno,           /* allocation group number */
 378         xfs_btnum_t             btnum)          /* ialloc or free ino btree */
 379 {
 380         struct xfs_agi          *agi = XFS_BUF_TO_AGI(agbp);
 381         struct xfs_btree_cur    *cur;
 382
 383         cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
 384
 385         cur->bc_tp = tp;
 386         cur->bc_mp = mp;
 387         cur->bc_btnum = btnum;
 388         if (btnum == XFS_BTNUM_INO) {
 389                 cur->bc_nlevels = be32_to_cpu(agi->agi_level);
 390                 cur->bc_ops = &xfs_inobt_ops;
 391         } else {
 392                 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level);
 393                 cur->bc_ops = &xfs_finobt_ops;
 394         }
 395
 396         cur->bc_blocklog = mp->m_sb.sb_blocklog;
 397
 398         if (xfs_sb_version_hascrc(&mp->m_sb))
 399                 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
 400
 401         cur->bc_private.a.agbp = agbp;
 402         cur->bc_private.a.agno = agno;
 403
 404         return cur;
 405 }
 406
 407 /*
 408  * Calculate number of records in an inobt btree block.
 409  */
 410 int
 411 xfs_inobt_maxrecs(
 412         struct xfs_mount        *mp,
 413         int                     blocklen,
 414         int                     leaf)
 415 {
 416         blocklen -= XFS_INOBT_BLOCK_LEN(mp);
 417
 418         if (leaf)
 419                 return blocklen / sizeof(xfs_inobt_rec_t);
 420         return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
 421 }