]>
Commit | Line | Data |
---|---|---|
2bd0ea18 | 1 | /* |
da23017d NS |
2 | * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
5000d01d | 4 | * |
da23017d 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 | * |
da23017d 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 | * |
da23017d 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 | 17 | */ |
9c799827 | 18 | #include "libxfs_priv.h" |
b626fb59 DC |
19 | #include "xfs_fs.h" |
20 | #include "xfs_shared.h" | |
21 | #include "xfs_format.h" | |
22 | #include "xfs_log_format.h" | |
23 | #include "xfs_trans_resv.h" | |
24 | #include "xfs_bit.h" | |
25 | #include "xfs_mount.h" | |
26 | #include "xfs_inode.h" | |
27 | #include "xfs_btree.h" | |
28 | #include "xfs_ialloc.h" | |
29 | #include "xfs_ialloc_btree.h" | |
30 | #include "xfs_alloc.h" | |
31 | #include "xfs_trace.h" | |
32 | #include "xfs_cksum.h" | |
33 | #include "xfs_trans.h" | |
85aec44f | 34 | #include "xfs_rmap.h" |
b626fb59 | 35 | |
2bd0ea18 | 36 | |
b194c7d8 BN |
37 | STATIC int |
38 | xfs_inobt_get_minrecs( | |
39 | struct xfs_btree_cur *cur, | |
40 | int level) | |
2bd0ea18 | 41 | { |
b194c7d8 | 42 | return cur->bc_mp->m_inobt_mnr[level != 0]; |
2bd0ea18 NS |
43 | } |
44 | ||
b194c7d8 BN |
45 | STATIC struct xfs_btree_cur * |
46 | xfs_inobt_dup_cursor( | |
47 | struct xfs_btree_cur *cur) | |
2bd0ea18 | 48 | { |
b194c7d8 | 49 | return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp, |
70eb7337 BF |
50 | cur->bc_private.a.agbp, cur->bc_private.a.agno, |
51 | cur->bc_btnum); | |
2bd0ea18 NS |
52 | } |
53 | ||
2bd0ea18 | 54 | STATIC void |
b194c7d8 BN |
55 | xfs_inobt_set_root( |
56 | struct xfs_btree_cur *cur, | |
57 | union xfs_btree_ptr *nptr, | |
58 | int inc) /* level change */ | |
2bd0ea18 | 59 | { |
b194c7d8 BN |
60 | struct xfs_buf *agbp = cur->bc_private.a.agbp; |
61 | struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp); | |
2bd0ea18 | 62 | |
b194c7d8 BN |
63 | agi->agi_root = nptr->s; |
64 | be32_add_cpu(&agi->agi_level, inc); | |
65 | xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL); | |
2bd0ea18 NS |
66 | } |
67 | ||
c0a4c227 BF |
68 | STATIC void |
69 | xfs_finobt_set_root( | |
70 | struct xfs_btree_cur *cur, | |
71 | union xfs_btree_ptr *nptr, | |
72 | int inc) /* level change */ | |
73 | { | |
74 | struct xfs_buf *agbp = cur->bc_private.a.agbp; | |
75 | struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp); | |
76 | ||
77 | agi->agi_free_root = nptr->s; | |
78 | be32_add_cpu(&agi->agi_free_level, inc); | |
79 | xfs_ialloc_log_agi(cur->bc_tp, agbp, | |
80 | XFS_AGI_FREE_ROOT | XFS_AGI_FREE_LEVEL); | |
81 | } | |
82 | ||
b194c7d8 | 83 | STATIC int |
74e502ac | 84 | __xfs_inobt_alloc_block( |
b194c7d8 BN |
85 | struct xfs_btree_cur *cur, |
86 | union xfs_btree_ptr *start, | |
87 | union xfs_btree_ptr *new, | |
74e502ac CH |
88 | int *stat, |
89 | enum xfs_ag_resv_type resv) | |
2bd0ea18 | 90 | { |
b194c7d8 BN |
91 | xfs_alloc_arg_t args; /* block allocation args */ |
92 | int error; /* error return value */ | |
93 | xfs_agblock_t sbno = be32_to_cpu(start->s); | |
2bd0ea18 | 94 | |
b194c7d8 | 95 | XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY); |
2bd0ea18 | 96 | |
b194c7d8 | 97 | memset(&args, 0, sizeof(args)); |
2bd0ea18 NS |
98 | args.tp = cur->bc_tp; |
99 | args.mp = cur->bc_mp; | |
85aec44f | 100 | xfs_rmap_ag_owner(&args.oinfo, XFS_RMAP_OWN_INOBT); |
b194c7d8 BN |
101 | args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno); |
102 | args.minlen = 1; | |
103 | args.maxlen = 1; | |
104 | args.prod = 1; | |
2bd0ea18 | 105 | args.type = XFS_ALLOCTYPE_NEAR_BNO; |
74e502ac | 106 | args.resv = resv; |
b194c7d8 BN |
107 | |
108 | error = xfs_alloc_vextent(&args); | |
109 | if (error) { | |
110 | XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR); | |
2bd0ea18 | 111 | return error; |
b194c7d8 | 112 | } |
2bd0ea18 | 113 | if (args.fsbno == NULLFSBLOCK) { |
b194c7d8 | 114 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); |
2bd0ea18 NS |
115 | *stat = 0; |
116 | return 0; | |
117 | } | |
118 | ASSERT(args.len == 1); | |
b194c7d8 BN |
119 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); |
120 | ||
121 | new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno)); | |
2bd0ea18 NS |
122 | *stat = 1; |
123 | return 0; | |
124 | } | |
125 | ||
74e502ac CH |
126 | STATIC int |
127 | xfs_inobt_alloc_block( | |
128 | struct xfs_btree_cur *cur, | |
129 | union xfs_btree_ptr *start, | |
130 | union xfs_btree_ptr *new, | |
131 | int *stat) | |
132 | { | |
133 | return __xfs_inobt_alloc_block(cur, start, new, stat, XFS_AG_RESV_NONE); | |
134 | } | |
135 | ||
136 | STATIC int | |
137 | xfs_finobt_alloc_block( | |
138 | struct xfs_btree_cur *cur, | |
139 | union xfs_btree_ptr *start, | |
140 | union xfs_btree_ptr *new, | |
141 | int *stat) | |
142 | { | |
143 | return __xfs_inobt_alloc_block(cur, start, new, stat, | |
144 | XFS_AG_RESV_METADATA); | |
145 | } | |
146 | ||
b194c7d8 BN |
147 | STATIC int |
148 | xfs_inobt_free_block( | |
149 | struct xfs_btree_cur *cur, | |
150 | struct xfs_buf *bp) | |
2bd0ea18 | 151 | { |
85aec44f DW |
152 | struct xfs_owner_info oinfo; |
153 | ||
154 | xfs_rmap_ag_owner(&oinfo, XFS_RMAP_OWN_INOBT); | |
08caf14f | 155 | return xfs_free_extent(cur->bc_tp, |
85aec44f | 156 | XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp)), 1, |
cf8ce220 | 157 | &oinfo, XFS_AG_RESV_NONE); |
2bd0ea18 NS |
158 | } |
159 | ||
b194c7d8 BN |
160 | STATIC int |
161 | xfs_inobt_get_maxrecs( | |
162 | struct xfs_btree_cur *cur, | |
163 | int level) | |
2bd0ea18 | 164 | { |
b194c7d8 BN |
165 | return cur->bc_mp->m_inobt_mxr[level != 0]; |
166 | } | |
2bd0ea18 | 167 | |
b194c7d8 BN |
168 | STATIC void |
169 | xfs_inobt_init_key_from_rec( | |
170 | union xfs_btree_key *key, | |
171 | union xfs_btree_rec *rec) | |
172 | { | |
173 | key->inobt.ir_startino = rec->inobt.ir_startino; | |
174 | } | |
2bd0ea18 | 175 | |
4e388bc9 DW |
176 | STATIC void |
177 | xfs_inobt_init_high_key_from_rec( | |
178 | union xfs_btree_key *key, | |
179 | union xfs_btree_rec *rec) | |
180 | { | |
181 | __u32 x; | |
182 | ||
183 | x = be32_to_cpu(rec->inobt.ir_startino); | |
184 | x += XFS_INODES_PER_CHUNK - 1; | |
185 | key->inobt.ir_startino = cpu_to_be32(x); | |
186 | } | |
187 | ||
b194c7d8 BN |
188 | STATIC void |
189 | xfs_inobt_init_rec_from_cur( | |
190 | struct xfs_btree_cur *cur, | |
191 | union xfs_btree_rec *rec) | |
192 | { | |
193 | rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino); | |
11640e30 BF |
194 | if (xfs_sb_version_hassparseinodes(&cur->bc_mp->m_sb)) { |
195 | rec->inobt.ir_u.sp.ir_holemask = | |
196 | cpu_to_be16(cur->bc_rec.i.ir_holemask); | |
197 | rec->inobt.ir_u.sp.ir_count = cur->bc_rec.i.ir_count; | |
198 | rec->inobt.ir_u.sp.ir_freecount = cur->bc_rec.i.ir_freecount; | |
199 | } else { | |
200 | /* ir_holemask/ir_count not supported on-disk */ | |
201 | rec->inobt.ir_u.f.ir_freecount = | |
202 | cpu_to_be32(cur->bc_rec.i.ir_freecount); | |
203 | } | |
b194c7d8 | 204 | rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free); |
2bd0ea18 NS |
205 | } |
206 | ||
207 | /* | |
56b2de80 | 208 | * initial value of ptr for lookup |
2bd0ea18 | 209 | */ |
b194c7d8 BN |
210 | STATIC void |
211 | xfs_inobt_init_ptr_from_cur( | |
212 | struct xfs_btree_cur *cur, | |
213 | union xfs_btree_ptr *ptr) | |
2bd0ea18 | 214 | { |
b194c7d8 | 215 | struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp); |
2bd0ea18 | 216 | |
b194c7d8 | 217 | ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno)); |
2bd0ea18 | 218 | |
b194c7d8 | 219 | ptr->s = agi->agi_root; |
2bd0ea18 NS |
220 | } |
221 | ||
c0a4c227 BF |
222 | STATIC void |
223 | xfs_finobt_init_ptr_from_cur( | |
224 | struct xfs_btree_cur *cur, | |
225 | union xfs_btree_ptr *ptr) | |
226 | { | |
227 | struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp); | |
228 | ||
229 | ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno)); | |
230 | ptr->s = agi->agi_free_root; | |
231 | } | |
232 | ||
4a492e72 | 233 | STATIC int64_t |
b194c7d8 BN |
234 | xfs_inobt_key_diff( |
235 | struct xfs_btree_cur *cur, | |
236 | union xfs_btree_key *key) | |
237 | { | |
4a492e72 | 238 | return (int64_t)be32_to_cpu(key->inobt.ir_startino) - |
b194c7d8 BN |
239 | cur->bc_rec.i.ir_startino; |
240 | } | |
2bd0ea18 | 241 | |
4e388bc9 DW |
242 | STATIC int64_t |
243 | xfs_inobt_diff_two_keys( | |
244 | struct xfs_btree_cur *cur, | |
245 | union xfs_btree_key *k1, | |
246 | union xfs_btree_key *k2) | |
247 | { | |
248 | return (int64_t)be32_to_cpu(k1->inobt.ir_startino) - | |
249 | be32_to_cpu(k2->inobt.ir_startino); | |
250 | } | |
251 | ||
bc01119d | 252 | static xfs_failaddr_t |
a2ceac1f DC |
253 | xfs_inobt_verify( |
254 | struct xfs_buf *bp) | |
255 | { | |
256 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
257 | struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp); | |
bc01119d | 258 | xfs_failaddr_t fa; |
a2ceac1f | 259 | unsigned int level; |
a2ceac1f | 260 | |
5dfa5cd2 DC |
261 | /* |
262 | * During growfs operations, we can't verify the exact owner as the | |
263 | * perag is not fully initialised and hence not attached to the buffer. | |
c0adfb03 DC |
264 | * |
265 | * Similarly, during log recovery we will have a perag structure | |
266 | * attached, but the agi information will not yet have been initialised | |
267 | * from the on disk AGI. We don't currently use any of this information, | |
268 | * but beware of the landmine (i.e. need to check pag->pagi_init) if we | |
269 | * ever do. | |
5dfa5cd2 | 270 | */ |
c0adfb03 DC |
271 | switch (block->bb_magic) { |
272 | case cpu_to_be32(XFS_IBT_CRC_MAGIC): | |
c0a4c227 | 273 | case cpu_to_be32(XFS_FIBT_CRC_MAGIC): |
bc01119d DW |
274 | fa = xfs_btree_sblock_v5hdr_verify(bp); |
275 | if (fa) | |
276 | return fa; | |
5dfa5cd2 | 277 | /* fall through */ |
c0adfb03 | 278 | case cpu_to_be32(XFS_IBT_MAGIC): |
c0a4c227 | 279 | case cpu_to_be32(XFS_FIBT_MAGIC): |
5dfa5cd2 DC |
280 | break; |
281 | default: | |
bc01119d | 282 | return NULL; |
5dfa5cd2 | 283 | } |
a2ceac1f | 284 | |
dbca0167 | 285 | /* level verification */ |
5dfa5cd2 DC |
286 | level = be16_to_cpu(block->bb_level); |
287 | if (level >= mp->m_in_maxlevels) | |
bc01119d | 288 | return __this_address; |
5dfa5cd2 | 289 | |
dbca0167 | 290 | return xfs_btree_sblock_verify(bp, mp->m_inobt_mxr[level != 0]); |
a2ceac1f DC |
291 | } |
292 | ||
293 | static void | |
294 | xfs_inobt_read_verify( | |
295 | struct xfs_buf *bp) | |
296 | { | |
1e697959 DW |
297 | xfs_failaddr_t fa; |
298 | ||
45922933 | 299 | if (!xfs_btree_sblock_verify_crc(bp)) |
1e697959 DW |
300 | xfs_verifier_error(bp, -EFSBADCRC, __this_address); |
301 | else { | |
302 | fa = xfs_inobt_verify(bp); | |
303 | if (fa) | |
304 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); | |
305 | } | |
45922933 | 306 | |
7e6c95f1 | 307 | if (bp->b_error) |
45922933 | 308 | trace_xfs_btree_corrupt(bp, _RET_IP_); |
a2ceac1f DC |
309 | } |
310 | ||
311 | static void | |
312 | xfs_inobt_write_verify( | |
313 | struct xfs_buf *bp) | |
314 | { | |
1e697959 DW |
315 | xfs_failaddr_t fa; |
316 | ||
317 | fa = xfs_inobt_verify(bp); | |
318 | if (fa) { | |
5dfa5cd2 | 319 | trace_xfs_btree_corrupt(bp, _RET_IP_); |
1e697959 | 320 | xfs_verifier_error(bp, -EFSCORRUPTED, fa); |
dbf564d1 | 321 | return; |
5dfa5cd2 DC |
322 | } |
323 | xfs_btree_sblock_calc_crc(bp); | |
324 | ||
a2ceac1f DC |
325 | } |
326 | ||
327 | const struct xfs_buf_ops xfs_inobt_buf_ops = { | |
a3fac935 | 328 | .name = "xfs_inobt", |
a2ceac1f DC |
329 | .verify_read = xfs_inobt_read_verify, |
330 | .verify_write = xfs_inobt_write_verify, | |
95d9582b | 331 | .verify_struct = xfs_inobt_verify, |
a2ceac1f DC |
332 | }; |
333 | ||
b194c7d8 BN |
334 | STATIC int |
335 | xfs_inobt_keys_inorder( | |
336 | struct xfs_btree_cur *cur, | |
337 | union xfs_btree_key *k1, | |
338 | union xfs_btree_key *k2) | |
339 | { | |
340 | return be32_to_cpu(k1->inobt.ir_startino) < | |
341 | be32_to_cpu(k2->inobt.ir_startino); | |
2bd0ea18 NS |
342 | } |
343 | ||
b194c7d8 BN |
344 | STATIC int |
345 | xfs_inobt_recs_inorder( | |
346 | struct xfs_btree_cur *cur, | |
347 | union xfs_btree_rec *r1, | |
348 | union xfs_btree_rec *r2) | |
2bd0ea18 | 349 | { |
b194c7d8 BN |
350 | return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <= |
351 | be32_to_cpu(r2->inobt.ir_startino); | |
352 | } | |
2bd0ea18 | 353 | |
b194c7d8 BN |
354 | static const struct xfs_btree_ops xfs_inobt_ops = { |
355 | .rec_len = sizeof(xfs_inobt_rec_t), | |
356 | .key_len = sizeof(xfs_inobt_key_t), | |
357 | ||
358 | .dup_cursor = xfs_inobt_dup_cursor, | |
359 | .set_root = xfs_inobt_set_root, | |
b194c7d8 BN |
360 | .alloc_block = xfs_inobt_alloc_block, |
361 | .free_block = xfs_inobt_free_block, | |
362 | .get_minrecs = xfs_inobt_get_minrecs, | |
363 | .get_maxrecs = xfs_inobt_get_maxrecs, | |
364 | .init_key_from_rec = xfs_inobt_init_key_from_rec, | |
4e388bc9 | 365 | .init_high_key_from_rec = xfs_inobt_init_high_key_from_rec, |
b194c7d8 BN |
366 | .init_rec_from_cur = xfs_inobt_init_rec_from_cur, |
367 | .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur, | |
368 | .key_diff = xfs_inobt_key_diff, | |
a2ceac1f | 369 | .buf_ops = &xfs_inobt_buf_ops, |
4e388bc9 | 370 | .diff_two_keys = xfs_inobt_diff_two_keys, |
b194c7d8 BN |
371 | .keys_inorder = xfs_inobt_keys_inorder, |
372 | .recs_inorder = xfs_inobt_recs_inorder, | |
b194c7d8 | 373 | }; |
2bd0ea18 | 374 | |
c0a4c227 BF |
375 | static const struct xfs_btree_ops xfs_finobt_ops = { |
376 | .rec_len = sizeof(xfs_inobt_rec_t), | |
377 | .key_len = sizeof(xfs_inobt_key_t), | |
378 | ||
379 | .dup_cursor = xfs_inobt_dup_cursor, | |
380 | .set_root = xfs_finobt_set_root, | |
74e502ac | 381 | .alloc_block = xfs_finobt_alloc_block, |
c0a4c227 BF |
382 | .free_block = xfs_inobt_free_block, |
383 | .get_minrecs = xfs_inobt_get_minrecs, | |
384 | .get_maxrecs = xfs_inobt_get_maxrecs, | |
385 | .init_key_from_rec = xfs_inobt_init_key_from_rec, | |
4e388bc9 | 386 | .init_high_key_from_rec = xfs_inobt_init_high_key_from_rec, |
c0a4c227 BF |
387 | .init_rec_from_cur = xfs_inobt_init_rec_from_cur, |
388 | .init_ptr_from_cur = xfs_finobt_init_ptr_from_cur, | |
389 | .key_diff = xfs_inobt_key_diff, | |
390 | .buf_ops = &xfs_inobt_buf_ops, | |
4e388bc9 | 391 | .diff_two_keys = xfs_inobt_diff_two_keys, |
c0a4c227 BF |
392 | .keys_inorder = xfs_inobt_keys_inorder, |
393 | .recs_inorder = xfs_inobt_recs_inorder, | |
c0a4c227 BF |
394 | }; |
395 | ||
2bd0ea18 | 396 | /* |
b194c7d8 | 397 | * Allocate a new inode btree cursor. |
2bd0ea18 | 398 | */ |
b194c7d8 BN |
399 | struct xfs_btree_cur * /* new inode btree cursor */ |
400 | xfs_inobt_init_cursor( | |
401 | struct xfs_mount *mp, /* file system mount point */ | |
402 | struct xfs_trans *tp, /* transaction pointer */ | |
403 | struct xfs_buf *agbp, /* buffer for agi structure */ | |
70eb7337 BF |
404 | xfs_agnumber_t agno, /* allocation group number */ |
405 | xfs_btnum_t btnum) /* ialloc or free ino btree */ | |
2bd0ea18 | 406 | { |
b194c7d8 BN |
407 | struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp); |
408 | struct xfs_btree_cur *cur; | |
2bd0ea18 | 409 | |
762989ef | 410 | cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_NOFS); |
2bd0ea18 | 411 | |
b194c7d8 BN |
412 | cur->bc_tp = tp; |
413 | cur->bc_mp = mp; | |
70eb7337 | 414 | cur->bc_btnum = btnum; |
c0a4c227 BF |
415 | if (btnum == XFS_BTNUM_INO) { |
416 | cur->bc_nlevels = be32_to_cpu(agi->agi_level); | |
417 | cur->bc_ops = &xfs_inobt_ops; | |
5d8acc46 | 418 | cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_ibt_2); |
c0a4c227 BF |
419 | } else { |
420 | cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); | |
421 | cur->bc_ops = &xfs_finobt_ops; | |
5d8acc46 | 422 | cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_fibt_2); |
c0a4c227 BF |
423 | } |
424 | ||
b194c7d8 BN |
425 | cur->bc_blocklog = mp->m_sb.sb_blocklog; |
426 | ||
5dfa5cd2 DC |
427 | if (xfs_sb_version_hascrc(&mp->m_sb)) |
428 | cur->bc_flags |= XFS_BTREE_CRC_BLOCKS; | |
b194c7d8 BN |
429 | |
430 | cur->bc_private.a.agbp = agbp; | |
431 | cur->bc_private.a.agno = agno; | |
432 | ||
433 | return cur; | |
2bd0ea18 | 434 | } |
b3563c19 BN |
435 | |
436 | /* | |
437 | * Calculate number of records in an inobt btree block. | |
438 | */ | |
439 | int | |
440 | xfs_inobt_maxrecs( | |
441 | struct xfs_mount *mp, | |
442 | int blocklen, | |
443 | int leaf) | |
444 | { | |
445 | blocklen -= XFS_INOBT_BLOCK_LEN(mp); | |
446 | ||
447 | if (leaf) | |
448 | return blocklen / sizeof(xfs_inobt_rec_t); | |
449 | return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t)); | |
450 | } | |
2cf87710 BF |
451 | |
452 | /* | |
453 | * Convert the inode record holemask to an inode allocation bitmap. The inode | |
454 | * allocation bitmap is inode granularity and specifies whether an inode is | |
455 | * physically allocated on disk (not whether the inode is considered allocated | |
456 | * or free by the fs). | |
457 | * | |
458 | * A bit value of 1 means the inode is allocated, a value of 0 means it is free. | |
459 | */ | |
460 | uint64_t | |
461 | xfs_inobt_irec_to_allocmask( | |
462 | struct xfs_inobt_rec_incore *rec) | |
463 | { | |
464 | uint64_t bitmap = 0; | |
465 | uint64_t inodespbit; | |
466 | int nextbit; | |
467 | uint allocbitmap; | |
468 | ||
469 | /* | |
470 | * The holemask has 16-bits for a 64 inode record. Therefore each | |
471 | * holemask bit represents multiple inodes. Create a mask of bits to set | |
472 | * in the allocmask for each holemask bit. | |
473 | */ | |
474 | inodespbit = (1 << XFS_INODES_PER_HOLEMASK_BIT) - 1; | |
475 | ||
476 | /* | |
477 | * Allocated inodes are represented by 0 bits in holemask. Invert the 0 | |
478 | * bits to 1 and convert to a uint so we can use xfs_next_bit(). Mask | |
479 | * anything beyond the 16 holemask bits since this casts to a larger | |
480 | * type. | |
481 | */ | |
482 | allocbitmap = ~rec->ir_holemask & ((1 << XFS_INOBT_HOLEMASK_BITS) - 1); | |
483 | ||
484 | /* | |
485 | * allocbitmap is the inverted holemask so every set bit represents | |
486 | * allocated inodes. To expand from 16-bit holemask granularity to | |
487 | * 64-bit (e.g., bit-per-inode), set inodespbit bits in the target | |
488 | * bitmap for every holemask bit. | |
489 | */ | |
490 | nextbit = xfs_next_bit(&allocbitmap, 1, 0); | |
491 | while (nextbit != -1) { | |
492 | ASSERT(nextbit < (sizeof(rec->ir_holemask) * NBBY)); | |
493 | ||
494 | bitmap |= (inodespbit << | |
495 | (nextbit * XFS_INODES_PER_HOLEMASK_BIT)); | |
496 | ||
497 | nextbit = xfs_next_bit(&allocbitmap, 1, nextbit + 1); | |
498 | } | |
499 | ||
500 | return bitmap; | |
501 | } | |
6f4c54a4 BF |
502 | |
503 | #if defined(DEBUG) || defined(XFS_WARN) | |
504 | /* | |
505 | * Verify that an in-core inode record has a valid inode count. | |
506 | */ | |
507 | int | |
508 | xfs_inobt_rec_check_count( | |
509 | struct xfs_mount *mp, | |
510 | struct xfs_inobt_rec_incore *rec) | |
511 | { | |
512 | int inocount = 0; | |
513 | int nextbit = 0; | |
514 | uint64_t allocbmap; | |
515 | int wordsz; | |
516 | ||
517 | wordsz = sizeof(allocbmap) / sizeof(unsigned int); | |
518 | allocbmap = xfs_inobt_irec_to_allocmask(rec); | |
519 | ||
520 | nextbit = xfs_next_bit((uint *) &allocbmap, wordsz, nextbit); | |
521 | while (nextbit != -1) { | |
522 | inocount++; | |
523 | nextbit = xfs_next_bit((uint *) &allocbmap, wordsz, | |
524 | nextbit + 1); | |
525 | } | |
526 | ||
527 | if (inocount != rec->ir_count) | |
528 | return -EFSCORRUPTED; | |
529 | ||
530 | return 0; | |
531 | } | |
532 | #endif /* DEBUG */ | |
74e502ac CH |
533 | |
534 | static xfs_extlen_t | |
535 | xfs_inobt_max_size( | |
536 | struct xfs_mount *mp) | |
537 | { | |
538 | /* Bail out if we're uninitialized, which can happen in mkfs. */ | |
539 | if (mp->m_inobt_mxr[0] == 0) | |
540 | return 0; | |
541 | ||
542 | return xfs_btree_calc_size(mp, mp->m_inobt_mnr, | |
543 | (uint64_t)mp->m_sb.sb_agblocks * mp->m_sb.sb_inopblock / | |
544 | XFS_INODES_PER_CHUNK); | |
545 | } | |
546 | ||
547 | static int | |
548 | xfs_inobt_count_blocks( | |
549 | struct xfs_mount *mp, | |
550 | xfs_agnumber_t agno, | |
551 | xfs_btnum_t btnum, | |
552 | xfs_extlen_t *tree_blocks) | |
553 | { | |
554 | struct xfs_buf *agbp; | |
555 | struct xfs_btree_cur *cur; | |
556 | int error; | |
557 | ||
558 | error = xfs_ialloc_read_agi(mp, NULL, agno, &agbp); | |
559 | if (error) | |
560 | return error; | |
561 | ||
562 | cur = xfs_inobt_init_cursor(mp, NULL, agbp, agno, btnum); | |
563 | error = xfs_btree_count_blocks(cur, tree_blocks); | |
564 | xfs_btree_del_cursor(cur, error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); | |
565 | xfs_buf_relse(agbp); | |
566 | ||
567 | return error; | |
568 | } | |
569 | ||
570 | /* | |
571 | * Figure out how many blocks to reserve and how many are used by this btree. | |
572 | */ | |
573 | int | |
574 | xfs_finobt_calc_reserves( | |
575 | struct xfs_mount *mp, | |
576 | xfs_agnumber_t agno, | |
577 | xfs_extlen_t *ask, | |
578 | xfs_extlen_t *used) | |
579 | { | |
580 | xfs_extlen_t tree_len = 0; | |
581 | int error; | |
582 | ||
583 | if (!xfs_sb_version_hasfinobt(&mp->m_sb)) | |
584 | return 0; | |
585 | ||
586 | error = xfs_inobt_count_blocks(mp, agno, XFS_BTNUM_FINO, &tree_len); | |
587 | if (error) | |
588 | return error; | |
589 | ||
590 | *ask += xfs_inobt_max_size(mp); | |
591 | *used += tree_len; | |
592 | return 0; | |
593 | } |