Searched defs:bits (Results 1 - 6 of 6) sorted by relevance

/art/runtime/base/
H A Dbit_vector_test.cc71 uint32_t bits[kWords]; local
72 memset(bits, 0, sizeof(bits));
74 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits);
77 EXPECT_EQ(bits, bv.GetRawStorage());
128 uint32_t bits[kWords]; local
129 memset(bits, 0, sizeof(bits));
131 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits);
241 // `buf` is long enough to hold all set bits, copyin
[all...]
H A Dbit_utils.h57 // Return the number of 1-bits in `x`.
65 // Find the bit position of the most significant bit (0-based), or -1 if there were no bits set.
74 // Find the bit position of the least significant bit (0-based), or -1 if there were no bits set.
82 // How many bits (minimally) does it take to store the constant 'value'? i.e. 1 for 1, 3 for 5, etc.
176 // Like sizeof, but count how many bits a type takes. Pass type explicitly.
186 // Like sizeof, but count how many bits a type takes. Infers type from parameter.
222 static constexpr T GetIntLimit(size_t bits) { argument
224 DCHECK_CONSTEXPR(bits > 0, "bits cannot be zero", 0)
225 DCHECK_CONSTEXPR(bits < BitSizeO
270 MaxInt(size_t bits) argument
284 MinInt(size_t bits) argument
307 BitIteratorBase(T bits) argument
363 LowToHighBits(T bits) argument
369 HighToLowBits(T bits) argument
[all...]
H A Dbit_vector.h39 * @brief Convenient iterator across the indexes of the BitVector's set bits.
42 * to the highest index of the BitVector's set bits. Instances can be retrieved
90 uint32_t bit_index_; // Current index (size in bits).
96 * @brief BitVector wrapper class for iteration across indexes of set bits.
143 // The number of words necessary to encode bits.
144 static constexpr uint32_t BitsToWords(uint32_t bits) { argument
145 return RoundUp(bits, kWordBits) / kWordBits;
176 // Mark all bits bit as "clear".
179 // Mark specified number of bits as "set". Cannot set all bits lik
[all...]
/art/runtime/
H A Dart_field-inl.h217 JValue bits; local
218 bits.SetI(Get32(object));
219 return bits.GetF();
225 JValue bits; local
226 bits.SetF(f);
227 Set32<kTransactionActive>(object, bits.GetI());
232 JValue bits; local
233 bits.SetJ(Get64(object));
234 return bits.GetD();
240 JValue bits; local
[all...]
H A Ddex_file_verifier_test.cc881 uint32_t bits = POPCOUNT(kInterfaceDisallowed); local
882 for (uint32_t i = 1; i < (1u << bits); ++i) {
1045 uint32_t bits = POPCOUNT(kAccFlags); local
1046 for (uint32_t j = 1; j < (1u << bits); ++j) {
1255 uint32_t bits = POPCOUNT(kInterfaceDisallowed); local
1256 for (uint32_t i = 1; i < (1u << bits); ++i) {
/art/compiler/optimizing/
H A Dcode_generator_arm64.cc2566 int bits = instruction->GetResultType() == Primitive::kPrimInt ? 32 : 64; local
2567 __ Asr(temp, dividend, bits - 1);
2568 __ Lsr(temp, temp, bits - ctz_imm);
4082 constexpr size_t offset_bits = /* encoded bits */ 12 + /* scale */ 2;
4683 // bits, so we don't need to sign-extend and can just perform a move.
4685 // top 32 bits of the target register. We theoretically could leave those
4686 // bits unchanged, but we would have to make sure that no code uses a
4687 // 32bit input value as a 64bit value assuming that the top 32 bits are
5061 // Introduce a dependency on the high bits of rb_state, which shall

Completed in 64 milliseconds