Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6#include "xfs.h"
7#include "xfs_fs.h"
8#include "xfs_shared.h"
9#include "xfs_format.h"
10#include "xfs_log_format.h"
11#include "xfs_trans_resv.h"
12#include "xfs_mount.h"
13#include "xfs_btree.h"
14#include "xfs_btree_staging.h"
15#include "xfs_alloc_btree.h"
16#include "xfs_alloc.h"
17#include "xfs_extent_busy.h"
18#include "xfs_error.h"
19#include "xfs_health.h"
20#include "xfs_trace.h"
21#include "xfs_trans.h"
22#include "xfs_ag.h"
23
24static struct kmem_cache *xfs_allocbt_cur_cache;
25
26STATIC struct xfs_btree_cur *
27xfs_bnobt_dup_cursor(
28 struct xfs_btree_cur *cur)
29{
30 return xfs_bnobt_init_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ag.agbp,
31 to_perag(cur->bc_group));
32}
33
34STATIC struct xfs_btree_cur *
35xfs_cntbt_dup_cursor(
36 struct xfs_btree_cur *cur)
37{
38 return xfs_cntbt_init_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ag.agbp,
39 to_perag(cur->bc_group));
40}
41
42STATIC void
43xfs_allocbt_set_root(
44 struct xfs_btree_cur *cur,
45 const union xfs_btree_ptr *ptr,
46 int inc)
47{
48 struct xfs_perag *pag = to_perag(cur->bc_group);
49 struct xfs_buf *agbp = cur->bc_ag.agbp;
50 struct xfs_agf *agf = agbp->b_addr;
51
52 ASSERT(ptr->s != 0);
53
54 if (xfs_btree_is_bno(cur->bc_ops)) {
55 agf->agf_bno_root = ptr->s;
56 be32_add_cpu(&agf->agf_bno_level, inc);
57 pag->pagf_bno_level += inc;
58 } else {
59 agf->agf_cnt_root = ptr->s;
60 be32_add_cpu(&agf->agf_cnt_level, inc);
61 pag->pagf_cnt_level += inc;
62 }
63
64 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
65}
66
67STATIC int
68xfs_allocbt_alloc_block(
69 struct xfs_btree_cur *cur,
70 const union xfs_btree_ptr *start,
71 union xfs_btree_ptr *new,
72 int *stat)
73{
74 int error;
75 xfs_agblock_t bno;
76
77 /* Allocate the new block from the freelist. If we can't, give up. */
78 error = xfs_alloc_get_freelist(to_perag(cur->bc_group), cur->bc_tp,
79 cur->bc_ag.agbp, &bno, 1);
80 if (error)
81 return error;
82
83 if (bno == NULLAGBLOCK) {
84 *stat = 0;
85 return 0;
86 }
87
88 atomic64_inc(&cur->bc_mp->m_allocbt_blks);
89 xfs_extent_busy_reuse(cur->bc_group, bno, 1, false);
90
91 new->s = cpu_to_be32(bno);
92
93 *stat = 1;
94 return 0;
95}
96
97STATIC int
98xfs_allocbt_free_block(
99 struct xfs_btree_cur *cur,
100 struct xfs_buf *bp)
101{
102 struct xfs_buf *agbp = cur->bc_ag.agbp;
103 xfs_agblock_t bno;
104 int error;
105
106 bno = xfs_daddr_to_agbno(cur->bc_mp, xfs_buf_daddr(bp));
107 error = xfs_alloc_put_freelist(to_perag(cur->bc_group), cur->bc_tp,
108 agbp, NULL, bno, 1);
109 if (error)
110 return error;
111
112 atomic64_dec(&cur->bc_mp->m_allocbt_blks);
113 xfs_extent_busy_insert(cur->bc_tp, pag_group(agbp->b_pag), bno, 1,
114 XFS_EXTENT_BUSY_SKIP_DISCARD);
115 return 0;
116}
117
118STATIC int
119xfs_allocbt_get_minrecs(
120 struct xfs_btree_cur *cur,
121 int level)
122{
123 return cur->bc_mp->m_alloc_mnr[level != 0];
124}
125
126STATIC int
127xfs_allocbt_get_maxrecs(
128 struct xfs_btree_cur *cur,
129 int level)
130{
131 return cur->bc_mp->m_alloc_mxr[level != 0];
132}
133
134STATIC void
135xfs_allocbt_init_key_from_rec(
136 union xfs_btree_key *key,
137 const union xfs_btree_rec *rec)
138{
139 key->alloc.ar_startblock = rec->alloc.ar_startblock;
140 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
141}
142
143STATIC void
144xfs_bnobt_init_high_key_from_rec(
145 union xfs_btree_key *key,
146 const union xfs_btree_rec *rec)
147{
148 __u32 x;
149
150 x = be32_to_cpu(rec->alloc.ar_startblock);
151 x += be32_to_cpu(rec->alloc.ar_blockcount) - 1;
152 key->alloc.ar_startblock = cpu_to_be32(x);
153 key->alloc.ar_blockcount = 0;
154}
155
156STATIC void
157xfs_cntbt_init_high_key_from_rec(
158 union xfs_btree_key *key,
159 const union xfs_btree_rec *rec)
160{
161 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
162 key->alloc.ar_startblock = 0;
163}
164
165STATIC void
166xfs_allocbt_init_rec_from_cur(
167 struct xfs_btree_cur *cur,
168 union xfs_btree_rec *rec)
169{
170 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
171 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
172}
173
174STATIC void
175xfs_allocbt_init_ptr_from_cur(
176 struct xfs_btree_cur *cur,
177 union xfs_btree_ptr *ptr)
178{
179 struct xfs_agf *agf = cur->bc_ag.agbp->b_addr;
180
181 ASSERT(cur->bc_group->xg_gno == be32_to_cpu(agf->agf_seqno));
182
183 if (xfs_btree_is_bno(cur->bc_ops))
184 ptr->s = agf->agf_bno_root;
185 else
186 ptr->s = agf->agf_cnt_root;
187}
188
189STATIC int64_t
190xfs_bnobt_key_diff(
191 struct xfs_btree_cur *cur,
192 const union xfs_btree_key *key)
193{
194 struct xfs_alloc_rec_incore *rec = &cur->bc_rec.a;
195 const struct xfs_alloc_rec *kp = &key->alloc;
196
197 return (int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
198}
199
200STATIC int64_t
201xfs_cntbt_key_diff(
202 struct xfs_btree_cur *cur,
203 const union xfs_btree_key *key)
204{
205 struct xfs_alloc_rec_incore *rec = &cur->bc_rec.a;
206 const struct xfs_alloc_rec *kp = &key->alloc;
207 int64_t diff;
208
209 diff = (int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
210 if (diff)
211 return diff;
212
213 return (int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
214}
215
216STATIC int64_t
217xfs_bnobt_diff_two_keys(
218 struct xfs_btree_cur *cur,
219 const union xfs_btree_key *k1,
220 const union xfs_btree_key *k2,
221 const union xfs_btree_key *mask)
222{
223 ASSERT(!mask || mask->alloc.ar_startblock);
224
225 return (int64_t)be32_to_cpu(k1->alloc.ar_startblock) -
226 be32_to_cpu(k2->alloc.ar_startblock);
227}
228
229STATIC int64_t
230xfs_cntbt_diff_two_keys(
231 struct xfs_btree_cur *cur,
232 const union xfs_btree_key *k1,
233 const union xfs_btree_key *k2,
234 const union xfs_btree_key *mask)
235{
236 int64_t diff;
237
238 ASSERT(!mask || (mask->alloc.ar_blockcount &&
239 mask->alloc.ar_startblock));
240
241 diff = be32_to_cpu(k1->alloc.ar_blockcount) -
242 be32_to_cpu(k2->alloc.ar_blockcount);
243 if (diff)
244 return diff;
245
246 return be32_to_cpu(k1->alloc.ar_startblock) -
247 be32_to_cpu(k2->alloc.ar_startblock);
248}
249
250static xfs_failaddr_t
251xfs_allocbt_verify(
252 struct xfs_buf *bp)
253{
254 struct xfs_mount *mp = bp->b_mount;
255 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
256 struct xfs_perag *pag = bp->b_pag;
257 xfs_failaddr_t fa;
258 unsigned int level;
259
260 if (!xfs_verify_magic(bp, block->bb_magic))
261 return __this_address;
262
263 if (xfs_has_crc(mp)) {
264 fa = xfs_btree_agblock_v5hdr_verify(bp);
265 if (fa)
266 return fa;
267 }
268
269 /*
270 * The perag may not be attached during grow operations or fully
271 * initialized from the AGF during log recovery. Therefore we can only
272 * check against maximum tree depth from those contexts.
273 *
274 * Otherwise check against the per-tree limit. Peek at one of the
275 * verifier magic values to determine the type of tree we're verifying
276 * against.
277 */
278 level = be16_to_cpu(block->bb_level);
279 if (pag && xfs_perag_initialised_agf(pag)) {
280 unsigned int maxlevel, repair_maxlevel = 0;
281
282 /*
283 * Online repair could be rewriting the free space btrees, so
284 * we'll validate against the larger of either tree while this
285 * is going on.
286 */
287 if (bp->b_ops->magic[0] == cpu_to_be32(XFS_ABTC_MAGIC)) {
288 maxlevel = pag->pagf_cnt_level;
289#ifdef CONFIG_XFS_ONLINE_REPAIR
290 repair_maxlevel = pag->pagf_repair_cnt_level;
291#endif
292 } else {
293 maxlevel = pag->pagf_bno_level;
294#ifdef CONFIG_XFS_ONLINE_REPAIR
295 repair_maxlevel = pag->pagf_repair_bno_level;
296#endif
297 }
298
299 if (level >= max(maxlevel, repair_maxlevel))
300 return __this_address;
301 } else if (level >= mp->m_alloc_maxlevels)
302 return __this_address;
303
304 return xfs_btree_agblock_verify(bp, mp->m_alloc_mxr[level != 0]);
305}
306
307static void
308xfs_allocbt_read_verify(
309 struct xfs_buf *bp)
310{
311 xfs_failaddr_t fa;
312
313 if (!xfs_btree_agblock_verify_crc(bp))
314 xfs_verifier_error(bp, -EFSBADCRC, __this_address);
315 else {
316 fa = xfs_allocbt_verify(bp);
317 if (fa)
318 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
319 }
320
321 if (bp->b_error)
322 trace_xfs_btree_corrupt(bp, _RET_IP_);
323}
324
325static void
326xfs_allocbt_write_verify(
327 struct xfs_buf *bp)
328{
329 xfs_failaddr_t fa;
330
331 fa = xfs_allocbt_verify(bp);
332 if (fa) {
333 trace_xfs_btree_corrupt(bp, _RET_IP_);
334 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
335 return;
336 }
337 xfs_btree_agblock_calc_crc(bp);
338
339}
340
341const struct xfs_buf_ops xfs_bnobt_buf_ops = {
342 .name = "xfs_bnobt",
343 .magic = { cpu_to_be32(XFS_ABTB_MAGIC),
344 cpu_to_be32(XFS_ABTB_CRC_MAGIC) },
345 .verify_read = xfs_allocbt_read_verify,
346 .verify_write = xfs_allocbt_write_verify,
347 .verify_struct = xfs_allocbt_verify,
348};
349
350const struct xfs_buf_ops xfs_cntbt_buf_ops = {
351 .name = "xfs_cntbt",
352 .magic = { cpu_to_be32(XFS_ABTC_MAGIC),
353 cpu_to_be32(XFS_ABTC_CRC_MAGIC) },
354 .verify_read = xfs_allocbt_read_verify,
355 .verify_write = xfs_allocbt_write_verify,
356 .verify_struct = xfs_allocbt_verify,
357};
358
359STATIC int
360xfs_bnobt_keys_inorder(
361 struct xfs_btree_cur *cur,
362 const union xfs_btree_key *k1,
363 const union xfs_btree_key *k2)
364{
365 return be32_to_cpu(k1->alloc.ar_startblock) <
366 be32_to_cpu(k2->alloc.ar_startblock);
367}
368
369STATIC int
370xfs_bnobt_recs_inorder(
371 struct xfs_btree_cur *cur,
372 const union xfs_btree_rec *r1,
373 const union xfs_btree_rec *r2)
374{
375 return be32_to_cpu(r1->alloc.ar_startblock) +
376 be32_to_cpu(r1->alloc.ar_blockcount) <=
377 be32_to_cpu(r2->alloc.ar_startblock);
378}
379
380STATIC int
381xfs_cntbt_keys_inorder(
382 struct xfs_btree_cur *cur,
383 const union xfs_btree_key *k1,
384 const union xfs_btree_key *k2)
385{
386 return be32_to_cpu(k1->alloc.ar_blockcount) <
387 be32_to_cpu(k2->alloc.ar_blockcount) ||
388 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
389 be32_to_cpu(k1->alloc.ar_startblock) <
390 be32_to_cpu(k2->alloc.ar_startblock));
391}
392
393STATIC int
394xfs_cntbt_recs_inorder(
395 struct xfs_btree_cur *cur,
396 const union xfs_btree_rec *r1,
397 const union xfs_btree_rec *r2)
398{
399 return be32_to_cpu(r1->alloc.ar_blockcount) <
400 be32_to_cpu(r2->alloc.ar_blockcount) ||
401 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
402 be32_to_cpu(r1->alloc.ar_startblock) <
403 be32_to_cpu(r2->alloc.ar_startblock));
404}
405
406STATIC enum xbtree_key_contig
407xfs_allocbt_keys_contiguous(
408 struct xfs_btree_cur *cur,
409 const union xfs_btree_key *key1,
410 const union xfs_btree_key *key2,
411 const union xfs_btree_key *mask)
412{
413 ASSERT(!mask || mask->alloc.ar_startblock);
414
415 return xbtree_key_contig(be32_to_cpu(key1->alloc.ar_startblock),
416 be32_to_cpu(key2->alloc.ar_startblock));
417}
418
419const struct xfs_btree_ops xfs_bnobt_ops = {
420 .name = "bno",
421 .type = XFS_BTREE_TYPE_AG,
422
423 .rec_len = sizeof(xfs_alloc_rec_t),
424 .key_len = sizeof(xfs_alloc_key_t),
425 .ptr_len = XFS_BTREE_SHORT_PTR_LEN,
426
427 .lru_refs = XFS_ALLOC_BTREE_REF,
428 .statoff = XFS_STATS_CALC_INDEX(xs_abtb_2),
429 .sick_mask = XFS_SICK_AG_BNOBT,
430
431 .dup_cursor = xfs_bnobt_dup_cursor,
432 .set_root = xfs_allocbt_set_root,
433 .alloc_block = xfs_allocbt_alloc_block,
434 .free_block = xfs_allocbt_free_block,
435 .get_minrecs = xfs_allocbt_get_minrecs,
436 .get_maxrecs = xfs_allocbt_get_maxrecs,
437 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
438 .init_high_key_from_rec = xfs_bnobt_init_high_key_from_rec,
439 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
440 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
441 .key_diff = xfs_bnobt_key_diff,
442 .buf_ops = &xfs_bnobt_buf_ops,
443 .diff_two_keys = xfs_bnobt_diff_two_keys,
444 .keys_inorder = xfs_bnobt_keys_inorder,
445 .recs_inorder = xfs_bnobt_recs_inorder,
446 .keys_contiguous = xfs_allocbt_keys_contiguous,
447};
448
449const struct xfs_btree_ops xfs_cntbt_ops = {
450 .name = "cnt",
451 .type = XFS_BTREE_TYPE_AG,
452
453 .rec_len = sizeof(xfs_alloc_rec_t),
454 .key_len = sizeof(xfs_alloc_key_t),
455 .ptr_len = XFS_BTREE_SHORT_PTR_LEN,
456
457 .lru_refs = XFS_ALLOC_BTREE_REF,
458 .statoff = XFS_STATS_CALC_INDEX(xs_abtc_2),
459 .sick_mask = XFS_SICK_AG_CNTBT,
460
461 .dup_cursor = xfs_cntbt_dup_cursor,
462 .set_root = xfs_allocbt_set_root,
463 .alloc_block = xfs_allocbt_alloc_block,
464 .free_block = xfs_allocbt_free_block,
465 .get_minrecs = xfs_allocbt_get_minrecs,
466 .get_maxrecs = xfs_allocbt_get_maxrecs,
467 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
468 .init_high_key_from_rec = xfs_cntbt_init_high_key_from_rec,
469 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
470 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
471 .key_diff = xfs_cntbt_key_diff,
472 .buf_ops = &xfs_cntbt_buf_ops,
473 .diff_two_keys = xfs_cntbt_diff_two_keys,
474 .keys_inorder = xfs_cntbt_keys_inorder,
475 .recs_inorder = xfs_cntbt_recs_inorder,
476 .keys_contiguous = NULL, /* not needed right now */
477};
478
479/*
480 * Allocate a new bnobt cursor.
481 *
482 * For staging cursors tp and agbp are NULL.
483 */
484struct xfs_btree_cur *
485xfs_bnobt_init_cursor(
486 struct xfs_mount *mp,
487 struct xfs_trans *tp,
488 struct xfs_buf *agbp,
489 struct xfs_perag *pag)
490{
491 struct xfs_btree_cur *cur;
492
493 cur = xfs_btree_alloc_cursor(mp, tp, &xfs_bnobt_ops,
494 mp->m_alloc_maxlevels, xfs_allocbt_cur_cache);
495 cur->bc_group = xfs_group_hold(pag_group(pag));
496 cur->bc_ag.agbp = agbp;
497 if (agbp) {
498 struct xfs_agf *agf = agbp->b_addr;
499
500 cur->bc_nlevels = be32_to_cpu(agf->agf_bno_level);
501 }
502 return cur;
503}
504
505/*
506 * Allocate a new cntbt cursor.
507 *
508 * For staging cursors tp and agbp are NULL.
509 */
510struct xfs_btree_cur *
511xfs_cntbt_init_cursor(
512 struct xfs_mount *mp,
513 struct xfs_trans *tp,
514 struct xfs_buf *agbp,
515 struct xfs_perag *pag)
516{
517 struct xfs_btree_cur *cur;
518
519 cur = xfs_btree_alloc_cursor(mp, tp, &xfs_cntbt_ops,
520 mp->m_alloc_maxlevels, xfs_allocbt_cur_cache);
521 cur->bc_group = xfs_group_hold(pag_group(pag));
522 cur->bc_ag.agbp = agbp;
523 if (agbp) {
524 struct xfs_agf *agf = agbp->b_addr;
525
526 cur->bc_nlevels = be32_to_cpu(agf->agf_cnt_level);
527 }
528 return cur;
529}
530
531/*
532 * Install a new free space btree root. Caller is responsible for invalidating
533 * and freeing the old btree blocks.
534 */
535void
536xfs_allocbt_commit_staged_btree(
537 struct xfs_btree_cur *cur,
538 struct xfs_trans *tp,
539 struct xfs_buf *agbp)
540{
541 struct xfs_agf *agf = agbp->b_addr;
542 struct xbtree_afakeroot *afake = cur->bc_ag.afake;
543
544 ASSERT(cur->bc_flags & XFS_BTREE_STAGING);
545
546 if (xfs_btree_is_bno(cur->bc_ops)) {
547 agf->agf_bno_root = cpu_to_be32(afake->af_root);
548 agf->agf_bno_level = cpu_to_be32(afake->af_levels);
549 } else {
550 agf->agf_cnt_root = cpu_to_be32(afake->af_root);
551 agf->agf_cnt_level = cpu_to_be32(afake->af_levels);
552 }
553 xfs_alloc_log_agf(tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
554
555 xfs_btree_commit_afakeroot(cur, tp, agbp);
556}
557
558/* Calculate number of records in an alloc btree block. */
559static inline unsigned int
560xfs_allocbt_block_maxrecs(
561 unsigned int blocklen,
562 bool leaf)
563{
564 if (leaf)
565 return blocklen / sizeof(xfs_alloc_rec_t);
566 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));
567}
568
569/*
570 * Calculate number of records in an alloc btree block.
571 */
572unsigned int
573xfs_allocbt_maxrecs(
574 struct xfs_mount *mp,
575 unsigned int blocklen,
576 bool leaf)
577{
578 blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
579 return xfs_allocbt_block_maxrecs(blocklen, leaf);
580}
581
582/* Free space btrees are at their largest when every other block is free. */
583#define XFS_MAX_FREESP_RECORDS ((XFS_MAX_AG_BLOCKS + 1) / 2)
584
585/* Compute the max possible height for free space btrees. */
586unsigned int
587xfs_allocbt_maxlevels_ondisk(void)
588{
589 unsigned int minrecs[2];
590 unsigned int blocklen;
591
592 blocklen = min(XFS_MIN_BLOCKSIZE - XFS_BTREE_SBLOCK_LEN,
593 XFS_MIN_CRC_BLOCKSIZE - XFS_BTREE_SBLOCK_CRC_LEN);
594
595 minrecs[0] = xfs_allocbt_block_maxrecs(blocklen, true) / 2;
596 minrecs[1] = xfs_allocbt_block_maxrecs(blocklen, false) / 2;
597
598 return xfs_btree_compute_maxlevels(minrecs, XFS_MAX_FREESP_RECORDS);
599}
600
601/* Calculate the freespace btree size for some records. */
602xfs_extlen_t
603xfs_allocbt_calc_size(
604 struct xfs_mount *mp,
605 unsigned long long len)
606{
607 return xfs_btree_calc_size(mp->m_alloc_mnr, len);
608}
609
610int __init
611xfs_allocbt_init_cur_cache(void)
612{
613 xfs_allocbt_cur_cache = kmem_cache_create("xfs_bnobt_cur",
614 xfs_btree_cur_sizeof(xfs_allocbt_maxlevels_ondisk()),
615 0, 0, NULL);
616
617 if (!xfs_allocbt_cur_cache)
618 return -ENOMEM;
619 return 0;
620}
621
622void
623xfs_allocbt_destroy_cur_cache(void)
624{
625 kmem_cache_destroy(xfs_allocbt_cur_cache);
626 xfs_allocbt_cur_cache = NULL;
627}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6#include "xfs.h"
7#include "xfs_fs.h"
8#include "xfs_shared.h"
9#include "xfs_format.h"
10#include "xfs_log_format.h"
11#include "xfs_trans_resv.h"
12#include "xfs_sb.h"
13#include "xfs_mount.h"
14#include "xfs_btree.h"
15#include "xfs_btree_staging.h"
16#include "xfs_alloc_btree.h"
17#include "xfs_alloc.h"
18#include "xfs_extent_busy.h"
19#include "xfs_error.h"
20#include "xfs_trace.h"
21#include "xfs_trans.h"
22
23
24STATIC struct xfs_btree_cur *
25xfs_allocbt_dup_cursor(
26 struct xfs_btree_cur *cur)
27{
28 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
29 cur->bc_ag.agbp, cur->bc_ag.agno,
30 cur->bc_btnum);
31}
32
33STATIC void
34xfs_allocbt_set_root(
35 struct xfs_btree_cur *cur,
36 union xfs_btree_ptr *ptr,
37 int inc)
38{
39 struct xfs_buf *agbp = cur->bc_ag.agbp;
40 struct xfs_agf *agf = agbp->b_addr;
41 int btnum = cur->bc_btnum;
42 struct xfs_perag *pag = agbp->b_pag;
43
44 ASSERT(ptr->s != 0);
45
46 agf->agf_roots[btnum] = ptr->s;
47 be32_add_cpu(&agf->agf_levels[btnum], inc);
48 pag->pagf_levels[btnum] += inc;
49
50 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
51}
52
53STATIC int
54xfs_allocbt_alloc_block(
55 struct xfs_btree_cur *cur,
56 union xfs_btree_ptr *start,
57 union xfs_btree_ptr *new,
58 int *stat)
59{
60 int error;
61 xfs_agblock_t bno;
62
63 /* Allocate the new block from the freelist. If we can't, give up. */
64 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_ag.agbp,
65 &bno, 1);
66 if (error)
67 return error;
68
69 if (bno == NULLAGBLOCK) {
70 *stat = 0;
71 return 0;
72 }
73
74 xfs_extent_busy_reuse(cur->bc_mp, cur->bc_ag.agno, bno, 1, false);
75
76 xfs_trans_agbtree_delta(cur->bc_tp, 1);
77 new->s = cpu_to_be32(bno);
78
79 *stat = 1;
80 return 0;
81}
82
83STATIC int
84xfs_allocbt_free_block(
85 struct xfs_btree_cur *cur,
86 struct xfs_buf *bp)
87{
88 struct xfs_buf *agbp = cur->bc_ag.agbp;
89 struct xfs_agf *agf = agbp->b_addr;
90 xfs_agblock_t bno;
91 int error;
92
93 bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
94 error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
95 if (error)
96 return error;
97
98 xfs_extent_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1,
99 XFS_EXTENT_BUSY_SKIP_DISCARD);
100 xfs_trans_agbtree_delta(cur->bc_tp, -1);
101 return 0;
102}
103
104/*
105 * Update the longest extent in the AGF
106 */
107STATIC void
108xfs_allocbt_update_lastrec(
109 struct xfs_btree_cur *cur,
110 struct xfs_btree_block *block,
111 union xfs_btree_rec *rec,
112 int ptr,
113 int reason)
114{
115 struct xfs_agf *agf = cur->bc_ag.agbp->b_addr;
116 struct xfs_perag *pag;
117 __be32 len;
118 int numrecs;
119
120 ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
121
122 switch (reason) {
123 case LASTREC_UPDATE:
124 /*
125 * If this is the last leaf block and it's the last record,
126 * then update the size of the longest extent in the AG.
127 */
128 if (ptr != xfs_btree_get_numrecs(block))
129 return;
130 len = rec->alloc.ar_blockcount;
131 break;
132 case LASTREC_INSREC:
133 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
134 be32_to_cpu(agf->agf_longest))
135 return;
136 len = rec->alloc.ar_blockcount;
137 break;
138 case LASTREC_DELREC:
139 numrecs = xfs_btree_get_numrecs(block);
140 if (ptr <= numrecs)
141 return;
142 ASSERT(ptr == numrecs + 1);
143
144 if (numrecs) {
145 xfs_alloc_rec_t *rrp;
146
147 rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
148 len = rrp->ar_blockcount;
149 } else {
150 len = 0;
151 }
152
153 break;
154 default:
155 ASSERT(0);
156 return;
157 }
158
159 agf->agf_longest = len;
160 pag = cur->bc_ag.agbp->b_pag;
161 pag->pagf_longest = be32_to_cpu(len);
162 xfs_alloc_log_agf(cur->bc_tp, cur->bc_ag.agbp, XFS_AGF_LONGEST);
163}
164
165STATIC int
166xfs_allocbt_get_minrecs(
167 struct xfs_btree_cur *cur,
168 int level)
169{
170 return cur->bc_mp->m_alloc_mnr[level != 0];
171}
172
173STATIC int
174xfs_allocbt_get_maxrecs(
175 struct xfs_btree_cur *cur,
176 int level)
177{
178 return cur->bc_mp->m_alloc_mxr[level != 0];
179}
180
181STATIC void
182xfs_allocbt_init_key_from_rec(
183 union xfs_btree_key *key,
184 union xfs_btree_rec *rec)
185{
186 key->alloc.ar_startblock = rec->alloc.ar_startblock;
187 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
188}
189
190STATIC void
191xfs_bnobt_init_high_key_from_rec(
192 union xfs_btree_key *key,
193 union xfs_btree_rec *rec)
194{
195 __u32 x;
196
197 x = be32_to_cpu(rec->alloc.ar_startblock);
198 x += be32_to_cpu(rec->alloc.ar_blockcount) - 1;
199 key->alloc.ar_startblock = cpu_to_be32(x);
200 key->alloc.ar_blockcount = 0;
201}
202
203STATIC void
204xfs_cntbt_init_high_key_from_rec(
205 union xfs_btree_key *key,
206 union xfs_btree_rec *rec)
207{
208 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
209 key->alloc.ar_startblock = 0;
210}
211
212STATIC void
213xfs_allocbt_init_rec_from_cur(
214 struct xfs_btree_cur *cur,
215 union xfs_btree_rec *rec)
216{
217 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
218 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
219}
220
221STATIC void
222xfs_allocbt_init_ptr_from_cur(
223 struct xfs_btree_cur *cur,
224 union xfs_btree_ptr *ptr)
225{
226 struct xfs_agf *agf = cur->bc_ag.agbp->b_addr;
227
228 ASSERT(cur->bc_ag.agno == be32_to_cpu(agf->agf_seqno));
229
230 ptr->s = agf->agf_roots[cur->bc_btnum];
231}
232
233STATIC int64_t
234xfs_bnobt_key_diff(
235 struct xfs_btree_cur *cur,
236 union xfs_btree_key *key)
237{
238 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
239 xfs_alloc_key_t *kp = &key->alloc;
240
241 return (int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
242}
243
244STATIC int64_t
245xfs_cntbt_key_diff(
246 struct xfs_btree_cur *cur,
247 union xfs_btree_key *key)
248{
249 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
250 xfs_alloc_key_t *kp = &key->alloc;
251 int64_t diff;
252
253 diff = (int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
254 if (diff)
255 return diff;
256
257 return (int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
258}
259
260STATIC int64_t
261xfs_bnobt_diff_two_keys(
262 struct xfs_btree_cur *cur,
263 union xfs_btree_key *k1,
264 union xfs_btree_key *k2)
265{
266 return (int64_t)be32_to_cpu(k1->alloc.ar_startblock) -
267 be32_to_cpu(k2->alloc.ar_startblock);
268}
269
270STATIC int64_t
271xfs_cntbt_diff_two_keys(
272 struct xfs_btree_cur *cur,
273 union xfs_btree_key *k1,
274 union xfs_btree_key *k2)
275{
276 int64_t diff;
277
278 diff = be32_to_cpu(k1->alloc.ar_blockcount) -
279 be32_to_cpu(k2->alloc.ar_blockcount);
280 if (diff)
281 return diff;
282
283 return be32_to_cpu(k1->alloc.ar_startblock) -
284 be32_to_cpu(k2->alloc.ar_startblock);
285}
286
287static xfs_failaddr_t
288xfs_allocbt_verify(
289 struct xfs_buf *bp)
290{
291 struct xfs_mount *mp = bp->b_mount;
292 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
293 struct xfs_perag *pag = bp->b_pag;
294 xfs_failaddr_t fa;
295 unsigned int level;
296 xfs_btnum_t btnum = XFS_BTNUM_BNOi;
297
298 if (!xfs_verify_magic(bp, block->bb_magic))
299 return __this_address;
300
301 if (xfs_sb_version_hascrc(&mp->m_sb)) {
302 fa = xfs_btree_sblock_v5hdr_verify(bp);
303 if (fa)
304 return fa;
305 }
306
307 /*
308 * The perag may not be attached during grow operations or fully
309 * initialized from the AGF during log recovery. Therefore we can only
310 * check against maximum tree depth from those contexts.
311 *
312 * Otherwise check against the per-tree limit. Peek at one of the
313 * verifier magic values to determine the type of tree we're verifying
314 * against.
315 */
316 level = be16_to_cpu(block->bb_level);
317 if (bp->b_ops->magic[0] == cpu_to_be32(XFS_ABTC_MAGIC))
318 btnum = XFS_BTNUM_CNTi;
319 if (pag && pag->pagf_init) {
320 if (level >= pag->pagf_levels[btnum])
321 return __this_address;
322 } else if (level >= mp->m_ag_maxlevels)
323 return __this_address;
324
325 return xfs_btree_sblock_verify(bp, mp->m_alloc_mxr[level != 0]);
326}
327
328static void
329xfs_allocbt_read_verify(
330 struct xfs_buf *bp)
331{
332 xfs_failaddr_t fa;
333
334 if (!xfs_btree_sblock_verify_crc(bp))
335 xfs_verifier_error(bp, -EFSBADCRC, __this_address);
336 else {
337 fa = xfs_allocbt_verify(bp);
338 if (fa)
339 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
340 }
341
342 if (bp->b_error)
343 trace_xfs_btree_corrupt(bp, _RET_IP_);
344}
345
346static void
347xfs_allocbt_write_verify(
348 struct xfs_buf *bp)
349{
350 xfs_failaddr_t fa;
351
352 fa = xfs_allocbt_verify(bp);
353 if (fa) {
354 trace_xfs_btree_corrupt(bp, _RET_IP_);
355 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
356 return;
357 }
358 xfs_btree_sblock_calc_crc(bp);
359
360}
361
362const struct xfs_buf_ops xfs_bnobt_buf_ops = {
363 .name = "xfs_bnobt",
364 .magic = { cpu_to_be32(XFS_ABTB_MAGIC),
365 cpu_to_be32(XFS_ABTB_CRC_MAGIC) },
366 .verify_read = xfs_allocbt_read_verify,
367 .verify_write = xfs_allocbt_write_verify,
368 .verify_struct = xfs_allocbt_verify,
369};
370
371const struct xfs_buf_ops xfs_cntbt_buf_ops = {
372 .name = "xfs_cntbt",
373 .magic = { cpu_to_be32(XFS_ABTC_MAGIC),
374 cpu_to_be32(XFS_ABTC_CRC_MAGIC) },
375 .verify_read = xfs_allocbt_read_verify,
376 .verify_write = xfs_allocbt_write_verify,
377 .verify_struct = xfs_allocbt_verify,
378};
379
380STATIC int
381xfs_bnobt_keys_inorder(
382 struct xfs_btree_cur *cur,
383 union xfs_btree_key *k1,
384 union xfs_btree_key *k2)
385{
386 return be32_to_cpu(k1->alloc.ar_startblock) <
387 be32_to_cpu(k2->alloc.ar_startblock);
388}
389
390STATIC int
391xfs_bnobt_recs_inorder(
392 struct xfs_btree_cur *cur,
393 union xfs_btree_rec *r1,
394 union xfs_btree_rec *r2)
395{
396 return be32_to_cpu(r1->alloc.ar_startblock) +
397 be32_to_cpu(r1->alloc.ar_blockcount) <=
398 be32_to_cpu(r2->alloc.ar_startblock);
399}
400
401STATIC int
402xfs_cntbt_keys_inorder(
403 struct xfs_btree_cur *cur,
404 union xfs_btree_key *k1,
405 union xfs_btree_key *k2)
406{
407 return be32_to_cpu(k1->alloc.ar_blockcount) <
408 be32_to_cpu(k2->alloc.ar_blockcount) ||
409 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
410 be32_to_cpu(k1->alloc.ar_startblock) <
411 be32_to_cpu(k2->alloc.ar_startblock));
412}
413
414STATIC int
415xfs_cntbt_recs_inorder(
416 struct xfs_btree_cur *cur,
417 union xfs_btree_rec *r1,
418 union xfs_btree_rec *r2)
419{
420 return be32_to_cpu(r1->alloc.ar_blockcount) <
421 be32_to_cpu(r2->alloc.ar_blockcount) ||
422 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
423 be32_to_cpu(r1->alloc.ar_startblock) <
424 be32_to_cpu(r2->alloc.ar_startblock));
425}
426
427static const struct xfs_btree_ops xfs_bnobt_ops = {
428 .rec_len = sizeof(xfs_alloc_rec_t),
429 .key_len = sizeof(xfs_alloc_key_t),
430
431 .dup_cursor = xfs_allocbt_dup_cursor,
432 .set_root = xfs_allocbt_set_root,
433 .alloc_block = xfs_allocbt_alloc_block,
434 .free_block = xfs_allocbt_free_block,
435 .update_lastrec = xfs_allocbt_update_lastrec,
436 .get_minrecs = xfs_allocbt_get_minrecs,
437 .get_maxrecs = xfs_allocbt_get_maxrecs,
438 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
439 .init_high_key_from_rec = xfs_bnobt_init_high_key_from_rec,
440 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
441 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
442 .key_diff = xfs_bnobt_key_diff,
443 .buf_ops = &xfs_bnobt_buf_ops,
444 .diff_two_keys = xfs_bnobt_diff_two_keys,
445 .keys_inorder = xfs_bnobt_keys_inorder,
446 .recs_inorder = xfs_bnobt_recs_inorder,
447};
448
449static const struct xfs_btree_ops xfs_cntbt_ops = {
450 .rec_len = sizeof(xfs_alloc_rec_t),
451 .key_len = sizeof(xfs_alloc_key_t),
452
453 .dup_cursor = xfs_allocbt_dup_cursor,
454 .set_root = xfs_allocbt_set_root,
455 .alloc_block = xfs_allocbt_alloc_block,
456 .free_block = xfs_allocbt_free_block,
457 .update_lastrec = xfs_allocbt_update_lastrec,
458 .get_minrecs = xfs_allocbt_get_minrecs,
459 .get_maxrecs = xfs_allocbt_get_maxrecs,
460 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
461 .init_high_key_from_rec = xfs_cntbt_init_high_key_from_rec,
462 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
463 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
464 .key_diff = xfs_cntbt_key_diff,
465 .buf_ops = &xfs_cntbt_buf_ops,
466 .diff_two_keys = xfs_cntbt_diff_two_keys,
467 .keys_inorder = xfs_cntbt_keys_inorder,
468 .recs_inorder = xfs_cntbt_recs_inorder,
469};
470
471/* Allocate most of a new allocation btree cursor. */
472STATIC struct xfs_btree_cur *
473xfs_allocbt_init_common(
474 struct xfs_mount *mp,
475 struct xfs_trans *tp,
476 xfs_agnumber_t agno,
477 xfs_btnum_t btnum)
478{
479 struct xfs_btree_cur *cur;
480
481 ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
482
483 cur = kmem_cache_zalloc(xfs_btree_cur_zone, GFP_NOFS | __GFP_NOFAIL);
484
485 cur->bc_tp = tp;
486 cur->bc_mp = mp;
487 cur->bc_btnum = btnum;
488 cur->bc_blocklog = mp->m_sb.sb_blocklog;
489
490 if (btnum == XFS_BTNUM_CNT) {
491 cur->bc_ops = &xfs_cntbt_ops;
492 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtc_2);
493 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
494 } else {
495 cur->bc_ops = &xfs_bnobt_ops;
496 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtb_2);
497 }
498
499 cur->bc_ag.agno = agno;
500 cur->bc_ag.abt.active = false;
501
502 if (xfs_sb_version_hascrc(&mp->m_sb))
503 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
504
505 return cur;
506}
507
508/*
509 * Allocate a new allocation btree cursor.
510 */
511struct xfs_btree_cur * /* new alloc btree cursor */
512xfs_allocbt_init_cursor(
513 struct xfs_mount *mp, /* file system mount point */
514 struct xfs_trans *tp, /* transaction pointer */
515 struct xfs_buf *agbp, /* buffer for agf structure */
516 xfs_agnumber_t agno, /* allocation group number */
517 xfs_btnum_t btnum) /* btree identifier */
518{
519 struct xfs_agf *agf = agbp->b_addr;
520 struct xfs_btree_cur *cur;
521
522 cur = xfs_allocbt_init_common(mp, tp, agno, btnum);
523 if (btnum == XFS_BTNUM_CNT)
524 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
525 else
526 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
527
528 cur->bc_ag.agbp = agbp;
529
530 return cur;
531}
532
533/* Create a free space btree cursor with a fake root for staging. */
534struct xfs_btree_cur *
535xfs_allocbt_stage_cursor(
536 struct xfs_mount *mp,
537 struct xbtree_afakeroot *afake,
538 xfs_agnumber_t agno,
539 xfs_btnum_t btnum)
540{
541 struct xfs_btree_cur *cur;
542
543 cur = xfs_allocbt_init_common(mp, NULL, agno, btnum);
544 xfs_btree_stage_afakeroot(cur, afake);
545 return cur;
546}
547
548/*
549 * Install a new free space btree root. Caller is responsible for invalidating
550 * and freeing the old btree blocks.
551 */
552void
553xfs_allocbt_commit_staged_btree(
554 struct xfs_btree_cur *cur,
555 struct xfs_trans *tp,
556 struct xfs_buf *agbp)
557{
558 struct xfs_agf *agf = agbp->b_addr;
559 struct xbtree_afakeroot *afake = cur->bc_ag.afake;
560
561 ASSERT(cur->bc_flags & XFS_BTREE_STAGING);
562
563 agf->agf_roots[cur->bc_btnum] = cpu_to_be32(afake->af_root);
564 agf->agf_levels[cur->bc_btnum] = cpu_to_be32(afake->af_levels);
565 xfs_alloc_log_agf(tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
566
567 if (cur->bc_btnum == XFS_BTNUM_BNO) {
568 xfs_btree_commit_afakeroot(cur, tp, agbp, &xfs_bnobt_ops);
569 } else {
570 cur->bc_flags |= XFS_BTREE_LASTREC_UPDATE;
571 xfs_btree_commit_afakeroot(cur, tp, agbp, &xfs_cntbt_ops);
572 }
573}
574
575/*
576 * Calculate number of records in an alloc btree block.
577 */
578int
579xfs_allocbt_maxrecs(
580 struct xfs_mount *mp,
581 int blocklen,
582 int leaf)
583{
584 blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
585
586 if (leaf)
587 return blocklen / sizeof(xfs_alloc_rec_t);
588 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));
589}
590
591/* Calculate the freespace btree size for some records. */
592xfs_extlen_t
593xfs_allocbt_calc_size(
594 struct xfs_mount *mp,
595 unsigned long long len)
596{
597 return xfs_btree_calc_size(mp->m_alloc_mnr, len);
598}