Searched defs:bit (Results 1 - 4 of 4) sorted by relevance

/art/disassembler/
H A Ddisassembler.h73 static inline bool HasBitSet(uint32_t value, uint32_t bit) { argument
74 return (value & (1 << bit)) != 0;
/art/compiler/dex/quick/
H A Dresource_mask.h42 * Def/Use encoding in 128-bit use_mask/def_mask. Low positions used for target-specific
75 static constexpr ResourceMask Bit(size_t bit) { argument
76 return ResourceMask(bit >= 64u ? 0u : UINT64_C(1) << bit,
77 bit >= 64u ? UINT64_C(1) << (bit - 64u) : 0u);
116 void SetBit(size_t bit) { argument
117 DCHECK_LE(bit, kHighestCommonResource);
118 masks_[bit / 64u] |= UINT64_C(1) << (bit
[all...]
/art/runtime/
H A Dutils.h114 // Check whether an N-bit two's-complement representation can hold value.
221 static constexpr inline T RoundUpToPowerOfTwoRecursive(T x, size_t bit) { argument
222 return bit == (BitSizeOf<T>()) ? x: RoundUpToPowerOfTwoRecursive(x | x >> bit, bit << 1);
246 // Find the bit position of the most significant bit (0-based), or -1 if there were no bits set.
290 // Interpret the bit pattern of input (type U) as type V. Requires the size
H A Ddex_file_verifier.cc330 uint32_t bit = MapTypeToBitMask(item->type_); local
332 if (UNLIKELY(bit == 0)) {
337 if (UNLIKELY((used_bits & bit) != 0)) {
342 used_bits |= bit;
829 // Special case of bit pattern 0xxx.
843 // No extra checks necessary for bit pattern 0xxx.
850 // Illegal bit patterns 10xx or 1111.

Completed in 230 milliseconds