Home
last modified time | relevance | path

Searched refs:kBits (Results 1 – 14 of 14) sorted by relevance

/external/libtextclassifier/common/
Dfastexp.h35 static const int kBits = 7;
36 static const int kMask1 = (1 << kBits) - 1;
37 static const int kMask2 = 0xFF << kBits;
41 int32 exp1[1 << kBits];
47 const float g = f + (127 + (1 << (23 - kBits))); in VeryFastExp2()
49 int32 ret = ((x & kMask2) << (23 - kBits)) in VeryFastExp2()
Dfastexp.cc22 const int FastMathClass::kBits; member in libtextclassifier::nlp_core::FastMathClass
/external/gemmlowp/public/
Dbit_depth.h27 static const int kBits = tBits; member
28 static_assert(kBits >= 1 && kBits <= 8, "bad bit depth");
/external/libchrome/base/
Drand_util.cc44 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/
Dpack_SSE.h39 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()
Dkernel_default.h35 : DefaultKernelImpl<Family, BitDepthParams::LhsBitDepth::kBits +
36 BitDepthParams::RhsBitDepth::kBits> {};
Dpack_neon.h124 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()
Dunpack.h102 const int kLhsBits = BitDepthParams::LhsBitDepth::kBits; in Unpack()
103 const int kRhsBits = BitDepthParams::RhsBitDepth::kBits; in Unpack()
Dpack.h268 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()
Dunpack_neon.h82 const int kLhsBits = BitDepthParams::LhsBitDepth::kBits;
83 const int kRhsBits = BitDepthParams::RhsBitDepth::kBits;
/external/boringssl/src/crypto/rsa/
Drsa_test.cc652 static const size_t kBits = 1024; in TEST() local
654 RSA_generate_multi_prime_key(rsa.get(), kBits, 3, e.get(), nullptr)); in TEST()
659 uint8_t encrypted[kBits / 8], decrypted[kBits / 8]; in TEST()
/external/boringssl/src/crypto/bn/
Dbn_test.cc1492 static const unsigned kBits = 10; in TestSmallPrime() local
1495 if (!r || !BN_generate_prime_ex(r.get(), static_cast<int>(kBits), 0, NULL, in TestSmallPrime()
1499 if (BN_num_bits(r.get()) != kBits) { in TestSmallPrime()
1500 fprintf(stderr, "Expected %u bit prime, got %u bit number\n", kBits, in TestSmallPrime()
/external/gemmlowp/test/
Dtest.cc424 if (BitDepthParams::LhsBitDepth::kBits < 8 || in test_gemm_impl()
425 BitDepthParams::RhsBitDepth::kBits < 8) { in test_gemm_impl()
/external/v8/src/regexp/
Djsregexp.cc2041 static const int kBits = RegExpMacroAssembler::kTableSizeBits; in GenerateBranches() local
2043 if ((max_char >> kBits) == (min_char >> kBits)) { in GenerateBranches()
2055 if ((min_char >> kBits) != (first >> kBits)) { in GenerateBranches()