246 	int i, j;  in rbtree_test_init()  local
262 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
263 			insert(nodes + j, &root);  in rbtree_test_init()
264 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
265 			erase(nodes + j, &root);  in rbtree_test_init()
278 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
279 			insert_cached(nodes + j, &root);  in rbtree_test_init()
280 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
281 			erase_cached(nodes + j, &root);  in rbtree_test_init()
337 		for (j = 0; j < nnodes; j++) {  in rbtree_test_init()
338 			check(j);  in rbtree_test_init()
339 			insert(nodes + j, &root);  in rbtree_test_init()
341 		for (j = 0; j < nnodes; j++) {  in rbtree_test_init()
342 			check(nnodes - j);  in rbtree_test_init()
343 			erase(nodes + j, &root);  in rbtree_test_init()
355 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
356 			insert_augmented(nodes + j, &root);  in rbtree_test_init()
357 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
358 			erase_augmented(nodes + j, &root);  in rbtree_test_init()
370 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
371 			insert_augmented_cached(nodes + j, &root);  in rbtree_test_init()
372 		for (j = 0; j < nnodes; j++)  in rbtree_test_init()
373 			erase_augmented_cached(nodes + j, &root);  in rbtree_test_init()
384 		for (j = 0; j < nnodes; j++) {  in rbtree_test_init()
385 			check_augmented(j);  in rbtree_test_init()
386 			insert_augmented(nodes + j, &root);  in rbtree_test_init()
388 		for (j = 0; j < nnodes; j++) {  in rbtree_test_init()
389 			check_augmented(nnodes - j);  in rbtree_test_init()
390 			erase_augmented(nodes + j, &root);  in rbtree_test_init()