127 	struct xfs_iext_rec	recs[RECS_PER_LEAF];  member
146 	return &cur->leaf->recs[cur->pos];  in cur_rec()
223 		if (xfs_iext_rec_is_empty(&cur->leaf->recs[i]))  in xfs_iext_last()
386 		if (xfs_iext_rec_is_empty(&leaf->recs[i]))  in xfs_iext_leaf_nr_entries()
398 	return leaf->recs[n].lo & XFS_IEXT_STARTOFF_MASK;  in xfs_iext_leaf_key()
563 		new->recs[i] = leaf->recs[nr_keep + i];  in xfs_iext_split_leaf()
564 		xfs_iext_rec_clear(&leaf->recs[nr_keep + i]);  in xfs_iext_split_leaf()
666 		cur->leaf->recs[i] = cur->leaf->recs[i - 1];  in xfs_iext_insert()
813 				leaf->prev->recs[nr_prev + i] = leaf->recs[i];  in xfs_iext_rebalance_leaf()
833 				leaf->recs[nr_entries + i] =  in xfs_iext_rebalance_leaf()
834 					leaf->next->recs[i];  in xfs_iext_rebalance_leaf()
887 		leaf->recs[i] = leaf->recs[i + 1];  in xfs_iext_remove()
888 	xfs_iext_rec_clear(&leaf->recs[nr_entries]);  in xfs_iext_remove()