Lines Matching refs:i
53 unsigned int i; in int_find() local
55 for (i = 0; i < n_int_tests; i++) in int_find()
56 if (int_tests[i] == n) in int_find()
57 return i; in int_find()
98 unsigned int i; in test_int_lhash() local
105 for (i = 0; i < n_int_tests; i++) in test_int_lhash()
106 if (!TEST_ptr_null(lh_int_insert(h, int_tests + i))) { in test_int_lhash()
107 TEST_info("int insert %d", i); in test_int_lhash()
116 for (i = 0; i < n_int_tests; i++) in test_int_lhash()
117 if (!TEST_int_eq(*lh_int_retrieve(h, int_tests + i), int_tests[i])) { in test_int_lhash()
118 TEST_info("lhash int retrieve value %d", i); in test_int_lhash()
121 for (i = 0; i < n_int_tests; i++) in test_int_lhash()
122 if (!TEST_ptr_eq(lh_int_retrieve(h, int_tests + i), int_tests + i)) { in test_int_lhash()
123 TEST_info("lhash int retrieve address %d", i); in test_int_lhash()
147 for (i = 0; i < n_int_tests; i++) in test_int_lhash()
148 if (!TEST_int_eq(int_found[i], 1)) { in test_int_lhash()
149 TEST_info("lhash int doall %d", i); in test_int_lhash()
161 for (i = 0; i < n_int_tests; i++) in test_int_lhash()
162 if (!TEST_int_eq(int_found[i], 1)) { in test_int_lhash()
163 TEST_info("lhash int doall arg %d", i); in test_int_lhash()
168 for (i = 0; i < n_dels; i++) { in test_int_lhash()
169 const int b = lh_int_delete(h, &dels[i].data) == NULL; in test_int_lhash()
170 if (!TEST_int_eq(b ^ dels[i].null, 0)) { in test_int_lhash()
171 TEST_info("lhash int delete %d", i); in test_int_lhash()
238 size_t i; in test_int_hashtable() local
250 for (i = 0; i < n_int_tests; i++) { in test_int_hashtable()
251 HT_SET_KEY_FIELD(&key, mykey, int_tests[i]); in test_int_hashtable()
253 &int_tests[i], NULL), 1)) { in test_int_hashtable()
254 TEST_info("int insert %zu", i); in test_int_hashtable()
272 for (i = 0; i < n_int_tests; i++) in test_int_hashtable()
273 if (!TEST_int_eq(int_found[i], 1)) { in test_int_hashtable()
274 TEST_info("hashtable int foreach %zu", i); in test_int_hashtable()
285 for (i = 0; i < n_dels; i++) { in test_int_hashtable()
286 HT_SET_KEY_FIELD(&key, mykey, dels[i].data); in test_int_hashtable()
288 if (dels[i].should_del) { in test_int_hashtable()
291 dels[i].data); in test_int_hashtable()
296 TEST_info("%d found an entry that shouldn't be there\n", dels[i].data); in test_int_hashtable()
345 unsigned int i; in test_stress() local
357 for (i = 0; i < n; i++) { in test_stress()
358 p = OPENSSL_malloc(sizeof(i)); in test_stress()
360 TEST_info("lhash stress out of memory %d", i); in test_stress()
363 *p = 3 * i + 1; in test_stress()
372 for (i = 0; i < n; i++) { in test_stress()
373 const int j = (7 * i + 4) % n * 3 + 1; in test_stress()
376 TEST_info("lhash stress delete %d\n", i); in test_stress()
380 TEST_info("lhash stress bad value %d", i); in test_stress()
405 unsigned int i; in test_hashtable_stress() local
435 for (i = 0; i < n; i++) { in test_hashtable_stress()
436 p = OPENSSL_malloc(sizeof(i)); in test_hashtable_stress()
438 TEST_info("hashtable stress out of memory %d", i); in test_hashtable_stress()
441 *p = 3 * i + 1; in test_hashtable_stress()
455 for (i = 0; i < n; i++) { in test_hashtable_stress()
456 const int j = (7 * i + 4) % n * 3 + 1; in test_hashtable_stress()
650 int i; in test_hashtable_multithread() local
671 for (i = 0; i < 4; i++) { in test_hashtable_multithread()
672 if (!run_thread(&workers[i], do_mt_hash_work)) in test_hashtable_multithread()
677 for (--i; i >= 0; i--) { in test_hashtable_multithread()
678 wait_for_thread(workers[i]); in test_hashtable_multithread()
687 for (i = 0; i < 4; i++) { in test_hashtable_multithread()
688 if (worker_exits[i] != NULL) { in test_hashtable_multithread()
689 TEST_info("Worker %d failed: %s\n", i, worker_exits[i]); in test_hashtable_multithread()
