142 	return &cur->leaf->recs[cur->pos];  in cur_rec()
150 	if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp))  in xfs_iext_valid()
201 	cur->pos = 0;  in xfs_iext_first()
214 		cur->pos = 0;  in xfs_iext_last()
222 	cur->pos = i - 1;  in xfs_iext_last()
231 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_next()
236 	ASSERT(cur->pos >= 0);  in xfs_iext_next()
237 	ASSERT(cur->pos < xfs_iext_max_recs(ifp));  in xfs_iext_next()
239 	cur->pos++;  in xfs_iext_next()
243 		cur->pos = 0;  in xfs_iext_next()
253 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_prev()
258 	ASSERT(cur->pos >= 0);  in xfs_iext_prev()
259 	ASSERT(cur->pos <= RECS_PER_LEAF);  in xfs_iext_prev()
263 		cur->pos--;  in xfs_iext_prev()
266 	} while (cur->pos > 0);  in xfs_iext_prev()
270 		cur->pos = RECS_PER_LEAF;  in xfs_iext_prev()
453 	int			*pos,  in xfs_iext_split_node()  argument
463 	if (*pos == KEYS_PER_NODE) {  in xfs_iext_split_node()
465 		*pos = 0;  in xfs_iext_split_node()
479 	if (*pos >= nr_keep) {  in xfs_iext_split_node()
481 		*pos -= nr_keep;  in xfs_iext_split_node()
500 	int			i, pos, nr_entries;  in xfs_iext_insert_node()  local
508 	pos = xfs_iext_node_insert_pos(node, offset);  in xfs_iext_insert_node()
509 	nr_entries = xfs_iext_node_nr_entries(node, pos);  in xfs_iext_insert_node()
511 	ASSERT(pos >= nr_entries || xfs_iext_key_cmp(node, pos, offset) != 0);  in xfs_iext_insert_node()
515 		new = xfs_iext_split_node(&node, &pos, &nr_entries);  in xfs_iext_insert_node()
521 	if (node != new && pos == 0 && nr_entries > 0)  in xfs_iext_insert_node()
524 	for (i = nr_entries; i > pos; i--) {  in xfs_iext_insert_node()
528 	node->keys[pos] = offset;  in xfs_iext_insert_node()
529 	node->ptrs[pos] = ptr;  in xfs_iext_insert_node()
551 	if (cur->pos == RECS_PER_LEAF) {  in xfs_iext_split_leaf()
553 		cur->pos = 0;  in xfs_iext_split_leaf()
563 	if (cur->pos >= nr_keep) {  in xfs_iext_split_leaf()
565 		cur->pos -= nr_keep;  in xfs_iext_split_leaf()
591 	cur->pos = 0;  in xfs_iext_alloc_root()
643 	nr_entries = xfs_iext_leaf_nr_entries(ifp, cur->leaf, cur->pos);  in xfs_iext_insert()
645 	ASSERT(cur->pos >= nr_entries ||  in xfs_iext_insert()
655 	if (cur->leaf != new && cur->pos == 0 && nr_entries > 0) {  in xfs_iext_insert()
660 	for (i = nr_entries; i > cur->pos; i--)  in xfs_iext_insert()
674 	int			*pos,  in xfs_iext_rebalance_node()  argument
686 	if (*pos > 0) {  in xfs_iext_rebalance_node()
687 		struct xfs_iext_node *prev = parent->ptrs[*pos - 1];  in xfs_iext_rebalance_node()
699 	if (*pos + 1 < xfs_iext_node_nr_entries(parent, *pos)) {  in xfs_iext_rebalance_node()
700 		struct xfs_iext_node *next = parent->ptrs[*pos + 1];  in xfs_iext_rebalance_node()
714 			++*pos;  in xfs_iext_rebalance_node()
729 	int			level = 2, pos, nr_entries, i;  in xfs_iext_remove_node()  local
733 	pos = xfs_iext_node_pos(node, offset);  in xfs_iext_remove_node()
735 	ASSERT(node->ptrs[pos]);  in xfs_iext_remove_node()
736 	ASSERT(node->ptrs[pos] == victim);  in xfs_iext_remove_node()
739 	nr_entries = xfs_iext_node_nr_entries(node, pos) - 1;  in xfs_iext_remove_node()
741 	for (i = pos; i < nr_entries; i++) {  in xfs_iext_remove_node()
748 	if (pos == 0 && nr_entries > 0) {  in xfs_iext_remove_node()
764 		pos = xfs_iext_node_pos(parent, offset);  in xfs_iext_remove_node()
766 		ASSERT(pos != KEYS_PER_NODE);  in xfs_iext_remove_node()
767 		ASSERT(parent->ptrs[pos] == node);  in xfs_iext_remove_node()
769 		node = xfs_iext_rebalance_node(parent, &pos, node, nr_entries);  in xfs_iext_remove_node()
812 				cur->pos += nr_prev;  in xfs_iext_rebalance_leaf()
834 				cur->pos += nr_entries;  in xfs_iext_rebalance_leaf()
880 	nr_entries = xfs_iext_leaf_nr_entries(ifp, leaf, cur->pos) - 1;  in xfs_iext_remove()
881 	for (i = cur->pos; i < nr_entries; i++)  in xfs_iext_remove()
886 	if (cur->pos == 0 && nr_entries > 0) {  in xfs_iext_remove()
890 	} else if (cur->pos == nr_entries) {  in xfs_iext_remove()
895 		cur->pos = 0;  in xfs_iext_remove()
930 		cur->pos = 0;  in xfs_iext_lookup_extent()
934 	for (cur->pos = 0; cur->pos < xfs_iext_max_recs(ifp); cur->pos++) {  in xfs_iext_lookup_extent()
947 	cur->pos = 0;  in xfs_iext_lookup_extent()
988 	if (cur->pos == 0) {  in xfs_iext_update_extent()