GUI: Fix Tomato RAF theme for all builds. Compilation typo.
[tomato.git] / release / src-rt-6.x.4708 / linux / linux-2.6.36 / fs / xfs / xfs_ialloc_btree.c
blobd352862cefa01d7e3c743ed1904b1d1da59bc1b2
1 /*
2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
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
18 #include "xfs.h"
19 #include "xfs_fs.h"
20 #include "xfs_types.h"
21 #include "xfs_bit.h"
22 #include "xfs_log.h"
23 #include "xfs_inum.h"
24 #include "xfs_trans.h"
25 #include "xfs_sb.h"
26 #include "xfs_ag.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"
40 STATIC int
41 xfs_inobt_get_minrecs(
42 struct xfs_btree_cur *cur,
43 int level)
45 return cur->bc_mp->m_inobt_mnr[level != 0];
48 STATIC struct xfs_btree_cur *
49 xfs_inobt_dup_cursor(
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);
56 STATIC void
57 xfs_inobt_set_root(
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);
70 STATIC int
71 xfs_inobt_alloc_block(
72 struct xfs_btree_cur *cur,
73 union xfs_btree_ptr *start,
74 union xfs_btree_ptr *new,
75 int length,
76 int *stat)
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));
85 args.tp = cur->bc_tp;
86 args.mp = cur->bc_mp;
87 args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
88 args.minlen = 1;
89 args.maxlen = 1;
90 args.prod = 1;
91 args.type = XFS_ALLOCTYPE_NEAR_BNO;
93 error = xfs_alloc_vextent(&args);
94 if (error) {
95 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
96 return error;
98 if (args.fsbno == NULLFSBLOCK) {
99 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
100 *stat = 0;
101 return 0;
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));
107 *stat = 1;
108 return 0;
111 STATIC int
112 xfs_inobt_free_block(
113 struct xfs_btree_cur *cur,
114 struct xfs_buf *bp)
116 xfs_fsblock_t fsbno;
117 int error;
119 fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
120 error = xfs_free_extent(cur->bc_tp, fsbno, 1);
121 if (error)
122 return error;
124 xfs_trans_binval(cur->bc_tp, bp);
125 return error;
128 STATIC int
129 xfs_inobt_get_maxrecs(
130 struct xfs_btree_cur *cur,
131 int level)
133 return cur->bc_mp->m_inobt_mxr[level != 0];
136 STATIC void
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;
144 STATIC void
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;
152 STATIC void
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
165 STATIC void
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;
177 STATIC __int64_t
178 xfs_inobt_key_diff(
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;
186 STATIC int
187 xfs_inobt_kill_root(
188 struct xfs_btree_cur *cur,
189 struct xfs_buf *bp,
190 int level,
191 union xfs_btree_ptr *newroot)
193 int error;
195 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
196 XFS_BTREE_STATS_INC(cur, killroot);
199 * Update the root pointer, decreasing the level by 1 and then
200 * free the old root.
202 xfs_inobt_set_root(cur, newroot, -1);
203 error = xfs_inobt_free_block(cur, bp);
204 if (error) {
205 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
206 return error;
209 XFS_BTREE_STATS_INC(cur, free);
211 cur->bc_bufs[level] = NULL;
212 cur->bc_nlevels--;
214 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
215 return 0;
218 #ifdef DEBUG
219 STATIC int
220 xfs_inobt_keys_inorder(
221 struct xfs_btree_cur *cur,
222 union xfs_btree_key *k1,
223 union xfs_btree_key *k2)
225 return be32_to_cpu(k1->inobt.ir_startino) <
226 be32_to_cpu(k2->inobt.ir_startino);
229 STATIC int
230 xfs_inobt_recs_inorder(
231 struct xfs_btree_cur *cur,
232 union xfs_btree_rec *r1,
233 union xfs_btree_rec *r2)
235 return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
236 be32_to_cpu(r2->inobt.ir_startino);
238 #endif /* DEBUG */
240 #ifdef XFS_BTREE_TRACE
241 ktrace_t *xfs_inobt_trace_buf;
243 STATIC void
244 xfs_inobt_trace_enter(
245 struct xfs_btree_cur *cur,
246 const char *func,
247 char *s,
248 int type,
249 int line,
250 __psunsigned_t a0,
251 __psunsigned_t a1,
252 __psunsigned_t a2,
253 __psunsigned_t a3,
254 __psunsigned_t a4,
255 __psunsigned_t a5,
256 __psunsigned_t a6,
257 __psunsigned_t a7,
258 __psunsigned_t a8,
259 __psunsigned_t a9,
260 __psunsigned_t a10)
262 ktrace_enter(xfs_inobt_trace_buf, (void *)(__psint_t)type,
263 (void *)func, (void *)s, NULL, (void *)cur,
264 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
265 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
266 (void *)a8, (void *)a9, (void *)a10);
269 STATIC void
270 xfs_inobt_trace_cursor(
271 struct xfs_btree_cur *cur,
272 __uint32_t *s0,
273 __uint64_t *l0,
274 __uint64_t *l1)
276 *s0 = cur->bc_private.a.agno;
277 *l0 = cur->bc_rec.i.ir_startino;
278 *l1 = cur->bc_rec.i.ir_free;
281 STATIC void
282 xfs_inobt_trace_key(
283 struct xfs_btree_cur *cur,
284 union xfs_btree_key *key,
285 __uint64_t *l0,
286 __uint64_t *l1)
288 *l0 = be32_to_cpu(key->inobt.ir_startino);
289 *l1 = 0;
292 STATIC void
293 xfs_inobt_trace_record(
294 struct xfs_btree_cur *cur,
295 union xfs_btree_rec *rec,
296 __uint64_t *l0,
297 __uint64_t *l1,
298 __uint64_t *l2)
300 *l0 = be32_to_cpu(rec->inobt.ir_startino);
301 *l1 = be32_to_cpu(rec->inobt.ir_freecount);
302 *l2 = be64_to_cpu(rec->inobt.ir_free);
304 #endif /* XFS_BTREE_TRACE */
306 static const struct xfs_btree_ops xfs_inobt_ops = {
307 .rec_len = sizeof(xfs_inobt_rec_t),
308 .key_len = sizeof(xfs_inobt_key_t),
310 .dup_cursor = xfs_inobt_dup_cursor,
311 .set_root = xfs_inobt_set_root,
312 .kill_root = xfs_inobt_kill_root,
313 .alloc_block = xfs_inobt_alloc_block,
314 .free_block = xfs_inobt_free_block,
315 .get_minrecs = xfs_inobt_get_minrecs,
316 .get_maxrecs = xfs_inobt_get_maxrecs,
317 .init_key_from_rec = xfs_inobt_init_key_from_rec,
318 .init_rec_from_key = xfs_inobt_init_rec_from_key,
319 .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
320 .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
321 .key_diff = xfs_inobt_key_diff,
323 #ifdef DEBUG
324 .keys_inorder = xfs_inobt_keys_inorder,
325 .recs_inorder = xfs_inobt_recs_inorder,
326 #endif
328 #ifdef XFS_BTREE_TRACE
329 .trace_enter = xfs_inobt_trace_enter,
330 .trace_cursor = xfs_inobt_trace_cursor,
331 .trace_key = xfs_inobt_trace_key,
332 .trace_record = xfs_inobt_trace_record,
333 #endif
337 * Allocate a new inode btree cursor.
339 struct xfs_btree_cur * /* new inode btree cursor */
340 xfs_inobt_init_cursor(
341 struct xfs_mount *mp, /* file system mount point */
342 struct xfs_trans *tp, /* transaction pointer */
343 struct xfs_buf *agbp, /* buffer for agi structure */
344 xfs_agnumber_t agno) /* allocation group number */
346 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
347 struct xfs_btree_cur *cur;
349 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
351 cur->bc_tp = tp;
352 cur->bc_mp = mp;
353 cur->bc_nlevels = be32_to_cpu(agi->agi_level);
354 cur->bc_btnum = XFS_BTNUM_INO;
355 cur->bc_blocklog = mp->m_sb.sb_blocklog;
357 cur->bc_ops = &xfs_inobt_ops;
359 cur->bc_private.a.agbp = agbp;
360 cur->bc_private.a.agno = agno;
362 return cur;
366 * Calculate number of records in an inobt btree block.
369 xfs_inobt_maxrecs(
370 struct xfs_mount *mp,
371 int blocklen,
372 int leaf)
374 blocklen -= XFS_INOBT_BLOCK_LEN(mp);
376 if (leaf)
377 return blocklen / sizeof(xfs_inobt_rec_t);
378 return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));