projects / deliverable / linux.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
[XFS] kill xfs_bmbt_log_block and xfs_bmbt_log_recs
[deliverable/linux.git] / fs / xfs / xfs_ialloc_btree.c
CommitLineData
1da177e4 1/*
7b718769
NS		 2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
1da177e4 4 *
7b718769
NS		 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
1da177e4
LT		 7 * published by the Free Software Foundation.
8 *
7b718769
NS		 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.
1da177e4 13 *
7b718769
NS		 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
1da177e4 17 */
1da177e4 18#include "xfs.h"
a844f451 19#include "xfs_fs.h"
1da177e4 20#include "xfs_types.h"
a844f451 21#include "xfs_bit.h"
1da177e4 22#include "xfs_log.h"
a844f451 23#include "xfs_inum.h"
1da177e4
LT		 24#include "xfs_trans.h"
25#include "xfs_sb.h"
26#include "xfs_ag.h"
a844f451 27#include "xfs_dir2.h"
1da177e4
LT		 28#include "xfs_dmapi.h"
29#include "xfs_mount.h"
1da177e4 30#include "xfs_bmap_btree.h"
a844f451 31#include "xfs_alloc_btree.h"
1da177e4 32#include "xfs_ialloc_btree.h"
a844f451
NS		 33#include "xfs_dir2_sf.h"
34#include "xfs_attr_sf.h"
35#include "xfs_dinode.h"
36#include "xfs_inode.h"
1da177e4 37#include "xfs_btree.h"
f5eb8e7c 38#include "xfs_btree_trace.h"
1da177e4
LT		 39#include "xfs_ialloc.h"
40#include "xfs_alloc.h"
41#include "xfs_error.h"
42
1da177e4 43
91cca5df
CH		 44STATIC int
45xfs_inobt_get_minrecs(
46 struct xfs_btree_cur *cur,
47 int level)
48{
49 return cur->bc_mp->m_inobt_mnr[level != 0];
50}
1da177e4 51
561f7d17
CH		 52STATIC struct xfs_btree_cur *
53xfs_inobt_dup_cursor(
54 struct xfs_btree_cur *cur)
55{
56 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
57 cur->bc_private.a.agbp, cur->bc_private.a.agno);
58}
59
344207ce
CH		 60STATIC void
61xfs_inobt_set_root(
62 struct xfs_btree_cur *cur,
63 union xfs_btree_ptr *nptr,
64 int inc) /* level change */
65{
66 struct xfs_buf *agbp = cur->bc_private.a.agbp;
67 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
68
69 agi->agi_root = nptr->s;
70 be32_add_cpu(&agi->agi_level, inc);
71 xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
72}
73
f5eb8e7c
CH		 74STATIC int
75xfs_inobt_alloc_block(
76 struct xfs_btree_cur *cur,
77 union xfs_btree_ptr *start,
78 union xfs_btree_ptr *new,
79 int length,
80 int *stat)
81{
82 xfs_alloc_arg_t args; /* block allocation args */
83 int error; /* error return value */
84 xfs_agblock_t sbno = be32_to_cpu(start->s);
85
86 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
87
88 memset(&args, 0, sizeof(args));
89 args.tp = cur->bc_tp;
90 args.mp = cur->bc_mp;
91 args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
92 args.minlen = 1;
93 args.maxlen = 1;
94 args.prod = 1;
95 args.type = XFS_ALLOCTYPE_NEAR_BNO;
96
97 error = xfs_alloc_vextent(&args);
98 if (error) {
99 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
100 return error;
101 }
102 if (args.fsbno == NULLFSBLOCK) {
103 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
104 *stat = 0;
105 return 0;
106 }
107 ASSERT(args.len == 1);
108 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
109
110 new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
111 *stat = 1;
112 return 0;
113}
114
d4b3a4b7
CH		 115STATIC int
116xfs_inobt_free_block(
117 struct xfs_btree_cur *cur,
118 struct xfs_buf *bp)
119{
120 xfs_fsblock_t fsbno;
121 int error;
122
123 fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
124 error = xfs_free_extent(cur->bc_tp, fsbno, 1);
125 if (error)
126 return error;
127
128 xfs_trans_binval(cur->bc_tp, bp);
129 return error;
130}
f5eb8e7c 131
ce5e42db
CH		 132STATIC int
133xfs_inobt_get_maxrecs(
134 struct xfs_btree_cur *cur,
135 int level)
136{
137 return cur->bc_mp->m_inobt_mxr[level != 0];
138}
139
fe033cc8
CH		 140STATIC void
141xfs_inobt_init_key_from_rec(
142 union xfs_btree_key *key,
143 union xfs_btree_rec *rec)
144{
145 key->inobt.ir_startino = rec->inobt.ir_startino;
146}
147
4b22a571
CH		 148STATIC void
149xfs_inobt_init_rec_from_key(
150 union xfs_btree_key *key,
151 union xfs_btree_rec *rec)
152{
153 rec->inobt.ir_startino = key->inobt.ir_startino;
154}
155
156STATIC void
157xfs_inobt_init_rec_from_cur(
158 struct xfs_btree_cur *cur,
159 union xfs_btree_rec *rec)
160{
161 rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
162 rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
163 rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
164}
165
fe033cc8
CH		 166/*
167 * intial value of ptr for lookup
168 */
169STATIC void
170xfs_inobt_init_ptr_from_cur(
171 struct xfs_btree_cur *cur,
172 union xfs_btree_ptr *ptr)
173{
174 struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
175
176 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
177
178 ptr->s = agi->agi_root;
179}
180
181STATIC __int64_t
182xfs_inobt_key_diff(
183 struct xfs_btree_cur *cur,
184 union xfs_btree_key *key)
185{
186 return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
187 cur->bc_rec.i.ir_startino;
188}
189
91cca5df
CH		 190STATIC int
191xfs_inobt_kill_root(
192 struct xfs_btree_cur *cur,
193 struct xfs_buf *bp,
194 int level,
195 union xfs_btree_ptr *newroot)
196{
197 int error;
198
199 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
200 XFS_BTREE_STATS_INC(cur, killroot);
201
202 /*
203 * Update the root pointer, decreasing the level by 1 and then
204 * free the old root.
205 */
206 xfs_inobt_set_root(cur, newroot, -1);
207 error = xfs_inobt_free_block(cur, bp);
208 if (error) {
209 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
210 return error;
211 }
212
213 XFS_BTREE_STATS_INC(cur, free);
214
215 cur->bc_bufs[level] = NULL;
216 cur->bc_nlevels--;
217
218 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
219 return 0;
220}
221
8c4ed633
CH		 222#ifdef XFS_BTREE_TRACE
223ktrace_t *xfs_inobt_trace_buf;
224
225STATIC void
226xfs_inobt_trace_enter(
227 struct xfs_btree_cur *cur,
228 const char *func,
229 char *s,
230 int type,
231 int line,
232 __psunsigned_t a0,
233 __psunsigned_t a1,
234 __psunsigned_t a2,
235 __psunsigned_t a3,
236 __psunsigned_t a4,
237 __psunsigned_t a5,
238 __psunsigned_t a6,
239 __psunsigned_t a7,
240 __psunsigned_t a8,
241 __psunsigned_t a9,
242 __psunsigned_t a10)
243{
244 ktrace_enter(xfs_inobt_trace_buf, (void *)(__psint_t)type,
245 (void *)func, (void *)s, NULL, (void *)cur,
246 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
247 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
248 (void *)a8, (void *)a9, (void *)a10);
249}
250
251STATIC void
252xfs_inobt_trace_cursor(
253 struct xfs_btree_cur *cur,
254 __uint32_t *s0,
255 __uint64_t *l0,
256 __uint64_t *l1)
257{
258 *s0 = cur->bc_private.a.agno;
259 *l0 = cur->bc_rec.i.ir_startino;
260 *l1 = cur->bc_rec.i.ir_free;
261}
262
263STATIC void
264xfs_inobt_trace_key(
265 struct xfs_btree_cur *cur,
266 union xfs_btree_key *key,
267 __uint64_t *l0,
268 __uint64_t *l1)
269{
270 *l0 = be32_to_cpu(key->inobt.ir_startino);
271 *l1 = 0;
272}
273
274STATIC void
275xfs_inobt_trace_record(
276 struct xfs_btree_cur *cur,
277 union xfs_btree_rec *rec,
278 __uint64_t *l0,
279 __uint64_t *l1,
280 __uint64_t *l2)
281{
282 *l0 = be32_to_cpu(rec->inobt.ir_startino);
283 *l1 = be32_to_cpu(rec->inobt.ir_freecount);
284 *l2 = be64_to_cpu(rec->inobt.ir_free);
285}
286#endif /* XFS_BTREE_TRACE */
287
561f7d17 288static const struct xfs_btree_ops xfs_inobt_ops = {
65f1eaea
CH		 289 .rec_len = sizeof(xfs_inobt_rec_t),
290 .key_len = sizeof(xfs_inobt_key_t),
291
561f7d17 292 .dup_cursor = xfs_inobt_dup_cursor,
344207ce 293 .set_root = xfs_inobt_set_root,
91cca5df 294 .kill_root = xfs_inobt_kill_root,
f5eb8e7c 295 .alloc_block = xfs_inobt_alloc_block,
d4b3a4b7 296 .free_block = xfs_inobt_free_block,
91cca5df 297 .get_minrecs = xfs_inobt_get_minrecs,
ce5e42db 298 .get_maxrecs = xfs_inobt_get_maxrecs,
fe033cc8 299 .init_key_from_rec = xfs_inobt_init_key_from_rec,
4b22a571
CH		 300 .init_rec_from_key = xfs_inobt_init_rec_from_key,
301 .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
fe033cc8
CH		 302 .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
303 .key_diff = xfs_inobt_key_diff,
8c4ed633
CH		 304
305#ifdef XFS_BTREE_TRACE
306 .trace_enter = xfs_inobt_trace_enter,
307 .trace_cursor = xfs_inobt_trace_cursor,
308 .trace_key = xfs_inobt_trace_key,
309 .trace_record = xfs_inobt_trace_record,
310#endif
561f7d17
CH		 311};
312
313/*
314 * Allocate a new inode btree cursor.
315 */
316struct xfs_btree_cur * /* new inode btree cursor */
317xfs_inobt_init_cursor(
318 struct xfs_mount *mp, /* file system mount point */
319 struct xfs_trans *tp, /* transaction pointer */
320 struct xfs_buf *agbp, /* buffer for agi structure */
321 xfs_agnumber_t agno) /* allocation group number */
322{
323 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
324 struct xfs_btree_cur *cur;
325
326 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
327
328 cur->bc_tp = tp;
329 cur->bc_mp = mp;
330 cur->bc_nlevels = be32_to_cpu(agi->agi_level);
331 cur->bc_btnum = XFS_BTNUM_INO;
332 cur->bc_blocklog = mp->m_sb.sb_blocklog;
333
334 cur->bc_ops = &xfs_inobt_ops;
335
336 cur->bc_private.a.agbp = agbp;
337 cur->bc_private.a.agno = agno;
338
339 return cur;
340}
Linux kernel - Deliverables
This page took 0.552842 seconds and 5 git commands to generate.