Lines Matching defs:j
68 int i, j;
78 for (j = 0; j < nnodes; j++)
79 interval_tree_insert(nodes + j, &root);
80 for (j = 0; j < nnodes; j++)
81 interval_tree_remove(nodes + j, &root);
95 int i, j;
103 for (j = 0; j < nnodes; j++)
104 interval_tree_insert(nodes + j, &root);
110 for (j = 0; j < nsearches; j++) {
111 unsigned long start = search_all ? 0 : queries[j];
112 unsigned long last = search_all ? max_endpoint : queries[j];
125 for (j = 0; j < nnodes; j++)
126 interval_tree_remove(nodes + j, &root);
133 int i, j, k;
157 for (j = 0; j < nnodes; j++)
158 interval_tree_insert(nodes + j, &root);
173 for (j = 0; j < nnodes; j++) {
174 node = nodes + j;
177 bitmap_set(intxn1, j, 1);
189 for (j = 0; j < nnodes; j++)
190 interval_tree_remove(nodes + j, &root);
243 int i, j, k;
256 for (j = 0; j < nnodes; j++)
257 interval_tree_insert(nodes + j, &root);
263 for (j = 0; j < nnodes; j++)
264 WARN_ON_ONCE(mtree_store_range(&tree, nodes[j].start,
265 nodes[j].last, nodes + j, GFP_KERNEL));
304 for (j = 0; j < nnodes; j++)
305 interval_tree_remove(nodes + j, &root);