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_trans_agbtree_delta(cur->bc_tp, 1);
99 new->s = cpu_to_be32(bno);
101 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
107 xfs_allocbt_free_block(
108 struct xfs_btree_cur *cur,
111 struct xfs_buf *agbp = cur->bc_private.a.agbp;
112 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
116 bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
117 error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
122 * Since blocks move to the free list without the coordination used in
123 * xfs_bmap_finish, we can't allow block to be available for
124 * reallocation and non-transaction writing (user data) until we know
125 * that the transaction that moved it to the free list is permanently
126 * on disk. We track the blocks by declaring these blocks as "busy";
127 * the busy list is maintained on a per-ag basis and each transaction
128 * records which entries should be removed when the iclog commits to
129 * disk. If a busy block is allocated, the iclog is pushed up to the
130 * LSN that freed the block.
132 xfs_alloc_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1);
133 xfs_trans_agbtree_delta(cur->bc_tp, -1);
138 * Update the longest extent in the AGF
141 xfs_allocbt_update_lastrec(
142 struct xfs_btree_cur *cur,
143 struct xfs_btree_block *block,
144 union xfs_btree_rec *rec,
148 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
149 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
150 struct xfs_perag *pag;
154 ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
159 * If this is the last leaf block and it's the last record,
160 * then update the size of the longest extent in the AG.
162 if (ptr != xfs_btree_get_numrecs(block))
164 len = rec->alloc.ar_blockcount;
167 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
168 be32_to_cpu(agf->agf_longest))
170 len = rec->alloc.ar_blockcount;
173 numrecs = xfs_btree_get_numrecs(block);
176 ASSERT(ptr == numrecs + 1);
179 xfs_alloc_rec_t *rrp;
181 rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
182 len = rrp->ar_blockcount;
193 agf->agf_longest = len;
194 pag = xfs_perag_get(cur->bc_mp, seqno);
195 pag->pagf_longest = be32_to_cpu(len);
197 xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
201 xfs_allocbt_get_minrecs(
202 struct xfs_btree_cur *cur,
205 return cur->bc_mp->m_alloc_mnr[level != 0];
209 xfs_allocbt_get_maxrecs(
210 struct xfs_btree_cur *cur,
213 return cur->bc_mp->m_alloc_mxr[level != 0];
217 xfs_allocbt_init_key_from_rec(
218 union xfs_btree_key *key,
219 union xfs_btree_rec *rec)
221 ASSERT(rec->alloc.ar_startblock != 0);
223 key->alloc.ar_startblock = rec->alloc.ar_startblock;
224 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
228 xfs_allocbt_init_rec_from_key(
229 union xfs_btree_key *key,
230 union xfs_btree_rec *rec)
232 ASSERT(key->alloc.ar_startblock != 0);
234 rec->alloc.ar_startblock = key->alloc.ar_startblock;
235 rec->alloc.ar_blockcount = key->alloc.ar_blockcount;
239 xfs_allocbt_init_rec_from_cur(
240 struct xfs_btree_cur *cur,
241 union xfs_btree_rec *rec)
243 ASSERT(cur->bc_rec.a.ar_startblock != 0);
245 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
246 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
250 xfs_allocbt_init_ptr_from_cur(
251 struct xfs_btree_cur *cur,
252 union xfs_btree_ptr *ptr)
254 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
256 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
257 ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
259 ptr->s = agf->agf_roots[cur->bc_btnum];
263 xfs_allocbt_key_diff(
264 struct xfs_btree_cur *cur,
265 union xfs_btree_key *key)
267 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
268 xfs_alloc_key_t *kp = &key->alloc;
271 if (cur->bc_btnum == XFS_BTNUM_BNO) {
272 return (__int64_t)be32_to_cpu(kp->ar_startblock) -
276 diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
280 return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
284 xfs_allocbt_kill_root(
285 struct xfs_btree_cur *cur,
288 union xfs_btree_ptr *newroot)
292 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
293 XFS_BTREE_STATS_INC(cur, killroot);
296 * Update the root pointer, decreasing the level by 1 and then
299 xfs_allocbt_set_root(cur, newroot, -1);
300 error = xfs_allocbt_free_block(cur, bp);
302 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
306 XFS_BTREE_STATS_INC(cur, free);
308 xfs_btree_setbuf(cur, level, NULL);
311 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
317 xfs_allocbt_keys_inorder(
318 struct xfs_btree_cur *cur,
319 union xfs_btree_key *k1,
320 union xfs_btree_key *k2)
322 if (cur->bc_btnum == XFS_BTNUM_BNO) {
323 return be32_to_cpu(k1->alloc.ar_startblock) <
324 be32_to_cpu(k2->alloc.ar_startblock);
326 return be32_to_cpu(k1->alloc.ar_blockcount) <
327 be32_to_cpu(k2->alloc.ar_blockcount) ||
328 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
329 be32_to_cpu(k1->alloc.ar_startblock) <
330 be32_to_cpu(k2->alloc.ar_startblock));
335 xfs_allocbt_recs_inorder(
336 struct xfs_btree_cur *cur,
337 union xfs_btree_rec *r1,
338 union xfs_btree_rec *r2)
340 if (cur->bc_btnum == XFS_BTNUM_BNO) {
341 return be32_to_cpu(r1->alloc.ar_startblock) +
342 be32_to_cpu(r1->alloc.ar_blockcount) <=
343 be32_to_cpu(r2->alloc.ar_startblock);
345 return be32_to_cpu(r1->alloc.ar_blockcount) <
346 be32_to_cpu(r2->alloc.ar_blockcount) ||
347 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
348 be32_to_cpu(r1->alloc.ar_startblock) <
349 be32_to_cpu(r2->alloc.ar_startblock));
354 #ifdef XFS_BTREE_TRACE
355 ktrace_t *xfs_allocbt_trace_buf;
358 xfs_allocbt_trace_enter(
359 struct xfs_btree_cur *cur,
376 ktrace_enter(xfs_allocbt_trace_buf, (void *)(__psint_t)type,
377 (void *)func, (void *)s, NULL, (void *)cur,
378 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
379 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
380 (void *)a8, (void *)a9, (void *)a10);
384 xfs_allocbt_trace_cursor(
385 struct xfs_btree_cur *cur,
390 *s0 = cur->bc_private.a.agno;
391 *l0 = cur->bc_rec.a.ar_startblock;
392 *l1 = cur->bc_rec.a.ar_blockcount;
396 xfs_allocbt_trace_key(
397 struct xfs_btree_cur *cur,
398 union xfs_btree_key *key,
402 *l0 = be32_to_cpu(key->alloc.ar_startblock);
403 *l1 = be32_to_cpu(key->alloc.ar_blockcount);
407 xfs_allocbt_trace_record(
408 struct xfs_btree_cur *cur,
409 union xfs_btree_rec *rec,
414 *l0 = be32_to_cpu(rec->alloc.ar_startblock);
415 *l1 = be32_to_cpu(rec->alloc.ar_blockcount);
418 #endif /* XFS_BTREE_TRACE */
420 static const struct xfs_btree_ops xfs_allocbt_ops = {
421 .rec_len = sizeof(xfs_alloc_rec_t),
422 .key_len = sizeof(xfs_alloc_key_t),
424 .dup_cursor = xfs_allocbt_dup_cursor,
425 .set_root = xfs_allocbt_set_root,
426 .kill_root = xfs_allocbt_kill_root,
427 .alloc_block = xfs_allocbt_alloc_block,
428 .free_block = xfs_allocbt_free_block,
429 .update_lastrec = xfs_allocbt_update_lastrec,
430 .get_minrecs = xfs_allocbt_get_minrecs,
431 .get_maxrecs = xfs_allocbt_get_maxrecs,
432 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
433 .init_rec_from_key = xfs_allocbt_init_rec_from_key,
434 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
435 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
436 .key_diff = xfs_allocbt_key_diff,
439 .keys_inorder = xfs_allocbt_keys_inorder,
440 .recs_inorder = xfs_allocbt_recs_inorder,
443 #ifdef XFS_BTREE_TRACE
444 .trace_enter = xfs_allocbt_trace_enter,
445 .trace_cursor = xfs_allocbt_trace_cursor,
446 .trace_key = xfs_allocbt_trace_key,
447 .trace_record = xfs_allocbt_trace_record,
452 * Allocate a new allocation btree cursor.
454 struct xfs_btree_cur * /* new alloc btree cursor */
455 xfs_allocbt_init_cursor(
456 struct xfs_mount *mp, /* file system mount point */
457 struct xfs_trans *tp, /* transaction pointer */
458 struct xfs_buf *agbp, /* buffer for agf structure */
459 xfs_agnumber_t agno, /* allocation group number */
460 xfs_btnum_t btnum) /* btree identifier */
462 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
463 struct xfs_btree_cur *cur;
465 ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
467 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
471 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[btnum]);
472 cur->bc_btnum = btnum;
473 cur->bc_blocklog = mp->m_sb.sb_blocklog;
475 cur->bc_ops = &xfs_allocbt_ops;
476 if (btnum == XFS_BTNUM_CNT)
477 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
479 cur->bc_private.a.agbp = agbp;
480 cur->bc_private.a.agno = agno;
486 * Calculate number of records in an alloc btree block.
490 struct xfs_mount *mp,
494 blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
497 return blocklen / sizeof(xfs_alloc_rec_t);
498 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));