28 #define LAST(node) ((node)->last)
55 usnic_uiom_interval_node_alloc(long int start, long int last, int ref_cnt,  in usnic_uiom_interval_node_alloc()  argument
64 	interval->last = last;  in usnic_uiom_interval_node_alloc()
89 					unsigned long last,  in find_intervals_intersection_sorted()  argument
96 	for (node = usnic_uiom_interval_tree_iter_first(root, start, last);  in find_intervals_intersection_sorted()
98 		node = usnic_uiom_interval_tree_iter_next(node, start, last))  in find_intervals_intersection_sorted()
104 int usnic_uiom_get_intervals_diff(unsigned long start, unsigned long last,  in usnic_uiom_get_intervals_diff()  argument
116 	find_intervals_intersection_sorted(root, start, last,  in usnic_uiom_get_intervals_diff()
132 		if (pivot > interval->last) {  in usnic_uiom_get_intervals_diff()
134 		} else if (pivot <= interval->last &&  in usnic_uiom_get_intervals_diff()
137 			pivot = interval->last + 1;  in usnic_uiom_get_intervals_diff()
141 	if (pivot <= last)  in usnic_uiom_get_intervals_diff()
142 		MAKE_NODE_AND_APPEND(tmp, pivot, last, 1, flags, err, err_out,  in usnic_uiom_get_intervals_diff()
164 				unsigned long last, int flags)  in usnic_uiom_insert_interval()  argument
174 	find_intervals_intersection_sorted(root, start, last,  in usnic_uiom_insert_interval()
183 		ilast = interval->last;  in usnic_uiom_insert_interval()
198 		if (ilast > last) {  in usnic_uiom_insert_interval()
199 			MAKE_NODE_AND_APPEND(tmp, lpivot, last, iref_cnt + 1,  in usnic_uiom_insert_interval()
202 			MAKE_NODE_AND_APPEND(tmp, last + 1, ilast, iref_cnt,  in usnic_uiom_insert_interval()
213 	if (lpivot <= last)  in usnic_uiom_insert_interval()
214 		MAKE_NODE_AND_APPEND(tmp, lpivot, last, 1, flags, err, err_out,  in usnic_uiom_insert_interval()
235 				unsigned long last, struct list_head *removed)  in usnic_uiom_remove_interval()  argument
239 	for (interval = usnic_uiom_interval_tree_iter_first(root, start, last);  in usnic_uiom_remove_interval()
243 									last)) {  in usnic_uiom_remove_interval()