HomeSort by relevance Sort by last modified time
    Searched refs:needle (Results 1 - 25 of 376) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/syslinux/com32/lib/
strstr.c 7 char *strstr(const char *haystack, const char *needle)
9 return (char *)memmem(haystack, strlen(haystack), needle, strlen(needle));
memmem.c 14 void *memmem(const void *haystack, size_t n, const void *needle, size_t m)
17 const unsigned char *x = (const unsigned char *)needle;
  /external/fio/oslib/
strcasestr.h 10 char *strcasestr(const char *haystack, const char *needle);
  /toolchain/binutils/binutils-2.25/libiberty/
memmem.c 21 size_t @var{haystack_len} const void *@var{needle}, size_t @var{needle_len})
23 Returns a pointer to the first occurrence of @var{needle} (length
44 /* Return the first occurrence of NEEDLE in HAYSTACK. */
46 memmem (const void *haystack, size_t haystack_len, const void *needle,
64 if (begin[0] == ((const char *) needle)[0] &&
66 (const void *) ((const char *) needle + 1),
  /bionic/libc/bionic/
memmem.cpp 33 const unsigned char* needle = reinterpret_cast<const unsigned char*>(void_needle); local
38 if (m == 1) return const_cast<void*>(memchr(haystack, needle[0], n));
43 const unsigned char* x = needle;
  /system/core/logd/
LogUtils.h 51 // needle should reference a string longer than 1 character
53 const char* needle) {
56 const char c = *needle++;
57 const size_t needleLen = strlen(needle);
63 } while (fastcmp<memcmp>(s, needle, needleLen));
  /external/google-breakpad/src/common/linux/
linux_libc_support.cc 123 const char* my_strchr(const char* haystack, char needle) {
124 while (*haystack && *haystack != needle)
126 if (*haystack == needle)
131 const char* my_strrchr(const char* haystack, char needle) {
134 if (*haystack == needle)
141 void* my_memchr(const void* src, int needle, size_t src_len) {
145 if (*p == needle)
linux_libc_support.h 66 extern const char* my_strchr(const char* haystack, char needle);
68 extern const char* my_strrchr(const char* haystack, char needle);
  /external/iproute2/tc/
em_nbyte.c 31 "Usage: nbyte(NEEDLE at OFFSET [layer LAYER])\n" \
32 "where: NEEDLE := { string | \"c-escape-sequence\" }\n" \
44 struct bstr *needle = args; local
57 if (needle->len <= 0)
58 return PARSE_ERR(args, "nbyte: needle length is 0");
95 nb.len = needle->len;
101 addraw_l(n, MAX_MSG, needle->data, needle->len);
112 __u8 *needle; local
124 needle = data + sizeof(*nb)
    [all...]
  /prebuilts/gdb/darwin-x86/share/gdb/python/gdb/
unwinder.py 86 for needle in locus.frame_unwinders:
87 if needle.name == unwinder.name:
  /prebuilts/gdb/linux-x86/share/gdb/python/gdb/
unwinder.py 86 for needle in locus.frame_unwinders:
87 if needle.name == unwinder.name:
  /frameworks/base/core/java/android/hardware/camera2/utils/
ArrayUtils.java 33 /** Return the index of {@code needle} in the {@code array}, or else {@code -1} */
34 public static <T> int getArrayIndex(T[] array, T needle) {
41 if (Objects.equals(elem, needle)) {
50 /** Return the index of {@code needle} in the {@code array}, or else {@code -1} */
51 public static int getArrayIndex(int[] array, int needle) {
56 if (array[i] == needle) {
ListUtils.java 29 /** Return {@code} true if the {@code list} contains the {@code needle}. */
30 public static <T> boolean listContains(List<T> list, T needle) {
34 return list.contains(needle);
  /external/libbrillo/brillo/
secure_blob_unittest.cc 25 const brillo::Blob& needle) {
27 haystack.begin(), haystack.end(), needle.begin(), needle.end());
32 const brillo::Blob& needle) {
34 haystack.begin(), haystack.end(), needle.begin(), needle.end());
  /frameworks/av/media/libstagefright/foundation/include/media/stagefright/foundation/
AUtils.h 69 // needle is in range [hayStart, hayStart + haySize)
72 inline static bool isInRange(const T &hayStart, const U &haySize, const T &needle) {
74 return (T)(hayStart + haySize) >= hayStart && needle >= hayStart && (U)(needle - hayStart) < haySize;
  /external/v8/src/inspector/
string-util.h 35 static size_t find(const String& s, const char* needle) {
36 return s.find(needle);
38 static size_t find(const String& s, const String& needle) {
39 return s.find(needle);
  /cts/tests/tests/util/src/android/util/cts/
RangeTest.java 124 private static <T extends Comparable<? super T>> void verifyInRange(Range<T> object, T needle) {
125 verifyAction("in-range", object, needle, true, object.contains(needle));
129 T needle) {
130 verifyAction("out-of-range", object, needle, false, object.contains(needle));
147 private static <T, T2> void verifyAction(String action, T object, T2 needle, boolean expected,
150 assertEquals("Expected " + needle + " to be " + expectedMessage + " of " + object,
  /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/unit/
RangeTest.java 139 private static <T extends Comparable<? super T>> void assertInRange(Range<T> object, T needle) {
140 assertAction("in-range", object, needle, true, object.contains(needle));
144 T needle) {
145 assertAction("out-of-range", object, needle, false, object.contains(needle));
162 private static <T, T2> void assertAction(String action, T object, T2 needle, boolean expected,
165 assertEquals("Expected " + needle + " to be " + expectedMessage + " of " + object,
  /external/guava/guava-tests/benchmark/com/google/common/base/
CharMatcherBenchmark.java 167 int needle = random.nextInt(sum); local
176 if (needle == cv) {
178 } else if ((lv <= needle) && (needle < cv)) {
180 } else if (needle == rv) {
182 } else if (needle < cv) {
187 } else if (needle == cv) {
    [all...]
  /external/skia/tests/
AnnotationTest.cpp 14 /** Returns true if data (may contain null characters) contains needle (null
16 static bool ContainsString(const char* data, size_t dataSize, const char* needle) {
17 size_t nSize = strlen(needle);
19 if (strncmp(&data[i], needle, nSize) == 0) {
  /external/mesa3d/src/gallium/auxiliary/util/
u_string.h 169 util_strstr(const char *haystack, const char *needle)
172 size_t len = strlen(needle);
174 for (; (p = util_strchr(p, *needle)) != 0; p++) {
175 if (util_strncmp(p, needle, len) == 0) {
  /bionic/linker/
linker_utils.cpp 120 const char* needle = dir.c_str(); local
122 size_t needle_len = strlen(needle);
124 return strncmp(haystack, needle, needle_len) == 0 &&
130 const char* needle = dir.c_str(); local
132 size_t needle_len = strlen(needle);
134 return strncmp(haystack, needle, needle_len) == 0 &&
  /bionic/tests/
search_test.cpp 30 int needle; local
33 needle = 2;
34 ASSERT_EQ(nullptr, lfind(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));
38 ASSERT_EQ(&xs[0], lsearch(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));
43 ASSERT_EQ(&xs[0], lfind(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));
47 ASSERT_EQ(&xs[0], lsearch(&needle, xs, &x_size, sizeof(xs[0]), int_cmp));
  /external/bison/lib/
string.in.h 129 /* Return the first occurrence of NEEDLE in HAYSTACK. */
567 _GL_FUNCDECL_RPL (strstr, char *, (const char *haystack, const char *needle)
570 _GL_CXXALIAS_RPL (strstr, char *, (const char *haystack, const char *needle));
576 char *, (const char *haystack, const char *needle),
577 const char *, (const char *haystack, const char *needle));
581 _GL_CXXALIASWARN1 (strstr, char *, (char *haystack, const char *needle));
583 (const char *haystack, const char *needle));
601 /* Find the first occurrence of NEEDLE in HAYSTACK, using case-insensitive
609 (const char *haystack, const char *needle)
613 (const char *haystack, const char *needle));
    [all...]
  /external/v8/gypfiles/
gyp_v8 65 needle = 'output_dir='
67 if item.startswith(needle):
68 return item[len(needle):]

Completed in 1522 milliseconds

1 2 3 4 5 6 7 8 91011>>