140 static inline struct xfs_iext_rec *cur_rec(struct xfs_iext_cursor *cur)  in cur_rec()  argument
142 	return &cur->leaf->recs[cur->pos];  in cur_rec()
146 		struct xfs_iext_cursor *cur)  in xfs_iext_valid()  argument
148 	if (!cur->leaf)  in xfs_iext_valid()
150 	if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp))  in xfs_iext_valid()
152 	if (xfs_iext_rec_is_empty(cur_rec(cur)))  in xfs_iext_valid()
199 	struct xfs_iext_cursor	*cur)  in xfs_iext_first()  argument
201 	cur->pos = 0;  in xfs_iext_first()
202 	cur->leaf = xfs_iext_find_first_leaf(ifp);  in xfs_iext_first()
208 	struct xfs_iext_cursor	*cur)  in xfs_iext_last()  argument
212 	cur->leaf = xfs_iext_find_last_leaf(ifp);  in xfs_iext_last()
213 	if (!cur->leaf) {  in xfs_iext_last()
214 		cur->pos = 0;  in xfs_iext_last()
219 		if (xfs_iext_rec_is_empty(&cur->leaf->recs[i]))  in xfs_iext_last()
222 	cur->pos = i - 1;  in xfs_iext_last()
228 	struct xfs_iext_cursor	*cur)  in xfs_iext_next()  argument
230 	if (!cur->leaf) {  in xfs_iext_next()
231 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_next()
232 		xfs_iext_first(ifp, cur);  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()
240 	if (ifp->if_height > 1 && !xfs_iext_valid(ifp, cur) &&  in xfs_iext_next()
241 	    cur->leaf->next) {  in xfs_iext_next()
242 		cur->leaf = cur->leaf->next;  in xfs_iext_next()
243 		cur->pos = 0;  in xfs_iext_next()
250 	struct xfs_iext_cursor	*cur)  in xfs_iext_prev()  argument
252 	if (!cur->leaf) {  in xfs_iext_prev()
253 		ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);  in xfs_iext_prev()
254 		xfs_iext_last(ifp, cur);  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()
264 		if (xfs_iext_valid(ifp, cur))  in xfs_iext_prev()
266 	} while (cur->pos > 0);  in xfs_iext_prev()
268 	if (ifp->if_height > 1 && cur->leaf->prev) {  in xfs_iext_prev()
269 		cur->leaf = cur->leaf->prev;  in xfs_iext_prev()
270 		cur->pos = RECS_PER_LEAF;  in xfs_iext_prev()
548 	struct xfs_iext_cursor	*cur,  in xfs_iext_split_leaf()  argument
551 	struct xfs_iext_leaf	*leaf = cur->leaf;  in xfs_iext_split_leaf()
558 	if (cur->pos == RECS_PER_LEAF) {  in xfs_iext_split_leaf()
559 		cur->leaf = new;  in xfs_iext_split_leaf()
560 		cur->pos = 0;  in xfs_iext_split_leaf()
570 	if (cur->pos >= nr_keep) {  in xfs_iext_split_leaf()
571 		cur->leaf = new;  in xfs_iext_split_leaf()
572 		cur->pos -= nr_keep;  in xfs_iext_split_leaf()
589 	struct xfs_iext_cursor	*cur)  in xfs_iext_alloc_root()  argument
597 	cur->leaf = ifp->if_data;  in xfs_iext_alloc_root()
598 	cur->pos = 0;  in xfs_iext_alloc_root()
604 	struct xfs_iext_cursor	*cur)  in xfs_iext_realloc_root()  argument
617 	cur->leaf = new;  in xfs_iext_realloc_root()
635 	struct xfs_iext_cursor	*cur,  in xfs_iext_insert_raw()  argument
645 		xfs_iext_alloc_root(ifp, cur);  in xfs_iext_insert_raw()
647 		xfs_iext_realloc_root(ifp, cur);  in xfs_iext_insert_raw()
649 	nr_entries = xfs_iext_leaf_nr_entries(ifp, cur->leaf, cur->pos);  in xfs_iext_insert_raw()
651 	ASSERT(cur->pos >= nr_entries ||  in xfs_iext_insert_raw()
652 	       xfs_iext_rec_cmp(cur_rec(cur), irec->br_startoff) != 0);  in xfs_iext_insert_raw()
655 		new = xfs_iext_split_leaf(cur, &nr_entries);  in xfs_iext_insert_raw()
661 	if (cur->leaf != new && cur->pos == 0 && nr_entries > 0) {  in xfs_iext_insert_raw()
662 		xfs_iext_update_node(ifp, xfs_iext_leaf_key(cur->leaf, 0),  in xfs_iext_insert_raw()
663 				offset, 1, cur->leaf);  in xfs_iext_insert_raw()
666 	for (i = nr_entries; i > cur->pos; i--)  in xfs_iext_insert_raw()
667 		cur->leaf->recs[i] = cur->leaf->recs[i - 1];  in xfs_iext_insert_raw()
668 	xfs_iext_set(cur_rec(cur), irec);  in xfs_iext_insert_raw()
678 	struct xfs_iext_cursor	*cur,  in xfs_iext_insert()  argument
684 	xfs_iext_insert_raw(ifp, cur, irec);  in xfs_iext_insert()
685 	trace_xfs_iext_insert(ip, cur, state, _RET_IP_);  in xfs_iext_insert()
807 	struct xfs_iext_cursor	*cur,  in xfs_iext_rebalance_leaf()  argument
827 			if (cur->leaf == leaf) {  in xfs_iext_rebalance_leaf()
828 				cur->leaf = leaf->prev;  in xfs_iext_rebalance_leaf()
829 				cur->pos += nr_prev;  in xfs_iext_rebalance_leaf()
849 			if (cur->leaf == leaf->next) {  in xfs_iext_rebalance_leaf()
850 				cur->leaf = leaf;  in xfs_iext_rebalance_leaf()
851 				cur->pos += nr_entries;  in xfs_iext_rebalance_leaf()
881 	struct xfs_iext_cursor	*cur,  in xfs_iext_remove()  argument
885 	struct xfs_iext_leaf	*leaf = cur->leaf;  in xfs_iext_remove()
889 	trace_xfs_iext_remove(ip, cur, state, _RET_IP_);  in xfs_iext_remove()
893 	ASSERT(xfs_iext_valid(ifp, cur));  in xfs_iext_remove()
897 	nr_entries = xfs_iext_leaf_nr_entries(ifp, leaf, cur->pos) - 1;  in xfs_iext_remove()
898 	for (i = cur->pos; i < nr_entries; i++)  in xfs_iext_remove()
903 	if (cur->pos == 0 && nr_entries > 0) {  in xfs_iext_remove()
907 	} else if (cur->pos == nr_entries) {  in xfs_iext_remove()
909 			cur->leaf = leaf->next;  in xfs_iext_remove()
911 			cur->leaf = NULL;  in xfs_iext_remove()
912 		cur->pos = 0;  in xfs_iext_remove()
919 		xfs_iext_rebalance_leaf(ifp, cur, leaf, offset, nr_entries);  in xfs_iext_remove()
940 	struct xfs_iext_cursor	*cur,  in xfs_iext_lookup_extent()  argument
945 	cur->leaf = xfs_iext_find_level(ifp, offset, 1);  in xfs_iext_lookup_extent()
946 	if (!cur->leaf) {  in xfs_iext_lookup_extent()
947 		cur->pos = 0;  in xfs_iext_lookup_extent()
951 	for (cur->pos = 0; cur->pos < xfs_iext_max_recs(ifp); cur->pos++) {  in xfs_iext_lookup_extent()
952 		struct xfs_iext_rec *rec = cur_rec(cur);  in xfs_iext_lookup_extent()
961 	if (ifp->if_height == 1 || !cur->leaf->next)  in xfs_iext_lookup_extent()
963 	cur->leaf = cur->leaf->next;  in xfs_iext_lookup_extent()
964 	cur->pos = 0;  in xfs_iext_lookup_extent()
965 	if (!xfs_iext_valid(ifp, cur))  in xfs_iext_lookup_extent()
968 	xfs_iext_get(gotp, cur_rec(cur));  in xfs_iext_lookup_extent()
981 	struct xfs_iext_cursor	*cur,  in xfs_iext_lookup_extent_before()  argument
985 	if (xfs_iext_lookup_extent(ip, ifp, *end - 1, cur, gotp) &&  in xfs_iext_lookup_extent_before()
988 	if (!xfs_iext_prev_extent(ifp, cur, gotp))  in xfs_iext_lookup_extent_before()
998 	struct xfs_iext_cursor	*cur,  in xfs_iext_update_extent()  argument
1005 	if (cur->pos == 0) {  in xfs_iext_update_extent()
1008 		xfs_iext_get(&old, cur_rec(cur));  in xfs_iext_update_extent()
1011 					new->br_startoff, 1, cur->leaf);  in xfs_iext_update_extent()
1015 	trace_xfs_bmap_pre_update(ip, cur, state, _RET_IP_);  in xfs_iext_update_extent()
1016 	xfs_iext_set(cur_rec(cur), new);  in xfs_iext_update_extent()
1017 	trace_xfs_bmap_post_update(ip, cur, state, _RET_IP_);  in xfs_iext_update_extent()
1027 	struct xfs_iext_cursor	*cur,  in xfs_iext_get_extent()  argument
1030 	if (!xfs_iext_valid(ifp, cur))  in xfs_iext_get_extent()
1032 	xfs_iext_get(gotp, cur_rec(cur));  in xfs_iext_get_extent()