91 	RECS_PER_LEAF	= (NODE_SIZE - (2 * sizeof(struct xfs_iext_leaf *))) /  enumerator
123 	struct xfs_iext_rec	recs[RECS_PER_LEAF];
137 	return RECS_PER_LEAF;  in xfs_iext_max_recs()
231 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_next()
253 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_prev()
259 	ASSERT(cur->pos <= RECS_PER_LEAF);  in xfs_iext_prev()
270 		cur->pos = RECS_PER_LEAF;  in xfs_iext_prev()
553 	const int		nr_move = RECS_PER_LEAF / 2;  in xfs_iext_split_leaf()
554 	int			nr_keep = nr_move + (RECS_PER_LEAF & 1);  in xfs_iext_split_leaf()
558 	if (cur->pos == RECS_PER_LEAF) {  in xfs_iext_split_leaf()
610 	if (new_size / sizeof(struct xfs_iext_rec) == RECS_PER_LEAF)  in xfs_iext_realloc_root()
650 	ASSERT(nr_entries <= RECS_PER_LEAF);  in xfs_iext_insert_raw()
654 	if (nr_entries == RECS_PER_LEAF)  in xfs_iext_insert_raw()
823 		if (nr_prev + nr_entries <= RECS_PER_LEAF) {  in xfs_iext_rebalance_leaf()
838 		if (nr_entries + nr_next <= RECS_PER_LEAF) {  in xfs_iext_rebalance_leaf()
915 	if (nr_entries >= RECS_PER_LEAF / 2)  in xfs_iext_remove()