2 * Copyright (C) 2016 Oracle. All Rights Reserved.
4 * Author: Darrick J. Wong <darrick.wong@oracle.com>
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version 2
9 * of the License, or (at your option) any later version.
11 * This program is distributed in the hope that it would be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
20 #include "libxfs_priv.h"
22 #include "xfs_shared.h"
23 #include "xfs_format.h"
24 #include "xfs_log_format.h"
25 #include "xfs_trans_resv.h"
27 #include "xfs_mount.h"
28 #include "xfs_btree.h"
30 #include "xfs_refcount_btree.h"
31 #include "xfs_alloc.h"
32 #include "xfs_trace.h"
33 #include "xfs_cksum.h"
34 #include "xfs_trans.h"
38 static struct xfs_btree_cur
*
39 xfs_refcountbt_dup_cursor(
40 struct xfs_btree_cur
*cur
)
42 return xfs_refcountbt_init_cursor(cur
->bc_mp
, cur
->bc_tp
,
43 cur
->bc_private
.a
.agbp
, cur
->bc_private
.a
.agno
,
44 cur
->bc_private
.a
.dfops
);
48 xfs_refcountbt_set_root(
49 struct xfs_btree_cur
*cur
,
50 union xfs_btree_ptr
*ptr
,
53 struct xfs_buf
*agbp
= cur
->bc_private
.a
.agbp
;
54 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(agbp
);
55 xfs_agnumber_t seqno
= be32_to_cpu(agf
->agf_seqno
);
56 struct xfs_perag
*pag
= xfs_perag_get(cur
->bc_mp
, seqno
);
60 agf
->agf_refcount_root
= ptr
->s
;
61 be32_add_cpu(&agf
->agf_refcount_level
, inc
);
62 pag
->pagf_refcount_level
+= inc
;
65 xfs_alloc_log_agf(cur
->bc_tp
, agbp
,
66 XFS_AGF_REFCOUNT_ROOT
| XFS_AGF_REFCOUNT_LEVEL
);
70 xfs_refcountbt_alloc_block(
71 struct xfs_btree_cur
*cur
,
72 union xfs_btree_ptr
*start
,
73 union xfs_btree_ptr
*new,
76 struct xfs_buf
*agbp
= cur
->bc_private
.a
.agbp
;
77 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(agbp
);
78 struct xfs_alloc_arg args
; /* block allocation args */
79 int error
; /* error return value */
81 XFS_BTREE_TRACE_CURSOR(cur
, XBT_ENTRY
);
83 memset(&args
, 0, sizeof(args
));
86 args
.type
= XFS_ALLOCTYPE_NEAR_BNO
;
87 args
.fsbno
= XFS_AGB_TO_FSB(cur
->bc_mp
, cur
->bc_private
.a
.agno
,
88 xfs_refc_block(args
.mp
));
89 args
.firstblock
= args
.fsbno
;
90 xfs_rmap_ag_owner(&args
.oinfo
, XFS_RMAP_OWN_REFC
);
91 args
.minlen
= args
.maxlen
= args
.prod
= 1;
92 args
.resv
= XFS_AG_RESV_METADATA
;
94 error
= xfs_alloc_vextent(&args
);
97 trace_xfs_refcountbt_alloc_block(cur
->bc_mp
, cur
->bc_private
.a
.agno
,
99 if (args
.fsbno
== NULLFSBLOCK
) {
100 XFS_BTREE_TRACE_CURSOR(cur
, XBT_EXIT
);
104 ASSERT(args
.agno
== cur
->bc_private
.a
.agno
);
105 ASSERT(args
.len
== 1);
107 new->s
= cpu_to_be32(args
.agbno
);
108 be32_add_cpu(&agf
->agf_refcount_blocks
, 1);
109 xfs_alloc_log_agf(cur
->bc_tp
, agbp
, XFS_AGF_REFCOUNT_BLOCKS
);
111 XFS_BTREE_TRACE_CURSOR(cur
, XBT_EXIT
);
116 XFS_BTREE_TRACE_CURSOR(cur
, XBT_ERROR
);
121 xfs_refcountbt_free_block(
122 struct xfs_btree_cur
*cur
,
125 struct xfs_mount
*mp
= cur
->bc_mp
;
126 struct xfs_buf
*agbp
= cur
->bc_private
.a
.agbp
;
127 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(agbp
);
128 xfs_fsblock_t fsbno
= XFS_DADDR_TO_FSB(mp
, XFS_BUF_ADDR(bp
));
129 struct xfs_owner_info oinfo
;
132 trace_xfs_refcountbt_free_block(cur
->bc_mp
, cur
->bc_private
.a
.agno
,
133 XFS_FSB_TO_AGBNO(cur
->bc_mp
, fsbno
), 1);
134 xfs_rmap_ag_owner(&oinfo
, XFS_RMAP_OWN_REFC
);
135 be32_add_cpu(&agf
->agf_refcount_blocks
, -1);
136 xfs_alloc_log_agf(cur
->bc_tp
, agbp
, XFS_AGF_REFCOUNT_BLOCKS
);
137 error
= xfs_free_extent(cur
->bc_tp
, fsbno
, 1, &oinfo
,
138 XFS_AG_RESV_METADATA
);
146 xfs_refcountbt_get_minrecs(
147 struct xfs_btree_cur
*cur
,
150 return cur
->bc_mp
->m_refc_mnr
[level
!= 0];
154 xfs_refcountbt_get_maxrecs(
155 struct xfs_btree_cur
*cur
,
158 return cur
->bc_mp
->m_refc_mxr
[level
!= 0];
162 xfs_refcountbt_init_key_from_rec(
163 union xfs_btree_key
*key
,
164 union xfs_btree_rec
*rec
)
166 key
->refc
.rc_startblock
= rec
->refc
.rc_startblock
;
170 xfs_refcountbt_init_high_key_from_rec(
171 union xfs_btree_key
*key
,
172 union xfs_btree_rec
*rec
)
176 x
= be32_to_cpu(rec
->refc
.rc_startblock
);
177 x
+= be32_to_cpu(rec
->refc
.rc_blockcount
) - 1;
178 key
->refc
.rc_startblock
= cpu_to_be32(x
);
182 xfs_refcountbt_init_rec_from_cur(
183 struct xfs_btree_cur
*cur
,
184 union xfs_btree_rec
*rec
)
186 rec
->refc
.rc_startblock
= cpu_to_be32(cur
->bc_rec
.rc
.rc_startblock
);
187 rec
->refc
.rc_blockcount
= cpu_to_be32(cur
->bc_rec
.rc
.rc_blockcount
);
188 rec
->refc
.rc_refcount
= cpu_to_be32(cur
->bc_rec
.rc
.rc_refcount
);
192 xfs_refcountbt_init_ptr_from_cur(
193 struct xfs_btree_cur
*cur
,
194 union xfs_btree_ptr
*ptr
)
196 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(cur
->bc_private
.a
.agbp
);
198 ASSERT(cur
->bc_private
.a
.agno
== be32_to_cpu(agf
->agf_seqno
));
199 ASSERT(agf
->agf_refcount_root
!= 0);
201 ptr
->s
= agf
->agf_refcount_root
;
205 xfs_refcountbt_key_diff(
206 struct xfs_btree_cur
*cur
,
207 union xfs_btree_key
*key
)
209 struct xfs_refcount_irec
*rec
= &cur
->bc_rec
.rc
;
210 struct xfs_refcount_key
*kp
= &key
->refc
;
212 return (int64_t)be32_to_cpu(kp
->rc_startblock
) - rec
->rc_startblock
;
216 xfs_refcountbt_diff_two_keys(
217 struct xfs_btree_cur
*cur
,
218 union xfs_btree_key
*k1
,
219 union xfs_btree_key
*k2
)
221 return (int64_t)be32_to_cpu(k1
->refc
.rc_startblock
) -
222 be32_to_cpu(k2
->refc
.rc_startblock
);
225 STATIC xfs_failaddr_t
226 xfs_refcountbt_verify(
229 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
230 struct xfs_btree_block
*block
= XFS_BUF_TO_BLOCK(bp
);
231 struct xfs_perag
*pag
= bp
->b_pag
;
235 if (block
->bb_magic
!= cpu_to_be32(XFS_REFC_CRC_MAGIC
))
236 return __this_address
;
238 if (!xfs_sb_version_hasreflink(&mp
->m_sb
))
239 return __this_address
;
240 fa
= xfs_btree_sblock_v5hdr_verify(bp
);
244 level
= be16_to_cpu(block
->bb_level
);
245 if (pag
&& pag
->pagf_init
) {
246 if (level
>= pag
->pagf_refcount_level
)
247 return __this_address
;
248 } else if (level
>= mp
->m_refc_maxlevels
)
249 return __this_address
;
251 return xfs_btree_sblock_verify(bp
, mp
->m_refc_mxr
[level
!= 0]);
255 xfs_refcountbt_read_verify(
260 if (!xfs_btree_sblock_verify_crc(bp
))
261 xfs_verifier_error(bp
, -EFSBADCRC
, __this_address
);
263 fa
= xfs_refcountbt_verify(bp
);
265 xfs_verifier_error(bp
, -EFSCORRUPTED
, fa
);
269 trace_xfs_btree_corrupt(bp
, _RET_IP_
);
273 xfs_refcountbt_write_verify(
278 fa
= xfs_refcountbt_verify(bp
);
280 trace_xfs_btree_corrupt(bp
, _RET_IP_
);
281 xfs_verifier_error(bp
, -EFSCORRUPTED
, fa
);
284 xfs_btree_sblock_calc_crc(bp
);
288 const struct xfs_buf_ops xfs_refcountbt_buf_ops
= {
289 .name
= "xfs_refcountbt",
290 .verify_read
= xfs_refcountbt_read_verify
,
291 .verify_write
= xfs_refcountbt_write_verify
,
292 .verify_struct
= xfs_refcountbt_verify
,
296 xfs_refcountbt_keys_inorder(
297 struct xfs_btree_cur
*cur
,
298 union xfs_btree_key
*k1
,
299 union xfs_btree_key
*k2
)
301 return be32_to_cpu(k1
->refc
.rc_startblock
) <
302 be32_to_cpu(k2
->refc
.rc_startblock
);
306 xfs_refcountbt_recs_inorder(
307 struct xfs_btree_cur
*cur
,
308 union xfs_btree_rec
*r1
,
309 union xfs_btree_rec
*r2
)
311 return be32_to_cpu(r1
->refc
.rc_startblock
) +
312 be32_to_cpu(r1
->refc
.rc_blockcount
) <=
313 be32_to_cpu(r2
->refc
.rc_startblock
);
316 static const struct xfs_btree_ops xfs_refcountbt_ops
= {
317 .rec_len
= sizeof(struct xfs_refcount_rec
),
318 .key_len
= sizeof(struct xfs_refcount_key
),
320 .dup_cursor
= xfs_refcountbt_dup_cursor
,
321 .set_root
= xfs_refcountbt_set_root
,
322 .alloc_block
= xfs_refcountbt_alloc_block
,
323 .free_block
= xfs_refcountbt_free_block
,
324 .get_minrecs
= xfs_refcountbt_get_minrecs
,
325 .get_maxrecs
= xfs_refcountbt_get_maxrecs
,
326 .init_key_from_rec
= xfs_refcountbt_init_key_from_rec
,
327 .init_high_key_from_rec
= xfs_refcountbt_init_high_key_from_rec
,
328 .init_rec_from_cur
= xfs_refcountbt_init_rec_from_cur
,
329 .init_ptr_from_cur
= xfs_refcountbt_init_ptr_from_cur
,
330 .key_diff
= xfs_refcountbt_key_diff
,
331 .buf_ops
= &xfs_refcountbt_buf_ops
,
332 .diff_two_keys
= xfs_refcountbt_diff_two_keys
,
333 .keys_inorder
= xfs_refcountbt_keys_inorder
,
334 .recs_inorder
= xfs_refcountbt_recs_inorder
,
338 * Allocate a new refcount btree cursor.
340 struct xfs_btree_cur
*
341 xfs_refcountbt_init_cursor(
342 struct xfs_mount
*mp
,
343 struct xfs_trans
*tp
,
344 struct xfs_buf
*agbp
,
346 struct xfs_defer_ops
*dfops
)
348 struct xfs_agf
*agf
= XFS_BUF_TO_AGF(agbp
);
349 struct xfs_btree_cur
*cur
;
351 ASSERT(agno
!= NULLAGNUMBER
);
352 ASSERT(agno
< mp
->m_sb
.sb_agcount
);
353 cur
= kmem_zone_zalloc(xfs_btree_cur_zone
, KM_NOFS
);
357 cur
->bc_btnum
= XFS_BTNUM_REFC
;
358 cur
->bc_blocklog
= mp
->m_sb
.sb_blocklog
;
359 cur
->bc_ops
= &xfs_refcountbt_ops
;
360 cur
->bc_statoff
= XFS_STATS_CALC_INDEX(xs_refcbt_2
);
362 cur
->bc_nlevels
= be32_to_cpu(agf
->agf_refcount_level
);
364 cur
->bc_private
.a
.agbp
= agbp
;
365 cur
->bc_private
.a
.agno
= agno
;
366 cur
->bc_private
.a
.dfops
= dfops
;
367 cur
->bc_flags
|= XFS_BTREE_CRC_BLOCKS
;
369 cur
->bc_private
.a
.priv
.refc
.nr_ops
= 0;
370 cur
->bc_private
.a
.priv
.refc
.shape_changes
= 0;
376 * Calculate the number of records in a refcount btree block.
379 xfs_refcountbt_maxrecs(
380 struct xfs_mount
*mp
,
384 blocklen
-= XFS_REFCOUNT_BLOCK_LEN
;
387 return blocklen
/ sizeof(struct xfs_refcount_rec
);
388 return blocklen
/ (sizeof(struct xfs_refcount_key
) +
389 sizeof(xfs_refcount_ptr_t
));
392 /* Compute the maximum height of a refcount btree. */
394 xfs_refcountbt_compute_maxlevels(
395 struct xfs_mount
*mp
)
397 mp
->m_refc_maxlevels
= xfs_btree_compute_maxlevels(mp
,
398 mp
->m_refc_mnr
, mp
->m_sb
.sb_agblocks
);
401 /* Calculate the refcount btree size for some records. */
403 xfs_refcountbt_calc_size(
404 struct xfs_mount
*mp
,
405 unsigned long long len
)
407 return xfs_btree_calc_size(mp
, mp
->m_refc_mnr
, len
);
411 * Calculate the maximum refcount btree size.
414 xfs_refcountbt_max_size(
415 struct xfs_mount
*mp
,
416 xfs_agblock_t agblocks
)
418 /* Bail out if we're uninitialized, which can happen in mkfs. */
419 if (mp
->m_refc_mxr
[0] == 0)
422 return xfs_refcountbt_calc_size(mp
, agblocks
);
426 * Figure out how many blocks to reserve and how many are used by this btree.
429 xfs_refcountbt_calc_reserves(
430 struct xfs_mount
*mp
,
435 struct xfs_buf
*agbp
;
437 xfs_agblock_t agblocks
;
438 xfs_extlen_t tree_len
;
441 if (!xfs_sb_version_hasreflink(&mp
->m_sb
))
445 error
= xfs_alloc_read_agf(mp
, NULL
, agno
, 0, &agbp
);
449 agf
= XFS_BUF_TO_AGF(agbp
);
450 agblocks
= be32_to_cpu(agf
->agf_length
);
451 tree_len
= be32_to_cpu(agf
->agf_refcount_blocks
);
454 *ask
+= xfs_refcountbt_max_size(mp
, agblocks
);