Lines Matching refs:j
244 int i, j; in rbtree_test_init() local
260 for (j = 0; j < nnodes; j++) in rbtree_test_init()
261 insert(nodes + j, &root); in rbtree_test_init()
262 for (j = 0; j < nnodes; j++) in rbtree_test_init()
263 erase(nodes + j, &root); in rbtree_test_init()
276 for (j = 0; j < nnodes; j++) in rbtree_test_init()
277 insert_cached(nodes + j, &root); in rbtree_test_init()
278 for (j = 0; j < nnodes; j++) in rbtree_test_init()
279 erase_cached(nodes + j, &root); in rbtree_test_init()
335 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
336 check(j); in rbtree_test_init()
337 insert(nodes + j, &root); in rbtree_test_init()
339 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
340 check(nnodes - j); in rbtree_test_init()
341 erase(nodes + j, &root); in rbtree_test_init()
353 for (j = 0; j < nnodes; j++) in rbtree_test_init()
354 insert_augmented(nodes + j, &root); in rbtree_test_init()
355 for (j = 0; j < nnodes; j++) in rbtree_test_init()
356 erase_augmented(nodes + j, &root); in rbtree_test_init()
368 for (j = 0; j < nnodes; j++) in rbtree_test_init()
369 insert_augmented_cached(nodes + j, &root); in rbtree_test_init()
370 for (j = 0; j < nnodes; j++) in rbtree_test_init()
371 erase_augmented_cached(nodes + j, &root); in rbtree_test_init()
382 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
383 check_augmented(j); in rbtree_test_init()
384 insert_augmented(nodes + j, &root); in rbtree_test_init()
386 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
387 check_augmented(nnodes - j); in rbtree_test_init()
388 erase_augmented(nodes + j, &root); in rbtree_test_init()