Home
last modified time | relevance | path

Searched refs:vn1 (Results 1 - 7 of 7) sorted by relevance

/third_party/rust/crates/memchr/src/memchr/x86/
H A Dsse2.rs108 let vn1 = _mm_set1_epi8(n1 as i8); in memchr()
125 if let Some(i) = forward_search1(start_ptr, end_ptr, ptr, vn1) { in memchr()
138 let eqa = _mm_cmpeq_epi8(vn1, a); in memchr()
139 let eqb = _mm_cmpeq_epi8(vn1, b); in memchr()
140 let eqc = _mm_cmpeq_epi8(vn1, c); in memchr()
141 let eqd = _mm_cmpeq_epi8(vn1, d); in memchr()
174 if let Some(i) = forward_search1(start_ptr, end_ptr, ptr, vn1) { in memchr()
184 return forward_search1(start_ptr, end_ptr, ptr, vn1); in memchr()
191 let vn1 = _mm_set1_epi8(n1 as i8); in memchr2()
209 if let Some(i) = forward_search2(start_ptr, end_ptr, ptr, vn1, vn in memchr2()
[all...]
H A Davx.rs75 let vn1 = _mm256_set1_epi8(n1 as i8); in memchr()
77 if let Some(i) = forward_search1(start_ptr, end_ptr, ptr, vn1) { in memchr()
90 let eqa = _mm256_cmpeq_epi8(vn1, a); in memchr()
91 let eqb = _mm256_cmpeq_epi8(vn1, b); in memchr()
92 let eqc = _mm256_cmpeq_epi8(vn1, c); in memchr()
93 let eqd = _mm256_cmpeq_epi8(vn1, d); in memchr()
106 if let Some(i) = forward_search1(start_ptr, end_ptr, ptr, vn1) { in memchr()
116 return forward_search1(start_ptr, end_ptr, ptr, vn1); in memchr()
147 let vn1 = _mm256_set1_epi8(n1 as i8); in memchr2()
165 if let Some(i) = forward_search2(start_ptr, end_ptr, ptr, vn1, vn in memchr2()
[all...]
H A Dsse42.rs29 let vn1 = _mm_set1_epi8(n1 as i8); in memchr3()
62 return sse2::forward_search3(start_ptr, end_ptr, ptr, vn1, vn2, vn3); in memchr3()
/third_party/rust/crates/memchr/src/memchr/
H A Dfallback.rs47 let vn1 = repeat_byte(n1); in memchr()
61 if contains_zero_byte(chunk ^ vn1) { in memchr()
73 let eqa = contains_zero_byte(a ^ vn1); in memchr()
74 let eqb = contains_zero_byte(b ^ vn1); in memchr()
86 let vn1 = repeat_byte(n1); in memchr2()
100 let eq1 = contains_zero_byte(chunk ^ vn1); in memchr2()
113 let eq1 = contains_zero_byte(chunk ^ vn1); in memchr2()
126 let vn1 = repeat_byte(n1); in memchr3()
141 let eq1 = contains_zero_byte(chunk ^ vn1); in memchr3()
155 let eq1 = contains_zero_byte(chunk ^ vn1); in memchr3()
[all...]
/third_party/python/Modules/_decimal/libmpdec/
H A Dtypearith.h135 vn1, vn0, in _mpd_div_words() local
145 vn1 = v >> 32; in _mpd_div_words()
155 q1 = un32 / vn1; in _mpd_div_words()
156 rhat = un32 - q1*vn1; in _mpd_div_words()
160 rhat = rhat + vn1; in _mpd_div_words()
166 * (1) q1*vn1 + rhat = un32 in _mpd_div_words()
167 * (2) q1*vn1*b + rhat*b + un1 = un32*b + un1 in _mpd_div_words()
173 * (3) q1*vn1*b + q1*vn0 <= un32*b + un1 in _mpd_div_words()
191 q0 = un21 / vn1; in _mpd_div_words()
192 rhat = un21 - q0*vn1; in _mpd_div_words()
[all...]
/third_party/node/deps/v8/src/bigint/
H A Ddigit-arithmetic.h155 digit_t vn1 = divisor >> kHalfDigitBits; in digit_div()
170 digit_t q1 = un32 / vn1; in digit_div()
171 digit_t rhat = un32 - q1 * vn1; in digit_div()
175 rhat += vn1; in digit_div()
180 digit_t q0 = un21 / vn1; in digit_div()
181 rhat = un21 - q0 * vn1; in digit_div()
185 rhat += vn1; in digit_div()
H A Ddiv-schoolbook.cc125 // {vn1} is the divisor's most significant digit. in DivideSchoolbook()
126 digit_t vn1 = B[n - 1]; in DivideSchoolbook() local
134 if (ujn != vn1) { in DivideSchoolbook()
140 qhat = digit_div(ujn, U[j + n - 1], vn1, &rhat); in DivideSchoolbook()
150 rhat += vn1; in DivideSchoolbook()

Completed in 3 milliseconds