Home
last modified time | relevance | path

Searched refs:k (Results 1 – 5 of 5) sorted by relevance

/string/
A Dstr-two-way.h140 k = p = 1; in critical_factorization()
148 j += k; in critical_factorization()
149 k = 1; in critical_factorization()
156 ++k; in critical_factorization()
160 k = 1; in critical_factorization()
167 k = p = 1; in critical_factorization()
175 k = p = 1; in critical_factorization()
183 j += k; in critical_factorization()
184 k = 1; in critical_factorization()
191 ++k; in critical_factorization()
[all …]
A Dtester.c102 int k; in test_strcmp() local
103 for (k = 0; k < 0x3f; k++) in test_strcmp()
105 buf1[k] = '0' ^ (k & 4); in test_strcmp()
106 buf2[k] = '4' ^ (k & 4); in test_strcmp()
110 for (k = 0; k < 0xf; k++) in test_strcmp()
114 buf1[i+k] = 'A' + i + k; in test_strcmp()
118 buf2[j+k] = 'B' + i + k; in test_strcmp()
122 buf2[j+k] = 'A' + i + k; in test_strcmp()
1356 for (k = 0; k < i; k++) in test_memset()
1359 for (k = i; k < i+j; k++) in test_memset()
[all …]
A Dtest-memset.c152 size_t i, j, k, n, align, len, size; in do_random_tests() local
184 k = align - 128; in do_random_tests()
186 k = 0; in do_random_tests()
187 for (i = k; i < align; ++i) in do_random_tests()
207 for (i = k; i < align; ++i) in do_random_tests()
A Dtest-strcat.c75 size_t k = STRLEN (dst); in do_one_test() local
84 if (STRCMP (dst + k, src) != 0) in do_one_test()
A Dtest-strncat.c76 size_t k = STRLEN (dst); in do_one_test() local
86 if (MEMCMP (dst + k, src, len + 1 > n ? n : len + 1) != 0) in do_one_test()
93 if (n < len && dst[k + n] != '\0') in do_one_test()

Completed in 13 milliseconds