]>
Commit | Line | Data |
---|---|---|
2bd0ea18 | 1 | /* |
f302e9e4 NS |
2 | * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
5000d01d | 4 | * |
f302e9e4 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 | |
2bd0ea18 | 7 | * published by the Free Software Foundation. |
5000d01d | 8 | * |
f302e9e4 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. | |
5000d01d | 13 | * |
f302e9e4 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 | |
2bd0ea18 NS |
17 | */ |
18 | #ifndef __XFS_BTREE_H__ | |
dfc130f3 | 19 | #define __XFS_BTREE_H__ |
2bd0ea18 NS |
20 | |
21 | struct xfs_buf; | |
6f530e9a | 22 | struct xfs_defer_ops; |
2bd0ea18 NS |
23 | struct xfs_inode; |
24 | struct xfs_mount; | |
25 | struct xfs_trans; | |
26 | ||
5e656dbb BN |
27 | extern kmem_zone_t *xfs_btree_cur_zone; |
28 | ||
ff105f75 DC |
29 | /* |
30 | * Generic key, ptr and record wrapper structures. | |
31 | * | |
32 | * These are disk format structures, and are converted where necessary | |
33 | * by the btree specific code that needs to interpret them. | |
34 | */ | |
35 | union xfs_btree_ptr { | |
36 | __be32 s; /* short form ptr */ | |
37 | __be64 l; /* long form ptr */ | |
38 | }; | |
39 | ||
40 | union xfs_btree_key { | |
41 | xfs_bmbt_key_t bmbt; | |
42 | xfs_bmdr_key_t bmbr; /* bmbt root block */ | |
43 | xfs_alloc_key_t alloc; | |
44 | xfs_inobt_key_t inobt; | |
45 | }; | |
46 | ||
13e831e0 DW |
47 | /* |
48 | * In-core key that holds both low and high keys for overlapped btrees. | |
49 | * The two keys are packed next to each other on disk, so do the same | |
50 | * in memory. Preserve the existing xfs_btree_key as a single key to | |
51 | * avoid the mental model breakage that would happen if we passed a | |
52 | * bigkey into a function that operates on a single key. | |
53 | */ | |
54 | union xfs_btree_bigkey { | |
55 | struct xfs_bmbt_key bmbt; | |
56 | xfs_bmdr_key_t bmbr; /* bmbt root block */ | |
57 | xfs_alloc_key_t alloc; | |
58 | struct xfs_inobt_key inobt; | |
59 | }; | |
60 | ||
ff105f75 DC |
61 | union xfs_btree_rec { |
62 | xfs_bmbt_rec_t bmbt; | |
63 | xfs_bmdr_rec_t bmbr; /* bmbt root block */ | |
64 | xfs_alloc_rec_t alloc; | |
65 | xfs_inobt_rec_t inobt; | |
66 | }; | |
67 | ||
2bd0ea18 NS |
68 | /* |
69 | * This nonsense is to make -wlint happy. | |
70 | */ | |
dfc130f3 RC |
71 | #define XFS_LOOKUP_EQ ((xfs_lookup_t)XFS_LOOKUP_EQi) |
72 | #define XFS_LOOKUP_LE ((xfs_lookup_t)XFS_LOOKUP_LEi) | |
73 | #define XFS_LOOKUP_GE ((xfs_lookup_t)XFS_LOOKUP_GEi) | |
2bd0ea18 | 74 | |
dfc130f3 RC |
75 | #define XFS_BTNUM_BNO ((xfs_btnum_t)XFS_BTNUM_BNOi) |
76 | #define XFS_BTNUM_CNT ((xfs_btnum_t)XFS_BTNUM_CNTi) | |
77 | #define XFS_BTNUM_BMAP ((xfs_btnum_t)XFS_BTNUM_BMAPi) | |
78 | #define XFS_BTNUM_INO ((xfs_btnum_t)XFS_BTNUM_INOi) | |
c0a4c227 | 79 | #define XFS_BTNUM_FINO ((xfs_btnum_t)XFS_BTNUM_FINOi) |
2bd0ea18 | 80 | |
2bd0ea18 NS |
81 | /* |
82 | * For logging record fields. | |
83 | */ | |
9c6ebc42 DC |
84 | #define XFS_BB_MAGIC (1 << 0) |
85 | #define XFS_BB_LEVEL (1 << 1) | |
86 | #define XFS_BB_NUMRECS (1 << 2) | |
87 | #define XFS_BB_LEFTSIB (1 << 3) | |
88 | #define XFS_BB_RIGHTSIB (1 << 4) | |
89 | #define XFS_BB_BLKNO (1 << 5) | |
90 | #define XFS_BB_LSN (1 << 6) | |
91 | #define XFS_BB_UUID (1 << 7) | |
92 | #define XFS_BB_OWNER (1 << 8) | |
dfc130f3 RC |
93 | #define XFS_BB_NUM_BITS 5 |
94 | #define XFS_BB_ALL_BITS ((1 << XFS_BB_NUM_BITS) - 1) | |
9c6ebc42 | 95 | #define XFS_BB_NUM_BITS_CRC 9 |
5dfa5cd2 | 96 | #define XFS_BB_ALL_BITS_CRC ((1 << XFS_BB_NUM_BITS_CRC) - 1) |
2bd0ea18 | 97 | |
b194c7d8 BN |
98 | /* |
99 | * Generic stats interface | |
100 | */ | |
79896434 BD |
101 | #define __XFS_BTREE_STATS_INC(mp, type, stat) \ |
102 | XFS_STATS_INC(mp, xs_ ## type ## _2_ ## stat) | |
103 | #define XFS_BTREE_STATS_INC(cur, stat) \ | |
b194c7d8 | 104 | do { \ |
79896434 | 105 | struct xfs_mount *__mp = cur->bc_mp; \ |
b194c7d8 | 106 | switch (cur->bc_btnum) { \ |
79896434 BD |
107 | case XFS_BTNUM_BNO: __XFS_BTREE_STATS_INC(__mp, abtb, stat); break; \ |
108 | case XFS_BTNUM_CNT: __XFS_BTREE_STATS_INC(__mp, abtc, stat); break; \ | |
109 | case XFS_BTNUM_BMAP: __XFS_BTREE_STATS_INC(__mp, bmbt, stat); break; \ | |
110 | case XFS_BTNUM_INO: __XFS_BTREE_STATS_INC(__mp, ibt, stat); break; \ | |
111 | case XFS_BTNUM_FINO: __XFS_BTREE_STATS_INC(__mp, fibt, stat); break; \ | |
112 | case XFS_BTNUM_MAX: ASSERT(0); __mp = __mp /* fucking gcc */ ; break; \ | |
b194c7d8 BN |
113 | } \ |
114 | } while (0) | |
115 | ||
79896434 BD |
116 | #define __XFS_BTREE_STATS_ADD(mp, type, stat, val) \ |
117 | XFS_STATS_ADD(mp, xs_ ## type ## _2_ ## stat, val) | |
b194c7d8 BN |
118 | #define XFS_BTREE_STATS_ADD(cur, stat, val) \ |
119 | do { \ | |
79896434 | 120 | struct xfs_mount *__mp = cur->bc_mp; \ |
b194c7d8 | 121 | switch (cur->bc_btnum) { \ |
79896434 BD |
122 | case XFS_BTNUM_BNO: \ |
123 | __XFS_BTREE_STATS_ADD(__mp, abtb, stat, val); break; \ | |
124 | case XFS_BTNUM_CNT: \ | |
125 | __XFS_BTREE_STATS_ADD(__mp, abtc, stat, val); break; \ | |
126 | case XFS_BTNUM_BMAP: \ | |
127 | __XFS_BTREE_STATS_ADD(__mp, bmbt, stat, val); break; \ | |
128 | case XFS_BTNUM_INO: \ | |
129 | __XFS_BTREE_STATS_ADD(__mp, ibt, stat, val); break; \ | |
130 | case XFS_BTNUM_FINO: \ | |
131 | __XFS_BTREE_STATS_ADD(__mp, fibt, stat, val); break; \ | |
132 | case XFS_BTNUM_MAX: ASSERT(0); __mp = __mp /* fucking gcc */ ; break; \ | |
b194c7d8 BN |
133 | } \ |
134 | } while (0) | |
2bd0ea18 | 135 | |
dfc130f3 | 136 | #define XFS_BTREE_MAXLEVELS 8 /* max of all btrees */ |
2bd0ea18 | 137 | |
b194c7d8 BN |
138 | struct xfs_btree_ops { |
139 | /* size of the key and record structures */ | |
140 | size_t key_len; | |
141 | size_t rec_len; | |
142 | ||
143 | /* cursor operations */ | |
144 | struct xfs_btree_cur *(*dup_cursor)(struct xfs_btree_cur *); | |
145 | void (*update_cursor)(struct xfs_btree_cur *src, | |
146 | struct xfs_btree_cur *dst); | |
147 | ||
148 | /* update btree root pointer */ | |
149 | void (*set_root)(struct xfs_btree_cur *cur, | |
56b2de80 | 150 | union xfs_btree_ptr *nptr, int level_change); |
b194c7d8 BN |
151 | |
152 | /* block allocation / freeing */ | |
153 | int (*alloc_block)(struct xfs_btree_cur *cur, | |
154 | union xfs_btree_ptr *start_bno, | |
155 | union xfs_btree_ptr *new_bno, | |
ff105f75 | 156 | int *stat); |
b194c7d8 BN |
157 | int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp); |
158 | ||
159 | /* update last record information */ | |
160 | void (*update_lastrec)(struct xfs_btree_cur *cur, | |
161 | struct xfs_btree_block *block, | |
162 | union xfs_btree_rec *rec, | |
163 | int ptr, int reason); | |
164 | ||
165 | /* records in block/level */ | |
166 | int (*get_minrecs)(struct xfs_btree_cur *cur, int level); | |
167 | int (*get_maxrecs)(struct xfs_btree_cur *cur, int level); | |
168 | ||
169 | /* records on disk. Matter for the root in inode case. */ | |
170 | int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level); | |
171 | ||
172 | /* init values of btree structures */ | |
173 | void (*init_key_from_rec)(union xfs_btree_key *key, | |
174 | union xfs_btree_rec *rec); | |
b194c7d8 BN |
175 | void (*init_rec_from_cur)(struct xfs_btree_cur *cur, |
176 | union xfs_btree_rec *rec); | |
177 | void (*init_ptr_from_cur)(struct xfs_btree_cur *cur, | |
178 | union xfs_btree_ptr *ptr); | |
13e831e0 DW |
179 | void (*init_high_key_from_rec)(union xfs_btree_key *key, |
180 | union xfs_btree_rec *rec); | |
b194c7d8 BN |
181 | |
182 | /* difference between key value and cursor value */ | |
183 | __int64_t (*key_diff)(struct xfs_btree_cur *cur, | |
184 | union xfs_btree_key *key); | |
185 | ||
13e831e0 DW |
186 | /* |
187 | * Difference between key2 and key1 -- positive if key1 > key2, | |
188 | * negative if key1 < key2, and zero if equal. | |
189 | */ | |
190 | __int64_t (*diff_two_keys)(struct xfs_btree_cur *cur, | |
191 | union xfs_btree_key *key1, | |
192 | union xfs_btree_key *key2); | |
193 | ||
a2ceac1f DC |
194 | const struct xfs_buf_ops *buf_ops; |
195 | ||
79737cd9 | 196 | #if defined(DEBUG) || defined(XFS_WARN) |
b194c7d8 BN |
197 | /* check that k1 is lower than k2 */ |
198 | int (*keys_inorder)(struct xfs_btree_cur *cur, | |
199 | union xfs_btree_key *k1, | |
200 | union xfs_btree_key *k2); | |
201 | ||
202 | /* check that r1 is lower than r2 */ | |
203 | int (*recs_inorder)(struct xfs_btree_cur *cur, | |
204 | union xfs_btree_rec *r1, | |
205 | union xfs_btree_rec *r2); | |
206 | #endif | |
a3c9cb10 DW |
207 | |
208 | /* derive the low & high keys from the records in a leaf block */ | |
209 | void (*get_leaf_keys)(struct xfs_btree_cur *cur, | |
210 | struct xfs_btree_block *block, | |
211 | union xfs_btree_key *key); | |
212 | ||
213 | /* derive the low & high keys from the keys in a node block */ | |
214 | void (*get_node_keys)(struct xfs_btree_cur *cur, | |
215 | struct xfs_btree_block *block, | |
216 | union xfs_btree_key *key); | |
217 | ||
218 | /* update the parent keys of given btree level */ | |
219 | int (*update_keys)(struct xfs_btree_cur *cur, int level); | |
b194c7d8 BN |
220 | }; |
221 | ||
222 | /* | |
223 | * Reasons for the update_lastrec method to be called. | |
224 | */ | |
225 | #define LASTREC_UPDATE 0 | |
226 | #define LASTREC_INSREC 1 | |
227 | #define LASTREC_DELREC 2 | |
228 | ||
229 | ||
5d3b7fe1 DW |
230 | union xfs_btree_irec { |
231 | struct xfs_alloc_rec_incore a; | |
232 | struct xfs_bmbt_irec b; | |
233 | struct xfs_inobt_rec_incore i; | |
234 | }; | |
235 | ||
2bd0ea18 NS |
236 | /* |
237 | * Btree cursor structure. | |
238 | * This collects all information needed by the btree code in one place. | |
239 | */ | |
240 | typedef struct xfs_btree_cur | |
241 | { | |
dfc130f3 RC |
242 | struct xfs_trans *bc_tp; /* transaction we're in, if any */ |
243 | struct xfs_mount *bc_mp; /* file system mount struct */ | |
b194c7d8 BN |
244 | const struct xfs_btree_ops *bc_ops; |
245 | uint bc_flags; /* btree features - below */ | |
5d3b7fe1 | 246 | union xfs_btree_irec bc_rec; /* current insert/search record value */ |
2bd0ea18 NS |
247 | struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */ |
248 | int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ | |
249 | __uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */ | |
dfc130f3 RC |
250 | #define XFS_BTCUR_LEFTRA 1 /* left sibling has been read-ahead */ |
251 | #define XFS_BTCUR_RIGHTRA 2 /* right sibling has been read-ahead */ | |
2bd0ea18 NS |
252 | __uint8_t bc_nlevels; /* number of levels in the tree */ |
253 | __uint8_t bc_blocklog; /* log2(blocksize) of btree blocks */ | |
254 | xfs_btnum_t bc_btnum; /* identifies which btree type */ | |
255 | union { | |
5e656dbb BN |
256 | struct { /* needed for BNO, CNT, INO */ |
257 | struct xfs_buf *agbp; /* agf/agi buffer pointer */ | |
f33cea1a | 258 | struct xfs_defer_ops *dfops; /* deferred updates */ |
2bd0ea18 NS |
259 | xfs_agnumber_t agno; /* ag number */ |
260 | } a; | |
261 | struct { /* needed for BMAP */ | |
262 | struct xfs_inode *ip; /* pointer to our inode */ | |
f33cea1a | 263 | struct xfs_defer_ops *dfops; /* deferred updates */ |
2bd0ea18 NS |
264 | xfs_fsblock_t firstblock; /* 1st blk allocated */ |
265 | int allocated; /* count of alloced */ | |
266 | short forksize; /* fork's inode space */ | |
267 | char whichfork; /* data or attr fork */ | |
268 | char flags; /* flags */ | |
dfc130f3 | 269 | #define XFS_BTCUR_BPRV_WASDEL 1 /* was delayed */ |
2bd0ea18 | 270 | } b; |
2bd0ea18 NS |
271 | } bc_private; /* per-btree type data */ |
272 | } xfs_btree_cur_t; | |
273 | ||
b194c7d8 BN |
274 | /* cursor flags */ |
275 | #define XFS_BTREE_LONG_PTRS (1<<0) /* pointers are 64bits long */ | |
276 | #define XFS_BTREE_ROOT_IN_INODE (1<<1) /* root may be variable size */ | |
277 | #define XFS_BTREE_LASTREC_UPDATE (1<<2) /* track last rec externally */ | |
5dfa5cd2 | 278 | #define XFS_BTREE_CRC_BLOCKS (1<<3) /* uses extended btree blocks */ |
13e831e0 | 279 | #define XFS_BTREE_OVERLAPPING (1<<4) /* overlapping intervals */ |
b194c7d8 BN |
280 | |
281 | ||
dfc130f3 RC |
282 | #define XFS_BTREE_NOERROR 0 |
283 | #define XFS_BTREE_ERROR 1 | |
2bd0ea18 NS |
284 | |
285 | /* | |
286 | * Convert from buffer to btree block header. | |
287 | */ | |
a2ceac1f | 288 | #define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr)) |
f302e9e4 | 289 | |
2bd0ea18 | 290 | |
2bd0ea18 | 291 | /* |
b194c7d8 | 292 | * Check that block header is ok. |
2bd0ea18 | 293 | */ |
b194c7d8 BN |
294 | int |
295 | xfs_btree_check_block( | |
296 | struct xfs_btree_cur *cur, /* btree cursor */ | |
297 | struct xfs_btree_block *block, /* generic btree block pointer */ | |
2bd0ea18 NS |
298 | int level, /* level of the btree block */ |
299 | struct xfs_buf *bp); /* buffer containing block, if any */ | |
300 | ||
301 | /* | |
b194c7d8 | 302 | * Check that (long) pointer is ok. |
2bd0ea18 NS |
303 | */ |
304 | int /* error (0 or EFSCORRUPTED) */ | |
305 | xfs_btree_check_lptr( | |
b194c7d8 | 306 | struct xfs_btree_cur *cur, /* btree cursor */ |
5a35bf2c | 307 | xfs_fsblock_t ptr, /* btree block disk address */ |
dfc130f3 | 308 | int level); /* btree block level */ |
2bd0ea18 | 309 | |
2bd0ea18 NS |
310 | /* |
311 | * Delete the btree cursor. | |
312 | */ | |
313 | void | |
314 | xfs_btree_del_cursor( | |
315 | xfs_btree_cur_t *cur, /* btree cursor */ | |
dfc130f3 | 316 | int error); /* del because of error */ |
2bd0ea18 NS |
317 | |
318 | /* | |
319 | * Duplicate the btree cursor. | |
320 | * Allocate a new one, copy the record, re-get the buffers. | |
321 | */ | |
322 | int /* error */ | |
323 | xfs_btree_dup_cursor( | |
324 | xfs_btree_cur_t *cur, /* input cursor */ | |
325 | xfs_btree_cur_t **ncur);/* output cursor */ | |
326 | ||
2bd0ea18 NS |
327 | /* |
328 | * Get a buffer for the block, return it with no data read. | |
329 | * Long-form addressing. | |
330 | */ | |
331 | struct xfs_buf * /* buffer for fsbno */ | |
332 | xfs_btree_get_bufl( | |
333 | struct xfs_mount *mp, /* file system mount point */ | |
334 | struct xfs_trans *tp, /* transaction pointer */ | |
335 | xfs_fsblock_t fsbno, /* file system block number */ | |
336 | uint lock); /* lock flags for get_buf */ | |
337 | ||
338 | /* | |
339 | * Get a buffer for the block, return it with no data read. | |
340 | * Short-form addressing. | |
341 | */ | |
342 | struct xfs_buf * /* buffer for agno/agbno */ | |
343 | xfs_btree_get_bufs( | |
344 | struct xfs_mount *mp, /* file system mount point */ | |
345 | struct xfs_trans *tp, /* transaction pointer */ | |
346 | xfs_agnumber_t agno, /* allocation group number */ | |
347 | xfs_agblock_t agbno, /* allocation group block number */ | |
348 | uint lock); /* lock flags for get_buf */ | |
349 | ||
2bd0ea18 NS |
350 | /* |
351 | * Check for the cursor referring to the last block at the given level. | |
352 | */ | |
353 | int /* 1=is last block, 0=not last block */ | |
354 | xfs_btree_islastblock( | |
355 | xfs_btree_cur_t *cur, /* btree cursor */ | |
dfc130f3 | 356 | int level); /* level to check */ |
2bd0ea18 | 357 | |
2bd0ea18 NS |
358 | /* |
359 | * Compute first and last byte offsets for the fields given. | |
360 | * Interprets the offsets table, which contains struct field offsets. | |
361 | */ | |
362 | void | |
363 | xfs_btree_offsets( | |
dfc130f3 | 364 | __int64_t fields, /* bitmask of fields */ |
2bd0ea18 NS |
365 | const short *offsets,/* table of field offsets */ |
366 | int nbits, /* number of bits to inspect */ | |
dfc130f3 RC |
367 | int *first, /* output: first byte offset */ |
368 | int *last); /* output: last byte offset */ | |
2bd0ea18 NS |
369 | |
370 | /* | |
371 | * Get a buffer for the block, return it read in. | |
372 | * Long-form addressing. | |
373 | */ | |
374 | int /* error */ | |
375 | xfs_btree_read_bufl( | |
376 | struct xfs_mount *mp, /* file system mount point */ | |
377 | struct xfs_trans *tp, /* transaction pointer */ | |
378 | xfs_fsblock_t fsbno, /* file system block number */ | |
379 | uint lock, /* lock flags for read_buf */ | |
380 | struct xfs_buf **bpp, /* buffer for fsbno */ | |
a2ceac1f DC |
381 | int refval, /* ref count value for buffer */ |
382 | const struct xfs_buf_ops *ops); | |
2bd0ea18 | 383 | |
2bd0ea18 NS |
384 | /* |
385 | * Read-ahead the block, don't wait for it, don't return a buffer. | |
386 | * Long-form addressing. | |
387 | */ | |
388 | void /* error */ | |
389 | xfs_btree_reada_bufl( | |
390 | struct xfs_mount *mp, /* file system mount point */ | |
391 | xfs_fsblock_t fsbno, /* file system block number */ | |
a2ceac1f DC |
392 | xfs_extlen_t count, /* count of filesystem blocks */ |
393 | const struct xfs_buf_ops *ops); | |
2bd0ea18 NS |
394 | |
395 | /* | |
396 | * Read-ahead the block, don't wait for it, don't return a buffer. | |
397 | * Short-form addressing. | |
398 | */ | |
399 | void /* error */ | |
400 | xfs_btree_reada_bufs( | |
401 | struct xfs_mount *mp, /* file system mount point */ | |
402 | xfs_agnumber_t agno, /* allocation group number */ | |
403 | xfs_agblock_t agbno, /* allocation group block number */ | |
a2ceac1f DC |
404 | xfs_extlen_t count, /* count of filesystem blocks */ |
405 | const struct xfs_buf_ops *ops); | |
2bd0ea18 | 406 | |
a2ceac1f DC |
407 | /* |
408 | * Initialise a new btree block header | |
409 | */ | |
410 | void | |
411 | xfs_btree_init_block( | |
412 | struct xfs_mount *mp, | |
413 | struct xfs_buf *bp, | |
414 | __u32 magic, | |
415 | __u16 level, | |
416 | __u16 numrecs, | |
5dfa5cd2 | 417 | __u64 owner, |
a2ceac1f | 418 | unsigned int flags); |
60ca9704 | 419 | |
5dfa5cd2 DC |
420 | void |
421 | xfs_btree_init_block_int( | |
422 | struct xfs_mount *mp, | |
423 | struct xfs_btree_block *buf, | |
424 | xfs_daddr_t blkno, | |
425 | __u32 magic, | |
426 | __u16 level, | |
427 | __u16 numrecs, | |
428 | __u64 owner, | |
429 | unsigned int flags); | |
430 | ||
b194c7d8 BN |
431 | /* |
432 | * Common btree core entry points. | |
433 | */ | |
434 | int xfs_btree_increment(struct xfs_btree_cur *, int, int *); | |
435 | int xfs_btree_decrement(struct xfs_btree_cur *, int, int *); | |
436 | int xfs_btree_lookup(struct xfs_btree_cur *, xfs_lookup_t, int *); | |
437 | int xfs_btree_update(struct xfs_btree_cur *, union xfs_btree_rec *); | |
438 | int xfs_btree_new_iroot(struct xfs_btree_cur *, int *, int *); | |
b194c7d8 BN |
439 | int xfs_btree_insert(struct xfs_btree_cur *, int *); |
440 | int xfs_btree_delete(struct xfs_btree_cur *, int *); | |
441 | int xfs_btree_get_rec(struct xfs_btree_cur *, union xfs_btree_rec **, int *); | |
9c6ebc42 DC |
442 | int xfs_btree_change_owner(struct xfs_btree_cur *cur, __uint64_t new_owner, |
443 | struct list_head *buffer_list); | |
60ca9704 | 444 | |
5dfa5cd2 DC |
445 | /* |
446 | * btree block CRC helpers | |
447 | */ | |
448 | void xfs_btree_lblock_calc_crc(struct xfs_buf *); | |
449 | bool xfs_btree_lblock_verify_crc(struct xfs_buf *); | |
450 | void xfs_btree_sblock_calc_crc(struct xfs_buf *); | |
451 | bool xfs_btree_sblock_verify_crc(struct xfs_buf *); | |
452 | ||
b194c7d8 BN |
453 | /* |
454 | * Internal btree helpers also used by xfs_bmap.c. | |
455 | */ | |
456 | void xfs_btree_log_block(struct xfs_btree_cur *, struct xfs_buf *, int); | |
457 | void xfs_btree_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int, int); | |
60ca9704 | 458 | |
2bd0ea18 | 459 | /* |
b194c7d8 | 460 | * Helpers. |
2bd0ea18 | 461 | */ |
b194c7d8 BN |
462 | static inline int xfs_btree_get_numrecs(struct xfs_btree_block *block) |
463 | { | |
464 | return be16_to_cpu(block->bb_numrecs); | |
465 | } | |
466 | ||
467 | static inline void xfs_btree_set_numrecs(struct xfs_btree_block *block, | |
468 | __uint16_t numrecs) | |
469 | { | |
470 | block->bb_numrecs = cpu_to_be16(numrecs); | |
471 | } | |
472 | ||
473 | static inline int xfs_btree_get_level(struct xfs_btree_block *block) | |
474 | { | |
475 | return be16_to_cpu(block->bb_level); | |
476 | } | |
2bd0ea18 | 477 | |
2bd0ea18 NS |
478 | |
479 | /* | |
480 | * Min and max functions for extlen, agblock, fileoff, and filblks types. | |
481 | */ | |
5e656dbb BN |
482 | #define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b)) |
483 | #define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b)) | |
484 | #define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b)) | |
485 | #define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b)) | |
486 | #define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b)) | |
487 | #define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b)) | |
488 | #define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b)) | |
489 | #define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b)) | |
f302e9e4 | 490 | |
dfc130f3 | 491 | #define XFS_FSB_SANITY_CHECK(mp,fsb) \ |
2bd0ea18 | 492 | (XFS_FSB_TO_AGNO(mp, fsb) < mp->m_sb.sb_agcount && \ |
f302e9e4 | 493 | XFS_FSB_TO_AGBNO(mp, fsb) < mp->m_sb.sb_agblocks) |
2bd0ea18 | 494 | |
ff105f75 DC |
495 | /* |
496 | * Trace hooks. Currently not implemented as they need to be ported | |
497 | * over to the generic tracing functionality, which is some effort. | |
498 | * | |
499 | * i,j = integer (32 bit) | |
500 | * b = btree block buffer (xfs_buf_t) | |
501 | * p = btree ptr | |
502 | * r = btree record | |
503 | * k = btree key | |
504 | */ | |
505 | #define XFS_BTREE_TRACE_ARGBI(c, b, i) | |
506 | #define XFS_BTREE_TRACE_ARGBII(c, b, i, j) | |
507 | #define XFS_BTREE_TRACE_ARGI(c, i) | |
508 | #define XFS_BTREE_TRACE_ARGIPK(c, i, p, s) | |
509 | #define XFS_BTREE_TRACE_ARGIPR(c, i, p, r) | |
510 | #define XFS_BTREE_TRACE_ARGIK(c, i, k) | |
511 | #define XFS_BTREE_TRACE_ARGR(c, r) | |
512 | #define XFS_BTREE_TRACE_CURSOR(c, t) | |
513 | ||
dbca0167 DW |
514 | bool xfs_btree_sblock_v5hdr_verify(struct xfs_buf *bp); |
515 | bool xfs_btree_sblock_verify(struct xfs_buf *bp, unsigned int max_recs); | |
730e2a19 DW |
516 | uint xfs_btree_compute_maxlevels(struct xfs_mount *mp, uint *limits, |
517 | unsigned long len); | |
dbca0167 | 518 | |
a3c9cb10 DW |
519 | void xfs_btree_get_leaf_keys(struct xfs_btree_cur *cur, |
520 | struct xfs_btree_block *block, union xfs_btree_key *key); | |
521 | void xfs_btree_get_node_keys(struct xfs_btree_cur *cur, | |
522 | struct xfs_btree_block *block, union xfs_btree_key *key); | |
523 | int xfs_btree_update_keys(struct xfs_btree_cur *cur, int level); | |
13e831e0 DW |
524 | void xfs_btree_get_leaf_keys_overlapped(struct xfs_btree_cur *cur, |
525 | struct xfs_btree_block *block, union xfs_btree_key *key); | |
526 | void xfs_btree_get_node_keys_overlapped(struct xfs_btree_cur *cur, | |
527 | struct xfs_btree_block *block, union xfs_btree_key *key); | |
528 | int xfs_btree_update_keys_overlapped(struct xfs_btree_cur *cur, int level); | |
a3c9cb10 | 529 | |
5d3b7fe1 DW |
530 | /* return codes */ |
531 | #define XFS_BTREE_QUERY_RANGE_CONTINUE 0 /* keep iterating */ | |
532 | #define XFS_BTREE_QUERY_RANGE_ABORT 1 /* stop iterating */ | |
533 | typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, | |
534 | union xfs_btree_rec *rec, void *priv); | |
535 | ||
536 | int xfs_btree_query_range(struct xfs_btree_cur *cur, | |
537 | union xfs_btree_irec *low_rec, union xfs_btree_irec *high_rec, | |
538 | xfs_btree_query_range_fn fn, void *priv); | |
539 | ||
f31736bf DW |
540 | typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level, |
541 | void *data); | |
542 | int xfs_btree_visit_blocks(struct xfs_btree_cur *cur, | |
543 | xfs_btree_visit_blocks_fn fn, void *data); | |
544 | ||
2bd0ea18 | 545 | #endif /* __XFS_BTREE_H__ */ |