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_ialloc.h"
36 #include "xfs_alloc.h"
37 #include "xfs_error.h"
41 xfs_inobt_get_minrecs(
42 struct xfs_btree_cur *cur,
45 return cur->bc_mp->m_inobt_mnr[level != 0];
48 STATIC struct xfs_btree_cur *
50 struct xfs_btree_cur *cur)
52 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
53 cur->bc_private.a.agbp, cur->bc_private.a.agno);
58 struct xfs_btree_cur *cur,
59 union xfs_btree_ptr *nptr,
60 int inc) /* level change */
62 struct xfs_buf *agbp = cur->bc_private.a.agbp;
63 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
65 agi->agi_root = nptr->s;
66 be32_add_cpu(&agi->agi_level, inc);
67 xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
71 xfs_inobt_alloc_block(
72 struct xfs_btree_cur *cur,
73 union xfs_btree_ptr *start,
74 union xfs_btree_ptr *new,
78 xfs_alloc_arg_t args; /* block allocation args */
79 int error; /* error return value */
80 xfs_agblock_t sbno = be32_to_cpu(start->s);
82 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
84 memset(&args, 0, sizeof(args));
87 args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
91 args.type = XFS_ALLOCTYPE_NEAR_BNO;
93 error = xfs_alloc_vextent(&args);
95 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
98 if (args.fsbno == NULLFSBLOCK) {
99 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
103 ASSERT(args.len == 1);
104 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
106 new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
112 xfs_inobt_free_block(
113 struct xfs_btree_cur *cur,
119 fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
120 error = xfs_free_extent(cur->bc_tp, fsbno, 1);
124 xfs_trans_binval(cur->bc_tp, bp);
129 xfs_inobt_get_maxrecs(
130 struct xfs_btree_cur *cur,
133 return cur->bc_mp->m_inobt_mxr[level != 0];
137 xfs_inobt_init_key_from_rec(
138 union xfs_btree_key *key,
139 union xfs_btree_rec *rec)
141 key->inobt.ir_startino = rec->inobt.ir_startino;
145 xfs_inobt_init_rec_from_key(
146 union xfs_btree_key *key,
147 union xfs_btree_rec *rec)
149 rec->inobt.ir_startino = key->inobt.ir_startino;
153 xfs_inobt_init_rec_from_cur(
154 struct xfs_btree_cur *cur,
155 union xfs_btree_rec *rec)
157 rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
158 rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
159 rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
163 * initial value of ptr for lookup
166 xfs_inobt_init_ptr_from_cur(
167 struct xfs_btree_cur *cur,
168 union xfs_btree_ptr *ptr)
170 struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
172 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
174 ptr->s = agi->agi_root;
179 struct xfs_btree_cur *cur,
180 union xfs_btree_key *key)
182 return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
183 cur->bc_rec.i.ir_startino;
188 xfs_inobt_keys_inorder(
189 struct xfs_btree_cur *cur,
190 union xfs_btree_key *k1,
191 union xfs_btree_key *k2)
193 return be32_to_cpu(k1->inobt.ir_startino) <
194 be32_to_cpu(k2->inobt.ir_startino);
198 xfs_inobt_recs_inorder(
199 struct xfs_btree_cur *cur,
200 union xfs_btree_rec *r1,
201 union xfs_btree_rec *r2)
203 return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
204 be32_to_cpu(r2->inobt.ir_startino);
208 #ifdef XFS_BTREE_TRACE
209 ktrace_t *xfs_inobt_trace_buf;
212 xfs_inobt_trace_enter(
213 struct xfs_btree_cur *cur,
230 ktrace_enter(xfs_inobt_trace_buf, (void *)(__psint_t)type,
231 (void *)func, (void *)s, NULL, (void *)cur,
232 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
233 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
234 (void *)a8, (void *)a9, (void *)a10);
238 xfs_inobt_trace_cursor(
239 struct xfs_btree_cur *cur,
244 *s0 = cur->bc_private.a.agno;
245 *l0 = cur->bc_rec.i.ir_startino;
246 *l1 = cur->bc_rec.i.ir_free;
251 struct xfs_btree_cur *cur,
252 union xfs_btree_key *key,
256 *l0 = be32_to_cpu(key->inobt.ir_startino);
261 xfs_inobt_trace_record(
262 struct xfs_btree_cur *cur,
263 union xfs_btree_rec *rec,
268 *l0 = be32_to_cpu(rec->inobt.ir_startino);
269 *l1 = be32_to_cpu(rec->inobt.ir_freecount);
270 *l2 = be64_to_cpu(rec->inobt.ir_free);
272 #endif /* XFS_BTREE_TRACE */
274 static const struct xfs_btree_ops xfs_inobt_ops = {
275 .rec_len = sizeof(xfs_inobt_rec_t),
276 .key_len = sizeof(xfs_inobt_key_t),
278 .dup_cursor = xfs_inobt_dup_cursor,
279 .set_root = xfs_inobt_set_root,
280 .alloc_block = xfs_inobt_alloc_block,
281 .free_block = xfs_inobt_free_block,
282 .get_minrecs = xfs_inobt_get_minrecs,
283 .get_maxrecs = xfs_inobt_get_maxrecs,
284 .init_key_from_rec = xfs_inobt_init_key_from_rec,
285 .init_rec_from_key = xfs_inobt_init_rec_from_key,
286 .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
287 .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
288 .key_diff = xfs_inobt_key_diff,
291 .keys_inorder = xfs_inobt_keys_inorder,
292 .recs_inorder = xfs_inobt_recs_inorder,
295 #ifdef XFS_BTREE_TRACE
296 .trace_enter = xfs_inobt_trace_enter,
297 .trace_cursor = xfs_inobt_trace_cursor,
298 .trace_key = xfs_inobt_trace_key,
299 .trace_record = xfs_inobt_trace_record,
304 * Allocate a new inode btree cursor.
306 struct xfs_btree_cur * /* new inode btree cursor */
307 xfs_inobt_init_cursor(
308 struct xfs_mount *mp, /* file system mount point */
309 struct xfs_trans *tp, /* transaction pointer */
310 struct xfs_buf *agbp, /* buffer for agi structure */
311 xfs_agnumber_t agno) /* allocation group number */
313 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
314 struct xfs_btree_cur *cur;
316 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
320 cur->bc_nlevels = be32_to_cpu(agi->agi_level);
321 cur->bc_btnum = XFS_BTNUM_INO;
322 cur->bc_blocklog = mp->m_sb.sb_blocklog;
324 cur->bc_ops = &xfs_inobt_ops;
326 cur->bc_private.a.agbp = agbp;
327 cur->bc_private.a.agno = agno;
333 * Calculate number of records in an inobt btree block.
337 struct xfs_mount *mp,
341 blocklen -= XFS_INOBT_BLOCK_LEN(mp);
344 return blocklen / sizeof(xfs_inobt_rec_t);
345 return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));