Lines Matching refs:j
67 int i, j; in basic_check() local
77 for (j = 0; j < nnodes; j++) in basic_check()
78 interval_tree_insert(nodes + j, &root); in basic_check()
79 for (j = 0; j < nnodes; j++) in basic_check()
80 interval_tree_remove(nodes + j, &root); in basic_check()
94 int i, j; in search_check() local
102 for (j = 0; j < nnodes; j++) in search_check()
103 interval_tree_insert(nodes + j, &root); in search_check()
109 for (j = 0; j < nsearches; j++) { in search_check()
110 unsigned long start = search_all ? 0 : queries[j]; in search_check()
111 unsigned long last = search_all ? max_endpoint : queries[j]; in search_check()
124 for (j = 0; j < nnodes; j++) in search_check()
125 interval_tree_remove(nodes + j, &root); in search_check()
132 int i, j, k; in intersection_range_check() local
156 for (j = 0; j < nnodes; j++) in intersection_range_check()
157 interval_tree_insert(nodes + j, &root); in intersection_range_check()
172 for (j = 0; j < nnodes; j++) { in intersection_range_check()
173 node = nodes + j; in intersection_range_check()
176 bitmap_set(intxn1, j, 1); in intersection_range_check()
188 for (j = 0; j < nnodes; j++) in intersection_range_check()
189 interval_tree_remove(nodes + j, &root); in intersection_range_check()
242 int i, j, k; in span_iteration_check() local
255 for (j = 0; j < nnodes; j++) in span_iteration_check()
256 interval_tree_insert(nodes + j, &root); in span_iteration_check()
262 for (j = 0; j < nnodes; j++) in span_iteration_check()
263 WARN_ON_ONCE(mtree_store_range(&tree, nodes[j].start, in span_iteration_check()
264 nodes[j].last, nodes + j, GFP_KERNEL)); in span_iteration_check()
303 for (j = 0; j < nnodes; j++) in span_iteration_check()
304 interval_tree_remove(nodes + j, &root); in span_iteration_check()