Searched refs:klen (Results 1 – 2 of 2) sorted by relevance
/string/ |
A D | test-strcasestr.c | 149 for (size_t klen = 2; klen < 32; ++klen) in test_main() local 150 for (size_t hlen = 2 * klen; hlen < 16 * klen; hlen += klen) in test_main() 152 do_test (0, 0, hlen, klen, 0); in test_main() 153 do_test (0, 0, hlen, klen, 1); in test_main() 154 do_test (0, 3, hlen, klen, 0); in test_main() 155 do_test (0, 3, hlen, klen, 1); in test_main() 156 do_test (0, 9, hlen, klen, 0); in test_main() 157 do_test (0, 9, hlen, klen, 1); in test_main() 161 do_test (3, 0, hlen, klen, 0); in test_main() 162 do_test (3, 0, hlen, klen, 1); in test_main() [all …]
|
A D | test-strstr.c | 223 for (size_t klen = 2; klen < 32; ++klen) in test_main() local 224 for (size_t hlen = 2 * klen; hlen < 16 * klen; hlen += klen) in test_main() 226 do_test (0, 0, hlen, klen, 0); in test_main() 227 do_test (0, 0, hlen, klen, 1); in test_main() 228 do_test (0, 3, hlen, klen, 0); in test_main() 229 do_test (0, 3, hlen, klen, 1); in test_main() 230 do_test (0, 9, hlen, klen, 0); in test_main() 231 do_test (0, 9, hlen, klen, 1); in test_main() 235 do_test (3, 0, hlen, klen, 0); in test_main() 262 do_test (15, 15, hlen + klen * 4, klen * 4, 0); in test_main() [all …]
|
Completed in 6 milliseconds