Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 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 | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 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. | |
1da177e4 | 13 | * |
7b718769 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 | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
a4fbe6ab | 20 | #include "xfs_format.h" |
239880ef DC |
21 | #include "xfs_log_format.h" |
22 | #include "xfs_trans_resv.h" | |
1da177e4 LT |
23 | #include "xfs_sb.h" |
24 | #include "xfs_ag.h" | |
1da177e4 | 25 | #include "xfs_mount.h" |
1da177e4 | 26 | #include "xfs_btree.h" |
a4fbe6ab | 27 | #include "xfs_alloc_btree.h" |
1da177e4 | 28 | #include "xfs_alloc.h" |
efc27b52 | 29 | #include "xfs_extent_busy.h" |
1da177e4 | 30 | #include "xfs_error.h" |
0b1b213f | 31 | #include "xfs_trace.h" |
ee1a47ab | 32 | #include "xfs_cksum.h" |
239880ef | 33 | #include "xfs_trans.h" |
1da177e4 | 34 | |
1da177e4 | 35 | |
278d0ca1 CH |
36 | STATIC struct xfs_btree_cur * |
37 | xfs_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 | ||
344207ce CH |
45 | STATIC void |
46 | xfs_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; | |
a862e0fd | 55 | struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno); |
344207ce CH |
56 | |
57 | ASSERT(ptr->s != 0); | |
58 | ||
59 | agf->agf_roots[btnum] = ptr->s; | |
60 | be32_add_cpu(&agf->agf_levels[btnum], inc); | |
a862e0fd DC |
61 | pag->pagf_levels[btnum] += inc; |
62 | xfs_perag_put(pag); | |
344207ce CH |
63 | |
64 | xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); | |
65 | } | |
66 | ||
f5eb8e7c CH |
67 | STATIC int |
68 | xfs_allocbt_alloc_block( | |
69 | struct xfs_btree_cur *cur, | |
70 | union xfs_btree_ptr *start, | |
71 | union xfs_btree_ptr *new, | |
72 | int length, | |
73 | int *stat) | |
74 | { | |
75 | int error; | |
76 | xfs_agblock_t bno; | |
77 | ||
78 | XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY); | |
79 | ||
80 | /* Allocate the new block from the freelist. If we can't, give up. */ | |
81 | error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp, | |
82 | &bno, 1); | |
83 | if (error) { | |
84 | XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR); | |
85 | return error; | |
86 | } | |
87 | ||
88 | if (bno == NULLAGBLOCK) { | |
89 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); | |
90 | *stat = 0; | |
91 | return 0; | |
92 | } | |
97d3ac75 | 93 | |
4ecbfe63 | 94 | xfs_extent_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false); |
f5eb8e7c CH |
95 | |
96 | xfs_trans_agbtree_delta(cur->bc_tp, 1); | |
97 | new->s = cpu_to_be32(bno); | |
98 | ||
99 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); | |
100 | *stat = 1; | |
101 | return 0; | |
102 | } | |
103 | ||
d4b3a4b7 CH |
104 | STATIC int |
105 | xfs_allocbt_free_block( | |
106 | struct xfs_btree_cur *cur, | |
107 | struct xfs_buf *bp) | |
108 | { | |
109 | struct xfs_buf *agbp = cur->bc_private.a.agbp; | |
110 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); | |
111 | xfs_agblock_t bno; | |
112 | int error; | |
113 | ||
b6e32227 | 114 | bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp)); |
d4b3a4b7 CH |
115 | error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1); |
116 | if (error) | |
117 | return error; | |
118 | ||
4ecbfe63 DC |
119 | xfs_extent_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1, |
120 | XFS_EXTENT_BUSY_SKIP_DISCARD); | |
d4b3a4b7 | 121 | xfs_trans_agbtree_delta(cur->bc_tp, -1); |
4c05f9ad DC |
122 | |
123 | xfs_trans_binval(cur->bc_tp, bp); | |
d4b3a4b7 CH |
124 | return 0; |
125 | } | |
126 | ||
1da177e4 | 127 | /* |
278d0ca1 | 128 | * Update the longest extent in the AGF |
1da177e4 | 129 | */ |
278d0ca1 CH |
130 | STATIC void |
131 | xfs_allocbt_update_lastrec( | |
132 | struct xfs_btree_cur *cur, | |
133 | struct xfs_btree_block *block, | |
134 | union xfs_btree_rec *rec, | |
135 | int ptr, | |
136 | int reason) | |
1da177e4 | 137 | { |
278d0ca1 CH |
138 | struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); |
139 | xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno); | |
a862e0fd | 140 | struct xfs_perag *pag; |
278d0ca1 | 141 | __be32 len; |
91cca5df | 142 | int numrecs; |
1da177e4 | 143 | |
278d0ca1 | 144 | ASSERT(cur->bc_btnum == XFS_BTNUM_CNT); |
1da177e4 | 145 | |
278d0ca1 CH |
146 | switch (reason) { |
147 | case LASTREC_UPDATE: | |
1da177e4 | 148 | /* |
278d0ca1 CH |
149 | * If this is the last leaf block and it's the last record, |
150 | * then update the size of the longest extent in the AG. | |
1da177e4 | 151 | */ |
278d0ca1 CH |
152 | if (ptr != xfs_btree_get_numrecs(block)) |
153 | return; | |
154 | len = rec->alloc.ar_blockcount; | |
155 | break; | |
4b22a571 CH |
156 | case LASTREC_INSREC: |
157 | if (be32_to_cpu(rec->alloc.ar_blockcount) <= | |
158 | be32_to_cpu(agf->agf_longest)) | |
159 | return; | |
160 | len = rec->alloc.ar_blockcount; | |
91cca5df CH |
161 | break; |
162 | case LASTREC_DELREC: | |
163 | numrecs = xfs_btree_get_numrecs(block); | |
164 | if (ptr <= numrecs) | |
165 | return; | |
166 | ASSERT(ptr == numrecs + 1); | |
167 | ||
168 | if (numrecs) { | |
169 | xfs_alloc_rec_t *rrp; | |
170 | ||
136341b4 | 171 | rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs); |
91cca5df CH |
172 | len = rrp->ar_blockcount; |
173 | } else { | |
174 | len = 0; | |
175 | } | |
176 | ||
4b22a571 | 177 | break; |
278d0ca1 CH |
178 | default: |
179 | ASSERT(0); | |
180 | return; | |
1da177e4 | 181 | } |
561f7d17 | 182 | |
278d0ca1 | 183 | agf->agf_longest = len; |
a862e0fd DC |
184 | pag = xfs_perag_get(cur->bc_mp, seqno); |
185 | pag->pagf_longest = be32_to_cpu(len); | |
186 | xfs_perag_put(pag); | |
278d0ca1 | 187 | xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST); |
561f7d17 CH |
188 | } |
189 | ||
91cca5df CH |
190 | STATIC int |
191 | xfs_allocbt_get_minrecs( | |
192 | struct xfs_btree_cur *cur, | |
193 | int level) | |
194 | { | |
195 | return cur->bc_mp->m_alloc_mnr[level != 0]; | |
196 | } | |
197 | ||
ce5e42db CH |
198 | STATIC int |
199 | xfs_allocbt_get_maxrecs( | |
200 | struct xfs_btree_cur *cur, | |
201 | int level) | |
202 | { | |
203 | return cur->bc_mp->m_alloc_mxr[level != 0]; | |
204 | } | |
205 | ||
fe033cc8 CH |
206 | STATIC void |
207 | xfs_allocbt_init_key_from_rec( | |
208 | union xfs_btree_key *key, | |
209 | union xfs_btree_rec *rec) | |
210 | { | |
211 | ASSERT(rec->alloc.ar_startblock != 0); | |
212 | ||
213 | key->alloc.ar_startblock = rec->alloc.ar_startblock; | |
214 | key->alloc.ar_blockcount = rec->alloc.ar_blockcount; | |
215 | } | |
216 | ||
4b22a571 CH |
217 | STATIC void |
218 | xfs_allocbt_init_rec_from_key( | |
219 | union xfs_btree_key *key, | |
220 | union xfs_btree_rec *rec) | |
221 | { | |
222 | ASSERT(key->alloc.ar_startblock != 0); | |
223 | ||
224 | rec->alloc.ar_startblock = key->alloc.ar_startblock; | |
225 | rec->alloc.ar_blockcount = key->alloc.ar_blockcount; | |
226 | } | |
227 | ||
228 | STATIC void | |
229 | xfs_allocbt_init_rec_from_cur( | |
230 | struct xfs_btree_cur *cur, | |
231 | union xfs_btree_rec *rec) | |
232 | { | |
233 | ASSERT(cur->bc_rec.a.ar_startblock != 0); | |
234 | ||
235 | rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock); | |
236 | rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount); | |
237 | } | |
238 | ||
fe033cc8 CH |
239 | STATIC void |
240 | xfs_allocbt_init_ptr_from_cur( | |
241 | struct xfs_btree_cur *cur, | |
242 | union xfs_btree_ptr *ptr) | |
243 | { | |
244 | struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); | |
245 | ||
246 | ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno)); | |
247 | ASSERT(agf->agf_roots[cur->bc_btnum] != 0); | |
248 | ||
249 | ptr->s = agf->agf_roots[cur->bc_btnum]; | |
250 | } | |
251 | ||
252 | STATIC __int64_t | |
253 | xfs_allocbt_key_diff( | |
254 | struct xfs_btree_cur *cur, | |
255 | union xfs_btree_key *key) | |
256 | { | |
257 | xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a; | |
258 | xfs_alloc_key_t *kp = &key->alloc; | |
259 | __int64_t diff; | |
260 | ||
261 | if (cur->bc_btnum == XFS_BTNUM_BNO) { | |
262 | return (__int64_t)be32_to_cpu(kp->ar_startblock) - | |
263 | rec->ar_startblock; | |
264 | } | |
265 | ||
266 | diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount; | |
267 | if (diff) | |
268 | return diff; | |
269 | ||
270 | return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock; | |
271 | } | |
272 | ||
ee1a47ab | 273 | static bool |
612cfbfe | 274 | xfs_allocbt_verify( |
3d3e6f64 DC |
275 | struct xfs_buf *bp) |
276 | { | |
277 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
278 | struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp); | |
279 | struct xfs_perag *pag = bp->b_pag; | |
280 | unsigned int level; | |
3d3e6f64 DC |
281 | |
282 | /* | |
283 | * magic number and level verification | |
284 | * | |
ee1a47ab CH |
285 | * During growfs operations, we can't verify the exact level or owner as |
286 | * the perag is not fully initialised and hence not attached to the | |
287 | * buffer. In this case, check against the maximum tree depth. | |
288 | * | |
289 | * Similarly, during log recovery we will have a perag structure | |
290 | * attached, but the agf information will not yet have been initialised | |
291 | * from the on disk AGF. Again, we can only check against maximum limits | |
292 | * in this case. | |
3d3e6f64 DC |
293 | */ |
294 | level = be16_to_cpu(block->bb_level); | |
295 | switch (block->bb_magic) { | |
ee1a47ab CH |
296 | case cpu_to_be32(XFS_ABTB_CRC_MAGIC): |
297 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
298 | return false; | |
299 | if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid)) | |
300 | return false; | |
301 | if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn)) | |
302 | return false; | |
303 | if (pag && | |
304 | be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno) | |
305 | return false; | |
306 | /* fall through */ | |
3d3e6f64 | 307 | case cpu_to_be32(XFS_ABTB_MAGIC): |
ee1a47ab CH |
308 | if (pag && pag->pagf_init) { |
309 | if (level >= pag->pagf_levels[XFS_BTNUM_BNOi]) | |
310 | return false; | |
311 | } else if (level >= mp->m_ag_maxlevels) | |
312 | return false; | |
3d3e6f64 | 313 | break; |
ee1a47ab CH |
314 | case cpu_to_be32(XFS_ABTC_CRC_MAGIC): |
315 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
316 | return false; | |
317 | if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid)) | |
318 | return false; | |
319 | if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn)) | |
320 | return false; | |
321 | if (pag && | |
322 | be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno) | |
323 | return false; | |
324 | /* fall through */ | |
3d3e6f64 | 325 | case cpu_to_be32(XFS_ABTC_MAGIC): |
ee1a47ab CH |
326 | if (pag && pag->pagf_init) { |
327 | if (level >= pag->pagf_levels[XFS_BTNUM_CNTi]) | |
328 | return false; | |
329 | } else if (level >= mp->m_ag_maxlevels) | |
330 | return false; | |
3d3e6f64 DC |
331 | break; |
332 | default: | |
ee1a47ab | 333 | return false; |
3d3e6f64 DC |
334 | } |
335 | ||
336 | /* numrecs verification */ | |
ee1a47ab CH |
337 | if (be16_to_cpu(block->bb_numrecs) > mp->m_alloc_mxr[level != 0]) |
338 | return false; | |
3d3e6f64 DC |
339 | |
340 | /* sibling pointer verification */ | |
ee1a47ab CH |
341 | if (!block->bb_u.s.bb_leftsib || |
342 | (be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks && | |
343 | block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK))) | |
344 | return false; | |
345 | if (!block->bb_u.s.bb_rightsib || | |
346 | (be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks && | |
347 | block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK))) | |
348 | return false; | |
349 | ||
350 | return true; | |
612cfbfe | 351 | } |
3d3e6f64 | 352 | |
612cfbfe | 353 | static void |
1813dd64 | 354 | xfs_allocbt_read_verify( |
612cfbfe DC |
355 | struct xfs_buf *bp) |
356 | { | |
ee1a47ab CH |
357 | if (!(xfs_btree_sblock_verify_crc(bp) && |
358 | xfs_allocbt_verify(bp))) { | |
359 | trace_xfs_btree_corrupt(bp, _RET_IP_); | |
360 | XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, | |
361 | bp->b_target->bt_mount, bp->b_addr); | |
362 | xfs_buf_ioerror(bp, EFSCORRUPTED); | |
363 | } | |
612cfbfe DC |
364 | } |
365 | ||
1813dd64 DC |
366 | static void |
367 | xfs_allocbt_write_verify( | |
612cfbfe DC |
368 | struct xfs_buf *bp) |
369 | { | |
ee1a47ab CH |
370 | if (!xfs_allocbt_verify(bp)) { |
371 | trace_xfs_btree_corrupt(bp, _RET_IP_); | |
372 | XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, | |
373 | bp->b_target->bt_mount, bp->b_addr); | |
374 | xfs_buf_ioerror(bp, EFSCORRUPTED); | |
375 | } | |
376 | xfs_btree_sblock_calc_crc(bp); | |
377 | ||
3d3e6f64 DC |
378 | } |
379 | ||
1813dd64 DC |
380 | const struct xfs_buf_ops xfs_allocbt_buf_ops = { |
381 | .verify_read = xfs_allocbt_read_verify, | |
382 | .verify_write = xfs_allocbt_write_verify, | |
383 | }; | |
384 | ||
385 | ||
742ae1e3 | 386 | #if defined(DEBUG) || defined(XFS_WARN) |
4a26e66e CH |
387 | STATIC int |
388 | xfs_allocbt_keys_inorder( | |
389 | struct xfs_btree_cur *cur, | |
390 | union xfs_btree_key *k1, | |
391 | union xfs_btree_key *k2) | |
392 | { | |
393 | if (cur->bc_btnum == XFS_BTNUM_BNO) { | |
394 | return be32_to_cpu(k1->alloc.ar_startblock) < | |
395 | be32_to_cpu(k2->alloc.ar_startblock); | |
396 | } else { | |
397 | return be32_to_cpu(k1->alloc.ar_blockcount) < | |
398 | be32_to_cpu(k2->alloc.ar_blockcount) || | |
399 | (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount && | |
400 | be32_to_cpu(k1->alloc.ar_startblock) < | |
401 | be32_to_cpu(k2->alloc.ar_startblock)); | |
402 | } | |
403 | } | |
404 | ||
405 | STATIC int | |
406 | xfs_allocbt_recs_inorder( | |
407 | struct xfs_btree_cur *cur, | |
408 | union xfs_btree_rec *r1, | |
409 | union xfs_btree_rec *r2) | |
410 | { | |
411 | if (cur->bc_btnum == XFS_BTNUM_BNO) { | |
412 | return be32_to_cpu(r1->alloc.ar_startblock) + | |
413 | be32_to_cpu(r1->alloc.ar_blockcount) <= | |
414 | be32_to_cpu(r2->alloc.ar_startblock); | |
415 | } else { | |
416 | return be32_to_cpu(r1->alloc.ar_blockcount) < | |
417 | be32_to_cpu(r2->alloc.ar_blockcount) || | |
418 | (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount && | |
419 | be32_to_cpu(r1->alloc.ar_startblock) < | |
420 | be32_to_cpu(r2->alloc.ar_startblock)); | |
421 | } | |
422 | } | |
423 | #endif /* DEBUG */ | |
424 | ||
561f7d17 | 425 | static const struct xfs_btree_ops xfs_allocbt_ops = { |
65f1eaea CH |
426 | .rec_len = sizeof(xfs_alloc_rec_t), |
427 | .key_len = sizeof(xfs_alloc_key_t), | |
428 | ||
561f7d17 | 429 | .dup_cursor = xfs_allocbt_dup_cursor, |
344207ce | 430 | .set_root = xfs_allocbt_set_root, |
f5eb8e7c | 431 | .alloc_block = xfs_allocbt_alloc_block, |
d4b3a4b7 | 432 | .free_block = xfs_allocbt_free_block, |
278d0ca1 | 433 | .update_lastrec = xfs_allocbt_update_lastrec, |
91cca5df | 434 | .get_minrecs = xfs_allocbt_get_minrecs, |
ce5e42db | 435 | .get_maxrecs = xfs_allocbt_get_maxrecs, |
fe033cc8 | 436 | .init_key_from_rec = xfs_allocbt_init_key_from_rec, |
4b22a571 CH |
437 | .init_rec_from_key = xfs_allocbt_init_rec_from_key, |
438 | .init_rec_from_cur = xfs_allocbt_init_rec_from_cur, | |
fe033cc8 CH |
439 | .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur, |
440 | .key_diff = xfs_allocbt_key_diff, | |
1813dd64 | 441 | .buf_ops = &xfs_allocbt_buf_ops, |
742ae1e3 | 442 | #if defined(DEBUG) || defined(XFS_WARN) |
4a26e66e CH |
443 | .keys_inorder = xfs_allocbt_keys_inorder, |
444 | .recs_inorder = xfs_allocbt_recs_inorder, | |
445 | #endif | |
561f7d17 CH |
446 | }; |
447 | ||
448 | /* | |
449 | * Allocate a new allocation btree cursor. | |
450 | */ | |
451 | struct xfs_btree_cur * /* new alloc btree cursor */ | |
452 | xfs_allocbt_init_cursor( | |
453 | struct xfs_mount *mp, /* file system mount point */ | |
454 | struct xfs_trans *tp, /* transaction pointer */ | |
455 | struct xfs_buf *agbp, /* buffer for agf structure */ | |
456 | xfs_agnumber_t agno, /* allocation group number */ | |
457 | xfs_btnum_t btnum) /* btree identifier */ | |
458 | { | |
459 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); | |
460 | struct xfs_btree_cur *cur; | |
461 | ||
462 | ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT); | |
463 | ||
464 | cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP); | |
465 | ||
466 | cur->bc_tp = tp; | |
467 | cur->bc_mp = mp; | |
561f7d17 CH |
468 | cur->bc_btnum = btnum; |
469 | cur->bc_blocklog = mp->m_sb.sb_blocklog; | |
561f7d17 | 470 | cur->bc_ops = &xfs_allocbt_ops; |
dec58f1d CH |
471 | |
472 | if (btnum == XFS_BTNUM_CNT) { | |
473 | cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); | |
278d0ca1 | 474 | cur->bc_flags = XFS_BTREE_LASTREC_UPDATE; |
dec58f1d CH |
475 | } else { |
476 | cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); | |
477 | } | |
561f7d17 CH |
478 | |
479 | cur->bc_private.a.agbp = agbp; | |
480 | cur->bc_private.a.agno = agno; | |
481 | ||
ee1a47ab CH |
482 | if (xfs_sb_version_hascrc(&mp->m_sb)) |
483 | cur->bc_flags |= XFS_BTREE_CRC_BLOCKS; | |
484 | ||
561f7d17 CH |
485 | return cur; |
486 | } | |
60197e8d CH |
487 | |
488 | /* | |
489 | * Calculate number of records in an alloc btree block. | |
490 | */ | |
491 | int | |
492 | xfs_allocbt_maxrecs( | |
493 | struct xfs_mount *mp, | |
494 | int blocklen, | |
495 | int leaf) | |
496 | { | |
7cc95a82 | 497 | blocklen -= XFS_ALLOC_BLOCK_LEN(mp); |
60197e8d CH |
498 | |
499 | if (leaf) | |
500 | return blocklen / sizeof(xfs_alloc_rec_t); | |
501 | return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t)); | |
502 | } |