2 * Copyright (c) 2000-2002,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_shared.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
25 #include "xfs_mount.h"
26 #include "xfs_defer.h"
27 #include "xfs_inode.h"
28 #include "xfs_trans.h"
29 #include "xfs_inode_item.h"
30 #include "xfs_buf_item.h"
31 #include "xfs_btree.h"
32 #include "xfs_error.h"
33 #include "xfs_trace.h"
34 #include "xfs_cksum.h"
35 #include "xfs_alloc.h"
39 * Cursor allocation zone.
41 kmem_zone_t *xfs_btree_cur_zone;
44 * Btree magic numbers.
46 static const __uint32_t xfs_magics[2][XFS_BTNUM_MAX] = {
47 { XFS_ABTB_MAGIC, XFS_ABTC_MAGIC, 0, XFS_BMAP_MAGIC, XFS_IBT_MAGIC,
49 { XFS_ABTB_CRC_MAGIC, XFS_ABTC_CRC_MAGIC, XFS_RMAP_CRC_MAGIC,
50 XFS_BMAP_CRC_MAGIC, XFS_IBT_CRC_MAGIC, XFS_FIBT_CRC_MAGIC }
52 #define xfs_btree_magic(cur) \
53 xfs_magics[!!((cur)->bc_flags & XFS_BTREE_CRC_BLOCKS)][cur->bc_btnum]
55 STATIC int /* error (0 or EFSCORRUPTED) */
56 xfs_btree_check_lblock(
57 struct xfs_btree_cur *cur, /* btree cursor */
58 struct xfs_btree_block *block, /* btree long form block pointer */
59 int level, /* level of the btree block */
60 struct xfs_buf *bp) /* buffer for block, if any */
62 int lblock_ok = 1; /* block passes checks */
63 struct xfs_mount *mp; /* file system mount point */
67 if (xfs_sb_version_hascrc(&mp->m_sb)) {
68 lblock_ok = lblock_ok &&
69 uuid_equal(&block->bb_u.l.bb_uuid,
70 &mp->m_sb.sb_meta_uuid) &&
71 block->bb_u.l.bb_blkno == cpu_to_be64(
72 bp ? bp->b_bn : XFS_BUF_DADDR_NULL);
75 lblock_ok = lblock_ok &&
76 be32_to_cpu(block->bb_magic) == xfs_btree_magic(cur) &&
77 be16_to_cpu(block->bb_level) == level &&
78 be16_to_cpu(block->bb_numrecs) <=
79 cur->bc_ops->get_maxrecs(cur, level) &&
80 block->bb_u.l.bb_leftsib &&
81 (block->bb_u.l.bb_leftsib == cpu_to_be64(NULLFSBLOCK) ||
82 XFS_FSB_SANITY_CHECK(mp,
83 be64_to_cpu(block->bb_u.l.bb_leftsib))) &&
84 block->bb_u.l.bb_rightsib &&
85 (block->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK) ||
86 XFS_FSB_SANITY_CHECK(mp,
87 be64_to_cpu(block->bb_u.l.bb_rightsib)));
89 if (unlikely(XFS_TEST_ERROR(!lblock_ok, mp,
90 XFS_ERRTAG_BTREE_CHECK_LBLOCK,
91 XFS_RANDOM_BTREE_CHECK_LBLOCK))) {
93 trace_xfs_btree_corrupt(bp, _RET_IP_);
94 XFS_ERROR_REPORT(__func__, XFS_ERRLEVEL_LOW, mp);
100 STATIC int /* error (0 or EFSCORRUPTED) */
101 xfs_btree_check_sblock(
102 struct xfs_btree_cur *cur, /* btree cursor */
103 struct xfs_btree_block *block, /* btree short form block pointer */
104 int level, /* level of the btree block */
105 struct xfs_buf *bp) /* buffer containing block */
107 struct xfs_mount *mp; /* file system mount point */
108 struct xfs_buf *agbp; /* buffer for ag. freespace struct */
109 struct xfs_agf *agf; /* ag. freespace structure */
110 xfs_agblock_t agflen; /* native ag. freespace length */
111 int sblock_ok = 1; /* block passes checks */
114 agbp = cur->bc_private.a.agbp;
115 agf = XFS_BUF_TO_AGF(agbp);
116 agflen = be32_to_cpu(agf->agf_length);
118 if (xfs_sb_version_hascrc(&mp->m_sb)) {
119 sblock_ok = sblock_ok &&
120 uuid_equal(&block->bb_u.s.bb_uuid,
121 &mp->m_sb.sb_meta_uuid) &&
122 block->bb_u.s.bb_blkno == cpu_to_be64(
123 bp ? bp->b_bn : XFS_BUF_DADDR_NULL);
126 sblock_ok = sblock_ok &&
127 be32_to_cpu(block->bb_magic) == xfs_btree_magic(cur) &&
128 be16_to_cpu(block->bb_level) == level &&
129 be16_to_cpu(block->bb_numrecs) <=
130 cur->bc_ops->get_maxrecs(cur, level) &&
131 (block->bb_u.s.bb_leftsib == cpu_to_be32(NULLAGBLOCK) ||
132 be32_to_cpu(block->bb_u.s.bb_leftsib) < agflen) &&
133 block->bb_u.s.bb_leftsib &&
134 (block->bb_u.s.bb_rightsib == cpu_to_be32(NULLAGBLOCK) ||
135 be32_to_cpu(block->bb_u.s.bb_rightsib) < agflen) &&
136 block->bb_u.s.bb_rightsib;
138 if (unlikely(XFS_TEST_ERROR(!sblock_ok, mp,
139 XFS_ERRTAG_BTREE_CHECK_SBLOCK,
140 XFS_RANDOM_BTREE_CHECK_SBLOCK))) {
142 trace_xfs_btree_corrupt(bp, _RET_IP_);
143 XFS_ERROR_REPORT(__func__, XFS_ERRLEVEL_LOW, mp);
144 return -EFSCORRUPTED;
150 * Debug routine: check that block header is ok.
153 xfs_btree_check_block(
154 struct xfs_btree_cur *cur, /* btree cursor */
155 struct xfs_btree_block *block, /* generic btree block pointer */
156 int level, /* level of the btree block */
157 struct xfs_buf *bp) /* buffer containing block, if any */
159 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
160 return xfs_btree_check_lblock(cur, block, level, bp);
162 return xfs_btree_check_sblock(cur, block, level, bp);
166 * Check that (long) pointer is ok.
168 int /* error (0 or EFSCORRUPTED) */
169 xfs_btree_check_lptr(
170 struct xfs_btree_cur *cur, /* btree cursor */
171 xfs_fsblock_t bno, /* btree block disk address */
172 int level) /* btree block level */
174 XFS_WANT_CORRUPTED_RETURN(cur->bc_mp,
176 bno != NULLFSBLOCK &&
177 XFS_FSB_SANITY_CHECK(cur->bc_mp, bno));
183 * Check that (short) pointer is ok.
185 STATIC int /* error (0 or EFSCORRUPTED) */
186 xfs_btree_check_sptr(
187 struct xfs_btree_cur *cur, /* btree cursor */
188 xfs_agblock_t bno, /* btree block disk address */
189 int level) /* btree block level */
191 xfs_agblock_t agblocks = cur->bc_mp->m_sb.sb_agblocks;
193 XFS_WANT_CORRUPTED_RETURN(cur->bc_mp,
195 bno != NULLAGBLOCK &&
202 * Check that block ptr is ok.
204 STATIC int /* error (0 or EFSCORRUPTED) */
206 struct xfs_btree_cur *cur, /* btree cursor */
207 union xfs_btree_ptr *ptr, /* btree block disk address */
208 int index, /* offset from ptr to check */
209 int level) /* btree block level */
211 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) {
212 return xfs_btree_check_lptr(cur,
213 be64_to_cpu((&ptr->l)[index]), level);
215 return xfs_btree_check_sptr(cur,
216 be32_to_cpu((&ptr->s)[index]), level);
222 * Calculate CRC on the whole btree block and stuff it into the
223 * long-form btree header.
225 * Prior to calculting the CRC, pull the LSN out of the buffer log item and put
226 * it into the buffer so recovery knows what the last modification was that made
230 xfs_btree_lblock_calc_crc(
233 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
234 struct xfs_buf_log_item *bip = bp->b_fspriv;
236 if (!xfs_sb_version_hascrc(&bp->b_target->bt_mount->m_sb))
239 block->bb_u.l.bb_lsn = cpu_to_be64(bip->bli_item.li_lsn);
240 xfs_buf_update_cksum(bp, XFS_BTREE_LBLOCK_CRC_OFF);
244 xfs_btree_lblock_verify_crc(
247 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
248 struct xfs_mount *mp = bp->b_target->bt_mount;
250 if (xfs_sb_version_hascrc(&mp->m_sb)) {
251 if (!xfs_log_check_lsn(mp, be64_to_cpu(block->bb_u.l.bb_lsn)))
253 return xfs_buf_verify_cksum(bp, XFS_BTREE_LBLOCK_CRC_OFF);
260 * Calculate CRC on the whole btree block and stuff it into the
261 * short-form btree header.
263 * Prior to calculting the CRC, pull the LSN out of the buffer log item and put
264 * it into the buffer so recovery knows what the last modification was that made
268 xfs_btree_sblock_calc_crc(
271 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
272 struct xfs_buf_log_item *bip = bp->b_fspriv;
274 if (!xfs_sb_version_hascrc(&bp->b_target->bt_mount->m_sb))
277 block->bb_u.s.bb_lsn = cpu_to_be64(bip->bli_item.li_lsn);
278 xfs_buf_update_cksum(bp, XFS_BTREE_SBLOCK_CRC_OFF);
282 xfs_btree_sblock_verify_crc(
285 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
286 struct xfs_mount *mp = bp->b_target->bt_mount;
288 if (xfs_sb_version_hascrc(&mp->m_sb)) {
289 if (!xfs_log_check_lsn(mp, be64_to_cpu(block->bb_u.s.bb_lsn)))
291 return xfs_buf_verify_cksum(bp, XFS_BTREE_SBLOCK_CRC_OFF);
298 xfs_btree_free_block(
299 struct xfs_btree_cur *cur,
304 error = cur->bc_ops->free_block(cur, bp);
306 xfs_trans_binval(cur->bc_tp, bp);
307 XFS_BTREE_STATS_INC(cur, free);
313 * Delete the btree cursor.
316 xfs_btree_del_cursor(
317 xfs_btree_cur_t *cur, /* btree cursor */
318 int error) /* del because of error */
320 int i; /* btree level */
323 * Clear the buffer pointers, and release the buffers.
324 * If we're doing this in the face of an error, we
325 * need to make sure to inspect all of the entries
326 * in the bc_bufs array for buffers to be unlocked.
327 * This is because some of the btree code works from
328 * level n down to 0, and if we get an error along
329 * the way we won't have initialized all the entries
332 for (i = 0; i < cur->bc_nlevels; i++) {
334 xfs_trans_brelse(cur->bc_tp, cur->bc_bufs[i]);
339 * Can't free a bmap cursor without having dealt with the
340 * allocated indirect blocks' accounting.
342 ASSERT(cur->bc_btnum != XFS_BTNUM_BMAP ||
343 cur->bc_private.b.allocated == 0);
347 kmem_zone_free(xfs_btree_cur_zone, cur);
351 * Duplicate the btree cursor.
352 * Allocate a new one, copy the record, re-get the buffers.
355 xfs_btree_dup_cursor(
356 xfs_btree_cur_t *cur, /* input cursor */
357 xfs_btree_cur_t **ncur) /* output cursor */
359 xfs_buf_t *bp; /* btree block's buffer pointer */
360 int error; /* error return value */
361 int i; /* level number of btree block */
362 xfs_mount_t *mp; /* mount structure for filesystem */
363 xfs_btree_cur_t *new; /* new cursor value */
364 xfs_trans_t *tp; /* transaction pointer, can be NULL */
370 * Allocate a new cursor like the old one.
372 new = cur->bc_ops->dup_cursor(cur);
375 * Copy the record currently in the cursor.
377 new->bc_rec = cur->bc_rec;
380 * For each level current, re-get the buffer and copy the ptr value.
382 for (i = 0; i < new->bc_nlevels; i++) {
383 new->bc_ptrs[i] = cur->bc_ptrs[i];
384 new->bc_ra[i] = cur->bc_ra[i];
385 bp = cur->bc_bufs[i];
387 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp,
388 XFS_BUF_ADDR(bp), mp->m_bsize,
390 cur->bc_ops->buf_ops);
392 xfs_btree_del_cursor(new, error);
397 new->bc_bufs[i] = bp;
404 * XFS btree block layout and addressing:
406 * There are two types of blocks in the btree: leaf and non-leaf blocks.
408 * The leaf record start with a header then followed by records containing
409 * the values. A non-leaf block also starts with the same header, and
410 * then first contains lookup keys followed by an equal number of pointers
411 * to the btree blocks at the previous level.
413 * +--------+-------+-------+-------+-------+-------+-------+
414 * Leaf: | header | rec 1 | rec 2 | rec 3 | rec 4 | rec 5 | rec N |
415 * +--------+-------+-------+-------+-------+-------+-------+
417 * +--------+-------+-------+-------+-------+-------+-------+
418 * Non-Leaf: | header | key 1 | key 2 | key N | ptr 1 | ptr 2 | ptr N |
419 * +--------+-------+-------+-------+-------+-------+-------+
421 * The header is called struct xfs_btree_block for reasons better left unknown
422 * and comes in different versions for short (32bit) and long (64bit) block
423 * pointers. The record and key structures are defined by the btree instances
424 * and opaque to the btree core. The block pointers are simple disk endian
425 * integers, available in a short (32bit) and long (64bit) variant.
427 * The helpers below calculate the offset of a given record, key or pointer
428 * into a btree block (xfs_btree_*_offset) or return a pointer to the given
429 * record, key or pointer (xfs_btree_*_addr). Note that all addressing
430 * inside the btree block is done using indices starting at one, not zero!
432 * If XFS_BTREE_OVERLAPPING is set, then this btree supports keys containing
433 * overlapping intervals. In such a tree, records are still sorted lowest to
434 * highest and indexed by the smallest key value that refers to the record.
435 * However, nodes are different: each pointer has two associated keys -- one
436 * indexing the lowest key available in the block(s) below (the same behavior
437 * as the key in a regular btree) and another indexing the highest key
438 * available in the block(s) below. Because records are /not/ sorted by the
439 * highest key, all leaf block updates require us to compute the highest key
440 * that matches any record in the leaf and to recursively update the high keys
441 * in the nodes going further up in the tree, if necessary. Nodes look like
444 * +--------+-----+-----+-----+-----+-----+-------+-------+-----+
445 * Non-Leaf: | header | lo1 | hi1 | lo2 | hi2 | ... | ptr 1 | ptr 2 | ... |
446 * +--------+-----+-----+-----+-----+-----+-------+-------+-----+
448 * To perform an interval query on an overlapped tree, perform the usual
449 * depth-first search and use the low and high keys to decide if we can skip
450 * that particular node. If a leaf node is reached, return the records that
451 * intersect the interval. Note that an interval query may return numerous
452 * entries. For a non-overlapped tree, simply search for the record associated
453 * with the lowest key and iterate forward until a non-matching record is
454 * found. Section 14.3 ("Interval Trees") of _Introduction to Algorithms_ by
455 * Cormen, Leiserson, Rivest, and Stein (2nd or 3rd ed. only) discuss this in
458 * Why do we care about overlapping intervals? Let's say you have a bunch of
459 * reverse mapping records on a reflink filesystem:
461 * 1: +- file A startblock B offset C length D -----------+
462 * 2: +- file E startblock F offset G length H --------------+
463 * 3: +- file I startblock F offset J length K --+
464 * 4: +- file L... --+
466 * Now say we want to map block (B+D) into file A at offset (C+D). Ideally,
467 * we'd simply increment the length of record 1. But how do we find the record
468 * that ends at (B+D-1) (i.e. record 1)? A LE lookup of (B+D-1) would return
469 * record 3 because the keys are ordered first by startblock. An interval
470 * query would return records 1 and 2 because they both overlap (B+D-1), and
471 * from that we can pick out record 1 as the appropriate left neighbor.
473 * In the non-overlapped case you can do a LE lookup and decrement the cursor
474 * because a record's interval must end before the next record.
478 * Return size of the btree block header for this btree instance.
480 static inline size_t xfs_btree_block_len(struct xfs_btree_cur *cur)
482 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) {
483 if (cur->bc_flags & XFS_BTREE_CRC_BLOCKS)
484 return XFS_BTREE_LBLOCK_CRC_LEN;
485 return XFS_BTREE_LBLOCK_LEN;
487 if (cur->bc_flags & XFS_BTREE_CRC_BLOCKS)
488 return XFS_BTREE_SBLOCK_CRC_LEN;
489 return XFS_BTREE_SBLOCK_LEN;
493 * Return size of btree block pointers for this btree instance.
495 static inline size_t xfs_btree_ptr_len(struct xfs_btree_cur *cur)
497 return (cur->bc_flags & XFS_BTREE_LONG_PTRS) ?
498 sizeof(__be64) : sizeof(__be32);
502 * Calculate offset of the n-th record in a btree block.
505 xfs_btree_rec_offset(
506 struct xfs_btree_cur *cur,
509 return xfs_btree_block_len(cur) +
510 (n - 1) * cur->bc_ops->rec_len;
514 * Calculate offset of the n-th key in a btree block.
517 xfs_btree_key_offset(
518 struct xfs_btree_cur *cur,
521 return xfs_btree_block_len(cur) +
522 (n - 1) * cur->bc_ops->key_len;
526 * Calculate offset of the n-th high key in a btree block.
529 xfs_btree_high_key_offset(
530 struct xfs_btree_cur *cur,
533 return xfs_btree_block_len(cur) +
534 (n - 1) * cur->bc_ops->key_len + (cur->bc_ops->key_len / 2);
538 * Calculate offset of the n-th block pointer in a btree block.
541 xfs_btree_ptr_offset(
542 struct xfs_btree_cur *cur,
546 return xfs_btree_block_len(cur) +
547 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len +
548 (n - 1) * xfs_btree_ptr_len(cur);
552 * Return a pointer to the n-th record in the btree block.
554 STATIC union xfs_btree_rec *
556 struct xfs_btree_cur *cur,
558 struct xfs_btree_block *block)
560 return (union xfs_btree_rec *)
561 ((char *)block + xfs_btree_rec_offset(cur, n));
565 * Return a pointer to the n-th key in the btree block.
567 STATIC union xfs_btree_key *
569 struct xfs_btree_cur *cur,
571 struct xfs_btree_block *block)
573 return (union xfs_btree_key *)
574 ((char *)block + xfs_btree_key_offset(cur, n));
578 * Return a pointer to the n-th high key in the btree block.
580 STATIC union xfs_btree_key *
581 xfs_btree_high_key_addr(
582 struct xfs_btree_cur *cur,
584 struct xfs_btree_block *block)
586 return (union xfs_btree_key *)
587 ((char *)block + xfs_btree_high_key_offset(cur, n));
591 * Return a pointer to the n-th block pointer in the btree block.
593 STATIC union xfs_btree_ptr *
595 struct xfs_btree_cur *cur,
597 struct xfs_btree_block *block)
599 int level = xfs_btree_get_level(block);
601 ASSERT(block->bb_level != 0);
603 return (union xfs_btree_ptr *)
604 ((char *)block + xfs_btree_ptr_offset(cur, n, level));
608 * Get the root block which is stored in the inode.
610 * For now this btree implementation assumes the btree root is always
611 * stored in the if_broot field of an inode fork.
613 STATIC struct xfs_btree_block *
615 struct xfs_btree_cur *cur)
617 struct xfs_ifork *ifp;
619 ifp = XFS_IFORK_PTR(cur->bc_private.b.ip, cur->bc_private.b.whichfork);
620 return (struct xfs_btree_block *)ifp->if_broot;
624 * Retrieve the block pointer from the cursor at the given level.
625 * This may be an inode btree root or from a buffer.
627 STATIC struct xfs_btree_block * /* generic btree block pointer */
629 struct xfs_btree_cur *cur, /* btree cursor */
630 int level, /* level in btree */
631 struct xfs_buf **bpp) /* buffer containing the block */
633 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
634 (level == cur->bc_nlevels - 1)) {
636 return xfs_btree_get_iroot(cur);
639 *bpp = cur->bc_bufs[level];
640 return XFS_BUF_TO_BLOCK(*bpp);
644 * Get a buffer for the block, return it with no data read.
645 * Long-form addressing.
647 xfs_buf_t * /* buffer for fsbno */
649 xfs_mount_t *mp, /* file system mount point */
650 xfs_trans_t *tp, /* transaction pointer */
651 xfs_fsblock_t fsbno, /* file system block number */
652 uint lock) /* lock flags for get_buf */
654 xfs_daddr_t d; /* real disk block address */
656 ASSERT(fsbno != NULLFSBLOCK);
657 d = XFS_FSB_TO_DADDR(mp, fsbno);
658 return xfs_trans_get_buf(tp, mp->m_ddev_targp, d, mp->m_bsize, lock);
662 * Get a buffer for the block, return it with no data read.
663 * Short-form addressing.
665 xfs_buf_t * /* buffer for agno/agbno */
667 xfs_mount_t *mp, /* file system mount point */
668 xfs_trans_t *tp, /* transaction pointer */
669 xfs_agnumber_t agno, /* allocation group number */
670 xfs_agblock_t agbno, /* allocation group block number */
671 uint lock) /* lock flags for get_buf */
673 xfs_daddr_t d; /* real disk block address */
675 ASSERT(agno != NULLAGNUMBER);
676 ASSERT(agbno != NULLAGBLOCK);
677 d = XFS_AGB_TO_DADDR(mp, agno, agbno);
678 return xfs_trans_get_buf(tp, mp->m_ddev_targp, d, mp->m_bsize, lock);
682 * Check for the cursor referring to the last block at the given level.
684 int /* 1=is last block, 0=not last block */
685 xfs_btree_islastblock(
686 xfs_btree_cur_t *cur, /* btree cursor */
687 int level) /* level to check */
689 struct xfs_btree_block *block; /* generic btree block pointer */
690 xfs_buf_t *bp; /* buffer containing block */
692 block = xfs_btree_get_block(cur, level, &bp);
693 xfs_btree_check_block(cur, block, level, bp);
694 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
695 return block->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK);
697 return block->bb_u.s.bb_rightsib == cpu_to_be32(NULLAGBLOCK);
701 * Change the cursor to point to the first record at the given level.
702 * Other levels are unaffected.
704 STATIC int /* success=1, failure=0 */
706 xfs_btree_cur_t *cur, /* btree cursor */
707 int level) /* level to change */
709 struct xfs_btree_block *block; /* generic btree block pointer */
710 xfs_buf_t *bp; /* buffer containing block */
713 * Get the block pointer for this level.
715 block = xfs_btree_get_block(cur, level, &bp);
716 xfs_btree_check_block(cur, block, level, bp);
718 * It's empty, there is no such record.
720 if (!block->bb_numrecs)
723 * Set the ptr value to 1, that's the first record/key.
725 cur->bc_ptrs[level] = 1;
730 * Change the cursor to point to the last record in the current block
731 * at the given level. Other levels are unaffected.
733 STATIC int /* success=1, failure=0 */
735 xfs_btree_cur_t *cur, /* btree cursor */
736 int level) /* level to change */
738 struct xfs_btree_block *block; /* generic btree block pointer */
739 xfs_buf_t *bp; /* buffer containing block */
742 * Get the block pointer for this level.
744 block = xfs_btree_get_block(cur, level, &bp);
745 xfs_btree_check_block(cur, block, level, bp);
747 * It's empty, there is no such record.
749 if (!block->bb_numrecs)
752 * Set the ptr value to numrecs, that's the last record/key.
754 cur->bc_ptrs[level] = be16_to_cpu(block->bb_numrecs);
759 * Compute first and last byte offsets for the fields given.
760 * Interprets the offsets table, which contains struct field offsets.
764 __int64_t fields, /* bitmask of fields */
765 const short *offsets, /* table of field offsets */
766 int nbits, /* number of bits to inspect */
767 int *first, /* output: first byte offset */
768 int *last) /* output: last byte offset */
770 int i; /* current bit number */
771 __int64_t imask; /* mask for current bit number */
775 * Find the lowest bit, so the first byte offset.
777 for (i = 0, imask = 1LL; ; i++, imask <<= 1) {
778 if (imask & fields) {
784 * Find the highest bit, so the last byte offset.
786 for (i = nbits - 1, imask = 1LL << i; ; i--, imask >>= 1) {
787 if (imask & fields) {
788 *last = offsets[i + 1] - 1;
795 * Get a buffer for the block, return it read in.
796 * Long-form addressing.
800 struct xfs_mount *mp, /* file system mount point */
801 struct xfs_trans *tp, /* transaction pointer */
802 xfs_fsblock_t fsbno, /* file system block number */
803 uint lock, /* lock flags for read_buf */
804 struct xfs_buf **bpp, /* buffer for fsbno */
805 int refval, /* ref count value for buffer */
806 const struct xfs_buf_ops *ops)
808 struct xfs_buf *bp; /* return value */
809 xfs_daddr_t d; /* real disk block address */
812 ASSERT(fsbno != NULLFSBLOCK);
813 d = XFS_FSB_TO_DADDR(mp, fsbno);
814 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, d,
815 mp->m_bsize, lock, &bp, ops);
819 xfs_buf_set_ref(bp, refval);
825 * Read-ahead the block, don't wait for it, don't return a buffer.
826 * Long-form addressing.
830 xfs_btree_reada_bufl(
831 struct xfs_mount *mp, /* file system mount point */
832 xfs_fsblock_t fsbno, /* file system block number */
833 xfs_extlen_t count, /* count of filesystem blocks */
834 const struct xfs_buf_ops *ops)
838 ASSERT(fsbno != NULLFSBLOCK);
839 d = XFS_FSB_TO_DADDR(mp, fsbno);
840 xfs_buf_readahead(mp->m_ddev_targp, d, mp->m_bsize * count, ops);
844 * Read-ahead the block, don't wait for it, don't return a buffer.
845 * Short-form addressing.
849 xfs_btree_reada_bufs(
850 struct xfs_mount *mp, /* file system mount point */
851 xfs_agnumber_t agno, /* allocation group number */
852 xfs_agblock_t agbno, /* allocation group block number */
853 xfs_extlen_t count, /* count of filesystem blocks */
854 const struct xfs_buf_ops *ops)
858 ASSERT(agno != NULLAGNUMBER);
859 ASSERT(agbno != NULLAGBLOCK);
860 d = XFS_AGB_TO_DADDR(mp, agno, agbno);
861 xfs_buf_readahead(mp->m_ddev_targp, d, mp->m_bsize * count, ops);
865 xfs_btree_readahead_lblock(
866 struct xfs_btree_cur *cur,
868 struct xfs_btree_block *block)
871 xfs_fsblock_t left = be64_to_cpu(block->bb_u.l.bb_leftsib);
872 xfs_fsblock_t right = be64_to_cpu(block->bb_u.l.bb_rightsib);
874 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLFSBLOCK) {
875 xfs_btree_reada_bufl(cur->bc_mp, left, 1,
876 cur->bc_ops->buf_ops);
880 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLFSBLOCK) {
881 xfs_btree_reada_bufl(cur->bc_mp, right, 1,
882 cur->bc_ops->buf_ops);
890 xfs_btree_readahead_sblock(
891 struct xfs_btree_cur *cur,
893 struct xfs_btree_block *block)
896 xfs_agblock_t left = be32_to_cpu(block->bb_u.s.bb_leftsib);
897 xfs_agblock_t right = be32_to_cpu(block->bb_u.s.bb_rightsib);
900 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLAGBLOCK) {
901 xfs_btree_reada_bufs(cur->bc_mp, cur->bc_private.a.agno,
902 left, 1, cur->bc_ops->buf_ops);
906 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLAGBLOCK) {
907 xfs_btree_reada_bufs(cur->bc_mp, cur->bc_private.a.agno,
908 right, 1, cur->bc_ops->buf_ops);
916 * Read-ahead btree blocks, at the given level.
917 * Bits in lr are set from XFS_BTCUR_{LEFT,RIGHT}RA.
921 struct xfs_btree_cur *cur, /* btree cursor */
922 int lev, /* level in btree */
923 int lr) /* left/right bits */
925 struct xfs_btree_block *block;
928 * No readahead needed if we are at the root level and the
929 * btree root is stored in the inode.
931 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
932 (lev == cur->bc_nlevels - 1))
935 if ((cur->bc_ra[lev] | lr) == cur->bc_ra[lev])
938 cur->bc_ra[lev] |= lr;
939 block = XFS_BUF_TO_BLOCK(cur->bc_bufs[lev]);
941 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
942 return xfs_btree_readahead_lblock(cur, lr, block);
943 return xfs_btree_readahead_sblock(cur, lr, block);
947 xfs_btree_ptr_to_daddr(
948 struct xfs_btree_cur *cur,
949 union xfs_btree_ptr *ptr)
951 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) {
952 ASSERT(ptr->l != cpu_to_be64(NULLFSBLOCK));
954 return XFS_FSB_TO_DADDR(cur->bc_mp, be64_to_cpu(ptr->l));
956 ASSERT(cur->bc_private.a.agno != NULLAGNUMBER);
957 ASSERT(ptr->s != cpu_to_be32(NULLAGBLOCK));
959 return XFS_AGB_TO_DADDR(cur->bc_mp, cur->bc_private.a.agno,
960 be32_to_cpu(ptr->s));
965 * Readahead @count btree blocks at the given @ptr location.
967 * We don't need to care about long or short form btrees here as we have a
968 * method of converting the ptr directly to a daddr available to us.
971 xfs_btree_readahead_ptr(
972 struct xfs_btree_cur *cur,
973 union xfs_btree_ptr *ptr,
976 xfs_buf_readahead(cur->bc_mp->m_ddev_targp,
977 xfs_btree_ptr_to_daddr(cur, ptr),
978 cur->bc_mp->m_bsize * count, cur->bc_ops->buf_ops);
982 * Set the buffer for level "lev" in the cursor to bp, releasing
983 * any previous buffer.
987 xfs_btree_cur_t *cur, /* btree cursor */
988 int lev, /* level in btree */
989 xfs_buf_t *bp) /* new buffer to set */
991 struct xfs_btree_block *b; /* btree block */
993 if (cur->bc_bufs[lev])
994 xfs_trans_brelse(cur->bc_tp, cur->bc_bufs[lev]);
995 cur->bc_bufs[lev] = bp;
998 b = XFS_BUF_TO_BLOCK(bp);
999 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) {
1000 if (b->bb_u.l.bb_leftsib == cpu_to_be64(NULLFSBLOCK))
1001 cur->bc_ra[lev] |= XFS_BTCUR_LEFTRA;
1002 if (b->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK))
1003 cur->bc_ra[lev] |= XFS_BTCUR_RIGHTRA;
1005 if (b->bb_u.s.bb_leftsib == cpu_to_be32(NULLAGBLOCK))
1006 cur->bc_ra[lev] |= XFS_BTCUR_LEFTRA;
1007 if (b->bb_u.s.bb_rightsib == cpu_to_be32(NULLAGBLOCK))
1008 cur->bc_ra[lev] |= XFS_BTCUR_RIGHTRA;
1013 xfs_btree_ptr_is_null(
1014 struct xfs_btree_cur *cur,
1015 union xfs_btree_ptr *ptr)
1017 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
1018 return ptr->l == cpu_to_be64(NULLFSBLOCK);
1020 return ptr->s == cpu_to_be32(NULLAGBLOCK);
1024 xfs_btree_set_ptr_null(
1025 struct xfs_btree_cur *cur,
1026 union xfs_btree_ptr *ptr)
1028 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
1029 ptr->l = cpu_to_be64(NULLFSBLOCK);
1031 ptr->s = cpu_to_be32(NULLAGBLOCK);
1035 * Get/set/init sibling pointers
1038 xfs_btree_get_sibling(
1039 struct xfs_btree_cur *cur,
1040 struct xfs_btree_block *block,
1041 union xfs_btree_ptr *ptr,
1044 ASSERT(lr == XFS_BB_LEFTSIB || lr == XFS_BB_RIGHTSIB);
1046 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) {
1047 if (lr == XFS_BB_RIGHTSIB)
1048 ptr->l = block->bb_u.l.bb_rightsib;
1050 ptr->l = block->bb_u.l.bb_leftsib;
1052 if (lr == XFS_BB_RIGHTSIB)
1053 ptr->s = block->bb_u.s.bb_rightsib;
1055 ptr->s = block->bb_u.s.bb_leftsib;
1060 xfs_btree_set_sibling(
1061 struct xfs_btree_cur *cur,
1062 struct xfs_btree_block *block,
1063 union xfs_btree_ptr *ptr,
1066 ASSERT(lr == XFS_BB_LEFTSIB || lr == XFS_BB_RIGHTSIB);
1068 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) {
1069 if (lr == XFS_BB_RIGHTSIB)
1070 block->bb_u.l.bb_rightsib = ptr->l;
1072 block->bb_u.l.bb_leftsib = ptr->l;
1074 if (lr == XFS_BB_RIGHTSIB)
1075 block->bb_u.s.bb_rightsib = ptr->s;
1077 block->bb_u.s.bb_leftsib = ptr->s;
1082 xfs_btree_init_block_int(
1083 struct xfs_mount *mp,
1084 struct xfs_btree_block *buf,
1092 buf->bb_magic = cpu_to_be32(magic);
1093 buf->bb_level = cpu_to_be16(level);
1094 buf->bb_numrecs = cpu_to_be16(numrecs);
1096 if (flags & XFS_BTREE_LONG_PTRS) {
1097 buf->bb_u.l.bb_leftsib = cpu_to_be64(NULLFSBLOCK);
1098 buf->bb_u.l.bb_rightsib = cpu_to_be64(NULLFSBLOCK);
1099 if (flags & XFS_BTREE_CRC_BLOCKS) {
1100 buf->bb_u.l.bb_blkno = cpu_to_be64(blkno);
1101 buf->bb_u.l.bb_owner = cpu_to_be64(owner);
1102 uuid_copy(&buf->bb_u.l.bb_uuid, &mp->m_sb.sb_meta_uuid);
1103 buf->bb_u.l.bb_pad = 0;
1104 buf->bb_u.l.bb_lsn = 0;
1107 /* owner is a 32 bit value on short blocks */
1108 __u32 __owner = (__u32)owner;
1110 buf->bb_u.s.bb_leftsib = cpu_to_be32(NULLAGBLOCK);
1111 buf->bb_u.s.bb_rightsib = cpu_to_be32(NULLAGBLOCK);
1112 if (flags & XFS_BTREE_CRC_BLOCKS) {
1113 buf->bb_u.s.bb_blkno = cpu_to_be64(blkno);
1114 buf->bb_u.s.bb_owner = cpu_to_be32(__owner);
1115 uuid_copy(&buf->bb_u.s.bb_uuid, &mp->m_sb.sb_meta_uuid);
1116 buf->bb_u.s.bb_lsn = 0;
1122 xfs_btree_init_block(
1123 struct xfs_mount *mp,
1131 xfs_btree_init_block_int(mp, XFS_BUF_TO_BLOCK(bp), bp->b_bn,
1132 magic, level, numrecs, owner, flags);
1136 xfs_btree_init_block_cur(
1137 struct xfs_btree_cur *cur,
1145 * we can pull the owner from the cursor right now as the different
1146 * owners align directly with the pointer size of the btree. This may
1147 * change in future, but is safe for current users of the generic btree
1150 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
1151 owner = cur->bc_private.b.ip->i_ino;
1153 owner = cur->bc_private.a.agno;
1155 xfs_btree_init_block_int(cur->bc_mp, XFS_BUF_TO_BLOCK(bp), bp->b_bn,
1156 xfs_btree_magic(cur), level, numrecs,
1157 owner, cur->bc_flags);
1161 * Return true if ptr is the last record in the btree and
1162 * we need to track updates to this record. The decision
1163 * will be further refined in the update_lastrec method.
1166 xfs_btree_is_lastrec(
1167 struct xfs_btree_cur *cur,
1168 struct xfs_btree_block *block,
1171 union xfs_btree_ptr ptr;
1175 if (!(cur->bc_flags & XFS_BTREE_LASTREC_UPDATE))
1178 xfs_btree_get_sibling(cur, block, &ptr, XFS_BB_RIGHTSIB);
1179 if (!xfs_btree_ptr_is_null(cur, &ptr))
1185 xfs_btree_buf_to_ptr(
1186 struct xfs_btree_cur *cur,
1188 union xfs_btree_ptr *ptr)
1190 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
1191 ptr->l = cpu_to_be64(XFS_DADDR_TO_FSB(cur->bc_mp,
1194 ptr->s = cpu_to_be32(xfs_daddr_to_agbno(cur->bc_mp,
1201 struct xfs_btree_cur *cur,
1204 switch (cur->bc_btnum) {
1207 xfs_buf_set_ref(bp, XFS_ALLOC_BTREE_REF);
1210 case XFS_BTNUM_FINO:
1211 xfs_buf_set_ref(bp, XFS_INO_BTREE_REF);
1213 case XFS_BTNUM_BMAP:
1214 xfs_buf_set_ref(bp, XFS_BMAP_BTREE_REF);
1216 case XFS_BTNUM_RMAP:
1217 xfs_buf_set_ref(bp, XFS_RMAP_BTREE_REF);
1225 xfs_btree_get_buf_block(
1226 struct xfs_btree_cur *cur,
1227 union xfs_btree_ptr *ptr,
1229 struct xfs_btree_block **block,
1230 struct xfs_buf **bpp)
1232 struct xfs_mount *mp = cur->bc_mp;
1235 /* need to sort out how callers deal with failures first */
1236 ASSERT(!(flags & XBF_TRYLOCK));
1238 d = xfs_btree_ptr_to_daddr(cur, ptr);
1239 *bpp = xfs_trans_get_buf(cur->bc_tp, mp->m_ddev_targp, d,
1240 mp->m_bsize, flags);
1245 (*bpp)->b_ops = cur->bc_ops->buf_ops;
1246 *block = XFS_BUF_TO_BLOCK(*bpp);
1251 * Read in the buffer at the given ptr and return the buffer and
1252 * the block pointer within the buffer.
1255 xfs_btree_read_buf_block(
1256 struct xfs_btree_cur *cur,
1257 union xfs_btree_ptr *ptr,
1259 struct xfs_btree_block **block,
1260 struct xfs_buf **bpp)
1262 struct xfs_mount *mp = cur->bc_mp;
1266 /* need to sort out how callers deal with failures first */
1267 ASSERT(!(flags & XBF_TRYLOCK));
1269 d = xfs_btree_ptr_to_daddr(cur, ptr);
1270 error = xfs_trans_read_buf(mp, cur->bc_tp, mp->m_ddev_targp, d,
1271 mp->m_bsize, flags, bpp,
1272 cur->bc_ops->buf_ops);
1276 xfs_btree_set_refs(cur, *bpp);
1277 *block = XFS_BUF_TO_BLOCK(*bpp);
1282 * Copy keys from one btree block to another.
1285 xfs_btree_copy_keys(
1286 struct xfs_btree_cur *cur,
1287 union xfs_btree_key *dst_key,
1288 union xfs_btree_key *src_key,
1291 ASSERT(numkeys >= 0);
1292 memcpy(dst_key, src_key, numkeys * cur->bc_ops->key_len);
1296 * Copy records from one btree block to another.
1299 xfs_btree_copy_recs(
1300 struct xfs_btree_cur *cur,
1301 union xfs_btree_rec *dst_rec,
1302 union xfs_btree_rec *src_rec,
1305 ASSERT(numrecs >= 0);
1306 memcpy(dst_rec, src_rec, numrecs * cur->bc_ops->rec_len);
1310 * Copy block pointers from one btree block to another.
1313 xfs_btree_copy_ptrs(
1314 struct xfs_btree_cur *cur,
1315 union xfs_btree_ptr *dst_ptr,
1316 union xfs_btree_ptr *src_ptr,
1319 ASSERT(numptrs >= 0);
1320 memcpy(dst_ptr, src_ptr, numptrs * xfs_btree_ptr_len(cur));
1324 * Shift keys one index left/right inside a single btree block.
1327 xfs_btree_shift_keys(
1328 struct xfs_btree_cur *cur,
1329 union xfs_btree_key *key,
1335 ASSERT(numkeys >= 0);
1336 ASSERT(dir == 1 || dir == -1);
1338 dst_key = (char *)key + (dir * cur->bc_ops->key_len);
1339 memmove(dst_key, key, numkeys * cur->bc_ops->key_len);
1343 * Shift records one index left/right inside a single btree block.
1346 xfs_btree_shift_recs(
1347 struct xfs_btree_cur *cur,
1348 union xfs_btree_rec *rec,
1354 ASSERT(numrecs >= 0);
1355 ASSERT(dir == 1 || dir == -1);
1357 dst_rec = (char *)rec + (dir * cur->bc_ops->rec_len);
1358 memmove(dst_rec, rec, numrecs * cur->bc_ops->rec_len);
1362 * Shift block pointers one index left/right inside a single btree block.
1365 xfs_btree_shift_ptrs(
1366 struct xfs_btree_cur *cur,
1367 union xfs_btree_ptr *ptr,
1373 ASSERT(numptrs >= 0);
1374 ASSERT(dir == 1 || dir == -1);
1376 dst_ptr = (char *)ptr + (dir * xfs_btree_ptr_len(cur));
1377 memmove(dst_ptr, ptr, numptrs * xfs_btree_ptr_len(cur));
1381 * Log key values from the btree block.
1385 struct xfs_btree_cur *cur,
1390 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
1391 XFS_BTREE_TRACE_ARGBII(cur, bp, first, last);
1394 xfs_trans_buf_set_type(cur->bc_tp, bp, XFS_BLFT_BTREE_BUF);
1395 xfs_trans_log_buf(cur->bc_tp, bp,
1396 xfs_btree_key_offset(cur, first),
1397 xfs_btree_key_offset(cur, last + 1) - 1);
1399 xfs_trans_log_inode(cur->bc_tp, cur->bc_private.b.ip,
1400 xfs_ilog_fbroot(cur->bc_private.b.whichfork));
1403 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1407 * Log record values from the btree block.
1411 struct xfs_btree_cur *cur,
1416 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
1417 XFS_BTREE_TRACE_ARGBII(cur, bp, first, last);
1419 xfs_trans_buf_set_type(cur->bc_tp, bp, XFS_BLFT_BTREE_BUF);
1420 xfs_trans_log_buf(cur->bc_tp, bp,
1421 xfs_btree_rec_offset(cur, first),
1422 xfs_btree_rec_offset(cur, last + 1) - 1);
1424 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1428 * Log block pointer fields from a btree block (nonleaf).
1432 struct xfs_btree_cur *cur, /* btree cursor */
1433 struct xfs_buf *bp, /* buffer containing btree block */
1434 int first, /* index of first pointer to log */
1435 int last) /* index of last pointer to log */
1437 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
1438 XFS_BTREE_TRACE_ARGBII(cur, bp, first, last);
1441 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
1442 int level = xfs_btree_get_level(block);
1444 xfs_trans_buf_set_type(cur->bc_tp, bp, XFS_BLFT_BTREE_BUF);
1445 xfs_trans_log_buf(cur->bc_tp, bp,
1446 xfs_btree_ptr_offset(cur, first, level),
1447 xfs_btree_ptr_offset(cur, last + 1, level) - 1);
1449 xfs_trans_log_inode(cur->bc_tp, cur->bc_private.b.ip,
1450 xfs_ilog_fbroot(cur->bc_private.b.whichfork));
1453 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1457 * Log fields from a btree block header.
1460 xfs_btree_log_block(
1461 struct xfs_btree_cur *cur, /* btree cursor */
1462 struct xfs_buf *bp, /* buffer containing btree block */
1463 int fields) /* mask of fields: XFS_BB_... */
1465 int first; /* first byte offset logged */
1466 int last; /* last byte offset logged */
1467 static const short soffsets[] = { /* table of offsets (short) */
1468 offsetof(struct xfs_btree_block, bb_magic),
1469 offsetof(struct xfs_btree_block, bb_level),
1470 offsetof(struct xfs_btree_block, bb_numrecs),
1471 offsetof(struct xfs_btree_block, bb_u.s.bb_leftsib),
1472 offsetof(struct xfs_btree_block, bb_u.s.bb_rightsib),
1473 offsetof(struct xfs_btree_block, bb_u.s.bb_blkno),
1474 offsetof(struct xfs_btree_block, bb_u.s.bb_lsn),
1475 offsetof(struct xfs_btree_block, bb_u.s.bb_uuid),
1476 offsetof(struct xfs_btree_block, bb_u.s.bb_owner),
1477 offsetof(struct xfs_btree_block, bb_u.s.bb_crc),
1478 XFS_BTREE_SBLOCK_CRC_LEN
1480 static const short loffsets[] = { /* table of offsets (long) */
1481 offsetof(struct xfs_btree_block, bb_magic),
1482 offsetof(struct xfs_btree_block, bb_level),
1483 offsetof(struct xfs_btree_block, bb_numrecs),
1484 offsetof(struct xfs_btree_block, bb_u.l.bb_leftsib),
1485 offsetof(struct xfs_btree_block, bb_u.l.bb_rightsib),
1486 offsetof(struct xfs_btree_block, bb_u.l.bb_blkno),
1487 offsetof(struct xfs_btree_block, bb_u.l.bb_lsn),
1488 offsetof(struct xfs_btree_block, bb_u.l.bb_uuid),
1489 offsetof(struct xfs_btree_block, bb_u.l.bb_owner),
1490 offsetof(struct xfs_btree_block, bb_u.l.bb_crc),
1491 offsetof(struct xfs_btree_block, bb_u.l.bb_pad),
1492 XFS_BTREE_LBLOCK_CRC_LEN
1495 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
1496 XFS_BTREE_TRACE_ARGBI(cur, bp, fields);
1501 if (cur->bc_flags & XFS_BTREE_CRC_BLOCKS) {
1503 * We don't log the CRC when updating a btree
1504 * block but instead recreate it during log
1505 * recovery. As the log buffers have checksums
1506 * of their own this is safe and avoids logging a crc
1507 * update in a lot of places.
1509 if (fields == XFS_BB_ALL_BITS)
1510 fields = XFS_BB_ALL_BITS_CRC;
1511 nbits = XFS_BB_NUM_BITS_CRC;
1513 nbits = XFS_BB_NUM_BITS;
1515 xfs_btree_offsets(fields,
1516 (cur->bc_flags & XFS_BTREE_LONG_PTRS) ?
1517 loffsets : soffsets,
1518 nbits, &first, &last);
1519 xfs_trans_buf_set_type(cur->bc_tp, bp, XFS_BLFT_BTREE_BUF);
1520 xfs_trans_log_buf(cur->bc_tp, bp, first, last);
1522 xfs_trans_log_inode(cur->bc_tp, cur->bc_private.b.ip,
1523 xfs_ilog_fbroot(cur->bc_private.b.whichfork));
1526 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1530 * Increment cursor by one record at the level.
1531 * For nonzero levels the leaf-ward information is untouched.
1534 xfs_btree_increment(
1535 struct xfs_btree_cur *cur,
1537 int *stat) /* success/failure */
1539 struct xfs_btree_block *block;
1540 union xfs_btree_ptr ptr;
1542 int error; /* error return value */
1545 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
1546 XFS_BTREE_TRACE_ARGI(cur, level);
1548 ASSERT(level < cur->bc_nlevels);
1550 /* Read-ahead to the right at this level. */
1551 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA);
1553 /* Get a pointer to the btree block. */
1554 block = xfs_btree_get_block(cur, level, &bp);
1557 error = xfs_btree_check_block(cur, block, level, bp);
1562 /* We're done if we remain in the block after the increment. */
1563 if (++cur->bc_ptrs[level] <= xfs_btree_get_numrecs(block))
1566 /* Fail if we just went off the right edge of the tree. */
1567 xfs_btree_get_sibling(cur, block, &ptr, XFS_BB_RIGHTSIB);
1568 if (xfs_btree_ptr_is_null(cur, &ptr))
1571 XFS_BTREE_STATS_INC(cur, increment);
1574 * March up the tree incrementing pointers.
1575 * Stop when we don't go off the right edge of a block.
1577 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1578 block = xfs_btree_get_block(cur, lev, &bp);
1581 error = xfs_btree_check_block(cur, block, lev, bp);
1586 if (++cur->bc_ptrs[lev] <= xfs_btree_get_numrecs(block))
1589 /* Read-ahead the right block for the next loop. */
1590 xfs_btree_readahead(cur, lev, XFS_BTCUR_RIGHTRA);
1594 * If we went off the root then we are either seriously
1595 * confused or have the tree root in an inode.
1597 if (lev == cur->bc_nlevels) {
1598 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)
1601 error = -EFSCORRUPTED;
1604 ASSERT(lev < cur->bc_nlevels);
1607 * Now walk back down the tree, fixing up the cursor's buffer
1608 * pointers and key numbers.
1610 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) {
1611 union xfs_btree_ptr *ptrp;
1613 ptrp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[lev], block);
1615 error = xfs_btree_read_buf_block(cur, ptrp, 0, &block, &bp);
1619 xfs_btree_setbuf(cur, lev, bp);
1620 cur->bc_ptrs[lev] = 1;
1623 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1628 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1633 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
1638 * Decrement cursor by one record at the level.
1639 * For nonzero levels the leaf-ward information is untouched.
1642 xfs_btree_decrement(
1643 struct xfs_btree_cur *cur,
1645 int *stat) /* success/failure */
1647 struct xfs_btree_block *block;
1649 int error; /* error return value */
1651 union xfs_btree_ptr ptr;
1653 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
1654 XFS_BTREE_TRACE_ARGI(cur, level);
1656 ASSERT(level < cur->bc_nlevels);
1658 /* Read-ahead to the left at this level. */
1659 xfs_btree_readahead(cur, level, XFS_BTCUR_LEFTRA);
1661 /* We're done if we remain in the block after the decrement. */
1662 if (--cur->bc_ptrs[level] > 0)
1665 /* Get a pointer to the btree block. */
1666 block = xfs_btree_get_block(cur, level, &bp);
1669 error = xfs_btree_check_block(cur, block, level, bp);
1674 /* Fail if we just went off the left edge of the tree. */
1675 xfs_btree_get_sibling(cur, block, &ptr, XFS_BB_LEFTSIB);
1676 if (xfs_btree_ptr_is_null(cur, &ptr))
1679 XFS_BTREE_STATS_INC(cur, decrement);
1682 * March up the tree decrementing pointers.
1683 * Stop when we don't go off the left edge of a block.
1685 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1686 if (--cur->bc_ptrs[lev] > 0)
1688 /* Read-ahead the left block for the next loop. */
1689 xfs_btree_readahead(cur, lev, XFS_BTCUR_LEFTRA);
1693 * If we went off the root then we are seriously confused.
1694 * or the root of the tree is in an inode.
1696 if (lev == cur->bc_nlevels) {
1697 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)
1700 error = -EFSCORRUPTED;
1703 ASSERT(lev < cur->bc_nlevels);
1706 * Now walk back down the tree, fixing up the cursor's buffer
1707 * pointers and key numbers.
1709 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) {
1710 union xfs_btree_ptr *ptrp;
1712 ptrp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[lev], block);
1714 error = xfs_btree_read_buf_block(cur, ptrp, 0, &block, &bp);
1717 xfs_btree_setbuf(cur, lev, bp);
1718 cur->bc_ptrs[lev] = xfs_btree_get_numrecs(block);
1721 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1726 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1731 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
1736 xfs_btree_lookup_get_block(
1737 struct xfs_btree_cur *cur, /* btree cursor */
1738 int level, /* level in the btree */
1739 union xfs_btree_ptr *pp, /* ptr to btree block */
1740 struct xfs_btree_block **blkp) /* return btree block */
1742 struct xfs_buf *bp; /* buffer pointer for btree block */
1745 /* special case the root block if in an inode */
1746 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
1747 (level == cur->bc_nlevels - 1)) {
1748 *blkp = xfs_btree_get_iroot(cur);
1753 * If the old buffer at this level for the disk address we are
1754 * looking for re-use it.
1756 * Otherwise throw it away and get a new one.
1758 bp = cur->bc_bufs[level];
1759 if (bp && XFS_BUF_ADDR(bp) == xfs_btree_ptr_to_daddr(cur, pp)) {
1760 *blkp = XFS_BUF_TO_BLOCK(bp);
1764 error = xfs_btree_read_buf_block(cur, pp, 0, blkp, &bp);
1768 xfs_btree_setbuf(cur, level, bp);
1773 * Get current search key. For level 0 we don't actually have a key
1774 * structure so we make one up from the record. For all other levels
1775 * we just return the right key.
1777 STATIC union xfs_btree_key *
1778 xfs_lookup_get_search_key(
1779 struct xfs_btree_cur *cur,
1782 struct xfs_btree_block *block,
1783 union xfs_btree_key *kp)
1786 cur->bc_ops->init_key_from_rec(kp,
1787 xfs_btree_rec_addr(cur, keyno, block));
1791 return xfs_btree_key_addr(cur, keyno, block);
1795 * Lookup the record. The cursor is made to point to it, based on dir.
1796 * stat is set to 0 if can't find any such record, 1 for success.
1800 struct xfs_btree_cur *cur, /* btree cursor */
1801 xfs_lookup_t dir, /* <=, ==, or >= */
1802 int *stat) /* success/failure */
1804 struct xfs_btree_block *block; /* current btree block */
1805 __int64_t diff; /* difference for the current key */
1806 int error; /* error return value */
1807 int keyno; /* current key number */
1808 int level; /* level in the btree */
1809 union xfs_btree_ptr *pp; /* ptr to btree block */
1810 union xfs_btree_ptr ptr; /* ptr to btree block */
1812 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
1813 XFS_BTREE_TRACE_ARGI(cur, dir);
1815 XFS_BTREE_STATS_INC(cur, lookup);
1820 /* initialise start pointer from cursor */
1821 cur->bc_ops->init_ptr_from_cur(cur, &ptr);
1825 * Iterate over each level in the btree, starting at the root.
1826 * For each level above the leaves, find the key we need, based
1827 * on the lookup record, then follow the corresponding block
1828 * pointer down to the next level.
1830 for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {
1831 /* Get the block we need to do the lookup on. */
1832 error = xfs_btree_lookup_get_block(cur, level, pp, &block);
1838 * If we already had a key match at a higher level, we
1839 * know we need to use the first entry in this block.
1843 /* Otherwise search this block. Do a binary search. */
1845 int high; /* high entry number */
1846 int low; /* low entry number */
1848 /* Set low and high entry numbers, 1-based. */
1850 high = xfs_btree_get_numrecs(block);
1852 /* Block is empty, must be an empty leaf. */
1853 ASSERT(level == 0 && cur->bc_nlevels == 1);
1855 cur->bc_ptrs[0] = dir != XFS_LOOKUP_LE;
1856 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1861 /* Binary search the block. */
1862 while (low <= high) {
1863 union xfs_btree_key key;
1864 union xfs_btree_key *kp;
1866 XFS_BTREE_STATS_INC(cur, compare);
1868 /* keyno is average of low and high. */
1869 keyno = (low + high) >> 1;
1871 /* Get current search key */
1872 kp = xfs_lookup_get_search_key(cur, level,
1873 keyno, block, &key);
1876 * Compute difference to get next direction:
1877 * - less than, move right
1878 * - greater than, move left
1879 * - equal, we're done
1881 diff = cur->bc_ops->key_diff(cur, kp);
1892 * If there are more levels, set up for the next level
1893 * by getting the block number and filling in the cursor.
1897 * If we moved left, need the previous key number,
1898 * unless there isn't one.
1900 if (diff > 0 && --keyno < 1)
1902 pp = xfs_btree_ptr_addr(cur, keyno, block);
1905 error = xfs_btree_check_ptr(cur, pp, 0, level);
1909 cur->bc_ptrs[level] = keyno;
1913 /* Done with the search. See if we need to adjust the results. */
1914 if (dir != XFS_LOOKUP_LE && diff < 0) {
1917 * If ge search and we went off the end of the block, but it's
1918 * not the last block, we're in the wrong block.
1920 xfs_btree_get_sibling(cur, block, &ptr, XFS_BB_RIGHTSIB);
1921 if (dir == XFS_LOOKUP_GE &&
1922 keyno > xfs_btree_get_numrecs(block) &&
1923 !xfs_btree_ptr_is_null(cur, &ptr)) {
1926 cur->bc_ptrs[0] = keyno;
1927 error = xfs_btree_increment(cur, 0, &i);
1930 XFS_WANT_CORRUPTED_RETURN(cur->bc_mp, i == 1);
1931 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1935 } else if (dir == XFS_LOOKUP_LE && diff > 0)
1937 cur->bc_ptrs[0] = keyno;
1939 /* Return if we succeeded or not. */
1940 if (keyno == 0 || keyno > xfs_btree_get_numrecs(block))
1942 else if (dir != XFS_LOOKUP_EQ || diff == 0)
1946 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
1950 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
1954 /* Find the high key storage area from a regular key. */
1955 STATIC union xfs_btree_key *
1956 xfs_btree_high_key_from_key(
1957 struct xfs_btree_cur *cur,
1958 union xfs_btree_key *key)
1960 ASSERT(cur->bc_flags & XFS_BTREE_OVERLAPPING);
1961 return (union xfs_btree_key *)((char *)key +
1962 (cur->bc_ops->key_len / 2));
1965 /* Determine the low (and high if overlapped) keys of a leaf block */
1967 xfs_btree_get_leaf_keys(
1968 struct xfs_btree_cur *cur,
1969 struct xfs_btree_block *block,
1970 union xfs_btree_key *key)
1972 union xfs_btree_key max_hkey;
1973 union xfs_btree_key hkey;
1974 union xfs_btree_rec *rec;
1975 union xfs_btree_key *high;
1978 rec = xfs_btree_rec_addr(cur, 1, block);
1979 cur->bc_ops->init_key_from_rec(key, rec);
1981 if (cur->bc_flags & XFS_BTREE_OVERLAPPING) {
1983 cur->bc_ops->init_high_key_from_rec(&max_hkey, rec);
1984 for (n = 2; n <= xfs_btree_get_numrecs(block); n++) {
1985 rec = xfs_btree_rec_addr(cur, n, block);
1986 cur->bc_ops->init_high_key_from_rec(&hkey, rec);
1987 if (cur->bc_ops->diff_two_keys(cur, &hkey, &max_hkey)
1992 high = xfs_btree_high_key_from_key(cur, key);
1993 memcpy(high, &max_hkey, cur->bc_ops->key_len / 2);
1997 /* Determine the low (and high if overlapped) keys of a node block */
1999 xfs_btree_get_node_keys(
2000 struct xfs_btree_cur *cur,
2001 struct xfs_btree_block *block,
2002 union xfs_btree_key *key)
2004 union xfs_btree_key *hkey;
2005 union xfs_btree_key *max_hkey;
2006 union xfs_btree_key *high;
2009 if (cur->bc_flags & XFS_BTREE_OVERLAPPING) {
2010 memcpy(key, xfs_btree_key_addr(cur, 1, block),
2011 cur->bc_ops->key_len / 2);
2013 max_hkey = xfs_btree_high_key_addr(cur, 1, block);
2014 for (n = 2; n <= xfs_btree_get_numrecs(block); n++) {
2015 hkey = xfs_btree_high_key_addr(cur, n, block);
2016 if (cur->bc_ops->diff_two_keys(cur, hkey, max_hkey) > 0)
2020 high = xfs_btree_high_key_from_key(cur, key);
2021 memcpy(high, max_hkey, cur->bc_ops->key_len / 2);
2023 memcpy(key, xfs_btree_key_addr(cur, 1, block),
2024 cur->bc_ops->key_len);
2028 /* Derive the keys for any btree block. */
2031 struct xfs_btree_cur *cur,
2032 struct xfs_btree_block *block,
2033 union xfs_btree_key *key)
2035 if (be16_to_cpu(block->bb_level) == 0)
2036 xfs_btree_get_leaf_keys(cur, block, key);
2038 xfs_btree_get_node_keys(cur, block, key);
2042 * Decide if we need to update the parent keys of a btree block. For
2043 * a standard btree this is only necessary if we're updating the first
2044 * record/key. For an overlapping btree, we must always update the
2045 * keys because the highest key can be in any of the records or keys
2049 xfs_btree_needs_key_update(
2050 struct xfs_btree_cur *cur,
2053 return (cur->bc_flags & XFS_BTREE_OVERLAPPING) || ptr == 1;
2057 * Update the low and high parent keys of the given level, progressing
2058 * towards the root. If force_all is false, stop if the keys for a given
2059 * level do not need updating.
2062 __xfs_btree_updkeys(
2063 struct xfs_btree_cur *cur,
2065 struct xfs_btree_block *block,
2066 struct xfs_buf *bp0,
2069 union xfs_btree_bigkey key; /* keys from current level */
2070 union xfs_btree_key *lkey; /* keys from the next level up */
2071 union xfs_btree_key *hkey;
2072 union xfs_btree_key *nlkey; /* keys from the next level up */
2073 union xfs_btree_key *nhkey;
2077 ASSERT(cur->bc_flags & XFS_BTREE_OVERLAPPING);
2079 /* Exit if there aren't any parent levels to update. */
2080 if (level + 1 >= cur->bc_nlevels)
2083 trace_xfs_btree_updkeys(cur, level, bp0);
2085 lkey = (union xfs_btree_key *)&key;
2086 hkey = xfs_btree_high_key_from_key(cur, lkey);
2087 xfs_btree_get_keys(cur, block, lkey);
2088 for (level++; level < cur->bc_nlevels; level++) {
2092 block = xfs_btree_get_block(cur, level, &bp);
2093 trace_xfs_btree_updkeys(cur, level, bp);
2095 error = xfs_btree_check_block(cur, block, level, bp);
2097 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
2101 ptr = cur->bc_ptrs[level];
2102 nlkey = xfs_btree_key_addr(cur, ptr, block);
2103 nhkey = xfs_btree_high_key_addr(cur, ptr, block);
2105 !(cur->bc_ops->diff_two_keys(cur, nlkey, lkey) != 0 ||
2106 cur->bc_ops->diff_two_keys(cur, nhkey, hkey) != 0))
2108 xfs_btree_copy_keys(cur, nlkey, lkey, 1);
2109 xfs_btree_log_keys(cur, bp, ptr, ptr);
2110 if (level + 1 >= cur->bc_nlevels)
2112 xfs_btree_get_node_keys(cur, block, lkey);
2118 /* Update all the keys from some level in cursor back to the root. */
2120 xfs_btree_updkeys_force(
2121 struct xfs_btree_cur *cur,
2125 struct xfs_btree_block *block;
2127 block = xfs_btree_get_block(cur, level, &bp);
2128 return __xfs_btree_updkeys(cur, level, block, bp, true);
2132 * Update the parent keys of the given level, progressing towards the root.
2135 xfs_btree_update_keys(
2136 struct xfs_btree_cur *cur,
2139 struct xfs_btree_block *block;
2141 union xfs_btree_key *kp;
2142 union xfs_btree_key key;
2147 block = xfs_btree_get_block(cur, level, &bp);
2148 if (cur->bc_flags & XFS_BTREE_OVERLAPPING)
2149 return __xfs_btree_updkeys(cur, level, block, bp, false);
2151 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
2152 XFS_BTREE_TRACE_ARGIK(cur, level, keyp);
2155 * Go up the tree from this level toward the root.
2156 * At each level, update the key value to the value input.
2157 * Stop when we reach a level where the cursor isn't pointing
2158 * at the first entry in the block.
2160 xfs_btree_get_keys(cur, block, &key);
2161 for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {
2165 block = xfs_btree_get_block(cur, level, &bp);
2167 error = xfs_btree_check_block(cur, block, level, bp);
2169 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
2173 ptr = cur->bc_ptrs[level];
2174 kp = xfs_btree_key_addr(cur, ptr, block);
2175 xfs_btree_copy_keys(cur, kp, &key, 1);
2176 xfs_btree_log_keys(cur, bp, ptr, ptr);
2179 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2184 * Update the record referred to by cur to the value in the
2185 * given record. This either works (return 0) or gets an
2186 * EFSCORRUPTED error.
2190 struct xfs_btree_cur *cur,
2191 union xfs_btree_rec *rec)
2193 struct xfs_btree_block *block;
2197 union xfs_btree_rec *rp;
2199 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
2200 XFS_BTREE_TRACE_ARGR(cur, rec);
2202 /* Pick up the current block. */
2203 block = xfs_btree_get_block(cur, 0, &bp);
2206 error = xfs_btree_check_block(cur, block, 0, bp);
2210 /* Get the address of the rec to be updated. */
2211 ptr = cur->bc_ptrs[0];
2212 rp = xfs_btree_rec_addr(cur, ptr, block);
2214 /* Fill in the new contents and log them. */
2215 xfs_btree_copy_recs(cur, rp, rec, 1);
2216 xfs_btree_log_recs(cur, bp, ptr, ptr);
2219 * If we are tracking the last record in the tree and
2220 * we are at the far right edge of the tree, update it.
2222 if (xfs_btree_is_lastrec(cur, block, 0)) {
2223 cur->bc_ops->update_lastrec(cur, block, rec,
2224 ptr, LASTREC_UPDATE);
2227 /* Pass new key value up to our parent. */
2228 if (xfs_btree_needs_key_update(cur, ptr)) {
2229 error = xfs_btree_update_keys(cur, 0);
2234 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2238 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
2243 * Move 1 record left from cur/level if possible.
2244 * Update cur to reflect the new path.
2246 STATIC int /* error */
2248 struct xfs_btree_cur *cur,
2250 int *stat) /* success/failure */
2252 union xfs_btree_key key; /* btree key */
2253 struct xfs_buf *lbp; /* left buffer pointer */
2254 struct xfs_btree_block *left; /* left btree block */
2255 int lrecs; /* left record count */
2256 struct xfs_buf *rbp; /* right buffer pointer */
2257 struct xfs_btree_block *right; /* right btree block */
2258 struct xfs_btree_cur *tcur; /* temporary btree cursor */
2259 int rrecs; /* right record count */
2260 union xfs_btree_ptr lptr; /* left btree pointer */
2261 union xfs_btree_key *rkp = NULL; /* right btree key */
2262 union xfs_btree_ptr *rpp = NULL; /* right address pointer */
2263 union xfs_btree_rec *rrp = NULL; /* right record pointer */
2264 int error; /* error return value */
2267 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
2268 XFS_BTREE_TRACE_ARGI(cur, level);
2270 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
2271 level == cur->bc_nlevels - 1)
2274 /* Set up variables for this block as "right". */
2275 right = xfs_btree_get_block(cur, level, &rbp);
2278 error = xfs_btree_check_block(cur, right, level, rbp);
2283 /* If we've got no left sibling then we can't shift an entry left. */
2284 xfs_btree_get_sibling(cur, right, &lptr, XFS_BB_LEFTSIB);
2285 if (xfs_btree_ptr_is_null(cur, &lptr))
2289 * If the cursor entry is the one that would be moved, don't
2290 * do it... it's too complicated.
2292 if (cur->bc_ptrs[level] <= 1)
2295 /* Set up the left neighbor as "left". */
2296 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp);
2300 /* If it's full, it can't take another entry. */
2301 lrecs = xfs_btree_get_numrecs(left);
2302 if (lrecs == cur->bc_ops->get_maxrecs(cur, level))
2305 rrecs = xfs_btree_get_numrecs(right);
2308 * We add one entry to the left side and remove one for the right side.
2309 * Account for it here, the changes will be updated on disk and logged
2315 XFS_BTREE_STATS_INC(cur, lshift);
2316 XFS_BTREE_STATS_ADD(cur, moves, 1);
2319 * If non-leaf, copy a key and a ptr to the left block.
2320 * Log the changes to the left block.
2323 /* It's a non-leaf. Move keys and pointers. */
2324 union xfs_btree_key *lkp; /* left btree key */
2325 union xfs_btree_ptr *lpp; /* left address pointer */
2327 lkp = xfs_btree_key_addr(cur, lrecs, left);
2328 rkp = xfs_btree_key_addr(cur, 1, right);
2330 lpp = xfs_btree_ptr_addr(cur, lrecs, left);
2331 rpp = xfs_btree_ptr_addr(cur, 1, right);
2333 error = xfs_btree_check_ptr(cur, rpp, 0, level);
2337 xfs_btree_copy_keys(cur, lkp, rkp, 1);
2338 xfs_btree_copy_ptrs(cur, lpp, rpp, 1);
2340 xfs_btree_log_keys(cur, lbp, lrecs, lrecs);
2341 xfs_btree_log_ptrs(cur, lbp, lrecs, lrecs);
2343 ASSERT(cur->bc_ops->keys_inorder(cur,
2344 xfs_btree_key_addr(cur, lrecs - 1, left), lkp));
2346 /* It's a leaf. Move records. */
2347 union xfs_btree_rec *lrp; /* left record pointer */
2349 lrp = xfs_btree_rec_addr(cur, lrecs, left);
2350 rrp = xfs_btree_rec_addr(cur, 1, right);
2352 xfs_btree_copy_recs(cur, lrp, rrp, 1);
2353 xfs_btree_log_recs(cur, lbp, lrecs, lrecs);
2355 ASSERT(cur->bc_ops->recs_inorder(cur,
2356 xfs_btree_rec_addr(cur, lrecs - 1, left), lrp));
2359 xfs_btree_set_numrecs(left, lrecs);
2360 xfs_btree_log_block(cur, lbp, XFS_BB_NUMRECS);
2362 xfs_btree_set_numrecs(right, rrecs);
2363 xfs_btree_log_block(cur, rbp, XFS_BB_NUMRECS);
2366 * Slide the contents of right down one entry.
2368 XFS_BTREE_STATS_ADD(cur, moves, rrecs - 1);
2370 /* It's a nonleaf. operate on keys and ptrs */
2372 int i; /* loop index */
2374 for (i = 0; i < rrecs; i++) {
2375 error = xfs_btree_check_ptr(cur, rpp, i + 1, level);
2380 xfs_btree_shift_keys(cur,
2381 xfs_btree_key_addr(cur, 2, right),
2383 xfs_btree_shift_ptrs(cur,
2384 xfs_btree_ptr_addr(cur, 2, right),
2387 xfs_btree_log_keys(cur, rbp, 1, rrecs);
2388 xfs_btree_log_ptrs(cur, rbp, 1, rrecs);
2390 /* It's a leaf. operate on records */
2391 xfs_btree_shift_recs(cur,
2392 xfs_btree_rec_addr(cur, 2, right),
2394 xfs_btree_log_recs(cur, rbp, 1, rrecs);
2397 * If it's the first record in the block, we'll need a key
2398 * structure to pass up to the next level (updkey).
2400 cur->bc_ops->init_key_from_rec(&key,
2401 xfs_btree_rec_addr(cur, 1, right));
2405 * Using a temporary cursor, update the parent key values of the
2406 * block on the left.
2408 error = xfs_btree_dup_cursor(cur, &tcur);
2411 i = xfs_btree_firstrec(tcur, level);
2412 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
2414 error = xfs_btree_decrement(tcur, level, &i);
2418 /* Update the parent keys of the right block. */
2419 error = xfs_btree_update_keys(cur, level);
2423 /* Update the parent high keys of the left block, if needed. */
2424 if (tcur->bc_flags & XFS_BTREE_OVERLAPPING) {
2425 error = xfs_btree_update_keys(tcur, level);
2430 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
2432 /* Slide the cursor value left one. */
2433 cur->bc_ptrs[level]--;
2435 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2440 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2445 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
2449 XFS_BTREE_TRACE_CURSOR(tcur, XBT_ERROR);
2450 xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
2455 * Move 1 record right from cur/level if possible.
2456 * Update cur to reflect the new path.
2458 STATIC int /* error */
2460 struct xfs_btree_cur *cur,
2462 int *stat) /* success/failure */
2464 union xfs_btree_key key; /* btree key */
2465 struct xfs_buf *lbp; /* left buffer pointer */
2466 struct xfs_btree_block *left; /* left btree block */
2467 struct xfs_buf *rbp; /* right buffer pointer */
2468 struct xfs_btree_block *right; /* right btree block */
2469 struct xfs_btree_cur *tcur; /* temporary btree cursor */
2470 union xfs_btree_ptr rptr; /* right block pointer */
2471 union xfs_btree_key *rkp; /* right btree key */
2472 int rrecs; /* right record count */
2473 int lrecs; /* left record count */
2474 int error; /* error return value */
2475 int i; /* loop counter */
2477 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
2478 XFS_BTREE_TRACE_ARGI(cur, level);
2480 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
2481 (level == cur->bc_nlevels - 1))
2484 /* Set up variables for this block as "left". */
2485 left = xfs_btree_get_block(cur, level, &lbp);
2488 error = xfs_btree_check_block(cur, left, level, lbp);
2493 /* If we've got no right sibling then we can't shift an entry right. */
2494 xfs_btree_get_sibling(cur, left, &rptr, XFS_BB_RIGHTSIB);
2495 if (xfs_btree_ptr_is_null(cur, &rptr))
2499 * If the cursor entry is the one that would be moved, don't
2500 * do it... it's too complicated.
2502 lrecs = xfs_btree_get_numrecs(left);
2503 if (cur->bc_ptrs[level] >= lrecs)
2506 /* Set up the right neighbor as "right". */
2507 error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp);
2511 /* If it's full, it can't take another entry. */
2512 rrecs = xfs_btree_get_numrecs(right);
2513 if (rrecs == cur->bc_ops->get_maxrecs(cur, level))
2516 XFS_BTREE_STATS_INC(cur, rshift);
2517 XFS_BTREE_STATS_ADD(cur, moves, rrecs);
2520 * Make a hole at the start of the right neighbor block, then
2521 * copy the last left block entry to the hole.
2524 /* It's a nonleaf. make a hole in the keys and ptrs */
2525 union xfs_btree_key *lkp;
2526 union xfs_btree_ptr *lpp;
2527 union xfs_btree_ptr *rpp;
2529 lkp = xfs_btree_key_addr(cur, lrecs, left);
2530 lpp = xfs_btree_ptr_addr(cur, lrecs, left);
2531 rkp = xfs_btree_key_addr(cur, 1, right);
2532 rpp = xfs_btree_ptr_addr(cur, 1, right);
2535 for (i = rrecs - 1; i >= 0; i--) {
2536 error = xfs_btree_check_ptr(cur, rpp, i, level);
2542 xfs_btree_shift_keys(cur, rkp, 1, rrecs);
2543 xfs_btree_shift_ptrs(cur, rpp, 1, rrecs);
2546 error = xfs_btree_check_ptr(cur, lpp, 0, level);
2551 /* Now put the new data in, and log it. */
2552 xfs_btree_copy_keys(cur, rkp, lkp, 1);
2553 xfs_btree_copy_ptrs(cur, rpp, lpp, 1);
2555 xfs_btree_log_keys(cur, rbp, 1, rrecs + 1);
2556 xfs_btree_log_ptrs(cur, rbp, 1, rrecs + 1);
2558 ASSERT(cur->bc_ops->keys_inorder(cur, rkp,
2559 xfs_btree_key_addr(cur, 2, right)));
2561 /* It's a leaf. make a hole in the records */
2562 union xfs_btree_rec *lrp;
2563 union xfs_btree_rec *rrp;
2565 lrp = xfs_btree_rec_addr(cur, lrecs, left);
2566 rrp = xfs_btree_rec_addr(cur, 1, right);
2568 xfs_btree_shift_recs(cur, rrp, 1, rrecs);
2570 /* Now put the new data in, and log it. */
2571 xfs_btree_copy_recs(cur, rrp, lrp, 1);
2572 xfs_btree_log_recs(cur, rbp, 1, rrecs + 1);
2574 cur->bc_ops->init_key_from_rec(&key, rrp);
2576 ASSERT(cur->bc_ops->recs_inorder(cur, rrp,
2577 xfs_btree_rec_addr(cur, 2, right)));
2581 * Decrement and log left's numrecs, bump and log right's numrecs.
2583 xfs_btree_set_numrecs(left, --lrecs);
2584 xfs_btree_log_block(cur, lbp, XFS_BB_NUMRECS);
2586 xfs_btree_set_numrecs(right, ++rrecs);
2587 xfs_btree_log_block(cur, rbp, XFS_BB_NUMRECS);
2590 * Using a temporary cursor, update the parent key values of the
2591 * block on the right.
2593 error = xfs_btree_dup_cursor(cur, &tcur);
2596 i = xfs_btree_lastrec(tcur, level);
2597 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
2599 error = xfs_btree_increment(tcur, level, &i);
2603 /* Update the parent high keys of the left block, if needed. */
2604 if (cur->bc_flags & XFS_BTREE_OVERLAPPING) {
2605 error = xfs_btree_update_keys(cur, level);
2610 /* Update the parent keys of the right block. */
2611 error = xfs_btree_update_keys(tcur, level);
2615 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
2617 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2622 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2627 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
2631 XFS_BTREE_TRACE_CURSOR(tcur, XBT_ERROR);
2632 xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
2637 * Split cur/level block in half.
2638 * Return new block number and the key to its first
2639 * record (to be inserted into parent).
2641 STATIC int /* error */
2643 struct xfs_btree_cur *cur,
2645 union xfs_btree_ptr *ptrp,
2646 union xfs_btree_key *key,
2647 struct xfs_btree_cur **curp,
2648 int *stat) /* success/failure */
2650 union xfs_btree_ptr lptr; /* left sibling block ptr */
2651 struct xfs_buf *lbp; /* left buffer pointer */
2652 struct xfs_btree_block *left; /* left btree block */
2653 union xfs_btree_ptr rptr; /* right sibling block ptr */
2654 struct xfs_buf *rbp; /* right buffer pointer */
2655 struct xfs_btree_block *right; /* right btree block */
2656 union xfs_btree_ptr rrptr; /* right-right sibling ptr */
2657 struct xfs_buf *rrbp; /* right-right buffer pointer */
2658 struct xfs_btree_block *rrblock; /* right-right btree block */
2662 int error; /* error return value */
2667 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
2668 XFS_BTREE_TRACE_ARGIPK(cur, level, *ptrp, key);
2670 XFS_BTREE_STATS_INC(cur, split);
2672 /* Set up left block (current one). */
2673 left = xfs_btree_get_block(cur, level, &lbp);
2676 error = xfs_btree_check_block(cur, left, level, lbp);
2681 xfs_btree_buf_to_ptr(cur, lbp, &lptr);
2683 /* Allocate the new block. If we can't do it, we're toast. Give up. */
2684 error = cur->bc_ops->alloc_block(cur, &lptr, &rptr, stat);
2689 XFS_BTREE_STATS_INC(cur, alloc);
2691 /* Set up the new block as "right". */
2692 error = xfs_btree_get_buf_block(cur, &rptr, 0, &right, &rbp);
2696 /* Fill in the btree header for the new right block. */
2697 xfs_btree_init_block_cur(cur, rbp, xfs_btree_get_level(left), 0);
2700 * Split the entries between the old and the new block evenly.
2701 * Make sure that if there's an odd number of entries now, that
2702 * each new block will have the same number of entries.
2704 lrecs = xfs_btree_get_numrecs(left);
2706 if ((lrecs & 1) && cur->bc_ptrs[level] <= rrecs + 1)
2708 src_index = (lrecs - rrecs + 1);
2710 XFS_BTREE_STATS_ADD(cur, moves, rrecs);
2712 /* Adjust numrecs for the later get_*_keys() calls. */
2714 xfs_btree_set_numrecs(left, lrecs);
2715 xfs_btree_set_numrecs(right, xfs_btree_get_numrecs(right) + rrecs);
2718 * Copy btree block entries from the left block over to the
2719 * new block, the right. Update the right block and log the
2723 /* It's a non-leaf. Move keys and pointers. */
2724 union xfs_btree_key *lkp; /* left btree key */
2725 union xfs_btree_ptr *lpp; /* left address pointer */
2726 union xfs_btree_key *rkp; /* right btree key */
2727 union xfs_btree_ptr *rpp; /* right address pointer */
2729 lkp = xfs_btree_key_addr(cur, src_index, left);
2730 lpp = xfs_btree_ptr_addr(cur, src_index, left);
2731 rkp = xfs_btree_key_addr(cur, 1, right);
2732 rpp = xfs_btree_ptr_addr(cur, 1, right);
2735 for (i = src_index; i < rrecs; i++) {
2736 error = xfs_btree_check_ptr(cur, lpp, i, level);
2742 /* Copy the keys & pointers to the new block. */
2743 xfs_btree_copy_keys(cur, rkp, lkp, rrecs);
2744 xfs_btree_copy_ptrs(cur, rpp, lpp, rrecs);
2746 xfs_btree_log_keys(cur, rbp, 1, rrecs);
2747 xfs_btree_log_ptrs(cur, rbp, 1, rrecs);
2749 /* Stash the keys of the new block for later insertion. */
2750 xfs_btree_get_node_keys(cur, right, key);
2752 /* It's a leaf. Move records. */
2753 union xfs_btree_rec *lrp; /* left record pointer */
2754 union xfs_btree_rec *rrp; /* right record pointer */
2756 lrp = xfs_btree_rec_addr(cur, src_index, left);
2757 rrp = xfs_btree_rec_addr(cur, 1, right);
2759 /* Copy records to the new block. */
2760 xfs_btree_copy_recs(cur, rrp, lrp, rrecs);
2761 xfs_btree_log_recs(cur, rbp, 1, rrecs);
2763 /* Stash the keys of the new block for later insertion. */
2764 xfs_btree_get_leaf_keys(cur, right, key);
2768 * Find the left block number by looking in the buffer.
2769 * Adjust sibling pointers.
2771 xfs_btree_get_sibling(cur, left, &rrptr, XFS_BB_RIGHTSIB);
2772 xfs_btree_set_sibling(cur, right, &rrptr, XFS_BB_RIGHTSIB);
2773 xfs_btree_set_sibling(cur, right, &lptr, XFS_BB_LEFTSIB);
2774 xfs_btree_set_sibling(cur, left, &rptr, XFS_BB_RIGHTSIB);
2776 xfs_btree_log_block(cur, rbp, XFS_BB_ALL_BITS);
2777 xfs_btree_log_block(cur, lbp, XFS_BB_NUMRECS | XFS_BB_RIGHTSIB);
2780 * If there's a block to the new block's right, make that block
2781 * point back to right instead of to left.
2783 if (!xfs_btree_ptr_is_null(cur, &rrptr)) {
2784 error = xfs_btree_read_buf_block(cur, &rrptr,
2785 0, &rrblock, &rrbp);
2788 xfs_btree_set_sibling(cur, rrblock, &rptr, XFS_BB_LEFTSIB);
2789 xfs_btree_log_block(cur, rrbp, XFS_BB_LEFTSIB);
2792 /* Update the parent high keys of the left block, if needed. */
2793 if (cur->bc_flags & XFS_BTREE_OVERLAPPING) {
2794 error = xfs_btree_update_keys(cur, level);
2800 * If the cursor is really in the right block, move it there.
2801 * If it's just pointing past the last entry in left, then we'll
2802 * insert there, so don't change anything in that case.
2804 if (cur->bc_ptrs[level] > lrecs + 1) {
2805 xfs_btree_setbuf(cur, level, rbp);
2806 cur->bc_ptrs[level] -= lrecs;
2809 * If there are more levels, we'll need another cursor which refers
2810 * the right block, no matter where this cursor was.
2812 if (level + 1 < cur->bc_nlevels) {
2813 error = xfs_btree_dup_cursor(cur, curp);
2816 (*curp)->bc_ptrs[level + 1]++;
2819 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2823 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2828 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
2832 struct xfs_btree_split_args {
2833 struct xfs_btree_cur *cur;
2835 union xfs_btree_ptr *ptrp;
2836 union xfs_btree_key *key;
2837 struct xfs_btree_cur **curp;
2838 int *stat; /* success/failure */
2840 bool kswapd; /* allocation in kswapd context */
2841 struct completion *done;
2842 struct work_struct work;
2846 * Stack switching interfaces for allocation
2849 xfs_btree_split_worker(
2850 struct work_struct *work)
2852 struct xfs_btree_split_args *args = container_of(work,
2853 struct xfs_btree_split_args, work);
2854 unsigned long pflags;
2855 unsigned long new_pflags = PF_FSTRANS;
2858 * we are in a transaction context here, but may also be doing work
2859 * in kswapd context, and hence we may need to inherit that state
2860 * temporarily to ensure that we don't block waiting for memory reclaim
2864 new_pflags |= PF_MEMALLOC | PF_SWAPWRITE | PF_KSWAPD;
2866 current_set_flags_nested(&pflags, new_pflags);
2868 args->result = __xfs_btree_split(args->cur, args->level, args->ptrp,
2869 args->key, args->curp, args->stat);
2870 complete(args->done);
2872 current_restore_flags_nested(&pflags, new_pflags);
2876 * BMBT split requests often come in with little stack to work on. Push
2877 * them off to a worker thread so there is lots of stack to use. For the other
2878 * btree types, just call directly to avoid the context switch overhead here.
2880 STATIC int /* error */
2882 struct xfs_btree_cur *cur,
2884 union xfs_btree_ptr *ptrp,
2885 union xfs_btree_key *key,
2886 struct xfs_btree_cur **curp,
2887 int *stat) /* success/failure */
2889 struct xfs_btree_split_args args;
2890 DECLARE_COMPLETION_ONSTACK(done);
2892 if (cur->bc_btnum != XFS_BTNUM_BMAP)
2893 return __xfs_btree_split(cur, level, ptrp, key, curp, stat);
2902 args.kswapd = current_is_kswapd();
2903 INIT_WORK_ONSTACK(&args.work, xfs_btree_split_worker);
2904 queue_work(xfs_alloc_wq, &args.work);
2905 wait_for_completion(&done);
2906 destroy_work_on_stack(&args.work);
2912 * Copy the old inode root contents into a real block and make the
2913 * broot point to it.
2916 xfs_btree_new_iroot(
2917 struct xfs_btree_cur *cur, /* btree cursor */
2918 int *logflags, /* logging flags for inode */
2919 int *stat) /* return status - 0 fail */
2921 struct xfs_buf *cbp; /* buffer for cblock */
2922 struct xfs_btree_block *block; /* btree block */
2923 struct xfs_btree_block *cblock; /* child btree block */
2924 union xfs_btree_key *ckp; /* child key pointer */
2925 union xfs_btree_ptr *cpp; /* child ptr pointer */
2926 union xfs_btree_key *kp; /* pointer to btree key */
2927 union xfs_btree_ptr *pp; /* pointer to block addr */
2928 union xfs_btree_ptr nptr; /* new block addr */
2929 int level; /* btree level */
2930 int error; /* error return code */
2932 int i; /* loop counter */
2935 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
2936 XFS_BTREE_STATS_INC(cur, newroot);
2938 ASSERT(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE);
2940 level = cur->bc_nlevels - 1;
2942 block = xfs_btree_get_iroot(cur);
2943 pp = xfs_btree_ptr_addr(cur, 1, block);
2945 /* Allocate the new block. If we can't do it, we're toast. Give up. */
2946 error = cur->bc_ops->alloc_block(cur, pp, &nptr, stat);
2950 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
2953 XFS_BTREE_STATS_INC(cur, alloc);
2955 /* Copy the root into a real block. */
2956 error = xfs_btree_get_buf_block(cur, &nptr, 0, &cblock, &cbp);
2961 * we can't just memcpy() the root in for CRC enabled btree blocks.
2962 * In that case have to also ensure the blkno remains correct
2964 memcpy(cblock, block, xfs_btree_block_len(cur));
2965 if (cur->bc_flags & XFS_BTREE_CRC_BLOCKS) {
2966 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
2967 cblock->bb_u.l.bb_blkno = cpu_to_be64(cbp->b_bn);
2969 cblock->bb_u.s.bb_blkno = cpu_to_be64(cbp->b_bn);
2972 be16_add_cpu(&block->bb_level, 1);
2973 xfs_btree_set_numrecs(block, 1);
2975 cur->bc_ptrs[level + 1] = 1;
2977 kp = xfs_btree_key_addr(cur, 1, block);
2978 ckp = xfs_btree_key_addr(cur, 1, cblock);
2979 xfs_btree_copy_keys(cur, ckp, kp, xfs_btree_get_numrecs(cblock));
2981 cpp = xfs_btree_ptr_addr(cur, 1, cblock);
2983 for (i = 0; i < be16_to_cpu(cblock->bb_numrecs); i++) {
2984 error = xfs_btree_check_ptr(cur, pp, i, level);
2989 xfs_btree_copy_ptrs(cur, cpp, pp, xfs_btree_get_numrecs(cblock));
2992 error = xfs_btree_check_ptr(cur, &nptr, 0, level);
2996 xfs_btree_copy_ptrs(cur, pp, &nptr, 1);
2998 xfs_iroot_realloc(cur->bc_private.b.ip,
2999 1 - xfs_btree_get_numrecs(cblock),
3000 cur->bc_private.b.whichfork);
3002 xfs_btree_setbuf(cur, level, cbp);
3005 * Do all this logging at the end so that
3006 * the root is at the right level.
3008 xfs_btree_log_block(cur, cbp, XFS_BB_ALL_BITS);
3009 xfs_btree_log_keys(cur, cbp, 1, be16_to_cpu(cblock->bb_numrecs));
3010 xfs_btree_log_ptrs(cur, cbp, 1, be16_to_cpu(cblock->bb_numrecs));
3013 XFS_ILOG_CORE | xfs_ilog_fbroot(cur->bc_private.b.whichfork);
3015 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3018 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
3023 * Allocate a new root block, fill it in.
3025 STATIC int /* error */
3027 struct xfs_btree_cur *cur, /* btree cursor */
3028 int *stat) /* success/failure */
3030 struct xfs_btree_block *block; /* one half of the old root block */
3031 struct xfs_buf *bp; /* buffer containing block */
3032 int error; /* error return value */
3033 struct xfs_buf *lbp; /* left buffer pointer */
3034 struct xfs_btree_block *left; /* left btree block */
3035 struct xfs_buf *nbp; /* new (root) buffer */
3036 struct xfs_btree_block *new; /* new (root) btree block */
3037 int nptr; /* new value for key index, 1 or 2 */
3038 struct xfs_buf *rbp; /* right buffer pointer */
3039 struct xfs_btree_block *right; /* right btree block */
3040 union xfs_btree_ptr rptr;
3041 union xfs_btree_ptr lptr;
3043 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
3044 XFS_BTREE_STATS_INC(cur, newroot);
3046 /* initialise our start point from the cursor */
3047 cur->bc_ops->init_ptr_from_cur(cur, &rptr);
3049 /* Allocate the new block. If we can't do it, we're toast. Give up. */
3050 error = cur->bc_ops->alloc_block(cur, &rptr, &lptr, stat);
3055 XFS_BTREE_STATS_INC(cur, alloc);
3057 /* Set up the new block. */
3058 error = xfs_btree_get_buf_block(cur, &lptr, 0, &new, &nbp);
3062 /* Set the root in the holding structure increasing the level by 1. */
3063 cur->bc_ops->set_root(cur, &lptr, 1);
3066 * At the previous root level there are now two blocks: the old root,
3067 * and the new block generated when it was split. We don't know which
3068 * one the cursor is pointing at, so we set up variables "left" and
3069 * "right" for each case.
3071 block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);
3074 error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);
3079 xfs_btree_get_sibling(cur, block, &rptr, XFS_BB_RIGHTSIB);
3080 if (!xfs_btree_ptr_is_null(cur, &rptr)) {
3081 /* Our block is left, pick up the right block. */
3083 xfs_btree_buf_to_ptr(cur, lbp, &lptr);
3085 error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp);
3091 /* Our block is right, pick up the left block. */
3093 xfs_btree_buf_to_ptr(cur, rbp, &rptr);
3095 xfs_btree_get_sibling(cur, right, &lptr, XFS_BB_LEFTSIB);
3096 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp);
3103 /* Fill in the new block's btree header and log it. */
3104 xfs_btree_init_block_cur(cur, nbp, cur->bc_nlevels, 2);
3105 xfs_btree_log_block(cur, nbp, XFS_BB_ALL_BITS);
3106 ASSERT(!xfs_btree_ptr_is_null(cur, &lptr) &&
3107 !xfs_btree_ptr_is_null(cur, &rptr));
3109 /* Fill in the key data in the new root. */
3110 if (xfs_btree_get_level(left) > 0) {
3112 * Get the keys for the left block's keys and put them directly
3113 * in the parent block. Do the same for the right block.
3115 xfs_btree_get_node_keys(cur, left,
3116 xfs_btree_key_addr(cur, 1, new));
3117 xfs_btree_get_node_keys(cur, right,
3118 xfs_btree_key_addr(cur, 2, new));
3121 * Get the keys for the left block's records and put them
3122 * directly in the parent block. Do the same for the right
3125 xfs_btree_get_leaf_keys(cur, left,
3126 xfs_btree_key_addr(cur, 1, new));
3127 xfs_btree_get_leaf_keys(cur, right,
3128 xfs_btree_key_addr(cur, 2, new));
3130 xfs_btree_log_keys(cur, nbp, 1, 2);
3132 /* Fill in the pointer data in the new root. */
3133 xfs_btree_copy_ptrs(cur,
3134 xfs_btree_ptr_addr(cur, 1, new), &lptr, 1);
3135 xfs_btree_copy_ptrs(cur,
3136 xfs_btree_ptr_addr(cur, 2, new), &rptr, 1);
3137 xfs_btree_log_ptrs(cur, nbp, 1, 2);
3139 /* Fix up the cursor. */
3140 xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);
3141 cur->bc_ptrs[cur->bc_nlevels] = nptr;
3143 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3147 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
3150 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3156 xfs_btree_make_block_unfull(
3157 struct xfs_btree_cur *cur, /* btree cursor */
3158 int level, /* btree level */
3159 int numrecs,/* # of recs in block */
3160 int *oindex,/* old tree index */
3161 int *index, /* new tree index */
3162 union xfs_btree_ptr *nptr, /* new btree ptr */
3163 struct xfs_btree_cur **ncur, /* new btree cursor */
3164 union xfs_btree_key *key, /* key of new block */
3169 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
3170 level == cur->bc_nlevels - 1) {
3171 struct xfs_inode *ip = cur->bc_private.b.ip;
3173 if (numrecs < cur->bc_ops->get_dmaxrecs(cur, level)) {
3174 /* A root block that can be made bigger. */
3175 xfs_iroot_realloc(ip, 1, cur->bc_private.b.whichfork);
3178 /* A root block that needs replacing */
3181 error = xfs_btree_new_iroot(cur, &logflags, stat);
3182 if (error || *stat == 0)
3185 xfs_trans_log_inode(cur->bc_tp, ip, logflags);
3191 /* First, try shifting an entry to the right neighbor. */
3192 error = xfs_btree_rshift(cur, level, stat);
3196 /* Next, try shifting an entry to the left neighbor. */
3197 error = xfs_btree_lshift(cur, level, stat);
3202 *oindex = *index = cur->bc_ptrs[level];
3207 * Next, try splitting the current block in half.
3209 * If this works we have to re-set our variables because we
3210 * could be in a different block now.
3212 error = xfs_btree_split(cur, level, nptr, key, ncur, stat);
3213 if (error || *stat == 0)
3217 *index = cur->bc_ptrs[level];
3222 * Insert one record/level. Return information to the caller
3223 * allowing the next level up to proceed if necessary.
3227 struct xfs_btree_cur *cur, /* btree cursor */
3228 int level, /* level to insert record at */
3229 union xfs_btree_ptr *ptrp, /* i/o: block number inserted */
3230 union xfs_btree_rec *rec, /* record to insert */
3231 union xfs_btree_key *key, /* i/o: block key for ptrp */
3232 struct xfs_btree_cur **curp, /* output: new cursor replacing cur */
3233 int *stat) /* success/failure */
3235 struct xfs_btree_block *block; /* btree block */
3236 struct xfs_buf *bp; /* buffer for block */
3237 union xfs_btree_ptr nptr; /* new block ptr */
3238 struct xfs_btree_cur *ncur; /* new btree cursor */
3239 union xfs_btree_bigkey nkey; /* new block key */
3240 union xfs_btree_key *lkey;
3241 int optr; /* old key/record index */
3242 int ptr; /* key/record index */
3243 int numrecs;/* number of records */
3244 int error; /* error return value */
3250 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
3251 XFS_BTREE_TRACE_ARGIPR(cur, level, *ptrp, &rec);
3254 lkey = (union xfs_btree_key *)&nkey;
3257 * If we have an external root pointer, and we've made it to the
3258 * root level, allocate a new root block and we're done.
3260 if (!(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
3261 (level >= cur->bc_nlevels)) {
3262 error = xfs_btree_new_root(cur, stat);
3263 xfs_btree_set_ptr_null(cur, ptrp);
3265 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3269 /* If we're off the left edge, return failure. */
3270 ptr = cur->bc_ptrs[level];
3272 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3279 XFS_BTREE_STATS_INC(cur, insrec);
3281 /* Get pointers to the btree buffer and block. */
3282 block = xfs_btree_get_block(cur, level, &bp);
3283 old_bn = bp ? bp->b_bn : XFS_BUF_DADDR_NULL;
3284 numrecs = xfs_btree_get_numrecs(block);
3287 error = xfs_btree_check_block(cur, block, level, bp);
3291 /* Check that the new entry is being inserted in the right place. */
3292 if (ptr <= numrecs) {
3294 ASSERT(cur->bc_ops->recs_inorder(cur, rec,
3295 xfs_btree_rec_addr(cur, ptr, block)));
3297 ASSERT(cur->bc_ops->keys_inorder(cur, key,
3298 xfs_btree_key_addr(cur, ptr, block)));
3304 * If the block is full, we can't insert the new entry until we
3305 * make the block un-full.
3307 xfs_btree_set_ptr_null(cur, &nptr);
3308 if (numrecs == cur->bc_ops->get_maxrecs(cur, level)) {
3309 error = xfs_btree_make_block_unfull(cur, level, numrecs,
3310 &optr, &ptr, &nptr, &ncur, lkey, stat);
3311 if (error || *stat == 0)
3316 * The current block may have changed if the block was
3317 * previously full and we have just made space in it.
3319 block = xfs_btree_get_block(cur, level, &bp);
3320 numrecs = xfs_btree_get_numrecs(block);
3323 error = xfs_btree_check_block(cur, block, level, bp);
3329 * At this point we know there's room for our new entry in the block
3330 * we're pointing at.
3332 XFS_BTREE_STATS_ADD(cur, moves, numrecs - ptr + 1);
3335 /* It's a nonleaf. make a hole in the keys and ptrs */
3336 union xfs_btree_key *kp;
3337 union xfs_btree_ptr *pp;
3339 kp = xfs_btree_key_addr(cur, ptr, block);
3340 pp = xfs_btree_ptr_addr(cur, ptr, block);
3343 for (i = numrecs - ptr; i >= 0; i--) {
3344 error = xfs_btree_check_ptr(cur, pp, i, level);
3350 xfs_btree_shift_keys(cur, kp, 1, numrecs - ptr + 1);
3351 xfs_btree_shift_ptrs(cur, pp, 1, numrecs - ptr + 1);
3354 error = xfs_btree_check_ptr(cur, ptrp, 0, level);
3359 /* Now put the new data in, bump numrecs and log it. */
3360 xfs_btree_copy_keys(cur, kp, key, 1);
3361 xfs_btree_copy_ptrs(cur, pp, ptrp, 1);
3363 xfs_btree_set_numrecs(block, numrecs);
3364 xfs_btree_log_ptrs(cur, bp, ptr, numrecs);
3365 xfs_btree_log_keys(cur, bp, ptr, numrecs);
3367 if (ptr < numrecs) {
3368 ASSERT(cur->bc_ops->keys_inorder(cur, kp,
3369 xfs_btree_key_addr(cur, ptr + 1, block)));
3373 /* It's a leaf. make a hole in the records */
3374 union xfs_btree_rec *rp;
3376 rp = xfs_btree_rec_addr(cur, ptr, block);
3378 xfs_btree_shift_recs(cur, rp, 1, numrecs - ptr + 1);
3380 /* Now put the new data in, bump numrecs and log it. */
3381 xfs_btree_copy_recs(cur, rp, rec, 1);
3382 xfs_btree_set_numrecs(block, ++numrecs);
3383 xfs_btree_log_recs(cur, bp, ptr, numrecs);
3385 if (ptr < numrecs) {
3386 ASSERT(cur->bc_ops->recs_inorder(cur, rp,
3387 xfs_btree_rec_addr(cur, ptr + 1, block)));
3392 /* Log the new number of records in the btree header. */
3393 xfs_btree_log_block(cur, bp, XFS_BB_NUMRECS);
3396 * If we just inserted into a new tree block, we have to
3397 * recalculate nkey here because nkey is out of date.
3399 * Otherwise we're just updating an existing block (having shoved
3400 * some records into the new tree block), so use the regular key
3403 if (bp && bp->b_bn != old_bn) {
3404 xfs_btree_get_keys(cur, block, lkey);
3405 } else if (xfs_btree_needs_key_update(cur, optr)) {
3406 error = xfs_btree_update_keys(cur, level);
3412 * If we are tracking the last record in the tree and
3413 * we are at the far right edge of the tree, update it.
3415 if (xfs_btree_is_lastrec(cur, block, level)) {
3416 cur->bc_ops->update_lastrec(cur, block, rec,
3417 ptr, LASTREC_INSREC);
3421 * Return the new block number, if any.
3422 * If there is one, give back a record value and a cursor too.
3425 if (!xfs_btree_ptr_is_null(cur, &nptr)) {
3426 xfs_btree_copy_keys(cur, key, lkey, 1);
3430 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3435 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
3440 * Insert the record at the point referenced by cur.
3442 * A multi-level split of the tree on insert will invalidate the original
3443 * cursor. All callers of this function should assume that the cursor is
3444 * no longer valid and revalidate it.
3448 struct xfs_btree_cur *cur,
3451 int error; /* error return value */
3452 int i; /* result value, 0 for failure */
3453 int level; /* current level number in btree */
3454 union xfs_btree_ptr nptr; /* new block number (split result) */
3455 struct xfs_btree_cur *ncur; /* new cursor (split result) */
3456 struct xfs_btree_cur *pcur; /* previous level's cursor */
3457 union xfs_btree_bigkey bkey; /* key of block to insert */
3458 union xfs_btree_key *key;
3459 union xfs_btree_rec rec; /* record to insert */
3464 key = (union xfs_btree_key *)&bkey;
3466 xfs_btree_set_ptr_null(cur, &nptr);
3468 /* Make a key out of the record data to be inserted, and save it. */
3469 cur->bc_ops->init_rec_from_cur(cur, &rec);
3470 cur->bc_ops->init_key_from_rec(key, &rec);
3473 * Loop going up the tree, starting at the leaf level.
3474 * Stop when we don't get a split block, that must mean that
3475 * the insert is finished with this level.
3479 * Insert nrec/nptr into this level of the tree.
3480 * Note if we fail, nptr will be null.
3482 error = xfs_btree_insrec(pcur, level, &nptr, &rec, key,
3486 xfs_btree_del_cursor(pcur, XFS_BTREE_ERROR);
3490 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3494 * See if the cursor we just used is trash.
3495 * Can't trash the caller's cursor, but otherwise we should
3496 * if ncur is a new cursor or we're about to be done.
3499 (ncur || xfs_btree_ptr_is_null(cur, &nptr))) {
3500 /* Save the state from the cursor before we trash it */
3501 if (cur->bc_ops->update_cursor)
3502 cur->bc_ops->update_cursor(pcur, cur);
3503 cur->bc_nlevels = pcur->bc_nlevels;
3504 xfs_btree_del_cursor(pcur, XFS_BTREE_NOERROR);
3506 /* If we got a new cursor, switch to it. */
3511 } while (!xfs_btree_ptr_is_null(cur, &nptr));
3513 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3517 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
3522 * Try to merge a non-leaf block back into the inode root.
3524 * Note: the killroot names comes from the fact that we're effectively
3525 * killing the old root block. But because we can't just delete the
3526 * inode we have to copy the single block it was pointing to into the
3530 xfs_btree_kill_iroot(
3531 struct xfs_btree_cur *cur)
3533 int whichfork = cur->bc_private.b.whichfork;
3534 struct xfs_inode *ip = cur->bc_private.b.ip;
3535 struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
3536 struct xfs_btree_block *block;
3537 struct xfs_btree_block *cblock;
3538 union xfs_btree_key *kp;
3539 union xfs_btree_key *ckp;
3540 union xfs_btree_ptr *pp;
3541 union xfs_btree_ptr *cpp;
3542 struct xfs_buf *cbp;
3548 union xfs_btree_ptr ptr;
3552 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
3554 ASSERT(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE);
3555 ASSERT(cur->bc_nlevels > 1);
3558 * Don't deal with the root block needs to be a leaf case.
3559 * We're just going to turn the thing back into extents anyway.
3561 level = cur->bc_nlevels - 1;
3566 * Give up if the root has multiple children.
3568 block = xfs_btree_get_iroot(cur);
3569 if (xfs_btree_get_numrecs(block) != 1)
3572 cblock = xfs_btree_get_block(cur, level - 1, &cbp);
3573 numrecs = xfs_btree_get_numrecs(cblock);
3576 * Only do this if the next level will fit.
3577 * Then the data must be copied up to the inode,
3578 * instead of freeing the root you free the next level.
3580 if (numrecs > cur->bc_ops->get_dmaxrecs(cur, level))
3583 XFS_BTREE_STATS_INC(cur, killroot);
3586 xfs_btree_get_sibling(cur, block, &ptr, XFS_BB_LEFTSIB);
3587 ASSERT(xfs_btree_ptr_is_null(cur, &ptr));
3588 xfs_btree_get_sibling(cur, block, &ptr, XFS_BB_RIGHTSIB);
3589 ASSERT(xfs_btree_ptr_is_null(cur, &ptr));
3592 index = numrecs - cur->bc_ops->get_maxrecs(cur, level);
3594 xfs_iroot_realloc(cur->bc_private.b.ip, index,
3595 cur->bc_private.b.whichfork);
3596 block = ifp->if_broot;
3599 be16_add_cpu(&block->bb_numrecs, index);
3600 ASSERT(block->bb_numrecs == cblock->bb_numrecs);
3602 kp = xfs_btree_key_addr(cur, 1, block);
3603 ckp = xfs_btree_key_addr(cur, 1, cblock);
3604 xfs_btree_copy_keys(cur, kp, ckp, numrecs);
3606 pp = xfs_btree_ptr_addr(cur, 1, block);
3607 cpp = xfs_btree_ptr_addr(cur, 1, cblock);
3609 for (i = 0; i < numrecs; i++) {
3610 error = xfs_btree_check_ptr(cur, cpp, i, level - 1);
3612 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
3617 xfs_btree_copy_ptrs(cur, pp, cpp, numrecs);
3619 error = xfs_btree_free_block(cur, cbp);
3621 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
3625 cur->bc_bufs[level - 1] = NULL;
3626 be16_add_cpu(&block->bb_level, -1);
3627 xfs_trans_log_inode(cur->bc_tp, ip,
3628 XFS_ILOG_CORE | xfs_ilog_fbroot(cur->bc_private.b.whichfork));
3631 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3636 * Kill the current root node, and replace it with it's only child node.
3639 xfs_btree_kill_root(
3640 struct xfs_btree_cur *cur,
3643 union xfs_btree_ptr *newroot)
3647 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
3648 XFS_BTREE_STATS_INC(cur, killroot);
3651 * Update the root pointer, decreasing the level by 1 and then
3652 * free the old root.
3654 cur->bc_ops->set_root(cur, newroot, -1);
3656 error = xfs_btree_free_block(cur, bp);
3658 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
3662 cur->bc_bufs[level] = NULL;
3663 cur->bc_ra[level] = 0;
3666 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3671 xfs_btree_dec_cursor(
3672 struct xfs_btree_cur *cur,
3680 error = xfs_btree_decrement(cur, level, &i);
3685 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3691 * Single level of the btree record deletion routine.
3692 * Delete record pointed to by cur/level.
3693 * Remove the record from its block then rebalance the tree.
3694 * Return 0 for error, 1 for done, 2 to go on to the next level.
3696 STATIC int /* error */
3698 struct xfs_btree_cur *cur, /* btree cursor */
3699 int level, /* level removing record from */
3700 int *stat) /* fail/done/go-on */
3702 struct xfs_btree_block *block; /* btree block */
3703 union xfs_btree_ptr cptr; /* current block ptr */
3704 struct xfs_buf *bp; /* buffer for block */
3705 int error; /* error return value */
3706 int i; /* loop counter */
3707 union xfs_btree_ptr lptr; /* left sibling block ptr */
3708 struct xfs_buf *lbp; /* left buffer pointer */
3709 struct xfs_btree_block *left; /* left btree block */
3710 int lrecs = 0; /* left record count */
3711 int ptr; /* key/record index */
3712 union xfs_btree_ptr rptr; /* right sibling block ptr */
3713 struct xfs_buf *rbp; /* right buffer pointer */
3714 struct xfs_btree_block *right; /* right btree block */
3715 struct xfs_btree_block *rrblock; /* right-right btree block */
3716 struct xfs_buf *rrbp; /* right-right buffer pointer */
3717 int rrecs = 0; /* right record count */
3718 struct xfs_btree_cur *tcur; /* temporary btree cursor */
3719 int numrecs; /* temporary numrec count */
3721 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
3722 XFS_BTREE_TRACE_ARGI(cur, level);
3726 /* Get the index of the entry being deleted, check for nothing there. */
3727 ptr = cur->bc_ptrs[level];
3729 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3734 /* Get the buffer & block containing the record or key/ptr. */
3735 block = xfs_btree_get_block(cur, level, &bp);
3736 numrecs = xfs_btree_get_numrecs(block);
3739 error = xfs_btree_check_block(cur, block, level, bp);
3744 /* Fail if we're off the end of the block. */
3745 if (ptr > numrecs) {
3746 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
3751 XFS_BTREE_STATS_INC(cur, delrec);
3752 XFS_BTREE_STATS_ADD(cur, moves, numrecs - ptr);
3754 /* Excise the entries being deleted. */
3756 /* It's a nonleaf. operate on keys and ptrs */
3757 union xfs_btree_key *lkp;
3758 union xfs_btree_ptr *lpp;
3760 lkp = xfs_btree_key_addr(cur, ptr + 1, block);
3761 lpp = xfs_btree_ptr_addr(cur, ptr + 1, block);
3764 for (i = 0; i < numrecs - ptr; i++) {
3765 error = xfs_btree_check_ptr(cur, lpp, i, level);
3771 if (ptr < numrecs) {
3772 xfs_btree_shift_keys(cur, lkp, -1, numrecs - ptr);
3773 xfs_btree_shift_ptrs(cur, lpp, -1, numrecs - ptr);
3774 xfs_btree_log_keys(cur, bp, ptr, numrecs - 1);
3775 xfs_btree_log_ptrs(cur, bp, ptr, numrecs - 1);
3778 /* It's a leaf. operate on records */
3779 if (ptr < numrecs) {
3780 xfs_btree_shift_recs(cur,
3781 xfs_btree_rec_addr(cur, ptr + 1, block),
3783 xfs_btree_log_recs(cur, bp, ptr, numrecs - 1);
3788 * Decrement and log the number of entries in the block.
3790 xfs_btree_set_numrecs(block, --numrecs);
3791 xfs_btree_log_block(cur, bp, XFS_BB_NUMRECS);
3794 * If we are tracking the last record in the tree and
3795 * we are at the far right edge of the tree, update it.
3797 if (xfs_btree_is_lastrec(cur, block, level)) {
3798 cur->bc_ops->update_lastrec(cur, block, NULL,
3799 ptr, LASTREC_DELREC);
3803 * We're at the root level. First, shrink the root block in-memory.
3804 * Try to get rid of the next level down. If we can't then there's
3805 * nothing left to do.
3807 if (level == cur->bc_nlevels - 1) {
3808 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) {
3809 xfs_iroot_realloc(cur->bc_private.b.ip, -1,
3810 cur->bc_private.b.whichfork);
3812 error = xfs_btree_kill_iroot(cur);
3816 error = xfs_btree_dec_cursor(cur, level, stat);
3824 * If this is the root level, and there's only one entry left,
3825 * and it's NOT the leaf level, then we can get rid of this
3828 if (numrecs == 1 && level > 0) {
3829 union xfs_btree_ptr *pp;
3831 * pp is still set to the first pointer in the block.
3832 * Make it the new root of the btree.
3834 pp = xfs_btree_ptr_addr(cur, 1, block);
3835 error = xfs_btree_kill_root(cur, bp, level, pp);
3838 } else if (level > 0) {
3839 error = xfs_btree_dec_cursor(cur, level, stat);
3848 * If we deleted the leftmost entry in the block, update the
3849 * key values above us in the tree.
3851 if (xfs_btree_needs_key_update(cur, ptr)) {
3852 error = xfs_btree_update_keys(cur, level);
3858 * If the number of records remaining in the block is at least
3859 * the minimum, we're done.
3861 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) {
3862 error = xfs_btree_dec_cursor(cur, level, stat);
3869 * Otherwise, we have to move some records around to keep the
3870 * tree balanced. Look at the left and right sibling blocks to
3871 * see if we can re-balance by moving only one record.
3873 xfs_btree_get_sibling(cur, block, &rptr, XFS_BB_RIGHTSIB);
3874 xfs_btree_get_sibling(cur, block, &lptr, XFS_BB_LEFTSIB);
3876 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) {
3878 * One child of root, need to get a chance to copy its contents
3879 * into the root and delete it. Can't go up to next level,
3880 * there's nothing to delete there.
3882 if (xfs_btree_ptr_is_null(cur, &rptr) &&
3883 xfs_btree_ptr_is_null(cur, &lptr) &&
3884 level == cur->bc_nlevels - 2) {
3885 error = xfs_btree_kill_iroot(cur);
3887 error = xfs_btree_dec_cursor(cur, level, stat);
3894 ASSERT(!xfs_btree_ptr_is_null(cur, &rptr) ||
3895 !xfs_btree_ptr_is_null(cur, &lptr));
3898 * Duplicate the cursor so our btree manipulations here won't
3899 * disrupt the next level up.
3901 error = xfs_btree_dup_cursor(cur, &tcur);
3906 * If there's a right sibling, see if it's ok to shift an entry
3909 if (!xfs_btree_ptr_is_null(cur, &rptr)) {
3911 * Move the temp cursor to the last entry in the next block.
3912 * Actually any entry but the first would suffice.
3914 i = xfs_btree_lastrec(tcur, level);
3915 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3917 error = xfs_btree_increment(tcur, level, &i);
3920 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3922 i = xfs_btree_lastrec(tcur, level);
3923 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3925 /* Grab a pointer to the block. */
3926 right = xfs_btree_get_block(tcur, level, &rbp);
3928 error = xfs_btree_check_block(tcur, right, level, rbp);
3932 /* Grab the current block number, for future use. */
3933 xfs_btree_get_sibling(tcur, right, &cptr, XFS_BB_LEFTSIB);
3936 * If right block is full enough so that removing one entry
3937 * won't make it too empty, and left-shifting an entry out
3938 * of right to us works, we're done.
3940 if (xfs_btree_get_numrecs(right) - 1 >=
3941 cur->bc_ops->get_minrecs(tcur, level)) {
3942 error = xfs_btree_lshift(tcur, level, &i);
3946 ASSERT(xfs_btree_get_numrecs(block) >=
3947 cur->bc_ops->get_minrecs(tcur, level));
3949 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
3952 error = xfs_btree_dec_cursor(cur, level, stat);
3960 * Otherwise, grab the number of records in right for
3961 * future reference, and fix up the temp cursor to point
3962 * to our block again (last record).
3964 rrecs = xfs_btree_get_numrecs(right);
3965 if (!xfs_btree_ptr_is_null(cur, &lptr)) {
3966 i = xfs_btree_firstrec(tcur, level);
3967 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3969 error = xfs_btree_decrement(tcur, level, &i);
3972 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3977 * If there's a left sibling, see if it's ok to shift an entry
3980 if (!xfs_btree_ptr_is_null(cur, &lptr)) {
3982 * Move the temp cursor to the first entry in the
3985 i = xfs_btree_firstrec(tcur, level);
3986 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3988 error = xfs_btree_decrement(tcur, level, &i);
3991 i = xfs_btree_firstrec(tcur, level);
3992 XFS_WANT_CORRUPTED_GOTO(cur->bc_mp, i == 1, error0);
3994 /* Grab a pointer to the block. */
3995 left = xfs_btree_get_block(tcur, level, &lbp);
3997 error = xfs_btree_check_block(cur, left, level, lbp);
4001 /* Grab the current block number, for future use. */
4002 xfs_btree_get_sibling(tcur, left, &cptr, XFS_BB_RIGHTSIB);
4005 * If left block is full enough so that removing one entry
4006 * won't make it too empty, and right-shifting an entry out
4007 * of left to us works, we're done.
4009 if (xfs_btree_get_numrecs(left) - 1 >=
4010 cur->bc_ops->get_minrecs(tcur, level)) {
4011 error = xfs_btree_rshift(tcur, level, &i);
4015 ASSERT(xfs_btree_get_numrecs(block) >=
4016 cur->bc_ops->get_minrecs(tcur, level));
4017 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
4021 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
4028 * Otherwise, grab the number of records in right for
4031 lrecs = xfs_btree_get_numrecs(left);
4034 /* Delete the temp cursor, we're done with it. */
4035 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
4038 /* If here, we need to do a join to keep the tree balanced. */
4039 ASSERT(!xfs_btree_ptr_is_null(cur, &cptr));
4041 if (!xfs_btree_ptr_is_null(cur, &lptr) &&
4042 lrecs + xfs_btree_get_numrecs(block) <=
4043 cur->bc_ops->get_maxrecs(cur, level)) {
4045 * Set "right" to be the starting block,
4046 * "left" to be the left neighbor.
4051 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp);
4056 * If that won't work, see if we can join with the right neighbor block.
4058 } else if (!xfs_btree_ptr_is_null(cur, &rptr) &&
4059 rrecs + xfs_btree_get_numrecs(block) <=
4060 cur->bc_ops->get_maxrecs(cur, level)) {
4062 * Set "left" to be the starting block,
4063 * "right" to be the right neighbor.
4068 error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp);
4073 * Otherwise, we can't fix the imbalance.
4074 * Just return. This is probably a logic error, but it's not fatal.
4077 error = xfs_btree_dec_cursor(cur, level, stat);
4083 rrecs = xfs_btree_get_numrecs(right);
4084 lrecs = xfs_btree_get_numrecs(left);
4087 * We're now going to join "left" and "right" by moving all the stuff
4088 * in "right" to "left" and deleting "right".
4090 XFS_BTREE_STATS_ADD(cur, moves, rrecs);
4092 /* It's a non-leaf. Move keys and pointers. */
4093 union xfs_btree_key *lkp; /* left btree key */
4094 union xfs_btree_ptr *lpp; /* left address pointer */
4095 union xfs_btree_key *rkp; /* right btree key */
4096 union xfs_btree_ptr *rpp; /* right address pointer */
4098 lkp = xfs_btree_key_addr(cur, lrecs + 1, left);
4099 lpp = xfs_btree_ptr_addr(cur, lrecs + 1, left);
4100 rkp = xfs_btree_key_addr(cur, 1, right);
4101 rpp = xfs_btree_ptr_addr(cur, 1, right);
4103 for (i = 1; i < rrecs; i++) {
4104 error = xfs_btree_check_ptr(cur, rpp, i, level);
4109 xfs_btree_copy_keys(cur, lkp, rkp, rrecs);
4110 xfs_btree_copy_ptrs(cur, lpp, rpp, rrecs);
4112 xfs_btree_log_keys(cur, lbp, lrecs + 1, lrecs + rrecs);
4113 xfs_btree_log_ptrs(cur, lbp, lrecs + 1, lrecs + rrecs);
4115 /* It's a leaf. Move records. */
4116 union xfs_btree_rec *lrp; /* left record pointer */
4117 union xfs_btree_rec *rrp; /* right record pointer */
4119 lrp = xfs_btree_rec_addr(cur, lrecs + 1, left);
4120 rrp = xfs_btree_rec_addr(cur, 1, right);
4122 xfs_btree_copy_recs(cur, lrp, rrp, rrecs);
4123 xfs_btree_log_recs(cur, lbp, lrecs + 1, lrecs + rrecs);
4126 XFS_BTREE_STATS_INC(cur, join);
4129 * Fix up the number of records and right block pointer in the
4130 * surviving block, and log it.
4132 xfs_btree_set_numrecs(left, lrecs + rrecs);
4133 xfs_btree_get_sibling(cur, right, &cptr, XFS_BB_RIGHTSIB),
4134 xfs_btree_set_sibling(cur, left, &cptr, XFS_BB_RIGHTSIB);
4135 xfs_btree_log_block(cur, lbp, XFS_BB_NUMRECS | XFS_BB_RIGHTSIB);
4137 /* If there is a right sibling, point it to the remaining block. */
4138 xfs_btree_get_sibling(cur, left, &cptr, XFS_BB_RIGHTSIB);
4139 if (!xfs_btree_ptr_is_null(cur, &cptr)) {
4140 error = xfs_btree_read_buf_block(cur, &cptr, 0, &rrblock, &rrbp);
4143 xfs_btree_set_sibling(cur, rrblock, &lptr, XFS_BB_LEFTSIB);
4144 xfs_btree_log_block(cur, rrbp, XFS_BB_LEFTSIB);
4147 /* Free the deleted block. */
4148 error = xfs_btree_free_block(cur, rbp);
4153 * If we joined with the left neighbor, set the buffer in the
4154 * cursor to the left block, and fix up the index.
4157 cur->bc_bufs[level] = lbp;
4158 cur->bc_ptrs[level] += lrecs;
4159 cur->bc_ra[level] = 0;
4162 * If we joined with the right neighbor and there's a level above
4163 * us, increment the cursor at that level.
4165 else if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) ||
4166 (level + 1 < cur->bc_nlevels)) {
4167 error = xfs_btree_increment(cur, level + 1, &i);
4173 * Readjust the ptr at this level if it's not a leaf, since it's
4174 * still pointing at the deletion point, which makes the cursor
4175 * inconsistent. If this makes the ptr 0, the caller fixes it up.
4176 * We can't use decrement because it would change the next level up.
4179 cur->bc_ptrs[level]--;
4182 * We combined blocks, so we have to update the parent keys if the
4183 * btree supports overlapped intervals. However, bc_ptrs[level + 1]
4184 * points to the old block so that the caller knows which record to
4185 * delete. Therefore, the caller must be savvy enough to call updkeys
4186 * for us if we return stat == 2. The other exit points from this
4187 * function don't require deletions further up the tree, so they can
4188 * call updkeys directly.
4191 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
4192 /* Return value means the next level up has something to do. */
4197 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
4199 xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
4204 * Delete the record pointed to by cur.
4205 * The cursor refers to the place where the record was (could be inserted)
4206 * when the operation returns.
4210 struct xfs_btree_cur *cur,
4211 int *stat) /* success/failure */
4213 int error; /* error return value */
4216 bool joined = false;
4218 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
4221 * Go up the tree, starting at leaf level.
4223 * If 2 is returned then a join was done; go to the next level.
4224 * Otherwise we are done.
4226 for (level = 0, i = 2; i == 2; level++) {
4227 error = xfs_btree_delrec(cur, level, &i);
4235 * If we combined blocks as part of deleting the record, delrec won't
4236 * have updated the parent high keys so we have to do that here.
4238 if (joined && (cur->bc_flags & XFS_BTREE_OVERLAPPING)) {
4239 error = xfs_btree_updkeys_force(cur, 0);
4245 for (level = 1; level < cur->bc_nlevels; level++) {
4246 if (cur->bc_ptrs[level] == 0) {
4247 error = xfs_btree_decrement(cur, level, &i);
4255 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
4259 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
4264 * Get the data from the pointed-to record.
4268 struct xfs_btree_cur *cur, /* btree cursor */
4269 union xfs_btree_rec **recp, /* output: btree record */
4270 int *stat) /* output: success/failure */
4272 struct xfs_btree_block *block; /* btree block */
4273 struct xfs_buf *bp; /* buffer pointer */
4274 int ptr; /* record number */
4276 int error; /* error return value */
4279 ptr = cur->bc_ptrs[0];
4280 block = xfs_btree_get_block(cur, 0, &bp);
4283 error = xfs_btree_check_block(cur, block, 0, bp);
4289 * Off the right end or left end, return failure.
4291 if (ptr > xfs_btree_get_numrecs(block) || ptr <= 0) {
4297 * Point to the record and extract its data.
4299 *recp = xfs_btree_rec_addr(cur, ptr, block);
4304 /* Visit a block in a btree. */
4306 xfs_btree_visit_block(
4307 struct xfs_btree_cur *cur,
4309 xfs_btree_visit_blocks_fn fn,
4312 struct xfs_btree_block *block;
4314 union xfs_btree_ptr rptr;
4317 /* do right sibling readahead */
4318 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA);
4319 block = xfs_btree_get_block(cur, level, &bp);
4321 /* process the block */
4322 error = fn(cur, level, data);
4326 /* now read rh sibling block for next iteration */
4327 xfs_btree_get_sibling(cur, block, &rptr, XFS_BB_RIGHTSIB);
4328 if (xfs_btree_ptr_is_null(cur, &rptr))
4331 return xfs_btree_lookup_get_block(cur, level, &rptr, &block);
4335 /* Visit every block in a btree. */
4337 xfs_btree_visit_blocks(
4338 struct xfs_btree_cur *cur,
4339 xfs_btree_visit_blocks_fn fn,
4342 union xfs_btree_ptr lptr;
4344 struct xfs_btree_block *block = NULL;
4347 cur->bc_ops->init_ptr_from_cur(cur, &lptr);
4349 /* for each level */
4350 for (level = cur->bc_nlevels - 1; level >= 0; level--) {
4351 /* grab the left hand block */
4352 error = xfs_btree_lookup_get_block(cur, level, &lptr, &block);
4356 /* readahead the left most block for the next level down */
4358 union xfs_btree_ptr *ptr;
4360 ptr = xfs_btree_ptr_addr(cur, 1, block);
4361 xfs_btree_readahead_ptr(cur, ptr, 1);
4363 /* save for the next iteration of the loop */
4367 /* for each buffer in the level */
4369 error = xfs_btree_visit_block(cur, level, fn, data);
4372 if (error != -ENOENT)
4380 * Change the owner of a btree.
4382 * The mechanism we use here is ordered buffer logging. Because we don't know
4383 * how many buffers were are going to need to modify, we don't really want to
4384 * have to make transaction reservations for the worst case of every buffer in a
4385 * full size btree as that may be more space that we can fit in the log....
4387 * We do the btree walk in the most optimal manner possible - we have sibling
4388 * pointers so we can just walk all the blocks on each level from left to right
4389 * in a single pass, and then move to the next level and do the same. We can
4390 * also do readahead on the sibling pointers to get IO moving more quickly,
4391 * though for slow disks this is unlikely to make much difference to performance
4392 * as the amount of CPU work we have to do before moving to the next block is
4395 * For each btree block that we load, modify the owner appropriately, set the
4396 * buffer as an ordered buffer and log it appropriately. We need to ensure that
4397 * we mark the region we change dirty so that if the buffer is relogged in
4398 * a subsequent transaction the changes we make here as an ordered buffer are
4399 * correctly relogged in that transaction. If we are in recovery context, then
4400 * just queue the modified buffer as delayed write buffer so the transaction
4401 * recovery completion writes the changes to disk.
4403 struct xfs_btree_block_change_owner_info {
4404 __uint64_t new_owner;
4405 struct list_head *buffer_list;
4409 xfs_btree_block_change_owner(
4410 struct xfs_btree_cur *cur,
4414 struct xfs_btree_block_change_owner_info *bbcoi = data;
4415 struct xfs_btree_block *block;
4418 /* modify the owner */
4419 block = xfs_btree_get_block(cur, level, &bp);
4420 if (cur->bc_flags & XFS_BTREE_LONG_PTRS)
4421 block->bb_u.l.bb_owner = cpu_to_be64(bbcoi->new_owner);
4423 block->bb_u.s.bb_owner = cpu_to_be32(bbcoi->new_owner);
4426 * If the block is a root block hosted in an inode, we might not have a
4427 * buffer pointer here and we shouldn't attempt to log the change as the
4428 * information is already held in the inode and discarded when the root
4429 * block is formatted into the on-disk inode fork. We still change it,
4430 * though, so everything is consistent in memory.
4434 xfs_trans_ordered_buf(cur->bc_tp, bp);
4435 xfs_btree_log_block(cur, bp, XFS_BB_OWNER);
4437 xfs_buf_delwri_queue(bp, bbcoi->buffer_list);
4440 ASSERT(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE);
4441 ASSERT(level == cur->bc_nlevels - 1);
4448 xfs_btree_change_owner(
4449 struct xfs_btree_cur *cur,
4450 __uint64_t new_owner,
4451 struct list_head *buffer_list)
4453 struct xfs_btree_block_change_owner_info bbcoi;
4455 bbcoi.new_owner = new_owner;
4456 bbcoi.buffer_list = buffer_list;
4458 return xfs_btree_visit_blocks(cur, xfs_btree_block_change_owner,
4463 * xfs_btree_sblock_v5hdr_verify() -- verify the v5 fields of a short-format
4466 * @bp: buffer containing the btree block
4467 * @max_recs: pointer to the m_*_mxr max records field in the xfs mount
4468 * @pag_max_level: pointer to the per-ag max level field
4471 xfs_btree_sblock_v5hdr_verify(
4474 struct xfs_mount *mp = bp->b_target->bt_mount;
4475 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
4476 struct xfs_perag *pag = bp->b_pag;
4478 if (!xfs_sb_version_hascrc(&mp->m_sb))
4480 if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_meta_uuid))
4482 if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
4484 if (pag && be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
4490 * xfs_btree_sblock_verify() -- verify a short-format btree block
4492 * @bp: buffer containing the btree block
4493 * @max_recs: maximum records allowed in this btree node
4496 xfs_btree_sblock_verify(
4498 unsigned int max_recs)
4500 struct xfs_mount *mp = bp->b_target->bt_mount;
4501 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
4503 /* numrecs verification */
4504 if (be16_to_cpu(block->bb_numrecs) > max_recs)
4507 /* sibling pointer verification */
4508 if (!block->bb_u.s.bb_leftsib ||
4509 (be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
4510 block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
4512 if (!block->bb_u.s.bb_rightsib ||
4513 (be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
4514 block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
4521 * Calculate the number of btree levels needed to store a given number of
4522 * records in a short-format btree.
4525 xfs_btree_compute_maxlevels(
4526 struct xfs_mount *mp,
4531 unsigned long maxblocks;
4533 maxblocks = (len + limits[0] - 1) / limits[0];
4534 for (level = 1; maxblocks > 1; level++)
4535 maxblocks = (maxblocks + limits[1] - 1) / limits[1];
4540 * Query a regular btree for all records overlapping a given interval.
4541 * Start with a LE lookup of the key of low_rec and return all records
4542 * until we find a record with a key greater than the key of high_rec.
4545 xfs_btree_simple_query_range(
4546 struct xfs_btree_cur *cur,
4547 union xfs_btree_key *low_key,
4548 union xfs_btree_key *high_key,
4549 xfs_btree_query_range_fn fn,
4552 union xfs_btree_rec *recp;
4553 union xfs_btree_key rec_key;
4556 bool firstrec = true;
4559 ASSERT(cur->bc_ops->init_high_key_from_rec);
4560 ASSERT(cur->bc_ops->diff_two_keys);
4563 * Find the leftmost record. The btree cursor must be set
4564 * to the low record used to generate low_key.
4567 error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, &stat);
4572 /* Find the record. */
4573 error = xfs_btree_get_rec(cur, &recp, &stat);
4576 cur->bc_ops->init_high_key_from_rec(&rec_key, recp);
4578 /* Skip if high_key(rec) < low_key. */
4581 diff = cur->bc_ops->diff_two_keys(cur, low_key,
4587 /* Stop if high_key < low_key(rec). */
4588 diff = cur->bc_ops->diff_two_keys(cur, &rec_key, high_key);
4593 error = fn(cur, recp, priv);
4594 if (error < 0 || error == XFS_BTREE_QUERY_RANGE_ABORT)
4598 /* Move on to the next record. */
4599 error = xfs_btree_increment(cur, 0, &stat);
4609 * Query an overlapped interval btree for all records overlapping a given
4610 * interval. This function roughly follows the algorithm given in
4611 * "Interval Trees" of _Introduction to Algorithms_, which is section
4612 * 14.3 in the 2nd and 3rd editions.
4614 * First, generate keys for the low and high records passed in.
4616 * For any leaf node, generate the high and low keys for the record.
4617 * If the record keys overlap with the query low/high keys, pass the
4618 * record to the function iterator.
4620 * For any internal node, compare the low and high keys of each
4621 * pointer against the query low/high keys. If there's an overlap,
4622 * follow the pointer.
4624 * As an optimization, we stop scanning a block when we find a low key
4625 * that is greater than the query's high key.
4628 xfs_btree_overlapped_query_range(
4629 struct xfs_btree_cur *cur,
4630 union xfs_btree_key *low_key,
4631 union xfs_btree_key *high_key,
4632 xfs_btree_query_range_fn fn,
4635 union xfs_btree_ptr ptr;
4636 union xfs_btree_ptr *pp;
4637 union xfs_btree_key rec_key;
4638 union xfs_btree_key rec_hkey;
4639 union xfs_btree_key *lkp;
4640 union xfs_btree_key *hkp;
4641 union xfs_btree_rec *recp;
4642 struct xfs_btree_block *block;
4650 /* Load the root of the btree. */
4651 level = cur->bc_nlevels - 1;
4652 cur->bc_ops->init_ptr_from_cur(cur, &ptr);
4653 error = xfs_btree_lookup_get_block(cur, level, &ptr, &block);
4656 xfs_btree_get_block(cur, level, &bp);
4657 trace_xfs_btree_overlapped_query_range(cur, level, bp);
4659 error = xfs_btree_check_block(cur, block, level, bp);
4663 cur->bc_ptrs[level] = 1;
4665 while (level < cur->bc_nlevels) {
4666 block = xfs_btree_get_block(cur, level, &bp);
4668 /* End of node, pop back towards the root. */
4669 if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) {
4671 if (level < cur->bc_nlevels - 1)
4672 cur->bc_ptrs[level + 1]++;
4678 /* Handle a leaf node. */
4679 recp = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block);
4681 cur->bc_ops->init_high_key_from_rec(&rec_hkey, recp);
4682 ldiff = cur->bc_ops->diff_two_keys(cur, &rec_hkey,
4685 cur->bc_ops->init_key_from_rec(&rec_key, recp);
4686 hdiff = cur->bc_ops->diff_two_keys(cur, high_key,
4690 * If (record's high key >= query's low key) and
4691 * (query's high key >= record's low key), then
4692 * this record overlaps the query range; callback.
4694 if (ldiff >= 0 && hdiff >= 0) {
4695 error = fn(cur, recp, priv);
4697 error == XFS_BTREE_QUERY_RANGE_ABORT)
4699 } else if (hdiff < 0) {
4700 /* Record is larger than high key; pop. */
4703 cur->bc_ptrs[level]++;
4707 /* Handle an internal node. */
4708 lkp = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block);
4709 hkp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block);
4710 pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block);
4712 ldiff = cur->bc_ops->diff_two_keys(cur, hkp, low_key);
4713 hdiff = cur->bc_ops->diff_two_keys(cur, high_key, lkp);
4716 * If (pointer's high key >= query's low key) and
4717 * (query's high key >= pointer's low key), then
4718 * this record overlaps the query range; follow pointer.
4720 if (ldiff >= 0 && hdiff >= 0) {
4722 error = xfs_btree_lookup_get_block(cur, level, pp,
4726 xfs_btree_get_block(cur, level, &bp);
4727 trace_xfs_btree_overlapped_query_range(cur, level, bp);
4729 error = xfs_btree_check_block(cur, block, level, bp);
4733 cur->bc_ptrs[level] = 1;
4735 } else if (hdiff < 0) {
4736 /* The low key is larger than the upper range; pop. */
4739 cur->bc_ptrs[level]++;
4744 * If we don't end this function with the cursor pointing at a record
4745 * block, a subsequent non-error cursor deletion will not release
4746 * node-level buffers, causing a buffer leak. This is quite possible
4747 * with a zero-results range query, so release the buffers if we
4748 * failed to return any results.
4750 if (cur->bc_bufs[0] == NULL) {
4751 for (i = 0; i < cur->bc_nlevels; i++) {
4752 if (cur->bc_bufs[i]) {
4753 xfs_trans_brelse(cur->bc_tp, cur->bc_bufs[i]);
4754 cur->bc_bufs[i] = NULL;
4755 cur->bc_ptrs[i] = 0;
4765 * Query a btree for all records overlapping a given interval of keys. The
4766 * supplied function will be called with each record found; return one of the
4767 * XFS_BTREE_QUERY_RANGE_{CONTINUE,ABORT} values or the usual negative error
4768 * code. This function returns XFS_BTREE_QUERY_RANGE_ABORT, zero, or a
4769 * negative error code.
4772 xfs_btree_query_range(
4773 struct xfs_btree_cur *cur,
4774 union xfs_btree_irec *low_rec,
4775 union xfs_btree_irec *high_rec,
4776 xfs_btree_query_range_fn fn,
4779 union xfs_btree_rec rec;
4780 union xfs_btree_key low_key;
4781 union xfs_btree_key high_key;
4783 /* Find the keys of both ends of the interval. */
4784 cur->bc_rec = *high_rec;
4785 cur->bc_ops->init_rec_from_cur(cur, &rec);
4786 cur->bc_ops->init_key_from_rec(&high_key, &rec);
4788 cur->bc_rec = *low_rec;
4789 cur->bc_ops->init_rec_from_cur(cur, &rec);
4790 cur->bc_ops->init_key_from_rec(&low_key, &rec);
4792 /* Enforce low key < high key. */
4793 if (cur->bc_ops->diff_two_keys(cur, &low_key, &high_key) > 0)
4796 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))
4797 return xfs_btree_simple_query_range(cur, &low_key,
4798 &high_key, fn, priv);
4799 return xfs_btree_overlapped_query_range(cur, &low_key, &high_key,