Home
last modified time | relevance | path

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

/string/
A Dstrcasestr.c65 size_t haystack_len; /* Known minimum length of HAYSTACK. */ in STRCASESTR() local
75 haystack_len = __strnlen (haystack, needle_len + 256); in STRCASESTR()
76 if (haystack_len < needle_len) in STRCASESTR()
84 haystack_len, in STRCASESTR()
87 return two_way_long_needle ((const unsigned char *) haystack, haystack_len, in STRCASESTR()
A Dtest-memmem.c32 simple_memmem (const void *haystack, size_t haystack_len, const void *needle, in simple_memmem() argument
37 = (const char *) haystack + haystack_len - needle_len; in simple_memmem()
46 if (__glibc_unlikely (haystack_len < needle_len)) in simple_memmem()
60 check_result (impl_t *impl, const void *haystack, size_t haystack_len, in check_result() argument
65 res = CALL (impl, haystack, haystack_len, needle, needle_len); in check_result()
78 do_one_test (impl_t *impl, const void *haystack, size_t haystack_len, in do_one_test() argument
81 if (check_result (impl, haystack, haystack_len, needle, needle_len, in do_one_test()
A Dstr-two-way.h225 two_way_short_needle (const unsigned char *haystack, size_t haystack_len, in two_way_short_needle() argument
247 while (AVAILABLE (haystack, haystack_len, j, needle_len)) in two_way_short_needle()
293 while (AVAILABLE (haystack, haystack_len, j, needle_len)) in two_way_short_needle()
304 haystack_len - needle_len - j); in two_way_short_needle()
317 if (!AVAILABLE (haystack, haystack_len, j, needle_len)) in two_way_short_needle()
343 if (phaystack > haystack + haystack_len) in two_way_short_needle()
344 haystack_len = phaystack - haystack; in two_way_short_needle()
390 two_way_long_needle (const unsigned char *haystack, size_t haystack_len, in two_way_long_needle() argument
423 while (AVAILABLE (haystack, haystack_len, j, needle_len)) in two_way_long_needle()
482 while (AVAILABLE (haystack, haystack_len, j, needle_len)) in two_way_long_needle()

Completed in 8 milliseconds