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"
28 #include "xfs_dmapi.h"
29 #include "xfs_mount.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_ialloc_btree.h"
33 #include "xfs_dir2_sf.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_dinode.h"
36 #include "xfs_inode.h"
37 #include "xfs_btree.h"
38 #include "xfs_btree_trace.h"
39 #include "xfs_ialloc.h"
40 #include "xfs_alloc.h"
41 #include "xfs_error.h"
44 STATIC struct xfs_btree_cur *
45 xfs_allocbt_dup_cursor(
46 struct xfs_btree_cur *cur)
48 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
49 cur->bc_private.a.agbp, cur->bc_private.a.agno,
55 struct xfs_btree_cur *cur,
56 union xfs_btree_ptr *ptr,
59 struct xfs_buf *agbp = cur->bc_private.a.agbp;
60 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
61 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
62 int btnum = cur->bc_btnum;
66 agf->agf_roots[btnum] = ptr->s;
67 be32_add_cpu(&agf->agf_levels[btnum], inc);
68 cur->bc_mp->m_perag[seqno].pagf_levels[btnum] += inc;
70 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
74 xfs_allocbt_alloc_block(
75 struct xfs_btree_cur *cur,
76 union xfs_btree_ptr *start,
77 union xfs_btree_ptr *new,
84 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
86 /* Allocate the new block from the freelist. If we can't, give up. */
87 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp,
90 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
94 if (bno == NULLAGBLOCK) {
95 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
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);
124 * Since blocks move to the free list without the coordination used in
125 * xfs_bmap_finish, we can't allow block to be available for
126 * reallocation and non-transaction writing (user data) until we know
127 * that the transaction that moved it to the free list is permanently
128 * on disk. We track the blocks by declaring these blocks as "busy";
129 * the busy list is maintained on a per-ag basis and each transaction
130 * records which entries should be removed when the iclog commits to
131 * disk. If a busy block is allocated, the iclog is pushed up to the
132 * LSN that freed the block.
134 xfs_alloc_mark_busy(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1);
135 xfs_trans_agbtree_delta(cur->bc_tp, -1);
140 * Update the longest extent in the AGF
143 xfs_allocbt_update_lastrec(
144 struct xfs_btree_cur *cur,
145 struct xfs_btree_block *block,
146 union xfs_btree_rec *rec,
150 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
151 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
155 ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
160 * If this is the last leaf block and it's the last record,
161 * then update the size of the longest extent in the AG.
163 if (ptr != xfs_btree_get_numrecs(block))
165 len = rec->alloc.ar_blockcount;
168 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
169 be32_to_cpu(agf->agf_longest))
171 len = rec->alloc.ar_blockcount;
174 numrecs = xfs_btree_get_numrecs(block);
177 ASSERT(ptr == numrecs + 1);
180 xfs_alloc_rec_t *rrp;
182 rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
183 len = rrp->ar_blockcount;
194 agf->agf_longest = len;
195 cur->bc_mp->m_perag[seqno].pagf_longest = be32_to_cpu(len);
196 xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
200 xfs_allocbt_get_minrecs(
201 struct xfs_btree_cur *cur,
204 return cur->bc_mp->m_alloc_mnr[level != 0];
208 xfs_allocbt_get_maxrecs(
209 struct xfs_btree_cur *cur,
212 return cur->bc_mp->m_alloc_mxr[level != 0];
216 xfs_allocbt_init_key_from_rec(
217 union xfs_btree_key *key,
218 union xfs_btree_rec *rec)
220 ASSERT(rec->alloc.ar_startblock != 0);
222 key->alloc.ar_startblock = rec->alloc.ar_startblock;
223 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
227 xfs_allocbt_init_rec_from_key(
228 union xfs_btree_key *key,
229 union xfs_btree_rec *rec)
231 ASSERT(key->alloc.ar_startblock != 0);
233 rec->alloc.ar_startblock = key->alloc.ar_startblock;
234 rec->alloc.ar_blockcount = key->alloc.ar_blockcount;
238 xfs_allocbt_init_rec_from_cur(
239 struct xfs_btree_cur *cur,
240 union xfs_btree_rec *rec)
242 ASSERT(cur->bc_rec.a.ar_startblock != 0);
244 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
245 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
249 xfs_allocbt_init_ptr_from_cur(
250 struct xfs_btree_cur *cur,
251 union xfs_btree_ptr *ptr)
253 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
255 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
256 ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
258 ptr->s = agf->agf_roots[cur->bc_btnum];
262 xfs_allocbt_key_diff(
263 struct xfs_btree_cur *cur,
264 union xfs_btree_key *key)
266 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
267 xfs_alloc_key_t *kp = &key->alloc;
270 if (cur->bc_btnum == XFS_BTNUM_BNO) {
271 return (__int64_t)be32_to_cpu(kp->ar_startblock) -
275 diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
279 return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
283 xfs_allocbt_kill_root(
284 struct xfs_btree_cur *cur,
287 union xfs_btree_ptr *newroot)
291 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
292 XFS_BTREE_STATS_INC(cur, killroot);
295 * Update the root pointer, decreasing the level by 1 and then
298 xfs_allocbt_set_root(cur, newroot, -1);
299 error = xfs_allocbt_free_block(cur, bp);
301 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
305 XFS_BTREE_STATS_INC(cur, free);
307 xfs_btree_setbuf(cur, level, NULL);
310 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
316 xfs_allocbt_keys_inorder(
317 struct xfs_btree_cur *cur,
318 union xfs_btree_key *k1,
319 union xfs_btree_key *k2)
321 if (cur->bc_btnum == XFS_BTNUM_BNO) {
322 return be32_to_cpu(k1->alloc.ar_startblock) <
323 be32_to_cpu(k2->alloc.ar_startblock);
325 return be32_to_cpu(k1->alloc.ar_blockcount) <
326 be32_to_cpu(k2->alloc.ar_blockcount) ||
327 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
328 be32_to_cpu(k1->alloc.ar_startblock) <
329 be32_to_cpu(k2->alloc.ar_startblock));
334 xfs_allocbt_recs_inorder(
335 struct xfs_btree_cur *cur,
336 union xfs_btree_rec *r1,
337 union xfs_btree_rec *r2)
339 if (cur->bc_btnum == XFS_BTNUM_BNO) {
340 return be32_to_cpu(r1->alloc.ar_startblock) +
341 be32_to_cpu(r1->alloc.ar_blockcount) <=
342 be32_to_cpu(r2->alloc.ar_startblock);
344 return be32_to_cpu(r1->alloc.ar_blockcount) <
345 be32_to_cpu(r2->alloc.ar_blockcount) ||
346 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
347 be32_to_cpu(r1->alloc.ar_startblock) <
348 be32_to_cpu(r2->alloc.ar_startblock));
353 #ifdef XFS_BTREE_TRACE
354 ktrace_t *xfs_allocbt_trace_buf;
357 xfs_allocbt_trace_enter(
358 struct xfs_btree_cur *cur,
375 ktrace_enter(xfs_allocbt_trace_buf, (void *)(__psint_t)type,
376 (void *)func, (void *)s, NULL, (void *)cur,
377 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
378 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
379 (void *)a8, (void *)a9, (void *)a10);
383 xfs_allocbt_trace_cursor(
384 struct xfs_btree_cur *cur,
389 *s0 = cur->bc_private.a.agno;
390 *l0 = cur->bc_rec.a.ar_startblock;
391 *l1 = cur->bc_rec.a.ar_blockcount;
395 xfs_allocbt_trace_key(
396 struct xfs_btree_cur *cur,
397 union xfs_btree_key *key,
401 *l0 = be32_to_cpu(key->alloc.ar_startblock);
402 *l1 = be32_to_cpu(key->alloc.ar_blockcount);
406 xfs_allocbt_trace_record(
407 struct xfs_btree_cur *cur,
408 union xfs_btree_rec *rec,
413 *l0 = be32_to_cpu(rec->alloc.ar_startblock);
414 *l1 = be32_to_cpu(rec->alloc.ar_blockcount);
417 #endif /* XFS_BTREE_TRACE */
419 static const struct xfs_btree_ops xfs_allocbt_ops = {
420 .rec_len = sizeof(xfs_alloc_rec_t),
421 .key_len = sizeof(xfs_alloc_key_t),
423 .dup_cursor = xfs_allocbt_dup_cursor,
424 .set_root = xfs_allocbt_set_root,
425 .kill_root = xfs_allocbt_kill_root,
426 .alloc_block = xfs_allocbt_alloc_block,
427 .free_block = xfs_allocbt_free_block,
428 .update_lastrec = xfs_allocbt_update_lastrec,
429 .get_minrecs = xfs_allocbt_get_minrecs,
430 .get_maxrecs = xfs_allocbt_get_maxrecs,
431 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
432 .init_rec_from_key = xfs_allocbt_init_rec_from_key,
433 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
434 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
435 .key_diff = xfs_allocbt_key_diff,
438 .keys_inorder = xfs_allocbt_keys_inorder,
439 .recs_inorder = xfs_allocbt_recs_inorder,
442 #ifdef XFS_BTREE_TRACE
443 .trace_enter = xfs_allocbt_trace_enter,
444 .trace_cursor = xfs_allocbt_trace_cursor,
445 .trace_key = xfs_allocbt_trace_key,
446 .trace_record = xfs_allocbt_trace_record,
451 * Allocate a new allocation btree cursor.
453 struct xfs_btree_cur * /* new alloc btree cursor */
454 xfs_allocbt_init_cursor(
455 struct xfs_mount *mp, /* file system mount point */
456 struct xfs_trans *tp, /* transaction pointer */
457 struct xfs_buf *agbp, /* buffer for agf structure */
458 xfs_agnumber_t agno, /* allocation group number */
459 xfs_btnum_t btnum) /* btree identifier */
461 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
462 struct xfs_btree_cur *cur;
464 ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
466 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
470 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[btnum]);
471 cur->bc_btnum = btnum;
472 cur->bc_blocklog = mp->m_sb.sb_blocklog;
474 cur->bc_ops = &xfs_allocbt_ops;
475 if (btnum == XFS_BTNUM_CNT)
476 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
478 cur->bc_private.a.agbp = agbp;
479 cur->bc_private.a.agno = agno;
485 * Calculate number of records in an alloc btree block.
489 struct xfs_mount *mp,
493 blocklen -= sizeof(struct xfs_btree_sblock);
496 return blocklen / sizeof(xfs_alloc_rec_t);
497 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));