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
20 #include "xfs_types.h"
24 #include "xfs_trans.h"
27 #include "xfs_mount.h"
28 #include "xfs_bmap_btree.h"
29 #include "xfs_alloc_btree.h"
30 #include "xfs_ialloc_btree.h"
31 #include "xfs_dinode.h"
32 #include "xfs_inode.h"
33 #include "xfs_btree.h"
34 #include "xfs_btree_trace.h"
35 #include "xfs_alloc.h"
36 #include "xfs_error.h"
37 #include "xfs_trace.h"
40 STATIC struct xfs_btree_cur *
41 xfs_allocbt_dup_cursor(
42 struct xfs_btree_cur *cur)
44 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
45 cur->bc_private.a.agbp, cur->bc_private.a.agno,
51 struct xfs_btree_cur *cur,
52 union xfs_btree_ptr *ptr,
55 struct xfs_buf *agbp = cur->bc_private.a.agbp;
56 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
57 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
58 int btnum = cur->bc_btnum;
59 struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno);
63 agf->agf_roots[btnum] = ptr->s;
64 be32_add_cpu(&agf->agf_levels[btnum], inc);
65 pag->pagf_levels[btnum] += inc;
68 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
72 xfs_allocbt_alloc_block(
73 struct xfs_btree_cur *cur,
74 union xfs_btree_ptr *start,
75 union xfs_btree_ptr *new,
82 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
84 /* Allocate the new block from the freelist. If we can't, give up. */
85 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp,
88 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
92 if (bno == NULLAGBLOCK) {
93 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
98 xfs_alloc_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false);
100 xfs_trans_agbtree_delta(cur->bc_tp, 1);
101 new->s = cpu_to_be32(bno);
103 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
109 xfs_allocbt_free_block(
110 struct xfs_btree_cur *cur,
113 struct xfs_buf *agbp = cur->bc_private.a.agbp;
114 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
118 bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
119 error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
123 xfs_alloc_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1);
124 xfs_trans_agbtree_delta(cur->bc_tp, -1);
129 * Update the longest extent in the AGF
132 xfs_allocbt_update_lastrec(
133 struct xfs_btree_cur *cur,
134 struct xfs_btree_block *block,
135 union xfs_btree_rec *rec,
139 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
140 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
141 struct xfs_perag *pag;
145 ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
150 * If this is the last leaf block and it's the last record,
151 * then update the size of the longest extent in the AG.
153 if (ptr != xfs_btree_get_numrecs(block))
155 len = rec->alloc.ar_blockcount;
158 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
159 be32_to_cpu(agf->agf_longest))
161 len = rec->alloc.ar_blockcount;
164 numrecs = xfs_btree_get_numrecs(block);
167 ASSERT(ptr == numrecs + 1);
170 xfs_alloc_rec_t *rrp;
172 rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
173 len = rrp->ar_blockcount;
184 agf->agf_longest = len;
185 pag = xfs_perag_get(cur->bc_mp, seqno);
186 pag->pagf_longest = be32_to_cpu(len);
188 xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
192 xfs_allocbt_get_minrecs(
193 struct xfs_btree_cur *cur,
196 return cur->bc_mp->m_alloc_mnr[level != 0];
200 xfs_allocbt_get_maxrecs(
201 struct xfs_btree_cur *cur,
204 return cur->bc_mp->m_alloc_mxr[level != 0];
208 xfs_allocbt_init_key_from_rec(
209 union xfs_btree_key *key,
210 union xfs_btree_rec *rec)
212 ASSERT(rec->alloc.ar_startblock != 0);
214 key->alloc.ar_startblock = rec->alloc.ar_startblock;
215 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
219 xfs_allocbt_init_rec_from_key(
220 union xfs_btree_key *key,
221 union xfs_btree_rec *rec)
223 ASSERT(key->alloc.ar_startblock != 0);
225 rec->alloc.ar_startblock = key->alloc.ar_startblock;
226 rec->alloc.ar_blockcount = key->alloc.ar_blockcount;
230 xfs_allocbt_init_rec_from_cur(
231 struct xfs_btree_cur *cur,
232 union xfs_btree_rec *rec)
234 ASSERT(cur->bc_rec.a.ar_startblock != 0);
236 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
237 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
241 xfs_allocbt_init_ptr_from_cur(
242 struct xfs_btree_cur *cur,
243 union xfs_btree_ptr *ptr)
245 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
247 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
248 ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
250 ptr->s = agf->agf_roots[cur->bc_btnum];
254 xfs_allocbt_key_diff(
255 struct xfs_btree_cur *cur,
256 union xfs_btree_key *key)
258 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
259 xfs_alloc_key_t *kp = &key->alloc;
262 if (cur->bc_btnum == XFS_BTNUM_BNO) {
263 return (__int64_t)be32_to_cpu(kp->ar_startblock) -
267 diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
271 return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
276 xfs_allocbt_keys_inorder(
277 struct xfs_btree_cur *cur,
278 union xfs_btree_key *k1,
279 union xfs_btree_key *k2)
281 if (cur->bc_btnum == XFS_BTNUM_BNO) {
282 return be32_to_cpu(k1->alloc.ar_startblock) <
283 be32_to_cpu(k2->alloc.ar_startblock);
285 return be32_to_cpu(k1->alloc.ar_blockcount) <
286 be32_to_cpu(k2->alloc.ar_blockcount) ||
287 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
288 be32_to_cpu(k1->alloc.ar_startblock) <
289 be32_to_cpu(k2->alloc.ar_startblock));
294 xfs_allocbt_recs_inorder(
295 struct xfs_btree_cur *cur,
296 union xfs_btree_rec *r1,
297 union xfs_btree_rec *r2)
299 if (cur->bc_btnum == XFS_BTNUM_BNO) {
300 return be32_to_cpu(r1->alloc.ar_startblock) +
301 be32_to_cpu(r1->alloc.ar_blockcount) <=
302 be32_to_cpu(r2->alloc.ar_startblock);
304 return be32_to_cpu(r1->alloc.ar_blockcount) <
305 be32_to_cpu(r2->alloc.ar_blockcount) ||
306 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
307 be32_to_cpu(r1->alloc.ar_startblock) <
308 be32_to_cpu(r2->alloc.ar_startblock));
313 #ifdef XFS_BTREE_TRACE
314 ktrace_t *xfs_allocbt_trace_buf;
317 xfs_allocbt_trace_enter(
318 struct xfs_btree_cur *cur,
335 ktrace_enter(xfs_allocbt_trace_buf, (void *)(__psint_t)type,
336 (void *)func, (void *)s, NULL, (void *)cur,
337 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
338 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
339 (void *)a8, (void *)a9, (void *)a10);
343 xfs_allocbt_trace_cursor(
344 struct xfs_btree_cur *cur,
349 *s0 = cur->bc_private.a.agno;
350 *l0 = cur->bc_rec.a.ar_startblock;
351 *l1 = cur->bc_rec.a.ar_blockcount;
355 xfs_allocbt_trace_key(
356 struct xfs_btree_cur *cur,
357 union xfs_btree_key *key,
361 *l0 = be32_to_cpu(key->alloc.ar_startblock);
362 *l1 = be32_to_cpu(key->alloc.ar_blockcount);
366 xfs_allocbt_trace_record(
367 struct xfs_btree_cur *cur,
368 union xfs_btree_rec *rec,
373 *l0 = be32_to_cpu(rec->alloc.ar_startblock);
374 *l1 = be32_to_cpu(rec->alloc.ar_blockcount);
377 #endif /* XFS_BTREE_TRACE */
379 static const struct xfs_btree_ops xfs_allocbt_ops = {
380 .rec_len = sizeof(xfs_alloc_rec_t),
381 .key_len = sizeof(xfs_alloc_key_t),
383 .dup_cursor = xfs_allocbt_dup_cursor,
384 .set_root = xfs_allocbt_set_root,
385 .alloc_block = xfs_allocbt_alloc_block,
386 .free_block = xfs_allocbt_free_block,
387 .update_lastrec = xfs_allocbt_update_lastrec,
388 .get_minrecs = xfs_allocbt_get_minrecs,
389 .get_maxrecs = xfs_allocbt_get_maxrecs,
390 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
391 .init_rec_from_key = xfs_allocbt_init_rec_from_key,
392 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
393 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
394 .key_diff = xfs_allocbt_key_diff,
397 .keys_inorder = xfs_allocbt_keys_inorder,
398 .recs_inorder = xfs_allocbt_recs_inorder,
401 #ifdef XFS_BTREE_TRACE
402 .trace_enter = xfs_allocbt_trace_enter,
403 .trace_cursor = xfs_allocbt_trace_cursor,
404 .trace_key = xfs_allocbt_trace_key,
405 .trace_record = xfs_allocbt_trace_record,
410 * Allocate a new allocation btree cursor.
412 struct xfs_btree_cur * /* new alloc btree cursor */
413 xfs_allocbt_init_cursor(
414 struct xfs_mount *mp, /* file system mount point */
415 struct xfs_trans *tp, /* transaction pointer */
416 struct xfs_buf *agbp, /* buffer for agf structure */
417 xfs_agnumber_t agno, /* allocation group number */
418 xfs_btnum_t btnum) /* btree identifier */
420 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
421 struct xfs_btree_cur *cur;
423 ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
425 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
429 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[btnum]);
430 cur->bc_btnum = btnum;
431 cur->bc_blocklog = mp->m_sb.sb_blocklog;
433 cur->bc_ops = &xfs_allocbt_ops;
434 if (btnum == XFS_BTNUM_CNT)
435 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
437 cur->bc_private.a.agbp = agbp;
438 cur->bc_private.a.agno = agno;
444 * Calculate number of records in an alloc btree block.
448 struct xfs_mount *mp,
452 blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
455 return blocklen / sizeof(xfs_alloc_rec_t);
456 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));