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