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/*
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_sb.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"
34
35
36STATIC struct xfs_btree_cur *
37xfs_allocbt_dup_cursor(
38 struct xfs_btree_cur *cur)
39{
40 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
41 cur->bc_private.a.agbp, cur->bc_private.a.agno,
42 cur->bc_btnum);
43}
44
45STATIC void
46xfs_allocbt_set_root(
47 struct xfs_btree_cur *cur,
48 union xfs_btree_ptr *ptr,
49 int inc)
50{
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);
56
57 ASSERT(ptr->s != 0);
58
59 agf->agf_roots[btnum] = ptr->s;
60 be32_add_cpu(&agf->agf_levels[btnum], inc);
61 pag->pagf_levels[btnum] += inc;
62 xfs_perag_put(pag);
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 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 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
78
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,
81 &bno, 1);
82 if (error) {
83 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
84 return error;
85 }
86
87 if (bno == NULLAGBLOCK) {
88 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
89 *stat = 0;
90 return 0;
91 }
92
93 xfs_extent_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false);
94
95 xfs_trans_agbtree_delta(cur->bc_tp, 1);
96 new->s = cpu_to_be32(bno);
97
98 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
99 *stat = 1;
100 return 0;
101}
102
103STATIC int
104xfs_allocbt_free_block(
105 struct xfs_btree_cur *cur,
106 struct xfs_buf *bp)
107{
108 struct xfs_buf *agbp = cur->bc_private.a.agbp;
109 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
110 xfs_agblock_t bno;
111 int error;
112
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);
115 if (error)
116 return error;
117
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);
121 return 0;
122}
123
124/*
125 * Update the longest extent in the AGF
126 */
127STATIC void
128xfs_allocbt_update_lastrec(
129 struct xfs_btree_cur *cur,
130 struct xfs_btree_block *block,
131 union xfs_btree_rec *rec,
132 int ptr,
133 int reason)
134{
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;
138 __be32 len;
139 int numrecs;
140
141 ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
142
143 switch (reason) {
144 case LASTREC_UPDATE:
145 /*
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.
148 */
149 if (ptr != xfs_btree_get_numrecs(block))
150 return;
151 len = rec->alloc.ar_blockcount;
152 break;
153 case LASTREC_INSREC:
154 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
155 be32_to_cpu(agf->agf_longest))
156 return;
157 len = rec->alloc.ar_blockcount;
158 break;
159 case LASTREC_DELREC:
160 numrecs = xfs_btree_get_numrecs(block);
161 if (ptr <= numrecs)
162 return;
163 ASSERT(ptr == numrecs + 1);
164
165 if (numrecs) {
166 xfs_alloc_rec_t *rrp;
167
168 rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
169 len = rrp->ar_blockcount;
170 } else {
171 len = 0;
172 }
173
174 break;
175 default:
176 ASSERT(0);
177 return;
178 }
179
180 agf->agf_longest = len;
181 pag = xfs_perag_get(cur->bc_mp, seqno);
182 pag->pagf_longest = be32_to_cpu(len);
183 xfs_perag_put(pag);
184 xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
185}
186
187STATIC int
188xfs_allocbt_get_minrecs(
189 struct xfs_btree_cur *cur,
190 int level)
191{
192 return cur->bc_mp->m_alloc_mnr[level != 0];
193}
194
195STATIC int
196xfs_allocbt_get_maxrecs(
197 struct xfs_btree_cur *cur,
198 int level)
199{
200 return cur->bc_mp->m_alloc_mxr[level != 0];
201}
202
203STATIC void
204xfs_allocbt_init_key_from_rec(
205 union xfs_btree_key *key,
206 union xfs_btree_rec *rec)
207{
208 ASSERT(rec->alloc.ar_startblock != 0);
209
210 key->alloc.ar_startblock = rec->alloc.ar_startblock;
211 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
212}
213
214STATIC void
215xfs_allocbt_init_rec_from_cur(
216 struct xfs_btree_cur *cur,
217 union xfs_btree_rec *rec)
218{
219 ASSERT(cur->bc_rec.a.ar_startblock != 0);
220
221 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
222 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
223}
224
225STATIC void
226xfs_allocbt_init_ptr_from_cur(
227 struct xfs_btree_cur *cur,
228 union xfs_btree_ptr *ptr)
229{
230 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
231
232 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
233 ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
234
235 ptr->s = agf->agf_roots[cur->bc_btnum];
236}
237
238STATIC __int64_t
239xfs_allocbt_key_diff(
240 struct xfs_btree_cur *cur,
241 union xfs_btree_key *key)
242{
243 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
244 xfs_alloc_key_t *kp = &key->alloc;
245 __int64_t diff;
246
247 if (cur->bc_btnum == XFS_BTNUM_BNO) {
248 return (__int64_t)be32_to_cpu(kp->ar_startblock) -
249 rec->ar_startblock;
250 }
251
252 diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
253 if (diff)
254 return diff;
255
256 return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
257}
258
259static bool
260xfs_allocbt_verify(
261 struct xfs_buf *bp)
262{
263 struct xfs_mount *mp = bp->b_target->bt_mount;
264 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
265 struct xfs_perag *pag = bp->b_pag;
266 unsigned int level;
267
268 /*
269 * magic number and level verification
270 *
271 * During growfs operations, we can't verify the exact level or owner as
272 * the perag is not fully initialised and hence not attached to the
273 * buffer. In this case, check against the maximum tree depth.
274 *
275 * Similarly, during log recovery we will have a perag structure
276 * attached, but the agf information will not yet have been initialised
277 * from the on disk AGF. Again, we can only check against maximum limits
278 * in this case.
279 */
280 level = be16_to_cpu(block->bb_level);
281 switch (block->bb_magic) {
282 case cpu_to_be32(XFS_ABTB_CRC_MAGIC):
283 if (!xfs_btree_sblock_v5hdr_verify(bp))
284 return false;
285 /* fall through */
286 case cpu_to_be32(XFS_ABTB_MAGIC):
287 if (pag && pag->pagf_init) {
288 if (level >= pag->pagf_levels[XFS_BTNUM_BNOi])
289 return false;
290 } else if (level >= mp->m_ag_maxlevels)
291 return false;
292 break;
293 case cpu_to_be32(XFS_ABTC_CRC_MAGIC):
294 if (!xfs_btree_sblock_v5hdr_verify(bp))
295 return false;
296 /* fall through */
297 case cpu_to_be32(XFS_ABTC_MAGIC):
298 if (pag && pag->pagf_init) {
299 if (level >= pag->pagf_levels[XFS_BTNUM_CNTi])
300 return false;
301 } else if (level >= mp->m_ag_maxlevels)
302 return false;
303 break;
304 default:
305 return false;
306 }
307
308 return xfs_btree_sblock_verify(bp, mp->m_alloc_mxr[level != 0]);
309}
310
311static void
312xfs_allocbt_read_verify(
313 struct xfs_buf *bp)
314{
315 if (!xfs_btree_sblock_verify_crc(bp))
316 xfs_buf_ioerror(bp, -EFSBADCRC);
317 else if (!xfs_allocbt_verify(bp))
318 xfs_buf_ioerror(bp, -EFSCORRUPTED);
319
320 if (bp->b_error) {
321 trace_xfs_btree_corrupt(bp, _RET_IP_);
322 xfs_verifier_error(bp);
323 }
324}
325
326static void
327xfs_allocbt_write_verify(
328 struct xfs_buf *bp)
329{
330 if (!xfs_allocbt_verify(bp)) {
331 trace_xfs_btree_corrupt(bp, _RET_IP_);
332 xfs_buf_ioerror(bp, -EFSCORRUPTED);
333 xfs_verifier_error(bp);
334 return;
335 }
336 xfs_btree_sblock_calc_crc(bp);
337
338}
339
340const struct xfs_buf_ops xfs_allocbt_buf_ops = {
341 .name = "xfs_allocbt",
342 .verify_read = xfs_allocbt_read_verify,
343 .verify_write = xfs_allocbt_write_verify,
344};
345
346
347#if defined(DEBUG) || defined(XFS_WARN)
348STATIC int
349xfs_allocbt_keys_inorder(
350 struct xfs_btree_cur *cur,
351 union xfs_btree_key *k1,
352 union xfs_btree_key *k2)
353{
354 if (cur->bc_btnum == XFS_BTNUM_BNO) {
355 return be32_to_cpu(k1->alloc.ar_startblock) <
356 be32_to_cpu(k2->alloc.ar_startblock);
357 } else {
358 return be32_to_cpu(k1->alloc.ar_blockcount) <
359 be32_to_cpu(k2->alloc.ar_blockcount) ||
360 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
361 be32_to_cpu(k1->alloc.ar_startblock) <
362 be32_to_cpu(k2->alloc.ar_startblock));
363 }
364}
365
366STATIC int
367xfs_allocbt_recs_inorder(
368 struct xfs_btree_cur *cur,
369 union xfs_btree_rec *r1,
370 union xfs_btree_rec *r2)
371{
372 if (cur->bc_btnum == XFS_BTNUM_BNO) {
373 return be32_to_cpu(r1->alloc.ar_startblock) +
374 be32_to_cpu(r1->alloc.ar_blockcount) <=
375 be32_to_cpu(r2->alloc.ar_startblock);
376 } else {
377 return be32_to_cpu(r1->alloc.ar_blockcount) <
378 be32_to_cpu(r2->alloc.ar_blockcount) ||
379 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
380 be32_to_cpu(r1->alloc.ar_startblock) <
381 be32_to_cpu(r2->alloc.ar_startblock));
382 }
383}
384#endif /* DEBUG */
385
386static const struct xfs_btree_ops xfs_allocbt_ops = {
387 .rec_len = sizeof(xfs_alloc_rec_t),
388 .key_len = sizeof(xfs_alloc_key_t),
389
390 .dup_cursor = xfs_allocbt_dup_cursor,
391 .set_root = xfs_allocbt_set_root,
392 .alloc_block = xfs_allocbt_alloc_block,
393 .free_block = xfs_allocbt_free_block,
394 .update_lastrec = xfs_allocbt_update_lastrec,
395 .get_minrecs = xfs_allocbt_get_minrecs,
396 .get_maxrecs = xfs_allocbt_get_maxrecs,
397 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
398 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
399 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
400 .key_diff = xfs_allocbt_key_diff,
401 .buf_ops = &xfs_allocbt_buf_ops,
402#if defined(DEBUG) || defined(XFS_WARN)
403 .keys_inorder = xfs_allocbt_keys_inorder,
404 .recs_inorder = xfs_allocbt_recs_inorder,
405#endif
406};
407
408/*
409 * Allocate a new allocation btree cursor.
410 */
411struct xfs_btree_cur * /* new alloc btree cursor */
412xfs_allocbt_init_cursor(
413 struct xfs_mount *mp, /* file system mount point */
414 struct xfs_trans *tp, /* transaction pointer */
415 struct xfs_buf *agbp, /* buffer for agf structure */
416 xfs_agnumber_t agno, /* allocation group number */
417 xfs_btnum_t btnum) /* btree identifier */
418{
419 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
420 struct xfs_btree_cur *cur;
421
422 ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
423
424 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_NOFS);
425
426 cur->bc_tp = tp;
427 cur->bc_mp = mp;
428 cur->bc_btnum = btnum;
429 cur->bc_blocklog = mp->m_sb.sb_blocklog;
430 cur->bc_ops = &xfs_allocbt_ops;
431 if (btnum == XFS_BTNUM_BNO)
432 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtb_2);
433 else
434 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtc_2);
435
436 if (btnum == XFS_BTNUM_CNT) {
437 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
438 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
439 } else {
440 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
441 }
442
443 cur->bc_private.a.agbp = agbp;
444 cur->bc_private.a.agno = agno;
445
446 if (xfs_sb_version_hascrc(&mp->m_sb))
447 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
448
449 return cur;
450}
451
452/*
453 * Calculate number of records in an alloc btree block.
454 */
455int
456xfs_allocbt_maxrecs(
457 struct xfs_mount *mp,
458 int blocklen,
459 int leaf)
460{
461 blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
462
463 if (leaf)
464 return blocklen / sizeof(xfs_alloc_rec_t);
465 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));
466}