146 	return &cur->leaf->recs[cur->pos];  in cur_rec()
154 	if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp))  in xfs_iext_valid()
205 	cur->pos = 0;  in xfs_iext_first()
218 		cur->pos = 0;  in xfs_iext_last()
226 	cur->pos = i - 1;  in xfs_iext_last()
235 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_next()
240 	ASSERT(cur->pos >= 0);  in xfs_iext_next()
241 	ASSERT(cur->pos < xfs_iext_max_recs(ifp));  in xfs_iext_next()
243 	cur->pos++;  in xfs_iext_next()
247 		cur->pos = 0;  in xfs_iext_next()
257 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_prev()
262 	ASSERT(cur->pos >= 0);  in xfs_iext_prev()
263 	ASSERT(cur->pos <= RECS_PER_LEAF);  in xfs_iext_prev()
267 		cur->pos--;  in xfs_iext_prev()
270 	} while (cur->pos > 0);  in xfs_iext_prev()
274 		cur->pos = RECS_PER_LEAF;  in xfs_iext_prev()
457 	int			*pos,  in xfs_iext_split_node()  argument
467 	if (*pos == KEYS_PER_NODE) {  in xfs_iext_split_node()
469 		*pos = 0;  in xfs_iext_split_node()
483 	if (*pos >= nr_keep) {  in xfs_iext_split_node()
485 		*pos -= nr_keep;  in xfs_iext_split_node()
504 	int			i, pos, nr_entries;  in xfs_iext_insert_node()  local
512 	pos = xfs_iext_node_insert_pos(node, offset);  in xfs_iext_insert_node()
513 	nr_entries = xfs_iext_node_nr_entries(node, pos);  in xfs_iext_insert_node()
515 	ASSERT(pos >= nr_entries || xfs_iext_key_cmp(node, pos, offset) != 0);  in xfs_iext_insert_node()
519 		new = xfs_iext_split_node(&node, &pos, &nr_entries);  in xfs_iext_insert_node()
525 	if (node != new && pos == 0 && nr_entries > 0)  in xfs_iext_insert_node()
528 	for (i = nr_entries; i > pos; i--) {  in xfs_iext_insert_node()
532 	node->keys[pos] = offset;  in xfs_iext_insert_node()
533 	node->ptrs[pos] = ptr;  in xfs_iext_insert_node()
555 	if (cur->pos == RECS_PER_LEAF) {  in xfs_iext_split_leaf()
557 		cur->pos = 0;  in xfs_iext_split_leaf()
567 	if (cur->pos >= nr_keep) {  in xfs_iext_split_leaf()
569 		cur->pos -= nr_keep;  in xfs_iext_split_leaf()
595 	cur->pos = 0;  in xfs_iext_alloc_root()
648 	nr_entries = xfs_iext_leaf_nr_entries(ifp, cur->leaf, cur->pos);  in xfs_iext_insert()
650 	ASSERT(cur->pos >= nr_entries ||  in xfs_iext_insert()
660 	if (cur->leaf != new && cur->pos == 0 && nr_entries > 0) {  in xfs_iext_insert()
665 	for (i = nr_entries; i > cur->pos; i--)  in xfs_iext_insert()
679 	int			*pos,  in xfs_iext_rebalance_node()  argument
691 	if (*pos > 0) {  in xfs_iext_rebalance_node()
692 		struct xfs_iext_node *prev = parent->ptrs[*pos - 1];  in xfs_iext_rebalance_node()
704 	if (*pos + 1 < xfs_iext_node_nr_entries(parent, *pos)) {  in xfs_iext_rebalance_node()
705 		struct xfs_iext_node *next = parent->ptrs[*pos + 1];  in xfs_iext_rebalance_node()
719 			++*pos;  in xfs_iext_rebalance_node()
734 	int			level = 2, pos, nr_entries, i;  in xfs_iext_remove_node()  local
738 	pos = xfs_iext_node_pos(node, offset);  in xfs_iext_remove_node()
740 	ASSERT(node->ptrs[pos]);  in xfs_iext_remove_node()
741 	ASSERT(node->ptrs[pos] == victim);  in xfs_iext_remove_node()
744 	nr_entries = xfs_iext_node_nr_entries(node, pos) - 1;  in xfs_iext_remove_node()
746 	for (i = pos; i < nr_entries; i++) {  in xfs_iext_remove_node()
753 	if (pos == 0 && nr_entries > 0) {  in xfs_iext_remove_node()
769 		pos = xfs_iext_node_pos(parent, offset);  in xfs_iext_remove_node()
771 		ASSERT(pos != KEYS_PER_NODE);  in xfs_iext_remove_node()
772 		ASSERT(parent->ptrs[pos] == node);  in xfs_iext_remove_node()
774 		node = xfs_iext_rebalance_node(parent, &pos, node, nr_entries);  in xfs_iext_remove_node()
817 				cur->pos += nr_prev;  in xfs_iext_rebalance_leaf()
839 				cur->pos += nr_entries;  in xfs_iext_rebalance_leaf()
885 	nr_entries = xfs_iext_leaf_nr_entries(ifp, leaf, cur->pos) - 1;  in xfs_iext_remove()
886 	for (i = cur->pos; i < nr_entries; i++)  in xfs_iext_remove()
891 	if (cur->pos == 0 && nr_entries > 0) {  in xfs_iext_remove()
895 	} else if (cur->pos == nr_entries) {  in xfs_iext_remove()
900 		cur->pos = 0;  in xfs_iext_remove()
935 		cur->pos = 0;  in xfs_iext_lookup_extent()
939 	for (cur->pos = 0; cur->pos < xfs_iext_max_recs(ifp); cur->pos++) {  in xfs_iext_lookup_extent()
952 	cur->pos = 0;  in xfs_iext_lookup_extent()
993 	if (cur->pos == 0) {  in xfs_iext_update_extent()