/* * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. * */ #include "ci/ciMethodData.hpp" #include "ci/ciTypeFlow.hpp" #include "classfile/javaClasses.hpp" #include "classfile/symbolTable.hpp" #include "classfile/vmSymbols.hpp" #include "compiler/compileLog.hpp" #include "libadt/dict.hpp" #include "memory/oopFactory.hpp" #include "memory/resourceArea.hpp" #include "oops/instanceKlass.hpp" #include "oops/instanceMirrorKlass.hpp" #include "oops/objArrayKlass.hpp" #include "oops/typeArrayKlass.hpp" #include "opto/arraycopynode.hpp" #include "opto/callnode.hpp" #include "opto/matcher.hpp" #include "opto/node.hpp" #include "opto/opcodes.hpp" #include "opto/rangeinference.hpp" #include "opto/runtime.hpp" #include "opto/type.hpp" #include "runtime/stubRoutines.hpp" #include "utilities/checkedCast.hpp" #include "utilities/powerOfTwo.hpp" #include "utilities/stringUtils.hpp" // Portions of code courtesy of Clifford Click // Optimization - Graph Style // Dictionary of types shared among compilations. Dict* Type::_shared_type_dict = nullptr; // Array which maps compiler types to Basic Types const Type::TypeInfo Type::_type_info[Type::lastype] = { { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg, relocInfo::none }, // Bad { Control, T_ILLEGAL, "control", false, 0, relocInfo::none }, // Control { Bottom, T_VOID, "top", false, 0, relocInfo::none }, // Top { Bad, T_INT, "int:", false, Op_RegI, relocInfo::none }, // Int { Bad, T_LONG, "long:", false, Op_RegL, relocInfo::none }, // Long { Half, T_VOID, "half", false, 0, relocInfo::none }, // Half { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN, relocInfo::none }, // NarrowOop { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN, relocInfo::none }, // NarrowKlass { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg, relocInfo::none }, // Tuple { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg, relocInfo::none }, // Array { Bad, T_ARRAY, "interfaces:", false, Node::NotAMachineReg, relocInfo::none }, // Interfaces #if defined(PPC64) { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask. { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA. { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // VectorD { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY { Bad, T_ILLEGAL, "vectorz:", false, 0, relocInfo::none }, // VectorZ #elif defined(S390) { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask. { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA. { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // VectorD { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY { Bad, T_ILLEGAL, "vectorz:", false, 0, relocInfo::none }, // VectorZ #else // all other { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask. { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA. { Bad, T_ILLEGAL, "vectors:", false, Op_VecS, relocInfo::none }, // VectorS { Bad, T_ILLEGAL, "vectord:", false, Op_VecD, relocInfo::none }, // VectorD { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX { Bad, T_ILLEGAL, "vectory:", false, Op_VecY, relocInfo::none }, // VectorY { Bad, T_ILLEGAL, "vectorz:", false, Op_VecZ, relocInfo::none }, // VectorZ #endif { Bad, T_ADDRESS, "anyptr:", false, Op_RegP, relocInfo::none }, // AnyPtr { Bad, T_ADDRESS, "rawptr:", false, Op_RegP, relocInfo::none }, // RawPtr { Bad, T_OBJECT, "oop:", true, Op_RegP, relocInfo::oop_type }, // OopPtr { Bad, T_OBJECT, "inst:", true, Op_RegP, relocInfo::oop_type }, // InstPtr { Bad, T_OBJECT, "ary:", true, Op_RegP, relocInfo::oop_type }, // AryPtr { Bad, T_METADATA, "metadata:", false, Op_RegP, relocInfo::metadata_type }, // MetadataPtr { Bad, T_METADATA, "klass:", false, Op_RegP, relocInfo::metadata_type }, // KlassPtr { Bad, T_METADATA, "instklass:", false, Op_RegP, relocInfo::metadata_type }, // InstKlassPtr { Bad, T_METADATA, "aryklass:", false, Op_RegP, relocInfo::metadata_type }, // AryKlassPtr { Bad, T_OBJECT, "func", false, 0, relocInfo::none }, // Function { Abio, T_ILLEGAL, "abIO", false, 0, relocInfo::none }, // Abio { Return_Address, T_ADDRESS, "return_address",false, Op_RegP, relocInfo::none }, // Return_Address { Memory, T_ILLEGAL, "memory", false, 0, relocInfo::none }, // Memory { HalfFloatBot, T_SHORT, "halffloat_top", false, Op_RegF, relocInfo::none }, // HalfFloatTop { HalfFloatCon, T_SHORT, "hfcon:", false, Op_RegF, relocInfo::none }, // HalfFloatCon { HalfFloatTop, T_SHORT, "short", false, Op_RegF, relocInfo::none }, // HalfFloatBot { FloatBot, T_FLOAT, "float_top", false, Op_RegF, relocInfo::none }, // FloatTop { FloatCon, T_FLOAT, "ftcon:", false, Op_RegF, relocInfo::none }, // FloatCon { FloatTop, T_FLOAT, "float", false, Op_RegF, relocInfo::none }, // FloatBot { DoubleBot, T_DOUBLE, "double_top", false, Op_RegD, relocInfo::none }, // DoubleTop { DoubleCon, T_DOUBLE, "dblcon:", false, Op_RegD, relocInfo::none }, // DoubleCon { DoubleTop, T_DOUBLE, "double", false, Op_RegD, relocInfo::none }, // DoubleBot { Top, T_ILLEGAL, "bottom", false, 0, relocInfo::none } // Bottom }; // Map ideal registers (machine types) to ideal types const Type *Type::mreg2type[_last_machine_leaf]; // Map basic types to canonical Type* pointers. const Type* Type:: _const_basic_type[T_CONFLICT+1]; // Map basic types to constant-zero Types. const Type* Type:: _zero_type[T_CONFLICT+1]; // Map basic types to array-body alias types. const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1]; const TypeInterfaces* TypeAryPtr::_array_interfaces = nullptr; const TypeInterfaces* TypeAryKlassPtr::_array_interfaces = nullptr; //============================================================================= // Convenience common pre-built types. const Type *Type::ABIO; // State-of-machine only const Type *Type::BOTTOM; // All values const Type *Type::CONTROL; // Control only const Type *Type::DOUBLE; // All doubles const Type *Type::HALF_FLOAT; // All half floats const Type *Type::FLOAT; // All floats const Type *Type::HALF; // Placeholder half of doublewide type const Type *Type::MEMORY; // Abstract store only const Type *Type::RETURN_ADDRESS; const Type *Type::TOP; // No values in set //------------------------------get_const_type--------------------------- const Type* Type::get_const_type(ciType* type, InterfaceHandling interface_handling) { if (type == nullptr) { return nullptr; } else if (type->is_primitive_type()) { return get_const_basic_type(type->basic_type()); } else { return TypeOopPtr::make_from_klass(type->as_klass(), interface_handling); } } //---------------------------array_element_basic_type--------------------------------- // Mapping to the array element's basic type. BasicType Type::array_element_basic_type() const { BasicType bt = basic_type(); if (bt == T_INT) { if (this == TypeInt::INT) return T_INT; if (this == TypeInt::CHAR) return T_CHAR; if (this == TypeInt::BYTE) return T_BYTE; if (this == TypeInt::BOOL) return T_BOOLEAN; if (this == TypeInt::SHORT) return T_SHORT; return T_VOID; } return bt; } // For two instance arrays of same dimension, return the base element types. // Otherwise or if the arrays have different dimensions, return null. void Type::get_arrays_base_elements(const Type *a1, const Type *a2, const TypeInstPtr **e1, const TypeInstPtr **e2) { if (e1) *e1 = nullptr; if (e2) *e2 = nullptr; const TypeAryPtr* a1tap = (a1 == nullptr) ? nullptr : a1->isa_aryptr(); const TypeAryPtr* a2tap = (a2 == nullptr) ? nullptr : a2->isa_aryptr(); if (a1tap != nullptr && a2tap != nullptr) { // Handle multidimensional arrays const TypePtr* a1tp = a1tap->elem()->make_ptr(); const TypePtr* a2tp = a2tap->elem()->make_ptr(); while (a1tp && a1tp->isa_aryptr() && a2tp && a2tp->isa_aryptr()) { a1tap = a1tp->is_aryptr(); a2tap = a2tp->is_aryptr(); a1tp = a1tap->elem()->make_ptr(); a2tp = a2tap->elem()->make_ptr(); } if (a1tp && a1tp->isa_instptr() && a2tp && a2tp->isa_instptr()) { if (e1) *e1 = a1tp->is_instptr(); if (e2) *e2 = a2tp->is_instptr(); } } } //---------------------------get_typeflow_type--------------------------------- // Import a type produced by ciTypeFlow. const Type* Type::get_typeflow_type(ciType* type) { switch (type->basic_type()) { case ciTypeFlow::StateVector::T_BOTTOM: assert(type == ciTypeFlow::StateVector::bottom_type(), ""); return Type::BOTTOM; case ciTypeFlow::StateVector::T_TOP: assert(type == ciTypeFlow::StateVector::top_type(), ""); return Type::TOP; case ciTypeFlow::StateVector::T_NULL: assert(type == ciTypeFlow::StateVector::null_type(), ""); return TypePtr::NULL_PTR; case ciTypeFlow::StateVector::T_LONG2: // The ciTypeFlow pass pushes a long, then the half. // We do the same. assert(type == ciTypeFlow::StateVector::long2_type(), ""); return TypeInt::TOP; case ciTypeFlow::StateVector::T_DOUBLE2: // The ciTypeFlow pass pushes double, then the half. // Our convention is the same. assert(type == ciTypeFlow::StateVector::double2_type(), ""); return Type::TOP; case T_ADDRESS: assert(type->is_return_address(), ""); return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci()); default: // make sure we did not mix up the cases: assert(type != ciTypeFlow::StateVector::bottom_type(), ""); assert(type != ciTypeFlow::StateVector::top_type(), ""); assert(type != ciTypeFlow::StateVector::null_type(), ""); assert(type != ciTypeFlow::StateVector::long2_type(), ""); assert(type != ciTypeFlow::StateVector::double2_type(), ""); assert(!type->is_return_address(), ""); return Type::get_const_type(type); } } //-----------------------make_from_constant------------------------------------ const Type* Type::make_from_constant(ciConstant constant, bool require_constant, int stable_dimension, bool is_narrow_oop, bool is_autobox_cache) { switch (constant.basic_type()) { case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); case T_CHAR: return TypeInt::make(constant.as_char()); case T_BYTE: return TypeInt::make(constant.as_byte()); case T_SHORT: return TypeInt::make(constant.as_short()); case T_INT: return TypeInt::make(constant.as_int()); case T_LONG: return TypeLong::make(constant.as_long()); case T_FLOAT: return TypeF::make(constant.as_float()); case T_DOUBLE: return TypeD::make(constant.as_double()); case T_ARRAY: case T_OBJECT: { const Type* con_type = nullptr; ciObject* oop_constant = constant.as_object(); if (oop_constant->is_null_object()) { con_type = Type::get_zero_type(T_OBJECT); } else { guarantee(require_constant || oop_constant->should_be_constant(), "con_type must get computed"); con_type = TypeOopPtr::make_from_constant(oop_constant, require_constant); if (Compile::current()->eliminate_boxing() && is_autobox_cache) { con_type = con_type->is_aryptr()->cast_to_autobox_cache(); } if (stable_dimension > 0) { assert(FoldStableValues, "sanity"); assert(!con_type->is_zero_type(), "default value for stable field"); con_type = con_type->is_aryptr()->cast_to_stable(true, stable_dimension); } } if (is_narrow_oop) { con_type = con_type->make_narrowoop(); } return con_type; } case T_ILLEGAL: // Invalid ciConstant returned due to OutOfMemoryError in the CI assert(Compile::current()->env()->failing(), "otherwise should not see this"); return nullptr; default: // Fall through to failure return nullptr; } } static ciConstant check_mismatched_access(ciConstant con, BasicType loadbt, bool is_unsigned) { BasicType conbt = con.basic_type(); switch (conbt) { case T_BOOLEAN: conbt = T_BYTE; break; case T_ARRAY: conbt = T_OBJECT; break; default: break; } switch (loadbt) { case T_BOOLEAN: loadbt = T_BYTE; break; case T_NARROWOOP: loadbt = T_OBJECT; break; case T_ARRAY: loadbt = T_OBJECT; break; case T_ADDRESS: loadbt = T_OBJECT; break; default: break; } if (conbt == loadbt) { if (is_unsigned && conbt == T_BYTE) { // LoadB (T_BYTE) with a small mask (<=8-bit) is converted to LoadUB (T_BYTE). return ciConstant(T_INT, con.as_int() & 0xFF); } else { return con; } } if (conbt == T_SHORT && loadbt == T_CHAR) { // LoadS (T_SHORT) with a small mask (<=16-bit) is converted to LoadUS (T_CHAR). return ciConstant(T_INT, con.as_int() & 0xFFFF); } return ciConstant(); // T_ILLEGAL } // Try to constant-fold a stable array element. const Type* Type::make_constant_from_array_element(ciArray* array, int off, int stable_dimension, BasicType loadbt, bool is_unsigned_load) { // Decode the results of GraphKit::array_element_address. ciConstant element_value = array->element_value_by_offset(off); if (element_value.basic_type() == T_ILLEGAL) { return nullptr; // wrong offset } ciConstant con = check_mismatched_access(element_value, loadbt, is_unsigned_load); assert(con.basic_type() != T_ILLEGAL, "elembt=%s; loadbt=%s; unsigned=%d", type2name(element_value.basic_type()), type2name(loadbt), is_unsigned_load); if (con.is_valid() && // not a mismatched access !con.is_null_or_zero()) { // not a default value bool is_narrow_oop = (loadbt == T_NARROWOOP); return Type::make_from_constant(con, /*require_constant=*/true, stable_dimension, is_narrow_oop, /*is_autobox_cache=*/false); } return nullptr; } const Type* Type::make_constant_from_field(ciInstance* holder, int off, bool is_unsigned_load, BasicType loadbt) { ciField* field; ciType* type = holder->java_mirror_type(); if (type != nullptr && type->is_instance_klass() && off >= InstanceMirrorKlass::offset_of_static_fields()) { // Static field field = type->as_instance_klass()->get_field_by_offset(off, /*is_static=*/true); } else { // Instance field field = holder->klass()->as_instance_klass()->get_field_by_offset(off, /*is_static=*/false); } if (field == nullptr) { return nullptr; // Wrong offset } return Type::make_constant_from_field(field, holder, loadbt, is_unsigned_load); } const Type* Type::make_constant_from_field(ciField* field, ciInstance* holder, BasicType loadbt, bool is_unsigned_load) { if (!field->is_constant()) { return nullptr; // Non-constant field } ciConstant field_value; if (field->is_static()) { // final static field field_value = field->constant_value(); } else if (holder != nullptr) { // final or stable non-static field // Treat final non-static fields of trusted classes (classes in // java.lang.invoke and sun.invoke packages and subpackages) as // compile time constants. field_value = field->constant_value_of(holder); } if (!field_value.is_valid()) { return nullptr; // Not a constant } ciConstant con = check_mismatched_access(field_value, loadbt, is_unsigned_load); assert(con.is_valid(), "elembt=%s; loadbt=%s; unsigned=%d", type2name(field_value.basic_type()), type2name(loadbt), is_unsigned_load); bool is_stable_array = FoldStableValues && field->is_stable() && field->type()->is_array_klass(); int stable_dimension = (is_stable_array ? field->type()->as_array_klass()->dimension() : 0); bool is_narrow_oop = (loadbt == T_NARROWOOP); const Type* con_type = make_from_constant(con, /*require_constant=*/ true, stable_dimension, is_narrow_oop, field->is_autobox_cache()); if (con_type != nullptr && field->is_call_site_target()) { ciCallSite* call_site = holder->as_call_site(); if (!call_site->is_fully_initialized_constant_call_site()) { ciMethodHandle* target = con.as_object()->as_method_handle(); Compile::current()->dependencies()->assert_call_site_target_value(call_site, target); } } return con_type; } //------------------------------make------------------------------------------- // Create a simple Type, with default empty symbol sets. Then hashcons it // and look for an existing copy in the type dictionary. const Type *Type::make( enum TYPES t ) { return (new Type(t))->hashcons(); } //------------------------------cmp-------------------------------------------- bool Type::equals(const Type* t1, const Type* t2) { if (t1->_base != t2->_base) { return false; // Missed badly } assert(t1 != t2 || t1->eq(t2), "eq must be reflexive"); return t1->eq(t2); } const Type* Type::maybe_remove_speculative(bool include_speculative) const { if (!include_speculative) { return remove_speculative(); } return this; } //------------------------------hash------------------------------------------- int Type::uhash( const Type *const t ) { return (int)t->hash(); } #define POSITIVE_INFINITE_F 0x7f800000 // hex representation for IEEE 754 single precision positive infinite #define POSITIVE_INFINITE_D 0x7ff0000000000000 // hex representation for IEEE 754 double precision positive infinite //--------------------------Initialize_shared---------------------------------- void Type::Initialize_shared(Compile* current) { // This method does not need to be locked because the first system // compilations (stub compilations) occur serially. If they are // changed to proceed in parallel, then this section will need // locking. Arena* save = current->type_arena(); Arena* shared_type_arena = new (mtCompiler)Arena(mtCompiler, Arena::Tag::tag_type); current->set_type_arena(shared_type_arena); // Map the boolean result of Type::equals into a comparator result that CmpKey expects. CmpKey type_cmp = [](const void* t1, const void* t2) -> int32_t { return Type::equals((Type*) t1, (Type*) t2) ? 0 : 1; }; _shared_type_dict = new (shared_type_arena) Dict(type_cmp, (Hash) Type::uhash, shared_type_arena, 128); current->set_type_dict(_shared_type_dict); // Make shared pre-built types. CONTROL = make(Control); // Control only TOP = make(Top); // No values in set MEMORY = make(Memory); // Abstract store only ABIO = make(Abio); // State-of-machine only RETURN_ADDRESS=make(Return_Address); FLOAT = make(FloatBot); // All floats HALF_FLOAT = make(HalfFloatBot); // All half floats DOUBLE = make(DoubleBot); // All doubles BOTTOM = make(Bottom); // Everything HALF = make(Half); // Placeholder half of doublewide type TypeF::MAX = TypeF::make(max_jfloat); // Float MAX TypeF::MIN = TypeF::make(min_jfloat); // Float MIN TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero) TypeF::ONE = TypeF::make(1.0); // Float 1 TypeF::POS_INF = TypeF::make(jfloat_cast(POSITIVE_INFINITE_F)); TypeF::NEG_INF = TypeF::make(-jfloat_cast(POSITIVE_INFINITE_F)); TypeH::MAX = TypeH::make(max_jfloat16); // HalfFloat MAX TypeH::MIN = TypeH::make(min_jfloat16); // HalfFloat MIN TypeH::ZERO = TypeH::make((jshort)0); // HalfFloat 0 (positive zero) TypeH::ONE = TypeH::make(one_jfloat16); // HalfFloat 1 TypeH::POS_INF = TypeH::make(pos_inf_jfloat16); TypeH::NEG_INF = TypeH::make(neg_inf_jfloat16); TypeD::MAX = TypeD::make(max_jdouble); // Double MAX TypeD::MIN = TypeD::make(min_jdouble); // Double MIN TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero) TypeD::ONE = TypeD::make(1.0); // Double 1 TypeD::POS_INF = TypeD::make(jdouble_cast(POSITIVE_INFINITE_D)); TypeD::NEG_INF = TypeD::make(-jdouble_cast(POSITIVE_INFINITE_D)); TypeInt::MAX = TypeInt::make(max_jint); // Int MAX TypeInt::MIN = TypeInt::make(min_jint); // Int MIN TypeInt::MINUS_1 = TypeInt::make(-1); // -1 TypeInt::ZERO = TypeInt::make( 0); // 0 TypeInt::ONE = TypeInt::make( 1); // 1 TypeInt::BOOL = TypeInt::make( 0, 1, WidenMin); // 0 or 1, FALSE or TRUE. TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1 TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO TypeInt::CC_NE = TypeInt::make_or_top(TypeIntPrototype{{-1, 1}, {1, max_juint}, {0, 1}}, WidenMin)->is_int(); TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin); TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL TypeInt::BYTE = TypeInt::make(-128, 127, WidenMin); // Bytes TypeInt::UBYTE = TypeInt::make(0, 255, WidenMin); // Unsigned Bytes TypeInt::CHAR = TypeInt::make(0, 65535, WidenMin); // Java chars TypeInt::SHORT = TypeInt::make(-32768, 32767, WidenMin); // Java shorts TypeInt::NON_ZERO = TypeInt::make_or_top(TypeIntPrototype{{min_jint, max_jint}, {1, max_juint}, {0, 0}}, WidenMin)->is_int(); TypeInt::POS = TypeInt::make(0, max_jint, WidenMin); // Non-neg values TypeInt::POS1 = TypeInt::make(1, max_jint, WidenMin); // Positive values TypeInt::INT = TypeInt::make(min_jint, max_jint, WidenMax); // 32-bit integers TypeInt::SYMINT = TypeInt::make(-max_jint, max_jint, WidenMin); // symmetric range TypeInt::TYPE_DOMAIN = TypeInt::INT; // CmpL is overloaded both as the bytecode computation returning // a trinary (-1, 0, +1) integer result AND as an efficient long // compare returning optimizer ideal-type flags. assert(TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" ); assert(TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" ); assert(TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" ); assert(TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" ); TypeLong::MAX = TypeLong::make(max_jlong); // Long MAX TypeLong::MIN = TypeLong::make(min_jlong); // Long MIN TypeLong::MINUS_1 = TypeLong::make(-1); // -1 TypeLong::ZERO = TypeLong::make( 0); // 0 TypeLong::ONE = TypeLong::make( 1); // 1 TypeLong::NON_ZERO = TypeLong::make_or_top(TypeIntPrototype{{min_jlong, max_jlong}, {1, max_julong}, {0, 0}}, WidenMin)->is_long(); TypeLong::POS = TypeLong::make(0, max_jlong, WidenMin); // Non-neg values TypeLong::NEG = TypeLong::make(min_jlong, -1, WidenMin); TypeLong::LONG = TypeLong::make(min_jlong, max_jlong, WidenMax); // 64-bit integers TypeLong::INT = TypeLong::make((jlong)min_jint, (jlong)max_jint,WidenMin); TypeLong::UINT = TypeLong::make(0, (jlong)max_juint, WidenMin); TypeLong::TYPE_DOMAIN = TypeLong::LONG; const Type **fboth =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); fboth[0] = Type::CONTROL; fboth[1] = Type::CONTROL; TypeTuple::IFBOTH = TypeTuple::make( 2, fboth ); const Type **ffalse =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); ffalse[0] = Type::CONTROL; ffalse[1] = Type::TOP; TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse ); const Type **fneither =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); fneither[0] = Type::TOP; fneither[1] = Type::TOP; TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither ); const Type **ftrue =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); ftrue[0] = Type::TOP; ftrue[1] = Type::CONTROL; TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue ); const Type **floop =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); floop[0] = Type::CONTROL; floop[1] = TypeInt::INT; TypeTuple::LOOPBODY = TypeTuple::make( 2, floop ); TypePtr::NULL_PTR= TypePtr::make(AnyPtr, TypePtr::Null, 0); TypePtr::NOTNULL = TypePtr::make(AnyPtr, TypePtr::NotNull, OffsetBot); TypePtr::BOTTOM = TypePtr::make(AnyPtr, TypePtr::BotPTR, OffsetBot); TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR ); TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull ); const Type **fmembar = TypeTuple::fields(0); TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar); const Type **fsc = (const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); fsc[0] = TypeInt::CC; fsc[1] = Type::MEMORY; TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc); TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass()); TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass()); TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass()); TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), false, nullptr, oopDesc::mark_offset_in_bytes()); TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), false, nullptr, oopDesc::klass_offset_in_bytes()); TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot, TypeOopPtr::InstanceBot); TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, nullptr, OffsetBot); TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR ); TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM ); TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR ); mreg2type[Op_Node] = Type::BOTTOM; mreg2type[Op_Set ] = nullptr; mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM; mreg2type[Op_RegI] = TypeInt::INT; mreg2type[Op_RegP] = TypePtr::BOTTOM; mreg2type[Op_RegF] = Type::FLOAT; mreg2type[Op_RegD] = Type::DOUBLE; mreg2type[Op_RegL] = TypeLong::LONG; mreg2type[Op_RegFlags] = TypeInt::CC; GrowableArray array_interfaces; array_interfaces.push(current->env()->Cloneable_klass()); array_interfaces.push(current->env()->Serializable_klass()); TypeAryPtr::_array_interfaces = TypeInterfaces::make(&array_interfaces); TypeAryKlassPtr::_array_interfaces = TypeAryPtr::_array_interfaces; TypeAryPtr::BOTTOM = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::BOTTOM, TypeInt::POS), nullptr, false, Type::OffsetBot); TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), nullptr /* current->env()->Object_klass() */, false, arrayOopDesc::length_offset_in_bytes()); TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), nullptr /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); #ifdef _LP64 if (UseCompressedOops) { assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop"); TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS; } else #endif { // There is no shared klass for Object[]. See note in TypeAryPtr::klass(). TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), nullptr /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); } TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot); TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot); TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot); TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot); TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot); TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot); TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot); // Nobody should ask _array_body_type[T_NARROWOOP]. Use null as assert. TypeAryPtr::_array_body_type[T_NARROWOOP] = nullptr; TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS; TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES; TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS; TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS; TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS; TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS; TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS; TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES; TypeInstKlassPtr::OBJECT = TypeInstKlassPtr::make(TypePtr::NotNull, current->env()->Object_klass(), 0); TypeInstKlassPtr::OBJECT_OR_NULL = TypeInstKlassPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), 0); const Type **fi2c = TypeTuple::fields(2); fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method* fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c); const Type **intpair = TypeTuple::fields(2); intpair[0] = TypeInt::INT; intpair[1] = TypeInt::INT; TypeTuple::INT_PAIR = TypeTuple::make(2, intpair); const Type **longpair = TypeTuple::fields(2); longpair[0] = TypeLong::LONG; longpair[1] = TypeLong::LONG; TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair); const Type **intccpair = TypeTuple::fields(2); intccpair[0] = TypeInt::INT; intccpair[1] = TypeInt::CC; TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair); const Type **longccpair = TypeTuple::fields(2); longccpair[0] = TypeLong::LONG; longccpair[1] = TypeInt::CC; TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair); _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM; _const_basic_type[T_NARROWKLASS] = Type::BOTTOM; _const_basic_type[T_BOOLEAN] = TypeInt::BOOL; _const_basic_type[T_CHAR] = TypeInt::CHAR; _const_basic_type[T_BYTE] = TypeInt::BYTE; _const_basic_type[T_SHORT] = TypeInt::SHORT; _const_basic_type[T_INT] = TypeInt::INT; _const_basic_type[T_LONG] = TypeLong::LONG; _const_basic_type[T_FLOAT] = Type::FLOAT; _const_basic_type[T_DOUBLE] = Type::DOUBLE; _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM; _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not? _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR; _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR; _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0 _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0 _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0 _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0 _zero_type[T_INT] = TypeInt::ZERO; _zero_type[T_LONG] = TypeLong::ZERO; _zero_type[T_FLOAT] = TypeF::ZERO; _zero_type[T_DOUBLE] = TypeD::ZERO; _zero_type[T_OBJECT] = TypePtr::NULL_PTR; _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all // get_zero_type() should not happen for T_CONFLICT _zero_type[T_CONFLICT]= nullptr; TypeVect::VECTMASK = (TypeVect*)(new TypeVectMask(T_BOOLEAN, MaxVectorSize))->hashcons(); mreg2type[Op_RegVectMask] = TypeVect::VECTMASK; if (Matcher::supports_scalable_vector()) { TypeVect::VECTA = TypeVect::make(T_BYTE, Matcher::scalable_vector_reg_size(T_BYTE)); } // Vector predefined types, it needs initialized _const_basic_type[]. if (Matcher::vector_size_supported(T_BYTE, 4)) { TypeVect::VECTS = TypeVect::make(T_BYTE, 4); } if (Matcher::vector_size_supported(T_FLOAT, 2)) { TypeVect::VECTD = TypeVect::make(T_FLOAT, 2); } if (Matcher::vector_size_supported(T_FLOAT, 4)) { TypeVect::VECTX = TypeVect::make(T_FLOAT, 4); } if (Matcher::vector_size_supported(T_FLOAT, 8)) { TypeVect::VECTY = TypeVect::make(T_FLOAT, 8); } if (Matcher::vector_size_supported(T_FLOAT, 16)) { TypeVect::VECTZ = TypeVect::make(T_FLOAT, 16); } mreg2type[Op_VecA] = TypeVect::VECTA; mreg2type[Op_VecS] = TypeVect::VECTS; mreg2type[Op_VecD] = TypeVect::VECTD; mreg2type[Op_VecX] = TypeVect::VECTX; mreg2type[Op_VecY] = TypeVect::VECTY; mreg2type[Op_VecZ] = TypeVect::VECTZ; LockNode::initialize_lock_Type(); ArrayCopyNode::initialize_arraycopy_Type(); OptoRuntime::initialize_types(); // Restore working type arena. current->set_type_arena(save); current->set_type_dict(nullptr); } //------------------------------Initialize------------------------------------- void Type::Initialize(Compile* current) { assert(current->type_arena() != nullptr, "must have created type arena"); if (_shared_type_dict == nullptr) { Initialize_shared(current); } Arena* type_arena = current->type_arena(); // Create the hash-cons'ing dictionary with top-level storage allocation Dict *tdic = new (type_arena) Dict(*_shared_type_dict, type_arena); current->set_type_dict(tdic); } //------------------------------hashcons--------------------------------------- // Do the hash-cons trick. If the Type already exists in the type table, // delete the current Type and return the existing Type. Otherwise stick the // current Type in the Type table. const Type *Type::hashcons(void) { DEBUG_ONLY(base()); // Check the assertion in Type::base(). // Look up the Type in the Type dictionary Dict *tdic = type_dict(); Type* old = (Type*)(tdic->Insert(this, this, false)); if( old ) { // Pre-existing Type? if( old != this ) // Yes, this guy is not the pre-existing? delete this; // Yes, Nuke this guy assert( old->_dual, "" ); return old; // Return pre-existing } // Every type has a dual (to make my lattice symmetric). // Since we just discovered a new Type, compute its dual right now. assert( !_dual, "" ); // No dual yet _dual = xdual(); // Compute the dual if (equals(this, _dual)) { // Handle self-symmetric if (_dual != this) { delete _dual; _dual = this; } return this; } assert( !_dual->_dual, "" ); // No reverse dual yet assert( !(*tdic)[_dual], "" ); // Dual not in type system either // New Type, insert into Type table tdic->Insert((void*)_dual,(void*)_dual); ((Type*)_dual)->_dual = this; // Finish up being symmetric #ifdef ASSERT Type *dual_dual = (Type*)_dual->xdual(); assert( eq(dual_dual), "xdual(xdual()) should be identity" ); delete dual_dual; #endif return this; // Return new Type } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool Type::eq( const Type * ) const { return true; // Nothing else can go wrong } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint Type::hash(void) const { return _base; } //------------------------------is_finite-------------------------------------- // Has a finite value bool Type::is_finite() const { return false; } //------------------------------is_nan----------------------------------------- // Is not a number (NaN) bool Type::is_nan() const { return false; } #ifdef ASSERT class VerifyMeet; class VerifyMeetResult : public ArenaObj { friend class VerifyMeet; friend class Type; private: class VerifyMeetResultEntry { private: const Type* _in1; const Type* _in2; const Type* _res; public: VerifyMeetResultEntry(const Type* in1, const Type* in2, const Type* res): _in1(in1), _in2(in2), _res(res) { } VerifyMeetResultEntry(): _in1(nullptr), _in2(nullptr), _res(nullptr) { } bool operator==(const VerifyMeetResultEntry& rhs) const { return _in1 == rhs._in1 && _in2 == rhs._in2 && _res == rhs._res; } bool operator!=(const VerifyMeetResultEntry& rhs) const { return !(rhs == *this); } static int compare(const VerifyMeetResultEntry& v1, const VerifyMeetResultEntry& v2) { if ((intptr_t) v1._in1 < (intptr_t) v2._in1) { return -1; } else if (v1._in1 == v2._in1) { if ((intptr_t) v1._in2 < (intptr_t) v2._in2) { return -1; } else if (v1._in2 == v2._in2) { assert(v1._res == v2._res || v1._res == nullptr || v2._res == nullptr, "same inputs should lead to same result"); return 0; } return 1; } return 1; } const Type* res() const { return _res; } }; uint _depth; GrowableArray _cache; // With verification code, the meet of A and B causes the computation of: // 1- meet(A, B) // 2- meet(B, A) // 3- meet(dual(meet(A, B)), dual(A)) // 4- meet(dual(meet(A, B)), dual(B)) // 5- meet(dual(A), dual(B)) // 6- meet(dual(B), dual(A)) // 7- meet(dual(meet(dual(A), dual(B))), A) // 8- meet(dual(meet(dual(A), dual(B))), B) // // In addition the meet of A[] and B[] requires the computation of the meet of A and B. // // The meet of A[] and B[] triggers the computation of: // 1- meet(A[], B[][) // 1.1- meet(A, B) // 1.2- meet(B, A) // 1.3- meet(dual(meet(A, B)), dual(A)) // 1.4- meet(dual(meet(A, B)), dual(B)) // 1.5- meet(dual(A), dual(B)) // 1.6- meet(dual(B), dual(A)) // 1.7- meet(dual(meet(dual(A), dual(B))), A) // 1.8- meet(dual(meet(dual(A), dual(B))), B) // 2- meet(B[], A[]) // 2.1- meet(B, A) = 1.2 // 2.2- meet(A, B) = 1.1 // 2.3- meet(dual(meet(B, A)), dual(B)) = 1.4 // 2.4- meet(dual(meet(B, A)), dual(A)) = 1.3 // 2.5- meet(dual(B), dual(A)) = 1.6 // 2.6- meet(dual(A), dual(B)) = 1.5 // 2.7- meet(dual(meet(dual(B), dual(A))), B) = 1.8 // 2.8- meet(dual(meet(dual(B), dual(A))), B) = 1.7 // etc. // The number of meet operations performed grows exponentially with the number of dimensions of the arrays but the number // of different meet operations is linear in the number of dimensions. The function below caches meet results for the // duration of the meet at the root of the recursive calls. // const Type* meet(const Type* t1, const Type* t2) { bool found = false; const VerifyMeetResultEntry meet(t1, t2, nullptr); int pos = _cache.find_sorted(meet, found); const Type* res = nullptr; if (found) { res = _cache.at(pos).res(); } else { res = t1->xmeet(t2); _cache.insert_sorted(VerifyMeetResultEntry(t1, t2, res)); found = false; _cache.find_sorted(meet, found); assert(found, "should be in table after it's added"); } return res; } void add(const Type* t1, const Type* t2, const Type* res) { _cache.insert_sorted(VerifyMeetResultEntry(t1, t2, res)); } bool empty_cache() const { return _cache.length() == 0; } public: VerifyMeetResult(Compile* C) : _depth(0), _cache(C->comp_arena(), 2, 0, VerifyMeetResultEntry()) { } }; void Type::assert_type_verify_empty() const { assert(Compile::current()->_type_verify == nullptr || Compile::current()->_type_verify->empty_cache(), "cache should have been discarded"); } class VerifyMeet { private: Compile* _C; public: VerifyMeet(Compile* C) : _C(C) { if (C->_type_verify == nullptr) { C->_type_verify = new (C->comp_arena())VerifyMeetResult(C); } _C->_type_verify->_depth++; } ~VerifyMeet() { assert(_C->_type_verify->_depth != 0, ""); _C->_type_verify->_depth--; if (_C->_type_verify->_depth == 0) { _C->_type_verify->_cache.trunc_to(0); } } const Type* meet(const Type* t1, const Type* t2) const { return _C->_type_verify->meet(t1, t2); } void add(const Type* t1, const Type* t2, const Type* res) const { _C->_type_verify->add(t1, t2, res); } }; void Type::check_symmetrical(const Type* t, const Type* mt, const VerifyMeet& verify) const { Compile* C = Compile::current(); const Type* mt2 = verify.meet(t, this); if (mt != mt2) { tty->print_cr("=== Meet Not Commutative ==="); tty->print("t = "); t->dump(); tty->cr(); tty->print("this = "); dump(); tty->cr(); tty->print("t meet this = "); mt2->dump(); tty->cr(); tty->print("this meet t = "); mt->dump(); tty->cr(); fatal("meet not commutative"); } const Type* dual_join = mt->_dual; const Type* t2t = verify.meet(dual_join,t->_dual); const Type* t2this = verify.meet(dual_join,this->_dual); // Interface meet Oop is Not Symmetric: // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull if (t2t != t->_dual || t2this != this->_dual) { tty->print_cr("=== Meet Not Symmetric ==="); tty->print("t = "); t->dump(); tty->cr(); tty->print("this= "); dump(); tty->cr(); tty->print("mt=(t meet this)= "); mt->dump(); tty->cr(); tty->print("t_dual= "); t->_dual->dump(); tty->cr(); tty->print("this_dual= "); _dual->dump(); tty->cr(); tty->print("mt_dual= "); mt->_dual->dump(); tty->cr(); tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr(); tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr(); fatal("meet not symmetric"); } } #endif //------------------------------meet------------------------------------------- // Compute the MEET of two types. NOT virtual. It enforces that meet is // commutative and the lattice is symmetric. const Type *Type::meet_helper(const Type *t, bool include_speculative) const { if (isa_narrowoop() && t->isa_narrowoop()) { const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); return result->make_narrowoop(); } if (isa_narrowklass() && t->isa_narrowklass()) { const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); return result->make_narrowklass(); } #ifdef ASSERT Compile* C = Compile::current(); VerifyMeet verify(C); #endif const Type *this_t = maybe_remove_speculative(include_speculative); t = t->maybe_remove_speculative(include_speculative); const Type *mt = this_t->xmeet(t); #ifdef ASSERT verify.add(this_t, t, mt); if (isa_narrowoop() || t->isa_narrowoop()) { return mt; } if (isa_narrowklass() || t->isa_narrowklass()) { return mt; } this_t->check_symmetrical(t, mt, verify); const Type *mt_dual = verify.meet(this_t->_dual, t->_dual); this_t->_dual->check_symmetrical(t->_dual, mt_dual, verify); #endif return mt; } //------------------------------xmeet------------------------------------------ // Compute the MEET of two types. It returns a new Type object. const Type *Type::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Meeting TOP with anything? if( _base == Top ) return t; // Meeting BOTTOM with anything? if( _base == Bottom ) return BOTTOM; // Current "this->_base" is one of: Bad, Multi, Control, Top, // Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype. switch (t->base()) { // Switch on original type // Cut in half the number of cases I must handle. Only need cases for when // the given enum "t->type" is less than or equal to the local enum "type". case HalfFloatCon: case FloatCon: case DoubleCon: case Int: case Long: return t->xmeet(this); case OopPtr: return t->xmeet(this); case InstPtr: return t->xmeet(this); case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: return t->xmeet(this); case AryPtr: return t->xmeet(this); case NarrowOop: return t->xmeet(this); case NarrowKlass: return t->xmeet(this); case Bad: // Type check default: // Bogus type not in lattice typerr(t); return Type::BOTTOM; case Bottom: // Ye Olde Default return t; case HalfFloatTop: if (_base == HalfFloatTop) { return this; } case HalfFloatBot: // Half Float if (_base == HalfFloatBot || _base == HalfFloatTop) { return HALF_FLOAT; } if (_base == FloatBot || _base == FloatTop) { return Type::BOTTOM; } if (_base == DoubleTop || _base == DoubleBot) { return Type::BOTTOM; } typerr(t); return Type::BOTTOM; case FloatTop: if (_base == FloatTop ) { return this; } case FloatBot: // Float if (_base == FloatBot || _base == FloatTop) { return FLOAT; } if (_base == HalfFloatTop || _base == HalfFloatBot) { return Type::BOTTOM; } if (_base == DoubleTop || _base == DoubleBot) { return Type::BOTTOM; } typerr(t); return Type::BOTTOM; case DoubleTop: if (_base == DoubleTop) { return this; } case DoubleBot: // Double if (_base == DoubleBot || _base == DoubleTop) { return DOUBLE; } if (_base == HalfFloatTop || _base == HalfFloatBot) { return Type::BOTTOM; } if (_base == FloatTop || _base == FloatBot) { return Type::BOTTOM; } typerr(t); return Type::BOTTOM; // These next few cases must match exactly or it is a compile-time error. case Control: // Control of code case Abio: // State of world outside of program case Memory: if (_base == t->_base) { return this; } typerr(t); return Type::BOTTOM; case Top: // Top of the lattice return this; } // The type is unchanged return this; } //-----------------------------filter------------------------------------------ const Type *Type::filter_helper(const Type *kills, bool include_speculative) const { const Type* ft = join_helper(kills, include_speculative); if (ft->empty()) return Type::TOP; // Canonical empty value return ft; } //------------------------------xdual------------------------------------------ const Type *Type::xdual() const { // Note: the base() accessor asserts the sanity of _base. assert(_type_info[base()].dual_type != Bad, "implement with v-call"); return new Type(_type_info[_base].dual_type); } //------------------------------has_memory------------------------------------- bool Type::has_memory() const { Type::TYPES tx = base(); if (tx == Memory) return true; if (tx == Tuple) { const TypeTuple *t = is_tuple(); for (uint i=0; i < t->cnt(); i++) { tx = t->field_at(i)->base(); if (tx == Memory) return true; } } return false; } #ifndef PRODUCT //------------------------------dump2------------------------------------------ void Type::dump2( Dict &d, uint depth, outputStream *st ) const { st->print("%s", _type_info[_base].msg); } //------------------------------dump------------------------------------------- void Type::dump_on(outputStream *st) const { ResourceMark rm; Dict d(cmpkey,hashkey); // Stop recursive type dumping dump2(d,1, st); if (is_ptr_to_narrowoop()) { st->print(" [narrow]"); } else if (is_ptr_to_narrowklass()) { st->print(" [narrowklass]"); } } //----------------------------------------------------------------------------- const char* Type::str(const Type* t) { stringStream ss; t->dump_on(&ss); return ss.as_string(); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Singletons are integer, float or double constants. bool Type::singleton(void) const { return _base == Top || _base == Half; } //------------------------------empty------------------------------------------ // TRUE if Type is a type with no values, FALSE otherwise. bool Type::empty(void) const { switch (_base) { case DoubleTop: case FloatTop: case HalfFloatTop: case Top: return true; case Half: case Abio: case Return_Address: case Memory: case Bottom: case HalfFloatBot: case FloatBot: case DoubleBot: return false; // never a singleton, therefore never empty default: ShouldNotReachHere(); return false; } } //------------------------------dump_stats------------------------------------- // Dump collected statistics to stderr #ifndef PRODUCT void Type::dump_stats() { tty->print("Types made: %d\n", type_dict()->Size()); } #endif //------------------------------category--------------------------------------- #ifndef PRODUCT Type::Category Type::category() const { const TypeTuple* tuple; switch (base()) { case Type::Int: case Type::Long: case Type::Half: case Type::NarrowOop: case Type::NarrowKlass: case Type::Array: case Type::VectorA: case Type::VectorS: case Type::VectorD: case Type::VectorX: case Type::VectorY: case Type::VectorZ: case Type::VectorMask: case Type::AnyPtr: case Type::RawPtr: case Type::OopPtr: case Type::InstPtr: case Type::AryPtr: case Type::MetadataPtr: case Type::KlassPtr: case Type::InstKlassPtr: case Type::AryKlassPtr: case Type::Function: case Type::Return_Address: case Type::HalfFloatTop: case Type::HalfFloatCon: case Type::HalfFloatBot: case Type::FloatTop: case Type::FloatCon: case Type::FloatBot: case Type::DoubleTop: case Type::DoubleCon: case Type::DoubleBot: return Category::Data; case Type::Memory: return Category::Memory; case Type::Control: return Category::Control; case Type::Top: case Type::Abio: case Type::Bottom: return Category::Other; case Type::Bad: case Type::lastype: return Category::Undef; case Type::Tuple: // Recursive case. Return CatMixed if the tuple contains types of // different categories (e.g. CallStaticJavaNode's type), or the specific // category if all types are of the same category (e.g. IfNode's type). tuple = is_tuple(); if (tuple->cnt() == 0) { return Category::Undef; } else { Category first = tuple->field_at(0)->category(); for (uint i = 1; i < tuple->cnt(); i++) { if (tuple->field_at(i)->category() != first) { return Category::Mixed; } } return first; } default: assert(false, "unmatched base type: all base types must be categorized"); } return Category::Undef; } bool Type::has_category(Type::Category cat) const { if (category() == cat) { return true; } if (category() == Category::Mixed) { const TypeTuple* tuple = is_tuple(); for (uint i = 0; i < tuple->cnt(); i++) { if (tuple->field_at(i)->has_category(cat)) { return true; } } } return false; } #endif //------------------------------typerr----------------------------------------- void Type::typerr( const Type *t ) const { #ifndef PRODUCT tty->print("\nError mixing types: "); dump(); tty->print(" and "); t->dump(); tty->print("\n"); #endif ShouldNotReachHere(); } //============================================================================= // Convenience common pre-built types. const TypeF *TypeF::MAX; // Floating point max const TypeF *TypeF::MIN; // Floating point min const TypeF *TypeF::ZERO; // Floating point zero const TypeF *TypeF::ONE; // Floating point one const TypeF *TypeF::POS_INF; // Floating point positive infinity const TypeF *TypeF::NEG_INF; // Floating point negative infinity //------------------------------make------------------------------------------- // Create a float constant const TypeF *TypeF::make(float f) { return (TypeF*)(new TypeF(f))->hashcons(); } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeF::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is FloatCon switch (t->base()) { // Switch on original type case AnyPtr: // Mixing with oops happens when javac case RawPtr: // reuses local variables case OopPtr: case InstPtr: case AryPtr: case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: case NarrowOop: case NarrowKlass: case Int: case Long: case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case Bottom: // Ye Olde Default return Type::BOTTOM; case FloatBot: return t; default: // All else is a mistake typerr(t); case FloatCon: // Float-constant vs Float-constant? if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants? // must compare bitwise as positive zero, negative zero and NaN have // all the same representation in C++ return FLOAT; // Return generic float // Equal constants case Top: case FloatTop: break; // Return the float constant } return this; // Return the float constant } //------------------------------xdual------------------------------------------ // Dual: symmetric const Type *TypeF::xdual() const { return this; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeF::eq(const Type *t) const { // Bitwise comparison to distinguish between +/-0. These values must be treated // as different to be consistent with C1 and the interpreter. return (jint_cast(_f) == jint_cast(t->getf())); } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeF::hash(void) const { return *(uint*)(&_f); } //------------------------------is_finite-------------------------------------- // Has a finite value bool TypeF::is_finite() const { return g_isfinite(getf()) != 0; } //------------------------------is_nan----------------------------------------- // Is not a number (NaN) bool TypeF::is_nan() const { return g_isnan(getf()) != 0; } //------------------------------dump2------------------------------------------ // Dump float constant Type #ifndef PRODUCT void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const { Type::dump2(d,depth, st); st->print("%f", _f); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Singletons are integer, float or double constants // or a single symbol. bool TypeF::singleton(void) const { return true; // Always a singleton } bool TypeF::empty(void) const { return false; // always exactly a singleton } //============================================================================= // Convenience common pre-built types. const TypeH* TypeH::MAX; // Half float max const TypeH* TypeH::MIN; // Half float min const TypeH* TypeH::ZERO; // Half float zero const TypeH* TypeH::ONE; // Half float one const TypeH* TypeH::POS_INF; // Half float positive infinity const TypeH* TypeH::NEG_INF; // Half float negative infinity //------------------------------make------------------------------------------- // Create a halffloat constant const TypeH* TypeH::make(short f) { return (TypeH*)(new TypeH(f))->hashcons(); } const TypeH* TypeH::make(float f) { assert(StubRoutines::f2hf_adr() != nullptr, ""); short hf = StubRoutines::f2hf(f); return (TypeH*)(new TypeH(hf))->hashcons(); } //------------------------------xmeet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type* TypeH::xmeet(const Type* t) const { // Perform a fast test for common case; meeting the same types together. if (this == t) return this; // Meeting same type-rep? // Current "this->_base" is FloatCon switch (t->base()) { // Switch on original type case AnyPtr: // Mixing with oops happens when javac case RawPtr: // reuses local variables case OopPtr: case InstPtr: case AryPtr: case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: case NarrowOop: case NarrowKlass: case Int: case Long: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case Bottom: // Ye Olde Default return Type::BOTTOM; case HalfFloatBot: return t; default: // All else is a mistake typerr(t); case HalfFloatCon: // Half float-constant vs Half float-constant? if (_f != t->geth()) { // unequal constants? // must compare bitwise as positive zero, negative zero and NaN have // all the same representation in C++ return HALF_FLOAT; // Return generic float } // Equal constants case Top: case HalfFloatTop: break; // Return the Half float constant } return this; // Return the Half float constant } //------------------------------xdual------------------------------------------ // Dual: symmetric const Type* TypeH::xdual() const { return this; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeH::eq(const Type* t) const { // Bitwise comparison to distinguish between +/-0. These values must be treated // as different to be consistent with C1 and the interpreter. return (_f == t->geth()); } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeH::hash(void) const { return *(jshort*)(&_f); } //------------------------------is_finite-------------------------------------- // Has a finite value bool TypeH::is_finite() const { assert(StubRoutines::hf2f_adr() != nullptr, ""); float f = StubRoutines::hf2f(geth()); return g_isfinite(f) != 0; } float TypeH::getf() const { assert(StubRoutines::hf2f_adr() != nullptr, ""); return StubRoutines::hf2f(geth()); } //------------------------------is_nan----------------------------------------- // Is not a number (NaN) bool TypeH::is_nan() const { assert(StubRoutines::hf2f_adr() != nullptr, ""); float f = StubRoutines::hf2f(geth()); return g_isnan(f) != 0; } //------------------------------dump2------------------------------------------ // Dump float constant Type #ifndef PRODUCT void TypeH::dump2(Dict &d, uint depth, outputStream* st) const { Type::dump2(d,depth, st); st->print("%f", getf()); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Singletons are integer, half float, float or double constants // or a single symbol. bool TypeH::singleton(void) const { return true; // Always a singleton } bool TypeH::empty(void) const { return false; // always exactly a singleton } //============================================================================= // Convenience common pre-built types. const TypeD *TypeD::MAX; // Floating point max const TypeD *TypeD::MIN; // Floating point min const TypeD *TypeD::ZERO; // Floating point zero const TypeD *TypeD::ONE; // Floating point one const TypeD *TypeD::POS_INF; // Floating point positive infinity const TypeD *TypeD::NEG_INF; // Floating point negative infinity //------------------------------make------------------------------------------- const TypeD *TypeD::make(double d) { return (TypeD*)(new TypeD(d))->hashcons(); } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeD::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is DoubleCon switch (t->base()) { // Switch on original type case AnyPtr: // Mixing with oops happens when javac case RawPtr: // reuses local variables case OopPtr: case InstPtr: case AryPtr: case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: case NarrowOop: case NarrowKlass: case Int: case Long: case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case Bottom: // Ye Olde Default return Type::BOTTOM; case DoubleBot: return t; default: // All else is a mistake typerr(t); case DoubleCon: // Double-constant vs Double-constant? if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet) return DOUBLE; // Return generic double case Top: case DoubleTop: break; } return this; // Return the double constant } //------------------------------xdual------------------------------------------ // Dual: symmetric const Type *TypeD::xdual() const { return this; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeD::eq(const Type *t) const { // Bitwise comparison to distinguish between +/-0. These values must be treated // as different to be consistent with C1 and the interpreter. return (jlong_cast(_d) == jlong_cast(t->getd())); } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeD::hash(void) const { return *(uint*)(&_d); } //------------------------------is_finite-------------------------------------- // Has a finite value bool TypeD::is_finite() const { return g_isfinite(getd()) != 0; } //------------------------------is_nan----------------------------------------- // Is not a number (NaN) bool TypeD::is_nan() const { return g_isnan(getd()) != 0; } //------------------------------dump2------------------------------------------ // Dump double constant Type #ifndef PRODUCT void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const { Type::dump2(d,depth,st); st->print("%f", _d); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Singletons are integer, float or double constants // or a single symbol. bool TypeD::singleton(void) const { return true; // Always a singleton } bool TypeD::empty(void) const { return false; // always exactly a singleton } const TypeInteger* TypeInteger::make(jlong lo, jlong hi, int w, BasicType bt) { if (bt == T_INT) { return TypeInt::make(checked_cast(lo), checked_cast(hi), w); } assert(bt == T_LONG, "basic type not an int or long"); return TypeLong::make(lo, hi, w); } const TypeInteger* TypeInteger::make(jlong con, BasicType bt) { return make(con, con, WidenMin, bt); } jlong TypeInteger::get_con_as_long(BasicType bt) const { if (bt == T_INT) { return is_int()->get_con(); } assert(bt == T_LONG, "basic type not an int or long"); return is_long()->get_con(); } const TypeInteger* TypeInteger::bottom(BasicType bt) { if (bt == T_INT) { return TypeInt::INT; } assert(bt == T_LONG, "basic type not an int or long"); return TypeLong::LONG; } const TypeInteger* TypeInteger::zero(BasicType bt) { if (bt == T_INT) { return TypeInt::ZERO; } assert(bt == T_LONG, "basic type not an int or long"); return TypeLong::ZERO; } const TypeInteger* TypeInteger::one(BasicType bt) { if (bt == T_INT) { return TypeInt::ONE; } assert(bt == T_LONG, "basic type not an int or long"); return TypeLong::ONE; } const TypeInteger* TypeInteger::minus_1(BasicType bt) { if (bt == T_INT) { return TypeInt::MINUS_1; } assert(bt == T_LONG, "basic type not an int or long"); return TypeLong::MINUS_1; } //============================================================================= // Convenience common pre-built types. const TypeInt* TypeInt::MAX; // INT_MAX const TypeInt* TypeInt::MIN; // INT_MIN const TypeInt* TypeInt::MINUS_1;// -1 const TypeInt* TypeInt::ZERO; // 0 const TypeInt* TypeInt::ONE; // 1 const TypeInt* TypeInt::BOOL; // 0 or 1, FALSE or TRUE. const TypeInt* TypeInt::CC; // -1,0 or 1, condition codes const TypeInt* TypeInt::CC_LT; // [-1] == MINUS_1 const TypeInt* TypeInt::CC_GT; // [1] == ONE const TypeInt* TypeInt::CC_EQ; // [0] == ZERO const TypeInt* TypeInt::CC_NE; const TypeInt* TypeInt::CC_LE; // [-1,0] const TypeInt* TypeInt::CC_GE; // [0,1] == BOOL (!) const TypeInt* TypeInt::BYTE; // Bytes, -128 to 127 const TypeInt* TypeInt::UBYTE; // Unsigned Bytes, 0 to 255 const TypeInt* TypeInt::CHAR; // Java chars, 0-65535 const TypeInt* TypeInt::SHORT; // Java shorts, -32768-32767 const TypeInt* TypeInt::NON_ZERO; const TypeInt* TypeInt::POS; // Positive 32-bit integers or zero const TypeInt* TypeInt::POS1; // Positive 32-bit integers const TypeInt* TypeInt::INT; // 32-bit integers const TypeInt* TypeInt::SYMINT; // symmetric range [-max_jint..max_jint] const TypeInt* TypeInt::TYPE_DOMAIN; // alias for TypeInt::INT TypeInt::TypeInt(const TypeIntPrototype& t, int widen, bool dual) : TypeInteger(Int, t.normalize_widen(widen), dual), _lo(t._srange._lo), _hi(t._srange._hi), _ulo(t._urange._lo), _uhi(t._urange._hi), _bits(t._bits) { DEBUG_ONLY(t.verify_constraints()); } const Type* TypeInt::make_or_top(const TypeIntPrototype& t, int widen, bool dual) { auto canonicalized_t = t.canonicalize_constraints(); if (canonicalized_t.empty()) { return dual ? Type::BOTTOM : Type::TOP; } return (new TypeInt(canonicalized_t._data, widen, dual))->hashcons()->is_int(); } const TypeInt* TypeInt::make(jint con) { juint ucon = con; return (new TypeInt(TypeIntPrototype{{con, con}, {ucon, ucon}, {~ucon, ucon}}, WidenMin, false))->hashcons()->is_int(); } const TypeInt* TypeInt::make(jint lo, jint hi, int widen) { assert(lo <= hi, "must be legal bounds"); return make_or_top(TypeIntPrototype{{lo, hi}, {0, max_juint}, {0, 0}}, widen)->is_int(); } const Type* TypeInt::make_or_top(const TypeIntPrototype& t, int widen) { return make_or_top(t, widen, false); } bool TypeInt::contains(jint i) const { assert(!_is_dual, "dual types should only be used for join calculation"); juint u = i; return i >= _lo && i <= _hi && u >= _ulo && u <= _uhi && _bits.is_satisfied_by(u); } bool TypeInt::contains(const TypeInt* t) const { assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation"); return TypeIntHelper::int_type_is_subset(this, t); } const Type* TypeInt::xmeet(const Type* t) const { return TypeIntHelper::int_type_xmeet(this, t); } const Type* TypeInt::xdual() const { return new TypeInt(TypeIntPrototype{{_lo, _hi}, {_ulo, _uhi}, _bits}, _widen, !_is_dual); } const Type* TypeInt::widen(const Type* old, const Type* limit) const { assert(!_is_dual, "dual types should only be used for join calculation"); return TypeIntHelper::int_type_widen(this, old->isa_int(), limit->isa_int()); } const Type* TypeInt::narrow(const Type* old) const { assert(!_is_dual, "dual types should only be used for join calculation"); if (old == nullptr) { return this; } return TypeIntHelper::int_type_narrow(this, old->isa_int()); } //-----------------------------filter------------------------------------------ const Type* TypeInt::filter_helper(const Type* kills, bool include_speculative) const { assert(!_is_dual, "dual types should only be used for join calculation"); const TypeInt* ft = join_helper(kills, include_speculative)->isa_int(); if (ft == nullptr) { return Type::TOP; // Canonical empty value } assert(!ft->_is_dual, "dual types should only be used for join calculation"); if (ft->_widen < this->_widen) { // Do not allow the value of kill->_widen to affect the outcome. // The widen bits must be allowed to run freely through the graph. return (new TypeInt(TypeIntPrototype{{ft->_lo, ft->_hi}, {ft->_ulo, ft->_uhi}, ft->_bits}, this->_widen, false))->hashcons(); } return ft; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeInt::eq(const Type* t) const { const TypeInt* r = t->is_int(); return TypeIntHelper::int_type_is_equal(this, r) && _widen == r->_widen && _is_dual == r->_is_dual; } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeInt::hash(void) const { return (uint)_lo + (uint)_hi + (uint)_ulo + (uint)_uhi + (uint)_bits._zeros + (uint)_bits._ones + (uint)_widen + (uint)_is_dual + (uint)Type::Int; } //------------------------------is_finite-------------------------------------- // Has a finite value bool TypeInt::is_finite() const { return true; } //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants. bool TypeInt::singleton(void) const { return _lo == _hi; } bool TypeInt::empty(void) const { return false; } //============================================================================= // Convenience common pre-built types. const TypeLong* TypeLong::MAX; const TypeLong* TypeLong::MIN; const TypeLong* TypeLong::MINUS_1;// -1 const TypeLong* TypeLong::ZERO; // 0 const TypeLong* TypeLong::ONE; // 1 const TypeLong* TypeLong::NON_ZERO; const TypeLong* TypeLong::POS; // >=0 const TypeLong* TypeLong::NEG; const TypeLong* TypeLong::LONG; // 64-bit integers const TypeLong* TypeLong::INT; // 32-bit subrange const TypeLong* TypeLong::UINT; // 32-bit unsigned subrange const TypeLong* TypeLong::TYPE_DOMAIN; // alias for TypeLong::LONG TypeLong::TypeLong(const TypeIntPrototype& t, int widen, bool dual) : TypeInteger(Long, t.normalize_widen(widen), dual), _lo(t._srange._lo), _hi(t._srange._hi), _ulo(t._urange._lo), _uhi(t._urange._hi), _bits(t._bits) { DEBUG_ONLY(t.verify_constraints()); } const Type* TypeLong::make_or_top(const TypeIntPrototype& t, int widen, bool dual) { auto canonicalized_t = t.canonicalize_constraints(); if (canonicalized_t.empty()) { return dual ? Type::BOTTOM : Type::TOP; } return (new TypeLong(canonicalized_t._data, widen, dual))->hashcons()->is_long(); } const TypeLong* TypeLong::make(jlong con) { julong ucon = con; return (new TypeLong(TypeIntPrototype{{con, con}, {ucon, ucon}, {~ucon, ucon}}, WidenMin, false))->hashcons()->is_long(); } const TypeLong* TypeLong::make(jlong lo, jlong hi, int widen) { assert(lo <= hi, "must be legal bounds"); return make_or_top(TypeIntPrototype{{lo, hi}, {0, max_julong}, {0, 0}}, widen)->is_long(); } const Type* TypeLong::make_or_top(const TypeIntPrototype& t, int widen) { return make_or_top(t, widen, false); } bool TypeLong::contains(jlong i) const { assert(!_is_dual, "dual types should only be used for join calculation"); julong u = i; return i >= _lo && i <= _hi && u >= _ulo && u <= _uhi && _bits.is_satisfied_by(u); } bool TypeLong::contains(const TypeLong* t) const { assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation"); return TypeIntHelper::int_type_is_subset(this, t); } const Type* TypeLong::xmeet(const Type* t) const { return TypeIntHelper::int_type_xmeet(this, t); } const Type* TypeLong::xdual() const { return new TypeLong(TypeIntPrototype{{_lo, _hi}, {_ulo, _uhi}, _bits}, _widen, !_is_dual); } const Type* TypeLong::widen(const Type* old, const Type* limit) const { assert(!_is_dual, "dual types should only be used for join calculation"); return TypeIntHelper::int_type_widen(this, old->isa_long(), limit->isa_long()); } const Type* TypeLong::narrow(const Type* old) const { assert(!_is_dual, "dual types should only be used for join calculation"); if (old == nullptr) { return this; } return TypeIntHelper::int_type_narrow(this, old->isa_long()); } //-----------------------------filter------------------------------------------ const Type* TypeLong::filter_helper(const Type* kills, bool include_speculative) const { assert(!_is_dual, "dual types should only be used for join calculation"); const TypeLong* ft = join_helper(kills, include_speculative)->isa_long(); if (ft == nullptr) { return Type::TOP; // Canonical empty value } assert(!ft->_is_dual, "dual types should only be used for join calculation"); if (ft->_widen < this->_widen) { // Do not allow the value of kill->_widen to affect the outcome. // The widen bits must be allowed to run freely through the graph. return (new TypeLong(TypeIntPrototype{{ft->_lo, ft->_hi}, {ft->_ulo, ft->_uhi}, ft->_bits}, this->_widen, false))->hashcons(); } return ft; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeLong::eq(const Type* t) const { const TypeLong* r = t->is_long(); return TypeIntHelper::int_type_is_equal(this, r) && _widen == r->_widen && _is_dual == r->_is_dual; } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeLong::hash(void) const { return (uint)_lo + (uint)_hi + (uint)_ulo + (uint)_uhi + (uint)_bits._zeros + (uint)_bits._ones + (uint)_widen + (uint)_is_dual + (uint)Type::Long; } //------------------------------is_finite-------------------------------------- // Has a finite value bool TypeLong::is_finite() const { return true; } //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants bool TypeLong::singleton(void) const { return _lo == _hi; } bool TypeLong::empty(void) const { return false; } //------------------------------dump2------------------------------------------ #ifndef PRODUCT void TypeInt::dump2(Dict& d, uint depth, outputStream* st) const { TypeIntHelper::int_type_dump(this, st, false); } void TypeInt::dump_verbose() const { TypeIntHelper::int_type_dump(this, tty, true); } void TypeLong::dump2(Dict& d, uint depth, outputStream* st) const { TypeIntHelper::int_type_dump(this, st, false); } void TypeLong::dump_verbose() const { TypeIntHelper::int_type_dump(this, tty, true); } #endif //============================================================================= // Convenience common pre-built types. const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable const TypeTuple *TypeTuple::IFFALSE; const TypeTuple *TypeTuple::IFTRUE; const TypeTuple *TypeTuple::IFNEITHER; const TypeTuple *TypeTuple::LOOPBODY; const TypeTuple *TypeTuple::MEMBAR; const TypeTuple *TypeTuple::STORECONDITIONAL; const TypeTuple *TypeTuple::START_I2C; const TypeTuple *TypeTuple::INT_PAIR; const TypeTuple *TypeTuple::LONG_PAIR; const TypeTuple *TypeTuple::INT_CC_PAIR; const TypeTuple *TypeTuple::LONG_CC_PAIR; //------------------------------make------------------------------------------- // Make a TypeTuple from the range of a method signature const TypeTuple *TypeTuple::make_range(ciSignature* sig, InterfaceHandling interface_handling) { ciType* return_type = sig->return_type(); uint arg_cnt = return_type->size(); const Type **field_array = fields(arg_cnt); switch (return_type->basic_type()) { case T_LONG: field_array[TypeFunc::Parms] = TypeLong::LONG; field_array[TypeFunc::Parms+1] = Type::HALF; break; case T_DOUBLE: field_array[TypeFunc::Parms] = Type::DOUBLE; field_array[TypeFunc::Parms+1] = Type::HALF; break; case T_OBJECT: case T_ARRAY: case T_BOOLEAN: case T_CHAR: case T_FLOAT: case T_BYTE: case T_SHORT: case T_INT: field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling); break; case T_VOID: break; default: ShouldNotReachHere(); } return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons(); } // Make a TypeTuple from the domain of a method signature const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig, InterfaceHandling interface_handling) { uint arg_cnt = sig->size(); uint pos = TypeFunc::Parms; const Type **field_array; if (recv != nullptr) { arg_cnt++; field_array = fields(arg_cnt); // Use get_const_type here because it respects UseUniqueSubclasses: field_array[pos++] = get_const_type(recv, interface_handling)->join_speculative(TypePtr::NOTNULL); } else { field_array = fields(arg_cnt); } int i = 0; while (pos < TypeFunc::Parms + arg_cnt) { ciType* type = sig->type_at(i); switch (type->basic_type()) { case T_LONG: field_array[pos++] = TypeLong::LONG; field_array[pos++] = Type::HALF; break; case T_DOUBLE: field_array[pos++] = Type::DOUBLE; field_array[pos++] = Type::HALF; break; case T_OBJECT: case T_ARRAY: case T_FLOAT: case T_INT: field_array[pos++] = get_const_type(type, interface_handling); break; case T_BOOLEAN: case T_CHAR: case T_BYTE: case T_SHORT: field_array[pos++] = TypeInt::INT; break; default: ShouldNotReachHere(); } i++; } return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons(); } const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) { return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons(); } //------------------------------fields----------------------------------------- // Subroutine call type with space allocated for argument types // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly const Type **TypeTuple::fields( uint arg_cnt ) { const Type **flds = (const Type **)(Compile::current()->type_arena()->AmallocWords((TypeFunc::Parms+arg_cnt)*sizeof(Type*) )); flds[TypeFunc::Control ] = Type::CONTROL; flds[TypeFunc::I_O ] = Type::ABIO; flds[TypeFunc::Memory ] = Type::MEMORY; flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM; flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS; return flds; } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeTuple::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is Tuple switch (t->base()) { // switch on original type case Bottom: // Ye Olde Default return t; default: // All else is a mistake typerr(t); case Tuple: { // Meeting 2 signatures? const TypeTuple *x = t->is_tuple(); assert( _cnt == x->_cnt, "" ); const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) )); for( uint i=0; i<_cnt; i++ ) fields[i] = field_at(i)->xmeet( x->field_at(i) ); return TypeTuple::make(_cnt,fields); } case Top: break; } return this; // Return the double constant } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const Type *TypeTuple::xdual() const { const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) )); for( uint i=0; i<_cnt; i++ ) fields[i] = _fields[i]->dual(); return new TypeTuple(_cnt,fields); } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeTuple::eq( const Type *t ) const { const TypeTuple *s = (const TypeTuple *)t; if (_cnt != s->_cnt) return false; // Unequal field counts for (uint i = 0; i < _cnt; i++) if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION! return false; // Missed return true; } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeTuple::hash(void) const { uintptr_t sum = _cnt; for( uint i=0; i<_cnt; i++ ) sum += (uintptr_t)_fields[i]; // Hash on pointers directly return (uint)sum; } //------------------------------dump2------------------------------------------ // Dump signature Type #ifndef PRODUCT void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const { st->print("{"); if( !depth || d[this] ) { // Check for recursive print st->print("...}"); return; } d.Insert((void*)this, (void*)this); // Stop recursion if( _cnt ) { uint i; for( i=0; i<_cnt-1; i++ ) { st->print("%d:", i); _fields[i]->dump2(d, depth-1, st); st->print(", "); } st->print("%d:", i); _fields[i]->dump2(d, depth-1, st); } st->print("}"); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Singletons are integer, float or double constants // or a single symbol. bool TypeTuple::singleton(void) const { return false; // Never a singleton } bool TypeTuple::empty(void) const { for( uint i=0; i<_cnt; i++ ) { if (_fields[i]->empty()) return true; } return false; } //============================================================================= // Convenience common pre-built types. inline const TypeInt* normalize_array_size(const TypeInt* size) { // Certain normalizations keep us sane when comparing types. // We do not want arrayOop variables to differ only by the wideness // of their index types. Pick minimum wideness, since that is the // forced wideness of small ranges anyway. if (size->_widen != Type::WidenMin) return TypeInt::make(size->_lo, size->_hi, Type::WidenMin); else return size; } //------------------------------make------------------------------------------- const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable) { if (UseCompressedOops && elem->isa_oopptr()) { elem = elem->make_narrowoop(); } size = normalize_array_size(size); return (TypeAry*)(new TypeAry(elem,size,stable))->hashcons(); } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeAry::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is Ary switch (t->base()) { // switch on original type case Bottom: // Ye Olde Default return t; default: // All else is a mistake typerr(t); case Array: { // Meeting 2 arrays? const TypeAry* a = t->is_ary(); const Type* size = _size->xmeet(a->_size); const TypeInt* isize = size->isa_int(); if (isize == nullptr) { assert(size == Type::TOP || size == Type::BOTTOM, ""); return size; } return TypeAry::make(_elem->meet_speculative(a->_elem), isize, _stable && a->_stable); } case Top: break; } return this; // Return the double constant } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const Type *TypeAry::xdual() const { const TypeInt* size_dual = _size->dual()->is_int(); size_dual = normalize_array_size(size_dual); return new TypeAry(_elem->dual(), size_dual, !_stable); } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeAry::eq( const Type *t ) const { const TypeAry *a = (const TypeAry*)t; return _elem == a->_elem && _stable == a->_stable && _size == a->_size; } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeAry::hash(void) const { return (uint)(uintptr_t)_elem + (uint)(uintptr_t)_size + (uint)(_stable ? 43 : 0); } /** * Return same type without a speculative part in the element */ const TypeAry* TypeAry::remove_speculative() const { return make(_elem->remove_speculative(), _size, _stable); } /** * Return same type with cleaned up speculative part of element */ const Type* TypeAry::cleanup_speculative() const { return make(_elem->cleanup_speculative(), _size, _stable); } /** * Return same type but with a different inline depth (used for speculation) * * @param depth depth to meet with */ const TypePtr* TypePtr::with_inline_depth(int depth) const { if (!UseInlineDepthForSpeculativeTypes) { return this; } return make(AnyPtr, _ptr, _offset, _speculative, depth); } //------------------------------dump2------------------------------------------ #ifndef PRODUCT void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const { if (_stable) st->print("stable:"); _elem->dump2(d, depth, st); st->print("["); _size->dump2(d, depth, st); st->print("]"); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Singletons are integer, float or double constants // or a single symbol. bool TypeAry::singleton(void) const { return false; // Never a singleton } bool TypeAry::empty(void) const { return _elem->empty() || _size->empty(); } //--------------------------ary_must_be_exact---------------------------------- bool TypeAry::ary_must_be_exact() const { // This logic looks at the element type of an array, and returns true // if the element type is either a primitive or a final instance class. // In such cases, an array built on this ary must have no subclasses. if (_elem == BOTTOM) return false; // general array not exact if (_elem == TOP ) return false; // inverted general array not exact const TypeOopPtr* toop = nullptr; if (UseCompressedOops && _elem->isa_narrowoop()) { toop = _elem->make_ptr()->isa_oopptr(); } else { toop = _elem->isa_oopptr(); } if (!toop) return true; // a primitive type, like int if (!toop->is_loaded()) return false; // unloaded class const TypeInstPtr* tinst; if (_elem->isa_narrowoop()) tinst = _elem->make_ptr()->isa_instptr(); else tinst = _elem->isa_instptr(); if (tinst) return tinst->instance_klass()->is_final(); const TypeAryPtr* tap; if (_elem->isa_narrowoop()) tap = _elem->make_ptr()->isa_aryptr(); else tap = _elem->isa_aryptr(); if (tap) return tap->ary()->ary_must_be_exact(); return false; } //==============================TypeVect======================================= // Convenience common pre-built types. const TypeVect* TypeVect::VECTA = nullptr; // vector length agnostic const TypeVect* TypeVect::VECTS = nullptr; // 32-bit vectors const TypeVect* TypeVect::VECTD = nullptr; // 64-bit vectors const TypeVect* TypeVect::VECTX = nullptr; // 128-bit vectors const TypeVect* TypeVect::VECTY = nullptr; // 256-bit vectors const TypeVect* TypeVect::VECTZ = nullptr; // 512-bit vectors const TypeVect* TypeVect::VECTMASK = nullptr; // predicate/mask vector //------------------------------make------------------------------------------- const TypeVect* TypeVect::make(BasicType elem_bt, uint length, bool is_mask) { if (is_mask) { return makemask(elem_bt, length); } assert(is_java_primitive(elem_bt), "only primitive types in vector"); assert(Matcher::vector_size_supported(elem_bt, length), "length in range"); int size = length * type2aelembytes(elem_bt); switch (Matcher::vector_ideal_reg(size)) { case Op_VecA: return (TypeVect*)(new TypeVectA(elem_bt, length))->hashcons(); case Op_VecS: return (TypeVect*)(new TypeVectS(elem_bt, length))->hashcons(); case Op_RegL: case Op_VecD: case Op_RegD: return (TypeVect*)(new TypeVectD(elem_bt, length))->hashcons(); case Op_VecX: return (TypeVect*)(new TypeVectX(elem_bt, length))->hashcons(); case Op_VecY: return (TypeVect*)(new TypeVectY(elem_bt, length))->hashcons(); case Op_VecZ: return (TypeVect*)(new TypeVectZ(elem_bt, length))->hashcons(); } ShouldNotReachHere(); return nullptr; } const TypeVect* TypeVect::makemask(BasicType elem_bt, uint length) { if (Matcher::has_predicated_vectors() && Matcher::match_rule_supported_vector_masked(Op_VectorLoadMask, length, elem_bt)) { return TypeVectMask::make(elem_bt, length); } else { return make(elem_bt, length); } } //------------------------------meet------------------------------------------- // Compute the MEET of two types. Since each TypeVect is the only instance of // its species, meeting often returns itself const Type* TypeVect::xmeet(const Type* t) const { // Perform a fast test for common case; meeting the same types together. if (this == t) { return this; } // Current "this->_base" is Vector switch (t->base()) { // switch on original type case Bottom: // Ye Olde Default return t; default: // All else is a mistake typerr(t); case VectorMask: case VectorA: case VectorS: case VectorD: case VectorX: case VectorY: case VectorZ: { // Meeting 2 vectors? const TypeVect* v = t->is_vect(); assert(base() == v->base(), ""); assert(length() == v->length(), ""); assert(element_basic_type() == v->element_basic_type(), ""); return this; } case Top: break; } return this; } //------------------------------xdual------------------------------------------ // Since each TypeVect is the only instance of its species, it is self-dual const Type* TypeVect::xdual() const { return this; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeVect::eq(const Type* t) const { const TypeVect* v = t->is_vect(); return (element_basic_type() == v->element_basic_type()) && (length() == v->length()); } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeVect::hash(void) const { return (uint)base() + (uint)(uintptr_t)_elem_bt + (uint)(uintptr_t)_length; } //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Vector is singleton if all elements are the same // constant value (when vector is created with Replicate code). bool TypeVect::singleton(void) const { // There is no Con node for vectors yet. // return _elem->singleton(); return false; } bool TypeVect::empty(void) const { return false; } //------------------------------dump2------------------------------------------ #ifndef PRODUCT void TypeVect::dump2(Dict& d, uint depth, outputStream* st) const { switch (base()) { case VectorA: st->print("vectora"); break; case VectorS: st->print("vectors"); break; case VectorD: st->print("vectord"); break; case VectorX: st->print("vectorx"); break; case VectorY: st->print("vectory"); break; case VectorZ: st->print("vectorz"); break; case VectorMask: st->print("vectormask"); break; default: ShouldNotReachHere(); } st->print("<%c,%u>", type2char(element_basic_type()), length()); } #endif const TypeVectMask* TypeVectMask::make(const BasicType elem_bt, uint length) { return (TypeVectMask*) (new TypeVectMask(elem_bt, length))->hashcons(); } //============================================================================= // Convenience common pre-built types. const TypePtr *TypePtr::NULL_PTR; const TypePtr *TypePtr::NOTNULL; const TypePtr *TypePtr::BOTTOM; //------------------------------meet------------------------------------------- // Meet over the PTR enum const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = { // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,}, { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,}, { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,}, { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,}, { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,}, { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,} }; //------------------------------make------------------------------------------- const TypePtr *TypePtr::make(TYPES t, enum PTR ptr, int offset, const TypePtr* speculative, int inline_depth) { return (TypePtr*)(new TypePtr(t,ptr,offset, speculative, inline_depth))->hashcons(); } //------------------------------cast_to_ptr_type------------------------------- const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const { assert(_base == AnyPtr, "subclass must override cast_to_ptr_type"); if( ptr == _ptr ) return this; return make(_base, ptr, _offset, _speculative, _inline_depth); } //------------------------------get_con---------------------------------------- intptr_t TypePtr::get_con() const { assert( _ptr == Null, "" ); return _offset; } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypePtr::xmeet(const Type *t) const { const Type* res = xmeet_helper(t); if (res->isa_ptr() == nullptr) { return res; } const TypePtr* res_ptr = res->is_ptr(); if (res_ptr->speculative() != nullptr) { // type->speculative() is null means that speculation is no better // than type, i.e. type->speculative() == type. So there are 2 // ways to represent the fact that we have no useful speculative // data and we should use a single one to be able to test for // equality between types. Check whether type->speculative() == // type and set speculative to null if it is the case. if (res_ptr->remove_speculative() == res_ptr->speculative()) { return res_ptr->remove_speculative(); } } return res; } const Type *TypePtr::xmeet_helper(const Type *t) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is AnyPtr switch (t->base()) { // switch on original type case Int: // Mixing ints & oops happens when javac case Long: // reuses local variables case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; case AnyPtr: { // Meeting to AnyPtrs const TypePtr *tp = t->is_ptr(); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth); } case RawPtr: // For these, flip the call around to cut down case OopPtr: case InstPtr: // on the cases I have to handle. case AryPtr: case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: return t->xmeet(this); // Call in reverse direction default: // All else is a mistake typerr(t); } return this; } //------------------------------meet_offset------------------------------------ int TypePtr::meet_offset( int offset ) const { // Either is 'TOP' offset? Return the other offset! if( _offset == OffsetTop ) return offset; if( offset == OffsetTop ) return _offset; // If either is different, return 'BOTTOM' offset if( _offset != offset ) return OffsetBot; return _offset; } //------------------------------dual_offset------------------------------------ int TypePtr::dual_offset( ) const { if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM' if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP' return _offset; // Map everything else into self } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = { BotPTR, NotNull, Constant, Null, AnyNull, TopPTR }; const Type *TypePtr::xdual() const { return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), dual_speculative(), dual_inline_depth()); } //------------------------------xadd_offset------------------------------------ int TypePtr::xadd_offset( intptr_t offset ) const { // Adding to 'TOP' offset? Return 'TOP'! if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop; // Adding to 'BOTTOM' offset? Return 'BOTTOM'! if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot; // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'! offset += (intptr_t)_offset; if (offset != (int)offset || offset == OffsetTop) return OffsetBot; // assert( _offset >= 0 && _offset+offset >= 0, "" ); // It is possible to construct a negative offset during PhaseCCP return (int)offset; // Sum valid offsets } //------------------------------add_offset------------------------------------- const TypePtr *TypePtr::add_offset( intptr_t offset ) const { return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth); } const TypePtr *TypePtr::with_offset(intptr_t offset) const { return make(AnyPtr, _ptr, offset, _speculative, _inline_depth); } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypePtr::eq( const Type *t ) const { const TypePtr *a = (const TypePtr*)t; return _ptr == a->ptr() && _offset == a->offset() && eq_speculative(a) && _inline_depth == a->_inline_depth; } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypePtr::hash(void) const { return (uint)_ptr + (uint)_offset + (uint)hash_speculative() + (uint)_inline_depth; } /** * Return same type without a speculative part */ const TypePtr* TypePtr::remove_speculative() const { if (_speculative == nullptr) { return this; } assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth); } /** * Return same type but drop speculative part if we know we won't use * it */ const Type* TypePtr::cleanup_speculative() const { if (speculative() == nullptr) { return this; } const Type* no_spec = remove_speculative(); // If this is NULL_PTR then we don't need the speculative type // (with_inline_depth in case the current type inline depth is // InlineDepthTop) if (no_spec == NULL_PTR->with_inline_depth(inline_depth())) { return no_spec; } if (above_centerline(speculative()->ptr())) { return no_spec; } const TypeOopPtr* spec_oopptr = speculative()->isa_oopptr(); // If the speculative may be null and is an inexact klass then it // doesn't help if (speculative() != TypePtr::NULL_PTR && speculative()->maybe_null() && (spec_oopptr == nullptr || !spec_oopptr->klass_is_exact())) { return no_spec; } return this; } /** * dual of the speculative part of the type */ const TypePtr* TypePtr::dual_speculative() const { if (_speculative == nullptr) { return nullptr; } return _speculative->dual()->is_ptr(); } /** * meet of the speculative parts of 2 types * * @param other type to meet with */ const TypePtr* TypePtr::xmeet_speculative(const TypePtr* other) const { bool this_has_spec = (_speculative != nullptr); bool other_has_spec = (other->speculative() != nullptr); if (!this_has_spec && !other_has_spec) { return nullptr; } // If we are at a point where control flow meets and one branch has // a speculative type and the other has not, we meet the speculative // type of one branch with the actual type of the other. If the // actual type is exact and the speculative is as well, then the // result is a speculative type which is exact and we can continue // speculation further. const TypePtr* this_spec = _speculative; const TypePtr* other_spec = other->speculative(); if (!this_has_spec) { this_spec = this; } if (!other_has_spec) { other_spec = other; } return this_spec->meet(other_spec)->is_ptr(); } /** * dual of the inline depth for this type (used for speculation) */ int TypePtr::dual_inline_depth() const { return -inline_depth(); } /** * meet of 2 inline depths (used for speculation) * * @param depth depth to meet with */ int TypePtr::meet_inline_depth(int depth) const { return MAX2(inline_depth(), depth); } /** * Are the speculative parts of 2 types equal? * * @param other type to compare this one to */ bool TypePtr::eq_speculative(const TypePtr* other) const { if (_speculative == nullptr || other->speculative() == nullptr) { return _speculative == other->speculative(); } if (_speculative->base() != other->speculative()->base()) { return false; } return _speculative->eq(other->speculative()); } /** * Hash of the speculative part of the type */ int TypePtr::hash_speculative() const { if (_speculative == nullptr) { return 0; } return _speculative->hash(); } /** * add offset to the speculative part of the type * * @param offset offset to add */ const TypePtr* TypePtr::add_offset_speculative(intptr_t offset) const { if (_speculative == nullptr) { return nullptr; } return _speculative->add_offset(offset)->is_ptr(); } const TypePtr* TypePtr::with_offset_speculative(intptr_t offset) const { if (_speculative == nullptr) { return nullptr; } return _speculative->with_offset(offset)->is_ptr(); } /** * return exact klass from the speculative type if there's one */ ciKlass* TypePtr::speculative_type() const { if (_speculative != nullptr && _speculative->isa_oopptr()) { const TypeOopPtr* speculative = _speculative->join(this)->is_oopptr(); if (speculative->klass_is_exact()) { return speculative->exact_klass(); } } return nullptr; } /** * return true if speculative type may be null */ bool TypePtr::speculative_maybe_null() const { if (_speculative != nullptr) { const TypePtr* speculative = _speculative->join(this)->is_ptr(); return speculative->maybe_null(); } return true; } bool TypePtr::speculative_always_null() const { if (_speculative != nullptr) { const TypePtr* speculative = _speculative->join(this)->is_ptr(); return speculative == TypePtr::NULL_PTR; } return false; } /** * Same as TypePtr::speculative_type() but return the klass only if * the speculative tells us is not null */ ciKlass* TypePtr::speculative_type_not_null() const { if (speculative_maybe_null()) { return nullptr; } return speculative_type(); } /** * Check whether new profiling would improve speculative type * * @param exact_kls class from profiling * @param inline_depth inlining depth of profile point * * @return true if type profile is valuable */ bool TypePtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { // no profiling? if (exact_kls == nullptr) { return false; } if (speculative() == TypePtr::NULL_PTR) { return false; } // no speculative type or non exact speculative type? if (speculative_type() == nullptr) { return true; } // If the node already has an exact speculative type keep it, // unless it was provided by profiling that is at a deeper // inlining level. Profiling at a higher inlining depth is // expected to be less accurate. if (_speculative->inline_depth() == InlineDepthBottom) { return false; } assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison"); return inline_depth < _speculative->inline_depth(); } /** * Check whether new profiling would improve ptr (= tells us it is non * null) * * @param ptr_kind always null or not null? * * @return true if ptr profile is valuable */ bool TypePtr::would_improve_ptr(ProfilePtrKind ptr_kind) const { // profiling doesn't tell us anything useful if (ptr_kind != ProfileAlwaysNull && ptr_kind != ProfileNeverNull) { return false; } // We already know this is not null if (!this->maybe_null()) { return false; } // We already know the speculative type cannot be null if (!speculative_maybe_null()) { return false; } // We already know this is always null if (this == TypePtr::NULL_PTR) { return false; } // We already know the speculative type is always null if (speculative_always_null()) { return false; } if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) { return false; } return true; } //------------------------------dump2------------------------------------------ const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = { "TopPTR","AnyNull","Constant","null","NotNull","BotPTR" }; #ifndef PRODUCT void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const { if( _ptr == Null ) st->print("null"); else st->print("%s *", ptr_msg[_ptr]); if( _offset == OffsetTop ) st->print("+top"); else if( _offset == OffsetBot ) st->print("+bot"); else if( _offset ) st->print("+%d", _offset); dump_inline_depth(st); dump_speculative(st); } /** *dump the speculative part of the type */ void TypePtr::dump_speculative(outputStream *st) const { if (_speculative != nullptr) { st->print(" (speculative="); _speculative->dump_on(st); st->print(")"); } } /** *dump the inline depth of the type */ void TypePtr::dump_inline_depth(outputStream *st) const { if (_inline_depth != InlineDepthBottom) { if (_inline_depth == InlineDepthTop) { st->print(" (inline_depth=InlineDepthTop)"); } else { st->print(" (inline_depth=%d)", _inline_depth); } } } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants bool TypePtr::singleton(void) const { // TopPTR, Null, AnyNull, Constant are all singletons return (_offset != OffsetBot) && !below_centerline(_ptr); } bool TypePtr::empty(void) const { return (_offset == OffsetTop) || above_centerline(_ptr); } //============================================================================= // Convenience common pre-built types. const TypeRawPtr *TypeRawPtr::BOTTOM; const TypeRawPtr *TypeRawPtr::NOTNULL; //------------------------------make------------------------------------------- const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) { assert( ptr != Constant, "what is the constant?" ); assert( ptr != Null, "Use TypePtr for null" ); return (TypeRawPtr*)(new TypeRawPtr(ptr,nullptr))->hashcons(); } const TypeRawPtr *TypeRawPtr::make(address bits) { assert(bits != nullptr, "Use TypePtr for null"); return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons(); } //------------------------------cast_to_ptr_type------------------------------- const TypeRawPtr* TypeRawPtr::cast_to_ptr_type(PTR ptr) const { assert( ptr != Constant, "what is the constant?" ); assert( ptr != Null, "Use TypePtr for null" ); assert( _bits == nullptr, "Why cast a constant address?"); if( ptr == _ptr ) return this; return make(ptr); } //------------------------------get_con---------------------------------------- intptr_t TypeRawPtr::get_con() const { assert( _ptr == Null || _ptr == Constant, "" ); return (intptr_t)_bits; } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeRawPtr::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is RawPtr switch( t->base() ) { // switch on original type case Bottom: // Ye Olde Default return t; case Top: return this; case AnyPtr: // Meeting to AnyPtrs break; case RawPtr: { // might be top, bot, any/not or constant enum PTR tptr = t->is_ptr()->ptr(); enum PTR ptr = meet_ptr( tptr ); if( ptr == Constant ) { // Cannot be equal constants, so... if( tptr == Constant && _ptr != Constant) return t; if( _ptr == Constant && tptr != Constant) return this; ptr = NotNull; // Fall down in lattice } return make( ptr ); } case OopPtr: case InstPtr: case AryPtr: case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: return TypePtr::BOTTOM; // Oop meet raw is not well defined default: // All else is a mistake typerr(t); } // Found an AnyPtr type vs self-RawPtr type const TypePtr *tp = t->is_ptr(); switch (tp->ptr()) { case TypePtr::TopPTR: return this; case TypePtr::BotPTR: return t; case TypePtr::Null: if( _ptr == TypePtr::TopPTR ) return t; return TypeRawPtr::BOTTOM; case TypePtr::NotNull: return TypePtr::make(AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0), tp->speculative(), tp->inline_depth()); case TypePtr::AnyNull: if( _ptr == TypePtr::Constant) return this; return make( meet_ptr(TypePtr::AnyNull) ); default: ShouldNotReachHere(); } return this; } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const Type *TypeRawPtr::xdual() const { return new TypeRawPtr( dual_ptr(), _bits ); } //------------------------------add_offset------------------------------------- const TypePtr* TypeRawPtr::add_offset(intptr_t offset) const { if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer if( offset == 0 ) return this; // No change switch (_ptr) { case TypePtr::TopPTR: case TypePtr::BotPTR: case TypePtr::NotNull: return this; case TypePtr::Constant: { uintptr_t bits = (uintptr_t)_bits; uintptr_t sum = bits + offset; if (( offset < 0 ) ? ( sum > bits ) // Underflow? : ( sum < bits )) { // Overflow? return BOTTOM; } else if ( sum == 0 ) { return TypePtr::NULL_PTR; } else { return make( (address)sum ); } } default: ShouldNotReachHere(); } } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeRawPtr::eq( const Type *t ) const { const TypeRawPtr *a = (const TypeRawPtr*)t; return _bits == a->_bits && TypePtr::eq(t); } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeRawPtr::hash(void) const { return (uint)(uintptr_t)_bits + (uint)TypePtr::hash(); } //------------------------------dump2------------------------------------------ #ifndef PRODUCT void TypeRawPtr::dump2( Dict &d, uint depth, outputStream *st ) const { if( _ptr == Constant ) st->print(INTPTR_FORMAT, p2i(_bits)); else st->print("rawptr:%s", ptr_msg[_ptr]); } #endif //============================================================================= // Convenience common pre-built type. const TypeOopPtr *TypeOopPtr::BOTTOM; TypeInterfaces::TypeInterfaces(ciInstanceKlass** interfaces_base, int nb_interfaces) : Type(Interfaces), _interfaces(interfaces_base, nb_interfaces), _hash(0), _exact_klass(nullptr) { _interfaces.sort(compare); initialize(); } const TypeInterfaces* TypeInterfaces::make(GrowableArray* interfaces) { // hashcons() can only delete the last thing that was allocated: to // make sure all memory for the newly created TypeInterfaces can be // freed if an identical one exists, allocate space for the array of // interfaces right after the TypeInterfaces object so that they // form a contiguous piece of memory. int nb_interfaces = interfaces == nullptr ? 0 : interfaces->length(); size_t total_size = sizeof(TypeInterfaces) + nb_interfaces * sizeof(ciInstanceKlass*); void* allocated_mem = operator new(total_size); ciInstanceKlass** interfaces_base = (ciInstanceKlass**)((char*)allocated_mem + sizeof(TypeInterfaces)); for (int i = 0; i < nb_interfaces; ++i) { interfaces_base[i] = interfaces->at(i); } TypeInterfaces* result = ::new (allocated_mem) TypeInterfaces(interfaces_base, nb_interfaces); return (const TypeInterfaces*)result->hashcons(); } void TypeInterfaces::initialize() { compute_hash(); compute_exact_klass(); DEBUG_ONLY(_initialized = true;) } int TypeInterfaces::compare(ciInstanceKlass* const& k1, ciInstanceKlass* const& k2) { if ((intptr_t)k1 < (intptr_t)k2) { return -1; } else if ((intptr_t)k1 > (intptr_t)k2) { return 1; } return 0; } int TypeInterfaces::compare(ciInstanceKlass** k1, ciInstanceKlass** k2) { return compare(*k1, *k2); } bool TypeInterfaces::eq(const Type* t) const { const TypeInterfaces* other = (const TypeInterfaces*)t; if (_interfaces.length() != other->_interfaces.length()) { return false; } for (int i = 0; i < _interfaces.length(); i++) { ciKlass* k1 = _interfaces.at(i); ciKlass* k2 = other->_interfaces.at(i); if (!k1->equals(k2)) { return false; } } return true; } bool TypeInterfaces::eq(ciInstanceKlass* k) const { assert(k->is_loaded(), "should be loaded"); GrowableArray* interfaces = k->transitive_interfaces(); if (_interfaces.length() != interfaces->length()) { return false; } for (int i = 0; i < interfaces->length(); i++) { bool found = false; _interfaces.find_sorted(interfaces->at(i), found); if (!found) { return false; } } return true; } uint TypeInterfaces::hash() const { assert(_initialized, "must be"); return _hash; } const Type* TypeInterfaces::xdual() const { return this; } void TypeInterfaces::compute_hash() { uint hash = 0; for (int i = 0; i < _interfaces.length(); i++) { ciKlass* k = _interfaces.at(i); hash += k->hash(); } _hash = hash; } static int compare_interfaces(ciInstanceKlass** k1, ciInstanceKlass** k2) { return (int)((*k1)->ident() - (*k2)->ident()); } void TypeInterfaces::dump(outputStream* st) const { if (_interfaces.length() == 0) { return; } ResourceMark rm; st->print(" ("); GrowableArray interfaces; interfaces.appendAll(&_interfaces); // Sort the interfaces so they are listed in the same order from one run to the other of the same compilation interfaces.sort(compare_interfaces); for (int i = 0; i < interfaces.length(); i++) { if (i > 0) { st->print(","); } ciKlass* k = interfaces.at(i); k->print_name_on(st); } st->print(")"); } #ifdef ASSERT void TypeInterfaces::verify() const { for (int i = 1; i < _interfaces.length(); i++) { ciInstanceKlass* k1 = _interfaces.at(i-1); ciInstanceKlass* k2 = _interfaces.at(i); assert(compare(k2, k1) > 0, "should be ordered"); assert(k1 != k2, "no duplicate"); } } #endif const TypeInterfaces* TypeInterfaces::union_with(const TypeInterfaces* other) const { GrowableArray result_list; int i = 0; int j = 0; while (i < _interfaces.length() || j < other->_interfaces.length()) { while (i < _interfaces.length() && (j >= other->_interfaces.length() || compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) { result_list.push(_interfaces.at(i)); i++; } while (j < other->_interfaces.length() && (i >= _interfaces.length() || compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) { result_list.push(other->_interfaces.at(j)); j++; } if (i < _interfaces.length() && j < other->_interfaces.length() && _interfaces.at(i) == other->_interfaces.at(j)) { result_list.push(_interfaces.at(i)); i++; j++; } } const TypeInterfaces* result = TypeInterfaces::make(&result_list); #ifdef ASSERT result->verify(); for (int i = 0; i < _interfaces.length(); i++) { assert(result->_interfaces.contains(_interfaces.at(i)), "missing"); } for (int i = 0; i < other->_interfaces.length(); i++) { assert(result->_interfaces.contains(other->_interfaces.at(i)), "missing"); } for (int i = 0; i < result->_interfaces.length(); i++) { assert(_interfaces.contains(result->_interfaces.at(i)) || other->_interfaces.contains(result->_interfaces.at(i)), "missing"); } #endif return result; } const TypeInterfaces* TypeInterfaces::intersection_with(const TypeInterfaces* other) const { GrowableArray result_list; int i = 0; int j = 0; while (i < _interfaces.length() || j < other->_interfaces.length()) { while (i < _interfaces.length() && (j >= other->_interfaces.length() || compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) { i++; } while (j < other->_interfaces.length() && (i >= _interfaces.length() || compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) { j++; } if (i < _interfaces.length() && j < other->_interfaces.length() && _interfaces.at(i) == other->_interfaces.at(j)) { result_list.push(_interfaces.at(i)); i++; j++; } } const TypeInterfaces* result = TypeInterfaces::make(&result_list); #ifdef ASSERT result->verify(); for (int i = 0; i < _interfaces.length(); i++) { assert(!other->_interfaces.contains(_interfaces.at(i)) || result->_interfaces.contains(_interfaces.at(i)), "missing"); } for (int i = 0; i < other->_interfaces.length(); i++) { assert(!_interfaces.contains(other->_interfaces.at(i)) || result->_interfaces.contains(other->_interfaces.at(i)), "missing"); } for (int i = 0; i < result->_interfaces.length(); i++) { assert(_interfaces.contains(result->_interfaces.at(i)) && other->_interfaces.contains(result->_interfaces.at(i)), "missing"); } #endif return result; } // Is there a single ciKlass* that can represent the interface set? ciInstanceKlass* TypeInterfaces::exact_klass() const { assert(_initialized, "must be"); return _exact_klass; } void TypeInterfaces::compute_exact_klass() { if (_interfaces.length() == 0) { _exact_klass = nullptr; return; } ciInstanceKlass* res = nullptr; for (int i = 0; i < _interfaces.length(); i++) { ciInstanceKlass* interface = _interfaces.at(i); if (eq(interface)) { assert(res == nullptr, ""); res = interface; } } _exact_klass = res; } #ifdef ASSERT void TypeInterfaces::verify_is_loaded() const { for (int i = 0; i < _interfaces.length(); i++) { ciKlass* interface = _interfaces.at(i); assert(interface->is_loaded(), "Interface not loaded"); } } #endif // Can't be implemented because there's no way to know if the type is above or below the center line. const Type* TypeInterfaces::xmeet(const Type* t) const { ShouldNotReachHere(); return Type::xmeet(t); } bool TypeInterfaces::singleton(void) const { ShouldNotReachHere(); return Type::singleton(); } bool TypeInterfaces::has_non_array_interface() const { assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?"); return !TypeAryPtr::_array_interfaces->contains(this); } //------------------------------TypeOopPtr------------------------------------- TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int offset, int instance_id, const TypePtr* speculative, int inline_depth) : TypePtr(t, ptr, offset, speculative, inline_depth), _const_oop(o), _klass(k), _interfaces(interfaces), _klass_is_exact(xk), _is_ptr_to_narrowoop(false), _is_ptr_to_narrowklass(false), _is_ptr_to_boxed_value(false), _instance_id(instance_id) { #ifdef ASSERT if (klass() != nullptr && klass()->is_loaded()) { interfaces->verify_is_loaded(); } #endif if (Compile::current()->eliminate_boxing() && (t == InstPtr) && (offset > 0) && xk && (k != nullptr) && k->is_instance_klass()) { _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset); } #ifdef _LP64 if (_offset > 0 || _offset == Type::OffsetTop || _offset == Type::OffsetBot) { if (_offset == oopDesc::klass_offset_in_bytes()) { _is_ptr_to_narrowklass = UseCompressedClassPointers; } else if (klass() == nullptr) { // Array with unknown body type assert(this->isa_aryptr(), "only arrays without klass"); _is_ptr_to_narrowoop = UseCompressedOops; } else if (this->isa_aryptr()) { _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() && _offset != arrayOopDesc::length_offset_in_bytes()); } else if (klass()->is_instance_klass()) { ciInstanceKlass* ik = klass()->as_instance_klass(); if (this->isa_klassptr()) { // Perm objects don't use compressed references } else if (_offset == OffsetBot || _offset == OffsetTop) { // unsafe access _is_ptr_to_narrowoop = UseCompressedOops; } else { assert(this->isa_instptr(), "must be an instance ptr."); if (klass() == ciEnv::current()->Class_klass() && (_offset == java_lang_Class::klass_offset() || _offset == java_lang_Class::array_klass_offset())) { // Special hidden fields from the Class. assert(this->isa_instptr(), "must be an instance ptr."); _is_ptr_to_narrowoop = false; } else if (klass() == ciEnv::current()->Class_klass() && _offset >= InstanceMirrorKlass::offset_of_static_fields()) { // Static fields ciField* field = nullptr; if (const_oop() != nullptr) { ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass(); field = k->get_field_by_offset(_offset, true); } if (field != nullptr) { BasicType basic_elem_type = field->layout_type(); _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type); } else { // unsafe access _is_ptr_to_narrowoop = UseCompressedOops; } } else { // Instance fields which contains a compressed oop references. ciField* field = ik->get_field_by_offset(_offset, false); if (field != nullptr) { BasicType basic_elem_type = field->layout_type(); _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type); } else if (klass()->equals(ciEnv::current()->Object_klass())) { // Compile::find_alias_type() cast exactness on all types to verify // that it does not affect alias type. _is_ptr_to_narrowoop = UseCompressedOops; } else { // Type for the copy start in LibraryCallKit::inline_native_clone(). _is_ptr_to_narrowoop = UseCompressedOops; } } } } } #endif } //------------------------------make------------------------------------------- const TypeOopPtr *TypeOopPtr::make(PTR ptr, int offset, int instance_id, const TypePtr* speculative, int inline_depth) { assert(ptr != Constant, "no constant generic pointers"); ciKlass* k = Compile::current()->env()->Object_klass(); bool xk = false; ciObject* o = nullptr; const TypeInterfaces* interfaces = TypeInterfaces::make(); return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, instance_id, speculative, inline_depth))->hashcons(); } //------------------------------cast_to_ptr_type------------------------------- const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const { assert(_base == OopPtr, "subclass must override cast_to_ptr_type"); if( ptr == _ptr ) return this; return make(ptr, _offset, _instance_id, _speculative, _inline_depth); } //-----------------------------cast_to_instance_id---------------------------- const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const { // There are no instances of a general oop. // Return self unchanged. return this; } //-----------------------------cast_to_exactness------------------------------- const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const { // There is no such thing as an exact general oop. // Return self unchanged. return this; } //------------------------------as_klass_type---------------------------------- // Return the klass type corresponding to this instance or array type. // It is the type that is loaded from an object of this type. const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const { ShouldNotReachHere(); return nullptr; } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeOopPtr::xmeet_helper(const Type *t) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is OopPtr switch (t->base()) { // switch on original type case Int: // Mixing ints & oops happens when javac case Long: // reuses local variables case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; default: // All else is a mistake typerr(t); case RawPtr: case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: return TypePtr::BOTTOM; // Oop meet raw is not well defined case AnyPtr: { // Found an AnyPtr type vs self-OopPtr type const TypePtr *tp = t->is_ptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); switch (tp->ptr()) { case Null: if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); // else fall through: case TopPTR: case AnyNull: { int instance_id = meet_instance_id(InstanceTop); return make(ptr, offset, instance_id, speculative, depth); } case BotPTR: case NotNull: return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); default: typerr(t); } } case OopPtr: { // Meeting to other OopPtrs const TypeOopPtr *tp = t->is_oopptr(); int instance_id = meet_instance_id(tp->instance_id()); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth); } case InstPtr: // For these, flip the call around to cut down case AryPtr: return t->xmeet(this); // Call in reverse direction } // End of switch return this; // Return the double constant } //------------------------------xdual------------------------------------------ // Dual of a pure heap pointer. No relevant klass or oop information. const Type *TypeOopPtr::xdual() const { assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here"); assert(const_oop() == nullptr, "no constants here"); return new TypeOopPtr(_base, dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth()); } //--------------------------make_from_klass_common----------------------------- // Computes the element-type given a klass. const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass* klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) { if (klass->is_instance_klass()) { Compile* C = Compile::current(); Dependencies* deps = C->dependencies(); assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); // Element is an instance bool klass_is_exact = false; if (klass->is_loaded()) { // Try to set klass_is_exact. ciInstanceKlass* ik = klass->as_instance_klass(); klass_is_exact = ik->is_final(); if (!klass_is_exact && klass_change && deps != nullptr && UseUniqueSubclasses) { ciInstanceKlass* sub = ik->unique_concrete_subklass(); if (sub != nullptr) { deps->assert_abstract_with_unique_concrete_subtype(ik, sub); klass = ik = sub; klass_is_exact = sub->is_final(); } } if (!klass_is_exact && try_for_exact && deps != nullptr && !ik->is_interface() && !ik->has_subklass()) { // Add a dependence; if concrete subclass added we need to recompile deps->assert_leaf_type(ik); klass_is_exact = true; } } const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling); return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, 0); } else if (klass->is_obj_array_klass()) { // Element is an object array. Recursively call ourself. ciKlass* eklass = klass->as_obj_array_klass()->element_klass(); const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(eklass, false, try_for_exact, interface_handling); bool xk = etype->klass_is_exact(); const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); // We used to pass NotNull in here, asserting that the sub-arrays // are all not-null. This is not true in generally, as code can // slam nulls down in the subarrays. const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, 0); return arr; } else if (klass->is_type_array_klass()) { // Element is an typeArray const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type()); const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); // We used to pass NotNull in here, asserting that the array pointer // is not-null. That was not true in general. const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0); return arr; } else { ShouldNotReachHere(); return nullptr; } } //------------------------------make_from_constant----------------------------- // Make a java pointer from an oop constant const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) { assert(!o->is_null_object(), "null object not yet handled here."); const bool make_constant = require_constant || o->should_be_constant(); ciKlass* klass = o->klass(); if (klass->is_instance_klass()) { // Element is an instance if (make_constant) { return TypeInstPtr::make(o); } else { return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, 0); } } else if (klass->is_obj_array_klass()) { // Element is an object array. Recursively call ourself. const TypeOopPtr *etype = TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass(), trust_interfaces); const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); // We used to pass NotNull in here, asserting that the sub-arrays // are all not-null. This is not true in generally, as code can // slam nulls down in the subarrays. if (make_constant) { return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0); } else { return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); } } else if (klass->is_type_array_klass()) { // Element is an typeArray const Type* etype = (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type()); const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); // We used to pass NotNull in here, asserting that the array pointer // is not-null. That was not true in general. if (make_constant) { return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0); } else { return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); } } fatal("unhandled object type"); return nullptr; } //------------------------------get_con---------------------------------------- intptr_t TypeOopPtr::get_con() const { assert( _ptr == Null || _ptr == Constant, "" ); assert( _offset >= 0, "" ); if (_offset != 0) { // After being ported to the compiler interface, the compiler no longer // directly manipulates the addresses of oops. Rather, it only has a pointer // to a handle at compile time. This handle is embedded in the generated // code and dereferenced at the time the nmethod is made. Until that time, // it is not reasonable to do arithmetic with the addresses of oops (we don't // have access to the addresses!). This does not seem to currently happen, // but this assertion here is to help prevent its occurrence. tty->print_cr("Found oop constant with non-zero offset"); ShouldNotReachHere(); } return (intptr_t)const_oop()->constant_encoding(); } //-----------------------------filter------------------------------------------ // Do not allow interface-vs.-noninterface joins to collapse to top. const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const { const Type* ft = join_helper(kills, include_speculative); if (ft->empty()) { return Type::TOP; // Canonical empty value } return ft; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeOopPtr::eq( const Type *t ) const { const TypeOopPtr *a = (const TypeOopPtr*)t; if (_klass_is_exact != a->_klass_is_exact || _instance_id != a->_instance_id) return false; ciObject* one = const_oop(); ciObject* two = a->const_oop(); if (one == nullptr || two == nullptr) { return (one == two) && TypePtr::eq(t); } else { return one->equals(two) && TypePtr::eq(t); } } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeOopPtr::hash(void) const { return (uint)(const_oop() ? const_oop()->hash() : 0) + (uint)_klass_is_exact + (uint)_instance_id + TypePtr::hash(); } //------------------------------dump2------------------------------------------ #ifndef PRODUCT void TypeOopPtr::dump2( Dict &d, uint depth, outputStream *st ) const { st->print("oopptr:%s", ptr_msg[_ptr]); if( _klass_is_exact ) st->print(":exact"); if( const_oop() ) st->print(INTPTR_FORMAT, p2i(const_oop())); switch( _offset ) { case OffsetTop: st->print("+top"); break; case OffsetBot: st->print("+any"); break; case 0: break; default: st->print("+%d",_offset); break; } if (_instance_id == InstanceTop) st->print(",iid=top"); else if (_instance_id != InstanceBot) st->print(",iid=%d",_instance_id); dump_inline_depth(st); dump_speculative(st); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants bool TypeOopPtr::singleton(void) const { // detune optimizer to not generate constant oop + constant offset as a constant! // TopPTR, Null, AnyNull, Constant are all singletons return (_offset == 0) && !below_centerline(_ptr); } //------------------------------add_offset------------------------------------- const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const { return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); } const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const { return make(_ptr, offset, _instance_id, with_offset_speculative(offset), _inline_depth); } /** * Return same type without a speculative part */ const TypeOopPtr* TypeOopPtr::remove_speculative() const { if (_speculative == nullptr) { return this; } assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); return make(_ptr, _offset, _instance_id, nullptr, _inline_depth); } /** * Return same type but drop speculative part if we know we won't use * it */ const Type* TypeOopPtr::cleanup_speculative() const { // If the klass is exact and the ptr is not null then there's // nothing that the speculative type can help us with if (klass_is_exact() && !maybe_null()) { return remove_speculative(); } return TypePtr::cleanup_speculative(); } /** * Return same type but with a different inline depth (used for speculation) * * @param depth depth to meet with */ const TypePtr* TypeOopPtr::with_inline_depth(int depth) const { if (!UseInlineDepthForSpeculativeTypes) { return this; } return make(_ptr, _offset, _instance_id, _speculative, depth); } //------------------------------with_instance_id-------------------------------- const TypePtr* TypeOopPtr::with_instance_id(int instance_id) const { assert(_instance_id != -1, "should be known"); return make(_ptr, _offset, instance_id, _speculative, _inline_depth); } //------------------------------meet_instance_id-------------------------------- int TypeOopPtr::meet_instance_id( int instance_id ) const { // Either is 'TOP' instance? Return the other instance! if( _instance_id == InstanceTop ) return instance_id; if( instance_id == InstanceTop ) return _instance_id; // If either is different, return 'BOTTOM' instance if( _instance_id != instance_id ) return InstanceBot; return _instance_id; } //------------------------------dual_instance_id-------------------------------- int TypeOopPtr::dual_instance_id( ) const { if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP return _instance_id; // Map everything else into self } const TypeInterfaces* TypeOopPtr::meet_interfaces(const TypeOopPtr* other) const { if (above_centerline(_ptr) && above_centerline(other->_ptr)) { return _interfaces->union_with(other->_interfaces); } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) { return other->_interfaces; } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) { return _interfaces; } return _interfaces->intersection_with(other->_interfaces); } /** * Check whether new profiling would improve speculative type * * @param exact_kls class from profiling * @param inline_depth inlining depth of profile point * * @return true if type profile is valuable */ bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { // no way to improve an already exact type if (klass_is_exact()) { return false; } return TypePtr::would_improve_type(exact_kls, inline_depth); } //============================================================================= // Convenience common pre-built types. const TypeInstPtr *TypeInstPtr::NOTNULL; const TypeInstPtr *TypeInstPtr::BOTTOM; const TypeInstPtr *TypeInstPtr::MIRROR; const TypeInstPtr *TypeInstPtr::MARK; const TypeInstPtr *TypeInstPtr::KLASS; // Is there a single ciKlass* that can represent that type? ciKlass* TypeInstPtr::exact_klass_helper() const { if (_interfaces->empty()) { return _klass; } if (_klass != ciEnv::current()->Object_klass()) { if (_interfaces->eq(_klass->as_instance_klass())) { return _klass; } return nullptr; } return _interfaces->exact_klass(); } //------------------------------TypeInstPtr------------------------------------- TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int off, int instance_id, const TypePtr* speculative, int inline_depth) : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, instance_id, speculative, inline_depth) { assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here"); assert(k != nullptr && (k->is_loaded() || o == nullptr), "cannot have constants with non-loaded klass"); }; //------------------------------make------------------------------------------- const TypeInstPtr *TypeInstPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int offset, int instance_id, const TypePtr* speculative, int inline_depth) { assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance"); // Either const_oop() is null or else ptr is Constant assert( (!o && ptr != Constant) || (o && ptr == Constant), "constant pointers must have a value supplied" ); // Ptr is never Null assert( ptr != Null, "null pointers are not typed" ); assert(instance_id <= 0 || xk, "instances are always exactly typed"); if (ptr == Constant) { // Note: This case includes meta-object constants, such as methods. xk = true; } else if (k->is_loaded()) { ciInstanceKlass* ik = k->as_instance_klass(); if (!xk && ik->is_final()) xk = true; // no inexact final klass assert(!ik->is_interface(), "no interface here"); if (xk && ik->is_interface()) xk = false; // no exact interface } // Now hash this baby TypeInstPtr *result = (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons(); return result; } const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) { if (k->is_instance_klass()) { if (k->is_loaded()) { if (k->is_interface() && interface_handling == ignore_interfaces) { assert(interface, "no interface expected"); k = ciEnv::current()->Object_klass(); const TypeInterfaces* interfaces = TypeInterfaces::make(); return interfaces; } GrowableArray* k_interfaces = k->as_instance_klass()->transitive_interfaces(); const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces); if (k->is_interface()) { assert(interface, "no interface expected"); k = ciEnv::current()->Object_klass(); } else { assert(klass, "no instance klass expected"); } return interfaces; } const TypeInterfaces* interfaces = TypeInterfaces::make(); return interfaces; } assert(array, "no array expected"); assert(k->is_array_klass(), "Not an array?"); ciType* e = k->as_array_klass()->base_element_type(); if (e->is_loaded() && e->is_instance_klass() && e->as_instance_klass()->is_interface()) { if (interface_handling == ignore_interfaces) { k = ciObjArrayKlass::make(ciEnv::current()->Object_klass(), k->as_array_klass()->dimension()); } } return TypeAryPtr::_array_interfaces; } /** * Create constant type for a constant boxed value */ const Type* TypeInstPtr::get_const_boxed_value() const { assert(is_ptr_to_boxed_value(), "should be called only for boxed value"); assert((const_oop() != nullptr), "should be called only for constant object"); ciConstant constant = const_oop()->as_instance()->field_value_by_offset(offset()); BasicType bt = constant.basic_type(); switch (bt) { case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); case T_INT: return TypeInt::make(constant.as_int()); case T_CHAR: return TypeInt::make(constant.as_char()); case T_BYTE: return TypeInt::make(constant.as_byte()); case T_SHORT: return TypeInt::make(constant.as_short()); case T_FLOAT: return TypeF::make(constant.as_float()); case T_DOUBLE: return TypeD::make(constant.as_double()); case T_LONG: return TypeLong::make(constant.as_long()); default: break; } fatal("Invalid boxed value type '%s'", type2name(bt)); return nullptr; } //------------------------------cast_to_ptr_type------------------------------- const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const { if( ptr == _ptr ) return this; // Reconstruct _sig info here since not a problem with later lazy // construction, _sig will show up on demand. return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _instance_id, _speculative, _inline_depth); } //-----------------------------cast_to_exactness------------------------------- const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const { if( klass_is_exact == _klass_is_exact ) return this; if (!_klass->is_loaded()) return this; ciInstanceKlass* ik = _klass->as_instance_klass(); if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk assert(!ik->is_interface(), "no interface here"); return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth); } //-----------------------------cast_to_instance_id---------------------------- const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const { if( instance_id == _instance_id ) return this; return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth); } //------------------------------xmeet_unloaded--------------------------------- // Compute the MEET of two InstPtrs when at least one is unloaded. // Assume classes are different since called after check for same name/class-loader const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const { int off = meet_offset(tinst->offset()); PTR ptr = meet_ptr(tinst->ptr()); int instance_id = meet_instance_id(tinst->instance_id()); const TypePtr* speculative = xmeet_speculative(tinst); int depth = meet_inline_depth(tinst->inline_depth()); const TypeInstPtr *loaded = is_loaded() ? this : tinst; const TypeInstPtr *unloaded = is_loaded() ? tinst : this; if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) { // // Meet unloaded class with java/lang/Object // // Meet // | Unloaded Class // Object | TOP | AnyNull | Constant | NotNull | BOTTOM | // =================================================================== // TOP | ..........................Unloaded......................| // AnyNull | U-AN |................Unloaded......................| // Constant | ... O-NN .................................. | O-BOT | // NotNull | ... O-NN .................................. | O-BOT | // BOTTOM | ........................Object-BOTTOM ..................| // assert(loaded->ptr() != TypePtr::Null, "insanity check"); // if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); } else if (loaded->ptr() == TypePtr::AnyNull) { return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, instance_id, speculative, depth); } else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); } else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) { if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); } else { return TypeInstPtr::NOTNULL->with_speculative(speculative); } } else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); } return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative); } // Both are unloaded, not the same class, not Object // Or meet unloaded with a different loaded class, not java/lang/Object if (ptr != TypePtr::BotPTR) { return TypeInstPtr::NOTNULL->with_speculative(speculative); } return TypeInstPtr::BOTTOM->with_speculative(speculative); } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeInstPtr::xmeet_helper(const Type *t) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is Pointer switch (t->base()) { // switch on original type case Int: // Mixing ints & oops happens when javac case Long: // reuses local variables case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; default: // All else is a mistake typerr(t); case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: case RawPtr: return TypePtr::BOTTOM; case AryPtr: { // All arrays inherit from Object class // Call in reverse direction to avoid duplication return t->is_aryptr()->xmeet_helper(this); } case OopPtr: { // Meeting to OopPtrs // Found a OopPtr type vs self-InstPtr type const TypeOopPtr *tp = t->is_oopptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); switch (tp->ptr()) { case TopPTR: case AnyNull: { int instance_id = meet_instance_id(InstanceTop); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); return make(ptr, klass(), _interfaces, klass_is_exact(), (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth); } case NotNull: case BotPTR: { int instance_id = meet_instance_id(tp->instance_id()); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); } default: typerr(t); } } case AnyPtr: { // Meeting to AnyPtrs // Found an AnyPtr type vs self-InstPtr type const TypePtr *tp = t->is_ptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); int instance_id = meet_instance_id(InstanceTop); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); switch (tp->ptr()) { case Null: if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); // else fall through to AnyNull case TopPTR: case AnyNull: { return make(ptr, klass(), _interfaces, klass_is_exact(), (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth); } case NotNull: case BotPTR: return TypePtr::make(AnyPtr, ptr, offset, speculative,depth); default: typerr(t); } } /* A-top } / | \ } Tops B-top A-any C-top } | / | \ | } Any-nulls B-any | C-any } | | | B-con A-con C-con } constants; not comparable across classes | | | B-not | C-not } | \ | / | } not-nulls B-bot A-not C-bot } \ | / } Bottoms A-bot } */ case InstPtr: { // Meeting 2 Oops? // Found an InstPtr sub-type vs self-InstPtr type const TypeInstPtr *tinst = t->is_instptr(); int off = meet_offset(tinst->offset()); PTR ptr = meet_ptr(tinst->ptr()); int instance_id = meet_instance_id(tinst->instance_id()); const TypePtr* speculative = xmeet_speculative(tinst); int depth = meet_inline_depth(tinst->inline_depth()); const TypeInterfaces* interfaces = meet_interfaces(tinst); ciKlass* tinst_klass = tinst->klass(); ciKlass* this_klass = klass(); ciKlass* res_klass = nullptr; bool res_xk = false; const Type* res; MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk); if (kind == UNLOADED) { // One of these classes has not been loaded const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces); #ifndef PRODUCT if (PrintOpto && Verbose) { tty->print("meet of unloaded classes resulted in: "); unloaded_meet->dump(); tty->cr(); tty->print(" this == "); dump(); tty->cr(); tty->print(" tinst == "); tinst->dump(); tty->cr(); } #endif res = unloaded_meet; } else { if (kind == NOT_SUBTYPE && instance_id > 0) { instance_id = InstanceBot; } else if (kind == LCA) { instance_id = InstanceBot; } ciObject* o = nullptr; // Assume not constant when done ciObject* this_oop = const_oop(); ciObject* tinst_oop = tinst->const_oop(); if (ptr == Constant) { if (this_oop != nullptr && tinst_oop != nullptr && this_oop->equals(tinst_oop)) o = this_oop; else if (above_centerline(_ptr)) { assert(!tinst_klass->is_interface(), ""); o = tinst_oop; } else if (above_centerline(tinst->_ptr)) { assert(!this_klass->is_interface(), ""); o = this_oop; } else ptr = NotNull; } res = make(ptr, res_klass, interfaces, res_xk, o, off, instance_id, speculative, depth); } return res; } // End of case InstPtr } // End of switch return this; // Return the double constant } template TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type, ciKlass*& res_klass, bool& res_xk) { ciKlass* this_klass = this_type->klass(); ciKlass* other_klass = other_type->klass(); bool this_xk = this_type->klass_is_exact(); bool other_xk = other_type->klass_is_exact(); PTR this_ptr = this_type->ptr(); PTR other_ptr = other_type->ptr(); const TypeInterfaces* this_interfaces = this_type->interfaces(); const TypeInterfaces* other_interfaces = other_type->interfaces(); // Check for easy case; klasses are equal (and perhaps not loaded!) // If we have constants, then we created oops so classes are loaded // and we can handle the constants further down. This case handles // both-not-loaded or both-loaded classes if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) { res_klass = this_klass; res_xk = this_xk; return QUICK; } // Classes require inspection in the Java klass hierarchy. Must be loaded. if (!other_klass->is_loaded() || !this_klass->is_loaded()) { return UNLOADED; } // !!! Here's how the symmetry requirement breaks down into invariants: // If we split one up & one down AND they subtype, take the down man. // If we split one up & one down AND they do NOT subtype, "fall hard". // If both are up and they subtype, take the subtype class. // If both are up and they do NOT subtype, "fall hard". // If both are down and they subtype, take the supertype class. // If both are down and they do NOT subtype, "fall hard". // Constants treated as down. // Now, reorder the above list; observe that both-down+subtype is also // "fall hard"; "fall hard" becomes the default case: // If we split one up & one down AND they subtype, take the down man. // If both are up and they subtype, take the subtype class. // If both are down and they subtype, "fall hard". // If both are down and they do NOT subtype, "fall hard". // If both are up and they do NOT subtype, "fall hard". // If we split one up & one down AND they do NOT subtype, "fall hard". // If a proper subtype is exact, and we return it, we return it exactly. // If a proper supertype is exact, there can be no subtyping relationship! // If both types are equal to the subtype, exactness is and-ed below the // centerline and or-ed above it. (N.B. Constants are always exact.) // Check for subtyping: const T* subtype = nullptr; bool subtype_exact = false; if (this_type->is_same_java_type_as(other_type)) { subtype = this_type; subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk); } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) { subtype = this_type; // Pick subtyping class subtype_exact = this_xk; } else if(!this_xk && other_type->is_meet_subtype_of(this_type)) { subtype = other_type; // Pick subtyping class subtype_exact = other_xk; } if (subtype) { if (above_centerline(ptr)) { // both are up? this_type = other_type = subtype; this_xk = other_xk = subtype_exact; } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) { this_type = other_type; // tinst is down; keep down man this_xk = other_xk; } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) { other_type = this_type; // this is down; keep down man other_xk = this_xk; } else { this_xk = subtype_exact; // either they are equal, or we'll do an LCA } } // Check for classes now being equal if (this_type->is_same_java_type_as(other_type)) { // If the klasses are equal, the constants may still differ. Fall to // NotNull if they do (neither constant is null; that is a special case // handled elsewhere). res_klass = this_type->klass(); res_xk = this_xk; return SUBTYPE; } // Else classes are not equal // Since klasses are different, we require a LCA in the Java // class hierarchy - which means we have to fall to at least NotNull. if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) { ptr = NotNull; } interfaces = this_interfaces->intersection_with(other_interfaces); // Now we find the LCA of Java classes ciKlass* k = this_klass->least_common_ancestor(other_klass); res_klass = k; res_xk = false; return LCA; } //------------------------java_mirror_type-------------------------------------- ciType* TypeInstPtr::java_mirror_type() const { // must be a singleton type if( const_oop() == nullptr ) return nullptr; // must be of type java.lang.Class if( klass() != ciEnv::current()->Class_klass() ) return nullptr; return const_oop()->as_instance()->java_mirror_type(); } //------------------------------xdual------------------------------------------ // Dual: do NOT dual on klasses. This means I do NOT understand the Java // inheritance mechanism. const Type *TypeInstPtr::xdual() const { return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth()); } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeInstPtr::eq( const Type *t ) const { const TypeInstPtr *p = t->is_instptr(); return klass()->equals(p->klass()) && _interfaces->eq(p->_interfaces) && TypeOopPtr::eq(p); // Check sub-type stuff } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeInstPtr::hash(void) const { return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash(); } bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); } bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const { return TypePtr::is_same_java_type_as_helper_for_instance(this, other); } bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); } //------------------------------dump2------------------------------------------ // Dump oop Type #ifndef PRODUCT void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const { // Print the name of the klass. klass()->print_name_on(st); _interfaces->dump(st); switch( _ptr ) { case Constant: if (WizardMode || Verbose) { ResourceMark rm; stringStream ss; st->print(" "); const_oop()->print_oop(&ss); // 'const_oop->print_oop()' may emit newlines('\n') into ss. // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node. char* buf = ss.as_string(/* c_heap= */false); StringUtils::replace_no_expand(buf, "\n", ""); st->print_raw(buf); } case BotPTR: if (!WizardMode && !Verbose) { if( _klass_is_exact ) st->print(":exact"); break; } case TopPTR: case AnyNull: case NotNull: st->print(":%s", ptr_msg[_ptr]); if( _klass_is_exact ) st->print(":exact"); break; default: break; } if( _offset ) { // Dump offset, if any if( _offset == OffsetBot ) st->print("+any"); else if( _offset == OffsetTop ) st->print("+unknown"); else st->print("+%d", _offset); } st->print(" *"); if (_instance_id == InstanceTop) st->print(",iid=top"); else if (_instance_id != InstanceBot) st->print(",iid=%d",_instance_id); dump_inline_depth(st); dump_speculative(st); } #endif //------------------------------add_offset------------------------------------- const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const { return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); } const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const { return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), offset, _instance_id, with_offset_speculative(offset), _inline_depth); } const TypeInstPtr* TypeInstPtr::remove_speculative() const { if (_speculative == nullptr) { return this; } assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, nullptr, _inline_depth); } const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const { return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, speculative, _inline_depth); } const TypePtr* TypeInstPtr::with_inline_depth(int depth) const { if (!UseInlineDepthForSpeculativeTypes) { return this; } return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth); } const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const { assert(is_known_instance(), "should be known"); return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, instance_id, _speculative, _inline_depth); } const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const { bool xk = klass_is_exact(); ciInstanceKlass* ik = klass()->as_instance_klass(); if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) { if (_interfaces->eq(ik)) { Compile* C = Compile::current(); Dependencies* deps = C->dependencies(); deps->assert_leaf_type(ik); xk = true; } } return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, 0); } template bool TypePtr::is_meet_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_xk, bool other_xk) { static_assert(std::is_base_of::value, ""); if (!this_one->is_instance_type(other)) { return false; } if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) { return true; } return this_one->klass()->is_subtype_of(other->klass()) && (!this_xk || this_one->_interfaces->contains(other->_interfaces)); } bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const { return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk); } template bool TypePtr::is_meet_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_xk, bool other_xk) { static_assert(std::is_base_of::value, ""); if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) { return true; } if (this_one->is_instance_type(other)) { return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces); } int dummy; bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); if (this_top_or_bottom) { return false; } const T1* other_ary = this_one->is_array_type(other); const TypePtr* other_elem = other_ary->elem()->make_ptr(); const TypePtr* this_elem = this_one->elem()->make_ptr(); if (other_elem != nullptr && this_elem != nullptr) { return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk); } if (other_elem == nullptr && this_elem == nullptr) { return this_one->klass()->is_subtype_of(other->klass()); } return false; } bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const { return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk); } bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const { return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk); } bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const { return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk); } //============================================================================= // Convenience common pre-built types. const TypeAryPtr* TypeAryPtr::BOTTOM; const TypeAryPtr* TypeAryPtr::RANGE; const TypeAryPtr* TypeAryPtr::OOPS; const TypeAryPtr* TypeAryPtr::NARROWOOPS; const TypeAryPtr* TypeAryPtr::BYTES; const TypeAryPtr* TypeAryPtr::SHORTS; const TypeAryPtr* TypeAryPtr::CHARS; const TypeAryPtr* TypeAryPtr::INTS; const TypeAryPtr* TypeAryPtr::LONGS; const TypeAryPtr* TypeAryPtr::FLOATS; const TypeAryPtr* TypeAryPtr::DOUBLES; //------------------------------make------------------------------------------- const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypePtr* speculative, int inline_depth) { assert(!(k == nullptr && ary->_elem->isa_int()), "integral arrays must be pre-equipped with a class"); if (!xk) xk = ary->ary_must_be_exact(); assert(instance_id <= 0 || xk, "instances are always exactly typed"); if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() && k->as_obj_array_klass()->base_element_klass()->is_interface()) { k = nullptr; } return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons(); } //------------------------------make------------------------------------------- const TypeAryPtr *TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypePtr* speculative, int inline_depth, bool is_autobox_cache) { assert(!(k == nullptr && ary->_elem->isa_int()), "integral arrays must be pre-equipped with a class"); assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" ); if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact(); assert(instance_id <= 0 || xk, "instances are always exactly typed"); if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() && k->as_obj_array_klass()->base_element_klass()->is_interface()) { k = nullptr; } return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons(); } //------------------------------cast_to_ptr_type------------------------------- const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const { if( ptr == _ptr ) return this; return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth); } //-----------------------------cast_to_exactness------------------------------- const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const { if( klass_is_exact == _klass_is_exact ) return this; if (_ary->ary_must_be_exact()) return this; // cannot clear xk return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth); } //-----------------------------cast_to_instance_id---------------------------- const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const { if( instance_id == _instance_id ) return this; return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth); } //-----------------------------max_array_length------------------------------- // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization. jint TypeAryPtr::max_array_length(BasicType etype) { if (!is_java_primitive(etype) && !::is_reference_type(etype)) { if (etype == T_NARROWOOP) { etype = T_OBJECT; } else if (etype == T_ILLEGAL) { // bottom[] etype = T_BYTE; // will produce conservatively high value } else { fatal("not an element type: %s", type2name(etype)); } } return arrayOopDesc::max_array_length(etype); } //-----------------------------narrow_size_type------------------------------- // Narrow the given size type to the index range for the given array base type. // Return null if the resulting int type becomes empty. const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const { jint hi = size->_hi; jint lo = size->_lo; jint min_lo = 0; jint max_hi = max_array_length(elem()->array_element_basic_type()); //if (index_not_size) --max_hi; // type of a valid array index, FTR bool chg = false; if (lo < min_lo) { lo = min_lo; if (size->is_con()) { hi = lo; } chg = true; } if (hi > max_hi) { hi = max_hi; if (size->is_con()) { lo = hi; } chg = true; } // Negative length arrays will produce weird intermediate dead fast-path code if (lo > hi) { return TypeInt::ZERO; } if (!chg) { return size; } return TypeInt::make(lo, hi, Type::WidenMin); } //-------------------------------cast_to_size---------------------------------- const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const { assert(new_size != nullptr, ""); new_size = narrow_size_type(new_size); if (new_size == size()) return this; const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable()); return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth); } //------------------------------cast_to_stable--------------------------------- const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const { if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable())) return this; const Type* elem = this->elem(); const TypePtr* elem_ptr = elem->make_ptr(); if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) { // If this is widened from a narrow oop, TypeAry::make will re-narrow it. elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1); } const TypeAry* new_ary = TypeAry::make(elem, size(), stable); return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth); } //-----------------------------stable_dimension-------------------------------- int TypeAryPtr::stable_dimension() const { if (!is_stable()) return 0; int dim = 1; const TypePtr* elem_ptr = elem()->make_ptr(); if (elem_ptr != nullptr && elem_ptr->isa_aryptr()) dim += elem_ptr->is_aryptr()->stable_dimension(); return dim; } //----------------------cast_to_autobox_cache----------------------------------- const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const { if (is_autobox_cache()) return this; const TypeOopPtr* etype = elem()->make_oopptr(); if (etype == nullptr) return this; // The pointers in the autobox arrays are always non-null. etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable()); return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true); } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeAryPtr::eq( const Type *t ) const { const TypeAryPtr *p = t->is_aryptr(); return _ary == p->_ary && // Check array TypeOopPtr::eq(p); // Check sub-parts } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeAryPtr::hash(void) const { return (uint)(uintptr_t)_ary + TypeOopPtr::hash(); } bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); } bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const { return TypePtr::is_same_java_type_as_helper_for_array(this, other); } bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeAryPtr::xmeet_helper(const Type *t) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is Pointer switch (t->base()) { // switch on original type // Mixing ints & oops happens when javac reuses local variables case Int: case Long: case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; default: // All else is a mistake typerr(t); case OopPtr: { // Meeting to OopPtrs // Found a OopPtr type vs self-AryPtr type const TypeOopPtr *tp = t->is_oopptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); int depth = meet_inline_depth(tp->inline_depth()); const TypePtr* speculative = xmeet_speculative(tp); switch (tp->ptr()) { case TopPTR: case AnyNull: { int instance_id = meet_instance_id(InstanceTop); return make(ptr, (ptr == Constant ? const_oop() : nullptr), _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); } case BotPTR: case NotNull: { int instance_id = meet_instance_id(tp->instance_id()); return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); } default: ShouldNotReachHere(); } } case AnyPtr: { // Meeting two AnyPtrs // Found an AnyPtr type vs self-AryPtr type const TypePtr *tp = t->is_ptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); switch (tp->ptr()) { case TopPTR: return this; case BotPTR: case NotNull: return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); case Null: if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); // else fall through to AnyNull case AnyNull: { int instance_id = meet_instance_id(InstanceTop); return make(ptr, (ptr == Constant ? const_oop() : nullptr), _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); } default: ShouldNotReachHere(); } } case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: case RawPtr: return TypePtr::BOTTOM; case AryPtr: { // Meeting 2 references? const TypeAryPtr *tap = t->is_aryptr(); int off = meet_offset(tap->offset()); const Type* tm = _ary->meet_speculative(tap->_ary); const TypeAry* tary = tm->isa_ary(); if (tary == nullptr) { assert(tm == Type::TOP || tm == Type::BOTTOM, ""); return tm; } PTR ptr = meet_ptr(tap->ptr()); int instance_id = meet_instance_id(tap->instance_id()); const TypePtr* speculative = xmeet_speculative(tap); int depth = meet_inline_depth(tap->inline_depth()); ciKlass* res_klass = nullptr; bool res_xk = false; const Type* elem = tary->_elem; if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk) == NOT_SUBTYPE) { instance_id = InstanceBot; } ciObject* o = nullptr; // Assume not constant when done ciObject* this_oop = const_oop(); ciObject* tap_oop = tap->const_oop(); if (ptr == Constant) { if (this_oop != nullptr && tap_oop != nullptr && this_oop->equals(tap_oop)) { o = tap_oop; } else if (above_centerline(_ptr)) { o = tap_oop; } else if (above_centerline(tap->_ptr)) { o = this_oop; } else { ptr = NotNull; } } return make(ptr, o, TypeAry::make(elem, tary->_size, tary->_stable), res_klass, res_xk, off, instance_id, speculative, depth); } // All arrays inherit from Object class case InstPtr: { const TypeInstPtr *tp = t->is_instptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); int instance_id = meet_instance_id(tp->instance_id()); const TypePtr* speculative = xmeet_speculative(tp); int depth = meet_inline_depth(tp->inline_depth()); const TypeInterfaces* interfaces = meet_interfaces(tp); const TypeInterfaces* tp_interfaces = tp->_interfaces; const TypeInterfaces* this_interfaces = _interfaces; switch (ptr) { case TopPTR: case AnyNull: // Fall 'down' to dual of object klass // For instances when a subclass meets a superclass we fall // below the centerline when the superclass is exact. We need to // do the same here. if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) { return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); } else { // cannot subclass, so the meet has to fall badly below the centerline ptr = NotNull; instance_id = InstanceBot; interfaces = this_interfaces->intersection_with(tp_interfaces); return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr,offset, instance_id, speculative, depth); } case Constant: case NotNull: case BotPTR: // Fall down to object klass // LCA is object_klass, but if we subclass from the top we can do better if (above_centerline(tp->ptr())) { // If 'tp' is above the centerline and it is Object class // then we can subclass in the Java class hierarchy. // For instances when a subclass meets a superclass we fall // below the centerline when the superclass is exact. We need // to do the same here. if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) { // that is, my array type is a subtype of 'tp' klass return make(ptr, (ptr == Constant ? const_oop() : nullptr), _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); } } // The other case cannot happen, since t cannot be a subtype of an array. // The meet falls down to Object class below centerline. if (ptr == Constant) { ptr = NotNull; } if (instance_id > 0) { instance_id = InstanceBot; } interfaces = this_interfaces->intersection_with(tp_interfaces); return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, instance_id, speculative, depth); default: typerr(t); } } } return this; // Lint noise } template TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary, const T* other_ary, ciKlass*& res_klass, bool& res_xk) { int dummy; bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM); bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); ciKlass* this_klass = this_ary->klass(); ciKlass* other_klass = other_ary->klass(); bool this_xk = this_ary->klass_is_exact(); bool other_xk = other_ary->klass_is_exact(); PTR this_ptr = this_ary->ptr(); PTR other_ptr = other_ary->ptr(); res_klass = nullptr; MeetResult result = SUBTYPE; if (elem->isa_int()) { // Integral array element types have irrelevant lattice relations. // It is the klass that determines array layout, not the element type. if (this_top_or_bottom) res_klass = other_klass; else if (other_top_or_bottom || other_klass == this_klass) { res_klass = this_klass; } else { // Something like byte[int+] meets char[int+]. // This must fall to bottom, not (int[-128..65535])[int+]. // instance_id = InstanceBot; elem = Type::BOTTOM; result = NOT_SUBTYPE; if (above_centerline(ptr) || ptr == Constant) { ptr = NotNull; res_xk = false; return NOT_SUBTYPE; } } } else {// Non integral arrays. // Must fall to bottom if exact klasses in upper lattice // are not equal or super klass is exact. if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) && // meet with top[] and bottom[] are processed further down: !this_top_or_bottom && !other_top_or_bottom && // both are exact and not equal: ((other_xk && this_xk) || // 'tap' is exact and super or unrelated: (other_xk && !other_ary->is_meet_subtype_of(this_ary)) || // 'this' is exact and super or unrelated: (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) { if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) { elem = Type::BOTTOM; } ptr = NotNull; res_xk = false; return NOT_SUBTYPE; } } res_xk = false; switch (other_ptr) { case AnyNull: case TopPTR: // Compute new klass on demand, do not use tap->_klass if (below_centerline(this_ptr)) { res_xk = this_xk; } else { res_xk = (other_xk || this_xk); } return result; case Constant: { if (this_ptr == Constant) { res_xk = true; } else if(above_centerline(this_ptr)) { res_xk = true; } else { // Only precise for identical arrays res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); } return result; } case NotNull: case BotPTR: // Compute new klass on demand, do not use tap->_klass if (above_centerline(this_ptr)) { res_xk = other_xk; } else { res_xk = (other_xk && this_xk) && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays } return result; default: { ShouldNotReachHere(); return result; } } return result; } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const Type *TypeAryPtr::xdual() const { return new TypeAryPtr(dual_ptr(), _const_oop, _ary->dual()->is_ary(),_klass, _klass_is_exact, dual_offset(), dual_instance_id(), is_autobox_cache(), dual_speculative(), dual_inline_depth()); } //------------------------------dump2------------------------------------------ #ifndef PRODUCT void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const { _ary->dump2(d,depth,st); _interfaces->dump(st); switch( _ptr ) { case Constant: const_oop()->print(st); break; case BotPTR: if (!WizardMode && !Verbose) { if( _klass_is_exact ) st->print(":exact"); break; } case TopPTR: case AnyNull: case NotNull: st->print(":%s", ptr_msg[_ptr]); if( _klass_is_exact ) st->print(":exact"); break; default: break; } if( _offset != 0 ) { BasicType basic_elem_type = elem()->basic_type(); int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type); if( _offset == OffsetTop ) st->print("+undefined"); else if( _offset == OffsetBot ) st->print("+any"); else if( _offset < header_size ) st->print("+%d", _offset); else { if (basic_elem_type == T_ILLEGAL) { st->print("+any"); } else { int elem_size = type2aelembytes(basic_elem_type); st->print("[%d]", (_offset - header_size)/elem_size); } } } st->print(" *"); if (_instance_id == InstanceTop) st->print(",iid=top"); else if (_instance_id != InstanceBot) st->print(",iid=%d",_instance_id); dump_inline_depth(st); dump_speculative(st); } #endif bool TypeAryPtr::empty(void) const { if (_ary->empty()) return true; return TypeOopPtr::empty(); } //------------------------------add_offset------------------------------------- const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const { return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); } const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const { return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, offset, _instance_id, with_offset_speculative(offset), _inline_depth); } const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const { return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _instance_id, _speculative, _inline_depth); } const TypeAryPtr* TypeAryPtr::remove_speculative() const { if (_speculative == nullptr) { return this; } assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, nullptr, _inline_depth); } const TypePtr* TypeAryPtr::with_inline_depth(int depth) const { if (!UseInlineDepthForSpeculativeTypes) { return this; } return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth); } const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const { assert(is_known_instance(), "should be known"); return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, instance_id, _speculative, _inline_depth); } //============================================================================= //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeNarrowPtr::hash(void) const { return _ptrtype->hash() + 7; } bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton return _ptrtype->singleton(); } bool TypeNarrowPtr::empty(void) const { return _ptrtype->empty(); } intptr_t TypeNarrowPtr::get_con() const { return _ptrtype->get_con(); } bool TypeNarrowPtr::eq( const Type *t ) const { const TypeNarrowPtr* tc = isa_same_narrowptr(t); if (tc != nullptr) { if (_ptrtype->base() != tc->_ptrtype->base()) { return false; } return tc->_ptrtype->eq(_ptrtype); } return false; } const Type *TypeNarrowPtr::xdual() const { // Compute dual right now. const TypePtr* odual = _ptrtype->dual()->is_ptr(); return make_same_narrowptr(odual); } const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const { if (isa_same_narrowptr(kills)) { const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative); if (ft->empty()) return Type::TOP; // Canonical empty value if (ft->isa_ptr()) { return make_hash_same_narrowptr(ft->isa_ptr()); } return ft; } else if (kills->isa_ptr()) { const Type* ft = _ptrtype->join_helper(kills, include_speculative); if (ft->empty()) return Type::TOP; // Canonical empty value return ft; } else { return Type::TOP; } } //------------------------------xmeet------------------------------------------ // Compute the MEET of two types. It returns a new Type object. const Type *TypeNarrowPtr::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? if (t->base() == base()) { const Type* result = _ptrtype->xmeet(t->make_ptr()); if (result->isa_ptr()) { return make_hash_same_narrowptr(result->is_ptr()); } return result; } // Current "this->_base" is NarrowKlass or NarrowOop switch (t->base()) { // switch on original type case Int: // Mixing ints & oops happens when javac case Long: // reuses local variables case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case AnyPtr: case RawPtr: case OopPtr: case InstPtr: case AryPtr: case MetadataPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; default: // All else is a mistake typerr(t); } // End of switch return this; } #ifndef PRODUCT void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const { _ptrtype->dump2(d, depth, st); } #endif const TypeNarrowOop *TypeNarrowOop::BOTTOM; const TypeNarrowOop *TypeNarrowOop::NULL_PTR; const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) { return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons(); } const TypeNarrowOop* TypeNarrowOop::remove_speculative() const { return make(_ptrtype->remove_speculative()->is_ptr()); } const Type* TypeNarrowOop::cleanup_speculative() const { return make(_ptrtype->cleanup_speculative()->is_ptr()); } #ifndef PRODUCT void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const { st->print("narrowoop: "); TypeNarrowPtr::dump2(d, depth, st); } #endif const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR; const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) { return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons(); } #ifndef PRODUCT void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const { st->print("narrowklass: "); TypeNarrowPtr::dump2(d, depth, st); } #endif //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeMetadataPtr::eq( const Type *t ) const { const TypeMetadataPtr *a = (const TypeMetadataPtr*)t; ciMetadata* one = metadata(); ciMetadata* two = a->metadata(); if (one == nullptr || two == nullptr) { return (one == two) && TypePtr::eq(t); } else { return one->equals(two) && TypePtr::eq(t); } } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeMetadataPtr::hash(void) const { return (metadata() ? metadata()->hash() : 0) + TypePtr::hash(); } //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants bool TypeMetadataPtr::singleton(void) const { // detune optimizer to not generate constant metadata + constant offset as a constant! // TopPTR, Null, AnyNull, Constant are all singletons return (_offset == 0) && !below_centerline(_ptr); } //------------------------------add_offset------------------------------------- const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const { return make( _ptr, _metadata, xadd_offset(offset)); } //-----------------------------filter------------------------------------------ // Do not allow interface-vs.-noninterface joins to collapse to top. const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const { const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr(); if (ft == nullptr || ft->empty()) return Type::TOP; // Canonical empty value return ft; } //------------------------------get_con---------------------------------------- intptr_t TypeMetadataPtr::get_con() const { assert( _ptr == Null || _ptr == Constant, "" ); assert( _offset >= 0, "" ); if (_offset != 0) { // After being ported to the compiler interface, the compiler no longer // directly manipulates the addresses of oops. Rather, it only has a pointer // to a handle at compile time. This handle is embedded in the generated // code and dereferenced at the time the nmethod is made. Until that time, // it is not reasonable to do arithmetic with the addresses of oops (we don't // have access to the addresses!). This does not seem to currently happen, // but this assertion here is to help prevent its occurrence. tty->print_cr("Found oop constant with non-zero offset"); ShouldNotReachHere(); } return (intptr_t)metadata()->constant_encoding(); } //------------------------------cast_to_ptr_type------------------------------- const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const { if( ptr == _ptr ) return this; return make(ptr, metadata(), _offset); } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeMetadataPtr::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is OopPtr switch (t->base()) { // switch on original type case Int: // Mixing ints & oops happens when javac case Long: // reuses local variables case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; default: // All else is a mistake typerr(t); case AnyPtr: { // Found an AnyPtr type vs self-OopPtr type const TypePtr *tp = t->is_ptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); switch (tp->ptr()) { case Null: if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); // else fall through: case TopPTR: case AnyNull: { return make(ptr, _metadata, offset); } case BotPTR: case NotNull: return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); default: typerr(t); } } case RawPtr: case KlassPtr: case InstKlassPtr: case AryKlassPtr: case OopPtr: case InstPtr: case AryPtr: return TypePtr::BOTTOM; // Oop meet raw is not well defined case MetadataPtr: { const TypeMetadataPtr *tp = t->is_metadataptr(); int offset = meet_offset(tp->offset()); PTR tptr = tp->ptr(); PTR ptr = meet_ptr(tptr); ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata(); if (tptr == TopPTR || _ptr == TopPTR || metadata()->equals(tp->metadata())) { return make(ptr, md, offset); } // metadata is different if( ptr == Constant ) { // Cannot be equal constants, so... if( tptr == Constant && _ptr != Constant) return t; if( _ptr == Constant && tptr != Constant) return this; ptr = NotNull; // Fall down in lattice } return make(ptr, nullptr, offset); break; } } // End of switch return this; // Return the double constant } //------------------------------xdual------------------------------------------ // Dual of a pure metadata pointer. const Type *TypeMetadataPtr::xdual() const { return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset()); } //------------------------------dump2------------------------------------------ #ifndef PRODUCT void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const { st->print("metadataptr:%s", ptr_msg[_ptr]); if( metadata() ) st->print(INTPTR_FORMAT, p2i(metadata())); switch( _offset ) { case OffsetTop: st->print("+top"); break; case OffsetBot: st->print("+any"); break; case 0: break; default: st->print("+%d",_offset); break; } } #endif //============================================================================= // Convenience common pre-built type. const TypeMetadataPtr *TypeMetadataPtr::BOTTOM; TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset): TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) { } const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) { return make(Constant, m, 0); } const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) { return make(Constant, m, 0); } //------------------------------make------------------------------------------- // Create a meta data constant const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) { assert(m == nullptr || !m->is_klass(), "wrong type"); return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons(); } const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const { const Type* elem = _ary->_elem; bool xk = klass_is_exact(); if (elem->make_oopptr() != nullptr) { elem = elem->make_oopptr()->as_klass_type(try_for_exact); if (elem->is_klassptr()->klass_is_exact()) { xk = true; } } return TypeAryKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, elem, klass(), 0); } const TypeKlassPtr* TypeKlassPtr::make(ciKlass *klass, InterfaceHandling interface_handling) { if (klass->is_instance_klass()) { return TypeInstKlassPtr::make(klass, interface_handling); } return TypeAryKlassPtr::make(klass, interface_handling); } const TypeKlassPtr* TypeKlassPtr::make(PTR ptr, ciKlass* klass, int offset, InterfaceHandling interface_handling) { if (klass->is_instance_klass()) { const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling); return TypeInstKlassPtr::make(ptr, klass, interfaces, offset); } return TypeAryKlassPtr::make(ptr, klass, offset, interface_handling); } //------------------------------TypeKlassPtr----------------------------------- TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, int offset) : TypePtr(t, ptr, offset), _klass(klass), _interfaces(interfaces) { assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) || klass->is_type_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here"); } // Is there a single ciKlass* that can represent that type? ciKlass* TypeKlassPtr::exact_klass_helper() const { assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface"); if (_interfaces->empty()) { return _klass; } if (_klass != ciEnv::current()->Object_klass()) { if (_interfaces->eq(_klass->as_instance_klass())) { return _klass; } return nullptr; } return _interfaces->exact_klass(); } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeKlassPtr::eq(const Type *t) const { const TypeKlassPtr *p = t->is_klassptr(); return _interfaces->eq(p->_interfaces) && TypePtr::eq(p); } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeKlassPtr::hash(void) const { return TypePtr::hash() + _interfaces->hash(); } //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants bool TypeKlassPtr::singleton(void) const { // detune optimizer to not generate constant klass + constant offset as a constant! // TopPTR, Null, AnyNull, Constant are all singletons return (_offset == 0) && !below_centerline(_ptr); } // Do not allow interface-vs.-noninterface joins to collapse to top. const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const { // logic here mirrors the one from TypeOopPtr::filter. See comments // there. const Type* ft = join_helper(kills, include_speculative); if (ft->empty()) { return Type::TOP; // Canonical empty value } return ft; } const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const { if (above_centerline(_ptr) && above_centerline(other->_ptr)) { return _interfaces->union_with(other->_interfaces); } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) { return other->_interfaces; } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) { return _interfaces; } return _interfaces->intersection_with(other->_interfaces); } //------------------------------get_con---------------------------------------- intptr_t TypeKlassPtr::get_con() const { assert( _ptr == Null || _ptr == Constant, "" ); assert( _offset >= 0, "" ); if (_offset != 0) { // After being ported to the compiler interface, the compiler no longer // directly manipulates the addresses of oops. Rather, it only has a pointer // to a handle at compile time. This handle is embedded in the generated // code and dereferenced at the time the nmethod is made. Until that time, // it is not reasonable to do arithmetic with the addresses of oops (we don't // have access to the addresses!). This does not seem to currently happen, // but this assertion here is to help prevent its occurrence. tty->print_cr("Found oop constant with non-zero offset"); ShouldNotReachHere(); } ciKlass* k = exact_klass(); return (intptr_t)k->constant_encoding(); } //------------------------------dump2------------------------------------------ // Dump Klass Type #ifndef PRODUCT void TypeKlassPtr::dump2(Dict & d, uint depth, outputStream *st) const { switch(_ptr) { case Constant: st->print("precise "); case NotNull: { const char *name = klass()->name()->as_utf8(); if (name) { st->print("%s: " INTPTR_FORMAT, name, p2i(klass())); } else { ShouldNotReachHere(); } _interfaces->dump(st); } case BotPTR: if (!WizardMode && !Verbose && _ptr != Constant) break; case TopPTR: case AnyNull: st->print(":%s", ptr_msg[_ptr]); if (_ptr == Constant) st->print(":exact"); break; default: break; } if (_offset) { // Dump offset, if any if (_offset == OffsetBot) { st->print("+any"); } else if (_offset == OffsetTop) { st->print("+unknown"); } else { st->print("+%d", _offset); } } st->print(" *"); } #endif //============================================================================= // Convenience common pre-built types. // Not-null object klass or below const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT; const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL; bool TypeInstKlassPtr::eq(const Type *t) const { const TypeKlassPtr *p = t->is_klassptr(); return klass()->equals(p->klass()) && TypeKlassPtr::eq(p); } uint TypeInstKlassPtr::hash(void) const { return klass()->hash() + TypeKlassPtr::hash(); } const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, int offset) { TypeInstKlassPtr *r = (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset))->hashcons(); return r; } //------------------------------add_offset------------------------------------- // Access internals of klass object const TypePtr* TypeInstKlassPtr::add_offset( intptr_t offset ) const { return make( _ptr, klass(), _interfaces, xadd_offset(offset) ); } const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const { return make(_ptr, klass(), _interfaces, offset); } //------------------------------cast_to_ptr_type------------------------------- const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const { assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type"); if( ptr == _ptr ) return this; return make(ptr, _klass, _interfaces, _offset); } bool TypeInstKlassPtr::must_be_exact() const { if (!_klass->is_loaded()) return false; ciInstanceKlass* ik = _klass->as_instance_klass(); if (ik->is_final()) return true; // cannot clear xk return false; } //-----------------------------cast_to_exactness------------------------------- const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const { if (klass_is_exact == (_ptr == Constant)) return this; if (must_be_exact()) return this; ciKlass* k = klass(); return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset); } //-----------------------------as_instance_type-------------------------------- // Corresponding type for an instance of the given class. // It will be NotNull, and exact if and only if the klass type is exact. const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const { ciKlass* k = klass(); bool xk = klass_is_exact(); Compile* C = Compile::current(); Dependencies* deps = C->dependencies(); assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); // Element is an instance bool klass_is_exact = false; const TypeInterfaces* interfaces = _interfaces; if (k->is_loaded()) { // Try to set klass_is_exact. ciInstanceKlass* ik = k->as_instance_klass(); klass_is_exact = ik->is_final(); if (!klass_is_exact && klass_change && deps != nullptr && UseUniqueSubclasses) { ciInstanceKlass* sub = ik->unique_concrete_subklass(); if (sub != nullptr) { if (_interfaces->eq(sub)) { deps->assert_abstract_with_unique_concrete_subtype(ik, sub); k = ik = sub; xk = sub->is_final(); } } } } return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, 0); } //------------------------------xmeet------------------------------------------ // Compute the MEET of two types, return a new Type object. const Type *TypeInstKlassPtr::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is Pointer switch (t->base()) { // switch on original type case Int: // Mixing ints & oops happens when javac case Long: // reuses local variables case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; default: // All else is a mistake typerr(t); case AnyPtr: { // Meeting to AnyPtrs // Found an AnyPtr type vs self-KlassPtr type const TypePtr *tp = t->is_ptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); switch (tp->ptr()) { case TopPTR: return this; case Null: if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); case AnyNull: return make( ptr, klass(), _interfaces, offset ); case BotPTR: case NotNull: return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); default: typerr(t); } } case RawPtr: case MetadataPtr: case OopPtr: case AryPtr: // Meet with AryPtr case InstPtr: // Meet with InstPtr return TypePtr::BOTTOM; // // A-top } // / | \ } Tops // B-top A-any C-top } // | / | \ | } Any-nulls // B-any | C-any } // | | | // B-con A-con C-con } constants; not comparable across classes // | | | // B-not | C-not } // | \ | / | } not-nulls // B-bot A-not C-bot } // \ | / } Bottoms // A-bot } // case InstKlassPtr: { // Meet two KlassPtr types const TypeInstKlassPtr *tkls = t->is_instklassptr(); int off = meet_offset(tkls->offset()); PTR ptr = meet_ptr(tkls->ptr()); const TypeInterfaces* interfaces = meet_interfaces(tkls); ciKlass* res_klass = nullptr; bool res_xk = false; switch(meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) { case UNLOADED: ShouldNotReachHere(); case SUBTYPE: case NOT_SUBTYPE: case LCA: case QUICK: { assert(res_xk == (ptr == Constant), ""); const Type* res = make(ptr, res_klass, interfaces, off); return res; } default: ShouldNotReachHere(); } } // End of case KlassPtr case AryKlassPtr: { // All arrays inherit from Object class const TypeAryKlassPtr *tp = t->is_aryklassptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); const TypeInterfaces* interfaces = meet_interfaces(tp); const TypeInterfaces* tp_interfaces = tp->_interfaces; const TypeInterfaces* this_interfaces = _interfaces; switch (ptr) { case TopPTR: case AnyNull: // Fall 'down' to dual of object klass // For instances when a subclass meets a superclass we fall // below the centerline when the superclass is exact. We need to // do the same here. if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) { return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset); } else { // cannot subclass, so the meet has to fall badly below the centerline ptr = NotNull; interfaces = _interfaces->intersection_with(tp->_interfaces); return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset); } case Constant: case NotNull: case BotPTR: // Fall down to object klass // LCA is object_klass, but if we subclass from the top we can do better if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull ) // If 'this' (InstPtr) is above the centerline and it is Object class // then we can subclass in the Java class hierarchy. // For instances when a subclass meets a superclass we fall // below the centerline when the superclass is exact. We need // to do the same here. if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) { // that is, tp's array type is a subtype of my klass return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset); } } // The other case cannot happen, since I cannot be a subtype of an array. // The meet falls down to Object class below centerline. if( ptr == Constant ) ptr = NotNull; interfaces = this_interfaces->intersection_with(tp_interfaces); return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset); default: typerr(t); } } } // End of switch return this; // Return the double constant } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const Type *TypeInstKlassPtr::xdual() const { return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset()); } template bool TypePtr::is_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { static_assert(std::is_base_of::value, ""); if (!this_one->is_loaded() || !other->is_loaded()) { return false; } if (!this_one->is_instance_type(other)) { return false; } if (!other_exact) { return false; } if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) { return true; } return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces); } bool TypeInstKlassPtr::might_be_an_array() const { if (!instance_klass()->is_java_lang_Object()) { // TypeInstKlassPtr can be an array only if it is java.lang.Object: the only supertype of array types. return false; } if (interfaces()->has_non_array_interface()) { // Arrays only implement Cloneable and Serializable. If we see any other interface, [this] cannot be an array. return false; } // Cannot prove it's not an array. return true; } bool TypeInstKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); } template bool TypePtr::is_same_java_type_as_helper_for_instance(const T1* this_one, const T2* other) { static_assert(std::is_base_of::value, ""); if (!this_one->is_loaded() || !other->is_loaded()) { return false; } if (!this_one->is_instance_type(other)) { return false; } return this_one->klass()->equals(other->klass()) && this_one->_interfaces->eq(other->_interfaces); } bool TypeInstKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const { return TypePtr::is_same_java_type_as_helper_for_instance(this, other); } template bool TypePtr::maybe_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { static_assert(std::is_base_of::value, ""); if (!this_one->is_loaded() || !other->is_loaded()) { return true; } if (this_one->is_array_type(other)) { return !this_exact && this_one->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->contains(this_one->_interfaces); } assert(this_one->is_instance_type(other), "unsupported"); if (this_exact && other_exact) { return this_one->is_java_subtype_of(other); } if (!this_one->klass()->is_subtype_of(other->klass()) && !other->klass()->is_subtype_of(this_one->klass())) { return false; } if (this_exact) { return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces); } return true; } bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); } const TypeKlassPtr* TypeInstKlassPtr::try_improve() const { if (!UseUniqueSubclasses) { return this; } ciKlass* k = klass(); Compile* C = Compile::current(); Dependencies* deps = C->dependencies(); assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); const TypeInterfaces* interfaces = _interfaces; if (k->is_loaded()) { ciInstanceKlass* ik = k->as_instance_klass(); bool klass_is_exact = ik->is_final(); if (!klass_is_exact && deps != nullptr) { ciInstanceKlass* sub = ik->unique_concrete_subklass(); if (sub != nullptr) { if (_interfaces->eq(sub)) { deps->assert_abstract_with_unique_concrete_subtype(ik, sub); k = ik = sub; klass_is_exact = sub->is_final(); return TypeKlassPtr::make(klass_is_exact ? Constant : _ptr, k, _offset); } } } } return this; } const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, const Type* elem, ciKlass* k, int offset) { return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset))->hashcons(); } const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, ciKlass* k, int offset, InterfaceHandling interface_handling) { if (k->is_obj_array_klass()) { // Element is an object array. Recursively call ourself. ciKlass* eklass = k->as_obj_array_klass()->element_klass(); const TypeKlassPtr *etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false); return TypeAryKlassPtr::make(ptr, etype, nullptr, offset); } else if (k->is_type_array_klass()) { // Element is an typeArray const Type* etype = get_const_basic_type(k->as_type_array_klass()->element_type()); return TypeAryKlassPtr::make(ptr, etype, k, offset); } else { ShouldNotReachHere(); return nullptr; } } const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) { return TypeAryKlassPtr::make(Constant, klass, 0, interface_handling); } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeAryKlassPtr::eq(const Type *t) const { const TypeAryKlassPtr *p = t->is_aryklassptr(); return _elem == p->_elem && // Check array TypeKlassPtr::eq(p); // Check sub-parts } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeAryKlassPtr::hash(void) const { return (uint)(uintptr_t)_elem + TypeKlassPtr::hash(); } //----------------------compute_klass------------------------------------------ // Compute the defining klass for this class ciKlass* TypeAryPtr::compute_klass() const { // Compute _klass based on element type. ciKlass* k_ary = nullptr; const TypeInstPtr *tinst; const TypeAryPtr *tary; const Type* el = elem(); if (el->isa_narrowoop()) { el = el->make_ptr(); } // Get element klass if ((tinst = el->isa_instptr()) != nullptr) { // Leave k_ary at null. } else if ((tary = el->isa_aryptr()) != nullptr) { // Leave k_ary at null. } else if ((el->base() == Type::Top) || (el->base() == Type::Bottom)) { // element type of Bottom occurs from meet of basic type // and object; Top occurs when doing join on Bottom. // Leave k_ary at null. } else { assert(!el->isa_int(), "integral arrays must be pre-equipped with a class"); // Compute array klass directly from basic type k_ary = ciTypeArrayKlass::make(el->basic_type()); } return k_ary; } //------------------------------klass------------------------------------------ // Return the defining klass for this class ciKlass* TypeAryPtr::klass() const { if( _klass ) return _klass; // Return cached value, if possible // Oops, need to compute _klass and cache it ciKlass* k_ary = compute_klass(); if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) { // The _klass field acts as a cache of the underlying // ciKlass for this array type. In order to set the field, // we need to cast away const-ness. // // IMPORTANT NOTE: we *never* set the _klass field for the // type TypeAryPtr::OOPS. This Type is shared between all // active compilations. However, the ciKlass which represents // this Type is *not* shared between compilations, so caching // this value would result in fetching a dangling pointer. // // Recomputing the underlying ciKlass for each request is // a bit less efficient than caching, but calls to // TypeAryPtr::OOPS->klass() are not common enough to matter. ((TypeAryPtr*)this)->_klass = k_ary; } return k_ary; } // Is there a single ciKlass* that can represent that type? ciKlass* TypeAryPtr::exact_klass_helper() const { if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) { ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper(); if (k == nullptr) { return nullptr; } k = ciObjArrayKlass::make(k); return k; } return klass(); } const Type* TypeAryPtr::base_element_type(int& dims) const { const Type* elem = this->elem(); dims = 1; while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) { elem = elem->make_ptr()->is_aryptr()->elem(); dims++; } return elem; } //------------------------------add_offset------------------------------------- // Access internals of klass object const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const { return make(_ptr, elem(), klass(), xadd_offset(offset)); } const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const { return make(_ptr, elem(), klass(), offset); } //------------------------------cast_to_ptr_type------------------------------- const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const { assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type"); if (ptr == _ptr) return this; return make(ptr, elem(), _klass, _offset); } bool TypeAryKlassPtr::must_be_exact() const { if (_elem == Type::BOTTOM) return false; if (_elem == Type::TOP ) return false; const TypeKlassPtr* tk = _elem->isa_klassptr(); if (!tk) return true; // a primitive type, like int return tk->must_be_exact(); } //-----------------------------cast_to_exactness------------------------------- const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const { if (must_be_exact()) return this; // cannot clear xk ciKlass* k = _klass; const Type* elem = this->elem(); if (elem->isa_klassptr() && !klass_is_exact) { elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact); } return make(klass_is_exact ? Constant : NotNull, elem, k, _offset); } //-----------------------------as_instance_type-------------------------------- // Corresponding type for an instance of the given class. // It will be NotNull, and exact if and only if the klass type is exact. const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const { ciKlass* k = klass(); bool xk = klass_is_exact(); const Type* el = nullptr; if (elem()->isa_klassptr()) { el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false); k = nullptr; } else { el = elem(); } return TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(el, TypeInt::POS), k, xk, 0); } //------------------------------xmeet------------------------------------------ // Compute the MEET of two types, return a new Type object. const Type *TypeAryKlassPtr::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is Pointer switch (t->base()) { // switch on original type case Int: // Mixing ints & oops happens when javac case Long: // reuses local variables case HalfFloatTop: case HalfFloatCon: case HalfFloatBot: case FloatTop: case FloatCon: case FloatBot: case DoubleTop: case DoubleCon: case DoubleBot: case NarrowOop: case NarrowKlass: case Bottom: // Ye Olde Default return Type::BOTTOM; case Top: return this; default: // All else is a mistake typerr(t); case AnyPtr: { // Meeting to AnyPtrs // Found an AnyPtr type vs self-KlassPtr type const TypePtr *tp = t->is_ptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); switch (tp->ptr()) { case TopPTR: return this; case Null: if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); case AnyNull: return make( ptr, _elem, klass(), offset ); case BotPTR: case NotNull: return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); default: typerr(t); } } case RawPtr: case MetadataPtr: case OopPtr: case AryPtr: // Meet with AryPtr case InstPtr: // Meet with InstPtr return TypePtr::BOTTOM; // // A-top } // / | \ } Tops // B-top A-any C-top } // | / | \ | } Any-nulls // B-any | C-any } // | | | // B-con A-con C-con } constants; not comparable across classes // | | | // B-not | C-not } // | \ | / | } not-nulls // B-bot A-not C-bot } // \ | / } Bottoms // A-bot } // case AryKlassPtr: { // Meet two KlassPtr types const TypeAryKlassPtr *tap = t->is_aryklassptr(); int off = meet_offset(tap->offset()); const Type* elem = _elem->meet(tap->_elem); PTR ptr = meet_ptr(tap->ptr()); ciKlass* res_klass = nullptr; bool res_xk = false; meet_aryptr(ptr, elem, this, tap, res_klass, res_xk); assert(res_xk == (ptr == Constant), ""); return make(ptr, elem, res_klass, off); } // End of case KlassPtr case InstKlassPtr: { const TypeInstKlassPtr *tp = t->is_instklassptr(); int offset = meet_offset(tp->offset()); PTR ptr = meet_ptr(tp->ptr()); const TypeInterfaces* interfaces = meet_interfaces(tp); const TypeInterfaces* tp_interfaces = tp->_interfaces; const TypeInterfaces* this_interfaces = _interfaces; switch (ptr) { case TopPTR: case AnyNull: // Fall 'down' to dual of object klass // For instances when a subclass meets a superclass we fall // below the centerline when the superclass is exact. We need to // do the same here. if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) { return TypeAryKlassPtr::make(ptr, _elem, _klass, offset); } else { // cannot subclass, so the meet has to fall badly below the centerline ptr = NotNull; interfaces = this_interfaces->intersection_with(tp->_interfaces); return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset); } case Constant: case NotNull: case BotPTR: // Fall down to object klass // LCA is object_klass, but if we subclass from the top we can do better if (above_centerline(tp->ptr())) { // If 'tp' is above the centerline and it is Object class // then we can subclass in the Java class hierarchy. // For instances when a subclass meets a superclass we fall // below the centerline when the superclass is exact. We need // to do the same here. if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) { // that is, my array type is a subtype of 'tp' klass return make(ptr, _elem, _klass, offset); } } // The other case cannot happen, since t cannot be a subtype of an array. // The meet falls down to Object class below centerline. if (ptr == Constant) ptr = NotNull; interfaces = this_interfaces->intersection_with(tp_interfaces); return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset); default: typerr(t); } } } // End of switch return this; // Return the double constant } template bool TypePtr::is_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { static_assert(std::is_base_of::value, ""); if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) { return true; } int dummy; bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) { return false; } if (this_one->is_instance_type(other)) { return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) && other_exact; } assert(this_one->is_array_type(other), ""); const T1* other_ary = this_one->is_array_type(other); bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); if (other_top_or_bottom) { return false; } const TypePtr* other_elem = other_ary->elem()->make_ptr(); const TypePtr* this_elem = this_one->elem()->make_ptr(); if (this_elem != nullptr && other_elem != nullptr) { return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact); } if (this_elem == nullptr && other_elem == nullptr) { return this_one->klass()->is_subtype_of(other->klass()); } return false; } bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); } template bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) { static_assert(std::is_base_of::value, ""); int dummy; bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); if (!this_one->is_array_type(other) || !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) { return false; } const T1* other_ary = this_one->is_array_type(other); bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); if (other_top_or_bottom) { return false; } const TypePtr* other_elem = other_ary->elem()->make_ptr(); const TypePtr* this_elem = this_one->elem()->make_ptr(); if (other_elem != nullptr && this_elem != nullptr) { return this_one->is_reference_type(this_elem)->is_same_java_type_as(this_one->is_reference_type(other_elem)); } if (other_elem == nullptr && this_elem == nullptr) { return this_one->klass()->equals(other->klass()); } return false; } bool TypeAryKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const { return TypePtr::is_same_java_type_as_helper_for_array(this, other); } template bool TypePtr::maybe_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { static_assert(std::is_base_of::value, ""); if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) { return true; } if (!this_one->is_loaded() || !other->is_loaded()) { return true; } if (this_one->is_instance_type(other)) { return other->klass()->equals(ciEnv::current()->Object_klass()) && this_one->_interfaces->contains(other->_interfaces); } int dummy; bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); if (this_top_or_bottom) { return true; } assert(this_one->is_array_type(other), ""); const T1* other_ary = this_one->is_array_type(other); bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); if (other_top_or_bottom) { return true; } if (this_exact && other_exact) { return this_one->is_java_subtype_of(other); } const TypePtr* this_elem = this_one->elem()->make_ptr(); const TypePtr* other_elem = other_ary->elem()->make_ptr(); if (other_elem != nullptr && this_elem != nullptr) { return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact); } if (other_elem == nullptr && this_elem == nullptr) { return this_one->klass()->is_subtype_of(other->klass()); } return false; } bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const Type *TypeAryKlassPtr::xdual() const { return new TypeAryKlassPtr(dual_ptr(), elem()->dual(), klass(), dual_offset()); } // Is there a single ciKlass* that can represent that type? ciKlass* TypeAryKlassPtr::exact_klass_helper() const { if (elem()->isa_klassptr()) { ciKlass* k = elem()->is_klassptr()->exact_klass_helper(); if (k == nullptr) { return nullptr; } k = ciObjArrayKlass::make(k); return k; } return klass(); } ciKlass* TypeAryKlassPtr::klass() const { if (_klass != nullptr) { return _klass; } ciKlass* k = nullptr; if (elem()->isa_klassptr()) { // leave null } else if ((elem()->base() == Type::Top) || (elem()->base() == Type::Bottom)) { } else { k = ciTypeArrayKlass::make(elem()->basic_type()); ((TypeAryKlassPtr*)this)->_klass = k; } return k; } //------------------------------dump2------------------------------------------ // Dump Klass Type #ifndef PRODUCT void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const { switch( _ptr ) { case Constant: st->print("precise "); case NotNull: { st->print("["); _elem->dump2(d, depth, st); _interfaces->dump(st); st->print(": "); } case BotPTR: if( !WizardMode && !Verbose && _ptr != Constant ) break; case TopPTR: case AnyNull: st->print(":%s", ptr_msg[_ptr]); if( _ptr == Constant ) st->print(":exact"); break; default: break; } if( _offset ) { // Dump offset, if any if( _offset == OffsetBot ) { st->print("+any"); } else if( _offset == OffsetTop ) { st->print("+unknown"); } else { st->print("+%d", _offset); } } st->print(" *"); } #endif const Type* TypeAryKlassPtr::base_element_type(int& dims) const { const Type* elem = this->elem(); dims = 1; while (elem->isa_aryklassptr()) { elem = elem->is_aryklassptr()->elem(); dims++; } return elem; } //============================================================================= // Convenience common pre-built types. //------------------------------make------------------------------------------- const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) { return (TypeFunc*)(new TypeFunc(domain,range))->hashcons(); } //------------------------------make------------------------------------------- const TypeFunc *TypeFunc::make(ciMethod* method) { Compile* C = Compile::current(); const TypeFunc* tf = C->last_tf(method); // check cache if (tf != nullptr) return tf; // The hit rate here is almost 50%. const TypeTuple *domain; if (method->is_static()) { domain = TypeTuple::make_domain(nullptr, method->signature(), ignore_interfaces); } else { domain = TypeTuple::make_domain(method->holder(), method->signature(), ignore_interfaces); } const TypeTuple *range = TypeTuple::make_range(method->signature(), ignore_interfaces); tf = TypeFunc::make(domain, range); C->set_last_tf(method, tf); // fill cache return tf; } //------------------------------meet------------------------------------------- // Compute the MEET of two types. It returns a new Type object. const Type *TypeFunc::xmeet( const Type *t ) const { // Perform a fast test for common case; meeting the same types together. if( this == t ) return this; // Meeting same type-rep? // Current "this->_base" is Func switch (t->base()) { // switch on original type case Bottom: // Ye Olde Default return t; default: // All else is a mistake typerr(t); case Top: break; } return this; // Return the double constant } //------------------------------xdual------------------------------------------ // Dual: compute field-by-field dual const Type *TypeFunc::xdual() const { return this; } //------------------------------eq--------------------------------------------- // Structural equality check for Type representations bool TypeFunc::eq( const Type *t ) const { const TypeFunc *a = (const TypeFunc*)t; return _domain == a->_domain && _range == a->_range; } //------------------------------hash------------------------------------------- // Type-specific hashing function. uint TypeFunc::hash(void) const { return (uint)(uintptr_t)_domain + (uint)(uintptr_t)_range; } //------------------------------dump2------------------------------------------ // Dump Function Type #ifndef PRODUCT void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const { if( _range->cnt() <= Parms ) st->print("void"); else { uint i; for (i = Parms; i < _range->cnt()-1; i++) { _range->field_at(i)->dump2(d,depth,st); st->print("/"); } _range->field_at(i)->dump2(d,depth,st); } st->print(" "); st->print("( "); if( !depth || d[this] ) { // Check for recursive dump st->print("...)"); return; } d.Insert((void*)this,(void*)this); // Stop recursion if (Parms < _domain->cnt()) _domain->field_at(Parms)->dump2(d,depth-1,st); for (uint i = Parms+1; i < _domain->cnt(); i++) { st->print(", "); _domain->field_at(i)->dump2(d,depth-1,st); } st->print(" )"); } #endif //------------------------------singleton-------------------------------------- // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple // constants (Ldi nodes). Singletons are integer, float or double constants // or a single symbol. bool TypeFunc::singleton(void) const { return false; // Never a singleton } bool TypeFunc::empty(void) const { return false; // Never empty } BasicType TypeFunc::return_type() const{ if (range()->cnt() == TypeFunc::Parms) { return T_VOID; } return range()->field_at(TypeFunc::Parms)->basic_type(); }