Home
last modified time | relevance | path

Searched refs:borrow (Results 1 - 25 of 163) sorted by relevance

1234567

/third_party/rust/crates/rustix/tests/path/
H A Darg.rs6 use std::borrow::Cow;
13 use std::borrow::Borrow; in test_arg()
18 assert_eq!(cstr!("hello"), Borrow::borrow(&t.as_cow_c_str().unwrap())); in test_arg()
19 assert_eq!(cstr!("hello"), Borrow::borrow(&t.into_c_str().unwrap())); in test_arg()
24 assert_eq!(cstr!("hello"), Borrow::borrow(&t.as_cow_c_str().unwrap())); in test_arg()
25 assert_eq!(cstr!("hello"), Borrow::borrow(&t.into_c_str().unwrap())); in test_arg()
30 assert_eq!(cstr!("hello"), Borrow::borrow(&t.as_cow_c_str().unwrap())); in test_arg()
31 assert_eq!(cstr!("hello"), Borrow::borrow(&t.into_c_str().unwrap())); in test_arg()
36 assert_eq!(cstr!("hello"), Borrow::borrow(&t.as_cow_c_str().unwrap())); in test_arg()
37 assert_eq!(cstr!("hello"), Borrow::borrow( in test_arg()
[all...]
/third_party/node/deps/v8/src/bigint/
H A Dvector-arithmetic.cc30 digit_t borrow = 0; in SubAndReturnBorrow()
33 Z[i] = digit_sub2(Z[i], X[i], borrow, &borrow); in SubAndReturnBorrow()
35 for (; i < Z.len() && borrow != 0; i++) { in SubAndReturnBorrow()
36 Z[i] = digit_sub(Z[i], borrow, &borrow); in SubAndReturnBorrow()
38 return borrow; in SubAndReturnBorrow()
64 digit_t borrow = 0; in Subtract() local
66 Z[i] = digit_sub2(X[i], Y[i], borrow, &borrow); in Subtract()
86 digit_t borrow = 0; SubtractAndReturnBorrow() local
131 digit_t borrow = 1; SubtractOne() local
[all...]
H A Dmul-fft.cc29 digit_t borrow = high; in ModFn_Helper() local
32 x[i] = digit_sub(x[i], borrow, &borrow); in ModFn_Helper()
33 if (borrow == 0) break; in ModFn_Helper()
66 digit_t borrow = 0; in ModFnDoubleWidth() local
68 dest[i] = digit_sub2(src[i], src[i + K], borrow, &borrow); in ModFnDoubleWidth()
70 dest[K] = digit_sub2(0, src[2 * K], borrow, &borrow); in ModFnDoubleWidth()
71 // {borrow} ma in ModFnDoubleWidth()
81 digit_t borrow = 0; SumDiff() local
112 digit_t borrow = 0; ShiftModFn_Large() local
198 digit_t borrow = 0; ShiftModFn() local
[all...]
H A Dbitwise.cc45 digit_t borrow = 1; in BitwiseAnd_PosNeg() local
47 for (; i < pairs; i++) Z[i] = X[i] & ~digit_sub(Y[i], borrow, &borrow); in BitwiseAnd_PosNeg()
82 digit_t borrow = 1; in BitwiseOr_PosNeg() local
84 for (; i < pairs; i++) Z[i] = digit_sub(Y[i], borrow, &borrow) & ~X[i]; in BitwiseOr_PosNeg()
85 for (; i < Y.len(); i++) Z[i] = digit_sub(Y[i], borrow, &borrow); in BitwiseOr_PosNeg()
86 DCHECK(borrow == 0); in BitwiseOr_PosNeg()
125 digit_t borrow in BitwiseXor_PosNeg() local
249 digit_t borrow = 0; TruncateAndSubFromPowerOfTwo() local
[all...]
H A Dvector-arithmetic.h19 // Z -= X. Returns borrow on overflow.
34 digit_t borrow = y; in Subtract() local
37 X[i] = digit_sub(X[i], borrow, &borrow); in Subtract()
39 } while (borrow != 0); in Subtract()
43 // result in (part of) Z, and return the carry/borrow.
H A Ddiv-barrett.cc48 digit_t borrow = 0; in InvertBasecase() local
51 for (; i < 2 * n; i++) X[i] = digit_sub2(0, V[i - n], borrow, &borrow); in InvertBasecase()
52 DCHECK(borrow == 1); in InvertBasecase()
152 digit_t borrow = SubtractAndReturnBorrow(Z, W, U); in InvertNewton() local
153 DCHECK(borrow == 0); in InvertNewton()
154 USE(borrow); in InvertNewton()
164 digit_t borrow = SubtractAndReturnBorrow(Z, W_part, U_part); in InvertNewton() local
165 digit_t integer_part = W.msd() - U.msd() - borrow; in InvertNewton()
246 digit_t borrow in DivideBarrett()
[all...]
H A Dmul-karatsuba.cc73 digit_t borrow = 0; in KaratsubaSubtractionHelper() local
80 result[i] = digit_sub2(X[i], Y[i], borrow, &borrow); in KaratsubaSubtractionHelper()
83 result[i] = digit_sub(X[i], borrow, &borrow); in KaratsubaSubtractionHelper()
85 DCHECK(borrow == 0); in KaratsubaSubtractionHelper()
/third_party/rust/crates/lazycell/src/
H A Dlib.rs35 //! assert_eq!(lazycell.borrow(), None);
39 //! assert_eq!(lazycell.borrow(), Some(&1));
90 /// be usable, however, as `&mut self` may not be possible to borrow.
101 self.borrow().is_some() in filled()
109 pub fn borrow(&self) -> Option<&T> { in borrow() functions
132 if let Some(value) = self.borrow() { in borrow_with()
139 self.borrow().unwrap() in borrow_with()
170 if let Some(value) = self.borrow() { in try_borrow_with()
177 Ok(self.borrow().unwrap()) in try_borrow_with()
225 LazyCell { inner: UnsafeCell::new(self.borrow() in clone()
298 pub fn borrow(&self) -> Option<&T> { borrow() functions
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/marl/src/
H A Dpool_test.cpp42 pool.borrow(); in TEST_P()
52 pool.borrow(); in TEST_P()
62 pool.borrow(); in TEST_P()
72 pool.borrow(); in TEST_P()
99 auto loan = pool.borrow(); in TEST_P()
106 auto loan = pool.borrow(); in TEST_P()
120 auto loan = pool.borrow(); in TEST_P()
127 auto loan = pool.borrow(); in TEST_P()
141 auto loan = pool.borrow(); in TEST_P()
149 auto loan = pool.borrow(); in TEST_P()
[all...]
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dbignum.cc221 Chunk borrow = 0; in SubtractBignum() local
224 DOUBLE_CONVERSION_ASSERT((borrow == 0) || (borrow == 1)); in SubtractBignum()
225 const Chunk difference = RawBigit(i + offset) - other.RawBigit(i) - borrow; in SubtractBignum()
227 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
229 while (borrow != 0) { in SubtractBignum()
230 const Chunk difference = RawBigit(i + offset) - borrow; in SubtractBignum()
232 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
690 Chunk borrow = 0;
698 if (sum > chunk_c + borrow) {
[all...]
/third_party/icu/icu4c/source/i18n/
H A Ddouble-conversion-bignum.cpp235 Chunk borrow = 0; in SubtractBignum() local
238 DOUBLE_CONVERSION_ASSERT((borrow == 0) || (borrow == 1)); in SubtractBignum()
239 const Chunk difference = RawBigit(i + offset) - other.RawBigit(i) - borrow; in SubtractBignum()
241 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
243 while (borrow != 0) { in SubtractBignum()
244 const Chunk difference = RawBigit(i + offset) - borrow; in SubtractBignum()
246 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
704 Chunk borrow = 0;
712 if (sum > chunk_c + borrow) {
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Ddouble-conversion-bignum.cpp235 Chunk borrow = 0; in SubtractBignum() local
238 DOUBLE_CONVERSION_ASSERT((borrow == 0) || (borrow == 1)); in SubtractBignum()
239 const Chunk difference = RawBigit(i + offset) - other.RawBigit(i) - borrow; in SubtractBignum()
241 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
243 while (borrow != 0) { in SubtractBignum()
244 const Chunk difference = RawBigit(i + offset) - borrow; in SubtractBignum()
246 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
704 Chunk borrow = 0;
712 if (sum > chunk_c + borrow) {
[all...]
/third_party/node/deps/v8/src/base/numbers/
H A Dbignum.cc189 Chunk borrow = 0; in SubtractBignum() local
192 DCHECK((borrow == 0) || (borrow == 1)); in SubtractBignum()
193 Chunk difference = bigits_[i + offset] - other.bigits_[i] - borrow; in SubtractBignum()
195 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
197 while (borrow != 0) { in SubtractBignum()
198 Chunk difference = bigits_[i + offset] - borrow; in SubtractBignum()
200 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
600 Chunk borrow = 0; in PlusCompare() local
608 if (sum > chunk_c + borrow) { in PlusCompare()
695 Chunk borrow = 0; SubtractTimes() local
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Ddouble-conversion-bignum.cpp234 Chunk borrow = 0; in SubtractBignum() local
237 DOUBLE_CONVERSION_ASSERT((borrow == 0) || (borrow == 1)); in SubtractBignum()
238 const Chunk difference = RawBigit(i + offset) - other.RawBigit(i) - borrow; in SubtractBignum()
240 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
242 while (borrow != 0) { in SubtractBignum()
243 const Chunk difference = RawBigit(i + offset) - borrow; in SubtractBignum()
245 borrow = difference >> (kChunkSize - 1); in SubtractBignum()
703 Chunk borrow = 0;
711 if (sum > chunk_c + borrow) {
[all...]
/third_party/python/Modules/_decimal/libmpdec/
H A Dbasearith.c165 mpd_uint_t borrow = 0; in _mpd_basesub() local
172 d = u[i] - (v[i] + borrow); in _mpd_basesub()
173 borrow = (u[i] < d); in _mpd_basesub()
174 w[i] = borrow ? d + MPD_RADIX : d; in _mpd_basesub()
176 /* if there is a borrow, propagate it */ in _mpd_basesub()
177 for (; borrow && i < m; i++) { in _mpd_basesub()
178 d = u[i] - borrow; in _mpd_basesub()
179 borrow = (u[i] == 0); in _mpd_basesub()
180 w[i] = borrow ? MPD_RADIX-1 : d; in _mpd_basesub()
190 * propagated further, but eventually w can absorb the final borrow
196 mpd_uint_t borrow = 0; _mpd_basesubfrom() local
[all...]
/third_party/FreeBSD/contrib/gdtoa/
H A Dmisc.c533 ULLong borrow, y; local
535 ULong borrow, y; local
565 borrow = 0;
568 y = (ULLong)*xa++ - *xb++ - borrow;
569 borrow = y >> 32 & 1UL;
574 y = *xa++ - borrow;
575 borrow = y >> 32 & 1UL;
581 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
582 borrow = (y & 0x10000) >> 16;
583 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/marl/include/marl/
H A Dpool.h30 // Call the Pool items constructor on borrow(), and destruct the item
51 // A Loan is returned by the pool's borrow() function.
215 // borrow() borrows a single item from the pool, blocking until an item is
217 MARL_NO_EXPORT inline Loan borrow() const;
219 // borrow() borrows count items from the pool, blocking until there are at
224 MARL_NO_EXPORT inline void borrow(size_t count, const F& f) const;
226 // tryBorrow() attempts to borrow a single item from the pool without
274 typename BoundedPool<T, N, POLICY>::Loan BoundedPool<T, N, POLICY>::borrow() in borrow() function in marl::BoundedPool
277 borrow(1, [&](Loan&& loan) { out = std::move(loan); }); in borrow()
283 void BoundedPool<T, N, POLICY>::borrow(size_ function in marl::BoundedPool
396 Loan<T> UnboundedPool<T, POLICY>::borrow() const { borrow() function in marl::UnboundedPool
404 inline void UnboundedPool<T, POLICY>::borrow(size_t n, const F& f) const { borrow() function in marl::UnboundedPool
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_mod.c141 BN_ULONG borrow, carry, ta, tb, mask, *rp; in bn_mod_sub_fixed_top() local
151 for (i = 0, ai = 0, bi = 0, borrow = 0; i < mtop;) { in bn_mod_sub_fixed_top()
157 rp[i] = ta - tb - borrow; in bn_mod_sub_fixed_top()
159 borrow = (ta < tb); in bn_mod_sub_fixed_top()
166 for (i = 0, mask = 0 - borrow, carry = 0; i < mtop; i++) { in bn_mod_sub_fixed_top()
172 borrow -= carry; in bn_mod_sub_fixed_top()
173 for (i = 0, mask = 0 - borrow, carry = 0; i < mtop; i++) { in bn_mod_sub_fixed_top()
H A Dbn_add.c128 BN_ULONG t1, t2, borrow, *rp; in BN_usub() local
150 borrow = bn_sub_words(rp, ap, bp, min); in BN_usub()
157 t2 = (t1 - borrow) & BN_MASK2; in BN_usub()
159 borrow &= (t1 == 0); in BN_usub()
/third_party/openssl/crypto/bn/
H A Dbn_mod.c136 BN_ULONG borrow, carry, ta, tb, mask, *rp; in bn_mod_sub_fixed_top() local
146 for (i = 0, ai = 0, bi = 0, borrow = 0; i < mtop;) { in bn_mod_sub_fixed_top()
152 rp[i] = ta - tb - borrow; in bn_mod_sub_fixed_top()
154 borrow = (ta < tb); in bn_mod_sub_fixed_top()
161 for (i = 0, mask = 0 - borrow, carry = 0; i < mtop; i++) { in bn_mod_sub_fixed_top()
167 borrow -= carry; in bn_mod_sub_fixed_top()
168 for (i = 0, mask = 0 - borrow, carry = 0; i < mtop; i++) { in bn_mod_sub_fixed_top()
/third_party/rust/crates/regex/tests/
H A Dreplace.rs155 t!(std::borrow::Cow::<'_, str>::Borrowed("Z")),
163 t!(&std::borrow::Cow::<'_, str>::Borrowed("Z")),
171 t!(std::borrow::Cow::<'_, str>::Owned("Z".to_string())),
179 t!(&std::borrow::Cow::<'_, str>::Owned("Z".to_string())),
204 bytes!(std::borrow::Cow::<'_, [u8]>::Borrowed(&[b'Z'])),
212 bytes!(&std::borrow::Cow::<'_, [u8]>::Borrowed(&[b'Z'])),
220 bytes!(std::borrow::Cow::<'_, [u8]>::Owned(vec![b'Z'])),
228 bytes!(&std::borrow::Cow::<'_, [u8]>::Owned(vec![b'Z'])),
/third_party/mbedtls/library/
H A Dbignum_mod_raw.c184 mbedtls_mpi_uint carry, borrow; in mbedtls_mpi_mod_raw_add() local
186 borrow = mbedtls_mpi_core_sub(X, X, N->p, N->limbs); in mbedtls_mpi_mod_raw_add()
187 (void) mbedtls_mpi_core_add_if(X, N->p, N->limbs, (unsigned) (carry ^ borrow)); in mbedtls_mpi_mod_raw_add()
272 mbedtls_mpi_uint borrow = mbedtls_mpi_core_sub(X, X, N->p, N->limbs); in mbedtls_mpi_mod_raw_neg() local
273 (void) mbedtls_mpi_core_add_if(X, N->p, N->limbs, (unsigned) borrow); in mbedtls_mpi_mod_raw_neg()
/third_party/rust/crates/clap/src/util/
H A Dflat_map.rs3 use std::borrow::Borrow;
48 if existing.borrow() == key { in contains_key()
72 .find_map(|(i, k)| (k.borrow() == key).then_some(i))); in remove_entry()
97 if existing.borrow() == k { in get()
110 if existing.borrow() == k { in get_mut()
/third_party/rust/crates/foreign-types/foreign-types/src/
H A Dlib.rs5 //! or a borrow.
256 impl ::std::borrow::ToOwned for $borrowed {
284 impl ::std::borrow::Borrow<$borrowed> for $owned {
286 fn borrow(&self) -> &$borrowed { in borrow() functions
/third_party/rust/crates/nom/src/
H A Dlib.rs401 pub use core::borrow;
405 pub use alloc::{borrow, boxed, string, vec};
423 alloc, borrow, boxed, cmp, collections, convert, fmt, hash, iter, mem, ops, option, result,

Completed in 15 milliseconds

1234567