fs/xfs/xfs_alloc_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_types.h"
  21 #include "xfs_bit.h"
  22 #include "xfs_log.h"
  23 #include "xfs_inum.h"
  24 #include "xfs_trans.h"
  25 #include "xfs_sb.h"
  26 #include "xfs_ag.h"
  27 #include "xfs_mount.h"
  28 #include "xfs_bmap_btree.h"
  29 #include "xfs_alloc_btree.h"
  30 #include "xfs_ialloc_btree.h"
  31 #include "xfs_dinode.h"
  32 #include "xfs_inode.h"
  33 #include "xfs_btree.h"
  34 #include "xfs_btree_trace.h"
  35 #include "xfs_alloc.h"
  36 #include "xfs_error.h"
  37 #include "xfs_trace.h"
  38
  39
  40 STATIC struct xfs_btree_cur *
  41 xfs_allocbt_dup_cursor(
  42         struct xfs_btree_cur    *cur)
  43 {
  44         return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
  45                         cur->bc_private.a.agbp, cur->bc_private.a.agno,
  46                         cur->bc_btnum);
  47 }
  48
  49 STATIC void
  50 xfs_allocbt_set_root(
  51         struct xfs_btree_cur    *cur,
  52         union xfs_btree_ptr     *ptr,
  53         int                     inc)
  54 {
  55         struct xfs_buf          *agbp = cur->bc_private.a.agbp;
  56         struct xfs_agf          *agf = XFS_BUF_TO_AGF(agbp);
  57         xfs_agnumber_t          seqno = be32_to_cpu(agf->agf_seqno);
  58         int                     btnum = cur->bc_btnum;
  59         struct xfs_perag        *pag = xfs_perag_get(cur->bc_mp, seqno);
  60
  61         ASSERT(ptr->s != 0);
  62
  63         agf->agf_roots[btnum] = ptr->s;
  64         be32_add_cpu(&agf->agf_levels[btnum], inc);
  65         pag->pagf_levels[btnum] += inc;
  66         xfs_perag_put(pag);
  67
  68         xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
  69 }
  70
  71 STATIC int
  72 xfs_allocbt_alloc_block(
  73         struct xfs_btree_cur    *cur,
  74         union xfs_btree_ptr     *start,
  75         union xfs_btree_ptr     *new,
  76         int                     length,
  77         int                     *stat)
  78 {
  79         int                     error;
  80         xfs_agblock_t           bno;
  81
  82         XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
  83
  84         /* Allocate the new block from the freelist. If we can't, give up.  */
  85         error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp,
  86                                        &bno, 1);
  87         if (error) {
  88                 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
  89                 return error;
  90         }
  91
  92         if (bno == NULLAGBLOCK) {
  93                 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
  94                 *stat = 0;
  95                 return 0;
  96         }
  97
  98         xfs_alloc_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false);
  99
 100         xfs_trans_agbtree_delta(cur->bc_tp, 1);
 101         new->s = cpu_to_be32(bno);
 102
 103         XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
 104         *stat = 1;
 105         return 0;
 106 }
 107
 108 STATIC int
 109 xfs_allocbt_free_block(
 110         struct xfs_btree_cur    *cur,
 111         struct xfs_buf          *bp)
 112 {
 113         struct xfs_buf          *agbp = cur->bc_private.a.agbp;
 114         struct xfs_agf          *agf = XFS_BUF_TO_AGF(agbp);
 115         xfs_agblock_t           bno;
 116         int                     error;
 117
 118         bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
 119         error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
 120         if (error)
 121                 return error;
 122
 123         xfs_alloc_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1,
 124                               XFS_ALLOC_BUSY_SKIP_DISCARD);
 125         xfs_trans_agbtree_delta(cur->bc_tp, -1);
 126         return 0;
 127 }
 128
 129 /*
 130  * Update the longest extent in the AGF
 131  */
 132 STATIC void
 133 xfs_allocbt_update_lastrec(
 134         struct xfs_btree_cur    *cur,
 135         struct xfs_btree_block  *block,
 136         union xfs_btree_rec     *rec,
 137         int                     ptr,
 138         int                     reason)
 139 {
 140         struct xfs_agf          *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
 141         xfs_agnumber_t          seqno = be32_to_cpu(agf->agf_seqno);
 142         struct xfs_perag        *pag;
 143         __be32                  len;
 144         int                     numrecs;
 145
 146         ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
 147
 148         switch (reason) {
 149         case LASTREC_UPDATE:
 150                 /*
 151                  * If this is the last leaf block and it's the last record,
 152                  * then update the size of the longest extent in the AG.
 153                  */
 154                 if (ptr != xfs_btree_get_numrecs(block))
 155                         return;
 156                 len = rec->alloc.ar_blockcount;
 157                 break;
 158         case LASTREC_INSREC:
 159                 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
 160                     be32_to_cpu(agf->agf_longest))
 161                         return;
 162                 len = rec->alloc.ar_blockcount;
 163                 break;
 164         case LASTREC_DELREC:
 165                 numrecs = xfs_btree_get_numrecs(block);
 166                 if (ptr <= numrecs)
 167                         return;
 168                 ASSERT(ptr == numrecs + 1);
 169
 170                 if (numrecs) {
 171                         xfs_alloc_rec_t *rrp;
 172
 173                         rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
 174                         len = rrp->ar_blockcount;
 175                 } else {
 176                         len = 0;
 177                 }
 178
 179                 break;
 180         default:
 181                 ASSERT(0);
 182                 return;
 183         }
 184
 185         agf->agf_longest = len;
 186         pag = xfs_perag_get(cur->bc_mp, seqno);
 187         pag->pagf_longest = be32_to_cpu(len);
 188         xfs_perag_put(pag);
 189         xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
 190 }
 191
 192 STATIC int
 193 xfs_allocbt_get_minrecs(
 194         struct xfs_btree_cur    *cur,
 195         int                     level)
 196 {
 197         return cur->bc_mp->m_alloc_mnr[level != 0];
 198 }
 199
 200 STATIC int
 201 xfs_allocbt_get_maxrecs(
 202         struct xfs_btree_cur    *cur,
 203         int                     level)
 204 {
 205         return cur->bc_mp->m_alloc_mxr[level != 0];
 206 }
 207
 208 STATIC void
 209 xfs_allocbt_init_key_from_rec(
 210         union xfs_btree_key     *key,
 211         union xfs_btree_rec     *rec)
 212 {
 213         ASSERT(rec->alloc.ar_startblock != 0);
 214
 215         key->alloc.ar_startblock = rec->alloc.ar_startblock;
 216         key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
 217 }
 218
 219 STATIC void
 220 xfs_allocbt_init_rec_from_key(
 221         union xfs_btree_key     *key,
 222         union xfs_btree_rec     *rec)
 223 {
 224         ASSERT(key->alloc.ar_startblock != 0);
 225
 226         rec->alloc.ar_startblock = key->alloc.ar_startblock;
 227         rec->alloc.ar_blockcount = key->alloc.ar_blockcount;
 228 }
 229
 230 STATIC void
 231 xfs_allocbt_init_rec_from_cur(
 232         struct xfs_btree_cur    *cur,
 233         union xfs_btree_rec     *rec)
 234 {
 235         ASSERT(cur->bc_rec.a.ar_startblock != 0);
 236
 237         rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
 238         rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
 239 }
 240
 241 STATIC void
 242 xfs_allocbt_init_ptr_from_cur(
 243         struct xfs_btree_cur    *cur,
 244         union xfs_btree_ptr     *ptr)
 245 {
 246         struct xfs_agf          *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
 247
 248         ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
 249         ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
 250
 251         ptr->s = agf->agf_roots[cur->bc_btnum];
 252 }
 253
 254 STATIC __int64_t
 255 xfs_allocbt_key_diff(
 256         struct xfs_btree_cur    *cur,
 257         union xfs_btree_key     *key)
 258 {
 259         xfs_alloc_rec_incore_t  *rec = &cur->bc_rec.a;
 260         xfs_alloc_key_t         *kp = &key->alloc;
 261         __int64_t               diff;
 262
 263         if (cur->bc_btnum == XFS_BTNUM_BNO) {
 264                 return (__int64_t)be32_to_cpu(kp->ar_startblock) -
 265                                 rec->ar_startblock;
 266         }
 267
 268         diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
 269         if (diff)
 270                 return diff;
 271
 272         return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
 273 }
 274
 275 #ifdef DEBUG
 276 STATIC int
 277 xfs_allocbt_keys_inorder(
 278         struct xfs_btree_cur    *cur,
 279         union xfs_btree_key     *k1,
 280         union xfs_btree_key     *k2)
 281 {
 282         if (cur->bc_btnum == XFS_BTNUM_BNO) {
 283                 return be32_to_cpu(k1->alloc.ar_startblock) <
 284                        be32_to_cpu(k2->alloc.ar_startblock);
 285         } else {
 286                 return be32_to_cpu(k1->alloc.ar_blockcount) <
 287                         be32_to_cpu(k2->alloc.ar_blockcount) ||
 288                         (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
 289                          be32_to_cpu(k1->alloc.ar_startblock) <
 290                          be32_to_cpu(k2->alloc.ar_startblock));
 291         }
 292 }
 293
 294 STATIC int
 295 xfs_allocbt_recs_inorder(
 296         struct xfs_btree_cur    *cur,
 297         union xfs_btree_rec     *r1,
 298         union xfs_btree_rec     *r2)
 299 {
 300         if (cur->bc_btnum == XFS_BTNUM_BNO) {
 301                 return be32_to_cpu(r1->alloc.ar_startblock) +
 302                         be32_to_cpu(r1->alloc.ar_blockcount) <=
 303                         be32_to_cpu(r2->alloc.ar_startblock);
 304         } else {
 305                 return be32_to_cpu(r1->alloc.ar_blockcount) <
 306                         be32_to_cpu(r2->alloc.ar_blockcount) ||
 307                         (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
 308                          be32_to_cpu(r1->alloc.ar_startblock) <
 309                          be32_to_cpu(r2->alloc.ar_startblock));
 310         }
 311 }
 312 #endif  /* DEBUG */
 313
 314 #ifdef XFS_BTREE_TRACE
 315 ktrace_t        *xfs_allocbt_trace_buf;
 316
 317 STATIC void
 318 xfs_allocbt_trace_enter(
 319         struct xfs_btree_cur    *cur,
 320         const char              *func,
 321         char                    *s,
 322         int                     type,
 323         int                     line,
 324         __psunsigned_t          a0,
 325         __psunsigned_t          a1,
 326         __psunsigned_t          a2,
 327         __psunsigned_t          a3,
 328         __psunsigned_t          a4,
 329         __psunsigned_t          a5,
 330         __psunsigned_t          a6,
 331         __psunsigned_t          a7,
 332         __psunsigned_t          a8,
 333         __psunsigned_t          a9,
 334         __psunsigned_t          a10)
 335 {
 336         ktrace_enter(xfs_allocbt_trace_buf, (void *)(__psint_t)type,
 337                 (void *)func, (void *)s, NULL, (void *)cur,
 338                 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
 339                 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
 340                 (void *)a8, (void *)a9, (void *)a10);
 341 }
 342
 343 STATIC void
 344 xfs_allocbt_trace_cursor(
 345         struct xfs_btree_cur    *cur,
 346         __uint32_t              *s0,
 347         __uint64_t              *l0,
 348         __uint64_t              *l1)
 349 {
 350         *s0 = cur->bc_private.a.agno;
 351         *l0 = cur->bc_rec.a.ar_startblock;
 352         *l1 = cur->bc_rec.a.ar_blockcount;
 353 }
 354
 355 STATIC void
 356 xfs_allocbt_trace_key(
 357         struct xfs_btree_cur    *cur,
 358         union xfs_btree_key     *key,
 359         __uint64_t              *l0,
 360         __uint64_t              *l1)
 361 {
 362         *l0 = be32_to_cpu(key->alloc.ar_startblock);
 363         *l1 = be32_to_cpu(key->alloc.ar_blockcount);
 364 }
 365
 366 STATIC void
 367 xfs_allocbt_trace_record(
 368         struct xfs_btree_cur    *cur,
 369         union xfs_btree_rec     *rec,
 370         __uint64_t              *l0,
 371         __uint64_t              *l1,
 372         __uint64_t              *l2)
 373 {
 374         *l0 = be32_to_cpu(rec->alloc.ar_startblock);
 375         *l1 = be32_to_cpu(rec->alloc.ar_blockcount);
 376         *l2 = 0;
 377 }
 378 #endif /* XFS_BTREE_TRACE */
 379
 380 static const struct xfs_btree_ops xfs_allocbt_ops = {
 381         .rec_len                = sizeof(xfs_alloc_rec_t),
 382         .key_len                = sizeof(xfs_alloc_key_t),
 383
 384         .dup_cursor             = xfs_allocbt_dup_cursor,
 385         .set_root               = xfs_allocbt_set_root,
 386         .alloc_block            = xfs_allocbt_alloc_block,
 387         .free_block             = xfs_allocbt_free_block,
 388         .update_lastrec         = xfs_allocbt_update_lastrec,
 389         .get_minrecs            = xfs_allocbt_get_minrecs,
 390         .get_maxrecs            = xfs_allocbt_get_maxrecs,
 391         .init_key_from_rec      = xfs_allocbt_init_key_from_rec,
 392         .init_rec_from_key      = xfs_allocbt_init_rec_from_key,
 393         .init_rec_from_cur      = xfs_allocbt_init_rec_from_cur,
 394         .init_ptr_from_cur      = xfs_allocbt_init_ptr_from_cur,
 395         .key_diff               = xfs_allocbt_key_diff,
 396
 397 #ifdef DEBUG
 398         .keys_inorder           = xfs_allocbt_keys_inorder,
 399         .recs_inorder           = xfs_allocbt_recs_inorder,
 400 #endif
 401
 402 #ifdef XFS_BTREE_TRACE
 403         .trace_enter            = xfs_allocbt_trace_enter,
 404         .trace_cursor           = xfs_allocbt_trace_cursor,
 405         .trace_key              = xfs_allocbt_trace_key,
 406         .trace_record           = xfs_allocbt_trace_record,
 407 #endif
 408 };
 409
 410 /*
 411  * Allocate a new allocation btree cursor.
 412  */
 413 struct xfs_btree_cur *                  /* new alloc btree cursor */
 414 xfs_allocbt_init_cursor(
 415         struct xfs_mount        *mp,            /* file system mount point */
 416         struct xfs_trans        *tp,            /* transaction pointer */
 417         struct xfs_buf          *agbp,          /* buffer for agf structure */
 418         xfs_agnumber_t          agno,           /* allocation group number */
 419         xfs_btnum_t             btnum)          /* btree identifier */
 420 {
 421         struct xfs_agf          *agf = XFS_BUF_TO_AGF(agbp);
 422         struct xfs_btree_cur    *cur;
 423
 424         ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
 425
 426         cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
 427
 428         cur->bc_tp = tp;
 429         cur->bc_mp = mp;
 430         cur->bc_nlevels = be32_to_cpu(agf->agf_levels[btnum]);
 431         cur->bc_btnum = btnum;
 432         cur->bc_blocklog = mp->m_sb.sb_blocklog;
 433
 434         cur->bc_ops = &xfs_allocbt_ops;
 435         if (btnum == XFS_BTNUM_CNT)
 436                 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
 437
 438         cur->bc_private.a.agbp = agbp;
 439         cur->bc_private.a.agno = agno;
 440
 441         return cur;
 442 }
 443
 444 /*
 445  * Calculate number of records in an alloc btree block.
 446  */
 447 int
 448 xfs_allocbt_maxrecs(
 449         struct xfs_mount        *mp,
 450         int                     blocklen,
 451         int                     leaf)
 452 {
 453         blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
 454
 455         if (leaf)
 456                 return blocklen / sizeof(xfs_alloc_rec_t);
 457         return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));
 458 }