blob: 16921f55c542c6e916f8fb35b893f4fd45453e60 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Nathan Scott7b718762005-11-02 14:58:39 +11002 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004 *
Nathan Scott7b718762005-11-02 14:58:39 +11005 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 * published by the Free Software Foundation.
8 *
Nathan Scott7b718762005-11-02 14:58:39 +11009 * 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.
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 *
Nathan Scott7b718762005-11-02 14:58:39 +110014 * 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
Linus Torvalds1da177e2005-04-16 15:20:36 -070017 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070018#include "xfs.h"
Nathan Scotta844f452005-11-02 14:38:42 +110019#include "xfs_fs.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070020#include "xfs_types.h"
Nathan Scotta844f452005-11-02 14:38:42 +110021#include "xfs_bit.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include "xfs_log.h"
Nathan Scotta844f452005-11-02 14:38:42 +110023#include "xfs_inum.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include "xfs_trans.h"
25#include "xfs_sb.h"
26#include "xfs_ag.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070027#include "xfs_mount.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070028#include "xfs_bmap_btree.h"
Nathan Scotta844f452005-11-02 14:38:42 +110029#include "xfs_alloc_btree.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070030#include "xfs_ialloc_btree.h"
Nathan Scotta844f452005-11-02 14:38:42 +110031#include "xfs_dinode.h"
32#include "xfs_inode.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070033#include "xfs_btree.h"
Christoph Hellwigf5eb8e72008-10-30 16:57:03 +110034#include "xfs_btree_trace.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070035#include "xfs_ialloc.h"
36#include "xfs_alloc.h"
37#include "xfs_error.h"
38
Linus Torvalds1da177e2005-04-16 15:20:36 -070039
Christoph Hellwig91cca5df2008-10-30 16:58:01 +110040STATIC int
41xfs_inobt_get_minrecs(
42 struct xfs_btree_cur *cur,
43 int level)
44{
45 return cur->bc_mp->m_inobt_mnr[level != 0];
46}
Linus Torvalds1da177e2005-04-16 15:20:36 -070047
Christoph Hellwig561f7d12008-10-30 16:53:59 +110048STATIC struct xfs_btree_cur *
49xfs_inobt_dup_cursor(
50 struct xfs_btree_cur *cur)
51{
52 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
53 cur->bc_private.a.agbp, cur->bc_private.a.agno);
54}
55
Christoph Hellwig344207c2008-10-30 16:57:16 +110056STATIC void
57xfs_inobt_set_root(
58 struct xfs_btree_cur *cur,
59 union xfs_btree_ptr *nptr,
60 int inc) /* level change */
61{
62 struct xfs_buf *agbp = cur->bc_private.a.agbp;
63 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
64
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);
68}
69
Christoph Hellwigce5e42d2008-10-30 16:55:23 +110070STATIC int
Christoph Hellwigf5eb8e72008-10-30 16:57:03 +110071xfs_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)
77{
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);
81
82 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
83
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;
92
93 error = xfs_alloc_vextent(&args);
94 if (error) {
95 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
96 return error;
97 }
98 if (args.fsbno == NULLFSBLOCK) {
99 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
100 *stat = 0;
101 return 0;
102 }
103 ASSERT(args.len == 1);
104 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
105
106 new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
107 *stat = 1;
108 return 0;
109}
110
Christoph Hellwigd4b3a4b2008-10-30 16:57:51 +1100111STATIC int
112xfs_inobt_free_block(
113 struct xfs_btree_cur *cur,
114 struct xfs_buf *bp)
115{
116 xfs_fsblock_t fsbno;
117 int error;
118
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;
123
124 xfs_trans_binval(cur->bc_tp, bp);
125 return error;
126}
Christoph Hellwigf5eb8e72008-10-30 16:57:03 +1100127
128STATIC int
Christoph Hellwigce5e42d2008-10-30 16:55:23 +1100129xfs_inobt_get_maxrecs(
130 struct xfs_btree_cur *cur,
131 int level)
132{
133 return cur->bc_mp->m_inobt_mxr[level != 0];
134}
135
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100136STATIC void
137xfs_inobt_init_key_from_rec(
138 union xfs_btree_key *key,
139 union xfs_btree_rec *rec)
140{
141 key->inobt.ir_startino = rec->inobt.ir_startino;
142}
143
Christoph Hellwig4b22a572008-10-30 16:57:40 +1100144STATIC void
145xfs_inobt_init_rec_from_key(
146 union xfs_btree_key *key,
147 union xfs_btree_rec *rec)
148{
149 rec->inobt.ir_startino = key->inobt.ir_startino;
150}
151
152STATIC void
153xfs_inobt_init_rec_from_cur(
154 struct xfs_btree_cur *cur,
155 union xfs_btree_rec *rec)
156{
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);
160}
161
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100162/*
Malcolm Parsons9da096f2009-03-29 09:55:42 +0200163 * initial value of ptr for lookup
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100164 */
165STATIC void
166xfs_inobt_init_ptr_from_cur(
167 struct xfs_btree_cur *cur,
168 union xfs_btree_ptr *ptr)
169{
170 struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
171
172 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
173
174 ptr->s = agi->agi_root;
175}
176
177STATIC __int64_t
178xfs_inobt_key_diff(
179 struct xfs_btree_cur *cur,
180 union xfs_btree_key *key)
181{
182 return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
183 cur->bc_rec.i.ir_startino;
184}
185
Christoph Hellwig4a26e662008-10-30 16:58:32 +1100186#ifdef DEBUG
187STATIC int
188xfs_inobt_keys_inorder(
189 struct xfs_btree_cur *cur,
190 union xfs_btree_key *k1,
191 union xfs_btree_key *k2)
192{
193 return be32_to_cpu(k1->inobt.ir_startino) <
194 be32_to_cpu(k2->inobt.ir_startino);
195}
196
197STATIC int
198xfs_inobt_recs_inorder(
199 struct xfs_btree_cur *cur,
200 union xfs_btree_rec *r1,
201 union xfs_btree_rec *r2)
202{
203 return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
204 be32_to_cpu(r2->inobt.ir_startino);
205}
206#endif /* DEBUG */
207
Christoph Hellwig8c4ed632008-10-30 16:55:13 +1100208#ifdef XFS_BTREE_TRACE
209ktrace_t *xfs_inobt_trace_buf;
210
211STATIC void
212xfs_inobt_trace_enter(
213 struct xfs_btree_cur *cur,
214 const char *func,
215 char *s,
216 int type,
217 int line,
218 __psunsigned_t a0,
219 __psunsigned_t a1,
220 __psunsigned_t a2,
221 __psunsigned_t a3,
222 __psunsigned_t a4,
223 __psunsigned_t a5,
224 __psunsigned_t a6,
225 __psunsigned_t a7,
226 __psunsigned_t a8,
227 __psunsigned_t a9,
228 __psunsigned_t a10)
229{
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);
235}
236
237STATIC void
238xfs_inobt_trace_cursor(
239 struct xfs_btree_cur *cur,
240 __uint32_t *s0,
241 __uint64_t *l0,
242 __uint64_t *l1)
243{
244 *s0 = cur->bc_private.a.agno;
245 *l0 = cur->bc_rec.i.ir_startino;
246 *l1 = cur->bc_rec.i.ir_free;
247}
248
249STATIC void
250xfs_inobt_trace_key(
251 struct xfs_btree_cur *cur,
252 union xfs_btree_key *key,
253 __uint64_t *l0,
254 __uint64_t *l1)
255{
256 *l0 = be32_to_cpu(key->inobt.ir_startino);
257 *l1 = 0;
258}
259
260STATIC void
261xfs_inobt_trace_record(
262 struct xfs_btree_cur *cur,
263 union xfs_btree_rec *rec,
264 __uint64_t *l0,
265 __uint64_t *l1,
266 __uint64_t *l2)
267{
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);
271}
272#endif /* XFS_BTREE_TRACE */
273
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100274static const struct xfs_btree_ops xfs_inobt_ops = {
Christoph Hellwig65f1eae2008-10-30 16:55:34 +1100275 .rec_len = sizeof(xfs_inobt_rec_t),
276 .key_len = sizeof(xfs_inobt_key_t),
277
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100278 .dup_cursor = xfs_inobt_dup_cursor,
Christoph Hellwig344207c2008-10-30 16:57:16 +1100279 .set_root = xfs_inobt_set_root,
Christoph Hellwigf5eb8e72008-10-30 16:57:03 +1100280 .alloc_block = xfs_inobt_alloc_block,
Christoph Hellwigd4b3a4b2008-10-30 16:57:51 +1100281 .free_block = xfs_inobt_free_block,
Christoph Hellwig91cca5df2008-10-30 16:58:01 +1100282 .get_minrecs = xfs_inobt_get_minrecs,
Christoph Hellwigce5e42d2008-10-30 16:55:23 +1100283 .get_maxrecs = xfs_inobt_get_maxrecs,
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100284 .init_key_from_rec = xfs_inobt_init_key_from_rec,
Christoph Hellwig4b22a572008-10-30 16:57:40 +1100285 .init_rec_from_key = xfs_inobt_init_rec_from_key,
286 .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100287 .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
288 .key_diff = xfs_inobt_key_diff,
Christoph Hellwig8c4ed632008-10-30 16:55:13 +1100289
Christoph Hellwig4a26e662008-10-30 16:58:32 +1100290#ifdef DEBUG
291 .keys_inorder = xfs_inobt_keys_inorder,
292 .recs_inorder = xfs_inobt_recs_inorder,
293#endif
294
Christoph Hellwig8c4ed632008-10-30 16:55:13 +1100295#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,
300#endif
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100301};
302
303/*
304 * Allocate a new inode btree cursor.
305 */
306struct xfs_btree_cur * /* new inode btree cursor */
307xfs_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 */
312{
313 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
314 struct xfs_btree_cur *cur;
315
316 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
317
318 cur->bc_tp = tp;
319 cur->bc_mp = mp;
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;
323
324 cur->bc_ops = &xfs_inobt_ops;
325
326 cur->bc_private.a.agbp = agbp;
327 cur->bc_private.a.agno = agno;
328
329 return cur;
330}
Christoph Hellwig60197e82008-10-30 17:11:19 +1100331
332/*
333 * Calculate number of records in an inobt btree block.
334 */
335int
336xfs_inobt_maxrecs(
337 struct xfs_mount *mp,
338 int blocklen,
339 int leaf)
340{
Christoph Hellwig7cc95a82008-10-30 17:14:34 +1100341 blocklen -= XFS_INOBT_BLOCK_LEN(mp);
Christoph Hellwig60197e82008-10-30 17:11:19 +1100342
343 if (leaf)
344 return blocklen / sizeof(xfs_inobt_rec_t);
345 return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
346}