Lines Matching +full:keys +full:- +full:per +full:- +full:group
1 /* SPDX-License-Identifier: GPL-2.0 */
3 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
28 * The in-core btree key. Overlapping btrees actually store two keys
29 * per pointer, so we reserve enough memory to hold both. The __*bigkey
52 * This nonsense is to make -wlint happy.
81 #define XFS_BB_ALL_BITS ((1u << XFS_BB_NUM_BITS) - 1)
83 #define XFS_BB_ALL_BITS_CRC ((1u << XFS_BB_NUM_BITS_CRC) - 1)
89 XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat)
91 XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val)
163 * Difference between key2 and key1 -- positive if key1 > key2,
186 * Are these two btree keys immediately adjacent?
188 * Given two btree keys @key1 and @key2, decide if it is impossible for
218 /* Per-AG btree information. */
236 /* Btree-in-inode cursor information */
259 #define XFS_BTCUR_LEFTRA (1 << 0) /* left sibling has been read-ahead */
260 #define XFS_BTCUR_RIGHTRA (1 << 1) /* right sibling has been read-ahead */
274 unsigned int bc_flags; /* btree features - below */
326 #define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr))
375 * Allocate a new one, copy the record, re-get the buffers.
396 * Long-form addressing.
408 * Read-ahead the block, don't wait for it, don't return a buffer.
409 * Long-form addressing.
419 * Read-ahead the block, don't wait for it, don't return a buffer.
420 * Short-form addressing.
425 xfs_agnumber_t agno, /* allocation group number */
426 xfs_agblock_t agbno, /* allocation group block number */
486 return be16_to_cpu(block->bb_numrecs); in xfs_btree_get_numrecs()
492 block->bb_numrecs = cpu_to_be16(numrecs); in xfs_btree_set_numrecs()
497 return be16_to_cpu(block->bb_level); in xfs_btree_get_level()
530 * iterating, and non-zero to stop iterating. Any non-zero value will be
531 * passed up to the _query_range caller. The special value -ECANCELED can be
603 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0; in xfs_btree_keycmp_lt()
612 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0; in xfs_btree_keycmp_gt()
621 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0; in xfs_btree_keycmp_eq()
659 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0; in xfs_btree_masked_keycmp_lt()
669 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0; in xfs_btree_masked_keycmp_gt()
693 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) in xfs_btree_islastblock()
694 return block->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK); in xfs_btree_islastblock()
695 return block->bb_u.s.bb_rightsib == cpu_to_be32(NULLAGBLOCK); in xfs_btree_islastblock()
726 cur->bc_tp = tp; in xfs_btree_alloc_cursor()
727 cur->bc_mp = mp; in xfs_btree_alloc_cursor()
728 cur->bc_btnum = btnum; in xfs_btree_alloc_cursor()
729 cur->bc_maxlevels = maxlevels; in xfs_btree_alloc_cursor()
730 cur->bc_cache = cache; in xfs_btree_alloc_cursor()