Lines Matching refs:j
59 unsigned i, j, k; in TEST_BEGIN() local
70 for (j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) { in TEST_BEGIN()
71 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
79 j, k, keys[j], keys[k]); in TEST_BEGIN()
84 "i=%u, j=%u", i, j); in TEST_BEGIN()
85 assert_false(rtree_set(&rtree, keys[j], NULL), in TEST_BEGIN()
105 unsigned j; in TEST_BEGIN() local
111 for (j = 0; j < NSET; j++) { in TEST_BEGIN()
112 keys[j] = (uintptr_t)gen_rand64(sfmt); in TEST_BEGIN()
113 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
115 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node, in TEST_BEGIN()
118 for (j = 0; j < NSET; j++) { in TEST_BEGIN()
119 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node, in TEST_BEGIN()
123 for (j = 0; j < NSET; j++) { in TEST_BEGIN()
124 assert_false(rtree_set(&rtree, keys[j], NULL), in TEST_BEGIN()
126 assert_ptr_null(rtree_get(&rtree, keys[j], true), in TEST_BEGIN()
129 for (j = 0; j < NSET; j++) { in TEST_BEGIN()
130 assert_ptr_null(rtree_get(&rtree, keys[j], true), in TEST_BEGIN()