| /third_party/musl/libc-test/src/functionalext/supplement/string/ |
| H A D | memchr.c | 24 * @tc.desc :Verify memchr is successed and return 0.
31 char *findch = (char *)memchr(srcstring, fitch, strlen(srcstring)); in memchr_0100()
42 * @tc.desc :Verify memchr is failed and return NULL.
48 char *findch = (char *)memchr(srcstring, 'w', strlen(srcstring)); in memchr_0200()
54 * @tc.desc :Verify memchr is failed when first param src is invalid.
60 char *findch = (char *)memchr(srcstring, 'w', strlen(srcstring)); in memchr_0300()
66 * @tc.desc :Verify memchr is failed when second param c is invalid.
72 char *findch = (char *)memchr(srcstring, '\0', strlen(srcstring)); in memchr_0400()
78 * @tc.desc :Verify memchr is failed when third param n is invalid.
84 char *findch = (char *)memchr(srcstrin in memchr_0500()
[all...] |
| /third_party/rust/crates/memchr/src/tests/memchr/ |
| H A D | memchr.rs | 4 memchr,
5 memchr::{fallback, naive},
7 tests::memchr::testdata::memchr_tests,
13 test.one(false, memchr); in memchr1_find()
20 test.one(false, fallback::memchr); in memchr1_fallback_find()
96 memchr(n1, &corpus) == naive::memchr(n1, &corpus) in qc_memchr1_matches_naive()
|
| H A D | simple.rs | 2 // memchr when tests are run under miri. These are mostly necessary because the
7 use crate::{memchr, memchr2, memchr3, memrchr, memrchr2, memrchr3};
11 assert_eq!(memchr(b'a', b"abcda"), Some(0)); in simple()
12 assert_eq!(memchr(b'z', b"abcda"), None); in simple()
|
| /third_party/rust/crates/memchr/src/ |
| H A D | lib.rs | 18 # Example: using `memchr`
20 This example shows how to use `memchr` to find the first occurrence of `z` in
24 use memchr::memchr;
27 assert_eq!(Some(10), memchr(b'z', haystack));
36 use memchr::memchr3_iter;
53 use memchr::memmem;
72 use memchr::memmem;
83 a dedicated routine like `memchr` for something that could be implemented
87 fn memchr(needl functions
178 mod memchr; global() modules
[all...] |
| /third_party/rust/crates/regex/src/ |
| H A D | find_byte.rs | 4 /// memchr crate. Otherwise, it uses the naive byte-at-a-time implementation.
13 use memchr::memchr; in find_byte()
14 memchr(needle, haystack) in find_byte()
|
| /third_party/musl/libc-test/src/functionalext/supplement/string/string_gtest/ |
| H A D | string_memchr_test.cpp | 14 * @tc.desc: Test the memchr function to verify if it correctly handles empty string input, and if the target character
21 const void* foundChar = memchr(sourceString, 'w', strlen(sourceString)); in HWTEST_F()
27 * @tc.desc: Test the memchr function to verify if it correctly handles the case where the maximum number of bytes to
34 const void* foundChar = memchr(sourceString, 'w', 0); in HWTEST_F()
40 * @tc.desc: Verify memchr ability to correctly search for a specified character in a given string and return the
47 const void* foundChar = memchr(sourceString, 'w', strlen(sourceString)); in HWTEST_F()
|
| /third_party/rust/crates/memchr/bench/src/memchr/ |
| H A D | imp.rs | 1 use memchr::{memrchr, memrchr2, memrchr3, Memchr, Memchr2, Memchr3};
3 use crate::memchr::{c, fallback, naive};
12 while let Some(i) = c::memchr(b1, &haystack[start..]) { in memchr1_libc_count()
22 while let Some(i) = fallback::memchr(b1, &haystack[start..]) { in fallback1_count()
32 while let Some(i) = naive::memchr(b1, &haystack[start..]) { in naive1_count()
|
| /third_party/cups-filters/utils/ |
| H A D | driverless.c | 109 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
116 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
122 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
141 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
148 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
170 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
176 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
182 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
188 ptr = memchr(ptr, '\t', sizeof(buffer) - (ptr - buffer)); in listPrintersInArray()
194 ptr = memchr(pt in listPrintersInArray()
[all...] |
| /third_party/rust/crates/memchr/src/memchr/ |
| H A D | mod.rs | 72 /// `haystack.iter().position(|&b| b == needle)`, `memchr` will use a highly in memchr_iter()
81 /// use memchr::memchr; in memchr_iter()
84 /// assert_eq!(memchr(b'k', haystack), Some(8)); in memchr_iter()
87 pub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> { in memchr_iter() functions
91 naive::memchr(n1, haystack) in memchr_iter()
97 x86::memchr(n1, haystack) in memchr_iter()
107 c::memchr(n1, haystack) in memchr_iter()
117 fallback::memchr(n1, haystack) in memchr_iter()
127 /// Like `memchr`, bu
[all...] |
| H A D | c.rs | 1 // This module defines safe wrappers around memchr (POSIX) and memrchr (GNU
8 pub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> { in memchr() functions
11 libc::memchr( in memchr()
27 // GNU's memrchr() will - unlike memchr() - error if haystack is empty. in memrchr()
|
| /third_party/rust/crates/memchr/bench/src/ |
| H A D | bench.rs | 6 mod memchr; modules
10 memchr::all(c); in all()
18 /// of monomorphization. Particularly with the memchr benchmarks, this
|
| /third_party/curl/lib/vtls/ |
| H A D | hostcheck.c | 108 pattern_label_end = memchr(pattern, '.', patternlen); in hostmatch()
113 const char *hostname_label_end = memchr(hostname, '.', hostlen); in hostmatch()
|
| /third_party/ninja/src/ |
| H A D | build_log.cc | 233 line_end_ = (char*)memchr(line_start_, '\n', buf_end_ - line_start_);
in ReadLine()
243 line_end_ = (char*)memchr(line_start_, '\n', buf_end_ - line_start_);
in ReadLine()
307 char* end = (char*)memchr(start, kFieldSeparator, line_end - start);
in Load()
318 end = (char*)memchr(start, kFieldSeparator, line_end - start);
in Load()
325 end = (char*)memchr(start, kFieldSeparator, line_end - start);
in Load()
332 end = (char*)memchr(start, kFieldSeparator, line_end - start);
in Load()
|
| /third_party/ffmpeg/libavcodec/ |
| H A D | xbmdec.c | 91 next = memchr(ptr, '{', avpkt->size); in xbm_decode_frame()
93 next = memchr(ptr, '(', avpkt->size); in xbm_decode_frame()
|
| /third_party/ffmpeg/libavformat/ |
| H A D | data_uri.c | 52 next = av_x_if_null(memchr(opt, ';', data - opt), data); in data_open()
54 if (!memchr(opt, '/', next - opt)) { /* basic validity check */ in data_open()
|
| /third_party/rust/crates/memchr/src/memchr/x86/ |
| H A D | mod.rs | 10 /// `memchr` (for example), CPU feature detection will be performed at runtime
12 /// is done, we replace `memchr`'s function pointer with the selection. Upon
17 /// larger haystacks, `memchr` can be called in tight loops where the overhead
28 /// entire program with AVX2 enabled. However, even then, the various memchr
95 pub fn memchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr() functions
96 unsafe_ifunc!(fn(u8, &[u8]) -> Option<usize>, memchr, haystack, n1) in memchr()
|
| /third_party/musl/porting/linux/user/src/locale/ |
| H A D | dcngettext.c | 221 modname = memchr(locname, '@', loclen); in dcngettext()
229 const char *csp = memchr(locname, '.', loclen); in dcngettext()
248 } else if ((locp = memchr(locname, '_', loclen))) { in dcngettext()
|
| /third_party/musl/src/locale/ |
| H A D | dcngettext.c | 195 modname = memchr(locname, '@', loclen); in dcngettext()
201 const char *csp = memchr(locname, '.', loclen); in dcngettext()
216 } else if ((locp = memchr(locname, '_', loclen))) { in dcngettext()
|
| /third_party/rust/crates/memchr/src/memmem/prefilter/ |
| H A D | mod.rs | 95 // If the haystack is too small for SSE2, then just run memchr on the
107 crate::memchr(needle[rare], haystack).map(|i| i.saturating_sub(rare)) in simple_memchr_fallback()
288 /// SSE and then followed by a generic one based on memchr.
344 /// the prefilter falls back to memchr for small haystacks, and, at the
459 if let Some(i) = crate::memchr(seed.rare1, &needle) { in new()
462 if let Some(i) = crate::memchr(seed.rare2, &needle) { in new()
|
| /third_party/rust/crates/regex/src/literal/ |
| H A D | imp.rs | 4 use memchr::{memchr, memchr2, memchr3, memmem};
328 /// Faster find that special cases certain sizes to use memchr.
333 1 => memchr(self.dense[0], text), in find()
356 /// A simple wrapper around the memchr crate's memmem implementation.
|
| /third_party/musl/porting/uniproton/kernel/src/string/ |
| H A D | strnlen.c | 5 const char *p = memchr(s, 0, n); in strnlen()
|
| /third_party/musl/src/string/ |
| H A D | strnlen.c | 5 const char *p = memchr(s, 0, n); in strnlen()
|
| /third_party/musl/porting/liteos_a/kernel/src/string/ |
| H A D | strnlen.c | 5 const char *p = memchr(s, 0, n); in strnlen()
|
| /third_party/musl/porting/liteos_m/kernel/src/string/ |
| H A D | strnlen.c | 5 const char *p = memchr(s, 0, n); in strnlen()
|
| /third_party/rust/crates/memchr/src/tests/ |
| H A D | mod.rs | 1 mod memchr; modules
|