]> git.ipfire.org Git - thirdparty/xfsprogs-dev.git/blob - libxfs/xfs_ialloc_btree.c
libxfs: refactor manage_zones()
[thirdparty/xfsprogs-dev.git] / libxfs / xfs_ialloc_btree.c
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6 #include "libxfs_priv.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_bit.h"
13 #include "xfs_mount.h"
14 #include "xfs_inode.h"
15 #include "xfs_btree.h"
16 #include "xfs_ialloc.h"
17 #include "xfs_ialloc_btree.h"
18 #include "xfs_alloc.h"
19 #include "xfs_trace.h"
20 #include "xfs_cksum.h"
21 #include "xfs_trans.h"
22 #include "xfs_rmap.h"
23
24
25 STATIC int
26 xfs_inobt_get_minrecs(
27 struct xfs_btree_cur *cur,
28 int level)
29 {
30 return cur->bc_mp->m_inobt_mnr[level != 0];
31 }
32
33 STATIC struct xfs_btree_cur *
34 xfs_inobt_dup_cursor(
35 struct xfs_btree_cur *cur)
36 {
37 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
38 cur->bc_private.a.agbp, cur->bc_private.a.agno,
39 cur->bc_btnum);
40 }
41
42 STATIC void
43 xfs_inobt_set_root(
44 struct xfs_btree_cur *cur,
45 union xfs_btree_ptr *nptr,
46 int inc) /* level change */
47 {
48 struct xfs_buf *agbp = cur->bc_private.a.agbp;
49 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
50
51 agi->agi_root = nptr->s;
52 be32_add_cpu(&agi->agi_level, inc);
53 xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
54 }
55
56 STATIC void
57 xfs_finobt_set_root(
58 struct xfs_btree_cur *cur,
59 union xfs_btree_ptr *nptr,
60 int inc) /* level change */
61 {
62 struct xfs_buf *agbp = cur->bc_private.a.agbp;
63 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
64
65 agi->agi_free_root = nptr->s;
66 be32_add_cpu(&agi->agi_free_level, inc);
67 xfs_ialloc_log_agi(cur->bc_tp, agbp,
68 XFS_AGI_FREE_ROOT | XFS_AGI_FREE_LEVEL);
69 }
70
71 STATIC int
72 __xfs_inobt_alloc_block(
73 struct xfs_btree_cur *cur,
74 union xfs_btree_ptr *start,
75 union xfs_btree_ptr *new,
76 int *stat,
77 enum xfs_ag_resv_type resv)
78 {
79 xfs_alloc_arg_t args; /* block allocation args */
80 int error; /* error return value */
81 xfs_agblock_t sbno = be32_to_cpu(start->s);
82
83 memset(&args, 0, sizeof(args));
84 args.tp = cur->bc_tp;
85 args.mp = cur->bc_mp;
86 args.oinfo = XFS_RMAP_OINFO_INOBT;
87 args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
88 args.minlen = 1;
89 args.maxlen = 1;
90 args.prod = 1;
91 args.type = XFS_ALLOCTYPE_NEAR_BNO;
92 args.resv = resv;
93
94 error = xfs_alloc_vextent(&args);
95 if (error)
96 return error;
97
98 if (args.fsbno == NULLFSBLOCK) {
99 *stat = 0;
100 return 0;
101 }
102 ASSERT(args.len == 1);
103
104 new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
105 *stat = 1;
106 return 0;
107 }
108
109 STATIC int
110 xfs_inobt_alloc_block(
111 struct xfs_btree_cur *cur,
112 union xfs_btree_ptr *start,
113 union xfs_btree_ptr *new,
114 int *stat)
115 {
116 return __xfs_inobt_alloc_block(cur, start, new, stat, XFS_AG_RESV_NONE);
117 }
118
119 STATIC int
120 xfs_finobt_alloc_block(
121 struct xfs_btree_cur *cur,
122 union xfs_btree_ptr *start,
123 union xfs_btree_ptr *new,
124 int *stat)
125 {
126 if (cur->bc_mp->m_inotbt_nores)
127 return xfs_inobt_alloc_block(cur, start, new, stat);
128 return __xfs_inobt_alloc_block(cur, start, new, stat,
129 XFS_AG_RESV_METADATA);
130 }
131
132 STATIC int
133 __xfs_inobt_free_block(
134 struct xfs_btree_cur *cur,
135 struct xfs_buf *bp,
136 enum xfs_ag_resv_type resv)
137 {
138 return xfs_free_extent(cur->bc_tp,
139 XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp)), 1,
140 &XFS_RMAP_OINFO_INOBT, resv);
141 }
142
143 STATIC int
144 xfs_inobt_free_block(
145 struct xfs_btree_cur *cur,
146 struct xfs_buf *bp)
147 {
148 return __xfs_inobt_free_block(cur, bp, XFS_AG_RESV_NONE);
149 }
150
151 STATIC int
152 xfs_finobt_free_block(
153 struct xfs_btree_cur *cur,
154 struct xfs_buf *bp)
155 {
156 if (cur->bc_mp->m_inotbt_nores)
157 return xfs_inobt_free_block(cur, bp);
158 return __xfs_inobt_free_block(cur, bp, XFS_AG_RESV_METADATA);
159 }
160
161 STATIC int
162 xfs_inobt_get_maxrecs(
163 struct xfs_btree_cur *cur,
164 int level)
165 {
166 return cur->bc_mp->m_inobt_mxr[level != 0];
167 }
168
169 STATIC void
170 xfs_inobt_init_key_from_rec(
171 union xfs_btree_key *key,
172 union xfs_btree_rec *rec)
173 {
174 key->inobt.ir_startino = rec->inobt.ir_startino;
175 }
176
177 STATIC void
178 xfs_inobt_init_high_key_from_rec(
179 union xfs_btree_key *key,
180 union xfs_btree_rec *rec)
181 {
182 __u32 x;
183
184 x = be32_to_cpu(rec->inobt.ir_startino);
185 x += XFS_INODES_PER_CHUNK - 1;
186 key->inobt.ir_startino = cpu_to_be32(x);
187 }
188
189 STATIC void
190 xfs_inobt_init_rec_from_cur(
191 struct xfs_btree_cur *cur,
192 union xfs_btree_rec *rec)
193 {
194 rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
195 if (xfs_sb_version_hassparseinodes(&cur->bc_mp->m_sb)) {
196 rec->inobt.ir_u.sp.ir_holemask =
197 cpu_to_be16(cur->bc_rec.i.ir_holemask);
198 rec->inobt.ir_u.sp.ir_count = cur->bc_rec.i.ir_count;
199 rec->inobt.ir_u.sp.ir_freecount = cur->bc_rec.i.ir_freecount;
200 } else {
201 /* ir_holemask/ir_count not supported on-disk */
202 rec->inobt.ir_u.f.ir_freecount =
203 cpu_to_be32(cur->bc_rec.i.ir_freecount);
204 }
205 rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
206 }
207
208 /*
209 * initial value of ptr for lookup
210 */
211 STATIC void
212 xfs_inobt_init_ptr_from_cur(
213 struct xfs_btree_cur *cur,
214 union xfs_btree_ptr *ptr)
215 {
216 struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
217
218 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
219
220 ptr->s = agi->agi_root;
221 }
222
223 STATIC void
224 xfs_finobt_init_ptr_from_cur(
225 struct xfs_btree_cur *cur,
226 union xfs_btree_ptr *ptr)
227 {
228 struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
229
230 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
231 ptr->s = agi->agi_free_root;
232 }
233
234 STATIC int64_t
235 xfs_inobt_key_diff(
236 struct xfs_btree_cur *cur,
237 union xfs_btree_key *key)
238 {
239 return (int64_t)be32_to_cpu(key->inobt.ir_startino) -
240 cur->bc_rec.i.ir_startino;
241 }
242
243 STATIC int64_t
244 xfs_inobt_diff_two_keys(
245 struct xfs_btree_cur *cur,
246 union xfs_btree_key *k1,
247 union xfs_btree_key *k2)
248 {
249 return (int64_t)be32_to_cpu(k1->inobt.ir_startino) -
250 be32_to_cpu(k2->inobt.ir_startino);
251 }
252
253 static xfs_failaddr_t
254 xfs_inobt_verify(
255 struct xfs_buf *bp)
256 {
257 struct xfs_mount *mp = bp->b_target->bt_mount;
258 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
259 xfs_failaddr_t fa;
260 unsigned int level;
261
262 /*
263 * During growfs operations, we can't verify the exact owner as the
264 * perag is not fully initialised and hence not attached to the buffer.
265 *
266 * Similarly, during log recovery we will have a perag structure
267 * attached, but the agi information will not yet have been initialised
268 * from the on disk AGI. We don't currently use any of this information,
269 * but beware of the landmine (i.e. need to check pag->pagi_init) if we
270 * ever do.
271 */
272 switch (block->bb_magic) {
273 case cpu_to_be32(XFS_IBT_CRC_MAGIC):
274 case cpu_to_be32(XFS_FIBT_CRC_MAGIC):
275 fa = xfs_btree_sblock_v5hdr_verify(bp);
276 if (fa)
277 return fa;
278 /* fall through */
279 case cpu_to_be32(XFS_IBT_MAGIC):
280 case cpu_to_be32(XFS_FIBT_MAGIC):
281 break;
282 default:
283 return __this_address;
284 }
285
286 /* level verification */
287 level = be16_to_cpu(block->bb_level);
288 if (level >= mp->m_in_maxlevels)
289 return __this_address;
290
291 return xfs_btree_sblock_verify(bp, mp->m_inobt_mxr[level != 0]);
292 }
293
294 static void
295 xfs_inobt_read_verify(
296 struct xfs_buf *bp)
297 {
298 xfs_failaddr_t fa;
299
300 if (!xfs_btree_sblock_verify_crc(bp))
301 xfs_verifier_error(bp, -EFSBADCRC, __this_address);
302 else {
303 fa = xfs_inobt_verify(bp);
304 if (fa)
305 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
306 }
307
308 if (bp->b_error)
309 trace_xfs_btree_corrupt(bp, _RET_IP_);
310 }
311
312 static void
313 xfs_inobt_write_verify(
314 struct xfs_buf *bp)
315 {
316 xfs_failaddr_t fa;
317
318 fa = xfs_inobt_verify(bp);
319 if (fa) {
320 trace_xfs_btree_corrupt(bp, _RET_IP_);
321 xfs_verifier_error(bp, -EFSCORRUPTED, fa);
322 return;
323 }
324 xfs_btree_sblock_calc_crc(bp);
325
326 }
327
328 const struct xfs_buf_ops xfs_inobt_buf_ops = {
329 .name = "xfs_inobt",
330 .verify_read = xfs_inobt_read_verify,
331 .verify_write = xfs_inobt_write_verify,
332 .verify_struct = xfs_inobt_verify,
333 };
334
335 STATIC int
336 xfs_inobt_keys_inorder(
337 struct xfs_btree_cur *cur,
338 union xfs_btree_key *k1,
339 union xfs_btree_key *k2)
340 {
341 return be32_to_cpu(k1->inobt.ir_startino) <
342 be32_to_cpu(k2->inobt.ir_startino);
343 }
344
345 STATIC int
346 xfs_inobt_recs_inorder(
347 struct xfs_btree_cur *cur,
348 union xfs_btree_rec *r1,
349 union xfs_btree_rec *r2)
350 {
351 return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
352 be32_to_cpu(r2->inobt.ir_startino);
353 }
354
355 static const struct xfs_btree_ops xfs_inobt_ops = {
356 .rec_len = sizeof(xfs_inobt_rec_t),
357 .key_len = sizeof(xfs_inobt_key_t),
358
359 .dup_cursor = xfs_inobt_dup_cursor,
360 .set_root = xfs_inobt_set_root,
361 .alloc_block = xfs_inobt_alloc_block,
362 .free_block = xfs_inobt_free_block,
363 .get_minrecs = xfs_inobt_get_minrecs,
364 .get_maxrecs = xfs_inobt_get_maxrecs,
365 .init_key_from_rec = xfs_inobt_init_key_from_rec,
366 .init_high_key_from_rec = xfs_inobt_init_high_key_from_rec,
367 .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
368 .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
369 .key_diff = xfs_inobt_key_diff,
370 .buf_ops = &xfs_inobt_buf_ops,
371 .diff_two_keys = xfs_inobt_diff_two_keys,
372 .keys_inorder = xfs_inobt_keys_inorder,
373 .recs_inorder = xfs_inobt_recs_inorder,
374 };
375
376 static const struct xfs_btree_ops xfs_finobt_ops = {
377 .rec_len = sizeof(xfs_inobt_rec_t),
378 .key_len = sizeof(xfs_inobt_key_t),
379
380 .dup_cursor = xfs_inobt_dup_cursor,
381 .set_root = xfs_finobt_set_root,
382 .alloc_block = xfs_finobt_alloc_block,
383 .free_block = xfs_finobt_free_block,
384 .get_minrecs = xfs_inobt_get_minrecs,
385 .get_maxrecs = xfs_inobt_get_maxrecs,
386 .init_key_from_rec = xfs_inobt_init_key_from_rec,
387 .init_high_key_from_rec = xfs_inobt_init_high_key_from_rec,
388 .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
389 .init_ptr_from_cur = xfs_finobt_init_ptr_from_cur,
390 .key_diff = xfs_inobt_key_diff,
391 .buf_ops = &xfs_inobt_buf_ops,
392 .diff_two_keys = xfs_inobt_diff_two_keys,
393 .keys_inorder = xfs_inobt_keys_inorder,
394 .recs_inorder = xfs_inobt_recs_inorder,
395 };
396
397 /*
398 * Allocate a new inode btree cursor.
399 */
400 struct xfs_btree_cur * /* new inode btree cursor */
401 xfs_inobt_init_cursor(
402 struct xfs_mount *mp, /* file system mount point */
403 struct xfs_trans *tp, /* transaction pointer */
404 struct xfs_buf *agbp, /* buffer for agi structure */
405 xfs_agnumber_t agno, /* allocation group number */
406 xfs_btnum_t btnum) /* ialloc or free ino btree */
407 {
408 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
409 struct xfs_btree_cur *cur;
410
411 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_NOFS);
412
413 cur->bc_tp = tp;
414 cur->bc_mp = mp;
415 cur->bc_btnum = btnum;
416 if (btnum == XFS_BTNUM_INO) {
417 cur->bc_nlevels = be32_to_cpu(agi->agi_level);
418 cur->bc_ops = &xfs_inobt_ops;
419 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_ibt_2);
420 } else {
421 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level);
422 cur->bc_ops = &xfs_finobt_ops;
423 cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_fibt_2);
424 }
425
426 cur->bc_blocklog = mp->m_sb.sb_blocklog;
427
428 if (xfs_sb_version_hascrc(&mp->m_sb))
429 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
430
431 cur->bc_private.a.agbp = agbp;
432 cur->bc_private.a.agno = agno;
433
434 return cur;
435 }
436
437 /*
438 * Calculate number of records in an inobt btree block.
439 */
440 int
441 xfs_inobt_maxrecs(
442 struct xfs_mount *mp,
443 int blocklen,
444 int leaf)
445 {
446 blocklen -= XFS_INOBT_BLOCK_LEN(mp);
447
448 if (leaf)
449 return blocklen / sizeof(xfs_inobt_rec_t);
450 return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
451 }
452
453 /*
454 * Convert the inode record holemask to an inode allocation bitmap. The inode
455 * allocation bitmap is inode granularity and specifies whether an inode is
456 * physically allocated on disk (not whether the inode is considered allocated
457 * or free by the fs).
458 *
459 * A bit value of 1 means the inode is allocated, a value of 0 means it is free.
460 */
461 uint64_t
462 xfs_inobt_irec_to_allocmask(
463 struct xfs_inobt_rec_incore *rec)
464 {
465 uint64_t bitmap = 0;
466 uint64_t inodespbit;
467 int nextbit;
468 uint allocbitmap;
469
470 /*
471 * The holemask has 16-bits for a 64 inode record. Therefore each
472 * holemask bit represents multiple inodes. Create a mask of bits to set
473 * in the allocmask for each holemask bit.
474 */
475 inodespbit = (1 << XFS_INODES_PER_HOLEMASK_BIT) - 1;
476
477 /*
478 * Allocated inodes are represented by 0 bits in holemask. Invert the 0
479 * bits to 1 and convert to a uint so we can use xfs_next_bit(). Mask
480 * anything beyond the 16 holemask bits since this casts to a larger
481 * type.
482 */
483 allocbitmap = ~rec->ir_holemask & ((1 << XFS_INOBT_HOLEMASK_BITS) - 1);
484
485 /*
486 * allocbitmap is the inverted holemask so every set bit represents
487 * allocated inodes. To expand from 16-bit holemask granularity to
488 * 64-bit (e.g., bit-per-inode), set inodespbit bits in the target
489 * bitmap for every holemask bit.
490 */
491 nextbit = xfs_next_bit(&allocbitmap, 1, 0);
492 while (nextbit != -1) {
493 ASSERT(nextbit < (sizeof(rec->ir_holemask) * NBBY));
494
495 bitmap |= (inodespbit <<
496 (nextbit * XFS_INODES_PER_HOLEMASK_BIT));
497
498 nextbit = xfs_next_bit(&allocbitmap, 1, nextbit + 1);
499 }
500
501 return bitmap;
502 }
503
504 #if defined(DEBUG) || defined(XFS_WARN)
505 /*
506 * Verify that an in-core inode record has a valid inode count.
507 */
508 int
509 xfs_inobt_rec_check_count(
510 struct xfs_mount *mp,
511 struct xfs_inobt_rec_incore *rec)
512 {
513 int inocount = 0;
514 int nextbit = 0;
515 uint64_t allocbmap;
516 int wordsz;
517
518 wordsz = sizeof(allocbmap) / sizeof(unsigned int);
519 allocbmap = xfs_inobt_irec_to_allocmask(rec);
520
521 nextbit = xfs_next_bit((uint *) &allocbmap, wordsz, nextbit);
522 while (nextbit != -1) {
523 inocount++;
524 nextbit = xfs_next_bit((uint *) &allocbmap, wordsz,
525 nextbit + 1);
526 }
527
528 if (inocount != rec->ir_count)
529 return -EFSCORRUPTED;
530
531 return 0;
532 }
533 #endif /* DEBUG */
534
535 static xfs_extlen_t
536 xfs_inobt_max_size(
537 struct xfs_mount *mp,
538 xfs_agnumber_t agno)
539 {
540 xfs_agblock_t agblocks = xfs_ag_block_count(mp, agno);
541
542 /* Bail out if we're uninitialized, which can happen in mkfs. */
543 if (mp->m_inobt_mxr[0] == 0)
544 return 0;
545
546 return xfs_btree_calc_size(mp->m_inobt_mnr,
547 (uint64_t)agblocks * mp->m_sb.sb_inopblock /
548 XFS_INODES_PER_CHUNK);
549 }
550
551 static int
552 xfs_inobt_count_blocks(
553 struct xfs_mount *mp,
554 struct xfs_trans *tp,
555 xfs_agnumber_t agno,
556 xfs_btnum_t btnum,
557 xfs_extlen_t *tree_blocks)
558 {
559 struct xfs_buf *agbp;
560 struct xfs_btree_cur *cur;
561 int error;
562
563 error = xfs_ialloc_read_agi(mp, tp, agno, &agbp);
564 if (error)
565 return error;
566
567 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, btnum);
568 error = xfs_btree_count_blocks(cur, tree_blocks);
569 xfs_btree_del_cursor(cur, error);
570 xfs_trans_brelse(tp, agbp);
571
572 return error;
573 }
574
575 /*
576 * Figure out how many blocks to reserve and how many are used by this btree.
577 */
578 int
579 xfs_finobt_calc_reserves(
580 struct xfs_mount *mp,
581 struct xfs_trans *tp,
582 xfs_agnumber_t agno,
583 xfs_extlen_t *ask,
584 xfs_extlen_t *used)
585 {
586 xfs_extlen_t tree_len = 0;
587 int error;
588
589 if (!xfs_sb_version_hasfinobt(&mp->m_sb))
590 return 0;
591
592 error = xfs_inobt_count_blocks(mp, tp, agno, XFS_BTNUM_FINO, &tree_len);
593 if (error)
594 return error;
595
596 *ask += xfs_inobt_max_size(mp, agno);
597 *used += tree_len;
598 return 0;
599 }
600
601 /* Calculate the inobt btree size for some records. */
602 xfs_extlen_t
603 xfs_iallocbt_calc_size(
604 struct xfs_mount *mp,
605 unsigned long long len)
606 {
607 return xfs_btree_calc_size(mp->m_inobt_mnr, len);
608 }