2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
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.
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.
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
20 #include "xfs_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
25 #include "xfs_mount.h"
26 #include "xfs_btree.h"
27 #include "xfs_alloc_btree.h"
28 #include "xfs_alloc.h"
29 #include "xfs_extent_busy.h"
30 #include "xfs_error.h"
31 #include "xfs_trace.h"
32 #include "xfs_cksum.h"
33 #include "xfs_trans.h"
36 STATIC struct xfs_btree_cur *
37 xfs_allocbt_dup_cursor(
38 struct xfs_btree_cur *cur)
40 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
41 cur->bc_private.a.agbp, cur->bc_private.a.agno,
47 struct xfs_btree_cur *cur,
48 union xfs_btree_ptr *ptr,
51 struct xfs_buf *agbp = cur->bc_private.a.agbp;
52 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
53 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
54 int btnum = cur->bc_btnum;
55 struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno);
59 agf->agf_roots[btnum] = ptr->s;
60 be32_add_cpu(&agf->agf_levels[btnum], inc);
61 pag->pagf_levels[btnum] += inc;
64 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
68 xfs_allocbt_alloc_block(
69 struct xfs_btree_cur *cur,
70 union xfs_btree_ptr *start,
71 union xfs_btree_ptr *new,
77 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
79 /* Allocate the new block from the freelist. If we can't, give up. */
80 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp,
83 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
87 if (bno == NULLAGBLOCK) {
88 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
93 xfs_extent_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false);
95 xfs_trans_agbtree_delta(cur->bc_tp, 1);
96 new->s = cpu_to_be32(bno);
98 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
104 xfs_allocbt_free_block(
105 struct xfs_btree_cur *cur,
108 struct xfs_buf *agbp = cur->bc_private.a.agbp;
109 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
113 bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
114 error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
118 xfs_extent_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1,
119 XFS_EXTENT_BUSY_SKIP_DISCARD);
120 xfs_trans_agbtree_delta(cur->bc_tp, -1);
125 * Update the longest extent in the AGF
128 xfs_allocbt_update_lastrec(
129 struct xfs_btree_cur *cur,
130 struct xfs_btree_block *block,
131 union xfs_btree_rec *rec,
135 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
136 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
137 struct xfs_perag *pag;
141 ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
146 * If this is the last leaf block and it's the last record,
147 * then update the size of the longest extent in the AG.
149 if (ptr != xfs_btree_get_numrecs(block))
151 len = rec->alloc.ar_blockcount;
154 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
155 be32_to_cpu(agf->agf_longest))
157 len = rec->alloc.ar_blockcount;
160 numrecs = xfs_btree_get_numrecs(block);
163 ASSERT(ptr == numrecs + 1);
166 xfs_alloc_rec_t *rrp;
168 rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
169 len = rrp->ar_blockcount;
180 agf->agf_longest = len;
181 pag = xfs_perag_get(cur->bc_mp, seqno);
182 pag->pagf_longest = be32_to_cpu(len);
184 xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
188 xfs_allocbt_get_minrecs(
189 struct xfs_btree_cur *cur,
192 return cur->bc_mp->m_alloc_mnr[level != 0];
196 xfs_allocbt_get_maxrecs(
197 struct xfs_btree_cur *cur,
200 return cur->bc_mp->m_alloc_mxr[level != 0];
204 xfs_allocbt_init_key_from_rec(
205 union xfs_btree_key *key,
206 union xfs_btree_rec *rec)
208 key->alloc.ar_startblock = rec->alloc.ar_startblock;
209 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
213 xfs_bnobt_init_high_key_from_rec(
214 union xfs_btree_key *key,
215 union xfs_btree_rec *rec)
219 x = be32_to_cpu(rec->alloc.ar_startblock);
220 x += be32_to_cpu(rec->alloc.ar_blockcount) - 1;
221 key->alloc.ar_startblock = cpu_to_be32(x);
222 key->alloc.ar_blockcount = 0;
226 xfs_cntbt_init_high_key_from_rec(
227 union xfs_btree_key *key,
228 union xfs_btree_rec *rec)
230 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
231 key->alloc.ar_startblock = 0;
235 xfs_allocbt_init_rec_from_cur(
236 struct xfs_btree_cur *cur,
237 union xfs_btree_rec *rec)
239 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
240 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
244 xfs_allocbt_init_ptr_from_cur(
245 struct xfs_btree_cur *cur,
246 union xfs_btree_ptr *ptr)
248 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
250 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
251 ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
253 ptr->s = agf->agf_roots[cur->bc_btnum];
258 struct xfs_btree_cur *cur,
259 union xfs_btree_key *key)
261 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
262 xfs_alloc_key_t *kp = &key->alloc;
264 return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
269 struct xfs_btree_cur *cur,
270 union xfs_btree_key *key)
272 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
273 xfs_alloc_key_t *kp = &key->alloc;
276 diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
280 return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
284 xfs_bnobt_diff_two_keys(
285 struct xfs_btree_cur *cur,
286 union xfs_btree_key *k1,
287 union xfs_btree_key *k2)
289 return (__int64_t)be32_to_cpu(k1->alloc.ar_startblock) -
290 be32_to_cpu(k2->alloc.ar_startblock);
294 xfs_cntbt_diff_two_keys(
295 struct xfs_btree_cur *cur,
296 union xfs_btree_key *k1,
297 union xfs_btree_key *k2)
301 diff = be32_to_cpu(k1->alloc.ar_blockcount) -
302 be32_to_cpu(k2->alloc.ar_blockcount);
306 return be32_to_cpu(k1->alloc.ar_startblock) -
307 be32_to_cpu(k2->alloc.ar_startblock);
314 struct xfs_mount *mp = bp->b_target->bt_mount;
315 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
316 struct xfs_perag *pag = bp->b_pag;
320 * magic number and level verification
322 * During growfs operations, we can't verify the exact level or owner as
323 * the perag is not fully initialised and hence not attached to the
324 * buffer. In this case, check against the maximum tree depth.
326 * Similarly, during log recovery we will have a perag structure
327 * attached, but the agf information will not yet have been initialised
328 * from the on disk AGF. Again, we can only check against maximum limits
331 level = be16_to_cpu(block->bb_level);
332 switch (block->bb_magic) {
333 case cpu_to_be32(XFS_ABTB_CRC_MAGIC):
334 if (!xfs_btree_sblock_v5hdr_verify(bp))
337 case cpu_to_be32(XFS_ABTB_MAGIC):
338 if (pag && pag->pagf_init) {
339 if (level >= pag->pagf_levels[XFS_BTNUM_BNOi])
341 } else if (level >= mp->m_ag_maxlevels)
344 case cpu_to_be32(XFS_ABTC_CRC_MAGIC):
345 if (!xfs_btree_sblock_v5hdr_verify(bp))
348 case cpu_to_be32(XFS_ABTC_MAGIC):
349 if (pag && pag->pagf_init) {
350 if (level >= pag->pagf_levels[XFS_BTNUM_CNTi])
352 } else if (level >= mp->m_ag_maxlevels)
359 return xfs_btree_sblock_verify(bp, mp->m_alloc_mxr[level != 0]);
363 xfs_allocbt_read_verify(
366 if (!xfs_btree_sblock_verify_crc(bp))
367 xfs_buf_ioerror(bp, -EFSBADCRC);
368 else if (!xfs_allocbt_verify(bp))
369 xfs_buf_ioerror(bp, -EFSCORRUPTED);
372 trace_xfs_btree_corrupt(bp, _RET_IP_);
373 xfs_verifier_error(bp);
378 xfs_allocbt_write_verify(
381 if (!xfs_allocbt_verify(bp)) {
382 trace_xfs_btree_corrupt(bp, _RET_IP_);
383 xfs_buf_ioerror(bp, -EFSCORRUPTED);
384 xfs_verifier_error(bp);
387 xfs_btree_sblock_calc_crc(bp);
391 const struct xfs_buf_ops xfs_allocbt_buf_ops = {
392 .name = "xfs_allocbt",
393 .verify_read = xfs_allocbt_read_verify,
394 .verify_write = xfs_allocbt_write_verify,
398 #if defined(DEBUG) || defined(XFS_WARN)
400 xfs_bnobt_keys_inorder(
401 struct xfs_btree_cur *cur,
402 union xfs_btree_key *k1,
403 union xfs_btree_key *k2)
405 return be32_to_cpu(k1->alloc.ar_startblock) <
406 be32_to_cpu(k2->alloc.ar_startblock);
410 xfs_bnobt_recs_inorder(
411 struct xfs_btree_cur *cur,
412 union xfs_btree_rec *r1,
413 union xfs_btree_rec *r2)
415 return be32_to_cpu(r1->alloc.ar_startblock) +
416 be32_to_cpu(r1->alloc.ar_blockcount) <=
417 be32_to_cpu(r2->alloc.ar_startblock);
421 xfs_cntbt_keys_inorder(
422 struct xfs_btree_cur *cur,
423 union xfs_btree_key *k1,
424 union xfs_btree_key *k2)
426 return be32_to_cpu(k1->alloc.ar_blockcount) <
427 be32_to_cpu(k2->alloc.ar_blockcount) ||
428 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
429 be32_to_cpu(k1->alloc.ar_startblock) <
430 be32_to_cpu(k2->alloc.ar_startblock));
434 xfs_cntbt_recs_inorder(
435 struct xfs_btree_cur *cur,
436 union xfs_btree_rec *r1,
437 union xfs_btree_rec *r2)
439 return be32_to_cpu(r1->alloc.ar_blockcount) <
440 be32_to_cpu(r2->alloc.ar_blockcount) ||
441 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
442 be32_to_cpu(r1->alloc.ar_startblock) <
443 be32_to_cpu(r2->alloc.ar_startblock));
447 static const struct xfs_btree_ops xfs_bnobt_ops = {
448 .rec_len = sizeof(xfs_alloc_rec_t),
449 .key_len = sizeof(xfs_alloc_key_t),
451 .dup_cursor = xfs_allocbt_dup_cursor,
452 .set_root = xfs_allocbt_set_root,
453 .alloc_block = xfs_allocbt_alloc_block,
454 .free_block = xfs_allocbt_free_block,
455 .update_lastrec = xfs_allocbt_update_lastrec,
456 .get_minrecs = xfs_allocbt_get_minrecs,
457 .get_maxrecs = xfs_allocbt_get_maxrecs,
458 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
459 .init_high_key_from_rec = xfs_bnobt_init_high_key_from_rec,
460 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
461 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
462 .key_diff = xfs_bnobt_key_diff,
463 .buf_ops = &xfs_allocbt_buf_ops,
464 .diff_two_keys = xfs_bnobt_diff_two_keys,
465 #if defined(DEBUG) || defined(XFS_WARN)
466 .keys_inorder = xfs_bnobt_keys_inorder,
467 .recs_inorder = xfs_bnobt_recs_inorder,
471 static const struct xfs_btree_ops xfs_cntbt_ops = {
472 .rec_len = sizeof(xfs_alloc_rec_t),
473 .key_len = sizeof(xfs_alloc_key_t),
475 .dup_cursor = xfs_allocbt_dup_cursor,
476 .set_root = xfs_allocbt_set_root,
477 .alloc_block = xfs_allocbt_alloc_block,
478 .free_block = xfs_allocbt_free_block,
479 .update_lastrec = xfs_allocbt_update_lastrec,
480 .get_minrecs = xfs_allocbt_get_minrecs,
481 .get_maxrecs = xfs_allocbt_get_maxrecs,
482 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
483 .init_high_key_from_rec = xfs_cntbt_init_high_key_from_rec,
484 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
485 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
486 .key_diff = xfs_cntbt_key_diff,
487 .buf_ops = &xfs_allocbt_buf_ops,
488 .diff_two_keys = xfs_cntbt_diff_two_keys,
489 #if defined(DEBUG) || defined(XFS_WARN)
490 .keys_inorder = xfs_cntbt_keys_inorder,
491 .recs_inorder = xfs_cntbt_recs_inorder,
496 * Allocate a new allocation btree cursor.
498 struct xfs_btree_cur * /* new alloc btree cursor */
499 xfs_allocbt_init_cursor(
500 struct xfs_mount *mp, /* file system mount point */
501 struct xfs_trans *tp, /* transaction pointer */
502 struct xfs_buf *agbp, /* buffer for agf structure */
503 xfs_agnumber_t agno, /* allocation group number */
504 xfs_btnum_t btnum) /* btree identifier */
506 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
507 struct xfs_btree_cur *cur;
509 ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
511 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_NOFS);
515 cur->bc_btnum = btnum;
516 cur->bc_blocklog = mp->m_sb.sb_blocklog;
518 if (btnum == XFS_BTNUM_CNT) {
519 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtc_2);
520 cur->bc_ops = &xfs_cntbt_ops;
521 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
522 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
524 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtb_2);
525 cur->bc_ops = &xfs_bnobt_ops;
526 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
529 cur->bc_private.a.agbp = agbp;
530 cur->bc_private.a.agno = agno;
532 if (xfs_sb_version_hascrc(&mp->m_sb))
533 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
539 * Calculate number of records in an alloc btree block.
543 struct xfs_mount *mp,
547 blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
550 return blocklen / sizeof(xfs_alloc_rec_t);
551 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));