Home
last modified time | relevance | path

Searched refs:V (Results 1 – 13 of 13) sorted by relevance

/system/bt/stack/smp/
Dp_256_multprecision.c273 DWORD V; in multiprecision_mult() local
275 U = V = W = 0; in multiprecision_mult()
287 V = a[i] * b[j]; in multiprecision_mult()
288 V = V + U; in multiprecision_mult()
289 U = (V < U); in multiprecision_mult()
291 V = V + c[i+j]; in multiprecision_mult()
292 U += (V < c[i+j]); in multiprecision_mult()
293 c[i+j] = V; in multiprecision_mult()
302 DWORD V; in multiprecision_fast_mod() local
350 V = c[0] < U; in multiprecision_fast_mod()
[all …]
Dsmp_int.h378 extern void smp_f4_calc_chk (UINT8 *U, UINT8 *V, UINT8 *X, UINT8 *Z, UINT8 *mac);
379 extern void smp_g2_calc_chk (UINT8 *U, UINT8 *V, UINT8 *X, UINT8 *Y);
/system/core/libpixelflinger/codeflinger/tinyutils/
DTypeHelpers.h233 template <typename K, typename V>
234 struct trait_trivial_ctor< key_value_pair_t<K, V> >
235 { enum { value = aggregate_traits<K,V>::has_trivial_ctor }; };
237 template <typename K, typename V>
238 struct trait_trivial_dtor< key_value_pair_t<K, V> >
239 { enum { value = aggregate_traits<K,V>::has_trivial_dtor }; };
241 template <typename K, typename V>
242 struct trait_trivial_copy< key_value_pair_t<K, V> >
243 { enum { value = aggregate_traits<K,V>::has_trivial_copy }; };
245 template <typename K, typename V>
[all …]
/system/core/include/utils/
DTypeHelpers.h248 template <typename K, typename V>
249 struct trait_trivial_ctor< key_value_pair_t<K, V> >
250 { enum { value = aggregate_traits<K,V>::has_trivial_ctor }; };
251 template <typename K, typename V>
252 struct trait_trivial_dtor< key_value_pair_t<K, V> >
253 { enum { value = aggregate_traits<K,V>::has_trivial_dtor }; };
254 template <typename K, typename V>
255 struct trait_trivial_copy< key_value_pair_t<K, V> >
256 { enum { value = aggregate_traits<K,V>::has_trivial_copy }; };
257 template <typename K, typename V>
[all …]
DLruCache.h116 template<typename K, typename V>
117 void LruCache<K, V>::setOnEntryRemovedListener(OnEntryRemoved<K, V>* listener) { in setOnEntryRemovedListener()
DList.h103 template<typename V> explicit
104 _ListIterator(const V& rhs) : mpNode(rhs.mpNode) {} in _ListIterator()
/system/core/libmincrypt/
Dp256.c297 p256_int V = *a; in p256_modinv_vartime() local
308 } else if (p256_is_even(&V)) { in p256_modinv_vartime()
309 p256_shr1(&V, 0, &V); in p256_modinv_vartime()
317 if (!p256_sub(&V, &U, NULL)) { in p256_modinv_vartime()
318 p256_sub(&V, &U, &V); in p256_modinv_vartime()
320 if (p256_is_zero(&V)) break; // done. in p256_modinv_vartime()
322 p256_sub(&U, &V, &U); in p256_modinv_vartime()
/system/core/libpixelflinger/codeflinger/
Dtexturing.cpp472 int V = 0; in build_textures() local
513 V = scratches.obtain(); in build_textures()
524 AND(AL, 0, V, v, imm((1<<FRAC_BITS)-1)); in build_textures()
644 case 1: filter8(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
645 case 2: filter16(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
646 case 3: filter24(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
647 case 4: filter32(parts, texel, tmu, U, V, txPtr, FRAC_BITS); break; in build_textures()
695 int U, int V, pointer_t& txPtr, in filter8() argument
727 SMULBB(AL, u, U, V); in filter8()
734 SMULBB(AL, u, U, V); in filter8()
[all …]
DGGLAssembler.h446 int U, int V, pointer_t& txPtr,
451 int U, int V, pointer_t& txPtr,
456 int U, int V, pointer_t& txPtr,
461 int U, int V, pointer_t& txPtr,
/system/netd/server/
DList.h104 template<typename V> explicit
105 _ListIterator(const V& rhs) : mpNode(rhs.mpNode) {} in _ListIterator()
/system/core/include/sysutils/
DList.h104 template<typename V> explicit
105 _ListIterator(const V& rhs) : mpNode(rhs.mpNode) {} in _ListIterator()
/system/keymaster/
DList.h103 template<typename V> explicit
104 _ListIterator(const V& rhs) : mpNode(rhs.mpNode) {} in _ListIterator()
/system/core/libsync/tests/
Dsync_test.cpp551 template <typename K, typename V> using dict = unordered_map<K,V>;