Commit | Line | Data |
---|---|---|
0b61f8a4 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 | 2 | /* |
7b718769 NS |
3 | * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. |
4 | * All Rights Reserved. | |
1da177e4 LT |
5 | */ |
6 | #ifndef __XFS_BTREE_H__ | |
7 | #define __XFS_BTREE_H__ | |
8 | ||
9 | struct xfs_buf; | |
1da177e4 LT |
10 | struct xfs_inode; |
11 | struct xfs_mount; | |
12 | struct xfs_trans; | |
13 | ||
a8272ce0 DC |
14 | extern kmem_zone_t *xfs_btree_cur_zone; |
15 | ||
de227dd9 CH |
16 | /* |
17 | * Generic key, ptr and record wrapper structures. | |
18 | * | |
19 | * These are disk format structures, and are converted where necessary | |
20 | * by the btree specific code that needs to interpret them. | |
21 | */ | |
22 | union xfs_btree_ptr { | |
23 | __be32 s; /* short form ptr */ | |
24 | __be64 l; /* long form ptr */ | |
25 | }; | |
26 | ||
2c813ad6 | 27 | /* |
a1d46cff DW |
28 | * The in-core btree key. Overlapping btrees actually store two keys |
29 | * per pointer, so we reserve enough memory to hold both. The __*bigkey | |
30 | * items should never be accessed directly. | |
2c813ad6 | 31 | */ |
a1d46cff | 32 | union xfs_btree_key { |
2c813ad6 DW |
33 | struct xfs_bmbt_key bmbt; |
34 | xfs_bmdr_key_t bmbr; /* bmbt root block */ | |
35 | xfs_alloc_key_t alloc; | |
36 | struct xfs_inobt_key inobt; | |
a1d46cff DW |
37 | struct xfs_rmap_key rmap; |
38 | struct xfs_rmap_key __rmap_bigkey[2]; | |
1946b91c | 39 | struct xfs_refcount_key refc; |
2c813ad6 DW |
40 | }; |
41 | ||
de227dd9 | 42 | union xfs_btree_rec { |
035e00ac DW |
43 | struct xfs_bmbt_rec bmbt; |
44 | xfs_bmdr_rec_t bmbr; /* bmbt root block */ | |
45 | struct xfs_alloc_rec alloc; | |
46 | struct xfs_inobt_rec inobt; | |
47 | struct xfs_rmap_rec rmap; | |
1946b91c | 48 | struct xfs_refcount_rec refc; |
de227dd9 CH |
49 | }; |
50 | ||
a4fbe6ab DC |
51 | /* |
52 | * This nonsense is to make -wlint happy. | |
53 | */ | |
54 | #define XFS_LOOKUP_EQ ((xfs_lookup_t)XFS_LOOKUP_EQi) | |
55 | #define XFS_LOOKUP_LE ((xfs_lookup_t)XFS_LOOKUP_LEi) | |
56 | #define XFS_LOOKUP_GE ((xfs_lookup_t)XFS_LOOKUP_GEi) | |
57 | ||
58 | #define XFS_BTNUM_BNO ((xfs_btnum_t)XFS_BTNUM_BNOi) | |
59 | #define XFS_BTNUM_CNT ((xfs_btnum_t)XFS_BTNUM_CNTi) | |
60 | #define XFS_BTNUM_BMAP ((xfs_btnum_t)XFS_BTNUM_BMAPi) | |
61 | #define XFS_BTNUM_INO ((xfs_btnum_t)XFS_BTNUM_INOi) | |
aafc3c24 | 62 | #define XFS_BTNUM_FINO ((xfs_btnum_t)XFS_BTNUM_FINOi) |
b8704944 | 63 | #define XFS_BTNUM_RMAP ((xfs_btnum_t)XFS_BTNUM_RMAPi) |
46eeb521 | 64 | #define XFS_BTNUM_REFC ((xfs_btnum_t)XFS_BTNUM_REFCi) |
a4fbe6ab | 65 | |
c8ce540d | 66 | uint32_t xfs_btree_magic(int crc, xfs_btnum_t btnum); |
af7d20fd | 67 | |
1da177e4 LT |
68 | /* |
69 | * For logging record fields. | |
70 | */ | |
21b5c978 DC |
71 | #define XFS_BB_MAGIC (1 << 0) |
72 | #define XFS_BB_LEVEL (1 << 1) | |
73 | #define XFS_BB_NUMRECS (1 << 2) | |
74 | #define XFS_BB_LEFTSIB (1 << 3) | |
75 | #define XFS_BB_RIGHTSIB (1 << 4) | |
76 | #define XFS_BB_BLKNO (1 << 5) | |
77 | #define XFS_BB_LSN (1 << 6) | |
78 | #define XFS_BB_UUID (1 << 7) | |
79 | #define XFS_BB_OWNER (1 << 8) | |
1da177e4 LT |
80 | #define XFS_BB_NUM_BITS 5 |
81 | #define XFS_BB_ALL_BITS ((1 << XFS_BB_NUM_BITS) - 1) | |
21b5c978 | 82 | #define XFS_BB_NUM_BITS_CRC 9 |
ee1a47ab | 83 | #define XFS_BB_ALL_BITS_CRC ((1 << XFS_BB_NUM_BITS_CRC) - 1) |
1da177e4 | 84 | |
854929f0 DC |
85 | /* |
86 | * Generic stats interface | |
87 | */ | |
ff6d6af2 | 88 | #define XFS_BTREE_STATS_INC(cur, stat) \ |
11ef38af DC |
89 | XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat) |
90 | #define XFS_BTREE_STATS_ADD(cur, stat, val) \ | |
91 | XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val) | |
1da177e4 | 92 | |
df3954ff | 93 | #define XFS_BTREE_MAXLEVELS 9 /* max of all btrees */ |
1da177e4 | 94 | |
561f7d17 | 95 | struct xfs_btree_ops { |
65f1eaea CH |
96 | /* size of the key and record structures */ |
97 | size_t key_len; | |
98 | size_t rec_len; | |
99 | ||
561f7d17 CH |
100 | /* cursor operations */ |
101 | struct xfs_btree_cur *(*dup_cursor)(struct xfs_btree_cur *); | |
4b22a571 CH |
102 | void (*update_cursor)(struct xfs_btree_cur *src, |
103 | struct xfs_btree_cur *dst); | |
8c4ed633 | 104 | |
344207ce CH |
105 | /* update btree root pointer */ |
106 | void (*set_root)(struct xfs_btree_cur *cur, | |
c0e59e1a | 107 | union xfs_btree_ptr *nptr, int level_change); |
344207ce | 108 | |
f5eb8e7c CH |
109 | /* block allocation / freeing */ |
110 | int (*alloc_block)(struct xfs_btree_cur *cur, | |
111 | union xfs_btree_ptr *start_bno, | |
112 | union xfs_btree_ptr *new_bno, | |
6f8950cd | 113 | int *stat); |
d4b3a4b7 | 114 | int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp); |
f5eb8e7c | 115 | |
278d0ca1 CH |
116 | /* update last record information */ |
117 | void (*update_lastrec)(struct xfs_btree_cur *cur, | |
118 | struct xfs_btree_block *block, | |
119 | union xfs_btree_rec *rec, | |
120 | int ptr, int reason); | |
121 | ||
ce5e42db | 122 | /* records in block/level */ |
91cca5df | 123 | int (*get_minrecs)(struct xfs_btree_cur *cur, int level); |
ce5e42db CH |
124 | int (*get_maxrecs)(struct xfs_btree_cur *cur, int level); |
125 | ||
4b22a571 CH |
126 | /* records on disk. Matter for the root in inode case. */ |
127 | int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level); | |
128 | ||
fe033cc8 CH |
129 | /* init values of btree structures */ |
130 | void (*init_key_from_rec)(union xfs_btree_key *key, | |
131 | union xfs_btree_rec *rec); | |
4b22a571 CH |
132 | void (*init_rec_from_cur)(struct xfs_btree_cur *cur, |
133 | union xfs_btree_rec *rec); | |
fe033cc8 CH |
134 | void (*init_ptr_from_cur)(struct xfs_btree_cur *cur, |
135 | union xfs_btree_ptr *ptr); | |
2c813ad6 DW |
136 | void (*init_high_key_from_rec)(union xfs_btree_key *key, |
137 | union xfs_btree_rec *rec); | |
fe033cc8 CH |
138 | |
139 | /* difference between key value and cursor value */ | |
c8ce540d | 140 | int64_t (*key_diff)(struct xfs_btree_cur *cur, |
fe033cc8 CH |
141 | union xfs_btree_key *key); |
142 | ||
2c813ad6 DW |
143 | /* |
144 | * Difference between key2 and key1 -- positive if key1 > key2, | |
145 | * negative if key1 < key2, and zero if equal. | |
146 | */ | |
c8ce540d | 147 | int64_t (*diff_two_keys)(struct xfs_btree_cur *cur, |
2c813ad6 DW |
148 | union xfs_btree_key *key1, |
149 | union xfs_btree_key *key2); | |
150 | ||
1813dd64 | 151 | const struct xfs_buf_ops *buf_ops; |
b0f539de | 152 | |
4a26e66e CH |
153 | /* check that k1 is lower than k2 */ |
154 | int (*keys_inorder)(struct xfs_btree_cur *cur, | |
155 | union xfs_btree_key *k1, | |
156 | union xfs_btree_key *k2); | |
157 | ||
158 | /* check that r1 is lower than r2 */ | |
159 | int (*recs_inorder)(struct xfs_btree_cur *cur, | |
160 | union xfs_btree_rec *r1, | |
161 | union xfs_btree_rec *r2); | |
561f7d17 CH |
162 | }; |
163 | ||
278d0ca1 CH |
164 | /* |
165 | * Reasons for the update_lastrec method to be called. | |
166 | */ | |
167 | #define LASTREC_UPDATE 0 | |
4b22a571 | 168 | #define LASTREC_INSREC 1 |
91cca5df | 169 | #define LASTREC_DELREC 2 |
278d0ca1 CH |
170 | |
171 | ||
105f7d83 DW |
172 | union xfs_btree_irec { |
173 | struct xfs_alloc_rec_incore a; | |
174 | struct xfs_bmbt_irec b; | |
175 | struct xfs_inobt_rec_incore i; | |
4b8ed677 | 176 | struct xfs_rmap_irec r; |
1946b91c DW |
177 | struct xfs_refcount_irec rc; |
178 | }; | |
179 | ||
180 | /* Per-AG btree private information. */ | |
181 | union xfs_btree_cur_private { | |
182 | struct { | |
183 | unsigned long nr_ops; /* # record updates */ | |
184 | int shape_changes; /* # of extent splits */ | |
185 | } refc; | |
f6b428a4 BF |
186 | struct { |
187 | bool active; /* allocation cursor state */ | |
188 | } abt; | |
105f7d83 DW |
189 | }; |
190 | ||
1da177e4 LT |
191 | /* |
192 | * Btree cursor structure. | |
193 | * This collects all information needed by the btree code in one place. | |
194 | */ | |
195 | typedef struct xfs_btree_cur | |
196 | { | |
197 | struct xfs_trans *bc_tp; /* transaction we're in, if any */ | |
198 | struct xfs_mount *bc_mp; /* file system mount struct */ | |
561f7d17 | 199 | const struct xfs_btree_ops *bc_ops; |
8186e517 | 200 | uint bc_flags; /* btree features - below */ |
105f7d83 | 201 | union xfs_btree_irec bc_rec; /* current insert/search record value */ |
1da177e4 LT |
202 | struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */ |
203 | int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ | |
c8ce540d | 204 | uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */ |
1da177e4 LT |
205 | #define XFS_BTCUR_LEFTRA 1 /* left sibling has been read-ahead */ |
206 | #define XFS_BTCUR_RIGHTRA 2 /* right sibling has been read-ahead */ | |
c8ce540d DW |
207 | uint8_t bc_nlevels; /* number of levels in the tree */ |
208 | uint8_t bc_blocklog; /* log2(blocksize) of btree blocks */ | |
1da177e4 | 209 | xfs_btnum_t bc_btnum; /* identifies which btree type */ |
11ef38af | 210 | int bc_statoff; /* offset of btre stats array */ |
1da177e4 | 211 | union { |
169d6227 CH |
212 | struct { /* needed for BNO, CNT, INO */ |
213 | struct xfs_buf *agbp; /* agf/agi buffer pointer */ | |
1da177e4 | 214 | xfs_agnumber_t agno; /* ag number */ |
1946b91c | 215 | union xfs_btree_cur_private priv; |
1da177e4 LT |
216 | } a; |
217 | struct { /* needed for BMAP */ | |
218 | struct xfs_inode *ip; /* pointer to our inode */ | |
1da177e4 LT |
219 | int allocated; /* count of alloced */ |
220 | short forksize; /* fork's inode space */ | |
221 | char whichfork; /* data or attr fork */ | |
222 | char flags; /* flags */ | |
99c794c6 BF |
223 | #define XFS_BTCUR_BPRV_WASDEL (1<<0) /* was delayed */ |
224 | #define XFS_BTCUR_BPRV_INVALID_OWNER (1<<1) /* for ext swap */ | |
1da177e4 | 225 | } b; |
1da177e4 LT |
226 | } bc_private; /* per-btree type data */ |
227 | } xfs_btree_cur_t; | |
228 | ||
8186e517 | 229 | /* cursor flags */ |
e99ab90d | 230 | #define XFS_BTREE_LONG_PTRS (1<<0) /* pointers are 64bits long */ |
8186e517 | 231 | #define XFS_BTREE_ROOT_IN_INODE (1<<1) /* root may be variable size */ |
278d0ca1 | 232 | #define XFS_BTREE_LASTREC_UPDATE (1<<2) /* track last rec externally */ |
ee1a47ab | 233 | #define XFS_BTREE_CRC_BLOCKS (1<<3) /* uses extended btree blocks */ |
2c813ad6 | 234 | #define XFS_BTREE_OVERLAPPING (1<<4) /* overlapping intervals */ |
8186e517 CH |
235 | |
236 | ||
1da177e4 LT |
237 | #define XFS_BTREE_NOERROR 0 |
238 | #define XFS_BTREE_ERROR 1 | |
239 | ||
240 | /* | |
241 | * Convert from buffer to btree block header. | |
242 | */ | |
62926044 | 243 | #define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr)) |
1da177e4 | 244 | |
52c732ee DW |
245 | /* |
246 | * Internal long and short btree block checks. They return NULL if the | |
247 | * block is ok or the address of the failed check otherwise. | |
248 | */ | |
249 | xfs_failaddr_t __xfs_btree_check_lblock(struct xfs_btree_cur *cur, | |
250 | struct xfs_btree_block *block, int level, struct xfs_buf *bp); | |
251 | xfs_failaddr_t __xfs_btree_check_sblock(struct xfs_btree_cur *cur, | |
252 | struct xfs_btree_block *block, int level, struct xfs_buf *bp); | |
1da177e4 | 253 | |
1da177e4 | 254 | /* |
a23f6ef8 | 255 | * Check that block header is ok. |
1da177e4 | 256 | */ |
a23f6ef8 CH |
257 | int |
258 | xfs_btree_check_block( | |
259 | struct xfs_btree_cur *cur, /* btree cursor */ | |
260 | struct xfs_btree_block *block, /* generic btree block pointer */ | |
1da177e4 LT |
261 | int level, /* level of the btree block */ |
262 | struct xfs_buf *bp); /* buffer containing block, if any */ | |
263 | ||
264 | /* | |
a23f6ef8 | 265 | * Check that (long) pointer is ok. |
1da177e4 | 266 | */ |
f135761a | 267 | bool /* error (0 or EFSCORRUPTED) */ |
1da177e4 | 268 | xfs_btree_check_lptr( |
a23f6ef8 | 269 | struct xfs_btree_cur *cur, /* btree cursor */ |
f135761a DW |
270 | xfs_fsblock_t fsbno, /* btree block disk address */ |
271 | int level); /* btree block level */ | |
272 | ||
273 | /* | |
274 | * Check that (short) pointer is ok. | |
275 | */ | |
276 | bool /* error (0 or EFSCORRUPTED) */ | |
277 | xfs_btree_check_sptr( | |
278 | struct xfs_btree_cur *cur, /* btree cursor */ | |
279 | xfs_agblock_t agbno, /* btree block disk address */ | |
1da177e4 LT |
280 | int level); /* btree block level */ |
281 | ||
1da177e4 LT |
282 | /* |
283 | * Delete the btree cursor. | |
284 | */ | |
285 | void | |
286 | xfs_btree_del_cursor( | |
287 | xfs_btree_cur_t *cur, /* btree cursor */ | |
288 | int error); /* del because of error */ | |
289 | ||
290 | /* | |
291 | * Duplicate the btree cursor. | |
292 | * Allocate a new one, copy the record, re-get the buffers. | |
293 | */ | |
294 | int /* error */ | |
295 | xfs_btree_dup_cursor( | |
296 | xfs_btree_cur_t *cur, /* input cursor */ | |
297 | xfs_btree_cur_t **ncur);/* output cursor */ | |
298 | ||
1da177e4 LT |
299 | /* |
300 | * Get a buffer for the block, return it with no data read. | |
301 | * Long-form addressing. | |
302 | */ | |
303 | struct xfs_buf * /* buffer for fsbno */ | |
304 | xfs_btree_get_bufl( | |
305 | struct xfs_mount *mp, /* file system mount point */ | |
306 | struct xfs_trans *tp, /* transaction pointer */ | |
f5b999c0 | 307 | xfs_fsblock_t fsbno); /* file system block number */ |
1da177e4 LT |
308 | |
309 | /* | |
310 | * Get a buffer for the block, return it with no data read. | |
311 | * Short-form addressing. | |
312 | */ | |
313 | struct xfs_buf * /* buffer for agno/agbno */ | |
314 | xfs_btree_get_bufs( | |
315 | struct xfs_mount *mp, /* file system mount point */ | |
316 | struct xfs_trans *tp, /* transaction pointer */ | |
317 | xfs_agnumber_t agno, /* allocation group number */ | |
f5b999c0 | 318 | xfs_agblock_t agbno); /* allocation group block number */ |
1da177e4 | 319 | |
1da177e4 LT |
320 | /* |
321 | * Compute first and last byte offsets for the fields given. | |
322 | * Interprets the offsets table, which contains struct field offsets. | |
323 | */ | |
324 | void | |
325 | xfs_btree_offsets( | |
c8ce540d | 326 | int64_t fields, /* bitmask of fields */ |
1da177e4 LT |
327 | const short *offsets,/* table of field offsets */ |
328 | int nbits, /* number of bits to inspect */ | |
329 | int *first, /* output: first byte offset */ | |
330 | int *last); /* output: last byte offset */ | |
331 | ||
332 | /* | |
333 | * Get a buffer for the block, return it read in. | |
334 | * Long-form addressing. | |
335 | */ | |
336 | int /* error */ | |
337 | xfs_btree_read_bufl( | |
338 | struct xfs_mount *mp, /* file system mount point */ | |
339 | struct xfs_trans *tp, /* transaction pointer */ | |
340 | xfs_fsblock_t fsbno, /* file system block number */ | |
1da177e4 | 341 | struct xfs_buf **bpp, /* buffer for fsbno */ |
3d3e6f64 | 342 | int refval, /* ref count value for buffer */ |
1813dd64 | 343 | const struct xfs_buf_ops *ops); |
1da177e4 | 344 | |
1da177e4 LT |
345 | /* |
346 | * Read-ahead the block, don't wait for it, don't return a buffer. | |
347 | * Long-form addressing. | |
348 | */ | |
349 | void /* error */ | |
350 | xfs_btree_reada_bufl( | |
351 | struct xfs_mount *mp, /* file system mount point */ | |
352 | xfs_fsblock_t fsbno, /* file system block number */ | |
3d3e6f64 | 353 | xfs_extlen_t count, /* count of filesystem blocks */ |
1813dd64 | 354 | const struct xfs_buf_ops *ops); |
1da177e4 LT |
355 | |
356 | /* | |
357 | * Read-ahead the block, don't wait for it, don't return a buffer. | |
358 | * Short-form addressing. | |
359 | */ | |
360 | void /* error */ | |
361 | xfs_btree_reada_bufs( | |
362 | struct xfs_mount *mp, /* file system mount point */ | |
363 | xfs_agnumber_t agno, /* allocation group number */ | |
364 | xfs_agblock_t agbno, /* allocation group block number */ | |
3d3e6f64 | 365 | xfs_extlen_t count, /* count of filesystem blocks */ |
1813dd64 | 366 | const struct xfs_buf_ops *ops); |
1da177e4 | 367 | |
b64f3a39 DC |
368 | /* |
369 | * Initialise a new btree block header | |
370 | */ | |
371 | void | |
372 | xfs_btree_init_block( | |
373 | struct xfs_mount *mp, | |
374 | struct xfs_buf *bp, | |
b6f41e44 | 375 | xfs_btnum_t btnum, |
b64f3a39 DC |
376 | __u16 level, |
377 | __u16 numrecs, | |
f5b999c0 | 378 | __u64 owner); |
65f1eaea | 379 | |
ee1a47ab CH |
380 | void |
381 | xfs_btree_init_block_int( | |
382 | struct xfs_mount *mp, | |
383 | struct xfs_btree_block *buf, | |
384 | xfs_daddr_t blkno, | |
b6f41e44 | 385 | xfs_btnum_t btnum, |
ee1a47ab CH |
386 | __u16 level, |
387 | __u16 numrecs, | |
388 | __u64 owner, | |
389 | unsigned int flags); | |
390 | ||
637aa50f CH |
391 | /* |
392 | * Common btree core entry points. | |
393 | */ | |
394 | int xfs_btree_increment(struct xfs_btree_cur *, int, int *); | |
8df4da4a | 395 | int xfs_btree_decrement(struct xfs_btree_cur *, int, int *); |
fe033cc8 | 396 | int xfs_btree_lookup(struct xfs_btree_cur *, xfs_lookup_t, int *); |
278d0ca1 | 397 | int xfs_btree_update(struct xfs_btree_cur *, union xfs_btree_rec *); |
ea77b0a6 | 398 | int xfs_btree_new_iroot(struct xfs_btree_cur *, int *, int *); |
4b22a571 | 399 | int xfs_btree_insert(struct xfs_btree_cur *, int *); |
91cca5df | 400 | int xfs_btree_delete(struct xfs_btree_cur *, int *); |
8cc938fe | 401 | int xfs_btree_get_rec(struct xfs_btree_cur *, union xfs_btree_rec **, int *); |
c8ce540d | 402 | int xfs_btree_change_owner(struct xfs_btree_cur *cur, uint64_t new_owner, |
638f4416 | 403 | struct list_head *buffer_list); |
637aa50f | 404 | |
ee1a47ab CH |
405 | /* |
406 | * btree block CRC helpers | |
407 | */ | |
408 | void xfs_btree_lblock_calc_crc(struct xfs_buf *); | |
409 | bool xfs_btree_lblock_verify_crc(struct xfs_buf *); | |
410 | void xfs_btree_sblock_calc_crc(struct xfs_buf *); | |
411 | bool xfs_btree_sblock_verify_crc(struct xfs_buf *); | |
412 | ||
fd6bcc5b CH |
413 | /* |
414 | * Internal btree helpers also used by xfs_bmap.c. | |
415 | */ | |
416 | void xfs_btree_log_block(struct xfs_btree_cur *, struct xfs_buf *, int); | |
417 | void xfs_btree_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int, int); | |
418 | ||
65f1eaea CH |
419 | /* |
420 | * Helpers. | |
421 | */ | |
637aa50f CH |
422 | static inline int xfs_btree_get_numrecs(struct xfs_btree_block *block) |
423 | { | |
424 | return be16_to_cpu(block->bb_numrecs); | |
425 | } | |
426 | ||
9eaead51 | 427 | static inline void xfs_btree_set_numrecs(struct xfs_btree_block *block, |
c8ce540d | 428 | uint16_t numrecs) |
9eaead51 CH |
429 | { |
430 | block->bb_numrecs = cpu_to_be16(numrecs); | |
431 | } | |
432 | ||
65f1eaea CH |
433 | static inline int xfs_btree_get_level(struct xfs_btree_block *block) |
434 | { | |
435 | return be16_to_cpu(block->bb_level); | |
436 | } | |
437 | ||
1da177e4 LT |
438 | |
439 | /* | |
440 | * Min and max functions for extlen, agblock, fileoff, and filblks types. | |
441 | */ | |
54aa8e26 DC |
442 | #define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b)) |
443 | #define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b)) | |
444 | #define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b)) | |
445 | #define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b)) | |
446 | #define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b)) | |
447 | #define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b)) | |
448 | #define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b)) | |
449 | #define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b)) | |
a844f451 | 450 | |
a6a781a5 DW |
451 | xfs_failaddr_t xfs_btree_sblock_v5hdr_verify(struct xfs_buf *bp); |
452 | xfs_failaddr_t xfs_btree_sblock_verify(struct xfs_buf *bp, | |
453 | unsigned int max_recs); | |
454 | xfs_failaddr_t xfs_btree_lblock_v5hdr_verify(struct xfs_buf *bp, | |
455 | uint64_t owner); | |
456 | xfs_failaddr_t xfs_btree_lblock_verify(struct xfs_buf *bp, | |
457 | unsigned int max_recs); | |
8368a601 | 458 | |
a1f69417 | 459 | uint xfs_btree_compute_maxlevels(uint *limits, unsigned long len); |
14861c47 | 460 | unsigned long long xfs_btree_calc_size(uint *limits, unsigned long long len); |
c5ab131b | 461 | |
e7ee96df DW |
462 | /* |
463 | * Return codes for the query range iterator function are 0 to continue | |
464 | * iterating, and non-zero to stop iterating. Any non-zero value will be | |
465 | * passed up to the _query_range caller. The special value -ECANCELED can be | |
466 | * used to stop iteration, because _query_range never generates that error | |
467 | * code on its own. | |
468 | */ | |
105f7d83 DW |
469 | typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, |
470 | union xfs_btree_rec *rec, void *priv); | |
471 | ||
472 | int xfs_btree_query_range(struct xfs_btree_cur *cur, | |
473 | union xfs_btree_irec *low_rec, union xfs_btree_irec *high_rec, | |
474 | xfs_btree_query_range_fn fn, void *priv); | |
e9a2599a DW |
475 | int xfs_btree_query_all(struct xfs_btree_cur *cur, xfs_btree_query_range_fn fn, |
476 | void *priv); | |
105f7d83 | 477 | |
28a89567 DW |
478 | typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level, |
479 | void *data); | |
e992ae8a DW |
480 | /* Visit record blocks. */ |
481 | #define XFS_BTREE_VISIT_RECORDS (1 << 0) | |
482 | /* Visit leaf blocks. */ | |
483 | #define XFS_BTREE_VISIT_LEAVES (1 << 1) | |
484 | /* Visit all blocks. */ | |
485 | #define XFS_BTREE_VISIT_ALL (XFS_BTREE_VISIT_RECORDS | \ | |
486 | XFS_BTREE_VISIT_LEAVES) | |
28a89567 | 487 | int xfs_btree_visit_blocks(struct xfs_btree_cur *cur, |
e992ae8a | 488 | xfs_btree_visit_blocks_fn fn, unsigned int flags, void *data); |
28a89567 | 489 | |
c611cc03 DW |
490 | int xfs_btree_count_blocks(struct xfs_btree_cur *cur, xfs_extlen_t *blocks); |
491 | ||
26788097 DW |
492 | union xfs_btree_rec *xfs_btree_rec_addr(struct xfs_btree_cur *cur, int n, |
493 | struct xfs_btree_block *block); | |
494 | union xfs_btree_key *xfs_btree_key_addr(struct xfs_btree_cur *cur, int n, | |
495 | struct xfs_btree_block *block); | |
496 | union xfs_btree_key *xfs_btree_high_key_addr(struct xfs_btree_cur *cur, int n, | |
497 | struct xfs_btree_block *block); | |
498 | union xfs_btree_ptr *xfs_btree_ptr_addr(struct xfs_btree_cur *cur, int n, | |
499 | struct xfs_btree_block *block); | |
500 | int xfs_btree_lookup_get_block(struct xfs_btree_cur *cur, int level, | |
501 | union xfs_btree_ptr *pp, struct xfs_btree_block **blkp); | |
502 | struct xfs_btree_block *xfs_btree_get_block(struct xfs_btree_cur *cur, | |
503 | int level, struct xfs_buf **bpp); | |
cc3e0948 DW |
504 | bool xfs_btree_ptr_is_null(struct xfs_btree_cur *cur, union xfs_btree_ptr *ptr); |
505 | int64_t xfs_btree_diff_two_ptrs(struct xfs_btree_cur *cur, | |
506 | const union xfs_btree_ptr *a, | |
507 | const union xfs_btree_ptr *b); | |
508 | void xfs_btree_get_sibling(struct xfs_btree_cur *cur, | |
509 | struct xfs_btree_block *block, | |
510 | union xfs_btree_ptr *ptr, int lr); | |
2fdbec5c DW |
511 | void xfs_btree_get_keys(struct xfs_btree_cur *cur, |
512 | struct xfs_btree_block *block, union xfs_btree_key *key); | |
513 | union xfs_btree_key *xfs_btree_high_key_from_key(struct xfs_btree_cur *cur, | |
514 | union xfs_btree_key *key); | |
ce1d802e DW |
515 | int xfs_btree_has_record(struct xfs_btree_cur *cur, union xfs_btree_irec *low, |
516 | union xfs_btree_irec *high, bool *exists); | |
08daa3cc | 517 | bool xfs_btree_has_more_records(struct xfs_btree_cur *cur); |
26788097 | 518 | |
27d9ee57 DW |
519 | /* Does this cursor point to the last block in the given level? */ |
520 | static inline bool | |
521 | xfs_btree_islastblock( | |
522 | xfs_btree_cur_t *cur, | |
523 | int level) | |
524 | { | |
525 | struct xfs_btree_block *block; | |
526 | struct xfs_buf *bp; | |
527 | ||
528 | block = xfs_btree_get_block(cur, level, &bp); | |
529 | ASSERT(block && xfs_btree_check_block(cur, block, level, bp) == 0); | |
530 | ||
531 | if (cur->bc_flags & XFS_BTREE_LONG_PTRS) | |
532 | return block->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK); | |
533 | return block->bb_u.s.bb_rightsib == cpu_to_be32(NULLAGBLOCK); | |
534 | } | |
535 | ||
1da177e4 | 536 | #endif /* __XFS_BTREE_H__ */ |