Lines Matching refs:j
245 int i, j; in basic_check() local
256 for (j = 0; j < nnodes; j++) in basic_check()
257 insert(nodes + j, &root); in basic_check()
258 for (j = 0; j < nnodes; j++) in basic_check()
259 erase(nodes + j, &root); in basic_check()
272 for (j = 0; j < nnodes; j++) in basic_check()
273 insert_cached(nodes + j, &root); in basic_check()
274 for (j = 0; j < nnodes; j++) in basic_check()
275 erase_cached(nodes + j, &root); in basic_check()
331 for (j = 0; j < nnodes; j++) { in basic_check()
332 check(j); in basic_check()
333 insert(nodes + j, &root); in basic_check()
335 for (j = 0; j < nnodes; j++) { in basic_check()
336 check(nnodes - j); in basic_check()
337 erase(nodes + j, &root); in basic_check()
347 int i, j; in augmented_check() local
357 for (j = 0; j < nnodes; j++) in augmented_check()
358 insert_augmented(nodes + j, &root); in augmented_check()
359 for (j = 0; j < nnodes; j++) in augmented_check()
360 erase_augmented(nodes + j, &root); in augmented_check()
372 for (j = 0; j < nnodes; j++) in augmented_check()
373 insert_augmented_cached(nodes + j, &root); in augmented_check()
374 for (j = 0; j < nnodes; j++) in augmented_check()
375 erase_augmented_cached(nodes + j, &root); in augmented_check()
386 for (j = 0; j < nnodes; j++) { in augmented_check()
387 check_augmented(j); in augmented_check()
388 insert_augmented(nodes + j, &root); in augmented_check()
390 for (j = 0; j < nnodes; j++) { in augmented_check()
391 check_augmented(nnodes - j); in augmented_check()
392 erase_augmented(nodes + j, &root); in augmented_check()