Line data Source code
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_bit.h"
13 : #include "xfs_mount.h"
14 : #include "xfs_btree.h"
15 : #include "xfs_btree_staging.h"
16 : #include "xfs_ialloc.h"
17 : #include "xfs_ialloc_btree.h"
18 : #include "xfs_alloc.h"
19 : #include "xfs_error.h"
20 : #include "xfs_trace.h"
21 : #include "xfs_trans.h"
22 : #include "xfs_rmap.h"
23 : #include "xfs_ag.h"
24 :
25 : static struct kmem_cache *xfs_inobt_cur_cache;
26 :
27 : STATIC int
28 2433433 : xfs_inobt_get_minrecs(
29 : struct xfs_btree_cur *cur,
30 : int level)
31 : {
32 2433433 : return M_IGEO(cur->bc_mp)->inobt_mnr[level != 0];
33 : }
34 :
35 : STATIC struct xfs_btree_cur *
36 105817488 : xfs_inobt_dup_cursor(
37 : struct xfs_btree_cur *cur)
38 : {
39 105817488 : return xfs_inobt_init_cursor(cur->bc_ag.pag, cur->bc_tp,
40 : cur->bc_ag.agbp, cur->bc_btnum);
41 : }
42 :
43 : STATIC void
44 1659 : xfs_inobt_set_root(
45 : struct xfs_btree_cur *cur,
46 : const union xfs_btree_ptr *nptr,
47 : int inc) /* level change */
48 : {
49 1659 : struct xfs_buf *agbp = cur->bc_ag.agbp;
50 1659 : struct xfs_agi *agi = agbp->b_addr;
51 :
52 1659 : agi->agi_root = nptr->s;
53 1659 : be32_add_cpu(&agi->agi_level, inc);
54 1659 : xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
55 1659 : }
56 :
57 : STATIC void
58 923 : xfs_finobt_set_root(
59 : struct xfs_btree_cur *cur,
60 : const union xfs_btree_ptr *nptr,
61 : int inc) /* level change */
62 : {
63 923 : struct xfs_buf *agbp = cur->bc_ag.agbp;
64 923 : struct xfs_agi *agi = agbp->b_addr;
65 :
66 923 : agi->agi_free_root = nptr->s;
67 923 : be32_add_cpu(&agi->agi_free_level, inc);
68 923 : xfs_ialloc_log_agi(cur->bc_tp, agbp,
69 : XFS_AGI_FREE_ROOT | XFS_AGI_FREE_LEVEL);
70 923 : }
71 :
72 : /* Update the inode btree block counter for this btree. */
73 : static inline void
74 9027 : xfs_inobt_mod_blockcount(
75 : struct xfs_btree_cur *cur,
76 : int howmuch)
77 : {
78 9027 : struct xfs_buf *agbp = cur->bc_ag.agbp;
79 9027 : struct xfs_agi *agi = agbp->b_addr;
80 :
81 9027 : if (!xfs_has_inobtcounts(cur->bc_mp))
82 : return;
83 :
84 9027 : if (cur->bc_btnum == XFS_BTNUM_FINO)
85 2453 : be32_add_cpu(&agi->agi_fblocks, howmuch);
86 6574 : else if (cur->bc_btnum == XFS_BTNUM_INO)
87 6574 : be32_add_cpu(&agi->agi_iblocks, howmuch);
88 9027 : xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_IBLOCKS);
89 : }
90 :
91 : STATIC int
92 6490 : __xfs_inobt_alloc_block(
93 : struct xfs_btree_cur *cur,
94 : const union xfs_btree_ptr *start,
95 : union xfs_btree_ptr *new,
96 : int *stat,
97 : enum xfs_ag_resv_type resv)
98 : {
99 6490 : xfs_alloc_arg_t args; /* block allocation args */
100 6490 : int error; /* error return value */
101 6490 : xfs_agblock_t sbno = be32_to_cpu(start->s);
102 :
103 6490 : memset(&args, 0, sizeof(args));
104 6490 : args.tp = cur->bc_tp;
105 6490 : args.mp = cur->bc_mp;
106 6490 : args.pag = cur->bc_ag.pag;
107 6490 : args.oinfo = XFS_RMAP_OINFO_INOBT;
108 6490 : args.minlen = 1;
109 6490 : args.maxlen = 1;
110 6490 : args.prod = 1;
111 6490 : args.resv = resv;
112 :
113 12980 : error = xfs_alloc_vextent_near_bno(&args,
114 6490 : XFS_AGB_TO_FSB(args.mp, args.pag->pag_agno, sbno));
115 6490 : if (error)
116 : return error;
117 :
118 6490 : if (args.fsbno == NULLFSBLOCK) {
119 0 : *stat = 0;
120 0 : return 0;
121 : }
122 6490 : ASSERT(args.len == 1);
123 :
124 6490 : new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
125 6490 : *stat = 1;
126 6490 : xfs_inobt_mod_blockcount(cur, 1);
127 6490 : return 0;
128 : }
129 :
130 : STATIC int
131 5257 : xfs_inobt_alloc_block(
132 : struct xfs_btree_cur *cur,
133 : const union xfs_btree_ptr *start,
134 : union xfs_btree_ptr *new,
135 : int *stat)
136 : {
137 5257 : return __xfs_inobt_alloc_block(cur, start, new, stat, XFS_AG_RESV_NONE);
138 : }
139 :
140 : STATIC int
141 1233 : xfs_finobt_alloc_block(
142 : struct xfs_btree_cur *cur,
143 : const union xfs_btree_ptr *start,
144 : union xfs_btree_ptr *new,
145 : int *stat)
146 : {
147 1233 : if (cur->bc_mp->m_finobt_nores)
148 0 : return xfs_inobt_alloc_block(cur, start, new, stat);
149 1233 : return __xfs_inobt_alloc_block(cur, start, new, stat,
150 : XFS_AG_RESV_METADATA);
151 : }
152 :
153 : STATIC int
154 2537 : __xfs_inobt_free_block(
155 : struct xfs_btree_cur *cur,
156 : struct xfs_buf *bp,
157 : enum xfs_ag_resv_type resv)
158 : {
159 2537 : xfs_fsblock_t fsbno;
160 :
161 2537 : xfs_inobt_mod_blockcount(cur, -1);
162 2537 : fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, xfs_buf_daddr(bp));
163 2537 : return xfs_free_extent_later(cur->bc_tp, fsbno, 1,
164 : &XFS_RMAP_OINFO_INOBT, resv, 0);
165 : }
166 :
167 : STATIC int
168 1317 : xfs_inobt_free_block(
169 : struct xfs_btree_cur *cur,
170 : struct xfs_buf *bp)
171 : {
172 1317 : return __xfs_inobt_free_block(cur, bp, XFS_AG_RESV_NONE);
173 : }
174 :
175 : STATIC int
176 1220 : xfs_finobt_free_block(
177 : struct xfs_btree_cur *cur,
178 : struct xfs_buf *bp)
179 : {
180 1220 : if (cur->bc_mp->m_finobt_nores)
181 0 : return xfs_inobt_free_block(cur, bp);
182 1220 : return __xfs_inobt_free_block(cur, bp, XFS_AG_RESV_METADATA);
183 : }
184 :
185 : STATIC int
186 59745127488 : xfs_inobt_get_maxrecs(
187 : struct xfs_btree_cur *cur,
188 : int level)
189 : {
190 59745127488 : return M_IGEO(cur->bc_mp)->inobt_mxr[level != 0];
191 : }
192 :
193 : STATIC void
194 40006962069 : xfs_inobt_init_key_from_rec(
195 : union xfs_btree_key *key,
196 : const union xfs_btree_rec *rec)
197 : {
198 40006962069 : key->inobt.ir_startino = rec->inobt.ir_startino;
199 40006962069 : }
200 :
201 : STATIC void
202 943570 : xfs_inobt_init_high_key_from_rec(
203 : union xfs_btree_key *key,
204 : const union xfs_btree_rec *rec)
205 : {
206 943570 : __u32 x;
207 :
208 943570 : x = be32_to_cpu(rec->inobt.ir_startino);
209 943570 : x += XFS_INODES_PER_CHUNK - 1;
210 943570 : key->inobt.ir_startino = cpu_to_be32(x);
211 943570 : }
212 :
213 : STATIC void
214 32326723 : xfs_inobt_init_rec_from_cur(
215 : struct xfs_btree_cur *cur,
216 : union xfs_btree_rec *rec)
217 : {
218 32326723 : rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
219 32326723 : if (xfs_has_sparseinodes(cur->bc_mp)) {
220 32326712 : rec->inobt.ir_u.sp.ir_holemask =
221 32326712 : cpu_to_be16(cur->bc_rec.i.ir_holemask);
222 32326712 : rec->inobt.ir_u.sp.ir_count = cur->bc_rec.i.ir_count;
223 32326712 : rec->inobt.ir_u.sp.ir_freecount = cur->bc_rec.i.ir_freecount;
224 : } else {
225 : /* ir_holemask/ir_count not supported on-disk */
226 11 : rec->inobt.ir_u.f.ir_freecount =
227 11 : cpu_to_be32(cur->bc_rec.i.ir_freecount);
228 : }
229 32326723 : rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
230 32326723 : }
231 :
232 : /*
233 : * initial value of ptr for lookup
234 : */
235 : STATIC void
236 4818250895 : xfs_inobt_init_ptr_from_cur(
237 : struct xfs_btree_cur *cur,
238 : union xfs_btree_ptr *ptr)
239 : {
240 4818250895 : struct xfs_agi *agi = cur->bc_ag.agbp->b_addr;
241 :
242 4818250895 : ASSERT(cur->bc_ag.pag->pag_agno == be32_to_cpu(agi->agi_seqno));
243 :
244 4818250895 : ptr->s = agi->agi_root;
245 4818250895 : }
246 :
247 : STATIC void
248 5566203081 : xfs_finobt_init_ptr_from_cur(
249 : struct xfs_btree_cur *cur,
250 : union xfs_btree_ptr *ptr)
251 : {
252 5566203081 : struct xfs_agi *agi = cur->bc_ag.agbp->b_addr;
253 :
254 5566203081 : ASSERT(cur->bc_ag.pag->pag_agno == be32_to_cpu(agi->agi_seqno));
255 5566203081 : ptr->s = agi->agi_free_root;
256 5566203081 : }
257 :
258 : STATIC int64_t
259 45234011991 : xfs_inobt_key_diff(
260 : struct xfs_btree_cur *cur,
261 : const union xfs_btree_key *key)
262 : {
263 45234011991 : return (int64_t)be32_to_cpu(key->inobt.ir_startino) -
264 45234011991 : cur->bc_rec.i.ir_startino;
265 : }
266 :
267 : STATIC int64_t
268 310172858 : xfs_inobt_diff_two_keys(
269 : struct xfs_btree_cur *cur,
270 : const union xfs_btree_key *k1,
271 : const union xfs_btree_key *k2,
272 : const union xfs_btree_key *mask)
273 : {
274 310172858 : ASSERT(!mask || mask->inobt.ir_startino);
275 :
276 310172858 : return (int64_t)be32_to_cpu(k1->inobt.ir_startino) -
277 310172858 : be32_to_cpu(k2->inobt.ir_startino);
278 : }
279 :
280 : static xfs_failaddr_t
281 3962253 : xfs_inobt_verify(
282 : struct xfs_buf *bp)
283 : {
284 3962253 : struct xfs_mount *mp = bp->b_mount;
285 3962253 : struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
286 3962253 : xfs_failaddr_t fa;
287 3962253 : unsigned int level;
288 :
289 3962253 : if (!xfs_verify_magic(bp, block->bb_magic))
290 0 : return __this_address;
291 :
292 : /*
293 : * During growfs operations, we can't verify the exact owner as the
294 : * perag is not fully initialised and hence not attached to the buffer.
295 : *
296 : * Similarly, during log recovery we will have a perag structure
297 : * attached, but the agi information will not yet have been initialised
298 : * from the on disk AGI. We don't currently use any of this information,
299 : * but beware of the landmine (i.e. need to check
300 : * xfs_perag_initialised_agi(pag)) if we ever do.
301 : */
302 3961627 : if (xfs_has_crc(mp)) {
303 3947285 : fa = xfs_btree_sblock_v5hdr_verify(bp);
304 3947793 : if (fa)
305 : return fa;
306 : }
307 :
308 : /* level verification */
309 3962165 : level = be16_to_cpu(block->bb_level);
310 3962165 : if (level >= M_IGEO(mp)->inobt_maxlevels)
311 0 : return __this_address;
312 :
313 3961956 : return xfs_btree_sblock_verify(bp,
314 3962165 : M_IGEO(mp)->inobt_mxr[level != 0]);
315 : }
316 :
317 : static void
318 517282 : xfs_inobt_read_verify(
319 : struct xfs_buf *bp)
320 : {
321 517282 : xfs_failaddr_t fa;
322 :
323 517282 : if (!xfs_btree_sblock_verify_crc(bp))
324 20 : xfs_verifier_error(bp, -EFSBADCRC, __this_address);
325 : else {
326 517262 : fa = xfs_inobt_verify(bp);
327 517262 : if (fa)
328 0 : xfs_verifier_error(bp, -EFSCORRUPTED, fa);
329 : }
330 :
331 517282 : if (bp->b_error)
332 20 : trace_xfs_btree_corrupt(bp, _RET_IP_);
333 517282 : }
334 :
335 : static void
336 1858017 : xfs_inobt_write_verify(
337 : struct xfs_buf *bp)
338 : {
339 1858017 : xfs_failaddr_t fa;
340 :
341 1858017 : fa = xfs_inobt_verify(bp);
342 1857755 : if (fa) {
343 0 : trace_xfs_btree_corrupt(bp, _RET_IP_);
344 0 : xfs_verifier_error(bp, -EFSCORRUPTED, fa);
345 0 : return;
346 : }
347 1857755 : xfs_btree_sblock_calc_crc(bp);
348 :
349 : }
350 :
351 : const struct xfs_buf_ops xfs_inobt_buf_ops = {
352 : .name = "xfs_inobt",
353 : .magic = { cpu_to_be32(XFS_IBT_MAGIC), cpu_to_be32(XFS_IBT_CRC_MAGIC) },
354 : .verify_read = xfs_inobt_read_verify,
355 : .verify_write = xfs_inobt_write_verify,
356 : .verify_struct = xfs_inobt_verify,
357 : };
358 :
359 : const struct xfs_buf_ops xfs_finobt_buf_ops = {
360 : .name = "xfs_finobt",
361 : .magic = { cpu_to_be32(XFS_FIBT_MAGIC),
362 : cpu_to_be32(XFS_FIBT_CRC_MAGIC) },
363 : .verify_read = xfs_inobt_read_verify,
364 : .verify_write = xfs_inobt_write_verify,
365 : .verify_struct = xfs_inobt_verify,
366 : };
367 :
368 : STATIC int
369 197865 : xfs_inobt_keys_inorder(
370 : struct xfs_btree_cur *cur,
371 : const union xfs_btree_key *k1,
372 : const union xfs_btree_key *k2)
373 : {
374 197865 : return be32_to_cpu(k1->inobt.ir_startino) <
375 197865 : be32_to_cpu(k2->inobt.ir_startino);
376 : }
377 :
378 : STATIC int
379 96348949 : xfs_inobt_recs_inorder(
380 : struct xfs_btree_cur *cur,
381 : const union xfs_btree_rec *r1,
382 : const union xfs_btree_rec *r2)
383 : {
384 96348949 : return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
385 96348949 : be32_to_cpu(r2->inobt.ir_startino);
386 : }
387 :
388 : STATIC enum xbtree_key_contig
389 0 : xfs_inobt_keys_contiguous(
390 : struct xfs_btree_cur *cur,
391 : const union xfs_btree_key *key1,
392 : const union xfs_btree_key *key2,
393 : const union xfs_btree_key *mask)
394 : {
395 0 : ASSERT(!mask || mask->inobt.ir_startino);
396 :
397 0 : return xbtree_key_contig(be32_to_cpu(key1->inobt.ir_startino),
398 0 : be32_to_cpu(key2->inobt.ir_startino));
399 : }
400 :
401 : const struct xfs_btree_ops xfs_inobt_ops = {
402 : .rec_len = sizeof(xfs_inobt_rec_t),
403 : .key_len = sizeof(xfs_inobt_key_t),
404 : .lru_refs = XFS_INO_BTREE_REF,
405 :
406 : .dup_cursor = xfs_inobt_dup_cursor,
407 : .set_root = xfs_inobt_set_root,
408 : .alloc_block = xfs_inobt_alloc_block,
409 : .free_block = xfs_inobt_free_block,
410 : .get_minrecs = xfs_inobt_get_minrecs,
411 : .get_maxrecs = xfs_inobt_get_maxrecs,
412 : .init_key_from_rec = xfs_inobt_init_key_from_rec,
413 : .init_high_key_from_rec = xfs_inobt_init_high_key_from_rec,
414 : .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
415 : .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
416 : .key_diff = xfs_inobt_key_diff,
417 : .buf_ops = &xfs_inobt_buf_ops,
418 : .diff_two_keys = xfs_inobt_diff_two_keys,
419 : .keys_inorder = xfs_inobt_keys_inorder,
420 : .recs_inorder = xfs_inobt_recs_inorder,
421 : .keys_contiguous = xfs_inobt_keys_contiguous,
422 : };
423 :
424 : const struct xfs_btree_ops xfs_finobt_ops = {
425 : .rec_len = sizeof(xfs_inobt_rec_t),
426 : .key_len = sizeof(xfs_inobt_key_t),
427 : .lru_refs = XFS_INO_BTREE_REF,
428 :
429 : .dup_cursor = xfs_inobt_dup_cursor,
430 : .set_root = xfs_finobt_set_root,
431 : .alloc_block = xfs_finobt_alloc_block,
432 : .free_block = xfs_finobt_free_block,
433 : .get_minrecs = xfs_inobt_get_minrecs,
434 : .get_maxrecs = xfs_inobt_get_maxrecs,
435 : .init_key_from_rec = xfs_inobt_init_key_from_rec,
436 : .init_high_key_from_rec = xfs_inobt_init_high_key_from_rec,
437 : .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
438 : .init_ptr_from_cur = xfs_finobt_init_ptr_from_cur,
439 : .key_diff = xfs_inobt_key_diff,
440 : .buf_ops = &xfs_finobt_buf_ops,
441 : .diff_two_keys = xfs_inobt_diff_two_keys,
442 : .keys_inorder = xfs_inobt_keys_inorder,
443 : .recs_inorder = xfs_inobt_recs_inorder,
444 : .keys_contiguous = xfs_inobt_keys_contiguous,
445 : };
446 :
447 : /*
448 : * Initialize a new inode btree cursor.
449 : */
450 : static struct xfs_btree_cur *
451 4176524565 : xfs_inobt_init_common(
452 : struct xfs_perag *pag,
453 : struct xfs_trans *tp, /* transaction pointer */
454 : xfs_btnum_t btnum) /* ialloc or free ino btree */
455 : {
456 4176524565 : struct xfs_mount *mp = pag->pag_mount;
457 4176524565 : struct xfs_btree_cur *cur;
458 :
459 4176524565 : if (btnum == XFS_BTNUM_INO) {
460 3119412986 : cur = xfs_btree_alloc_cursor(mp, tp, btnum, &xfs_inobt_ops,
461 3119412986 : M_IGEO(mp)->inobt_maxlevels,
462 : xfs_inobt_cur_cache);
463 3121214181 : cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_ibt_2);
464 : } else {
465 1057111579 : cur = xfs_btree_alloc_cursor(mp, tp, btnum, &xfs_finobt_ops,
466 1057111579 : M_IGEO(mp)->inobt_maxlevels,
467 : xfs_inobt_cur_cache);
468 1058142175 : cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_fibt_2);
469 : }
470 :
471 4179356356 : cur->bc_ag.pag = xfs_perag_hold(pag);
472 4181683760 : return cur;
473 : }
474 :
475 : /* Create an inode btree cursor. */
476 : struct xfs_btree_cur *
477 4177742796 : xfs_inobt_init_cursor(
478 : struct xfs_perag *pag,
479 : struct xfs_trans *tp,
480 : struct xfs_buf *agbp,
481 : xfs_btnum_t btnum)
482 : {
483 4177742796 : struct xfs_btree_cur *cur;
484 4177742796 : struct xfs_agi *agi = agbp->b_addr;
485 :
486 4177742796 : cur = xfs_inobt_init_common(pag, tp, btnum);
487 4181268578 : if (btnum == XFS_BTNUM_INO)
488 3122289554 : cur->bc_nlevels = be32_to_cpu(agi->agi_level);
489 : else
490 1058979024 : cur->bc_nlevels = be32_to_cpu(agi->agi_free_level);
491 4181268578 : cur->bc_ag.agbp = agbp;
492 4181268578 : return cur;
493 : }
494 :
495 : /* Create an inode btree cursor with a fake root for staging. */
496 : struct xfs_btree_cur *
497 289005 : xfs_inobt_stage_cursor(
498 : struct xfs_perag *pag,
499 : struct xbtree_afakeroot *afake,
500 : xfs_btnum_t btnum)
501 : {
502 289005 : struct xfs_btree_cur *cur;
503 :
504 289005 : cur = xfs_inobt_init_common(pag, NULL, btnum);
505 289489 : xfs_btree_stage_afakeroot(cur, afake);
506 289147 : return cur;
507 : }
508 :
509 : /*
510 : * Install a new inobt btree root. Caller is responsible for invalidating
511 : * and freeing the old btree blocks.
512 : */
513 : void
514 289345 : xfs_inobt_commit_staged_btree(
515 : struct xfs_btree_cur *cur,
516 : struct xfs_trans *tp,
517 : struct xfs_buf *agbp)
518 : {
519 289345 : struct xfs_agi *agi = agbp->b_addr;
520 289345 : struct xbtree_afakeroot *afake = cur->bc_ag.afake;
521 289345 : int fields;
522 :
523 289345 : ASSERT(cur->bc_flags & XFS_BTREE_STAGING);
524 :
525 289345 : if (cur->bc_btnum == XFS_BTNUM_INO) {
526 144695 : fields = XFS_AGI_ROOT | XFS_AGI_LEVEL;
527 144695 : agi->agi_root = cpu_to_be32(afake->af_root);
528 144695 : agi->agi_level = cpu_to_be32(afake->af_levels);
529 144695 : if (xfs_has_inobtcounts(cur->bc_mp)) {
530 144597 : agi->agi_iblocks = cpu_to_be32(afake->af_blocks);
531 144597 : fields |= XFS_AGI_IBLOCKS;
532 : }
533 144695 : xfs_ialloc_log_agi(tp, agbp, fields);
534 144649 : xfs_btree_commit_afakeroot(cur, tp, agbp, &xfs_inobt_ops);
535 : } else {
536 144650 : fields = XFS_AGI_FREE_ROOT | XFS_AGI_FREE_LEVEL;
537 144650 : agi->agi_free_root = cpu_to_be32(afake->af_root);
538 144650 : agi->agi_free_level = cpu_to_be32(afake->af_levels);
539 144650 : if (xfs_has_inobtcounts(cur->bc_mp)) {
540 144588 : agi->agi_fblocks = cpu_to_be32(afake->af_blocks);
541 144588 : fields |= XFS_AGI_IBLOCKS;
542 : }
543 144650 : xfs_ialloc_log_agi(tp, agbp, fields);
544 144689 : xfs_btree_commit_afakeroot(cur, tp, agbp, &xfs_finobt_ops);
545 : }
546 289317 : }
547 :
548 : /* Calculate number of records in an inode btree block. */
549 : static inline unsigned int
550 : xfs_inobt_block_maxrecs(
551 : unsigned int blocklen,
552 : bool leaf)
553 : {
554 133944 : if (leaf)
555 66972 : return blocklen / sizeof(xfs_inobt_rec_t);
556 66972 : return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
557 : }
558 :
559 : /*
560 : * Calculate number of records in an inobt btree block.
561 : */
562 : unsigned int
563 133944 : xfs_inobt_maxrecs(
564 : struct xfs_mount *mp,
565 : unsigned int blocklen,
566 : bool leaf)
567 : {
568 133944 : blocklen -= XFS_INOBT_BLOCK_LEN(mp);
569 133944 : return xfs_inobt_block_maxrecs(blocklen, leaf);
570 : }
571 :
572 : /*
573 : * Maximum number of inode btree records per AG. Pretend that we can fill an
574 : * entire AG completely full of inodes except for the AG headers.
575 : */
576 : #define XFS_MAX_INODE_RECORDS \
577 : ((XFS_MAX_AG_BYTES - (4 * BBSIZE)) / XFS_DINODE_MIN_SIZE) / \
578 : XFS_INODES_PER_CHUNK
579 :
580 : /* Compute the max possible height for the inode btree. */
581 : static inline unsigned int
582 67031 : xfs_inobt_maxlevels_ondisk(void)
583 : {
584 67031 : unsigned int minrecs[2];
585 67031 : unsigned int blocklen;
586 :
587 67031 : blocklen = min(XFS_MIN_BLOCKSIZE - XFS_BTREE_SBLOCK_LEN,
588 : XFS_MIN_CRC_BLOCKSIZE - XFS_BTREE_SBLOCK_CRC_LEN);
589 :
590 67031 : minrecs[0] = xfs_inobt_block_maxrecs(blocklen, true) / 2;
591 67031 : minrecs[1] = xfs_inobt_block_maxrecs(blocklen, false) / 2;
592 :
593 67031 : return xfs_btree_compute_maxlevels(minrecs, XFS_MAX_INODE_RECORDS);
594 : }
595 :
596 : /* Compute the max possible height for the free inode btree. */
597 : static inline unsigned int
598 66972 : xfs_finobt_maxlevels_ondisk(void)
599 : {
600 66972 : unsigned int minrecs[2];
601 66972 : unsigned int blocklen;
602 :
603 66972 : blocklen = XFS_MIN_CRC_BLOCKSIZE - XFS_BTREE_SBLOCK_CRC_LEN;
604 :
605 66972 : minrecs[0] = xfs_inobt_block_maxrecs(blocklen, true) / 2;
606 66972 : minrecs[1] = xfs_inobt_block_maxrecs(blocklen, false) / 2;
607 :
608 66972 : return xfs_btree_compute_maxlevels(minrecs, XFS_MAX_INODE_RECORDS);
609 : }
610 :
611 : /* Compute the max possible height for either inode btree. */
612 : unsigned int
613 66972 : xfs_iallocbt_maxlevels_ondisk(void)
614 : {
615 66972 : return max(xfs_inobt_maxlevels_ondisk(),
616 : xfs_finobt_maxlevels_ondisk());
617 : }
618 :
619 : /*
620 : * Convert the inode record holemask to an inode allocation bitmap. The inode
621 : * allocation bitmap is inode granularity and specifies whether an inode is
622 : * physically allocated on disk (not whether the inode is considered allocated
623 : * or free by the fs).
624 : *
625 : * A bit value of 1 means the inode is allocated, a value of 0 means it is free.
626 : */
627 : uint64_t
628 10448352266 : xfs_inobt_irec_to_allocmask(
629 : const struct xfs_inobt_rec_incore *rec)
630 : {
631 10448352266 : uint64_t bitmap = 0;
632 10448352266 : uint64_t inodespbit;
633 10448352266 : int nextbit;
634 10448352266 : uint allocbitmap;
635 :
636 : /*
637 : * The holemask has 16-bits for a 64 inode record. Therefore each
638 : * holemask bit represents multiple inodes. Create a mask of bits to set
639 : * in the allocmask for each holemask bit.
640 : */
641 10448352266 : inodespbit = (1 << XFS_INODES_PER_HOLEMASK_BIT) - 1;
642 :
643 : /*
644 : * Allocated inodes are represented by 0 bits in holemask. Invert the 0
645 : * bits to 1 and convert to a uint so we can use xfs_next_bit(). Mask
646 : * anything beyond the 16 holemask bits since this casts to a larger
647 : * type.
648 : */
649 10448352266 : allocbitmap = ~rec->ir_holemask & ((1 << XFS_INOBT_HOLEMASK_BITS) - 1);
650 :
651 : /*
652 : * allocbitmap is the inverted holemask so every set bit represents
653 : * allocated inodes. To expand from 16-bit holemask granularity to
654 : * 64-bit (e.g., bit-per-inode), set inodespbit bits in the target
655 : * bitmap for every holemask bit.
656 : */
657 10448352266 : nextbit = xfs_next_bit(&allocbitmap, 1, 0);
658 93624360687 : while (nextbit != -1) {
659 83169151084 : ASSERT(nextbit < (sizeof(rec->ir_holemask) * NBBY));
660 :
661 0 : bitmap |= (inodespbit <<
662 83169151084 : (nextbit * XFS_INODES_PER_HOLEMASK_BIT));
663 :
664 83169151084 : nextbit = xfs_next_bit(&allocbitmap, 1, nextbit + 1);
665 : }
666 :
667 10450061075 : return bitmap;
668 : }
669 :
670 : #if defined(DEBUG) || defined(XFS_WARN)
671 : /*
672 : * Verify that an in-core inode record has a valid inode count.
673 : */
674 : int
675 129708 : xfs_inobt_rec_check_count(
676 : struct xfs_mount *mp,
677 : struct xfs_inobt_rec_incore *rec)
678 : {
679 129708 : int inocount = 0;
680 129708 : int nextbit = 0;
681 129708 : uint64_t allocbmap;
682 129708 : int wordsz;
683 :
684 129708 : wordsz = sizeof(allocbmap) / sizeof(unsigned int);
685 129708 : allocbmap = xfs_inobt_irec_to_allocmask(rec);
686 :
687 129733 : nextbit = xfs_next_bit((uint *) &allocbmap, wordsz, nextbit);
688 8430046 : while (nextbit != -1) {
689 8300323 : inocount++;
690 8300323 : nextbit = xfs_next_bit((uint *) &allocbmap, wordsz,
691 8300323 : nextbit + 1);
692 : }
693 :
694 129724 : if (inocount != rec->ir_count)
695 0 : return -EFSCORRUPTED;
696 :
697 : return 0;
698 : }
699 : #endif /* DEBUG */
700 :
701 : static xfs_extlen_t
702 1260475 : xfs_inobt_max_size(
703 : struct xfs_perag *pag)
704 : {
705 1260475 : struct xfs_mount *mp = pag->pag_mount;
706 1260475 : xfs_agblock_t agblocks = pag->block_count;
707 :
708 : /* Bail out if we're uninitialized, which can happen in mkfs. */
709 1260475 : if (M_IGEO(mp)->inobt_mxr[0] == 0)
710 : return 0;
711 :
712 : /*
713 : * The log is permanently allocated, so the space it occupies will
714 : * never be available for the kinds of things that would require btree
715 : * expansion. We therefore can pretend the space isn't there.
716 : */
717 1260451 : if (xfs_ag_contains_log(mp, pag->pag_agno))
718 122001 : agblocks -= mp->m_sb.sb_logblocks;
719 :
720 1260625 : return xfs_btree_calc_size(M_IGEO(mp)->inobt_mnr,
721 1260102 : (uint64_t)agblocks * mp->m_sb.sb_inopblock /
722 : XFS_INODES_PER_CHUNK);
723 : }
724 :
725 : /* Read AGI and create inobt cursor. */
726 : int
727 742029922 : xfs_inobt_cur(
728 : struct xfs_perag *pag,
729 : struct xfs_trans *tp,
730 : xfs_btnum_t which,
731 : struct xfs_btree_cur **curpp,
732 : struct xfs_buf **agi_bpp)
733 : {
734 742029922 : struct xfs_btree_cur *cur;
735 742029922 : int error;
736 :
737 742029922 : ASSERT(*agi_bpp == NULL);
738 742029922 : ASSERT(*curpp == NULL);
739 :
740 742029922 : error = xfs_ialloc_read_agi(pag, tp, agi_bpp);
741 742169526 : if (error)
742 : return error;
743 :
744 742164741 : cur = xfs_inobt_init_cursor(pag, tp, *agi_bpp, which);
745 742197285 : *curpp = cur;
746 742197285 : return 0;
747 : }
748 :
749 : static int
750 1287 : xfs_inobt_count_blocks(
751 : struct xfs_perag *pag,
752 : struct xfs_trans *tp,
753 : xfs_btnum_t btnum,
754 : xfs_extlen_t *tree_blocks)
755 : {
756 1287 : struct xfs_buf *agbp = NULL;
757 1287 : struct xfs_btree_cur *cur = NULL;
758 1287 : int error;
759 :
760 1287 : error = xfs_inobt_cur(pag, tp, btnum, &cur, &agbp);
761 1288 : if (error)
762 : return error;
763 :
764 1288 : error = xfs_btree_count_blocks(cur, tree_blocks);
765 1286 : xfs_btree_del_cursor(cur, error);
766 1288 : xfs_trans_brelse(tp, agbp);
767 :
768 1288 : return error;
769 : }
770 :
771 : /* Read finobt block count from AGI header. */
772 : static int
773 1258645 : xfs_finobt_read_blocks(
774 : struct xfs_perag *pag,
775 : struct xfs_trans *tp,
776 : xfs_extlen_t *tree_blocks)
777 : {
778 1258645 : struct xfs_buf *agbp;
779 1258645 : struct xfs_agi *agi;
780 1258645 : int error;
781 :
782 1258645 : error = xfs_ialloc_read_agi(pag, tp, &agbp);
783 1259476 : if (error)
784 : return error;
785 :
786 1259508 : agi = agbp->b_addr;
787 1259508 : *tree_blocks = be32_to_cpu(agi->agi_fblocks);
788 1259508 : xfs_trans_brelse(tp, agbp);
789 1259508 : return 0;
790 : }
791 :
792 : /*
793 : * Figure out how many blocks to reserve and how many are used by this btree.
794 : */
795 : int
796 1276410 : xfs_finobt_calc_reserves(
797 : struct xfs_perag *pag,
798 : struct xfs_trans *tp,
799 : xfs_extlen_t *ask,
800 : xfs_extlen_t *used)
801 : {
802 1276410 : xfs_extlen_t tree_len = 0;
803 1276410 : int error;
804 :
805 1276410 : if (!xfs_has_finobt(pag->pag_mount))
806 : return 0;
807 :
808 1260563 : if (xfs_has_inobtcounts(pag->pag_mount))
809 1259276 : error = xfs_finobt_read_blocks(pag, tp, &tree_len);
810 : else
811 1287 : error = xfs_inobt_count_blocks(pag, tp, XFS_BTNUM_FINO,
812 : &tree_len);
813 1260383 : if (error)
814 : return error;
815 :
816 1260555 : *ask += xfs_inobt_max_size(pag);
817 1260645 : *used += tree_len;
818 1260645 : return 0;
819 : }
820 :
821 : /* Calculate the inobt btree size for some records. */
822 : xfs_extlen_t
823 3011325 : xfs_iallocbt_calc_size(
824 : struct xfs_mount *mp,
825 : unsigned long long len)
826 : {
827 3011325 : return xfs_btree_calc_size(M_IGEO(mp)->inobt_mnr, len);
828 : }
829 :
830 : int __init
831 59 : xfs_inobt_init_cur_cache(void)
832 : {
833 59 : xfs_inobt_cur_cache = kmem_cache_create("xfs_inobt_cur",
834 59 : xfs_btree_cur_sizeof(xfs_inobt_maxlevels_ondisk()),
835 : 0, 0, NULL);
836 :
837 59 : if (!xfs_inobt_cur_cache)
838 0 : return -ENOMEM;
839 : return 0;
840 : }
841 :
842 : void
843 58 : xfs_inobt_destroy_cur_cache(void)
844 : {
845 58 : kmem_cache_destroy(xfs_inobt_cur_cache);
846 58 : xfs_inobt_cur_cache = NULL;
847 58 : }
|
