33 search(struct rb_root_cached *root, unsigned long start, unsigned long last)  in search()  argument
38 	for (node = interval_tree_iter_first(root, start, last); node;  in search()
39 	     node = interval_tree_iter_next(node, start, last))  in search()
53 		nodes[i].last = b;  in init()
111 			unsigned long last = search_all ? max_endpoint : queries[j];  in search_check()  local
113 			results += search(&root, start, last);  in search_check()
133 	unsigned long start, last;  in intersection_range_check()  local
164 				last = ULONG_MAX;  in intersection_range_check()
166 				last = (prandom_u32_state(&rnd) >> 4) % max_endpoint;  in intersection_range_check()
167 				start = (prandom_u32_state(&rnd) >> 4) % last;  in intersection_range_check()
175 				if (start <= node->last && last >= node->start)  in intersection_range_check()
181 			for (node = interval_tree_iter_first(&root, start, last); node;  in intersection_range_check()
182 			     node = interval_tree_iter_next(node, start, last))  in intersection_range_check()
220 		cur_last = mas->last > state->last_index ?  in mas_cur_span()
221 				state->last_index : mas->last;  in mas_cur_span()
243 	unsigned long start, last;  in span_iteration_check()  local
264 					nodes[j].last, nodes + j, GFP_KERNEL));  in span_iteration_check()
271 				last = ULONG_MAX;  in span_iteration_check()
273 				last = (prandom_u32_state(&rnd) >> 4) % max_endpoint;  in span_iteration_check()
274 				start = (prandom_u32_state(&rnd) >> 4) % last;  in span_iteration_check()
278 			mas_span.last_index = last;  in span_iteration_check()
282 			interval_tree_for_each_span(&span, &root, start, last) {  in span_iteration_check()