duke@435: /* drchase@6680: * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" coleenp@4037: #include "ci/ciMethodData.hpp" stefank@2314: #include "ci/ciTypeFlow.hpp" stefank@2314: #include "classfile/symbolTable.hpp" stefank@2314: #include "classfile/systemDictionary.hpp" stefank@2314: #include "compiler/compileLog.hpp" stefank@2314: #include "libadt/dict.hpp" stefank@2314: #include "memory/gcLocker.hpp" stefank@2314: #include "memory/oopFactory.hpp" stefank@2314: #include "memory/resourceArea.hpp" stefank@2314: #include "oops/instanceKlass.hpp" never@2658: #include "oops/instanceMirrorKlass.hpp" stefank@2314: #include "oops/objArrayKlass.hpp" stefank@2314: #include "oops/typeArrayKlass.hpp" stefank@2314: #include "opto/matcher.hpp" stefank@2314: #include "opto/node.hpp" stefank@2314: #include "opto/opcodes.hpp" stefank@2314: #include "opto/type.hpp" stefank@2314: drchase@6680: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC drchase@6680: duke@435: // Portions of code courtesy of Clifford Click duke@435: duke@435: // Optimization - Graph Style duke@435: duke@435: // Dictionary of types shared among compilations. duke@435: Dict* Type::_shared_type_dict = NULL; duke@435: duke@435: // Array which maps compiler types to Basic Types coleenp@4037: Type::TypeInfo Type::_type_info[Type::lastype] = { coleenp@4037: { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg, relocInfo::none }, // Bad coleenp@4037: { Control, T_ILLEGAL, "control", false, 0, relocInfo::none }, // Control coleenp@4037: { Bottom, T_VOID, "top", false, 0, relocInfo::none }, // Top coleenp@4037: { Bad, T_INT, "int:", false, Op_RegI, relocInfo::none }, // Int coleenp@4037: { Bad, T_LONG, "long:", false, Op_RegL, relocInfo::none }, // Long coleenp@4037: { Half, T_VOID, "half", false, 0, relocInfo::none }, // Half coleenp@4037: { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN, relocInfo::none }, // NarrowOop roland@4159: { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN, relocInfo::none }, // NarrowKlass coleenp@4037: { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg, relocInfo::none }, // Tuple coleenp@4037: { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg, relocInfo::none }, // Array coleenp@4037: goetz@6487: #ifdef SPARC goetz@6487: { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS goetz@6487: { Bad, T_ILLEGAL, "vectord:", false, Op_RegD, relocInfo::none }, // VectorD goetz@6487: { Bad, T_ILLEGAL, "vectorx:", false, 0, relocInfo::none }, // VectorX goetz@6487: { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY goetz@6487: #elif defined(PPC64) goetz@6487: { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS goetz@6487: { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // VectorD goetz@6487: { Bad, T_ILLEGAL, "vectorx:", false, 0, relocInfo::none }, // VectorX goetz@6487: { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY goetz@6487: #else // all other coleenp@4037: { Bad, T_ILLEGAL, "vectors:", false, Op_VecS, relocInfo::none }, // VectorS coleenp@4037: { Bad, T_ILLEGAL, "vectord:", false, Op_VecD, relocInfo::none }, // VectorD coleenp@4037: { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX coleenp@4037: { Bad, T_ILLEGAL, "vectory:", false, Op_VecY, relocInfo::none }, // VectorY goetz@6487: #endif coleenp@4037: { Bad, T_ADDRESS, "anyptr:", false, Op_RegP, relocInfo::none }, // AnyPtr coleenp@4037: { Bad, T_ADDRESS, "rawptr:", false, Op_RegP, relocInfo::none }, // RawPtr coleenp@4037: { Bad, T_OBJECT, "oop:", true, Op_RegP, relocInfo::oop_type }, // OopPtr coleenp@4037: { Bad, T_OBJECT, "inst:", true, Op_RegP, relocInfo::oop_type }, // InstPtr coleenp@4037: { Bad, T_OBJECT, "ary:", true, Op_RegP, relocInfo::oop_type }, // AryPtr coleenp@4037: { Bad, T_METADATA, "metadata:", false, Op_RegP, relocInfo::metadata_type }, // MetadataPtr coleenp@4037: { Bad, T_METADATA, "klass:", false, Op_RegP, relocInfo::metadata_type }, // KlassPtr coleenp@4037: { Bad, T_OBJECT, "func", false, 0, relocInfo::none }, // Function coleenp@4037: { Abio, T_ILLEGAL, "abIO", false, 0, relocInfo::none }, // Abio coleenp@4037: { Return_Address, T_ADDRESS, "return_address",false, Op_RegP, relocInfo::none }, // Return_Address coleenp@4037: { Memory, T_ILLEGAL, "memory", false, 0, relocInfo::none }, // Memory coleenp@4037: { FloatBot, T_FLOAT, "float_top", false, Op_RegF, relocInfo::none }, // FloatTop coleenp@4037: { FloatCon, T_FLOAT, "ftcon:", false, Op_RegF, relocInfo::none }, // FloatCon coleenp@4037: { FloatTop, T_FLOAT, "float", false, Op_RegF, relocInfo::none }, // FloatBot coleenp@4037: { DoubleBot, T_DOUBLE, "double_top", false, Op_RegD, relocInfo::none }, // DoubleTop coleenp@4037: { DoubleCon, T_DOUBLE, "dblcon:", false, Op_RegD, relocInfo::none }, // DoubleCon coleenp@4037: { DoubleTop, T_DOUBLE, "double", false, Op_RegD, relocInfo::none }, // DoubleBot coleenp@4037: { Top, T_ILLEGAL, "bottom", false, 0, relocInfo::none } // Bottom duke@435: }; duke@435: duke@435: // Map ideal registers (machine types) to ideal types duke@435: const Type *Type::mreg2type[_last_machine_leaf]; duke@435: duke@435: // Map basic types to canonical Type* pointers. duke@435: const Type* Type:: _const_basic_type[T_CONFLICT+1]; duke@435: duke@435: // Map basic types to constant-zero Types. duke@435: const Type* Type:: _zero_type[T_CONFLICT+1]; duke@435: duke@435: // Map basic types to array-body alias types. duke@435: const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1]; duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const Type *Type::ABIO; // State-of-machine only duke@435: const Type *Type::BOTTOM; // All values duke@435: const Type *Type::CONTROL; // Control only duke@435: const Type *Type::DOUBLE; // All doubles duke@435: const Type *Type::FLOAT; // All floats duke@435: const Type *Type::HALF; // Placeholder half of doublewide type duke@435: const Type *Type::MEMORY; // Abstract store only duke@435: const Type *Type::RETURN_ADDRESS; duke@435: const Type *Type::TOP; // No values in set duke@435: duke@435: //------------------------------get_const_type--------------------------- duke@435: const Type* Type::get_const_type(ciType* type) { duke@435: if (type == NULL) { duke@435: return NULL; duke@435: } else if (type->is_primitive_type()) { duke@435: return get_const_basic_type(type->basic_type()); duke@435: } else { duke@435: return TypeOopPtr::make_from_klass(type->as_klass()); duke@435: } duke@435: } duke@435: duke@435: //---------------------------array_element_basic_type--------------------------------- duke@435: // Mapping to the array element's basic type. duke@435: BasicType Type::array_element_basic_type() const { duke@435: BasicType bt = basic_type(); duke@435: if (bt == T_INT) { duke@435: if (this == TypeInt::INT) return T_INT; duke@435: if (this == TypeInt::CHAR) return T_CHAR; duke@435: if (this == TypeInt::BYTE) return T_BYTE; duke@435: if (this == TypeInt::BOOL) return T_BOOLEAN; duke@435: if (this == TypeInt::SHORT) return T_SHORT; duke@435: return T_VOID; duke@435: } duke@435: return bt; duke@435: } duke@435: duke@435: //---------------------------get_typeflow_type--------------------------------- duke@435: // Import a type produced by ciTypeFlow. duke@435: const Type* Type::get_typeflow_type(ciType* type) { duke@435: switch (type->basic_type()) { duke@435: duke@435: case ciTypeFlow::StateVector::T_BOTTOM: duke@435: assert(type == ciTypeFlow::StateVector::bottom_type(), ""); duke@435: return Type::BOTTOM; duke@435: duke@435: case ciTypeFlow::StateVector::T_TOP: duke@435: assert(type == ciTypeFlow::StateVector::top_type(), ""); duke@435: return Type::TOP; duke@435: duke@435: case ciTypeFlow::StateVector::T_NULL: duke@435: assert(type == ciTypeFlow::StateVector::null_type(), ""); duke@435: return TypePtr::NULL_PTR; duke@435: duke@435: case ciTypeFlow::StateVector::T_LONG2: duke@435: // The ciTypeFlow pass pushes a long, then the half. duke@435: // We do the same. duke@435: assert(type == ciTypeFlow::StateVector::long2_type(), ""); duke@435: return TypeInt::TOP; duke@435: duke@435: case ciTypeFlow::StateVector::T_DOUBLE2: duke@435: // The ciTypeFlow pass pushes double, then the half. duke@435: // Our convention is the same. duke@435: assert(type == ciTypeFlow::StateVector::double2_type(), ""); duke@435: return Type::TOP; duke@435: duke@435: case T_ADDRESS: duke@435: assert(type->is_return_address(), ""); duke@435: return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci()); duke@435: duke@435: default: duke@435: // make sure we did not mix up the cases: duke@435: assert(type != ciTypeFlow::StateVector::bottom_type(), ""); duke@435: assert(type != ciTypeFlow::StateVector::top_type(), ""); duke@435: assert(type != ciTypeFlow::StateVector::null_type(), ""); duke@435: assert(type != ciTypeFlow::StateVector::long2_type(), ""); duke@435: assert(type != ciTypeFlow::StateVector::double2_type(), ""); duke@435: assert(!type->is_return_address(), ""); duke@435: duke@435: return Type::get_const_type(type); duke@435: } duke@435: } duke@435: duke@435: vlivanov@5658: //-----------------------make_from_constant------------------------------------ vlivanov@5658: const Type* Type::make_from_constant(ciConstant constant, vlivanov@5658: bool require_constant, bool is_autobox_cache) { vlivanov@5658: switch (constant.basic_type()) { vlivanov@5658: case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); vlivanov@5658: case T_CHAR: return TypeInt::make(constant.as_char()); vlivanov@5658: case T_BYTE: return TypeInt::make(constant.as_byte()); vlivanov@5658: case T_SHORT: return TypeInt::make(constant.as_short()); vlivanov@5658: case T_INT: return TypeInt::make(constant.as_int()); vlivanov@5658: case T_LONG: return TypeLong::make(constant.as_long()); vlivanov@5658: case T_FLOAT: return TypeF::make(constant.as_float()); vlivanov@5658: case T_DOUBLE: return TypeD::make(constant.as_double()); vlivanov@5658: case T_ARRAY: vlivanov@5658: case T_OBJECT: vlivanov@5658: { vlivanov@5658: // cases: vlivanov@5658: // can_be_constant = (oop not scavengable || ScavengeRootsInCode != 0) vlivanov@5658: // should_be_constant = (oop not scavengable || ScavengeRootsInCode >= 2) vlivanov@5658: // An oop is not scavengable if it is in the perm gen. vlivanov@5658: ciObject* oop_constant = constant.as_object(); vlivanov@5658: if (oop_constant->is_null_object()) { vlivanov@5658: return Type::get_zero_type(T_OBJECT); vlivanov@5658: } else if (require_constant || oop_constant->should_be_constant()) { vlivanov@5658: return TypeOopPtr::make_from_constant(oop_constant, require_constant, is_autobox_cache); vlivanov@5658: } vlivanov@5658: } vlivanov@5658: } vlivanov@5658: // Fall through to failure vlivanov@5658: return NULL; vlivanov@5658: } vlivanov@5658: vlivanov@5658: duke@435: //------------------------------make------------------------------------------- duke@435: // Create a simple Type, with default empty symbol sets. Then hashcons it duke@435: // and look for an existing copy in the type dictionary. duke@435: const Type *Type::make( enum TYPES t ) { duke@435: return (new Type(t))->hashcons(); duke@435: } kvn@658: duke@435: //------------------------------cmp-------------------------------------------- duke@435: int Type::cmp( const Type *const t1, const Type *const t2 ) { duke@435: if( t1->_base != t2->_base ) duke@435: return 1; // Missed badly duke@435: assert(t1 != t2 || t1->eq(t2), "eq must be reflexive"); duke@435: return !t1->eq(t2); // Return ZERO if equal duke@435: } duke@435: roland@6313: const Type* Type::maybe_remove_speculative(bool include_speculative) const { roland@6313: if (!include_speculative) { roland@6313: return remove_speculative(); roland@6313: } roland@6313: return this; roland@6313: } roland@6313: duke@435: //------------------------------hash------------------------------------------- duke@435: int Type::uhash( const Type *const t ) { duke@435: return t->hash(); duke@435: } duke@435: kvn@1975: #define SMALLINT ((juint)3) // a value too insignificant to consider widening kvn@1975: duke@435: //--------------------------Initialize_shared---------------------------------- duke@435: void Type::Initialize_shared(Compile* current) { duke@435: // This method does not need to be locked because the first system duke@435: // compilations (stub compilations) occur serially. If they are duke@435: // changed to proceed in parallel, then this section will need duke@435: // locking. duke@435: duke@435: Arena* save = current->type_arena(); zgu@7074: Arena* shared_type_arena = new (mtCompiler)Arena(mtCompiler); duke@435: duke@435: current->set_type_arena(shared_type_arena); duke@435: _shared_type_dict = duke@435: new (shared_type_arena) Dict( (CmpKey)Type::cmp, (Hash)Type::uhash, duke@435: shared_type_arena, 128 ); duke@435: current->set_type_dict(_shared_type_dict); duke@435: duke@435: // Make shared pre-built types. duke@435: CONTROL = make(Control); // Control only duke@435: TOP = make(Top); // No values in set duke@435: MEMORY = make(Memory); // Abstract store only duke@435: ABIO = make(Abio); // State-of-machine only duke@435: RETURN_ADDRESS=make(Return_Address); duke@435: FLOAT = make(FloatBot); // All floats duke@435: DOUBLE = make(DoubleBot); // All doubles duke@435: BOTTOM = make(Bottom); // Everything duke@435: HALF = make(Half); // Placeholder half of doublewide type duke@435: duke@435: TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero) duke@435: TypeF::ONE = TypeF::make(1.0); // Float 1 duke@435: duke@435: TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero) duke@435: TypeD::ONE = TypeD::make(1.0); // Double 1 duke@435: duke@435: TypeInt::MINUS_1 = TypeInt::make(-1); // -1 duke@435: TypeInt::ZERO = TypeInt::make( 0); // 0 duke@435: TypeInt::ONE = TypeInt::make( 1); // 1 duke@435: TypeInt::BOOL = TypeInt::make(0,1, WidenMin); // 0 or 1, FALSE or TRUE. duke@435: TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes duke@435: TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1 duke@435: TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE duke@435: TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO duke@435: TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin); duke@435: TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL duke@435: TypeInt::BYTE = TypeInt::make(-128,127, WidenMin); // Bytes twisti@1059: TypeInt::UBYTE = TypeInt::make(0, 255, WidenMin); // Unsigned Bytes duke@435: TypeInt::CHAR = TypeInt::make(0,65535, WidenMin); // Java chars duke@435: TypeInt::SHORT = TypeInt::make(-32768,32767, WidenMin); // Java shorts duke@435: TypeInt::POS = TypeInt::make(0,max_jint, WidenMin); // Non-neg values duke@435: TypeInt::POS1 = TypeInt::make(1,max_jint, WidenMin); // Positive values duke@435: TypeInt::INT = TypeInt::make(min_jint,max_jint, WidenMax); // 32-bit integers duke@435: TypeInt::SYMINT = TypeInt::make(-max_jint,max_jint,WidenMin); // symmetric range rbackman@6375: TypeInt::TYPE_DOMAIN = TypeInt::INT; duke@435: // CmpL is overloaded both as the bytecode computation returning duke@435: // a trinary (-1,0,+1) integer result AND as an efficient long duke@435: // compare returning optimizer ideal-type flags. duke@435: assert( TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" ); duke@435: assert( TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" ); duke@435: assert( TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" ); duke@435: assert( TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" ); kvn@1975: assert( (juint)(TypeInt::CC->_hi - TypeInt::CC->_lo) <= SMALLINT, "CC is truly small"); duke@435: duke@435: TypeLong::MINUS_1 = TypeLong::make(-1); // -1 duke@435: TypeLong::ZERO = TypeLong::make( 0); // 0 duke@435: TypeLong::ONE = TypeLong::make( 1); // 1 duke@435: TypeLong::POS = TypeLong::make(0,max_jlong, WidenMin); // Non-neg values duke@435: TypeLong::LONG = TypeLong::make(min_jlong,max_jlong,WidenMax); // 64-bit integers duke@435: TypeLong::INT = TypeLong::make((jlong)min_jint,(jlong)max_jint,WidenMin); duke@435: TypeLong::UINT = TypeLong::make(0,(jlong)max_juint,WidenMin); rbackman@6375: TypeLong::TYPE_DOMAIN = TypeLong::LONG; duke@435: duke@435: const Type **fboth =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); duke@435: fboth[0] = Type::CONTROL; duke@435: fboth[1] = Type::CONTROL; duke@435: TypeTuple::IFBOTH = TypeTuple::make( 2, fboth ); duke@435: duke@435: const Type **ffalse =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); duke@435: ffalse[0] = Type::CONTROL; duke@435: ffalse[1] = Type::TOP; duke@435: TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse ); duke@435: duke@435: const Type **fneither =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); duke@435: fneither[0] = Type::TOP; duke@435: fneither[1] = Type::TOP; duke@435: TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither ); duke@435: duke@435: const Type **ftrue =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); duke@435: ftrue[0] = Type::TOP; duke@435: ftrue[1] = Type::CONTROL; duke@435: TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue ); duke@435: duke@435: const Type **floop =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); duke@435: floop[0] = Type::CONTROL; duke@435: floop[1] = TypeInt::INT; duke@435: TypeTuple::LOOPBODY = TypeTuple::make( 2, floop ); duke@435: duke@435: TypePtr::NULL_PTR= TypePtr::make( AnyPtr, TypePtr::Null, 0 ); duke@435: TypePtr::NOTNULL = TypePtr::make( AnyPtr, TypePtr::NotNull, OffsetBot ); duke@435: TypePtr::BOTTOM = TypePtr::make( AnyPtr, TypePtr::BotPTR, OffsetBot ); duke@435: duke@435: TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR ); duke@435: TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull ); duke@435: duke@435: const Type **fmembar = TypeTuple::fields(0); duke@435: TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar); duke@435: duke@435: const Type **fsc = (const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); duke@435: fsc[0] = TypeInt::CC; duke@435: fsc[1] = Type::MEMORY; duke@435: TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc); duke@435: duke@435: TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass()); duke@435: TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass()); duke@435: TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass()); duke@435: TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), duke@435: false, 0, oopDesc::mark_offset_in_bytes()); duke@435: TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), duke@435: false, 0, oopDesc::klass_offset_in_bytes()); roland@5991: TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot, TypeOopPtr::InstanceBot, NULL); duke@435: coleenp@4037: TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, NULL, OffsetBot); coleenp@4037: coleenp@548: TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR ); coleenp@548: TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM ); coleenp@548: roland@4159: TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR ); roland@4159: coleenp@548: mreg2type[Op_Node] = Type::BOTTOM; coleenp@548: mreg2type[Op_Set ] = 0; coleenp@548: mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM; coleenp@548: mreg2type[Op_RegI] = TypeInt::INT; coleenp@548: mreg2type[Op_RegP] = TypePtr::BOTTOM; coleenp@548: mreg2type[Op_RegF] = Type::FLOAT; coleenp@548: mreg2type[Op_RegD] = Type::DOUBLE; coleenp@548: mreg2type[Op_RegL] = TypeLong::LONG; coleenp@548: mreg2type[Op_RegFlags] = TypeInt::CC; coleenp@548: kvn@2116: TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), NULL /* current->env()->Object_klass() */, false, arrayOopDesc::length_offset_in_bytes()); kvn@598: kvn@598: TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); kvn@598: kvn@598: #ifdef _LP64 kvn@598: if (UseCompressedOops) { coleenp@4037: assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop"); kvn@598: TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS; kvn@598: } else kvn@598: #endif kvn@598: { kvn@598: // There is no shared klass for Object[]. See note in TypeAryPtr::klass(). kvn@598: TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); kvn@598: } duke@435: TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot); duke@435: TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot); duke@435: TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot); duke@435: TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot); duke@435: TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot); duke@435: TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot); duke@435: TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot); duke@435: kvn@598: // Nobody should ask _array_body_type[T_NARROWOOP]. Use NULL as assert. kvn@598: TypeAryPtr::_array_body_type[T_NARROWOOP] = NULL; duke@435: TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS; kvn@598: TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays duke@435: TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES; duke@435: TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array duke@435: TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS; duke@435: TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS; duke@435: TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS; duke@435: TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS; duke@435: TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS; duke@435: TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES; duke@435: duke@435: TypeKlassPtr::OBJECT = TypeKlassPtr::make( TypePtr::NotNull, current->env()->Object_klass(), 0 ); duke@435: TypeKlassPtr::OBJECT_OR_NULL = TypeKlassPtr::make( TypePtr::BotPTR, current->env()->Object_klass(), 0 ); duke@435: duke@435: const Type **fi2c = TypeTuple::fields(2); coleenp@4037: fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method* duke@435: fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer duke@435: TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c); duke@435: duke@435: const Type **intpair = TypeTuple::fields(2); duke@435: intpair[0] = TypeInt::INT; duke@435: intpair[1] = TypeInt::INT; duke@435: TypeTuple::INT_PAIR = TypeTuple::make(2, intpair); duke@435: duke@435: const Type **longpair = TypeTuple::fields(2); duke@435: longpair[0] = TypeLong::LONG; duke@435: longpair[1] = TypeLong::LONG; duke@435: TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair); duke@435: rbackman@5791: const Type **intccpair = TypeTuple::fields(2); rbackman@5791: intccpair[0] = TypeInt::INT; rbackman@5791: intccpair[1] = TypeInt::CC; rbackman@5791: TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair); rbackman@5791: rbackman@5997: const Type **longccpair = TypeTuple::fields(2); rbackman@5997: longccpair[0] = TypeLong::LONG; rbackman@5997: longccpair[1] = TypeInt::CC; rbackman@5997: TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair); rbackman@5997: roland@4159: _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM; roland@4159: _const_basic_type[T_NARROWKLASS] = Type::BOTTOM; roland@4159: _const_basic_type[T_BOOLEAN] = TypeInt::BOOL; roland@4159: _const_basic_type[T_CHAR] = TypeInt::CHAR; roland@4159: _const_basic_type[T_BYTE] = TypeInt::BYTE; roland@4159: _const_basic_type[T_SHORT] = TypeInt::SHORT; roland@4159: _const_basic_type[T_INT] = TypeInt::INT; roland@4159: _const_basic_type[T_LONG] = TypeLong::LONG; roland@4159: _const_basic_type[T_FLOAT] = Type::FLOAT; roland@4159: _const_basic_type[T_DOUBLE] = Type::DOUBLE; roland@4159: _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM; roland@4159: _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays roland@4159: _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way roland@4159: _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs roland@4159: _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not? roland@4159: roland@4159: _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR; roland@4159: _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR; roland@4159: _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0 roland@4159: _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0 roland@4159: _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0 roland@4159: _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0 roland@4159: _zero_type[T_INT] = TypeInt::ZERO; roland@4159: _zero_type[T_LONG] = TypeLong::ZERO; roland@4159: _zero_type[T_FLOAT] = TypeF::ZERO; roland@4159: _zero_type[T_DOUBLE] = TypeD::ZERO; roland@4159: _zero_type[T_OBJECT] = TypePtr::NULL_PTR; roland@4159: _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop roland@4159: _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null roland@4159: _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all duke@435: duke@435: // get_zero_type() should not happen for T_CONFLICT duke@435: _zero_type[T_CONFLICT]= NULL; duke@435: kvn@3882: // Vector predefined types, it needs initialized _const_basic_type[]. kvn@3882: if (Matcher::vector_size_supported(T_BYTE,4)) { kvn@3882: TypeVect::VECTS = TypeVect::make(T_BYTE,4); kvn@3882: } kvn@3882: if (Matcher::vector_size_supported(T_FLOAT,2)) { kvn@3882: TypeVect::VECTD = TypeVect::make(T_FLOAT,2); kvn@3882: } kvn@3882: if (Matcher::vector_size_supported(T_FLOAT,4)) { kvn@3882: TypeVect::VECTX = TypeVect::make(T_FLOAT,4); kvn@3882: } kvn@3882: if (Matcher::vector_size_supported(T_FLOAT,8)) { kvn@3882: TypeVect::VECTY = TypeVect::make(T_FLOAT,8); kvn@3882: } kvn@3882: mreg2type[Op_VecS] = TypeVect::VECTS; kvn@3882: mreg2type[Op_VecD] = TypeVect::VECTD; kvn@3882: mreg2type[Op_VecX] = TypeVect::VECTX; kvn@3882: mreg2type[Op_VecY] = TypeVect::VECTY; kvn@3882: duke@435: // Restore working type arena. duke@435: current->set_type_arena(save); duke@435: current->set_type_dict(NULL); duke@435: } duke@435: duke@435: //------------------------------Initialize------------------------------------- duke@435: void Type::Initialize(Compile* current) { duke@435: assert(current->type_arena() != NULL, "must have created type arena"); duke@435: duke@435: if (_shared_type_dict == NULL) { duke@435: Initialize_shared(current); duke@435: } duke@435: duke@435: Arena* type_arena = current->type_arena(); duke@435: duke@435: // Create the hash-cons'ing dictionary with top-level storage allocation duke@435: Dict *tdic = new (type_arena) Dict( (CmpKey)Type::cmp,(Hash)Type::uhash, type_arena, 128 ); duke@435: current->set_type_dict(tdic); duke@435: duke@435: // Transfer the shared types. duke@435: DictI i(_shared_type_dict); duke@435: for( ; i.test(); ++i ) { duke@435: Type* t = (Type*)i._value; duke@435: tdic->Insert(t,t); // New Type, insert into Type table duke@435: } duke@435: } duke@435: duke@435: //------------------------------hashcons--------------------------------------- duke@435: // Do the hash-cons trick. If the Type already exists in the type table, duke@435: // delete the current Type and return the existing Type. Otherwise stick the duke@435: // current Type in the Type table. duke@435: const Type *Type::hashcons(void) { duke@435: debug_only(base()); // Check the assertion in Type::base(). duke@435: // Look up the Type in the Type dictionary duke@435: Dict *tdic = type_dict(); duke@435: Type* old = (Type*)(tdic->Insert(this, this, false)); duke@435: if( old ) { // Pre-existing Type? duke@435: if( old != this ) // Yes, this guy is not the pre-existing? duke@435: delete this; // Yes, Nuke this guy duke@435: assert( old->_dual, "" ); duke@435: return old; // Return pre-existing duke@435: } duke@435: duke@435: // Every type has a dual (to make my lattice symmetric). duke@435: // Since we just discovered a new Type, compute its dual right now. duke@435: assert( !_dual, "" ); // No dual yet duke@435: _dual = xdual(); // Compute the dual duke@435: if( cmp(this,_dual)==0 ) { // Handle self-symmetric duke@435: _dual = this; duke@435: return this; duke@435: } duke@435: assert( !_dual->_dual, "" ); // No reverse dual yet duke@435: assert( !(*tdic)[_dual], "" ); // Dual not in type system either duke@435: // New Type, insert into Type table duke@435: tdic->Insert((void*)_dual,(void*)_dual); duke@435: ((Type*)_dual)->_dual = this; // Finish up being symmetric duke@435: #ifdef ASSERT duke@435: Type *dual_dual = (Type*)_dual->xdual(); duke@435: assert( eq(dual_dual), "xdual(xdual()) should be identity" ); duke@435: delete dual_dual; duke@435: #endif duke@435: return this; // Return new Type duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool Type::eq( const Type * ) const { duke@435: return true; // Nothing else can go wrong duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int Type::hash(void) const { duke@435: return _base; duke@435: } duke@435: duke@435: //------------------------------is_finite-------------------------------------- duke@435: // Has a finite value duke@435: bool Type::is_finite() const { duke@435: return false; duke@435: } duke@435: duke@435: //------------------------------is_nan----------------------------------------- duke@435: // Is not a number (NaN) duke@435: bool Type::is_nan() const { duke@435: return false; duke@435: } duke@435: kvn@1255: //----------------------interface_vs_oop--------------------------------------- kvn@1255: #ifdef ASSERT roland@5991: bool Type::interface_vs_oop_helper(const Type *t) const { kvn@1255: bool result = false; kvn@1255: kvn@1427: const TypePtr* this_ptr = this->make_ptr(); // In case it is narrow_oop kvn@1427: const TypePtr* t_ptr = t->make_ptr(); kvn@1427: if( this_ptr == NULL || t_ptr == NULL ) kvn@1427: return result; kvn@1427: kvn@1427: const TypeInstPtr* this_inst = this_ptr->isa_instptr(); kvn@1427: const TypeInstPtr* t_inst = t_ptr->isa_instptr(); kvn@1255: if( this_inst && this_inst->is_loaded() && t_inst && t_inst->is_loaded() ) { kvn@1255: bool this_interface = this_inst->klass()->is_interface(); kvn@1255: bool t_interface = t_inst->klass()->is_interface(); kvn@1255: result = this_interface ^ t_interface; kvn@1255: } kvn@1255: kvn@1255: return result; kvn@1255: } roland@5991: roland@5991: bool Type::interface_vs_oop(const Type *t) const { roland@5991: if (interface_vs_oop_helper(t)) { roland@5991: return true; roland@5991: } roland@5991: // Now check the speculative parts as well roland@5991: const TypeOopPtr* this_spec = isa_oopptr() != NULL ? isa_oopptr()->speculative() : NULL; roland@5991: const TypeOopPtr* t_spec = t->isa_oopptr() != NULL ? t->isa_oopptr()->speculative() : NULL; roland@5991: if (this_spec != NULL && t_spec != NULL) { roland@5991: if (this_spec->interface_vs_oop_helper(t_spec)) { roland@5991: return true; roland@5991: } roland@5991: return false; roland@5991: } roland@5991: if (this_spec != NULL && this_spec->interface_vs_oop_helper(t)) { roland@5991: return true; roland@5991: } roland@5991: if (t_spec != NULL && interface_vs_oop_helper(t_spec)) { roland@5991: return true; roland@5991: } roland@5991: return false; roland@5991: } roland@5991: kvn@1255: #endif kvn@1255: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. NOT virtual. It enforces that meet is duke@435: // commutative and the lattice is symmetric. roland@6313: const Type *Type::meet_helper(const Type *t, bool include_speculative) const { coleenp@548: if (isa_narrowoop() && t->isa_narrowoop()) { roland@6313: const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); kvn@656: return result->make_narrowoop(); coleenp@548: } roland@4159: if (isa_narrowklass() && t->isa_narrowklass()) { roland@6313: const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); roland@4159: return result->make_narrowklass(); roland@4159: } coleenp@548: roland@6313: const Type *this_t = maybe_remove_speculative(include_speculative); roland@6313: t = t->maybe_remove_speculative(include_speculative); roland@6313: roland@6313: const Type *mt = this_t->xmeet(t); coleenp@548: if (isa_narrowoop() || t->isa_narrowoop()) return mt; roland@4159: if (isa_narrowklass() || t->isa_narrowklass()) return mt; duke@435: #ifdef ASSERT roland@6313: assert(mt == t->xmeet(this_t), "meet not commutative"); duke@435: const Type* dual_join = mt->_dual; duke@435: const Type *t2t = dual_join->xmeet(t->_dual); roland@6313: const Type *t2this = dual_join->xmeet(this_t->_dual); duke@435: duke@435: // Interface meet Oop is Not Symmetric: duke@435: // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull duke@435: // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull kvn@1255: roland@6313: if( !interface_vs_oop(t) && (t2t != t->_dual || t2this != this_t->_dual) ) { duke@435: tty->print_cr("=== Meet Not Symmetric ==="); roland@6313: tty->print("t = "); t->dump(); tty->cr(); roland@6313: tty->print("this= "); this_t->dump(); tty->cr(); roland@6313: tty->print("mt=(t meet this)= "); mt->dump(); tty->cr(); roland@6313: roland@6313: tty->print("t_dual= "); t->_dual->dump(); tty->cr(); roland@6313: tty->print("this_dual= "); this_t->_dual->dump(); tty->cr(); roland@6313: tty->print("mt_dual= "); mt->_dual->dump(); tty->cr(); roland@6313: roland@6313: tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr(); roland@6313: tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr(); duke@435: duke@435: fatal("meet not symmetric" ); duke@435: } duke@435: #endif duke@435: return mt; duke@435: } duke@435: duke@435: //------------------------------xmeet------------------------------------------ duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *Type::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Meeting TOP with anything? duke@435: if( _base == Top ) return t; duke@435: duke@435: // Meeting BOTTOM with anything? duke@435: if( _base == Bottom ) return BOTTOM; duke@435: duke@435: // Current "this->_base" is one of: Bad, Multi, Control, Top, duke@435: // Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype. duke@435: switch (t->base()) { // Switch on original type duke@435: duke@435: // Cut in half the number of cases I must handle. Only need cases for when duke@435: // the given enum "t->type" is less than or equal to the local enum "type". duke@435: case FloatCon: duke@435: case DoubleCon: duke@435: case Int: duke@435: case Long: duke@435: return t->xmeet(this); duke@435: duke@435: case OopPtr: duke@435: return t->xmeet(this); duke@435: duke@435: case InstPtr: duke@435: return t->xmeet(this); duke@435: coleenp@4037: case MetadataPtr: duke@435: case KlassPtr: duke@435: return t->xmeet(this); duke@435: duke@435: case AryPtr: duke@435: return t->xmeet(this); duke@435: coleenp@548: case NarrowOop: coleenp@548: return t->xmeet(this); coleenp@548: roland@4159: case NarrowKlass: roland@4159: return t->xmeet(this); roland@4159: duke@435: case Bad: // Type check duke@435: default: // Bogus type not in lattice duke@435: typerr(t); duke@435: return Type::BOTTOM; duke@435: duke@435: case Bottom: // Ye Olde Default duke@435: return t; duke@435: duke@435: case FloatTop: duke@435: if( _base == FloatTop ) return this; duke@435: case FloatBot: // Float duke@435: if( _base == FloatBot || _base == FloatTop ) return FLOAT; duke@435: if( _base == DoubleTop || _base == DoubleBot ) return Type::BOTTOM; duke@435: typerr(t); duke@435: return Type::BOTTOM; duke@435: duke@435: case DoubleTop: duke@435: if( _base == DoubleTop ) return this; duke@435: case DoubleBot: // Double duke@435: if( _base == DoubleBot || _base == DoubleTop ) return DOUBLE; duke@435: if( _base == FloatTop || _base == FloatBot ) return Type::BOTTOM; duke@435: typerr(t); duke@435: return Type::BOTTOM; duke@435: duke@435: // These next few cases must match exactly or it is a compile-time error. duke@435: case Control: // Control of code duke@435: case Abio: // State of world outside of program duke@435: case Memory: duke@435: if( _base == t->_base ) return this; duke@435: typerr(t); duke@435: return Type::BOTTOM; duke@435: duke@435: case Top: // Top of the lattice duke@435: return this; duke@435: } duke@435: duke@435: // The type is unchanged duke@435: return this; duke@435: } duke@435: duke@435: //-----------------------------filter------------------------------------------ roland@6313: const Type *Type::filter_helper(const Type *kills, bool include_speculative) const { roland@6313: const Type* ft = join_helper(kills, include_speculative); duke@435: if (ft->empty()) duke@435: return Type::TOP; // Canonical empty value duke@435: return ft; duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Compute dual right now. duke@435: const Type::TYPES Type::dual_type[Type::lastype] = { duke@435: Bad, // Bad duke@435: Control, // Control duke@435: Bottom, // Top duke@435: Bad, // Int - handled in v-call duke@435: Bad, // Long - handled in v-call duke@435: Half, // Half coleenp@548: Bad, // NarrowOop - handled in v-call roland@4159: Bad, // NarrowKlass - handled in v-call duke@435: duke@435: Bad, // Tuple - handled in v-call duke@435: Bad, // Array - handled in v-call kvn@3882: Bad, // VectorS - handled in v-call kvn@3882: Bad, // VectorD - handled in v-call kvn@3882: Bad, // VectorX - handled in v-call kvn@3882: Bad, // VectorY - handled in v-call duke@435: duke@435: Bad, // AnyPtr - handled in v-call duke@435: Bad, // RawPtr - handled in v-call duke@435: Bad, // OopPtr - handled in v-call duke@435: Bad, // InstPtr - handled in v-call duke@435: Bad, // AryPtr - handled in v-call coleenp@4037: coleenp@4037: Bad, // MetadataPtr - handled in v-call duke@435: Bad, // KlassPtr - handled in v-call duke@435: duke@435: Bad, // Function - handled in v-call duke@435: Abio, // Abio duke@435: Return_Address,// Return_Address duke@435: Memory, // Memory duke@435: FloatBot, // FloatTop duke@435: FloatCon, // FloatCon duke@435: FloatTop, // FloatBot duke@435: DoubleBot, // DoubleTop duke@435: DoubleCon, // DoubleCon duke@435: DoubleTop, // DoubleBot duke@435: Top // Bottom duke@435: }; duke@435: duke@435: const Type *Type::xdual() const { duke@435: // Note: the base() accessor asserts the sanity of _base. coleenp@4037: assert(_type_info[base()].dual_type != Bad, "implement with v-call"); coleenp@4037: return new Type(_type_info[_base].dual_type); duke@435: } duke@435: duke@435: //------------------------------has_memory------------------------------------- duke@435: bool Type::has_memory() const { duke@435: Type::TYPES tx = base(); duke@435: if (tx == Memory) return true; duke@435: if (tx == Tuple) { duke@435: const TypeTuple *t = is_tuple(); duke@435: for (uint i=0; i < t->cnt(); i++) { duke@435: tx = t->field_at(i)->base(); duke@435: if (tx == Memory) return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: //------------------------------dump2------------------------------------------ duke@435: void Type::dump2( Dict &d, uint depth, outputStream *st ) const { drchase@6680: st->print("%s", _type_info[_base].msg); duke@435: } duke@435: duke@435: //------------------------------dump------------------------------------------- duke@435: void Type::dump_on(outputStream *st) const { duke@435: ResourceMark rm; duke@435: Dict d(cmpkey,hashkey); // Stop recursive type dumping duke@435: dump2(d,1, st); kvn@598: if (is_ptr_to_narrowoop()) { coleenp@548: st->print(" [narrow]"); roland@4159: } else if (is_ptr_to_narrowklass()) { roland@4159: st->print(" [narrowklass]"); coleenp@548: } duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants (Ldi nodes). Singletons are integer, float or double constants. duke@435: bool Type::singleton(void) const { duke@435: return _base == Top || _base == Half; duke@435: } duke@435: duke@435: //------------------------------empty------------------------------------------ duke@435: // TRUE if Type is a type with no values, FALSE otherwise. duke@435: bool Type::empty(void) const { duke@435: switch (_base) { duke@435: case DoubleTop: duke@435: case FloatTop: duke@435: case Top: duke@435: return true; duke@435: duke@435: case Half: duke@435: case Abio: duke@435: case Return_Address: duke@435: case Memory: duke@435: case Bottom: duke@435: case FloatBot: duke@435: case DoubleBot: duke@435: return false; // never a singleton, therefore never empty duke@435: } duke@435: duke@435: ShouldNotReachHere(); duke@435: return false; duke@435: } duke@435: duke@435: //------------------------------dump_stats------------------------------------- duke@435: // Dump collected statistics to stderr duke@435: #ifndef PRODUCT duke@435: void Type::dump_stats() { duke@435: tty->print("Types made: %d\n", type_dict()->Size()); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------typerr----------------------------------------- duke@435: void Type::typerr( const Type *t ) const { duke@435: #ifndef PRODUCT duke@435: tty->print("\nError mixing types: "); duke@435: dump(); duke@435: tty->print(" and "); duke@435: t->dump(); duke@435: tty->print("\n"); duke@435: #endif duke@435: ShouldNotReachHere(); duke@435: } duke@435: duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypeF *TypeF::ZERO; // Floating point zero duke@435: const TypeF *TypeF::ONE; // Floating point one duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: // Create a float constant duke@435: const TypeF *TypeF::make(float f) { duke@435: return (TypeF*)(new TypeF(f))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *TypeF::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is FloatCon duke@435: switch (t->base()) { // Switch on original type duke@435: case AnyPtr: // Mixing with oops happens when javac duke@435: case RawPtr: // reuses local variables duke@435: case OopPtr: duke@435: case InstPtr: coleenp@4037: case AryPtr: coleenp@4037: case MetadataPtr: duke@435: case KlassPtr: kvn@728: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Int: duke@435: case Long: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: duke@435: case FloatBot: duke@435: return t; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case FloatCon: // Float-constant vs Float-constant? duke@435: if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants? duke@435: // must compare bitwise as positive zero, negative zero and NaN have duke@435: // all the same representation in C++ duke@435: return FLOAT; // Return generic float duke@435: // Equal constants duke@435: case Top: duke@435: case FloatTop: duke@435: break; // Return the float constant duke@435: } duke@435: return this; // Return the float constant duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: symmetric duke@435: const Type *TypeF::xdual() const { duke@435: return this; duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeF::eq( const Type *t ) const { duke@435: if( g_isnan(_f) || duke@435: g_isnan(t->getf()) ) { duke@435: // One or both are NANs. If both are NANs return true, else false. duke@435: return (g_isnan(_f) && g_isnan(t->getf())); duke@435: } duke@435: if (_f == t->getf()) { duke@435: // (NaN is impossible at this point, since it is not equal even to itself) duke@435: if (_f == 0.0) { duke@435: // difference between positive and negative zero duke@435: if (jint_cast(_f) != jint_cast(t->getf())) return false; duke@435: } duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeF::hash(void) const { duke@435: return *(int*)(&_f); duke@435: } duke@435: duke@435: //------------------------------is_finite-------------------------------------- duke@435: // Has a finite value duke@435: bool TypeF::is_finite() const { duke@435: return g_isfinite(getf()) != 0; duke@435: } duke@435: duke@435: //------------------------------is_nan----------------------------------------- duke@435: // Is not a number (NaN) duke@435: bool TypeF::is_nan() const { duke@435: return g_isnan(getf()) != 0; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump float constant Type duke@435: #ifndef PRODUCT duke@435: void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: Type::dump2(d,depth, st); duke@435: st->print("%f", _f); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants (Ldi nodes). Singletons are integer, float or double constants duke@435: // or a single symbol. duke@435: bool TypeF::singleton(void) const { duke@435: return true; // Always a singleton duke@435: } duke@435: duke@435: bool TypeF::empty(void) const { duke@435: return false; // always exactly a singleton duke@435: } duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypeD *TypeD::ZERO; // Floating point zero duke@435: const TypeD *TypeD::ONE; // Floating point one duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeD *TypeD::make(double d) { duke@435: return (TypeD*)(new TypeD(d))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *TypeD::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is DoubleCon duke@435: switch (t->base()) { // Switch on original type duke@435: case AnyPtr: // Mixing with oops happens when javac duke@435: case RawPtr: // reuses local variables duke@435: case OopPtr: duke@435: case InstPtr: coleenp@4037: case AryPtr: coleenp@4037: case MetadataPtr: duke@435: case KlassPtr: never@618: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Int: duke@435: case Long: duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: duke@435: case DoubleBot: duke@435: return t; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case DoubleCon: // Double-constant vs Double-constant? duke@435: if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet) duke@435: return DOUBLE; // Return generic double duke@435: case Top: duke@435: case DoubleTop: duke@435: break; duke@435: } duke@435: return this; // Return the double constant duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: symmetric duke@435: const Type *TypeD::xdual() const { duke@435: return this; duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeD::eq( const Type *t ) const { duke@435: if( g_isnan(_d) || duke@435: g_isnan(t->getd()) ) { duke@435: // One or both are NANs. If both are NANs return true, else false. duke@435: return (g_isnan(_d) && g_isnan(t->getd())); duke@435: } duke@435: if (_d == t->getd()) { duke@435: // (NaN is impossible at this point, since it is not equal even to itself) duke@435: if (_d == 0.0) { duke@435: // difference between positive and negative zero duke@435: if (jlong_cast(_d) != jlong_cast(t->getd())) return false; duke@435: } duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeD::hash(void) const { duke@435: return *(int*)(&_d); duke@435: } duke@435: duke@435: //------------------------------is_finite-------------------------------------- duke@435: // Has a finite value duke@435: bool TypeD::is_finite() const { duke@435: return g_isfinite(getd()) != 0; duke@435: } duke@435: duke@435: //------------------------------is_nan----------------------------------------- duke@435: // Is not a number (NaN) duke@435: bool TypeD::is_nan() const { duke@435: return g_isnan(getd()) != 0; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump double constant Type duke@435: #ifndef PRODUCT duke@435: void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: Type::dump2(d,depth,st); duke@435: st->print("%f", _d); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants (Ldi nodes). Singletons are integer, float or double constants duke@435: // or a single symbol. duke@435: bool TypeD::singleton(void) const { duke@435: return true; // Always a singleton duke@435: } duke@435: duke@435: bool TypeD::empty(void) const { duke@435: return false; // always exactly a singleton duke@435: } duke@435: duke@435: //============================================================================= duke@435: // Convience common pre-built types. duke@435: const TypeInt *TypeInt::MINUS_1;// -1 duke@435: const TypeInt *TypeInt::ZERO; // 0 duke@435: const TypeInt *TypeInt::ONE; // 1 duke@435: const TypeInt *TypeInt::BOOL; // 0 or 1, FALSE or TRUE. duke@435: const TypeInt *TypeInt::CC; // -1,0 or 1, condition codes duke@435: const TypeInt *TypeInt::CC_LT; // [-1] == MINUS_1 duke@435: const TypeInt *TypeInt::CC_GT; // [1] == ONE duke@435: const TypeInt *TypeInt::CC_EQ; // [0] == ZERO duke@435: const TypeInt *TypeInt::CC_LE; // [-1,0] duke@435: const TypeInt *TypeInt::CC_GE; // [0,1] == BOOL (!) duke@435: const TypeInt *TypeInt::BYTE; // Bytes, -128 to 127 twisti@1059: const TypeInt *TypeInt::UBYTE; // Unsigned Bytes, 0 to 255 duke@435: const TypeInt *TypeInt::CHAR; // Java chars, 0-65535 duke@435: const TypeInt *TypeInt::SHORT; // Java shorts, -32768-32767 duke@435: const TypeInt *TypeInt::POS; // Positive 32-bit integers or zero duke@435: const TypeInt *TypeInt::POS1; // Positive 32-bit integers duke@435: const TypeInt *TypeInt::INT; // 32-bit integers duke@435: const TypeInt *TypeInt::SYMINT; // symmetric range [-max_jint..max_jint] rbackman@6375: const TypeInt *TypeInt::TYPE_DOMAIN; // alias for TypeInt::INT duke@435: duke@435: //------------------------------TypeInt---------------------------------------- duke@435: TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) { duke@435: } duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeInt *TypeInt::make( jint lo ) { duke@435: return (TypeInt*)(new TypeInt(lo,lo,WidenMin))->hashcons(); duke@435: } duke@435: kvn@1975: static int normalize_int_widen( jint lo, jint hi, int w ) { duke@435: // Certain normalizations keep us sane when comparing types. duke@435: // The 'SMALLINT' covers constants and also CC and its relatives. duke@435: if (lo <= hi) { kvn@1975: if ((juint)(hi - lo) <= SMALLINT) w = Type::WidenMin; kvn@1975: if ((juint)(hi - lo) >= max_juint) w = Type::WidenMax; // TypeInt::INT kvn@1975: } else { kvn@1975: if ((juint)(lo - hi) <= SMALLINT) w = Type::WidenMin; kvn@1975: if ((juint)(lo - hi) >= max_juint) w = Type::WidenMin; // dual TypeInt::INT duke@435: } kvn@1975: return w; kvn@1975: } kvn@1975: kvn@1975: const TypeInt *TypeInt::make( jint lo, jint hi, int w ) { kvn@1975: w = normalize_int_widen(lo, hi, w); duke@435: return (TypeInt*)(new TypeInt(lo,hi,w))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type representation object duke@435: // with reference count equal to the number of Types pointing at it. duke@435: // Caller should wrap a Types around it. duke@435: const Type *TypeInt::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type? duke@435: duke@435: // Currently "this->_base" is a TypeInt duke@435: switch (t->base()) { // Switch on original type duke@435: case AnyPtr: // Mixing with oops happens when javac duke@435: case RawPtr: // reuses local variables duke@435: case OopPtr: duke@435: case InstPtr: coleenp@4037: case AryPtr: coleenp@4037: case MetadataPtr: duke@435: case KlassPtr: never@618: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Long: duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: case Top: // No change duke@435: return this; duke@435: case Int: // Int vs Int? duke@435: break; duke@435: } duke@435: duke@435: // Expand covered set duke@435: const TypeInt *r = t->is_int(); kvn@1975: return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ); duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: reverse hi & lo; flip widen duke@435: const Type *TypeInt::xdual() const { kvn@1975: int w = normalize_int_widen(_hi,_lo, WidenMax-_widen); kvn@1975: return new TypeInt(_hi,_lo,w); duke@435: } duke@435: duke@435: //------------------------------widen------------------------------------------ duke@435: // Only happens for optimistic top-down optimizations. never@1444: const Type *TypeInt::widen( const Type *old, const Type* limit ) const { duke@435: // Coming from TOP or such; no widening duke@435: if( old->base() != Int ) return this; duke@435: const TypeInt *ot = old->is_int(); duke@435: duke@435: // If new guy is equal to old guy, no widening duke@435: if( _lo == ot->_lo && _hi == ot->_hi ) duke@435: return old; duke@435: duke@435: // If new guy contains old, then we widened duke@435: if( _lo <= ot->_lo && _hi >= ot->_hi ) { duke@435: // New contains old duke@435: // If new guy is already wider than old, no widening duke@435: if( _widen > ot->_widen ) return this; duke@435: // If old guy was a constant, do not bother duke@435: if (ot->_lo == ot->_hi) return this; duke@435: // Now widen new guy. duke@435: // Check for widening too far duke@435: if (_widen == WidenMax) { never@1444: int max = max_jint; never@1444: int min = min_jint; never@1444: if (limit->isa_int()) { never@1444: max = limit->is_int()->_hi; never@1444: min = limit->is_int()->_lo; never@1444: } never@1444: if (min < _lo && _hi < max) { duke@435: // If neither endpoint is extremal yet, push out the endpoint duke@435: // which is closer to its respective limit. duke@435: if (_lo >= 0 || // easy common case never@1444: (juint)(_lo - min) >= (juint)(max - _hi)) { duke@435: // Try to widen to an unsigned range type of 31 bits: never@1444: return make(_lo, max, WidenMax); duke@435: } else { never@1444: return make(min, _hi, WidenMax); duke@435: } duke@435: } duke@435: return TypeInt::INT; duke@435: } duke@435: // Returned widened new guy duke@435: return make(_lo,_hi,_widen+1); duke@435: } duke@435: duke@435: // If old guy contains new, then we probably widened too far & dropped to duke@435: // bottom. Return the wider fellow. duke@435: if ( ot->_lo <= _lo && ot->_hi >= _hi ) duke@435: return old; duke@435: duke@435: //fatal("Integer value range is not subset"); duke@435: //return this; duke@435: return TypeInt::INT; duke@435: } duke@435: duke@435: //------------------------------narrow--------------------------------------- duke@435: // Only happens for pessimistic optimizations. duke@435: const Type *TypeInt::narrow( const Type *old ) const { duke@435: if (_lo >= _hi) return this; // already narrow enough duke@435: if (old == NULL) return this; duke@435: const TypeInt* ot = old->isa_int(); duke@435: if (ot == NULL) return this; duke@435: jint olo = ot->_lo; duke@435: jint ohi = ot->_hi; duke@435: duke@435: // If new guy is equal to old guy, no narrowing duke@435: if (_lo == olo && _hi == ohi) return old; duke@435: duke@435: // If old guy was maximum range, allow the narrowing duke@435: if (olo == min_jint && ohi == max_jint) return this; duke@435: duke@435: if (_lo < olo || _hi > ohi) duke@435: return this; // doesn't narrow; pretty wierd duke@435: duke@435: // The new type narrows the old type, so look for a "death march". duke@435: // See comments on PhaseTransform::saturate. duke@435: juint nrange = _hi - _lo; duke@435: juint orange = ohi - olo; duke@435: if (nrange < max_juint - 1 && nrange > (orange >> 1) + (SMALLINT*2)) { duke@435: // Use the new type only if the range shrinks a lot. duke@435: // We do not want the optimizer computing 2^31 point by point. duke@435: return old; duke@435: } duke@435: duke@435: return this; duke@435: } duke@435: duke@435: //-----------------------------filter------------------------------------------ roland@6313: const Type *TypeInt::filter_helper(const Type *kills, bool include_speculative) const { roland@6313: const TypeInt* ft = join_helper(kills, include_speculative)->isa_int(); kvn@1975: if (ft == NULL || ft->empty()) duke@435: return Type::TOP; // Canonical empty value duke@435: if (ft->_widen < this->_widen) { duke@435: // Do not allow the value of kill->_widen to affect the outcome. duke@435: // The widen bits must be allowed to run freely through the graph. duke@435: ft = TypeInt::make(ft->_lo, ft->_hi, this->_widen); duke@435: } duke@435: return ft; duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeInt::eq( const Type *t ) const { duke@435: const TypeInt *r = t->is_int(); // Handy access duke@435: return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen; duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeInt::hash(void) const { duke@435: return _lo+_hi+_widen+(int)Type::Int; duke@435: } duke@435: duke@435: //------------------------------is_finite-------------------------------------- duke@435: // Has a finite value duke@435: bool TypeInt::is_finite() const { duke@435: return true; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump TypeInt duke@435: #ifndef PRODUCT duke@435: static const char* intname(char* buf, jint n) { duke@435: if (n == min_jint) duke@435: return "min"; duke@435: else if (n < min_jint + 10000) duke@435: sprintf(buf, "min+" INT32_FORMAT, n - min_jint); duke@435: else if (n == max_jint) duke@435: return "max"; duke@435: else if (n > max_jint - 10000) duke@435: sprintf(buf, "max-" INT32_FORMAT, max_jint - n); duke@435: else duke@435: sprintf(buf, INT32_FORMAT, n); duke@435: return buf; duke@435: } duke@435: duke@435: void TypeInt::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: char buf[40], buf2[40]; duke@435: if (_lo == min_jint && _hi == max_jint) duke@435: st->print("int"); duke@435: else if (is_con()) duke@435: st->print("int:%s", intname(buf, get_con())); duke@435: else if (_lo == BOOL->_lo && _hi == BOOL->_hi) duke@435: st->print("bool"); duke@435: else if (_lo == BYTE->_lo && _hi == BYTE->_hi) duke@435: st->print("byte"); duke@435: else if (_lo == CHAR->_lo && _hi == CHAR->_hi) duke@435: st->print("char"); duke@435: else if (_lo == SHORT->_lo && _hi == SHORT->_hi) duke@435: st->print("short"); duke@435: else if (_hi == max_jint) duke@435: st->print("int:>=%s", intname(buf, _lo)); duke@435: else if (_lo == min_jint) duke@435: st->print("int:<=%s", intname(buf, _hi)); duke@435: else duke@435: st->print("int:%s..%s", intname(buf, _lo), intname(buf2, _hi)); duke@435: duke@435: if (_widen != 0 && this != TypeInt::INT) duke@435: st->print(":%.*s", _widen, "wwww"); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants. duke@435: bool TypeInt::singleton(void) const { duke@435: return _lo >= _hi; duke@435: } duke@435: duke@435: bool TypeInt::empty(void) const { duke@435: return _lo > _hi; duke@435: } duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypeLong *TypeLong::MINUS_1;// -1 duke@435: const TypeLong *TypeLong::ZERO; // 0 duke@435: const TypeLong *TypeLong::ONE; // 1 duke@435: const TypeLong *TypeLong::POS; // >=0 duke@435: const TypeLong *TypeLong::LONG; // 64-bit integers duke@435: const TypeLong *TypeLong::INT; // 32-bit subrange duke@435: const TypeLong *TypeLong::UINT; // 32-bit unsigned subrange rbackman@6375: const TypeLong *TypeLong::TYPE_DOMAIN; // alias for TypeLong::LONG duke@435: duke@435: //------------------------------TypeLong--------------------------------------- duke@435: TypeLong::TypeLong( jlong lo, jlong hi, int w ) : Type(Long), _lo(lo), _hi(hi), _widen(w) { duke@435: } duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeLong *TypeLong::make( jlong lo ) { duke@435: return (TypeLong*)(new TypeLong(lo,lo,WidenMin))->hashcons(); duke@435: } duke@435: kvn@1975: static int normalize_long_widen( jlong lo, jlong hi, int w ) { kvn@1975: // Certain normalizations keep us sane when comparing types. kvn@1975: // The 'SMALLINT' covers constants. kvn@1975: if (lo <= hi) { kvn@1975: if ((julong)(hi - lo) <= SMALLINT) w = Type::WidenMin; kvn@1975: if ((julong)(hi - lo) >= max_julong) w = Type::WidenMax; // TypeLong::LONG kvn@1975: } else { kvn@1975: if ((julong)(lo - hi) <= SMALLINT) w = Type::WidenMin; kvn@1975: if ((julong)(lo - hi) >= max_julong) w = Type::WidenMin; // dual TypeLong::LONG kvn@1975: } kvn@1975: return w; kvn@1975: } kvn@1975: duke@435: const TypeLong *TypeLong::make( jlong lo, jlong hi, int w ) { kvn@1975: w = normalize_long_widen(lo, hi, w); duke@435: return (TypeLong*)(new TypeLong(lo,hi,w))->hashcons(); duke@435: } duke@435: duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type representation object duke@435: // with reference count equal to the number of Types pointing at it. duke@435: // Caller should wrap a Types around it. duke@435: const Type *TypeLong::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type? duke@435: duke@435: // Currently "this->_base" is a TypeLong duke@435: switch (t->base()) { // Switch on original type duke@435: case AnyPtr: // Mixing with oops happens when javac duke@435: case RawPtr: // reuses local variables duke@435: case OopPtr: duke@435: case InstPtr: coleenp@4037: case AryPtr: coleenp@4037: case MetadataPtr: duke@435: case KlassPtr: never@618: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Int: duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: case Top: // No change duke@435: return this; duke@435: case Long: // Long vs Long? duke@435: break; duke@435: } duke@435: duke@435: // Expand covered set duke@435: const TypeLong *r = t->is_long(); // Turn into a TypeLong kvn@1975: return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ); duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: reverse hi & lo; flip widen duke@435: const Type *TypeLong::xdual() const { kvn@1975: int w = normalize_long_widen(_hi,_lo, WidenMax-_widen); kvn@1975: return new TypeLong(_hi,_lo,w); duke@435: } duke@435: duke@435: //------------------------------widen------------------------------------------ duke@435: // Only happens for optimistic top-down optimizations. never@1444: const Type *TypeLong::widen( const Type *old, const Type* limit ) const { duke@435: // Coming from TOP or such; no widening duke@435: if( old->base() != Long ) return this; duke@435: const TypeLong *ot = old->is_long(); duke@435: duke@435: // If new guy is equal to old guy, no widening duke@435: if( _lo == ot->_lo && _hi == ot->_hi ) duke@435: return old; duke@435: duke@435: // If new guy contains old, then we widened duke@435: if( _lo <= ot->_lo && _hi >= ot->_hi ) { duke@435: // New contains old duke@435: // If new guy is already wider than old, no widening duke@435: if( _widen > ot->_widen ) return this; duke@435: // If old guy was a constant, do not bother duke@435: if (ot->_lo == ot->_hi) return this; duke@435: // Now widen new guy. duke@435: // Check for widening too far duke@435: if (_widen == WidenMax) { never@1444: jlong max = max_jlong; never@1444: jlong min = min_jlong; never@1444: if (limit->isa_long()) { never@1444: max = limit->is_long()->_hi; never@1444: min = limit->is_long()->_lo; never@1444: } never@1444: if (min < _lo && _hi < max) { duke@435: // If neither endpoint is extremal yet, push out the endpoint duke@435: // which is closer to its respective limit. duke@435: if (_lo >= 0 || // easy common case never@1444: (julong)(_lo - min) >= (julong)(max - _hi)) { duke@435: // Try to widen to an unsigned range type of 32/63 bits: never@1444: if (max >= max_juint && _hi < max_juint) duke@435: return make(_lo, max_juint, WidenMax); duke@435: else never@1444: return make(_lo, max, WidenMax); duke@435: } else { never@1444: return make(min, _hi, WidenMax); duke@435: } duke@435: } duke@435: return TypeLong::LONG; duke@435: } duke@435: // Returned widened new guy duke@435: return make(_lo,_hi,_widen+1); duke@435: } duke@435: duke@435: // If old guy contains new, then we probably widened too far & dropped to duke@435: // bottom. Return the wider fellow. duke@435: if ( ot->_lo <= _lo && ot->_hi >= _hi ) duke@435: return old; duke@435: duke@435: // fatal("Long value range is not subset"); duke@435: // return this; duke@435: return TypeLong::LONG; duke@435: } duke@435: duke@435: //------------------------------narrow---------------------------------------- duke@435: // Only happens for pessimistic optimizations. duke@435: const Type *TypeLong::narrow( const Type *old ) const { duke@435: if (_lo >= _hi) return this; // already narrow enough duke@435: if (old == NULL) return this; duke@435: const TypeLong* ot = old->isa_long(); duke@435: if (ot == NULL) return this; duke@435: jlong olo = ot->_lo; duke@435: jlong ohi = ot->_hi; duke@435: duke@435: // If new guy is equal to old guy, no narrowing duke@435: if (_lo == olo && _hi == ohi) return old; duke@435: duke@435: // If old guy was maximum range, allow the narrowing duke@435: if (olo == min_jlong && ohi == max_jlong) return this; duke@435: duke@435: if (_lo < olo || _hi > ohi) duke@435: return this; // doesn't narrow; pretty wierd duke@435: duke@435: // The new type narrows the old type, so look for a "death march". duke@435: // See comments on PhaseTransform::saturate. duke@435: julong nrange = _hi - _lo; duke@435: julong orange = ohi - olo; duke@435: if (nrange < max_julong - 1 && nrange > (orange >> 1) + (SMALLINT*2)) { duke@435: // Use the new type only if the range shrinks a lot. duke@435: // We do not want the optimizer computing 2^31 point by point. duke@435: return old; duke@435: } duke@435: duke@435: return this; duke@435: } duke@435: duke@435: //-----------------------------filter------------------------------------------ roland@6313: const Type *TypeLong::filter_helper(const Type *kills, bool include_speculative) const { roland@6313: const TypeLong* ft = join_helper(kills, include_speculative)->isa_long(); kvn@1975: if (ft == NULL || ft->empty()) duke@435: return Type::TOP; // Canonical empty value duke@435: if (ft->_widen < this->_widen) { duke@435: // Do not allow the value of kill->_widen to affect the outcome. duke@435: // The widen bits must be allowed to run freely through the graph. duke@435: ft = TypeLong::make(ft->_lo, ft->_hi, this->_widen); duke@435: } duke@435: return ft; duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeLong::eq( const Type *t ) const { duke@435: const TypeLong *r = t->is_long(); // Handy access duke@435: return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen; duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeLong::hash(void) const { duke@435: return (int)(_lo+_hi+_widen+(int)Type::Long); duke@435: } duke@435: duke@435: //------------------------------is_finite-------------------------------------- duke@435: // Has a finite value duke@435: bool TypeLong::is_finite() const { duke@435: return true; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump TypeLong duke@435: #ifndef PRODUCT duke@435: static const char* longnamenear(jlong x, const char* xname, char* buf, jlong n) { duke@435: if (n > x) { duke@435: if (n >= x + 10000) return NULL; hseigel@4465: sprintf(buf, "%s+" JLONG_FORMAT, xname, n - x); duke@435: } else if (n < x) { duke@435: if (n <= x - 10000) return NULL; hseigel@4465: sprintf(buf, "%s-" JLONG_FORMAT, xname, x - n); duke@435: } else { duke@435: return xname; duke@435: } duke@435: return buf; duke@435: } duke@435: duke@435: static const char* longname(char* buf, jlong n) { duke@435: const char* str; duke@435: if (n == min_jlong) duke@435: return "min"; duke@435: else if (n < min_jlong + 10000) hseigel@4465: sprintf(buf, "min+" JLONG_FORMAT, n - min_jlong); duke@435: else if (n == max_jlong) duke@435: return "max"; duke@435: else if (n > max_jlong - 10000) hseigel@4465: sprintf(buf, "max-" JLONG_FORMAT, max_jlong - n); duke@435: else if ((str = longnamenear(max_juint, "maxuint", buf, n)) != NULL) duke@435: return str; duke@435: else if ((str = longnamenear(max_jint, "maxint", buf, n)) != NULL) duke@435: return str; duke@435: else if ((str = longnamenear(min_jint, "minint", buf, n)) != NULL) duke@435: return str; duke@435: else hseigel@4465: sprintf(buf, JLONG_FORMAT, n); duke@435: return buf; duke@435: } duke@435: duke@435: void TypeLong::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: char buf[80], buf2[80]; duke@435: if (_lo == min_jlong && _hi == max_jlong) duke@435: st->print("long"); duke@435: else if (is_con()) duke@435: st->print("long:%s", longname(buf, get_con())); duke@435: else if (_hi == max_jlong) duke@435: st->print("long:>=%s", longname(buf, _lo)); duke@435: else if (_lo == min_jlong) duke@435: st->print("long:<=%s", longname(buf, _hi)); duke@435: else duke@435: st->print("long:%s..%s", longname(buf, _lo), longname(buf2, _hi)); duke@435: duke@435: if (_widen != 0 && this != TypeLong::LONG) duke@435: st->print(":%.*s", _widen, "wwww"); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants duke@435: bool TypeLong::singleton(void) const { duke@435: return _lo >= _hi; duke@435: } duke@435: duke@435: bool TypeLong::empty(void) const { duke@435: return _lo > _hi; duke@435: } duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable duke@435: const TypeTuple *TypeTuple::IFFALSE; duke@435: const TypeTuple *TypeTuple::IFTRUE; duke@435: const TypeTuple *TypeTuple::IFNEITHER; duke@435: const TypeTuple *TypeTuple::LOOPBODY; duke@435: const TypeTuple *TypeTuple::MEMBAR; duke@435: const TypeTuple *TypeTuple::STORECONDITIONAL; duke@435: const TypeTuple *TypeTuple::START_I2C; duke@435: const TypeTuple *TypeTuple::INT_PAIR; duke@435: const TypeTuple *TypeTuple::LONG_PAIR; rbackman@5791: const TypeTuple *TypeTuple::INT_CC_PAIR; rbackman@5997: const TypeTuple *TypeTuple::LONG_CC_PAIR; duke@435: duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: // Make a TypeTuple from the range of a method signature duke@435: const TypeTuple *TypeTuple::make_range(ciSignature* sig) { duke@435: ciType* return_type = sig->return_type(); duke@435: uint total_fields = TypeFunc::Parms + return_type->size(); duke@435: const Type **field_array = fields(total_fields); duke@435: switch (return_type->basic_type()) { duke@435: case T_LONG: duke@435: field_array[TypeFunc::Parms] = TypeLong::LONG; duke@435: field_array[TypeFunc::Parms+1] = Type::HALF; duke@435: break; duke@435: case T_DOUBLE: duke@435: field_array[TypeFunc::Parms] = Type::DOUBLE; duke@435: field_array[TypeFunc::Parms+1] = Type::HALF; duke@435: break; duke@435: case T_OBJECT: duke@435: case T_ARRAY: duke@435: case T_BOOLEAN: duke@435: case T_CHAR: duke@435: case T_FLOAT: duke@435: case T_BYTE: duke@435: case T_SHORT: duke@435: case T_INT: duke@435: field_array[TypeFunc::Parms] = get_const_type(return_type); duke@435: break; duke@435: case T_VOID: duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons(); duke@435: } duke@435: duke@435: // Make a TypeTuple from the domain of a method signature duke@435: const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig) { duke@435: uint total_fields = TypeFunc::Parms + sig->size(); duke@435: duke@435: uint pos = TypeFunc::Parms; duke@435: const Type **field_array; duke@435: if (recv != NULL) { duke@435: total_fields++; duke@435: field_array = fields(total_fields); duke@435: // Use get_const_type here because it respects UseUniqueSubclasses: roland@6313: field_array[pos++] = get_const_type(recv)->join_speculative(TypePtr::NOTNULL); duke@435: } else { duke@435: field_array = fields(total_fields); duke@435: } duke@435: duke@435: int i = 0; duke@435: while (pos < total_fields) { duke@435: ciType* type = sig->type_at(i); duke@435: duke@435: switch (type->basic_type()) { duke@435: case T_LONG: duke@435: field_array[pos++] = TypeLong::LONG; duke@435: field_array[pos++] = Type::HALF; duke@435: break; duke@435: case T_DOUBLE: duke@435: field_array[pos++] = Type::DOUBLE; duke@435: field_array[pos++] = Type::HALF; duke@435: break; duke@435: case T_OBJECT: duke@435: case T_ARRAY: duke@435: case T_BOOLEAN: duke@435: case T_CHAR: duke@435: case T_FLOAT: duke@435: case T_BYTE: duke@435: case T_SHORT: duke@435: case T_INT: duke@435: field_array[pos++] = get_const_type(type); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: i++; duke@435: } duke@435: return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons(); duke@435: } duke@435: duke@435: const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) { duke@435: return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------fields----------------------------------------- duke@435: // Subroutine call type with space allocated for argument types duke@435: const Type **TypeTuple::fields( uint arg_cnt ) { duke@435: const Type **flds = (const Type **)(Compile::current()->type_arena()->Amalloc_4((TypeFunc::Parms+arg_cnt)*sizeof(Type*) )); duke@435: flds[TypeFunc::Control ] = Type::CONTROL; duke@435: flds[TypeFunc::I_O ] = Type::ABIO; duke@435: flds[TypeFunc::Memory ] = Type::MEMORY; duke@435: flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM; duke@435: flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS; duke@435: duke@435: return flds; duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *TypeTuple::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is Tuple duke@435: switch (t->base()) { // switch on original type duke@435: duke@435: case Bottom: // Ye Olde Default duke@435: return t; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case Tuple: { // Meeting 2 signatures? duke@435: const TypeTuple *x = t->is_tuple(); duke@435: assert( _cnt == x->_cnt, "" ); duke@435: const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) )); duke@435: for( uint i=0; i<_cnt; i++ ) duke@435: fields[i] = field_at(i)->xmeet( x->field_at(i) ); duke@435: return TypeTuple::make(_cnt,fields); duke@435: } duke@435: case Top: duke@435: break; duke@435: } duke@435: return this; // Return the double constant duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: compute field-by-field dual duke@435: const Type *TypeTuple::xdual() const { duke@435: const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) )); duke@435: for( uint i=0; i<_cnt; i++ ) duke@435: fields[i] = _fields[i]->dual(); duke@435: return new TypeTuple(_cnt,fields); duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeTuple::eq( const Type *t ) const { duke@435: const TypeTuple *s = (const TypeTuple *)t; duke@435: if (_cnt != s->_cnt) return false; // Unequal field counts duke@435: for (uint i = 0; i < _cnt; i++) duke@435: if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION! duke@435: return false; // Missed duke@435: return true; duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeTuple::hash(void) const { duke@435: intptr_t sum = _cnt; duke@435: for( uint i=0; i<_cnt; i++ ) duke@435: sum += (intptr_t)_fields[i]; // Hash on pointers directly duke@435: return sum; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump signature Type duke@435: #ifndef PRODUCT duke@435: void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: st->print("{"); duke@435: if( !depth || d[this] ) { // Check for recursive print duke@435: st->print("...}"); duke@435: return; duke@435: } duke@435: d.Insert((void*)this, (void*)this); // Stop recursion duke@435: if( _cnt ) { duke@435: uint i; duke@435: for( i=0; i<_cnt-1; i++ ) { duke@435: st->print("%d:", i); duke@435: _fields[i]->dump2(d, depth-1, st); duke@435: st->print(", "); duke@435: } duke@435: st->print("%d:", i); duke@435: _fields[i]->dump2(d, depth-1, st); duke@435: } duke@435: st->print("}"); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants (Ldi nodes). Singletons are integer, float or double constants duke@435: // or a single symbol. duke@435: bool TypeTuple::singleton(void) const { duke@435: return false; // Never a singleton duke@435: } duke@435: duke@435: bool TypeTuple::empty(void) const { duke@435: for( uint i=0; i<_cnt; i++ ) { duke@435: if (_fields[i]->empty()) return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: duke@435: inline const TypeInt* normalize_array_size(const TypeInt* size) { duke@435: // Certain normalizations keep us sane when comparing types. duke@435: // We do not want arrayOop variables to differ only by the wideness duke@435: // of their index types. Pick minimum wideness, since that is the duke@435: // forced wideness of small ranges anyway. duke@435: if (size->_widen != Type::WidenMin) duke@435: return TypeInt::make(size->_lo, size->_hi, Type::WidenMin); duke@435: else duke@435: return size; duke@435: } duke@435: duke@435: //------------------------------make------------------------------------------- vlivanov@5658: const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable) { coleenp@548: if (UseCompressedOops && elem->isa_oopptr()) { kvn@656: elem = elem->make_narrowoop(); coleenp@548: } duke@435: size = normalize_array_size(size); vlivanov@5658: return (TypeAry*)(new TypeAry(elem,size,stable))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *TypeAry::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is Ary duke@435: switch (t->base()) { // switch on original type duke@435: duke@435: case Bottom: // Ye Olde Default duke@435: return t; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case Array: { // Meeting 2 arrays? duke@435: const TypeAry *a = t->is_ary(); roland@6313: return TypeAry::make(_elem->meet_speculative(a->_elem), vlivanov@5658: _size->xmeet(a->_size)->is_int(), vlivanov@5658: _stable & a->_stable); duke@435: } duke@435: case Top: duke@435: break; duke@435: } duke@435: return this; // Return the double constant duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: compute field-by-field dual duke@435: const Type *TypeAry::xdual() const { duke@435: const TypeInt* size_dual = _size->dual()->is_int(); duke@435: size_dual = normalize_array_size(size_dual); vlivanov@5658: return new TypeAry(_elem->dual(), size_dual, !_stable); duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeAry::eq( const Type *t ) const { duke@435: const TypeAry *a = (const TypeAry*)t; duke@435: return _elem == a->_elem && vlivanov@5658: _stable == a->_stable && duke@435: _size == a->_size; duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeAry::hash(void) const { vlivanov@5658: return (intptr_t)_elem + (intptr_t)_size + (_stable ? 43 : 0); duke@435: } duke@435: roland@6313: /** roland@6313: * Return same type without a speculative part in the element roland@6313: */ roland@6313: const Type* TypeAry::remove_speculative() const { roland@6313: return make(_elem->remove_speculative(), _size, _stable); roland@6313: } roland@6313: kvn@1255: //----------------------interface_vs_oop--------------------------------------- kvn@1255: #ifdef ASSERT kvn@1255: bool TypeAry::interface_vs_oop(const Type *t) const { kvn@1255: const TypeAry* t_ary = t->is_ary(); kvn@1255: if (t_ary) { kvn@1255: return _elem->interface_vs_oop(t_ary->_elem); kvn@1255: } kvn@1255: return false; kvn@1255: } kvn@1255: #endif kvn@1255: duke@435: //------------------------------dump2------------------------------------------ duke@435: #ifndef PRODUCT duke@435: void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const { vlivanov@5658: if (_stable) st->print("stable:"); duke@435: _elem->dump2(d, depth, st); duke@435: st->print("["); duke@435: _size->dump2(d, depth, st); duke@435: st->print("]"); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants (Ldi nodes). Singletons are integer, float or double constants duke@435: // or a single symbol. duke@435: bool TypeAry::singleton(void) const { duke@435: return false; // Never a singleton duke@435: } duke@435: duke@435: bool TypeAry::empty(void) const { duke@435: return _elem->empty() || _size->empty(); duke@435: } duke@435: duke@435: //--------------------------ary_must_be_exact---------------------------------- duke@435: bool TypeAry::ary_must_be_exact() const { duke@435: if (!UseExactTypes) return false; duke@435: // This logic looks at the element type of an array, and returns true duke@435: // if the element type is either a primitive or a final instance class. duke@435: // In such cases, an array built on this ary must have no subclasses. duke@435: if (_elem == BOTTOM) return false; // general array not exact duke@435: if (_elem == TOP ) return false; // inverted general array not exact coleenp@548: const TypeOopPtr* toop = NULL; kvn@656: if (UseCompressedOops && _elem->isa_narrowoop()) { kvn@656: toop = _elem->make_ptr()->isa_oopptr(); coleenp@548: } else { coleenp@548: toop = _elem->isa_oopptr(); coleenp@548: } duke@435: if (!toop) return true; // a primitive type, like int duke@435: ciKlass* tklass = toop->klass(); duke@435: if (tklass == NULL) return false; // unloaded class duke@435: if (!tklass->is_loaded()) return false; // unloaded class coleenp@548: const TypeInstPtr* tinst; coleenp@548: if (_elem->isa_narrowoop()) kvn@656: tinst = _elem->make_ptr()->isa_instptr(); coleenp@548: else coleenp@548: tinst = _elem->isa_instptr(); kvn@656: if (tinst) kvn@656: return tklass->as_instance_klass()->is_final(); coleenp@548: const TypeAryPtr* tap; coleenp@548: if (_elem->isa_narrowoop()) kvn@656: tap = _elem->make_ptr()->isa_aryptr(); coleenp@548: else coleenp@548: tap = _elem->isa_aryptr(); kvn@656: if (tap) kvn@656: return tap->ary()->ary_must_be_exact(); duke@435: return false; duke@435: } duke@435: kvn@3882: //==============================TypeVect======================================= kvn@3882: // Convenience common pre-built types. kvn@3882: const TypeVect *TypeVect::VECTS = NULL; // 32-bit vectors kvn@3882: const TypeVect *TypeVect::VECTD = NULL; // 64-bit vectors kvn@3882: const TypeVect *TypeVect::VECTX = NULL; // 128-bit vectors kvn@3882: const TypeVect *TypeVect::VECTY = NULL; // 256-bit vectors kvn@3882: kvn@3882: //------------------------------make------------------------------------------- kvn@3882: const TypeVect* TypeVect::make(const Type *elem, uint length) { kvn@3882: BasicType elem_bt = elem->array_element_basic_type(); kvn@3882: assert(is_java_primitive(elem_bt), "only primitive types in vector"); kvn@3882: assert(length > 1 && is_power_of_2(length), "vector length is power of 2"); kvn@3882: assert(Matcher::vector_size_supported(elem_bt, length), "length in range"); kvn@3882: int size = length * type2aelembytes(elem_bt); kvn@3882: switch (Matcher::vector_ideal_reg(size)) { kvn@3882: case Op_VecS: kvn@3882: return (TypeVect*)(new TypeVectS(elem, length))->hashcons(); goetz@6487: case Op_RegL: kvn@3882: case Op_VecD: kvn@3882: case Op_RegD: kvn@3882: return (TypeVect*)(new TypeVectD(elem, length))->hashcons(); kvn@3882: case Op_VecX: kvn@3882: return (TypeVect*)(new TypeVectX(elem, length))->hashcons(); kvn@3882: case Op_VecY: kvn@3882: return (TypeVect*)(new TypeVectY(elem, length))->hashcons(); kvn@3882: } kvn@3882: ShouldNotReachHere(); kvn@3882: return NULL; kvn@3882: } kvn@3882: kvn@3882: //------------------------------meet------------------------------------------- kvn@3882: // Compute the MEET of two types. It returns a new Type object. kvn@3882: const Type *TypeVect::xmeet( const Type *t ) const { kvn@3882: // Perform a fast test for common case; meeting the same types together. kvn@3882: if( this == t ) return this; // Meeting same type-rep? kvn@3882: kvn@3882: // Current "this->_base" is Vector kvn@3882: switch (t->base()) { // switch on original type kvn@3882: kvn@3882: case Bottom: // Ye Olde Default kvn@3882: return t; kvn@3882: kvn@3882: default: // All else is a mistake kvn@3882: typerr(t); kvn@3882: kvn@3882: case VectorS: kvn@3882: case VectorD: kvn@3882: case VectorX: kvn@3882: case VectorY: { // Meeting 2 vectors? kvn@3882: const TypeVect* v = t->is_vect(); kvn@3882: assert( base() == v->base(), ""); kvn@3882: assert(length() == v->length(), ""); kvn@3882: assert(element_basic_type() == v->element_basic_type(), ""); kvn@3882: return TypeVect::make(_elem->xmeet(v->_elem), _length); kvn@3882: } kvn@3882: case Top: kvn@3882: break; kvn@3882: } kvn@3882: return this; kvn@3882: } kvn@3882: kvn@3882: //------------------------------xdual------------------------------------------ kvn@3882: // Dual: compute field-by-field dual kvn@3882: const Type *TypeVect::xdual() const { kvn@3882: return new TypeVect(base(), _elem->dual(), _length); kvn@3882: } kvn@3882: kvn@3882: //------------------------------eq--------------------------------------------- kvn@3882: // Structural equality check for Type representations kvn@3882: bool TypeVect::eq(const Type *t) const { kvn@3882: const TypeVect *v = t->is_vect(); kvn@3882: return (_elem == v->_elem) && (_length == v->_length); kvn@3882: } kvn@3882: kvn@3882: //------------------------------hash------------------------------------------- kvn@3882: // Type-specific hashing function. kvn@3882: int TypeVect::hash(void) const { kvn@3882: return (intptr_t)_elem + (intptr_t)_length; kvn@3882: } kvn@3882: kvn@3882: //------------------------------singleton-------------------------------------- kvn@3882: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple kvn@3882: // constants (Ldi nodes). Vector is singleton if all elements are the same kvn@3882: // constant value (when vector is created with Replicate code). kvn@3882: bool TypeVect::singleton(void) const { kvn@3882: // There is no Con node for vectors yet. kvn@3882: // return _elem->singleton(); kvn@3882: return false; kvn@3882: } kvn@3882: kvn@3882: bool TypeVect::empty(void) const { kvn@3882: return _elem->empty(); kvn@3882: } kvn@3882: kvn@3882: //------------------------------dump2------------------------------------------ kvn@3882: #ifndef PRODUCT kvn@3882: void TypeVect::dump2(Dict &d, uint depth, outputStream *st) const { kvn@3882: switch (base()) { kvn@3882: case VectorS: kvn@3882: st->print("vectors["); break; kvn@3882: case VectorD: kvn@3882: st->print("vectord["); break; kvn@3882: case VectorX: kvn@3882: st->print("vectorx["); break; kvn@3882: case VectorY: kvn@3882: st->print("vectory["); break; kvn@3882: default: kvn@3882: ShouldNotReachHere(); kvn@3882: } kvn@3882: st->print("%d]:{", _length); kvn@3882: _elem->dump2(d, depth, st); kvn@3882: st->print("}"); kvn@3882: } kvn@3882: #endif kvn@3882: kvn@3882: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypePtr *TypePtr::NULL_PTR; duke@435: const TypePtr *TypePtr::NOTNULL; duke@435: const TypePtr *TypePtr::BOTTOM; duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Meet over the PTR enum duke@435: const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = { duke@435: // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, duke@435: { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,}, duke@435: { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,}, duke@435: { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,}, duke@435: { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,}, duke@435: { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,}, duke@435: { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,} duke@435: }; duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypePtr *TypePtr::make( TYPES t, enum PTR ptr, int offset ) { duke@435: return (TypePtr*)(new TypePtr(t,ptr,offset))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------cast_to_ptr_type------------------------------- duke@435: const Type *TypePtr::cast_to_ptr_type(PTR ptr) const { duke@435: assert(_base == AnyPtr, "subclass must override cast_to_ptr_type"); duke@435: if( ptr == _ptr ) return this; duke@435: return make(_base, ptr, _offset); duke@435: } duke@435: duke@435: //------------------------------get_con---------------------------------------- duke@435: intptr_t TypePtr::get_con() const { duke@435: assert( _ptr == Null, "" ); duke@435: return _offset; duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *TypePtr::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is AnyPtr duke@435: switch (t->base()) { // switch on original type duke@435: case Int: // Mixing ints & oops happens when javac duke@435: case Long: // reuses local variables duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: coleenp@548: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: case Top: duke@435: return this; duke@435: duke@435: case AnyPtr: { // Meeting to AnyPtrs duke@435: const TypePtr *tp = t->is_ptr(); duke@435: return make( AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()) ); duke@435: } duke@435: case RawPtr: // For these, flip the call around to cut down duke@435: case OopPtr: duke@435: case InstPtr: // on the cases I have to handle. coleenp@4037: case AryPtr: coleenp@4037: case MetadataPtr: duke@435: case KlassPtr: duke@435: return t->xmeet(this); // Call in reverse direction duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: } duke@435: return this; duke@435: } duke@435: duke@435: //------------------------------meet_offset------------------------------------ duke@435: int TypePtr::meet_offset( int offset ) const { duke@435: // Either is 'TOP' offset? Return the other offset! duke@435: if( _offset == OffsetTop ) return offset; duke@435: if( offset == OffsetTop ) return _offset; duke@435: // If either is different, return 'BOTTOM' offset duke@435: if( _offset != offset ) return OffsetBot; duke@435: return _offset; duke@435: } duke@435: duke@435: //------------------------------dual_offset------------------------------------ duke@435: int TypePtr::dual_offset( ) const { duke@435: if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM' duke@435: if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP' duke@435: return _offset; // Map everything else into self duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: compute field-by-field dual duke@435: const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = { duke@435: BotPTR, NotNull, Constant, Null, AnyNull, TopPTR duke@435: }; duke@435: const Type *TypePtr::xdual() const { duke@435: return new TypePtr( AnyPtr, dual_ptr(), dual_offset() ); duke@435: } duke@435: kvn@741: //------------------------------xadd_offset------------------------------------ kvn@741: int TypePtr::xadd_offset( intptr_t offset ) const { kvn@741: // Adding to 'TOP' offset? Return 'TOP'! kvn@741: if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop; kvn@741: // Adding to 'BOTTOM' offset? Return 'BOTTOM'! kvn@741: if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot; kvn@741: // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'! kvn@741: offset += (intptr_t)_offset; kvn@741: if (offset != (int)offset || offset == OffsetTop) return OffsetBot; kvn@741: kvn@741: // assert( _offset >= 0 && _offset+offset >= 0, "" ); kvn@741: // It is possible to construct a negative offset during PhaseCCP kvn@741: kvn@741: return (int)offset; // Sum valid offsets kvn@741: } kvn@741: duke@435: //------------------------------add_offset------------------------------------- kvn@741: const TypePtr *TypePtr::add_offset( intptr_t offset ) const { kvn@741: return make( AnyPtr, _ptr, xadd_offset(offset) ); duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypePtr::eq( const Type *t ) const { duke@435: const TypePtr *a = (const TypePtr*)t; duke@435: return _ptr == a->ptr() && _offset == a->offset(); duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypePtr::hash(void) const { duke@435: return _ptr + _offset; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = { duke@435: "TopPTR","AnyNull","Constant","NULL","NotNull","BotPTR" duke@435: }; duke@435: duke@435: #ifndef PRODUCT duke@435: void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: if( _ptr == Null ) st->print("NULL"); duke@435: else st->print("%s *", ptr_msg[_ptr]); duke@435: if( _offset == OffsetTop ) st->print("+top"); duke@435: else if( _offset == OffsetBot ) st->print("+bot"); duke@435: else if( _offset ) st->print("+%d", _offset); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants duke@435: bool TypePtr::singleton(void) const { duke@435: // TopPTR, Null, AnyNull, Constant are all singletons duke@435: return (_offset != OffsetBot) && !below_centerline(_ptr); duke@435: } duke@435: duke@435: bool TypePtr::empty(void) const { duke@435: return (_offset == OffsetTop) || above_centerline(_ptr); duke@435: } duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypeRawPtr *TypeRawPtr::BOTTOM; duke@435: const TypeRawPtr *TypeRawPtr::NOTNULL; duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) { duke@435: assert( ptr != Constant, "what is the constant?" ); duke@435: assert( ptr != Null, "Use TypePtr for NULL" ); duke@435: return (TypeRawPtr*)(new TypeRawPtr(ptr,0))->hashcons(); duke@435: } duke@435: duke@435: const TypeRawPtr *TypeRawPtr::make( address bits ) { duke@435: assert( bits, "Use TypePtr for NULL" ); duke@435: return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------cast_to_ptr_type------------------------------- duke@435: const Type *TypeRawPtr::cast_to_ptr_type(PTR ptr) const { duke@435: assert( ptr != Constant, "what is the constant?" ); duke@435: assert( ptr != Null, "Use TypePtr for NULL" ); duke@435: assert( _bits==0, "Why cast a constant address?"); duke@435: if( ptr == _ptr ) return this; duke@435: return make(ptr); duke@435: } duke@435: duke@435: //------------------------------get_con---------------------------------------- duke@435: intptr_t TypeRawPtr::get_con() const { duke@435: assert( _ptr == Null || _ptr == Constant, "" ); duke@435: return (intptr_t)_bits; duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *TypeRawPtr::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is RawPtr duke@435: switch( t->base() ) { // switch on original type duke@435: case Bottom: // Ye Olde Default duke@435: return t; duke@435: case Top: duke@435: return this; duke@435: case AnyPtr: // Meeting to AnyPtrs duke@435: break; duke@435: case RawPtr: { // might be top, bot, any/not or constant duke@435: enum PTR tptr = t->is_ptr()->ptr(); duke@435: enum PTR ptr = meet_ptr( tptr ); duke@435: if( ptr == Constant ) { // Cannot be equal constants, so... duke@435: if( tptr == Constant && _ptr != Constant) return t; duke@435: if( _ptr == Constant && tptr != Constant) return this; duke@435: ptr = NotNull; // Fall down in lattice duke@435: } duke@435: return make( ptr ); duke@435: } duke@435: duke@435: case OopPtr: duke@435: case InstPtr: coleenp@4037: case AryPtr: coleenp@4037: case MetadataPtr: duke@435: case KlassPtr: duke@435: return TypePtr::BOTTOM; // Oop meet raw is not well defined duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: } duke@435: duke@435: // Found an AnyPtr type vs self-RawPtr type duke@435: const TypePtr *tp = t->is_ptr(); duke@435: switch (tp->ptr()) { duke@435: case TypePtr::TopPTR: return this; duke@435: case TypePtr::BotPTR: return t; duke@435: case TypePtr::Null: duke@435: if( _ptr == TypePtr::TopPTR ) return t; duke@435: return TypeRawPtr::BOTTOM; duke@435: case TypePtr::NotNull: return TypePtr::make( AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0) ); duke@435: case TypePtr::AnyNull: duke@435: if( _ptr == TypePtr::Constant) return this; duke@435: return make( meet_ptr(TypePtr::AnyNull) ); duke@435: default: ShouldNotReachHere(); duke@435: } duke@435: return this; duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: compute field-by-field dual duke@435: const Type *TypeRawPtr::xdual() const { duke@435: return new TypeRawPtr( dual_ptr(), _bits ); duke@435: } duke@435: duke@435: //------------------------------add_offset------------------------------------- kvn@741: const TypePtr *TypeRawPtr::add_offset( intptr_t offset ) const { duke@435: if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer duke@435: if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer duke@435: if( offset == 0 ) return this; // No change duke@435: switch (_ptr) { duke@435: case TypePtr::TopPTR: duke@435: case TypePtr::BotPTR: duke@435: case TypePtr::NotNull: duke@435: return this; duke@435: case TypePtr::Null: kvn@2435: case TypePtr::Constant: { kvn@2435: address bits = _bits+offset; kvn@2435: if ( bits == 0 ) return TypePtr::NULL_PTR; kvn@2435: return make( bits ); kvn@2435: } duke@435: default: ShouldNotReachHere(); duke@435: } duke@435: return NULL; // Lint noise duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeRawPtr::eq( const Type *t ) const { duke@435: const TypeRawPtr *a = (const TypeRawPtr*)t; duke@435: return _bits == a->_bits && TypePtr::eq(t); duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeRawPtr::hash(void) const { duke@435: return (intptr_t)_bits + TypePtr::hash(); duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: #ifndef PRODUCT duke@435: void TypeRawPtr::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: if( _ptr == Constant ) duke@435: st->print(INTPTR_FORMAT, _bits); duke@435: else duke@435: st->print("rawptr:%s", ptr_msg[_ptr]); duke@435: } duke@435: #endif duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built type. duke@435: const TypeOopPtr *TypeOopPtr::BOTTOM; duke@435: kvn@598: //------------------------------TypeOopPtr------------------------------------- roland@6380: TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, bool xk, ciObject* o, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) kvn@598: : TypePtr(t, ptr, offset), kvn@598: _const_oop(o), _klass(k), kvn@598: _klass_is_exact(xk), kvn@598: _is_ptr_to_narrowoop(false), roland@4159: _is_ptr_to_narrowklass(false), kvn@5110: _is_ptr_to_boxed_value(false), roland@5991: _instance_id(instance_id), roland@6380: _speculative(speculative), roland@6380: _inline_depth(inline_depth){ kvn@5110: if (Compile::current()->eliminate_boxing() && (t == InstPtr) && kvn@5110: (offset > 0) && xk && (k != 0) && k->is_instance_klass()) { kvn@5110: _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset); kvn@5110: } kvn@598: #ifdef _LP64 roland@4159: if (_offset != 0) { coleenp@4037: if (_offset == oopDesc::klass_offset_in_bytes()) { ehelin@5694: _is_ptr_to_narrowklass = UseCompressedClassPointers; coleenp@4037: } else if (klass() == NULL) { coleenp@4037: // Array with unknown body type kvn@598: assert(this->isa_aryptr(), "only arrays without klass"); roland@4159: _is_ptr_to_narrowoop = UseCompressedOops; kvn@598: } else if (this->isa_aryptr()) { roland@4159: _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() && kvn@598: _offset != arrayOopDesc::length_offset_in_bytes()); kvn@598: } else if (klass()->is_instance_klass()) { kvn@598: ciInstanceKlass* ik = klass()->as_instance_klass(); kvn@598: ciField* field = NULL; kvn@598: if (this->isa_klassptr()) { never@2658: // Perm objects don't use compressed references kvn@598: } else if (_offset == OffsetBot || _offset == OffsetTop) { kvn@598: // unsafe access roland@4159: _is_ptr_to_narrowoop = UseCompressedOops; kvn@598: } else { // exclude unsafe ops kvn@598: assert(this->isa_instptr(), "must be an instance ptr."); never@2658: never@2658: if (klass() == ciEnv::current()->Class_klass() && never@2658: (_offset == java_lang_Class::klass_offset_in_bytes() || never@2658: _offset == java_lang_Class::array_klass_offset_in_bytes())) { never@2658: // Special hidden fields from the Class. never@2658: assert(this->isa_instptr(), "must be an instance ptr."); coleenp@4037: _is_ptr_to_narrowoop = false; never@2658: } else if (klass() == ciEnv::current()->Class_klass() && coleenp@4047: _offset >= InstanceMirrorKlass::offset_of_static_fields()) { never@2658: // Static fields never@2658: assert(o != NULL, "must be constant"); never@2658: ciInstanceKlass* k = o->as_instance()->java_lang_Class_klass()->as_instance_klass(); never@2658: ciField* field = k->get_field_by_offset(_offset, true); never@2658: assert(field != NULL, "missing field"); kvn@598: BasicType basic_elem_type = field->layout_type(); roland@4159: _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT || roland@4159: basic_elem_type == T_ARRAY); kvn@598: } else { never@2658: // Instance fields which contains a compressed oop references. never@2658: field = ik->get_field_by_offset(_offset, false); never@2658: if (field != NULL) { never@2658: BasicType basic_elem_type = field->layout_type(); roland@4159: _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT || roland@4159: basic_elem_type == T_ARRAY); never@2658: } else if (klass()->equals(ciEnv::current()->Object_klass())) { never@2658: // Compile::find_alias_type() cast exactness on all types to verify never@2658: // that it does not affect alias type. roland@4159: _is_ptr_to_narrowoop = UseCompressedOops; never@2658: } else { never@2658: // Type for the copy start in LibraryCallKit::inline_native_clone(). roland@4159: _is_ptr_to_narrowoop = UseCompressedOops; never@2658: } kvn@598: } kvn@598: } kvn@598: } kvn@598: } kvn@598: #endif kvn@598: } kvn@598: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeOopPtr *TypeOopPtr::make(PTR ptr, roland@6380: int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) { duke@435: assert(ptr != Constant, "no constant generic pointers"); coleenp@4037: ciKlass* k = Compile::current()->env()->Object_klass(); duke@435: bool xk = false; duke@435: ciObject* o = NULL; roland@6380: return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, xk, o, offset, instance_id, speculative, inline_depth))->hashcons(); duke@435: } duke@435: duke@435: duke@435: //------------------------------cast_to_ptr_type------------------------------- duke@435: const Type *TypeOopPtr::cast_to_ptr_type(PTR ptr) const { duke@435: assert(_base == OopPtr, "subclass must override cast_to_ptr_type"); duke@435: if( ptr == _ptr ) return this; roland@6380: return make(ptr, _offset, _instance_id, _speculative, _inline_depth); duke@435: } duke@435: kvn@682: //-----------------------------cast_to_instance_id---------------------------- kvn@658: const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const { duke@435: // There are no instances of a general oop. duke@435: // Return self unchanged. duke@435: return this; duke@435: } duke@435: duke@435: //-----------------------------cast_to_exactness------------------------------- duke@435: const Type *TypeOopPtr::cast_to_exactness(bool klass_is_exact) const { duke@435: // There is no such thing as an exact general oop. duke@435: // Return self unchanged. duke@435: return this; duke@435: } duke@435: duke@435: duke@435: //------------------------------as_klass_type---------------------------------- duke@435: // Return the klass type corresponding to this instance or array type. duke@435: // It is the type that is loaded from an object of this type. duke@435: const TypeKlassPtr* TypeOopPtr::as_klass_type() const { duke@435: ciKlass* k = klass(); duke@435: bool xk = klass_is_exact(); coleenp@4037: if (k == NULL) duke@435: return TypeKlassPtr::OBJECT; duke@435: else duke@435: return TypeKlassPtr::make(xk? Constant: NotNull, k, 0); duke@435: } duke@435: roland@5991: const Type *TypeOopPtr::xmeet(const Type *t) const { roland@5991: const Type* res = xmeet_helper(t); roland@5991: if (res->isa_oopptr() == NULL) { roland@5991: return res; roland@5991: } roland@5991: roland@6313: const TypeOopPtr* res_oopptr = res->is_oopptr(); roland@6313: if (res_oopptr->speculative() != NULL) { roland@5991: // type->speculative() == NULL means that speculation is no better roland@5991: // than type, i.e. type->speculative() == type. So there are 2 roland@5991: // ways to represent the fact that we have no useful speculative roland@5991: // data and we should use a single one to be able to test for roland@5991: // equality between types. Check whether type->speculative() == roland@5991: // type and set speculative to NULL if it is the case. roland@5991: if (res_oopptr->remove_speculative() == res_oopptr->speculative()) { roland@5991: return res_oopptr->remove_speculative(); roland@5991: } roland@5991: } roland@5991: roland@5991: return res; roland@5991: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. roland@5991: const Type *TypeOopPtr::xmeet_helper(const Type *t) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is OopPtr duke@435: switch (t->base()) { // switch on original type duke@435: duke@435: case Int: // Mixing ints & oops happens when javac duke@435: case Long: // reuses local variables duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: kvn@728: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: case Top: duke@435: return this; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case RawPtr: coleenp@4037: case MetadataPtr: coleenp@4037: case KlassPtr: duke@435: return TypePtr::BOTTOM; // Oop meet raw is not well defined duke@435: duke@435: case AnyPtr: { duke@435: // Found an AnyPtr type vs self-OopPtr type duke@435: const TypePtr *tp = t->is_ptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); duke@435: switch (tp->ptr()) { duke@435: case Null: duke@435: if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset); duke@435: // else fall through: duke@435: case TopPTR: kvn@1427: case AnyNull: { kvn@1427: int instance_id = meet_instance_id(InstanceTop); roland@5991: const TypeOopPtr* speculative = _speculative; roland@6380: return make(ptr, offset, instance_id, speculative, _inline_depth); kvn@1427: } duke@435: case BotPTR: duke@435: case NotNull: duke@435: return TypePtr::make(AnyPtr, ptr, offset); duke@435: default: typerr(t); duke@435: } duke@435: } duke@435: duke@435: case OopPtr: { // Meeting to other OopPtrs duke@435: const TypeOopPtr *tp = t->is_oopptr(); kvn@1393: int instance_id = meet_instance_id(tp->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tp); roland@6380: int depth = meet_inline_depth(tp->inline_depth()); roland@6380: return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth); duke@435: } duke@435: duke@435: case InstPtr: // For these, flip the call around to cut down duke@435: case AryPtr: duke@435: return t->xmeet(this); // Call in reverse direction duke@435: duke@435: } // End of switch duke@435: return this; // Return the double constant duke@435: } duke@435: duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual of a pure heap pointer. No relevant klass or oop information. duke@435: const Type *TypeOopPtr::xdual() const { coleenp@4037: assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here"); duke@435: assert(const_oop() == NULL, "no constants here"); roland@6380: return new TypeOopPtr(_base, dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth()); duke@435: } duke@435: duke@435: //--------------------------make_from_klass_common----------------------------- duke@435: // Computes the element-type given a klass. duke@435: const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact) { duke@435: if (klass->is_instance_klass()) { duke@435: Compile* C = Compile::current(); duke@435: Dependencies* deps = C->dependencies(); duke@435: assert((deps != NULL) == (C->method() != NULL && C->method()->code_size() > 0), "sanity"); duke@435: // Element is an instance duke@435: bool klass_is_exact = false; duke@435: if (klass->is_loaded()) { duke@435: // Try to set klass_is_exact. duke@435: ciInstanceKlass* ik = klass->as_instance_klass(); duke@435: klass_is_exact = ik->is_final(); duke@435: if (!klass_is_exact && klass_change duke@435: && deps != NULL && UseUniqueSubclasses) { duke@435: ciInstanceKlass* sub = ik->unique_concrete_subklass(); duke@435: if (sub != NULL) { duke@435: deps->assert_abstract_with_unique_concrete_subtype(ik, sub); duke@435: klass = ik = sub; duke@435: klass_is_exact = sub->is_final(); duke@435: } duke@435: } duke@435: if (!klass_is_exact && try_for_exact duke@435: && deps != NULL && UseExactTypes) { duke@435: if (!ik->is_interface() && !ik->has_subklass()) { duke@435: // Add a dependence; if concrete subclass added we need to recompile duke@435: deps->assert_leaf_type(ik); duke@435: klass_is_exact = true; duke@435: } duke@435: } duke@435: } duke@435: return TypeInstPtr::make(TypePtr::BotPTR, klass, klass_is_exact, NULL, 0); duke@435: } else if (klass->is_obj_array_klass()) { duke@435: // Element is an object array. Recursively call ourself. duke@435: const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(klass->as_obj_array_klass()->element_klass(), false, try_for_exact); duke@435: bool xk = etype->klass_is_exact(); duke@435: const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); duke@435: // We used to pass NotNull in here, asserting that the sub-arrays duke@435: // are all not-null. This is not true in generally, as code can duke@435: // slam NULLs down in the subarrays. duke@435: const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, xk, 0); duke@435: return arr; duke@435: } else if (klass->is_type_array_klass()) { duke@435: // Element is an typeArray duke@435: const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type()); duke@435: const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); duke@435: // We used to pass NotNull in here, asserting that the array pointer duke@435: // is not-null. That was not true in general. duke@435: const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0); duke@435: return arr; duke@435: } else { duke@435: ShouldNotReachHere(); duke@435: return NULL; duke@435: } duke@435: } duke@435: duke@435: //------------------------------make_from_constant----------------------------- duke@435: // Make a java pointer from an oop constant kvn@5110: const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, kvn@5110: bool require_constant, kvn@5110: bool is_autobox_cache) { kvn@5110: assert(!o->is_null_object(), "null object not yet handled here."); kvn@5110: ciKlass* klass = o->klass(); kvn@5110: if (klass->is_instance_klass()) { kvn@5110: // Element is an instance kvn@5110: if (require_constant) { kvn@5110: if (!o->can_be_constant()) return NULL; kvn@5110: } else if (!o->should_be_constant()) { kvn@5110: return TypeInstPtr::make(TypePtr::NotNull, klass, true, NULL, 0); kvn@5110: } kvn@5110: return TypeInstPtr::make(o); kvn@5110: } else if (klass->is_obj_array_klass()) { kvn@5110: // Element is an object array. Recursively call ourself. kvn@5110: const TypeOopPtr *etype = coleenp@4037: TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass()); kvn@5110: if (is_autobox_cache) { kvn@5110: // The pointers in the autobox arrays are always non-null. kvn@5110: etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); kvn@5110: } kvn@5110: const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); kvn@5110: // We used to pass NotNull in here, asserting that the sub-arrays kvn@5110: // are all not-null. This is not true in generally, as code can kvn@5110: // slam NULLs down in the subarrays. kvn@5110: if (require_constant) { kvn@5110: if (!o->can_be_constant()) return NULL; kvn@5110: } else if (!o->should_be_constant()) { kvn@5110: return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); kvn@5110: } roland@6380: const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0, InstanceBot, NULL, InlineDepthBottom, is_autobox_cache); coleenp@4037: return arr; kvn@5110: } else if (klass->is_type_array_klass()) { kvn@5110: // Element is an typeArray coleenp@4037: const Type* etype = coleenp@4037: (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type()); kvn@5110: const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); kvn@5110: // We used to pass NotNull in here, asserting that the array pointer kvn@5110: // is not-null. That was not true in general. kvn@5110: if (require_constant) { kvn@5110: if (!o->can_be_constant()) return NULL; kvn@5110: } else if (!o->should_be_constant()) { kvn@5110: return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); kvn@5110: } coleenp@4037: const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0); coleenp@4037: return arr; duke@435: } duke@435: twisti@3885: fatal("unhandled object type"); duke@435: return NULL; duke@435: } duke@435: duke@435: //------------------------------get_con---------------------------------------- duke@435: intptr_t TypeOopPtr::get_con() const { duke@435: assert( _ptr == Null || _ptr == Constant, "" ); duke@435: assert( _offset >= 0, "" ); duke@435: duke@435: if (_offset != 0) { duke@435: // After being ported to the compiler interface, the compiler no longer duke@435: // directly manipulates the addresses of oops. Rather, it only has a pointer duke@435: // to a handle at compile time. This handle is embedded in the generated duke@435: // code and dereferenced at the time the nmethod is made. Until that time, duke@435: // it is not reasonable to do arithmetic with the addresses of oops (we don't duke@435: // have access to the addresses!). This does not seem to currently happen, twisti@1040: // but this assertion here is to help prevent its occurence. duke@435: tty->print_cr("Found oop constant with non-zero offset"); duke@435: ShouldNotReachHere(); duke@435: } duke@435: jrose@1424: return (intptr_t)const_oop()->constant_encoding(); duke@435: } duke@435: duke@435: duke@435: //-----------------------------filter------------------------------------------ duke@435: // Do not allow interface-vs.-noninterface joins to collapse to top. roland@6313: const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const { roland@6313: roland@6313: const Type* ft = join_helper(kills, include_speculative); duke@435: const TypeInstPtr* ftip = ft->isa_instptr(); duke@435: const TypeInstPtr* ktip = kills->isa_instptr(); duke@435: duke@435: if (ft->empty()) { duke@435: // Check for evil case of 'this' being a class and 'kills' expecting an duke@435: // interface. This can happen because the bytecodes do not contain duke@435: // enough type info to distinguish a Java-level interface variable duke@435: // from a Java-level object variable. If we meet 2 classes which duke@435: // both implement interface I, but their meet is at 'j/l/O' which duke@435: // doesn't implement I, we have no way to tell if the result should duke@435: // be 'I' or 'j/l/O'. Thus we'll pick 'j/l/O'. If this then flows duke@435: // into a Phi which "knows" it's an Interface type we'll have to duke@435: // uplift the type. duke@435: if (!empty() && ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) duke@435: return kills; // Uplift to interface duke@435: duke@435: return Type::TOP; // Canonical empty value duke@435: } duke@435: duke@435: // If we have an interface-typed Phi or cast and we narrow to a class type, duke@435: // the join should report back the class. However, if we have a J/L/Object duke@435: // class-typed Phi and an interface flows in, it's possible that the meet & duke@435: // join report an interface back out. This isn't possible but happens duke@435: // because the type system doesn't interact well with interfaces. duke@435: if (ftip != NULL && ktip != NULL && duke@435: ftip->is_loaded() && ftip->klass()->is_interface() && duke@435: ktip->is_loaded() && !ktip->klass()->is_interface()) { duke@435: // Happens in a CTW of rt.jar, 320-341, no extra flags kvn@1770: assert(!ftip->klass_is_exact(), "interface could not be exact"); duke@435: return ktip->cast_to_ptr_type(ftip->ptr()); duke@435: } duke@435: duke@435: return ft; duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeOopPtr::eq( const Type *t ) const { duke@435: const TypeOopPtr *a = (const TypeOopPtr*)t; duke@435: if (_klass_is_exact != a->_klass_is_exact || roland@5991: _instance_id != a->_instance_id || roland@6380: !eq_speculative(a) || roland@6380: _inline_depth != a->_inline_depth) return false; duke@435: ciObject* one = const_oop(); duke@435: ciObject* two = a->const_oop(); duke@435: if (one == NULL || two == NULL) { duke@435: return (one == two) && TypePtr::eq(t); duke@435: } else { duke@435: return one->equals(two) && TypePtr::eq(t); duke@435: } duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeOopPtr::hash(void) const { duke@435: return duke@435: (const_oop() ? const_oop()->hash() : 0) + duke@435: _klass_is_exact + duke@435: _instance_id + roland@5991: hash_speculative() + roland@6380: _inline_depth + duke@435: TypePtr::hash(); duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: #ifndef PRODUCT duke@435: void TypeOopPtr::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: st->print("oopptr:%s", ptr_msg[_ptr]); duke@435: if( _klass_is_exact ) st->print(":exact"); duke@435: if( const_oop() ) st->print(INTPTR_FORMAT, const_oop()); duke@435: switch( _offset ) { duke@435: case OffsetTop: st->print("+top"); break; duke@435: case OffsetBot: st->print("+any"); break; duke@435: case 0: break; duke@435: default: st->print("+%d",_offset); break; duke@435: } kvn@658: if (_instance_id == InstanceTop) kvn@658: st->print(",iid=top"); kvn@658: else if (_instance_id != InstanceBot) duke@435: st->print(",iid=%d",_instance_id); roland@5991: roland@6380: dump_inline_depth(st); roland@5991: dump_speculative(st); roland@5991: } roland@5991: roland@5991: /** roland@5991: *dump the speculative part of the type roland@5991: */ roland@5991: void TypeOopPtr::dump_speculative(outputStream *st) const { roland@5991: if (_speculative != NULL) { roland@5991: st->print(" (speculative="); roland@5991: _speculative->dump_on(st); roland@5991: st->print(")"); roland@5991: } duke@435: } roland@6380: roland@6380: void TypeOopPtr::dump_inline_depth(outputStream *st) const { roland@6380: if (_inline_depth != InlineDepthBottom) { roland@6380: if (_inline_depth == InlineDepthTop) { roland@6380: st->print(" (inline_depth=InlineDepthTop)"); roland@6380: } else { roland@6380: st->print(" (inline_depth=%d)", _inline_depth); roland@6380: } roland@6380: } roland@6380: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants duke@435: bool TypeOopPtr::singleton(void) const { duke@435: // detune optimizer to not generate constant oop + constant offset as a constant! duke@435: // TopPTR, Null, AnyNull, Constant are all singletons duke@435: return (_offset == 0) && !below_centerline(_ptr); duke@435: } duke@435: duke@435: //------------------------------add_offset------------------------------------- roland@5991: const TypePtr *TypeOopPtr::add_offset(intptr_t offset) const { roland@6380: return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); roland@5991: } roland@5991: roland@5991: /** roland@5991: * Return same type without a speculative part roland@5991: */ roland@6313: const Type* TypeOopPtr::remove_speculative() const { roland@6313: if (_speculative == NULL) { roland@6313: return this; roland@6313: } roland@6380: assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); roland@6380: return make(_ptr, _offset, _instance_id, NULL, _inline_depth); roland@6380: } roland@6380: roland@6380: /** roland@6380: * Return same type but with a different inline depth (used for speculation) roland@6380: * roland@6380: * @param depth depth to meet with roland@6380: */ roland@6380: const TypeOopPtr* TypeOopPtr::with_inline_depth(int depth) const { roland@6380: if (!UseInlineDepthForSpeculativeTypes) { roland@6380: return this; roland@6380: } roland@6380: return make(_ptr, _offset, _instance_id, _speculative, depth); roland@6380: } roland@6380: roland@6380: /** roland@6380: * Check whether new profiling would improve speculative type roland@6380: * roland@6380: * @param exact_kls class from profiling roland@6380: * @param inline_depth inlining depth of profile point roland@6380: * roland@6380: * @return true if type profile is valuable roland@6380: */ roland@6380: bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { roland@6380: // no way to improve an already exact type roland@6380: if (klass_is_exact()) { roland@6380: return false; roland@6380: } roland@6380: // no profiling? roland@6380: if (exact_kls == NULL) { roland@6380: return false; roland@6380: } roland@6380: // no speculative type or non exact speculative type? roland@6380: if (speculative_type() == NULL) { roland@6380: return true; roland@6380: } roland@6380: // If the node already has an exact speculative type keep it, roland@6380: // unless it was provided by profiling that is at a deeper roland@6380: // inlining level. Profiling at a higher inlining depth is roland@6380: // expected to be less accurate. roland@6380: if (_speculative->inline_depth() == InlineDepthBottom) { roland@6380: return false; roland@6380: } roland@6380: assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison"); roland@6380: return inline_depth < _speculative->inline_depth(); duke@435: } duke@435: kvn@658: //------------------------------meet_instance_id-------------------------------- kvn@658: int TypeOopPtr::meet_instance_id( int instance_id ) const { kvn@658: // Either is 'TOP' instance? Return the other instance! kvn@658: if( _instance_id == InstanceTop ) return instance_id; kvn@658: if( instance_id == InstanceTop ) return _instance_id; kvn@658: // If either is different, return 'BOTTOM' instance kvn@658: if( _instance_id != instance_id ) return InstanceBot; kvn@658: return _instance_id; duke@435: } duke@435: kvn@658: //------------------------------dual_instance_id-------------------------------- kvn@658: int TypeOopPtr::dual_instance_id( ) const { kvn@658: if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM kvn@658: if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP kvn@658: return _instance_id; // Map everything else into self kvn@658: } kvn@658: roland@5991: /** roland@5991: * meet of the speculative parts of 2 types roland@5991: * roland@5991: * @param other type to meet with roland@5991: */ roland@6313: const TypeOopPtr* TypeOopPtr::xmeet_speculative(const TypeOopPtr* other) const { roland@5991: bool this_has_spec = (_speculative != NULL); roland@5991: bool other_has_spec = (other->speculative() != NULL); roland@5991: roland@5991: if (!this_has_spec && !other_has_spec) { roland@5991: return NULL; roland@5991: } roland@5991: roland@5991: // If we are at a point where control flow meets and one branch has roland@5991: // a speculative type and the other has not, we meet the speculative roland@5991: // type of one branch with the actual type of the other. If the roland@5991: // actual type is exact and the speculative is as well, then the roland@5991: // result is a speculative type which is exact and we can continue roland@5991: // speculation further. roland@5991: const TypeOopPtr* this_spec = _speculative; roland@5991: const TypeOopPtr* other_spec = other->speculative(); roland@5991: roland@5991: if (!this_has_spec) { roland@5991: this_spec = this; roland@5991: } roland@5991: roland@5991: if (!other_has_spec) { roland@5991: other_spec = other; roland@5991: } roland@5991: roland@6313: return this_spec->meet_speculative(other_spec)->is_oopptr(); roland@5991: } roland@5991: roland@5991: /** roland@5991: * dual of the speculative part of the type roland@5991: */ roland@5991: const TypeOopPtr* TypeOopPtr::dual_speculative() const { roland@5991: if (_speculative == NULL) { roland@5991: return NULL; roland@5991: } roland@5991: return _speculative->dual()->is_oopptr(); roland@5991: } roland@5991: roland@5991: /** roland@5991: * add offset to the speculative part of the type roland@5991: * roland@5991: * @param offset offset to add roland@5991: */ roland@5991: const TypeOopPtr* TypeOopPtr::add_offset_speculative(intptr_t offset) const { roland@5991: if (_speculative == NULL) { roland@5991: return NULL; roland@5991: } roland@5991: return _speculative->add_offset(offset)->is_oopptr(); roland@5991: } roland@5991: roland@5991: /** roland@5991: * Are the speculative parts of 2 types equal? roland@5991: * roland@5991: * @param other type to compare this one to roland@5991: */ roland@5991: bool TypeOopPtr::eq_speculative(const TypeOopPtr* other) const { roland@5991: if (_speculative == NULL || other->speculative() == NULL) { roland@5991: return _speculative == other->speculative(); roland@5991: } roland@5991: roland@5991: if (_speculative->base() != other->speculative()->base()) { roland@5991: return false; roland@5991: } roland@5991: roland@5991: return _speculative->eq(other->speculative()); roland@5991: } roland@5991: roland@5991: /** roland@5991: * Hash of the speculative part of the type roland@5991: */ roland@5991: int TypeOopPtr::hash_speculative() const { roland@5991: if (_speculative == NULL) { roland@5991: return 0; roland@5991: } roland@5991: roland@5991: return _speculative->hash(); roland@5991: } roland@5991: roland@6380: /** roland@6380: * dual of the inline depth for this type (used for speculation) roland@6380: */ roland@6380: int TypeOopPtr::dual_inline_depth() const { roland@6380: return -inline_depth(); roland@6380: } roland@6380: roland@6380: /** roland@6380: * meet of 2 inline depth (used for speculation) roland@6380: * roland@6380: * @param depth depth to meet with roland@6380: */ roland@6380: int TypeOopPtr::meet_inline_depth(int depth) const { roland@6380: return MAX2(inline_depth(), depth); roland@6380: } kvn@658: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypeInstPtr *TypeInstPtr::NOTNULL; duke@435: const TypeInstPtr *TypeInstPtr::BOTTOM; duke@435: const TypeInstPtr *TypeInstPtr::MIRROR; duke@435: const TypeInstPtr *TypeInstPtr::MARK; duke@435: const TypeInstPtr *TypeInstPtr::KLASS; duke@435: duke@435: //------------------------------TypeInstPtr------------------------------------- roland@6380: TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, bool xk, ciObject* o, int off, int instance_id, const TypeOopPtr* speculative, int inline_depth) roland@6380: : TypeOopPtr(InstPtr, ptr, k, xk, o, off, instance_id, speculative, inline_depth), _name(k->name()) { duke@435: assert(k != NULL && duke@435: (k->is_loaded() || o == NULL), duke@435: "cannot have constants with non-loaded klass"); duke@435: }; duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeInstPtr *TypeInstPtr::make(PTR ptr, duke@435: ciKlass* k, duke@435: bool xk, duke@435: ciObject* o, duke@435: int offset, roland@5991: int instance_id, roland@6380: const TypeOopPtr* speculative, roland@6380: int inline_depth) { coleenp@4037: assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance"); duke@435: // Either const_oop() is NULL or else ptr is Constant duke@435: assert( (!o && ptr != Constant) || (o && ptr == Constant), duke@435: "constant pointers must have a value supplied" ); duke@435: // Ptr is never Null duke@435: assert( ptr != Null, "NULL pointers are not typed" ); duke@435: kvn@682: assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); duke@435: if (!UseExactTypes) xk = false; duke@435: if (ptr == Constant) { duke@435: // Note: This case includes meta-object constants, such as methods. duke@435: xk = true; duke@435: } else if (k->is_loaded()) { duke@435: ciInstanceKlass* ik = k->as_instance_klass(); duke@435: if (!xk && ik->is_final()) xk = true; // no inexact final klass duke@435: if (xk && ik->is_interface()) xk = false; // no exact interface duke@435: } duke@435: duke@435: // Now hash this baby duke@435: TypeInstPtr *result = roland@6380: (TypeInstPtr*)(new TypeInstPtr(ptr, k, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons(); duke@435: duke@435: return result; duke@435: } duke@435: kvn@5110: /** kvn@5110: * Create constant type for a constant boxed value kvn@5110: */ kvn@5110: const Type* TypeInstPtr::get_const_boxed_value() const { kvn@5110: assert(is_ptr_to_boxed_value(), "should be called only for boxed value"); kvn@5110: assert((const_oop() != NULL), "should be called only for constant object"); kvn@5110: ciConstant constant = const_oop()->as_instance()->field_value_by_offset(offset()); kvn@5110: BasicType bt = constant.basic_type(); kvn@5110: switch (bt) { kvn@5110: case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); kvn@5110: case T_INT: return TypeInt::make(constant.as_int()); kvn@5110: case T_CHAR: return TypeInt::make(constant.as_char()); kvn@5110: case T_BYTE: return TypeInt::make(constant.as_byte()); kvn@5110: case T_SHORT: return TypeInt::make(constant.as_short()); kvn@5110: case T_FLOAT: return TypeF::make(constant.as_float()); kvn@5110: case T_DOUBLE: return TypeD::make(constant.as_double()); kvn@5110: case T_LONG: return TypeLong::make(constant.as_long()); kvn@5110: default: break; kvn@5110: } kvn@5110: fatal(err_msg_res("Invalid boxed value type '%s'", type2name(bt))); kvn@5110: return NULL; kvn@5110: } duke@435: duke@435: //------------------------------cast_to_ptr_type------------------------------- duke@435: const Type *TypeInstPtr::cast_to_ptr_type(PTR ptr) const { duke@435: if( ptr == _ptr ) return this; duke@435: // Reconstruct _sig info here since not a problem with later lazy duke@435: // construction, _sig will show up on demand. roland@6380: return make(ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, _inline_depth); duke@435: } duke@435: duke@435: duke@435: //-----------------------------cast_to_exactness------------------------------- duke@435: const Type *TypeInstPtr::cast_to_exactness(bool klass_is_exact) const { duke@435: if( klass_is_exact == _klass_is_exact ) return this; duke@435: if (!UseExactTypes) return this; duke@435: if (!_klass->is_loaded()) return this; duke@435: ciInstanceKlass* ik = _klass->as_instance_klass(); duke@435: if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk duke@435: if( ik->is_interface() ) return this; // cannot set xk roland@6380: return make(ptr(), klass(), klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth); duke@435: } duke@435: kvn@682: //-----------------------------cast_to_instance_id---------------------------- kvn@658: const TypeOopPtr *TypeInstPtr::cast_to_instance_id(int instance_id) const { kvn@658: if( instance_id == _instance_id ) return this; roland@6380: return make(_ptr, klass(), _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth); duke@435: } duke@435: duke@435: //------------------------------xmeet_unloaded--------------------------------- duke@435: // Compute the MEET of two InstPtrs when at least one is unloaded. duke@435: // Assume classes are different since called after check for same name/class-loader duke@435: const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst) const { duke@435: int off = meet_offset(tinst->offset()); duke@435: PTR ptr = meet_ptr(tinst->ptr()); kvn@1427: int instance_id = meet_instance_id(tinst->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tinst); roland@6380: int depth = meet_inline_depth(tinst->inline_depth()); duke@435: duke@435: const TypeInstPtr *loaded = is_loaded() ? this : tinst; duke@435: const TypeInstPtr *unloaded = is_loaded() ? tinst : this; duke@435: if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) { duke@435: // duke@435: // Meet unloaded class with java/lang/Object duke@435: // duke@435: // Meet duke@435: // | Unloaded Class duke@435: // Object | TOP | AnyNull | Constant | NotNull | BOTTOM | duke@435: // =================================================================== duke@435: // TOP | ..........................Unloaded......................| duke@435: // AnyNull | U-AN |................Unloaded......................| duke@435: // Constant | ... O-NN .................................. | O-BOT | duke@435: // NotNull | ... O-NN .................................. | O-BOT | duke@435: // BOTTOM | ........................Object-BOTTOM ..................| duke@435: // duke@435: assert(loaded->ptr() != TypePtr::Null, "insanity check"); duke@435: // duke@435: if( loaded->ptr() == TypePtr::TopPTR ) { return unloaded; } roland@6380: else if (loaded->ptr() == TypePtr::AnyNull) { return TypeInstPtr::make(ptr, unloaded->klass(), false, NULL, off, instance_id, speculative, depth); } duke@435: else if (loaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; } duke@435: else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) { duke@435: if (unloaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; } duke@435: else { return TypeInstPtr::NOTNULL; } duke@435: } duke@435: else if( unloaded->ptr() == TypePtr::TopPTR ) { return unloaded; } duke@435: duke@435: return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr(); duke@435: } duke@435: duke@435: // Both are unloaded, not the same class, not Object duke@435: // Or meet unloaded with a different loaded class, not java/lang/Object duke@435: if( ptr != TypePtr::BotPTR ) { duke@435: return TypeInstPtr::NOTNULL; duke@435: } duke@435: return TypeInstPtr::BOTTOM; duke@435: } duke@435: duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. roland@5991: const Type *TypeInstPtr::xmeet_helper(const Type *t) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is Pointer duke@435: switch (t->base()) { // switch on original type duke@435: duke@435: case Int: // Mixing ints & oops happens when javac duke@435: case Long: // reuses local variables duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: coleenp@548: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: case Top: duke@435: return this; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: coleenp@4037: case MetadataPtr: coleenp@4037: case KlassPtr: duke@435: case RawPtr: return TypePtr::BOTTOM; duke@435: duke@435: case AryPtr: { // All arrays inherit from Object class duke@435: const TypeAryPtr *tp = t->is_aryptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); kvn@658: int instance_id = meet_instance_id(tp->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tp); roland@6380: int depth = meet_inline_depth(tp->inline_depth()); duke@435: switch (ptr) { duke@435: case TopPTR: duke@435: case AnyNull: // Fall 'down' to dual of object klass roland@5991: // For instances when a subclass meets a superclass we fall roland@5991: // below the centerline when the superclass is exact. We need to roland@5991: // do the same here. roland@5991: if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) { roland@6380: return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth); duke@435: } else { duke@435: // cannot subclass, so the meet has to fall badly below the centerline duke@435: ptr = NotNull; kvn@658: instance_id = InstanceBot; roland@6380: return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth); duke@435: } duke@435: case Constant: duke@435: case NotNull: duke@435: case BotPTR: // Fall down to object klass duke@435: // LCA is object_klass, but if we subclass from the top we can do better duke@435: if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull ) duke@435: // If 'this' (InstPtr) is above the centerline and it is Object class twisti@1040: // then we can subclass in the Java class hierarchy. roland@5991: // For instances when a subclass meets a superclass we fall roland@5991: // below the centerline when the superclass is exact. We need roland@5991: // to do the same here. roland@5991: if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) { duke@435: // that is, tp's array type is a subtype of my klass kvn@1714: return TypeAryPtr::make(ptr, (ptr == Constant ? tp->const_oop() : NULL), roland@6380: tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth); duke@435: } duke@435: } duke@435: // The other case cannot happen, since I cannot be a subtype of an array. duke@435: // The meet falls down to Object class below centerline. duke@435: if( ptr == Constant ) duke@435: ptr = NotNull; kvn@658: instance_id = InstanceBot; roland@6380: return make(ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth); duke@435: default: typerr(t); duke@435: } duke@435: } duke@435: duke@435: case OopPtr: { // Meeting to OopPtrs duke@435: // Found a OopPtr type vs self-InstPtr type kvn@1393: const TypeOopPtr *tp = t->is_oopptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); duke@435: switch (tp->ptr()) { duke@435: case TopPTR: kvn@658: case AnyNull: { kvn@658: int instance_id = meet_instance_id(InstanceTop); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tp); roland@6380: int depth = meet_inline_depth(tp->inline_depth()); duke@435: return make(ptr, klass(), klass_is_exact(), roland@6380: (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, depth); kvn@658: } duke@435: case NotNull: kvn@1393: case BotPTR: { kvn@1393: int instance_id = meet_instance_id(tp->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tp); roland@6380: int depth = meet_inline_depth(tp->inline_depth()); roland@6380: return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); kvn@1393: } duke@435: default: typerr(t); duke@435: } duke@435: } duke@435: duke@435: case AnyPtr: { // Meeting to AnyPtrs duke@435: // Found an AnyPtr type vs self-InstPtr type duke@435: const TypePtr *tp = t->is_ptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); duke@435: switch (tp->ptr()) { duke@435: case Null: roland@5991: if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset); kvn@658: // else fall through to AnyNull duke@435: case TopPTR: kvn@658: case AnyNull: { kvn@658: int instance_id = meet_instance_id(InstanceTop); roland@5991: const TypeOopPtr* speculative = _speculative; roland@5991: return make(ptr, klass(), klass_is_exact(), roland@6380: (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, _inline_depth); kvn@658: } duke@435: case NotNull: duke@435: case BotPTR: roland@5991: return TypePtr::make(AnyPtr, ptr, offset); duke@435: default: typerr(t); duke@435: } duke@435: } duke@435: duke@435: /* duke@435: A-top } duke@435: / | \ } Tops duke@435: B-top A-any C-top } duke@435: | / | \ | } Any-nulls duke@435: B-any | C-any } duke@435: | | | duke@435: B-con A-con C-con } constants; not comparable across classes duke@435: | | | duke@435: B-not | C-not } duke@435: | \ | / | } not-nulls duke@435: B-bot A-not C-bot } duke@435: \ | / } Bottoms duke@435: A-bot } duke@435: */ duke@435: duke@435: case InstPtr: { // Meeting 2 Oops? duke@435: // Found an InstPtr sub-type vs self-InstPtr type duke@435: const TypeInstPtr *tinst = t->is_instptr(); duke@435: int off = meet_offset( tinst->offset() ); duke@435: PTR ptr = meet_ptr( tinst->ptr() ); kvn@658: int instance_id = meet_instance_id(tinst->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tinst); roland@6380: int depth = meet_inline_depth(tinst->inline_depth()); duke@435: duke@435: // Check for easy case; klasses are equal (and perhaps not loaded!) duke@435: // If we have constants, then we created oops so classes are loaded duke@435: // and we can handle the constants further down. This case handles duke@435: // both-not-loaded or both-loaded classes duke@435: if (ptr != Constant && klass()->equals(tinst->klass()) && klass_is_exact() == tinst->klass_is_exact()) { roland@6380: return make(ptr, klass(), klass_is_exact(), NULL, off, instance_id, speculative, depth); duke@435: } duke@435: duke@435: // Classes require inspection in the Java klass hierarchy. Must be loaded. duke@435: ciKlass* tinst_klass = tinst->klass(); duke@435: ciKlass* this_klass = this->klass(); duke@435: bool tinst_xk = tinst->klass_is_exact(); duke@435: bool this_xk = this->klass_is_exact(); duke@435: if (!tinst_klass->is_loaded() || !this_klass->is_loaded() ) { duke@435: // One of these classes has not been loaded duke@435: const TypeInstPtr *unloaded_meet = xmeet_unloaded(tinst); duke@435: #ifndef PRODUCT duke@435: if( PrintOpto && Verbose ) { duke@435: tty->print("meet of unloaded classes resulted in: "); unloaded_meet->dump(); tty->cr(); duke@435: tty->print(" this == "); this->dump(); tty->cr(); duke@435: tty->print(" tinst == "); tinst->dump(); tty->cr(); duke@435: } duke@435: #endif duke@435: return unloaded_meet; duke@435: } duke@435: duke@435: // Handle mixing oops and interfaces first. roland@5991: if( this_klass->is_interface() && !(tinst_klass->is_interface() || roland@5991: tinst_klass == ciEnv::current()->Object_klass())) { duke@435: ciKlass *tmp = tinst_klass; // Swap interface around duke@435: tinst_klass = this_klass; duke@435: this_klass = tmp; duke@435: bool tmp2 = tinst_xk; duke@435: tinst_xk = this_xk; duke@435: this_xk = tmp2; duke@435: } duke@435: if (tinst_klass->is_interface() && duke@435: !(this_klass->is_interface() || duke@435: // Treat java/lang/Object as an honorary interface, duke@435: // because we need a bottom for the interface hierarchy. duke@435: this_klass == ciEnv::current()->Object_klass())) { duke@435: // Oop meets interface! duke@435: duke@435: // See if the oop subtypes (implements) interface. duke@435: ciKlass *k; duke@435: bool xk; duke@435: if( this_klass->is_subtype_of( tinst_klass ) ) { duke@435: // Oop indeed subtypes. Now keep oop or interface depending duke@435: // on whether we are both above the centerline or either is duke@435: // below the centerline. If we are on the centerline duke@435: // (e.g., Constant vs. AnyNull interface), use the constant. duke@435: k = below_centerline(ptr) ? tinst_klass : this_klass; duke@435: // If we are keeping this_klass, keep its exactness too. duke@435: xk = below_centerline(ptr) ? tinst_xk : this_xk; duke@435: } else { // Does not implement, fall to Object duke@435: // Oop does not implement interface, so mixing falls to Object duke@435: // just like the verifier does (if both are above the duke@435: // centerline fall to interface) duke@435: k = above_centerline(ptr) ? tinst_klass : ciEnv::current()->Object_klass(); duke@435: xk = above_centerline(ptr) ? tinst_xk : false; duke@435: // Watch out for Constant vs. AnyNull interface. duke@435: if (ptr == Constant) ptr = NotNull; // forget it was a constant kvn@682: instance_id = InstanceBot; duke@435: } duke@435: ciObject* o = NULL; // the Constant value, if any duke@435: if (ptr == Constant) { duke@435: // Find out which constant. duke@435: o = (this_klass == klass()) ? const_oop() : tinst->const_oop(); duke@435: } roland@6380: return make(ptr, k, xk, o, off, instance_id, speculative, depth); duke@435: } duke@435: duke@435: // Either oop vs oop or interface vs interface or interface vs Object duke@435: duke@435: // !!! Here's how the symmetry requirement breaks down into invariants: duke@435: // If we split one up & one down AND they subtype, take the down man. duke@435: // If we split one up & one down AND they do NOT subtype, "fall hard". duke@435: // If both are up and they subtype, take the subtype class. duke@435: // If both are up and they do NOT subtype, "fall hard". duke@435: // If both are down and they subtype, take the supertype class. duke@435: // If both are down and they do NOT subtype, "fall hard". duke@435: // Constants treated as down. duke@435: duke@435: // Now, reorder the above list; observe that both-down+subtype is also duke@435: // "fall hard"; "fall hard" becomes the default case: duke@435: // If we split one up & one down AND they subtype, take the down man. duke@435: // If both are up and they subtype, take the subtype class. duke@435: duke@435: // If both are down and they subtype, "fall hard". duke@435: // If both are down and they do NOT subtype, "fall hard". duke@435: // If both are up and they do NOT subtype, "fall hard". duke@435: // If we split one up & one down AND they do NOT subtype, "fall hard". duke@435: duke@435: // If a proper subtype is exact, and we return it, we return it exactly. duke@435: // If a proper supertype is exact, there can be no subtyping relationship! duke@435: // If both types are equal to the subtype, exactness is and-ed below the duke@435: // centerline and or-ed above it. (N.B. Constants are always exact.) duke@435: duke@435: // Check for subtyping: duke@435: ciKlass *subtype = NULL; duke@435: bool subtype_exact = false; duke@435: if( tinst_klass->equals(this_klass) ) { duke@435: subtype = this_klass; duke@435: subtype_exact = below_centerline(ptr) ? (this_xk & tinst_xk) : (this_xk | tinst_xk); duke@435: } else if( !tinst_xk && this_klass->is_subtype_of( tinst_klass ) ) { duke@435: subtype = this_klass; // Pick subtyping class duke@435: subtype_exact = this_xk; duke@435: } else if( !this_xk && tinst_klass->is_subtype_of( this_klass ) ) { duke@435: subtype = tinst_klass; // Pick subtyping class duke@435: subtype_exact = tinst_xk; duke@435: } duke@435: duke@435: if( subtype ) { duke@435: if( above_centerline(ptr) ) { // both are up? duke@435: this_klass = tinst_klass = subtype; duke@435: this_xk = tinst_xk = subtype_exact; duke@435: } else if( above_centerline(this ->_ptr) && !above_centerline(tinst->_ptr) ) { duke@435: this_klass = tinst_klass; // tinst is down; keep down man duke@435: this_xk = tinst_xk; duke@435: } else if( above_centerline(tinst->_ptr) && !above_centerline(this ->_ptr) ) { duke@435: tinst_klass = this_klass; // this is down; keep down man duke@435: tinst_xk = this_xk; duke@435: } else { duke@435: this_xk = subtype_exact; // either they are equal, or we'll do an LCA duke@435: } duke@435: } duke@435: duke@435: // Check for classes now being equal duke@435: if (tinst_klass->equals(this_klass)) { duke@435: // If the klasses are equal, the constants may still differ. Fall to duke@435: // NotNull if they do (neither constant is NULL; that is a special case duke@435: // handled elsewhere). duke@435: ciObject* o = NULL; // Assume not constant when done duke@435: ciObject* this_oop = const_oop(); duke@435: ciObject* tinst_oop = tinst->const_oop(); duke@435: if( ptr == Constant ) { duke@435: if (this_oop != NULL && tinst_oop != NULL && duke@435: this_oop->equals(tinst_oop) ) duke@435: o = this_oop; duke@435: else if (above_centerline(this ->_ptr)) duke@435: o = tinst_oop; duke@435: else if (above_centerline(tinst ->_ptr)) duke@435: o = this_oop; duke@435: else duke@435: ptr = NotNull; duke@435: } roland@6380: return make(ptr, this_klass, this_xk, o, off, instance_id, speculative, depth); duke@435: } // Else classes are not equal duke@435: duke@435: // Since klasses are different, we require a LCA in the Java duke@435: // class hierarchy - which means we have to fall to at least NotNull. duke@435: if( ptr == TopPTR || ptr == AnyNull || ptr == Constant ) duke@435: ptr = NotNull; kvn@682: instance_id = InstanceBot; duke@435: duke@435: // Now we find the LCA of Java classes duke@435: ciKlass* k = this_klass->least_common_ancestor(tinst_klass); roland@6380: return make(ptr, k, false, NULL, off, instance_id, speculative, depth); duke@435: } // End of case InstPtr duke@435: duke@435: } // End of switch duke@435: return this; // Return the double constant duke@435: } duke@435: duke@435: duke@435: //------------------------java_mirror_type-------------------------------------- duke@435: ciType* TypeInstPtr::java_mirror_type() const { duke@435: // must be a singleton type duke@435: if( const_oop() == NULL ) return NULL; duke@435: duke@435: // must be of type java.lang.Class duke@435: if( klass() != ciEnv::current()->Class_klass() ) return NULL; duke@435: duke@435: return const_oop()->as_instance()->java_mirror_type(); duke@435: } duke@435: duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: do NOT dual on klasses. This means I do NOT understand the Java twisti@1040: // inheritance mechanism. duke@435: const Type *TypeInstPtr::xdual() const { roland@6380: return new TypeInstPtr(dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth()); duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeInstPtr::eq( const Type *t ) const { duke@435: const TypeInstPtr *p = t->is_instptr(); duke@435: return duke@435: klass()->equals(p->klass()) && duke@435: TypeOopPtr::eq(p); // Check sub-type stuff duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeInstPtr::hash(void) const { duke@435: int hash = klass()->hash() + TypeOopPtr::hash(); duke@435: return hash; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump oop Type duke@435: #ifndef PRODUCT duke@435: void TypeInstPtr::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: // Print the name of the klass. duke@435: klass()->print_name_on(st); duke@435: duke@435: switch( _ptr ) { duke@435: case Constant: duke@435: // TO DO: Make CI print the hex address of the underlying oop. duke@435: if (WizardMode || Verbose) { duke@435: const_oop()->print_oop(st); duke@435: } duke@435: case BotPTR: duke@435: if (!WizardMode && !Verbose) { duke@435: if( _klass_is_exact ) st->print(":exact"); duke@435: break; duke@435: } duke@435: case TopPTR: duke@435: case AnyNull: duke@435: case NotNull: duke@435: st->print(":%s", ptr_msg[_ptr]); duke@435: if( _klass_is_exact ) st->print(":exact"); duke@435: break; duke@435: } duke@435: duke@435: if( _offset ) { // Dump offset, if any duke@435: if( _offset == OffsetBot ) st->print("+any"); duke@435: else if( _offset == OffsetTop ) st->print("+unknown"); duke@435: else st->print("+%d", _offset); duke@435: } duke@435: duke@435: st->print(" *"); kvn@658: if (_instance_id == InstanceTop) kvn@658: st->print(",iid=top"); kvn@658: else if (_instance_id != InstanceBot) duke@435: st->print(",iid=%d",_instance_id); roland@5991: roland@6380: dump_inline_depth(st); roland@5991: dump_speculative(st); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------add_offset------------------------------------- roland@5991: const TypePtr *TypeInstPtr::add_offset(intptr_t offset) const { roland@5991: return make(_ptr, klass(), klass_is_exact(), const_oop(), xadd_offset(offset), _instance_id, add_offset_speculative(offset)); roland@5991: } roland@5991: roland@6313: const Type *TypeInstPtr::remove_speculative() const { roland@6313: if (_speculative == NULL) { roland@6313: return this; roland@6313: } roland@6380: assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); roland@6380: return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, NULL, _inline_depth); roland@6380: } roland@6380: roland@6380: const TypeOopPtr *TypeInstPtr::with_inline_depth(int depth) const { roland@6380: if (!UseInlineDepthForSpeculativeTypes) { roland@6380: return this; roland@6380: } roland@6380: return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth); duke@435: } duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: const TypeAryPtr *TypeAryPtr::RANGE; duke@435: const TypeAryPtr *TypeAryPtr::OOPS; kvn@598: const TypeAryPtr *TypeAryPtr::NARROWOOPS; duke@435: const TypeAryPtr *TypeAryPtr::BYTES; duke@435: const TypeAryPtr *TypeAryPtr::SHORTS; duke@435: const TypeAryPtr *TypeAryPtr::CHARS; duke@435: const TypeAryPtr *TypeAryPtr::INTS; duke@435: const TypeAryPtr *TypeAryPtr::LONGS; duke@435: const TypeAryPtr *TypeAryPtr::FLOATS; duke@435: const TypeAryPtr *TypeAryPtr::DOUBLES; duke@435: duke@435: //------------------------------make------------------------------------------- roland@6380: const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) { duke@435: assert(!(k == NULL && ary->_elem->isa_int()), duke@435: "integral arrays must be pre-equipped with a class"); duke@435: if (!xk) xk = ary->ary_must_be_exact(); kvn@682: assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); duke@435: if (!UseExactTypes) xk = (ptr == Constant); roland@6380: return (TypeAryPtr*)(new TypeAryPtr(ptr, NULL, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------make------------------------------------------- roland@6380: const TypeAryPtr *TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth, bool is_autobox_cache) { duke@435: assert(!(k == NULL && ary->_elem->isa_int()), duke@435: "integral arrays must be pre-equipped with a class"); duke@435: assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" ); duke@435: if (!xk) xk = (o != NULL) || ary->ary_must_be_exact(); kvn@682: assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); duke@435: if (!UseExactTypes) xk = (ptr == Constant); roland@6380: return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------cast_to_ptr_type------------------------------- duke@435: const Type *TypeAryPtr::cast_to_ptr_type(PTR ptr) const { duke@435: if( ptr == _ptr ) return this; roland@6380: return make(ptr, const_oop(), _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth); duke@435: } duke@435: duke@435: duke@435: //-----------------------------cast_to_exactness------------------------------- duke@435: const Type *TypeAryPtr::cast_to_exactness(bool klass_is_exact) const { duke@435: if( klass_is_exact == _klass_is_exact ) return this; duke@435: if (!UseExactTypes) return this; duke@435: if (_ary->ary_must_be_exact()) return this; // cannot clear xk roland@6380: return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth); duke@435: } duke@435: kvn@682: //-----------------------------cast_to_instance_id---------------------------- kvn@658: const TypeOopPtr *TypeAryPtr::cast_to_instance_id(int instance_id) const { kvn@658: if( instance_id == _instance_id ) return this; roland@6380: return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth); duke@435: } duke@435: duke@435: //-----------------------------narrow_size_type------------------------------- duke@435: // Local cache for arrayOopDesc::max_array_length(etype), duke@435: // which is kind of slow (and cached elsewhere by other users). duke@435: static jint max_array_length_cache[T_CONFLICT+1]; duke@435: static jint max_array_length(BasicType etype) { duke@435: jint& cache = max_array_length_cache[etype]; duke@435: jint res = cache; duke@435: if (res == 0) { duke@435: switch (etype) { coleenp@548: case T_NARROWOOP: coleenp@548: etype = T_OBJECT; coleenp@548: break; roland@4159: case T_NARROWKLASS: duke@435: case T_CONFLICT: duke@435: case T_ILLEGAL: duke@435: case T_VOID: duke@435: etype = T_BYTE; // will produce conservatively high value duke@435: } duke@435: cache = res = arrayOopDesc::max_array_length(etype); duke@435: } duke@435: return res; duke@435: } duke@435: duke@435: // Narrow the given size type to the index range for the given array base type. duke@435: // Return NULL if the resulting int type becomes empty. rasbold@801: const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const { duke@435: jint hi = size->_hi; duke@435: jint lo = size->_lo; duke@435: jint min_lo = 0; rasbold@801: jint max_hi = max_array_length(elem()->basic_type()); duke@435: //if (index_not_size) --max_hi; // type of a valid array index, FTR duke@435: bool chg = false; kvn@5110: if (lo < min_lo) { kvn@5110: lo = min_lo; kvn@5110: if (size->is_con()) { kvn@5110: hi = lo; kvn@5110: } kvn@5110: chg = true; kvn@5110: } kvn@5110: if (hi > max_hi) { kvn@5110: hi = max_hi; kvn@5110: if (size->is_con()) { kvn@5110: lo = hi; kvn@5110: } kvn@5110: chg = true; kvn@5110: } twisti@1040: // Negative length arrays will produce weird intermediate dead fast-path code duke@435: if (lo > hi) rasbold@801: return TypeInt::ZERO; duke@435: if (!chg) duke@435: return size; duke@435: return TypeInt::make(lo, hi, Type::WidenMin); duke@435: } duke@435: duke@435: //-------------------------------cast_to_size---------------------------------- duke@435: const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const { duke@435: assert(new_size != NULL, ""); rasbold@801: new_size = narrow_size_type(new_size); duke@435: if (new_size == size()) return this; vlivanov@5658: const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable()); roland@6380: return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth); duke@435: } duke@435: duke@435: vlivanov@5658: //------------------------------cast_to_stable--------------------------------- vlivanov@5658: const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const { vlivanov@5658: if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable())) vlivanov@5658: return this; vlivanov@5658: vlivanov@5658: const Type* elem = this->elem(); vlivanov@5658: const TypePtr* elem_ptr = elem->make_ptr(); vlivanov@5658: vlivanov@5658: if (stable_dimension > 1 && elem_ptr != NULL && elem_ptr->isa_aryptr()) { vlivanov@5658: // If this is widened from a narrow oop, TypeAry::make will re-narrow it. vlivanov@5658: elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1); vlivanov@5658: } vlivanov@5658: vlivanov@5658: const TypeAry* new_ary = TypeAry::make(elem, size(), stable); vlivanov@5658: vlivanov@5658: return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id); vlivanov@5658: } vlivanov@5658: vlivanov@5658: //-----------------------------stable_dimension-------------------------------- vlivanov@5658: int TypeAryPtr::stable_dimension() const { vlivanov@5658: if (!is_stable()) return 0; vlivanov@5658: int dim = 1; vlivanov@5658: const TypePtr* elem_ptr = elem()->make_ptr(); vlivanov@5658: if (elem_ptr != NULL && elem_ptr->isa_aryptr()) vlivanov@5658: dim += elem_ptr->is_aryptr()->stable_dimension(); vlivanov@5658: return dim; vlivanov@5658: } vlivanov@5658: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeAryPtr::eq( const Type *t ) const { duke@435: const TypeAryPtr *p = t->is_aryptr(); duke@435: return duke@435: _ary == p->_ary && // Check array duke@435: TypeOopPtr::eq(p); // Check sub-parts duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeAryPtr::hash(void) const { duke@435: return (intptr_t)_ary + TypeOopPtr::hash(); duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. roland@5991: const Type *TypeAryPtr::xmeet_helper(const Type *t) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: // Current "this->_base" is Pointer duke@435: switch (t->base()) { // switch on original type duke@435: duke@435: // Mixing ints & oops happens when javac reuses local variables duke@435: case Int: duke@435: case Long: duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: coleenp@548: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: case Top: duke@435: return this; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case OopPtr: { // Meeting to OopPtrs duke@435: // Found a OopPtr type vs self-AryPtr type kvn@1393: const TypeOopPtr *tp = t->is_oopptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); roland@6380: int depth = meet_inline_depth(tp->inline_depth()); duke@435: switch (tp->ptr()) { duke@435: case TopPTR: kvn@658: case AnyNull: { kvn@658: int instance_id = meet_instance_id(InstanceTop); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tp); kvn@658: return make(ptr, (ptr == Constant ? const_oop() : NULL), roland@6380: _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); kvn@658: } duke@435: case BotPTR: kvn@1393: case NotNull: { kvn@1393: int instance_id = meet_instance_id(tp->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tp); roland@6380: return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); kvn@1393: } duke@435: default: ShouldNotReachHere(); duke@435: } duke@435: } duke@435: duke@435: case AnyPtr: { // Meeting two AnyPtrs duke@435: // Found an AnyPtr type vs self-AryPtr type duke@435: const TypePtr *tp = t->is_ptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); duke@435: switch (tp->ptr()) { duke@435: case TopPTR: duke@435: return this; duke@435: case BotPTR: duke@435: case NotNull: duke@435: return TypePtr::make(AnyPtr, ptr, offset); duke@435: case Null: duke@435: if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset); kvn@658: // else fall through to AnyNull kvn@658: case AnyNull: { kvn@658: int instance_id = meet_instance_id(InstanceTop); roland@5991: const TypeOopPtr* speculative = _speculative; roland@5991: return make(ptr, (ptr == Constant ? const_oop() : NULL), roland@6380: _ary, _klass, _klass_is_exact, offset, instance_id, speculative, _inline_depth); kvn@658: } duke@435: default: ShouldNotReachHere(); duke@435: } duke@435: } duke@435: coleenp@4037: case MetadataPtr: coleenp@4037: case KlassPtr: duke@435: case RawPtr: return TypePtr::BOTTOM; duke@435: duke@435: case AryPtr: { // Meeting 2 references? duke@435: const TypeAryPtr *tap = t->is_aryptr(); duke@435: int off = meet_offset(tap->offset()); roland@6313: const TypeAry *tary = _ary->meet_speculative(tap->_ary)->is_ary(); duke@435: PTR ptr = meet_ptr(tap->ptr()); kvn@658: int instance_id = meet_instance_id(tap->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tap); roland@6380: int depth = meet_inline_depth(tap->inline_depth()); duke@435: ciKlass* lazy_klass = NULL; duke@435: if (tary->_elem->isa_int()) { duke@435: // Integral array element types have irrelevant lattice relations. duke@435: // It is the klass that determines array layout, not the element type. duke@435: if (_klass == NULL) duke@435: lazy_klass = tap->_klass; duke@435: else if (tap->_klass == NULL || tap->_klass == _klass) { duke@435: lazy_klass = _klass; duke@435: } else { duke@435: // Something like byte[int+] meets char[int+]. duke@435: // This must fall to bottom, not (int[-128..65535])[int+]. kvn@682: instance_id = InstanceBot; vlivanov@5658: tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable); duke@435: } kvn@2633: } else // Non integral arrays. roland@6214: // Must fall to bottom if exact klasses in upper lattice roland@6214: // are not equal or super klass is exact. roland@6214: if ((above_centerline(ptr) || ptr == Constant) && klass() != tap->klass() && roland@6214: // meet with top[] and bottom[] are processed further down: roland@6214: tap->_klass != NULL && this->_klass != NULL && roland@6214: // both are exact and not equal: roland@6214: ((tap->_klass_is_exact && this->_klass_is_exact) || roland@6214: // 'tap' is exact and super or unrelated: roland@6214: (tap->_klass_is_exact && !tap->klass()->is_subtype_of(klass())) || roland@6214: // 'this' is exact and super or unrelated: roland@6214: (this->_klass_is_exact && !klass()->is_subtype_of(tap->klass())))) { vlivanov@5658: tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable); roland@5991: return make(NotNull, NULL, tary, lazy_klass, false, off, InstanceBot); duke@435: } kvn@2633: kvn@2120: bool xk = false; duke@435: switch (tap->ptr()) { duke@435: case AnyNull: duke@435: case TopPTR: duke@435: // Compute new klass on demand, do not use tap->_klass roland@5991: if (below_centerline(this->_ptr)) { roland@5991: xk = this->_klass_is_exact; roland@5991: } else { roland@5991: xk = (tap->_klass_is_exact | this->_klass_is_exact); roland@5991: } roland@6380: return make(ptr, const_oop(), tary, lazy_klass, xk, off, instance_id, speculative, depth); duke@435: case Constant: { duke@435: ciObject* o = const_oop(); duke@435: if( _ptr == Constant ) { duke@435: if( tap->const_oop() != NULL && !o->equals(tap->const_oop()) ) { jrose@1424: xk = (klass() == tap->klass()); duke@435: ptr = NotNull; duke@435: o = NULL; kvn@682: instance_id = InstanceBot; jrose@1424: } else { jrose@1424: xk = true; duke@435: } roland@5991: } else if(above_centerline(_ptr)) { duke@435: o = tap->const_oop(); jrose@1424: xk = true; jrose@1424: } else { kvn@2120: // Only precise for identical arrays kvn@2120: xk = this->_klass_is_exact && (klass() == tap->klass()); duke@435: } roland@6380: return TypeAryPtr::make(ptr, o, tary, lazy_klass, xk, off, instance_id, speculative, depth); duke@435: } duke@435: case NotNull: duke@435: case BotPTR: duke@435: // Compute new klass on demand, do not use tap->_klass duke@435: if (above_centerline(this->_ptr)) duke@435: xk = tap->_klass_is_exact; duke@435: else xk = (tap->_klass_is_exact & this->_klass_is_exact) && duke@435: (klass() == tap->klass()); // Only precise for identical arrays roland@6380: return TypeAryPtr::make(ptr, NULL, tary, lazy_klass, xk, off, instance_id, speculative, depth); duke@435: default: ShouldNotReachHere(); duke@435: } duke@435: } duke@435: duke@435: // All arrays inherit from Object class duke@435: case InstPtr: { duke@435: const TypeInstPtr *tp = t->is_instptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); kvn@658: int instance_id = meet_instance_id(tp->instance_id()); roland@6313: const TypeOopPtr* speculative = xmeet_speculative(tp); roland@6380: int depth = meet_inline_depth(tp->inline_depth()); duke@435: switch (ptr) { duke@435: case TopPTR: duke@435: case AnyNull: // Fall 'down' to dual of object klass roland@5991: // For instances when a subclass meets a superclass we fall roland@5991: // below the centerline when the superclass is exact. We need to roland@5991: // do the same here. roland@5991: if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) { roland@6380: return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); duke@435: } else { duke@435: // cannot subclass, so the meet has to fall badly below the centerline duke@435: ptr = NotNull; kvn@658: instance_id = InstanceBot; roland@6380: return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth); duke@435: } duke@435: case Constant: duke@435: case NotNull: duke@435: case BotPTR: // Fall down to object klass duke@435: // LCA is object_klass, but if we subclass from the top we can do better duke@435: if (above_centerline(tp->ptr())) { duke@435: // If 'tp' is above the centerline and it is Object class twisti@1040: // then we can subclass in the Java class hierarchy. roland@5991: // For instances when a subclass meets a superclass we fall roland@5991: // below the centerline when the superclass is exact. We need roland@5991: // to do the same here. roland@5991: if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) { duke@435: // that is, my array type is a subtype of 'tp' klass roland@5991: return make(ptr, (ptr == Constant ? const_oop() : NULL), roland@6380: _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); duke@435: } duke@435: } duke@435: // The other case cannot happen, since t cannot be a subtype of an array. duke@435: // The meet falls down to Object class below centerline. duke@435: if( ptr == Constant ) duke@435: ptr = NotNull; kvn@658: instance_id = InstanceBot; roland@6380: return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth); duke@435: default: typerr(t); duke@435: } duke@435: } duke@435: } duke@435: return this; // Lint noise duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: compute field-by-field dual duke@435: const Type *TypeAryPtr::xdual() const { roland@6380: 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()); duke@435: } duke@435: kvn@1255: //----------------------interface_vs_oop--------------------------------------- kvn@1255: #ifdef ASSERT kvn@1255: bool TypeAryPtr::interface_vs_oop(const Type *t) const { kvn@1255: const TypeAryPtr* t_aryptr = t->isa_aryptr(); kvn@1255: if (t_aryptr) { kvn@1255: return _ary->interface_vs_oop(t_aryptr->_ary); kvn@1255: } kvn@1255: return false; kvn@1255: } kvn@1255: #endif kvn@1255: duke@435: //------------------------------dump2------------------------------------------ duke@435: #ifndef PRODUCT duke@435: void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: _ary->dump2(d,depth,st); duke@435: switch( _ptr ) { duke@435: case Constant: duke@435: const_oop()->print(st); duke@435: break; duke@435: case BotPTR: duke@435: if (!WizardMode && !Verbose) { duke@435: if( _klass_is_exact ) st->print(":exact"); duke@435: break; duke@435: } duke@435: case TopPTR: duke@435: case AnyNull: duke@435: case NotNull: duke@435: st->print(":%s", ptr_msg[_ptr]); duke@435: if( _klass_is_exact ) st->print(":exact"); duke@435: break; duke@435: } duke@435: kvn@499: if( _offset != 0 ) { kvn@499: int header_size = objArrayOopDesc::header_size() * wordSize; kvn@499: if( _offset == OffsetTop ) st->print("+undefined"); kvn@499: else if( _offset == OffsetBot ) st->print("+any"); kvn@499: else if( _offset < header_size ) st->print("+%d", _offset); kvn@499: else { kvn@499: BasicType basic_elem_type = elem()->basic_type(); kvn@499: int array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type); kvn@499: int elem_size = type2aelembytes(basic_elem_type); kvn@499: st->print("[%d]", (_offset - array_base)/elem_size); kvn@499: } kvn@499: } kvn@499: st->print(" *"); kvn@658: if (_instance_id == InstanceTop) kvn@658: st->print(",iid=top"); kvn@658: else if (_instance_id != InstanceBot) duke@435: st->print(",iid=%d",_instance_id); roland@5991: roland@6380: dump_inline_depth(st); roland@5991: dump_speculative(st); duke@435: } duke@435: #endif duke@435: duke@435: bool TypeAryPtr::empty(void) const { duke@435: if (_ary->empty()) return true; duke@435: return TypeOopPtr::empty(); duke@435: } duke@435: duke@435: //------------------------------add_offset------------------------------------- roland@5991: const TypePtr *TypeAryPtr::add_offset(intptr_t offset) const { roland@6380: return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); roland@5991: } roland@5991: roland@6313: const Type *TypeAryPtr::remove_speculative() const { roland@6380: if (_speculative == NULL) { roland@6380: return this; roland@6380: } roland@6380: assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); roland@6380: return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, NULL, _inline_depth); roland@6380: } roland@6380: roland@6380: const TypeOopPtr *TypeAryPtr::with_inline_depth(int depth) const { roland@6380: if (!UseInlineDepthForSpeculativeTypes) { roland@6380: return this; roland@6380: } roland@6380: return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth); roland@5991: } duke@435: duke@435: //============================================================================= coleenp@548: coleenp@548: //------------------------------hash------------------------------------------- coleenp@548: // Type-specific hashing function. roland@4159: int TypeNarrowPtr::hash(void) const { never@1262: return _ptrtype->hash() + 7; coleenp@548: } coleenp@548: roland@4159: bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton roland@4159: return _ptrtype->singleton(); roland@4159: } roland@4159: roland@4159: bool TypeNarrowPtr::empty(void) const { roland@4159: return _ptrtype->empty(); roland@4159: } roland@4159: roland@4159: intptr_t TypeNarrowPtr::get_con() const { roland@4159: return _ptrtype->get_con(); roland@4159: } roland@4159: roland@4159: bool TypeNarrowPtr::eq( const Type *t ) const { roland@4159: const TypeNarrowPtr* tc = isa_same_narrowptr(t); coleenp@548: if (tc != NULL) { never@1262: if (_ptrtype->base() != tc->_ptrtype->base()) { coleenp@548: return false; coleenp@548: } never@1262: return tc->_ptrtype->eq(_ptrtype); coleenp@548: } coleenp@548: return false; coleenp@548: } coleenp@548: roland@4159: const Type *TypeNarrowPtr::xdual() const { // Compute dual right now. roland@4159: const TypePtr* odual = _ptrtype->dual()->is_ptr(); roland@4159: return make_same_narrowptr(odual); roland@4159: } roland@4159: roland@4159: roland@6313: const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const { roland@4159: if (isa_same_narrowptr(kills)) { roland@6313: const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative); roland@4159: if (ft->empty()) roland@4159: return Type::TOP; // Canonical empty value roland@4159: if (ft->isa_ptr()) { roland@4159: return make_hash_same_narrowptr(ft->isa_ptr()); roland@4159: } roland@4159: return ft; roland@4159: } else if (kills->isa_ptr()) { roland@6313: const Type* ft = _ptrtype->join_helper(kills, include_speculative); roland@4159: if (ft->empty()) roland@4159: return Type::TOP; // Canonical empty value roland@4159: return ft; roland@4159: } else { roland@4159: return Type::TOP; roland@4159: } coleenp@548: } coleenp@548: kvn@728: //------------------------------xmeet------------------------------------------ coleenp@548: // Compute the MEET of two types. It returns a new Type object. roland@4159: const Type *TypeNarrowPtr::xmeet( const Type *t ) const { coleenp@548: // Perform a fast test for common case; meeting the same types together. coleenp@548: if( this == t ) return this; // Meeting same type-rep? coleenp@548: roland@4159: if (t->base() == base()) { roland@4159: const Type* result = _ptrtype->xmeet(t->make_ptr()); roland@4159: if (result->isa_ptr()) { roland@4159: return make_hash_same_narrowptr(result->is_ptr()); roland@4159: } roland@4159: return result; roland@4159: } roland@4159: roland@4159: // Current "this->_base" is NarrowKlass or NarrowOop coleenp@548: switch (t->base()) { // switch on original type coleenp@548: coleenp@548: case Int: // Mixing ints & oops happens when javac coleenp@548: case Long: // reuses local variables coleenp@548: case FloatTop: coleenp@548: case FloatCon: coleenp@548: case FloatBot: coleenp@548: case DoubleTop: coleenp@548: case DoubleCon: coleenp@548: case DoubleBot: kvn@728: case AnyPtr: kvn@728: case RawPtr: kvn@728: case OopPtr: kvn@728: case InstPtr: coleenp@4037: case AryPtr: coleenp@4037: case MetadataPtr: kvn@728: case KlassPtr: roland@4159: case NarrowOop: roland@4159: case NarrowKlass: kvn@728: coleenp@548: case Bottom: // Ye Olde Default coleenp@548: return Type::BOTTOM; coleenp@548: case Top: coleenp@548: return this; coleenp@548: coleenp@548: default: // All else is a mistake coleenp@548: typerr(t); coleenp@548: coleenp@548: } // End of switch kvn@728: kvn@728: return this; coleenp@548: } coleenp@548: roland@4159: #ifndef PRODUCT roland@4159: void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const { roland@4159: _ptrtype->dump2(d, depth, st); roland@4159: } roland@4159: #endif roland@4159: roland@4159: const TypeNarrowOop *TypeNarrowOop::BOTTOM; roland@4159: const TypeNarrowOop *TypeNarrowOop::NULL_PTR; roland@4159: roland@4159: roland@4159: const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) { roland@4159: return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons(); roland@4159: } roland@4159: coleenp@548: coleenp@548: #ifndef PRODUCT coleenp@548: void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const { never@852: st->print("narrowoop: "); roland@4159: TypeNarrowPtr::dump2(d, depth, st); coleenp@548: } coleenp@548: #endif coleenp@548: roland@4159: const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR; roland@4159: roland@4159: const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) { roland@4159: return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons(); roland@4159: } roland@4159: roland@4159: #ifndef PRODUCT roland@4159: void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const { roland@4159: st->print("narrowklass: "); roland@4159: TypeNarrowPtr::dump2(d, depth, st); roland@4159: } roland@4159: #endif coleenp@548: coleenp@4037: coleenp@4037: //------------------------------eq--------------------------------------------- coleenp@4037: // Structural equality check for Type representations coleenp@4037: bool TypeMetadataPtr::eq( const Type *t ) const { coleenp@4037: const TypeMetadataPtr *a = (const TypeMetadataPtr*)t; coleenp@4037: ciMetadata* one = metadata(); coleenp@4037: ciMetadata* two = a->metadata(); coleenp@4037: if (one == NULL || two == NULL) { coleenp@4037: return (one == two) && TypePtr::eq(t); coleenp@4037: } else { coleenp@4037: return one->equals(two) && TypePtr::eq(t); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------hash------------------------------------------- coleenp@4037: // Type-specific hashing function. coleenp@4037: int TypeMetadataPtr::hash(void) const { coleenp@4037: return coleenp@4037: (metadata() ? metadata()->hash() : 0) + coleenp@4037: TypePtr::hash(); coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------singleton-------------------------------------- coleenp@4037: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple coleenp@4037: // constants coleenp@4037: bool TypeMetadataPtr::singleton(void) const { coleenp@4037: // detune optimizer to not generate constant metadta + constant offset as a constant! coleenp@4037: // TopPTR, Null, AnyNull, Constant are all singletons coleenp@4037: return (_offset == 0) && !below_centerline(_ptr); coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------add_offset------------------------------------- coleenp@4037: const TypePtr *TypeMetadataPtr::add_offset( intptr_t offset ) const { coleenp@4037: return make( _ptr, _metadata, xadd_offset(offset)); coleenp@4037: } coleenp@4037: coleenp@4037: //-----------------------------filter------------------------------------------ coleenp@4037: // Do not allow interface-vs.-noninterface joins to collapse to top. roland@6313: const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const { roland@6313: const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr(); coleenp@4037: if (ft == NULL || ft->empty()) coleenp@4037: return Type::TOP; // Canonical empty value coleenp@4037: return ft; coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------get_con---------------------------------------- coleenp@4037: intptr_t TypeMetadataPtr::get_con() const { coleenp@4037: assert( _ptr == Null || _ptr == Constant, "" ); coleenp@4037: assert( _offset >= 0, "" ); coleenp@4037: coleenp@4037: if (_offset != 0) { coleenp@4037: // After being ported to the compiler interface, the compiler no longer coleenp@4037: // directly manipulates the addresses of oops. Rather, it only has a pointer coleenp@4037: // to a handle at compile time. This handle is embedded in the generated coleenp@4037: // code and dereferenced at the time the nmethod is made. Until that time, coleenp@4037: // it is not reasonable to do arithmetic with the addresses of oops (we don't coleenp@4037: // have access to the addresses!). This does not seem to currently happen, coleenp@4037: // but this assertion here is to help prevent its occurence. coleenp@4037: tty->print_cr("Found oop constant with non-zero offset"); coleenp@4037: ShouldNotReachHere(); coleenp@4037: } coleenp@4037: coleenp@4037: return (intptr_t)metadata()->constant_encoding(); coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------cast_to_ptr_type------------------------------- coleenp@4037: const Type *TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const { coleenp@4037: if( ptr == _ptr ) return this; coleenp@4037: return make(ptr, metadata(), _offset); coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------meet------------------------------------------- coleenp@4037: // Compute the MEET of two types. It returns a new Type object. coleenp@4037: const Type *TypeMetadataPtr::xmeet( const Type *t ) const { coleenp@4037: // Perform a fast test for common case; meeting the same types together. coleenp@4037: if( this == t ) return this; // Meeting same type-rep? coleenp@4037: coleenp@4037: // Current "this->_base" is OopPtr coleenp@4037: switch (t->base()) { // switch on original type coleenp@4037: coleenp@4037: case Int: // Mixing ints & oops happens when javac coleenp@4037: case Long: // reuses local variables coleenp@4037: case FloatTop: coleenp@4037: case FloatCon: coleenp@4037: case FloatBot: coleenp@4037: case DoubleTop: coleenp@4037: case DoubleCon: coleenp@4037: case DoubleBot: coleenp@4037: case NarrowOop: roland@4159: case NarrowKlass: coleenp@4037: case Bottom: // Ye Olde Default coleenp@4037: return Type::BOTTOM; coleenp@4037: case Top: coleenp@4037: return this; coleenp@4037: coleenp@4037: default: // All else is a mistake coleenp@4037: typerr(t); coleenp@4037: coleenp@4037: case AnyPtr: { coleenp@4037: // Found an AnyPtr type vs self-OopPtr type coleenp@4037: const TypePtr *tp = t->is_ptr(); coleenp@4037: int offset = meet_offset(tp->offset()); coleenp@4037: PTR ptr = meet_ptr(tp->ptr()); coleenp@4037: switch (tp->ptr()) { coleenp@4037: case Null: coleenp@4037: if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset); coleenp@4037: // else fall through: coleenp@4037: case TopPTR: coleenp@4037: case AnyNull: { kvn@6429: return make(ptr, _metadata, offset); coleenp@4037: } coleenp@4037: case BotPTR: coleenp@4037: case NotNull: coleenp@4037: return TypePtr::make(AnyPtr, ptr, offset); coleenp@4037: default: typerr(t); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: case RawPtr: coleenp@4037: case KlassPtr: coleenp@4037: case OopPtr: coleenp@4037: case InstPtr: coleenp@4037: case AryPtr: coleenp@4037: return TypePtr::BOTTOM; // Oop meet raw is not well defined coleenp@4037: roland@4040: case MetadataPtr: { roland@4040: const TypeMetadataPtr *tp = t->is_metadataptr(); roland@4040: int offset = meet_offset(tp->offset()); roland@4040: PTR tptr = tp->ptr(); roland@4040: PTR ptr = meet_ptr(tptr); roland@4040: ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata(); roland@4040: if (tptr == TopPTR || _ptr == TopPTR || roland@4040: metadata()->equals(tp->metadata())) { roland@4040: return make(ptr, md, offset); roland@4040: } roland@4040: // metadata is different roland@4040: if( ptr == Constant ) { // Cannot be equal constants, so... roland@4040: if( tptr == Constant && _ptr != Constant) return t; roland@4040: if( _ptr == Constant && tptr != Constant) return this; roland@4040: ptr = NotNull; // Fall down in lattice roland@4040: } roland@4040: return make(ptr, NULL, offset); coleenp@4037: break; roland@4040: } coleenp@4037: } // End of switch coleenp@4037: return this; // Return the double constant coleenp@4037: } coleenp@4037: coleenp@4037: coleenp@4037: //------------------------------xdual------------------------------------------ coleenp@4037: // Dual of a pure metadata pointer. coleenp@4037: const Type *TypeMetadataPtr::xdual() const { coleenp@4037: return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset()); coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------dump2------------------------------------------ coleenp@4037: #ifndef PRODUCT coleenp@4037: void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const { coleenp@4037: st->print("metadataptr:%s", ptr_msg[_ptr]); coleenp@4037: if( metadata() ) st->print(INTPTR_FORMAT, metadata()); coleenp@4037: switch( _offset ) { coleenp@4037: case OffsetTop: st->print("+top"); break; coleenp@4037: case OffsetBot: st->print("+any"); break; coleenp@4037: case 0: break; coleenp@4037: default: st->print("+%d",_offset); break; coleenp@4037: } coleenp@4037: } coleenp@4037: #endif coleenp@4037: coleenp@4037: coleenp@4037: //============================================================================= coleenp@4037: // Convenience common pre-built type. coleenp@4037: const TypeMetadataPtr *TypeMetadataPtr::BOTTOM; coleenp@4037: coleenp@4037: TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset): coleenp@4037: TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) { coleenp@4037: } coleenp@4037: coleenp@4037: const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) { coleenp@4037: return make(Constant, m, 0); coleenp@4037: } coleenp@4037: const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) { coleenp@4037: return make(Constant, m, 0); coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------make------------------------------------------- coleenp@4037: // Create a meta data constant coleenp@4037: const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) { coleenp@4037: assert(m == NULL || !m->is_klass(), "wrong type"); coleenp@4037: return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons(); coleenp@4037: } coleenp@4037: coleenp@4037: coleenp@548: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: duke@435: // Not-null object klass or below duke@435: const TypeKlassPtr *TypeKlassPtr::OBJECT; duke@435: const TypeKlassPtr *TypeKlassPtr::OBJECT_OR_NULL; duke@435: coleenp@4037: //------------------------------TypeKlassPtr----------------------------------- duke@435: TypeKlassPtr::TypeKlassPtr( PTR ptr, ciKlass* klass, int offset ) coleenp@4037: : TypePtr(KlassPtr, ptr, offset), _klass(klass), _klass_is_exact(ptr == Constant) { duke@435: } duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: // ptr to klass 'k', if Constant, or possibly to a sub-klass if not a Constant duke@435: const TypeKlassPtr *TypeKlassPtr::make( PTR ptr, ciKlass* k, int offset ) { duke@435: assert( k != NULL, "Expect a non-NULL klass"); coleenp@4037: assert(k->is_instance_klass() || k->is_array_klass(), "Incorrect type of klass oop"); duke@435: TypeKlassPtr *r = duke@435: (TypeKlassPtr*)(new TypeKlassPtr(ptr, k, offset))->hashcons(); duke@435: duke@435: return r; duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeKlassPtr::eq( const Type *t ) const { duke@435: const TypeKlassPtr *p = t->is_klassptr(); duke@435: return duke@435: klass()->equals(p->klass()) && coleenp@4037: TypePtr::eq(p); duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeKlassPtr::hash(void) const { coleenp@4037: return klass()->hash() + TypePtr::hash(); coleenp@4037: } coleenp@4037: coleenp@4037: //------------------------------singleton-------------------------------------- coleenp@4037: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple coleenp@4037: // constants coleenp@4037: bool TypeKlassPtr::singleton(void) const { coleenp@4037: // detune optimizer to not generate constant klass + constant offset as a constant! coleenp@4037: // TopPTR, Null, AnyNull, Constant are all singletons coleenp@4037: return (_offset == 0) && !below_centerline(_ptr); coleenp@4037: } duke@435: roland@6043: // Do not allow interface-vs.-noninterface joins to collapse to top. roland@6313: const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const { roland@6043: // logic here mirrors the one from TypeOopPtr::filter. See comments roland@6043: // there. roland@6313: const Type* ft = join_helper(kills, include_speculative); roland@6043: const TypeKlassPtr* ftkp = ft->isa_klassptr(); roland@6043: const TypeKlassPtr* ktkp = kills->isa_klassptr(); roland@6043: roland@6043: if (ft->empty()) { roland@6043: if (!empty() && ktkp != NULL && ktkp->klass()->is_loaded() && ktkp->klass()->is_interface()) roland@6043: return kills; // Uplift to interface roland@6043: roland@6043: return Type::TOP; // Canonical empty value roland@6043: } roland@6043: roland@6043: // Interface klass type could be exact in opposite to interface type, roland@6043: // return it here instead of incorrect Constant ptr J/L/Object (6894807). roland@6043: if (ftkp != NULL && ktkp != NULL && roland@6043: ftkp->is_loaded() && ftkp->klass()->is_interface() && roland@6043: !ftkp->klass_is_exact() && // Keep exact interface klass roland@6043: ktkp->is_loaded() && !ktkp->klass()->is_interface()) { roland@6043: return ktkp->cast_to_ptr_type(ftkp->ptr()); roland@6043: } roland@6043: roland@6043: return ft; roland@6043: } roland@6043: kvn@2116: //----------------------compute_klass------------------------------------------ kvn@2116: // Compute the defining klass for this class kvn@2116: ciKlass* TypeAryPtr::compute_klass(DEBUG_ONLY(bool verify)) const { kvn@2116: // Compute _klass based on element type. duke@435: ciKlass* k_ary = NULL; duke@435: const TypeInstPtr *tinst; duke@435: const TypeAryPtr *tary; coleenp@548: const Type* el = elem(); coleenp@548: if (el->isa_narrowoop()) { kvn@656: el = el->make_ptr(); coleenp@548: } coleenp@548: duke@435: // Get element klass coleenp@548: if ((tinst = el->isa_instptr()) != NULL) { duke@435: // Compute array klass from element klass duke@435: k_ary = ciObjArrayKlass::make(tinst->klass()); coleenp@548: } else if ((tary = el->isa_aryptr()) != NULL) { duke@435: // Compute array klass from element klass duke@435: ciKlass* k_elem = tary->klass(); duke@435: // If element type is something like bottom[], k_elem will be null. duke@435: if (k_elem != NULL) duke@435: k_ary = ciObjArrayKlass::make(k_elem); coleenp@548: } else if ((el->base() == Type::Top) || coleenp@548: (el->base() == Type::Bottom)) { duke@435: // element type of Bottom occurs from meet of basic type duke@435: // and object; Top occurs when doing join on Bottom. duke@435: // Leave k_ary at NULL. duke@435: } else { duke@435: // Cannot compute array klass directly from basic type, duke@435: // since subtypes of TypeInt all have basic type T_INT. kvn@2116: #ifdef ASSERT kvn@2116: if (verify && el->isa_int()) { kvn@2116: // Check simple cases when verifying klass. kvn@2116: BasicType bt = T_ILLEGAL; kvn@2116: if (el == TypeInt::BYTE) { kvn@2116: bt = T_BYTE; kvn@2116: } else if (el == TypeInt::SHORT) { kvn@2116: bt = T_SHORT; kvn@2116: } else if (el == TypeInt::CHAR) { kvn@2116: bt = T_CHAR; kvn@2116: } else if (el == TypeInt::INT) { kvn@2116: bt = T_INT; kvn@2116: } else { kvn@2116: return _klass; // just return specified klass kvn@2116: } kvn@2116: return ciTypeArrayKlass::make(bt); kvn@2116: } kvn@2116: #endif coleenp@548: assert(!el->isa_int(), duke@435: "integral arrays must be pre-equipped with a class"); duke@435: // Compute array klass directly from basic type coleenp@548: k_ary = ciTypeArrayKlass::make(el->basic_type()); duke@435: } kvn@2116: return k_ary; kvn@2116: } kvn@2116: kvn@2116: //------------------------------klass------------------------------------------ kvn@2116: // Return the defining klass for this class kvn@2116: ciKlass* TypeAryPtr::klass() const { kvn@2116: if( _klass ) return _klass; // Return cached value, if possible kvn@2116: kvn@2116: // Oops, need to compute _klass and cache it kvn@2116: ciKlass* k_ary = compute_klass(); duke@435: kvn@2636: if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) { duke@435: // The _klass field acts as a cache of the underlying duke@435: // ciKlass for this array type. In order to set the field, duke@435: // we need to cast away const-ness. duke@435: // duke@435: // IMPORTANT NOTE: we *never* set the _klass field for the duke@435: // type TypeAryPtr::OOPS. This Type is shared between all duke@435: // active compilations. However, the ciKlass which represents duke@435: // this Type is *not* shared between compilations, so caching duke@435: // this value would result in fetching a dangling pointer. duke@435: // duke@435: // Recomputing the underlying ciKlass for each request is duke@435: // a bit less efficient than caching, but calls to duke@435: // TypeAryPtr::OOPS->klass() are not common enough to matter. duke@435: ((TypeAryPtr*)this)->_klass = k_ary; kvn@598: if (UseCompressedOops && k_ary != NULL && k_ary->is_obj_array_klass() && kvn@598: _offset != 0 && _offset != arrayOopDesc::length_offset_in_bytes()) { kvn@598: ((TypeAryPtr*)this)->_is_ptr_to_narrowoop = true; kvn@598: } kvn@598: } duke@435: return k_ary; duke@435: } duke@435: duke@435: duke@435: //------------------------------add_offset------------------------------------- duke@435: // Access internals of klass object kvn@741: const TypePtr *TypeKlassPtr::add_offset( intptr_t offset ) const { duke@435: return make( _ptr, klass(), xadd_offset(offset) ); duke@435: } duke@435: duke@435: //------------------------------cast_to_ptr_type------------------------------- duke@435: const Type *TypeKlassPtr::cast_to_ptr_type(PTR ptr) const { kvn@992: assert(_base == KlassPtr, "subclass must override cast_to_ptr_type"); duke@435: if( ptr == _ptr ) return this; duke@435: return make(ptr, _klass, _offset); duke@435: } duke@435: duke@435: duke@435: //-----------------------------cast_to_exactness------------------------------- duke@435: const Type *TypeKlassPtr::cast_to_exactness(bool klass_is_exact) const { duke@435: if( klass_is_exact == _klass_is_exact ) return this; duke@435: if (!UseExactTypes) return this; duke@435: return make(klass_is_exact ? Constant : NotNull, _klass, _offset); duke@435: } duke@435: duke@435: duke@435: //-----------------------------as_instance_type-------------------------------- duke@435: // Corresponding type for an instance of the given class. duke@435: // It will be NotNull, and exact if and only if the klass type is exact. duke@435: const TypeOopPtr* TypeKlassPtr::as_instance_type() const { duke@435: ciKlass* k = klass(); duke@435: bool xk = klass_is_exact(); duke@435: //return TypeInstPtr::make(TypePtr::NotNull, k, xk, NULL, 0); duke@435: const TypeOopPtr* toop = TypeOopPtr::make_from_klass_raw(k); morris@4760: guarantee(toop != NULL, "need type for given klass"); duke@435: toop = toop->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); duke@435: return toop->cast_to_exactness(xk)->is_oopptr(); duke@435: } duke@435: duke@435: duke@435: //------------------------------xmeet------------------------------------------ duke@435: // Compute the MEET of two types, return a new Type object. duke@435: const Type *TypeKlassPtr::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is Pointer duke@435: switch (t->base()) { // switch on original type duke@435: duke@435: case Int: // Mixing ints & oops happens when javac duke@435: case Long: // reuses local variables duke@435: case FloatTop: duke@435: case FloatCon: duke@435: case FloatBot: duke@435: case DoubleTop: duke@435: case DoubleCon: duke@435: case DoubleBot: kvn@728: case NarrowOop: roland@4159: case NarrowKlass: duke@435: case Bottom: // Ye Olde Default duke@435: return Type::BOTTOM; duke@435: case Top: duke@435: return this; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case AnyPtr: { // Meeting to AnyPtrs duke@435: // Found an AnyPtr type vs self-KlassPtr type duke@435: const TypePtr *tp = t->is_ptr(); duke@435: int offset = meet_offset(tp->offset()); duke@435: PTR ptr = meet_ptr(tp->ptr()); duke@435: switch (tp->ptr()) { duke@435: case TopPTR: duke@435: return this; duke@435: case Null: duke@435: if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset ); duke@435: case AnyNull: duke@435: return make( ptr, klass(), offset ); duke@435: case BotPTR: duke@435: case NotNull: duke@435: return TypePtr::make(AnyPtr, ptr, offset); duke@435: default: typerr(t); duke@435: } duke@435: } duke@435: coleenp@4037: case RawPtr: coleenp@4037: case MetadataPtr: coleenp@4037: case OopPtr: duke@435: case AryPtr: // Meet with AryPtr duke@435: case InstPtr: // Meet with InstPtr coleenp@4037: return TypePtr::BOTTOM; duke@435: duke@435: // duke@435: // A-top } duke@435: // / | \ } Tops duke@435: // B-top A-any C-top } duke@435: // | / | \ | } Any-nulls duke@435: // B-any | C-any } duke@435: // | | | duke@435: // B-con A-con C-con } constants; not comparable across classes duke@435: // | | | duke@435: // B-not | C-not } duke@435: // | \ | / | } not-nulls duke@435: // B-bot A-not C-bot } duke@435: // \ | / } Bottoms duke@435: // A-bot } duke@435: // duke@435: duke@435: case KlassPtr: { // Meet two KlassPtr types duke@435: const TypeKlassPtr *tkls = t->is_klassptr(); duke@435: int off = meet_offset(tkls->offset()); duke@435: PTR ptr = meet_ptr(tkls->ptr()); duke@435: duke@435: // Check for easy case; klasses are equal (and perhaps not loaded!) duke@435: // If we have constants, then we created oops so classes are loaded duke@435: // and we can handle the constants further down. This case handles duke@435: // not-loaded classes duke@435: if( ptr != Constant && tkls->klass()->equals(klass()) ) { duke@435: return make( ptr, klass(), off ); duke@435: } duke@435: duke@435: // Classes require inspection in the Java klass hierarchy. Must be loaded. duke@435: ciKlass* tkls_klass = tkls->klass(); duke@435: ciKlass* this_klass = this->klass(); duke@435: assert( tkls_klass->is_loaded(), "This class should have been loaded."); duke@435: assert( this_klass->is_loaded(), "This class should have been loaded."); duke@435: duke@435: // If 'this' type is above the centerline and is a superclass of the duke@435: // other, we can treat 'this' as having the same type as the other. duke@435: if ((above_centerline(this->ptr())) && duke@435: tkls_klass->is_subtype_of(this_klass)) { duke@435: this_klass = tkls_klass; duke@435: } duke@435: // If 'tinst' type is above the centerline and is a superclass of the duke@435: // other, we can treat 'tinst' as having the same type as the other. duke@435: if ((above_centerline(tkls->ptr())) && duke@435: this_klass->is_subtype_of(tkls_klass)) { duke@435: tkls_klass = this_klass; duke@435: } duke@435: duke@435: // Check for classes now being equal duke@435: if (tkls_klass->equals(this_klass)) { duke@435: // If the klasses are equal, the constants may still differ. Fall to duke@435: // NotNull if they do (neither constant is NULL; that is a special case duke@435: // handled elsewhere). duke@435: if( ptr == Constant ) { coleenp@4037: if (this->_ptr == Constant && tkls->_ptr == Constant && coleenp@4037: this->klass()->equals(tkls->klass())); coleenp@4037: else if (above_centerline(this->ptr())); coleenp@4037: else if (above_centerline(tkls->ptr())); duke@435: else duke@435: ptr = NotNull; duke@435: } duke@435: return make( ptr, this_klass, off ); duke@435: } // Else classes are not equal duke@435: duke@435: // Since klasses are different, we require the LCA in the Java duke@435: // class hierarchy - which means we have to fall to at least NotNull. duke@435: if( ptr == TopPTR || ptr == AnyNull || ptr == Constant ) duke@435: ptr = NotNull; duke@435: // Now we find the LCA of Java classes duke@435: ciKlass* k = this_klass->least_common_ancestor(tkls_klass); duke@435: return make( ptr, k, off ); duke@435: } // End of case KlassPtr duke@435: duke@435: } // End of switch duke@435: return this; // Return the double constant duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: compute field-by-field dual duke@435: const Type *TypeKlassPtr::xdual() const { duke@435: return new TypeKlassPtr( dual_ptr(), klass(), dual_offset() ); duke@435: } duke@435: coleenp@4037: //------------------------------get_con---------------------------------------- coleenp@4037: intptr_t TypeKlassPtr::get_con() const { coleenp@4037: assert( _ptr == Null || _ptr == Constant, "" ); coleenp@4037: assert( _offset >= 0, "" ); coleenp@4037: coleenp@4037: if (_offset != 0) { coleenp@4037: // After being ported to the compiler interface, the compiler no longer coleenp@4037: // directly manipulates the addresses of oops. Rather, it only has a pointer coleenp@4037: // to a handle at compile time. This handle is embedded in the generated coleenp@4037: // code and dereferenced at the time the nmethod is made. Until that time, coleenp@4037: // it is not reasonable to do arithmetic with the addresses of oops (we don't coleenp@4037: // have access to the addresses!). This does not seem to currently happen, coleenp@4037: // but this assertion here is to help prevent its occurence. coleenp@4037: tty->print_cr("Found oop constant with non-zero offset"); coleenp@4037: ShouldNotReachHere(); coleenp@4037: } coleenp@4037: coleenp@4037: return (intptr_t)klass()->constant_encoding(); coleenp@4037: } duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump Klass Type duke@435: #ifndef PRODUCT duke@435: void TypeKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const { duke@435: switch( _ptr ) { duke@435: case Constant: duke@435: st->print("precise "); duke@435: case NotNull: duke@435: { duke@435: const char *name = klass()->name()->as_utf8(); duke@435: if( name ) { duke@435: st->print("klass %s: " INTPTR_FORMAT, name, klass()); duke@435: } else { duke@435: ShouldNotReachHere(); duke@435: } duke@435: } duke@435: case BotPTR: duke@435: if( !WizardMode && !Verbose && !_klass_is_exact ) break; duke@435: case TopPTR: duke@435: case AnyNull: duke@435: st->print(":%s", ptr_msg[_ptr]); duke@435: if( _klass_is_exact ) st->print(":exact"); duke@435: break; duke@435: } duke@435: duke@435: if( _offset ) { // Dump offset, if any duke@435: if( _offset == OffsetBot ) { st->print("+any"); } duke@435: else if( _offset == OffsetTop ) { st->print("+unknown"); } duke@435: else { st->print("+%d", _offset); } duke@435: } duke@435: duke@435: st->print(" *"); duke@435: } duke@435: #endif duke@435: duke@435: duke@435: duke@435: //============================================================================= duke@435: // Convenience common pre-built types. duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) { duke@435: return (TypeFunc*)(new TypeFunc(domain,range))->hashcons(); duke@435: } duke@435: duke@435: //------------------------------make------------------------------------------- duke@435: const TypeFunc *TypeFunc::make(ciMethod* method) { duke@435: Compile* C = Compile::current(); duke@435: const TypeFunc* tf = C->last_tf(method); // check cache duke@435: if (tf != NULL) return tf; // The hit rate here is almost 50%. duke@435: const TypeTuple *domain; twisti@1572: if (method->is_static()) { duke@435: domain = TypeTuple::make_domain(NULL, method->signature()); duke@435: } else { duke@435: domain = TypeTuple::make_domain(method->holder(), method->signature()); duke@435: } duke@435: const TypeTuple *range = TypeTuple::make_range(method->signature()); duke@435: tf = TypeFunc::make(domain, range); duke@435: C->set_last_tf(method, tf); // fill cache duke@435: return tf; duke@435: } duke@435: duke@435: //------------------------------meet------------------------------------------- duke@435: // Compute the MEET of two types. It returns a new Type object. duke@435: const Type *TypeFunc::xmeet( const Type *t ) const { duke@435: // Perform a fast test for common case; meeting the same types together. duke@435: if( this == t ) return this; // Meeting same type-rep? duke@435: duke@435: // Current "this->_base" is Func duke@435: switch (t->base()) { // switch on original type duke@435: duke@435: case Bottom: // Ye Olde Default duke@435: return t; duke@435: duke@435: default: // All else is a mistake duke@435: typerr(t); duke@435: duke@435: case Top: duke@435: break; duke@435: } duke@435: return this; // Return the double constant duke@435: } duke@435: duke@435: //------------------------------xdual------------------------------------------ duke@435: // Dual: compute field-by-field dual duke@435: const Type *TypeFunc::xdual() const { duke@435: return this; duke@435: } duke@435: duke@435: //------------------------------eq--------------------------------------------- duke@435: // Structural equality check for Type representations duke@435: bool TypeFunc::eq( const Type *t ) const { duke@435: const TypeFunc *a = (const TypeFunc*)t; duke@435: return _domain == a->_domain && duke@435: _range == a->_range; duke@435: } duke@435: duke@435: //------------------------------hash------------------------------------------- duke@435: // Type-specific hashing function. duke@435: int TypeFunc::hash(void) const { duke@435: return (intptr_t)_domain + (intptr_t)_range; duke@435: } duke@435: duke@435: //------------------------------dump2------------------------------------------ duke@435: // Dump Function Type duke@435: #ifndef PRODUCT duke@435: void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const { duke@435: if( _range->_cnt <= Parms ) duke@435: st->print("void"); duke@435: else { duke@435: uint i; duke@435: for (i = Parms; i < _range->_cnt-1; i++) { duke@435: _range->field_at(i)->dump2(d,depth,st); duke@435: st->print("/"); duke@435: } duke@435: _range->field_at(i)->dump2(d,depth,st); duke@435: } duke@435: st->print(" "); duke@435: st->print("( "); duke@435: if( !depth || d[this] ) { // Check for recursive dump duke@435: st->print("...)"); duke@435: return; duke@435: } duke@435: d.Insert((void*)this,(void*)this); // Stop recursion duke@435: if (Parms < _domain->_cnt) duke@435: _domain->field_at(Parms)->dump2(d,depth-1,st); duke@435: for (uint i = Parms+1; i < _domain->_cnt; i++) { duke@435: st->print(", "); duke@435: _domain->field_at(i)->dump2(d,depth-1,st); duke@435: } duke@435: st->print(" )"); duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------singleton-------------------------------------- duke@435: // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple duke@435: // constants (Ldi nodes). Singletons are integer, float or double constants duke@435: // or a single symbol. duke@435: bool TypeFunc::singleton(void) const { duke@435: return false; // Never a singleton duke@435: } duke@435: duke@435: bool TypeFunc::empty(void) const { duke@435: return false; // Never empty duke@435: } duke@435: duke@435: duke@435: BasicType TypeFunc::return_type() const{ duke@435: if (range()->cnt() == TypeFunc::Parms) { duke@435: return T_VOID; duke@435: } duke@435: return range()->field_at(TypeFunc::Parms)->basic_type(); duke@435: }