HomeSort by: relevance | last modified time | path
    Searched refs:haystack_len (Results 1 - 13 of 13) sorted by relevancy

  /src/external/gpl3/gdb/dist/gnulib/import/
memmem.c 35 memmem (const void *haystack_start, size_t haystack_len,
50 if (__builtin_expect (haystack_len < needle_len, 0))
59 haystack = memchr (haystack, *needle, haystack_len);
62 haystack_len -= haystack - (const unsigned char *) haystack_start;
63 if (haystack_len < needle_len)
65 return two_way_short_needle (haystack, haystack_len, needle, needle_len);
68 return two_way_long_needle (haystack, haystack_len, needle, needle_len);
strstr.c 44 size_t haystack_len; /* Known minimum length of HAYSTACK. */ local
64 haystack_len = (haystack > haystack_start + needle_len ? 1
72 haystack_len,
74 return two_way_long_needle ((const unsigned char *) haystack, haystack_len,
str-two-way.h 225 NULL. HAYSTACK_LEN is the minimum known length of HAYSTACK. This
230 If AVAILABLE does not modify HAYSTACK_LEN (as in memmem), then at
231 most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.
232 If AVAILABLE modifies HAYSTACK_LEN (as in strstr), then at most 3 *
233 HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching. */
235 two_way_short_needle (const unsigned char *haystack, size_t haystack_len,
257 while (AVAILABLE (haystack, haystack_len, j, needle_len))
291 while (AVAILABLE (haystack, haystack_len, j, needle_len))
317 NULL. HAYSTACK_LEN is the minimum known length of HAYSTACK. This
322 If AVAILABLE does not modify HAYSTACK_LEN (as in memmem), then a
    [all...]
  /src/external/gpl3/gdb.old/dist/gnulib/import/
memmem.c 35 memmem (const void *haystack_start, size_t haystack_len,
50 if (__builtin_expect (haystack_len < needle_len, 0))
59 haystack = memchr (haystack, *needle, haystack_len);
62 haystack_len -= haystack - (const unsigned char *) haystack_start;
63 if (haystack_len < needle_len)
65 return two_way_short_needle (haystack, haystack_len, needle, needle_len);
68 return two_way_long_needle (haystack, haystack_len, needle, needle_len);
strstr.c 44 size_t haystack_len; /* Known minimum length of HAYSTACK. */ local
64 haystack_len = (haystack > haystack_start + needle_len ? 1
72 haystack_len,
74 return two_way_long_needle ((const unsigned char *) haystack, haystack_len,
str-two-way.h 225 NULL. HAYSTACK_LEN is the minimum known length of HAYSTACK. This
230 If AVAILABLE does not modify HAYSTACK_LEN (as in memmem), then at
231 most 2 * HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching.
232 If AVAILABLE modifies HAYSTACK_LEN (as in strstr), then at most 3 *
233 HAYSTACK_LEN - NEEDLE_LEN comparisons occur in searching. */
235 two_way_short_needle (const unsigned char *haystack, size_t haystack_len,
257 while (AVAILABLE (haystack, haystack_len, j, needle_len))
291 while (AVAILABLE (haystack, haystack_len, j, needle_len))
317 NULL. HAYSTACK_LEN is the minimum known length of HAYSTACK. This
322 If AVAILABLE does not modify HAYSTACK_LEN (as in memmem), then a
    [all...]
  /src/external/gpl3/binutils/dist/libiberty/
memmem.c 21 size_t @var{haystack_len} const void *@var{needle}, size_t @var{needle_len})
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
60 if (__builtin_expect (haystack_len < needle_len, 0))
  /src/external/gpl3/binutils.old/dist/libiberty/
memmem.c 21 size_t @var{haystack_len} const void *@var{needle}, size_t @var{needle_len})
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
60 if (__builtin_expect (haystack_len < needle_len, 0))
  /src/external/gpl3/gcc/dist/libiberty/
memmem.c 21 size_t @var{haystack_len} const void *@var{needle}, size_t @var{needle_len})
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
60 if (__builtin_expect (haystack_len < needle_len, 0))
  /src/external/gpl3/gcc.old/dist/libiberty/
memmem.c 21 size_t @var{haystack_len} const void *@var{needle}, size_t @var{needle_len})
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
60 if (__builtin_expect (haystack_len < needle_len, 0))
  /src/external/gpl3/gdb.old/dist/libiberty/
memmem.c 21 size_t @var{haystack_len} const void *@var{needle}, size_t @var{needle_len})
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
60 if (__builtin_expect (haystack_len < needle_len, 0))
  /src/external/gpl3/gdb/dist/libiberty/
memmem.c 21 size_t @var{haystack_len} const void *@var{needle}, size_t @var{needle_len})
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
60 if (__builtin_expect (haystack_len < needle_len, 0))
  /src/external/bsd/wpa/dist/wpa_supplicant/
p2p_supplicant_sd.c 536 size_t haystack_len, i; local
545 haystack_len = os_strlen(adv_data->svc_info);
546 for (i = 0; i < haystack_len; i++) {
547 if (haystack_len - i < needle_len)

Completed in 67 milliseconds