| /src/external/gpl2/gettext/dist/gettext-runtime/gnulib-lib/ |
| c-strstr.h | 27 /* Find the first occurrence of NEEDLE in HAYSTACK.
39 HAYSTACK and NEEDLE are known to both consist solely of printable ASCII
41 extern char *c_strstr (const char *haystack, const char *needle);
|
| c-strstr.c | 39 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;
|
| strstr.c | 30 /* Find the first occurrence of NEEDLE in HAYSTACK. */
32 strstr (const char *haystack, const char *needle)
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
[all...] |
| strstr.h | 32 /* Find the first occurrence of NEEDLE in HAYSTACK. */
33 extern char *strstr (const char *haystack, const char *needle);
|
| /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| c-strstr.h | 27 /* Find the first occurrence of NEEDLE in HAYSTACK.
39 HAYSTACK and NEEDLE are known to both consist solely of printable ASCII
41 extern char *c_strstr (const char *haystack, const char *needle);
|
| c-strcasestr.c | 28 /* Find the first occurrence of NEEDLE in HAYSTACK, using case-insensitive
31 strlen (haystack) < strlen (needle) ! */
33 c_strcasestr (const char *haystack, const char *needle)
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
[all...] |
| c-strcasestr.h | 27 /* Find the first occurrence of NEEDLE in HAYSTACK, using case-insensitive
29 extern char *c_strcasestr (const char *haystack, const char *needle);
|
| c-strstr.c | 39 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;
|
| strstr.c | 30 /* Find the first occurrence of NEEDLE in HAYSTACK. */
32 strstr (const char *haystack, const char *needle)
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
[all...] |
| strstr.h | 32 /* Find the first occurrence of NEEDLE in HAYSTACK. */
33 extern char *strstr (const char *haystack, const char *needle);
|
| /src/external/gpl2/gettext/dist/gettext-tools/libgettextpo/ |
| c-strstr.h | 27 /* Find the first occurrence of NEEDLE in HAYSTACK.
39 HAYSTACK and NEEDLE are known to both consist solely of printable ASCII
41 extern char *c_strstr (const char *haystack, const char *needle);
|
| c-strstr.c | 39 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;
|
| /src/external/gpl3/gdb/dist/gnulib/import/ |
| strstr.c | 35 /* Return the first occurrence of NEEDLE in HAYSTACK. Return HAYSTACK
37 HAYSTACK. */
41 const char *haystack = haystack_start; local
44 size_t haystack_len; /* Known minimum length of HAYSTACK. */
45 bool ok = true; /* True if NEEDLE is prefix of HAYSTACK. */
48 HAYSTACK is at least as long (no point processing all of a long
49 NEEDLE if HAYSTACK is too short). */
50 while (*haystack && *needle)
51 ok &= *haystack++ == *needle++
[all...] |
| memmem.c | 31 /* Return the first occurrence of NEEDLE in HAYSTACK. Return HAYSTACK
33 HAYSTACK. */
40 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;
[all...] |
| /src/external/gpl3/gdb.old/dist/gnulib/import/ |
| strstr.c | 35 /* Return the first occurrence of NEEDLE in HAYSTACK. Return HAYSTACK
37 HAYSTACK. */
41 const char *haystack = haystack_start; local
44 size_t haystack_len; /* Known minimum length of HAYSTACK. */
45 bool ok = true; /* True if NEEDLE is prefix of HAYSTACK. */
48 HAYSTACK is at least as long (no point processing all of a long
49 NEEDLE if HAYSTACK is too short). */
50 while (*haystack && *needle)
51 ok &= *haystack++ == *needle++
[all...] |
| memmem.c | 31 /* Return the first occurrence of NEEDLE in HAYSTACK. Return HAYSTACK
33 HAYSTACK. */
40 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;
[all...] |
| /src/external/gpl2/xcvs/dist/lib/ |
| strstr.c | 35 /* Find the first occurrence of NEEDLE in HAYSTACK. */
37 strstr (const char *haystack, const char *needle)
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
[all...] |
| strstr.h | 32 /* Find the first occurrence of NEEDLE in HAYSTACK. */
33 extern char *strstr (const char *haystack, const char *needle);
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| memmem.c | 20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
44 /* Return the first occurrence of NEEDLE in HAYSTACK. */
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
|
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| memmem.c | 20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
44 /* Return the first occurrence of NEEDLE in HAYSTACK. */
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
|
| /src/external/gpl3/gcc/dist/libiberty/ |
| memmem.c | 20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
44 /* Return the first occurrence of NEEDLE in HAYSTACK. */
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
|
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| memmem.c | 20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
44 /* Return the first occurrence of NEEDLE in HAYSTACK. */
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
|
| /src/external/gpl3/gdb/dist/libiberty/ |
| memmem.c | 20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
44 /* Return the first occurrence of NEEDLE in HAYSTACK. */
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
|
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| memmem.c | 20 @deftypefn Supplemental void* memmem (const void *@var{haystack}, @
24 @var{needle_len}) in @var{haystack} (length @var{haystack_len}).
44 /* Return the first occurrence of NEEDLE in HAYSTACK. */
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
51 = (const char *) haystack + haystack_len - needle_len;
56 return (void *) haystack;
63 for (begin = (const char *) haystack; begin <= last_possible; ++begin)
|
| /src/external/bsd/zstd/dist/tests/gzip/ |
| zgrep-f.sh | 24 cp n haystack || framework_failure_
25 gzip haystack || framework_failure_
28 zgrep -f - haystack.gz < n > out 2>&1 || fail=1
36 eval 'zgrep -h -f <(cat n) haystack.gz haystack.gz' >out || fail=1
|
