Home
last modified time | relevance | path

Searched refs:needle_len (Results 1 – 3 of 3) sorted by relevance

/string/
A Dstr-two-way.h141 while (j + k < needle_len) in critical_factorization()
176 while (j + k < needle_len) in critical_factorization()
259 if (needle_len <= i) in two_way_short_needle()
273 memory = needle_len - period; in two_way_short_needle()
331 while (i < needle_len) in two_way_short_needle()
346 if (needle_len <= i) in two_way_short_needle()
409 shift_table[i] = needle_len; in two_way_long_needle()
410 for (i = 0; i < needle_len; i++) in two_way_long_needle()
438 shift = needle_len - period; in two_way_long_needle()
452 if (needle_len - 1 <= i) in two_way_long_needle()
[all …]
A Dstrcasestr.c64 size_t needle_len; /* Length of NEEDLE. */ in STRCASESTR() local
74 needle_len = strlen (needle); in STRCASESTR()
75 haystack_len = __strnlen (haystack, needle_len + 256); in STRCASESTR()
76 if (haystack_len < needle_len) in STRCASESTR()
82 if (needle_len < LONG_NEEDLE_THRESHOLD) in STRCASESTR()
86 needle_len); in STRCASESTR()
89 needle_len); in STRCASESTR()
A Dtest-memmem.c33 size_t needle_len) in simple_memmem() argument
37 = (const char *) haystack + haystack_len - needle_len; in simple_memmem()
39 if (needle_len == 0) in simple_memmem()
46 if (__glibc_unlikely (haystack_len < needle_len)) in simple_memmem()
53 needle_len - 1)) in simple_memmem()
61 const void *needle, size_t needle_len, const void *expected) in check_result() argument
65 res = CALL (impl, haystack, haystack_len, needle, needle_len); in check_result()
79 const void *needle, size_t needle_len, const void *expected) in do_one_test() argument
81 if (check_result (impl, haystack, haystack_len, needle, needle_len, in do_one_test()

Completed in 12 milliseconds