Searched refs:haystack (Results 1 - 25 of 174) sorted by relevance

1234567

/netbsd-current/external/gpl2/gettext/dist/gettext-runtime/gnulib-lib/
H A Dc-strstr.h41 extern char *c_strstr (const char *haystack, const char *needle);
H A Dc-strstr.c39 register const unsigned char *haystack, *needle; local
42 haystack = (const unsigned char *) phaystack;
48 haystack--; /* possible ANSI violation */
51 c = *++haystack;
70 a = *++haystack;
75 a = *++haystack;
81 jin: a = *++haystack;
88 rhaystack = haystack-- + 1;
115 return (char *) haystack;
H A Dstrstr.c32 strstr (const char *haystack, const char *needle) argument
34 /* Be careful not to look at the entire extent of haystack or needle
36 - haystack may be very long, and a match of needle found early,
38 needle may be found in haystack. */
49 mbui_init (iter_haystack, haystack);
86 return (char *) haystack;
97 for (;; haystack++)
99 if (*haystack == '\0')
102 if (*haystack == b)
105 const char *rhaystack = haystack
[all...]
H A Dstrstr.h33 extern char *strstr (const char *haystack, const char *needle);
/netbsd-current/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
H A Dc-strstr.h41 extern char *c_strstr (const char *haystack, const char *needle);
H A Dc-strcasestr.c31 strlen (haystack) < strlen (needle) ! */
33 c_strcasestr (const char *haystack, const char *needle) argument
35 /* Be careful not to look at the entire extent of haystack or needle
37 - haystack may be very long, and a match of needle found early,
39 needle may be found in haystack. */
47 for (;; haystack++)
49 if (*haystack == '\0')
52 if (c_tolower ((unsigned char) *haystack) == b)
55 const char *rhaystack = haystack + 1;
62 return (char *) haystack;
[all...]
H A Dc-strcasestr.h29 extern char *c_strcasestr (const char *haystack, const char *needle);
H A Dc-strstr.c39 register const unsigned char *haystack, *needle; local
42 haystack = (const unsigned char *) phaystack;
48 haystack--; /* possible ANSI violation */
51 c = *++haystack;
70 a = *++haystack;
75 a = *++haystack;
81 jin: a = *++haystack;
88 rhaystack = haystack-- + 1;
115 return (char *) haystack;
H A Dstrstr.c32 strstr (const char *haystack, const char *needle) argument
34 /* Be careful not to look at the entire extent of haystack or needle
36 - haystack may be very long, and a match of needle found early,
38 needle may be found in haystack. */
49 mbui_init (iter_haystack, haystack);
86 return (char *) haystack;
97 for (;; haystack++)
99 if (*haystack == '\0')
102 if (*haystack == b)
105 const char *rhaystack = haystack
[all...]
H A Dstrstr.h33 extern char *strstr (const char *haystack, const char *needle);
/netbsd-current/external/gpl2/gettext/dist/gettext-tools/libgettextpo/
H A Dc-strstr.h41 extern char *c_strstr (const char *haystack, const char *needle);
H A Dc-strstr.c39 register const unsigned char *haystack, *needle; local
42 haystack = (const unsigned char *) phaystack;
48 haystack--; /* possible ANSI violation */
51 c = *++haystack;
70 a = *++haystack;
75 a = *++haystack;
81 jin: a = *++haystack;
88 rhaystack = haystack-- + 1;
115 return (char *) haystack;
/netbsd-current/external/gpl3/gdb.old/dist/gnulib/import/
H A Dstrstr.c41 const char *haystack = haystack_start; local
50 while (*haystack && *needle)
51 ok &= *haystack++ == *needle++;
57 /* Reduce the size of haystack using strchr, since it has a smaller
60 haystack = strchr (haystack_start + 1, *needle_start);
61 if (!haystack || __builtin_expect (needle_len == 1, 0))
62 return (char *) haystack;
64 haystack_len = (haystack > haystack_start + needle_len ? 1
65 : needle_len + haystack_start - haystack);
71 return two_way_short_needle ((const unsigned char *) haystack,
[all...]
H A Dmemmem.c40 const unsigned char *haystack = (const unsigned char *) haystack_start; local
46 return (void *) haystack;
54 size of haystack using a linear algorithm with a smaller
59 haystack = memchr (haystack, *needle, haystack_len);
60 if (!haystack || __builtin_expect (needle_len == 1, 0))
61 return (void *) haystack;
62 haystack_len -= haystack - (const unsigned char *) haystack_start;
65 return two_way_short_needle (haystack, haystack_len, needle, needle_len);
68 return two_way_long_needle (haystack, haystack_le
[all...]
H A Dstr-two-way.h235 two_way_short_needle (const unsigned char *haystack, size_t haystack_len, argument
257 while (AVAILABLE (haystack, haystack_len, j, needle_len))
262 == CANON_ELEMENT (haystack[i + j])))
269 == CANON_ELEMENT (haystack[i + j])))
272 return (RETURN_TYPE) (haystack + j);
291 while (AVAILABLE (haystack, haystack_len, j, needle_len))
296 == CANON_ELEMENT (haystack[i + j])))
303 == CANON_ELEMENT (haystack[i + j])))
306 return (RETURN_TYPE) (haystack + j);
329 two_way_long_needle (const unsigned char *haystack, size_ argument
[all...]
/netbsd-current/external/gpl3/gdb/dist/gnulib/import/
H A Dstrstr.c41 const char *haystack = haystack_start; local
50 while (*haystack && *needle)
51 ok &= *haystack++ == *needle++;
57 /* Reduce the size of haystack using strchr, since it has a smaller
60 haystack = strchr (haystack_start + 1, *needle_start);
61 if (!haystack || __builtin_expect (needle_len == 1, 0))
62 return (char *) haystack;
64 haystack_len = (haystack > haystack_start + needle_len ? 1
65 : needle_len + haystack_start - haystack);
71 return two_way_short_needle ((const unsigned char *) haystack,
[all...]
H A Dmemmem.c40 const unsigned char *haystack = (const unsigned char *) haystack_start; local
46 return (void *) haystack;
54 size of haystack using a linear algorithm with a smaller
59 haystack = memchr (haystack, *needle, haystack_len);
60 if (!haystack || __builtin_expect (needle_len == 1, 0))
61 return (void *) haystack;
62 haystack_len -= haystack - (const unsigned char *) haystack_start;
65 return two_way_short_needle (haystack, haystack_len, needle, needle_len);
68 return two_way_long_needle (haystack, haystack_le
[all...]
/netbsd-current/external/gpl2/xcvs/dist/lib/
H A Dstrstr.h33 extern char *strstr (const char *haystack, const char *needle);
H A Dstrstr.c37 strstr (const char *haystack, const char *needle) argument
39 /* Be careful not to look at the entire extent of haystack or needle
41 - haystack may be very long, and a match of needle found early,
43 needle may be found in haystack. */
54 mbui_init (iter_haystack, haystack);
91 return (char *) haystack;
102 for (;; haystack++)
104 if (*haystack == '\0')
107 if (*haystack == b)
110 const char *rhaystack = haystack
[all...]
/netbsd-current/external/gpl3/binutils/dist/libiberty/
H A Dmemmem.c20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle, argument
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
/netbsd-current/external/gpl3/gcc.old/dist/libiberty/
H A Dmemmem.c20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle, argument
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
/netbsd-current/external/gpl3/gdb.old/dist/libiberty/
H A Dmemmem.c20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle, argument
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
/netbsd-current/external/gpl3/gcc/dist/libiberty/
H A Dmemmem.c20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle, argument
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
/netbsd-current/external/gpl3/gdb/dist/libiberty/
H A Dmemmem.c20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle, argument
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
/netbsd-current/external/gpl3/binutils.old/dist/libiberty/
H A Dmemmem.c20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
46 memmem (const void *haystack, size_t haystack_len, const void *needle, argument
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)

Completed in 286 milliseconds

1234567