]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blame - fs/xfs/libxfs/xfs_bmap_btree.c
xfs: bmapbt checking on debug kernels too expensive
[mirror_ubuntu-zesty-kernel.git] / fs / xfs / libxfs / xfs_bmap_btree.c
CommitLineData
1da177e4 1/*
7b718769
NS
2 * Copyright (c) 2000-2003,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 17 */
1da177e4 18#include "xfs.h"
a844f451 19#include "xfs_fs.h"
632b89e8 20#include "xfs_shared.h"
6ca1c906 21#include "xfs_format.h"
239880ef
DC
22#include "xfs_log_format.h"
23#include "xfs_trans_resv.h"
a844f451 24#include "xfs_bit.h"
1da177e4 25#include "xfs_mount.h"
1da177e4 26#include "xfs_inode.h"
239880ef 27#include "xfs_trans.h"
a844f451 28#include "xfs_inode_item.h"
1da177e4 29#include "xfs_alloc.h"
a844f451 30#include "xfs_btree.h"
a4fbe6ab 31#include "xfs_bmap_btree.h"
1da177e4
LT
32#include "xfs_bmap.h"
33#include "xfs_error.h"
34#include "xfs_quota.h"
3d3e6f64 35#include "xfs_trace.h"
ee1a47ab 36#include "xfs_cksum.h"
1da177e4 37
1da177e4
LT
38/*
39 * Determine the extent state.
40 */
41/* ARGSUSED */
42STATIC xfs_exntst_t
43xfs_extent_state(
44 xfs_filblks_t blks,
45 int extent_flag)
46{
47 if (extent_flag) {
48 ASSERT(blks != 0); /* saved for DMIG */
49 return XFS_EXT_UNWRITTEN;
50 }
51 return XFS_EXT_NORM;
52}
53
1da177e4
LT
54/*
55 * Convert on-disk form of btree root to in-memory form.
56 */
57void
58xfs_bmdr_to_bmbt(
ee1a47ab 59 struct xfs_inode *ip,
1da177e4
LT
60 xfs_bmdr_block_t *dblock,
61 int dblocklen,
7cc95a82 62 struct xfs_btree_block *rblock,
1da177e4
LT
63 int rblocklen)
64{
ee1a47ab 65 struct xfs_mount *mp = ip->i_mount;
1da177e4
LT
66 int dmxr;
67 xfs_bmbt_key_t *fkp;
576039cf 68 __be64 *fpp;
1da177e4 69 xfs_bmbt_key_t *tkp;
576039cf 70 __be64 *tpp;
1da177e4 71
ee1a47ab
CH
72 if (xfs_sb_version_hascrc(&mp->m_sb))
73 xfs_btree_init_block_int(mp, rblock, XFS_BUF_DADDR_NULL,
74 XFS_BMAP_CRC_MAGIC, 0, 0, ip->i_ino,
75 XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS);
76 else
77 xfs_btree_init_block_int(mp, rblock, XFS_BUF_DADDR_NULL,
78 XFS_BMAP_MAGIC, 0, 0, ip->i_ino,
79 XFS_BTREE_LONG_PTRS);
80
16259e7d
CH
81 rblock->bb_level = dblock->bb_level;
82 ASSERT(be16_to_cpu(rblock->bb_level) > 0);
83 rblock->bb_numrecs = dblock->bb_numrecs;
152d93b7 84 dmxr = xfs_bmdr_maxrecs(dblocklen, 0);
136341b4
CH
85 fkp = XFS_BMDR_KEY_ADDR(dblock, 1);
86 tkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1);
87 fpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr);
60197e8d 88 tpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen);
16259e7d 89 dmxr = be16_to_cpu(dblock->bb_numrecs);
1da177e4 90 memcpy(tkp, fkp, sizeof(*fkp) * dmxr);
576039cf 91 memcpy(tpp, fpp, sizeof(*fpp) * dmxr);
1da177e4
LT
92}
93
1da177e4
LT
94/*
95 * Convert a compressed bmap extent record to an uncompressed form.
96 * This code must be in sync with the routines xfs_bmbt_get_startoff,
97 * xfs_bmbt_get_startblock, xfs_bmbt_get_blockcount and xfs_bmbt_get_state.
98 */
b8f82a4a 99STATIC void
1da177e4
LT
100__xfs_bmbt_get_all(
101 __uint64_t l0,
102 __uint64_t l1,
103 xfs_bmbt_irec_t *s)
104{
105 int ext_flag;
106 xfs_exntst_t st;
107
108 ext_flag = (int)(l0 >> (64 - BMBT_EXNTFLAG_BITLEN));
109 s->br_startoff = ((xfs_fileoff_t)l0 &
fb82557f 110 xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
fb82557f 111 s->br_startblock = (((xfs_fsblock_t)l0 & xfs_mask64lo(9)) << 43) |
1da177e4 112 (((xfs_fsblock_t)l1) >> 21);
fb82557f 113 s->br_blockcount = (xfs_filblks_t)(l1 & xfs_mask64lo(21));
1da177e4
LT
114 /* This is xfs_extent_state() in-line */
115 if (ext_flag) {
116 ASSERT(s->br_blockcount != 0); /* saved for DMIG */
117 st = XFS_EXT_UNWRITTEN;
118 } else
119 st = XFS_EXT_NORM;
120 s->br_state = st;
121}
122
123void
124xfs_bmbt_get_all(
a6f64d4a 125 xfs_bmbt_rec_host_t *r,
1da177e4
LT
126 xfs_bmbt_irec_t *s)
127{
128 __xfs_bmbt_get_all(r->l0, r->l1, s);
129}
130
1da177e4
LT
131/*
132 * Extract the blockcount field from an in memory bmap extent record.
133 */
134xfs_filblks_t
135xfs_bmbt_get_blockcount(
a6f64d4a 136 xfs_bmbt_rec_host_t *r)
1da177e4 137{
fb82557f 138 return (xfs_filblks_t)(r->l1 & xfs_mask64lo(21));
1da177e4
LT
139}
140
141/*
142 * Extract the startblock field from an in memory bmap extent record.
143 */
144xfs_fsblock_t
145xfs_bmbt_get_startblock(
a6f64d4a 146 xfs_bmbt_rec_host_t *r)
1da177e4 147{
fb82557f 148 return (((xfs_fsblock_t)r->l0 & xfs_mask64lo(9)) << 43) |
1da177e4 149 (((xfs_fsblock_t)r->l1) >> 21);
1da177e4
LT
150}
151
152/*
153 * Extract the startoff field from an in memory bmap extent record.
154 */
155xfs_fileoff_t
156xfs_bmbt_get_startoff(
a6f64d4a 157 xfs_bmbt_rec_host_t *r)
1da177e4
LT
158{
159 return ((xfs_fileoff_t)r->l0 &
fb82557f 160 xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
1da177e4
LT
161}
162
163xfs_exntst_t
164xfs_bmbt_get_state(
a6f64d4a 165 xfs_bmbt_rec_host_t *r)
1da177e4
LT
166{
167 int ext_flag;
168
169 ext_flag = (int)((r->l0) >> (64 - BMBT_EXNTFLAG_BITLEN));
170 return xfs_extent_state(xfs_bmbt_get_blockcount(r),
171 ext_flag);
172}
173
1da177e4
LT
174/*
175 * Extract the blockcount field from an on disk bmap extent record.
176 */
177xfs_filblks_t
178xfs_bmbt_disk_get_blockcount(
179 xfs_bmbt_rec_t *r)
180{
fb82557f 181 return (xfs_filblks_t)(be64_to_cpu(r->l1) & xfs_mask64lo(21));
1da177e4
LT
182}
183
1da177e4
LT
184/*
185 * Extract the startoff field from a disk format bmap extent record.
186 */
187xfs_fileoff_t
188xfs_bmbt_disk_get_startoff(
189 xfs_bmbt_rec_t *r)
190{
cd8b0a97 191 return ((xfs_fileoff_t)be64_to_cpu(r->l0) &
fb82557f 192 xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
1da177e4 193}
1da177e4 194
1da177e4 195
1da177e4
LT
196/*
197 * Set all the fields in a bmap extent record from the arguments.
198 */
199void
200xfs_bmbt_set_allf(
8cba4344
CH
201 xfs_bmbt_rec_host_t *r,
202 xfs_fileoff_t startoff,
203 xfs_fsblock_t startblock,
204 xfs_filblks_t blockcount,
205 xfs_exntst_t state)
1da177e4 206{
8cba4344
CH
207 int extent_flag = (state == XFS_EXT_NORM) ? 0 : 1;
208
209 ASSERT(state == XFS_EXT_NORM || state == XFS_EXT_UNWRITTEN);
fb82557f
ES
210 ASSERT((startoff & xfs_mask64hi(64-BMBT_STARTOFF_BITLEN)) == 0);
211 ASSERT((blockcount & xfs_mask64hi(64-BMBT_BLOCKCOUNT_BITLEN)) == 0);
1da177e4 212
fb82557f 213 ASSERT((startblock & xfs_mask64hi(64-BMBT_STARTBLOCK_BITLEN)) == 0);
8cba4344 214
1da177e4 215 r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
8cba4344
CH
216 ((xfs_bmbt_rec_base_t)startoff << 9) |
217 ((xfs_bmbt_rec_base_t)startblock >> 43);
218 r->l1 = ((xfs_bmbt_rec_base_t)startblock << 21) |
219 ((xfs_bmbt_rec_base_t)blockcount &
fb82557f 220 (xfs_bmbt_rec_base_t)xfs_mask64lo(21));
1da177e4
LT
221}
222
1da177e4
LT
223/*
224 * Set all the fields in a bmap extent record from the uncompressed form.
225 */
226void
8cba4344
CH
227xfs_bmbt_set_all(
228 xfs_bmbt_rec_host_t *r,
229 xfs_bmbt_irec_t *s)
1da177e4 230{
8cba4344
CH
231 xfs_bmbt_set_allf(r, s->br_startoff, s->br_startblock,
232 s->br_blockcount, s->br_state);
1da177e4
LT
233}
234
8cba4344 235
1da177e4
LT
236/*
237 * Set all the fields in a disk format bmap extent record from the arguments.
238 */
239void
240xfs_bmbt_disk_set_allf(
8cba4344
CH
241 xfs_bmbt_rec_t *r,
242 xfs_fileoff_t startoff,
243 xfs_fsblock_t startblock,
244 xfs_filblks_t blockcount,
245 xfs_exntst_t state)
1da177e4 246{
8cba4344
CH
247 int extent_flag = (state == XFS_EXT_NORM) ? 0 : 1;
248
249 ASSERT(state == XFS_EXT_NORM || state == XFS_EXT_UNWRITTEN);
fb82557f
ES
250 ASSERT((startoff & xfs_mask64hi(64-BMBT_STARTOFF_BITLEN)) == 0);
251 ASSERT((blockcount & xfs_mask64hi(64-BMBT_BLOCKCOUNT_BITLEN)) == 0);
fb82557f 252 ASSERT((startblock & xfs_mask64hi(64-BMBT_STARTBLOCK_BITLEN)) == 0);
8cba4344 253
cd8b0a97 254 r->l0 = cpu_to_be64(
8cba4344
CH
255 ((xfs_bmbt_rec_base_t)extent_flag << 63) |
256 ((xfs_bmbt_rec_base_t)startoff << 9) |
257 ((xfs_bmbt_rec_base_t)startblock >> 43));
cd8b0a97 258 r->l1 = cpu_to_be64(
8cba4344
CH
259 ((xfs_bmbt_rec_base_t)startblock << 21) |
260 ((xfs_bmbt_rec_base_t)blockcount &
fb82557f 261 (xfs_bmbt_rec_base_t)xfs_mask64lo(21)));
1da177e4 262}
8cba4344
CH
263
264/*
265 * Set all the fields in a bmap extent record from the uncompressed form.
266 */
5d77c0dc 267STATIC void
8cba4344
CH
268xfs_bmbt_disk_set_all(
269 xfs_bmbt_rec_t *r,
270 xfs_bmbt_irec_t *s)
271{
272 xfs_bmbt_disk_set_allf(r, s->br_startoff, s->br_startblock,
273 s->br_blockcount, s->br_state);
274}
1da177e4
LT
275
276/*
277 * Set the blockcount field in a bmap extent record.
278 */
279void
280xfs_bmbt_set_blockcount(
a6f64d4a 281 xfs_bmbt_rec_host_t *r,
1da177e4
LT
282 xfs_filblks_t v)
283{
fb82557f
ES
284 ASSERT((v & xfs_mask64hi(43)) == 0);
285 r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)xfs_mask64hi(43)) |
286 (xfs_bmbt_rec_base_t)(v & xfs_mask64lo(21));
1da177e4
LT
287}
288
289/*
290 * Set the startblock field in a bmap extent record.
291 */
292void
293xfs_bmbt_set_startblock(
a6f64d4a 294 xfs_bmbt_rec_host_t *r,
1da177e4
LT
295 xfs_fsblock_t v)
296{
fb82557f
ES
297 ASSERT((v & xfs_mask64hi(12)) == 0);
298 r->l0 = (r->l0 & (xfs_bmbt_rec_base_t)xfs_mask64hi(55)) |
1da177e4 299 (xfs_bmbt_rec_base_t)(v >> 43);
fb82557f 300 r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)xfs_mask64lo(21)) |
1da177e4 301 (xfs_bmbt_rec_base_t)(v << 21);
1da177e4
LT
302}
303
304/*
305 * Set the startoff field in a bmap extent record.
306 */
307void
308xfs_bmbt_set_startoff(
a6f64d4a 309 xfs_bmbt_rec_host_t *r,
1da177e4
LT
310 xfs_fileoff_t v)
311{
fb82557f
ES
312 ASSERT((v & xfs_mask64hi(9)) == 0);
313 r->l0 = (r->l0 & (xfs_bmbt_rec_base_t) xfs_mask64hi(1)) |
1da177e4 314 ((xfs_bmbt_rec_base_t)v << 9) |
fb82557f 315 (r->l0 & (xfs_bmbt_rec_base_t)xfs_mask64lo(9));
1da177e4
LT
316}
317
318/*
319 * Set the extent state field in a bmap extent record.
320 */
321void
322xfs_bmbt_set_state(
a6f64d4a 323 xfs_bmbt_rec_host_t *r,
1da177e4
LT
324 xfs_exntst_t v)
325{
326 ASSERT(v == XFS_EXT_NORM || v == XFS_EXT_UNWRITTEN);
327 if (v == XFS_EXT_NORM)
fb82557f 328 r->l0 &= xfs_mask64lo(64 - BMBT_EXNTFLAG_BITLEN);
1da177e4 329 else
fb82557f 330 r->l0 |= xfs_mask64hi(BMBT_EXNTFLAG_BITLEN);
1da177e4
LT
331}
332
333/*
334 * Convert in-memory form of btree root to on-disk form.
335 */
336void
337xfs_bmbt_to_bmdr(
60197e8d 338 struct xfs_mount *mp,
7cc95a82 339 struct xfs_btree_block *rblock,
1da177e4
LT
340 int rblocklen,
341 xfs_bmdr_block_t *dblock,
342 int dblocklen)
343{
344 int dmxr;
345 xfs_bmbt_key_t *fkp;
576039cf 346 __be64 *fpp;
1da177e4 347 xfs_bmbt_key_t *tkp;
576039cf 348 __be64 *tpp;
1da177e4 349
ee1a47ab
CH
350 if (xfs_sb_version_hascrc(&mp->m_sb)) {
351 ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_CRC_MAGIC));
ce748eaa
ES
352 ASSERT(uuid_equal(&rblock->bb_u.l.bb_uuid,
353 &mp->m_sb.sb_meta_uuid));
ee1a47ab
CH
354 ASSERT(rblock->bb_u.l.bb_blkno ==
355 cpu_to_be64(XFS_BUF_DADDR_NULL));
356 } else
357 ASSERT(rblock->bb_magic == cpu_to_be32(XFS_BMAP_MAGIC));
d5cf09ba
CH
358 ASSERT(rblock->bb_u.l.bb_leftsib == cpu_to_be64(NULLFSBLOCK));
359 ASSERT(rblock->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK));
69ef921b 360 ASSERT(rblock->bb_level != 0);
16259e7d
CH
361 dblock->bb_level = rblock->bb_level;
362 dblock->bb_numrecs = rblock->bb_numrecs;
152d93b7 363 dmxr = xfs_bmdr_maxrecs(dblocklen, 0);
136341b4
CH
364 fkp = XFS_BMBT_KEY_ADDR(mp, rblock, 1);
365 tkp = XFS_BMDR_KEY_ADDR(dblock, 1);
60197e8d 366 fpp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, rblocklen);
136341b4 367 tpp = XFS_BMDR_PTR_ADDR(dblock, 1, dmxr);
16259e7d 368 dmxr = be16_to_cpu(dblock->bb_numrecs);
1da177e4 369 memcpy(tkp, fkp, sizeof(*fkp) * dmxr);
576039cf 370 memcpy(tpp, fpp, sizeof(*fpp) * dmxr);
1da177e4
LT
371}
372
1da177e4 373/*
4eea22f0 374 * Check extent records, which have just been read, for
1da177e4
LT
375 * any bit in the extent flag field. ASSERT on debug
376 * kernels, as this condition should not occur.
377 * Return an error condition (1) if any flags found,
378 * otherwise return 0.
379 */
380
381int
382xfs_check_nostate_extents(
4eea22f0
MK
383 xfs_ifork_t *ifp,
384 xfs_extnum_t idx,
1da177e4
LT
385 xfs_extnum_t num)
386{
4eea22f0 387 for (; num > 0; num--, idx++) {
a6f64d4a 388 xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx);
1da177e4
LT
389 if ((ep->l0 >>
390 (64 - BMBT_EXNTFLAG_BITLEN)) != 0) {
391 ASSERT(0);
392 return 1;
393 }
394 }
395 return 0;
396}
561f7d17
CH
397
398
399STATIC struct xfs_btree_cur *
400xfs_bmbt_dup_cursor(
401 struct xfs_btree_cur *cur)
402{
403 struct xfs_btree_cur *new;
404
405 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp,
406 cur->bc_private.b.ip, cur->bc_private.b.whichfork);
407
408 /*
409 * Copy the firstblock, flist, and flags values,
410 * since init cursor doesn't get them.
411 */
412 new->bc_private.b.firstblock = cur->bc_private.b.firstblock;
413 new->bc_private.b.flist = cur->bc_private.b.flist;
414 new->bc_private.b.flags = cur->bc_private.b.flags;
415
416 return new;
417}
418
4b22a571
CH
419STATIC void
420xfs_bmbt_update_cursor(
421 struct xfs_btree_cur *src,
422 struct xfs_btree_cur *dst)
423{
424 ASSERT((dst->bc_private.b.firstblock != NULLFSBLOCK) ||
425 (dst->bc_private.b.ip->i_d.di_flags & XFS_DIFLAG_REALTIME));
426 ASSERT(dst->bc_private.b.flist == src->bc_private.b.flist);
427
428 dst->bc_private.b.allocated += src->bc_private.b.allocated;
429 dst->bc_private.b.firstblock = src->bc_private.b.firstblock;
430
431 src->bc_private.b.allocated = 0;
432}
433
f5eb8e7c
CH
434STATIC int
435xfs_bmbt_alloc_block(
436 struct xfs_btree_cur *cur,
437 union xfs_btree_ptr *start,
438 union xfs_btree_ptr *new,
f5eb8e7c
CH
439 int *stat)
440{
441 xfs_alloc_arg_t args; /* block allocation args */
442 int error; /* error return value */
443
444 memset(&args, 0, sizeof(args));
445 args.tp = cur->bc_tp;
446 args.mp = cur->bc_mp;
447 args.fsbno = cur->bc_private.b.firstblock;
448 args.firstblock = args.fsbno;
449
450 if (args.fsbno == NULLFSBLOCK) {
451 args.fsbno = be64_to_cpu(start->l);
452 args.type = XFS_ALLOCTYPE_START_BNO;
453 /*
454 * Make sure there is sufficient room left in the AG to
455 * complete a full tree split for an extent insert. If
456 * we are converting the middle part of an extent then
457 * we may need space for two tree splits.
458 *
459 * We are relying on the caller to make the correct block
460 * reservation for this operation to succeed. If the
461 * reservation amount is insufficient then we may fail a
462 * block allocation here and corrupt the filesystem.
463 */
464 args.minleft = xfs_trans_get_block_res(args.tp);
465 } else if (cur->bc_private.b.flist->xbf_low) {
466 args.type = XFS_ALLOCTYPE_START_BNO;
467 } else {
468 args.type = XFS_ALLOCTYPE_NEAR_BNO;
469 }
470
471 args.minlen = args.maxlen = args.prod = 1;
472 args.wasdel = cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL;
473 if (!args.wasdel && xfs_trans_get_block_res(args.tp) == 0) {
2451337d 474 error = -ENOSPC;
f5eb8e7c
CH
475 goto error0;
476 }
477 error = xfs_alloc_vextent(&args);
478 if (error)
479 goto error0;
480
481 if (args.fsbno == NULLFSBLOCK && args.minleft) {
482 /*
483 * Could not find an AG with enough free space to satisfy
484 * a full btree split. Try again without minleft and if
485 * successful activate the lowspace algorithm.
486 */
487 args.fsbno = 0;
488 args.type = XFS_ALLOCTYPE_FIRST_AG;
489 args.minleft = 0;
490 error = xfs_alloc_vextent(&args);
491 if (error)
492 goto error0;
493 cur->bc_private.b.flist->xbf_low = 1;
494 }
495 if (args.fsbno == NULLFSBLOCK) {
496 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
497 *stat = 0;
498 return 0;
499 }
500 ASSERT(args.len == 1);
501 cur->bc_private.b.firstblock = args.fsbno;
502 cur->bc_private.b.allocated++;
503 cur->bc_private.b.ip->i_d.di_nblocks++;
504 xfs_trans_log_inode(args.tp, cur->bc_private.b.ip, XFS_ILOG_CORE);
7d095257 505 xfs_trans_mod_dquot_byino(args.tp, cur->bc_private.b.ip,
f5eb8e7c
CH
506 XFS_TRANS_DQ_BCOUNT, 1L);
507
508 new->l = cpu_to_be64(args.fsbno);
509
510 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
511 *stat = 1;
512 return 0;
513
514 error0:
515 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
516 return error;
517}
518
d4b3a4b7
CH
519STATIC int
520xfs_bmbt_free_block(
521 struct xfs_btree_cur *cur,
522 struct xfs_buf *bp)
523{
524 struct xfs_mount *mp = cur->bc_mp;
525 struct xfs_inode *ip = cur->bc_private.b.ip;
526 struct xfs_trans *tp = cur->bc_tp;
527 xfs_fsblock_t fsbno = XFS_DADDR_TO_FSB(mp, XFS_BUF_ADDR(bp));
528
529 xfs_bmap_add_free(fsbno, 1, cur->bc_private.b.flist, mp);
530 ip->i_d.di_nblocks--;
531
532 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
7d095257 533 xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L);
d4b3a4b7
CH
534 xfs_trans_binval(tp, bp);
535 return 0;
536}
537
91cca5df
CH
538STATIC int
539xfs_bmbt_get_minrecs(
540 struct xfs_btree_cur *cur,
541 int level)
542{
60197e8d
CH
543 if (level == cur->bc_nlevels - 1) {
544 struct xfs_ifork *ifp;
545
546 ifp = XFS_IFORK_PTR(cur->bc_private.b.ip,
547 cur->bc_private.b.whichfork);
548
549 return xfs_bmbt_maxrecs(cur->bc_mp,
550 ifp->if_broot_bytes, level == 0) / 2;
551 }
552
553 return cur->bc_mp->m_bmap_dmnr[level != 0];
91cca5df
CH
554}
555
60197e8d 556int
ce5e42db
CH
557xfs_bmbt_get_maxrecs(
558 struct xfs_btree_cur *cur,
559 int level)
560{
60197e8d
CH
561 if (level == cur->bc_nlevels - 1) {
562 struct xfs_ifork *ifp;
563
564 ifp = XFS_IFORK_PTR(cur->bc_private.b.ip,
565 cur->bc_private.b.whichfork);
566
567 return xfs_bmbt_maxrecs(cur->bc_mp,
568 ifp->if_broot_bytes, level == 0);
569 }
570
571 return cur->bc_mp->m_bmap_dmxr[level != 0];
572
ce5e42db
CH
573}
574
4b22a571
CH
575/*
576 * Get the maximum records we could store in the on-disk format.
577 *
578 * For non-root nodes this is equivalent to xfs_bmbt_get_maxrecs, but
579 * for the root node this checks the available space in the dinode fork
580 * so that we can resize the in-memory buffer to match it. After a
581 * resize to the maximum size this function returns the same value
582 * as xfs_bmbt_get_maxrecs for the root node, too.
583 */
584STATIC int
585xfs_bmbt_get_dmaxrecs(
586 struct xfs_btree_cur *cur,
587 int level)
588{
60197e8d
CH
589 if (level != cur->bc_nlevels - 1)
590 return cur->bc_mp->m_bmap_dmxr[level != 0];
152d93b7 591 return xfs_bmdr_maxrecs(cur->bc_private.b.forksize, level == 0);
4b22a571
CH
592}
593
fe033cc8
CH
594STATIC void
595xfs_bmbt_init_key_from_rec(
596 union xfs_btree_key *key,
597 union xfs_btree_rec *rec)
598{
599 key->bmbt.br_startoff =
600 cpu_to_be64(xfs_bmbt_disk_get_startoff(&rec->bmbt));
601}
602
4b22a571
CH
603STATIC void
604xfs_bmbt_init_rec_from_key(
605 union xfs_btree_key *key,
606 union xfs_btree_rec *rec)
607{
608 ASSERT(key->bmbt.br_startoff != 0);
609
610 xfs_bmbt_disk_set_allf(&rec->bmbt, be64_to_cpu(key->bmbt.br_startoff),
611 0, 0, XFS_EXT_NORM);
612}
613
614STATIC void
615xfs_bmbt_init_rec_from_cur(
616 struct xfs_btree_cur *cur,
617 union xfs_btree_rec *rec)
618{
619 xfs_bmbt_disk_set_all(&rec->bmbt, &cur->bc_rec.b);
620}
621
fe033cc8
CH
622STATIC void
623xfs_bmbt_init_ptr_from_cur(
624 struct xfs_btree_cur *cur,
625 union xfs_btree_ptr *ptr)
626{
627 ptr->l = 0;
628}
629
630STATIC __int64_t
631xfs_bmbt_key_diff(
632 struct xfs_btree_cur *cur,
633 union xfs_btree_key *key)
634{
635 return (__int64_t)be64_to_cpu(key->bmbt.br_startoff) -
636 cur->bc_rec.b.br_startoff;
637}
638
c5c249b4 639static bool
612cfbfe 640xfs_bmbt_verify(
3d3e6f64
DC
641 struct xfs_buf *bp)
642{
643 struct xfs_mount *mp = bp->b_target->bt_mount;
644 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
645 unsigned int level;
3d3e6f64 646
ee1a47ab
CH
647 switch (block->bb_magic) {
648 case cpu_to_be32(XFS_BMAP_CRC_MAGIC):
649 if (!xfs_sb_version_hascrc(&mp->m_sb))
650 return false;
ce748eaa 651 if (!uuid_equal(&block->bb_u.l.bb_uuid, &mp->m_sb.sb_meta_uuid))
ee1a47ab
CH
652 return false;
653 if (be64_to_cpu(block->bb_u.l.bb_blkno) != bp->b_bn)
654 return false;
655 /*
656 * XXX: need a better way of verifying the owner here. Right now
657 * just make sure there has been one set.
658 */
659 if (be64_to_cpu(block->bb_u.l.bb_owner) == 0)
660 return false;
661 /* fall through */
662 case cpu_to_be32(XFS_BMAP_MAGIC):
663 break;
664 default:
665 return false;
666 }
667
668 /*
669 * numrecs and level verification.
3d3e6f64 670 *
ee1a47ab 671 * We don't know what fork we belong to, so just verify that the level
3d3e6f64
DC
672 * is less than the maximum of the two. Later checks will be more
673 * precise.
674 */
675 level = be16_to_cpu(block->bb_level);
ee1a47ab
CH
676 if (level > max(mp->m_bm_maxlevels[0], mp->m_bm_maxlevels[1]))
677 return false;
678 if (be16_to_cpu(block->bb_numrecs) > mp->m_bmap_dmxr[level != 0])
679 return false;
3d3e6f64
DC
680
681 /* sibling pointer verification */
ee1a47ab 682 if (!block->bb_u.l.bb_leftsib ||
d5cf09ba 683 (block->bb_u.l.bb_leftsib != cpu_to_be64(NULLFSBLOCK) &&
ee1a47ab
CH
684 !XFS_FSB_SANITY_CHECK(mp, be64_to_cpu(block->bb_u.l.bb_leftsib))))
685 return false;
686 if (!block->bb_u.l.bb_rightsib ||
d5cf09ba 687 (block->bb_u.l.bb_rightsib != cpu_to_be64(NULLFSBLOCK) &&
ee1a47ab
CH
688 !XFS_FSB_SANITY_CHECK(mp, be64_to_cpu(block->bb_u.l.bb_rightsib))))
689 return false;
690
691 return true;
612cfbfe 692}
3d3e6f64 693
1813dd64
DC
694static void
695xfs_bmbt_read_verify(
612cfbfe
DC
696 struct xfs_buf *bp)
697{
ce5028cf 698 if (!xfs_btree_lblock_verify_crc(bp))
2451337d 699 xfs_buf_ioerror(bp, -EFSBADCRC);
ce5028cf 700 else if (!xfs_bmbt_verify(bp))
2451337d 701 xfs_buf_ioerror(bp, -EFSCORRUPTED);
ce5028cf
ES
702
703 if (bp->b_error) {
704 trace_xfs_btree_corrupt(bp, _RET_IP_);
705 xfs_verifier_error(bp);
ee1a47ab 706 }
612cfbfe
DC
707}
708
1813dd64
DC
709static void
710xfs_bmbt_write_verify(
612cfbfe
DC
711 struct xfs_buf *bp)
712{
ee1a47ab 713 if (!xfs_bmbt_verify(bp)) {
ee1a47ab 714 trace_xfs_btree_corrupt(bp, _RET_IP_);
2451337d 715 xfs_buf_ioerror(bp, -EFSCORRUPTED);
ce5028cf 716 xfs_verifier_error(bp);
ee1a47ab
CH
717 return;
718 }
719 xfs_btree_lblock_calc_crc(bp);
3d3e6f64
DC
720}
721
1813dd64 722const struct xfs_buf_ops xfs_bmbt_buf_ops = {
233135b7 723 .name = "xfs_bmbt",
1813dd64
DC
724 .verify_read = xfs_bmbt_read_verify,
725 .verify_write = xfs_bmbt_write_verify,
726};
727
728
742ae1e3 729#if defined(DEBUG) || defined(XFS_WARN)
4a26e66e
CH
730STATIC int
731xfs_bmbt_keys_inorder(
732 struct xfs_btree_cur *cur,
733 union xfs_btree_key *k1,
734 union xfs_btree_key *k2)
735{
736 return be64_to_cpu(k1->bmbt.br_startoff) <
737 be64_to_cpu(k2->bmbt.br_startoff);
738}
739
740STATIC int
741xfs_bmbt_recs_inorder(
742 struct xfs_btree_cur *cur,
743 union xfs_btree_rec *r1,
744 union xfs_btree_rec *r2)
745{
746 return xfs_bmbt_disk_get_startoff(&r1->bmbt) +
747 xfs_bmbt_disk_get_blockcount(&r1->bmbt) <=
748 xfs_bmbt_disk_get_startoff(&r2->bmbt);
749}
750#endif /* DEBUG */
751
561f7d17 752static const struct xfs_btree_ops xfs_bmbt_ops = {
65f1eaea
CH
753 .rec_len = sizeof(xfs_bmbt_rec_t),
754 .key_len = sizeof(xfs_bmbt_key_t),
755
561f7d17 756 .dup_cursor = xfs_bmbt_dup_cursor,
4b22a571 757 .update_cursor = xfs_bmbt_update_cursor,
f5eb8e7c 758 .alloc_block = xfs_bmbt_alloc_block,
d4b3a4b7 759 .free_block = xfs_bmbt_free_block,
ce5e42db 760 .get_maxrecs = xfs_bmbt_get_maxrecs,
91cca5df 761 .get_minrecs = xfs_bmbt_get_minrecs,
4b22a571 762 .get_dmaxrecs = xfs_bmbt_get_dmaxrecs,
fe033cc8 763 .init_key_from_rec = xfs_bmbt_init_key_from_rec,
4b22a571
CH
764 .init_rec_from_key = xfs_bmbt_init_rec_from_key,
765 .init_rec_from_cur = xfs_bmbt_init_rec_from_cur,
fe033cc8
CH
766 .init_ptr_from_cur = xfs_bmbt_init_ptr_from_cur,
767 .key_diff = xfs_bmbt_key_diff,
1813dd64 768 .buf_ops = &xfs_bmbt_buf_ops,
742ae1e3 769#if defined(DEBUG) || defined(XFS_WARN)
4a26e66e
CH
770 .keys_inorder = xfs_bmbt_keys_inorder,
771 .recs_inorder = xfs_bmbt_recs_inorder,
772#endif
561f7d17
CH
773};
774
775/*
776 * Allocate a new bmap btree cursor.
777 */
778struct xfs_btree_cur * /* new bmap btree cursor */
779xfs_bmbt_init_cursor(
780 struct xfs_mount *mp, /* file system mount point */
781 struct xfs_trans *tp, /* transaction pointer */
782 struct xfs_inode *ip, /* inode owning the btree */
783 int whichfork) /* data or attr fork */
784{
785 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
786 struct xfs_btree_cur *cur;
787
788 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
789
790 cur->bc_tp = tp;
791 cur->bc_mp = mp;
792 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1;
793 cur->bc_btnum = XFS_BTNUM_BMAP;
794 cur->bc_blocklog = mp->m_sb.sb_blocklog;
795
796 cur->bc_ops = &xfs_bmbt_ops;
e99ab90d 797 cur->bc_flags = XFS_BTREE_LONG_PTRS | XFS_BTREE_ROOT_IN_INODE;
ee1a47ab
CH
798 if (xfs_sb_version_hascrc(&mp->m_sb))
799 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
561f7d17
CH
800
801 cur->bc_private.b.forksize = XFS_IFORK_SIZE(ip, whichfork);
802 cur->bc_private.b.ip = ip;
803 cur->bc_private.b.firstblock = NULLFSBLOCK;
804 cur->bc_private.b.flist = NULL;
805 cur->bc_private.b.allocated = 0;
806 cur->bc_private.b.flags = 0;
807 cur->bc_private.b.whichfork = whichfork;
808
809 return cur;
810}
60197e8d
CH
811
812/*
813 * Calculate number of records in a bmap btree block.
814 */
815int
816xfs_bmbt_maxrecs(
817 struct xfs_mount *mp,
818 int blocklen,
819 int leaf)
820{
7cc95a82 821 blocklen -= XFS_BMBT_BLOCK_LEN(mp);
60197e8d
CH
822
823 if (leaf)
824 return blocklen / sizeof(xfs_bmbt_rec_t);
825 return blocklen / (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t));
826}
827
828/*
829 * Calculate number of records in a bmap btree inode root.
830 */
831int
832xfs_bmdr_maxrecs(
60197e8d
CH
833 int blocklen,
834 int leaf)
835{
836 blocklen -= sizeof(xfs_bmdr_block_t);
837
838 if (leaf)
839 return blocklen / sizeof(xfs_bmdr_rec_t);
840 return blocklen / (sizeof(xfs_bmdr_key_t) + sizeof(xfs_bmdr_ptr_t));
841}
21b5c978
DC
842
843/*
844 * Change the owner of a btree format fork fo the inode passed in. Change it to
845 * the owner of that is passed in so that we can change owners before or after
846 * we switch forks between inodes. The operation that the caller is doing will
847 * determine whether is needs to change owner before or after the switch.
848 *
638f4416
DC
849 * For demand paged transactional modification, the fork switch should be done
850 * after reading in all the blocks, modifying them and pinning them in the
851 * transaction. For modification when the buffers are already pinned in memory,
852 * the fork switch can be done before changing the owner as we won't need to
853 * validate the owner until the btree buffers are unpinned and writes can occur
854 * again.
855 *
856 * For recovery based ownership change, there is no transactional context and
857 * so a buffer list must be supplied so that we can record the buffers that we
858 * modified for the caller to issue IO on.
21b5c978
DC
859 */
860int
861xfs_bmbt_change_owner(
862 struct xfs_trans *tp,
863 struct xfs_inode *ip,
864 int whichfork,
638f4416
DC
865 xfs_ino_t new_owner,
866 struct list_head *buffer_list)
21b5c978
DC
867{
868 struct xfs_btree_cur *cur;
869 int error;
870
638f4416
DC
871 ASSERT(tp || buffer_list);
872 ASSERT(!(tp && buffer_list));
21b5c978 873 if (whichfork == XFS_DATA_FORK)
aa9e1040 874 ASSERT(ip->i_d.di_format == XFS_DINODE_FMT_BTREE);
21b5c978 875 else
aa9e1040 876 ASSERT(ip->i_d.di_aformat == XFS_DINODE_FMT_BTREE);
21b5c978
DC
877
878 cur = xfs_bmbt_init_cursor(ip->i_mount, tp, ip, whichfork);
638f4416 879 if (!cur)
2451337d 880 return -ENOMEM;
638f4416
DC
881
882 error = xfs_btree_change_owner(cur, new_owner, buffer_list);
21b5c978
DC
883 xfs_btree_del_cursor(cur, error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
884 return error;
885}