Searched refs:kBits (Results 1 – 14 of 14) sorted by relevance
| /external/gemmlowp/public/ |
| D | bit_depth.h | 27 static const int kBits = tBits; member
28 static_assert(kBits >= 1 && kBits <= 8, "bad bit depth");
|
| /external/ceres-solver/internal/ceres/ |
| D | integral_types.h | 51 typename Ternary<sizeof(TYPE) * 8 == kBits, TYPE,
53 template<int kBits>
65 template<int kBits>
|
| /external/libchrome/base/ |
| D | rand_util.cc | 44 static const int kBits = std::numeric_limits<double>::digits; in BitsToOpenEndedUnitInterval() local
45 uint64_t random_bits = bits & ((UINT64_C(1) << kBits) - 1); in BitsToOpenEndedUnitInterval()
46 double result = ldexp(static_cast<double>(random_bits), -1 * kBits); in BitsToOpenEndedUnitInterval()
|
| /external/libweave/third_party/chromium/base/ |
| D | rand_util.cc | 44 static const int kBits = std::numeric_limits<double>::digits; in BitsToOpenEndedUnitInterval() local
45 uint64_t random_bits = bits & ((UINT64_C(1) << kBits) - 1); in BitsToOpenEndedUnitInterval()
46 double result = ldexp(static_cast<double>(random_bits), -1 * kBits); in BitsToOpenEndedUnitInterval()
|
| /external/gemmlowp/internal/ |
| D | pack_SSE.h | 39 static const int kBits = QuantizationParams::BitDepth::kBits; in SSERequantize() local
40 static const std::uint8_t kMaxVal = (1 << kBits) - 1; in SSERequantize()
41 if (kBits == 8) { in SSERequantize()
|
| D | kernel_default.h | 35 : DefaultKernelImpl<Family, BitDepthParams::LhsBitDepth::kBits +
36 BitDepthParams::RhsBitDepth::kBits> {};
|
| D | pack_neon.h | 124 static const int kBits = QuantizationParams::BitDepth::kBits; in Requantize() local
125 static const std::uint8_t kMaxVal = (1 << kBits) - 1; in Requantize()
127 if (kBits == 8) { in Requantize()
|
| D | unpack.h | 102 const int kLhsBits = BitDepthParams::LhsBitDepth::kBits; in Unpack()
103 const int kRhsBits = BitDepthParams::RhsBitDepth::kBits; in Unpack()
|
| D | pack.h | 268 static const int kBits = QuantizationParams::BitDepth::kBits; in Requantize() local
269 static const std::uint8_t kMaxVal = (1 << kBits) - 1; in Requantize()
271 if (kBits == 8) { in Requantize()
|
| D | unpack_neon.h | 82 const int kLhsBits = BitDepthParams::LhsBitDepth::kBits;
83 const int kRhsBits = BitDepthParams::RhsBitDepth::kBits;
|
| /external/boringssl/src/crypto/rsa/ |
| D | rsa_test.cc | 642 static const size_t kBits = 1024; in TestMultiPrimeKeygen() local
643 uint8_t encrypted[kBits / 8], decrypted[kBits / 8]; in TestMultiPrimeKeygen()
650 !RSA_generate_multi_prime_key(rsa.get(), kBits, 3, e.get(), nullptr) || in TestMultiPrimeKeygen()
|
| /external/boringssl/src/crypto/bn/ |
| D | bn_test.cc | 1403 static const unsigned kBits = 10; in test_small_prime() local
1406 if (!r || !BN_generate_prime_ex(r.get(), static_cast<int>(kBits), 0, NULL, in test_small_prime()
1410 if (BN_num_bits(r.get()) != kBits) { in test_small_prime()
1411 fprintf(fp, "Expected %u bit prime, got %u bit number\n", kBits, in test_small_prime()
|
| /external/gemmlowp/test/ |
| D | test.cc | 424 if (BitDepthParams::LhsBitDepth::kBits < 8 || in test_gemm_impl()
425 BitDepthParams::RhsBitDepth::kBits < 8) { in test_gemm_impl()
|
| /external/v8/src/regexp/ |
| D | jsregexp.cc | 2004 static const int kBits = RegExpMacroAssembler::kTableSizeBits; in GenerateBranches() local
2006 if ((max_char >> kBits) == (min_char >> kBits)) { in GenerateBranches()
2018 if ((min_char >> kBits) != (first >> kBits)) { in GenerateBranches()
|