Home
last modified time | relevance | path

Searched refs:min_haystack_len (Results 1 – 6 of 6) sorted by relevance

/third_party/rust/crates/memchr/src/memmem/
Dgenericsimd.rs83 pub(crate) fn min_haystack_len<V: Vector>(&self) -> usize { in min_haystack_len() method
116 let min_haystack_len = fwd.min_haystack_len::<V>(); in fwd_find() localVariable
117 assert!(haystack.len() >= min_haystack_len, "haystack too small"); in fwd_find()
136 let max_ptr = end_ptr.sub(min_haystack_len); in fwd_find()
156 remaining < min_haystack_len, in fwd_find()
159 min_haystack_len, in fwd_find()
Dwasm.rs24 pub(crate) fn min_haystack_len(&self) -> usize { in min_haystack_len() method
25 self.0.min_haystack_len::<v128>() in min_haystack_len()
71 t.haystack.len() >= fwd.min_haystack_len() in prefilter_permutations()
Dmod.rs957 if haystack.len() < gs.min_haystack_len() { in find()
971 if haystack.len() < gs.min_haystack_len() { in find()
/third_party/rust/crates/memchr/src/memmem/x86/
Davx.rs34 pub(crate) fn min_haystack_len(&self) -> usize { in min_haystack_len() method
35 self.0.min_haystack_len::<__m128i>() in min_haystack_len()
63 if haystack.len() < self.0.min_haystack_len::<__m256i>() { in find_impl()
89 pub(crate) fn min_haystack_len(&self) -> usize { in min_haystack_len() method
135 t.haystack.len() >= fwd.min_haystack_len() in prefilter_permutations()
Dsse.rs24 pub(crate) fn min_haystack_len(&self) -> usize { in min_haystack_len() method
25 self.0.min_haystack_len::<__m128i>() in min_haystack_len()
85 t.haystack.len() >= fwd.min_haystack_len() in prefilter_permutations()
/third_party/rust/crates/memchr/src/memmem/prefilter/
Dgenericsimd.rs53 let min_haystack_len = rare2i + size_of::<V>(); in find() localVariable
54 if haystack.len() < min_haystack_len { in find()
60 let max_ptr = end_ptr.sub(min_haystack_len); in find()