Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000,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 LT |
17 | */ |
18 | #ifndef __XFS_IALLOC_BTREE_H__ | |
19 | #define __XFS_IALLOC_BTREE_H__ | |
20 | ||
21 | /* | |
22 | * Inode map on-disk structures | |
23 | */ | |
24 | ||
25 | struct xfs_buf; | |
26 | struct xfs_btree_cur; | |
27 | struct xfs_btree_sblock; | |
28 | struct xfs_mount; | |
29 | ||
30 | /* | |
31 | * There is a btree for the inode map per allocation group. | |
32 | */ | |
33 | #define XFS_IBT_MAGIC 0x49414254 /* 'IABT' */ | |
34 | ||
35 | typedef __uint64_t xfs_inofree_t; | |
36 | #define XFS_INODES_PER_CHUNK (NBBY * sizeof(xfs_inofree_t)) | |
37 | #define XFS_INODES_PER_CHUNK_LOG (XFS_NBBYLOG + 3) | |
38 | #define XFS_INOBT_ALL_FREE ((xfs_inofree_t)-1) | |
39 | ||
1da177e4 | 40 | #define XFS_INOBT_MASKN(i,n) xfs_inobt_maskn(i,n) |
a844f451 NS |
41 | static inline xfs_inofree_t xfs_inobt_maskn(int i, int n) |
42 | { | |
43 | return (((n) >= XFS_INODES_PER_CHUNK ? \ | |
44 | (xfs_inofree_t)0 : ((xfs_inofree_t)1 << (n))) - 1) << (i); | |
45 | } | |
1da177e4 LT |
46 | |
47 | /* | |
48 | * Data record structure | |
49 | */ | |
50 | typedef struct xfs_inobt_rec | |
51 | { | |
52 | xfs_agino_t ir_startino; /* starting inode number */ | |
53 | __int32_t ir_freecount; /* count of free inodes (set bits) */ | |
54 | xfs_inofree_t ir_free; /* free inode mask */ | |
55 | } xfs_inobt_rec_t; | |
56 | ||
57 | /* | |
58 | * Key structure | |
59 | */ | |
60 | typedef struct xfs_inobt_key | |
61 | { | |
62 | xfs_agino_t ir_startino; /* starting inode number */ | |
63 | } xfs_inobt_key_t; | |
64 | ||
16259e7d CH |
65 | /* btree pointer type */ |
66 | typedef __be32 xfs_inobt_ptr_t; | |
67 | ||
68 | /* btree block header type */ | |
1da177e4 LT |
69 | typedef struct xfs_btree_sblock xfs_inobt_block_t; |
70 | ||
a844f451 | 71 | #define XFS_BUF_TO_INOBT_BLOCK(bp) ((xfs_inobt_block_t *)XFS_BUF_PTR(bp)) |
1da177e4 LT |
72 | |
73 | /* | |
74 | * Bit manipulations for ir_free. | |
75 | */ | |
1da177e4 | 76 | #define XFS_INOBT_MASK(i) ((xfs_inofree_t)1 << (i)) |
a844f451 NS |
77 | #define XFS_INOBT_IS_FREE(rp,i) \ |
78 | (((rp)->ir_free & XFS_INOBT_MASK(i)) != 0) | |
79 | #define XFS_INOBT_IS_FREE_DISK(rp,i) \ | |
80 | ((INT_GET((rp)->ir_free,ARCH_CONVERT) & XFS_INOBT_MASK(i)) != 0) | |
1da177e4 | 81 | #define XFS_INOBT_SET_FREE(rp,i) ((rp)->ir_free |= XFS_INOBT_MASK(i)) |
1da177e4 | 82 | #define XFS_INOBT_CLR_FREE(rp,i) ((rp)->ir_free &= ~XFS_INOBT_MASK(i)) |
1da177e4 LT |
83 | |
84 | /* | |
85 | * Real block structures have a size equal to the disk block size. | |
86 | */ | |
1da177e4 | 87 | #define XFS_INOBT_BLOCK_SIZE(lev,cur) (1 << (cur)->bc_blocklog) |
a844f451 NS |
88 | #define XFS_INOBT_BLOCK_MAXRECS(lev,cur) ((cur)->bc_mp->m_inobt_mxr[lev != 0]) |
89 | #define XFS_INOBT_BLOCK_MINRECS(lev,cur) ((cur)->bc_mp->m_inobt_mnr[lev != 0]) | |
1da177e4 | 90 | #define XFS_INOBT_IS_LAST_REC(cur) \ |
16259e7d | 91 | ((cur)->bc_ptrs[0] == be16_to_cpu(XFS_BUF_TO_INOBT_BLOCK((cur)->bc_bufs[0])->bb_numrecs)) |
1da177e4 LT |
92 | |
93 | /* | |
94 | * Maximum number of inode btree levels. | |
95 | */ | |
1da177e4 | 96 | #define XFS_IN_MAXLEVELS(mp) ((mp)->m_in_maxlevels) |
1da177e4 LT |
97 | |
98 | /* | |
99 | * block numbers in the AG. | |
100 | */ | |
a844f451 NS |
101 | #define XFS_IBT_BLOCK(mp) ((xfs_agblock_t)(XFS_CNT_BLOCK(mp) + 1)) |
102 | #define XFS_PREALLOC_BLOCKS(mp) ((xfs_agblock_t)(XFS_IBT_BLOCK(mp) + 1)) | |
1da177e4 LT |
103 | |
104 | /* | |
105 | * Record, key, and pointer address macros for btree blocks. | |
106 | */ | |
a844f451 NS |
107 | #define XFS_INOBT_REC_ADDR(bb,i,cur) \ |
108 | (XFS_BTREE_REC_ADDR(XFS_INOBT_BLOCK_SIZE(0,cur), xfs_inobt, bb, \ | |
109 | i, XFS_INOBT_BLOCK_MAXRECS(0, cur))) | |
110 | #define XFS_INOBT_KEY_ADDR(bb,i,cur) \ | |
111 | (XFS_BTREE_KEY_ADDR(XFS_INOBT_BLOCK_SIZE(1,cur), xfs_inobt, bb, \ | |
112 | i, XFS_INOBT_BLOCK_MAXRECS(1, cur))) | |
1da177e4 | 113 | |
a844f451 NS |
114 | #define XFS_INOBT_PTR_ADDR(bb,i,cur) \ |
115 | (XFS_BTREE_PTR_ADDR(XFS_INOBT_BLOCK_SIZE(1,cur), xfs_inobt, bb, \ | |
116 | i, XFS_INOBT_BLOCK_MAXRECS(1, cur))) | |
1da177e4 LT |
117 | |
118 | /* | |
119 | * Decrement cursor by one record at the level. | |
120 | * For nonzero levels the leaf-ward information is untouched. | |
121 | */ | |
a844f451 | 122 | extern int xfs_inobt_decrement(struct xfs_btree_cur *cur, int level, int *stat); |
1da177e4 LT |
123 | |
124 | /* | |
125 | * Delete the record pointed to by cur. | |
126 | * The cursor refers to the place where the record was (could be inserted) | |
127 | * when the operation returns. | |
128 | */ | |
a844f451 | 129 | extern int xfs_inobt_delete(struct xfs_btree_cur *cur, int *stat); |
1da177e4 LT |
130 | |
131 | /* | |
132 | * Get the data from the pointed-to record. | |
133 | */ | |
a844f451 NS |
134 | extern int xfs_inobt_get_rec(struct xfs_btree_cur *cur, xfs_agino_t *ino, |
135 | __int32_t *fcnt, xfs_inofree_t *free, int *stat); | |
1da177e4 LT |
136 | |
137 | /* | |
138 | * Increment cursor by one record at the level. | |
139 | * For nonzero levels the leaf-ward information is untouched. | |
140 | */ | |
a844f451 | 141 | extern int xfs_inobt_increment(struct xfs_btree_cur *cur, int level, int *stat); |
1da177e4 LT |
142 | |
143 | /* | |
144 | * Insert the current record at the point referenced by cur. | |
145 | * The cursor may be inconsistent on return if splits have been done. | |
146 | */ | |
a844f451 | 147 | extern int xfs_inobt_insert(struct xfs_btree_cur *cur, int *stat); |
1da177e4 LT |
148 | |
149 | /* | |
150 | * Lookup the record equal to ino in the btree given by cur. | |
151 | */ | |
a844f451 NS |
152 | extern int xfs_inobt_lookup_eq(struct xfs_btree_cur *cur, xfs_agino_t ino, |
153 | __int32_t fcnt, xfs_inofree_t free, int *stat); | |
1da177e4 LT |
154 | |
155 | /* | |
156 | * Lookup the first record greater than or equal to ino | |
157 | * in the btree given by cur. | |
158 | */ | |
a844f451 NS |
159 | extern int xfs_inobt_lookup_ge(struct xfs_btree_cur *cur, xfs_agino_t ino, |
160 | __int32_t fcnt, xfs_inofree_t free, int *stat); | |
1da177e4 LT |
161 | |
162 | /* | |
163 | * Lookup the first record less than or equal to ino | |
164 | * in the btree given by cur. | |
165 | */ | |
a844f451 NS |
166 | extern int xfs_inobt_lookup_le(struct xfs_btree_cur *cur, xfs_agino_t ino, |
167 | __int32_t fcnt, xfs_inofree_t free, int *stat); | |
1da177e4 LT |
168 | |
169 | /* | |
170 | * Update the record referred to by cur, to the value given | |
171 | * by [ino, fcnt, free]. | |
172 | * This either works (return 0) or gets an EFSCORRUPTED error. | |
173 | */ | |
a844f451 NS |
174 | extern int xfs_inobt_update(struct xfs_btree_cur *cur, xfs_agino_t ino, |
175 | __int32_t fcnt, xfs_inofree_t free); | |
1da177e4 LT |
176 | |
177 | #endif /* __XFS_IALLOC_BTREE_H__ */ |