Lines Matching defs:sibling
55 * These sibling pointer checks are optimised for null sibling pointers. This
56 * happens a lot, and we don't need to byte swap at runtime if the sibling
62 * two sibling check functions reduces the compiled code size by over 300
73 xfs_fsblock_t sibling;
78 sibling = be64_to_cpu(dsibling);
79 if (sibling == fsb)
82 if (!xfs_btree_check_lptr(cur, sibling, level + 1))
85 if (!xfs_verify_fsbno(mp, sibling))
100 xfs_agblock_t sibling;
105 sibling = be32_to_cpu(dsibling);
106 if (sibling == agbno)
109 if (!xfs_btree_check_sptr(cur, sibling, level + 1))
112 if (!xfs_verify_agbno(pag, sibling))
1111 * Get/set/init sibling pointers
2348 /* If we've got no left sibling then we can't shift an entry left. */
2543 /* If we've got no right sibling then we can't shift an entry right. */
2690 union xfs_btree_ptr lptr; /* left sibling block ptr */
2693 union xfs_btree_ptr rptr; /* right sibling block ptr */
2696 union xfs_btree_ptr rrptr; /* right-right sibling ptr */
2802 * Adjust sibling pointers.
3732 union xfs_btree_ptr lptr; /* left sibling block ptr */
3737 union xfs_btree_ptr rptr; /* right sibling block ptr */
3888 * tree balanced. Look at the left and right sibling blocks to
3924 * If there's a right sibling, see if it's ok to shift an entry
4010 * If there's a left sibling, see if it's ok to shift an entry
4176 /* If there is a right sibling, point it to the remaining block. */
4350 /* do right sibling readahead */
4359 /* now read rh sibling block for next iteration */
4367 * return the same block without checking if the right sibling points
4441 * We do the btree walk in the most optimal manner possible - we have sibling
4444 * also do readahead on the sibling pointers to get IO moving more quickly,
4560 /* sibling pointer verification */
4615 /* sibling pointer verification */