1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18#ifndef __XFS_BTREE_H__
19#define __XFS_BTREE_H__
20
21struct xfs_buf;
22struct xfs_bmap_free;
23struct xfs_inode;
24struct xfs_mount;
25struct xfs_trans;
26
27extern kmem_zone_t *xfs_btree_cur_zone;
28
29
30
31
32#define XFS_LOOKUP_EQ ((xfs_lookup_t)XFS_LOOKUP_EQi)
33#define XFS_LOOKUP_LE ((xfs_lookup_t)XFS_LOOKUP_LEi)
34#define XFS_LOOKUP_GE ((xfs_lookup_t)XFS_LOOKUP_GEi)
35
36#define XFS_BTNUM_BNO ((xfs_btnum_t)XFS_BTNUM_BNOi)
37#define XFS_BTNUM_CNT ((xfs_btnum_t)XFS_BTNUM_CNTi)
38#define XFS_BTNUM_BMAP ((xfs_btnum_t)XFS_BTNUM_BMAPi)
39#define XFS_BTNUM_INO ((xfs_btnum_t)XFS_BTNUM_INOi)
40
41
42
43
44
45
46
47
48
49
50
51struct xfs_btree_block {
52 __be32 bb_magic;
53 __be16 bb_level;
54 __be16 bb_numrecs;
55 union {
56 struct {
57 __be32 bb_leftsib;
58 __be32 bb_rightsib;
59 } s;
60 struct {
61 __be64 bb_leftsib;
62 __be64 bb_rightsib;
63 } l;
64 } bb_u;
65};
66
67#define XFS_BTREE_SBLOCK_LEN 16
68#define XFS_BTREE_LBLOCK_LEN 24
69
70
71
72
73
74
75
76
77union xfs_btree_ptr {
78 __be32 s;
79 __be64 l;
80};
81
82union xfs_btree_key {
83 xfs_bmbt_key_t bmbt;
84 xfs_bmdr_key_t bmbr;
85 xfs_alloc_key_t alloc;
86 xfs_inobt_key_t inobt;
87};
88
89union xfs_btree_rec {
90 xfs_bmbt_rec_t bmbt;
91 xfs_bmdr_rec_t bmbr;
92 xfs_alloc_rec_t alloc;
93 xfs_inobt_rec_t inobt;
94};
95
96
97
98
99#define XFS_BB_MAGIC 0x01
100#define XFS_BB_LEVEL 0x02
101#define XFS_BB_NUMRECS 0x04
102#define XFS_BB_LEFTSIB 0x08
103#define XFS_BB_RIGHTSIB 0x10
104#define XFS_BB_NUM_BITS 5
105#define XFS_BB_ALL_BITS ((1 << XFS_BB_NUM_BITS) - 1)
106
107
108
109
110extern const __uint32_t xfs_magics[];
111
112
113
114
115#define __XFS_BTREE_STATS_INC(type, stat) \
116 XFS_STATS_INC(xs_ ## type ## _2_ ## stat)
117#define XFS_BTREE_STATS_INC(cur, stat) \
118do { \
119 switch (cur->bc_btnum) { \
120 case XFS_BTNUM_BNO: __XFS_BTREE_STATS_INC(abtb, stat); break; \
121 case XFS_BTNUM_CNT: __XFS_BTREE_STATS_INC(abtc, stat); break; \
122 case XFS_BTNUM_BMAP: __XFS_BTREE_STATS_INC(bmbt, stat); break; \
123 case XFS_BTNUM_INO: __XFS_BTREE_STATS_INC(ibt, stat); break; \
124 case XFS_BTNUM_MAX: ASSERT(0); ; break; \
125 } \
126} while (0)
127
128#define __XFS_BTREE_STATS_ADD(type, stat, val) \
129 XFS_STATS_ADD(xs_ ## type ## _2_ ## stat, val)
130#define XFS_BTREE_STATS_ADD(cur, stat, val) \
131do { \
132 switch (cur->bc_btnum) { \
133 case XFS_BTNUM_BNO: __XFS_BTREE_STATS_ADD(abtb, stat, val); break; \
134 case XFS_BTNUM_CNT: __XFS_BTREE_STATS_ADD(abtc, stat, val); break; \
135 case XFS_BTNUM_BMAP: __XFS_BTREE_STATS_ADD(bmbt, stat, val); break; \
136 case XFS_BTNUM_INO: __XFS_BTREE_STATS_ADD(ibt, stat, val); break; \
137 case XFS_BTNUM_MAX: ASSERT(0); ; break; \
138 } \
139} while (0)
140
141#define XFS_BTREE_MAXLEVELS 8
142
143struct xfs_btree_ops {
144
145 size_t key_len;
146 size_t rec_len;
147
148
149 struct xfs_btree_cur *(*dup_cursor)(struct xfs_btree_cur *);
150 void (*update_cursor)(struct xfs_btree_cur *src,
151 struct xfs_btree_cur *dst);
152
153
154 void (*set_root)(struct xfs_btree_cur *cur,
155 union xfs_btree_ptr *nptr, int level_change);
156
157
158 int (*alloc_block)(struct xfs_btree_cur *cur,
159 union xfs_btree_ptr *start_bno,
160 union xfs_btree_ptr *new_bno,
161 int length, int *stat);
162 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp);
163
164
165 void (*update_lastrec)(struct xfs_btree_cur *cur,
166 struct xfs_btree_block *block,
167 union xfs_btree_rec *rec,
168 int ptr, int reason);
169
170
171 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
172 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
173
174
175 int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level);
176
177
178 void (*init_key_from_rec)(union xfs_btree_key *key,
179 union xfs_btree_rec *rec);
180 void (*init_rec_from_key)(union xfs_btree_key *key,
181 union xfs_btree_rec *rec);
182 void (*init_rec_from_cur)(struct xfs_btree_cur *cur,
183 union xfs_btree_rec *rec);
184 void (*init_ptr_from_cur)(struct xfs_btree_cur *cur,
185 union xfs_btree_ptr *ptr);
186
187
188 __int64_t (*key_diff)(struct xfs_btree_cur *cur,
189 union xfs_btree_key *key);
190
191 const struct xfs_buf_ops *buf_ops;
192
193#ifdef DEBUG
194
195 int (*keys_inorder)(struct xfs_btree_cur *cur,
196 union xfs_btree_key *k1,
197 union xfs_btree_key *k2);
198
199
200 int (*recs_inorder)(struct xfs_btree_cur *cur,
201 union xfs_btree_rec *r1,
202 union xfs_btree_rec *r2);
203#endif
204};
205
206
207
208
209#define LASTREC_UPDATE 0
210#define LASTREC_INSREC 1
211#define LASTREC_DELREC 2
212
213
214
215
216
217
218typedef struct xfs_btree_cur
219{
220 struct xfs_trans *bc_tp;
221 struct xfs_mount *bc_mp;
222 const struct xfs_btree_ops *bc_ops;
223 uint bc_flags;
224 union {
225 xfs_alloc_rec_incore_t a;
226 xfs_bmbt_irec_t b;
227 xfs_inobt_rec_incore_t i;
228 } bc_rec;
229 struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS];
230 int bc_ptrs[XFS_BTREE_MAXLEVELS];
231 __uint8_t bc_ra[XFS_BTREE_MAXLEVELS];
232#define XFS_BTCUR_LEFTRA 1
233#define XFS_BTCUR_RIGHTRA 2
234 __uint8_t bc_nlevels;
235 __uint8_t bc_blocklog;
236 xfs_btnum_t bc_btnum;
237 union {
238 struct {
239 struct xfs_buf *agbp;
240 xfs_agnumber_t agno;
241 } a;
242 struct {
243 struct xfs_inode *ip;
244 struct xfs_bmap_free *flist;
245 xfs_fsblock_t firstblock;
246 int allocated;
247 short forksize;
248 char whichfork;
249 char flags;
250#define XFS_BTCUR_BPRV_WASDEL 1
251 } b;
252 } bc_private;
253} xfs_btree_cur_t;
254
255
256#define XFS_BTREE_LONG_PTRS (1<<0)
257#define XFS_BTREE_ROOT_IN_INODE (1<<1)
258#define XFS_BTREE_LASTREC_UPDATE (1<<2)
259
260
261#define XFS_BTREE_NOERROR 0
262#define XFS_BTREE_ERROR 1
263
264
265
266
267#define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr))
268
269
270
271
272
273int
274xfs_btree_check_block(
275 struct xfs_btree_cur *cur,
276 struct xfs_btree_block *block,
277 int level,
278 struct xfs_buf *bp);
279
280
281
282
283int
284xfs_btree_check_lptr(
285 struct xfs_btree_cur *cur,
286 xfs_dfsbno_t ptr,
287 int level);
288
289
290
291
292void
293xfs_btree_del_cursor(
294 xfs_btree_cur_t *cur,
295 int error);
296
297
298
299
300
301int
302xfs_btree_dup_cursor(
303 xfs_btree_cur_t *cur,
304 xfs_btree_cur_t **ncur);
305
306
307
308
309
310struct xfs_buf *
311xfs_btree_get_bufl(
312 struct xfs_mount *mp,
313 struct xfs_trans *tp,
314 xfs_fsblock_t fsbno,
315 uint lock);
316
317
318
319
320
321struct xfs_buf *
322xfs_btree_get_bufs(
323 struct xfs_mount *mp,
324 struct xfs_trans *tp,
325 xfs_agnumber_t agno,
326 xfs_agblock_t agbno,
327 uint lock);
328
329
330
331
332int
333xfs_btree_islastblock(
334 xfs_btree_cur_t *cur,
335 int level);
336
337
338
339
340
341void
342xfs_btree_offsets(
343 __int64_t fields,
344 const short *offsets,
345 int nbits,
346 int *first,
347 int *last);
348
349
350
351
352
353int
354xfs_btree_read_bufl(
355 struct xfs_mount *mp,
356 struct xfs_trans *tp,
357 xfs_fsblock_t fsbno,
358 uint lock,
359 struct xfs_buf **bpp,
360 int refval,
361 const struct xfs_buf_ops *ops);
362
363
364
365
366
367void
368xfs_btree_reada_bufl(
369 struct xfs_mount *mp,
370 xfs_fsblock_t fsbno,
371 xfs_extlen_t count,
372 const struct xfs_buf_ops *ops);
373
374
375
376
377
378void
379xfs_btree_reada_bufs(
380 struct xfs_mount *mp,
381 xfs_agnumber_t agno,
382 xfs_agblock_t agbno,
383 xfs_extlen_t count,
384 const struct xfs_buf_ops *ops);
385
386
387
388
389void
390xfs_btree_init_block(
391 struct xfs_mount *mp,
392 struct xfs_buf *bp,
393 __u32 magic,
394 __u16 level,
395 __u16 numrecs,
396 unsigned int flags);
397
398
399
400
401int xfs_btree_increment(struct xfs_btree_cur *, int, int *);
402int xfs_btree_decrement(struct xfs_btree_cur *, int, int *);
403int xfs_btree_lookup(struct xfs_btree_cur *, xfs_lookup_t, int *);
404int xfs_btree_update(struct xfs_btree_cur *, union xfs_btree_rec *);
405int xfs_btree_new_iroot(struct xfs_btree_cur *, int *, int *);
406int xfs_btree_insert(struct xfs_btree_cur *, int *);
407int xfs_btree_delete(struct xfs_btree_cur *, int *);
408int xfs_btree_get_rec(struct xfs_btree_cur *, union xfs_btree_rec **, int *);
409
410
411
412
413void xfs_btree_log_block(struct xfs_btree_cur *, struct xfs_buf *, int);
414void xfs_btree_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int, int);
415
416
417
418
419static inline int xfs_btree_get_numrecs(struct xfs_btree_block *block)
420{
421 return be16_to_cpu(block->bb_numrecs);
422}
423
424static inline void xfs_btree_set_numrecs(struct xfs_btree_block *block,
425 __uint16_t numrecs)
426{
427 block->bb_numrecs = cpu_to_be16(numrecs);
428}
429
430static inline int xfs_btree_get_level(struct xfs_btree_block *block)
431{
432 return be16_to_cpu(block->bb_level);
433}
434
435
436
437
438
439#define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b))
440#define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b))
441#define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b))
442#define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b))
443#define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b))
444#define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b))
445#define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b))
446#define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b))
447
448#define XFS_FSB_SANITY_CHECK(mp,fsb) \
449 (XFS_FSB_TO_AGNO(mp, fsb) < mp->m_sb.sb_agcount && \
450 XFS_FSB_TO_AGBNO(mp, fsb) < mp->m_sb.sb_agblocks)
451
452
453
454
455
456
457
458
459
460
461
462#define XFS_BTREE_TRACE_ARGBI(c, b, i)
463#define XFS_BTREE_TRACE_ARGBII(c, b, i, j)
464#define XFS_BTREE_TRACE_ARGI(c, i)
465#define XFS_BTREE_TRACE_ARGIPK(c, i, p, s)
466#define XFS_BTREE_TRACE_ARGIPR(c, i, p, r)
467#define XFS_BTREE_TRACE_ARGIK(c, i, k)
468#define XFS_BTREE_TRACE_ARGR(c, r)
469#define XFS_BTREE_TRACE_CURSOR(c, t)
470
471#endif
472