Home
last modified time | relevance | path

Searched refs:raw_bits_ (Results 1 – 2 of 2) sorted by relevance

/art/compiler/dex/
Dtype_inference.h120 return raw_bits_ != 0u; in IsDefined()
130 return (raw_bits_ & kMaskType) != 0u && !IsPowerOfTwo(raw_bits_ & kMaskType); // 2+ bits. in TypeConflict()
143 DCHECK_EQ(raw_bits_ & (kMaskWideAndType | kMaskWord), kFlagNarrow | kFlagRef | kFlagLowWord); in CheckPureRef()
187 return raw_bits_ >> kBitArrayDepthStart; in ArrayDepth()
192 return Type(kFlagLowWord | ((raw_bits_ & kMaskArrayWideAndType) >> kArrayTypeShift)); in NestedType()
197 Type temp(raw_bits_ - (1u << kBitArrayDepthStart)); // array_depth - 1u; in ComponentType()
230 DCHECK_EQ(raw_bits_ & (kMaskWide | kMaskWord), kFlagWide | kFlagLowWord); in ToHighWord()
231 return Type(raw_bits_ ^ (kFlagLowWord | kFlagHighWord)); in ToHighWord()
237 return MergeBits(Type(low_word_type.raw_bits_ | kFlagHighWord), in MergeHighWord()
242 if (raw_bits_ != type.raw_bits_) { in Copy()
[all …]
Dtype_inference.cc35 ((nested_type.raw_bits_ & kMaskWideAndType) << kArrayTypeShift)); in ArrayType()
45 return Type(component_type.raw_bits_ + (1u << kBitArrayDepthStart)); // array_depth + 1u; in ArrayTypeFromComponent()
91 (ArrayDepth() == 1u && (raw_bits_ & kFlagArrayWide) != 0u) || in MergeArrayConflict()
92 (src_type.ArrayDepth() == 1u && (src_type.raw_bits_ & kFlagArrayWide) != 0u); in MergeArrayConflict()
94 return Copy(Type((raw_bits_ & kMaskNonArray) | in MergeArrayConflict()
103 DCHECK_EQ(raw_bits_ & ~kMaskNonArray, 0u); in MergeStrong()
104 DCHECK_NE(src_type.raw_bits_ & kFlagRef, 0u); in MergeStrong()
105 raw_bits_ |= src_type.raw_bits_ & (~kMaskNonArray | kFlagRef); in MergeStrong()
110 (((src_type.raw_bits_ ^ UnknownArrayType().raw_bits_) & kMaskArrayWideAndType) == 0u || in MergeStrong()
111 ((src_type.raw_bits_ ^ ObjectArrayType().raw_bits_) & kMaskArrayWideAndType) == 0u)) { in MergeStrong()
[all …]