2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
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
7 * published by the Free Software Foundation.
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.
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
20 #include "xfs_types.h"
24 #include "xfs_trans.h"
28 #include "xfs_dmapi.h"
29 #include "xfs_mount.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_ialloc_btree.h"
33 #include "xfs_dir2_sf.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_dinode.h"
36 #include "xfs_inode.h"
37 #include "xfs_inode_item.h"
38 #include "xfs_alloc.h"
39 #include "xfs_btree.h"
40 #include "xfs_btree_trace.h"
41 #include "xfs_ialloc.h"
42 #include "xfs_itable.h"
44 #include "xfs_error.h"
45 #include "xfs_quota.h"
48 * Prototypes for internal btree functions.
52 STATIC int xfs_bmbt_killroot(xfs_btree_cur_t *);
53 STATIC void xfs_bmbt_log_keys(xfs_btree_cur_t *, xfs_buf_t *, int, int);
54 STATIC void xfs_bmbt_log_ptrs(xfs_btree_cur_t *, xfs_buf_t *, int, int);
55 STATIC int xfs_bmbt_lshift(xfs_btree_cur_t *, int, int *);
56 STATIC int xfs_bmbt_rshift(xfs_btree_cur_t *, int, int *);
57 STATIC int xfs_bmbt_split(xfs_btree_cur_t *, int, xfs_fsblock_t *,
58 __uint64_t *, xfs_btree_cur_t **, int *);
59 STATIC int xfs_bmbt_updkey(xfs_btree_cur_t *, xfs_bmbt_key_t *, int);
63 #define ENTRY XBT_ENTRY
64 #define ERROR XBT_ERROR
68 * Keep the XFS_BMBT_TRACE_ names around for now until all code using them
69 * is converted to be generic and thus switches to the XFS_BTREE_TRACE_ names.
71 #define XFS_BMBT_TRACE_ARGBI(c,b,i) \
72 XFS_BTREE_TRACE_ARGBI(c,b,i)
73 #define XFS_BMBT_TRACE_ARGBII(c,b,i,j) \
74 XFS_BTREE_TRACE_ARGBII(c,b,i,j)
75 #define XFS_BMBT_TRACE_ARGFFFI(c,o,b,i,j) \
76 XFS_BTREE_TRACE_ARGFFFI(c,o,b,i,j)
77 #define XFS_BMBT_TRACE_ARGI(c,i) \
78 XFS_BTREE_TRACE_ARGI(c,i)
79 #define XFS_BMBT_TRACE_ARGIFK(c,i,f,s) \
80 XFS_BTREE_TRACE_ARGIPK(c,i,(union xfs_btree_ptr)f,s)
81 #define XFS_BMBT_TRACE_ARGIFR(c,i,f,r) \
82 XFS_BTREE_TRACE_ARGIPR(c,i, \
83 (union xfs_btree_ptr)f, (union xfs_btree_rec *)r)
84 #define XFS_BMBT_TRACE_ARGIK(c,i,k) \
85 XFS_BTREE_TRACE_ARGIK(c,i,(union xfs_btree_key *)k)
86 #define XFS_BMBT_TRACE_CURSOR(c,s) \
87 XFS_BTREE_TRACE_CURSOR(c,s)
95 * Delete record pointed to by cur/level.
97 STATIC int /* error */
101 int *stat) /* success/failure */
103 xfs_bmbt_block_t *block; /* bmap btree block */
104 xfs_fsblock_t bno; /* fs-relative block number */
105 xfs_buf_t *bp; /* buffer for block */
106 int error; /* error return value */
107 int i; /* loop counter */
108 int j; /* temp state */
109 xfs_bmbt_key_t key; /* bmap btree key */
110 xfs_bmbt_key_t *kp=NULL; /* pointer to bmap btree key */
111 xfs_fsblock_t lbno; /* left sibling block number */
112 xfs_buf_t *lbp; /* left buffer pointer */
113 xfs_bmbt_block_t *left; /* left btree block */
114 xfs_bmbt_key_t *lkp; /* left btree key */
115 xfs_bmbt_ptr_t *lpp; /* left address pointer */
116 int lrecs=0; /* left record count */
117 xfs_bmbt_rec_t *lrp; /* left record pointer */
118 xfs_mount_t *mp; /* file system mount point */
119 xfs_bmbt_ptr_t *pp; /* pointer to bmap block addr */
120 int ptr; /* key/record index */
121 xfs_fsblock_t rbno; /* right sibling block number */
122 xfs_buf_t *rbp; /* right buffer pointer */
123 xfs_bmbt_block_t *right; /* right btree block */
124 xfs_bmbt_key_t *rkp; /* right btree key */
125 xfs_bmbt_rec_t *rp; /* pointer to bmap btree rec */
126 xfs_bmbt_ptr_t *rpp; /* right address pointer */
127 xfs_bmbt_block_t *rrblock; /* right-right btree block */
128 xfs_buf_t *rrbp; /* right-right buffer pointer */
129 int rrecs=0; /* right record count */
130 xfs_bmbt_rec_t *rrp; /* right record pointer */
131 xfs_btree_cur_t *tcur; /* temporary btree cursor */
132 int numrecs; /* temporary numrec count */
133 int numlrecs, numrrecs;
135 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
136 XFS_BMBT_TRACE_ARGI(cur, level);
137 ptr = cur->bc_ptrs[level];
140 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
144 block = xfs_bmbt_get_block(cur, level, &bp);
145 numrecs = be16_to_cpu(block->bb_numrecs);
147 if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
148 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
153 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
157 XFS_STATS_INC(xs_bmbt_delrec);
159 kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
160 pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
162 for (i = ptr; i < numrecs; i++) {
163 if ((error = xfs_btree_check_lptr_disk(cur, pp[i], level))) {
164 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
170 memmove(&kp[ptr - 1], &kp[ptr],
171 (numrecs - ptr) * sizeof(*kp));
172 memmove(&pp[ptr - 1], &pp[ptr],
173 (numrecs - ptr) * sizeof(*pp));
174 xfs_bmbt_log_ptrs(cur, bp, ptr, numrecs - 1);
175 xfs_bmbt_log_keys(cur, bp, ptr, numrecs - 1);
178 rp = XFS_BMAP_REC_IADDR(block, 1, cur);
180 memmove(&rp[ptr - 1], &rp[ptr],
181 (numrecs - ptr) * sizeof(*rp));
182 xfs_bmbt_log_recs(cur, bp, ptr, numrecs - 1);
186 cpu_to_be64(xfs_bmbt_disk_get_startoff(rp));
191 block->bb_numrecs = cpu_to_be16(numrecs);
192 xfs_bmbt_log_block(cur, bp, XFS_BB_NUMRECS);
194 * We're at the root level.
195 * First, shrink the root block in-memory.
196 * Try to get rid of the next level down.
197 * If we can't then there's nothing left to do.
199 if (level == cur->bc_nlevels - 1) {
200 xfs_iroot_realloc(cur->bc_private.b.ip, -1,
201 cur->bc_private.b.whichfork);
202 if ((error = xfs_bmbt_killroot(cur))) {
203 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
206 if (level > 0 && (error = xfs_btree_decrement(cur, level, &j))) {
207 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
210 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
214 if (ptr == 1 && (error = xfs_bmbt_updkey(cur, kp, level + 1))) {
215 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
218 if (numrecs >= XFS_BMAP_BLOCK_IMINRECS(level, cur)) {
219 if (level > 0 && (error = xfs_btree_decrement(cur, level, &j))) {
220 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
223 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
227 rbno = be64_to_cpu(block->bb_rightsib);
228 lbno = be64_to_cpu(block->bb_leftsib);
230 * One child of root, need to get a chance to copy its contents
231 * into the root and delete it. Can't go up to next level,
232 * there's nothing to delete there.
234 if (lbno == NULLFSBLOCK && rbno == NULLFSBLOCK &&
235 level == cur->bc_nlevels - 2) {
236 if ((error = xfs_bmbt_killroot(cur))) {
237 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
240 if (level > 0 && (error = xfs_btree_decrement(cur, level, &i))) {
241 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
244 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
248 ASSERT(rbno != NULLFSBLOCK || lbno != NULLFSBLOCK);
249 if ((error = xfs_btree_dup_cursor(cur, &tcur))) {
250 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
254 if (rbno != NULLFSBLOCK) {
255 i = xfs_btree_lastrec(tcur, level);
256 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
257 if ((error = xfs_btree_increment(tcur, level, &i))) {
258 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
261 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
262 i = xfs_btree_lastrec(tcur, level);
263 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
264 rbp = tcur->bc_bufs[level];
265 right = XFS_BUF_TO_BMBT_BLOCK(rbp);
267 if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
268 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
272 bno = be64_to_cpu(right->bb_leftsib);
273 if (be16_to_cpu(right->bb_numrecs) - 1 >=
274 XFS_BMAP_BLOCK_IMINRECS(level, cur)) {
275 if ((error = xfs_bmbt_lshift(tcur, level, &i))) {
276 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
280 ASSERT(be16_to_cpu(block->bb_numrecs) >=
281 XFS_BMAP_BLOCK_IMINRECS(level, tcur));
282 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
285 if ((error = xfs_btree_decrement(cur,
287 XFS_BMBT_TRACE_CURSOR(cur,
292 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
297 rrecs = be16_to_cpu(right->bb_numrecs);
298 if (lbno != NULLFSBLOCK) {
299 i = xfs_btree_firstrec(tcur, level);
300 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
301 if ((error = xfs_btree_decrement(tcur, level, &i))) {
302 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
305 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
308 if (lbno != NULLFSBLOCK) {
309 i = xfs_btree_firstrec(tcur, level);
310 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
312 * decrement to last in block
314 if ((error = xfs_btree_decrement(tcur, level, &i))) {
315 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
318 i = xfs_btree_firstrec(tcur, level);
319 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
320 lbp = tcur->bc_bufs[level];
321 left = XFS_BUF_TO_BMBT_BLOCK(lbp);
323 if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
324 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
328 bno = be64_to_cpu(left->bb_rightsib);
329 if (be16_to_cpu(left->bb_numrecs) - 1 >=
330 XFS_BMAP_BLOCK_IMINRECS(level, cur)) {
331 if ((error = xfs_bmbt_rshift(tcur, level, &i))) {
332 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
336 ASSERT(be16_to_cpu(block->bb_numrecs) >=
337 XFS_BMAP_BLOCK_IMINRECS(level, tcur));
338 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
342 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
347 lrecs = be16_to_cpu(left->bb_numrecs);
349 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
352 ASSERT(bno != NULLFSBLOCK);
353 if (lbno != NULLFSBLOCK &&
354 lrecs + be16_to_cpu(block->bb_numrecs) <= XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
358 if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, lbno, 0, &lbp,
359 XFS_BMAP_BTREE_REF))) {
360 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
363 left = XFS_BUF_TO_BMBT_BLOCK(lbp);
364 if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
365 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
368 } else if (rbno != NULLFSBLOCK &&
369 rrecs + be16_to_cpu(block->bb_numrecs) <=
370 XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
374 if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, rbno, 0, &rbp,
375 XFS_BMAP_BTREE_REF))) {
376 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
379 right = XFS_BUF_TO_BMBT_BLOCK(rbp);
380 if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
381 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
384 lrecs = be16_to_cpu(left->bb_numrecs);
386 if (level > 0 && (error = xfs_btree_decrement(cur, level, &i))) {
387 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
390 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
394 numlrecs = be16_to_cpu(left->bb_numrecs);
395 numrrecs = be16_to_cpu(right->bb_numrecs);
397 lkp = XFS_BMAP_KEY_IADDR(left, numlrecs + 1, cur);
398 lpp = XFS_BMAP_PTR_IADDR(left, numlrecs + 1, cur);
399 rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
400 rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
402 for (i = 0; i < numrrecs; i++) {
403 if ((error = xfs_btree_check_lptr_disk(cur, rpp[i], level))) {
404 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
409 memcpy(lkp, rkp, numrrecs * sizeof(*lkp));
410 memcpy(lpp, rpp, numrrecs * sizeof(*lpp));
411 xfs_bmbt_log_keys(cur, lbp, numlrecs + 1, numlrecs + numrrecs);
412 xfs_bmbt_log_ptrs(cur, lbp, numlrecs + 1, numlrecs + numrrecs);
414 lrp = XFS_BMAP_REC_IADDR(left, numlrecs + 1, cur);
415 rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
416 memcpy(lrp, rrp, numrrecs * sizeof(*lrp));
417 xfs_bmbt_log_recs(cur, lbp, numlrecs + 1, numlrecs + numrrecs);
419 be16_add_cpu(&left->bb_numrecs, numrrecs);
420 left->bb_rightsib = right->bb_rightsib;
421 xfs_bmbt_log_block(cur, lbp, XFS_BB_RIGHTSIB | XFS_BB_NUMRECS);
422 if (be64_to_cpu(left->bb_rightsib) != NULLDFSBNO) {
423 if ((error = xfs_btree_read_bufl(mp, cur->bc_tp,
424 be64_to_cpu(left->bb_rightsib),
425 0, &rrbp, XFS_BMAP_BTREE_REF))) {
426 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
429 rrblock = XFS_BUF_TO_BMBT_BLOCK(rrbp);
430 if ((error = xfs_btree_check_lblock(cur, rrblock, level, rrbp))) {
431 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
434 rrblock->bb_leftsib = cpu_to_be64(lbno);
435 xfs_bmbt_log_block(cur, rrbp, XFS_BB_LEFTSIB);
437 xfs_bmap_add_free(XFS_DADDR_TO_FSB(mp, XFS_BUF_ADDR(rbp)), 1,
438 cur->bc_private.b.flist, mp);
439 cur->bc_private.b.ip->i_d.di_nblocks--;
440 xfs_trans_log_inode(cur->bc_tp, cur->bc_private.b.ip, XFS_ILOG_CORE);
441 XFS_TRANS_MOD_DQUOT_BYINO(mp, cur->bc_tp, cur->bc_private.b.ip,
442 XFS_TRANS_DQ_BCOUNT, -1L);
443 xfs_trans_binval(cur->bc_tp, rbp);
445 cur->bc_bufs[level] = lbp;
446 cur->bc_ptrs[level] += lrecs;
447 cur->bc_ra[level] = 0;
448 } else if ((error = xfs_btree_increment(cur, level + 1, &i))) {
449 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
453 cur->bc_ptrs[level]--;
454 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
460 xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
465 * Insert one record/level. Return information to the caller
466 * allowing the next level up to proceed if necessary.
468 STATIC int /* error */
470 xfs_btree_cur_t *cur,
473 xfs_bmbt_rec_t *recp,
474 xfs_btree_cur_t **curp,
475 int *stat) /* no-go/done/continue */
477 xfs_bmbt_block_t *block; /* bmap btree block */
478 xfs_buf_t *bp; /* buffer for block */
479 int error; /* error return value */
480 int i; /* loop index */
481 xfs_bmbt_key_t key; /* bmap btree key */
482 xfs_bmbt_key_t *kp=NULL; /* pointer to bmap btree key */
483 int logflags; /* inode logging flags */
484 xfs_fsblock_t nbno; /* new block number */
485 struct xfs_btree_cur *ncur; /* new btree cursor */
486 __uint64_t startoff; /* new btree key value */
487 xfs_bmbt_rec_t nrec; /* new record count */
488 int optr; /* old key/record index */
489 xfs_bmbt_ptr_t *pp; /* pointer to bmap block addr */
490 int ptr; /* key/record index */
491 xfs_bmbt_rec_t *rp=NULL; /* pointer to bmap btree rec */
494 ASSERT(level < cur->bc_nlevels);
495 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
496 XFS_BMBT_TRACE_ARGIFR(cur, level, *bnop, recp);
498 key.br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(recp));
499 optr = ptr = cur->bc_ptrs[level];
501 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
505 XFS_STATS_INC(xs_bmbt_insrec);
506 block = xfs_bmbt_get_block(cur, level, &bp);
507 numrecs = be16_to_cpu(block->bb_numrecs);
509 if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
510 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
513 if (ptr <= numrecs) {
515 rp = XFS_BMAP_REC_IADDR(block, ptr, cur);
516 xfs_btree_check_rec(XFS_BTNUM_BMAP, recp, rp);
518 kp = XFS_BMAP_KEY_IADDR(block, ptr, cur);
519 xfs_btree_check_key(XFS_BTNUM_BMAP, &key, kp);
524 if (numrecs == XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
525 if (numrecs < XFS_BMAP_BLOCK_DMAXRECS(level, cur)) {
527 * A root block, that can be made bigger.
529 xfs_iroot_realloc(cur->bc_private.b.ip, 1,
530 cur->bc_private.b.whichfork);
531 block = xfs_bmbt_get_block(cur, level, &bp);
532 } else if (level == cur->bc_nlevels - 1) {
533 if ((error = xfs_bmbt_newroot(cur, &logflags, stat)) ||
535 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
538 xfs_trans_log_inode(cur->bc_tp, cur->bc_private.b.ip,
540 block = xfs_bmbt_get_block(cur, level, &bp);
542 if ((error = xfs_bmbt_rshift(cur, level, &i))) {
543 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
549 if ((error = xfs_bmbt_lshift(cur, level, &i))) {
550 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
554 optr = ptr = cur->bc_ptrs[level];
556 if ((error = xfs_bmbt_split(cur, level,
557 &nbno, &startoff, &ncur,
559 XFS_BMBT_TRACE_CURSOR(cur,
564 block = xfs_bmbt_get_block(
568 xfs_btree_check_lblock(cur,
569 block, level, bp))) {
570 XFS_BMBT_TRACE_CURSOR(
575 ptr = cur->bc_ptrs[level];
576 xfs_bmbt_disk_set_allf(&nrec,
580 XFS_BMBT_TRACE_CURSOR(cur,
589 numrecs = be16_to_cpu(block->bb_numrecs);
591 kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
592 pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
594 for (i = numrecs; i >= ptr; i--) {
595 if ((error = xfs_btree_check_lptr_disk(cur, pp[i - 1],
597 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
602 memmove(&kp[ptr], &kp[ptr - 1],
603 (numrecs - ptr + 1) * sizeof(*kp));
604 memmove(&pp[ptr], &pp[ptr - 1],
605 (numrecs - ptr + 1) * sizeof(*pp));
607 if ((error = xfs_btree_check_lptr(cur, *bnop, level))) {
608 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
613 pp[ptr - 1] = cpu_to_be64(*bnop);
615 block->bb_numrecs = cpu_to_be16(numrecs);
616 xfs_bmbt_log_keys(cur, bp, ptr, numrecs);
617 xfs_bmbt_log_ptrs(cur, bp, ptr, numrecs);
619 rp = XFS_BMAP_REC_IADDR(block, 1, cur);
620 memmove(&rp[ptr], &rp[ptr - 1],
621 (numrecs - ptr + 1) * sizeof(*rp));
624 block->bb_numrecs = cpu_to_be16(numrecs);
625 xfs_bmbt_log_recs(cur, bp, ptr, numrecs);
627 xfs_bmbt_log_block(cur, bp, XFS_BB_NUMRECS);
631 xfs_btree_check_rec(XFS_BTNUM_BMAP, rp + ptr - 1,
634 xfs_btree_check_key(XFS_BTNUM_BMAP, kp + ptr - 1,
638 if (optr == 1 && (error = xfs_bmbt_updkey(cur, &key, level + 1))) {
639 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
643 if (nbno != NULLFSBLOCK) {
647 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
654 xfs_btree_cur_t *cur)
656 xfs_bmbt_block_t *block;
657 xfs_bmbt_block_t *cblock;
671 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
672 level = cur->bc_nlevels - 1;
675 * Don't deal with the root block needs to be a leaf case.
676 * We're just going to turn the thing back into extents anyway.
679 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
682 block = xfs_bmbt_get_block(cur, level, &cbp);
684 * Give up if the root has multiple children.
686 if (be16_to_cpu(block->bb_numrecs) != 1) {
687 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
691 * Only do this if the next level will fit.
692 * Then the data must be copied up to the inode,
693 * instead of freeing the root you free the next level.
695 cbp = cur->bc_bufs[level - 1];
696 cblock = XFS_BUF_TO_BMBT_BLOCK(cbp);
697 if (be16_to_cpu(cblock->bb_numrecs) > XFS_BMAP_BLOCK_DMAXRECS(level, cur)) {
698 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
701 ASSERT(be64_to_cpu(cblock->bb_leftsib) == NULLDFSBNO);
702 ASSERT(be64_to_cpu(cblock->bb_rightsib) == NULLDFSBNO);
703 ip = cur->bc_private.b.ip;
704 ifp = XFS_IFORK_PTR(ip, cur->bc_private.b.whichfork);
705 ASSERT(XFS_BMAP_BLOCK_IMAXRECS(level, cur) ==
706 XFS_BMAP_BROOT_MAXRECS(ifp->if_broot_bytes));
707 i = (int)(be16_to_cpu(cblock->bb_numrecs) - XFS_BMAP_BLOCK_IMAXRECS(level, cur));
709 xfs_iroot_realloc(ip, i, cur->bc_private.b.whichfork);
710 block = ifp->if_broot;
712 be16_add_cpu(&block->bb_numrecs, i);
713 ASSERT(block->bb_numrecs == cblock->bb_numrecs);
714 kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
715 ckp = XFS_BMAP_KEY_IADDR(cblock, 1, cur);
716 memcpy(kp, ckp, be16_to_cpu(block->bb_numrecs) * sizeof(*kp));
717 pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
718 cpp = XFS_BMAP_PTR_IADDR(cblock, 1, cur);
720 for (i = 0; i < be16_to_cpu(cblock->bb_numrecs); i++) {
721 if ((error = xfs_btree_check_lptr_disk(cur, cpp[i], level - 1))) {
722 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
727 memcpy(pp, cpp, be16_to_cpu(block->bb_numrecs) * sizeof(*pp));
728 xfs_bmap_add_free(XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(cbp)), 1,
729 cur->bc_private.b.flist, cur->bc_mp);
730 ip->i_d.di_nblocks--;
731 XFS_TRANS_MOD_DQUOT_BYINO(cur->bc_mp, cur->bc_tp, ip,
732 XFS_TRANS_DQ_BCOUNT, -1L);
733 xfs_trans_binval(cur->bc_tp, cbp);
734 cur->bc_bufs[level - 1] = NULL;
735 be16_add_cpu(&block->bb_level, -1);
736 xfs_trans_log_inode(cur->bc_tp, ip,
737 XFS_ILOG_CORE | XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
739 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
744 * Log key values from the btree block.
748 xfs_btree_cur_t *cur,
755 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
756 XFS_BMBT_TRACE_ARGBII(cur, bp, kfirst, klast);
759 xfs_bmbt_block_t *block;
764 block = XFS_BUF_TO_BMBT_BLOCK(bp);
765 kp = XFS_BMAP_KEY_DADDR(block, 1, cur);
766 first = (int)((xfs_caddr_t)&kp[kfirst - 1] - (xfs_caddr_t)block);
767 last = (int)(((xfs_caddr_t)&kp[klast] - 1) - (xfs_caddr_t)block);
768 xfs_trans_log_buf(tp, bp, first, last);
772 ip = cur->bc_private.b.ip;
773 xfs_trans_log_inode(tp, ip,
774 XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
776 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
780 * Log pointer values from the btree block.
784 xfs_btree_cur_t *cur,
791 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
792 XFS_BMBT_TRACE_ARGBII(cur, bp, pfirst, plast);
795 xfs_bmbt_block_t *block;
800 block = XFS_BUF_TO_BMBT_BLOCK(bp);
801 pp = XFS_BMAP_PTR_DADDR(block, 1, cur);
802 first = (int)((xfs_caddr_t)&pp[pfirst - 1] - (xfs_caddr_t)block);
803 last = (int)(((xfs_caddr_t)&pp[plast] - 1) - (xfs_caddr_t)block);
804 xfs_trans_log_buf(tp, bp, first, last);
808 ip = cur->bc_private.b.ip;
809 xfs_trans_log_inode(tp, ip,
810 XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
812 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
816 * Move 1 record left from cur/level if possible.
817 * Update cur to reflect the new path.
819 STATIC int /* error */
821 xfs_btree_cur_t *cur,
823 int *stat) /* success/failure */
825 int error; /* error return value */
827 int i; /* loop counter */
829 xfs_bmbt_key_t key; /* bmap btree key */
830 xfs_buf_t *lbp; /* left buffer pointer */
831 xfs_bmbt_block_t *left; /* left btree block */
832 xfs_bmbt_key_t *lkp=NULL; /* left btree key */
833 xfs_bmbt_ptr_t *lpp; /* left address pointer */
834 int lrecs; /* left record count */
835 xfs_bmbt_rec_t *lrp=NULL; /* left record pointer */
836 xfs_mount_t *mp; /* file system mount point */
837 xfs_buf_t *rbp; /* right buffer pointer */
838 xfs_bmbt_block_t *right; /* right btree block */
839 xfs_bmbt_key_t *rkp=NULL; /* right btree key */
840 xfs_bmbt_ptr_t *rpp=NULL; /* right address pointer */
841 xfs_bmbt_rec_t *rrp=NULL; /* right record pointer */
842 int rrecs; /* right record count */
844 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
845 XFS_BMBT_TRACE_ARGI(cur, level);
846 if (level == cur->bc_nlevels - 1) {
847 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
851 rbp = cur->bc_bufs[level];
852 right = XFS_BUF_TO_BMBT_BLOCK(rbp);
854 if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
855 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
859 if (be64_to_cpu(right->bb_leftsib) == NULLDFSBNO) {
860 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
864 if (cur->bc_ptrs[level] <= 1) {
865 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
870 if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, be64_to_cpu(right->bb_leftsib), 0,
871 &lbp, XFS_BMAP_BTREE_REF))) {
872 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
875 left = XFS_BUF_TO_BMBT_BLOCK(lbp);
876 if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
877 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
880 if (be16_to_cpu(left->bb_numrecs) == XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
881 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
885 lrecs = be16_to_cpu(left->bb_numrecs) + 1;
887 lkp = XFS_BMAP_KEY_IADDR(left, lrecs, cur);
888 rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
890 xfs_bmbt_log_keys(cur, lbp, lrecs, lrecs);
891 lpp = XFS_BMAP_PTR_IADDR(left, lrecs, cur);
892 rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
894 if ((error = xfs_btree_check_lptr_disk(cur, *rpp, level))) {
895 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
900 xfs_bmbt_log_ptrs(cur, lbp, lrecs, lrecs);
902 lrp = XFS_BMAP_REC_IADDR(left, lrecs, cur);
903 rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
905 xfs_bmbt_log_recs(cur, lbp, lrecs, lrecs);
907 left->bb_numrecs = cpu_to_be16(lrecs);
908 xfs_bmbt_log_block(cur, lbp, XFS_BB_NUMRECS);
911 xfs_btree_check_key(XFS_BTNUM_BMAP, lkp - 1, lkp);
913 xfs_btree_check_rec(XFS_BTNUM_BMAP, lrp - 1, lrp);
915 rrecs = be16_to_cpu(right->bb_numrecs) - 1;
916 right->bb_numrecs = cpu_to_be16(rrecs);
917 xfs_bmbt_log_block(cur, rbp, XFS_BB_NUMRECS);
920 for (i = 0; i < rrecs; i++) {
921 if ((error = xfs_btree_check_lptr_disk(cur, rpp[i + 1],
923 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
928 memmove(rkp, rkp + 1, rrecs * sizeof(*rkp));
929 memmove(rpp, rpp + 1, rrecs * sizeof(*rpp));
930 xfs_bmbt_log_keys(cur, rbp, 1, rrecs);
931 xfs_bmbt_log_ptrs(cur, rbp, 1, rrecs);
933 memmove(rrp, rrp + 1, rrecs * sizeof(*rrp));
934 xfs_bmbt_log_recs(cur, rbp, 1, rrecs);
935 key.br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(rrp));
938 if ((error = xfs_bmbt_updkey(cur, rkp, level + 1))) {
939 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
942 cur->bc_ptrs[level]--;
943 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
949 * Move 1 record right from cur/level if possible.
950 * Update cur to reflect the new path.
952 STATIC int /* error */
954 xfs_btree_cur_t *cur,
956 int *stat) /* success/failure */
958 int error; /* error return value */
959 int i; /* loop counter */
960 xfs_bmbt_key_t key; /* bmap btree key */
961 xfs_buf_t *lbp; /* left buffer pointer */
962 xfs_bmbt_block_t *left; /* left btree block */
963 xfs_bmbt_key_t *lkp; /* left btree key */
964 xfs_bmbt_ptr_t *lpp; /* left address pointer */
965 xfs_bmbt_rec_t *lrp; /* left record pointer */
966 xfs_mount_t *mp; /* file system mount point */
967 xfs_buf_t *rbp; /* right buffer pointer */
968 xfs_bmbt_block_t *right; /* right btree block */
969 xfs_bmbt_key_t *rkp; /* right btree key */
970 xfs_bmbt_ptr_t *rpp; /* right address pointer */
971 xfs_bmbt_rec_t *rrp=NULL; /* right record pointer */
972 struct xfs_btree_cur *tcur; /* temporary btree cursor */
974 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
975 XFS_BMBT_TRACE_ARGI(cur, level);
976 if (level == cur->bc_nlevels - 1) {
977 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
981 lbp = cur->bc_bufs[level];
982 left = XFS_BUF_TO_BMBT_BLOCK(lbp);
984 if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
985 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
989 if (be64_to_cpu(left->bb_rightsib) == NULLDFSBNO) {
990 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
994 if (cur->bc_ptrs[level] >= be16_to_cpu(left->bb_numrecs)) {
995 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1000 if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, be64_to_cpu(left->bb_rightsib), 0,
1001 &rbp, XFS_BMAP_BTREE_REF))) {
1002 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1005 right = XFS_BUF_TO_BMBT_BLOCK(rbp);
1006 if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
1007 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1010 if (be16_to_cpu(right->bb_numrecs) == XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
1011 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1016 lkp = XFS_BMAP_KEY_IADDR(left, be16_to_cpu(left->bb_numrecs), cur);
1017 lpp = XFS_BMAP_PTR_IADDR(left, be16_to_cpu(left->bb_numrecs), cur);
1018 rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
1019 rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
1021 for (i = be16_to_cpu(right->bb_numrecs) - 1; i >= 0; i--) {
1022 if ((error = xfs_btree_check_lptr_disk(cur, rpp[i], level))) {
1023 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1028 memmove(rkp + 1, rkp, be16_to_cpu(right->bb_numrecs) * sizeof(*rkp));
1029 memmove(rpp + 1, rpp, be16_to_cpu(right->bb_numrecs) * sizeof(*rpp));
1031 if ((error = xfs_btree_check_lptr_disk(cur, *lpp, level))) {
1032 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1038 xfs_bmbt_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
1039 xfs_bmbt_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
1041 lrp = XFS_BMAP_REC_IADDR(left, be16_to_cpu(left->bb_numrecs), cur);
1042 rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
1043 memmove(rrp + 1, rrp, be16_to_cpu(right->bb_numrecs) * sizeof(*rrp));
1045 xfs_bmbt_log_recs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
1046 key.br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(rrp));
1049 be16_add_cpu(&left->bb_numrecs, -1);
1050 xfs_bmbt_log_block(cur, lbp, XFS_BB_NUMRECS);
1051 be16_add_cpu(&right->bb_numrecs, 1);
1054 xfs_btree_check_key(XFS_BTNUM_BMAP, rkp, rkp + 1);
1056 xfs_btree_check_rec(XFS_BTNUM_BMAP, rrp, rrp + 1);
1058 xfs_bmbt_log_block(cur, rbp, XFS_BB_NUMRECS);
1059 if ((error = xfs_btree_dup_cursor(cur, &tcur))) {
1060 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1063 i = xfs_btree_lastrec(tcur, level);
1064 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
1065 if ((error = xfs_btree_increment(tcur, level, &i))) {
1066 XFS_BMBT_TRACE_CURSOR(tcur, ERROR);
1069 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
1070 if ((error = xfs_bmbt_updkey(tcur, rkp, level + 1))) {
1071 XFS_BMBT_TRACE_CURSOR(tcur, ERROR);
1074 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
1075 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1079 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1081 xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
1086 * Determine the extent state.
1095 ASSERT(blks != 0); /* saved for DMIG */
1096 return XFS_EXT_UNWRITTEN;
1098 return XFS_EXT_NORM;
1103 * Split cur/level block in half.
1104 * Return new block number and its first record (to be inserted into parent).
1106 STATIC int /* error */
1108 xfs_btree_cur_t *cur,
1110 xfs_fsblock_t *bnop,
1111 __uint64_t *startoff,
1112 xfs_btree_cur_t **curp,
1113 int *stat) /* success/failure */
1115 xfs_alloc_arg_t args; /* block allocation args */
1116 int error; /* error return value */
1117 int i; /* loop counter */
1118 xfs_fsblock_t lbno; /* left sibling block number */
1119 xfs_buf_t *lbp; /* left buffer pointer */
1120 xfs_bmbt_block_t *left; /* left btree block */
1121 xfs_bmbt_key_t *lkp; /* left btree key */
1122 xfs_bmbt_ptr_t *lpp; /* left address pointer */
1123 xfs_bmbt_rec_t *lrp; /* left record pointer */
1124 xfs_buf_t *rbp; /* right buffer pointer */
1125 xfs_bmbt_block_t *right; /* right btree block */
1126 xfs_bmbt_key_t *rkp; /* right btree key */
1127 xfs_bmbt_ptr_t *rpp; /* right address pointer */
1128 xfs_bmbt_block_t *rrblock; /* right-right btree block */
1129 xfs_buf_t *rrbp; /* right-right buffer pointer */
1130 xfs_bmbt_rec_t *rrp; /* right record pointer */
1132 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
1133 // disable until merged into common code
1134 // XFS_BMBT_TRACE_ARGIFK(cur, level, *bnop, *startoff);
1135 args.tp = cur->bc_tp;
1136 args.mp = cur->bc_mp;
1137 lbp = cur->bc_bufs[level];
1138 lbno = XFS_DADDR_TO_FSB(args.mp, XFS_BUF_ADDR(lbp));
1139 left = XFS_BUF_TO_BMBT_BLOCK(lbp);
1140 args.fsbno = cur->bc_private.b.firstblock;
1141 args.firstblock = args.fsbno;
1143 if (args.fsbno == NULLFSBLOCK) {
1145 args.type = XFS_ALLOCTYPE_START_BNO;
1147 * Make sure there is sufficient room left in the AG to
1148 * complete a full tree split for an extent insert. If
1149 * we are converting the middle part of an extent then
1150 * we may need space for two tree splits.
1152 * We are relying on the caller to make the correct block
1153 * reservation for this operation to succeed. If the
1154 * reservation amount is insufficient then we may fail a
1155 * block allocation here and corrupt the filesystem.
1157 args.minleft = xfs_trans_get_block_res(args.tp);
1158 } else if (cur->bc_private.b.flist->xbf_low)
1159 args.type = XFS_ALLOCTYPE_START_BNO;
1161 args.type = XFS_ALLOCTYPE_NEAR_BNO;
1162 args.mod = args.alignment = args.total = args.isfl =
1163 args.userdata = args.minalignslop = 0;
1164 args.minlen = args.maxlen = args.prod = 1;
1165 args.wasdel = cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL;
1166 if (!args.wasdel && xfs_trans_get_block_res(args.tp) == 0) {
1167 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1168 return XFS_ERROR(ENOSPC);
1170 if ((error = xfs_alloc_vextent(&args))) {
1171 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1174 if (args.fsbno == NULLFSBLOCK && args.minleft) {
1176 * Could not find an AG with enough free space to satisfy
1177 * a full btree split. Try again without minleft and if
1178 * successful activate the lowspace algorithm.
1181 args.type = XFS_ALLOCTYPE_FIRST_AG;
1183 if ((error = xfs_alloc_vextent(&args))) {
1184 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1187 cur->bc_private.b.flist->xbf_low = 1;
1189 if (args.fsbno == NULLFSBLOCK) {
1190 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1194 ASSERT(args.len == 1);
1195 cur->bc_private.b.firstblock = args.fsbno;
1196 cur->bc_private.b.allocated++;
1197 cur->bc_private.b.ip->i_d.di_nblocks++;
1198 xfs_trans_log_inode(args.tp, cur->bc_private.b.ip, XFS_ILOG_CORE);
1199 XFS_TRANS_MOD_DQUOT_BYINO(args.mp, args.tp, cur->bc_private.b.ip,
1200 XFS_TRANS_DQ_BCOUNT, 1L);
1201 rbp = xfs_btree_get_bufl(args.mp, args.tp, args.fsbno, 0);
1202 right = XFS_BUF_TO_BMBT_BLOCK(rbp);
1204 if ((error = xfs_btree_check_lblock(cur, left, level, rbp))) {
1205 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1209 right->bb_magic = cpu_to_be32(XFS_BMAP_MAGIC);
1210 right->bb_level = left->bb_level;
1211 right->bb_numrecs = cpu_to_be16(be16_to_cpu(left->bb_numrecs) / 2);
1212 if ((be16_to_cpu(left->bb_numrecs) & 1) &&
1213 cur->bc_ptrs[level] <= be16_to_cpu(right->bb_numrecs) + 1)
1214 be16_add_cpu(&right->bb_numrecs, 1);
1215 i = be16_to_cpu(left->bb_numrecs) - be16_to_cpu(right->bb_numrecs) + 1;
1217 lkp = XFS_BMAP_KEY_IADDR(left, i, cur);
1218 lpp = XFS_BMAP_PTR_IADDR(left, i, cur);
1219 rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
1220 rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
1222 for (i = 0; i < be16_to_cpu(right->bb_numrecs); i++) {
1223 if ((error = xfs_btree_check_lptr_disk(cur, lpp[i], level))) {
1224 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1229 memcpy(rkp, lkp, be16_to_cpu(right->bb_numrecs) * sizeof(*rkp));
1230 memcpy(rpp, lpp, be16_to_cpu(right->bb_numrecs) * sizeof(*rpp));
1231 xfs_bmbt_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs));
1232 xfs_bmbt_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs));
1233 *startoff = be64_to_cpu(rkp->br_startoff);
1235 lrp = XFS_BMAP_REC_IADDR(left, i, cur);
1236 rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
1237 memcpy(rrp, lrp, be16_to_cpu(right->bb_numrecs) * sizeof(*rrp));
1238 xfs_bmbt_log_recs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs));
1239 *startoff = xfs_bmbt_disk_get_startoff(rrp);
1241 be16_add_cpu(&left->bb_numrecs, -(be16_to_cpu(right->bb_numrecs)));
1242 right->bb_rightsib = left->bb_rightsib;
1243 left->bb_rightsib = cpu_to_be64(args.fsbno);
1244 right->bb_leftsib = cpu_to_be64(lbno);
1245 xfs_bmbt_log_block(cur, rbp, XFS_BB_ALL_BITS);
1246 xfs_bmbt_log_block(cur, lbp, XFS_BB_NUMRECS | XFS_BB_RIGHTSIB);
1247 if (be64_to_cpu(right->bb_rightsib) != NULLDFSBNO) {
1248 if ((error = xfs_btree_read_bufl(args.mp, args.tp,
1249 be64_to_cpu(right->bb_rightsib), 0, &rrbp,
1250 XFS_BMAP_BTREE_REF))) {
1251 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1254 rrblock = XFS_BUF_TO_BMBT_BLOCK(rrbp);
1255 if ((error = xfs_btree_check_lblock(cur, rrblock, level, rrbp))) {
1256 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1259 rrblock->bb_leftsib = cpu_to_be64(args.fsbno);
1260 xfs_bmbt_log_block(cur, rrbp, XFS_BB_LEFTSIB);
1262 if (cur->bc_ptrs[level] > be16_to_cpu(left->bb_numrecs) + 1) {
1263 xfs_btree_setbuf(cur, level, rbp);
1264 cur->bc_ptrs[level] -= be16_to_cpu(left->bb_numrecs);
1266 if (level + 1 < cur->bc_nlevels) {
1267 if ((error = xfs_btree_dup_cursor(cur, curp))) {
1268 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1271 (*curp)->bc_ptrs[level + 1]++;
1274 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1281 * Update keys for the record.
1285 xfs_btree_cur_t *cur,
1286 xfs_bmbt_key_t *keyp, /* on-disk format */
1289 xfs_bmbt_block_t *block;
1298 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
1299 XFS_BMBT_TRACE_ARGIK(cur, level, keyp);
1300 for (ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {
1301 block = xfs_bmbt_get_block(cur, level, &bp);
1303 if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
1304 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1308 ptr = cur->bc_ptrs[level];
1309 kp = XFS_BMAP_KEY_IADDR(block, ptr, cur);
1311 xfs_bmbt_log_keys(cur, bp, ptr, ptr);
1313 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1318 * Convert on-disk form of btree root to in-memory form.
1322 xfs_bmdr_block_t *dblock,
1324 xfs_bmbt_block_t *rblock,
1328 xfs_bmbt_key_t *fkp;
1330 xfs_bmbt_key_t *tkp;
1333 rblock->bb_magic = cpu_to_be32(XFS_BMAP_MAGIC);
1334 rblock->bb_level = dblock->bb_level;
1335 ASSERT(be16_to_cpu(rblock->bb_level) > 0);
1336 rblock->bb_numrecs = dblock->bb_numrecs;
1337 rblock->bb_leftsib = cpu_to_be64(NULLDFSBNO);
1338 rblock->bb_rightsib = cpu_to_be64(NULLDFSBNO);
1339 dmxr = (int)XFS_BTREE_BLOCK_MAXRECS(dblocklen, xfs_bmdr, 0);
1340 fkp = XFS_BTREE_KEY_ADDR(xfs_bmdr, dblock, 1);
1341 tkp = XFS_BMAP_BROOT_KEY_ADDR(rblock, 1, rblocklen);
1342 fpp = XFS_BTREE_PTR_ADDR(xfs_bmdr, dblock, 1, dmxr);
1343 tpp = XFS_BMAP_BROOT_PTR_ADDR(rblock, 1, rblocklen);
1344 dmxr = be16_to_cpu(dblock->bb_numrecs);
1345 memcpy(tkp, fkp, sizeof(*fkp) * dmxr);
1346 memcpy(tpp, fpp, sizeof(*fpp) * dmxr);
1350 * Delete the record pointed to by cur.
1354 xfs_btree_cur_t *cur,
1355 int *stat) /* success/failure */
1357 int error; /* error return value */
1361 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
1362 for (level = 0, i = 2; i == 2; level++) {
1363 if ((error = xfs_bmbt_delrec(cur, level, &i))) {
1364 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1369 for (level = 1; level < cur->bc_nlevels; level++) {
1370 if (cur->bc_ptrs[level] == 0) {
1371 if ((error = xfs_btree_decrement(cur, level,
1373 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1380 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1386 * Convert a compressed bmap extent record to an uncompressed form.
1387 * This code must be in sync with the routines xfs_bmbt_get_startoff,
1388 * xfs_bmbt_get_startblock, xfs_bmbt_get_blockcount and xfs_bmbt_get_state.
1400 ext_flag = (int)(l0 >> (64 - BMBT_EXNTFLAG_BITLEN));
1401 s->br_startoff = ((xfs_fileoff_t)l0 &
1402 XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
1404 s->br_startblock = (((xfs_fsblock_t)l0 & XFS_MASK64LO(9)) << 43) |
1405 (((xfs_fsblock_t)l1) >> 21);
1411 b = (((xfs_dfsbno_t)l0 & XFS_MASK64LO(9)) << 43) |
1412 (((xfs_dfsbno_t)l1) >> 21);
1413 ASSERT((b >> 32) == 0 || ISNULLDSTARTBLOCK(b));
1414 s->br_startblock = (xfs_fsblock_t)b;
1417 s->br_startblock = (xfs_fsblock_t)(((xfs_dfsbno_t)l1) >> 21);
1419 #endif /* XFS_BIG_BLKNOS */
1420 s->br_blockcount = (xfs_filblks_t)(l1 & XFS_MASK64LO(21));
1421 /* This is xfs_extent_state() in-line */
1423 ASSERT(s->br_blockcount != 0); /* saved for DMIG */
1424 st = XFS_EXT_UNWRITTEN;
1432 xfs_bmbt_rec_host_t *r,
1435 __xfs_bmbt_get_all(r->l0, r->l1, s);
1439 * Get the block pointer for the given level of the cursor.
1440 * Fill in the buffer pointer, if applicable.
1444 xfs_btree_cur_t *cur,
1449 xfs_bmbt_block_t *rval;
1451 if (level < cur->bc_nlevels - 1) {
1452 *bpp = cur->bc_bufs[level];
1453 rval = XFS_BUF_TO_BMBT_BLOCK(*bpp);
1456 ifp = XFS_IFORK_PTR(cur->bc_private.b.ip,
1457 cur->bc_private.b.whichfork);
1458 rval = ifp->if_broot;
1464 * Extract the blockcount field from an in memory bmap extent record.
1467 xfs_bmbt_get_blockcount(
1468 xfs_bmbt_rec_host_t *r)
1470 return (xfs_filblks_t)(r->l1 & XFS_MASK64LO(21));
1474 * Extract the startblock field from an in memory bmap extent record.
1477 xfs_bmbt_get_startblock(
1478 xfs_bmbt_rec_host_t *r)
1481 return (((xfs_fsblock_t)r->l0 & XFS_MASK64LO(9)) << 43) |
1482 (((xfs_fsblock_t)r->l1) >> 21);
1487 b = (((xfs_dfsbno_t)r->l0 & XFS_MASK64LO(9)) << 43) |
1488 (((xfs_dfsbno_t)r->l1) >> 21);
1489 ASSERT((b >> 32) == 0 || ISNULLDSTARTBLOCK(b));
1490 return (xfs_fsblock_t)b;
1492 return (xfs_fsblock_t)(((xfs_dfsbno_t)r->l1) >> 21);
1494 #endif /* XFS_BIG_BLKNOS */
1498 * Extract the startoff field from an in memory bmap extent record.
1501 xfs_bmbt_get_startoff(
1502 xfs_bmbt_rec_host_t *r)
1504 return ((xfs_fileoff_t)r->l0 &
1505 XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
1510 xfs_bmbt_rec_host_t *r)
1514 ext_flag = (int)((r->l0) >> (64 - BMBT_EXNTFLAG_BITLEN));
1515 return xfs_extent_state(xfs_bmbt_get_blockcount(r),
1519 /* Endian flipping versions of the bmbt extraction functions */
1521 xfs_bmbt_disk_get_all(
1525 __xfs_bmbt_get_all(be64_to_cpu(r->l0), be64_to_cpu(r->l1), s);
1529 * Extract the blockcount field from an on disk bmap extent record.
1532 xfs_bmbt_disk_get_blockcount(
1535 return (xfs_filblks_t)(be64_to_cpu(r->l1) & XFS_MASK64LO(21));
1539 * Extract the startoff field from a disk format bmap extent record.
1542 xfs_bmbt_disk_get_startoff(
1545 return ((xfs_fileoff_t)be64_to_cpu(r->l0) &
1546 XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
1550 * Insert the current record at the point referenced by cur.
1552 * A multi-level split of the tree on insert will invalidate the original
1553 * cursor. All callers of this function should assume that the cursor is
1554 * no longer valid and revalidate it.
1558 xfs_btree_cur_t *cur,
1559 int *stat) /* success/failure */
1561 int error; /* error return value */
1565 xfs_btree_cur_t *ncur;
1566 xfs_bmbt_rec_t nrec;
1567 xfs_btree_cur_t *pcur;
1569 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
1572 xfs_bmbt_disk_set_all(&nrec, &cur->bc_rec.b);
1576 if ((error = xfs_bmbt_insrec(pcur, level++, &nbno, &nrec, &ncur,
1579 xfs_btree_del_cursor(pcur, XFS_BTREE_ERROR);
1580 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1583 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
1584 if (pcur != cur && (ncur || nbno == NULLFSBLOCK)) {
1585 cur->bc_nlevels = pcur->bc_nlevels;
1586 cur->bc_private.b.allocated +=
1587 pcur->bc_private.b.allocated;
1588 pcur->bc_private.b.allocated = 0;
1589 ASSERT((cur->bc_private.b.firstblock != NULLFSBLOCK) ||
1590 XFS_IS_REALTIME_INODE(cur->bc_private.b.ip));
1591 cur->bc_private.b.firstblock =
1592 pcur->bc_private.b.firstblock;
1593 ASSERT(cur->bc_private.b.flist ==
1594 pcur->bc_private.b.flist);
1595 xfs_btree_del_cursor(pcur, XFS_BTREE_NOERROR);
1601 } while (nbno != NULLFSBLOCK);
1602 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1606 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1611 * Log fields from the btree block header.
1615 xfs_btree_cur_t *cur,
1622 static const short offsets[] = {
1623 offsetof(xfs_bmbt_block_t, bb_magic),
1624 offsetof(xfs_bmbt_block_t, bb_level),
1625 offsetof(xfs_bmbt_block_t, bb_numrecs),
1626 offsetof(xfs_bmbt_block_t, bb_leftsib),
1627 offsetof(xfs_bmbt_block_t, bb_rightsib),
1628 sizeof(xfs_bmbt_block_t)
1631 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
1632 XFS_BMBT_TRACE_ARGBI(cur, bp, fields);
1635 xfs_btree_offsets(fields, offsets, XFS_BB_NUM_BITS, &first,
1637 xfs_trans_log_buf(tp, bp, first, last);
1639 xfs_trans_log_inode(tp, cur->bc_private.b.ip,
1640 XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
1641 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1645 * Log record values from the btree block.
1649 xfs_btree_cur_t *cur,
1654 xfs_bmbt_block_t *block;
1660 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
1661 XFS_BMBT_TRACE_ARGBII(cur, bp, rfirst, rlast);
1664 block = XFS_BUF_TO_BMBT_BLOCK(bp);
1665 rp = XFS_BMAP_REC_DADDR(block, 1, cur);
1666 first = (int)((xfs_caddr_t)&rp[rfirst - 1] - (xfs_caddr_t)block);
1667 last = (int)(((xfs_caddr_t)&rp[rlast] - 1) - (xfs_caddr_t)block);
1668 xfs_trans_log_buf(tp, bp, first, last);
1669 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1673 * Give the bmap btree a new root block. Copy the old broot contents
1674 * down into a real block and make the broot point to it.
1678 xfs_btree_cur_t *cur, /* btree cursor */
1679 int *logflags, /* logging flags for inode */
1680 int *stat) /* return status - 0 fail */
1682 xfs_alloc_arg_t args; /* allocation arguments */
1683 xfs_bmbt_block_t *block; /* bmap btree block */
1684 xfs_buf_t *bp; /* buffer for block */
1685 xfs_bmbt_block_t *cblock; /* child btree block */
1686 xfs_bmbt_key_t *ckp; /* child key pointer */
1687 xfs_bmbt_ptr_t *cpp; /* child ptr pointer */
1688 int error; /* error return code */
1690 int i; /* loop counter */
1692 xfs_bmbt_key_t *kp; /* pointer to bmap btree key */
1693 int level; /* btree level */
1694 xfs_bmbt_ptr_t *pp; /* pointer to bmap block addr */
1696 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
1697 level = cur->bc_nlevels - 1;
1698 block = xfs_bmbt_get_block(cur, level, &bp);
1700 * Copy the root into a real block.
1702 args.mp = cur->bc_mp;
1703 pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
1704 args.tp = cur->bc_tp;
1705 args.fsbno = cur->bc_private.b.firstblock;
1706 args.mod = args.minleft = args.alignment = args.total = args.isfl =
1707 args.userdata = args.minalignslop = 0;
1708 args.minlen = args.maxlen = args.prod = 1;
1709 args.wasdel = cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL;
1710 args.firstblock = args.fsbno;
1711 if (args.fsbno == NULLFSBLOCK) {
1713 if ((error = xfs_btree_check_lptr_disk(cur, *pp, level))) {
1714 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1718 args.fsbno = be64_to_cpu(*pp);
1719 args.type = XFS_ALLOCTYPE_START_BNO;
1720 } else if (cur->bc_private.b.flist->xbf_low)
1721 args.type = XFS_ALLOCTYPE_START_BNO;
1723 args.type = XFS_ALLOCTYPE_NEAR_BNO;
1724 if ((error = xfs_alloc_vextent(&args))) {
1725 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1728 if (args.fsbno == NULLFSBLOCK) {
1729 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1733 ASSERT(args.len == 1);
1734 cur->bc_private.b.firstblock = args.fsbno;
1735 cur->bc_private.b.allocated++;
1736 cur->bc_private.b.ip->i_d.di_nblocks++;
1737 XFS_TRANS_MOD_DQUOT_BYINO(args.mp, args.tp, cur->bc_private.b.ip,
1738 XFS_TRANS_DQ_BCOUNT, 1L);
1739 bp = xfs_btree_get_bufl(args.mp, cur->bc_tp, args.fsbno, 0);
1740 cblock = XFS_BUF_TO_BMBT_BLOCK(bp);
1742 be16_add_cpu(&block->bb_level, 1);
1743 block->bb_numrecs = cpu_to_be16(1);
1745 cur->bc_ptrs[level + 1] = 1;
1746 kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
1747 ckp = XFS_BMAP_KEY_IADDR(cblock, 1, cur);
1748 memcpy(ckp, kp, be16_to_cpu(cblock->bb_numrecs) * sizeof(*kp));
1749 cpp = XFS_BMAP_PTR_IADDR(cblock, 1, cur);
1751 for (i = 0; i < be16_to_cpu(cblock->bb_numrecs); i++) {
1752 if ((error = xfs_btree_check_lptr_disk(cur, pp[i], level))) {
1753 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1758 memcpy(cpp, pp, be16_to_cpu(cblock->bb_numrecs) * sizeof(*pp));
1760 if ((error = xfs_btree_check_lptr(cur, args.fsbno, level))) {
1761 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
1765 *pp = cpu_to_be64(args.fsbno);
1766 xfs_iroot_realloc(cur->bc_private.b.ip, 1 - be16_to_cpu(cblock->bb_numrecs),
1767 cur->bc_private.b.whichfork);
1768 xfs_btree_setbuf(cur, level, bp);
1770 * Do all this logging at the end so that
1771 * the root is at the right level.
1773 xfs_bmbt_log_block(cur, bp, XFS_BB_ALL_BITS);
1774 xfs_bmbt_log_keys(cur, bp, 1, be16_to_cpu(cblock->bb_numrecs));
1775 xfs_bmbt_log_ptrs(cur, bp, 1, be16_to_cpu(cblock->bb_numrecs));
1776 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
1778 XFS_ILOG_CORE | XFS_ILOG_FBROOT(cur->bc_private.b.whichfork);
1784 * Set all the fields in a bmap extent record from the arguments.
1788 xfs_bmbt_rec_host_t *r,
1789 xfs_fileoff_t startoff,
1790 xfs_fsblock_t startblock,
1791 xfs_filblks_t blockcount,
1794 int extent_flag = (state == XFS_EXT_NORM) ? 0 : 1;
1796 ASSERT(state == XFS_EXT_NORM || state == XFS_EXT_UNWRITTEN);
1797 ASSERT((startoff & XFS_MASK64HI(64-BMBT_STARTOFF_BITLEN)) == 0);
1798 ASSERT((blockcount & XFS_MASK64HI(64-BMBT_BLOCKCOUNT_BITLEN)) == 0);
1801 ASSERT((startblock & XFS_MASK64HI(64-BMBT_STARTBLOCK_BITLEN)) == 0);
1803 r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
1804 ((xfs_bmbt_rec_base_t)startoff << 9) |
1805 ((xfs_bmbt_rec_base_t)startblock >> 43);
1806 r->l1 = ((xfs_bmbt_rec_base_t)startblock << 21) |
1807 ((xfs_bmbt_rec_base_t)blockcount &
1808 (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
1809 #else /* !XFS_BIG_BLKNOS */
1810 if (ISNULLSTARTBLOCK(startblock)) {
1811 r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
1812 ((xfs_bmbt_rec_base_t)startoff << 9) |
1813 (xfs_bmbt_rec_base_t)XFS_MASK64LO(9);
1814 r->l1 = XFS_MASK64HI(11) |
1815 ((xfs_bmbt_rec_base_t)startblock << 21) |
1816 ((xfs_bmbt_rec_base_t)blockcount &
1817 (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
1819 r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
1820 ((xfs_bmbt_rec_base_t)startoff << 9);
1821 r->l1 = ((xfs_bmbt_rec_base_t)startblock << 21) |
1822 ((xfs_bmbt_rec_base_t)blockcount &
1823 (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
1825 #endif /* XFS_BIG_BLKNOS */
1829 * Set all the fields in a bmap extent record from the uncompressed form.
1833 xfs_bmbt_rec_host_t *r,
1836 xfs_bmbt_set_allf(r, s->br_startoff, s->br_startblock,
1837 s->br_blockcount, s->br_state);
1842 * Set all the fields in a disk format bmap extent record from the arguments.
1845 xfs_bmbt_disk_set_allf(
1847 xfs_fileoff_t startoff,
1848 xfs_fsblock_t startblock,
1849 xfs_filblks_t blockcount,
1852 int extent_flag = (state == XFS_EXT_NORM) ? 0 : 1;
1854 ASSERT(state == XFS_EXT_NORM || state == XFS_EXT_UNWRITTEN);
1855 ASSERT((startoff & XFS_MASK64HI(64-BMBT_STARTOFF_BITLEN)) == 0);
1856 ASSERT((blockcount & XFS_MASK64HI(64-BMBT_BLOCKCOUNT_BITLEN)) == 0);
1859 ASSERT((startblock & XFS_MASK64HI(64-BMBT_STARTBLOCK_BITLEN)) == 0);
1861 r->l0 = cpu_to_be64(
1862 ((xfs_bmbt_rec_base_t)extent_flag << 63) |
1863 ((xfs_bmbt_rec_base_t)startoff << 9) |
1864 ((xfs_bmbt_rec_base_t)startblock >> 43));
1865 r->l1 = cpu_to_be64(
1866 ((xfs_bmbt_rec_base_t)startblock << 21) |
1867 ((xfs_bmbt_rec_base_t)blockcount &
1868 (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
1869 #else /* !XFS_BIG_BLKNOS */
1870 if (ISNULLSTARTBLOCK(startblock)) {
1871 r->l0 = cpu_to_be64(
1872 ((xfs_bmbt_rec_base_t)extent_flag << 63) |
1873 ((xfs_bmbt_rec_base_t)startoff << 9) |
1874 (xfs_bmbt_rec_base_t)XFS_MASK64LO(9));
1875 r->l1 = cpu_to_be64(XFS_MASK64HI(11) |
1876 ((xfs_bmbt_rec_base_t)startblock << 21) |
1877 ((xfs_bmbt_rec_base_t)blockcount &
1878 (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
1880 r->l0 = cpu_to_be64(
1881 ((xfs_bmbt_rec_base_t)extent_flag << 63) |
1882 ((xfs_bmbt_rec_base_t)startoff << 9));
1883 r->l1 = cpu_to_be64(
1884 ((xfs_bmbt_rec_base_t)startblock << 21) |
1885 ((xfs_bmbt_rec_base_t)blockcount &
1886 (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
1888 #endif /* XFS_BIG_BLKNOS */
1892 * Set all the fields in a bmap extent record from the uncompressed form.
1895 xfs_bmbt_disk_set_all(
1899 xfs_bmbt_disk_set_allf(r, s->br_startoff, s->br_startblock,
1900 s->br_blockcount, s->br_state);
1904 * Set the blockcount field in a bmap extent record.
1907 xfs_bmbt_set_blockcount(
1908 xfs_bmbt_rec_host_t *r,
1911 ASSERT((v & XFS_MASK64HI(43)) == 0);
1912 r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64HI(43)) |
1913 (xfs_bmbt_rec_base_t)(v & XFS_MASK64LO(21));
1917 * Set the startblock field in a bmap extent record.
1920 xfs_bmbt_set_startblock(
1921 xfs_bmbt_rec_host_t *r,
1925 ASSERT((v & XFS_MASK64HI(12)) == 0);
1926 r->l0 = (r->l0 & (xfs_bmbt_rec_base_t)XFS_MASK64HI(55)) |
1927 (xfs_bmbt_rec_base_t)(v >> 43);
1928 r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)) |
1929 (xfs_bmbt_rec_base_t)(v << 21);
1930 #else /* !XFS_BIG_BLKNOS */
1931 if (ISNULLSTARTBLOCK(v)) {
1932 r->l0 |= (xfs_bmbt_rec_base_t)XFS_MASK64LO(9);
1933 r->l1 = (xfs_bmbt_rec_base_t)XFS_MASK64HI(11) |
1934 ((xfs_bmbt_rec_base_t)v << 21) |
1935 (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
1937 r->l0 &= ~(xfs_bmbt_rec_base_t)XFS_MASK64LO(9);
1938 r->l1 = ((xfs_bmbt_rec_base_t)v << 21) |
1939 (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
1941 #endif /* XFS_BIG_BLKNOS */
1945 * Set the startoff field in a bmap extent record.
1948 xfs_bmbt_set_startoff(
1949 xfs_bmbt_rec_host_t *r,
1952 ASSERT((v & XFS_MASK64HI(9)) == 0);
1953 r->l0 = (r->l0 & (xfs_bmbt_rec_base_t) XFS_MASK64HI(1)) |
1954 ((xfs_bmbt_rec_base_t)v << 9) |
1955 (r->l0 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(9));
1959 * Set the extent state field in a bmap extent record.
1963 xfs_bmbt_rec_host_t *r,
1966 ASSERT(v == XFS_EXT_NORM || v == XFS_EXT_UNWRITTEN);
1967 if (v == XFS_EXT_NORM)
1968 r->l0 &= XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN);
1970 r->l0 |= XFS_MASK64HI(BMBT_EXNTFLAG_BITLEN);
1974 * Convert in-memory form of btree root to on-disk form.
1978 xfs_bmbt_block_t *rblock,
1980 xfs_bmdr_block_t *dblock,
1984 xfs_bmbt_key_t *fkp;
1986 xfs_bmbt_key_t *tkp;
1989 ASSERT(be32_to_cpu(rblock->bb_magic) == XFS_BMAP_MAGIC);
1990 ASSERT(be64_to_cpu(rblock->bb_leftsib) == NULLDFSBNO);
1991 ASSERT(be64_to_cpu(rblock->bb_rightsib) == NULLDFSBNO);
1992 ASSERT(be16_to_cpu(rblock->bb_level) > 0);
1993 dblock->bb_level = rblock->bb_level;
1994 dblock->bb_numrecs = rblock->bb_numrecs;
1995 dmxr = (int)XFS_BTREE_BLOCK_MAXRECS(dblocklen, xfs_bmdr, 0);
1996 fkp = XFS_BMAP_BROOT_KEY_ADDR(rblock, 1, rblocklen);
1997 tkp = XFS_BTREE_KEY_ADDR(xfs_bmdr, dblock, 1);
1998 fpp = XFS_BMAP_BROOT_PTR_ADDR(rblock, 1, rblocklen);
1999 tpp = XFS_BTREE_PTR_ADDR(xfs_bmdr, dblock, 1, dmxr);
2000 dmxr = be16_to_cpu(dblock->bb_numrecs);
2001 memcpy(tkp, fkp, sizeof(*fkp) * dmxr);
2002 memcpy(tpp, fpp, sizeof(*fpp) * dmxr);
2006 * Update the record to the passed values.
2010 xfs_btree_cur_t *cur,
2016 xfs_bmbt_block_t *block;
2023 XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
2024 XFS_BMBT_TRACE_ARGFFFI(cur, (xfs_dfiloff_t)off, (xfs_dfsbno_t)bno,
2025 (xfs_dfilblks_t)len, (int)state);
2026 block = xfs_bmbt_get_block(cur, 0, &bp);
2028 if ((error = xfs_btree_check_lblock(cur, block, 0, bp))) {
2029 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
2033 ptr = cur->bc_ptrs[0];
2034 rp = XFS_BMAP_REC_IADDR(block, ptr, cur);
2035 xfs_bmbt_disk_set_allf(rp, off, bno, len, state);
2036 xfs_bmbt_log_recs(cur, bp, ptr, ptr);
2038 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
2041 key.br_startoff = cpu_to_be64(off);
2042 if ((error = xfs_bmbt_updkey(cur, &key, 1))) {
2043 XFS_BMBT_TRACE_CURSOR(cur, ERROR);
2046 XFS_BMBT_TRACE_CURSOR(cur, EXIT);
2051 * Check extent records, which have just been read, for
2052 * any bit in the extent flag field. ASSERT on debug
2053 * kernels, as this condition should not occur.
2054 * Return an error condition (1) if any flags found,
2055 * otherwise return 0.
2059 xfs_check_nostate_extents(
2064 for (; num > 0; num--, idx++) {
2065 xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx);
2067 (64 - BMBT_EXNTFLAG_BITLEN)) != 0) {
2076 STATIC struct xfs_btree_cur *
2077 xfs_bmbt_dup_cursor(
2078 struct xfs_btree_cur *cur)
2080 struct xfs_btree_cur *new;
2082 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp,
2083 cur->bc_private.b.ip, cur->bc_private.b.whichfork);
2086 * Copy the firstblock, flist, and flags values,
2087 * since init cursor doesn't get them.
2089 new->bc_private.b.firstblock = cur->bc_private.b.firstblock;
2090 new->bc_private.b.flist = cur->bc_private.b.flist;
2091 new->bc_private.b.flags = cur->bc_private.b.flags;
2097 xfs_bmbt_get_maxrecs(
2098 struct xfs_btree_cur *cur,
2101 return XFS_BMAP_BLOCK_IMAXRECS(level, cur);
2105 xfs_bmbt_init_key_from_rec(
2106 union xfs_btree_key *key,
2107 union xfs_btree_rec *rec)
2109 key->bmbt.br_startoff =
2110 cpu_to_be64(xfs_bmbt_disk_get_startoff(&rec->bmbt));
2114 xfs_bmbt_init_ptr_from_cur(
2115 struct xfs_btree_cur *cur,
2116 union xfs_btree_ptr *ptr)
2123 struct xfs_btree_cur *cur,
2124 union xfs_btree_key *key)
2126 return (__int64_t)be64_to_cpu(key->bmbt.br_startoff) -
2127 cur->bc_rec.b.br_startoff;
2130 #ifdef XFS_BTREE_TRACE
2131 ktrace_t *xfs_bmbt_trace_buf;
2134 xfs_bmbt_trace_enter(
2135 struct xfs_btree_cur *cur,
2152 struct xfs_inode *ip = cur->bc_private.b.ip;
2153 int whichfork = cur->bc_private.b.whichfork;
2155 ktrace_enter(xfs_bmbt_trace_buf,
2156 (void *)((__psint_t)type | (whichfork << 8) | (line << 16)),
2157 (void *)func, (void *)s, (void *)ip, (void *)cur,
2158 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
2159 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
2160 (void *)a8, (void *)a9, (void *)a10);
2161 ktrace_enter(ip->i_btrace,
2162 (void *)((__psint_t)type | (whichfork << 8) | (line << 16)),
2163 (void *)func, (void *)s, (void *)ip, (void *)cur,
2164 (void *)a0, (void *)a1, (void *)a2, (void *)a3,
2165 (void *)a4, (void *)a5, (void *)a6, (void *)a7,
2166 (void *)a8, (void *)a9, (void *)a10);
2170 xfs_bmbt_trace_cursor(
2171 struct xfs_btree_cur *cur,
2176 struct xfs_bmbt_rec_host r;
2178 xfs_bmbt_set_all(&r, &cur->bc_rec.b);
2180 *s0 = (cur->bc_nlevels << 24) |
2181 (cur->bc_private.b.flags << 16) |
2182 cur->bc_private.b.allocated;
2189 struct xfs_btree_cur *cur,
2190 union xfs_btree_key *key,
2194 *l0 = be64_to_cpu(key->bmbt.br_startoff);
2199 xfs_bmbt_trace_record(
2200 struct xfs_btree_cur *cur,
2201 union xfs_btree_rec *rec,
2206 struct xfs_bmbt_irec irec;
2208 xfs_bmbt_disk_get_all(&rec->bmbt, &irec);
2209 *l0 = irec.br_startoff;
2210 *l1 = irec.br_startblock;
2211 *l2 = irec.br_blockcount;
2213 #endif /* XFS_BTREE_TRACE */
2215 static const struct xfs_btree_ops xfs_bmbt_ops = {
2216 .rec_len = sizeof(xfs_bmbt_rec_t),
2217 .key_len = sizeof(xfs_bmbt_key_t),
2219 .dup_cursor = xfs_bmbt_dup_cursor,
2220 .get_maxrecs = xfs_bmbt_get_maxrecs,
2221 .init_key_from_rec = xfs_bmbt_init_key_from_rec,
2222 .init_ptr_from_cur = xfs_bmbt_init_ptr_from_cur,
2223 .key_diff = xfs_bmbt_key_diff,
2225 #ifdef XFS_BTREE_TRACE
2226 .trace_enter = xfs_bmbt_trace_enter,
2227 .trace_cursor = xfs_bmbt_trace_cursor,
2228 .trace_key = xfs_bmbt_trace_key,
2229 .trace_record = xfs_bmbt_trace_record,
2234 * Allocate a new bmap btree cursor.
2236 struct xfs_btree_cur * /* new bmap btree cursor */
2237 xfs_bmbt_init_cursor(
2238 struct xfs_mount *mp, /* file system mount point */
2239 struct xfs_trans *tp, /* transaction pointer */
2240 struct xfs_inode *ip, /* inode owning the btree */
2241 int whichfork) /* data or attr fork */
2243 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
2244 struct xfs_btree_cur *cur;
2246 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
2250 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1;
2251 cur->bc_btnum = XFS_BTNUM_BMAP;
2252 cur->bc_blocklog = mp->m_sb.sb_blocklog;
2254 cur->bc_ops = &xfs_bmbt_ops;
2255 cur->bc_flags = XFS_BTREE_LONG_PTRS | XFS_BTREE_ROOT_IN_INODE;
2257 cur->bc_private.b.forksize = XFS_IFORK_SIZE(ip, whichfork);
2258 cur->bc_private.b.ip = ip;
2259 cur->bc_private.b.firstblock = NULLFSBLOCK;
2260 cur->bc_private.b.flist = NULL;
2261 cur->bc_private.b.allocated = 0;
2262 cur->bc_private.b.flags = 0;
2263 cur->bc_private.b.whichfork = whichfork;