5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "ci/ciMethodData.hpp"
26 #include "ci/ciTypeFlow.hpp"
27 #include "classfile/javaClasses.hpp"
28 #include "classfile/symbolTable.hpp"
29 #include "classfile/vmSymbols.hpp"
30 #include "compiler/compileLog.hpp"
31 #include "libadt/dict.hpp"
32 #include "memory/oopFactory.hpp"
33 #include "memory/resourceArea.hpp"
34 #include "oops/instanceKlass.hpp"
35 #include "oops/instanceMirrorKlass.hpp"
36 #include "oops/objArrayKlass.hpp"
37 #include "oops/typeArrayKlass.hpp"
38 #include "opto/arraycopynode.hpp"
39 #include "opto/callnode.hpp"
40 #include "opto/matcher.hpp"
41 #include "opto/node.hpp"
42 #include "opto/opcodes.hpp"
43 #include "opto/rangeinference.hpp"
44 #include "opto/runtime.hpp"
45 #include "opto/type.hpp"
46 #include "runtime/stubRoutines.hpp"
47 #include "utilities/checkedCast.hpp"
48 #include "utilities/debug.hpp"
49 #include "utilities/ostream.hpp"
50 #include "utilities/powerOfTwo.hpp"
51 #include "utilities/stringUtils.hpp"
52 #if INCLUDE_SHENANDOAHGC
53 #include "gc/shenandoah/c2/shenandoahBarrierSetC2.hpp"
54 #endif // INCLUDE_SHENANDOAHGC
55
56 // Portions of code courtesy of Clifford Click
57
58 // Optimization - Graph Style
59
60 // Dictionary of types shared among compilations.
61 Dict* Type::_shared_type_dict = nullptr;
62
63 // Array which maps compiler types to Basic Types
64 const Type::TypeInfo Type::_type_info[Type::lastype] = {
65 { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg}, // Bad
66 { Control, T_ILLEGAL, "control", false, 0 }, // Control
67 { Bottom, T_VOID, "top", false, 0 }, // Top
68 { Bad, T_INT, "int:", false, Op_RegI }, // Int
69 { Bad, T_LONG, "long:", false, Op_RegL }, // Long
70 { Half, T_VOID, "half", false, 0 }, // Half
71 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN }, // NarrowOop
72 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN }, // NarrowKlass
73 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg}, // Tuple
74 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg}, // Array
75 { Bad, T_ARRAY, "interfaces:", false, Node::NotAMachineReg}, // Interfaces
76
77 #if defined(PPC64)
78 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask }, // VectorMask.
79 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA }, // VectorA.
80 { Bad, T_ILLEGAL, "vectors:", false, 0 }, // VectorS
81 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL }, // VectorD
220 case ciTypeFlow::StateVector::T_NULL:
221 assert(type == ciTypeFlow::StateVector::null_type(), "");
222 return TypePtr::NULL_PTR;
223
224 case ciTypeFlow::StateVector::T_LONG2:
225 // The ciTypeFlow pass pushes a long, then the half.
226 // We do the same.
227 assert(type == ciTypeFlow::StateVector::long2_type(), "");
228 return TypeInt::TOP;
229
230 case ciTypeFlow::StateVector::T_DOUBLE2:
231 // The ciTypeFlow pass pushes double, then the half.
232 // Our convention is the same.
233 assert(type == ciTypeFlow::StateVector::double2_type(), "");
234 return Type::TOP;
235
236 case T_ADDRESS:
237 assert(type->is_return_address(), "");
238 return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci(), relocInfo::none);
239
240 default:
241 // make sure we did not mix up the cases:
242 assert(type != ciTypeFlow::StateVector::bottom_type(), "");
243 assert(type != ciTypeFlow::StateVector::top_type(), "");
244 assert(type != ciTypeFlow::StateVector::null_type(), "");
245 assert(type != ciTypeFlow::StateVector::long2_type(), "");
246 assert(type != ciTypeFlow::StateVector::double2_type(), "");
247 assert(!type->is_return_address(), "");
248
249 return Type::get_const_type(type);
250 }
251 }
252
253
254 //-----------------------make_from_constant------------------------------------
255 const Type* Type::make_from_constant(ciConstant constant, bool require_constant,
256 int stable_dimension, bool is_narrow_oop,
257 bool is_autobox_cache) {
258 switch (constant.basic_type()) {
259 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
309 case T_NARROWOOP: loadbt = T_OBJECT; break;
310 case T_ARRAY: loadbt = T_OBJECT; break;
311 case T_ADDRESS: loadbt = T_OBJECT; break;
312 default: break;
313 }
314 if (conbt == loadbt) {
315 if (is_unsigned && conbt == T_BYTE) {
316 // LoadB (T_BYTE) with a small mask (<=8-bit) is converted to LoadUB (T_BYTE).
317 return ciConstant(T_INT, con.as_int() & 0xFF);
318 } else {
319 return con;
320 }
321 }
322 if (conbt == T_SHORT && loadbt == T_CHAR) {
323 // LoadS (T_SHORT) with a small mask (<=16-bit) is converted to LoadUS (T_CHAR).
324 return ciConstant(T_INT, con.as_int() & 0xFFFF);
325 }
326 return ciConstant(); // T_ILLEGAL
327 }
328
329 // Try to constant-fold a stable array element.
330 const Type* Type::make_constant_from_array_element(ciArray* array, int off, int stable_dimension,
331 BasicType loadbt, bool is_unsigned_load) {
332 // Decode the results of GraphKit::array_element_address.
333 ciConstant element_value = array->element_value_by_offset(off);
334 if (element_value.basic_type() == T_ILLEGAL) {
335 return nullptr; // wrong offset
336 }
337 ciConstant con = check_mismatched_access(element_value, loadbt, is_unsigned_load);
338
339 assert(con.basic_type() != T_ILLEGAL, "elembt=%s; loadbt=%s; unsigned=%d",
340 type2name(element_value.basic_type()), type2name(loadbt), is_unsigned_load);
341
342 if (con.is_valid() && // not a mismatched access
343 !con.is_null_or_zero()) { // not a default value
344 bool is_narrow_oop = (loadbt == T_NARROWOOP);
345 return Type::make_from_constant(con, /*require_constant=*/true, stable_dimension, is_narrow_oop, /*is_autobox_cache=*/false);
346 }
347 return nullptr;
348 }
349
350 const Type* Type::make_constant_from_field(ciInstance* holder, int off, bool is_unsigned_load, BasicType loadbt) {
351 ciField* field;
352 ciType* type = holder->java_mirror_type();
353 if (type != nullptr && type->is_instance_klass() && off >= InstanceMirrorKlass::offset_of_static_fields()) {
354 // Static field
355 field = type->as_instance_klass()->get_field_by_offset(off, /*is_static=*/true);
356 } else {
357 // Instance field
358 field = holder->klass()->as_instance_klass()->get_field_by_offset(off, /*is_static=*/false);
359 }
360 if (field == nullptr) {
361 return nullptr; // Wrong offset
362 }
363 return Type::make_constant_from_field(field, holder, loadbt, is_unsigned_load);
364 }
365
366 const Type* Type::make_constant_from_field(ciField* field, ciInstance* holder,
367 BasicType loadbt, bool is_unsigned_load) {
368 if (!field->is_constant()) {
369 return nullptr; // Non-constant field
542 const Type **ffalse =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
543 ffalse[0] = Type::CONTROL;
544 ffalse[1] = Type::TOP;
545 TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse );
546
547 const Type **fneither =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
548 fneither[0] = Type::TOP;
549 fneither[1] = Type::TOP;
550 TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither );
551
552 const Type **ftrue =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
553 ftrue[0] = Type::TOP;
554 ftrue[1] = Type::CONTROL;
555 TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue );
556
557 const Type **floop =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
558 floop[0] = Type::CONTROL;
559 floop[1] = TypeInt::INT;
560 TypeTuple::LOOPBODY = TypeTuple::make( 2, floop );
561
562 TypePtr::NULL_PTR= TypePtr::make(AnyPtr, TypePtr::Null, 0);
563 TypePtr::NOTNULL = TypePtr::make(AnyPtr, TypePtr::NotNull, OffsetBot);
564 TypePtr::BOTTOM = TypePtr::make(AnyPtr, TypePtr::BotPTR, OffsetBot);
565
566 TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR );
567 TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull );
568
569 const Type **fmembar = TypeTuple::fields(0);
570 TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar);
571
572 const Type **fsc = (const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
573 fsc[0] = TypeInt::CC;
574 fsc[1] = Type::MEMORY;
575 TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc);
576
577 TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass());
578 TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass());
579 TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass());
580 TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
581 false, nullptr, oopDesc::mark_offset_in_bytes());
582 TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
583 false, nullptr, oopDesc::klass_offset_in_bytes());
584 TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot, TypeOopPtr::InstanceBot);
585
586 TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, nullptr, OffsetBot);
587
588 TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR );
589 TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM );
590
591 TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR );
592
593 mreg2type[Op_Node] = Type::BOTTOM;
594 mreg2type[Op_Set ] = nullptr;
595 mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM;
596 mreg2type[Op_RegI] = TypeInt::INT;
597 mreg2type[Op_RegP] = TypePtr::BOTTOM;
598 mreg2type[Op_RegF] = Type::FLOAT;
599 mreg2type[Op_RegD] = Type::DOUBLE;
600 mreg2type[Op_RegL] = TypeLong::LONG;
601 mreg2type[Op_RegFlags] = TypeInt::CC;
602
603 GrowableArray<ciInstanceKlass*> array_interfaces;
604 array_interfaces.push(current->env()->Cloneable_klass());
605 array_interfaces.push(current->env()->Serializable_klass());
606 TypeAryPtr::_array_interfaces = TypeInterfaces::make(&array_interfaces);
607 TypeAryKlassPtr::_array_interfaces = TypeAryPtr::_array_interfaces;
608
609 TypeAryPtr::BOTTOM = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::BOTTOM, TypeInt::POS), nullptr, false, Type::OffsetBot);
610 TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), nullptr /* current->env()->Object_klass() */, false, arrayOopDesc::length_offset_in_bytes());
611
612 TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), nullptr /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
613
614 #ifdef _LP64
615 if (UseCompressedOops) {
616 assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop");
617 TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS;
618 } else
619 #endif
620 {
621 // There is no shared klass for Object[]. See note in TypeAryPtr::klass().
622 TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), nullptr /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
623 }
624 TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot);
625 TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot);
626 TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot);
627 TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot);
628 TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot);
629 TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot);
630 TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot);
631
632 // Nobody should ask _array_body_type[T_NARROWOOP]. Use null as assert.
633 TypeAryPtr::_array_body_type[T_NARROWOOP] = nullptr;
634 TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS;
635 TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays
636 TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES;
637 TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array
638 TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS;
639 TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS;
640 TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS;
641 TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS;
642 TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS;
643 TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES;
644
645 TypeInstKlassPtr::OBJECT = TypeInstKlassPtr::make(TypePtr::NotNull, current->env()->Object_klass(), 0);
646 TypeInstKlassPtr::OBJECT_OR_NULL = TypeInstKlassPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), 0);
647
648 const Type **fi2c = TypeTuple::fields(2);
649 fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method*
650 fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer
651 TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c);
652
653 const Type **intpair = TypeTuple::fields(2);
654 intpair[0] = TypeInt::INT;
655 intpair[1] = TypeInt::INT;
656 TypeTuple::INT_PAIR = TypeTuple::make(2, intpair);
657
658 const Type **longpair = TypeTuple::fields(2);
659 longpair[0] = TypeLong::LONG;
660 longpair[1] = TypeLong::LONG;
661 TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair);
662
663 const Type **intccpair = TypeTuple::fields(2);
664 intccpair[0] = TypeInt::INT;
665 intccpair[1] = TypeInt::CC;
666 TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair);
667
668 const Type **longccpair = TypeTuple::fields(2);
669 longccpair[0] = TypeLong::LONG;
670 longccpair[1] = TypeInt::CC;
671 TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair);
672
673 _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM;
674 _const_basic_type[T_NARROWKLASS] = Type::BOTTOM;
675 _const_basic_type[T_BOOLEAN] = TypeInt::BOOL;
676 _const_basic_type[T_CHAR] = TypeInt::CHAR;
677 _const_basic_type[T_BYTE] = TypeInt::BYTE;
678 _const_basic_type[T_SHORT] = TypeInt::SHORT;
679 _const_basic_type[T_INT] = TypeInt::INT;
680 _const_basic_type[T_LONG] = TypeLong::LONG;
681 _const_basic_type[T_FLOAT] = Type::FLOAT;
682 _const_basic_type[T_DOUBLE] = Type::DOUBLE;
683 _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM;
684 _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays
685 _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way
686 _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs
687 _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not?
688
689 _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR;
690 _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR;
691 _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0
692 _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0
693 _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0
694 _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0
695 _zero_type[T_INT] = TypeInt::ZERO;
696 _zero_type[T_LONG] = TypeLong::ZERO;
697 _zero_type[T_FLOAT] = TypeF::ZERO;
698 _zero_type[T_DOUBLE] = TypeD::ZERO;
699 _zero_type[T_OBJECT] = TypePtr::NULL_PTR;
700 _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop
701 _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null
702 _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all
703
704 // get_zero_type() should not happen for T_CONFLICT
705 _zero_type[T_CONFLICT]= nullptr;
706
707 TypeVect::VECTMASK = (TypeVect*)(new TypePVectMask(T_BOOLEAN, MaxVectorSize))->hashcons();
708 mreg2type[Op_RegVectMask] = TypeVect::VECTMASK;
709
710 if (Matcher::supports_scalable_vector()) {
711 TypeVect::VECTA = TypeVect::make(T_BYTE, Matcher::scalable_vector_reg_size(T_BYTE));
712 }
713
714 // Vector predefined types, it needs initialized _const_basic_type[].
715 if (Matcher::vector_size_supported(T_BYTE, 4)) {
716 TypeVect::VECTS = TypeVect::make(T_BYTE, 4);
717 }
718 if (Matcher::vector_size_supported(T_FLOAT, 2)) {
719 TypeVect::VECTD = TypeVect::make(T_FLOAT, 2);
720 }
960 ~VerifyMeet() {
961 assert(_C->_type_verify->_depth != 0, "");
962 _C->_type_verify->_depth--;
963 if (_C->_type_verify->_depth == 0) {
964 _C->_type_verify->_cache.trunc_to(0);
965 }
966 }
967
968 const Type* meet(const Type* t1, const Type* t2) const {
969 return _C->_type_verify->meet(t1, t2);
970 }
971
972 void add(const Type* t1, const Type* t2, const Type* res) const {
973 _C->_type_verify->add(t1, t2, res);
974 }
975 };
976
977 void Type::check_symmetrical(const Type* t, const Type* mt, const VerifyMeet& verify) const {
978 Compile* C = Compile::current();
979 const Type* mt2 = verify.meet(t, this);
980 if (mt != mt2) {
981 tty->print_cr("=== Meet Not Commutative ===");
982 tty->print("t = "); t->dump(); tty->cr();
983 tty->print("this = "); dump(); tty->cr();
984 tty->print("t meet this = "); mt2->dump(); tty->cr();
985 tty->print("this meet t = "); mt->dump(); tty->cr();
986 fatal("meet not commutative");
987 }
988 const Type* dual_join = mt->_dual;
989 const Type* t2t = verify.meet(dual_join,t->_dual);
990 const Type* t2this = verify.meet(dual_join,this->_dual);
991
992 // Interface meet Oop is Not Symmetric:
993 // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull
994 // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull
995
996 if (t2t != t->_dual || t2this != this->_dual) {
997 tty->print_cr("=== Meet Not Symmetric ===");
998 tty->print("t = "); t->dump(); tty->cr();
999 tty->print("this= "); dump(); tty->cr();
1000 tty->print("mt=(t meet this)= "); mt->dump(); tty->cr();
1001
1002 tty->print("t_dual= "); t->_dual->dump(); tty->cr();
1003 tty->print("this_dual= "); _dual->dump(); tty->cr();
1004 tty->print("mt_dual= "); mt->_dual->dump(); tty->cr();
1005
1006 tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr();
1007 tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr();
1008
1009 fatal("meet not symmetric");
1010 }
1011 }
1012 #endif
1013
1014 //------------------------------meet-------------------------------------------
1015 // Compute the MEET of two types. NOT virtual. It enforces that meet is
1016 // commutative and the lattice is symmetric.
1017 const Type *Type::meet_helper(const Type *t, bool include_speculative) const {
1018 if (isa_narrowoop() && t->isa_narrowoop()) {
1019 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
1020 return result->make_narrowoop();
1021 }
1022 if (isa_narrowklass() && t->isa_narrowklass()) {
1023 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
1024 return result->make_narrowklass();
1025 }
1026
1027 #ifdef ASSERT
1028 Compile* C = Compile::current();
1029 VerifyMeet verify(C);
1030 #endif
1031
1032 const Type *this_t = maybe_remove_speculative(include_speculative);
1033 t = t->maybe_remove_speculative(include_speculative);
1034
1035 const Type *mt = this_t->xmeet(t);
1036 #ifdef ASSERT
1037 verify.add(this_t, t, mt);
1038 if (isa_narrowoop() || t->isa_narrowoop()) {
1039 return mt;
1040 }
1041 if (isa_narrowklass() || t->isa_narrowklass()) {
1042 return mt;
1043 }
1044 this_t->check_symmetrical(t, mt, verify);
1045 const Type *mt_dual = verify.meet(this_t->_dual, t->_dual);
1046 this_t->_dual->check_symmetrical(t->_dual, mt_dual, verify);
1047 #endif
1048 return mt;
1049 }
1050
1051 //------------------------------xmeet------------------------------------------
1052 // Compute the MEET of two types. It returns a new Type object.
1053 const Type *Type::xmeet( const Type *t ) const {
1054 // Perform a fast test for common case; meeting the same types together.
1055 if( this == t ) return this; // Meeting same type-rep?
1056
1057 // Meeting TOP with anything?
1058 if( _base == Top ) return t;
1059
1060 // Meeting BOTTOM with anything?
1061 if( _base == Bottom ) return BOTTOM;
1062
1063 // Current "this->_base" is one of: Bad, Multi, Control, Top,
2054 void TypeLong::dump_verbose() const {
2055 TypeIntHelper::int_type_dump(this, tty, true);
2056 }
2057 #endif
2058
2059 //=============================================================================
2060 // Convenience common pre-built types.
2061 const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable
2062 const TypeTuple *TypeTuple::IFFALSE;
2063 const TypeTuple *TypeTuple::IFTRUE;
2064 const TypeTuple *TypeTuple::IFNEITHER;
2065 const TypeTuple *TypeTuple::LOOPBODY;
2066 const TypeTuple *TypeTuple::MEMBAR;
2067 const TypeTuple *TypeTuple::STORECONDITIONAL;
2068 const TypeTuple *TypeTuple::START_I2C;
2069 const TypeTuple *TypeTuple::INT_PAIR;
2070 const TypeTuple *TypeTuple::LONG_PAIR;
2071 const TypeTuple *TypeTuple::INT_CC_PAIR;
2072 const TypeTuple *TypeTuple::LONG_CC_PAIR;
2073
2074 //------------------------------make-------------------------------------------
2075 // Make a TypeTuple from the range of a method signature
2076 const TypeTuple *TypeTuple::make_range(ciSignature* sig, InterfaceHandling interface_handling) {
2077 ciType* return_type = sig->return_type();
2078 uint arg_cnt = return_type->size();
2079 const Type **field_array = fields(arg_cnt);
2080 switch (return_type->basic_type()) {
2081 case T_LONG:
2082 field_array[TypeFunc::Parms] = TypeLong::LONG;
2083 field_array[TypeFunc::Parms+1] = Type::HALF;
2084 break;
2085 case T_DOUBLE:
2086 field_array[TypeFunc::Parms] = Type::DOUBLE;
2087 field_array[TypeFunc::Parms+1] = Type::HALF;
2088 break;
2089 case T_OBJECT:
2090 case T_ARRAY:
2091 case T_BOOLEAN:
2092 case T_CHAR:
2093 case T_FLOAT:
2094 case T_BYTE:
2095 case T_SHORT:
2096 case T_INT:
2097 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling);
2098 break;
2099 case T_VOID:
2100 break;
2101 default:
2102 ShouldNotReachHere();
2103 }
2104 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2105 }
2106
2107 // Make a TypeTuple from the domain of a method signature
2108 const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig, InterfaceHandling interface_handling) {
2109 uint arg_cnt = sig->size();
2110
2111 uint pos = TypeFunc::Parms;
2112 const Type **field_array;
2113 if (recv != nullptr) {
2114 arg_cnt++;
2115 field_array = fields(arg_cnt);
2116 // Use get_const_type here because it respects UseUniqueSubclasses:
2117 field_array[pos++] = get_const_type(recv, interface_handling)->join_speculative(TypePtr::NOTNULL);
2118 } else {
2119 field_array = fields(arg_cnt);
2120 }
2121
2122 int i = 0;
2123 while (pos < TypeFunc::Parms + arg_cnt) {
2124 ciType* type = sig->type_at(i);
2125
2126 switch (type->basic_type()) {
2127 case T_LONG:
2128 field_array[pos++] = TypeLong::LONG;
2129 field_array[pos++] = Type::HALF;
2130 break;
2131 case T_DOUBLE:
2132 field_array[pos++] = Type::DOUBLE;
2133 field_array[pos++] = Type::HALF;
2134 break;
2135 case T_OBJECT:
2136 case T_ARRAY:
2137 case T_FLOAT:
2138 case T_INT:
2139 field_array[pos++] = get_const_type(type, interface_handling);
2140 break;
2141 case T_BOOLEAN:
2142 case T_CHAR:
2143 case T_BYTE:
2144 case T_SHORT:
2145 field_array[pos++] = TypeInt::INT;
2146 break;
2147 default:
2148 ShouldNotReachHere();
2149 }
2150 i++;
2151 }
2152
2153 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2154 }
2155
2156 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) {
2157 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons();
2158 }
2159
2160 //------------------------------fields-----------------------------------------
2161 // Subroutine call type with space allocated for argument types
2162 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly
2163 const Type **TypeTuple::fields( uint arg_cnt ) {
2164 const Type **flds = (const Type **)(Compile::current()->type_arena()->AmallocWords((TypeFunc::Parms+arg_cnt)*sizeof(Type*) ));
2165 flds[TypeFunc::Control ] = Type::CONTROL;
2166 flds[TypeFunc::I_O ] = Type::ABIO;
2167 flds[TypeFunc::Memory ] = Type::MEMORY;
2168 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM;
2169 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS;
2170
2171 return flds;
2266 if (_fields[i]->empty()) return true;
2267 }
2268 return false;
2269 }
2270
2271 //=============================================================================
2272 // Convenience common pre-built types.
2273
2274 inline const TypeInt* normalize_array_size(const TypeInt* size) {
2275 // Certain normalizations keep us sane when comparing types.
2276 // We do not want arrayOop variables to differ only by the wideness
2277 // of their index types. Pick minimum wideness, since that is the
2278 // forced wideness of small ranges anyway.
2279 if (size->_widen != Type::WidenMin)
2280 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin);
2281 else
2282 return size;
2283 }
2284
2285 //------------------------------make-------------------------------------------
2286 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable) {
2287 if (UseCompressedOops && elem->isa_oopptr()) {
2288 elem = elem->make_narrowoop();
2289 }
2290 size = normalize_array_size(size);
2291 return (TypeAry*)(new TypeAry(elem,size,stable))->hashcons();
2292 }
2293
2294 //------------------------------meet-------------------------------------------
2295 // Compute the MEET of two types. It returns a new Type object.
2296 const Type *TypeAry::xmeet( const Type *t ) const {
2297 // Perform a fast test for common case; meeting the same types together.
2298 if( this == t ) return this; // Meeting same type-rep?
2299
2300 // Current "this->_base" is Ary
2301 switch (t->base()) { // switch on original type
2302
2303 case Bottom: // Ye Olde Default
2304 return t;
2305
2306 default: // All else is a mistake
2307 typerr(t);
2308
2309 case Array: { // Meeting 2 arrays?
2310 const TypeAry* a = t->is_ary();
2311 const Type* size = _size->xmeet(a->_size);
2312 const TypeInt* isize = size->isa_int();
2313 if (isize == nullptr) {
2314 assert(size == Type::TOP || size == Type::BOTTOM, "");
2315 return size;
2316 }
2317 return TypeAry::make(_elem->meet_speculative(a->_elem),
2318 isize, _stable && a->_stable);
2319 }
2320 case Top:
2321 break;
2322 }
2323 return this; // Return the double constant
2324 }
2325
2326 //------------------------------xdual------------------------------------------
2327 // Dual: compute field-by-field dual
2328 const Type *TypeAry::xdual() const {
2329 const TypeInt* size_dual = _size->dual()->is_int();
2330 size_dual = normalize_array_size(size_dual);
2331 return new TypeAry(_elem->dual(), size_dual, !_stable);
2332 }
2333
2334 //------------------------------eq---------------------------------------------
2335 // Structural equality check for Type representations
2336 bool TypeAry::eq( const Type *t ) const {
2337 const TypeAry *a = (const TypeAry*)t;
2338 return _elem == a->_elem &&
2339 _stable == a->_stable &&
2340 _size == a->_size;
2341 }
2342
2343 //------------------------------hash-------------------------------------------
2344 // Type-specific hashing function.
2345 uint TypeAry::hash(void) const {
2346 return (uint)(uintptr_t)_elem + (uint)(uintptr_t)_size + (uint)(_stable ? 43 : 0);
2347 }
2348
2349 /**
2350 * Return same type without a speculative part in the element
2351 */
2352 const TypeAry* TypeAry::remove_speculative() const {
2353 return make(_elem->remove_speculative(), _size, _stable);
2354 }
2355
2356 /**
2357 * Return same type with cleaned up speculative part of element
2358 */
2359 const Type* TypeAry::cleanup_speculative() const {
2360 return make(_elem->cleanup_speculative(), _size, _stable);
2361 }
2362
2363 /**
2364 * Return same type but with a different inline depth (used for speculation)
2365 *
2366 * @param depth depth to meet with
2367 */
2368 const TypePtr* TypePtr::with_inline_depth(int depth) const {
2369 if (!UseInlineDepthForSpeculativeTypes) {
2370 return this;
2371 }
2372 return make(AnyPtr, _ptr, _offset, _speculative, depth, _reloc);
2373 }
2374
2375 //------------------------------dump2------------------------------------------
2376 #ifndef PRODUCT
2377 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const {
2378 if (_stable) st->print("stable:");
2379 _elem->dump2(d, depth, st);
2380 st->print("[");
2381 _size->dump2(d, depth, st);
2382 st->print("]");
2383 }
2384 #endif
2385
2386 //------------------------------singleton--------------------------------------
2387 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2388 // constants (Ldi nodes). Singletons are integer, float or double constants
2389 // or a single symbol.
2390 bool TypeAry::singleton(void) const {
2391 return false; // Never a singleton
2392 }
2393
2394 bool TypeAry::empty(void) const {
2395 return _elem->empty() || _size->empty();
2396 }
2397
2398 //--------------------------ary_must_be_exact----------------------------------
2399 bool TypeAry::ary_must_be_exact() const {
2400 // This logic looks at the element type of an array, and returns true
2401 // if the element type is either a primitive or a final instance class.
2402 // In such cases, an array built on this ary must have no subclasses.
2403 if (_elem == BOTTOM) return false; // general array not exact
2404 if (_elem == TOP ) return false; // inverted general array not exact
2405 const TypeOopPtr* toop = nullptr;
2406 if (UseCompressedOops && _elem->isa_narrowoop()) {
2407 toop = _elem->make_ptr()->isa_oopptr();
2408 } else {
2409 toop = _elem->isa_oopptr();
2410 }
2411 if (!toop) return true; // a primitive type, like int
2412 if (!toop->is_loaded()) return false; // unloaded class
2413 const TypeInstPtr* tinst;
2414 if (_elem->isa_narrowoop())
2415 tinst = _elem->make_ptr()->isa_instptr();
2416 else
2417 tinst = _elem->isa_instptr();
2418 if (tinst)
2419 return tinst->instance_klass()->is_final();
2420 const TypeAryPtr* tap;
2421 if (_elem->isa_narrowoop())
2422 tap = _elem->make_ptr()->isa_aryptr();
2423 else
2424 tap = _elem->isa_aryptr();
2425 if (tap)
2426 return tap->ary()->ary_must_be_exact();
2427 return false;
2428 }
2429
2430 //==============================TypeVect=======================================
2431 // Convenience common pre-built types.
2432 const TypeVect* TypeVect::VECTA = nullptr; // vector length agnostic
2433 const TypeVect* TypeVect::VECTS = nullptr; // 32-bit vectors
2434 const TypeVect* TypeVect::VECTD = nullptr; // 64-bit vectors
2435 const TypeVect* TypeVect::VECTX = nullptr; // 128-bit vectors
2436 const TypeVect* TypeVect::VECTY = nullptr; // 256-bit vectors
2437 const TypeVect* TypeVect::VECTZ = nullptr; // 512-bit vectors
2438 const TypeVect* TypeVect::VECTMASK = nullptr; // predicate/mask vector
2439
2580
2581 //=============================================================================
2582 // Convenience common pre-built types.
2583 const TypePtr *TypePtr::NULL_PTR;
2584 const TypePtr *TypePtr::NOTNULL;
2585 const TypePtr *TypePtr::BOTTOM;
2586
2587 //------------------------------meet-------------------------------------------
2588 // Meet over the PTR enum
2589 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = {
2590 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,
2591 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,},
2592 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,},
2593 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,},
2594 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,},
2595 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,},
2596 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,}
2597 };
2598
2599 //------------------------------make-------------------------------------------
2600 const TypePtr* TypePtr::make(TYPES t, enum PTR ptr, int offset,
2601 const TypePtr* speculative, int inline_depth,
2602 relocInfo::relocType reloc) {
2603 return (TypePtr*)(new TypePtr(t, ptr, offset, reloc, speculative, inline_depth))->hashcons();
2604 }
2605
2606 //------------------------------cast_to_ptr_type-------------------------------
2607 const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const {
2608 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
2609 if( ptr == _ptr ) return this;
2610 return make(_base, ptr, _offset, _speculative, _inline_depth, _reloc);
2611 }
2612
2613 //------------------------------get_con----------------------------------------
2614 intptr_t TypePtr::get_con() const {
2615 assert( _ptr == Null, "" );
2616 return _offset;
2617 }
2618
2619 //------------------------------meet-------------------------------------------
2620 // Compute the MEET of two types. It returns a new Type object.
2621 const Type *TypePtr::xmeet(const Type *t) const {
2622 const Type* res = xmeet_helper(t);
2623 if (res->isa_ptr() == nullptr) {
2624 return res;
2625 }
2626
2627 const TypePtr* res_ptr = res->is_ptr();
2628 if (res_ptr->speculative() != nullptr) {
2629 // type->speculative() is null means that speculation is no better
2630 // than type, i.e. type->speculative() == type. So there are 2
2631 // ways to represent the fact that we have no useful speculative
2632 // data and we should use a single one to be able to test for
2633 // equality between types. Check whether type->speculative() ==
2634 // type and set speculative to null if it is the case.
2635 if (res_ptr->remove_speculative() == res_ptr->speculative()) {
2636 return res_ptr->remove_speculative();
2670 int depth = meet_inline_depth(tp->inline_depth());
2671 return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth);
2672 }
2673 case RawPtr: // For these, flip the call around to cut down
2674 case OopPtr:
2675 case InstPtr: // on the cases I have to handle.
2676 case AryPtr:
2677 case MetadataPtr:
2678 case KlassPtr:
2679 case InstKlassPtr:
2680 case AryKlassPtr:
2681 return t->xmeet(this); // Call in reverse direction
2682 default: // All else is a mistake
2683 typerr(t);
2684
2685 }
2686 return this;
2687 }
2688
2689 //------------------------------meet_offset------------------------------------
2690 int TypePtr::meet_offset( int offset ) const {
2691 // Either is 'TOP' offset? Return the other offset!
2692 if( _offset == OffsetTop ) return offset;
2693 if( offset == OffsetTop ) return _offset;
2694 // If either is different, return 'BOTTOM' offset
2695 if( _offset != offset ) return OffsetBot;
2696 return _offset;
2697 }
2698
2699 //------------------------------dual_offset------------------------------------
2700 int TypePtr::dual_offset( ) const {
2701 if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM'
2702 if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP'
2703 return _offset; // Map everything else into self
2704 }
2705
2706 //------------------------------xdual------------------------------------------
2707 // Dual: compute field-by-field dual
2708 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
2709 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
2710 };
2711 const Type *TypePtr::xdual() const {
2712 return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), relocInfo::none, dual_speculative(), dual_inline_depth());
2713 }
2714
2715 //------------------------------xadd_offset------------------------------------
2716 int TypePtr::xadd_offset( intptr_t offset ) const {
2717 // Adding to 'TOP' offset? Return 'TOP'!
2718 if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop;
2719 // Adding to 'BOTTOM' offset? Return 'BOTTOM'!
2720 if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot;
2721 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'!
2722 offset += (intptr_t)_offset;
2723 if (offset != (int)offset || offset == OffsetTop) return OffsetBot;
2724
2725 // assert( _offset >= 0 && _offset+offset >= 0, "" );
2726 // It is possible to construct a negative offset during PhaseCCP
2727
2728 return (int)offset; // Sum valid offsets
2729 }
2730
2731 //------------------------------add_offset-------------------------------------
2732 const TypePtr *TypePtr::add_offset( intptr_t offset ) const {
2733 return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth, _reloc);
2734 }
2735
2736 const TypePtr *TypePtr::with_offset(intptr_t offset) const {
2737 return make(AnyPtr, _ptr, offset, _speculative, _inline_depth, _reloc);
2738 }
2739
2740 //------------------------------eq---------------------------------------------
2741 // Structural equality check for Type representations
2742 bool TypePtr::eq( const Type *t ) const {
2743 const TypePtr *a = (const TypePtr*)t;
2744 return _ptr == a->ptr() && _offset == a->offset() && _reloc == a->reloc() &&
2745 eq_speculative(a) && _inline_depth == a->_inline_depth;
2746 }
2747
2748 //------------------------------hash-------------------------------------------
2749 // Type-specific hashing function.
2750 uint TypePtr::hash(void) const {
2751 return (uint)_ptr + (uint)_offset + (uint)_reloc + (uint)hash_speculative() + (uint)_inline_depth;
2752 }
2753
2754 /**
2755 * Return same type without a speculative part
2756 */
2757 const TypePtr* TypePtr::remove_speculative() const {
2758 if (_speculative == nullptr) {
2759 return this;
2760 }
2761 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
2762 return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth, _reloc);
2763 }
2764
2765 /**
2766 * Return same type but drop speculative part if we know we won't use
2767 * it
2768 */
2769 const Type* TypePtr::cleanup_speculative() const {
2770 if (speculative() == nullptr) {
2771 return this;
2988 return false;
2989 }
2990 // We already know the speculative type cannot be null
2991 if (!speculative_maybe_null()) {
2992 return false;
2993 }
2994 // We already know this is always null
2995 if (this == TypePtr::NULL_PTR) {
2996 return false;
2997 }
2998 // We already know the speculative type is always null
2999 if (speculative_always_null()) {
3000 return false;
3001 }
3002 if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) {
3003 return false;
3004 }
3005 return true;
3006 }
3007
3008 //------------------------------dump2------------------------------------------
3009 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
3010 "TopPTR","AnyNull","Constant","null","NotNull","BotPTR"
3011 };
3012
3013 #ifndef PRODUCT
3014 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
3015 st->print("ptr:%s", ptr_msg[_ptr]);
3016 dump_offset(st);
3017 dump_inline_depth(st);
3018 dump_speculative(st);
3019 }
3020
3021 void TypePtr::dump_offset(outputStream* st) const {
3022 if (_offset == OffsetBot) {
3023 st->print("+bot");
3024 } else if (_offset == OffsetTop) {
3025 st->print("+top");
3026 } else {
3027 st->print("+%d", _offset);
3028 }
3029 }
3030
3031 /**
3032 *dump the speculative part of the type
3033 */
3034 void TypePtr::dump_speculative(outputStream *st) const {
3035 if (_speculative != nullptr) {
3036 st->print(" (speculative=");
3037 _speculative->dump_on(st);
3038 st->print(")");
3039 }
3040 }
3041
3042 /**
3043 *dump the inline depth of the type
3044 */
3045 void TypePtr::dump_inline_depth(outputStream *st) const {
3046 if (_inline_depth != InlineDepthBottom) {
3047 if (_inline_depth == InlineDepthTop) {
3048 st->print(" (inline_depth=InlineDepthTop)");
3049 } else {
3050 st->print(" (inline_depth=%d)", _inline_depth);
3051 }
3052 }
3053 }
3054 #endif
3055
3056 //------------------------------singleton--------------------------------------
3057 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3058 // constants
3059 bool TypePtr::singleton(void) const {
3060 // TopPTR, Null, AnyNull, Constant are all singletons
3061 return (_offset != OffsetBot) && !below_centerline(_ptr);
3062 }
3063
3064 bool TypePtr::empty(void) const {
3065 return (_offset == OffsetTop) || above_centerline(_ptr);
3066 }
3067
3068 //=============================================================================
3069 // Convenience common pre-built types.
3070 const TypeRawPtr *TypeRawPtr::BOTTOM;
3071 const TypeRawPtr *TypeRawPtr::NOTNULL;
3072
3073 //------------------------------make-------------------------------------------
3074 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
3075 assert( ptr != Constant, "what is the constant?" );
3076 assert( ptr != Null, "Use TypePtr for null" );
3077 return (TypeRawPtr*)(new TypeRawPtr(ptr, nullptr, relocInfo::none))->hashcons();
3078 }
3079
3080 const TypeRawPtr* TypeRawPtr::make(address bits, relocInfo::relocType reloc) {
3081 assert(bits != nullptr, "Use TypePtr for null");
3082 return (TypeRawPtr*)(new TypeRawPtr(Constant, bits, reloc))->hashcons();
3083 }
3084
3085 //------------------------------cast_to_ptr_type-------------------------------
3453 #endif
3454
3455 // Can't be implemented because there's no way to know if the type is above or below the center line.
3456 const Type* TypeInterfaces::xmeet(const Type* t) const {
3457 ShouldNotReachHere();
3458 return Type::xmeet(t);
3459 }
3460
3461 bool TypeInterfaces::singleton(void) const {
3462 ShouldNotReachHere();
3463 return Type::singleton();
3464 }
3465
3466 bool TypeInterfaces::has_non_array_interface() const {
3467 assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?");
3468
3469 return !TypeAryPtr::_array_interfaces->contains(this);
3470 }
3471
3472 //------------------------------TypeOopPtr-------------------------------------
3473 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int offset,
3474 int instance_id, const TypePtr* speculative, int inline_depth)
3475 : TypePtr(t, ptr, offset, relocInfo::oop_type, speculative, inline_depth),
3476 _const_oop(o), _klass(k),
3477 _interfaces(interfaces),
3478 _klass_is_exact(xk),
3479 _is_ptr_to_narrowoop(false),
3480 _is_ptr_to_narrowklass(false),
3481 _is_ptr_to_boxed_value(false),
3482 _instance_id(instance_id) {
3483 #ifdef ASSERT
3484 if (klass() != nullptr && klass()->is_loaded()) {
3485 interfaces->verify_is_loaded();
3486 }
3487 #endif
3488 if (Compile::current()->eliminate_boxing() && (t == InstPtr) &&
3489 (offset > 0) && xk && (k != nullptr) && k->is_instance_klass()) {
3490 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset);
3491 }
3492 #ifdef _LP64
3493 if (_offset > 0 || _offset == Type::OffsetTop || _offset == Type::OffsetBot) {
3494 if (_offset == oopDesc::klass_offset_in_bytes()) {
3495 _is_ptr_to_narrowklass = true;
3496 } else if (klass() == nullptr) {
3497 // Array with unknown body type
3498 assert(this->isa_aryptr(), "only arrays without klass");
3499 _is_ptr_to_narrowoop = UseCompressedOops;
3500 } else if (this->isa_aryptr()) {
3501 _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() &&
3502 _offset != arrayOopDesc::length_offset_in_bytes());
3503 } else if (klass()->is_instance_klass()) {
3504 ciInstanceKlass* ik = klass()->as_instance_klass();
3505 if (this->isa_klassptr()) {
3506 // Perm objects don't use compressed references
3507 } else if (_offset == OffsetBot || _offset == OffsetTop) {
3508 // unsafe access
3509 _is_ptr_to_narrowoop = UseCompressedOops;
3510 } else {
3511 assert(this->isa_instptr(), "must be an instance ptr.");
3512
3513 if (klass() == ciEnv::current()->Class_klass() &&
3514 (_offset == java_lang_Class::klass_offset() ||
3515 _offset == java_lang_Class::array_klass_offset())) {
3516 // Special hidden fields from the Class.
3517 assert(this->isa_instptr(), "must be an instance ptr.");
3518 _is_ptr_to_narrowoop = false;
3519 } else if (klass() == ciEnv::current()->Class_klass() &&
3520 _offset >= InstanceMirrorKlass::offset_of_static_fields()) {
3521 // Static fields
3522 BasicType basic_elem_type = T_ILLEGAL;
3523 if (const_oop() != nullptr) {
3524 ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass();
3525 basic_elem_type = k->get_field_type_by_offset(_offset, true);
3526 }
3527 if (basic_elem_type != T_ILLEGAL) {
3528 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3529 } else {
3530 // unsafe access
3531 _is_ptr_to_narrowoop = UseCompressedOops;
3532 }
3533 } else {
3534 // Instance fields which contains a compressed oop references.
3535 BasicType basic_elem_type = ik->get_field_type_by_offset(_offset, false);
3536 if (basic_elem_type != T_ILLEGAL) {
3537 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3538 } else if (klass()->equals(ciEnv::current()->Object_klass())) {
3539 // Compile::find_alias_type() cast exactness on all types to verify
3540 // that it does not affect alias type.
3541 _is_ptr_to_narrowoop = UseCompressedOops;
3542 } else {
3543 // Type for the copy start in LibraryCallKit::inline_native_clone().
3544 _is_ptr_to_narrowoop = UseCompressedOops;
3545 }
3546 }
3547 }
3548 }
3549 }
3550 #endif
3551 }
3552
3553 //------------------------------make-------------------------------------------
3554 const TypeOopPtr *TypeOopPtr::make(PTR ptr, int offset, int instance_id,
3555 const TypePtr* speculative, int inline_depth) {
3556 assert(ptr != Constant, "no constant generic pointers");
3557 ciKlass* k = Compile::current()->env()->Object_klass();
3558 bool xk = false;
3559 ciObject* o = nullptr;
3560 const TypeInterfaces* interfaces = TypeInterfaces::make();
3561 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, instance_id, speculative, inline_depth))->hashcons();
3562 }
3563
3564
3565 //------------------------------cast_to_ptr_type-------------------------------
3566 const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
3567 assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
3568 if( ptr == _ptr ) return this;
3569 return make(ptr, _offset, _instance_id, _speculative, _inline_depth);
3570 }
3571
3572 //-----------------------------cast_to_instance_id----------------------------
3573 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
3574 // There are no instances of a general oop.
3575 // Return self unchanged.
3576 return this;
3577 }
3578
3579 //-----------------------------cast_to_exactness-------------------------------
3580 const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
3581 // There is no such thing as an exact general oop.
3582 // Return self unchanged.
3583 return this;
3584 }
3585
3586
3587 //------------------------------as_klass_type----------------------------------
3588 // Return the klass type corresponding to this instance or array type.
3589 // It is the type that is loaded from an object of this type.
3590 const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const {
3591 ShouldNotReachHere();
3592 return nullptr;
3593 }
3594
3595 //------------------------------meet-------------------------------------------
3596 // Compute the MEET of two types. It returns a new Type object.
3597 const Type *TypeOopPtr::xmeet_helper(const Type *t) const {
3598 // Perform a fast test for common case; meeting the same types together.
3599 if( this == t ) return this; // Meeting same type-rep?
3600
3601 // Current "this->_base" is OopPtr
3602 switch (t->base()) { // switch on original type
3603
3604 case Int: // Mixing ints & oops happens when javac
3605 case Long: // reuses local variables
3606 case HalfFloatTop:
3615 case NarrowOop:
3616 case NarrowKlass:
3617 case Bottom: // Ye Olde Default
3618 return Type::BOTTOM;
3619 case Top:
3620 return this;
3621
3622 default: // All else is a mistake
3623 typerr(t);
3624
3625 case RawPtr:
3626 case MetadataPtr:
3627 case KlassPtr:
3628 case InstKlassPtr:
3629 case AryKlassPtr:
3630 return TypePtr::BOTTOM; // Oop meet raw is not well defined
3631
3632 case AnyPtr: {
3633 // Found an AnyPtr type vs self-OopPtr type
3634 const TypePtr *tp = t->is_ptr();
3635 int offset = meet_offset(tp->offset());
3636 PTR ptr = meet_ptr(tp->ptr());
3637 const TypePtr* speculative = xmeet_speculative(tp);
3638 int depth = meet_inline_depth(tp->inline_depth());
3639 switch (tp->ptr()) {
3640 case Null:
3641 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3642 // else fall through:
3643 case TopPTR:
3644 case AnyNull: {
3645 int instance_id = meet_instance_id(InstanceTop);
3646 return make(ptr, offset, instance_id, speculative, depth);
3647 }
3648 case BotPTR:
3649 case NotNull:
3650 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3651 default: typerr(t);
3652 }
3653 }
3654
3655 case OopPtr: { // Meeting to other OopPtrs
3657 int instance_id = meet_instance_id(tp->instance_id());
3658 const TypePtr* speculative = xmeet_speculative(tp);
3659 int depth = meet_inline_depth(tp->inline_depth());
3660 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth);
3661 }
3662
3663 case InstPtr: // For these, flip the call around to cut down
3664 case AryPtr:
3665 return t->xmeet(this); // Call in reverse direction
3666
3667 } // End of switch
3668 return this; // Return the double constant
3669 }
3670
3671
3672 //------------------------------xdual------------------------------------------
3673 // Dual of a pure heap pointer. No relevant klass or oop information.
3674 const Type *TypeOopPtr::xdual() const {
3675 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here");
3676 assert(const_oop() == nullptr, "no constants here");
3677 return new TypeOopPtr(_base, dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
3678 }
3679
3680 //--------------------------make_from_klass_common-----------------------------
3681 // Computes the element-type given a klass.
3682 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass* klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) {
3683 if (klass->is_instance_klass()) {
3684 Compile* C = Compile::current();
3685 Dependencies* deps = C->dependencies();
3686 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
3687 // Element is an instance
3688 bool klass_is_exact = false;
3689 if (klass->is_loaded()) {
3690 // Try to set klass_is_exact.
3691 ciInstanceKlass* ik = klass->as_instance_klass();
3692 klass_is_exact = ik->is_final();
3693 if (!klass_is_exact && klass_change
3694 && deps != nullptr && UseUniqueSubclasses) {
3695 ciInstanceKlass* sub = ik->unique_concrete_subklass();
3696 if (sub != nullptr) {
3697 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
3698 klass = ik = sub;
3699 klass_is_exact = sub->is_final();
3700 }
3701 }
3702 if (!klass_is_exact && try_for_exact && deps != nullptr &&
3703 !ik->is_interface() && !ik->has_subklass()) {
3704 // Add a dependence; if concrete subclass added we need to recompile
3705 deps->assert_leaf_type(ik);
3706 klass_is_exact = true;
3707 }
3708 }
3709 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
3710 return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, 0);
3711 } else if (klass->is_obj_array_klass()) {
3712 // Element is an object array. Recursively call ourself.
3713 ciKlass* eklass = klass->as_obj_array_klass()->element_klass();
3714 const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(eklass, false, try_for_exact, interface_handling);
3715 bool xk = etype->klass_is_exact();
3716 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
3717 // We used to pass NotNull in here, asserting that the sub-arrays
3718 // are all not-null. This is not true in generally, as code can
3719 // slam nulls down in the subarrays.
3720 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, 0);
3721 return arr;
3722 } else if (klass->is_type_array_klass()) {
3723 // Element is an typeArray
3724 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
3725 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
3726 // We used to pass NotNull in here, asserting that the array pointer
3727 // is not-null. That was not true in general.
3728 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0);
3729 return arr;
3730 } else {
3731 ShouldNotReachHere();
3732 return nullptr;
3733 }
3734 }
3735
3736 //------------------------------make_from_constant-----------------------------
3737 // Make a java pointer from an oop constant
3738 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) {
3739 assert(!o->is_null_object(), "null object not yet handled here.");
3740
3741 const bool make_constant = require_constant || o->should_be_constant();
3742
3743 ciKlass* klass = o->klass();
3744 if (klass->is_instance_klass()) {
3745 // Element is an instance
3746 if (make_constant) {
3747 return TypeInstPtr::make(o);
3748 } else {
3749 return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, 0);
3750 }
3751 } else if (klass->is_obj_array_klass()) {
3752 // Element is an object array. Recursively call ourself.
3753 const TypeOopPtr *etype =
3754 TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass(), trust_interfaces);
3755 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
3756 // We used to pass NotNull in here, asserting that the sub-arrays
3757 // are all not-null. This is not true in generally, as code can
3758 // slam nulls down in the subarrays.
3759 if (make_constant) {
3760 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
3761 } else {
3762 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
3763 }
3764 } else if (klass->is_type_array_klass()) {
3765 // Element is an typeArray
3766 const Type* etype =
3767 (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
3768 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
3769 // We used to pass NotNull in here, asserting that the array pointer
3770 // is not-null. That was not true in general.
3771 if (make_constant) {
3772 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
3773 } else {
3774 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
3775 }
3776 }
3777
3778 fatal("unhandled object type");
3779 return nullptr;
3780 }
3781
3782 //------------------------------get_con----------------------------------------
3783 intptr_t TypeOopPtr::get_con() const {
3784 assert( _ptr == Null || _ptr == Constant, "" );
3785 assert( _offset >= 0, "" );
3786
3787 if (_offset != 0) {
3788 // After being ported to the compiler interface, the compiler no longer
3789 // directly manipulates the addresses of oops. Rather, it only has a pointer
3790 // to a handle at compile time. This handle is embedded in the generated
3791 // code and dereferenced at the time the nmethod is made. Until that time,
3792 // it is not reasonable to do arithmetic with the addresses of oops (we don't
3793 // have access to the addresses!). This does not seem to currently happen,
3794 // but this assertion here is to help prevent its occurrence.
3795 tty->print_cr("Found oop constant with non-zero offset");
3796 ShouldNotReachHere();
3797 }
3798
3799 return (intptr_t)const_oop()->constant_encoding();
3800 }
3801
3802
3803 //-----------------------------filter------------------------------------------
3804 // Do not allow interface-vs.-noninterface joins to collapse to top.
3805 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const {
3806
3807 const Type* ft = join_helper(kills, include_speculative);
3853 dump_speculative(st);
3854 }
3855
3856 void TypeOopPtr::dump_instance_id(outputStream* st) const {
3857 if (_instance_id == InstanceTop) {
3858 st->print(",iid=top");
3859 } else if (_instance_id == InstanceBot) {
3860 st->print(",iid=bot");
3861 } else {
3862 st->print(",iid=%d", _instance_id);
3863 }
3864 }
3865 #endif
3866
3867 //------------------------------singleton--------------------------------------
3868 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3869 // constants
3870 bool TypeOopPtr::singleton(void) const {
3871 // detune optimizer to not generate constant oop + constant offset as a constant!
3872 // TopPTR, Null, AnyNull, Constant are all singletons
3873 return (_offset == 0) && !below_centerline(_ptr);
3874 }
3875
3876 //------------------------------add_offset-------------------------------------
3877 const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const {
3878 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
3879 }
3880
3881 const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const {
3882 return make(_ptr, offset, _instance_id, with_offset_speculative(offset), _inline_depth);
3883 }
3884
3885 /**
3886 * Return same type without a speculative part
3887 */
3888 const TypeOopPtr* TypeOopPtr::remove_speculative() const {
3889 if (_speculative == nullptr) {
3890 return this;
3891 }
3892 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
3893 return make(_ptr, _offset, _instance_id, nullptr, _inline_depth);
3894 }
3895
3896 /**
3897 * Return same type but drop speculative part if we know we won't use
3898 * it
3899 */
3900 const Type* TypeOopPtr::cleanup_speculative() const {
3901 // If the klass is exact and the ptr is not null then there's
3902 // nothing that the speculative type can help us with
3975 const TypeInstPtr *TypeInstPtr::BOTTOM;
3976 const TypeInstPtr *TypeInstPtr::MIRROR;
3977 const TypeInstPtr *TypeInstPtr::MARK;
3978 const TypeInstPtr *TypeInstPtr::KLASS;
3979
3980 // Is there a single ciKlass* that can represent that type?
3981 ciKlass* TypeInstPtr::exact_klass_helper() const {
3982 if (_interfaces->empty()) {
3983 return _klass;
3984 }
3985 if (_klass != ciEnv::current()->Object_klass()) {
3986 if (_interfaces->eq(_klass->as_instance_klass())) {
3987 return _klass;
3988 }
3989 return nullptr;
3990 }
3991 return _interfaces->exact_klass();
3992 }
3993
3994 //------------------------------TypeInstPtr-------------------------------------
3995 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int off,
3996 int instance_id, const TypePtr* speculative, int inline_depth)
3997 : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, instance_id, speculative, inline_depth) {
3998 assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here");
3999 assert(k != nullptr &&
4000 (k->is_loaded() || o == nullptr),
4001 "cannot have constants with non-loaded klass");
4002 };
4003
4004 //------------------------------make-------------------------------------------
4005 const TypeInstPtr *TypeInstPtr::make(PTR ptr,
4006 ciKlass* k,
4007 const TypeInterfaces* interfaces,
4008 bool xk,
4009 ciObject* o,
4010 int offset,
4011 int instance_id,
4012 const TypePtr* speculative,
4013 int inline_depth) {
4014 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance");
4015 // Either const_oop() is null or else ptr is Constant
4016 assert( (!o && ptr != Constant) || (o && ptr == Constant),
4017 "constant pointers must have a value supplied" );
4018 // Ptr is never Null
4019 assert( ptr != Null, "null pointers are not typed" );
4020
4021 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4022 if (ptr == Constant) {
4023 // Note: This case includes meta-object constants, such as methods.
4024 xk = true;
4025 } else if (k->is_loaded()) {
4026 ciInstanceKlass* ik = k->as_instance_klass();
4027 if (!xk && ik->is_final()) xk = true; // no inexact final klass
4028 assert(!ik->is_interface(), "no interface here");
4029 if (xk && ik->is_interface()) xk = false; // no exact interface
4030 }
4031
4032 // Now hash this baby
4033 TypeInstPtr *result =
4034 (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons();
4035
4036 return result;
4037 }
4038
4039 const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) {
4040 if (k->is_instance_klass()) {
4041 if (k->is_loaded()) {
4042 if (k->is_interface() && interface_handling == ignore_interfaces) {
4043 assert(interface, "no interface expected");
4044 k = ciEnv::current()->Object_klass();
4045 const TypeInterfaces* interfaces = TypeInterfaces::make();
4046 return interfaces;
4047 }
4048 GrowableArray<ciInstanceKlass *>* k_interfaces = k->as_instance_klass()->transitive_interfaces();
4049 const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces);
4050 if (k->is_interface()) {
4051 assert(interface, "no interface expected");
4052 k = ciEnv::current()->Object_klass();
4053 } else {
4054 assert(klass, "no instance klass expected");
4057 }
4058 const TypeInterfaces* interfaces = TypeInterfaces::make();
4059 return interfaces;
4060 }
4061 assert(array, "no array expected");
4062 assert(k->is_array_klass(), "Not an array?");
4063 ciType* e = k->as_array_klass()->base_element_type();
4064 if (e->is_loaded() && e->is_instance_klass() && e->as_instance_klass()->is_interface()) {
4065 if (interface_handling == ignore_interfaces) {
4066 k = ciObjArrayKlass::make(ciEnv::current()->Object_klass(), k->as_array_klass()->dimension());
4067 }
4068 }
4069 return TypeAryPtr::_array_interfaces;
4070 }
4071
4072 //------------------------------cast_to_ptr_type-------------------------------
4073 const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
4074 if( ptr == _ptr ) return this;
4075 // Reconstruct _sig info here since not a problem with later lazy
4076 // construction, _sig will show up on demand.
4077 return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _instance_id, _speculative, _inline_depth);
4078 }
4079
4080
4081 //-----------------------------cast_to_exactness-------------------------------
4082 const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
4083 if( klass_is_exact == _klass_is_exact ) return this;
4084 if (!_klass->is_loaded()) return this;
4085 ciInstanceKlass* ik = _klass->as_instance_klass();
4086 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
4087 assert(!ik->is_interface(), "no interface here");
4088 return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth);
4089 }
4090
4091 //-----------------------------cast_to_instance_id----------------------------
4092 const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const {
4093 if( instance_id == _instance_id ) return this;
4094 return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth);
4095 }
4096
4097 //------------------------------xmeet_unloaded---------------------------------
4098 // Compute the MEET of two InstPtrs when at least one is unloaded.
4099 // Assume classes are different since called after check for same name/class-loader
4100 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const {
4101 int off = meet_offset(tinst->offset());
4102 PTR ptr = meet_ptr(tinst->ptr());
4103 int instance_id = meet_instance_id(tinst->instance_id());
4104 const TypePtr* speculative = xmeet_speculative(tinst);
4105 int depth = meet_inline_depth(tinst->inline_depth());
4106
4107 const TypeInstPtr *loaded = is_loaded() ? this : tinst;
4108 const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
4109 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
4110 //
4111 // Meet unloaded class with java/lang/Object
4112 //
4113 // Meet
4114 // | Unloaded Class
4115 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
4116 // ===================================================================
4117 // TOP | ..........................Unloaded......................|
4118 // AnyNull | U-AN |................Unloaded......................|
4119 // Constant | ... O-NN .................................. | O-BOT |
4120 // NotNull | ... O-NN .................................. | O-BOT |
4121 // BOTTOM | ........................Object-BOTTOM ..................|
4122 //
4123 assert(loaded->ptr() != TypePtr::Null, "insanity check");
4124 //
4125 if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4126 else if (loaded->ptr() == TypePtr::AnyNull) { return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, instance_id, speculative, depth); }
4127 else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4128 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
4129 if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4130 else { return TypeInstPtr::NOTNULL->with_speculative(speculative); }
4131 }
4132 else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4133
4134 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative);
4135 }
4136
4137 // Both are unloaded, not the same class, not Object
4138 // Or meet unloaded with a different loaded class, not java/lang/Object
4139 if (ptr != TypePtr::BotPTR) {
4140 return TypeInstPtr::NOTNULL->with_speculative(speculative);
4141 }
4142 return TypeInstPtr::BOTTOM->with_speculative(speculative);
4143 }
4144
4145
4146 //------------------------------meet-------------------------------------------
4170 case Top:
4171 return this;
4172
4173 default: // All else is a mistake
4174 typerr(t);
4175
4176 case MetadataPtr:
4177 case KlassPtr:
4178 case InstKlassPtr:
4179 case AryKlassPtr:
4180 case RawPtr: return TypePtr::BOTTOM;
4181
4182 case AryPtr: { // All arrays inherit from Object class
4183 // Call in reverse direction to avoid duplication
4184 return t->is_aryptr()->xmeet_helper(this);
4185 }
4186
4187 case OopPtr: { // Meeting to OopPtrs
4188 // Found a OopPtr type vs self-InstPtr type
4189 const TypeOopPtr *tp = t->is_oopptr();
4190 int offset = meet_offset(tp->offset());
4191 PTR ptr = meet_ptr(tp->ptr());
4192 switch (tp->ptr()) {
4193 case TopPTR:
4194 case AnyNull: {
4195 int instance_id = meet_instance_id(InstanceTop);
4196 const TypePtr* speculative = xmeet_speculative(tp);
4197 int depth = meet_inline_depth(tp->inline_depth());
4198 return make(ptr, klass(), _interfaces, klass_is_exact(),
4199 (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth);
4200 }
4201 case NotNull:
4202 case BotPTR: {
4203 int instance_id = meet_instance_id(tp->instance_id());
4204 const TypePtr* speculative = xmeet_speculative(tp);
4205 int depth = meet_inline_depth(tp->inline_depth());
4206 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4207 }
4208 default: typerr(t);
4209 }
4210 }
4211
4212 case AnyPtr: { // Meeting to AnyPtrs
4213 // Found an AnyPtr type vs self-InstPtr type
4214 const TypePtr *tp = t->is_ptr();
4215 int offset = meet_offset(tp->offset());
4216 PTR ptr = meet_ptr(tp->ptr());
4217 int instance_id = meet_instance_id(InstanceTop);
4218 const TypePtr* speculative = xmeet_speculative(tp);
4219 int depth = meet_inline_depth(tp->inline_depth());
4220 switch (tp->ptr()) {
4221 case Null:
4222 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4223 // else fall through to AnyNull
4224 case TopPTR:
4225 case AnyNull: {
4226 return make(ptr, klass(), _interfaces, klass_is_exact(),
4227 (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth);
4228 }
4229 case NotNull:
4230 case BotPTR:
4231 return TypePtr::make(AnyPtr, ptr, offset, speculative,depth);
4232 default: typerr(t);
4233 }
4234 }
4235
4236 /*
4237 A-top }
4238 / | \ } Tops
4239 B-top A-any C-top }
4240 | / | \ | } Any-nulls
4241 B-any | C-any }
4242 | | |
4243 B-con A-con C-con } constants; not comparable across classes
4244 | | |
4245 B-not | C-not }
4246 | \ | / | } not-nulls
4247 B-bot A-not C-bot }
4248 \ | / } Bottoms
4249 A-bot }
4250 */
4251
4252 case InstPtr: { // Meeting 2 Oops?
4253 // Found an InstPtr sub-type vs self-InstPtr type
4254 const TypeInstPtr *tinst = t->is_instptr();
4255 int off = meet_offset(tinst->offset());
4256 PTR ptr = meet_ptr(tinst->ptr());
4257 int instance_id = meet_instance_id(tinst->instance_id());
4258 const TypePtr* speculative = xmeet_speculative(tinst);
4259 int depth = meet_inline_depth(tinst->inline_depth());
4260 const TypeInterfaces* interfaces = meet_interfaces(tinst);
4261
4262 ciKlass* tinst_klass = tinst->klass();
4263 ciKlass* this_klass = klass();
4264
4265 ciKlass* res_klass = nullptr;
4266 bool res_xk = false;
4267 const Type* res;
4268 MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk);
4269
4270 if (kind == UNLOADED) {
4271 // One of these classes has not been loaded
4272 const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces);
4273 #ifndef PRODUCT
4274 if (PrintOpto && Verbose) {
4275 tty->print("meet of unloaded classes resulted in: ");
4276 unloaded_meet->dump();
4277 tty->cr();
4278 tty->print(" this == ");
4279 dump();
4280 tty->cr();
4281 tty->print(" tinst == ");
4282 tinst->dump();
4283 tty->cr();
4284 }
4285 #endif
4286 res = unloaded_meet;
4287 } else {
4288 if (kind == NOT_SUBTYPE && instance_id > 0) {
4289 instance_id = InstanceBot;
4290 } else if (kind == LCA) {
4291 instance_id = InstanceBot;
4292 }
4293 ciObject* o = nullptr; // Assume not constant when done
4294 ciObject* this_oop = const_oop();
4295 ciObject* tinst_oop = tinst->const_oop();
4296 if (ptr == Constant) {
4297 if (this_oop != nullptr && tinst_oop != nullptr &&
4298 this_oop->equals(tinst_oop))
4299 o = this_oop;
4300 else if (above_centerline(_ptr)) {
4301 assert(!tinst_klass->is_interface(), "");
4302 o = tinst_oop;
4303 } else if (above_centerline(tinst->_ptr)) {
4304 assert(!this_klass->is_interface(), "");
4305 o = this_oop;
4306 } else
4307 ptr = NotNull;
4308 }
4309 res = make(ptr, res_klass, interfaces, res_xk, o, off, instance_id, speculative, depth);
4310 }
4311
4312 return res;
4313
4314 } // End of case InstPtr
4315
4316 } // End of switch
4317 return this; // Return the double constant
4318 }
4319
4320 template<class T> TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type,
4321 ciKlass*& res_klass, bool& res_xk) {
4322 ciKlass* this_klass = this_type->klass();
4323 ciKlass* other_klass = other_type->klass();
4324 bool this_xk = this_type->klass_is_exact();
4325 bool other_xk = other_type->klass_is_exact();
4326 PTR this_ptr = this_type->ptr();
4327 PTR other_ptr = other_type->ptr();
4328 const TypeInterfaces* this_interfaces = this_type->interfaces();
4329 const TypeInterfaces* other_interfaces = other_type->interfaces();
4330 // Check for easy case; klasses are equal (and perhaps not loaded!)
4331 // If we have constants, then we created oops so classes are loaded
4332 // and we can handle the constants further down. This case handles
4333 // both-not-loaded or both-loaded classes
4334 if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) {
4335 res_klass = this_klass;
4336 res_xk = this_xk;
4337 return QUICK;
4338 }
4339
4340 // Classes require inspection in the Java klass hierarchy. Must be loaded.
4341 if (!other_klass->is_loaded() || !this_klass->is_loaded()) {
4342 return UNLOADED;
4343 }
4349 // If both are up and they do NOT subtype, "fall hard".
4350 // If both are down and they subtype, take the supertype class.
4351 // If both are down and they do NOT subtype, "fall hard".
4352 // Constants treated as down.
4353
4354 // Now, reorder the above list; observe that both-down+subtype is also
4355 // "fall hard"; "fall hard" becomes the default case:
4356 // If we split one up & one down AND they subtype, take the down man.
4357 // If both are up and they subtype, take the subtype class.
4358
4359 // If both are down and they subtype, "fall hard".
4360 // If both are down and they do NOT subtype, "fall hard".
4361 // If both are up and they do NOT subtype, "fall hard".
4362 // If we split one up & one down AND they do NOT subtype, "fall hard".
4363
4364 // If a proper subtype is exact, and we return it, we return it exactly.
4365 // If a proper supertype is exact, there can be no subtyping relationship!
4366 // If both types are equal to the subtype, exactness is and-ed below the
4367 // centerline and or-ed above it. (N.B. Constants are always exact.)
4368
4369 // Check for subtyping:
4370 const T* subtype = nullptr;
4371 bool subtype_exact = false;
4372 if (this_type->is_same_java_type_as(other_type)) {
4373 subtype = this_type;
4374 subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk);
4375 } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) {
4376 subtype = this_type; // Pick subtyping class
4377 subtype_exact = this_xk;
4378 } else if(!this_xk && other_type->is_meet_subtype_of(this_type)) {
4379 subtype = other_type; // Pick subtyping class
4380 subtype_exact = other_xk;
4381 }
4382
4383 if (subtype) {
4384 if (above_centerline(ptr)) { // both are up?
4385 this_type = other_type = subtype;
4386 this_xk = other_xk = subtype_exact;
4387 } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) {
4388 this_type = other_type; // tinst is down; keep down man
4389 this_xk = other_xk;
4390 } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) {
4391 other_type = this_type; // this is down; keep down man
4392 other_xk = this_xk;
4393 } else {
4394 this_xk = subtype_exact; // either they are equal, or we'll do an LCA
4395 }
4396 }
4397
4398 // Check for classes now being equal
4399 if (this_type->is_same_java_type_as(other_type)) {
4400 // If the klasses are equal, the constants may still differ. Fall to
4401 // NotNull if they do (neither constant is null; that is a special case
4402 // handled elsewhere).
4403 res_klass = this_type->klass();
4404 res_xk = this_xk;
4405 return SUBTYPE;
4406 } // Else classes are not equal
4407
4408 // Since klasses are different, we require a LCA in the Java
4409 // class hierarchy - which means we have to fall to at least NotNull.
4410 if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) {
4411 ptr = NotNull;
4412 }
4413
4414 interfaces = this_interfaces->intersection_with(other_interfaces);
4415
4416 // Now we find the LCA of Java classes
4417 ciKlass* k = this_klass->least_common_ancestor(other_klass);
4418
4419 res_klass = k;
4420 res_xk = false;
4421
4422 return LCA;
4423 }
4424
4425 //------------------------java_mirror_type--------------------------------------
4426 ciType* TypeInstPtr::java_mirror_type() const {
4427 // must be a singleton type
4428 if( const_oop() == nullptr ) return nullptr;
4429
4430 // must be of type java.lang.Class
4431 if( klass() != ciEnv::current()->Class_klass() ) return nullptr;
4432
4433 return const_oop()->as_instance()->java_mirror_type();
4434 }
4435
4436
4437 //------------------------------xdual------------------------------------------
4438 // Dual: do NOT dual on klasses. This means I do NOT understand the Java
4439 // inheritance mechanism.
4440 const Type *TypeInstPtr::xdual() const {
4441 return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
4442 }
4443
4444 //------------------------------eq---------------------------------------------
4445 // Structural equality check for Type representations
4446 bool TypeInstPtr::eq( const Type *t ) const {
4447 const TypeInstPtr *p = t->is_instptr();
4448 return
4449 klass()->equals(p->klass()) &&
4450 _interfaces->eq(p->_interfaces) &&
4451 TypeOopPtr::eq(p); // Check sub-type stuff
4452 }
4453
4454 //------------------------------hash-------------------------------------------
4455 // Type-specific hashing function.
4456 uint TypeInstPtr::hash(void) const {
4457 return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash();
4458 }
4459
4460 bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4461 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4462 }
4463
4464
4465 bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4466 return TypePtr::is_same_java_type_as_helper_for_instance(this, other);
4467 }
4468
4469 bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4470 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4471 }
4472
4473
4474 //------------------------------dump2------------------------------------------
4475 // Dump oop Type
4476 #ifndef PRODUCT
4477 void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const {
4481 _interfaces->dump(st);
4482
4483 if (_ptr == Constant && (WizardMode || Verbose)) {
4484 ResourceMark rm;
4485 stringStream ss;
4486
4487 st->print(" ");
4488 const_oop()->print_oop(&ss);
4489 // 'const_oop->print_oop()' may emit newlines('\n') into ss.
4490 // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node.
4491 char* buf = ss.as_string(/* c_heap= */false);
4492 StringUtils::replace_no_expand(buf, "\n", "");
4493 st->print_raw(buf);
4494 }
4495
4496 st->print(":%s", ptr_msg[_ptr]);
4497 if (_klass_is_exact) {
4498 st->print(":exact");
4499 }
4500
4501 dump_offset(st);
4502 dump_instance_id(st);
4503 dump_inline_depth(st);
4504 dump_speculative(st);
4505 }
4506 #endif
4507
4508 //------------------------------add_offset-------------------------------------
4509 const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const {
4510 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset),
4511 _instance_id, add_offset_speculative(offset), _inline_depth);
4512 }
4513
4514 const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const {
4515 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), offset,
4516 _instance_id, with_offset_speculative(offset), _inline_depth);
4517 }
4518
4519 const TypeInstPtr* TypeInstPtr::remove_speculative() const {
4520 if (_speculative == nullptr) {
4521 return this;
4522 }
4523 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4524 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset,
4525 _instance_id, nullptr, _inline_depth);
4526 }
4527
4528 const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const {
4529 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, speculative, _inline_depth);
4530 }
4531
4532 const TypePtr* TypeInstPtr::with_inline_depth(int depth) const {
4533 if (!UseInlineDepthForSpeculativeTypes) {
4534 return this;
4535 }
4536 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth);
4537 }
4538
4539 const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const {
4540 assert(is_known_instance(), "should be known");
4541 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, instance_id, _speculative, _inline_depth);
4542 }
4543
4544 const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const {
4545 bool xk = klass_is_exact();
4546 ciInstanceKlass* ik = klass()->as_instance_klass();
4547 if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) {
4548 if (_interfaces->eq(ik)) {
4549 Compile* C = Compile::current();
4550 Dependencies* deps = C->dependencies();
4551 deps->assert_leaf_type(ik);
4552 xk = true;
4553 }
4554 }
4555 return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, 0);
4556 }
4557
4558 template <class T1, class T2> bool TypePtr::is_meet_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_xk, bool other_xk) {
4559 static_assert(std::is_base_of<T2, T1>::value, "");
4560
4561 if (!this_one->is_instance_type(other)) {
4562 return false;
4563 }
4564
4565 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4566 return true;
4567 }
4568
4569 return this_one->klass()->is_subtype_of(other->klass()) &&
4570 (!this_xk || this_one->_interfaces->contains(other->_interfaces));
4571 }
4572
4573
4574 bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4575 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4580 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4581 return true;
4582 }
4583
4584 if (this_one->is_instance_type(other)) {
4585 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces);
4586 }
4587
4588 int dummy;
4589 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
4590 if (this_top_or_bottom) {
4591 return false;
4592 }
4593
4594 const T1* other_ary = this_one->is_array_type(other);
4595 const TypePtr* other_elem = other_ary->elem()->make_ptr();
4596 const TypePtr* this_elem = this_one->elem()->make_ptr();
4597 if (other_elem != nullptr && this_elem != nullptr) {
4598 return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk);
4599 }
4600
4601 if (other_elem == nullptr && this_elem == nullptr) {
4602 return this_one->klass()->is_subtype_of(other->klass());
4603 }
4604
4605 return false;
4606 }
4607
4608 bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4609 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4610 }
4611
4612 bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4613 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4614 }
4615
4616 bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4617 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4618 }
4619
4620 //=============================================================================
4621 // Convenience common pre-built types.
4622 const TypeAryPtr* TypeAryPtr::BOTTOM;
4623 const TypeAryPtr* TypeAryPtr::RANGE;
4624 const TypeAryPtr* TypeAryPtr::OOPS;
4625 const TypeAryPtr* TypeAryPtr::NARROWOOPS;
4626 const TypeAryPtr* TypeAryPtr::BYTES;
4627 const TypeAryPtr* TypeAryPtr::SHORTS;
4628 const TypeAryPtr* TypeAryPtr::CHARS;
4629 const TypeAryPtr* TypeAryPtr::INTS;
4630 const TypeAryPtr* TypeAryPtr::LONGS;
4631 const TypeAryPtr* TypeAryPtr::FLOATS;
4632 const TypeAryPtr* TypeAryPtr::DOUBLES;
4633
4634 //------------------------------make-------------------------------------------
4635 const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset,
4636 int instance_id, const TypePtr* speculative, int inline_depth) {
4637 assert(!(k == nullptr && ary->_elem->isa_int()),
4638 "integral arrays must be pre-equipped with a class");
4639 if (!xk) xk = ary->ary_must_be_exact();
4640 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4641 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
4642 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
4643 k = nullptr;
4644 }
4645 return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons();
4646 }
4647
4648 //------------------------------make-------------------------------------------
4649 const TypeAryPtr *TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset,
4650 int instance_id, const TypePtr* speculative, int inline_depth,
4651 bool is_autobox_cache) {
4652 assert(!(k == nullptr && ary->_elem->isa_int()),
4653 "integral arrays must be pre-equipped with a class");
4654 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
4655 if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact();
4656 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4657 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
4658 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
4659 k = nullptr;
4660 }
4661 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons();
4662 }
4663
4664 //------------------------------cast_to_ptr_type-------------------------------
4665 const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
4666 if( ptr == _ptr ) return this;
4667 return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4668 }
4669
4670
4671 //-----------------------------cast_to_exactness-------------------------------
4672 const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
4673 if( klass_is_exact == _klass_is_exact ) return this;
4674 if (_ary->ary_must_be_exact()) return this; // cannot clear xk
4675 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
4676 }
4677
4678 //-----------------------------cast_to_instance_id----------------------------
4679 const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const {
4680 if( instance_id == _instance_id ) return this;
4681 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
4682 }
4683
4684
4685 //-----------------------------max_array_length-------------------------------
4686 // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization.
4687 jint TypeAryPtr::max_array_length(BasicType etype) {
4688 if (!is_java_primitive(etype) && !::is_reference_type(etype)) {
4689 if (etype == T_NARROWOOP) {
4690 etype = T_OBJECT;
4691 } else if (etype == T_ILLEGAL) { // bottom[]
4692 etype = T_BYTE; // will produce conservatively high value
4693 } else {
4694 fatal("not an element type: %s", type2name(etype));
4695 }
4696 }
4697 return arrayOopDesc::max_array_length(etype);
4698 }
4699
4700 //-----------------------------narrow_size_type-------------------------------
4701 // Narrow the given size type to the index range for the given array base type.
4719 if (size->is_con()) {
4720 lo = hi;
4721 }
4722 chg = true;
4723 }
4724 // Negative length arrays will produce weird intermediate dead fast-path code
4725 if (lo > hi) {
4726 return TypeInt::ZERO;
4727 }
4728 if (!chg) {
4729 return size;
4730 }
4731 return TypeInt::make(lo, hi, Type::WidenMin);
4732 }
4733
4734 //-------------------------------cast_to_size----------------------------------
4735 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
4736 assert(new_size != nullptr, "");
4737 new_size = narrow_size_type(new_size);
4738 if (new_size == size()) return this;
4739 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable());
4740 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4741 }
4742
4743 //------------------------------cast_to_stable---------------------------------
4744 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const {
4745 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable()))
4746 return this;
4747
4748 const Type* elem = this->elem();
4749 const TypePtr* elem_ptr = elem->make_ptr();
4750
4751 if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) {
4752 // If this is widened from a narrow oop, TypeAry::make will re-narrow it.
4753 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1);
4754 }
4755
4756 const TypeAry* new_ary = TypeAry::make(elem, size(), stable);
4757
4758 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4759 }
4760
4761 //-----------------------------stable_dimension--------------------------------
4762 int TypeAryPtr::stable_dimension() const {
4763 if (!is_stable()) return 0;
4764 int dim = 1;
4765 const TypePtr* elem_ptr = elem()->make_ptr();
4766 if (elem_ptr != nullptr && elem_ptr->isa_aryptr())
4767 dim += elem_ptr->is_aryptr()->stable_dimension();
4768 return dim;
4769 }
4770
4771 //----------------------cast_to_autobox_cache-----------------------------------
4772 const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const {
4773 if (is_autobox_cache()) return this;
4774 const TypeOopPtr* etype = elem()->make_oopptr();
4775 if (etype == nullptr) return this;
4776 // The pointers in the autobox arrays are always non-null.
4777 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
4778 const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable());
4779 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true);
4780 }
4781
4782 //------------------------------eq---------------------------------------------
4783 // Structural equality check for Type representations
4784 bool TypeAryPtr::eq( const Type *t ) const {
4785 const TypeAryPtr *p = t->is_aryptr();
4786 return
4787 _ary == p->_ary && // Check array
4788 TypeOopPtr::eq(p); // Check sub-parts
4789 }
4790
4791 //------------------------------hash-------------------------------------------
4792 // Type-specific hashing function.
4793 uint TypeAryPtr::hash(void) const {
4794 return (uint)(uintptr_t)_ary + TypeOopPtr::hash();
4795 }
4796
4797 bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4798 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
4799 }
4800
4801 bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4802 return TypePtr::is_same_java_type_as_helper_for_array(this, other);
4803 }
4804
4805 bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4806 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
4807 }
4808 //------------------------------meet-------------------------------------------
4809 // Compute the MEET of two types. It returns a new Type object.
4810 const Type *TypeAryPtr::xmeet_helper(const Type *t) const {
4811 // Perform a fast test for common case; meeting the same types together.
4812 if( this == t ) return this; // Meeting same type-rep?
4813 // Current "this->_base" is Pointer
4814 switch (t->base()) { // switch on original type
4821 case HalfFloatBot:
4822 case FloatTop:
4823 case FloatCon:
4824 case FloatBot:
4825 case DoubleTop:
4826 case DoubleCon:
4827 case DoubleBot:
4828 case NarrowOop:
4829 case NarrowKlass:
4830 case Bottom: // Ye Olde Default
4831 return Type::BOTTOM;
4832 case Top:
4833 return this;
4834
4835 default: // All else is a mistake
4836 typerr(t);
4837
4838 case OopPtr: { // Meeting to OopPtrs
4839 // Found a OopPtr type vs self-AryPtr type
4840 const TypeOopPtr *tp = t->is_oopptr();
4841 int offset = meet_offset(tp->offset());
4842 PTR ptr = meet_ptr(tp->ptr());
4843 int depth = meet_inline_depth(tp->inline_depth());
4844 const TypePtr* speculative = xmeet_speculative(tp);
4845 switch (tp->ptr()) {
4846 case TopPTR:
4847 case AnyNull: {
4848 int instance_id = meet_instance_id(InstanceTop);
4849 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4850 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4851 }
4852 case BotPTR:
4853 case NotNull: {
4854 int instance_id = meet_instance_id(tp->instance_id());
4855 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4856 }
4857 default: ShouldNotReachHere();
4858 }
4859 }
4860
4861 case AnyPtr: { // Meeting two AnyPtrs
4862 // Found an AnyPtr type vs self-AryPtr type
4863 const TypePtr *tp = t->is_ptr();
4864 int offset = meet_offset(tp->offset());
4865 PTR ptr = meet_ptr(tp->ptr());
4866 const TypePtr* speculative = xmeet_speculative(tp);
4867 int depth = meet_inline_depth(tp->inline_depth());
4868 switch (tp->ptr()) {
4869 case TopPTR:
4870 return this;
4871 case BotPTR:
4872 case NotNull:
4873 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4874 case Null:
4875 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4876 // else fall through to AnyNull
4877 case AnyNull: {
4878 int instance_id = meet_instance_id(InstanceTop);
4879 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4880 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4881 }
4882 default: ShouldNotReachHere();
4883 }
4884 }
4885
4886 case MetadataPtr:
4887 case KlassPtr:
4888 case InstKlassPtr:
4889 case AryKlassPtr:
4890 case RawPtr: return TypePtr::BOTTOM;
4891
4892 case AryPtr: { // Meeting 2 references?
4893 const TypeAryPtr *tap = t->is_aryptr();
4894 int off = meet_offset(tap->offset());
4895 const Type* tm = _ary->meet_speculative(tap->_ary);
4896 const TypeAry* tary = tm->isa_ary();
4897 if (tary == nullptr) {
4898 assert(tm == Type::TOP || tm == Type::BOTTOM, "");
4899 return tm;
4900 }
4901 PTR ptr = meet_ptr(tap->ptr());
4902 int instance_id = meet_instance_id(tap->instance_id());
4903 const TypePtr* speculative = xmeet_speculative(tap);
4904 int depth = meet_inline_depth(tap->inline_depth());
4905
4906 ciKlass* res_klass = nullptr;
4907 bool res_xk = false;
4908 const Type* elem = tary->_elem;
4909 if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk) == NOT_SUBTYPE) {
4910 instance_id = InstanceBot;
4911 }
4912
4913 ciObject* o = nullptr; // Assume not constant when done
4914 ciObject* this_oop = const_oop();
4915 ciObject* tap_oop = tap->const_oop();
4916 if (ptr == Constant) {
4917 if (this_oop != nullptr && tap_oop != nullptr &&
4918 this_oop->equals(tap_oop)) {
4919 o = tap_oop;
4920 } else if (above_centerline(_ptr)) {
4921 o = tap_oop;
4922 } else if (above_centerline(tap->_ptr)) {
4923 o = this_oop;
4924 } else {
4925 ptr = NotNull;
4926 }
4927 }
4928 return make(ptr, o, TypeAry::make(elem, tary->_size, tary->_stable), res_klass, res_xk, off, instance_id, speculative, depth);
4929 }
4930
4931 // All arrays inherit from Object class
4932 case InstPtr: {
4933 const TypeInstPtr *tp = t->is_instptr();
4934 int offset = meet_offset(tp->offset());
4935 PTR ptr = meet_ptr(tp->ptr());
4936 int instance_id = meet_instance_id(tp->instance_id());
4937 const TypePtr* speculative = xmeet_speculative(tp);
4938 int depth = meet_inline_depth(tp->inline_depth());
4939 const TypeInterfaces* interfaces = meet_interfaces(tp);
4940 const TypeInterfaces* tp_interfaces = tp->_interfaces;
4941 const TypeInterfaces* this_interfaces = _interfaces;
4942
4943 switch (ptr) {
4944 case TopPTR:
4945 case AnyNull: // Fall 'down' to dual of object klass
4946 // For instances when a subclass meets a superclass we fall
4947 // below the centerline when the superclass is exact. We need to
4948 // do the same here.
4949 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) {
4950 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4951 } else {
4952 // cannot subclass, so the meet has to fall badly below the centerline
4953 ptr = NotNull;
4954 instance_id = InstanceBot;
4955 interfaces = this_interfaces->intersection_with(tp_interfaces);
4956 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr,offset, instance_id, speculative, depth);
4957 }
4958 case Constant:
4959 case NotNull:
4960 case BotPTR: // Fall down to object klass
4961 // LCA is object_klass, but if we subclass from the top we can do better
4962 if (above_centerline(tp->ptr())) {
4963 // If 'tp' is above the centerline and it is Object class
4964 // then we can subclass in the Java class hierarchy.
4965 // For instances when a subclass meets a superclass we fall
4966 // below the centerline when the superclass is exact. We need
4967 // to do the same here.
4968 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) {
4969 // that is, my array type is a subtype of 'tp' klass
4970 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4971 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4972 }
4973 }
4974 // The other case cannot happen, since t cannot be a subtype of an array.
4975 // The meet falls down to Object class below centerline.
4976 if (ptr == Constant) {
4977 ptr = NotNull;
4978 }
4979 if (instance_id > 0) {
4980 instance_id = InstanceBot;
4981 }
4982 interfaces = this_interfaces->intersection_with(tp_interfaces);
4983 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, instance_id, speculative, depth);
4984 default: typerr(t);
4985 }
4986 }
4987 }
4988 return this; // Lint noise
4989 }
4990
4991
4992 template<class T> TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary,
4993 const T* other_ary, ciKlass*& res_klass, bool& res_xk) {
4994 int dummy;
4995 bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM);
4996 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
4997 ciKlass* this_klass = this_ary->klass();
4998 ciKlass* other_klass = other_ary->klass();
4999 bool this_xk = this_ary->klass_is_exact();
5000 bool other_xk = other_ary->klass_is_exact();
5001 PTR this_ptr = this_ary->ptr();
5002 PTR other_ptr = other_ary->ptr();
5003 res_klass = nullptr;
5004 MeetResult result = SUBTYPE;
5005 if (elem->isa_int()) {
5006 // Integral array element types have irrelevant lattice relations.
5007 // It is the klass that determines array layout, not the element type.
5008 if (this_top_or_bottom)
5009 res_klass = other_klass;
5010 else if (other_top_or_bottom || other_klass == this_klass) {
5011 res_klass = this_klass;
5012 } else {
5013 // Something like byte[int+] meets char[int+].
5014 // This must fall to bottom, not (int[-128..65535])[int+].
5015 // instance_id = InstanceBot;
5016 elem = Type::BOTTOM;
5017 result = NOT_SUBTYPE;
5018 if (above_centerline(ptr) || ptr == Constant) {
5019 ptr = NotNull;
5020 res_xk = false;
5021 return NOT_SUBTYPE;
5022 }
5023 }
5024 } else {// Non integral arrays.
5025 // Must fall to bottom if exact klasses in upper lattice
5026 // are not equal or super klass is exact.
5027 if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) &&
5028 // meet with top[] and bottom[] are processed further down:
5029 !this_top_or_bottom && !other_top_or_bottom &&
5030 // both are exact and not equal:
5032 // 'tap' is exact and super or unrelated:
5033 (other_xk && !other_ary->is_meet_subtype_of(this_ary)) ||
5034 // 'this' is exact and super or unrelated:
5035 (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) {
5036 if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) {
5037 elem = Type::BOTTOM;
5038 }
5039 ptr = NotNull;
5040 res_xk = false;
5041 return NOT_SUBTYPE;
5042 }
5043 }
5044
5045 res_xk = false;
5046 switch (other_ptr) {
5047 case AnyNull:
5048 case TopPTR:
5049 // Compute new klass on demand, do not use tap->_klass
5050 if (below_centerline(this_ptr)) {
5051 res_xk = this_xk;
5052 } else {
5053 res_xk = (other_xk || this_xk);
5054 }
5055 return result;
5056 case Constant: {
5057 if (this_ptr == Constant) {
5058 res_xk = true;
5059 } else if(above_centerline(this_ptr)) {
5060 res_xk = true;
5061 } else {
5062 // Only precise for identical arrays
5063 res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom));
5064 }
5065 return result;
5066 }
5067 case NotNull:
5068 case BotPTR:
5069 // Compute new klass on demand, do not use tap->_klass
5070 if (above_centerline(this_ptr)) {
5071 res_xk = other_xk;
5072 } else {
5073 res_xk = (other_xk && this_xk) &&
5074 (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays
5075 }
5076 return result;
5077 default: {
5078 ShouldNotReachHere();
5079 return result;
5080 }
5081 }
5082 return result;
5083 }
5084
5085
5086 //------------------------------xdual------------------------------------------
5087 // Dual: compute field-by-field dual
5088 const Type *TypeAryPtr::xdual() const {
5089 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());
5090 }
5091
5092 //------------------------------dump2------------------------------------------
5093 #ifndef PRODUCT
5094 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5095 st->print("aryptr:");
5096 _ary->dump2(d, depth, st);
5097 _interfaces->dump(st);
5098
5099 if (_ptr == Constant) {
5100 const_oop()->print(st);
5101 }
5102
5103 st->print(":%s", ptr_msg[_ptr]);
5104 if (_klass_is_exact) {
5105 st->print(":exact");
5106 }
5107
5108 if( _offset != 0 ) {
5109 BasicType basic_elem_type = elem()->basic_type();
5110 int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
5111 if( _offset == OffsetTop ) st->print("+undefined");
5112 else if( _offset == OffsetBot ) st->print("+any");
5113 else if( _offset < header_size ) st->print("+%d", _offset);
5114 else {
5115 if (basic_elem_type == T_ILLEGAL) {
5116 st->print("+any");
5117 } else {
5118 int elem_size = type2aelembytes(basic_elem_type);
5119 st->print("[%d]", (_offset - header_size)/elem_size);
5120 }
5121 }
5122 }
5123
5124 dump_instance_id(st);
5125 dump_inline_depth(st);
5126 dump_speculative(st);
5127 }
5128 #endif
5129
5130 bool TypeAryPtr::empty(void) const {
5131 if (_ary->empty()) return true;
5132 return TypeOopPtr::empty();
5133 }
5134
5135 //------------------------------add_offset-------------------------------------
5136 const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const {
5137 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
5138 }
5139
5140 const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const {
5141 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, offset, _instance_id, with_offset_speculative(offset), _inline_depth);
5142 }
5143
5144 const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const {
5145 return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
5146 }
5147
5148 const TypeAryPtr* TypeAryPtr::remove_speculative() const {
5149 if (_speculative == nullptr) {
5150 return this;
5151 }
5152 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
5153 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, nullptr, _inline_depth);
5154 }
5155
5156 const TypePtr* TypeAryPtr::with_inline_depth(int depth) const {
5157 if (!UseInlineDepthForSpeculativeTypes) {
5158 return this;
5159 }
5160 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth);
5161 }
5162
5163 const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const {
5164 assert(is_known_instance(), "should be known");
5165 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
5166 }
5167
5168 //=============================================================================
5169
5170 //------------------------------hash-------------------------------------------
5171 // Type-specific hashing function.
5172 uint TypeNarrowPtr::hash(void) const {
5173 return _ptrtype->hash() + 7;
5174 }
5175
5176 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton
5177 return _ptrtype->singleton();
5178 }
5179
5180 bool TypeNarrowPtr::empty(void) const {
5181 return _ptrtype->empty();
5182 }
5183
5184 intptr_t TypeNarrowPtr::get_con() const {
5185 return _ptrtype->get_con();
5186 }
5187
5188 bool TypeNarrowPtr::eq( const Type *t ) const {
5189 const TypeNarrowPtr* tc = isa_same_narrowptr(t);
5243 case HalfFloatTop:
5244 case HalfFloatCon:
5245 case HalfFloatBot:
5246 case FloatTop:
5247 case FloatCon:
5248 case FloatBot:
5249 case DoubleTop:
5250 case DoubleCon:
5251 case DoubleBot:
5252 case AnyPtr:
5253 case RawPtr:
5254 case OopPtr:
5255 case InstPtr:
5256 case AryPtr:
5257 case MetadataPtr:
5258 case KlassPtr:
5259 case InstKlassPtr:
5260 case AryKlassPtr:
5261 case NarrowOop:
5262 case NarrowKlass:
5263
5264 case Bottom: // Ye Olde Default
5265 return Type::BOTTOM;
5266 case Top:
5267 return this;
5268
5269 default: // All else is a mistake
5270 typerr(t);
5271
5272 } // End of switch
5273
5274 return this;
5275 }
5276
5277 #ifndef PRODUCT
5278 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
5279 _ptrtype->dump2(d, depth, st);
5280 }
5281 #endif
5282
5283 const TypeNarrowOop *TypeNarrowOop::BOTTOM;
5327 return (one == two) && TypePtr::eq(t);
5328 } else {
5329 return one->equals(two) && TypePtr::eq(t);
5330 }
5331 }
5332
5333 //------------------------------hash-------------------------------------------
5334 // Type-specific hashing function.
5335 uint TypeMetadataPtr::hash(void) const {
5336 return
5337 (metadata() ? metadata()->hash() : 0) +
5338 TypePtr::hash();
5339 }
5340
5341 //------------------------------singleton--------------------------------------
5342 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5343 // constants
5344 bool TypeMetadataPtr::singleton(void) const {
5345 // detune optimizer to not generate constant metadata + constant offset as a constant!
5346 // TopPTR, Null, AnyNull, Constant are all singletons
5347 return (_offset == 0) && !below_centerline(_ptr);
5348 }
5349
5350 //------------------------------add_offset-------------------------------------
5351 const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const {
5352 return make( _ptr, _metadata, xadd_offset(offset));
5353 }
5354
5355 //-----------------------------filter------------------------------------------
5356 // Do not allow interface-vs.-noninterface joins to collapse to top.
5357 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const {
5358 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr();
5359 if (ft == nullptr || ft->empty())
5360 return Type::TOP; // Canonical empty value
5361 return ft;
5362 }
5363
5364 //------------------------------get_con----------------------------------------
5365 intptr_t TypeMetadataPtr::get_con() const {
5366 assert( _ptr == Null || _ptr == Constant, "" );
5367 assert( _offset >= 0, "" );
5368
5369 if (_offset != 0) {
5370 // After being ported to the compiler interface, the compiler no longer
5371 // directly manipulates the addresses of oops. Rather, it only has a pointer
5372 // to a handle at compile time. This handle is embedded in the generated
5373 // code and dereferenced at the time the nmethod is made. Until that time,
5374 // it is not reasonable to do arithmetic with the addresses of oops (we don't
5375 // have access to the addresses!). This does not seem to currently happen,
5376 // but this assertion here is to help prevent its occurrence.
5377 tty->print_cr("Found oop constant with non-zero offset");
5378 ShouldNotReachHere();
5379 }
5380
5381 return (intptr_t)metadata()->constant_encoding();
5382 }
5383
5384 //------------------------------cast_to_ptr_type-------------------------------
5385 const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const {
5386 if( ptr == _ptr ) return this;
5387 return make(ptr, metadata(), _offset);
5388 }
5389
5403 case HalfFloatBot:
5404 case FloatTop:
5405 case FloatCon:
5406 case FloatBot:
5407 case DoubleTop:
5408 case DoubleCon:
5409 case DoubleBot:
5410 case NarrowOop:
5411 case NarrowKlass:
5412 case Bottom: // Ye Olde Default
5413 return Type::BOTTOM;
5414 case Top:
5415 return this;
5416
5417 default: // All else is a mistake
5418 typerr(t);
5419
5420 case AnyPtr: {
5421 // Found an AnyPtr type vs self-OopPtr type
5422 const TypePtr *tp = t->is_ptr();
5423 int offset = meet_offset(tp->offset());
5424 PTR ptr = meet_ptr(tp->ptr());
5425 switch (tp->ptr()) {
5426 case Null:
5427 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5428 // else fall through:
5429 case TopPTR:
5430 case AnyNull: {
5431 return make(ptr, _metadata, offset);
5432 }
5433 case BotPTR:
5434 case NotNull:
5435 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5436 default: typerr(t);
5437 }
5438 }
5439
5440 case RawPtr:
5441 case KlassPtr:
5442 case InstKlassPtr:
5443 case AryKlassPtr:
5444 case OopPtr:
5445 case InstPtr:
5446 case AryPtr:
5447 return TypePtr::BOTTOM; // Oop meet raw is not well defined
5448
5449 case MetadataPtr: {
5450 const TypeMetadataPtr *tp = t->is_metadataptr();
5451 int offset = meet_offset(tp->offset());
5452 PTR tptr = tp->ptr();
5453 PTR ptr = meet_ptr(tptr);
5454 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata();
5455 if (tptr == TopPTR || _ptr == TopPTR ||
5456 metadata()->equals(tp->metadata())) {
5457 return make(ptr, md, offset);
5458 }
5459 // metadata is different
5460 if( ptr == Constant ) { // Cannot be equal constants, so...
5461 if( tptr == Constant && _ptr != Constant) return t;
5462 if( _ptr == Constant && tptr != Constant) return this;
5463 ptr = NotNull; // Fall down in lattice
5464 }
5465 return make(ptr, nullptr, offset);
5466 break;
5467 }
5468 } // End of switch
5469 return this; // Return the double constant
5470 }
5471
5475 const Type *TypeMetadataPtr::xdual() const {
5476 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset());
5477 }
5478
5479 //------------------------------dump2------------------------------------------
5480 #ifndef PRODUCT
5481 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5482 st->print("metadataptr:%s", ptr_msg[_ptr]);
5483 if (metadata() != nullptr) {
5484 st->print(":" INTPTR_FORMAT, p2i(metadata()));
5485 }
5486 dump_offset(st);
5487 }
5488 #endif
5489
5490
5491 //=============================================================================
5492 // Convenience common pre-built type.
5493 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM;
5494
5495 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset):
5496 TypePtr(MetadataPtr, ptr, offset, relocInfo::metadata_type), _metadata(metadata) {
5497 }
5498
5499 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) {
5500 return make(Constant, m, 0);
5501 }
5502 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) {
5503 return make(Constant, m, 0);
5504 }
5505
5506 //------------------------------make-------------------------------------------
5507 // Create a meta data constant
5508 const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) {
5509 assert(m == nullptr || !m->is_klass(), "wrong type");
5510 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons();
5511 }
5512
5513
5514 const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const {
5515 const Type* elem = _ary->_elem;
5516 bool xk = klass_is_exact();
5517 if (elem->make_oopptr() != nullptr) {
5518 elem = elem->make_oopptr()->as_klass_type(try_for_exact);
5519 if (elem->is_klassptr()->klass_is_exact()) {
5520 xk = true;
5521 }
5522 }
5523 return TypeAryKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, elem, klass(), 0);
5524 }
5525
5526 const TypeKlassPtr* TypeKlassPtr::make(ciKlass *klass, InterfaceHandling interface_handling) {
5527 if (klass->is_instance_klass()) {
5528 return TypeInstKlassPtr::make(klass, interface_handling);
5529 }
5530 return TypeAryKlassPtr::make(klass, interface_handling);
5531 }
5532
5533 const TypeKlassPtr* TypeKlassPtr::make(PTR ptr, ciKlass* klass, int offset, InterfaceHandling interface_handling) {
5534 if (klass->is_instance_klass()) {
5535 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
5536 return TypeInstKlassPtr::make(ptr, klass, interfaces, offset);
5537 }
5538 return TypeAryKlassPtr::make(ptr, klass, offset, interface_handling);
5539 }
5540
5541
5542 //------------------------------TypeKlassPtr-----------------------------------
5543 TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, int offset)
5544 : TypePtr(t, ptr, offset, relocInfo::metadata_type), _klass(klass), _interfaces(interfaces) {
5545 assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) ||
5546 klass->is_type_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here");
5547 }
5548
5549 // Is there a single ciKlass* that can represent that type?
5550 ciKlass* TypeKlassPtr::exact_klass_helper() const {
5551 assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface");
5552 if (_interfaces->empty()) {
5553 return _klass;
5554 }
5555 if (_klass != ciEnv::current()->Object_klass()) {
5556 if (_interfaces->eq(_klass->as_instance_klass())) {
5557 return _klass;
5558 }
5559 return nullptr;
5560 }
5561 return _interfaces->exact_klass();
5562 }
5563
5564 //------------------------------eq---------------------------------------------
5565 // Structural equality check for Type representations
5566 bool TypeKlassPtr::eq(const Type *t) const {
5567 const TypeKlassPtr *p = t->is_klassptr();
5568 return
5569 _interfaces->eq(p->_interfaces) &&
5570 TypePtr::eq(p);
5571 }
5572
5573 //------------------------------hash-------------------------------------------
5574 // Type-specific hashing function.
5575 uint TypeKlassPtr::hash(void) const {
5576 return TypePtr::hash() + _interfaces->hash();
5577 }
5578
5579 //------------------------------singleton--------------------------------------
5580 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5581 // constants
5582 bool TypeKlassPtr::singleton(void) const {
5583 // detune optimizer to not generate constant klass + constant offset as a constant!
5584 // TopPTR, Null, AnyNull, Constant are all singletons
5585 return (_offset == 0) && !below_centerline(_ptr);
5586 }
5587
5588 // Do not allow interface-vs.-noninterface joins to collapse to top.
5589 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const {
5590 // logic here mirrors the one from TypeOopPtr::filter. See comments
5591 // there.
5592 const Type* ft = join_helper(kills, include_speculative);
5593
5594 if (ft->empty()) {
5595 return Type::TOP; // Canonical empty value
5596 }
5597
5598 return ft;
5599 }
5600
5601 const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const {
5602 if (above_centerline(_ptr) && above_centerline(other->_ptr)) {
5603 return _interfaces->union_with(other->_interfaces);
5604 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) {
5605 return other->_interfaces;
5606 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) {
5607 return _interfaces;
5608 }
5609 return _interfaces->intersection_with(other->_interfaces);
5610 }
5611
5612 //------------------------------get_con----------------------------------------
5613 intptr_t TypeKlassPtr::get_con() const {
5614 assert( _ptr == Null || _ptr == Constant, "" );
5615 assert( _offset >= 0, "" );
5616
5617 if (_offset != 0) {
5618 // After being ported to the compiler interface, the compiler no longer
5619 // directly manipulates the addresses of oops. Rather, it only has a pointer
5620 // to a handle at compile time. This handle is embedded in the generated
5621 // code and dereferenced at the time the nmethod is made. Until that time,
5622 // it is not reasonable to do arithmetic with the addresses of oops (we don't
5623 // have access to the addresses!). This does not seem to currently happen,
5624 // but this assertion here is to help prevent its occurrence.
5625 tty->print_cr("Found oop constant with non-zero offset");
5626 ShouldNotReachHere();
5627 }
5628
5629 ciKlass* k = exact_klass();
5630
5631 return (intptr_t)k->constant_encoding();
5632 }
5633
5634 //=============================================================================
5635 // Convenience common pre-built types.
5636
5637 // Not-null object klass or below
5638 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT;
5639 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL;
5640
5641 bool TypeInstKlassPtr::eq(const Type *t) const {
5642 const TypeKlassPtr *p = t->is_klassptr();
5643 return
5644 klass()->equals(p->klass()) &&
5645 TypeKlassPtr::eq(p);
5646 }
5647
5648 uint TypeInstKlassPtr::hash(void) const {
5649 return klass()->hash() + TypeKlassPtr::hash();
5650 }
5651
5652 const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, int offset) {
5653 TypeInstKlassPtr *r =
5654 (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset))->hashcons();
5655
5656 return r;
5657 }
5658
5659 //------------------------------add_offset-------------------------------------
5660 // Access internals of klass object
5661 const TypePtr* TypeInstKlassPtr::add_offset( intptr_t offset ) const {
5662 return make( _ptr, klass(), _interfaces, xadd_offset(offset) );
5663 }
5664
5665 const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const {
5666 return make(_ptr, klass(), _interfaces, offset);
5667 }
5668
5669 //------------------------------cast_to_ptr_type-------------------------------
5670 const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const {
5671 assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type");
5672 if( ptr == _ptr ) return this;
5673 return make(ptr, _klass, _interfaces, _offset);
5674 }
5675
5676
5677 bool TypeInstKlassPtr::must_be_exact() const {
5678 if (!_klass->is_loaded()) return false;
5679 ciInstanceKlass* ik = _klass->as_instance_klass();
5680 if (ik->is_final()) return true; // cannot clear xk
5681 return false;
5682 }
5683
5684 //-----------------------------cast_to_exactness-------------------------------
5685 const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const {
5686 if (klass_is_exact == (_ptr == Constant)) return this;
5687 if (must_be_exact()) return this;
5688 ciKlass* k = klass();
5689 return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset);
5690 }
5691
5692
5693 //-----------------------------as_instance_type--------------------------------
5694 // Corresponding type for an instance of the given class.
5695 // It will be NotNull, and exact if and only if the klass type is exact.
5696 const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const {
5697 ciKlass* k = klass();
5698 bool xk = klass_is_exact();
5699 Compile* C = Compile::current();
5700 Dependencies* deps = C->dependencies();
5701 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
5702 // Element is an instance
5703 bool klass_is_exact = false;
5704 const TypeInterfaces* interfaces = _interfaces;
5705 if (k->is_loaded()) {
5706 // Try to set klass_is_exact.
5707 ciInstanceKlass* ik = k->as_instance_klass();
5708 klass_is_exact = ik->is_final();
5709 if (!klass_is_exact && klass_change
5710 && deps != nullptr && UseUniqueSubclasses) {
5711 ciInstanceKlass* sub = ik->unique_concrete_subklass();
5712 if (sub != nullptr) {
5713 if (_interfaces->eq(sub)) {
5714 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
5715 k = ik = sub;
5716 xk = sub->is_final();
5717 }
5718 }
5719 }
5720 }
5721 return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, 0);
5722 }
5723
5724 //------------------------------xmeet------------------------------------------
5725 // Compute the MEET of two types, return a new Type object.
5726 const Type *TypeInstKlassPtr::xmeet( const Type *t ) const {
5727 // Perform a fast test for common case; meeting the same types together.
5728 if( this == t ) return this; // Meeting same type-rep?
5729
5730 // Current "this->_base" is Pointer
5731 switch (t->base()) { // switch on original type
5732
5733 case Int: // Mixing ints & oops happens when javac
5734 case Long: // reuses local variables
5735 case HalfFloatTop:
5736 case HalfFloatCon:
5737 case HalfFloatBot:
5738 case FloatTop:
5739 case FloatCon:
5740 case FloatBot:
5741 case DoubleTop:
5742 case DoubleCon:
5743 case DoubleBot:
5744 case NarrowOop:
5745 case NarrowKlass:
5746 case Bottom: // Ye Olde Default
5747 return Type::BOTTOM;
5748 case Top:
5749 return this;
5750
5751 default: // All else is a mistake
5752 typerr(t);
5753
5754 case AnyPtr: { // Meeting to AnyPtrs
5755 // Found an AnyPtr type vs self-KlassPtr type
5756 const TypePtr *tp = t->is_ptr();
5757 int offset = meet_offset(tp->offset());
5758 PTR ptr = meet_ptr(tp->ptr());
5759 switch (tp->ptr()) {
5760 case TopPTR:
5761 return this;
5762 case Null:
5763 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5764 case AnyNull:
5765 return make( ptr, klass(), _interfaces, offset );
5766 case BotPTR:
5767 case NotNull:
5768 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5769 default: typerr(t);
5770 }
5771 }
5772
5773 case RawPtr:
5774 case MetadataPtr:
5775 case OopPtr:
5776 case AryPtr: // Meet with AryPtr
5777 case InstPtr: // Meet with InstPtr
5778 return TypePtr::BOTTOM;
5779
5780 //
5781 // A-top }
5782 // / | \ } Tops
5783 // B-top A-any C-top }
5784 // | / | \ | } Any-nulls
5785 // B-any | C-any }
5786 // | | |
5787 // B-con A-con C-con } constants; not comparable across classes
5788 // | | |
5789 // B-not | C-not }
5790 // | \ | / | } not-nulls
5791 // B-bot A-not C-bot }
5792 // \ | / } Bottoms
5793 // A-bot }
5794 //
5795
5796 case InstKlassPtr: { // Meet two KlassPtr types
5797 const TypeInstKlassPtr *tkls = t->is_instklassptr();
5798 int off = meet_offset(tkls->offset());
5799 PTR ptr = meet_ptr(tkls->ptr());
5800 const TypeInterfaces* interfaces = meet_interfaces(tkls);
5801
5802 ciKlass* res_klass = nullptr;
5803 bool res_xk = false;
5804 switch(meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) {
5805 case UNLOADED:
5806 ShouldNotReachHere();
5807 case SUBTYPE:
5808 case NOT_SUBTYPE:
5809 case LCA:
5810 case QUICK: {
5811 assert(res_xk == (ptr == Constant), "");
5812 const Type* res = make(ptr, res_klass, interfaces, off);
5813 return res;
5814 }
5815 default:
5816 ShouldNotReachHere();
5817 }
5818 } // End of case KlassPtr
5819 case AryKlassPtr: { // All arrays inherit from Object class
5820 const TypeAryKlassPtr *tp = t->is_aryklassptr();
5821 int offset = meet_offset(tp->offset());
5822 PTR ptr = meet_ptr(tp->ptr());
5823 const TypeInterfaces* interfaces = meet_interfaces(tp);
5824 const TypeInterfaces* tp_interfaces = tp->_interfaces;
5825 const TypeInterfaces* this_interfaces = _interfaces;
5826
5827 switch (ptr) {
5828 case TopPTR:
5829 case AnyNull: // Fall 'down' to dual of object klass
5830 // For instances when a subclass meets a superclass we fall
5831 // below the centerline when the superclass is exact. We need to
5832 // do the same here.
5833 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) {
5834 return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset);
5835 } else {
5836 // cannot subclass, so the meet has to fall badly below the centerline
5837 ptr = NotNull;
5838 interfaces = _interfaces->intersection_with(tp->_interfaces);
5839 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
5840 }
5841 case Constant:
5842 case NotNull:
5843 case BotPTR: // Fall down to object klass
5844 // LCA is object_klass, but if we subclass from the top we can do better
5845 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
5846 // If 'this' (InstPtr) is above the centerline and it is Object class
5847 // then we can subclass in the Java class hierarchy.
5848 // For instances when a subclass meets a superclass we fall
5849 // below the centerline when the superclass is exact. We need
5850 // to do the same here.
5851 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) {
5852 // that is, tp's array type is a subtype of my klass
5853 return TypeAryKlassPtr::make(ptr,
5854 tp->elem(), tp->klass(), offset);
5855 }
5856 }
5857 // The other case cannot happen, since I cannot be a subtype of an array.
5858 // The meet falls down to Object class below centerline.
5859 if( ptr == Constant )
5860 ptr = NotNull;
5861 interfaces = this_interfaces->intersection_with(tp_interfaces);
5862 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
5863 default: typerr(t);
5864 }
5865 }
5866
5867 } // End of switch
5868 return this; // Return the double constant
5869 }
5870
5871 //------------------------------xdual------------------------------------------
5872 // Dual: compute field-by-field dual
5873 const Type *TypeInstKlassPtr::xdual() const {
5874 return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset());
5875 }
5876
5877 template <class T1, class T2> bool TypePtr::is_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact) {
5878 static_assert(std::is_base_of<T2, T1>::value, "");
5879 if (!this_one->is_loaded() || !other->is_loaded()) {
5880 return false;
5881 }
5882 if (!this_one->is_instance_type(other)) {
5883 return false;
5884 }
5885
5886 if (!other_exact) {
5887 return false;
5888 }
5889
5890 if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) {
5891 return true;
5892 }
5893
5894 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
5948
5949 if (this_exact) {
5950 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
5951 }
5952
5953 return true;
5954 }
5955
5956 bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
5957 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
5958 }
5959
5960 const TypeKlassPtr* TypeInstKlassPtr::try_improve() const {
5961 if (!UseUniqueSubclasses) {
5962 return this;
5963 }
5964 ciKlass* k = klass();
5965 Compile* C = Compile::current();
5966 Dependencies* deps = C->dependencies();
5967 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
5968 const TypeInterfaces* interfaces = _interfaces;
5969 if (k->is_loaded()) {
5970 ciInstanceKlass* ik = k->as_instance_klass();
5971 bool klass_is_exact = ik->is_final();
5972 if (!klass_is_exact &&
5973 deps != nullptr) {
5974 ciInstanceKlass* sub = ik->unique_concrete_subklass();
5975 if (sub != nullptr) {
5976 if (_interfaces->eq(sub)) {
5977 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
5978 k = ik = sub;
5979 klass_is_exact = sub->is_final();
5980 return TypeKlassPtr::make(klass_is_exact ? Constant : _ptr, k, _offset);
5981 }
5982 }
5983 }
5984 }
5985 return this;
5986 }
5987
5988 #ifndef PRODUCT
5989 void TypeInstKlassPtr::dump2(Dict& d, uint depth, outputStream* st) const {
5990 st->print("instklassptr:");
5991 klass()->print_name_on(st);
5992 _interfaces->dump(st);
5993 st->print(":%s", ptr_msg[_ptr]);
5994 dump_offset(st);
5995 }
5996 #endif // PRODUCT
5997
5998 const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, const Type* elem, ciKlass* k, int offset) {
5999 return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset))->hashcons();
6000 }
6001
6002 const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, ciKlass* k, int offset, InterfaceHandling interface_handling) {
6003 if (k->is_obj_array_klass()) {
6004 // Element is an object array. Recursively call ourself.
6005 ciKlass* eklass = k->as_obj_array_klass()->element_klass();
6006 const TypeKlassPtr *etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false);
6007 return TypeAryKlassPtr::make(ptr, etype, nullptr, offset);
6008 } else if (k->is_type_array_klass()) {
6009 // Element is an typeArray
6010 const Type* etype = get_const_basic_type(k->as_type_array_klass()->element_type());
6011 return TypeAryKlassPtr::make(ptr, etype, k, offset);
6012 } else {
6013 ShouldNotReachHere();
6014 return nullptr;
6015 }
6016 }
6017
6018 const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) {
6019 return TypeAryKlassPtr::make(Constant, klass, 0, interface_handling);
6020 }
6021
6022 //------------------------------eq---------------------------------------------
6023 // Structural equality check for Type representations
6024 bool TypeAryKlassPtr::eq(const Type *t) const {
6025 const TypeAryKlassPtr *p = t->is_aryklassptr();
6026 return
6027 _elem == p->_elem && // Check array
6028 TypeKlassPtr::eq(p); // Check sub-parts
6029 }
6030
6031 //------------------------------hash-------------------------------------------
6032 // Type-specific hashing function.
6033 uint TypeAryKlassPtr::hash(void) const {
6034 return (uint)(uintptr_t)_elem + TypeKlassPtr::hash();
6035 }
6036
6037 //----------------------compute_klass------------------------------------------
6038 // Compute the defining klass for this class
6039 ciKlass* TypeAryPtr::compute_klass() const {
6040 // Compute _klass based on element type.
6041 ciKlass* k_ary = nullptr;
6042 const TypeInstPtr *tinst;
6043 const TypeAryPtr *tary;
6044 const Type* el = elem();
6045 if (el->isa_narrowoop()) {
6046 el = el->make_ptr();
6047 }
6048
6049 // Get element klass
6050 if ((tinst = el->isa_instptr()) != nullptr) {
6051 // Leave k_ary at null.
6052 } else if ((tary = el->isa_aryptr()) != nullptr) {
6053 // Leave k_ary at null.
6054 } else if ((el->base() == Type::Top) ||
6055 (el->base() == Type::Bottom)) {
6056 // element type of Bottom occurs from meet of basic type
6057 // and object; Top occurs when doing join on Bottom.
6058 // Leave k_ary at null.
6059 } else {
6060 assert(!el->isa_int(), "integral arrays must be pre-equipped with a class");
6061 // Compute array klass directly from basic type
6062 k_ary = ciTypeArrayKlass::make(el->basic_type());
6063 }
6064 return k_ary;
6065 }
6066
6067 //------------------------------klass------------------------------------------
6068 // Return the defining klass for this class
6069 ciKlass* TypeAryPtr::klass() const {
6070 if( _klass ) return _klass; // Return cached value, if possible
6071
6072 // Oops, need to compute _klass and cache it
6073 ciKlass* k_ary = compute_klass();
6081 // type TypeAryPtr::OOPS. This Type is shared between all
6082 // active compilations. However, the ciKlass which represents
6083 // this Type is *not* shared between compilations, so caching
6084 // this value would result in fetching a dangling pointer.
6085 //
6086 // Recomputing the underlying ciKlass for each request is
6087 // a bit less efficient than caching, but calls to
6088 // TypeAryPtr::OOPS->klass() are not common enough to matter.
6089 ((TypeAryPtr*)this)->_klass = k_ary;
6090 }
6091 return k_ary;
6092 }
6093
6094 // Is there a single ciKlass* that can represent that type?
6095 ciKlass* TypeAryPtr::exact_klass_helper() const {
6096 if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) {
6097 ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper();
6098 if (k == nullptr) {
6099 return nullptr;
6100 }
6101 k = ciObjArrayKlass::make(k);
6102 return k;
6103 }
6104
6105 return klass();
6106 }
6107
6108 const Type* TypeAryPtr::base_element_type(int& dims) const {
6109 const Type* elem = this->elem();
6110 dims = 1;
6111 while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) {
6112 elem = elem->make_ptr()->is_aryptr()->elem();
6113 dims++;
6114 }
6115 return elem;
6116 }
6117
6118 //------------------------------add_offset-------------------------------------
6119 // Access internals of klass object
6120 const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const {
6121 return make(_ptr, elem(), klass(), xadd_offset(offset));
6122 }
6123
6124 const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const {
6125 return make(_ptr, elem(), klass(), offset);
6126 }
6127
6128 //------------------------------cast_to_ptr_type-------------------------------
6129 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const {
6130 assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type");
6131 if (ptr == _ptr) return this;
6132 return make(ptr, elem(), _klass, _offset);
6133 }
6134
6135 bool TypeAryKlassPtr::must_be_exact() const {
6136 if (_elem == Type::BOTTOM) return false;
6137 if (_elem == Type::TOP ) return false;
6138 const TypeKlassPtr* tk = _elem->isa_klassptr();
6139 if (!tk) return true; // a primitive type, like int
6140 return tk->must_be_exact();
6141 }
6142
6143
6144 //-----------------------------cast_to_exactness-------------------------------
6145 const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const {
6146 if (must_be_exact()) return this; // cannot clear xk
6147 ciKlass* k = _klass;
6148 const Type* elem = this->elem();
6149 if (elem->isa_klassptr() && !klass_is_exact) {
6150 elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact);
6151 }
6152 return make(klass_is_exact ? Constant : NotNull, elem, k, _offset);
6153 }
6154
6155
6156 //-----------------------------as_instance_type--------------------------------
6157 // Corresponding type for an instance of the given class.
6158 // It will be NotNull, and exact if and only if the klass type is exact.
6159 const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const {
6160 ciKlass* k = klass();
6161 bool xk = klass_is_exact();
6162 const Type* el = nullptr;
6163 if (elem()->isa_klassptr()) {
6164 el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false);
6165 k = nullptr;
6166 } else {
6167 el = elem();
6168 }
6169 return TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(el, TypeInt::POS), k, xk, 0);
6170 }
6171
6172
6173 //------------------------------xmeet------------------------------------------
6174 // Compute the MEET of two types, return a new Type object.
6175 const Type *TypeAryKlassPtr::xmeet( const Type *t ) const {
6176 // Perform a fast test for common case; meeting the same types together.
6177 if( this == t ) return this; // Meeting same type-rep?
6178
6179 // Current "this->_base" is Pointer
6180 switch (t->base()) { // switch on original type
6181
6182 case Int: // Mixing ints & oops happens when javac
6183 case Long: // reuses local variables
6184 case HalfFloatTop:
6185 case HalfFloatCon:
6186 case HalfFloatBot:
6187 case FloatTop:
6188 case FloatCon:
6189 case FloatBot:
6190 case DoubleTop:
6191 case DoubleCon:
6192 case DoubleBot:
6193 case NarrowOop:
6194 case NarrowKlass:
6195 case Bottom: // Ye Olde Default
6196 return Type::BOTTOM;
6197 case Top:
6198 return this;
6199
6200 default: // All else is a mistake
6201 typerr(t);
6202
6203 case AnyPtr: { // Meeting to AnyPtrs
6204 // Found an AnyPtr type vs self-KlassPtr type
6205 const TypePtr *tp = t->is_ptr();
6206 int offset = meet_offset(tp->offset());
6207 PTR ptr = meet_ptr(tp->ptr());
6208 switch (tp->ptr()) {
6209 case TopPTR:
6210 return this;
6211 case Null:
6212 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6213 case AnyNull:
6214 return make( ptr, _elem, klass(), offset );
6215 case BotPTR:
6216 case NotNull:
6217 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6218 default: typerr(t);
6219 }
6220 }
6221
6222 case RawPtr:
6223 case MetadataPtr:
6224 case OopPtr:
6225 case AryPtr: // Meet with AryPtr
6226 case InstPtr: // Meet with InstPtr
6227 return TypePtr::BOTTOM;
6228
6229 //
6230 // A-top }
6231 // / | \ } Tops
6232 // B-top A-any C-top }
6233 // | / | \ | } Any-nulls
6234 // B-any | C-any }
6235 // | | |
6236 // B-con A-con C-con } constants; not comparable across classes
6237 // | | |
6238 // B-not | C-not }
6239 // | \ | / | } not-nulls
6240 // B-bot A-not C-bot }
6241 // \ | / } Bottoms
6242 // A-bot }
6243 //
6244
6245 case AryKlassPtr: { // Meet two KlassPtr types
6246 const TypeAryKlassPtr *tap = t->is_aryklassptr();
6247 int off = meet_offset(tap->offset());
6248 const Type* elem = _elem->meet(tap->_elem);
6249
6250 PTR ptr = meet_ptr(tap->ptr());
6251 ciKlass* res_klass = nullptr;
6252 bool res_xk = false;
6253 meet_aryptr(ptr, elem, this, tap, res_klass, res_xk);
6254 assert(res_xk == (ptr == Constant), "");
6255 return make(ptr, elem, res_klass, off);
6256 } // End of case KlassPtr
6257 case InstKlassPtr: {
6258 const TypeInstKlassPtr *tp = t->is_instklassptr();
6259 int offset = meet_offset(tp->offset());
6260 PTR ptr = meet_ptr(tp->ptr());
6261 const TypeInterfaces* interfaces = meet_interfaces(tp);
6262 const TypeInterfaces* tp_interfaces = tp->_interfaces;
6263 const TypeInterfaces* this_interfaces = _interfaces;
6264
6265 switch (ptr) {
6266 case TopPTR:
6267 case AnyNull: // Fall 'down' to dual of object klass
6268 // For instances when a subclass meets a superclass we fall
6269 // below the centerline when the superclass is exact. We need to
6270 // do the same here.
6271 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
6272 !tp->klass_is_exact()) {
6273 return TypeAryKlassPtr::make(ptr, _elem, _klass, offset);
6274 } else {
6275 // cannot subclass, so the meet has to fall badly below the centerline
6276 ptr = NotNull;
6277 interfaces = this_interfaces->intersection_with(tp->_interfaces);
6278 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
6279 }
6280 case Constant:
6281 case NotNull:
6282 case BotPTR: // Fall down to object klass
6283 // LCA is object_klass, but if we subclass from the top we can do better
6284 if (above_centerline(tp->ptr())) {
6285 // If 'tp' is above the centerline and it is Object class
6286 // then we can subclass in the Java class hierarchy.
6287 // For instances when a subclass meets a superclass we fall
6288 // below the centerline when the superclass is exact. We need
6289 // to do the same here.
6290 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
6291 !tp->klass_is_exact()) {
6292 // that is, my array type is a subtype of 'tp' klass
6293 return make(ptr, _elem, _klass, offset);
6294 }
6295 }
6296 // The other case cannot happen, since t cannot be a subtype of an array.
6297 // The meet falls down to Object class below centerline.
6298 if (ptr == Constant)
6299 ptr = NotNull;
6300 interfaces = this_interfaces->intersection_with(tp_interfaces);
6301 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
6302 default: typerr(t);
6303 }
6304 }
6305
6306 } // End of switch
6307 return this; // Return the double constant
6308 }
6309
6310 template <class T1, class T2> bool TypePtr::is_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact) {
6311 static_assert(std::is_base_of<T2, T1>::value, "");
6312
6313 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) {
6314 return true;
6315 }
6316
6317 int dummy;
6318 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
6319
6320 if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
6321 return false;
6322 }
6323
6324 if (this_one->is_instance_type(other)) {
6325 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) &&
6326 other_exact;
6327 }
6328
6329 assert(this_one->is_array_type(other), "");
6330 const T1* other_ary = this_one->is_array_type(other);
6331 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
6332 if (other_top_or_bottom) {
6333 return false;
6334 }
6335
6336 const TypePtr* other_elem = other_ary->elem()->make_ptr();
6337 const TypePtr* this_elem = this_one->elem()->make_ptr();
6338 if (this_elem != nullptr && other_elem != nullptr) {
6339 return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
6340 }
6341 if (this_elem == nullptr && other_elem == nullptr) {
6342 return this_one->klass()->is_subtype_of(other->klass());
6343 }
6344 return false;
6345 }
6346
6347 bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6348 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
6349 }
6350
6351 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) {
6352 static_assert(std::is_base_of<T2, T1>::value, "");
6353
6354 int dummy;
6355 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
6356
6357 if (!this_one->is_array_type(other) ||
6358 !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
6411 }
6412
6413 const TypePtr* this_elem = this_one->elem()->make_ptr();
6414 const TypePtr* other_elem = other_ary->elem()->make_ptr();
6415 if (other_elem != nullptr && this_elem != nullptr) {
6416 return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
6417 }
6418 if (other_elem == nullptr && this_elem == nullptr) {
6419 return this_one->klass()->is_subtype_of(other->klass());
6420 }
6421 return false;
6422 }
6423
6424 bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6425 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
6426 }
6427
6428 //------------------------------xdual------------------------------------------
6429 // Dual: compute field-by-field dual
6430 const Type *TypeAryKlassPtr::xdual() const {
6431 return new TypeAryKlassPtr(dual_ptr(), elem()->dual(), klass(), dual_offset());
6432 }
6433
6434 // Is there a single ciKlass* that can represent that type?
6435 ciKlass* TypeAryKlassPtr::exact_klass_helper() const {
6436 if (elem()->isa_klassptr()) {
6437 ciKlass* k = elem()->is_klassptr()->exact_klass_helper();
6438 if (k == nullptr) {
6439 return nullptr;
6440 }
6441 k = ciObjArrayKlass::make(k);
6442 return k;
6443 }
6444
6445 return klass();
6446 }
6447
6448 ciKlass* TypeAryKlassPtr::klass() const {
6449 if (_klass != nullptr) {
6450 return _klass;
6451 }
6452 ciKlass* k = nullptr;
6453 if (elem()->isa_klassptr()) {
6454 // leave null
6455 } else if ((elem()->base() == Type::Top) ||
6456 (elem()->base() == Type::Bottom)) {
6457 } else {
6458 k = ciTypeArrayKlass::make(elem()->basic_type());
6459 ((TypeAryKlassPtr*)this)->_klass = k;
6460 }
6461 return k;
6462 }
6463
6464 //------------------------------dump2------------------------------------------
6465 // Dump Klass Type
6466 #ifndef PRODUCT
6467 void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
6468 st->print("aryklassptr:[");
6469 _elem->dump2(d, depth, st);
6470 _interfaces->dump(st);
6471 st->print(":%s", ptr_msg[_ptr]);
6472 dump_offset(st);
6473 }
6474 #endif
6475
6476 const Type* TypeAryKlassPtr::base_element_type(int& dims) const {
6477 const Type* elem = this->elem();
6478 dims = 1;
6479 while (elem->isa_aryklassptr()) {
6480 elem = elem->is_aryklassptr()->elem();
6481 dims++;
6482 }
6483 return elem;
6484 }
6485
6486 //=============================================================================
6487 // Convenience common pre-built types.
6488
6489 //------------------------------make-------------------------------------------
6490 const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) {
6491 return (TypeFunc*)(new TypeFunc(domain,range))->hashcons();
6492 }
6493
6494 //------------------------------make-------------------------------------------
6495 const TypeFunc *TypeFunc::make(ciMethod* method) {
6496 Compile* C = Compile::current();
6497 const TypeFunc* tf = C->last_tf(method); // check cache
6498 if (tf != nullptr) return tf; // The hit rate here is almost 50%.
6499 const TypeTuple *domain;
6500 if (method->is_static()) {
6501 domain = TypeTuple::make_domain(nullptr, method->signature(), ignore_interfaces);
6502 } else {
6503 domain = TypeTuple::make_domain(method->holder(), method->signature(), ignore_interfaces);
6504 }
6505 const TypeTuple *range = TypeTuple::make_range(method->signature(), ignore_interfaces);
6506 tf = TypeFunc::make(domain, range);
6507 C->set_last_tf(method, tf); // fill cache
6508 return tf;
6509 }
6510
6511 //------------------------------meet-------------------------------------------
6512 // Compute the MEET of two types. It returns a new Type object.
6513 const Type *TypeFunc::xmeet( const Type *t ) const {
6514 // Perform a fast test for common case; meeting the same types together.
6515 if( this == t ) return this; // Meeting same type-rep?
6516
6517 // Current "this->_base" is Func
6518 switch (t->base()) { // switch on original type
6519
6520 case Bottom: // Ye Olde Default
6521 return t;
6522
6523 default: // All else is a mistake
6524 typerr(t);
6525
6526 case Top:
6527 break;
6528 }
6529 return this; // Return the double constant
6530 }
6531
6532 //------------------------------xdual------------------------------------------
6533 // Dual: compute field-by-field dual
6534 const Type *TypeFunc::xdual() const {
6535 return this;
6536 }
6537
6538 //------------------------------eq---------------------------------------------
6539 // Structural equality check for Type representations
6540 bool TypeFunc::eq( const Type *t ) const {
6541 const TypeFunc *a = (const TypeFunc*)t;
6542 return _domain == a->_domain &&
6543 _range == a->_range;
6544 }
6545
6546 //------------------------------hash-------------------------------------------
6547 // Type-specific hashing function.
6548 uint TypeFunc::hash(void) const {
6549 return (uint)(uintptr_t)_domain + (uint)(uintptr_t)_range;
6550 }
6551
6552 //------------------------------dump2------------------------------------------
6553 // Dump Function Type
6554 #ifndef PRODUCT
6555 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
6556 if( _range->cnt() <= Parms )
6557 st->print("void");
6558 else {
6559 uint i;
6560 for (i = Parms; i < _range->cnt()-1; i++) {
6561 _range->field_at(i)->dump2(d,depth,st);
6562 st->print("/");
6563 }
6564 _range->field_at(i)->dump2(d,depth,st);
6565 }
6566 st->print(" ");
6567 st->print("( ");
6568 if( !depth || d[this] ) { // Check for recursive dump
6569 st->print("...)");
6570 return;
6571 }
6572 d.Insert((void*)this,(void*)this); // Stop recursion
6573 if (Parms < _domain->cnt())
6574 _domain->field_at(Parms)->dump2(d,depth-1,st);
6575 for (uint i = Parms+1; i < _domain->cnt(); i++) {
6576 st->print(", ");
6577 _domain->field_at(i)->dump2(d,depth-1,st);
6578 }
6579 st->print(" )");
6580 }
6581 #endif
6582
6583 //------------------------------singleton--------------------------------------
6584 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
6585 // constants (Ldi nodes). Singletons are integer, float or double constants
6586 // or a single symbol.
6587 bool TypeFunc::singleton(void) const {
6588 return false; // Never a singleton
6589 }
6590
6591 bool TypeFunc::empty(void) const {
6592 return false; // Never empty
6593 }
6594
6595
6596 BasicType TypeFunc::return_type() const{
6597 if (range()->cnt() == TypeFunc::Parms) {
6598 return T_VOID;
6599 }
6600 return range()->field_at(TypeFunc::Parms)->basic_type();
6601 }
|
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "ci/ciField.hpp"
26 #include "ci/ciFlatArray.hpp"
27 #include "ci/ciFlatArrayKlass.hpp"
28 #include "ci/ciInlineKlass.hpp"
29 #include "ci/ciMethodData.hpp"
30 #include "ci/ciObjArrayKlass.hpp"
31 #include "ci/ciTypeFlow.hpp"
32 #include "classfile/javaClasses.hpp"
33 #include "classfile/symbolTable.hpp"
34 #include "classfile/vmSymbols.hpp"
35 #include "compiler/compileLog.hpp"
36 #include "libadt/dict.hpp"
37 #include "memory/oopFactory.hpp"
38 #include "memory/resourceArea.hpp"
39 #include "oops/instanceKlass.hpp"
40 #include "oops/instanceMirrorKlass.hpp"
41 #include "oops/objArrayKlass.hpp"
42 #include "oops/typeArrayKlass.hpp"
43 #include "opto/arraycopynode.hpp"
44 #include "opto/callnode.hpp"
45 #include "opto/matcher.hpp"
46 #include "opto/node.hpp"
47 #include "opto/opcodes.hpp"
48 #include "opto/rangeinference.hpp"
49 #include "opto/runtime.hpp"
50 #include "opto/type.hpp"
51 #include "runtime/globals.hpp"
52 #include "runtime/stubRoutines.hpp"
53 #include "utilities/checkedCast.hpp"
54 #include "utilities/debug.hpp"
55 #include "utilities/globalDefinitions.hpp"
56 #include "utilities/ostream.hpp"
57 #include "utilities/powerOfTwo.hpp"
58 #include "utilities/stringUtils.hpp"
59 #if INCLUDE_SHENANDOAHGC
60 #include "gc/shenandoah/c2/shenandoahBarrierSetC2.hpp"
61 #endif // INCLUDE_SHENANDOAHGC
62
63 // Portions of code courtesy of Clifford Click
64
65 // Optimization - Graph Style
66
67 // Dictionary of types shared among compilations.
68 Dict* Type::_shared_type_dict = nullptr;
69 const Type::Offset Type::Offset::top(Type::OffsetTop);
70 const Type::Offset Type::Offset::bottom(Type::OffsetBot);
71
72 const Type::Offset Type::Offset::meet(const Type::Offset other) const {
73 // Either is 'TOP' offset? Return the other offset!
74 if (_offset == OffsetTop) return other;
75 if (other._offset == OffsetTop) return *this;
76 // If either is different, return 'BOTTOM' offset
77 if (_offset != other._offset) return bottom;
78 return Offset(_offset);
79 }
80
81 const Type::Offset Type::Offset::dual() const {
82 if (_offset == OffsetTop) return bottom;// Map 'TOP' into 'BOTTOM'
83 if (_offset == OffsetBot) return top;// Map 'BOTTOM' into 'TOP'
84 return Offset(_offset); // Map everything else into self
85 }
86
87 const Type::Offset Type::Offset::add(intptr_t offset) const {
88 // Adding to 'TOP' offset? Return 'TOP'!
89 if (_offset == OffsetTop || offset == OffsetTop) return top;
90 // Adding to 'BOTTOM' offset? Return 'BOTTOM'!
91 if (_offset == OffsetBot || offset == OffsetBot) return bottom;
92 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'!
93 offset += (intptr_t)_offset;
94 if (offset != (int)offset || offset == OffsetTop) return bottom;
95
96 // assert( _offset >= 0 && _offset+offset >= 0, "" );
97 // It is possible to construct a negative offset during PhaseCCP
98
99 return Offset((int)offset); // Sum valid offsets
100 }
101
102 void Type::Offset::dump2(outputStream *st) const {
103 if (_offset == 0) {
104 return;
105 } else if (_offset == OffsetTop) {
106 st->print("+top");
107 } else if (_offset == OffsetBot) {
108 st->print("+bot");
109 } else {
110 st->print("+%d", _offset);
111 }
112 }
113
114 // Array which maps compiler types to Basic Types
115 const Type::TypeInfo Type::_type_info[Type::lastype] = {
116 { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg}, // Bad
117 { Control, T_ILLEGAL, "control", false, 0 }, // Control
118 { Bottom, T_VOID, "top", false, 0 }, // Top
119 { Bad, T_INT, "int:", false, Op_RegI }, // Int
120 { Bad, T_LONG, "long:", false, Op_RegL }, // Long
121 { Half, T_VOID, "half", false, 0 }, // Half
122 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN }, // NarrowOop
123 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN }, // NarrowKlass
124 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg}, // Tuple
125 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg}, // Array
126 { Bad, T_ARRAY, "interfaces:", false, Node::NotAMachineReg}, // Interfaces
127
128 #if defined(PPC64)
129 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask }, // VectorMask.
130 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA }, // VectorA.
131 { Bad, T_ILLEGAL, "vectors:", false, 0 }, // VectorS
132 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL }, // VectorD
271 case ciTypeFlow::StateVector::T_NULL:
272 assert(type == ciTypeFlow::StateVector::null_type(), "");
273 return TypePtr::NULL_PTR;
274
275 case ciTypeFlow::StateVector::T_LONG2:
276 // The ciTypeFlow pass pushes a long, then the half.
277 // We do the same.
278 assert(type == ciTypeFlow::StateVector::long2_type(), "");
279 return TypeInt::TOP;
280
281 case ciTypeFlow::StateVector::T_DOUBLE2:
282 // The ciTypeFlow pass pushes double, then the half.
283 // Our convention is the same.
284 assert(type == ciTypeFlow::StateVector::double2_type(), "");
285 return Type::TOP;
286
287 case T_ADDRESS:
288 assert(type->is_return_address(), "");
289 return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci(), relocInfo::none);
290
291 case T_OBJECT:
292 return Type::get_const_type(type->unwrap())->join_speculative(type->is_null_free() ? TypePtr::NOTNULL : TypePtr::BOTTOM);
293
294 default:
295 // make sure we did not mix up the cases:
296 assert(type != ciTypeFlow::StateVector::bottom_type(), "");
297 assert(type != ciTypeFlow::StateVector::top_type(), "");
298 assert(type != ciTypeFlow::StateVector::null_type(), "");
299 assert(type != ciTypeFlow::StateVector::long2_type(), "");
300 assert(type != ciTypeFlow::StateVector::double2_type(), "");
301 assert(!type->is_return_address(), "");
302
303 return Type::get_const_type(type);
304 }
305 }
306
307
308 //-----------------------make_from_constant------------------------------------
309 const Type* Type::make_from_constant(ciConstant constant, bool require_constant,
310 int stable_dimension, bool is_narrow_oop,
311 bool is_autobox_cache) {
312 switch (constant.basic_type()) {
313 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
363 case T_NARROWOOP: loadbt = T_OBJECT; break;
364 case T_ARRAY: loadbt = T_OBJECT; break;
365 case T_ADDRESS: loadbt = T_OBJECT; break;
366 default: break;
367 }
368 if (conbt == loadbt) {
369 if (is_unsigned && conbt == T_BYTE) {
370 // LoadB (T_BYTE) with a small mask (<=8-bit) is converted to LoadUB (T_BYTE).
371 return ciConstant(T_INT, con.as_int() & 0xFF);
372 } else {
373 return con;
374 }
375 }
376 if (conbt == T_SHORT && loadbt == T_CHAR) {
377 // LoadS (T_SHORT) with a small mask (<=16-bit) is converted to LoadUS (T_CHAR).
378 return ciConstant(T_INT, con.as_int() & 0xFFFF);
379 }
380 return ciConstant(); // T_ILLEGAL
381 }
382
383 static const Type* make_constant_from_non_flat_array_element(ciArray* array, int off, int stable_dimension,
384 BasicType loadbt, bool is_unsigned_load) {
385 // Decode the results of GraphKit::array_element_address.
386 ciConstant element_value = array->element_value_by_offset(off);
387 if (element_value.basic_type() == T_ILLEGAL) {
388 return nullptr; // wrong offset
389 }
390 ciConstant con = check_mismatched_access(element_value, loadbt, is_unsigned_load);
391
392 assert(con.basic_type() != T_ILLEGAL, "elembt=%s; loadbt=%s; unsigned=%d",
393 type2name(element_value.basic_type()), type2name(loadbt), is_unsigned_load);
394
395 if (con.is_valid() && // not a mismatched access
396 !con.is_null_or_zero()) { // not a default value
397 bool is_narrow_oop = (loadbt == T_NARROWOOP);
398 return Type::make_from_constant(con, /*require_constant=*/true, stable_dimension, is_narrow_oop, /*is_autobox_cache=*/false);
399 }
400 return nullptr;
401 }
402
403 static const Type* make_constant_from_flat_array_element(ciFlatArray* array, int off, int field_offset, int stable_dimension,
404 BasicType loadbt, bool is_unsigned_load) {
405 if (!array->is_null_free()) {
406 ciConstant nm_value = array->null_marker_of_element_by_offset(off);
407 if (!nm_value.is_valid() || !nm_value.as_boolean()) {
408 return nullptr;
409 }
410 }
411 ciConstant element_value = array->field_value_by_offset(off + field_offset);
412 if (element_value.basic_type() == T_ILLEGAL) {
413 return nullptr; // wrong offset
414 }
415 ciConstant con = check_mismatched_access(element_value, loadbt, is_unsigned_load);
416
417 assert(con.basic_type() != T_ILLEGAL, "elembt=%s; loadbt=%s; unsigned=%d",
418 type2name(element_value.basic_type()), type2name(loadbt), is_unsigned_load);
419
420 if (con.is_valid()) { // not a mismatched access
421 bool is_narrow_oop = (loadbt == T_NARROWOOP);
422 return Type::make_from_constant(con, /*require_constant=*/true, stable_dimension, is_narrow_oop, /*is_autobox_cache=*/false);
423 }
424 return nullptr;
425 }
426
427 // Try to constant-fold a stable array element.
428 const Type* Type::make_constant_from_array_element(ciArray* array, int off, int field_offset, int stable_dimension,
429 BasicType loadbt, bool is_unsigned_load) {
430 if (array->is_flat()) {
431 return make_constant_from_flat_array_element(array->as_flat_array(), off, field_offset, stable_dimension, loadbt, is_unsigned_load);
432 }
433 return make_constant_from_non_flat_array_element(array, off, stable_dimension, loadbt, is_unsigned_load);
434 }
435
436 const Type* Type::make_constant_from_field(ciInstance* holder, int off, bool is_unsigned_load, BasicType loadbt) {
437 ciField* field;
438 ciType* type = holder->java_mirror_type();
439 if (type != nullptr && type->is_instance_klass() && off >= InstanceMirrorKlass::offset_of_static_fields()) {
440 // Static field
441 field = type->as_instance_klass()->get_field_by_offset(off, /*is_static=*/true);
442 } else {
443 // Instance field
444 field = holder->klass()->as_instance_klass()->get_field_by_offset(off, /*is_static=*/false);
445 }
446 if (field == nullptr) {
447 return nullptr; // Wrong offset
448 }
449 return Type::make_constant_from_field(field, holder, loadbt, is_unsigned_load);
450 }
451
452 const Type* Type::make_constant_from_field(ciField* field, ciInstance* holder,
453 BasicType loadbt, bool is_unsigned_load) {
454 if (!field->is_constant()) {
455 return nullptr; // Non-constant field
628 const Type **ffalse =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
629 ffalse[0] = Type::CONTROL;
630 ffalse[1] = Type::TOP;
631 TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse );
632
633 const Type **fneither =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
634 fneither[0] = Type::TOP;
635 fneither[1] = Type::TOP;
636 TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither );
637
638 const Type **ftrue =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
639 ftrue[0] = Type::TOP;
640 ftrue[1] = Type::CONTROL;
641 TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue );
642
643 const Type **floop =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
644 floop[0] = Type::CONTROL;
645 floop[1] = TypeInt::INT;
646 TypeTuple::LOOPBODY = TypeTuple::make( 2, floop );
647
648 TypePtr::NULL_PTR= TypePtr::make(AnyPtr, TypePtr::Null, Offset(0));
649 TypePtr::NOTNULL = TypePtr::make(AnyPtr, TypePtr::NotNull, Offset::bottom);
650 TypePtr::BOTTOM = TypePtr::make(AnyPtr, TypePtr::BotPTR, Offset::bottom);
651
652 TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR );
653 TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull );
654
655 const Type **fmembar = TypeTuple::fields(0);
656 TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar);
657
658 const Type **fsc = (const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
659 fsc[0] = TypeInt::CC;
660 fsc[1] = Type::MEMORY;
661 TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc);
662
663 TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass());
664 TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass());
665 TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass());
666 TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
667 false, nullptr, Offset(oopDesc::mark_offset_in_bytes()));
668 TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
669 false, nullptr, Offset(oopDesc::klass_offset_in_bytes()));
670 TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, Offset::bottom, TypeOopPtr::InstanceBot);
671
672 TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, nullptr, Offset::bottom);
673
674 TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR );
675 TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM );
676
677 TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR );
678
679 mreg2type[Op_Node] = Type::BOTTOM;
680 mreg2type[Op_Set ] = nullptr;
681 mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM;
682 mreg2type[Op_RegI] = TypeInt::INT;
683 mreg2type[Op_RegP] = TypePtr::BOTTOM;
684 mreg2type[Op_RegF] = Type::FLOAT;
685 mreg2type[Op_RegD] = Type::DOUBLE;
686 mreg2type[Op_RegL] = TypeLong::LONG;
687 mreg2type[Op_RegFlags] = TypeInt::CC;
688
689 GrowableArray<ciInstanceKlass*> array_interfaces;
690 array_interfaces.push(current->env()->Cloneable_klass());
691 array_interfaces.push(current->env()->Serializable_klass());
692 TypeAryPtr::_array_interfaces = TypeInterfaces::make(&array_interfaces);
693 TypeAryKlassPtr::_array_interfaces = TypeAryPtr::_array_interfaces;
694
695 TypeAryPtr::BOTTOM = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::BOTTOM, TypeInt::POS, false, false, false, false, false), nullptr, false, Offset::bottom);
696 TypeAryPtr::RANGE = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS, false, false, false, false, false), nullptr /* current->env()->Object_klass() */, false, Offset(arrayOopDesc::length_offset_in_bytes()));
697
698 TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS, false, false, false, false, false), nullptr /*ciArrayKlass::make(o)*/, false, Offset::bottom);
699
700 #ifdef _LP64
701 if (UseCompressedOops) {
702 assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop");
703 TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS;
704 } else
705 #endif
706 {
707 // There is no shared klass for Object[]. See note in TypeAryPtr::klass().
708 TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS, false, false, false, false, false), nullptr /*ciArrayKlass::make(o)*/, false, Offset::bottom);
709 }
710 TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_BYTE), true, Offset::bottom);
711 TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_SHORT), true, Offset::bottom);
712 TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_CHAR), true, Offset::bottom);
713 TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_INT), true, Offset::bottom);
714 TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_LONG), true, Offset::bottom);
715 TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_FLOAT), true, Offset::bottom);
716 TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_DOUBLE), true, Offset::bottom);
717 TypeAryPtr::INLINES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS, /* stable= */ false, /* flat= */ true, false, false, false), nullptr, false, Offset::bottom);
718
719 // Nobody should ask _array_body_type[T_NARROWOOP]. Use null as assert.
720 TypeAryPtr::_array_body_type[T_NARROWOOP] = nullptr;
721 TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS;
722 TypeAryPtr::_array_body_type[T_FLAT_ELEMENT] = TypeAryPtr::OOPS;
723 TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays
724 TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES;
725 TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array
726 TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS;
727 TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS;
728 TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS;
729 TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS;
730 TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS;
731 TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES;
732
733 TypeInstKlassPtr::OBJECT = TypeInstKlassPtr::make(TypePtr::NotNull, current->env()->Object_klass(), Offset(0));
734 TypeInstKlassPtr::OBJECT_OR_NULL = TypeInstKlassPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), Offset(0));
735
736 const Type **fi2c = TypeTuple::fields(2);
737 fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method*
738 fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer
739 TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c);
740
741 const Type **intpair = TypeTuple::fields(2);
742 intpair[0] = TypeInt::INT;
743 intpair[1] = TypeInt::INT;
744 TypeTuple::INT_PAIR = TypeTuple::make(2, intpair);
745
746 const Type **longpair = TypeTuple::fields(2);
747 longpair[0] = TypeLong::LONG;
748 longpair[1] = TypeLong::LONG;
749 TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair);
750
751 const Type **intccpair = TypeTuple::fields(2);
752 intccpair[0] = TypeInt::INT;
753 intccpair[1] = TypeInt::CC;
754 TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair);
755
756 const Type **longccpair = TypeTuple::fields(2);
757 longccpair[0] = TypeLong::LONG;
758 longccpair[1] = TypeInt::CC;
759 TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair);
760
761 _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM;
762 _const_basic_type[T_NARROWKLASS] = Type::BOTTOM;
763 _const_basic_type[T_BOOLEAN] = TypeInt::BOOL;
764 _const_basic_type[T_CHAR] = TypeInt::CHAR;
765 _const_basic_type[T_BYTE] = TypeInt::BYTE;
766 _const_basic_type[T_SHORT] = TypeInt::SHORT;
767 _const_basic_type[T_INT] = TypeInt::INT;
768 _const_basic_type[T_LONG] = TypeLong::LONG;
769 _const_basic_type[T_FLOAT] = Type::FLOAT;
770 _const_basic_type[T_DOUBLE] = Type::DOUBLE;
771 _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM;
772 _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays
773 _const_basic_type[T_FLAT_ELEMENT] = TypeInstPtr::BOTTOM;
774 _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way
775 _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs
776 _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not?
777
778 _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR;
779 _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR;
780 _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0
781 _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0
782 _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0
783 _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0
784 _zero_type[T_INT] = TypeInt::ZERO;
785 _zero_type[T_LONG] = TypeLong::ZERO;
786 _zero_type[T_FLOAT] = TypeF::ZERO;
787 _zero_type[T_DOUBLE] = TypeD::ZERO;
788 _zero_type[T_OBJECT] = TypePtr::NULL_PTR;
789 _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop
790 _zero_type[T_FLAT_ELEMENT] = TypePtr::NULL_PTR;
791 _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null
792 _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all
793
794 // get_zero_type() should not happen for T_CONFLICT
795 _zero_type[T_CONFLICT]= nullptr;
796
797 TypeVect::VECTMASK = (TypeVect*)(new TypePVectMask(T_BOOLEAN, MaxVectorSize))->hashcons();
798 mreg2type[Op_RegVectMask] = TypeVect::VECTMASK;
799
800 if (Matcher::supports_scalable_vector()) {
801 TypeVect::VECTA = TypeVect::make(T_BYTE, Matcher::scalable_vector_reg_size(T_BYTE));
802 }
803
804 // Vector predefined types, it needs initialized _const_basic_type[].
805 if (Matcher::vector_size_supported(T_BYTE, 4)) {
806 TypeVect::VECTS = TypeVect::make(T_BYTE, 4);
807 }
808 if (Matcher::vector_size_supported(T_FLOAT, 2)) {
809 TypeVect::VECTD = TypeVect::make(T_FLOAT, 2);
810 }
1050 ~VerifyMeet() {
1051 assert(_C->_type_verify->_depth != 0, "");
1052 _C->_type_verify->_depth--;
1053 if (_C->_type_verify->_depth == 0) {
1054 _C->_type_verify->_cache.trunc_to(0);
1055 }
1056 }
1057
1058 const Type* meet(const Type* t1, const Type* t2) const {
1059 return _C->_type_verify->meet(t1, t2);
1060 }
1061
1062 void add(const Type* t1, const Type* t2, const Type* res) const {
1063 _C->_type_verify->add(t1, t2, res);
1064 }
1065 };
1066
1067 void Type::check_symmetrical(const Type* t, const Type* mt, const VerifyMeet& verify) const {
1068 Compile* C = Compile::current();
1069 const Type* mt2 = verify.meet(t, this);
1070
1071 // Verify that:
1072 // this meet t == t meet this
1073 if (mt != mt2) {
1074 tty->print_cr("=== Meet Not Commutative ===");
1075 tty->print("t = "); t->dump(); tty->cr();
1076 tty->print("this = "); dump(); tty->cr();
1077 tty->print("t meet this = "); mt2->dump(); tty->cr();
1078 tty->print("this meet t = "); mt->dump(); tty->cr();
1079 fatal("meet not commutative");
1080 }
1081 const Type* dual_join = mt->_dual;
1082 const Type* t2t = verify.meet(dual_join,t->_dual);
1083 const Type* t2this = verify.meet(dual_join,this->_dual);
1084
1085 // Interface meet Oop is Not Symmetric:
1086 // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull
1087 // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull
1088
1089 // Verify that:
1090 // 1) mt_dual meet t_dual == t_dual
1091 // which corresponds to
1092 // !(t meet this) meet !t ==
1093 // (!t join !this) meet !t == !t
1094 // 2) mt_dual meet this_dual == this_dual
1095 // which corresponds to
1096 // !(t meet this) meet !this ==
1097 // (!t join !this) meet !this == !this
1098 if (t2t != t->_dual || t2this != this->_dual) {
1099 tty->print_cr("=== Meet Not Symmetric ===");
1100 tty->print("t = "); t->dump(); tty->cr();
1101 tty->print("this= "); dump(); tty->cr();
1102 tty->print("mt=(t meet this)= "); mt->dump(); tty->cr();
1103
1104 tty->print("t_dual= "); t->_dual->dump(); tty->cr();
1105 tty->print("this_dual= "); _dual->dump(); tty->cr();
1106 tty->print("mt_dual= "); mt->_dual->dump(); tty->cr();
1107
1108 // 1)
1109 tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr();
1110 // 2)
1111 tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr();
1112 tty->cr();
1113 tty->print_cr("Fail: ");
1114 if (t2t != t->_dual) {
1115 tty->print_cr("- mt_dual meet t_dual != t_dual");
1116 }
1117 if (t2this != this->_dual) {
1118 tty->print_cr("- mt_dual meet this_dual != this_dual");
1119 }
1120 tty->cr();
1121
1122 fatal("meet not symmetric");
1123 }
1124 }
1125 #endif
1126
1127 //------------------------------meet-------------------------------------------
1128 // Compute the MEET of two types. NOT virtual. It enforces that meet is
1129 // commutative and the lattice is symmetric.
1130 const Type *Type::meet_helper(const Type *t, bool include_speculative) const {
1131 if (isa_narrowoop() && t->isa_narrowoop()) {
1132 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
1133 return result->make_narrowoop();
1134 }
1135 if (isa_narrowklass() && t->isa_narrowklass()) {
1136 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
1137 return result->make_narrowklass();
1138 }
1139
1140 #ifdef ASSERT
1141 Compile* C = Compile::current();
1142 VerifyMeet verify(C);
1143 #endif
1144
1145 const Type *this_t = maybe_remove_speculative(include_speculative);
1146 t = t->maybe_remove_speculative(include_speculative);
1147
1148 const Type *mt = this_t->xmeet(t);
1149 #ifdef ASSERT
1150 verify.add(this_t, t, mt);
1151 if (isa_narrowoop() || t->isa_narrowoop()) {
1152 return mt;
1153 }
1154 if (isa_narrowklass() || t->isa_narrowklass()) {
1155 return mt;
1156 }
1157 // TODO 8350865 This currently triggers a verification failure, the code around "// Even though MyValue is final" needs adjustments
1158 if ((this_t->isa_ptr() && this_t->is_ptr()->is_not_flat()) ||
1159 (this_t->_dual->isa_ptr() && this_t->_dual->is_ptr()->is_not_flat())) return mt;
1160 this_t->check_symmetrical(t, mt, verify);
1161 const Type *mt_dual = verify.meet(this_t->_dual, t->_dual);
1162 this_t->_dual->check_symmetrical(t->_dual, mt_dual, verify);
1163 #endif
1164 return mt;
1165 }
1166
1167 //------------------------------xmeet------------------------------------------
1168 // Compute the MEET of two types. It returns a new Type object.
1169 const Type *Type::xmeet( const Type *t ) const {
1170 // Perform a fast test for common case; meeting the same types together.
1171 if( this == t ) return this; // Meeting same type-rep?
1172
1173 // Meeting TOP with anything?
1174 if( _base == Top ) return t;
1175
1176 // Meeting BOTTOM with anything?
1177 if( _base == Bottom ) return BOTTOM;
1178
1179 // Current "this->_base" is one of: Bad, Multi, Control, Top,
2170 void TypeLong::dump_verbose() const {
2171 TypeIntHelper::int_type_dump(this, tty, true);
2172 }
2173 #endif
2174
2175 //=============================================================================
2176 // Convenience common pre-built types.
2177 const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable
2178 const TypeTuple *TypeTuple::IFFALSE;
2179 const TypeTuple *TypeTuple::IFTRUE;
2180 const TypeTuple *TypeTuple::IFNEITHER;
2181 const TypeTuple *TypeTuple::LOOPBODY;
2182 const TypeTuple *TypeTuple::MEMBAR;
2183 const TypeTuple *TypeTuple::STORECONDITIONAL;
2184 const TypeTuple *TypeTuple::START_I2C;
2185 const TypeTuple *TypeTuple::INT_PAIR;
2186 const TypeTuple *TypeTuple::LONG_PAIR;
2187 const TypeTuple *TypeTuple::INT_CC_PAIR;
2188 const TypeTuple *TypeTuple::LONG_CC_PAIR;
2189
2190 static void collect_inline_fields(ciInlineKlass* vk, const Type** field_array, uint& pos) {
2191 for (int i = 0; i < vk->nof_declared_nonstatic_fields(); i++) {
2192 ciField* field = vk->declared_nonstatic_field_at(i);
2193 if (field->is_flat()) {
2194 collect_inline_fields(field->type()->as_inline_klass(), field_array, pos);
2195 if (!field->is_null_free()) {
2196 // Use T_INT instead of T_BOOLEAN here because the upper bits can contain garbage if the holder
2197 // is null and C2 will only zero them for T_INT assuming that T_BOOLEAN is already canonicalized.
2198 field_array[pos++] = Type::get_const_basic_type(T_INT);
2199 }
2200 } else {
2201 BasicType bt = field->type()->basic_type();
2202 const Type* ft = Type::get_const_type(field->type());
2203 field_array[pos++] = ft;
2204 if (type2size[bt] == 2) {
2205 field_array[pos++] = Type::HALF;
2206 }
2207 }
2208 }
2209 }
2210
2211 //------------------------------make-------------------------------------------
2212 // Make a TypeTuple from the range of a method signature
2213 const TypeTuple* TypeTuple::make_range(ciSignature* sig, InterfaceHandling interface_handling, bool ret_vt_fields, bool is_call) {
2214 ciType* return_type = sig->return_type();
2215 uint arg_cnt = return_type->size();
2216 if (ret_vt_fields) {
2217 arg_cnt = return_type->as_inline_klass()->inline_arg_slots() + 1;
2218 if (is_call) {
2219 // InlineTypeNode::NullMarker field returned by scalarized calls
2220 arg_cnt++;
2221 }
2222 }
2223 const Type **field_array = fields(arg_cnt);
2224 switch (return_type->basic_type()) {
2225 case T_LONG:
2226 field_array[TypeFunc::Parms] = TypeLong::LONG;
2227 field_array[TypeFunc::Parms+1] = Type::HALF;
2228 break;
2229 case T_DOUBLE:
2230 field_array[TypeFunc::Parms] = Type::DOUBLE;
2231 field_array[TypeFunc::Parms+1] = Type::HALF;
2232 break;
2233 case T_OBJECT:
2234 if (ret_vt_fields) {
2235 uint pos = TypeFunc::Parms;
2236 field_array[pos++] = get_const_type(return_type); // Oop might be null when returning as fields
2237 collect_inline_fields(return_type->as_inline_klass(), field_array, pos);
2238 if (is_call) {
2239 // InlineTypeNode::NullMarker field returned by scalarized calls
2240 field_array[pos++] = get_const_basic_type(T_BOOLEAN);
2241 }
2242 assert(pos == (TypeFunc::Parms + arg_cnt), "out of bounds");
2243 break;
2244 } else {
2245 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling)->join_speculative(TypePtr::BOTTOM);
2246 }
2247 break;
2248 case T_ARRAY:
2249 case T_BOOLEAN:
2250 case T_CHAR:
2251 case T_FLOAT:
2252 case T_BYTE:
2253 case T_SHORT:
2254 case T_INT:
2255 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling);
2256 break;
2257 case T_VOID:
2258 break;
2259 default:
2260 ShouldNotReachHere();
2261 }
2262 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2263 }
2264
2265 // Make a TypeTuple from the domain of a method signature
2266 const TypeTuple *TypeTuple::make_domain(ciMethod* method, InterfaceHandling interface_handling, bool vt_fields_as_args) {
2267 ciSignature* sig = method->signature();
2268 uint arg_cnt = sig->size() + (method->is_static() ? 0 : 1);
2269 if (vt_fields_as_args) {
2270 arg_cnt = 0;
2271 assert(method->get_sig_cc() != nullptr, "Should have scalarized signature");
2272 for (ExtendedSignature sig_cc = ExtendedSignature(method->get_sig_cc(), SigEntryFilter()); !sig_cc.at_end(); ++sig_cc) {
2273 arg_cnt += type2size[(*sig_cc)._bt];
2274 }
2275 }
2276
2277 uint pos = TypeFunc::Parms;
2278 const Type** field_array = fields(arg_cnt);
2279 if (!method->is_static()) {
2280 ciInstanceKlass* recv = method->holder();
2281 if (vt_fields_as_args && recv->is_inlinetype() && recv->as_inline_klass()->can_be_passed_as_fields() && method->is_scalarized_arg(0)) {
2282 field_array[pos++] = get_const_type(recv, interface_handling); // buffer argument
2283 collect_inline_fields(recv->as_inline_klass(), field_array, pos);
2284 } else {
2285 field_array[pos++] = get_const_type(recv, interface_handling)->join_speculative(TypePtr::NOTNULL);
2286 }
2287 }
2288
2289 int i = 0;
2290 while (pos < TypeFunc::Parms + arg_cnt) {
2291 ciType* type = sig->type_at(i);
2292 BasicType bt = type->basic_type();
2293
2294 switch (bt) {
2295 case T_LONG:
2296 field_array[pos++] = TypeLong::LONG;
2297 field_array[pos++] = Type::HALF;
2298 break;
2299 case T_DOUBLE:
2300 field_array[pos++] = Type::DOUBLE;
2301 field_array[pos++] = Type::HALF;
2302 break;
2303 case T_OBJECT:
2304 if (type->is_inlinetype() && vt_fields_as_args && method->is_scalarized_arg(i + (method->is_static() ? 0 : 1))) {
2305 field_array[pos++] = get_const_type(type, interface_handling); // buffer argument
2306 // InlineTypeNode::NullMarker field used for null checking
2307 field_array[pos++] = get_const_basic_type(T_BOOLEAN);
2308 collect_inline_fields(type->as_inline_klass(), field_array, pos);
2309 } else {
2310 field_array[pos++] = get_const_type(type, interface_handling);
2311 }
2312 break;
2313 case T_ARRAY:
2314 case T_FLOAT:
2315 case T_INT:
2316 field_array[pos++] = get_const_type(type, interface_handling);
2317 break;
2318 case T_BOOLEAN:
2319 case T_CHAR:
2320 case T_BYTE:
2321 case T_SHORT:
2322 field_array[pos++] = TypeInt::INT;
2323 break;
2324 default:
2325 ShouldNotReachHere();
2326 }
2327 i++;
2328 }
2329 assert(pos == TypeFunc::Parms + arg_cnt, "wrong number of arguments");
2330
2331 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2332 }
2333
2334 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) {
2335 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons();
2336 }
2337
2338 //------------------------------fields-----------------------------------------
2339 // Subroutine call type with space allocated for argument types
2340 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly
2341 const Type **TypeTuple::fields( uint arg_cnt ) {
2342 const Type **flds = (const Type **)(Compile::current()->type_arena()->AmallocWords((TypeFunc::Parms+arg_cnt)*sizeof(Type*) ));
2343 flds[TypeFunc::Control ] = Type::CONTROL;
2344 flds[TypeFunc::I_O ] = Type::ABIO;
2345 flds[TypeFunc::Memory ] = Type::MEMORY;
2346 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM;
2347 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS;
2348
2349 return flds;
2444 if (_fields[i]->empty()) return true;
2445 }
2446 return false;
2447 }
2448
2449 //=============================================================================
2450 // Convenience common pre-built types.
2451
2452 inline const TypeInt* normalize_array_size(const TypeInt* size) {
2453 // Certain normalizations keep us sane when comparing types.
2454 // We do not want arrayOop variables to differ only by the wideness
2455 // of their index types. Pick minimum wideness, since that is the
2456 // forced wideness of small ranges anyway.
2457 if (size->_widen != Type::WidenMin)
2458 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin);
2459 else
2460 return size;
2461 }
2462
2463 //------------------------------make-------------------------------------------
2464 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable,
2465 bool flat, bool not_flat, bool not_null_free, bool atomic) {
2466 if (UseCompressedOops && elem->isa_oopptr()) {
2467 elem = elem->make_narrowoop();
2468 }
2469 size = normalize_array_size(size);
2470 return (TypeAry*)(new TypeAry(elem, size, stable, flat, not_flat, not_null_free, atomic))->hashcons();
2471 }
2472
2473 //------------------------------meet-------------------------------------------
2474 // Compute the MEET of two types. It returns a new Type object.
2475 const Type *TypeAry::xmeet( const Type *t ) const {
2476 // Perform a fast test for common case; meeting the same types together.
2477 if( this == t ) return this; // Meeting same type-rep?
2478
2479 // Current "this->_base" is Ary
2480 switch (t->base()) { // switch on original type
2481
2482 case Bottom: // Ye Olde Default
2483 return t;
2484
2485 default: // All else is a mistake
2486 typerr(t);
2487
2488 case Array: { // Meeting 2 arrays?
2489 const TypeAry* a = t->is_ary();
2490 const Type* size = _size->xmeet(a->_size);
2491 const TypeInt* isize = size->isa_int();
2492 if (isize == nullptr) {
2493 assert(size == Type::TOP || size == Type::BOTTOM, "");
2494 return size;
2495 }
2496 return TypeAry::make(_elem->meet_speculative(a->_elem),
2497 isize, _stable && a->_stable,
2498 _flat && a->_flat,
2499 _not_flat && a->_not_flat,
2500 _not_null_free && a->_not_null_free,
2501 _atomic && a->_atomic);
2502 }
2503 case Top:
2504 break;
2505 }
2506 return this; // Return the double constant
2507 }
2508
2509 //------------------------------xdual------------------------------------------
2510 // Dual: compute field-by-field dual
2511 const Type *TypeAry::xdual() const {
2512 const TypeInt* size_dual = _size->dual()->is_int();
2513 size_dual = normalize_array_size(size_dual);
2514 return new TypeAry(_elem->dual(), size_dual, !_stable, !_flat, !_not_flat, !_not_null_free, !_atomic);
2515 }
2516
2517 //------------------------------eq---------------------------------------------
2518 // Structural equality check for Type representations
2519 bool TypeAry::eq( const Type *t ) const {
2520 const TypeAry *a = (const TypeAry*)t;
2521 return _elem == a->_elem &&
2522 _stable == a->_stable &&
2523 _size == a->_size &&
2524 _flat == a->_flat &&
2525 _not_flat == a->_not_flat &&
2526 _not_null_free == a->_not_null_free &&
2527 _atomic == a->_atomic;
2528
2529 }
2530
2531 //------------------------------hash-------------------------------------------
2532 // Type-specific hashing function.
2533 uint TypeAry::hash(void) const {
2534 return (uint)(uintptr_t)_elem + (uint)(uintptr_t)_size + (uint)(_stable ? 43 : 0) +
2535 (uint)(_flat ? 44 : 0) + (uint)(_not_flat ? 45 : 0) + (uint)(_not_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0);
2536 }
2537
2538 /**
2539 * Return same type without a speculative part in the element
2540 */
2541 const TypeAry* TypeAry::remove_speculative() const {
2542 return make(_elem->remove_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic);
2543 }
2544
2545 /**
2546 * Return same type with cleaned up speculative part of element
2547 */
2548 const Type* TypeAry::cleanup_speculative() const {
2549 return make(_elem->cleanup_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic);
2550 }
2551
2552 /**
2553 * Return same type but with a different inline depth (used for speculation)
2554 *
2555 * @param depth depth to meet with
2556 */
2557 const TypePtr* TypePtr::with_inline_depth(int depth) const {
2558 if (!UseInlineDepthForSpeculativeTypes) {
2559 return this;
2560 }
2561 return make(AnyPtr, _ptr, _offset, _speculative, depth, _reloc);
2562 }
2563
2564 //------------------------------dump2------------------------------------------
2565 #ifndef PRODUCT
2566 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const {
2567 if (_stable) st->print("stable:");
2568 if (_flat) st->print("flat:");
2569 if (Verbose) {
2570 if (_not_flat) st->print("not flat:");
2571 if (_not_null_free) st->print("not null free:");
2572 }
2573 if (_atomic) st->print("atomic:");
2574 _elem->dump2(d, depth, st);
2575 st->print("[");
2576 _size->dump2(d, depth, st);
2577 st->print("]");
2578 }
2579 #endif
2580
2581 //------------------------------singleton--------------------------------------
2582 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2583 // constants (Ldi nodes). Singletons are integer, float or double constants
2584 // or a single symbol.
2585 bool TypeAry::singleton(void) const {
2586 return false; // Never a singleton
2587 }
2588
2589 bool TypeAry::empty(void) const {
2590 return _elem->empty() || _size->empty();
2591 }
2592
2593 //--------------------------ary_must_be_exact----------------------------------
2594 bool TypeAry::ary_must_be_exact() const {
2595 // This logic looks at the element type of an array, and returns true
2596 // if the element type is either a primitive or a final instance class.
2597 // In such cases, an array built on this ary must have no subclasses.
2598 if (_elem == BOTTOM) return false; // general array not exact
2599 if (_elem == TOP ) return false; // inverted general array not exact
2600 const TypeOopPtr* toop = nullptr;
2601 if (UseCompressedOops && _elem->isa_narrowoop()) {
2602 toop = _elem->make_ptr()->isa_oopptr();
2603 } else {
2604 toop = _elem->isa_oopptr();
2605 }
2606 if (!toop) return true; // a primitive type, like int
2607 if (!toop->is_loaded()) return false; // unloaded class
2608 const TypeInstPtr* tinst;
2609 if (_elem->isa_narrowoop())
2610 tinst = _elem->make_ptr()->isa_instptr();
2611 else
2612 tinst = _elem->isa_instptr();
2613 if (tinst) {
2614 if (tinst->instance_klass()->is_final()) {
2615 // Even though MyValue is final, [LMyValue is only exact if the array
2616 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue.
2617 // TODO 8350865 If we know that the array can't be null-free, it's allowed to be exact, right?
2618 // If so, we should add '&& !_not_null_free'
2619 if (tinst->is_inlinetypeptr() && (tinst->ptr() != TypePtr::NotNull)) {
2620 return false;
2621 }
2622 return true;
2623 }
2624 return false;
2625 }
2626 const TypeAryPtr* tap;
2627 if (_elem->isa_narrowoop())
2628 tap = _elem->make_ptr()->isa_aryptr();
2629 else
2630 tap = _elem->isa_aryptr();
2631 if (tap)
2632 return tap->ary()->ary_must_be_exact();
2633 return false;
2634 }
2635
2636 //==============================TypeVect=======================================
2637 // Convenience common pre-built types.
2638 const TypeVect* TypeVect::VECTA = nullptr; // vector length agnostic
2639 const TypeVect* TypeVect::VECTS = nullptr; // 32-bit vectors
2640 const TypeVect* TypeVect::VECTD = nullptr; // 64-bit vectors
2641 const TypeVect* TypeVect::VECTX = nullptr; // 128-bit vectors
2642 const TypeVect* TypeVect::VECTY = nullptr; // 256-bit vectors
2643 const TypeVect* TypeVect::VECTZ = nullptr; // 512-bit vectors
2644 const TypeVect* TypeVect::VECTMASK = nullptr; // predicate/mask vector
2645
2786
2787 //=============================================================================
2788 // Convenience common pre-built types.
2789 const TypePtr *TypePtr::NULL_PTR;
2790 const TypePtr *TypePtr::NOTNULL;
2791 const TypePtr *TypePtr::BOTTOM;
2792
2793 //------------------------------meet-------------------------------------------
2794 // Meet over the PTR enum
2795 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = {
2796 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,
2797 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,},
2798 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,},
2799 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,},
2800 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,},
2801 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,},
2802 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,}
2803 };
2804
2805 //------------------------------make-------------------------------------------
2806 const TypePtr* TypePtr::make(TYPES t, enum PTR ptr, Offset offset,
2807 const TypePtr* speculative, int inline_depth,
2808 relocInfo::relocType reloc) {
2809 return (TypePtr*)(new TypePtr(t, ptr, offset, reloc, speculative, inline_depth))->hashcons();
2810 }
2811
2812 //------------------------------cast_to_ptr_type-------------------------------
2813 const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const {
2814 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
2815 if( ptr == _ptr ) return this;
2816 return make(_base, ptr, _offset, _speculative, _inline_depth, _reloc);
2817 }
2818
2819 //------------------------------get_con----------------------------------------
2820 intptr_t TypePtr::get_con() const {
2821 assert( _ptr == Null, "" );
2822 return offset();
2823 }
2824
2825 //------------------------------meet-------------------------------------------
2826 // Compute the MEET of two types. It returns a new Type object.
2827 const Type *TypePtr::xmeet(const Type *t) const {
2828 const Type* res = xmeet_helper(t);
2829 if (res->isa_ptr() == nullptr) {
2830 return res;
2831 }
2832
2833 const TypePtr* res_ptr = res->is_ptr();
2834 if (res_ptr->speculative() != nullptr) {
2835 // type->speculative() is null means that speculation is no better
2836 // than type, i.e. type->speculative() == type. So there are 2
2837 // ways to represent the fact that we have no useful speculative
2838 // data and we should use a single one to be able to test for
2839 // equality between types. Check whether type->speculative() ==
2840 // type and set speculative to null if it is the case.
2841 if (res_ptr->remove_speculative() == res_ptr->speculative()) {
2842 return res_ptr->remove_speculative();
2876 int depth = meet_inline_depth(tp->inline_depth());
2877 return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth);
2878 }
2879 case RawPtr: // For these, flip the call around to cut down
2880 case OopPtr:
2881 case InstPtr: // on the cases I have to handle.
2882 case AryPtr:
2883 case MetadataPtr:
2884 case KlassPtr:
2885 case InstKlassPtr:
2886 case AryKlassPtr:
2887 return t->xmeet(this); // Call in reverse direction
2888 default: // All else is a mistake
2889 typerr(t);
2890
2891 }
2892 return this;
2893 }
2894
2895 //------------------------------meet_offset------------------------------------
2896 Type::Offset TypePtr::meet_offset(int offset) const {
2897 return _offset.meet(Offset(offset));
2898 }
2899
2900 //------------------------------dual_offset------------------------------------
2901 Type::Offset TypePtr::dual_offset() const {
2902 return _offset.dual();
2903 }
2904
2905 //------------------------------xdual------------------------------------------
2906 // Dual: compute field-by-field dual
2907 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
2908 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
2909 };
2910
2911 const TypePtr::FlatInArray TypePtr::flat_in_array_dual[Uninitialized] = {
2912 /* TopFlat -> */ MaybeFlat,
2913 /* Flat -> */ NotFlat,
2914 /* NotFlat -> */ Flat,
2915 /* MaybeFlat -> */ TopFlat
2916 };
2917
2918 const char* const TypePtr::flat_in_array_msg[Uninitialized] = {
2919 "TOP flat in array", "flat in array", "not flat in array", "maybe flat in array"
2920 };
2921
2922 const Type *TypePtr::xdual() const {
2923 return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), relocInfo::none, dual_speculative(), dual_inline_depth());
2924 }
2925
2926 //------------------------------xadd_offset------------------------------------
2927 Type::Offset TypePtr::xadd_offset(intptr_t offset) const {
2928 return _offset.add(offset);
2929 }
2930
2931 //------------------------------add_offset-------------------------------------
2932 const TypePtr *TypePtr::add_offset( intptr_t offset ) const {
2933 return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth, _reloc);
2934 }
2935
2936 const TypePtr *TypePtr::with_offset(intptr_t offset) const {
2937 return make(AnyPtr, _ptr, Offset(offset), _speculative, _inline_depth, _reloc);
2938 }
2939
2940 //------------------------------eq---------------------------------------------
2941 // Structural equality check for Type representations
2942 bool TypePtr::eq( const Type *t ) const {
2943 const TypePtr *a = (const TypePtr*)t;
2944 return _ptr == a->ptr() && offset() == a->offset() && _reloc == a->reloc() &&
2945 eq_speculative(a) && _inline_depth == a->_inline_depth;
2946 }
2947
2948 //------------------------------hash-------------------------------------------
2949 // Type-specific hashing function.
2950 uint TypePtr::hash(void) const {
2951 return (uint)_ptr + (uint)offset() + (uint)_reloc + (uint)hash_speculative() + (uint)_inline_depth;
2952 }
2953
2954 /**
2955 * Return same type without a speculative part
2956 */
2957 const TypePtr* TypePtr::remove_speculative() const {
2958 if (_speculative == nullptr) {
2959 return this;
2960 }
2961 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
2962 return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth, _reloc);
2963 }
2964
2965 /**
2966 * Return same type but drop speculative part if we know we won't use
2967 * it
2968 */
2969 const Type* TypePtr::cleanup_speculative() const {
2970 if (speculative() == nullptr) {
2971 return this;
3188 return false;
3189 }
3190 // We already know the speculative type cannot be null
3191 if (!speculative_maybe_null()) {
3192 return false;
3193 }
3194 // We already know this is always null
3195 if (this == TypePtr::NULL_PTR) {
3196 return false;
3197 }
3198 // We already know the speculative type is always null
3199 if (speculative_always_null()) {
3200 return false;
3201 }
3202 if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) {
3203 return false;
3204 }
3205 return true;
3206 }
3207
3208 TypePtr::FlatInArray TypePtr::compute_flat_in_array(ciInstanceKlass* instance_klass, bool is_exact) {
3209 if (!instance_klass->can_be_inline_klass(is_exact)) {
3210 // Definitely not a value class and thus never flat in an array.
3211 return NotFlat;
3212 }
3213 if (instance_klass->is_inlinetype() && instance_klass->as_inline_klass()->is_always_flat_in_array()) {
3214 return Flat;
3215 }
3216 // We don't know.
3217 return MaybeFlat;
3218 }
3219
3220 // Compute flat in array property if we don't know anything about it (i.e. old_flat_in_array == MaybeFlat).
3221 TypePtr::FlatInArray TypePtr::compute_flat_in_array_if_unknown(ciInstanceKlass* instance_klass, bool is_exact,
3222 FlatInArray old_flat_in_array) {
3223 // It is tempting to add verification code that "NotFlat == no value class" and "Flat == value class".
3224 // However, with type speculation, we could get contradicting flat in array properties that propagate through the
3225 // graph. We could try to stop the introduction of contradicting speculative types in terms of their flat in array
3226 // property. But this is hard because it is sometimes only recognized further down in the graph. Thus, we let an
3227 // inconsistent flat in array property propagating through the graph. This could lead to fold an actual live path
3228 // away. But in this case, the speculated type is wrong and we would trap earlier.
3229 if (old_flat_in_array == MaybeFlat) {
3230 return compute_flat_in_array(instance_klass, is_exact);
3231 }
3232 return old_flat_in_array;
3233 }
3234
3235 //------------------------------dump2------------------------------------------
3236 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
3237 "TopPTR","AnyNull","Constant","null","NotNull","BotPTR"
3238 };
3239
3240 #ifndef PRODUCT
3241 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
3242 st->print("ptr:%s", ptr_msg[_ptr]);
3243 dump_offset(st);
3244 dump_inline_depth(st);
3245 dump_speculative(st);
3246 }
3247
3248 void TypePtr::dump_offset(outputStream* st) const {
3249 _offset.dump2(st);
3250 }
3251
3252 /**
3253 *dump the speculative part of the type
3254 */
3255 void TypePtr::dump_speculative(outputStream *st) const {
3256 if (_speculative != nullptr) {
3257 st->print(" (speculative=");
3258 _speculative->dump_on(st);
3259 st->print(")");
3260 }
3261 }
3262
3263 /**
3264 *dump the inline depth of the type
3265 */
3266 void TypePtr::dump_inline_depth(outputStream *st) const {
3267 if (_inline_depth != InlineDepthBottom) {
3268 if (_inline_depth == InlineDepthTop) {
3269 st->print(" (inline_depth=InlineDepthTop)");
3270 } else {
3271 st->print(" (inline_depth=%d)", _inline_depth);
3272 }
3273 }
3274 }
3275
3276 void TypePtr::dump_flat_in_array(FlatInArray flat_in_array, outputStream* st) {
3277 switch (flat_in_array) {
3278 case MaybeFlat:
3279 case NotFlat:
3280 if (!Verbose) {
3281 break;
3282 }
3283 case TopFlat:
3284 case Flat:
3285 st->print(" (%s)", flat_in_array_msg[flat_in_array]);
3286 break;
3287 default:
3288 ShouldNotReachHere();
3289 }
3290 }
3291 #endif
3292
3293 //------------------------------singleton--------------------------------------
3294 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3295 // constants
3296 bool TypePtr::singleton(void) const {
3297 // TopPTR, Null, AnyNull, Constant are all singletons
3298 return (_offset != Offset::bottom) && !below_centerline(_ptr);
3299 }
3300
3301 bool TypePtr::empty(void) const {
3302 return (_offset == Offset::top) || above_centerline(_ptr);
3303 }
3304
3305 //=============================================================================
3306 // Convenience common pre-built types.
3307 const TypeRawPtr *TypeRawPtr::BOTTOM;
3308 const TypeRawPtr *TypeRawPtr::NOTNULL;
3309
3310 //------------------------------make-------------------------------------------
3311 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
3312 assert( ptr != Constant, "what is the constant?" );
3313 assert( ptr != Null, "Use TypePtr for null" );
3314 return (TypeRawPtr*)(new TypeRawPtr(ptr, nullptr, relocInfo::none))->hashcons();
3315 }
3316
3317 const TypeRawPtr* TypeRawPtr::make(address bits, relocInfo::relocType reloc) {
3318 assert(bits != nullptr, "Use TypePtr for null");
3319 return (TypeRawPtr*)(new TypeRawPtr(Constant, bits, reloc))->hashcons();
3320 }
3321
3322 //------------------------------cast_to_ptr_type-------------------------------
3690 #endif
3691
3692 // Can't be implemented because there's no way to know if the type is above or below the center line.
3693 const Type* TypeInterfaces::xmeet(const Type* t) const {
3694 ShouldNotReachHere();
3695 return Type::xmeet(t);
3696 }
3697
3698 bool TypeInterfaces::singleton(void) const {
3699 ShouldNotReachHere();
3700 return Type::singleton();
3701 }
3702
3703 bool TypeInterfaces::has_non_array_interface() const {
3704 assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?");
3705
3706 return !TypeAryPtr::_array_interfaces->contains(this);
3707 }
3708
3709 //------------------------------TypeOopPtr-------------------------------------
3710 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset offset, Offset field_offset,
3711 int instance_id, const TypePtr* speculative, int inline_depth)
3712 : TypePtr(t, ptr, offset, relocInfo::oop_type, speculative, inline_depth),
3713 _const_oop(o), _klass(k),
3714 _interfaces(interfaces),
3715 _klass_is_exact(xk),
3716 _is_ptr_to_narrowoop(false),
3717 _is_ptr_to_narrowklass(false),
3718 _is_ptr_to_boxed_value(false),
3719 _is_ptr_to_strict_final_field(false),
3720 _instance_id(instance_id) {
3721 #ifdef ASSERT
3722 if (klass() != nullptr && klass()->is_loaded()) {
3723 interfaces->verify_is_loaded();
3724 }
3725 #endif
3726 if (Compile::current()->eliminate_boxing() && (t == InstPtr) &&
3727 (offset.get() > 0) && xk && (k != nullptr) && k->is_instance_klass()) {
3728 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset.get());
3729 _is_ptr_to_strict_final_field = _is_ptr_to_boxed_value;
3730 }
3731
3732 if (klass() != nullptr && klass()->is_instance_klass() && klass()->is_loaded() &&
3733 this->offset() != Type::OffsetBot && this->offset() != Type::OffsetTop) {
3734 ciField* field = klass()->as_instance_klass()->get_field_by_offset(this->offset(), false);
3735 if (field != nullptr && field->is_strict() && field->is_final()) {
3736 _is_ptr_to_strict_final_field = true;
3737 }
3738 }
3739
3740 #ifdef _LP64
3741 if (this->offset() > 0 || this->offset() == Type::OffsetTop || this->offset() == Type::OffsetBot) {
3742 if (this->offset() == oopDesc::klass_offset_in_bytes()) {
3743 _is_ptr_to_narrowklass = true;
3744 } else if (klass() == nullptr) {
3745 // Array with unknown body type
3746 assert(this->isa_aryptr(), "only arrays without klass");
3747 _is_ptr_to_narrowoop = UseCompressedOops;
3748 } else if (UseCompressedOops && this->isa_aryptr() && this->offset() != arrayOopDesc::length_offset_in_bytes()) {
3749 if (klass()->is_flat_array_klass() && field_offset != Offset::top && field_offset != Offset::bottom) {
3750 // Check if the field of the inline type array element contains oops
3751 ciInlineKlass* vk = klass()->as_flat_array_klass()->element_klass()->as_inline_klass();
3752 int foffset = field_offset.get() + vk->payload_offset();
3753 BasicType field_bt;
3754 ciField* field = vk->get_field_by_offset(foffset, false);
3755 if (field != nullptr) {
3756 field_bt = field->layout_type();
3757 } else {
3758 assert(field_offset.get() == vk->null_marker_offset_in_payload(), "no field or null marker of %s at offset %d", vk->name()->as_utf8(), foffset);
3759 field_bt = T_BOOLEAN;
3760 }
3761 _is_ptr_to_narrowoop = ::is_reference_type(field_bt);
3762 } else if (klass()->is_obj_array_klass()) {
3763 _is_ptr_to_narrowoop = true;
3764 }
3765 } else if (klass()->is_instance_klass()) {
3766 if (this->isa_klassptr()) {
3767 // Perm objects don't use compressed references
3768 } else if (_offset == Offset::bottom || _offset == Offset::top) {
3769 // unsafe access
3770 _is_ptr_to_narrowoop = UseCompressedOops;
3771 } else {
3772 assert(this->isa_instptr(), "must be an instance ptr.");
3773 if (klass() == ciEnv::current()->Class_klass() &&
3774 (this->offset() == java_lang_Class::klass_offset() ||
3775 this->offset() == java_lang_Class::array_klass_offset())) {
3776 // Special hidden fields from the Class.
3777 assert(this->isa_instptr(), "must be an instance ptr.");
3778 _is_ptr_to_narrowoop = false;
3779 } else if (klass() == ciEnv::current()->Class_klass() &&
3780 this->offset() >= InstanceMirrorKlass::offset_of_static_fields()) {
3781 // Static fields
3782 BasicType basic_elem_type = T_ILLEGAL;
3783 if (const_oop() != nullptr) {
3784 ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass();
3785 basic_elem_type = k->get_field_type_by_offset(this->offset(), true);
3786 }
3787 if (basic_elem_type != T_ILLEGAL) {
3788 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3789 } else {
3790 // unsafe access
3791 _is_ptr_to_narrowoop = UseCompressedOops;
3792 }
3793 } else {
3794 // Instance fields which contains a compressed oop references.
3795 ciInstanceKlass* ik = klass()->as_instance_klass();
3796 BasicType basic_elem_type = ik->get_field_type_by_offset(this->offset(), false);
3797 if (basic_elem_type != T_ILLEGAL) {
3798 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3799 } else if (klass()->equals(ciEnv::current()->Object_klass())) {
3800 // Compile::find_alias_type() cast exactness on all types to verify
3801 // that it does not affect alias type.
3802 _is_ptr_to_narrowoop = UseCompressedOops;
3803 } else {
3804 // Type for the copy start in LibraryCallKit::inline_native_clone().
3805 _is_ptr_to_narrowoop = UseCompressedOops;
3806 }
3807 }
3808 }
3809 }
3810 }
3811 #endif // _LP64
3812 }
3813
3814 //------------------------------make-------------------------------------------
3815 const TypeOopPtr *TypeOopPtr::make(PTR ptr, Offset offset, int instance_id,
3816 const TypePtr* speculative, int inline_depth) {
3817 assert(ptr != Constant, "no constant generic pointers");
3818 ciKlass* k = Compile::current()->env()->Object_klass();
3819 bool xk = false;
3820 ciObject* o = nullptr;
3821 const TypeInterfaces* interfaces = TypeInterfaces::make();
3822 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, Offset::bottom, instance_id, speculative, inline_depth))->hashcons();
3823 }
3824
3825
3826 //------------------------------cast_to_ptr_type-------------------------------
3827 const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
3828 assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
3829 if( ptr == _ptr ) return this;
3830 return make(ptr, _offset, _instance_id, _speculative, _inline_depth);
3831 }
3832
3833 //-----------------------------cast_to_instance_id----------------------------
3834 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
3835 // There are no instances of a general oop.
3836 // Return self unchanged.
3837 return this;
3838 }
3839
3840 //-----------------------------cast_to_exactness-------------------------------
3841 const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
3842 // There is no such thing as an exact general oop.
3843 // Return self unchanged.
3844 return this;
3845 }
3846
3847 //------------------------------as_klass_type----------------------------------
3848 // Return the klass type corresponding to this instance or array type.
3849 // It is the type that is loaded from an object of this type.
3850 const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const {
3851 ShouldNotReachHere();
3852 return nullptr;
3853 }
3854
3855 //------------------------------meet-------------------------------------------
3856 // Compute the MEET of two types. It returns a new Type object.
3857 const Type *TypeOopPtr::xmeet_helper(const Type *t) const {
3858 // Perform a fast test for common case; meeting the same types together.
3859 if( this == t ) return this; // Meeting same type-rep?
3860
3861 // Current "this->_base" is OopPtr
3862 switch (t->base()) { // switch on original type
3863
3864 case Int: // Mixing ints & oops happens when javac
3865 case Long: // reuses local variables
3866 case HalfFloatTop:
3875 case NarrowOop:
3876 case NarrowKlass:
3877 case Bottom: // Ye Olde Default
3878 return Type::BOTTOM;
3879 case Top:
3880 return this;
3881
3882 default: // All else is a mistake
3883 typerr(t);
3884
3885 case RawPtr:
3886 case MetadataPtr:
3887 case KlassPtr:
3888 case InstKlassPtr:
3889 case AryKlassPtr:
3890 return TypePtr::BOTTOM; // Oop meet raw is not well defined
3891
3892 case AnyPtr: {
3893 // Found an AnyPtr type vs self-OopPtr type
3894 const TypePtr *tp = t->is_ptr();
3895 Offset offset = meet_offset(tp->offset());
3896 PTR ptr = meet_ptr(tp->ptr());
3897 const TypePtr* speculative = xmeet_speculative(tp);
3898 int depth = meet_inline_depth(tp->inline_depth());
3899 switch (tp->ptr()) {
3900 case Null:
3901 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3902 // else fall through:
3903 case TopPTR:
3904 case AnyNull: {
3905 int instance_id = meet_instance_id(InstanceTop);
3906 return make(ptr, offset, instance_id, speculative, depth);
3907 }
3908 case BotPTR:
3909 case NotNull:
3910 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3911 default: typerr(t);
3912 }
3913 }
3914
3915 case OopPtr: { // Meeting to other OopPtrs
3917 int instance_id = meet_instance_id(tp->instance_id());
3918 const TypePtr* speculative = xmeet_speculative(tp);
3919 int depth = meet_inline_depth(tp->inline_depth());
3920 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth);
3921 }
3922
3923 case InstPtr: // For these, flip the call around to cut down
3924 case AryPtr:
3925 return t->xmeet(this); // Call in reverse direction
3926
3927 } // End of switch
3928 return this; // Return the double constant
3929 }
3930
3931
3932 //------------------------------xdual------------------------------------------
3933 // Dual of a pure heap pointer. No relevant klass or oop information.
3934 const Type *TypeOopPtr::xdual() const {
3935 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here");
3936 assert(const_oop() == nullptr, "no constants here");
3937 return new TypeOopPtr(_base, dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), Offset::bottom, dual_instance_id(), dual_speculative(), dual_inline_depth());
3938 }
3939
3940 //--------------------------make_from_klass_common-----------------------------
3941 // Computes the element-type given a klass.
3942 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) {
3943 if (klass->is_instance_klass() || klass->is_inlinetype()) {
3944 Compile* C = Compile::current();
3945 Dependencies* deps = C->dependencies();
3946 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
3947 // Element is an instance
3948 bool klass_is_exact = false;
3949 ciInstanceKlass* ik = klass->as_instance_klass();
3950 if (klass->is_loaded()) {
3951 // Try to set klass_is_exact.
3952 klass_is_exact = ik->is_final();
3953 if (!klass_is_exact && klass_change
3954 && deps != nullptr && UseUniqueSubclasses) {
3955 ciInstanceKlass* sub = ik->unique_concrete_subklass();
3956 if (sub != nullptr) {
3957 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
3958 klass = ik = sub;
3959 klass_is_exact = sub->is_final();
3960 }
3961 }
3962 if (!klass_is_exact && try_for_exact && deps != nullptr &&
3963 !ik->is_interface() && !ik->has_subklass()) {
3964 // Add a dependence; if concrete subclass added we need to recompile
3965 deps->assert_leaf_type(ik);
3966 klass_is_exact = true;
3967 }
3968 }
3969 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact);
3970 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
3971 return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, Offset(0), flat_in_array);
3972 } else if (klass->is_obj_array_klass()) {
3973 // Element is an object or inline type array. Recursively call ourself.
3974 ciObjArrayKlass* array_klass = klass->as_obj_array_klass();
3975 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_common(array_klass->element_klass(), /* klass_change= */ false, try_for_exact, interface_handling);
3976 bool xk = array_klass->is_loaded() && array_klass->is_refined();
3977
3978 // Determine null-free/flat properties
3979 bool flat;
3980 bool not_flat;
3981 bool not_null_free;
3982 bool atomic;
3983 if (xk) {
3984 flat = array_klass->is_flat_array_klass();
3985 not_flat = !flat;
3986 bool is_null_free = array_klass->is_elem_null_free();
3987 not_null_free = !is_null_free;
3988 atomic = array_klass->is_elem_atomic();
3989
3990 if (is_null_free) {
3991 etype = etype->join_speculative(NOTNULL)->is_oopptr();
3992 }
3993 } else {
3994 const TypeOopPtr* exact_etype = etype;
3995 if (etype->can_be_inline_type()) {
3996 // Use exact type if element can be an inline type
3997 exact_etype = TypeOopPtr::make_from_klass_common(klass->as_array_klass()->element_klass(), /* klass_change= */ true, /* try_for_exact= */ true, interface_handling);
3998 }
3999
4000 flat = false;
4001 bool not_inline = !exact_etype->can_be_inline_type();
4002 not_null_free = not_inline;
4003 not_flat = !UseArrayFlattening || not_inline || (exact_etype->is_inlinetypeptr() && !exact_etype->inline_klass()->maybe_flat_in_array());
4004 atomic = not_flat;
4005 }
4006
4007 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS, /* stable= */ false, flat, not_flat, not_null_free, atomic);
4008 // We used to pass NotNull in here, asserting that the sub-arrays
4009 // are all not-null. This is not true in generally, as code can
4010 // slam nullptrs down in the subarrays.
4011 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, Offset(0));
4012 return arr;
4013 } else if (klass->is_type_array_klass()) {
4014 // Element is an typeArray
4015 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
4016 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS,
4017 /* stable= */ false, /* flat= */ false, /* not_flat= */ true, /* not_null_free= */ true, true);
4018 // We used to pass NotNull in here, asserting that the array pointer
4019 // is not-null. That was not true in general.
4020 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, Offset(0));
4021 return arr;
4022 } else {
4023 ShouldNotReachHere();
4024 return nullptr;
4025 }
4026 }
4027
4028 //------------------------------make_from_constant-----------------------------
4029 // Make a java pointer from an oop constant
4030 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) {
4031 assert(!o->is_null_object(), "null object not yet handled here.");
4032
4033 const bool make_constant = require_constant || o->should_be_constant();
4034
4035 ciKlass* klass = o->klass();
4036 if (klass->is_instance_klass() || klass->is_inlinetype()) {
4037 // Element is an instance or inline type
4038 if (make_constant) {
4039 return TypeInstPtr::make(o);
4040 } else {
4041 return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, Offset(0));
4042 }
4043 } else if (klass->is_obj_array_klass()) {
4044 // Element is an object array. Recursively call ourself.
4045 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_raw(klass->as_array_klass()->element_klass(), trust_interfaces);
4046 bool is_flat = o->as_array()->is_flat();
4047 bool is_null_free = o->as_array()->is_null_free();
4048 if (is_null_free) {
4049 etype = etype->join_speculative(TypePtr::NOTNULL)->is_oopptr();
4050 }
4051 bool is_atomic = o->as_array()->is_atomic();
4052 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ is_flat,
4053 /* not_flat= */ !is_flat, /* not_null_free= */ !is_null_free, /* atomic= */ is_atomic);
4054 // We used to pass NotNull in here, asserting that the sub-arrays
4055 // are all not-null. This is not true in generally, as code can
4056 // slam nulls down in the subarrays.
4057 if (make_constant) {
4058 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0));
4059 } else {
4060 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0));
4061 }
4062 } else if (klass->is_type_array_klass()) {
4063 // Element is an typeArray
4064 const Type* etype = (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
4065 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ false,
4066 /* not_flat= */ true, /* not_null_free= */ true, true);
4067 // We used to pass NotNull in here, asserting that the array pointer
4068 // is not-null. That was not true in general.
4069 if (make_constant) {
4070 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0));
4071 } else {
4072 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0));
4073 }
4074 }
4075
4076 fatal("unhandled object type");
4077 return nullptr;
4078 }
4079
4080 //------------------------------get_con----------------------------------------
4081 intptr_t TypeOopPtr::get_con() const {
4082 assert( _ptr == Null || _ptr == Constant, "" );
4083 assert(offset() >= 0, "");
4084
4085 if (offset() != 0) {
4086 // After being ported to the compiler interface, the compiler no longer
4087 // directly manipulates the addresses of oops. Rather, it only has a pointer
4088 // to a handle at compile time. This handle is embedded in the generated
4089 // code and dereferenced at the time the nmethod is made. Until that time,
4090 // it is not reasonable to do arithmetic with the addresses of oops (we don't
4091 // have access to the addresses!). This does not seem to currently happen,
4092 // but this assertion here is to help prevent its occurrence.
4093 tty->print_cr("Found oop constant with non-zero offset");
4094 ShouldNotReachHere();
4095 }
4096
4097 return (intptr_t)const_oop()->constant_encoding();
4098 }
4099
4100
4101 //-----------------------------filter------------------------------------------
4102 // Do not allow interface-vs.-noninterface joins to collapse to top.
4103 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const {
4104
4105 const Type* ft = join_helper(kills, include_speculative);
4151 dump_speculative(st);
4152 }
4153
4154 void TypeOopPtr::dump_instance_id(outputStream* st) const {
4155 if (_instance_id == InstanceTop) {
4156 st->print(",iid=top");
4157 } else if (_instance_id == InstanceBot) {
4158 st->print(",iid=bot");
4159 } else {
4160 st->print(",iid=%d", _instance_id);
4161 }
4162 }
4163 #endif
4164
4165 //------------------------------singleton--------------------------------------
4166 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
4167 // constants
4168 bool TypeOopPtr::singleton(void) const {
4169 // detune optimizer to not generate constant oop + constant offset as a constant!
4170 // TopPTR, Null, AnyNull, Constant are all singletons
4171 return (offset() == 0) && !below_centerline(_ptr);
4172 }
4173
4174 //------------------------------add_offset-------------------------------------
4175 const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const {
4176 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
4177 }
4178
4179 const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const {
4180 return make(_ptr, Offset(offset), _instance_id, with_offset_speculative(offset), _inline_depth);
4181 }
4182
4183 /**
4184 * Return same type without a speculative part
4185 */
4186 const TypeOopPtr* TypeOopPtr::remove_speculative() const {
4187 if (_speculative == nullptr) {
4188 return this;
4189 }
4190 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4191 return make(_ptr, _offset, _instance_id, nullptr, _inline_depth);
4192 }
4193
4194 /**
4195 * Return same type but drop speculative part if we know we won't use
4196 * it
4197 */
4198 const Type* TypeOopPtr::cleanup_speculative() const {
4199 // If the klass is exact and the ptr is not null then there's
4200 // nothing that the speculative type can help us with
4273 const TypeInstPtr *TypeInstPtr::BOTTOM;
4274 const TypeInstPtr *TypeInstPtr::MIRROR;
4275 const TypeInstPtr *TypeInstPtr::MARK;
4276 const TypeInstPtr *TypeInstPtr::KLASS;
4277
4278 // Is there a single ciKlass* that can represent that type?
4279 ciKlass* TypeInstPtr::exact_klass_helper() const {
4280 if (_interfaces->empty()) {
4281 return _klass;
4282 }
4283 if (_klass != ciEnv::current()->Object_klass()) {
4284 if (_interfaces->eq(_klass->as_instance_klass())) {
4285 return _klass;
4286 }
4287 return nullptr;
4288 }
4289 return _interfaces->exact_klass();
4290 }
4291
4292 //------------------------------TypeInstPtr-------------------------------------
4293 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset off,
4294 FlatInArray flat_in_array, int instance_id, const TypePtr* speculative, int inline_depth)
4295 : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, Offset::bottom, instance_id, speculative, inline_depth),
4296 _flat_in_array(flat_in_array) {
4297
4298 assert(flat_in_array != Uninitialized, "must be set now");
4299 assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here");
4300 assert(k != nullptr &&
4301 (k->is_loaded() || o == nullptr),
4302 "cannot have constants with non-loaded klass");
4303 };
4304
4305 //------------------------------make-------------------------------------------
4306 const TypeInstPtr *TypeInstPtr::make(PTR ptr,
4307 ciKlass* k,
4308 const TypeInterfaces* interfaces,
4309 bool xk,
4310 ciObject* o,
4311 Offset offset,
4312 FlatInArray flat_in_array,
4313 int instance_id,
4314 const TypePtr* speculative,
4315 int inline_depth) {
4316 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance");
4317 // Either const_oop() is null or else ptr is Constant
4318 assert( (!o && ptr != Constant) || (o && ptr == Constant),
4319 "constant pointers must have a value supplied" );
4320 // Ptr is never Null
4321 assert( ptr != Null, "null pointers are not typed" );
4322
4323 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4324 ciInstanceKlass* ik = k->as_instance_klass();
4325 if (ptr == Constant) {
4326 // Note: This case includes meta-object constants, such as methods.
4327 xk = true;
4328 } else if (k->is_loaded()) {
4329 if (!xk && ik->is_final()) xk = true; // no inexact final klass
4330 assert(!ik->is_interface(), "no interface here");
4331 if (xk && ik->is_interface()) xk = false; // no exact interface
4332 }
4333
4334 if (flat_in_array == Uninitialized) {
4335 flat_in_array = compute_flat_in_array(ik, xk);
4336 }
4337 // Now hash this baby
4338 TypeInstPtr *result =
4339 (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o, offset, flat_in_array, instance_id, speculative, inline_depth))->hashcons();
4340
4341 return result;
4342 }
4343
4344 const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) {
4345 if (k->is_instance_klass()) {
4346 if (k->is_loaded()) {
4347 if (k->is_interface() && interface_handling == ignore_interfaces) {
4348 assert(interface, "no interface expected");
4349 k = ciEnv::current()->Object_klass();
4350 const TypeInterfaces* interfaces = TypeInterfaces::make();
4351 return interfaces;
4352 }
4353 GrowableArray<ciInstanceKlass *>* k_interfaces = k->as_instance_klass()->transitive_interfaces();
4354 const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces);
4355 if (k->is_interface()) {
4356 assert(interface, "no interface expected");
4357 k = ciEnv::current()->Object_klass();
4358 } else {
4359 assert(klass, "no instance klass expected");
4362 }
4363 const TypeInterfaces* interfaces = TypeInterfaces::make();
4364 return interfaces;
4365 }
4366 assert(array, "no array expected");
4367 assert(k->is_array_klass(), "Not an array?");
4368 ciType* e = k->as_array_klass()->base_element_type();
4369 if (e->is_loaded() && e->is_instance_klass() && e->as_instance_klass()->is_interface()) {
4370 if (interface_handling == ignore_interfaces) {
4371 k = ciObjArrayKlass::make(ciEnv::current()->Object_klass(), k->as_array_klass()->dimension());
4372 }
4373 }
4374 return TypeAryPtr::_array_interfaces;
4375 }
4376
4377 //------------------------------cast_to_ptr_type-------------------------------
4378 const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
4379 if( ptr == _ptr ) return this;
4380 // Reconstruct _sig info here since not a problem with later lazy
4381 // construction, _sig will show up on demand.
4382 return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _flat_in_array, _instance_id, _speculative, _inline_depth);
4383 }
4384
4385
4386 //-----------------------------cast_to_exactness-------------------------------
4387 const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
4388 if( klass_is_exact == _klass_is_exact ) return this;
4389 if (!_klass->is_loaded()) return this;
4390 ciInstanceKlass* ik = _klass->as_instance_klass();
4391 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
4392 assert(!ik->is_interface(), "no interface here");
4393 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact);
4394 return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, flat_in_array, _instance_id, _speculative, _inline_depth);
4395 }
4396
4397 //-----------------------------cast_to_instance_id----------------------------
4398 const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const {
4399 if( instance_id == _instance_id ) return this;
4400 return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth);
4401 }
4402
4403 //------------------------------xmeet_unloaded---------------------------------
4404 // Compute the MEET of two InstPtrs when at least one is unloaded.
4405 // Assume classes are different since called after check for same name/class-loader
4406 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const {
4407 Offset off = meet_offset(tinst->offset());
4408 PTR ptr = meet_ptr(tinst->ptr());
4409 int instance_id = meet_instance_id(tinst->instance_id());
4410 const TypePtr* speculative = xmeet_speculative(tinst);
4411 int depth = meet_inline_depth(tinst->inline_depth());
4412
4413 const TypeInstPtr *loaded = is_loaded() ? this : tinst;
4414 const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
4415 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
4416 //
4417 // Meet unloaded class with java/lang/Object
4418 //
4419 // Meet
4420 // | Unloaded Class
4421 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
4422 // ===================================================================
4423 // TOP | ..........................Unloaded......................|
4424 // AnyNull | U-AN |................Unloaded......................|
4425 // Constant | ... O-NN .................................. | O-BOT |
4426 // NotNull | ... O-NN .................................. | O-BOT |
4427 // BOTTOM | ........................Object-BOTTOM ..................|
4428 //
4429 assert(loaded->ptr() != TypePtr::Null, "insanity check");
4430 //
4431 if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4432 else if (loaded->ptr() == TypePtr::AnyNull) {
4433 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array());
4434 return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, flat_in_array, instance_id,
4435 speculative, depth);
4436 }
4437 else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4438 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
4439 if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4440 else { return TypeInstPtr::NOTNULL->with_speculative(speculative); }
4441 }
4442 else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4443
4444 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative);
4445 }
4446
4447 // Both are unloaded, not the same class, not Object
4448 // Or meet unloaded with a different loaded class, not java/lang/Object
4449 if (ptr != TypePtr::BotPTR) {
4450 return TypeInstPtr::NOTNULL->with_speculative(speculative);
4451 }
4452 return TypeInstPtr::BOTTOM->with_speculative(speculative);
4453 }
4454
4455
4456 //------------------------------meet-------------------------------------------
4480 case Top:
4481 return this;
4482
4483 default: // All else is a mistake
4484 typerr(t);
4485
4486 case MetadataPtr:
4487 case KlassPtr:
4488 case InstKlassPtr:
4489 case AryKlassPtr:
4490 case RawPtr: return TypePtr::BOTTOM;
4491
4492 case AryPtr: { // All arrays inherit from Object class
4493 // Call in reverse direction to avoid duplication
4494 return t->is_aryptr()->xmeet_helper(this);
4495 }
4496
4497 case OopPtr: { // Meeting to OopPtrs
4498 // Found a OopPtr type vs self-InstPtr type
4499 const TypeOopPtr *tp = t->is_oopptr();
4500 Offset offset = meet_offset(tp->offset());
4501 PTR ptr = meet_ptr(tp->ptr());
4502 switch (tp->ptr()) {
4503 case TopPTR:
4504 case AnyNull: {
4505 int instance_id = meet_instance_id(InstanceTop);
4506 const TypePtr* speculative = xmeet_speculative(tp);
4507 int depth = meet_inline_depth(tp->inline_depth());
4508 return make(ptr, klass(), _interfaces, klass_is_exact(),
4509 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth);
4510 }
4511 case NotNull:
4512 case BotPTR: {
4513 int instance_id = meet_instance_id(tp->instance_id());
4514 const TypePtr* speculative = xmeet_speculative(tp);
4515 int depth = meet_inline_depth(tp->inline_depth());
4516 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4517 }
4518 default: typerr(t);
4519 }
4520 }
4521
4522 case AnyPtr: { // Meeting to AnyPtrs
4523 // Found an AnyPtr type vs self-InstPtr type
4524 const TypePtr *tp = t->is_ptr();
4525 Offset offset = meet_offset(tp->offset());
4526 PTR ptr = meet_ptr(tp->ptr());
4527 int instance_id = meet_instance_id(InstanceTop);
4528 const TypePtr* speculative = xmeet_speculative(tp);
4529 int depth = meet_inline_depth(tp->inline_depth());
4530 switch (tp->ptr()) {
4531 case Null:
4532 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4533 // else fall through to AnyNull
4534 case TopPTR:
4535 case AnyNull: {
4536 return make(ptr, klass(), _interfaces, klass_is_exact(),
4537 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth);
4538 }
4539 case NotNull:
4540 case BotPTR:
4541 return TypePtr::make(AnyPtr, ptr, offset, speculative,depth);
4542 default: typerr(t);
4543 }
4544 }
4545
4546 /*
4547 A-top }
4548 / | \ } Tops
4549 B-top A-any C-top }
4550 | / | \ | } Any-nulls
4551 B-any | C-any }
4552 | | |
4553 B-con A-con C-con } constants; not comparable across classes
4554 | | |
4555 B-not | C-not }
4556 | \ | / | } not-nulls
4557 B-bot A-not C-bot }
4558 \ | / } Bottoms
4559 A-bot }
4560 */
4561
4562 case InstPtr: { // Meeting 2 Oops?
4563 // Found an InstPtr sub-type vs self-InstPtr type
4564 const TypeInstPtr *tinst = t->is_instptr();
4565 Offset off = meet_offset(tinst->offset());
4566 PTR ptr = meet_ptr(tinst->ptr());
4567 int instance_id = meet_instance_id(tinst->instance_id());
4568 const TypePtr* speculative = xmeet_speculative(tinst);
4569 int depth = meet_inline_depth(tinst->inline_depth());
4570 const TypeInterfaces* interfaces = meet_interfaces(tinst);
4571
4572 ciKlass* tinst_klass = tinst->klass();
4573 ciKlass* this_klass = klass();
4574
4575 ciKlass* res_klass = nullptr;
4576 bool res_xk = false;
4577 const Type* res;
4578 MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk);
4579
4580 if (kind == UNLOADED) {
4581 // One of these classes has not been loaded
4582 const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces);
4583 #ifndef PRODUCT
4584 if (PrintOpto && Verbose) {
4585 tty->print("meet of unloaded classes resulted in: ");
4586 unloaded_meet->dump();
4587 tty->cr();
4588 tty->print(" this == ");
4589 dump();
4590 tty->cr();
4591 tty->print(" tinst == ");
4592 tinst->dump();
4593 tty->cr();
4594 }
4595 #endif
4596 res = unloaded_meet;
4597 } else {
4598 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array());
4599 if (kind == NOT_SUBTYPE && instance_id > 0) {
4600 instance_id = InstanceBot;
4601 } else if (kind == LCA) {
4602 instance_id = InstanceBot;
4603 }
4604 ciObject* o = nullptr; // Assume not constant when done
4605 ciObject* this_oop = const_oop();
4606 ciObject* tinst_oop = tinst->const_oop();
4607 if (ptr == Constant) {
4608 if (this_oop != nullptr && tinst_oop != nullptr &&
4609 this_oop->equals(tinst_oop))
4610 o = this_oop;
4611 else if (above_centerline(_ptr)) {
4612 assert(!tinst_klass->is_interface(), "");
4613 o = tinst_oop;
4614 } else if (above_centerline(tinst->_ptr)) {
4615 assert(!this_klass->is_interface(), "");
4616 o = this_oop;
4617 } else
4618 ptr = NotNull;
4619 }
4620 res = make(ptr, res_klass, interfaces, res_xk, o, off, flat_in_array, instance_id, speculative, depth);
4621 }
4622
4623 return res;
4624
4625 } // End of case InstPtr
4626
4627 } // End of switch
4628 return this; // Return the double constant
4629 }
4630
4631 template<class T> TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type,
4632 ciKlass*& res_klass, bool& res_xk) {
4633 ciKlass* this_klass = this_type->klass();
4634 ciKlass* other_klass = other_type->klass();
4635
4636 bool this_xk = this_type->klass_is_exact();
4637 bool other_xk = other_type->klass_is_exact();
4638 PTR this_ptr = this_type->ptr();
4639 PTR other_ptr = other_type->ptr();
4640 const TypeInterfaces* this_interfaces = this_type->interfaces();
4641 const TypeInterfaces* other_interfaces = other_type->interfaces();
4642 // Check for easy case; klasses are equal (and perhaps not loaded!)
4643 // If we have constants, then we created oops so classes are loaded
4644 // and we can handle the constants further down. This case handles
4645 // both-not-loaded or both-loaded classes
4646 if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) {
4647 res_klass = this_klass;
4648 res_xk = this_xk;
4649 return QUICK;
4650 }
4651
4652 // Classes require inspection in the Java klass hierarchy. Must be loaded.
4653 if (!other_klass->is_loaded() || !this_klass->is_loaded()) {
4654 return UNLOADED;
4655 }
4661 // If both are up and they do NOT subtype, "fall hard".
4662 // If both are down and they subtype, take the supertype class.
4663 // If both are down and they do NOT subtype, "fall hard".
4664 // Constants treated as down.
4665
4666 // Now, reorder the above list; observe that both-down+subtype is also
4667 // "fall hard"; "fall hard" becomes the default case:
4668 // If we split one up & one down AND they subtype, take the down man.
4669 // If both are up and they subtype, take the subtype class.
4670
4671 // If both are down and they subtype, "fall hard".
4672 // If both are down and they do NOT subtype, "fall hard".
4673 // If both are up and they do NOT subtype, "fall hard".
4674 // If we split one up & one down AND they do NOT subtype, "fall hard".
4675
4676 // If a proper subtype is exact, and we return it, we return it exactly.
4677 // If a proper supertype is exact, there can be no subtyping relationship!
4678 // If both types are equal to the subtype, exactness is and-ed below the
4679 // centerline and or-ed above it. (N.B. Constants are always exact.)
4680
4681 const T* subtype = nullptr;
4682 bool subtype_exact = false;
4683 if (this_type->is_same_java_type_as(other_type)) {
4684 // Same klass
4685 subtype = this_type;
4686 subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk);
4687 } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) {
4688 subtype = this_type; // Pick subtyping class
4689 subtype_exact = this_xk;
4690 } else if (!this_xk && other_type->is_meet_subtype_of(this_type)) {
4691 subtype = other_type; // Pick subtyping class
4692 subtype_exact = other_xk;
4693 }
4694
4695 if (subtype != nullptr) {
4696 if (above_centerline(ptr)) {
4697 // Both types are empty.
4698 this_type = other_type = subtype;
4699 this_xk = other_xk = subtype_exact;
4700 } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) {
4701 // this_type is empty while other_type is not. Take other_type.
4702 this_type = other_type;
4703 this_xk = other_xk;
4704 } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) {
4705 // other_type is empty while this_type is not. Take this_type.
4706 other_type = this_type; // this is down; keep down man
4707 } else {
4708 // this_type and other_type are both non-empty.
4709 this_xk = subtype_exact; // either they are equal, or we'll do an LCA
4710 }
4711 }
4712
4713 // Check for classes now being equal
4714 if (this_type->is_same_java_type_as(other_type)) {
4715 // If the klasses are equal, the constants may still differ. Fall to
4716 // NotNull if they do (neither constant is null; that is a special case
4717 // handled elsewhere).
4718 res_klass = this_type->klass();
4719 res_xk = this_xk;
4720 return SUBTYPE;
4721 } // Else classes are not equal
4722
4723 // Since klasses are different, we require a LCA in the Java
4724 // class hierarchy - which means we have to fall to at least NotNull.
4725 if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) {
4726 ptr = NotNull;
4727 }
4728
4729 interfaces = this_interfaces->intersection_with(other_interfaces);
4730
4731 // Now we find the LCA of Java classes
4732 ciKlass* k = this_klass->least_common_ancestor(other_klass);
4733
4734 res_klass = k;
4735 res_xk = false;
4736 return LCA;
4737 }
4738
4739 // Top-Flat Flat Not-Flat Maybe-Flat
4740 // -------------------------------------------------------------
4741 // Top-Flat Top-Flat Flat Not-Flat Maybe-Flat
4742 // Flat Flat Flat Maybe-Flat Maybe-Flat
4743 // Not-Flat Not-Flat Maybe-Flat Not-Flat Maybe-Flat
4744 // Maybe-Flat Maybe-Flat Maybe-Flat Maybe-Flat Maybe-flat
4745 TypePtr::FlatInArray TypePtr::meet_flat_in_array(const FlatInArray left, const FlatInArray right) {
4746 if (left == TopFlat) {
4747 return right;
4748 }
4749 if (right == TopFlat) {
4750 return left;
4751 }
4752 if (left == MaybeFlat || right == MaybeFlat) {
4753 return MaybeFlat;
4754 }
4755
4756 switch (left) {
4757 case Flat:
4758 if (right == Flat) {
4759 return Flat;
4760 }
4761 return MaybeFlat;
4762 case NotFlat:
4763 if (right == NotFlat) {
4764 return NotFlat;
4765 }
4766 return MaybeFlat;
4767 default:
4768 ShouldNotReachHere();
4769 return Uninitialized;
4770 }
4771 }
4772
4773 //------------------------java_mirror_type--------------------------------------
4774 ciType* TypeInstPtr::java_mirror_type() const {
4775 // must be a singleton type
4776 if( const_oop() == nullptr ) return nullptr;
4777
4778 // must be of type java.lang.Class
4779 if( klass() != ciEnv::current()->Class_klass() ) return nullptr;
4780 return const_oop()->as_instance()->java_mirror_type();
4781 }
4782
4783
4784 //------------------------------xdual------------------------------------------
4785 // Dual: do NOT dual on klasses. This means I do NOT understand the Java
4786 // inheritance mechanism.
4787 const Type* TypeInstPtr::xdual() const {
4788 return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(),
4789 dual_flat_in_array(), dual_instance_id(), dual_speculative(), dual_inline_depth());
4790 }
4791
4792 //------------------------------eq---------------------------------------------
4793 // Structural equality check for Type representations
4794 bool TypeInstPtr::eq( const Type *t ) const {
4795 const TypeInstPtr *p = t->is_instptr();
4796 return
4797 klass()->equals(p->klass()) &&
4798 _flat_in_array == p->_flat_in_array &&
4799 _interfaces->eq(p->_interfaces) &&
4800 TypeOopPtr::eq(p); // Check sub-type stuff
4801 }
4802
4803 //------------------------------hash-------------------------------------------
4804 // Type-specific hashing function.
4805 uint TypeInstPtr::hash() const {
4806 return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash() + static_cast<uint>(_flat_in_array);
4807 }
4808
4809 bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4810 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4811 }
4812
4813
4814 bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4815 return TypePtr::is_same_java_type_as_helper_for_instance(this, other);
4816 }
4817
4818 bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4819 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4820 }
4821
4822
4823 //------------------------------dump2------------------------------------------
4824 // Dump oop Type
4825 #ifndef PRODUCT
4826 void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const {
4830 _interfaces->dump(st);
4831
4832 if (_ptr == Constant && (WizardMode || Verbose)) {
4833 ResourceMark rm;
4834 stringStream ss;
4835
4836 st->print(" ");
4837 const_oop()->print_oop(&ss);
4838 // 'const_oop->print_oop()' may emit newlines('\n') into ss.
4839 // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node.
4840 char* buf = ss.as_string(/* c_heap= */false);
4841 StringUtils::replace_no_expand(buf, "\n", "");
4842 st->print_raw(buf);
4843 }
4844
4845 st->print(":%s", ptr_msg[_ptr]);
4846 if (_klass_is_exact) {
4847 st->print(":exact");
4848 }
4849
4850 st->print(" *");
4851
4852 dump_offset(st);
4853 dump_instance_id(st);
4854 dump_inline_depth(st);
4855 dump_speculative(st);
4856 dump_flat_in_array(_flat_in_array, st);
4857 }
4858 #endif
4859
4860 bool TypeInstPtr::empty() const {
4861 if (_flat_in_array == TopFlat) {
4862 return true;
4863 }
4864 return TypeOopPtr::empty();
4865 }
4866
4867 //------------------------------add_offset-------------------------------------
4868 const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const {
4869 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset), _flat_in_array,
4870 _instance_id, add_offset_speculative(offset), _inline_depth);
4871 }
4872
4873 const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const {
4874 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), Offset(offset), _flat_in_array,
4875 _instance_id, with_offset_speculative(offset), _inline_depth);
4876 }
4877
4878 const TypeInstPtr* TypeInstPtr::remove_speculative() const {
4879 if (_speculative == nullptr) {
4880 return this;
4881 }
4882 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4883 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array,
4884 _instance_id, nullptr, _inline_depth);
4885 }
4886
4887 const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const {
4888 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, speculative, _inline_depth);
4889 }
4890
4891 const TypePtr* TypeInstPtr::with_inline_depth(int depth) const {
4892 if (!UseInlineDepthForSpeculativeTypes) {
4893 return this;
4894 }
4895 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, _speculative, depth);
4896 }
4897
4898 const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const {
4899 assert(is_known_instance(), "should be known");
4900 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth);
4901 }
4902
4903 const TypeInstPtr *TypeInstPtr::cast_to_flat_in_array() const {
4904 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, Flat, _instance_id, _speculative, _inline_depth);
4905 }
4906
4907 const TypeInstPtr *TypeInstPtr::cast_to_maybe_flat_in_array() const {
4908 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, MaybeFlat, _instance_id, _speculative, _inline_depth);
4909 }
4910
4911 const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const {
4912 bool xk = klass_is_exact();
4913 ciInstanceKlass* ik = klass()->as_instance_klass();
4914 if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) {
4915 if (_interfaces->eq(ik)) {
4916 Compile* C = Compile::current();
4917 Dependencies* deps = C->dependencies();
4918 deps->assert_leaf_type(ik);
4919 xk = true;
4920 }
4921 }
4922 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array);
4923 return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, Offset(0), flat_in_array);
4924 }
4925
4926 template <class T1, class T2> bool TypePtr::is_meet_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_xk, bool other_xk) {
4927 static_assert(std::is_base_of<T2, T1>::value, "");
4928
4929 if (!this_one->is_instance_type(other)) {
4930 return false;
4931 }
4932
4933 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4934 return true;
4935 }
4936
4937 return this_one->klass()->is_subtype_of(other->klass()) &&
4938 (!this_xk || this_one->_interfaces->contains(other->_interfaces));
4939 }
4940
4941
4942 bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4943 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4948 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4949 return true;
4950 }
4951
4952 if (this_one->is_instance_type(other)) {
4953 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces);
4954 }
4955
4956 int dummy;
4957 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
4958 if (this_top_or_bottom) {
4959 return false;
4960 }
4961
4962 const T1* other_ary = this_one->is_array_type(other);
4963 const TypePtr* other_elem = other_ary->elem()->make_ptr();
4964 const TypePtr* this_elem = this_one->elem()->make_ptr();
4965 if (other_elem != nullptr && this_elem != nullptr) {
4966 return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk);
4967 }
4968 if (other_elem == nullptr && this_elem == nullptr) {
4969 return this_one->klass()->is_subtype_of(other->klass());
4970 }
4971
4972 return false;
4973 }
4974
4975 bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4976 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4977 }
4978
4979 bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4980 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4981 }
4982
4983 bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4984 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4985 }
4986
4987 //=============================================================================
4988 // Convenience common pre-built types.
4989 const TypeAryPtr* TypeAryPtr::BOTTOM;
4990 const TypeAryPtr *TypeAryPtr::RANGE;
4991 const TypeAryPtr *TypeAryPtr::OOPS;
4992 const TypeAryPtr *TypeAryPtr::NARROWOOPS;
4993 const TypeAryPtr *TypeAryPtr::BYTES;
4994 const TypeAryPtr *TypeAryPtr::SHORTS;
4995 const TypeAryPtr *TypeAryPtr::CHARS;
4996 const TypeAryPtr *TypeAryPtr::INTS;
4997 const TypeAryPtr *TypeAryPtr::LONGS;
4998 const TypeAryPtr *TypeAryPtr::FLOATS;
4999 const TypeAryPtr *TypeAryPtr::DOUBLES;
5000 const TypeAryPtr *TypeAryPtr::INLINES;
5001
5002 //------------------------------make-------------------------------------------
5003 const TypeAryPtr* TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset,
5004 int instance_id, const TypePtr* speculative, int inline_depth) {
5005 assert(!(k == nullptr && ary->_elem->isa_int()),
5006 "integral arrays must be pre-equipped with a class");
5007 if (!xk) xk = ary->ary_must_be_exact();
5008 assert(instance_id <= 0 || xk, "instances are always exactly typed");
5009 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
5010 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
5011 k = nullptr;
5012 }
5013 return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, field_offset, instance_id, false, speculative, inline_depth))->hashcons();
5014 }
5015
5016 //------------------------------make-------------------------------------------
5017 const TypeAryPtr* TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset,
5018 int instance_id, const TypePtr* speculative, int inline_depth,
5019 bool is_autobox_cache) {
5020 assert(!(k == nullptr && ary->_elem->isa_int()),
5021 "integral arrays must be pre-equipped with a class");
5022 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
5023 if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact();
5024 assert(instance_id <= 0 || xk, "instances are always exactly typed");
5025 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
5026 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
5027 k = nullptr;
5028 }
5029 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, field_offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons();
5030 }
5031
5032 //------------------------------cast_to_ptr_type-------------------------------
5033 const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
5034 if( ptr == _ptr ) return this;
5035 return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5036 }
5037
5038
5039 //-----------------------------cast_to_exactness-------------------------------
5040 const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
5041 if( klass_is_exact == _klass_is_exact ) return this;
5042 if (_ary->ary_must_be_exact()) return this; // cannot clear xk
5043 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5044 }
5045
5046 //-----------------------------cast_to_instance_id----------------------------
5047 const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const {
5048 if( instance_id == _instance_id ) return this;
5049 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth, _is_autobox_cache);
5050 }
5051
5052
5053 //-----------------------------max_array_length-------------------------------
5054 // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization.
5055 jint TypeAryPtr::max_array_length(BasicType etype) {
5056 if (!is_java_primitive(etype) && !::is_reference_type(etype)) {
5057 if (etype == T_NARROWOOP) {
5058 etype = T_OBJECT;
5059 } else if (etype == T_ILLEGAL) { // bottom[]
5060 etype = T_BYTE; // will produce conservatively high value
5061 } else {
5062 fatal("not an element type: %s", type2name(etype));
5063 }
5064 }
5065 return arrayOopDesc::max_array_length(etype);
5066 }
5067
5068 //-----------------------------narrow_size_type-------------------------------
5069 // Narrow the given size type to the index range for the given array base type.
5087 if (size->is_con()) {
5088 lo = hi;
5089 }
5090 chg = true;
5091 }
5092 // Negative length arrays will produce weird intermediate dead fast-path code
5093 if (lo > hi) {
5094 return TypeInt::ZERO;
5095 }
5096 if (!chg) {
5097 return size;
5098 }
5099 return TypeInt::make(lo, hi, Type::WidenMin);
5100 }
5101
5102 //-------------------------------cast_to_size----------------------------------
5103 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
5104 assert(new_size != nullptr, "");
5105 new_size = narrow_size_type(new_size);
5106 if (new_size == size()) return this;
5107 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5108 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5109 }
5110
5111 const TypeAryPtr* TypeAryPtr::cast_to_flat(bool flat) const {
5112 if (flat == is_flat()) {
5113 return this;
5114 }
5115 assert(!flat || !is_not_flat(), "inconsistency");
5116 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), flat, is_not_flat(), is_not_null_free(), is_atomic());
5117 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5118 if (res->speculative() == res->remove_speculative()) {
5119 return res->remove_speculative();
5120 }
5121 return res;
5122 }
5123
5124 //-------------------------------cast_to_not_flat------------------------------
5125 const TypeAryPtr* TypeAryPtr::cast_to_not_flat(bool not_flat) const {
5126 if (not_flat == is_not_flat()) {
5127 return this;
5128 }
5129 assert(!not_flat || !is_flat(), "inconsistency");
5130 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), not_flat, is_not_null_free(), is_atomic());
5131 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5132 // We keep the speculative part if it contains information about flat-/nullability.
5133 // Make sure it's removed if it's not better than the non-speculative type anymore.
5134 if (res->speculative() == res->remove_speculative()) {
5135 return res->remove_speculative();
5136 }
5137 return res;
5138 }
5139
5140 const TypeAryPtr* TypeAryPtr::cast_to_null_free(bool null_free) const {
5141 if (null_free == is_null_free()) {
5142 return this;
5143 }
5144 assert(!null_free || !is_not_null_free(), "inconsistency");
5145 const Type* elem = this->elem();
5146 const Type* new_elem = elem->make_ptr();
5147 if (null_free) {
5148 new_elem = new_elem->join_speculative(TypePtr::NOTNULL);
5149 } else {
5150 new_elem = new_elem->meet_speculative(TypePtr::NULL_PTR);
5151 }
5152 new_elem = elem->isa_narrowoop() ? new_elem->make_narrowoop() : new_elem;
5153 const TypeAry* new_ary = TypeAry::make(new_elem, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5154 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5155 if (res->speculative() == res->remove_speculative()) {
5156 return res->remove_speculative();
5157 }
5158 assert(res->speculative() == nullptr || res->speculative()->with_inline_depth(res->inline_depth())->higher_equal(res->remove_speculative()),
5159 "speculative type must not be narrower than non-speculative type");
5160 return res;
5161 }
5162
5163 //-------------------------------cast_to_not_null_free-------------------------
5164 const TypeAryPtr* TypeAryPtr::cast_to_not_null_free(bool not_null_free) const {
5165 if (not_null_free == is_not_null_free()) {
5166 return this;
5167 }
5168 assert(!not_null_free || !is_null_free(), "inconsistency");
5169 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), is_not_flat(), not_null_free, is_atomic());
5170 const TypePtr* new_spec = _speculative;
5171 if (new_spec != nullptr) {
5172 // Could be 'null free' from profiling, which would contradict the cast.
5173 new_spec = new_spec->is_aryptr()->cast_to_null_free(false)->cast_to_not_null_free();
5174 }
5175 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset,
5176 _instance_id, new_spec, _inline_depth, _is_autobox_cache);
5177 // We keep the speculative part if it contains information about flat-/nullability.
5178 // Make sure it's removed if it's not better than the non-speculative type anymore.
5179 if (res->speculative() == res->remove_speculative()) {
5180 return res->remove_speculative();
5181 }
5182 assert(res->speculative() == nullptr || res->speculative()->with_inline_depth(res->inline_depth())->higher_equal(res->remove_speculative()),
5183 "speculative type must not be narrower than non-speculative type");
5184 return res;
5185 }
5186
5187 //---------------------------------update_properties---------------------------
5188 const TypeAryPtr* TypeAryPtr::update_properties(const TypeAryPtr* from) const {
5189 if ((from->is_flat() && is_not_flat()) ||
5190 (from->is_not_flat() && is_flat()) ||
5191 (from->is_null_free() && is_not_null_free()) ||
5192 (from->is_not_null_free() && is_null_free())) {
5193 return nullptr; // Inconsistent properties
5194 }
5195 const TypeAryPtr* res = this;
5196 if (from->is_not_null_free()) {
5197 res = res->cast_to_not_null_free();
5198 }
5199 if (from->is_not_flat()) {
5200 res = res->cast_to_not_flat();
5201 }
5202 return res;
5203 }
5204
5205 jint TypeAryPtr::flat_layout_helper() const {
5206 return exact_klass()->as_flat_array_klass()->layout_helper();
5207 }
5208
5209 int TypeAryPtr::flat_elem_size() const {
5210 return exact_klass()->as_flat_array_klass()->element_byte_size();
5211 }
5212
5213 int TypeAryPtr::flat_log_elem_size() const {
5214 return exact_klass()->as_flat_array_klass()->log2_element_size();
5215 }
5216
5217 //------------------------------cast_to_stable---------------------------------
5218 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const {
5219 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable()))
5220 return this;
5221
5222 const Type* elem = this->elem();
5223 const TypePtr* elem_ptr = elem->make_ptr();
5224
5225 if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) {
5226 // If this is widened from a narrow oop, TypeAry::make will re-narrow it.
5227 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1);
5228 }
5229
5230 const TypeAry* new_ary = TypeAry::make(elem, size(), stable, is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5231
5232 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5233 }
5234
5235 //-----------------------------stable_dimension--------------------------------
5236 int TypeAryPtr::stable_dimension() const {
5237 if (!is_stable()) return 0;
5238 int dim = 1;
5239 const TypePtr* elem_ptr = elem()->make_ptr();
5240 if (elem_ptr != nullptr && elem_ptr->isa_aryptr())
5241 dim += elem_ptr->is_aryptr()->stable_dimension();
5242 return dim;
5243 }
5244
5245 //----------------------cast_to_autobox_cache-----------------------------------
5246 const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const {
5247 if (is_autobox_cache()) return this;
5248 const TypeOopPtr* etype = elem()->make_oopptr();
5249 if (etype == nullptr) return this;
5250 // The pointers in the autobox arrays are always non-null.
5251 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
5252 const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5253 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true);
5254 }
5255
5256 //------------------------------eq---------------------------------------------
5257 // Structural equality check for Type representations
5258 bool TypeAryPtr::eq( const Type *t ) const {
5259 const TypeAryPtr *p = t->is_aryptr();
5260 return
5261 _ary == p->_ary && // Check array
5262 TypeOopPtr::eq(p) &&// Check sub-parts
5263 _field_offset == p->_field_offset;
5264 }
5265
5266 //------------------------------hash-------------------------------------------
5267 // Type-specific hashing function.
5268 uint TypeAryPtr::hash(void) const {
5269 return (uint)(uintptr_t)_ary + TypeOopPtr::hash() + _field_offset.get();
5270 }
5271
5272 bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
5273 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
5274 }
5275
5276 bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
5277 return TypePtr::is_same_java_type_as_helper_for_array(this, other);
5278 }
5279
5280 bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
5281 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
5282 }
5283 //------------------------------meet-------------------------------------------
5284 // Compute the MEET of two types. It returns a new Type object.
5285 const Type *TypeAryPtr::xmeet_helper(const Type *t) const {
5286 // Perform a fast test for common case; meeting the same types together.
5287 if( this == t ) return this; // Meeting same type-rep?
5288 // Current "this->_base" is Pointer
5289 switch (t->base()) { // switch on original type
5296 case HalfFloatBot:
5297 case FloatTop:
5298 case FloatCon:
5299 case FloatBot:
5300 case DoubleTop:
5301 case DoubleCon:
5302 case DoubleBot:
5303 case NarrowOop:
5304 case NarrowKlass:
5305 case Bottom: // Ye Olde Default
5306 return Type::BOTTOM;
5307 case Top:
5308 return this;
5309
5310 default: // All else is a mistake
5311 typerr(t);
5312
5313 case OopPtr: { // Meeting to OopPtrs
5314 // Found a OopPtr type vs self-AryPtr type
5315 const TypeOopPtr *tp = t->is_oopptr();
5316 Offset offset = meet_offset(tp->offset());
5317 PTR ptr = meet_ptr(tp->ptr());
5318 int depth = meet_inline_depth(tp->inline_depth());
5319 const TypePtr* speculative = xmeet_speculative(tp);
5320 switch (tp->ptr()) {
5321 case TopPTR:
5322 case AnyNull: {
5323 int instance_id = meet_instance_id(InstanceTop);
5324 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
5325 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5326 }
5327 case BotPTR:
5328 case NotNull: {
5329 int instance_id = meet_instance_id(tp->instance_id());
5330 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
5331 }
5332 default: ShouldNotReachHere();
5333 }
5334 }
5335
5336 case AnyPtr: { // Meeting two AnyPtrs
5337 // Found an AnyPtr type vs self-AryPtr type
5338 const TypePtr *tp = t->is_ptr();
5339 Offset offset = meet_offset(tp->offset());
5340 PTR ptr = meet_ptr(tp->ptr());
5341 const TypePtr* speculative = xmeet_speculative(tp);
5342 int depth = meet_inline_depth(tp->inline_depth());
5343 switch (tp->ptr()) {
5344 case TopPTR:
5345 return this;
5346 case BotPTR:
5347 case NotNull:
5348 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
5349 case Null:
5350 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
5351 // else fall through to AnyNull
5352 case AnyNull: {
5353 int instance_id = meet_instance_id(InstanceTop);
5354 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
5355 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5356 }
5357 default: ShouldNotReachHere();
5358 }
5359 }
5360
5361 case MetadataPtr:
5362 case KlassPtr:
5363 case InstKlassPtr:
5364 case AryKlassPtr:
5365 case RawPtr: return TypePtr::BOTTOM;
5366
5367 case AryPtr: { // Meeting 2 references?
5368 const TypeAryPtr *tap = t->is_aryptr();
5369 Offset off = meet_offset(tap->offset());
5370 Offset field_off = meet_field_offset(tap->field_offset());
5371 const Type* tm = _ary->meet_speculative(tap->_ary);
5372 const TypeAry* tary = tm->isa_ary();
5373 if (tary == nullptr) {
5374 assert(tm == Type::TOP || tm == Type::BOTTOM, "");
5375 return tm;
5376 }
5377 PTR ptr = meet_ptr(tap->ptr());
5378 int instance_id = meet_instance_id(tap->instance_id());
5379 const TypePtr* speculative = xmeet_speculative(tap);
5380 int depth = meet_inline_depth(tap->inline_depth());
5381
5382 ciKlass* res_klass = nullptr;
5383 bool res_xk = false;
5384 bool res_flat = false;
5385 bool res_not_flat = false;
5386 bool res_not_null_free = false;
5387 bool res_atomic = false;
5388 const Type* elem = tary->_elem;
5389 if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic) == NOT_SUBTYPE) {
5390 instance_id = InstanceBot;
5391 } else if (this->is_flat() != tap->is_flat()) {
5392 // Meeting flat inline type array with non-flat array. Adjust (field) offset accordingly.
5393 if (tary->_flat) {
5394 // Result is in a flat representation
5395 off = Offset(is_flat() ? offset() : tap->offset());
5396 field_off = is_flat() ? field_offset() : tap->field_offset();
5397 } else if (below_centerline(ptr)) {
5398 // Result is in a non-flat representation
5399 off = Offset(flat_offset()).meet(Offset(tap->flat_offset()));
5400 field_off = (field_off == Offset::top) ? Offset::top : Offset::bottom;
5401 } else if (flat_offset() == tap->flat_offset()) {
5402 off = Offset(!is_flat() ? offset() : tap->offset());
5403 field_off = !is_flat() ? field_offset() : tap->field_offset();
5404 }
5405 }
5406
5407 ciObject* o = nullptr; // Assume not constant when done
5408 ciObject* this_oop = const_oop();
5409 ciObject* tap_oop = tap->const_oop();
5410 if (ptr == Constant) {
5411 if (this_oop != nullptr && tap_oop != nullptr &&
5412 this_oop->equals(tap_oop)) {
5413 o = tap_oop;
5414 } else if (above_centerline(_ptr)) {
5415 o = tap_oop;
5416 } else if (above_centerline(tap->_ptr)) {
5417 o = this_oop;
5418 } else {
5419 ptr = NotNull;
5420 }
5421 }
5422 return make(ptr, o, TypeAry::make(elem, tary->_size, tary->_stable, res_flat, res_not_flat, res_not_null_free, res_atomic), res_klass, res_xk, off, field_off, instance_id, speculative, depth);
5423 }
5424
5425 // All arrays inherit from Object class
5426 case InstPtr: {
5427 const TypeInstPtr *tp = t->is_instptr();
5428 Offset offset = meet_offset(tp->offset());
5429 PTR ptr = meet_ptr(tp->ptr());
5430 int instance_id = meet_instance_id(tp->instance_id());
5431 const TypePtr* speculative = xmeet_speculative(tp);
5432 int depth = meet_inline_depth(tp->inline_depth());
5433 const TypeInterfaces* interfaces = meet_interfaces(tp);
5434 const TypeInterfaces* tp_interfaces = tp->_interfaces;
5435 const TypeInterfaces* this_interfaces = _interfaces;
5436
5437 switch (ptr) {
5438 case TopPTR:
5439 case AnyNull: // Fall 'down' to dual of object klass
5440 // For instances when a subclass meets a superclass we fall
5441 // below the centerline when the superclass is exact. We need to
5442 // do the same here.
5443 //
5444 // Flat in array:
5445 // We do
5446 // dual(TypeAryPtr) MEET dual(TypeInstPtr)
5447 // If TypeInstPtr is anything else than Object, then the result of the meet is bottom Object (i.e. we could have
5448 // instances or arrays).
5449 // If TypeInstPtr is an Object and either
5450 // - exact
5451 // - inexact AND flat in array == dual(not flat in array) (i.e. not an array type)
5452 // then the result of the meet is bottom Object (i.e. we could have instances or arrays).
5453 // Otherwise, we meet two array pointers and create a new TypeAryPtr.
5454 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
5455 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
5456 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5457 } else {
5458 // cannot subclass, so the meet has to fall badly below the centerline
5459 ptr = NotNull;
5460 instance_id = InstanceBot;
5461 interfaces = this_interfaces->intersection_with(tp_interfaces);
5462 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
5463 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, flat_in_array, instance_id, speculative, depth);
5464 }
5465 case Constant:
5466 case NotNull:
5467 case BotPTR: { // Fall down to object klass
5468 // LCA is object_klass, but if we subclass from the top we can do better
5469 if (above_centerline(tp->ptr())) {
5470 // If 'tp' is above the centerline and it is Object class
5471 // then we can subclass in the Java class hierarchy.
5472 // For instances when a subclass meets a superclass we fall
5473 // below the centerline when the superclass is exact. We need
5474 // to do the same here.
5475
5476 // Flat in array: We do TypeAryPtr MEET dual(TypeInstPtr), same applies as above in TopPTR/AnyNull case.
5477 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
5478 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
5479 // that is, my array type is a subtype of 'tp' klass
5480 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
5481 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5482 }
5483 }
5484 // The other case cannot happen, since t cannot be a subtype of an array.
5485 // The meet falls down to Object class below centerline.
5486 if (ptr == Constant) {
5487 ptr = NotNull;
5488 }
5489 if (instance_id > 0) {
5490 instance_id = InstanceBot;
5491 }
5492
5493 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
5494 interfaces = this_interfaces->intersection_with(tp_interfaces);
5495 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset,
5496 flat_in_array, instance_id, speculative, depth);
5497 }
5498 default: typerr(t);
5499 }
5500 }
5501 }
5502 return this; // Lint noise
5503 }
5504
5505
5506 template<class T> TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary, const T* other_ary,
5507 ciKlass*& res_klass, bool& res_xk, bool &res_flat, bool& res_not_flat, bool& res_not_null_free, bool &res_atomic) {
5508 int dummy;
5509 bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM);
5510 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
5511 ciKlass* this_klass = this_ary->klass();
5512 ciKlass* other_klass = other_ary->klass();
5513 bool this_xk = this_ary->klass_is_exact();
5514 bool other_xk = other_ary->klass_is_exact();
5515 PTR this_ptr = this_ary->ptr();
5516 PTR other_ptr = other_ary->ptr();
5517 bool this_flat = this_ary->is_flat();
5518 bool this_not_flat = this_ary->is_not_flat();
5519 bool other_flat = other_ary->is_flat();
5520 bool other_not_flat = other_ary->is_not_flat();
5521 bool this_not_null_free = this_ary->is_not_null_free();
5522 bool other_not_null_free = other_ary->is_not_null_free();
5523 bool this_atomic = this_ary->is_atomic();
5524 bool other_atomic = other_ary->is_atomic();
5525 const bool same_nullness = this_ary->is_null_free() == other_ary->is_null_free();
5526 res_klass = nullptr;
5527 MeetResult result = SUBTYPE;
5528 res_flat = this_flat && other_flat;
5529 bool res_null_free = this_ary->is_null_free() && other_ary->is_null_free();
5530 res_not_flat = this_not_flat && other_not_flat;
5531 res_not_null_free = this_not_null_free && other_not_null_free;
5532 res_atomic = this_atomic && other_atomic;
5533
5534 if (elem->isa_int()) {
5535 // Integral array element types have irrelevant lattice relations.
5536 // It is the klass that determines array layout, not the element type.
5537 if (this_top_or_bottom) {
5538 res_klass = other_klass;
5539 } else if (other_top_or_bottom || other_klass == this_klass) {
5540 res_klass = this_klass;
5541 } else {
5542 // Something like byte[int+] meets char[int+].
5543 // This must fall to bottom, not (int[-128..65535])[int+].
5544 // instance_id = InstanceBot;
5545 elem = Type::BOTTOM;
5546 result = NOT_SUBTYPE;
5547 if (above_centerline(ptr) || ptr == Constant) {
5548 ptr = NotNull;
5549 res_xk = false;
5550 return NOT_SUBTYPE;
5551 }
5552 }
5553 } else {// Non integral arrays.
5554 // Must fall to bottom if exact klasses in upper lattice
5555 // are not equal or super klass is exact.
5556 if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) &&
5557 // meet with top[] and bottom[] are processed further down:
5558 !this_top_or_bottom && !other_top_or_bottom &&
5559 // both are exact and not equal:
5561 // 'tap' is exact and super or unrelated:
5562 (other_xk && !other_ary->is_meet_subtype_of(this_ary)) ||
5563 // 'this' is exact and super or unrelated:
5564 (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) {
5565 if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) {
5566 elem = Type::BOTTOM;
5567 }
5568 ptr = NotNull;
5569 res_xk = false;
5570 return NOT_SUBTYPE;
5571 }
5572 }
5573
5574 res_xk = false;
5575 switch (other_ptr) {
5576 case AnyNull:
5577 case TopPTR:
5578 // Compute new klass on demand, do not use tap->_klass
5579 if (below_centerline(this_ptr)) {
5580 res_xk = this_xk;
5581 if (this_ary->is_flat()) {
5582 elem = this_ary->elem();
5583 }
5584 } else {
5585 res_xk = (other_xk || this_xk);
5586 }
5587 break;
5588 case Constant: {
5589 if (this_ptr == Constant && same_nullness) {
5590 // Only exact if same nullness since:
5591 // null-free [LMyValue <: nullable [LMyValue.
5592 res_xk = true;
5593 } else if (above_centerline(this_ptr)) {
5594 res_xk = true;
5595 } else {
5596 // Only precise for identical arrays
5597 res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom));
5598 // Even though MyValue is final, [LMyValue is only exact if the array
5599 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue.
5600 if (res_xk && !res_null_free && !res_not_null_free) {
5601 ptr = NotNull;
5602 res_xk = false;
5603 }
5604 }
5605 break;
5606 }
5607 case NotNull:
5608 case BotPTR:
5609 // Compute new klass on demand, do not use tap->_klass
5610 if (above_centerline(this_ptr)) {
5611 res_xk = other_xk;
5612 if (other_ary->is_flat()) {
5613 elem = other_ary->elem();
5614 }
5615 } else {
5616 res_xk = (other_xk && this_xk) &&
5617 (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays
5618 // Even though MyValue is final, [LMyValue is only exact if the array
5619 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue.
5620 if (res_xk && !res_null_free && !res_not_null_free) {
5621 ptr = NotNull;
5622 res_xk = false;
5623 }
5624 }
5625 break;
5626 default: {
5627 ShouldNotReachHere();
5628 return result;
5629 }
5630 }
5631 return result;
5632 }
5633
5634
5635 //------------------------------xdual------------------------------------------
5636 // Dual: compute field-by-field dual
5637 const Type *TypeAryPtr::xdual() const {
5638 bool xk = _klass_is_exact;
5639 return new TypeAryPtr(dual_ptr(), _const_oop, _ary->dual()->is_ary(), _klass, xk, dual_offset(), dual_field_offset(), dual_instance_id(), is_autobox_cache(), dual_speculative(), dual_inline_depth());
5640 }
5641
5642 Type::Offset TypeAryPtr::meet_field_offset(const Type::Offset offset) const {
5643 return _field_offset.meet(offset);
5644 }
5645
5646 //------------------------------dual_offset------------------------------------
5647 Type::Offset TypeAryPtr::dual_field_offset() const {
5648 return _field_offset.dual();
5649 }
5650
5651 //------------------------------dump2------------------------------------------
5652 #ifndef PRODUCT
5653 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5654 st->print("aryptr:");
5655 _ary->dump2(d, depth, st);
5656 _interfaces->dump(st);
5657
5658 if (_ptr == Constant) {
5659 const_oop()->print(st);
5660 }
5661
5662 st->print(":%s", ptr_msg[_ptr]);
5663 if (_klass_is_exact) {
5664 st->print(":exact");
5665 }
5666
5667 if (is_flat()) {
5668 st->print(":flat");
5669 st->print("(");
5670 _field_offset.dump2(st);
5671 st->print(")");
5672 } else if (is_not_flat()) {
5673 st->print(":not_flat");
5674 }
5675 if (is_null_free()) {
5676 st->print(":null free");
5677 }
5678 if (is_atomic()) {
5679 st->print(":atomic");
5680 }
5681 if (Verbose) {
5682 if (is_not_flat()) {
5683 st->print(":not flat");
5684 }
5685 if (is_not_null_free()) {
5686 st->print(":nullable");
5687 }
5688 }
5689 if (offset() != 0) {
5690 BasicType basic_elem_type = elem()->basic_type();
5691 int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
5692 if( _offset == Offset::top ) st->print("+undefined");
5693 else if( _offset == Offset::bottom ) st->print("+any");
5694 else if( offset() < header_size ) st->print("+%d", offset());
5695 else {
5696 if (basic_elem_type == T_ILLEGAL) {
5697 st->print("+any");
5698 } else {
5699 int elem_size = type2aelembytes(basic_elem_type);
5700 st->print("[%d]", (offset() - header_size)/elem_size);
5701 }
5702 }
5703 }
5704
5705 dump_instance_id(st);
5706 dump_inline_depth(st);
5707 dump_speculative(st);
5708 }
5709 #endif
5710
5711 bool TypeAryPtr::empty(void) const {
5712 if (_ary->empty()) return true;
5713 // TODO 8350865 This should go to the meet implementation
5714 if (is_flat() && is_not_flat()) {
5715 return true;
5716 }
5717 return TypeOopPtr::empty();
5718 }
5719
5720 //------------------------------add_offset-------------------------------------
5721 const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const {
5722 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _field_offset, _instance_id, add_offset_speculative(offset), _inline_depth, _is_autobox_cache);
5723 }
5724
5725 const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const {
5726 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, Offset(offset), _field_offset, _instance_id, with_offset_speculative(offset), _inline_depth, _is_autobox_cache);
5727 }
5728
5729 const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const {
5730 return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5731 }
5732
5733 const TypeAryPtr* TypeAryPtr::remove_speculative() const {
5734 if (_speculative == nullptr) {
5735 return this;
5736 }
5737 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
5738 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, _instance_id, nullptr, _inline_depth, _is_autobox_cache);
5739 }
5740
5741 const Type* TypeAryPtr::cleanup_speculative() const {
5742 if (speculative() == nullptr) {
5743 return this;
5744 }
5745 // Keep speculative part if it contains information about flat-/nullability
5746 const TypeAryPtr* spec_aryptr = speculative()->isa_aryptr();
5747 if (spec_aryptr != nullptr && !above_centerline(spec_aryptr->ptr()) &&
5748 (spec_aryptr->is_not_flat() || spec_aryptr->is_not_null_free())) {
5749 return this;
5750 }
5751 return TypeOopPtr::cleanup_speculative();
5752 }
5753
5754 const TypePtr* TypeAryPtr::with_inline_depth(int depth) const {
5755 if (!UseInlineDepthForSpeculativeTypes) {
5756 return this;
5757 }
5758 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, depth, _is_autobox_cache);
5759 }
5760
5761 const TypeAryPtr* TypeAryPtr::with_field_offset(int offset) const {
5762 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, Offset(offset), _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5763 }
5764
5765 const TypePtr* TypeAryPtr::add_field_offset_and_offset(intptr_t offset) const {
5766 if (!is_flat() || !klass_is_exact() || offset == OffsetBot || offset == OffsetTop) {
5767 return add_offset(offset);
5768 }
5769
5770 // Handle flat concrete value class array with known 'offset' which could refer to an actual field in the flat storage.
5771 int adj = 0;
5772 if (_offset != Offset::bottom && _offset != Offset::top) {
5773 adj = _offset.get();
5774 offset += _offset.get();
5775 }
5776 uint header = arrayOopDesc::base_offset_in_bytes(T_FLAT_ELEMENT);
5777 if (_field_offset != Offset::bottom && _field_offset != Offset::top) {
5778 offset += _field_offset.get();
5779 if (_offset == Offset::bottom || _offset == Offset::top) {
5780 offset += header;
5781 }
5782 }
5783 if (elem()->make_oopptr()->is_inlinetypeptr() && (offset >= (intptr_t)header || offset < 0)) {
5784 // Try to get the field of the inline type array element we are pointing to
5785 ciInlineKlass* vk = elem()->inline_klass();
5786 int shift = flat_log_elem_size();
5787 int mask = (1 << shift) - 1;
5788 int field_offset = static_cast<int>((offset - header) & mask);
5789 ciField* field = vk->get_field_by_offset(field_offset + vk->payload_offset(), false);
5790 if (field != nullptr || field_offset == vk->null_marker_offset_in_payload()) {
5791 return with_field_offset(field_offset)->add_offset(offset - field_offset - adj);
5792 }
5793 }
5794 return add_offset(offset - adj);
5795 }
5796
5797 // Return offset incremented by field_offset for flat inline type arrays
5798 int TypeAryPtr::flat_offset() const {
5799 int offset = _offset.get();
5800 if (offset != OffsetBot && offset != OffsetTop &&
5801 _field_offset != Offset::bottom && _field_offset != Offset::top) {
5802 offset += _field_offset.get();
5803 }
5804 return offset;
5805 }
5806
5807 const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const {
5808 assert(is_known_instance(), "should be known");
5809 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth);
5810 }
5811
5812 //=============================================================================
5813
5814
5815 //------------------------------hash-------------------------------------------
5816 // Type-specific hashing function.
5817 uint TypeNarrowPtr::hash(void) const {
5818 return _ptrtype->hash() + 7;
5819 }
5820
5821 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton
5822 return _ptrtype->singleton();
5823 }
5824
5825 bool TypeNarrowPtr::empty(void) const {
5826 return _ptrtype->empty();
5827 }
5828
5829 intptr_t TypeNarrowPtr::get_con() const {
5830 return _ptrtype->get_con();
5831 }
5832
5833 bool TypeNarrowPtr::eq( const Type *t ) const {
5834 const TypeNarrowPtr* tc = isa_same_narrowptr(t);
5888 case HalfFloatTop:
5889 case HalfFloatCon:
5890 case HalfFloatBot:
5891 case FloatTop:
5892 case FloatCon:
5893 case FloatBot:
5894 case DoubleTop:
5895 case DoubleCon:
5896 case DoubleBot:
5897 case AnyPtr:
5898 case RawPtr:
5899 case OopPtr:
5900 case InstPtr:
5901 case AryPtr:
5902 case MetadataPtr:
5903 case KlassPtr:
5904 case InstKlassPtr:
5905 case AryKlassPtr:
5906 case NarrowOop:
5907 case NarrowKlass:
5908 case Bottom: // Ye Olde Default
5909 return Type::BOTTOM;
5910 case Top:
5911 return this;
5912
5913 default: // All else is a mistake
5914 typerr(t);
5915
5916 } // End of switch
5917
5918 return this;
5919 }
5920
5921 #ifndef PRODUCT
5922 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
5923 _ptrtype->dump2(d, depth, st);
5924 }
5925 #endif
5926
5927 const TypeNarrowOop *TypeNarrowOop::BOTTOM;
5971 return (one == two) && TypePtr::eq(t);
5972 } else {
5973 return one->equals(two) && TypePtr::eq(t);
5974 }
5975 }
5976
5977 //------------------------------hash-------------------------------------------
5978 // Type-specific hashing function.
5979 uint TypeMetadataPtr::hash(void) const {
5980 return
5981 (metadata() ? metadata()->hash() : 0) +
5982 TypePtr::hash();
5983 }
5984
5985 //------------------------------singleton--------------------------------------
5986 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5987 // constants
5988 bool TypeMetadataPtr::singleton(void) const {
5989 // detune optimizer to not generate constant metadata + constant offset as a constant!
5990 // TopPTR, Null, AnyNull, Constant are all singletons
5991 return (offset() == 0) && !below_centerline(_ptr);
5992 }
5993
5994 //------------------------------add_offset-------------------------------------
5995 const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const {
5996 return make( _ptr, _metadata, xadd_offset(offset));
5997 }
5998
5999 //-----------------------------filter------------------------------------------
6000 // Do not allow interface-vs.-noninterface joins to collapse to top.
6001 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const {
6002 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr();
6003 if (ft == nullptr || ft->empty())
6004 return Type::TOP; // Canonical empty value
6005 return ft;
6006 }
6007
6008 //------------------------------get_con----------------------------------------
6009 intptr_t TypeMetadataPtr::get_con() const {
6010 assert( _ptr == Null || _ptr == Constant, "" );
6011 assert(offset() >= 0, "");
6012
6013 if (offset() != 0) {
6014 // After being ported to the compiler interface, the compiler no longer
6015 // directly manipulates the addresses of oops. Rather, it only has a pointer
6016 // to a handle at compile time. This handle is embedded in the generated
6017 // code and dereferenced at the time the nmethod is made. Until that time,
6018 // it is not reasonable to do arithmetic with the addresses of oops (we don't
6019 // have access to the addresses!). This does not seem to currently happen,
6020 // but this assertion here is to help prevent its occurrence.
6021 tty->print_cr("Found oop constant with non-zero offset");
6022 ShouldNotReachHere();
6023 }
6024
6025 return (intptr_t)metadata()->constant_encoding();
6026 }
6027
6028 //------------------------------cast_to_ptr_type-------------------------------
6029 const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const {
6030 if( ptr == _ptr ) return this;
6031 return make(ptr, metadata(), _offset);
6032 }
6033
6047 case HalfFloatBot:
6048 case FloatTop:
6049 case FloatCon:
6050 case FloatBot:
6051 case DoubleTop:
6052 case DoubleCon:
6053 case DoubleBot:
6054 case NarrowOop:
6055 case NarrowKlass:
6056 case Bottom: // Ye Olde Default
6057 return Type::BOTTOM;
6058 case Top:
6059 return this;
6060
6061 default: // All else is a mistake
6062 typerr(t);
6063
6064 case AnyPtr: {
6065 // Found an AnyPtr type vs self-OopPtr type
6066 const TypePtr *tp = t->is_ptr();
6067 Offset offset = meet_offset(tp->offset());
6068 PTR ptr = meet_ptr(tp->ptr());
6069 switch (tp->ptr()) {
6070 case Null:
6071 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6072 // else fall through:
6073 case TopPTR:
6074 case AnyNull: {
6075 return make(ptr, _metadata, offset);
6076 }
6077 case BotPTR:
6078 case NotNull:
6079 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6080 default: typerr(t);
6081 }
6082 }
6083
6084 case RawPtr:
6085 case KlassPtr:
6086 case InstKlassPtr:
6087 case AryKlassPtr:
6088 case OopPtr:
6089 case InstPtr:
6090 case AryPtr:
6091 return TypePtr::BOTTOM; // Oop meet raw is not well defined
6092
6093 case MetadataPtr: {
6094 const TypeMetadataPtr *tp = t->is_metadataptr();
6095 Offset offset = meet_offset(tp->offset());
6096 PTR tptr = tp->ptr();
6097 PTR ptr = meet_ptr(tptr);
6098 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata();
6099 if (tptr == TopPTR || _ptr == TopPTR ||
6100 metadata()->equals(tp->metadata())) {
6101 return make(ptr, md, offset);
6102 }
6103 // metadata is different
6104 if( ptr == Constant ) { // Cannot be equal constants, so...
6105 if( tptr == Constant && _ptr != Constant) return t;
6106 if( _ptr == Constant && tptr != Constant) return this;
6107 ptr = NotNull; // Fall down in lattice
6108 }
6109 return make(ptr, nullptr, offset);
6110 break;
6111 }
6112 } // End of switch
6113 return this; // Return the double constant
6114 }
6115
6119 const Type *TypeMetadataPtr::xdual() const {
6120 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset());
6121 }
6122
6123 //------------------------------dump2------------------------------------------
6124 #ifndef PRODUCT
6125 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
6126 st->print("metadataptr:%s", ptr_msg[_ptr]);
6127 if (metadata() != nullptr) {
6128 st->print(":" INTPTR_FORMAT, p2i(metadata()));
6129 }
6130 dump_offset(st);
6131 }
6132 #endif
6133
6134
6135 //=============================================================================
6136 // Convenience common pre-built type.
6137 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM;
6138
6139 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, Offset offset):
6140 TypePtr(MetadataPtr, ptr, offset, relocInfo::metadata_type), _metadata(metadata) {
6141 }
6142
6143 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) {
6144 return make(Constant, m, Offset(0));
6145 }
6146 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) {
6147 return make(Constant, m, Offset(0));
6148 }
6149
6150 //------------------------------make-------------------------------------------
6151 // Create a meta data constant
6152 const TypeMetadataPtr* TypeMetadataPtr::make(PTR ptr, ciMetadata* m, Offset offset) {
6153 assert(m == nullptr || !m->is_klass(), "wrong type");
6154 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons();
6155 }
6156
6157
6158 const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const {
6159 const Type* elem = _ary->_elem;
6160 bool xk = klass_is_exact();
6161 bool is_refined = false;
6162 if (elem->make_oopptr() != nullptr) {
6163 is_refined = true;
6164 elem = elem->make_oopptr()->as_klass_type(try_for_exact);
6165 if (elem->isa_aryklassptr()) {
6166 const TypeAryKlassPtr* elem_klass = elem->is_aryklassptr();
6167 if (elem_klass->is_refined_type()) {
6168 elem = elem_klass->cast_to_non_refined();
6169 }
6170 } else {
6171 const TypeInstKlassPtr* elem_klass = elem->is_instklassptr();
6172 if (try_for_exact && !xk && elem_klass->klass_is_exact() &&
6173 !elem_klass->exact_klass()->as_instance_klass()->can_be_inline_klass()) {
6174 xk = true;
6175 }
6176 }
6177 }
6178 return TypeAryKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, elem, klass(), Offset(0), is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined);
6179 }
6180
6181 const TypeKlassPtr* TypeKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) {
6182 if (klass->is_instance_klass()) {
6183 return TypeInstKlassPtr::make(klass, interface_handling);
6184 }
6185 return TypeAryKlassPtr::make(klass, interface_handling);
6186 }
6187
6188 TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, Offset offset)
6189 : TypePtr(t, ptr, offset, relocInfo::metadata_type), _klass(klass), _interfaces(interfaces) {
6190 assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) ||
6191 klass->is_type_array_klass() || klass->is_flat_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here");
6192 }
6193
6194 // Is there a single ciKlass* that can represent that type?
6195 ciKlass* TypeKlassPtr::exact_klass_helper() const {
6196 assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface");
6197 if (_interfaces->empty()) {
6198 return _klass;
6199 }
6200 if (_klass != ciEnv::current()->Object_klass()) {
6201 if (_interfaces->eq(_klass->as_instance_klass())) {
6202 return _klass;
6203 }
6204 return nullptr;
6205 }
6206 return _interfaces->exact_klass();
6207 }
6208
6209 //------------------------------eq---------------------------------------------
6210 // Structural equality check for Type representations
6211 bool TypeKlassPtr::eq(const Type *t) const {
6212 const TypeKlassPtr *p = t->is_klassptr();
6213 return
6214 _interfaces->eq(p->_interfaces) &&
6215 TypePtr::eq(p);
6216 }
6217
6218 //------------------------------hash-------------------------------------------
6219 // Type-specific hashing function.
6220 uint TypeKlassPtr::hash(void) const {
6221 return TypePtr::hash() + _interfaces->hash();
6222 }
6223
6224 //------------------------------singleton--------------------------------------
6225 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
6226 // constants
6227 bool TypeKlassPtr::singleton(void) const {
6228 // detune optimizer to not generate constant klass + constant offset as a constant!
6229 // TopPTR, Null, AnyNull, Constant are all singletons
6230 return (offset() == 0) && !below_centerline(_ptr);
6231 }
6232
6233 // Do not allow interface-vs.-noninterface joins to collapse to top.
6234 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const {
6235 // logic here mirrors the one from TypeOopPtr::filter. See comments
6236 // there.
6237 const Type* ft = join_helper(kills, include_speculative);
6238
6239 if (ft->empty()) {
6240 return Type::TOP; // Canonical empty value
6241 }
6242
6243 return ft;
6244 }
6245
6246 const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const {
6247 if (above_centerline(_ptr) && above_centerline(other->_ptr)) {
6248 return _interfaces->union_with(other->_interfaces);
6249 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) {
6250 return other->_interfaces;
6251 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) {
6252 return _interfaces;
6253 }
6254 return _interfaces->intersection_with(other->_interfaces);
6255 }
6256
6257 //------------------------------get_con----------------------------------------
6258 intptr_t TypeKlassPtr::get_con() const {
6259 assert( _ptr == Null || _ptr == Constant, "" );
6260 assert( offset() >= 0, "" );
6261
6262 if (offset() != 0) {
6263 // After being ported to the compiler interface, the compiler no longer
6264 // directly manipulates the addresses of oops. Rather, it only has a pointer
6265 // to a handle at compile time. This handle is embedded in the generated
6266 // code and dereferenced at the time the nmethod is made. Until that time,
6267 // it is not reasonable to do arithmetic with the addresses of oops (we don't
6268 // have access to the addresses!). This does not seem to currently happen,
6269 // but this assertion here is to help prevent its occurrence.
6270 tty->print_cr("Found oop constant with non-zero offset");
6271 ShouldNotReachHere();
6272 }
6273
6274 ciKlass* k = exact_klass();
6275
6276 return (intptr_t)k->constant_encoding();
6277 }
6278
6279 //=============================================================================
6280 // Convenience common pre-built types.
6281
6282 // Not-null object klass or below
6283 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT;
6284 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL;
6285
6286 bool TypeInstKlassPtr::eq(const Type *t) const {
6287 const TypeInstKlassPtr* p = t->is_instklassptr();
6288 return
6289 klass()->equals(p->klass()) &&
6290 _flat_in_array == p->_flat_in_array &&
6291 TypeKlassPtr::eq(p);
6292 }
6293
6294 uint TypeInstKlassPtr::hash() const {
6295 return klass()->hash() + TypeKlassPtr::hash() + static_cast<uint>(_flat_in_array);
6296 }
6297
6298 const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, Offset offset, FlatInArray flat_in_array) {
6299 if (flat_in_array == Uninitialized) {
6300 flat_in_array = compute_flat_in_array(k->as_instance_klass(), ptr == Constant);
6301 }
6302 TypeInstKlassPtr *r =
6303 (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset, flat_in_array))->hashcons();
6304
6305 return r;
6306 }
6307
6308 bool TypeInstKlassPtr::empty() const {
6309 if (_flat_in_array == TopFlat) {
6310 return true;
6311 }
6312 return TypeKlassPtr::empty();
6313 }
6314
6315 //------------------------------add_offset-------------------------------------
6316 // Access internals of klass object
6317 const TypePtr *TypeInstKlassPtr::add_offset( intptr_t offset ) const {
6318 return make(_ptr, klass(), _interfaces, xadd_offset(offset), _flat_in_array);
6319 }
6320
6321 const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const {
6322 return make(_ptr, klass(), _interfaces, Offset(offset), _flat_in_array);
6323 }
6324
6325 //------------------------------cast_to_ptr_type-------------------------------
6326 const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const {
6327 assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type");
6328 if( ptr == _ptr ) return this;
6329 return make(ptr, _klass, _interfaces, _offset, _flat_in_array);
6330 }
6331
6332
6333 bool TypeInstKlassPtr::must_be_exact() const {
6334 if (!_klass->is_loaded()) return false;
6335 ciInstanceKlass* ik = _klass->as_instance_klass();
6336 if (ik->is_final()) return true; // cannot clear xk
6337 return false;
6338 }
6339
6340 //-----------------------------cast_to_exactness-------------------------------
6341 const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const {
6342 if (klass_is_exact == (_ptr == Constant)) return this;
6343 if (must_be_exact()) return this;
6344 ciKlass* k = klass();
6345 FlatInArray flat_in_array = compute_flat_in_array(k->as_instance_klass(), klass_is_exact);
6346 return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset, flat_in_array);
6347 }
6348
6349
6350 //-----------------------------as_instance_type--------------------------------
6351 // Corresponding type for an instance of the given class.
6352 // It will be NotNull, and exact if and only if the klass type is exact.
6353 const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const {
6354 ciKlass* k = klass();
6355 bool xk = klass_is_exact();
6356 Compile* C = Compile::current();
6357 Dependencies* deps = C->dependencies();
6358 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
6359 // Element is an instance
6360 bool klass_is_exact = false;
6361 const TypeInterfaces* interfaces = _interfaces;
6362 ciInstanceKlass* ik = k->as_instance_klass();
6363 if (k->is_loaded()) {
6364 // Try to set klass_is_exact.
6365 klass_is_exact = ik->is_final();
6366 if (!klass_is_exact && klass_change
6367 && deps != nullptr && UseUniqueSubclasses) {
6368 ciInstanceKlass* sub = ik->unique_concrete_subklass();
6369 if (sub != nullptr) {
6370 if (_interfaces->eq(sub)) {
6371 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
6372 k = ik = sub;
6373 xk = sub->is_final();
6374 }
6375 }
6376 }
6377 }
6378
6379 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array);
6380 return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, Offset(0), flat_in_array);
6381 }
6382
6383 //------------------------------xmeet------------------------------------------
6384 // Compute the MEET of two types, return a new Type object.
6385 const Type *TypeInstKlassPtr::xmeet( const Type *t ) const {
6386 // Perform a fast test for common case; meeting the same types together.
6387 if( this == t ) return this; // Meeting same type-rep?
6388
6389 // Current "this->_base" is Pointer
6390 switch (t->base()) { // switch on original type
6391
6392 case Int: // Mixing ints & oops happens when javac
6393 case Long: // reuses local variables
6394 case HalfFloatTop:
6395 case HalfFloatCon:
6396 case HalfFloatBot:
6397 case FloatTop:
6398 case FloatCon:
6399 case FloatBot:
6400 case DoubleTop:
6401 case DoubleCon:
6402 case DoubleBot:
6403 case NarrowOop:
6404 case NarrowKlass:
6405 case Bottom: // Ye Olde Default
6406 return Type::BOTTOM;
6407 case Top:
6408 return this;
6409
6410 default: // All else is a mistake
6411 typerr(t);
6412
6413 case AnyPtr: { // Meeting to AnyPtrs
6414 // Found an AnyPtr type vs self-KlassPtr type
6415 const TypePtr *tp = t->is_ptr();
6416 Offset offset = meet_offset(tp->offset());
6417 PTR ptr = meet_ptr(tp->ptr());
6418 switch (tp->ptr()) {
6419 case TopPTR:
6420 return this;
6421 case Null:
6422 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6423 case AnyNull:
6424 return make(ptr, klass(), _interfaces, offset, _flat_in_array);
6425 case BotPTR:
6426 case NotNull:
6427 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6428 default: typerr(t);
6429 }
6430 }
6431
6432 case RawPtr:
6433 case MetadataPtr:
6434 case OopPtr:
6435 case AryPtr: // Meet with AryPtr
6436 case InstPtr: // Meet with InstPtr
6437 return TypePtr::BOTTOM;
6438
6439 //
6440 // A-top }
6441 // / | \ } Tops
6442 // B-top A-any C-top }
6443 // | / | \ | } Any-nulls
6444 // B-any | C-any }
6445 // | | |
6446 // B-con A-con C-con } constants; not comparable across classes
6447 // | | |
6448 // B-not | C-not }
6449 // | \ | / | } not-nulls
6450 // B-bot A-not C-bot }
6451 // \ | / } Bottoms
6452 // A-bot }
6453 //
6454
6455 case InstKlassPtr: { // Meet two KlassPtr types
6456 const TypeInstKlassPtr *tkls = t->is_instklassptr();
6457 Offset off = meet_offset(tkls->offset());
6458 PTR ptr = meet_ptr(tkls->ptr());
6459 const TypeInterfaces* interfaces = meet_interfaces(tkls);
6460
6461 ciKlass* res_klass = nullptr;
6462 bool res_xk = false;
6463 const FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tkls->flat_in_array());
6464 switch (meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) {
6465 case UNLOADED:
6466 ShouldNotReachHere();
6467 case SUBTYPE:
6468 case NOT_SUBTYPE:
6469 case LCA:
6470 case QUICK: {
6471 assert(res_xk == (ptr == Constant), "");
6472 const Type* res = make(ptr, res_klass, interfaces, off, flat_in_array);
6473 return res;
6474 }
6475 default:
6476 ShouldNotReachHere();
6477 }
6478 } // End of case KlassPtr
6479 case AryKlassPtr: { // All arrays inherit from Object class
6480 const TypeAryKlassPtr *tp = t->is_aryklassptr();
6481 Offset offset = meet_offset(tp->offset());
6482 PTR ptr = meet_ptr(tp->ptr());
6483 const TypeInterfaces* interfaces = meet_interfaces(tp);
6484 const TypeInterfaces* tp_interfaces = tp->_interfaces;
6485 const TypeInterfaces* this_interfaces = _interfaces;
6486
6487 switch (ptr) {
6488 case TopPTR:
6489 case AnyNull: // Fall 'down' to dual of object klass
6490 // For instances when a subclass meets a superclass we fall
6491 // below the centerline when the superclass is exact. We need to
6492 // do the same here.
6493 //
6494 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
6495 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) &&
6496 !klass_is_exact() && !is_not_flat_in_array()) {
6497 return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset, tp->is_not_flat(), tp->is_not_null_free(), tp->is_flat(), tp->is_null_free(), tp->is_atomic(), tp->is_refined_type());
6498 } else {
6499 // cannot subclass, so the meet has to fall badly below the centerline
6500 ptr = NotNull;
6501 interfaces = _interfaces->intersection_with(tp->_interfaces);
6502 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat);
6503 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array);
6504 }
6505 case Constant:
6506 case NotNull:
6507 case BotPTR: { // Fall down to object klass
6508 // LCA is object_klass, but if we subclass from the top we can do better
6509 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
6510 // If 'this' (InstPtr) is above the centerline and it is Object class
6511 // then we can subclass in the Java class hierarchy.
6512 // For instances when a subclass meets a superclass we fall
6513 // below the centerline when the superclass is exact. We need
6514 // to do the same here.
6515 //
6516 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
6517 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) &&
6518 !klass_is_exact() && !is_not_flat_in_array()) {
6519 // that is, tp's array type is a subtype of my klass
6520 return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset, tp->is_not_flat(), tp->is_not_null_free(), tp->is_flat(), tp->is_null_free(), tp->is_atomic(), tp->is_refined_type());
6521 }
6522 }
6523 // The other case cannot happen, since I cannot be a subtype of an array.
6524 // The meet falls down to Object class below centerline.
6525 if( ptr == Constant )
6526 ptr = NotNull;
6527 interfaces = this_interfaces->intersection_with(tp_interfaces);
6528 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat);
6529 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array);
6530 }
6531 default: typerr(t);
6532 }
6533 }
6534
6535 } // End of switch
6536 return this; // Return the double constant
6537 }
6538
6539 //------------------------------xdual------------------------------------------
6540 // Dual: compute field-by-field dual
6541 const Type* TypeInstKlassPtr::xdual() const {
6542 return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset(), dual_flat_in_array());
6543 }
6544
6545 template <class T1, class T2> bool TypePtr::is_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact) {
6546 static_assert(std::is_base_of<T2, T1>::value, "");
6547 if (!this_one->is_loaded() || !other->is_loaded()) {
6548 return false;
6549 }
6550 if (!this_one->is_instance_type(other)) {
6551 return false;
6552 }
6553
6554 if (!other_exact) {
6555 return false;
6556 }
6557
6558 if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) {
6559 return true;
6560 }
6561
6562 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
6616
6617 if (this_exact) {
6618 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
6619 }
6620
6621 return true;
6622 }
6623
6624 bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6625 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
6626 }
6627
6628 const TypeKlassPtr* TypeInstKlassPtr::try_improve() const {
6629 if (!UseUniqueSubclasses) {
6630 return this;
6631 }
6632 ciKlass* k = klass();
6633 Compile* C = Compile::current();
6634 Dependencies* deps = C->dependencies();
6635 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
6636 if (k->is_loaded()) {
6637 ciInstanceKlass* ik = k->as_instance_klass();
6638 if (deps != nullptr) {
6639 ciInstanceKlass* sub = ik->unique_concrete_subklass();
6640 if (sub != nullptr) {
6641 bool improve_to_exact = sub->is_final() && _ptr == NotNull;
6642 const TypeInstKlassPtr* improved = TypeInstKlassPtr::make(improve_to_exact ? Constant : _ptr, sub, _offset);
6643 if (improved->_interfaces->contains(_interfaces)) {
6644 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
6645 return improved;
6646 }
6647 }
6648 }
6649 }
6650 return this;
6651 }
6652
6653 bool TypeInstKlassPtr::can_be_inline_array() const {
6654 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryKlassPtr::_array_interfaces->contains(_interfaces);
6655 }
6656
6657 #ifndef PRODUCT
6658 void TypeInstKlassPtr::dump2(Dict& d, uint depth, outputStream* st) const {
6659 st->print("instklassptr:");
6660 klass()->print_name_on(st);
6661 _interfaces->dump(st);
6662 st->print(":%s", ptr_msg[_ptr]);
6663 dump_offset(st);
6664 dump_flat_in_array(_flat_in_array, st);
6665 }
6666 #endif // PRODUCT
6667
6668 bool TypeAryKlassPtr::can_be_inline_array() const {
6669 return _elem->isa_instklassptr() && _elem->is_instklassptr()->_klass->can_be_inline_klass();
6670 }
6671
6672 bool TypeInstPtr::can_be_inline_array() const {
6673 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryPtr::_array_interfaces->contains(_interfaces);
6674 }
6675
6676 bool TypeAryPtr::can_be_inline_array() const {
6677 return elem()->make_ptr() && elem()->make_ptr()->isa_instptr() && elem()->make_ptr()->is_instptr()->_klass->can_be_inline_klass();
6678 }
6679
6680 const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, const Type* elem, ciKlass* k, Offset offset, bool not_flat, bool not_null_free, bool flat, bool null_free, bool atomic, bool refined_type) {
6681 return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type))->hashcons();
6682 }
6683
6684 const TypeAryKlassPtr* TypeAryKlassPtr::make(PTR ptr, ciKlass* k, Offset offset, InterfaceHandling interface_handling, bool not_flat, bool not_null_free, bool flat, bool null_free, bool atomic, bool refined_type) {
6685 const Type* etype;
6686 if (k->is_obj_array_klass()) {
6687 // Element is an object array. Recursively call ourself.
6688 ciKlass* eklass = k->as_obj_array_klass()->element_klass();
6689 etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false);
6690 k = nullptr;
6691 } else if (k->is_type_array_klass()) {
6692 // Element is an typeArray
6693 etype = get_const_basic_type(k->as_type_array_klass()->element_type());
6694 } else {
6695 ShouldNotReachHere();
6696 }
6697
6698 return TypeAryKlassPtr::make(ptr, etype, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type);
6699 }
6700
6701 const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) {
6702 ciArrayKlass* k = klass->as_array_klass();
6703 if (k->is_refined()) {
6704 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, !k->is_flat_array_klass(), !k->is_elem_null_free(),
6705 k->is_flat_array_klass(), k->is_elem_null_free(), k->is_elem_atomic(), true);
6706 } else {
6707 // Use the default combination to canonicalize all non-refined klass pointers
6708 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, true, true, false, false, true, false);
6709 }
6710 }
6711
6712 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_non_refined() const {
6713 assert(is_refined_type(), "must be a refined type");
6714 PTR ptr = _ptr;
6715 // There can be multiple refined array types corresponding to a single unrefined type
6716 if (ptr == NotNull && elem()->is_klassptr()->klass_is_exact()) {
6717 ptr = Constant;
6718 }
6719 return make(ptr, elem(), nullptr, _offset, true, true, false, false, true, false);
6720 }
6721
6722 // Get the (non-)refined array klass ptr
6723 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_refined_array_klass_ptr(bool refined) const {
6724 if ((refined == is_refined_type()) || !klass_is_exact() || !exact_klass()->is_obj_array_klass()) {
6725 return this;
6726 }
6727 ciArrayKlass* k = exact_klass()->as_array_klass();
6728 k = ciObjArrayKlass::make(k->element_klass(), refined);
6729 return make(k, trust_interfaces);
6730 }
6731
6732 //------------------------------eq---------------------------------------------
6733 // Structural equality check for Type representations
6734 bool TypeAryKlassPtr::eq(const Type *t) const {
6735 const TypeAryKlassPtr *p = t->is_aryklassptr();
6736 return
6737 _elem == p->_elem && // Check array
6738 _flat == p->_flat &&
6739 _not_flat == p->_not_flat &&
6740 _null_free == p->_null_free &&
6741 _not_null_free == p->_not_null_free &&
6742 _atomic == p->_atomic &&
6743 _refined_type == p->_refined_type &&
6744 TypeKlassPtr::eq(p); // Check sub-parts
6745 }
6746
6747 //------------------------------hash-------------------------------------------
6748 // Type-specific hashing function.
6749 uint TypeAryKlassPtr::hash(void) const {
6750 return (uint)(uintptr_t)_elem + TypeKlassPtr::hash() + (uint)(_not_flat ? 43 : 0) +
6751 (uint)(_not_null_free ? 44 : 0) + (uint)(_flat ? 45 : 0) + (uint)(_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0) + (uint)(_refined_type ? 48 : 0);
6752 }
6753
6754 //----------------------compute_klass------------------------------------------
6755 // Compute the defining klass for this class
6756 ciKlass* TypeAryPtr::compute_klass() const {
6757 // Compute _klass based on element type.
6758 ciKlass* k_ary = nullptr;
6759 const TypeInstPtr *tinst;
6760 const TypeAryPtr *tary;
6761 const Type* el = elem();
6762 if (el->isa_narrowoop()) {
6763 el = el->make_ptr();
6764 }
6765
6766 // Get element klass
6767 if ((tinst = el->isa_instptr()) != nullptr) {
6768 // Leave k_ary at nullptr.
6769 } else if ((tary = el->isa_aryptr()) != nullptr) {
6770 // Leave k_ary at nullptr.
6771 } else if ((el->base() == Type::Top) ||
6772 (el->base() == Type::Bottom)) {
6773 // element type of Bottom occurs from meet of basic type
6774 // and object; Top occurs when doing join on Bottom.
6775 // Leave k_ary at null.
6776 } else {
6777 assert(!el->isa_int(), "integral arrays must be pre-equipped with a class");
6778 // Compute array klass directly from basic type
6779 k_ary = ciTypeArrayKlass::make(el->basic_type());
6780 }
6781 return k_ary;
6782 }
6783
6784 //------------------------------klass------------------------------------------
6785 // Return the defining klass for this class
6786 ciKlass* TypeAryPtr::klass() const {
6787 if( _klass ) return _klass; // Return cached value, if possible
6788
6789 // Oops, need to compute _klass and cache it
6790 ciKlass* k_ary = compute_klass();
6798 // type TypeAryPtr::OOPS. This Type is shared between all
6799 // active compilations. However, the ciKlass which represents
6800 // this Type is *not* shared between compilations, so caching
6801 // this value would result in fetching a dangling pointer.
6802 //
6803 // Recomputing the underlying ciKlass for each request is
6804 // a bit less efficient than caching, but calls to
6805 // TypeAryPtr::OOPS->klass() are not common enough to matter.
6806 ((TypeAryPtr*)this)->_klass = k_ary;
6807 }
6808 return k_ary;
6809 }
6810
6811 // Is there a single ciKlass* that can represent that type?
6812 ciKlass* TypeAryPtr::exact_klass_helper() const {
6813 if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) {
6814 ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper();
6815 if (k == nullptr) {
6816 return nullptr;
6817 }
6818 if (k->is_array_klass() && k->as_array_klass()->is_refined()) {
6819 // We have no mechanism to create an array of refined arrays
6820 k = ciObjArrayKlass::make(k->as_array_klass()->element_klass(), false);
6821 }
6822 if (klass_is_exact()) {
6823 return ciObjArrayKlass::make(k, true, is_null_free(), is_atomic());
6824 } else {
6825 // We may reach here if called recursively, must be an unrefined type then
6826 return ciObjArrayKlass::make(k, false);
6827 }
6828 }
6829
6830 return klass();
6831 }
6832
6833 const Type* TypeAryPtr::base_element_type(int& dims) const {
6834 const Type* elem = this->elem();
6835 dims = 1;
6836 while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) {
6837 elem = elem->make_ptr()->is_aryptr()->elem();
6838 dims++;
6839 }
6840 return elem;
6841 }
6842
6843 //------------------------------add_offset-------------------------------------
6844 // Access internals of klass object
6845 const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const {
6846 return make(_ptr, elem(), klass(), xadd_offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type);
6847 }
6848
6849 const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const {
6850 return make(_ptr, elem(), klass(), Offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type);
6851 }
6852
6853 //------------------------------cast_to_ptr_type-------------------------------
6854 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const {
6855 assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type");
6856 if (ptr == _ptr) return this;
6857 return make(ptr, elem(), _klass, _offset, is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type);
6858 }
6859
6860 bool TypeAryKlassPtr::must_be_exact() const {
6861 assert(klass_is_exact(), "precondition");
6862 if (_elem == Type::BOTTOM || _elem == Type::TOP) {
6863 return false;
6864 }
6865 const TypeKlassPtr* elem = _elem->isa_klassptr();
6866 if (elem == nullptr) {
6867 // primitive arrays
6868 return true;
6869 }
6870
6871 // refined types are final
6872 return _refined_type;
6873 }
6874
6875 //-----------------------------cast_to_exactness-------------------------------
6876 const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const {
6877 if (klass_is_exact == this->klass_is_exact()) {
6878 return this;
6879 }
6880 if (!klass_is_exact && must_be_exact()) {
6881 return this;
6882 }
6883 const Type* elem = this->elem();
6884 if (elem->isa_klassptr() && !klass_is_exact) {
6885 elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact);
6886 }
6887
6888 if (klass_is_exact) {
6889 // cast_to_exactness(true) really means get the LCA of all values represented by this
6890 // TypeAryKlassPtr. As a result, it must be an unrefined klass pointer.
6891 return make(Constant, elem, nullptr, _offset, true, true, false, false, true, false);
6892 } else {
6893 // cast_to_exactness(false) means get the TypeAryKlassPtr representing all values that subtype
6894 // this value
6895 bool not_inline = !_elem->isa_instklassptr() || !_elem->is_instklassptr()->instance_klass()->can_be_inline_klass();
6896 bool not_flat = !UseArrayFlattening || not_inline ||
6897 (_elem->isa_instklassptr() && _elem->is_instklassptr()->instance_klass()->is_inlinetype() && !_elem->is_instklassptr()->instance_klass()->maybe_flat_in_array());
6898 bool not_null_free = not_inline;
6899 bool atomic = not_flat;
6900 return make(NotNull, elem, nullptr, _offset, not_flat, not_null_free, false, false, atomic, false);
6901 }
6902 }
6903
6904 //-----------------------------as_instance_type--------------------------------
6905 // Corresponding type for an instance of the given class.
6906 // It will be NotNull, and exact if and only if the klass type is exact.
6907 const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const {
6908 ciKlass* k = klass();
6909 bool xk = klass_is_exact();
6910 const Type* el = nullptr;
6911 if (elem()->isa_klassptr()) {
6912 el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false);
6913 k = nullptr;
6914 } else {
6915 el = elem();
6916 }
6917 bool null_free = _null_free;
6918 if (null_free && el->isa_ptr()) {
6919 el = el->is_ptr()->join_speculative(TypePtr::NOTNULL);
6920 }
6921 return TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(el, TypeInt::POS, false, is_flat(), is_not_flat(), is_not_null_free(), is_atomic()), k, xk, Offset(0));
6922 }
6923
6924
6925 //------------------------------xmeet------------------------------------------
6926 // Compute the MEET of two types, return a new Type object.
6927 const Type *TypeAryKlassPtr::xmeet( const Type *t ) const {
6928 // Perform a fast test for common case; meeting the same types together.
6929 if( this == t ) return this; // Meeting same type-rep?
6930
6931 // Current "this->_base" is Pointer
6932 switch (t->base()) { // switch on original type
6933
6934 case Int: // Mixing ints & oops happens when javac
6935 case Long: // reuses local variables
6936 case HalfFloatTop:
6937 case HalfFloatCon:
6938 case HalfFloatBot:
6939 case FloatTop:
6940 case FloatCon:
6941 case FloatBot:
6942 case DoubleTop:
6943 case DoubleCon:
6944 case DoubleBot:
6945 case NarrowOop:
6946 case NarrowKlass:
6947 case Bottom: // Ye Olde Default
6948 return Type::BOTTOM;
6949 case Top:
6950 return this;
6951
6952 default: // All else is a mistake
6953 typerr(t);
6954
6955 case AnyPtr: { // Meeting to AnyPtrs
6956 // Found an AnyPtr type vs self-KlassPtr type
6957 const TypePtr *tp = t->is_ptr();
6958 Offset offset = meet_offset(tp->offset());
6959 PTR ptr = meet_ptr(tp->ptr());
6960 switch (tp->ptr()) {
6961 case TopPTR:
6962 return this;
6963 case Null:
6964 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6965 case AnyNull:
6966 return make(ptr, _elem, klass(), offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type());
6967 case BotPTR:
6968 case NotNull:
6969 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6970 default: typerr(t);
6971 }
6972 }
6973
6974 case RawPtr:
6975 case MetadataPtr:
6976 case OopPtr:
6977 case AryPtr: // Meet with AryPtr
6978 case InstPtr: // Meet with InstPtr
6979 return TypePtr::BOTTOM;
6980
6981 //
6982 // A-top }
6983 // / | \ } Tops
6984 // B-top A-any C-top }
6985 // | / | \ | } Any-nulls
6986 // B-any | C-any }
6987 // | | |
6988 // B-con A-con C-con } constants; not comparable across classes
6989 // | | |
6990 // B-not | C-not }
6991 // | \ | / | } not-nulls
6992 // B-bot A-not C-bot }
6993 // \ | / } Bottoms
6994 // A-bot }
6995 //
6996
6997 case AryKlassPtr: { // Meet two KlassPtr types
6998 const TypeAryKlassPtr *tap = t->is_aryklassptr();
6999 Offset off = meet_offset(tap->offset());
7000 const Type* elem = _elem->meet(tap->_elem);
7001 PTR ptr = meet_ptr(tap->ptr());
7002 ciKlass* res_klass = nullptr;
7003 bool res_xk = false;
7004 bool res_flat = false;
7005 bool res_not_flat = false;
7006 bool res_not_null_free = false;
7007 bool res_atomic = false;
7008 MeetResult res = meet_aryptr(ptr, elem, this, tap,
7009 res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic);
7010 assert(res_xk == (ptr == Constant), "");
7011 bool flat = meet_flat(tap->_flat);
7012 bool null_free = meet_null_free(tap->_null_free);
7013 bool atomic = meet_atomic(tap->_atomic);
7014 bool refined_type = _refined_type && tap->_refined_type;
7015 if (res == NOT_SUBTYPE) {
7016 flat = false;
7017 null_free = false;
7018 atomic = false;
7019 refined_type = false;
7020 } else if (res == SUBTYPE) {
7021 if (above_centerline(tap->ptr()) && !above_centerline(this->ptr())) {
7022 flat = _flat;
7023 null_free = _null_free;
7024 atomic = _atomic;
7025 refined_type = _refined_type;
7026 } else if (above_centerline(this->ptr()) && !above_centerline(tap->ptr())) {
7027 flat = tap->_flat;
7028 null_free = tap->_null_free;
7029 atomic = tap->_atomic;
7030 refined_type = tap->_refined_type;
7031 } else if (above_centerline(this->ptr()) && above_centerline(tap->ptr())) {
7032 flat = _flat || tap->_flat;
7033 null_free = _null_free || tap->_null_free;
7034 atomic = _atomic || tap->_atomic;
7035 refined_type = _refined_type || tap->_refined_type;
7036 } else if (res_xk && _refined_type != tap->_refined_type) {
7037 // This can happen if the phi emitted by LibraryCallKit::load_default_refined_array_klass/load_non_refined_array_klass
7038 // is processed before the typeArray guard is folded. Both inputs are constant but the input corresponding to the
7039 // typeArray will go away. Don't constant fold it yet but wait for the control input to collapse.
7040 ptr = PTR::NotNull;
7041 }
7042 }
7043 return make(ptr, elem, res_klass, off, res_not_flat, res_not_null_free, flat, null_free, atomic, refined_type);
7044 } // End of case KlassPtr
7045 case InstKlassPtr: {
7046 const TypeInstKlassPtr *tp = t->is_instklassptr();
7047 Offset offset = meet_offset(tp->offset());
7048 PTR ptr = meet_ptr(tp->ptr());
7049 const TypeInterfaces* interfaces = meet_interfaces(tp);
7050 const TypeInterfaces* tp_interfaces = tp->_interfaces;
7051 const TypeInterfaces* this_interfaces = _interfaces;
7052
7053 switch (ptr) {
7054 case TopPTR:
7055 case AnyNull: // Fall 'down' to dual of object klass
7056 // For instances when a subclass meets a superclass we fall
7057 // below the centerline when the superclass is exact. We need to
7058 // do the same here.
7059 //
7060 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
7061 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
7062 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
7063 return TypeAryKlassPtr::make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type());
7064 } else {
7065 // cannot subclass, so the meet has to fall badly below the centerline
7066 ptr = NotNull;
7067 interfaces = this_interfaces->intersection_with(tp->_interfaces);
7068 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
7069 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array);
7070 }
7071 case Constant:
7072 case NotNull:
7073 case BotPTR: { // Fall down to object klass
7074 // LCA is object_klass, but if we subclass from the top we can do better
7075 if (above_centerline(tp->ptr())) {
7076 // If 'tp' is above the centerline and it is Object class
7077 // then we can subclass in the Java class hierarchy.
7078 // For instances when a subclass meets a superclass we fall
7079 // below the centerline when the superclass is exact. We need
7080 // to do the same here.
7081 //
7082 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
7083 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
7084 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
7085 // that is, my array type is a subtype of 'tp' klass
7086 return make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type());
7087 }
7088 }
7089 // The other case cannot happen, since t cannot be a subtype of an array.
7090 // The meet falls down to Object class below centerline.
7091 if (ptr == Constant)
7092 ptr = NotNull;
7093 interfaces = this_interfaces->intersection_with(tp_interfaces);
7094 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
7095 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array);
7096 }
7097 default: typerr(t);
7098 }
7099 }
7100
7101 } // End of switch
7102 return this; // Return the double constant
7103 }
7104
7105 template <class T1, class T2> bool TypePtr::is_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact) {
7106 static_assert(std::is_base_of<T2, T1>::value, "");
7107
7108 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) {
7109 return true;
7110 }
7111
7112 int dummy;
7113 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
7114
7115 if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
7116 return false;
7117 }
7118
7119 if (this_one->is_instance_type(other)) {
7120 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) &&
7121 other_exact;
7122 }
7123
7124 assert(this_one->is_array_type(other), "");
7125 const T1* other_ary = this_one->is_array_type(other);
7126 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
7127 if (other_top_or_bottom) {
7128 return false;
7129 }
7130
7131 const TypePtr* other_elem = other_ary->elem()->make_ptr();
7132 const TypePtr* this_elem = this_one->elem()->make_ptr();
7133 if (this_elem != nullptr && other_elem != nullptr) {
7134 if (other->is_null_free() && !this_one->is_null_free()) {
7135 return false; // A nullable array can't be a subtype of a null-free array
7136 }
7137 return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
7138 }
7139 if (this_elem == nullptr && other_elem == nullptr) {
7140 return this_one->klass()->is_subtype_of(other->klass());
7141 }
7142 return false;
7143 }
7144
7145 bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
7146 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
7147 }
7148
7149 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) {
7150 static_assert(std::is_base_of<T2, T1>::value, "");
7151
7152 int dummy;
7153 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
7154
7155 if (!this_one->is_array_type(other) ||
7156 !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
7209 }
7210
7211 const TypePtr* this_elem = this_one->elem()->make_ptr();
7212 const TypePtr* other_elem = other_ary->elem()->make_ptr();
7213 if (other_elem != nullptr && this_elem != nullptr) {
7214 return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
7215 }
7216 if (other_elem == nullptr && this_elem == nullptr) {
7217 return this_one->klass()->is_subtype_of(other->klass());
7218 }
7219 return false;
7220 }
7221
7222 bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
7223 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
7224 }
7225
7226 //------------------------------xdual------------------------------------------
7227 // Dual: compute field-by-field dual
7228 const Type *TypeAryKlassPtr::xdual() const {
7229 return new TypeAryKlassPtr(dual_ptr(), elem()->dual(), klass(), dual_offset(), !is_not_flat(), !is_not_null_free(), dual_flat(), dual_null_free(), dual_atomic(), _refined_type);
7230 }
7231
7232 // Is there a single ciKlass* that can represent that type?
7233 ciKlass* TypeAryKlassPtr::exact_klass_helper() const {
7234 if (elem()->isa_klassptr()) {
7235 ciKlass* k = elem()->is_klassptr()->exact_klass_helper();
7236 if (k == nullptr) {
7237 return nullptr;
7238 }
7239 assert(!k->is_array_klass() || !k->as_array_klass()->is_refined(), "no mechanism to create an array of refined arrays %s", k->name()->as_utf8());
7240 k = ciArrayKlass::make(k, is_null_free(), is_atomic(), _refined_type);
7241 return k;
7242 }
7243
7244 return klass();
7245 }
7246
7247 ciKlass* TypeAryKlassPtr::klass() const {
7248 if (_klass != nullptr) {
7249 return _klass;
7250 }
7251 ciKlass* k = nullptr;
7252 if (elem()->isa_klassptr()) {
7253 // leave null
7254 } else if ((elem()->base() == Type::Top) ||
7255 (elem()->base() == Type::Bottom)) {
7256 } else {
7257 k = ciTypeArrayKlass::make(elem()->basic_type());
7258 ((TypeAryKlassPtr*)this)->_klass = k;
7259 }
7260 return k;
7261 }
7262
7263 //------------------------------dump2------------------------------------------
7264 // Dump Klass Type
7265 #ifndef PRODUCT
7266 void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
7267 st->print("aryklassptr:[");
7268 _elem->dump2(d, depth, st);
7269 _interfaces->dump(st);
7270 st->print(":%s", ptr_msg[_ptr]);
7271 if (_flat) st->print(":flat");
7272 if (_null_free) st->print(":null free");
7273 if (_atomic) st->print(":atomic");
7274 if (_refined_type) st->print(":refined_type");
7275 if (Verbose) {
7276 if (_not_flat) st->print(":not flat");
7277 if (_not_null_free) st->print(":nullable");
7278 }
7279 dump_offset(st);
7280 }
7281 #endif
7282
7283 const Type* TypeAryKlassPtr::base_element_type(int& dims) const {
7284 const Type* elem = this->elem();
7285 dims = 1;
7286 while (elem->isa_aryklassptr()) {
7287 elem = elem->is_aryklassptr()->elem();
7288 dims++;
7289 }
7290 return elem;
7291 }
7292
7293 //=============================================================================
7294 // Convenience common pre-built types.
7295
7296 //------------------------------make-------------------------------------------
7297 const TypeFunc *TypeFunc::make(const TypeTuple *domain_sig, const TypeTuple* domain_cc,
7298 const TypeTuple* range_sig, const TypeTuple* range_cc,
7299 bool scalarized_return) {
7300 return (TypeFunc*)(new TypeFunc(domain_sig, domain_cc, range_sig, range_cc, scalarized_return))->hashcons();
7301 }
7302
7303 const TypeFunc *TypeFunc::make(const TypeTuple *domain, const TypeTuple *range) {
7304 return make(domain, domain, range, range);
7305 }
7306
7307 //------------------------------osr_domain-----------------------------
7308 const TypeTuple* osr_domain() {
7309 const Type **fields = TypeTuple::fields(2);
7310 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // address of osr buffer
7311 return TypeTuple::make(TypeFunc::Parms+1, fields);
7312 }
7313
7314 // Build a TypeFunc with both the Java-signature view ('sig') and the actual calling-
7315 // convention view ('cc') of inline types. In the signature, an inline type is a single
7316 // oop slot. In the scalarized calling convention, it is expanded to its field
7317 // values (plus null marker and optional oop to the heap buffer).
7318 // The 'is_call' argument distinguishes between the return signature of a method at calls
7319 // vs. at compilation of that method because at calls we return an additional null marker field.
7320 // For OSR and mismatching calls, we fall back to the non-scalarized argument view.
7321 const TypeFunc* TypeFunc::make(ciMethod* method, bool is_call, bool is_osr_compilation) {
7322 Compile* C = Compile::current();
7323 const TypeFunc* tf = nullptr;
7324 // Inline types are not passed/returned by reference, instead each field of
7325 // the inline type is passed/returned as an argument. We maintain two views of
7326 // the argument/return list here: one based on the signature (with an inline
7327 // type argument/return as a single slot), one based on the actual calling
7328 // convention (with an inline type argument/return as a list of its fields).
7329 bool has_scalar_args = method->has_scalarized_args() && !is_osr_compilation;
7330 // Fall back to the non-scalarized calling convention when compiling a call via a mismatching method
7331 if (is_call && method->mismatch()) {
7332 has_scalar_args = false;
7333 }
7334 ciSignature* sig = method->signature();
7335 bool has_scalar_ret = !method->is_native() && sig->return_type()->is_inlinetype() && sig->return_type()->as_inline_klass()->can_be_returned_as_fields();
7336 // Don't cache on scalarized return because the range depends on 'is_call'
7337 if (!is_osr_compilation && !has_scalar_ret) {
7338 tf = C->last_tf(method); // check cache
7339 if (tf != nullptr) return tf; // The hit rate here is almost 50%.
7340 }
7341 const TypeTuple* domain_sig = is_osr_compilation ? osr_domain() : TypeTuple::make_domain(method, ignore_interfaces, false);
7342 const TypeTuple* domain_cc = has_scalar_args ? TypeTuple::make_domain(method, ignore_interfaces, true) : domain_sig;
7343 const TypeTuple* range_sig = TypeTuple::make_range(sig, ignore_interfaces);
7344 const TypeTuple* range_cc = has_scalar_ret ? TypeTuple::make_range(sig, ignore_interfaces, true, is_call) : range_sig;
7345 tf = TypeFunc::make(domain_sig, domain_cc, range_sig, range_cc, has_scalar_ret);
7346 if (!is_osr_compilation && !has_scalar_ret) {
7347 C->set_last_tf(method, tf); // fill cache
7348 }
7349 return tf;
7350 }
7351
7352 //------------------------------meet-------------------------------------------
7353 // Compute the MEET of two types. It returns a new Type object.
7354 const Type *TypeFunc::xmeet( const Type *t ) const {
7355 // Perform a fast test for common case; meeting the same types together.
7356 if( this == t ) return this; // Meeting same type-rep?
7357
7358 // Current "this->_base" is Func
7359 switch (t->base()) { // switch on original type
7360
7361 case Bottom: // Ye Olde Default
7362 return t;
7363
7364 default: // All else is a mistake
7365 typerr(t);
7366
7367 case Top:
7368 break;
7369 }
7370 return this; // Return the double constant
7371 }
7372
7373 //------------------------------xdual------------------------------------------
7374 // Dual: compute field-by-field dual
7375 const Type *TypeFunc::xdual() const {
7376 return this;
7377 }
7378
7379 //------------------------------eq---------------------------------------------
7380 // Structural equality check for Type representations
7381 bool TypeFunc::eq( const Type *t ) const {
7382 const TypeFunc *a = (const TypeFunc*)t;
7383 return _domain_sig == a->_domain_sig &&
7384 _domain_cc == a->_domain_cc &&
7385 _range_sig == a->_range_sig &&
7386 _range_cc == a->_range_cc &&
7387 _scalarized_return == a->_scalarized_return;
7388 }
7389
7390 //------------------------------hash-------------------------------------------
7391 // Type-specific hashing function.
7392 uint TypeFunc::hash(void) const {
7393 return (uint)(intptr_t)_domain_sig + (uint)(intptr_t)_domain_cc + (uint)(intptr_t)_range_sig + (uint)(intptr_t)_range_cc + (uint)(intptr_t)_scalarized_return;
7394 }
7395
7396 //------------------------------dump2------------------------------------------
7397 // Dump Function Type
7398 #ifndef PRODUCT
7399 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
7400 if( _range_sig->cnt() <= Parms )
7401 st->print("void");
7402 else {
7403 uint i;
7404 for (i = Parms; i < _range_sig->cnt()-1; i++) {
7405 _range_sig->field_at(i)->dump2(d,depth,st);
7406 st->print("/");
7407 }
7408 _range_sig->field_at(i)->dump2(d,depth,st);
7409 }
7410 st->print(" ");
7411 st->print("( ");
7412 if( !depth || d[this] ) { // Check for recursive dump
7413 st->print("...)");
7414 return;
7415 }
7416 d.Insert((void*)this,(void*)this); // Stop recursion
7417 if (Parms < _domain_sig->cnt())
7418 _domain_sig->field_at(Parms)->dump2(d,depth-1,st);
7419 for (uint i = Parms+1; i < _domain_sig->cnt(); i++) {
7420 st->print(", ");
7421 _domain_sig->field_at(i)->dump2(d,depth-1,st);
7422 }
7423 st->print(" )");
7424 }
7425 #endif
7426
7427 //------------------------------singleton--------------------------------------
7428 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
7429 // constants (Ldi nodes). Singletons are integer, float or double constants
7430 // or a single symbol.
7431 bool TypeFunc::singleton(void) const {
7432 return false; // Never a singleton
7433 }
7434
7435 bool TypeFunc::empty(void) const {
7436 return false; // Never empty
7437 }
7438
7439
7440 BasicType TypeFunc::return_type() const{
7441 if (range_sig()->cnt() == TypeFunc::Parms) {
7442 return T_VOID;
7443 }
7444 return range_sig()->field_at(TypeFunc::Parms)->basic_type();
7445 }
|