2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
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
7 * published by the Free Software Foundation.
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.
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
18 #include "libxfs_priv.h"
20 #include "xfs_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.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"
34 STATIC
struct xfs_btree_cur
*
35 xfs_allocbt_dup_cursor(
36 struct xfs_btree_cur
*cur
)
38 return xfs_allocbt_init_cursor(cur
->bc_mp
, cur
->bc_tp
,
39 cur
->bc_private
.a
.agbp
, cur
->bc_private
.a
.agno
,
45 struct xfs_btree_cur
*cur
,
46 union xfs_btree_ptr
*ptr
,
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
;
53 struct xfs_perag
*pag
= xfs_perag_get(cur
->bc_mp
, seqno
);
57 agf
->agf_roots
[btnum
] = ptr
->s
;
58 be32_add_cpu(&agf
->agf_levels
[btnum
], inc
);
59 pag
->pagf_levels
[btnum
] += inc
;
62 xfs_alloc_log_agf(cur
->bc_tp
, agbp
, XFS_AGF_ROOTS
| XFS_AGF_LEVELS
);
66 xfs_allocbt_alloc_block(
67 struct xfs_btree_cur
*cur
,
68 union xfs_btree_ptr
*start
,
69 union xfs_btree_ptr
*new,
75 XFS_BTREE_TRACE_CURSOR(cur
, XBT_ENTRY
);
77 /* Allocate the new block from the freelist. If we can't, give up. */
78 error
= xfs_alloc_get_freelist(cur
->bc_tp
, cur
->bc_private
.a
.agbp
,
81 XFS_BTREE_TRACE_CURSOR(cur
, XBT_ERROR
);
85 if (bno
== NULLAGBLOCK
) {
86 XFS_BTREE_TRACE_CURSOR(cur
, XBT_EXIT
);
91 xfs_extent_busy_reuse(cur
->bc_mp
, cur
->bc_private
.a
.agno
, bno
, 1, false);
93 xfs_trans_agbtree_delta(cur
->bc_tp
, 1);
94 new->s
= cpu_to_be32(bno
);
96 XFS_BTREE_TRACE_CURSOR(cur
, XBT_EXIT
);
102 xfs_allocbt_free_block(
103 struct xfs_btree_cur
*cur
,
106 struct xfs_buf
*agbp
= cur
->bc_private
.a
.agbp
;
107 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(agbp
);
111 bno
= xfs_daddr_to_agbno(cur
->bc_mp
, XFS_BUF_ADDR(bp
));
112 error
= xfs_alloc_put_freelist(cur
->bc_tp
, agbp
, NULL
, bno
, 1);
116 xfs_extent_busy_insert(cur
->bc_tp
, be32_to_cpu(agf
->agf_seqno
), bno
, 1,
117 XFS_EXTENT_BUSY_SKIP_DISCARD
);
118 xfs_trans_agbtree_delta(cur
->bc_tp
, -1);
123 * Update the longest extent in the AGF
126 xfs_allocbt_update_lastrec(
127 struct xfs_btree_cur
*cur
,
128 struct xfs_btree_block
*block
,
129 union xfs_btree_rec
*rec
,
133 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(cur
->bc_private
.a
.agbp
);
134 xfs_agnumber_t seqno
= be32_to_cpu(agf
->agf_seqno
);
135 struct xfs_perag
*pag
;
139 ASSERT(cur
->bc_btnum
== XFS_BTNUM_CNT
);
144 * If this is the last leaf block and it's the last record,
145 * then update the size of the longest extent in the AG.
147 if (ptr
!= xfs_btree_get_numrecs(block
))
149 len
= rec
->alloc
.ar_blockcount
;
152 if (be32_to_cpu(rec
->alloc
.ar_blockcount
) <=
153 be32_to_cpu(agf
->agf_longest
))
155 len
= rec
->alloc
.ar_blockcount
;
158 numrecs
= xfs_btree_get_numrecs(block
);
161 ASSERT(ptr
== numrecs
+ 1);
164 xfs_alloc_rec_t
*rrp
;
166 rrp
= XFS_ALLOC_REC_ADDR(cur
->bc_mp
, block
, numrecs
);
167 len
= rrp
->ar_blockcount
;
178 agf
->agf_longest
= len
;
179 pag
= xfs_perag_get(cur
->bc_mp
, seqno
);
180 pag
->pagf_longest
= be32_to_cpu(len
);
182 xfs_alloc_log_agf(cur
->bc_tp
, cur
->bc_private
.a
.agbp
, XFS_AGF_LONGEST
);
186 xfs_allocbt_get_minrecs(
187 struct xfs_btree_cur
*cur
,
190 return cur
->bc_mp
->m_alloc_mnr
[level
!= 0];
194 xfs_allocbt_get_maxrecs(
195 struct xfs_btree_cur
*cur
,
198 return cur
->bc_mp
->m_alloc_mxr
[level
!= 0];
202 xfs_allocbt_init_key_from_rec(
203 union xfs_btree_key
*key
,
204 union xfs_btree_rec
*rec
)
206 ASSERT(rec
->alloc
.ar_startblock
!= 0);
208 key
->alloc
.ar_startblock
= rec
->alloc
.ar_startblock
;
209 key
->alloc
.ar_blockcount
= rec
->alloc
.ar_blockcount
;
213 xfs_allocbt_init_rec_from_key(
214 union xfs_btree_key
*key
,
215 union xfs_btree_rec
*rec
)
217 ASSERT(key
->alloc
.ar_startblock
!= 0);
219 rec
->alloc
.ar_startblock
= key
->alloc
.ar_startblock
;
220 rec
->alloc
.ar_blockcount
= key
->alloc
.ar_blockcount
;
224 xfs_allocbt_init_rec_from_cur(
225 struct xfs_btree_cur
*cur
,
226 union xfs_btree_rec
*rec
)
228 ASSERT(cur
->bc_rec
.a
.ar_startblock
!= 0);
230 rec
->alloc
.ar_startblock
= cpu_to_be32(cur
->bc_rec
.a
.ar_startblock
);
231 rec
->alloc
.ar_blockcount
= cpu_to_be32(cur
->bc_rec
.a
.ar_blockcount
);
235 xfs_allocbt_init_ptr_from_cur(
236 struct xfs_btree_cur
*cur
,
237 union xfs_btree_ptr
*ptr
)
239 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(cur
->bc_private
.a
.agbp
);
241 ASSERT(cur
->bc_private
.a
.agno
== be32_to_cpu(agf
->agf_seqno
));
242 ASSERT(agf
->agf_roots
[cur
->bc_btnum
] != 0);
244 ptr
->s
= agf
->agf_roots
[cur
->bc_btnum
];
248 xfs_allocbt_key_diff(
249 struct xfs_btree_cur
*cur
,
250 union xfs_btree_key
*key
)
252 xfs_alloc_rec_incore_t
*rec
= &cur
->bc_rec
.a
;
253 xfs_alloc_key_t
*kp
= &key
->alloc
;
256 if (cur
->bc_btnum
== XFS_BTNUM_BNO
) {
257 return (__int64_t
)be32_to_cpu(kp
->ar_startblock
) -
261 diff
= (__int64_t
)be32_to_cpu(kp
->ar_blockcount
) - rec
->ar_blockcount
;
265 return (__int64_t
)be32_to_cpu(kp
->ar_startblock
) - rec
->ar_startblock
;
272 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
273 struct xfs_btree_block
*block
= XFS_BUF_TO_BLOCK(bp
);
274 struct xfs_perag
*pag
= bp
->b_pag
;
278 * magic number and level verification
280 * During growfs operations, we can't verify the exact level or owner as
281 * the perag is not fully initialised and hence not attached to the
282 * buffer. In this case, check against the maximum tree depth.
284 * Similarly, during log recovery we will have a perag structure
285 * attached, but the agf information will not yet have been initialised
286 * from the on disk AGF. Again, we can only check against maximum limits
289 level
= be16_to_cpu(block
->bb_level
);
290 switch (block
->bb_magic
) {
291 case cpu_to_be32(XFS_ABTB_CRC_MAGIC
):
292 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
294 if (!xfs_btree_sblock_v5hdr_verify(bp
))
297 case cpu_to_be32(XFS_ABTB_MAGIC
):
298 if (pag
&& pag
->pagf_init
) {
299 if (level
>= pag
->pagf_levels
[XFS_BTNUM_BNOi
])
301 } else if (level
>= mp
->m_ag_maxlevels
)
304 case cpu_to_be32(XFS_ABTC_CRC_MAGIC
):
305 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
307 if (!xfs_btree_sblock_v5hdr_verify(bp
))
310 case cpu_to_be32(XFS_ABTC_MAGIC
):
311 if (pag
&& pag
->pagf_init
) {
312 if (level
>= pag
->pagf_levels
[XFS_BTNUM_CNTi
])
314 } else if (level
>= mp
->m_ag_maxlevels
)
321 return xfs_btree_sblock_verify(bp
, mp
->m_alloc_mxr
[level
!= 0]);
325 xfs_allocbt_read_verify(
328 if (!xfs_btree_sblock_verify_crc(bp
))
329 xfs_buf_ioerror(bp
, -EFSBADCRC
);
330 else if (!xfs_allocbt_verify(bp
))
331 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
334 trace_xfs_btree_corrupt(bp
, _RET_IP_
);
335 xfs_verifier_error(bp
);
340 xfs_allocbt_write_verify(
343 if (!xfs_allocbt_verify(bp
)) {
344 trace_xfs_btree_corrupt(bp
, _RET_IP_
);
345 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
346 xfs_verifier_error(bp
);
349 xfs_btree_sblock_calc_crc(bp
);
353 const struct xfs_buf_ops xfs_allocbt_buf_ops
= {
354 .name
= "xfs_allocbt",
355 .verify_read
= xfs_allocbt_read_verify
,
356 .verify_write
= xfs_allocbt_write_verify
,
360 #if defined(DEBUG) || defined(XFS_WARN)
362 xfs_allocbt_keys_inorder(
363 struct xfs_btree_cur
*cur
,
364 union xfs_btree_key
*k1
,
365 union xfs_btree_key
*k2
)
367 if (cur
->bc_btnum
== XFS_BTNUM_BNO
) {
368 return be32_to_cpu(k1
->alloc
.ar_startblock
) <
369 be32_to_cpu(k2
->alloc
.ar_startblock
);
371 return be32_to_cpu(k1
->alloc
.ar_blockcount
) <
372 be32_to_cpu(k2
->alloc
.ar_blockcount
) ||
373 (k1
->alloc
.ar_blockcount
== k2
->alloc
.ar_blockcount
&&
374 be32_to_cpu(k1
->alloc
.ar_startblock
) <
375 be32_to_cpu(k2
->alloc
.ar_startblock
));
380 xfs_allocbt_recs_inorder(
381 struct xfs_btree_cur
*cur
,
382 union xfs_btree_rec
*r1
,
383 union xfs_btree_rec
*r2
)
385 if (cur
->bc_btnum
== XFS_BTNUM_BNO
) {
386 return be32_to_cpu(r1
->alloc
.ar_startblock
) +
387 be32_to_cpu(r1
->alloc
.ar_blockcount
) <=
388 be32_to_cpu(r2
->alloc
.ar_startblock
);
390 return be32_to_cpu(r1
->alloc
.ar_blockcount
) <
391 be32_to_cpu(r2
->alloc
.ar_blockcount
) ||
392 (r1
->alloc
.ar_blockcount
== r2
->alloc
.ar_blockcount
&&
393 be32_to_cpu(r1
->alloc
.ar_startblock
) <
394 be32_to_cpu(r2
->alloc
.ar_startblock
));
399 static const struct xfs_btree_ops xfs_allocbt_ops
= {
400 .rec_len
= sizeof(xfs_alloc_rec_t
),
401 .key_len
= sizeof(xfs_alloc_key_t
),
403 .dup_cursor
= xfs_allocbt_dup_cursor
,
404 .set_root
= xfs_allocbt_set_root
,
405 .alloc_block
= xfs_allocbt_alloc_block
,
406 .free_block
= xfs_allocbt_free_block
,
407 .update_lastrec
= xfs_allocbt_update_lastrec
,
408 .get_minrecs
= xfs_allocbt_get_minrecs
,
409 .get_maxrecs
= xfs_allocbt_get_maxrecs
,
410 .init_key_from_rec
= xfs_allocbt_init_key_from_rec
,
411 .init_rec_from_key
= xfs_allocbt_init_rec_from_key
,
412 .init_rec_from_cur
= xfs_allocbt_init_rec_from_cur
,
413 .init_ptr_from_cur
= xfs_allocbt_init_ptr_from_cur
,
414 .key_diff
= xfs_allocbt_key_diff
,
415 .buf_ops
= &xfs_allocbt_buf_ops
,
416 #if defined(DEBUG) || defined(XFS_WARN)
417 .keys_inorder
= xfs_allocbt_keys_inorder
,
418 .recs_inorder
= xfs_allocbt_recs_inorder
,
423 * Allocate a new allocation btree cursor.
425 struct xfs_btree_cur
* /* new alloc btree cursor */
426 xfs_allocbt_init_cursor(
427 struct xfs_mount
*mp
, /* file system mount point */
428 struct xfs_trans
*tp
, /* transaction pointer */
429 struct xfs_buf
*agbp
, /* buffer for agf structure */
430 xfs_agnumber_t agno
, /* allocation group number */
431 xfs_btnum_t btnum
) /* btree identifier */
433 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(agbp
);
434 struct xfs_btree_cur
*cur
;
436 ASSERT(btnum
== XFS_BTNUM_BNO
|| btnum
== XFS_BTNUM_CNT
);
438 cur
= kmem_zone_zalloc(xfs_btree_cur_zone
, KM_SLEEP
);
442 cur
->bc_btnum
= btnum
;
443 cur
->bc_blocklog
= mp
->m_sb
.sb_blocklog
;
444 cur
->bc_ops
= &xfs_allocbt_ops
;
446 if (btnum
== XFS_BTNUM_CNT
) {
447 cur
->bc_nlevels
= be32_to_cpu(agf
->agf_levels
[XFS_BTNUM_CNT
]);
448 cur
->bc_flags
= XFS_BTREE_LASTREC_UPDATE
;
450 cur
->bc_nlevels
= be32_to_cpu(agf
->agf_levels
[XFS_BTNUM_BNO
]);
453 cur
->bc_private
.a
.agbp
= agbp
;
454 cur
->bc_private
.a
.agno
= agno
;
456 if (xfs_sb_version_hascrc(&mp
->m_sb
))
457 cur
->bc_flags
|= XFS_BTREE_CRC_BLOCKS
;
463 * Calculate number of records in an alloc btree block.
467 struct xfs_mount
*mp
,
471 blocklen
-= XFS_ALLOC_BLOCK_LEN(mp
);
474 return blocklen
/ sizeof(xfs_alloc_rec_t
);
475 return blocklen
/ (sizeof(xfs_alloc_key_t
) + sizeof(xfs_alloc_ptr_t
));