]>
Commit | Line | Data |
---|---|---|
2bd0ea18 | 1 | /* |
da23017d NS |
2 | * Copyright (c) 2000-2003,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" | |
f944d3d0 | 26 | #include "xfs_defer.h" |
b626fb59 DC |
27 | #include "xfs_inode.h" |
28 | #include "xfs_trans.h" | |
29 | #include "xfs_alloc.h" | |
30 | #include "xfs_btree.h" | |
31 | #include "xfs_bmap_btree.h" | |
32 | #include "xfs_bmap.h" | |
33 | #include "xfs_trace.h" | |
34 | #include "xfs_cksum.h" | |
85aec44f | 35 | #include "xfs_rmap.h" |
2bd0ea18 | 36 | |
2bd0ea18 NS |
37 | /* |
38 | * Convert on-disk form of btree root to in-memory form. | |
39 | */ | |
40 | void | |
41 | xfs_bmdr_to_bmbt( | |
5dfa5cd2 | 42 | struct xfs_inode *ip, |
2bd0ea18 NS |
43 | xfs_bmdr_block_t *dblock, |
44 | int dblocklen, | |
b3563c19 | 45 | struct xfs_btree_block *rblock, |
2bd0ea18 NS |
46 | int rblocklen) |
47 | { | |
5dfa5cd2 | 48 | struct xfs_mount *mp = ip->i_mount; |
2bd0ea18 NS |
49 | int dmxr; |
50 | xfs_bmbt_key_t *fkp; | |
5e656dbb | 51 | __be64 *fpp; |
2bd0ea18 | 52 | xfs_bmbt_key_t *tkp; |
5e656dbb | 53 | __be64 *tpp; |
2bd0ea18 | 54 | |
e394a4b1 ES |
55 | xfs_btree_init_block_int(mp, rblock, XFS_BUF_DADDR_NULL, |
56 | XFS_BTNUM_BMAP, 0, 0, ip->i_ino, | |
f4241a08 | 57 | XFS_BTREE_LONG_PTRS); |
6e3140c7 NS |
58 | rblock->bb_level = dblock->bb_level; |
59 | ASSERT(be16_to_cpu(rblock->bb_level) > 0); | |
60 | rblock->bb_numrecs = dblock->bb_numrecs; | |
ff105f75 | 61 | dmxr = xfs_bmdr_maxrecs(dblocklen, 0); |
b3563c19 BN |
62 | fkp = XFS_BMDR_KEY_ADDR(dblock, 1); |
63 | tkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1); | |
64 | fpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr); | |
65 | tpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen); | |
6e3140c7 | 66 | dmxr = be16_to_cpu(dblock->bb_numrecs); |
32181a02 | 67 | memcpy(tkp, fkp, sizeof(*fkp) * dmxr); |
5e656dbb | 68 | memcpy(tpp, fpp, sizeof(*fpp) * dmxr); |
2bd0ea18 NS |
69 | } |
70 | ||
f9e56f43 | 71 | void |
b37d753d CH |
72 | xfs_bmbt_disk_get_all( |
73 | struct xfs_bmbt_rec *rec, | |
74 | struct xfs_bmbt_irec *irec) | |
2bd0ea18 | 75 | { |
b37d753d CH |
76 | uint64_t l0 = get_unaligned_be64(&rec->l0); |
77 | uint64_t l1 = get_unaligned_be64(&rec->l1); | |
f9e56f43 | 78 | |
b37d753d CH |
79 | irec->br_startoff = (l0 & xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9; |
80 | irec->br_startblock = ((l0 & xfs_mask64lo(9)) << 43) | (l1 >> 21); | |
81 | irec->br_blockcount = l1 & xfs_mask64lo(21); | |
82 | if (l0 >> (64 - BMBT_EXNTFLAG_BITLEN)) | |
83 | irec->br_state = XFS_EXT_UNWRITTEN; | |
84 | else | |
85 | irec->br_state = XFS_EXT_NORM; | |
f9e56f43 NS |
86 | } |
87 | ||
2bd0ea18 | 88 | /* |
b194c7d8 | 89 | * Extract the blockcount field from an on disk bmap extent record. |
2bd0ea18 | 90 | */ |
b194c7d8 BN |
91 | xfs_filblks_t |
92 | xfs_bmbt_disk_get_blockcount( | |
93 | xfs_bmbt_rec_t *r) | |
2bd0ea18 | 94 | { |
56b2de80 | 95 | return (xfs_filblks_t)(be64_to_cpu(r->l1) & xfs_mask64lo(21)); |
2bd0ea18 NS |
96 | } |
97 | ||
2bd0ea18 | 98 | /* |
b194c7d8 | 99 | * Extract the startoff field from a disk format bmap extent record. |
2bd0ea18 | 100 | */ |
b194c7d8 BN |
101 | xfs_fileoff_t |
102 | xfs_bmbt_disk_get_startoff( | |
103 | xfs_bmbt_rec_t *r) | |
2bd0ea18 | 104 | { |
b194c7d8 | 105 | return ((xfs_fileoff_t)be64_to_cpu(r->l0) & |
56b2de80 | 106 | xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9; |
2bd0ea18 NS |
107 | } |
108 | ||
2bd0ea18 | 109 | /* |
d0e5f1ff | 110 | * Set all the fields in a bmap extent record from the uncompressed form. |
2bd0ea18 NS |
111 | */ |
112 | void | |
d0e5f1ff CH |
113 | xfs_bmbt_disk_set_all( |
114 | struct xfs_bmbt_rec *r, | |
115 | struct xfs_bmbt_irec *s) | |
2bd0ea18 | 116 | { |
d0e5f1ff | 117 | int extent_flag = (s->br_state != XFS_EXT_NORM); |
5e656dbb | 118 | |
d0e5f1ff CH |
119 | ASSERT(s->br_state == XFS_EXT_NORM || s->br_state == XFS_EXT_UNWRITTEN); |
120 | ASSERT(!(s->br_startoff & xfs_mask64hi(64-BMBT_STARTOFF_BITLEN))); | |
121 | ASSERT(!(s->br_blockcount & xfs_mask64hi(64-BMBT_BLOCKCOUNT_BITLEN))); | |
122 | ASSERT(!(s->br_startblock & xfs_mask64hi(64-BMBT_STARTBLOCK_BITLEN))); | |
5e656dbb | 123 | |
c2e6c704 | 124 | put_unaligned_be64( |
5e656dbb | 125 | ((xfs_bmbt_rec_base_t)extent_flag << 63) | |
d0e5f1ff | 126 | ((xfs_bmbt_rec_base_t)s->br_startoff << 9) | |
c2e6c704 CH |
127 | ((xfs_bmbt_rec_base_t)s->br_startblock >> 43), &r->l0); |
128 | put_unaligned_be64( | |
d0e5f1ff CH |
129 | ((xfs_bmbt_rec_base_t)s->br_startblock << 21) | |
130 | ((xfs_bmbt_rec_base_t)s->br_blockcount & | |
c2e6c704 | 131 | (xfs_bmbt_rec_base_t)xfs_mask64lo(21)), &r->l1); |
2bd0ea18 | 132 | } |
5e656dbb | 133 | |
2bd0ea18 NS |
134 | /* |
135 | * Convert in-memory form of btree root to on-disk form. | |
136 | */ | |
137 | void | |
138 | xfs_bmbt_to_bmdr( | |
b3563c19 BN |
139 | struct xfs_mount *mp, |
140 | struct xfs_btree_block *rblock, | |
2bd0ea18 NS |
141 | int rblocklen, |
142 | xfs_bmdr_block_t *dblock, | |
143 | int dblocklen) | |
144 | { | |
145 | int dmxr; | |
146 | xfs_bmbt_key_t *fkp; | |
5e656dbb | 147 | __be64 *fpp; |
2bd0ea18 | 148 | xfs_bmbt_key_t *tkp; |
5e656dbb | 149 | __be64 *tpp; |
2bd0ea18 | 150 | |
5dfa5cd2 DC |
151 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
152 | ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_CRC_MAGIC)); | |
9c4e12fb ES |
153 | ASSERT(uuid_equal(&rblock->bb_u.l.bb_uuid, |
154 | &mp->m_sb.sb_meta_uuid)); | |
5dfa5cd2 DC |
155 | ASSERT(rblock->bb_u.l.bb_blkno == |
156 | cpu_to_be64(XFS_BUF_DADDR_NULL)); | |
157 | } else | |
158 | ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_MAGIC)); | |
5a35bf2c DC |
159 | ASSERT(rblock->bb_u.l.bb_leftsib == cpu_to_be64(NULLFSBLOCK)); |
160 | ASSERT(rblock->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK)); | |
a2ceac1f | 161 | ASSERT(rblock->bb_level != 0); |
6e3140c7 NS |
162 | dblock->bb_level = rblock->bb_level; |
163 | dblock->bb_numrecs = rblock->bb_numrecs; | |
ff105f75 | 164 | dmxr = xfs_bmdr_maxrecs(dblocklen, 0); |
b3563c19 BN |
165 | fkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1); |
166 | tkp = XFS_BMDR_KEY_ADDR(dblock, 1); | |
167 | fpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen); | |
168 | tpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr); | |
6e3140c7 | 169 | dmxr = be16_to_cpu(dblock->bb_numrecs); |
32181a02 | 170 | memcpy(tkp, fkp, sizeof(*fkp) * dmxr); |
5e656dbb | 171 | memcpy(tpp, fpp, sizeof(*fpp) * dmxr); |
2bd0ea18 NS |
172 | } |
173 | ||
b194c7d8 BN |
174 | STATIC struct xfs_btree_cur * |
175 | xfs_bmbt_dup_cursor( | |
176 | struct xfs_btree_cur *cur) | |
177 | { | |
178 | struct xfs_btree_cur *new; | |
179 | ||
180 | new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, | |
181 | cur->bc_private.b.ip, cur->bc_private.b.whichfork); | |
182 | ||
183 | /* | |
f33cea1a | 184 | * Copy the firstblock, dfops, and flags values, |
b194c7d8 BN |
185 | * since init cursor doesn't get them. |
186 | */ | |
187 | new->bc_private.b.firstblock = cur->bc_private.b.firstblock; | |
f33cea1a | 188 | new->bc_private.b.dfops = cur->bc_private.b.dfops; |
b194c7d8 BN |
189 | new->bc_private.b.flags = cur->bc_private.b.flags; |
190 | ||
191 | return new; | |
192 | } | |
193 | ||
194 | STATIC void | |
195 | xfs_bmbt_update_cursor( | |
196 | struct xfs_btree_cur *src, | |
197 | struct xfs_btree_cur *dst) | |
198 | { | |
199 | ASSERT((dst->bc_private.b.firstblock != NULLFSBLOCK) || | |
200 | (dst->bc_private.b.ip->i_d.di_flags & XFS_DIFLAG_REALTIME)); | |
f33cea1a | 201 | ASSERT(dst->bc_private.b.dfops == src->bc_private.b.dfops); |
b194c7d8 BN |
202 | |
203 | dst->bc_private.b.allocated += src->bc_private.b.allocated; | |
204 | dst->bc_private.b.firstblock = src->bc_private.b.firstblock; | |
205 | ||
206 | src->bc_private.b.allocated = 0; | |
207 | } | |
208 | ||
209 | STATIC int | |
210 | xfs_bmbt_alloc_block( | |
211 | struct xfs_btree_cur *cur, | |
212 | union xfs_btree_ptr *start, | |
213 | union xfs_btree_ptr *new, | |
b194c7d8 BN |
214 | int *stat) |
215 | { | |
216 | xfs_alloc_arg_t args; /* block allocation args */ | |
217 | int error; /* error return value */ | |
218 | ||
219 | memset(&args, 0, sizeof(args)); | |
220 | args.tp = cur->bc_tp; | |
221 | args.mp = cur->bc_mp; | |
222 | args.fsbno = cur->bc_private.b.firstblock; | |
223 | args.firstblock = args.fsbno; | |
85aec44f DW |
224 | xfs_rmap_ino_bmbt_owner(&args.oinfo, cur->bc_private.b.ip->i_ino, |
225 | cur->bc_private.b.whichfork); | |
b194c7d8 BN |
226 | |
227 | if (args.fsbno == NULLFSBLOCK) { | |
228 | args.fsbno = be64_to_cpu(start->l); | |
229 | args.type = XFS_ALLOCTYPE_START_BNO; | |
230 | /* | |
231 | * Make sure there is sufficient room left in the AG to | |
232 | * complete a full tree split for an extent insert. If | |
233 | * we are converting the middle part of an extent then | |
234 | * we may need space for two tree splits. | |
235 | * | |
236 | * We are relying on the caller to make the correct block | |
237 | * reservation for this operation to succeed. If the | |
238 | * reservation amount is insufficient then we may fail a | |
239 | * block allocation here and corrupt the filesystem. | |
240 | */ | |
0268fdc3 | 241 | args.minleft = args.tp->t_blk_res; |
f33cea1a | 242 | } else if (cur->bc_private.b.dfops->dop_low) { |
b194c7d8 BN |
243 | args.type = XFS_ALLOCTYPE_START_BNO; |
244 | } else { | |
245 | args.type = XFS_ALLOCTYPE_NEAR_BNO; | |
246 | } | |
247 | ||
248 | args.minlen = args.maxlen = args.prod = 1; | |
249 | args.wasdel = cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL; | |
0268fdc3 | 250 | if (!args.wasdel && args.tp->t_blk_res == 0) { |
12b53197 | 251 | error = -ENOSPC; |
b194c7d8 BN |
252 | goto error0; |
253 | } | |
254 | error = xfs_alloc_vextent(&args); | |
255 | if (error) | |
256 | goto error0; | |
257 | ||
258 | if (args.fsbno == NULLFSBLOCK && args.minleft) { | |
259 | /* | |
260 | * Could not find an AG with enough free space to satisfy | |
a3b4a951 | 261 | * a full btree split. Try again and if |
b194c7d8 BN |
262 | * successful activate the lowspace algorithm. |
263 | */ | |
264 | args.fsbno = 0; | |
265 | args.type = XFS_ALLOCTYPE_FIRST_AG; | |
b194c7d8 BN |
266 | error = xfs_alloc_vextent(&args); |
267 | if (error) | |
268 | goto error0; | |
f33cea1a | 269 | cur->bc_private.b.dfops->dop_low = true; |
b194c7d8 | 270 | } |
c1587ecf | 271 | if (WARN_ON_ONCE(args.fsbno == NULLFSBLOCK)) { |
b194c7d8 BN |
272 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); |
273 | *stat = 0; | |
274 | return 0; | |
275 | } | |
276 | ASSERT(args.len == 1); | |
277 | cur->bc_private.b.firstblock = args.fsbno; | |
278 | cur->bc_private.b.allocated++; | |
279 | cur->bc_private.b.ip->i_d.di_nblocks++; | |
280 | xfs_trans_log_inode(args.tp, cur->bc_private.b.ip, XFS_ILOG_CORE); | |
56b2de80 | 281 | xfs_trans_mod_dquot_byino(args.tp, cur->bc_private.b.ip, |
b194c7d8 BN |
282 | XFS_TRANS_DQ_BCOUNT, 1L); |
283 | ||
284 | new->l = cpu_to_be64(args.fsbno); | |
285 | ||
286 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); | |
287 | *stat = 1; | |
288 | return 0; | |
289 | ||
290 | error0: | |
291 | XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR); | |
292 | return error; | |
293 | } | |
294 | ||
295 | STATIC int | |
296 | xfs_bmbt_free_block( | |
297 | struct xfs_btree_cur *cur, | |
298 | struct xfs_buf *bp) | |
299 | { | |
300 | struct xfs_mount *mp = cur->bc_mp; | |
301 | struct xfs_inode *ip = cur->bc_private.b.ip; | |
302 | struct xfs_trans *tp = cur->bc_tp; | |
303 | xfs_fsblock_t fsbno = XFS_DADDR_TO_FSB(mp, XFS_BUF_ADDR(bp)); | |
85aec44f | 304 | struct xfs_owner_info oinfo; |
b194c7d8 | 305 | |
85aec44f DW |
306 | xfs_rmap_ino_bmbt_owner(&oinfo, ip->i_ino, cur->bc_private.b.whichfork); |
307 | xfs_bmap_add_free(mp, cur->bc_private.b.dfops, fsbno, 1, &oinfo); | |
b194c7d8 BN |
308 | ip->i_d.di_nblocks--; |
309 | ||
310 | xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); | |
56b2de80 | 311 | xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L); |
b194c7d8 BN |
312 | return 0; |
313 | } | |
314 | ||
315 | STATIC int | |
316 | xfs_bmbt_get_minrecs( | |
317 | struct xfs_btree_cur *cur, | |
318 | int level) | |
319 | { | |
b3563c19 BN |
320 | if (level == cur->bc_nlevels - 1) { |
321 | struct xfs_ifork *ifp; | |
322 | ||
323 | ifp = XFS_IFORK_PTR(cur->bc_private.b.ip, | |
324 | cur->bc_private.b.whichfork); | |
325 | ||
326 | return xfs_bmbt_maxrecs(cur->bc_mp, | |
327 | ifp->if_broot_bytes, level == 0) / 2; | |
328 | } | |
329 | ||
330 | return cur->bc_mp->m_bmap_dmnr[level != 0]; | |
b194c7d8 BN |
331 | } |
332 | ||
b3563c19 | 333 | int |
b194c7d8 BN |
334 | xfs_bmbt_get_maxrecs( |
335 | struct xfs_btree_cur *cur, | |
336 | int level) | |
337 | { | |
b3563c19 BN |
338 | if (level == cur->bc_nlevels - 1) { |
339 | struct xfs_ifork *ifp; | |
340 | ||
341 | ifp = XFS_IFORK_PTR(cur->bc_private.b.ip, | |
342 | cur->bc_private.b.whichfork); | |
343 | ||
344 | return xfs_bmbt_maxrecs(cur->bc_mp, | |
345 | ifp->if_broot_bytes, level == 0); | |
346 | } | |
347 | ||
348 | return cur->bc_mp->m_bmap_dmxr[level != 0]; | |
349 | ||
b194c7d8 BN |
350 | } |
351 | ||
352 | /* | |
353 | * Get the maximum records we could store in the on-disk format. | |
354 | * | |
355 | * For non-root nodes this is equivalent to xfs_bmbt_get_maxrecs, but | |
356 | * for the root node this checks the available space in the dinode fork | |
357 | * so that we can resize the in-memory buffer to match it. After a | |
358 | * resize to the maximum size this function returns the same value | |
359 | * as xfs_bmbt_get_maxrecs for the root node, too. | |
360 | */ | |
361 | STATIC int | |
362 | xfs_bmbt_get_dmaxrecs( | |
363 | struct xfs_btree_cur *cur, | |
364 | int level) | |
365 | { | |
b3563c19 BN |
366 | if (level != cur->bc_nlevels - 1) |
367 | return cur->bc_mp->m_bmap_dmxr[level != 0]; | |
ff105f75 | 368 | return xfs_bmdr_maxrecs(cur->bc_private.b.forksize, level == 0); |
b194c7d8 BN |
369 | } |
370 | ||
371 | STATIC void | |
372 | xfs_bmbt_init_key_from_rec( | |
373 | union xfs_btree_key *key, | |
374 | union xfs_btree_rec *rec) | |
375 | { | |
376 | key->bmbt.br_startoff = | |
377 | cpu_to_be64(xfs_bmbt_disk_get_startoff(&rec->bmbt)); | |
378 | } | |
379 | ||
4e388bc9 DW |
380 | STATIC void |
381 | xfs_bmbt_init_high_key_from_rec( | |
382 | union xfs_btree_key *key, | |
383 | union xfs_btree_rec *rec) | |
384 | { | |
385 | key->bmbt.br_startoff = cpu_to_be64( | |
386 | xfs_bmbt_disk_get_startoff(&rec->bmbt) + | |
387 | xfs_bmbt_disk_get_blockcount(&rec->bmbt) - 1); | |
388 | } | |
389 | ||
b194c7d8 BN |
390 | STATIC void |
391 | xfs_bmbt_init_rec_from_cur( | |
392 | struct xfs_btree_cur *cur, | |
393 | union xfs_btree_rec *rec) | |
394 | { | |
395 | xfs_bmbt_disk_set_all(&rec->bmbt, &cur->bc_rec.b); | |
396 | } | |
397 | ||
398 | STATIC void | |
399 | xfs_bmbt_init_ptr_from_cur( | |
400 | struct xfs_btree_cur *cur, | |
401 | union xfs_btree_ptr *ptr) | |
402 | { | |
403 | ptr->l = 0; | |
404 | } | |
405 | ||
4a492e72 | 406 | STATIC int64_t |
b194c7d8 BN |
407 | xfs_bmbt_key_diff( |
408 | struct xfs_btree_cur *cur, | |
409 | union xfs_btree_key *key) | |
410 | { | |
4a492e72 | 411 | return (int64_t)be64_to_cpu(key->bmbt.br_startoff) - |
b194c7d8 BN |
412 | cur->bc_rec.b.br_startoff; |
413 | } | |
414 | ||
4e388bc9 DW |
415 | STATIC int64_t |
416 | xfs_bmbt_diff_two_keys( | |
417 | struct xfs_btree_cur *cur, | |
418 | union xfs_btree_key *k1, | |
419 | union xfs_btree_key *k2) | |
420 | { | |
421 | return (int64_t)be64_to_cpu(k1->bmbt.br_startoff) - | |
422 | be64_to_cpu(k2->bmbt.br_startoff); | |
423 | } | |
424 | ||
5dfa5cd2 | 425 | static bool |
a2ceac1f DC |
426 | xfs_bmbt_verify( |
427 | struct xfs_buf *bp) | |
428 | { | |
429 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
430 | struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp); | |
431 | unsigned int level; | |
a2ceac1f | 432 | |
c0adfb03 DC |
433 | switch (block->bb_magic) { |
434 | case cpu_to_be32(XFS_BMAP_CRC_MAGIC): | |
5dfa5cd2 DC |
435 | if (!xfs_sb_version_hascrc(&mp->m_sb)) |
436 | return false; | |
9c4e12fb | 437 | if (!uuid_equal(&block->bb_u.l.bb_uuid, &mp->m_sb.sb_meta_uuid)) |
5dfa5cd2 | 438 | return false; |
c0adfb03 | 439 | if (be64_to_cpu(block->bb_u.l.bb_blkno) != bp->b_bn) |
5dfa5cd2 DC |
440 | return false; |
441 | /* | |
442 | * XXX: need a better way of verifying the owner here. Right now | |
443 | * just make sure there has been one set. | |
444 | */ | |
445 | if (be64_to_cpu(block->bb_u.l.bb_owner) == 0) | |
446 | return false; | |
447 | /* fall through */ | |
c0adfb03 | 448 | case cpu_to_be32(XFS_BMAP_MAGIC): |
5dfa5cd2 DC |
449 | break; |
450 | default: | |
451 | return false; | |
452 | } | |
453 | ||
454 | /* | |
455 | * numrecs and level verification. | |
a2ceac1f | 456 | * |
5dfa5cd2 | 457 | * We don't know what fork we belong to, so just verify that the level |
a2ceac1f DC |
458 | * is less than the maximum of the two. Later checks will be more |
459 | * precise. | |
460 | */ | |
461 | level = be16_to_cpu(block->bb_level); | |
e6d77a21 | 462 | if (level > max(mp->m_bm_maxlevels[0], mp->m_bm_maxlevels[1])) |
5dfa5cd2 DC |
463 | return false; |
464 | if (be16_to_cpu(block->bb_numrecs) > mp->m_bmap_dmxr[level != 0]) | |
465 | return false; | |
a2ceac1f DC |
466 | |
467 | /* sibling pointer verification */ | |
5dfa5cd2 | 468 | if (!block->bb_u.l.bb_leftsib || |
5a35bf2c | 469 | (block->bb_u.l.bb_leftsib != cpu_to_be64(NULLFSBLOCK) && |
5dfa5cd2 DC |
470 | !XFS_FSB_SANITY_CHECK(mp, be64_to_cpu(block->bb_u.l.bb_leftsib)))) |
471 | return false; | |
472 | if (!block->bb_u.l.bb_rightsib || | |
5a35bf2c | 473 | (block->bb_u.l.bb_rightsib != cpu_to_be64(NULLFSBLOCK) && |
5dfa5cd2 DC |
474 | !XFS_FSB_SANITY_CHECK(mp, be64_to_cpu(block->bb_u.l.bb_rightsib)))) |
475 | return false; | |
476 | ||
477 | return true; | |
a2ceac1f DC |
478 | } |
479 | ||
480 | static void | |
481 | xfs_bmbt_read_verify( | |
482 | struct xfs_buf *bp) | |
483 | { | |
45922933 | 484 | if (!xfs_btree_lblock_verify_crc(bp)) |
12b53197 | 485 | xfs_buf_ioerror(bp, -EFSBADCRC); |
45922933 | 486 | else if (!xfs_bmbt_verify(bp)) |
12b53197 | 487 | xfs_buf_ioerror(bp, -EFSCORRUPTED); |
45922933 DC |
488 | |
489 | if (bp->b_error) { | |
490 | trace_xfs_btree_corrupt(bp, _RET_IP_); | |
491 | xfs_verifier_error(bp); | |
5dfa5cd2 | 492 | } |
a2ceac1f DC |
493 | } |
494 | ||
495 | static void | |
496 | xfs_bmbt_write_verify( | |
497 | struct xfs_buf *bp) | |
498 | { | |
5dfa5cd2 | 499 | if (!xfs_bmbt_verify(bp)) { |
5dfa5cd2 | 500 | trace_xfs_btree_corrupt(bp, _RET_IP_); |
12b53197 | 501 | xfs_buf_ioerror(bp, -EFSCORRUPTED); |
45922933 | 502 | xfs_verifier_error(bp); |
5dfa5cd2 DC |
503 | return; |
504 | } | |
505 | xfs_btree_lblock_calc_crc(bp); | |
a2ceac1f DC |
506 | } |
507 | ||
508 | const struct xfs_buf_ops xfs_bmbt_buf_ops = { | |
a3fac935 | 509 | .name = "xfs_bmbt", |
a2ceac1f DC |
510 | .verify_read = xfs_bmbt_read_verify, |
511 | .verify_write = xfs_bmbt_write_verify, | |
512 | }; | |
513 | ||
514 | ||
b194c7d8 BN |
515 | STATIC int |
516 | xfs_bmbt_keys_inorder( | |
517 | struct xfs_btree_cur *cur, | |
518 | union xfs_btree_key *k1, | |
519 | union xfs_btree_key *k2) | |
520 | { | |
521 | return be64_to_cpu(k1->bmbt.br_startoff) < | |
522 | be64_to_cpu(k2->bmbt.br_startoff); | |
523 | } | |
524 | ||
525 | STATIC int | |
526 | xfs_bmbt_recs_inorder( | |
527 | struct xfs_btree_cur *cur, | |
528 | union xfs_btree_rec *r1, | |
529 | union xfs_btree_rec *r2) | |
530 | { | |
531 | return xfs_bmbt_disk_get_startoff(&r1->bmbt) + | |
532 | xfs_bmbt_disk_get_blockcount(&r1->bmbt) <= | |
533 | xfs_bmbt_disk_get_startoff(&r2->bmbt); | |
534 | } | |
b194c7d8 | 535 | |
b194c7d8 BN |
536 | static const struct xfs_btree_ops xfs_bmbt_ops = { |
537 | .rec_len = sizeof(xfs_bmbt_rec_t), | |
538 | .key_len = sizeof(xfs_bmbt_key_t), | |
539 | ||
540 | .dup_cursor = xfs_bmbt_dup_cursor, | |
541 | .update_cursor = xfs_bmbt_update_cursor, | |
542 | .alloc_block = xfs_bmbt_alloc_block, | |
543 | .free_block = xfs_bmbt_free_block, | |
544 | .get_maxrecs = xfs_bmbt_get_maxrecs, | |
545 | .get_minrecs = xfs_bmbt_get_minrecs, | |
546 | .get_dmaxrecs = xfs_bmbt_get_dmaxrecs, | |
547 | .init_key_from_rec = xfs_bmbt_init_key_from_rec, | |
4e388bc9 | 548 | .init_high_key_from_rec = xfs_bmbt_init_high_key_from_rec, |
b194c7d8 BN |
549 | .init_rec_from_cur = xfs_bmbt_init_rec_from_cur, |
550 | .init_ptr_from_cur = xfs_bmbt_init_ptr_from_cur, | |
551 | .key_diff = xfs_bmbt_key_diff, | |
4e388bc9 | 552 | .diff_two_keys = xfs_bmbt_diff_two_keys, |
a2ceac1f | 553 | .buf_ops = &xfs_bmbt_buf_ops, |
b194c7d8 BN |
554 | .keys_inorder = xfs_bmbt_keys_inorder, |
555 | .recs_inorder = xfs_bmbt_recs_inorder, | |
b194c7d8 BN |
556 | }; |
557 | ||
558 | /* | |
559 | * Allocate a new bmap btree cursor. | |
560 | */ | |
561 | struct xfs_btree_cur * /* new bmap btree cursor */ | |
562 | xfs_bmbt_init_cursor( | |
563 | struct xfs_mount *mp, /* file system mount point */ | |
564 | struct xfs_trans *tp, /* transaction pointer */ | |
565 | struct xfs_inode *ip, /* inode owning the btree */ | |
566 | int whichfork) /* data or attr fork */ | |
567 | { | |
568 | struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork); | |
569 | struct xfs_btree_cur *cur; | |
cb8a004a | 570 | ASSERT(whichfork != XFS_COW_FORK); |
b194c7d8 | 571 | |
762989ef | 572 | cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_NOFS); |
b194c7d8 BN |
573 | |
574 | cur->bc_tp = tp; | |
575 | cur->bc_mp = mp; | |
576 | cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; | |
577 | cur->bc_btnum = XFS_BTNUM_BMAP; | |
578 | cur->bc_blocklog = mp->m_sb.sb_blocklog; | |
5d8acc46 | 579 | cur->bc_statoff = XFS_STATS_CALC_INDEX(xs_bmbt_2); |
b194c7d8 BN |
580 | |
581 | cur->bc_ops = &xfs_bmbt_ops; | |
582 | cur->bc_flags = XFS_BTREE_LONG_PTRS | XFS_BTREE_ROOT_IN_INODE; | |
5dfa5cd2 DC |
583 | if (xfs_sb_version_hascrc(&mp->m_sb)) |
584 | cur->bc_flags |= XFS_BTREE_CRC_BLOCKS; | |
b194c7d8 BN |
585 | |
586 | cur->bc_private.b.forksize = XFS_IFORK_SIZE(ip, whichfork); | |
587 | cur->bc_private.b.ip = ip; | |
588 | cur->bc_private.b.firstblock = NULLFSBLOCK; | |
f33cea1a | 589 | cur->bc_private.b.dfops = NULL; |
b194c7d8 BN |
590 | cur->bc_private.b.allocated = 0; |
591 | cur->bc_private.b.flags = 0; | |
592 | cur->bc_private.b.whichfork = whichfork; | |
593 | ||
594 | return cur; | |
595 | } | |
b3563c19 BN |
596 | |
597 | /* | |
598 | * Calculate number of records in a bmap btree block. | |
599 | */ | |
600 | int | |
601 | xfs_bmbt_maxrecs( | |
602 | struct xfs_mount *mp, | |
603 | int blocklen, | |
604 | int leaf) | |
605 | { | |
606 | blocklen -= XFS_BMBT_BLOCK_LEN(mp); | |
607 | ||
608 | if (leaf) | |
609 | return blocklen / sizeof(xfs_bmbt_rec_t); | |
610 | return blocklen / (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t)); | |
611 | } | |
612 | ||
613 | /* | |
614 | * Calculate number of records in a bmap btree inode root. | |
615 | */ | |
616 | int | |
617 | xfs_bmdr_maxrecs( | |
b3563c19 BN |
618 | int blocklen, |
619 | int leaf) | |
620 | { | |
621 | blocklen -= sizeof(xfs_bmdr_block_t); | |
622 | ||
623 | if (leaf) | |
624 | return blocklen / sizeof(xfs_bmdr_rec_t); | |
625 | return blocklen / (sizeof(xfs_bmdr_key_t) + sizeof(xfs_bmdr_ptr_t)); | |
626 | } | |
9c6ebc42 DC |
627 | |
628 | /* | |
ff105f75 | 629 | * Change the owner of a btree format fork fo the inode passed in. Change it to |
9c6ebc42 DC |
630 | * the owner of that is passed in so that we can change owners before or after |
631 | * we switch forks between inodes. The operation that the caller is doing will | |
632 | * determine whether is needs to change owner before or after the switch. | |
633 | * | |
634 | * For demand paged transactional modification, the fork switch should be done | |
635 | * after reading in all the blocks, modifying them and pinning them in the | |
636 | * transaction. For modification when the buffers are already pinned in memory, | |
637 | * the fork switch can be done before changing the owner as we won't need to | |
638 | * validate the owner until the btree buffers are unpinned and writes can occur | |
639 | * again. | |
640 | * | |
641 | * For recovery based ownership change, there is no transactional context and | |
642 | * so a buffer list must be supplied so that we can record the buffers that we | |
643 | * modified for the caller to issue IO on. | |
644 | */ | |
645 | int | |
646 | xfs_bmbt_change_owner( | |
647 | struct xfs_trans *tp, | |
648 | struct xfs_inode *ip, | |
649 | int whichfork, | |
650 | xfs_ino_t new_owner, | |
651 | struct list_head *buffer_list) | |
652 | { | |
653 | struct xfs_btree_cur *cur; | |
654 | int error; | |
655 | ||
656 | ASSERT(tp || buffer_list); | |
657 | ASSERT(!(tp && buffer_list)); | |
658 | if (whichfork == XFS_DATA_FORK) | |
659 | ASSERT(ip->i_d.di_format == XFS_DINODE_FMT_BTREE); | |
660 | else | |
661 | ASSERT(ip->i_d.di_aformat == XFS_DINODE_FMT_BTREE); | |
662 | ||
663 | cur = xfs_bmbt_init_cursor(ip->i_mount, tp, ip, whichfork); | |
664 | if (!cur) | |
12b53197 | 665 | return -ENOMEM; |
c7ba1731 | 666 | cur->bc_private.b.flags |= XFS_BTCUR_BPRV_INVALID_OWNER; |
9c6ebc42 DC |
667 | |
668 | error = xfs_btree_change_owner(cur, new_owner, buffer_list); | |
669 | xfs_btree_del_cursor(cur, error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); | |
670 | return error; | |
671 | } |