]>
Commit | Line | Data |
---|---|---|
2bd0ea18 | 1 | /* |
da23017d NS |
2 | * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
5000d01d | 4 | * |
da23017d NS |
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 | |
2bd0ea18 | 7 | * published by the Free Software Foundation. |
5000d01d | 8 | * |
da23017d NS |
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. | |
5000d01d | 13 | * |
da23017d NS |
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 | |
2bd0ea18 | 17 | */ |
9c799827 | 18 | #include "libxfs_priv.h" |
b626fb59 DC |
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_trace.h" | |
30 | #include "xfs_cksum.h" | |
31 | #include "xfs_trans.h" | |
32 | ||
2bd0ea18 | 33 | |
b194c7d8 BN |
34 | STATIC struct xfs_btree_cur * |
35 | xfs_allocbt_dup_cursor( | |
36 | struct xfs_btree_cur *cur) | |
2bd0ea18 | 37 | { |
b194c7d8 BN |
38 | return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp, |
39 | cur->bc_private.a.agbp, cur->bc_private.a.agno, | |
40 | cur->bc_btnum); | |
2bd0ea18 NS |
41 | } |
42 | ||
2bd0ea18 | 43 | STATIC void |
b194c7d8 BN |
44 | xfs_allocbt_set_root( |
45 | struct xfs_btree_cur *cur, | |
46 | union xfs_btree_ptr *ptr, | |
47 | int inc) | |
2bd0ea18 | 48 | { |
b194c7d8 BN |
49 | struct xfs_buf *agbp = cur->bc_private.a.agbp; |
50 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); | |
51 | xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno); | |
52 | int btnum = cur->bc_btnum; | |
56b2de80 | 53 | struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno); |
2bd0ea18 | 54 | |
b194c7d8 | 55 | ASSERT(ptr->s != 0); |
2bd0ea18 | 56 | |
b194c7d8 BN |
57 | agf->agf_roots[btnum] = ptr->s; |
58 | be32_add_cpu(&agf->agf_levels[btnum], inc); | |
56b2de80 DC |
59 | pag->pagf_levels[btnum] += inc; |
60 | xfs_perag_put(pag); | |
2bd0ea18 | 61 | |
b194c7d8 | 62 | xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); |
2bd0ea18 NS |
63 | } |
64 | ||
b194c7d8 BN |
65 | STATIC int |
66 | xfs_allocbt_alloc_block( | |
67 | struct xfs_btree_cur *cur, | |
68 | union xfs_btree_ptr *start, | |
69 | union xfs_btree_ptr *new, | |
b194c7d8 | 70 | int *stat) |
2bd0ea18 | 71 | { |
b194c7d8 BN |
72 | int error; |
73 | xfs_agblock_t bno; | |
2bd0ea18 | 74 | |
b194c7d8 BN |
75 | /* Allocate the new block from the freelist. If we can't, give up. */ |
76 | error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp, | |
77 | &bno, 1); | |
97b3ffd0 | 78 | if (error) |
2bd0ea18 | 79 | return error; |
b194c7d8 BN |
80 | |
81 | if (bno == NULLAGBLOCK) { | |
2bd0ea18 NS |
82 | *stat = 0; |
83 | return 0; | |
84 | } | |
2bd0ea18 | 85 | |
a2ceac1f DC |
86 | xfs_extent_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false); |
87 | ||
b194c7d8 BN |
88 | xfs_trans_agbtree_delta(cur->bc_tp, 1); |
89 | new->s = cpu_to_be32(bno); | |
2bd0ea18 | 90 | |
2bd0ea18 NS |
91 | *stat = 1; |
92 | return 0; | |
2bd0ea18 NS |
93 | } |
94 | ||
b194c7d8 BN |
95 | STATIC int |
96 | xfs_allocbt_free_block( | |
97 | struct xfs_btree_cur *cur, | |
98 | struct xfs_buf *bp) | |
2bd0ea18 | 99 | { |
b194c7d8 | 100 | struct xfs_buf *agbp = cur->bc_private.a.agbp; |
ff105f75 | 101 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); |
b194c7d8 BN |
102 | xfs_agblock_t bno; |
103 | int error; | |
2bd0ea18 | 104 | |
56b2de80 | 105 | bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp)); |
b194c7d8 | 106 | error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1); |
5e656dbb | 107 | if (error) |
2bd0ea18 | 108 | return error; |
2bd0ea18 | 109 | |
a2ceac1f DC |
110 | xfs_extent_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1, |
111 | XFS_EXTENT_BUSY_SKIP_DISCARD); | |
b194c7d8 | 112 | xfs_trans_agbtree_delta(cur->bc_tp, -1); |
2bd0ea18 NS |
113 | return 0; |
114 | } | |
115 | ||
116 | /* | |
b194c7d8 | 117 | * Update the longest extent in the AGF |
2bd0ea18 | 118 | */ |
b194c7d8 BN |
119 | STATIC void |
120 | xfs_allocbt_update_lastrec( | |
121 | struct xfs_btree_cur *cur, | |
122 | struct xfs_btree_block *block, | |
123 | union xfs_btree_rec *rec, | |
124 | int ptr, | |
125 | int reason) | |
2bd0ea18 | 126 | { |
b194c7d8 BN |
127 | struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); |
128 | xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno); | |
56b2de80 | 129 | struct xfs_perag *pag; |
b194c7d8 BN |
130 | __be32 len; |
131 | int numrecs; | |
2bd0ea18 | 132 | |
b194c7d8 BN |
133 | ASSERT(cur->bc_btnum == XFS_BTNUM_CNT); |
134 | ||
135 | switch (reason) { | |
136 | case LASTREC_UPDATE: | |
137 | /* | |
138 | * If this is the last leaf block and it's the last record, | |
139 | * then update the size of the longest extent in the AG. | |
140 | */ | |
141 | if (ptr != xfs_btree_get_numrecs(block)) | |
142 | return; | |
143 | len = rec->alloc.ar_blockcount; | |
144 | break; | |
145 | case LASTREC_INSREC: | |
146 | if (be32_to_cpu(rec->alloc.ar_blockcount) <= | |
147 | be32_to_cpu(agf->agf_longest)) | |
148 | return; | |
149 | len = rec->alloc.ar_blockcount; | |
150 | break; | |
151 | case LASTREC_DELREC: | |
152 | numrecs = xfs_btree_get_numrecs(block); | |
153 | if (ptr <= numrecs) | |
154 | return; | |
155 | ASSERT(ptr == numrecs + 1); | |
2bd0ea18 | 156 | |
b194c7d8 BN |
157 | if (numrecs) { |
158 | xfs_alloc_rec_t *rrp; | |
159 | ||
b3563c19 | 160 | rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs); |
b194c7d8 BN |
161 | len = rrp->ar_blockcount; |
162 | } else { | |
163 | len = 0; | |
164 | } | |
165 | ||
166 | break; | |
167 | default: | |
168 | ASSERT(0); | |
169 | return; | |
2bd0ea18 | 170 | } |
b194c7d8 BN |
171 | |
172 | agf->agf_longest = len; | |
56b2de80 DC |
173 | pag = xfs_perag_get(cur->bc_mp, seqno); |
174 | pag->pagf_longest = be32_to_cpu(len); | |
175 | xfs_perag_put(pag); | |
b194c7d8 | 176 | xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST); |
2bd0ea18 NS |
177 | } |
178 | ||
b194c7d8 BN |
179 | STATIC int |
180 | xfs_allocbt_get_minrecs( | |
181 | struct xfs_btree_cur *cur, | |
182 | int level) | |
183 | { | |
184 | return cur->bc_mp->m_alloc_mnr[level != 0]; | |
185 | } | |
2bd0ea18 | 186 | |
b194c7d8 BN |
187 | STATIC int |
188 | xfs_allocbt_get_maxrecs( | |
189 | struct xfs_btree_cur *cur, | |
190 | int level) | |
2bd0ea18 | 191 | { |
b194c7d8 BN |
192 | return cur->bc_mp->m_alloc_mxr[level != 0]; |
193 | } | |
2bd0ea18 | 194 | |
b194c7d8 BN |
195 | STATIC void |
196 | xfs_allocbt_init_key_from_rec( | |
197 | union xfs_btree_key *key, | |
198 | union xfs_btree_rec *rec) | |
199 | { | |
b194c7d8 BN |
200 | key->alloc.ar_startblock = rec->alloc.ar_startblock; |
201 | key->alloc.ar_blockcount = rec->alloc.ar_blockcount; | |
2bd0ea18 NS |
202 | } |
203 | ||
46a1586d DW |
204 | STATIC void |
205 | xfs_bnobt_init_high_key_from_rec( | |
206 | union xfs_btree_key *key, | |
207 | union xfs_btree_rec *rec) | |
208 | { | |
209 | __u32 x; | |
210 | ||
211 | x = be32_to_cpu(rec->alloc.ar_startblock); | |
212 | x += be32_to_cpu(rec->alloc.ar_blockcount) - 1; | |
213 | key->alloc.ar_startblock = cpu_to_be32(x); | |
214 | key->alloc.ar_blockcount = 0; | |
215 | } | |
216 | ||
217 | STATIC void | |
218 | xfs_cntbt_init_high_key_from_rec( | |
219 | union xfs_btree_key *key, | |
220 | union xfs_btree_rec *rec) | |
221 | { | |
222 | key->alloc.ar_blockcount = rec->alloc.ar_blockcount; | |
223 | key->alloc.ar_startblock = 0; | |
224 | } | |
225 | ||
b194c7d8 BN |
226 | STATIC void |
227 | xfs_allocbt_init_rec_from_cur( | |
228 | struct xfs_btree_cur *cur, | |
229 | union xfs_btree_rec *rec) | |
2bd0ea18 | 230 | { |
b194c7d8 BN |
231 | rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock); |
232 | rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount); | |
233 | } | |
234 | ||
235 | STATIC void | |
236 | xfs_allocbt_init_ptr_from_cur( | |
237 | struct xfs_btree_cur *cur, | |
238 | union xfs_btree_ptr *ptr) | |
239 | { | |
240 | struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); | |
2bd0ea18 | 241 | |
b194c7d8 BN |
242 | ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno)); |
243 | ASSERT(agf->agf_roots[cur->bc_btnum] != 0); | |
244 | ||
245 | ptr->s = agf->agf_roots[cur->bc_btnum]; | |
246 | } | |
247 | ||
4a492e72 | 248 | STATIC int64_t |
46a1586d | 249 | xfs_bnobt_key_diff( |
b194c7d8 BN |
250 | struct xfs_btree_cur *cur, |
251 | union xfs_btree_key *key) | |
252 | { | |
253 | xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a; | |
254 | xfs_alloc_key_t *kp = &key->alloc; | |
b194c7d8 | 255 | |
4a492e72 | 256 | return (int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock; |
46a1586d DW |
257 | } |
258 | ||
4a492e72 | 259 | STATIC int64_t |
46a1586d DW |
260 | xfs_cntbt_key_diff( |
261 | struct xfs_btree_cur *cur, | |
262 | union xfs_btree_key *key) | |
263 | { | |
264 | xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a; | |
265 | xfs_alloc_key_t *kp = &key->alloc; | |
4a492e72 | 266 | int64_t diff; |
b194c7d8 | 267 | |
4a492e72 | 268 | diff = (int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount; |
b194c7d8 BN |
269 | if (diff) |
270 | return diff; | |
271 | ||
4a492e72 | 272 | return (int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock; |
2bd0ea18 NS |
273 | } |
274 | ||
4a492e72 | 275 | STATIC int64_t |
46a1586d DW |
276 | xfs_bnobt_diff_two_keys( |
277 | struct xfs_btree_cur *cur, | |
278 | union xfs_btree_key *k1, | |
279 | union xfs_btree_key *k2) | |
280 | { | |
4a492e72 | 281 | return (int64_t)be32_to_cpu(k1->alloc.ar_startblock) - |
46a1586d DW |
282 | be32_to_cpu(k2->alloc.ar_startblock); |
283 | } | |
284 | ||
4a492e72 | 285 | STATIC int64_t |
46a1586d DW |
286 | xfs_cntbt_diff_two_keys( |
287 | struct xfs_btree_cur *cur, | |
288 | union xfs_btree_key *k1, | |
289 | union xfs_btree_key *k2) | |
290 | { | |
4a492e72 | 291 | int64_t diff; |
46a1586d DW |
292 | |
293 | diff = be32_to_cpu(k1->alloc.ar_blockcount) - | |
294 | be32_to_cpu(k2->alloc.ar_blockcount); | |
295 | if (diff) | |
296 | return diff; | |
297 | ||
298 | return be32_to_cpu(k1->alloc.ar_startblock) - | |
299 | be32_to_cpu(k2->alloc.ar_startblock); | |
300 | } | |
301 | ||
bc01119d | 302 | static xfs_failaddr_t |
a2ceac1f DC |
303 | xfs_allocbt_verify( |
304 | struct xfs_buf *bp) | |
305 | { | |
306 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
307 | struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp); | |
308 | struct xfs_perag *pag = bp->b_pag; | |
bc01119d | 309 | xfs_failaddr_t fa; |
a2ceac1f | 310 | unsigned int level; |
a2ceac1f DC |
311 | |
312 | /* | |
313 | * magic number and level verification | |
314 | * | |
5dfa5cd2 DC |
315 | * During growfs operations, we can't verify the exact level or owner as |
316 | * the perag is not fully initialised and hence not attached to the | |
317 | * buffer. In this case, check against the maximum tree depth. | |
c0adfb03 DC |
318 | * |
319 | * Similarly, during log recovery we will have a perag structure | |
320 | * attached, but the agf information will not yet have been initialised | |
321 | * from the on disk AGF. Again, we can only check against maximum limits | |
322 | * in this case. | |
a2ceac1f DC |
323 | */ |
324 | level = be16_to_cpu(block->bb_level); | |
c0adfb03 DC |
325 | switch (block->bb_magic) { |
326 | case cpu_to_be32(XFS_ABTB_CRC_MAGIC): | |
bc01119d DW |
327 | fa = xfs_btree_sblock_v5hdr_verify(bp); |
328 | if (fa) | |
329 | return fa; | |
5dfa5cd2 | 330 | /* fall through */ |
c0adfb03 DC |
331 | case cpu_to_be32(XFS_ABTB_MAGIC): |
332 | if (pag && pag->pagf_init) { | |
5dfa5cd2 | 333 | if (level >= pag->pagf_levels[XFS_BTNUM_BNOi]) |
bc01119d | 334 | return __this_address; |
5dfa5cd2 | 335 | } else if (level >= mp->m_ag_maxlevels) |
bc01119d | 336 | return __this_address; |
a2ceac1f | 337 | break; |
c0adfb03 | 338 | case cpu_to_be32(XFS_ABTC_CRC_MAGIC): |
bc01119d DW |
339 | fa = xfs_btree_sblock_v5hdr_verify(bp); |
340 | if (fa) | |
341 | return fa; | |
5dfa5cd2 | 342 | /* fall through */ |
c0adfb03 DC |
343 | case cpu_to_be32(XFS_ABTC_MAGIC): |
344 | if (pag && pag->pagf_init) { | |
5dfa5cd2 | 345 | if (level >= pag->pagf_levels[XFS_BTNUM_CNTi]) |
bc01119d | 346 | return __this_address; |
5dfa5cd2 | 347 | } else if (level >= mp->m_ag_maxlevels) |
bc01119d | 348 | return __this_address; |
a2ceac1f DC |
349 | break; |
350 | default: | |
bc01119d | 351 | return __this_address; |
a2ceac1f DC |
352 | } |
353 | ||
dbca0167 | 354 | return xfs_btree_sblock_verify(bp, mp->m_alloc_mxr[level != 0]); |
a2ceac1f DC |
355 | } |
356 | ||
357 | static void | |
358 | xfs_allocbt_read_verify( | |
359 | struct xfs_buf *bp) | |
360 | { | |
1e697959 DW |
361 | xfs_failaddr_t fa; |
362 | ||
45922933 | 363 | if (!xfs_btree_sblock_verify_crc(bp)) |
1e697959 DW |
364 | xfs_verifier_error(bp, -EFSBADCRC, __this_address); |
365 | else { | |
366 | fa = xfs_allocbt_verify(bp); | |
367 | if (fa) | |
368 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
369 | } | |
45922933 | 370 | |
7e6c95f1 | 371 | if (bp->b_error) |
45922933 | 372 | trace_xfs_btree_corrupt(bp, _RET_IP_); |
a2ceac1f DC |
373 | } |
374 | ||
375 | static void | |
376 | xfs_allocbt_write_verify( | |
377 | struct xfs_buf *bp) | |
378 | { | |
1e697959 DW |
379 | xfs_failaddr_t fa; |
380 | ||
381 | fa = xfs_allocbt_verify(bp); | |
382 | if (fa) { | |
5dfa5cd2 | 383 | trace_xfs_btree_corrupt(bp, _RET_IP_); |
1e697959 | 384 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); |
dbf564d1 | 385 | return; |
5dfa5cd2 DC |
386 | } |
387 | xfs_btree_sblock_calc_crc(bp); | |
388 | ||
a2ceac1f DC |
389 | } |
390 | ||
391 | const struct xfs_buf_ops xfs_allocbt_buf_ops = { | |
a3fac935 | 392 | .name = "xfs_allocbt", |
a2ceac1f DC |
393 | .verify_read = xfs_allocbt_read_verify, |
394 | .verify_write = xfs_allocbt_write_verify, | |
95d9582b | 395 | .verify_struct = xfs_allocbt_verify, |
a2ceac1f DC |
396 | }; |
397 | ||
398 | ||
b194c7d8 | 399 | STATIC int |
46a1586d | 400 | xfs_bnobt_keys_inorder( |
b194c7d8 BN |
401 | struct xfs_btree_cur *cur, |
402 | union xfs_btree_key *k1, | |
403 | union xfs_btree_key *k2) | |
404 | { | |
46a1586d DW |
405 | return be32_to_cpu(k1->alloc.ar_startblock) < |
406 | be32_to_cpu(k2->alloc.ar_startblock); | |
b194c7d8 | 407 | } |
2bd0ea18 | 408 | |
b194c7d8 | 409 | STATIC int |
46a1586d | 410 | xfs_bnobt_recs_inorder( |
b194c7d8 BN |
411 | struct xfs_btree_cur *cur, |
412 | union xfs_btree_rec *r1, | |
413 | union xfs_btree_rec *r2) | |
414 | { | |
46a1586d DW |
415 | return be32_to_cpu(r1->alloc.ar_startblock) + |
416 | be32_to_cpu(r1->alloc.ar_blockcount) <= | |
417 | be32_to_cpu(r2->alloc.ar_startblock); | |
418 | } | |
419 | ||
420 | STATIC int | |
421 | xfs_cntbt_keys_inorder( | |
422 | struct xfs_btree_cur *cur, | |
423 | union xfs_btree_key *k1, | |
424 | union xfs_btree_key *k2) | |
425 | { | |
426 | return be32_to_cpu(k1->alloc.ar_blockcount) < | |
427 | be32_to_cpu(k2->alloc.ar_blockcount) || | |
428 | (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount && | |
429 | be32_to_cpu(k1->alloc.ar_startblock) < | |
430 | be32_to_cpu(k2->alloc.ar_startblock)); | |
2bd0ea18 NS |
431 | } |
432 | ||
46a1586d DW |
433 | STATIC int |
434 | xfs_cntbt_recs_inorder( | |
435 | struct xfs_btree_cur *cur, | |
436 | union xfs_btree_rec *r1, | |
437 | union xfs_btree_rec *r2) | |
438 | { | |
439 | return be32_to_cpu(r1->alloc.ar_blockcount) < | |
440 | be32_to_cpu(r2->alloc.ar_blockcount) || | |
441 | (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount && | |
442 | be32_to_cpu(r1->alloc.ar_startblock) < | |
443 | be32_to_cpu(r2->alloc.ar_startblock)); | |
444 | } | |
46a1586d DW |
445 | |
446 | static const struct xfs_btree_ops xfs_bnobt_ops = { | |
b194c7d8 BN |
447 | .rec_len = sizeof(xfs_alloc_rec_t), |
448 | .key_len = sizeof(xfs_alloc_key_t), | |
449 | ||
450 | .dup_cursor = xfs_allocbt_dup_cursor, | |
451 | .set_root = xfs_allocbt_set_root, | |
b194c7d8 BN |
452 | .alloc_block = xfs_allocbt_alloc_block, |
453 | .free_block = xfs_allocbt_free_block, | |
454 | .update_lastrec = xfs_allocbt_update_lastrec, | |
455 | .get_minrecs = xfs_allocbt_get_minrecs, | |
456 | .get_maxrecs = xfs_allocbt_get_maxrecs, | |
457 | .init_key_from_rec = xfs_allocbt_init_key_from_rec, | |
46a1586d | 458 | .init_high_key_from_rec = xfs_bnobt_init_high_key_from_rec, |
b194c7d8 BN |
459 | .init_rec_from_cur = xfs_allocbt_init_rec_from_cur, |
460 | .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur, | |
46a1586d | 461 | .key_diff = xfs_bnobt_key_diff, |
a2ceac1f | 462 | .buf_ops = &xfs_allocbt_buf_ops, |
46a1586d | 463 | .diff_two_keys = xfs_bnobt_diff_two_keys, |
46a1586d DW |
464 | .keys_inorder = xfs_bnobt_keys_inorder, |
465 | .recs_inorder = xfs_bnobt_recs_inorder, | |
46a1586d DW |
466 | }; |
467 | ||
468 | static const struct xfs_btree_ops xfs_cntbt_ops = { | |
469 | .rec_len = sizeof(xfs_alloc_rec_t), | |
470 | .key_len = sizeof(xfs_alloc_key_t), | |
471 | ||
472 | .dup_cursor = xfs_allocbt_dup_cursor, | |
473 | .set_root = xfs_allocbt_set_root, | |
474 | .alloc_block = xfs_allocbt_alloc_block, | |
475 | .free_block = xfs_allocbt_free_block, | |
476 | .update_lastrec = xfs_allocbt_update_lastrec, | |
477 | .get_minrecs = xfs_allocbt_get_minrecs, | |
478 | .get_maxrecs = xfs_allocbt_get_maxrecs, | |
479 | .init_key_from_rec = xfs_allocbt_init_key_from_rec, | |
480 | .init_high_key_from_rec = xfs_cntbt_init_high_key_from_rec, | |
481 | .init_rec_from_cur = xfs_allocbt_init_rec_from_cur, | |
482 | .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur, | |
483 | .key_diff = xfs_cntbt_key_diff, | |
484 | .buf_ops = &xfs_allocbt_buf_ops, | |
485 | .diff_two_keys = xfs_cntbt_diff_two_keys, | |
46a1586d DW |
486 | .keys_inorder = xfs_cntbt_keys_inorder, |
487 | .recs_inorder = xfs_cntbt_recs_inorder, | |
b194c7d8 | 488 | }; |
2bd0ea18 NS |
489 | |
490 | /* | |
b194c7d8 | 491 | * Allocate a new allocation btree cursor. |
2bd0ea18 | 492 | */ |
b194c7d8 BN |
493 | struct xfs_btree_cur * /* new alloc btree cursor */ |
494 | xfs_allocbt_init_cursor( | |
495 | struct xfs_mount *mp, /* file system mount point */ | |
496 | struct xfs_trans *tp, /* transaction pointer */ | |
497 | struct xfs_buf *agbp, /* buffer for agf structure */ | |
498 | xfs_agnumber_t agno, /* allocation group number */ | |
499 | xfs_btnum_t btnum) /* btree identifier */ | |
2bd0ea18 | 500 | { |
b194c7d8 BN |
501 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); |
502 | struct xfs_btree_cur *cur; | |
2bd0ea18 | 503 | |
b194c7d8 | 504 | ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT); |
2bd0ea18 | 505 | |
762989ef | 506 | cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_NOFS); |
2bd0ea18 | 507 | |
b194c7d8 BN |
508 | cur->bc_tp = tp; |
509 | cur->bc_mp = mp; | |
b194c7d8 BN |
510 | cur->bc_btnum = btnum; |
511 | cur->bc_blocklog = mp->m_sb.sb_blocklog; | |
a2ceac1f DC |
512 | |
513 | if (btnum == XFS_BTNUM_CNT) { | |
46a1586d DW |
514 | cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtc_2); |
515 | cur->bc_ops = &xfs_cntbt_ops; | |
a2ceac1f | 516 | cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); |
b194c7d8 | 517 | cur->bc_flags = XFS_BTREE_LASTREC_UPDATE; |
a2ceac1f | 518 | } else { |
46a1586d DW |
519 | cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_abtb_2); |
520 | cur->bc_ops = &xfs_bnobt_ops; | |
a2ceac1f DC |
521 | cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); |
522 | } | |
b194c7d8 BN |
523 | |
524 | cur->bc_private.a.agbp = agbp; | |
525 | cur->bc_private.a.agno = agno; | |
526 | ||
5dfa5cd2 DC |
527 | if (xfs_sb_version_hascrc(&mp->m_sb)) |
528 | cur->bc_flags |= XFS_BTREE_CRC_BLOCKS; | |
529 | ||
b194c7d8 | 530 | return cur; |
2bd0ea18 | 531 | } |
b3563c19 BN |
532 | |
533 | /* | |
534 | * Calculate number of records in an alloc btree block. | |
535 | */ | |
536 | int | |
537 | xfs_allocbt_maxrecs( | |
538 | struct xfs_mount *mp, | |
539 | int blocklen, | |
540 | int leaf) | |
541 | { | |
542 | blocklen -= XFS_ALLOC_BLOCK_LEN(mp); | |
543 | ||
544 | if (leaf) | |
545 | return blocklen / sizeof(xfs_alloc_rec_t); | |
546 | return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t)); | |
547 | } |