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, relocInfo::none }, // Bad
66 { Control, T_ILLEGAL, "control", false, 0, relocInfo::none }, // Control
67 { Bottom, T_VOID, "top", false, 0, relocInfo::none }, // Top
68 { Bad, T_INT, "int:", false, Op_RegI, relocInfo::none }, // Int
69 { Bad, T_LONG, "long:", false, Op_RegL, relocInfo::none }, // Long
70 { Half, T_VOID, "half", false, 0, relocInfo::none }, // Half
71 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN, relocInfo::none }, // NarrowOop
72 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN, relocInfo::none }, // NarrowKlass
73 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg, relocInfo::none }, // Tuple
74 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg, relocInfo::none }, // Array
75 { Bad, T_ARRAY, "interfaces:", false, Node::NotAMachineReg, relocInfo::none }, // Interfaces
76
77 #if defined(PPC64)
78 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask.
79 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA.
80 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS
81 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // 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());
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 TypeVectMask(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);
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, const TypePtr* speculative, int inline_depth) {
2601 return (TypePtr*)(new TypePtr(t,ptr,offset, speculative, inline_depth))->hashcons();
2602 }
2603
2604 //------------------------------cast_to_ptr_type-------------------------------
2605 const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const {
2606 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
2607 if( ptr == _ptr ) return this;
2608 return make(_base, ptr, _offset, _speculative, _inline_depth);
2609 }
2610
2611 //------------------------------get_con----------------------------------------
2612 intptr_t TypePtr::get_con() const {
2613 assert( _ptr == Null, "" );
2614 return _offset;
2615 }
2616
2617 //------------------------------meet-------------------------------------------
2618 // Compute the MEET of two types. It returns a new Type object.
2619 const Type *TypePtr::xmeet(const Type *t) const {
2620 const Type* res = xmeet_helper(t);
2621 if (res->isa_ptr() == nullptr) {
2622 return res;
2623 }
2624
2625 const TypePtr* res_ptr = res->is_ptr();
2626 if (res_ptr->speculative() != nullptr) {
2627 // type->speculative() is null means that speculation is no better
2628 // than type, i.e. type->speculative() == type. So there are 2
2629 // ways to represent the fact that we have no useful speculative
2630 // data and we should use a single one to be able to test for
2631 // equality between types. Check whether type->speculative() ==
2632 // type and set speculative to null if it is the case.
2633 if (res_ptr->remove_speculative() == res_ptr->speculative()) {
2634 return res_ptr->remove_speculative();
2668 int depth = meet_inline_depth(tp->inline_depth());
2669 return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth);
2670 }
2671 case RawPtr: // For these, flip the call around to cut down
2672 case OopPtr:
2673 case InstPtr: // on the cases I have to handle.
2674 case AryPtr:
2675 case MetadataPtr:
2676 case KlassPtr:
2677 case InstKlassPtr:
2678 case AryKlassPtr:
2679 return t->xmeet(this); // Call in reverse direction
2680 default: // All else is a mistake
2681 typerr(t);
2682
2683 }
2684 return this;
2685 }
2686
2687 //------------------------------meet_offset------------------------------------
2688 int TypePtr::meet_offset( int offset ) const {
2689 // Either is 'TOP' offset? Return the other offset!
2690 if( _offset == OffsetTop ) return offset;
2691 if( offset == OffsetTop ) return _offset;
2692 // If either is different, return 'BOTTOM' offset
2693 if( _offset != offset ) return OffsetBot;
2694 return _offset;
2695 }
2696
2697 //------------------------------dual_offset------------------------------------
2698 int TypePtr::dual_offset( ) const {
2699 if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM'
2700 if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP'
2701 return _offset; // Map everything else into self
2702 }
2703
2704 //------------------------------xdual------------------------------------------
2705 // Dual: compute field-by-field dual
2706 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
2707 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
2708 };
2709 const Type *TypePtr::xdual() const {
2710 return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), dual_speculative(), dual_inline_depth());
2711 }
2712
2713 //------------------------------xadd_offset------------------------------------
2714 int TypePtr::xadd_offset( intptr_t offset ) const {
2715 // Adding to 'TOP' offset? Return 'TOP'!
2716 if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop;
2717 // Adding to 'BOTTOM' offset? Return 'BOTTOM'!
2718 if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot;
2719 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'!
2720 offset += (intptr_t)_offset;
2721 if (offset != (int)offset || offset == OffsetTop) return OffsetBot;
2722
2723 // assert( _offset >= 0 && _offset+offset >= 0, "" );
2724 // It is possible to construct a negative offset during PhaseCCP
2725
2726 return (int)offset; // Sum valid offsets
2727 }
2728
2729 //------------------------------add_offset-------------------------------------
2730 const TypePtr *TypePtr::add_offset( intptr_t offset ) const {
2731 return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth);
2732 }
2733
2734 const TypePtr *TypePtr::with_offset(intptr_t offset) const {
2735 return make(AnyPtr, _ptr, offset, _speculative, _inline_depth);
2736 }
2737
2738 //------------------------------eq---------------------------------------------
2739 // Structural equality check for Type representations
2740 bool TypePtr::eq( const Type *t ) const {
2741 const TypePtr *a = (const TypePtr*)t;
2742 return _ptr == a->ptr() && _offset == a->offset() && eq_speculative(a) && _inline_depth == a->_inline_depth;
2743 }
2744
2745 //------------------------------hash-------------------------------------------
2746 // Type-specific hashing function.
2747 uint TypePtr::hash(void) const {
2748 return (uint)_ptr + (uint)_offset + (uint)hash_speculative() + (uint)_inline_depth;
2749 }
2750
2751 /**
2752 * Return same type without a speculative part
2753 */
2754 const TypePtr* TypePtr::remove_speculative() const {
2755 if (_speculative == nullptr) {
2756 return this;
2757 }
2758 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
2759 return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth);
2760 }
2761
2762 /**
2763 * Return same type but drop speculative part if we know we won't use
2764 * it
2765 */
2766 const Type* TypePtr::cleanup_speculative() const {
2767 if (speculative() == nullptr) {
2768 return this;
2985 return false;
2986 }
2987 // We already know the speculative type cannot be null
2988 if (!speculative_maybe_null()) {
2989 return false;
2990 }
2991 // We already know this is always null
2992 if (this == TypePtr::NULL_PTR) {
2993 return false;
2994 }
2995 // We already know the speculative type is always null
2996 if (speculative_always_null()) {
2997 return false;
2998 }
2999 if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) {
3000 return false;
3001 }
3002 return true;
3003 }
3004
3005 //------------------------------dump2------------------------------------------
3006 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
3007 "TopPTR","AnyNull","Constant","null","NotNull","BotPTR"
3008 };
3009
3010 #ifndef PRODUCT
3011 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
3012 st->print("ptr:%s", ptr_msg[_ptr]);
3013 dump_offset(st);
3014 dump_inline_depth(st);
3015 dump_speculative(st);
3016 }
3017
3018 void TypePtr::dump_offset(outputStream* st) const {
3019 if (_offset == OffsetBot) {
3020 st->print("+bot");
3021 } else if (_offset == OffsetTop) {
3022 st->print("+top");
3023 } else {
3024 st->print("+%d", _offset);
3025 }
3026 }
3027
3028 /**
3029 *dump the speculative part of the type
3030 */
3031 void TypePtr::dump_speculative(outputStream *st) const {
3032 if (_speculative != nullptr) {
3033 st->print(" (speculative=");
3034 _speculative->dump_on(st);
3035 st->print(")");
3036 }
3037 }
3038
3039 /**
3040 *dump the inline depth of the type
3041 */
3042 void TypePtr::dump_inline_depth(outputStream *st) const {
3043 if (_inline_depth != InlineDepthBottom) {
3044 if (_inline_depth == InlineDepthTop) {
3045 st->print(" (inline_depth=InlineDepthTop)");
3046 } else {
3047 st->print(" (inline_depth=%d)", _inline_depth);
3048 }
3049 }
3050 }
3051 #endif
3052
3053 //------------------------------singleton--------------------------------------
3054 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3055 // constants
3056 bool TypePtr::singleton(void) const {
3057 // TopPTR, Null, AnyNull, Constant are all singletons
3058 return (_offset != OffsetBot) && !below_centerline(_ptr);
3059 }
3060
3061 bool TypePtr::empty(void) const {
3062 return (_offset == OffsetTop) || above_centerline(_ptr);
3063 }
3064
3065 //=============================================================================
3066 // Convenience common pre-built types.
3067 const TypeRawPtr *TypeRawPtr::BOTTOM;
3068 const TypeRawPtr *TypeRawPtr::NOTNULL;
3069
3070 //------------------------------make-------------------------------------------
3071 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
3072 assert( ptr != Constant, "what is the constant?" );
3073 assert( ptr != Null, "Use TypePtr for null" );
3074 return (TypeRawPtr*)(new TypeRawPtr(ptr,nullptr))->hashcons();
3075 }
3076
3077 const TypeRawPtr *TypeRawPtr::make(address bits) {
3078 assert(bits != nullptr, "Use TypePtr for null");
3079 return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons();
3080 }
3081
3082 //------------------------------cast_to_ptr_type-------------------------------
3450 #endif
3451
3452 // Can't be implemented because there's no way to know if the type is above or below the center line.
3453 const Type* TypeInterfaces::xmeet(const Type* t) const {
3454 ShouldNotReachHere();
3455 return Type::xmeet(t);
3456 }
3457
3458 bool TypeInterfaces::singleton(void) const {
3459 ShouldNotReachHere();
3460 return Type::singleton();
3461 }
3462
3463 bool TypeInterfaces::has_non_array_interface() const {
3464 assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?");
3465
3466 return !TypeAryPtr::_array_interfaces->contains(this);
3467 }
3468
3469 //------------------------------TypeOopPtr-------------------------------------
3470 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int offset,
3471 int instance_id, const TypePtr* speculative, int inline_depth)
3472 : TypePtr(t, ptr, offset, speculative, inline_depth),
3473 _const_oop(o), _klass(k),
3474 _interfaces(interfaces),
3475 _klass_is_exact(xk),
3476 _is_ptr_to_narrowoop(false),
3477 _is_ptr_to_narrowklass(false),
3478 _is_ptr_to_boxed_value(false),
3479 _instance_id(instance_id) {
3480 #ifdef ASSERT
3481 if (klass() != nullptr && klass()->is_loaded()) {
3482 interfaces->verify_is_loaded();
3483 }
3484 #endif
3485 if (Compile::current()->eliminate_boxing() && (t == InstPtr) &&
3486 (offset > 0) && xk && (k != nullptr) && k->is_instance_klass()) {
3487 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset);
3488 }
3489 #ifdef _LP64
3490 if (_offset > 0 || _offset == Type::OffsetTop || _offset == Type::OffsetBot) {
3491 if (_offset == oopDesc::klass_offset_in_bytes()) {
3492 _is_ptr_to_narrowklass = true;
3493 } else if (klass() == nullptr) {
3494 // Array with unknown body type
3495 assert(this->isa_aryptr(), "only arrays without klass");
3496 _is_ptr_to_narrowoop = UseCompressedOops;
3497 } else if (this->isa_aryptr()) {
3498 _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() &&
3499 _offset != arrayOopDesc::length_offset_in_bytes());
3500 } else if (klass()->is_instance_klass()) {
3501 ciInstanceKlass* ik = klass()->as_instance_klass();
3502 if (this->isa_klassptr()) {
3503 // Perm objects don't use compressed references
3504 } else if (_offset == OffsetBot || _offset == OffsetTop) {
3505 // unsafe access
3506 _is_ptr_to_narrowoop = UseCompressedOops;
3507 } else {
3508 assert(this->isa_instptr(), "must be an instance ptr.");
3509
3510 if (klass() == ciEnv::current()->Class_klass() &&
3511 (_offset == java_lang_Class::klass_offset() ||
3512 _offset == java_lang_Class::array_klass_offset())) {
3513 // Special hidden fields from the Class.
3514 assert(this->isa_instptr(), "must be an instance ptr.");
3515 _is_ptr_to_narrowoop = false;
3516 } else if (klass() == ciEnv::current()->Class_klass() &&
3517 _offset >= InstanceMirrorKlass::offset_of_static_fields()) {
3518 // Static fields
3519 BasicType basic_elem_type = T_ILLEGAL;
3520 if (const_oop() != nullptr) {
3521 ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass();
3522 basic_elem_type = k->get_field_type_by_offset(_offset, true);
3523 }
3524 if (basic_elem_type != T_ILLEGAL) {
3525 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3526 } else {
3527 // unsafe access
3528 _is_ptr_to_narrowoop = UseCompressedOops;
3529 }
3530 } else {
3531 // Instance fields which contains a compressed oop references.
3532 BasicType basic_elem_type = ik->get_field_type_by_offset(_offset, false);
3533 if (basic_elem_type != T_ILLEGAL) {
3534 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3535 } else if (klass()->equals(ciEnv::current()->Object_klass())) {
3536 // Compile::find_alias_type() cast exactness on all types to verify
3537 // that it does not affect alias type.
3538 _is_ptr_to_narrowoop = UseCompressedOops;
3539 } else {
3540 // Type for the copy start in LibraryCallKit::inline_native_clone().
3541 _is_ptr_to_narrowoop = UseCompressedOops;
3542 }
3543 }
3544 }
3545 }
3546 }
3547 #endif
3548 }
3549
3550 //------------------------------make-------------------------------------------
3551 const TypeOopPtr *TypeOopPtr::make(PTR ptr, int offset, int instance_id,
3552 const TypePtr* speculative, int inline_depth) {
3553 assert(ptr != Constant, "no constant generic pointers");
3554 ciKlass* k = Compile::current()->env()->Object_klass();
3555 bool xk = false;
3556 ciObject* o = nullptr;
3557 const TypeInterfaces* interfaces = TypeInterfaces::make();
3558 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, instance_id, speculative, inline_depth))->hashcons();
3559 }
3560
3561
3562 //------------------------------cast_to_ptr_type-------------------------------
3563 const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
3564 assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
3565 if( ptr == _ptr ) return this;
3566 return make(ptr, _offset, _instance_id, _speculative, _inline_depth);
3567 }
3568
3569 //-----------------------------cast_to_instance_id----------------------------
3570 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
3571 // There are no instances of a general oop.
3572 // Return self unchanged.
3573 return this;
3574 }
3575
3576 //-----------------------------cast_to_exactness-------------------------------
3577 const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
3578 // There is no such thing as an exact general oop.
3579 // Return self unchanged.
3580 return this;
3581 }
3582
3583
3584 //------------------------------as_klass_type----------------------------------
3585 // Return the klass type corresponding to this instance or array type.
3586 // It is the type that is loaded from an object of this type.
3587 const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const {
3588 ShouldNotReachHere();
3589 return nullptr;
3590 }
3591
3592 //------------------------------meet-------------------------------------------
3593 // Compute the MEET of two types. It returns a new Type object.
3594 const Type *TypeOopPtr::xmeet_helper(const Type *t) const {
3595 // Perform a fast test for common case; meeting the same types together.
3596 if( this == t ) return this; // Meeting same type-rep?
3597
3598 // Current "this->_base" is OopPtr
3599 switch (t->base()) { // switch on original type
3600
3601 case Int: // Mixing ints & oops happens when javac
3602 case Long: // reuses local variables
3603 case HalfFloatTop:
3612 case NarrowOop:
3613 case NarrowKlass:
3614 case Bottom: // Ye Olde Default
3615 return Type::BOTTOM;
3616 case Top:
3617 return this;
3618
3619 default: // All else is a mistake
3620 typerr(t);
3621
3622 case RawPtr:
3623 case MetadataPtr:
3624 case KlassPtr:
3625 case InstKlassPtr:
3626 case AryKlassPtr:
3627 return TypePtr::BOTTOM; // Oop meet raw is not well defined
3628
3629 case AnyPtr: {
3630 // Found an AnyPtr type vs self-OopPtr type
3631 const TypePtr *tp = t->is_ptr();
3632 int offset = meet_offset(tp->offset());
3633 PTR ptr = meet_ptr(tp->ptr());
3634 const TypePtr* speculative = xmeet_speculative(tp);
3635 int depth = meet_inline_depth(tp->inline_depth());
3636 switch (tp->ptr()) {
3637 case Null:
3638 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3639 // else fall through:
3640 case TopPTR:
3641 case AnyNull: {
3642 int instance_id = meet_instance_id(InstanceTop);
3643 return make(ptr, offset, instance_id, speculative, depth);
3644 }
3645 case BotPTR:
3646 case NotNull:
3647 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3648 default: typerr(t);
3649 }
3650 }
3651
3652 case OopPtr: { // Meeting to other OopPtrs
3654 int instance_id = meet_instance_id(tp->instance_id());
3655 const TypePtr* speculative = xmeet_speculative(tp);
3656 int depth = meet_inline_depth(tp->inline_depth());
3657 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth);
3658 }
3659
3660 case InstPtr: // For these, flip the call around to cut down
3661 case AryPtr:
3662 return t->xmeet(this); // Call in reverse direction
3663
3664 } // End of switch
3665 return this; // Return the double constant
3666 }
3667
3668
3669 //------------------------------xdual------------------------------------------
3670 // Dual of a pure heap pointer. No relevant klass or oop information.
3671 const Type *TypeOopPtr::xdual() const {
3672 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here");
3673 assert(const_oop() == nullptr, "no constants here");
3674 return new TypeOopPtr(_base, dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
3675 }
3676
3677 //--------------------------make_from_klass_common-----------------------------
3678 // Computes the element-type given a klass.
3679 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass* klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) {
3680 if (klass->is_instance_klass()) {
3681 Compile* C = Compile::current();
3682 Dependencies* deps = C->dependencies();
3683 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
3684 // Element is an instance
3685 bool klass_is_exact = false;
3686 if (klass->is_loaded()) {
3687 // Try to set klass_is_exact.
3688 ciInstanceKlass* ik = klass->as_instance_klass();
3689 klass_is_exact = ik->is_final();
3690 if (!klass_is_exact && klass_change
3691 && deps != nullptr && UseUniqueSubclasses) {
3692 ciInstanceKlass* sub = ik->unique_concrete_subklass();
3693 if (sub != nullptr) {
3694 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
3695 klass = ik = sub;
3696 klass_is_exact = sub->is_final();
3697 }
3698 }
3699 if (!klass_is_exact && try_for_exact && deps != nullptr &&
3700 !ik->is_interface() && !ik->has_subklass()) {
3701 // Add a dependence; if concrete subclass added we need to recompile
3702 deps->assert_leaf_type(ik);
3703 klass_is_exact = true;
3704 }
3705 }
3706 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
3707 return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, 0);
3708 } else if (klass->is_obj_array_klass()) {
3709 // Element is an object array. Recursively call ourself.
3710 ciKlass* eklass = klass->as_obj_array_klass()->element_klass();
3711 const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(eklass, false, try_for_exact, interface_handling);
3712 bool xk = etype->klass_is_exact();
3713 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
3714 // We used to pass NotNull in here, asserting that the sub-arrays
3715 // are all not-null. This is not true in generally, as code can
3716 // slam nulls down in the subarrays.
3717 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, 0);
3718 return arr;
3719 } else if (klass->is_type_array_klass()) {
3720 // Element is an typeArray
3721 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
3722 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
3723 // We used to pass NotNull in here, asserting that the array pointer
3724 // is not-null. That was not true in general.
3725 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0);
3726 return arr;
3727 } else {
3728 ShouldNotReachHere();
3729 return nullptr;
3730 }
3731 }
3732
3733 //------------------------------make_from_constant-----------------------------
3734 // Make a java pointer from an oop constant
3735 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) {
3736 assert(!o->is_null_object(), "null object not yet handled here.");
3737
3738 const bool make_constant = require_constant || o->should_be_constant();
3739
3740 ciKlass* klass = o->klass();
3741 if (klass->is_instance_klass()) {
3742 // Element is an instance
3743 if (make_constant) {
3744 return TypeInstPtr::make(o);
3745 } else {
3746 return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, 0);
3747 }
3748 } else if (klass->is_obj_array_klass()) {
3749 // Element is an object array. Recursively call ourself.
3750 const TypeOopPtr *etype =
3751 TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass(), trust_interfaces);
3752 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
3753 // We used to pass NotNull in here, asserting that the sub-arrays
3754 // are all not-null. This is not true in generally, as code can
3755 // slam nulls down in the subarrays.
3756 if (make_constant) {
3757 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
3758 } else {
3759 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
3760 }
3761 } else if (klass->is_type_array_klass()) {
3762 // Element is an typeArray
3763 const Type* etype =
3764 (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
3765 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
3766 // We used to pass NotNull in here, asserting that the array pointer
3767 // is not-null. That was not true in general.
3768 if (make_constant) {
3769 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
3770 } else {
3771 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
3772 }
3773 }
3774
3775 fatal("unhandled object type");
3776 return nullptr;
3777 }
3778
3779 //------------------------------get_con----------------------------------------
3780 intptr_t TypeOopPtr::get_con() const {
3781 assert( _ptr == Null || _ptr == Constant, "" );
3782 assert( _offset >= 0, "" );
3783
3784 if (_offset != 0) {
3785 // After being ported to the compiler interface, the compiler no longer
3786 // directly manipulates the addresses of oops. Rather, it only has a pointer
3787 // to a handle at compile time. This handle is embedded in the generated
3788 // code and dereferenced at the time the nmethod is made. Until that time,
3789 // it is not reasonable to do arithmetic with the addresses of oops (we don't
3790 // have access to the addresses!). This does not seem to currently happen,
3791 // but this assertion here is to help prevent its occurrence.
3792 tty->print_cr("Found oop constant with non-zero offset");
3793 ShouldNotReachHere();
3794 }
3795
3796 return (intptr_t)const_oop()->constant_encoding();
3797 }
3798
3799
3800 //-----------------------------filter------------------------------------------
3801 // Do not allow interface-vs.-noninterface joins to collapse to top.
3802 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const {
3803
3804 const Type* ft = join_helper(kills, include_speculative);
3850 dump_speculative(st);
3851 }
3852
3853 void TypeOopPtr::dump_instance_id(outputStream* st) const {
3854 if (_instance_id == InstanceTop) {
3855 st->print(",iid=top");
3856 } else if (_instance_id == InstanceBot) {
3857 st->print(",iid=bot");
3858 } else {
3859 st->print(",iid=%d", _instance_id);
3860 }
3861 }
3862 #endif
3863
3864 //------------------------------singleton--------------------------------------
3865 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3866 // constants
3867 bool TypeOopPtr::singleton(void) const {
3868 // detune optimizer to not generate constant oop + constant offset as a constant!
3869 // TopPTR, Null, AnyNull, Constant are all singletons
3870 return (_offset == 0) && !below_centerline(_ptr);
3871 }
3872
3873 //------------------------------add_offset-------------------------------------
3874 const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const {
3875 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
3876 }
3877
3878 const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const {
3879 return make(_ptr, offset, _instance_id, with_offset_speculative(offset), _inline_depth);
3880 }
3881
3882 /**
3883 * Return same type without a speculative part
3884 */
3885 const TypeOopPtr* TypeOopPtr::remove_speculative() const {
3886 if (_speculative == nullptr) {
3887 return this;
3888 }
3889 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
3890 return make(_ptr, _offset, _instance_id, nullptr, _inline_depth);
3891 }
3892
3893 /**
3894 * Return same type but drop speculative part if we know we won't use
3895 * it
3896 */
3897 const Type* TypeOopPtr::cleanup_speculative() const {
3898 // If the klass is exact and the ptr is not null then there's
3899 // nothing that the speculative type can help us with
3972 const TypeInstPtr *TypeInstPtr::BOTTOM;
3973 const TypeInstPtr *TypeInstPtr::MIRROR;
3974 const TypeInstPtr *TypeInstPtr::MARK;
3975 const TypeInstPtr *TypeInstPtr::KLASS;
3976
3977 // Is there a single ciKlass* that can represent that type?
3978 ciKlass* TypeInstPtr::exact_klass_helper() const {
3979 if (_interfaces->empty()) {
3980 return _klass;
3981 }
3982 if (_klass != ciEnv::current()->Object_klass()) {
3983 if (_interfaces->eq(_klass->as_instance_klass())) {
3984 return _klass;
3985 }
3986 return nullptr;
3987 }
3988 return _interfaces->exact_klass();
3989 }
3990
3991 //------------------------------TypeInstPtr-------------------------------------
3992 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int off,
3993 int instance_id, const TypePtr* speculative, int inline_depth)
3994 : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, instance_id, speculative, inline_depth) {
3995 assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here");
3996 assert(k != nullptr &&
3997 (k->is_loaded() || o == nullptr),
3998 "cannot have constants with non-loaded klass");
3999 };
4000
4001 //------------------------------make-------------------------------------------
4002 const TypeInstPtr *TypeInstPtr::make(PTR ptr,
4003 ciKlass* k,
4004 const TypeInterfaces* interfaces,
4005 bool xk,
4006 ciObject* o,
4007 int offset,
4008 int instance_id,
4009 const TypePtr* speculative,
4010 int inline_depth) {
4011 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance");
4012 // Either const_oop() is null or else ptr is Constant
4013 assert( (!o && ptr != Constant) || (o && ptr == Constant),
4014 "constant pointers must have a value supplied" );
4015 // Ptr is never Null
4016 assert( ptr != Null, "null pointers are not typed" );
4017
4018 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4019 if (ptr == Constant) {
4020 // Note: This case includes meta-object constants, such as methods.
4021 xk = true;
4022 } else if (k->is_loaded()) {
4023 ciInstanceKlass* ik = k->as_instance_klass();
4024 if (!xk && ik->is_final()) xk = true; // no inexact final klass
4025 assert(!ik->is_interface(), "no interface here");
4026 if (xk && ik->is_interface()) xk = false; // no exact interface
4027 }
4028
4029 // Now hash this baby
4030 TypeInstPtr *result =
4031 (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons();
4032
4033 return result;
4034 }
4035
4036 const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) {
4037 if (k->is_instance_klass()) {
4038 if (k->is_loaded()) {
4039 if (k->is_interface() && interface_handling == ignore_interfaces) {
4040 assert(interface, "no interface expected");
4041 k = ciEnv::current()->Object_klass();
4042 const TypeInterfaces* interfaces = TypeInterfaces::make();
4043 return interfaces;
4044 }
4045 GrowableArray<ciInstanceKlass *>* k_interfaces = k->as_instance_klass()->transitive_interfaces();
4046 const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces);
4047 if (k->is_interface()) {
4048 assert(interface, "no interface expected");
4049 k = ciEnv::current()->Object_klass();
4050 } else {
4051 assert(klass, "no instance klass expected");
4077 switch (bt) {
4078 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
4079 case T_INT: return TypeInt::make(constant.as_int());
4080 case T_CHAR: return TypeInt::make(constant.as_char());
4081 case T_BYTE: return TypeInt::make(constant.as_byte());
4082 case T_SHORT: return TypeInt::make(constant.as_short());
4083 case T_FLOAT: return TypeF::make(constant.as_float());
4084 case T_DOUBLE: return TypeD::make(constant.as_double());
4085 case T_LONG: return TypeLong::make(constant.as_long());
4086 default: break;
4087 }
4088 fatal("Invalid boxed value type '%s'", type2name(bt));
4089 return nullptr;
4090 }
4091
4092 //------------------------------cast_to_ptr_type-------------------------------
4093 const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
4094 if( ptr == _ptr ) return this;
4095 // Reconstruct _sig info here since not a problem with later lazy
4096 // construction, _sig will show up on demand.
4097 return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _instance_id, _speculative, _inline_depth);
4098 }
4099
4100
4101 //-----------------------------cast_to_exactness-------------------------------
4102 const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
4103 if( klass_is_exact == _klass_is_exact ) return this;
4104 if (!_klass->is_loaded()) return this;
4105 ciInstanceKlass* ik = _klass->as_instance_klass();
4106 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
4107 assert(!ik->is_interface(), "no interface here");
4108 return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth);
4109 }
4110
4111 //-----------------------------cast_to_instance_id----------------------------
4112 const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const {
4113 if( instance_id == _instance_id ) return this;
4114 return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth);
4115 }
4116
4117 //------------------------------xmeet_unloaded---------------------------------
4118 // Compute the MEET of two InstPtrs when at least one is unloaded.
4119 // Assume classes are different since called after check for same name/class-loader
4120 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const {
4121 int off = meet_offset(tinst->offset());
4122 PTR ptr = meet_ptr(tinst->ptr());
4123 int instance_id = meet_instance_id(tinst->instance_id());
4124 const TypePtr* speculative = xmeet_speculative(tinst);
4125 int depth = meet_inline_depth(tinst->inline_depth());
4126
4127 const TypeInstPtr *loaded = is_loaded() ? this : tinst;
4128 const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
4129 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
4130 //
4131 // Meet unloaded class with java/lang/Object
4132 //
4133 // Meet
4134 // | Unloaded Class
4135 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
4136 // ===================================================================
4137 // TOP | ..........................Unloaded......................|
4138 // AnyNull | U-AN |................Unloaded......................|
4139 // Constant | ... O-NN .................................. | O-BOT |
4140 // NotNull | ... O-NN .................................. | O-BOT |
4141 // BOTTOM | ........................Object-BOTTOM ..................|
4142 //
4143 assert(loaded->ptr() != TypePtr::Null, "insanity check");
4144 //
4145 if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4146 else if (loaded->ptr() == TypePtr::AnyNull) { return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, instance_id, speculative, depth); }
4147 else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4148 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
4149 if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4150 else { return TypeInstPtr::NOTNULL->with_speculative(speculative); }
4151 }
4152 else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4153
4154 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative);
4155 }
4156
4157 // Both are unloaded, not the same class, not Object
4158 // Or meet unloaded with a different loaded class, not java/lang/Object
4159 if (ptr != TypePtr::BotPTR) {
4160 return TypeInstPtr::NOTNULL->with_speculative(speculative);
4161 }
4162 return TypeInstPtr::BOTTOM->with_speculative(speculative);
4163 }
4164
4165
4166 //------------------------------meet-------------------------------------------
4190 case Top:
4191 return this;
4192
4193 default: // All else is a mistake
4194 typerr(t);
4195
4196 case MetadataPtr:
4197 case KlassPtr:
4198 case InstKlassPtr:
4199 case AryKlassPtr:
4200 case RawPtr: return TypePtr::BOTTOM;
4201
4202 case AryPtr: { // All arrays inherit from Object class
4203 // Call in reverse direction to avoid duplication
4204 return t->is_aryptr()->xmeet_helper(this);
4205 }
4206
4207 case OopPtr: { // Meeting to OopPtrs
4208 // Found a OopPtr type vs self-InstPtr type
4209 const TypeOopPtr *tp = t->is_oopptr();
4210 int offset = meet_offset(tp->offset());
4211 PTR ptr = meet_ptr(tp->ptr());
4212 switch (tp->ptr()) {
4213 case TopPTR:
4214 case AnyNull: {
4215 int instance_id = meet_instance_id(InstanceTop);
4216 const TypePtr* speculative = xmeet_speculative(tp);
4217 int depth = meet_inline_depth(tp->inline_depth());
4218 return make(ptr, klass(), _interfaces, klass_is_exact(),
4219 (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth);
4220 }
4221 case NotNull:
4222 case BotPTR: {
4223 int instance_id = meet_instance_id(tp->instance_id());
4224 const TypePtr* speculative = xmeet_speculative(tp);
4225 int depth = meet_inline_depth(tp->inline_depth());
4226 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4227 }
4228 default: typerr(t);
4229 }
4230 }
4231
4232 case AnyPtr: { // Meeting to AnyPtrs
4233 // Found an AnyPtr type vs self-InstPtr type
4234 const TypePtr *tp = t->is_ptr();
4235 int offset = meet_offset(tp->offset());
4236 PTR ptr = meet_ptr(tp->ptr());
4237 int instance_id = meet_instance_id(InstanceTop);
4238 const TypePtr* speculative = xmeet_speculative(tp);
4239 int depth = meet_inline_depth(tp->inline_depth());
4240 switch (tp->ptr()) {
4241 case Null:
4242 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4243 // else fall through to AnyNull
4244 case TopPTR:
4245 case AnyNull: {
4246 return make(ptr, klass(), _interfaces, klass_is_exact(),
4247 (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth);
4248 }
4249 case NotNull:
4250 case BotPTR:
4251 return TypePtr::make(AnyPtr, ptr, offset, speculative,depth);
4252 default: typerr(t);
4253 }
4254 }
4255
4256 /*
4257 A-top }
4258 / | \ } Tops
4259 B-top A-any C-top }
4260 | / | \ | } Any-nulls
4261 B-any | C-any }
4262 | | |
4263 B-con A-con C-con } constants; not comparable across classes
4264 | | |
4265 B-not | C-not }
4266 | \ | / | } not-nulls
4267 B-bot A-not C-bot }
4268 \ | / } Bottoms
4269 A-bot }
4270 */
4271
4272 case InstPtr: { // Meeting 2 Oops?
4273 // Found an InstPtr sub-type vs self-InstPtr type
4274 const TypeInstPtr *tinst = t->is_instptr();
4275 int off = meet_offset(tinst->offset());
4276 PTR ptr = meet_ptr(tinst->ptr());
4277 int instance_id = meet_instance_id(tinst->instance_id());
4278 const TypePtr* speculative = xmeet_speculative(tinst);
4279 int depth = meet_inline_depth(tinst->inline_depth());
4280 const TypeInterfaces* interfaces = meet_interfaces(tinst);
4281
4282 ciKlass* tinst_klass = tinst->klass();
4283 ciKlass* this_klass = klass();
4284
4285 ciKlass* res_klass = nullptr;
4286 bool res_xk = false;
4287 const Type* res;
4288 MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk);
4289
4290 if (kind == UNLOADED) {
4291 // One of these classes has not been loaded
4292 const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces);
4293 #ifndef PRODUCT
4294 if (PrintOpto && Verbose) {
4295 tty->print("meet of unloaded classes resulted in: ");
4296 unloaded_meet->dump();
4297 tty->cr();
4298 tty->print(" this == ");
4299 dump();
4300 tty->cr();
4301 tty->print(" tinst == ");
4302 tinst->dump();
4303 tty->cr();
4304 }
4305 #endif
4306 res = unloaded_meet;
4307 } else {
4308 if (kind == NOT_SUBTYPE && instance_id > 0) {
4309 instance_id = InstanceBot;
4310 } else if (kind == LCA) {
4311 instance_id = InstanceBot;
4312 }
4313 ciObject* o = nullptr; // Assume not constant when done
4314 ciObject* this_oop = const_oop();
4315 ciObject* tinst_oop = tinst->const_oop();
4316 if (ptr == Constant) {
4317 if (this_oop != nullptr && tinst_oop != nullptr &&
4318 this_oop->equals(tinst_oop))
4319 o = this_oop;
4320 else if (above_centerline(_ptr)) {
4321 assert(!tinst_klass->is_interface(), "");
4322 o = tinst_oop;
4323 } else if (above_centerline(tinst->_ptr)) {
4324 assert(!this_klass->is_interface(), "");
4325 o = this_oop;
4326 } else
4327 ptr = NotNull;
4328 }
4329 res = make(ptr, res_klass, interfaces, res_xk, o, off, instance_id, speculative, depth);
4330 }
4331
4332 return res;
4333
4334 } // End of case InstPtr
4335
4336 } // End of switch
4337 return this; // Return the double constant
4338 }
4339
4340 template<class T> TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type,
4341 ciKlass*& res_klass, bool& res_xk) {
4342 ciKlass* this_klass = this_type->klass();
4343 ciKlass* other_klass = other_type->klass();
4344 bool this_xk = this_type->klass_is_exact();
4345 bool other_xk = other_type->klass_is_exact();
4346 PTR this_ptr = this_type->ptr();
4347 PTR other_ptr = other_type->ptr();
4348 const TypeInterfaces* this_interfaces = this_type->interfaces();
4349 const TypeInterfaces* other_interfaces = other_type->interfaces();
4350 // Check for easy case; klasses are equal (and perhaps not loaded!)
4351 // If we have constants, then we created oops so classes are loaded
4352 // and we can handle the constants further down. This case handles
4353 // both-not-loaded or both-loaded classes
4354 if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) {
4355 res_klass = this_klass;
4356 res_xk = this_xk;
4357 return QUICK;
4358 }
4359
4360 // Classes require inspection in the Java klass hierarchy. Must be loaded.
4361 if (!other_klass->is_loaded() || !this_klass->is_loaded()) {
4362 return UNLOADED;
4363 }
4369 // If both are up and they do NOT subtype, "fall hard".
4370 // If both are down and they subtype, take the supertype class.
4371 // If both are down and they do NOT subtype, "fall hard".
4372 // Constants treated as down.
4373
4374 // Now, reorder the above list; observe that both-down+subtype is also
4375 // "fall hard"; "fall hard" becomes the default case:
4376 // If we split one up & one down AND they subtype, take the down man.
4377 // If both are up and they subtype, take the subtype class.
4378
4379 // If both are down and they subtype, "fall hard".
4380 // If both are down and they do NOT subtype, "fall hard".
4381 // If both are up and they do NOT subtype, "fall hard".
4382 // If we split one up & one down AND they do NOT subtype, "fall hard".
4383
4384 // If a proper subtype is exact, and we return it, we return it exactly.
4385 // If a proper supertype is exact, there can be no subtyping relationship!
4386 // If both types are equal to the subtype, exactness is and-ed below the
4387 // centerline and or-ed above it. (N.B. Constants are always exact.)
4388
4389 // Check for subtyping:
4390 const T* subtype = nullptr;
4391 bool subtype_exact = false;
4392 if (this_type->is_same_java_type_as(other_type)) {
4393 subtype = this_type;
4394 subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk);
4395 } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) {
4396 subtype = this_type; // Pick subtyping class
4397 subtype_exact = this_xk;
4398 } else if(!this_xk && other_type->is_meet_subtype_of(this_type)) {
4399 subtype = other_type; // Pick subtyping class
4400 subtype_exact = other_xk;
4401 }
4402
4403 if (subtype) {
4404 if (above_centerline(ptr)) { // both are up?
4405 this_type = other_type = subtype;
4406 this_xk = other_xk = subtype_exact;
4407 } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) {
4408 this_type = other_type; // tinst is down; keep down man
4409 this_xk = other_xk;
4410 } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) {
4411 other_type = this_type; // this is down; keep down man
4412 other_xk = this_xk;
4413 } else {
4414 this_xk = subtype_exact; // either they are equal, or we'll do an LCA
4415 }
4416 }
4417
4418 // Check for classes now being equal
4419 if (this_type->is_same_java_type_as(other_type)) {
4420 // If the klasses are equal, the constants may still differ. Fall to
4421 // NotNull if they do (neither constant is null; that is a special case
4422 // handled elsewhere).
4423 res_klass = this_type->klass();
4424 res_xk = this_xk;
4425 return SUBTYPE;
4426 } // Else classes are not equal
4427
4428 // Since klasses are different, we require a LCA in the Java
4429 // class hierarchy - which means we have to fall to at least NotNull.
4430 if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) {
4431 ptr = NotNull;
4432 }
4433
4434 interfaces = this_interfaces->intersection_with(other_interfaces);
4435
4436 // Now we find the LCA of Java classes
4437 ciKlass* k = this_klass->least_common_ancestor(other_klass);
4438
4439 res_klass = k;
4440 res_xk = false;
4441
4442 return LCA;
4443 }
4444
4445 //------------------------java_mirror_type--------------------------------------
4446 ciType* TypeInstPtr::java_mirror_type() const {
4447 // must be a singleton type
4448 if( const_oop() == nullptr ) return nullptr;
4449
4450 // must be of type java.lang.Class
4451 if( klass() != ciEnv::current()->Class_klass() ) return nullptr;
4452
4453 return const_oop()->as_instance()->java_mirror_type();
4454 }
4455
4456
4457 //------------------------------xdual------------------------------------------
4458 // Dual: do NOT dual on klasses. This means I do NOT understand the Java
4459 // inheritance mechanism.
4460 const Type *TypeInstPtr::xdual() const {
4461 return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
4462 }
4463
4464 //------------------------------eq---------------------------------------------
4465 // Structural equality check for Type representations
4466 bool TypeInstPtr::eq( const Type *t ) const {
4467 const TypeInstPtr *p = t->is_instptr();
4468 return
4469 klass()->equals(p->klass()) &&
4470 _interfaces->eq(p->_interfaces) &&
4471 TypeOopPtr::eq(p); // Check sub-type stuff
4472 }
4473
4474 //------------------------------hash-------------------------------------------
4475 // Type-specific hashing function.
4476 uint TypeInstPtr::hash(void) const {
4477 return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash();
4478 }
4479
4480 bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4481 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4482 }
4483
4484
4485 bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4486 return TypePtr::is_same_java_type_as_helper_for_instance(this, other);
4487 }
4488
4489 bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4490 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4491 }
4492
4493
4494 //------------------------------dump2------------------------------------------
4495 // Dump oop Type
4496 #ifndef PRODUCT
4497 void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const {
4501 _interfaces->dump(st);
4502
4503 if (_ptr == Constant && (WizardMode || Verbose)) {
4504 ResourceMark rm;
4505 stringStream ss;
4506
4507 st->print(" ");
4508 const_oop()->print_oop(&ss);
4509 // 'const_oop->print_oop()' may emit newlines('\n') into ss.
4510 // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node.
4511 char* buf = ss.as_string(/* c_heap= */false);
4512 StringUtils::replace_no_expand(buf, "\n", "");
4513 st->print_raw(buf);
4514 }
4515
4516 st->print(":%s", ptr_msg[_ptr]);
4517 if (_klass_is_exact) {
4518 st->print(":exact");
4519 }
4520
4521 dump_offset(st);
4522 dump_instance_id(st);
4523 dump_inline_depth(st);
4524 dump_speculative(st);
4525 }
4526 #endif
4527
4528 //------------------------------add_offset-------------------------------------
4529 const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const {
4530 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset),
4531 _instance_id, add_offset_speculative(offset), _inline_depth);
4532 }
4533
4534 const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const {
4535 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), offset,
4536 _instance_id, with_offset_speculative(offset), _inline_depth);
4537 }
4538
4539 const TypeInstPtr* TypeInstPtr::remove_speculative() const {
4540 if (_speculative == nullptr) {
4541 return this;
4542 }
4543 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4544 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset,
4545 _instance_id, nullptr, _inline_depth);
4546 }
4547
4548 const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const {
4549 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, speculative, _inline_depth);
4550 }
4551
4552 const TypePtr* TypeInstPtr::with_inline_depth(int depth) const {
4553 if (!UseInlineDepthForSpeculativeTypes) {
4554 return this;
4555 }
4556 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth);
4557 }
4558
4559 const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const {
4560 assert(is_known_instance(), "should be known");
4561 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, instance_id, _speculative, _inline_depth);
4562 }
4563
4564 const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const {
4565 bool xk = klass_is_exact();
4566 ciInstanceKlass* ik = klass()->as_instance_klass();
4567 if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) {
4568 if (_interfaces->eq(ik)) {
4569 Compile* C = Compile::current();
4570 Dependencies* deps = C->dependencies();
4571 deps->assert_leaf_type(ik);
4572 xk = true;
4573 }
4574 }
4575 return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, 0);
4576 }
4577
4578 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) {
4579 static_assert(std::is_base_of<T2, T1>::value, "");
4580
4581 if (!this_one->is_instance_type(other)) {
4582 return false;
4583 }
4584
4585 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4586 return true;
4587 }
4588
4589 return this_one->klass()->is_subtype_of(other->klass()) &&
4590 (!this_xk || this_one->_interfaces->contains(other->_interfaces));
4591 }
4592
4593
4594 bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4595 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4600 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4601 return true;
4602 }
4603
4604 if (this_one->is_instance_type(other)) {
4605 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces);
4606 }
4607
4608 int dummy;
4609 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
4610 if (this_top_or_bottom) {
4611 return false;
4612 }
4613
4614 const T1* other_ary = this_one->is_array_type(other);
4615 const TypePtr* other_elem = other_ary->elem()->make_ptr();
4616 const TypePtr* this_elem = this_one->elem()->make_ptr();
4617 if (other_elem != nullptr && this_elem != nullptr) {
4618 return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk);
4619 }
4620
4621 if (other_elem == nullptr && this_elem == nullptr) {
4622 return this_one->klass()->is_subtype_of(other->klass());
4623 }
4624
4625 return false;
4626 }
4627
4628 bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4629 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4630 }
4631
4632 bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4633 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4634 }
4635
4636 bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4637 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4638 }
4639
4640 //=============================================================================
4641 // Convenience common pre-built types.
4642 const TypeAryPtr* TypeAryPtr::BOTTOM;
4643 const TypeAryPtr* TypeAryPtr::RANGE;
4644 const TypeAryPtr* TypeAryPtr::OOPS;
4645 const TypeAryPtr* TypeAryPtr::NARROWOOPS;
4646 const TypeAryPtr* TypeAryPtr::BYTES;
4647 const TypeAryPtr* TypeAryPtr::SHORTS;
4648 const TypeAryPtr* TypeAryPtr::CHARS;
4649 const TypeAryPtr* TypeAryPtr::INTS;
4650 const TypeAryPtr* TypeAryPtr::LONGS;
4651 const TypeAryPtr* TypeAryPtr::FLOATS;
4652 const TypeAryPtr* TypeAryPtr::DOUBLES;
4653
4654 //------------------------------make-------------------------------------------
4655 const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset,
4656 int instance_id, const TypePtr* speculative, int inline_depth) {
4657 assert(!(k == nullptr && ary->_elem->isa_int()),
4658 "integral arrays must be pre-equipped with a class");
4659 if (!xk) xk = ary->ary_must_be_exact();
4660 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4661 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
4662 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
4663 k = nullptr;
4664 }
4665 return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons();
4666 }
4667
4668 //------------------------------make-------------------------------------------
4669 const TypeAryPtr *TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset,
4670 int instance_id, const TypePtr* speculative, int inline_depth,
4671 bool is_autobox_cache) {
4672 assert(!(k == nullptr && ary->_elem->isa_int()),
4673 "integral arrays must be pre-equipped with a class");
4674 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
4675 if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact();
4676 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4677 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
4678 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
4679 k = nullptr;
4680 }
4681 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons();
4682 }
4683
4684 //------------------------------cast_to_ptr_type-------------------------------
4685 const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
4686 if( ptr == _ptr ) return this;
4687 return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4688 }
4689
4690
4691 //-----------------------------cast_to_exactness-------------------------------
4692 const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
4693 if( klass_is_exact == _klass_is_exact ) return this;
4694 if (_ary->ary_must_be_exact()) return this; // cannot clear xk
4695 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
4696 }
4697
4698 //-----------------------------cast_to_instance_id----------------------------
4699 const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const {
4700 if( instance_id == _instance_id ) return this;
4701 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
4702 }
4703
4704
4705 //-----------------------------max_array_length-------------------------------
4706 // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization.
4707 jint TypeAryPtr::max_array_length(BasicType etype) {
4708 if (!is_java_primitive(etype) && !::is_reference_type(etype)) {
4709 if (etype == T_NARROWOOP) {
4710 etype = T_OBJECT;
4711 } else if (etype == T_ILLEGAL) { // bottom[]
4712 etype = T_BYTE; // will produce conservatively high value
4713 } else {
4714 fatal("not an element type: %s", type2name(etype));
4715 }
4716 }
4717 return arrayOopDesc::max_array_length(etype);
4718 }
4719
4720 //-----------------------------narrow_size_type-------------------------------
4721 // Narrow the given size type to the index range for the given array base type.
4739 if (size->is_con()) {
4740 lo = hi;
4741 }
4742 chg = true;
4743 }
4744 // Negative length arrays will produce weird intermediate dead fast-path code
4745 if (lo > hi) {
4746 return TypeInt::ZERO;
4747 }
4748 if (!chg) {
4749 return size;
4750 }
4751 return TypeInt::make(lo, hi, Type::WidenMin);
4752 }
4753
4754 //-------------------------------cast_to_size----------------------------------
4755 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
4756 assert(new_size != nullptr, "");
4757 new_size = narrow_size_type(new_size);
4758 if (new_size == size()) return this;
4759 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable());
4760 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4761 }
4762
4763 //------------------------------cast_to_stable---------------------------------
4764 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const {
4765 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable()))
4766 return this;
4767
4768 const Type* elem = this->elem();
4769 const TypePtr* elem_ptr = elem->make_ptr();
4770
4771 if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) {
4772 // If this is widened from a narrow oop, TypeAry::make will re-narrow it.
4773 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1);
4774 }
4775
4776 const TypeAry* new_ary = TypeAry::make(elem, size(), stable);
4777
4778 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4779 }
4780
4781 //-----------------------------stable_dimension--------------------------------
4782 int TypeAryPtr::stable_dimension() const {
4783 if (!is_stable()) return 0;
4784 int dim = 1;
4785 const TypePtr* elem_ptr = elem()->make_ptr();
4786 if (elem_ptr != nullptr && elem_ptr->isa_aryptr())
4787 dim += elem_ptr->is_aryptr()->stable_dimension();
4788 return dim;
4789 }
4790
4791 //----------------------cast_to_autobox_cache-----------------------------------
4792 const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const {
4793 if (is_autobox_cache()) return this;
4794 const TypeOopPtr* etype = elem()->make_oopptr();
4795 if (etype == nullptr) return this;
4796 // The pointers in the autobox arrays are always non-null.
4797 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
4798 const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable());
4799 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true);
4800 }
4801
4802 //------------------------------eq---------------------------------------------
4803 // Structural equality check for Type representations
4804 bool TypeAryPtr::eq( const Type *t ) const {
4805 const TypeAryPtr *p = t->is_aryptr();
4806 return
4807 _ary == p->_ary && // Check array
4808 TypeOopPtr::eq(p); // Check sub-parts
4809 }
4810
4811 //------------------------------hash-------------------------------------------
4812 // Type-specific hashing function.
4813 uint TypeAryPtr::hash(void) const {
4814 return (uint)(uintptr_t)_ary + TypeOopPtr::hash();
4815 }
4816
4817 bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4818 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
4819 }
4820
4821 bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4822 return TypePtr::is_same_java_type_as_helper_for_array(this, other);
4823 }
4824
4825 bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4826 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
4827 }
4828 //------------------------------meet-------------------------------------------
4829 // Compute the MEET of two types. It returns a new Type object.
4830 const Type *TypeAryPtr::xmeet_helper(const Type *t) const {
4831 // Perform a fast test for common case; meeting the same types together.
4832 if( this == t ) return this; // Meeting same type-rep?
4833 // Current "this->_base" is Pointer
4834 switch (t->base()) { // switch on original type
4841 case HalfFloatBot:
4842 case FloatTop:
4843 case FloatCon:
4844 case FloatBot:
4845 case DoubleTop:
4846 case DoubleCon:
4847 case DoubleBot:
4848 case NarrowOop:
4849 case NarrowKlass:
4850 case Bottom: // Ye Olde Default
4851 return Type::BOTTOM;
4852 case Top:
4853 return this;
4854
4855 default: // All else is a mistake
4856 typerr(t);
4857
4858 case OopPtr: { // Meeting to OopPtrs
4859 // Found a OopPtr type vs self-AryPtr type
4860 const TypeOopPtr *tp = t->is_oopptr();
4861 int offset = meet_offset(tp->offset());
4862 PTR ptr = meet_ptr(tp->ptr());
4863 int depth = meet_inline_depth(tp->inline_depth());
4864 const TypePtr* speculative = xmeet_speculative(tp);
4865 switch (tp->ptr()) {
4866 case TopPTR:
4867 case AnyNull: {
4868 int instance_id = meet_instance_id(InstanceTop);
4869 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4870 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4871 }
4872 case BotPTR:
4873 case NotNull: {
4874 int instance_id = meet_instance_id(tp->instance_id());
4875 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4876 }
4877 default: ShouldNotReachHere();
4878 }
4879 }
4880
4881 case AnyPtr: { // Meeting two AnyPtrs
4882 // Found an AnyPtr type vs self-AryPtr type
4883 const TypePtr *tp = t->is_ptr();
4884 int offset = meet_offset(tp->offset());
4885 PTR ptr = meet_ptr(tp->ptr());
4886 const TypePtr* speculative = xmeet_speculative(tp);
4887 int depth = meet_inline_depth(tp->inline_depth());
4888 switch (tp->ptr()) {
4889 case TopPTR:
4890 return this;
4891 case BotPTR:
4892 case NotNull:
4893 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4894 case Null:
4895 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4896 // else fall through to AnyNull
4897 case AnyNull: {
4898 int instance_id = meet_instance_id(InstanceTop);
4899 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4900 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4901 }
4902 default: ShouldNotReachHere();
4903 }
4904 }
4905
4906 case MetadataPtr:
4907 case KlassPtr:
4908 case InstKlassPtr:
4909 case AryKlassPtr:
4910 case RawPtr: return TypePtr::BOTTOM;
4911
4912 case AryPtr: { // Meeting 2 references?
4913 const TypeAryPtr *tap = t->is_aryptr();
4914 int off = meet_offset(tap->offset());
4915 const Type* tm = _ary->meet_speculative(tap->_ary);
4916 const TypeAry* tary = tm->isa_ary();
4917 if (tary == nullptr) {
4918 assert(tm == Type::TOP || tm == Type::BOTTOM, "");
4919 return tm;
4920 }
4921 PTR ptr = meet_ptr(tap->ptr());
4922 int instance_id = meet_instance_id(tap->instance_id());
4923 const TypePtr* speculative = xmeet_speculative(tap);
4924 int depth = meet_inline_depth(tap->inline_depth());
4925
4926 ciKlass* res_klass = nullptr;
4927 bool res_xk = false;
4928 const Type* elem = tary->_elem;
4929 if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk) == NOT_SUBTYPE) {
4930 instance_id = InstanceBot;
4931 }
4932
4933 ciObject* o = nullptr; // Assume not constant when done
4934 ciObject* this_oop = const_oop();
4935 ciObject* tap_oop = tap->const_oop();
4936 if (ptr == Constant) {
4937 if (this_oop != nullptr && tap_oop != nullptr &&
4938 this_oop->equals(tap_oop)) {
4939 o = tap_oop;
4940 } else if (above_centerline(_ptr)) {
4941 o = tap_oop;
4942 } else if (above_centerline(tap->_ptr)) {
4943 o = this_oop;
4944 } else {
4945 ptr = NotNull;
4946 }
4947 }
4948 return make(ptr, o, TypeAry::make(elem, tary->_size, tary->_stable), res_klass, res_xk, off, instance_id, speculative, depth);
4949 }
4950
4951 // All arrays inherit from Object class
4952 case InstPtr: {
4953 const TypeInstPtr *tp = t->is_instptr();
4954 int offset = meet_offset(tp->offset());
4955 PTR ptr = meet_ptr(tp->ptr());
4956 int instance_id = meet_instance_id(tp->instance_id());
4957 const TypePtr* speculative = xmeet_speculative(tp);
4958 int depth = meet_inline_depth(tp->inline_depth());
4959 const TypeInterfaces* interfaces = meet_interfaces(tp);
4960 const TypeInterfaces* tp_interfaces = tp->_interfaces;
4961 const TypeInterfaces* this_interfaces = _interfaces;
4962
4963 switch (ptr) {
4964 case TopPTR:
4965 case AnyNull: // Fall 'down' to dual of object klass
4966 // For instances when a subclass meets a superclass we fall
4967 // below the centerline when the superclass is exact. We need to
4968 // do the same here.
4969 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) {
4970 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4971 } else {
4972 // cannot subclass, so the meet has to fall badly below the centerline
4973 ptr = NotNull;
4974 instance_id = InstanceBot;
4975 interfaces = this_interfaces->intersection_with(tp_interfaces);
4976 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr,offset, instance_id, speculative, depth);
4977 }
4978 case Constant:
4979 case NotNull:
4980 case BotPTR: // Fall down to object klass
4981 // LCA is object_klass, but if we subclass from the top we can do better
4982 if (above_centerline(tp->ptr())) {
4983 // If 'tp' is above the centerline and it is Object class
4984 // then we can subclass in the Java class hierarchy.
4985 // For instances when a subclass meets a superclass we fall
4986 // below the centerline when the superclass is exact. We need
4987 // to do the same here.
4988 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) {
4989 // that is, my array type is a subtype of 'tp' klass
4990 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4991 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4992 }
4993 }
4994 // The other case cannot happen, since t cannot be a subtype of an array.
4995 // The meet falls down to Object class below centerline.
4996 if (ptr == Constant) {
4997 ptr = NotNull;
4998 }
4999 if (instance_id > 0) {
5000 instance_id = InstanceBot;
5001 }
5002 interfaces = this_interfaces->intersection_with(tp_interfaces);
5003 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, instance_id, speculative, depth);
5004 default: typerr(t);
5005 }
5006 }
5007 }
5008 return this; // Lint noise
5009 }
5010
5011
5012 template<class T> TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary,
5013 const T* other_ary, ciKlass*& res_klass, bool& res_xk) {
5014 int dummy;
5015 bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM);
5016 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
5017 ciKlass* this_klass = this_ary->klass();
5018 ciKlass* other_klass = other_ary->klass();
5019 bool this_xk = this_ary->klass_is_exact();
5020 bool other_xk = other_ary->klass_is_exact();
5021 PTR this_ptr = this_ary->ptr();
5022 PTR other_ptr = other_ary->ptr();
5023 res_klass = nullptr;
5024 MeetResult result = SUBTYPE;
5025 if (elem->isa_int()) {
5026 // Integral array element types have irrelevant lattice relations.
5027 // It is the klass that determines array layout, not the element type.
5028 if (this_top_or_bottom)
5029 res_klass = other_klass;
5030 else if (other_top_or_bottom || other_klass == this_klass) {
5031 res_klass = this_klass;
5032 } else {
5033 // Something like byte[int+] meets char[int+].
5034 // This must fall to bottom, not (int[-128..65535])[int+].
5035 // instance_id = InstanceBot;
5036 elem = Type::BOTTOM;
5037 result = NOT_SUBTYPE;
5038 if (above_centerline(ptr) || ptr == Constant) {
5039 ptr = NotNull;
5040 res_xk = false;
5041 return NOT_SUBTYPE;
5042 }
5043 }
5044 } else {// Non integral arrays.
5045 // Must fall to bottom if exact klasses in upper lattice
5046 // are not equal or super klass is exact.
5047 if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) &&
5048 // meet with top[] and bottom[] are processed further down:
5049 !this_top_or_bottom && !other_top_or_bottom &&
5050 // both are exact and not equal:
5052 // 'tap' is exact and super or unrelated:
5053 (other_xk && !other_ary->is_meet_subtype_of(this_ary)) ||
5054 // 'this' is exact and super or unrelated:
5055 (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) {
5056 if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) {
5057 elem = Type::BOTTOM;
5058 }
5059 ptr = NotNull;
5060 res_xk = false;
5061 return NOT_SUBTYPE;
5062 }
5063 }
5064
5065 res_xk = false;
5066 switch (other_ptr) {
5067 case AnyNull:
5068 case TopPTR:
5069 // Compute new klass on demand, do not use tap->_klass
5070 if (below_centerline(this_ptr)) {
5071 res_xk = this_xk;
5072 } else {
5073 res_xk = (other_xk || this_xk);
5074 }
5075 return result;
5076 case Constant: {
5077 if (this_ptr == Constant) {
5078 res_xk = true;
5079 } else if(above_centerline(this_ptr)) {
5080 res_xk = true;
5081 } else {
5082 // Only precise for identical arrays
5083 res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom));
5084 }
5085 return result;
5086 }
5087 case NotNull:
5088 case BotPTR:
5089 // Compute new klass on demand, do not use tap->_klass
5090 if (above_centerline(this_ptr)) {
5091 res_xk = other_xk;
5092 } else {
5093 res_xk = (other_xk && this_xk) &&
5094 (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays
5095 }
5096 return result;
5097 default: {
5098 ShouldNotReachHere();
5099 return result;
5100 }
5101 }
5102 return result;
5103 }
5104
5105
5106 //------------------------------xdual------------------------------------------
5107 // Dual: compute field-by-field dual
5108 const Type *TypeAryPtr::xdual() const {
5109 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());
5110 }
5111
5112 //------------------------------dump2------------------------------------------
5113 #ifndef PRODUCT
5114 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5115 st->print("aryptr:");
5116 _ary->dump2(d, depth, st);
5117 _interfaces->dump(st);
5118
5119 if (_ptr == Constant) {
5120 const_oop()->print(st);
5121 }
5122
5123 st->print(":%s", ptr_msg[_ptr]);
5124 if (_klass_is_exact) {
5125 st->print(":exact");
5126 }
5127
5128 if( _offset != 0 ) {
5129 BasicType basic_elem_type = elem()->basic_type();
5130 int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
5131 if( _offset == OffsetTop ) st->print("+undefined");
5132 else if( _offset == OffsetBot ) st->print("+any");
5133 else if( _offset < header_size ) st->print("+%d", _offset);
5134 else {
5135 if (basic_elem_type == T_ILLEGAL) {
5136 st->print("+any");
5137 } else {
5138 int elem_size = type2aelembytes(basic_elem_type);
5139 st->print("[%d]", (_offset - header_size)/elem_size);
5140 }
5141 }
5142 }
5143
5144 dump_instance_id(st);
5145 dump_inline_depth(st);
5146 dump_speculative(st);
5147 }
5148 #endif
5149
5150 bool TypeAryPtr::empty(void) const {
5151 if (_ary->empty()) return true;
5152 return TypeOopPtr::empty();
5153 }
5154
5155 //------------------------------add_offset-------------------------------------
5156 const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const {
5157 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
5158 }
5159
5160 const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const {
5161 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, offset, _instance_id, with_offset_speculative(offset), _inline_depth);
5162 }
5163
5164 const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const {
5165 return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
5166 }
5167
5168 const TypeAryPtr* TypeAryPtr::remove_speculative() const {
5169 if (_speculative == nullptr) {
5170 return this;
5171 }
5172 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
5173 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, nullptr, _inline_depth);
5174 }
5175
5176 const TypePtr* TypeAryPtr::with_inline_depth(int depth) const {
5177 if (!UseInlineDepthForSpeculativeTypes) {
5178 return this;
5179 }
5180 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth);
5181 }
5182
5183 const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const {
5184 assert(is_known_instance(), "should be known");
5185 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
5186 }
5187
5188 //=============================================================================
5189
5190 //------------------------------hash-------------------------------------------
5191 // Type-specific hashing function.
5192 uint TypeNarrowPtr::hash(void) const {
5193 return _ptrtype->hash() + 7;
5194 }
5195
5196 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton
5197 return _ptrtype->singleton();
5198 }
5199
5200 bool TypeNarrowPtr::empty(void) const {
5201 return _ptrtype->empty();
5202 }
5203
5204 intptr_t TypeNarrowPtr::get_con() const {
5205 return _ptrtype->get_con();
5206 }
5207
5208 bool TypeNarrowPtr::eq( const Type *t ) const {
5209 const TypeNarrowPtr* tc = isa_same_narrowptr(t);
5263 case HalfFloatTop:
5264 case HalfFloatCon:
5265 case HalfFloatBot:
5266 case FloatTop:
5267 case FloatCon:
5268 case FloatBot:
5269 case DoubleTop:
5270 case DoubleCon:
5271 case DoubleBot:
5272 case AnyPtr:
5273 case RawPtr:
5274 case OopPtr:
5275 case InstPtr:
5276 case AryPtr:
5277 case MetadataPtr:
5278 case KlassPtr:
5279 case InstKlassPtr:
5280 case AryKlassPtr:
5281 case NarrowOop:
5282 case NarrowKlass:
5283
5284 case Bottom: // Ye Olde Default
5285 return Type::BOTTOM;
5286 case Top:
5287 return this;
5288
5289 default: // All else is a mistake
5290 typerr(t);
5291
5292 } // End of switch
5293
5294 return this;
5295 }
5296
5297 #ifndef PRODUCT
5298 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
5299 _ptrtype->dump2(d, depth, st);
5300 }
5301 #endif
5302
5303 const TypeNarrowOop *TypeNarrowOop::BOTTOM;
5347 return (one == two) && TypePtr::eq(t);
5348 } else {
5349 return one->equals(two) && TypePtr::eq(t);
5350 }
5351 }
5352
5353 //------------------------------hash-------------------------------------------
5354 // Type-specific hashing function.
5355 uint TypeMetadataPtr::hash(void) const {
5356 return
5357 (metadata() ? metadata()->hash() : 0) +
5358 TypePtr::hash();
5359 }
5360
5361 //------------------------------singleton--------------------------------------
5362 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5363 // constants
5364 bool TypeMetadataPtr::singleton(void) const {
5365 // detune optimizer to not generate constant metadata + constant offset as a constant!
5366 // TopPTR, Null, AnyNull, Constant are all singletons
5367 return (_offset == 0) && !below_centerline(_ptr);
5368 }
5369
5370 //------------------------------add_offset-------------------------------------
5371 const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const {
5372 return make( _ptr, _metadata, xadd_offset(offset));
5373 }
5374
5375 //-----------------------------filter------------------------------------------
5376 // Do not allow interface-vs.-noninterface joins to collapse to top.
5377 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const {
5378 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr();
5379 if (ft == nullptr || ft->empty())
5380 return Type::TOP; // Canonical empty value
5381 return ft;
5382 }
5383
5384 //------------------------------get_con----------------------------------------
5385 intptr_t TypeMetadataPtr::get_con() const {
5386 assert( _ptr == Null || _ptr == Constant, "" );
5387 assert( _offset >= 0, "" );
5388
5389 if (_offset != 0) {
5390 // After being ported to the compiler interface, the compiler no longer
5391 // directly manipulates the addresses of oops. Rather, it only has a pointer
5392 // to a handle at compile time. This handle is embedded in the generated
5393 // code and dereferenced at the time the nmethod is made. Until that time,
5394 // it is not reasonable to do arithmetic with the addresses of oops (we don't
5395 // have access to the addresses!). This does not seem to currently happen,
5396 // but this assertion here is to help prevent its occurrence.
5397 tty->print_cr("Found oop constant with non-zero offset");
5398 ShouldNotReachHere();
5399 }
5400
5401 return (intptr_t)metadata()->constant_encoding();
5402 }
5403
5404 //------------------------------cast_to_ptr_type-------------------------------
5405 const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const {
5406 if( ptr == _ptr ) return this;
5407 return make(ptr, metadata(), _offset);
5408 }
5409
5423 case HalfFloatBot:
5424 case FloatTop:
5425 case FloatCon:
5426 case FloatBot:
5427 case DoubleTop:
5428 case DoubleCon:
5429 case DoubleBot:
5430 case NarrowOop:
5431 case NarrowKlass:
5432 case Bottom: // Ye Olde Default
5433 return Type::BOTTOM;
5434 case Top:
5435 return this;
5436
5437 default: // All else is a mistake
5438 typerr(t);
5439
5440 case AnyPtr: {
5441 // Found an AnyPtr type vs self-OopPtr type
5442 const TypePtr *tp = t->is_ptr();
5443 int offset = meet_offset(tp->offset());
5444 PTR ptr = meet_ptr(tp->ptr());
5445 switch (tp->ptr()) {
5446 case Null:
5447 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5448 // else fall through:
5449 case TopPTR:
5450 case AnyNull: {
5451 return make(ptr, _metadata, offset);
5452 }
5453 case BotPTR:
5454 case NotNull:
5455 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5456 default: typerr(t);
5457 }
5458 }
5459
5460 case RawPtr:
5461 case KlassPtr:
5462 case InstKlassPtr:
5463 case AryKlassPtr:
5464 case OopPtr:
5465 case InstPtr:
5466 case AryPtr:
5467 return TypePtr::BOTTOM; // Oop meet raw is not well defined
5468
5469 case MetadataPtr: {
5470 const TypeMetadataPtr *tp = t->is_metadataptr();
5471 int offset = meet_offset(tp->offset());
5472 PTR tptr = tp->ptr();
5473 PTR ptr = meet_ptr(tptr);
5474 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata();
5475 if (tptr == TopPTR || _ptr == TopPTR ||
5476 metadata()->equals(tp->metadata())) {
5477 return make(ptr, md, offset);
5478 }
5479 // metadata is different
5480 if( ptr == Constant ) { // Cannot be equal constants, so...
5481 if( tptr == Constant && _ptr != Constant) return t;
5482 if( _ptr == Constant && tptr != Constant) return this;
5483 ptr = NotNull; // Fall down in lattice
5484 }
5485 return make(ptr, nullptr, offset);
5486 break;
5487 }
5488 } // End of switch
5489 return this; // Return the double constant
5490 }
5491
5495 const Type *TypeMetadataPtr::xdual() const {
5496 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset());
5497 }
5498
5499 //------------------------------dump2------------------------------------------
5500 #ifndef PRODUCT
5501 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5502 st->print("metadataptr:%s", ptr_msg[_ptr]);
5503 if (metadata() != nullptr) {
5504 st->print(":" INTPTR_FORMAT, p2i(metadata()));
5505 }
5506 dump_offset(st);
5507 }
5508 #endif
5509
5510
5511 //=============================================================================
5512 // Convenience common pre-built type.
5513 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM;
5514
5515 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset):
5516 TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) {
5517 }
5518
5519 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) {
5520 return make(Constant, m, 0);
5521 }
5522 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) {
5523 return make(Constant, m, 0);
5524 }
5525
5526 //------------------------------make-------------------------------------------
5527 // Create a meta data constant
5528 const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) {
5529 assert(m == nullptr || !m->is_klass(), "wrong type");
5530 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons();
5531 }
5532
5533
5534 const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const {
5535 const Type* elem = _ary->_elem;
5536 bool xk = klass_is_exact();
5537 if (elem->make_oopptr() != nullptr) {
5538 elem = elem->make_oopptr()->as_klass_type(try_for_exact);
5539 if (elem->is_klassptr()->klass_is_exact()) {
5540 xk = true;
5541 }
5542 }
5543 return TypeAryKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, elem, klass(), 0);
5544 }
5545
5546 const TypeKlassPtr* TypeKlassPtr::make(ciKlass *klass, InterfaceHandling interface_handling) {
5547 if (klass->is_instance_klass()) {
5548 return TypeInstKlassPtr::make(klass, interface_handling);
5549 }
5550 return TypeAryKlassPtr::make(klass, interface_handling);
5551 }
5552
5553 const TypeKlassPtr* TypeKlassPtr::make(PTR ptr, ciKlass* klass, int offset, InterfaceHandling interface_handling) {
5554 if (klass->is_instance_klass()) {
5555 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
5556 return TypeInstKlassPtr::make(ptr, klass, interfaces, offset);
5557 }
5558 return TypeAryKlassPtr::make(ptr, klass, offset, interface_handling);
5559 }
5560
5561
5562 //------------------------------TypeKlassPtr-----------------------------------
5563 TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, int offset)
5564 : TypePtr(t, ptr, offset), _klass(klass), _interfaces(interfaces) {
5565 assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) ||
5566 klass->is_type_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here");
5567 }
5568
5569 // Is there a single ciKlass* that can represent that type?
5570 ciKlass* TypeKlassPtr::exact_klass_helper() const {
5571 assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface");
5572 if (_interfaces->empty()) {
5573 return _klass;
5574 }
5575 if (_klass != ciEnv::current()->Object_klass()) {
5576 if (_interfaces->eq(_klass->as_instance_klass())) {
5577 return _klass;
5578 }
5579 return nullptr;
5580 }
5581 return _interfaces->exact_klass();
5582 }
5583
5584 //------------------------------eq---------------------------------------------
5585 // Structural equality check for Type representations
5586 bool TypeKlassPtr::eq(const Type *t) const {
5587 const TypeKlassPtr *p = t->is_klassptr();
5588 return
5589 _interfaces->eq(p->_interfaces) &&
5590 TypePtr::eq(p);
5591 }
5592
5593 //------------------------------hash-------------------------------------------
5594 // Type-specific hashing function.
5595 uint TypeKlassPtr::hash(void) const {
5596 return TypePtr::hash() + _interfaces->hash();
5597 }
5598
5599 //------------------------------singleton--------------------------------------
5600 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5601 // constants
5602 bool TypeKlassPtr::singleton(void) const {
5603 // detune optimizer to not generate constant klass + constant offset as a constant!
5604 // TopPTR, Null, AnyNull, Constant are all singletons
5605 return (_offset == 0) && !below_centerline(_ptr);
5606 }
5607
5608 // Do not allow interface-vs.-noninterface joins to collapse to top.
5609 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const {
5610 // logic here mirrors the one from TypeOopPtr::filter. See comments
5611 // there.
5612 const Type* ft = join_helper(kills, include_speculative);
5613
5614 if (ft->empty()) {
5615 return Type::TOP; // Canonical empty value
5616 }
5617
5618 return ft;
5619 }
5620
5621 const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const {
5622 if (above_centerline(_ptr) && above_centerline(other->_ptr)) {
5623 return _interfaces->union_with(other->_interfaces);
5624 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) {
5625 return other->_interfaces;
5626 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) {
5627 return _interfaces;
5628 }
5629 return _interfaces->intersection_with(other->_interfaces);
5630 }
5631
5632 //------------------------------get_con----------------------------------------
5633 intptr_t TypeKlassPtr::get_con() const {
5634 assert( _ptr == Null || _ptr == Constant, "" );
5635 assert( _offset >= 0, "" );
5636
5637 if (_offset != 0) {
5638 // After being ported to the compiler interface, the compiler no longer
5639 // directly manipulates the addresses of oops. Rather, it only has a pointer
5640 // to a handle at compile time. This handle is embedded in the generated
5641 // code and dereferenced at the time the nmethod is made. Until that time,
5642 // it is not reasonable to do arithmetic with the addresses of oops (we don't
5643 // have access to the addresses!). This does not seem to currently happen,
5644 // but this assertion here is to help prevent its occurrence.
5645 tty->print_cr("Found oop constant with non-zero offset");
5646 ShouldNotReachHere();
5647 }
5648
5649 ciKlass* k = exact_klass();
5650
5651 return (intptr_t)k->constant_encoding();
5652 }
5653
5654 //=============================================================================
5655 // Convenience common pre-built types.
5656
5657 // Not-null object klass or below
5658 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT;
5659 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL;
5660
5661 bool TypeInstKlassPtr::eq(const Type *t) const {
5662 const TypeKlassPtr *p = t->is_klassptr();
5663 return
5664 klass()->equals(p->klass()) &&
5665 TypeKlassPtr::eq(p);
5666 }
5667
5668 uint TypeInstKlassPtr::hash(void) const {
5669 return klass()->hash() + TypeKlassPtr::hash();
5670 }
5671
5672 const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, int offset) {
5673 TypeInstKlassPtr *r =
5674 (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset))->hashcons();
5675
5676 return r;
5677 }
5678
5679 //------------------------------add_offset-------------------------------------
5680 // Access internals of klass object
5681 const TypePtr* TypeInstKlassPtr::add_offset( intptr_t offset ) const {
5682 return make( _ptr, klass(), _interfaces, xadd_offset(offset) );
5683 }
5684
5685 const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const {
5686 return make(_ptr, klass(), _interfaces, offset);
5687 }
5688
5689 //------------------------------cast_to_ptr_type-------------------------------
5690 const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const {
5691 assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type");
5692 if( ptr == _ptr ) return this;
5693 return make(ptr, _klass, _interfaces, _offset);
5694 }
5695
5696
5697 bool TypeInstKlassPtr::must_be_exact() const {
5698 if (!_klass->is_loaded()) return false;
5699 ciInstanceKlass* ik = _klass->as_instance_klass();
5700 if (ik->is_final()) return true; // cannot clear xk
5701 return false;
5702 }
5703
5704 //-----------------------------cast_to_exactness-------------------------------
5705 const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const {
5706 if (klass_is_exact == (_ptr == Constant)) return this;
5707 if (must_be_exact()) return this;
5708 ciKlass* k = klass();
5709 return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset);
5710 }
5711
5712
5713 //-----------------------------as_instance_type--------------------------------
5714 // Corresponding type for an instance of the given class.
5715 // It will be NotNull, and exact if and only if the klass type is exact.
5716 const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const {
5717 ciKlass* k = klass();
5718 bool xk = klass_is_exact();
5719 Compile* C = Compile::current();
5720 Dependencies* deps = C->dependencies();
5721 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
5722 // Element is an instance
5723 bool klass_is_exact = false;
5724 const TypeInterfaces* interfaces = _interfaces;
5725 if (k->is_loaded()) {
5726 // Try to set klass_is_exact.
5727 ciInstanceKlass* ik = k->as_instance_klass();
5728 klass_is_exact = ik->is_final();
5729 if (!klass_is_exact && klass_change
5730 && deps != nullptr && UseUniqueSubclasses) {
5731 ciInstanceKlass* sub = ik->unique_concrete_subklass();
5732 if (sub != nullptr) {
5733 if (_interfaces->eq(sub)) {
5734 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
5735 k = ik = sub;
5736 xk = sub->is_final();
5737 }
5738 }
5739 }
5740 }
5741 return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, 0);
5742 }
5743
5744 //------------------------------xmeet------------------------------------------
5745 // Compute the MEET of two types, return a new Type object.
5746 const Type *TypeInstKlassPtr::xmeet( const Type *t ) const {
5747 // Perform a fast test for common case; meeting the same types together.
5748 if( this == t ) return this; // Meeting same type-rep?
5749
5750 // Current "this->_base" is Pointer
5751 switch (t->base()) { // switch on original type
5752
5753 case Int: // Mixing ints & oops happens when javac
5754 case Long: // reuses local variables
5755 case HalfFloatTop:
5756 case HalfFloatCon:
5757 case HalfFloatBot:
5758 case FloatTop:
5759 case FloatCon:
5760 case FloatBot:
5761 case DoubleTop:
5762 case DoubleCon:
5763 case DoubleBot:
5764 case NarrowOop:
5765 case NarrowKlass:
5766 case Bottom: // Ye Olde Default
5767 return Type::BOTTOM;
5768 case Top:
5769 return this;
5770
5771 default: // All else is a mistake
5772 typerr(t);
5773
5774 case AnyPtr: { // Meeting to AnyPtrs
5775 // Found an AnyPtr type vs self-KlassPtr type
5776 const TypePtr *tp = t->is_ptr();
5777 int offset = meet_offset(tp->offset());
5778 PTR ptr = meet_ptr(tp->ptr());
5779 switch (tp->ptr()) {
5780 case TopPTR:
5781 return this;
5782 case Null:
5783 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5784 case AnyNull:
5785 return make( ptr, klass(), _interfaces, offset );
5786 case BotPTR:
5787 case NotNull:
5788 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5789 default: typerr(t);
5790 }
5791 }
5792
5793 case RawPtr:
5794 case MetadataPtr:
5795 case OopPtr:
5796 case AryPtr: // Meet with AryPtr
5797 case InstPtr: // Meet with InstPtr
5798 return TypePtr::BOTTOM;
5799
5800 //
5801 // A-top }
5802 // / | \ } Tops
5803 // B-top A-any C-top }
5804 // | / | \ | } Any-nulls
5805 // B-any | C-any }
5806 // | | |
5807 // B-con A-con C-con } constants; not comparable across classes
5808 // | | |
5809 // B-not | C-not }
5810 // | \ | / | } not-nulls
5811 // B-bot A-not C-bot }
5812 // \ | / } Bottoms
5813 // A-bot }
5814 //
5815
5816 case InstKlassPtr: { // Meet two KlassPtr types
5817 const TypeInstKlassPtr *tkls = t->is_instklassptr();
5818 int off = meet_offset(tkls->offset());
5819 PTR ptr = meet_ptr(tkls->ptr());
5820 const TypeInterfaces* interfaces = meet_interfaces(tkls);
5821
5822 ciKlass* res_klass = nullptr;
5823 bool res_xk = false;
5824 switch(meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) {
5825 case UNLOADED:
5826 ShouldNotReachHere();
5827 case SUBTYPE:
5828 case NOT_SUBTYPE:
5829 case LCA:
5830 case QUICK: {
5831 assert(res_xk == (ptr == Constant), "");
5832 const Type* res = make(ptr, res_klass, interfaces, off);
5833 return res;
5834 }
5835 default:
5836 ShouldNotReachHere();
5837 }
5838 } // End of case KlassPtr
5839 case AryKlassPtr: { // All arrays inherit from Object class
5840 const TypeAryKlassPtr *tp = t->is_aryklassptr();
5841 int offset = meet_offset(tp->offset());
5842 PTR ptr = meet_ptr(tp->ptr());
5843 const TypeInterfaces* interfaces = meet_interfaces(tp);
5844 const TypeInterfaces* tp_interfaces = tp->_interfaces;
5845 const TypeInterfaces* this_interfaces = _interfaces;
5846
5847 switch (ptr) {
5848 case TopPTR:
5849 case AnyNull: // Fall 'down' to dual of object klass
5850 // For instances when a subclass meets a superclass we fall
5851 // below the centerline when the superclass is exact. We need to
5852 // do the same here.
5853 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) {
5854 return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset);
5855 } else {
5856 // cannot subclass, so the meet has to fall badly below the centerline
5857 ptr = NotNull;
5858 interfaces = _interfaces->intersection_with(tp->_interfaces);
5859 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
5860 }
5861 case Constant:
5862 case NotNull:
5863 case BotPTR: // Fall down to object klass
5864 // LCA is object_klass, but if we subclass from the top we can do better
5865 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
5866 // If 'this' (InstPtr) is above the centerline and it is Object class
5867 // then we can subclass in the Java class hierarchy.
5868 // For instances when a subclass meets a superclass we fall
5869 // below the centerline when the superclass is exact. We need
5870 // to do the same here.
5871 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) {
5872 // that is, tp's array type is a subtype of my klass
5873 return TypeAryKlassPtr::make(ptr,
5874 tp->elem(), tp->klass(), offset);
5875 }
5876 }
5877 // The other case cannot happen, since I cannot be a subtype of an array.
5878 // The meet falls down to Object class below centerline.
5879 if( ptr == Constant )
5880 ptr = NotNull;
5881 interfaces = this_interfaces->intersection_with(tp_interfaces);
5882 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
5883 default: typerr(t);
5884 }
5885 }
5886
5887 } // End of switch
5888 return this; // Return the double constant
5889 }
5890
5891 //------------------------------xdual------------------------------------------
5892 // Dual: compute field-by-field dual
5893 const Type *TypeInstKlassPtr::xdual() const {
5894 return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset());
5895 }
5896
5897 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) {
5898 static_assert(std::is_base_of<T2, T1>::value, "");
5899 if (!this_one->is_loaded() || !other->is_loaded()) {
5900 return false;
5901 }
5902 if (!this_one->is_instance_type(other)) {
5903 return false;
5904 }
5905
5906 if (!other_exact) {
5907 return false;
5908 }
5909
5910 if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) {
5911 return true;
5912 }
5913
5914 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
5968
5969 if (this_exact) {
5970 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
5971 }
5972
5973 return true;
5974 }
5975
5976 bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
5977 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
5978 }
5979
5980 const TypeKlassPtr* TypeInstKlassPtr::try_improve() const {
5981 if (!UseUniqueSubclasses) {
5982 return this;
5983 }
5984 ciKlass* k = klass();
5985 Compile* C = Compile::current();
5986 Dependencies* deps = C->dependencies();
5987 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
5988 const TypeInterfaces* interfaces = _interfaces;
5989 if (k->is_loaded()) {
5990 ciInstanceKlass* ik = k->as_instance_klass();
5991 bool klass_is_exact = ik->is_final();
5992 if (!klass_is_exact &&
5993 deps != nullptr) {
5994 ciInstanceKlass* sub = ik->unique_concrete_subklass();
5995 if (sub != nullptr) {
5996 if (_interfaces->eq(sub)) {
5997 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
5998 k = ik = sub;
5999 klass_is_exact = sub->is_final();
6000 return TypeKlassPtr::make(klass_is_exact ? Constant : _ptr, k, _offset);
6001 }
6002 }
6003 }
6004 }
6005 return this;
6006 }
6007
6008 #ifndef PRODUCT
6009 void TypeInstKlassPtr::dump2(Dict& d, uint depth, outputStream* st) const {
6010 st->print("instklassptr:");
6011 klass()->print_name_on(st);
6012 _interfaces->dump(st);
6013 st->print(":%s", ptr_msg[_ptr]);
6014 dump_offset(st);
6015 }
6016 #endif // PRODUCT
6017
6018 const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, const Type* elem, ciKlass* k, int offset) {
6019 return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset))->hashcons();
6020 }
6021
6022 const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, ciKlass* k, int offset, InterfaceHandling interface_handling) {
6023 if (k->is_obj_array_klass()) {
6024 // Element is an object array. Recursively call ourself.
6025 ciKlass* eklass = k->as_obj_array_klass()->element_klass();
6026 const TypeKlassPtr *etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false);
6027 return TypeAryKlassPtr::make(ptr, etype, nullptr, offset);
6028 } else if (k->is_type_array_klass()) {
6029 // Element is an typeArray
6030 const Type* etype = get_const_basic_type(k->as_type_array_klass()->element_type());
6031 return TypeAryKlassPtr::make(ptr, etype, k, offset);
6032 } else {
6033 ShouldNotReachHere();
6034 return nullptr;
6035 }
6036 }
6037
6038 const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) {
6039 return TypeAryKlassPtr::make(Constant, klass, 0, interface_handling);
6040 }
6041
6042 //------------------------------eq---------------------------------------------
6043 // Structural equality check for Type representations
6044 bool TypeAryKlassPtr::eq(const Type *t) const {
6045 const TypeAryKlassPtr *p = t->is_aryklassptr();
6046 return
6047 _elem == p->_elem && // Check array
6048 TypeKlassPtr::eq(p); // Check sub-parts
6049 }
6050
6051 //------------------------------hash-------------------------------------------
6052 // Type-specific hashing function.
6053 uint TypeAryKlassPtr::hash(void) const {
6054 return (uint)(uintptr_t)_elem + TypeKlassPtr::hash();
6055 }
6056
6057 //----------------------compute_klass------------------------------------------
6058 // Compute the defining klass for this class
6059 ciKlass* TypeAryPtr::compute_klass() const {
6060 // Compute _klass based on element type.
6061 ciKlass* k_ary = nullptr;
6062 const TypeInstPtr *tinst;
6063 const TypeAryPtr *tary;
6064 const Type* el = elem();
6065 if (el->isa_narrowoop()) {
6066 el = el->make_ptr();
6067 }
6068
6069 // Get element klass
6070 if ((tinst = el->isa_instptr()) != nullptr) {
6071 // Leave k_ary at null.
6072 } else if ((tary = el->isa_aryptr()) != nullptr) {
6073 // Leave k_ary at null.
6074 } else if ((el->base() == Type::Top) ||
6075 (el->base() == Type::Bottom)) {
6076 // element type of Bottom occurs from meet of basic type
6077 // and object; Top occurs when doing join on Bottom.
6078 // Leave k_ary at null.
6079 } else {
6080 assert(!el->isa_int(), "integral arrays must be pre-equipped with a class");
6081 // Compute array klass directly from basic type
6082 k_ary = ciTypeArrayKlass::make(el->basic_type());
6083 }
6084 return k_ary;
6085 }
6086
6087 //------------------------------klass------------------------------------------
6088 // Return the defining klass for this class
6089 ciKlass* TypeAryPtr::klass() const {
6090 if( _klass ) return _klass; // Return cached value, if possible
6091
6092 // Oops, need to compute _klass and cache it
6093 ciKlass* k_ary = compute_klass();
6101 // type TypeAryPtr::OOPS. This Type is shared between all
6102 // active compilations. However, the ciKlass which represents
6103 // this Type is *not* shared between compilations, so caching
6104 // this value would result in fetching a dangling pointer.
6105 //
6106 // Recomputing the underlying ciKlass for each request is
6107 // a bit less efficient than caching, but calls to
6108 // TypeAryPtr::OOPS->klass() are not common enough to matter.
6109 ((TypeAryPtr*)this)->_klass = k_ary;
6110 }
6111 return k_ary;
6112 }
6113
6114 // Is there a single ciKlass* that can represent that type?
6115 ciKlass* TypeAryPtr::exact_klass_helper() const {
6116 if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) {
6117 ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper();
6118 if (k == nullptr) {
6119 return nullptr;
6120 }
6121 k = ciObjArrayKlass::make(k);
6122 return k;
6123 }
6124
6125 return klass();
6126 }
6127
6128 const Type* TypeAryPtr::base_element_type(int& dims) const {
6129 const Type* elem = this->elem();
6130 dims = 1;
6131 while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) {
6132 elem = elem->make_ptr()->is_aryptr()->elem();
6133 dims++;
6134 }
6135 return elem;
6136 }
6137
6138 //------------------------------add_offset-------------------------------------
6139 // Access internals of klass object
6140 const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const {
6141 return make(_ptr, elem(), klass(), xadd_offset(offset));
6142 }
6143
6144 const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const {
6145 return make(_ptr, elem(), klass(), offset);
6146 }
6147
6148 //------------------------------cast_to_ptr_type-------------------------------
6149 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const {
6150 assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type");
6151 if (ptr == _ptr) return this;
6152 return make(ptr, elem(), _klass, _offset);
6153 }
6154
6155 bool TypeAryKlassPtr::must_be_exact() const {
6156 if (_elem == Type::BOTTOM) return false;
6157 if (_elem == Type::TOP ) return false;
6158 const TypeKlassPtr* tk = _elem->isa_klassptr();
6159 if (!tk) return true; // a primitive type, like int
6160 return tk->must_be_exact();
6161 }
6162
6163
6164 //-----------------------------cast_to_exactness-------------------------------
6165 const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const {
6166 if (must_be_exact()) return this; // cannot clear xk
6167 ciKlass* k = _klass;
6168 const Type* elem = this->elem();
6169 if (elem->isa_klassptr() && !klass_is_exact) {
6170 elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact);
6171 }
6172 return make(klass_is_exact ? Constant : NotNull, elem, k, _offset);
6173 }
6174
6175
6176 //-----------------------------as_instance_type--------------------------------
6177 // Corresponding type for an instance of the given class.
6178 // It will be NotNull, and exact if and only if the klass type is exact.
6179 const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const {
6180 ciKlass* k = klass();
6181 bool xk = klass_is_exact();
6182 const Type* el = nullptr;
6183 if (elem()->isa_klassptr()) {
6184 el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false);
6185 k = nullptr;
6186 } else {
6187 el = elem();
6188 }
6189 return TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(el, TypeInt::POS), k, xk, 0);
6190 }
6191
6192
6193 //------------------------------xmeet------------------------------------------
6194 // Compute the MEET of two types, return a new Type object.
6195 const Type *TypeAryKlassPtr::xmeet( const Type *t ) const {
6196 // Perform a fast test for common case; meeting the same types together.
6197 if( this == t ) return this; // Meeting same type-rep?
6198
6199 // Current "this->_base" is Pointer
6200 switch (t->base()) { // switch on original type
6201
6202 case Int: // Mixing ints & oops happens when javac
6203 case Long: // reuses local variables
6204 case HalfFloatTop:
6205 case HalfFloatCon:
6206 case HalfFloatBot:
6207 case FloatTop:
6208 case FloatCon:
6209 case FloatBot:
6210 case DoubleTop:
6211 case DoubleCon:
6212 case DoubleBot:
6213 case NarrowOop:
6214 case NarrowKlass:
6215 case Bottom: // Ye Olde Default
6216 return Type::BOTTOM;
6217 case Top:
6218 return this;
6219
6220 default: // All else is a mistake
6221 typerr(t);
6222
6223 case AnyPtr: { // Meeting to AnyPtrs
6224 // Found an AnyPtr type vs self-KlassPtr type
6225 const TypePtr *tp = t->is_ptr();
6226 int offset = meet_offset(tp->offset());
6227 PTR ptr = meet_ptr(tp->ptr());
6228 switch (tp->ptr()) {
6229 case TopPTR:
6230 return this;
6231 case Null:
6232 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6233 case AnyNull:
6234 return make( ptr, _elem, klass(), offset );
6235 case BotPTR:
6236 case NotNull:
6237 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6238 default: typerr(t);
6239 }
6240 }
6241
6242 case RawPtr:
6243 case MetadataPtr:
6244 case OopPtr:
6245 case AryPtr: // Meet with AryPtr
6246 case InstPtr: // Meet with InstPtr
6247 return TypePtr::BOTTOM;
6248
6249 //
6250 // A-top }
6251 // / | \ } Tops
6252 // B-top A-any C-top }
6253 // | / | \ | } Any-nulls
6254 // B-any | C-any }
6255 // | | |
6256 // B-con A-con C-con } constants; not comparable across classes
6257 // | | |
6258 // B-not | C-not }
6259 // | \ | / | } not-nulls
6260 // B-bot A-not C-bot }
6261 // \ | / } Bottoms
6262 // A-bot }
6263 //
6264
6265 case AryKlassPtr: { // Meet two KlassPtr types
6266 const TypeAryKlassPtr *tap = t->is_aryklassptr();
6267 int off = meet_offset(tap->offset());
6268 const Type* elem = _elem->meet(tap->_elem);
6269
6270 PTR ptr = meet_ptr(tap->ptr());
6271 ciKlass* res_klass = nullptr;
6272 bool res_xk = false;
6273 meet_aryptr(ptr, elem, this, tap, res_klass, res_xk);
6274 assert(res_xk == (ptr == Constant), "");
6275 return make(ptr, elem, res_klass, off);
6276 } // End of case KlassPtr
6277 case InstKlassPtr: {
6278 const TypeInstKlassPtr *tp = t->is_instklassptr();
6279 int offset = meet_offset(tp->offset());
6280 PTR ptr = meet_ptr(tp->ptr());
6281 const TypeInterfaces* interfaces = meet_interfaces(tp);
6282 const TypeInterfaces* tp_interfaces = tp->_interfaces;
6283 const TypeInterfaces* this_interfaces = _interfaces;
6284
6285 switch (ptr) {
6286 case TopPTR:
6287 case AnyNull: // Fall 'down' to dual of object klass
6288 // For instances when a subclass meets a superclass we fall
6289 // below the centerline when the superclass is exact. We need to
6290 // do the same here.
6291 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
6292 !tp->klass_is_exact()) {
6293 return TypeAryKlassPtr::make(ptr, _elem, _klass, offset);
6294 } else {
6295 // cannot subclass, so the meet has to fall badly below the centerline
6296 ptr = NotNull;
6297 interfaces = this_interfaces->intersection_with(tp->_interfaces);
6298 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
6299 }
6300 case Constant:
6301 case NotNull:
6302 case BotPTR: // Fall down to object klass
6303 // LCA is object_klass, but if we subclass from the top we can do better
6304 if (above_centerline(tp->ptr())) {
6305 // If 'tp' is above the centerline and it is Object class
6306 // then we can subclass in the Java class hierarchy.
6307 // For instances when a subclass meets a superclass we fall
6308 // below the centerline when the superclass is exact. We need
6309 // to do the same here.
6310 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
6311 !tp->klass_is_exact()) {
6312 // that is, my array type is a subtype of 'tp' klass
6313 return make(ptr, _elem, _klass, offset);
6314 }
6315 }
6316 // The other case cannot happen, since t cannot be a subtype of an array.
6317 // The meet falls down to Object class below centerline.
6318 if (ptr == Constant)
6319 ptr = NotNull;
6320 interfaces = this_interfaces->intersection_with(tp_interfaces);
6321 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
6322 default: typerr(t);
6323 }
6324 }
6325
6326 } // End of switch
6327 return this; // Return the double constant
6328 }
6329
6330 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) {
6331 static_assert(std::is_base_of<T2, T1>::value, "");
6332
6333 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) {
6334 return true;
6335 }
6336
6337 int dummy;
6338 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
6339
6340 if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
6341 return false;
6342 }
6343
6344 if (this_one->is_instance_type(other)) {
6345 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) &&
6346 other_exact;
6347 }
6348
6349 assert(this_one->is_array_type(other), "");
6350 const T1* other_ary = this_one->is_array_type(other);
6351 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
6352 if (other_top_or_bottom) {
6353 return false;
6354 }
6355
6356 const TypePtr* other_elem = other_ary->elem()->make_ptr();
6357 const TypePtr* this_elem = this_one->elem()->make_ptr();
6358 if (this_elem != nullptr && other_elem != nullptr) {
6359 return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
6360 }
6361 if (this_elem == nullptr && other_elem == nullptr) {
6362 return this_one->klass()->is_subtype_of(other->klass());
6363 }
6364 return false;
6365 }
6366
6367 bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6368 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
6369 }
6370
6371 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) {
6372 static_assert(std::is_base_of<T2, T1>::value, "");
6373
6374 int dummy;
6375 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
6376
6377 if (!this_one->is_array_type(other) ||
6378 !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
6431 }
6432
6433 const TypePtr* this_elem = this_one->elem()->make_ptr();
6434 const TypePtr* other_elem = other_ary->elem()->make_ptr();
6435 if (other_elem != nullptr && this_elem != nullptr) {
6436 return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
6437 }
6438 if (other_elem == nullptr && this_elem == nullptr) {
6439 return this_one->klass()->is_subtype_of(other->klass());
6440 }
6441 return false;
6442 }
6443
6444 bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6445 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
6446 }
6447
6448 //------------------------------xdual------------------------------------------
6449 // Dual: compute field-by-field dual
6450 const Type *TypeAryKlassPtr::xdual() const {
6451 return new TypeAryKlassPtr(dual_ptr(), elem()->dual(), klass(), dual_offset());
6452 }
6453
6454 // Is there a single ciKlass* that can represent that type?
6455 ciKlass* TypeAryKlassPtr::exact_klass_helper() const {
6456 if (elem()->isa_klassptr()) {
6457 ciKlass* k = elem()->is_klassptr()->exact_klass_helper();
6458 if (k == nullptr) {
6459 return nullptr;
6460 }
6461 k = ciObjArrayKlass::make(k);
6462 return k;
6463 }
6464
6465 return klass();
6466 }
6467
6468 ciKlass* TypeAryKlassPtr::klass() const {
6469 if (_klass != nullptr) {
6470 return _klass;
6471 }
6472 ciKlass* k = nullptr;
6473 if (elem()->isa_klassptr()) {
6474 // leave null
6475 } else if ((elem()->base() == Type::Top) ||
6476 (elem()->base() == Type::Bottom)) {
6477 } else {
6478 k = ciTypeArrayKlass::make(elem()->basic_type());
6479 ((TypeAryKlassPtr*)this)->_klass = k;
6480 }
6481 return k;
6482 }
6483
6484 //------------------------------dump2------------------------------------------
6485 // Dump Klass Type
6486 #ifndef PRODUCT
6487 void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
6488 st->print("aryklassptr:[");
6489 _elem->dump2(d, depth, st);
6490 _interfaces->dump(st);
6491 st->print(":%s", ptr_msg[_ptr]);
6492 dump_offset(st);
6493 }
6494 #endif
6495
6496 const Type* TypeAryKlassPtr::base_element_type(int& dims) const {
6497 const Type* elem = this->elem();
6498 dims = 1;
6499 while (elem->isa_aryklassptr()) {
6500 elem = elem->is_aryklassptr()->elem();
6501 dims++;
6502 }
6503 return elem;
6504 }
6505
6506 //=============================================================================
6507 // Convenience common pre-built types.
6508
6509 //------------------------------make-------------------------------------------
6510 const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) {
6511 return (TypeFunc*)(new TypeFunc(domain,range))->hashcons();
6512 }
6513
6514 //------------------------------make-------------------------------------------
6515 const TypeFunc *TypeFunc::make(ciMethod* method) {
6516 Compile* C = Compile::current();
6517 const TypeFunc* tf = C->last_tf(method); // check cache
6518 if (tf != nullptr) return tf; // The hit rate here is almost 50%.
6519 const TypeTuple *domain;
6520 if (method->is_static()) {
6521 domain = TypeTuple::make_domain(nullptr, method->signature(), ignore_interfaces);
6522 } else {
6523 domain = TypeTuple::make_domain(method->holder(), method->signature(), ignore_interfaces);
6524 }
6525 const TypeTuple *range = TypeTuple::make_range(method->signature(), ignore_interfaces);
6526 tf = TypeFunc::make(domain, range);
6527 C->set_last_tf(method, tf); // fill cache
6528 return tf;
6529 }
6530
6531 //------------------------------meet-------------------------------------------
6532 // Compute the MEET of two types. It returns a new Type object.
6533 const Type *TypeFunc::xmeet( const Type *t ) const {
6534 // Perform a fast test for common case; meeting the same types together.
6535 if( this == t ) return this; // Meeting same type-rep?
6536
6537 // Current "this->_base" is Func
6538 switch (t->base()) { // switch on original type
6539
6540 case Bottom: // Ye Olde Default
6541 return t;
6542
6543 default: // All else is a mistake
6544 typerr(t);
6545
6546 case Top:
6547 break;
6548 }
6549 return this; // Return the double constant
6550 }
6551
6552 //------------------------------xdual------------------------------------------
6553 // Dual: compute field-by-field dual
6554 const Type *TypeFunc::xdual() const {
6555 return this;
6556 }
6557
6558 //------------------------------eq---------------------------------------------
6559 // Structural equality check for Type representations
6560 bool TypeFunc::eq( const Type *t ) const {
6561 const TypeFunc *a = (const TypeFunc*)t;
6562 return _domain == a->_domain &&
6563 _range == a->_range;
6564 }
6565
6566 //------------------------------hash-------------------------------------------
6567 // Type-specific hashing function.
6568 uint TypeFunc::hash(void) const {
6569 return (uint)(uintptr_t)_domain + (uint)(uintptr_t)_range;
6570 }
6571
6572 //------------------------------dump2------------------------------------------
6573 // Dump Function Type
6574 #ifndef PRODUCT
6575 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
6576 if( _range->cnt() <= Parms )
6577 st->print("void");
6578 else {
6579 uint i;
6580 for (i = Parms; i < _range->cnt()-1; i++) {
6581 _range->field_at(i)->dump2(d,depth,st);
6582 st->print("/");
6583 }
6584 _range->field_at(i)->dump2(d,depth,st);
6585 }
6586 st->print(" ");
6587 st->print("( ");
6588 if( !depth || d[this] ) { // Check for recursive dump
6589 st->print("...)");
6590 return;
6591 }
6592 d.Insert((void*)this,(void*)this); // Stop recursion
6593 if (Parms < _domain->cnt())
6594 _domain->field_at(Parms)->dump2(d,depth-1,st);
6595 for (uint i = Parms+1; i < _domain->cnt(); i++) {
6596 st->print(", ");
6597 _domain->field_at(i)->dump2(d,depth-1,st);
6598 }
6599 st->print(" )");
6600 }
6601 #endif
6602
6603 //------------------------------singleton--------------------------------------
6604 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
6605 // constants (Ldi nodes). Singletons are integer, float or double constants
6606 // or a single symbol.
6607 bool TypeFunc::singleton(void) const {
6608 return false; // Never a singleton
6609 }
6610
6611 bool TypeFunc::empty(void) const {
6612 return false; // Never empty
6613 }
6614
6615
6616 BasicType TypeFunc::return_type() const{
6617 if (range()->cnt() == TypeFunc::Parms) {
6618 return T_VOID;
6619 }
6620 return range()->field_at(TypeFunc::Parms)->basic_type();
6621 }
|
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, relocInfo::none }, // Bad
117 { Control, T_ILLEGAL, "control", false, 0, relocInfo::none }, // Control
118 { Bottom, T_VOID, "top", false, 0, relocInfo::none }, // Top
119 { Bad, T_INT, "int:", false, Op_RegI, relocInfo::none }, // Int
120 { Bad, T_LONG, "long:", false, Op_RegL, relocInfo::none }, // Long
121 { Half, T_VOID, "half", false, 0, relocInfo::none }, // Half
122 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN, relocInfo::none }, // NarrowOop
123 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN, relocInfo::none }, // NarrowKlass
124 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg, relocInfo::none }, // Tuple
125 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg, relocInfo::none }, // Array
126 { Bad, T_ARRAY, "interfaces:", false, Node::NotAMachineReg, relocInfo::none }, // Interfaces
127
128 #if defined(PPC64)
129 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask.
130 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA.
131 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS
132 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // 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());
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 TypeVectMask(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) {
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 // InlineTypeNode::NullMarker field used for null checking
2219 arg_cnt++;
2220 }
2221 const Type **field_array = fields(arg_cnt);
2222 switch (return_type->basic_type()) {
2223 case T_LONG:
2224 field_array[TypeFunc::Parms] = TypeLong::LONG;
2225 field_array[TypeFunc::Parms+1] = Type::HALF;
2226 break;
2227 case T_DOUBLE:
2228 field_array[TypeFunc::Parms] = Type::DOUBLE;
2229 field_array[TypeFunc::Parms+1] = Type::HALF;
2230 break;
2231 case T_OBJECT:
2232 if (return_type->is_inlinetype() && ret_vt_fields) {
2233 uint pos = TypeFunc::Parms;
2234 field_array[pos++] = get_const_type(return_type); // Oop might be null when returning as fields
2235 collect_inline_fields(return_type->as_inline_klass(), field_array, pos);
2236 // InlineTypeNode::NullMarker field used for null checking
2237 field_array[pos++] = get_const_basic_type(T_BOOLEAN);
2238 assert(pos == (TypeFunc::Parms + arg_cnt), "out of bounds");
2239 break;
2240 } else {
2241 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling)->join_speculative(TypePtr::BOTTOM);
2242 }
2243 break;
2244 case T_ARRAY:
2245 case T_BOOLEAN:
2246 case T_CHAR:
2247 case T_FLOAT:
2248 case T_BYTE:
2249 case T_SHORT:
2250 case T_INT:
2251 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling);
2252 break;
2253 case T_VOID:
2254 break;
2255 default:
2256 ShouldNotReachHere();
2257 }
2258 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2259 }
2260
2261 // Make a TypeTuple from the domain of a method signature
2262 const TypeTuple *TypeTuple::make_domain(ciMethod* method, InterfaceHandling interface_handling, bool vt_fields_as_args) {
2263 ciSignature* sig = method->signature();
2264 uint arg_cnt = sig->size() + (method->is_static() ? 0 : 1);
2265 if (vt_fields_as_args) {
2266 arg_cnt = 0;
2267 assert(method->get_sig_cc() != nullptr, "Should have scalarized signature");
2268 for (ExtendedSignature sig_cc = ExtendedSignature(method->get_sig_cc(), SigEntryFilter()); !sig_cc.at_end(); ++sig_cc) {
2269 arg_cnt += type2size[(*sig_cc)._bt];
2270 }
2271 }
2272
2273 uint pos = TypeFunc::Parms;
2274 const Type** field_array = fields(arg_cnt);
2275 if (!method->is_static()) {
2276 ciInstanceKlass* recv = method->holder();
2277 if (vt_fields_as_args && recv->is_inlinetype() && recv->as_inline_klass()->can_be_passed_as_fields() && method->is_scalarized_arg(0)) {
2278 field_array[pos++] = get_const_type(recv, interface_handling); // buffer argument
2279 collect_inline_fields(recv->as_inline_klass(), field_array, pos);
2280 } else {
2281 field_array[pos++] = get_const_type(recv, interface_handling)->join_speculative(TypePtr::NOTNULL);
2282 }
2283 }
2284
2285 int i = 0;
2286 while (pos < TypeFunc::Parms + arg_cnt) {
2287 ciType* type = sig->type_at(i);
2288 BasicType bt = type->basic_type();
2289
2290 switch (bt) {
2291 case T_LONG:
2292 field_array[pos++] = TypeLong::LONG;
2293 field_array[pos++] = Type::HALF;
2294 break;
2295 case T_DOUBLE:
2296 field_array[pos++] = Type::DOUBLE;
2297 field_array[pos++] = Type::HALF;
2298 break;
2299 case T_OBJECT:
2300 if (type->is_inlinetype() && vt_fields_as_args && method->is_scalarized_arg(i + (method->is_static() ? 0 : 1))) {
2301 field_array[pos++] = get_const_type(type, interface_handling); // buffer argument
2302 // InlineTypeNode::NullMarker field used for null checking
2303 field_array[pos++] = get_const_basic_type(T_BOOLEAN);
2304 collect_inline_fields(type->as_inline_klass(), field_array, pos);
2305 } else {
2306 field_array[pos++] = get_const_type(type, interface_handling);
2307 }
2308 break;
2309 case T_ARRAY:
2310 case T_FLOAT:
2311 case T_INT:
2312 field_array[pos++] = get_const_type(type, interface_handling);
2313 break;
2314 case T_BOOLEAN:
2315 case T_CHAR:
2316 case T_BYTE:
2317 case T_SHORT:
2318 field_array[pos++] = TypeInt::INT;
2319 break;
2320 default:
2321 ShouldNotReachHere();
2322 }
2323 i++;
2324 }
2325 assert(pos == TypeFunc::Parms + arg_cnt, "wrong number of arguments");
2326
2327 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2328 }
2329
2330 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) {
2331 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons();
2332 }
2333
2334 //------------------------------fields-----------------------------------------
2335 // Subroutine call type with space allocated for argument types
2336 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly
2337 const Type **TypeTuple::fields( uint arg_cnt ) {
2338 const Type **flds = (const Type **)(Compile::current()->type_arena()->AmallocWords((TypeFunc::Parms+arg_cnt)*sizeof(Type*) ));
2339 flds[TypeFunc::Control ] = Type::CONTROL;
2340 flds[TypeFunc::I_O ] = Type::ABIO;
2341 flds[TypeFunc::Memory ] = Type::MEMORY;
2342 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM;
2343 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS;
2344
2345 return flds;
2440 if (_fields[i]->empty()) return true;
2441 }
2442 return false;
2443 }
2444
2445 //=============================================================================
2446 // Convenience common pre-built types.
2447
2448 inline const TypeInt* normalize_array_size(const TypeInt* size) {
2449 // Certain normalizations keep us sane when comparing types.
2450 // We do not want arrayOop variables to differ only by the wideness
2451 // of their index types. Pick minimum wideness, since that is the
2452 // forced wideness of small ranges anyway.
2453 if (size->_widen != Type::WidenMin)
2454 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin);
2455 else
2456 return size;
2457 }
2458
2459 //------------------------------make-------------------------------------------
2460 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable,
2461 bool flat, bool not_flat, bool not_null_free, bool atomic) {
2462 if (UseCompressedOops && elem->isa_oopptr()) {
2463 elem = elem->make_narrowoop();
2464 }
2465 size = normalize_array_size(size);
2466 return (TypeAry*)(new TypeAry(elem, size, stable, flat, not_flat, not_null_free, atomic))->hashcons();
2467 }
2468
2469 //------------------------------meet-------------------------------------------
2470 // Compute the MEET of two types. It returns a new Type object.
2471 const Type *TypeAry::xmeet( const Type *t ) const {
2472 // Perform a fast test for common case; meeting the same types together.
2473 if( this == t ) return this; // Meeting same type-rep?
2474
2475 // Current "this->_base" is Ary
2476 switch (t->base()) { // switch on original type
2477
2478 case Bottom: // Ye Olde Default
2479 return t;
2480
2481 default: // All else is a mistake
2482 typerr(t);
2483
2484 case Array: { // Meeting 2 arrays?
2485 const TypeAry* a = t->is_ary();
2486 const Type* size = _size->xmeet(a->_size);
2487 const TypeInt* isize = size->isa_int();
2488 if (isize == nullptr) {
2489 assert(size == Type::TOP || size == Type::BOTTOM, "");
2490 return size;
2491 }
2492 return TypeAry::make(_elem->meet_speculative(a->_elem),
2493 isize, _stable && a->_stable,
2494 _flat && a->_flat,
2495 _not_flat && a->_not_flat,
2496 _not_null_free && a->_not_null_free,
2497 _atomic && a->_atomic);
2498 }
2499 case Top:
2500 break;
2501 }
2502 return this; // Return the double constant
2503 }
2504
2505 //------------------------------xdual------------------------------------------
2506 // Dual: compute field-by-field dual
2507 const Type *TypeAry::xdual() const {
2508 const TypeInt* size_dual = _size->dual()->is_int();
2509 size_dual = normalize_array_size(size_dual);
2510 return new TypeAry(_elem->dual(), size_dual, !_stable, !_flat, !_not_flat, !_not_null_free, !_atomic);
2511 }
2512
2513 //------------------------------eq---------------------------------------------
2514 // Structural equality check for Type representations
2515 bool TypeAry::eq( const Type *t ) const {
2516 const TypeAry *a = (const TypeAry*)t;
2517 return _elem == a->_elem &&
2518 _stable == a->_stable &&
2519 _size == a->_size &&
2520 _flat == a->_flat &&
2521 _not_flat == a->_not_flat &&
2522 _not_null_free == a->_not_null_free &&
2523 _atomic == a->_atomic;
2524
2525 }
2526
2527 //------------------------------hash-------------------------------------------
2528 // Type-specific hashing function.
2529 uint TypeAry::hash(void) const {
2530 return (uint)(uintptr_t)_elem + (uint)(uintptr_t)_size + (uint)(_stable ? 43 : 0) +
2531 (uint)(_flat ? 44 : 0) + (uint)(_not_flat ? 45 : 0) + (uint)(_not_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0);
2532 }
2533
2534 /**
2535 * Return same type without a speculative part in the element
2536 */
2537 const TypeAry* TypeAry::remove_speculative() const {
2538 return make(_elem->remove_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic);
2539 }
2540
2541 /**
2542 * Return same type with cleaned up speculative part of element
2543 */
2544 const Type* TypeAry::cleanup_speculative() const {
2545 return make(_elem->cleanup_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic);
2546 }
2547
2548 /**
2549 * Return same type but with a different inline depth (used for speculation)
2550 *
2551 * @param depth depth to meet with
2552 */
2553 const TypePtr* TypePtr::with_inline_depth(int depth) const {
2554 if (!UseInlineDepthForSpeculativeTypes) {
2555 return this;
2556 }
2557 return make(AnyPtr, _ptr, _offset, _speculative, depth);
2558 }
2559
2560 //------------------------------dump2------------------------------------------
2561 #ifndef PRODUCT
2562 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const {
2563 if (_stable) st->print("stable:");
2564 if (_flat) st->print("flat:");
2565 if (Verbose) {
2566 if (_not_flat) st->print("not flat:");
2567 if (_not_null_free) st->print("not null free:");
2568 }
2569 if (_atomic) st->print("atomic:");
2570 _elem->dump2(d, depth, st);
2571 st->print("[");
2572 _size->dump2(d, depth, st);
2573 st->print("]");
2574 }
2575 #endif
2576
2577 //------------------------------singleton--------------------------------------
2578 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2579 // constants (Ldi nodes). Singletons are integer, float or double constants
2580 // or a single symbol.
2581 bool TypeAry::singleton(void) const {
2582 return false; // Never a singleton
2583 }
2584
2585 bool TypeAry::empty(void) const {
2586 return _elem->empty() || _size->empty();
2587 }
2588
2589 //--------------------------ary_must_be_exact----------------------------------
2590 bool TypeAry::ary_must_be_exact() const {
2591 // This logic looks at the element type of an array, and returns true
2592 // if the element type is either a primitive or a final instance class.
2593 // In such cases, an array built on this ary must have no subclasses.
2594 if (_elem == BOTTOM) return false; // general array not exact
2595 if (_elem == TOP ) return false; // inverted general array not exact
2596 const TypeOopPtr* toop = nullptr;
2597 if (UseCompressedOops && _elem->isa_narrowoop()) {
2598 toop = _elem->make_ptr()->isa_oopptr();
2599 } else {
2600 toop = _elem->isa_oopptr();
2601 }
2602 if (!toop) return true; // a primitive type, like int
2603 if (!toop->is_loaded()) return false; // unloaded class
2604 const TypeInstPtr* tinst;
2605 if (_elem->isa_narrowoop())
2606 tinst = _elem->make_ptr()->isa_instptr();
2607 else
2608 tinst = _elem->isa_instptr();
2609 if (tinst) {
2610 if (tinst->instance_klass()->is_final()) {
2611 // Even though MyValue is final, [LMyValue is only exact if the array
2612 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue.
2613 // TODO 8350865 If we know that the array can't be null-free, it's allowed to be exact, right?
2614 // If so, we should add '&& !_not_null_free'
2615 if (tinst->is_inlinetypeptr() && (tinst->ptr() != TypePtr::NotNull)) {
2616 return false;
2617 }
2618 return true;
2619 }
2620 return false;
2621 }
2622 const TypeAryPtr* tap;
2623 if (_elem->isa_narrowoop())
2624 tap = _elem->make_ptr()->isa_aryptr();
2625 else
2626 tap = _elem->isa_aryptr();
2627 if (tap)
2628 return tap->ary()->ary_must_be_exact();
2629 return false;
2630 }
2631
2632 //==============================TypeVect=======================================
2633 // Convenience common pre-built types.
2634 const TypeVect* TypeVect::VECTA = nullptr; // vector length agnostic
2635 const TypeVect* TypeVect::VECTS = nullptr; // 32-bit vectors
2636 const TypeVect* TypeVect::VECTD = nullptr; // 64-bit vectors
2637 const TypeVect* TypeVect::VECTX = nullptr; // 128-bit vectors
2638 const TypeVect* TypeVect::VECTY = nullptr; // 256-bit vectors
2639 const TypeVect* TypeVect::VECTZ = nullptr; // 512-bit vectors
2640 const TypeVect* TypeVect::VECTMASK = nullptr; // predicate/mask vector
2641
2782
2783 //=============================================================================
2784 // Convenience common pre-built types.
2785 const TypePtr *TypePtr::NULL_PTR;
2786 const TypePtr *TypePtr::NOTNULL;
2787 const TypePtr *TypePtr::BOTTOM;
2788
2789 //------------------------------meet-------------------------------------------
2790 // Meet over the PTR enum
2791 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = {
2792 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,
2793 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,},
2794 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,},
2795 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,},
2796 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,},
2797 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,},
2798 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,}
2799 };
2800
2801 //------------------------------make-------------------------------------------
2802 const TypePtr* TypePtr::make(TYPES t, enum PTR ptr, Offset offset, const TypePtr* speculative, int inline_depth) {
2803 return (TypePtr*)(new TypePtr(t,ptr,offset, speculative, inline_depth))->hashcons();
2804 }
2805
2806 //------------------------------cast_to_ptr_type-------------------------------
2807 const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const {
2808 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
2809 if( ptr == _ptr ) return this;
2810 return make(_base, ptr, _offset, _speculative, _inline_depth);
2811 }
2812
2813 //------------------------------get_con----------------------------------------
2814 intptr_t TypePtr::get_con() const {
2815 assert( _ptr == Null, "" );
2816 return offset();
2817 }
2818
2819 //------------------------------meet-------------------------------------------
2820 // Compute the MEET of two types. It returns a new Type object.
2821 const Type *TypePtr::xmeet(const Type *t) const {
2822 const Type* res = xmeet_helper(t);
2823 if (res->isa_ptr() == nullptr) {
2824 return res;
2825 }
2826
2827 const TypePtr* res_ptr = res->is_ptr();
2828 if (res_ptr->speculative() != nullptr) {
2829 // type->speculative() is null means that speculation is no better
2830 // than type, i.e. type->speculative() == type. So there are 2
2831 // ways to represent the fact that we have no useful speculative
2832 // data and we should use a single one to be able to test for
2833 // equality between types. Check whether type->speculative() ==
2834 // type and set speculative to null if it is the case.
2835 if (res_ptr->remove_speculative() == res_ptr->speculative()) {
2836 return res_ptr->remove_speculative();
2870 int depth = meet_inline_depth(tp->inline_depth());
2871 return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth);
2872 }
2873 case RawPtr: // For these, flip the call around to cut down
2874 case OopPtr:
2875 case InstPtr: // on the cases I have to handle.
2876 case AryPtr:
2877 case MetadataPtr:
2878 case KlassPtr:
2879 case InstKlassPtr:
2880 case AryKlassPtr:
2881 return t->xmeet(this); // Call in reverse direction
2882 default: // All else is a mistake
2883 typerr(t);
2884
2885 }
2886 return this;
2887 }
2888
2889 //------------------------------meet_offset------------------------------------
2890 Type::Offset TypePtr::meet_offset(int offset) const {
2891 return _offset.meet(Offset(offset));
2892 }
2893
2894 //------------------------------dual_offset------------------------------------
2895 Type::Offset TypePtr::dual_offset() const {
2896 return _offset.dual();
2897 }
2898
2899 //------------------------------xdual------------------------------------------
2900 // Dual: compute field-by-field dual
2901 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
2902 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
2903 };
2904
2905 const TypePtr::FlatInArray TypePtr::flat_in_array_dual[Uninitialized] = {
2906 /* TopFlat -> */ MaybeFlat,
2907 /* Flat -> */ NotFlat,
2908 /* NotFlat -> */ Flat,
2909 /* MaybeFlat -> */ TopFlat
2910 };
2911
2912 const char* const TypePtr::flat_in_array_msg[Uninitialized] = {
2913 "TOP flat in array", "flat in array", "not flat in array", "maybe flat in array"
2914 };
2915
2916 const Type *TypePtr::xdual() const {
2917 return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), dual_speculative(), dual_inline_depth());
2918 }
2919
2920 //------------------------------xadd_offset------------------------------------
2921 Type::Offset TypePtr::xadd_offset(intptr_t offset) const {
2922 return _offset.add(offset);
2923 }
2924
2925 //------------------------------add_offset-------------------------------------
2926 const TypePtr *TypePtr::add_offset( intptr_t offset ) const {
2927 return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth);
2928 }
2929
2930 const TypePtr *TypePtr::with_offset(intptr_t offset) const {
2931 return make(AnyPtr, _ptr, Offset(offset), _speculative, _inline_depth);
2932 }
2933
2934 //------------------------------eq---------------------------------------------
2935 // Structural equality check for Type representations
2936 bool TypePtr::eq( const Type *t ) const {
2937 const TypePtr *a = (const TypePtr*)t;
2938 return _ptr == a->ptr() && _offset == a->_offset && eq_speculative(a) && _inline_depth == a->_inline_depth;
2939 }
2940
2941 //------------------------------hash-------------------------------------------
2942 // Type-specific hashing function.
2943 uint TypePtr::hash(void) const {
2944 return (uint)_ptr + (uint)offset() + (uint)hash_speculative() + (uint)_inline_depth;
2945 }
2946
2947 /**
2948 * Return same type without a speculative part
2949 */
2950 const TypePtr* TypePtr::remove_speculative() const {
2951 if (_speculative == nullptr) {
2952 return this;
2953 }
2954 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
2955 return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth);
2956 }
2957
2958 /**
2959 * Return same type but drop speculative part if we know we won't use
2960 * it
2961 */
2962 const Type* TypePtr::cleanup_speculative() const {
2963 if (speculative() == nullptr) {
2964 return this;
3181 return false;
3182 }
3183 // We already know the speculative type cannot be null
3184 if (!speculative_maybe_null()) {
3185 return false;
3186 }
3187 // We already know this is always null
3188 if (this == TypePtr::NULL_PTR) {
3189 return false;
3190 }
3191 // We already know the speculative type is always null
3192 if (speculative_always_null()) {
3193 return false;
3194 }
3195 if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) {
3196 return false;
3197 }
3198 return true;
3199 }
3200
3201 TypePtr::FlatInArray TypePtr::compute_flat_in_array(ciInstanceKlass* instance_klass, bool is_exact) {
3202 if (!instance_klass->can_be_inline_klass(is_exact)) {
3203 // Definitely not a value class and thus never flat in an array.
3204 return NotFlat;
3205 }
3206 if (instance_klass->is_inlinetype() && instance_klass->as_inline_klass()->is_always_flat_in_array()) {
3207 return Flat;
3208 }
3209 // We don't know.
3210 return MaybeFlat;
3211 }
3212
3213 // Compute flat in array property if we don't know anything about it (i.e. old_flat_in_array == MaybeFlat).
3214 TypePtr::FlatInArray TypePtr::compute_flat_in_array_if_unknown(ciInstanceKlass* instance_klass, bool is_exact,
3215 FlatInArray old_flat_in_array) {
3216 // It is tempting to add verification code that "NotFlat == no value class" and "Flat == value class".
3217 // However, with type speculation, we could get contradicting flat in array properties that propagate through the
3218 // graph. We could try to stop the introduction of contradicting speculative types in terms of their flat in array
3219 // property. But this is hard because it is sometimes only recognized further down in the graph. Thus, we let an
3220 // inconsistent flat in array property propagating through the graph. This could lead to fold an actual live path
3221 // away. But in this case, the speculated type is wrong and we would trap earlier.
3222 if (old_flat_in_array == MaybeFlat) {
3223 return compute_flat_in_array(instance_klass, is_exact);
3224 }
3225 return old_flat_in_array;
3226 }
3227
3228 //------------------------------dump2------------------------------------------
3229 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
3230 "TopPTR","AnyNull","Constant","null","NotNull","BotPTR"
3231 };
3232
3233 #ifndef PRODUCT
3234 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
3235 st->print("ptr:%s", ptr_msg[_ptr]);
3236 dump_offset(st);
3237 dump_inline_depth(st);
3238 dump_speculative(st);
3239 }
3240
3241 void TypePtr::dump_offset(outputStream* st) const {
3242 _offset.dump2(st);
3243 }
3244
3245 /**
3246 *dump the speculative part of the type
3247 */
3248 void TypePtr::dump_speculative(outputStream *st) const {
3249 if (_speculative != nullptr) {
3250 st->print(" (speculative=");
3251 _speculative->dump_on(st);
3252 st->print(")");
3253 }
3254 }
3255
3256 /**
3257 *dump the inline depth of the type
3258 */
3259 void TypePtr::dump_inline_depth(outputStream *st) const {
3260 if (_inline_depth != InlineDepthBottom) {
3261 if (_inline_depth == InlineDepthTop) {
3262 st->print(" (inline_depth=InlineDepthTop)");
3263 } else {
3264 st->print(" (inline_depth=%d)", _inline_depth);
3265 }
3266 }
3267 }
3268
3269 void TypePtr::dump_flat_in_array(FlatInArray flat_in_array, outputStream* st) {
3270 switch (flat_in_array) {
3271 case MaybeFlat:
3272 case NotFlat:
3273 if (!Verbose) {
3274 break;
3275 }
3276 case TopFlat:
3277 case Flat:
3278 st->print(" (%s)", flat_in_array_msg[flat_in_array]);
3279 break;
3280 default:
3281 ShouldNotReachHere();
3282 }
3283 }
3284 #endif
3285
3286 //------------------------------singleton--------------------------------------
3287 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3288 // constants
3289 bool TypePtr::singleton(void) const {
3290 // TopPTR, Null, AnyNull, Constant are all singletons
3291 return (_offset != Offset::bottom) && !below_centerline(_ptr);
3292 }
3293
3294 bool TypePtr::empty(void) const {
3295 return (_offset == Offset::top) || above_centerline(_ptr);
3296 }
3297
3298 //=============================================================================
3299 // Convenience common pre-built types.
3300 const TypeRawPtr *TypeRawPtr::BOTTOM;
3301 const TypeRawPtr *TypeRawPtr::NOTNULL;
3302
3303 //------------------------------make-------------------------------------------
3304 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
3305 assert( ptr != Constant, "what is the constant?" );
3306 assert( ptr != Null, "Use TypePtr for null" );
3307 return (TypeRawPtr*)(new TypeRawPtr(ptr,nullptr))->hashcons();
3308 }
3309
3310 const TypeRawPtr *TypeRawPtr::make(address bits) {
3311 assert(bits != nullptr, "Use TypePtr for null");
3312 return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons();
3313 }
3314
3315 //------------------------------cast_to_ptr_type-------------------------------
3683 #endif
3684
3685 // Can't be implemented because there's no way to know if the type is above or below the center line.
3686 const Type* TypeInterfaces::xmeet(const Type* t) const {
3687 ShouldNotReachHere();
3688 return Type::xmeet(t);
3689 }
3690
3691 bool TypeInterfaces::singleton(void) const {
3692 ShouldNotReachHere();
3693 return Type::singleton();
3694 }
3695
3696 bool TypeInterfaces::has_non_array_interface() const {
3697 assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?");
3698
3699 return !TypeAryPtr::_array_interfaces->contains(this);
3700 }
3701
3702 //------------------------------TypeOopPtr-------------------------------------
3703 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset offset, Offset field_offset,
3704 int instance_id, const TypePtr* speculative, int inline_depth)
3705 : TypePtr(t, ptr, offset, speculative, inline_depth),
3706 _const_oop(o), _klass(k),
3707 _interfaces(interfaces),
3708 _klass_is_exact(xk),
3709 _is_ptr_to_narrowoop(false),
3710 _is_ptr_to_narrowklass(false),
3711 _is_ptr_to_boxed_value(false),
3712 _is_ptr_to_strict_final_field(false),
3713 _instance_id(instance_id) {
3714 #ifdef ASSERT
3715 if (klass() != nullptr && klass()->is_loaded()) {
3716 interfaces->verify_is_loaded();
3717 }
3718 #endif
3719 if (Compile::current()->eliminate_boxing() && (t == InstPtr) &&
3720 (offset.get() > 0) && xk && (k != nullptr) && k->is_instance_klass()) {
3721 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset.get());
3722 _is_ptr_to_strict_final_field = _is_ptr_to_boxed_value;
3723 }
3724
3725 if (klass() != nullptr && klass()->is_instance_klass() && klass()->is_loaded() &&
3726 this->offset() != Type::OffsetBot && this->offset() != Type::OffsetTop) {
3727 ciField* field = klass()->as_instance_klass()->get_field_by_offset(this->offset(), false);
3728 if (field != nullptr && field->is_strict() && field->is_final()) {
3729 _is_ptr_to_strict_final_field = true;
3730 }
3731 }
3732
3733 #ifdef _LP64
3734 if (this->offset() > 0 || this->offset() == Type::OffsetTop || this->offset() == Type::OffsetBot) {
3735 if (this->offset() == oopDesc::klass_offset_in_bytes()) {
3736 _is_ptr_to_narrowklass = true;
3737 } else if (klass() == nullptr) {
3738 // Array with unknown body type
3739 assert(this->isa_aryptr(), "only arrays without klass");
3740 _is_ptr_to_narrowoop = UseCompressedOops;
3741 } else if (UseCompressedOops && this->isa_aryptr() && this->offset() != arrayOopDesc::length_offset_in_bytes()) {
3742 if (klass()->is_flat_array_klass() && field_offset != Offset::top && field_offset != Offset::bottom) {
3743 // Check if the field of the inline type array element contains oops
3744 ciInlineKlass* vk = klass()->as_flat_array_klass()->element_klass()->as_inline_klass();
3745 int foffset = field_offset.get() + vk->payload_offset();
3746 BasicType field_bt;
3747 ciField* field = vk->get_field_by_offset(foffset, false);
3748 if (field != nullptr) {
3749 field_bt = field->layout_type();
3750 } else {
3751 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);
3752 field_bt = T_BOOLEAN;
3753 }
3754 _is_ptr_to_narrowoop = ::is_reference_type(field_bt);
3755 } else if (klass()->is_obj_array_klass()) {
3756 _is_ptr_to_narrowoop = true;
3757 }
3758 } else if (klass()->is_instance_klass()) {
3759 if (this->isa_klassptr()) {
3760 // Perm objects don't use compressed references
3761 } else if (_offset == Offset::bottom || _offset == Offset::top) {
3762 // unsafe access
3763 _is_ptr_to_narrowoop = UseCompressedOops;
3764 } else {
3765 assert(this->isa_instptr(), "must be an instance ptr.");
3766 if (klass() == ciEnv::current()->Class_klass() &&
3767 (this->offset() == java_lang_Class::klass_offset() ||
3768 this->offset() == java_lang_Class::array_klass_offset())) {
3769 // Special hidden fields from the Class.
3770 assert(this->isa_instptr(), "must be an instance ptr.");
3771 _is_ptr_to_narrowoop = false;
3772 } else if (klass() == ciEnv::current()->Class_klass() &&
3773 this->offset() >= InstanceMirrorKlass::offset_of_static_fields()) {
3774 // Static fields
3775 BasicType basic_elem_type = T_ILLEGAL;
3776 if (const_oop() != nullptr) {
3777 ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass();
3778 basic_elem_type = k->get_field_type_by_offset(this->offset(), true);
3779 }
3780 if (basic_elem_type != T_ILLEGAL) {
3781 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3782 } else {
3783 // unsafe access
3784 _is_ptr_to_narrowoop = UseCompressedOops;
3785 }
3786 } else {
3787 // Instance fields which contains a compressed oop references.
3788 ciInstanceKlass* ik = klass()->as_instance_klass();
3789 BasicType basic_elem_type = ik->get_field_type_by_offset(this->offset(), false);
3790 if (basic_elem_type != T_ILLEGAL) {
3791 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3792 } else if (klass()->equals(ciEnv::current()->Object_klass())) {
3793 // Compile::find_alias_type() cast exactness on all types to verify
3794 // that it does not affect alias type.
3795 _is_ptr_to_narrowoop = UseCompressedOops;
3796 } else {
3797 // Type for the copy start in LibraryCallKit::inline_native_clone().
3798 _is_ptr_to_narrowoop = UseCompressedOops;
3799 }
3800 }
3801 }
3802 }
3803 }
3804 #endif // _LP64
3805 }
3806
3807 //------------------------------make-------------------------------------------
3808 const TypeOopPtr *TypeOopPtr::make(PTR ptr, Offset offset, int instance_id,
3809 const TypePtr* speculative, int inline_depth) {
3810 assert(ptr != Constant, "no constant generic pointers");
3811 ciKlass* k = Compile::current()->env()->Object_klass();
3812 bool xk = false;
3813 ciObject* o = nullptr;
3814 const TypeInterfaces* interfaces = TypeInterfaces::make();
3815 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, Offset::bottom, instance_id, speculative, inline_depth))->hashcons();
3816 }
3817
3818
3819 //------------------------------cast_to_ptr_type-------------------------------
3820 const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
3821 assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
3822 if( ptr == _ptr ) return this;
3823 return make(ptr, _offset, _instance_id, _speculative, _inline_depth);
3824 }
3825
3826 //-----------------------------cast_to_instance_id----------------------------
3827 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
3828 // There are no instances of a general oop.
3829 // Return self unchanged.
3830 return this;
3831 }
3832
3833 //-----------------------------cast_to_exactness-------------------------------
3834 const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
3835 // There is no such thing as an exact general oop.
3836 // Return self unchanged.
3837 return this;
3838 }
3839
3840 //------------------------------as_klass_type----------------------------------
3841 // Return the klass type corresponding to this instance or array type.
3842 // It is the type that is loaded from an object of this type.
3843 const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const {
3844 ShouldNotReachHere();
3845 return nullptr;
3846 }
3847
3848 //------------------------------meet-------------------------------------------
3849 // Compute the MEET of two types. It returns a new Type object.
3850 const Type *TypeOopPtr::xmeet_helper(const Type *t) const {
3851 // Perform a fast test for common case; meeting the same types together.
3852 if( this == t ) return this; // Meeting same type-rep?
3853
3854 // Current "this->_base" is OopPtr
3855 switch (t->base()) { // switch on original type
3856
3857 case Int: // Mixing ints & oops happens when javac
3858 case Long: // reuses local variables
3859 case HalfFloatTop:
3868 case NarrowOop:
3869 case NarrowKlass:
3870 case Bottom: // Ye Olde Default
3871 return Type::BOTTOM;
3872 case Top:
3873 return this;
3874
3875 default: // All else is a mistake
3876 typerr(t);
3877
3878 case RawPtr:
3879 case MetadataPtr:
3880 case KlassPtr:
3881 case InstKlassPtr:
3882 case AryKlassPtr:
3883 return TypePtr::BOTTOM; // Oop meet raw is not well defined
3884
3885 case AnyPtr: {
3886 // Found an AnyPtr type vs self-OopPtr type
3887 const TypePtr *tp = t->is_ptr();
3888 Offset offset = meet_offset(tp->offset());
3889 PTR ptr = meet_ptr(tp->ptr());
3890 const TypePtr* speculative = xmeet_speculative(tp);
3891 int depth = meet_inline_depth(tp->inline_depth());
3892 switch (tp->ptr()) {
3893 case Null:
3894 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3895 // else fall through:
3896 case TopPTR:
3897 case AnyNull: {
3898 int instance_id = meet_instance_id(InstanceTop);
3899 return make(ptr, offset, instance_id, speculative, depth);
3900 }
3901 case BotPTR:
3902 case NotNull:
3903 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3904 default: typerr(t);
3905 }
3906 }
3907
3908 case OopPtr: { // Meeting to other OopPtrs
3910 int instance_id = meet_instance_id(tp->instance_id());
3911 const TypePtr* speculative = xmeet_speculative(tp);
3912 int depth = meet_inline_depth(tp->inline_depth());
3913 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth);
3914 }
3915
3916 case InstPtr: // For these, flip the call around to cut down
3917 case AryPtr:
3918 return t->xmeet(this); // Call in reverse direction
3919
3920 } // End of switch
3921 return this; // Return the double constant
3922 }
3923
3924
3925 //------------------------------xdual------------------------------------------
3926 // Dual of a pure heap pointer. No relevant klass or oop information.
3927 const Type *TypeOopPtr::xdual() const {
3928 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here");
3929 assert(const_oop() == nullptr, "no constants here");
3930 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());
3931 }
3932
3933 //--------------------------make_from_klass_common-----------------------------
3934 // Computes the element-type given a klass.
3935 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) {
3936 if (klass->is_instance_klass() || klass->is_inlinetype()) {
3937 Compile* C = Compile::current();
3938 Dependencies* deps = C->dependencies();
3939 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
3940 // Element is an instance
3941 bool klass_is_exact = false;
3942 ciInstanceKlass* ik = klass->as_instance_klass();
3943 if (klass->is_loaded()) {
3944 // Try to set klass_is_exact.
3945 klass_is_exact = ik->is_final();
3946 if (!klass_is_exact && klass_change
3947 && deps != nullptr && UseUniqueSubclasses) {
3948 ciInstanceKlass* sub = ik->unique_concrete_subklass();
3949 if (sub != nullptr) {
3950 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
3951 klass = ik = sub;
3952 klass_is_exact = sub->is_final();
3953 }
3954 }
3955 if (!klass_is_exact && try_for_exact && deps != nullptr &&
3956 !ik->is_interface() && !ik->has_subklass()) {
3957 // Add a dependence; if concrete subclass added we need to recompile
3958 deps->assert_leaf_type(ik);
3959 klass_is_exact = true;
3960 }
3961 }
3962 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact);
3963 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
3964 return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, Offset(0), flat_in_array);
3965 } else if (klass->is_obj_array_klass()) {
3966 // Element is an object or inline type array. Recursively call ourself.
3967 ciObjArrayKlass* array_klass = klass->as_obj_array_klass();
3968 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_common(array_klass->element_klass(), /* klass_change= */ false, try_for_exact, interface_handling);
3969 bool xk = array_klass->is_loaded() && array_klass->is_refined();
3970
3971 // Determine null-free/flat properties
3972 bool flat;
3973 bool not_flat;
3974 bool is_null_free;
3975 bool not_null_free;
3976 bool atomic;
3977 if (xk) {
3978 flat = array_klass->is_flat_array_klass();
3979 not_flat = !flat;
3980 is_null_free = array_klass->is_elem_null_free();
3981 not_null_free = !is_null_free;
3982 atomic = array_klass->is_elem_atomic();
3983
3984 if (is_null_free) {
3985 etype = etype->join_speculative(NOTNULL)->is_oopptr();
3986 }
3987 } else {
3988 const TypeOopPtr* exact_etype = etype;
3989 if (etype->can_be_inline_type()) {
3990 // Use exact type if element can be an inline type
3991 exact_etype = TypeOopPtr::make_from_klass_common(klass->as_array_klass()->element_klass(), /* klass_change= */ true, /* try_for_exact= */ true, interface_handling);
3992 }
3993
3994 flat = false;
3995 bool not_inline = !exact_etype->can_be_inline_type();
3996 not_null_free = not_inline;
3997 not_flat = !UseArrayFlattening || not_inline || (exact_etype->is_inlinetypeptr() && !exact_etype->inline_klass()->maybe_flat_in_array());
3998 atomic = not_flat;
3999 }
4000
4001 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS, /* stable= */ false, flat, not_flat, not_null_free, atomic);
4002 // We used to pass NotNull in here, asserting that the sub-arrays
4003 // are all not-null. This is not true in generally, as code can
4004 // slam nullptrs down in the subarrays.
4005 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, Offset(0));
4006 return arr;
4007 } else if (klass->is_type_array_klass()) {
4008 // Element is an typeArray
4009 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
4010 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS,
4011 /* stable= */ false, /* flat= */ false, /* not_flat= */ true, /* not_null_free= */ true, true);
4012 // We used to pass NotNull in here, asserting that the array pointer
4013 // is not-null. That was not true in general.
4014 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, Offset(0));
4015 return arr;
4016 } else {
4017 ShouldNotReachHere();
4018 return nullptr;
4019 }
4020 }
4021
4022 //------------------------------make_from_constant-----------------------------
4023 // Make a java pointer from an oop constant
4024 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) {
4025 assert(!o->is_null_object(), "null object not yet handled here.");
4026
4027 const bool make_constant = require_constant || o->should_be_constant();
4028
4029 ciKlass* klass = o->klass();
4030 if (klass->is_instance_klass() || klass->is_inlinetype()) {
4031 // Element is an instance or inline type
4032 if (make_constant) {
4033 return TypeInstPtr::make(o);
4034 } else {
4035 return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, Offset(0));
4036 }
4037 } else if (klass->is_obj_array_klass()) {
4038 // Element is an object array. Recursively call ourself.
4039 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_raw(klass->as_array_klass()->element_klass(), trust_interfaces);
4040 bool is_flat = o->as_array()->is_flat();
4041 bool is_null_free = o->as_array()->is_null_free();
4042 if (is_null_free) {
4043 etype = etype->join_speculative(TypePtr::NOTNULL)->is_oopptr();
4044 }
4045 bool is_atomic = o->as_array()->is_atomic();
4046 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ is_flat,
4047 /* not_flat= */ !is_flat, /* not_null_free= */ !is_null_free, /* atomic= */ is_atomic);
4048 // We used to pass NotNull in here, asserting that the sub-arrays
4049 // are all not-null. This is not true in generally, as code can
4050 // slam nulls down in the subarrays.
4051 if (make_constant) {
4052 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0));
4053 } else {
4054 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0));
4055 }
4056 } else if (klass->is_type_array_klass()) {
4057 // Element is an typeArray
4058 const Type* etype = (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
4059 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ false,
4060 /* not_flat= */ true, /* not_null_free= */ true, true);
4061 // We used to pass NotNull in here, asserting that the array pointer
4062 // is not-null. That was not true in general.
4063 if (make_constant) {
4064 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0));
4065 } else {
4066 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0));
4067 }
4068 }
4069
4070 fatal("unhandled object type");
4071 return nullptr;
4072 }
4073
4074 //------------------------------get_con----------------------------------------
4075 intptr_t TypeOopPtr::get_con() const {
4076 assert( _ptr == Null || _ptr == Constant, "" );
4077 assert(offset() >= 0, "");
4078
4079 if (offset() != 0) {
4080 // After being ported to the compiler interface, the compiler no longer
4081 // directly manipulates the addresses of oops. Rather, it only has a pointer
4082 // to a handle at compile time. This handle is embedded in the generated
4083 // code and dereferenced at the time the nmethod is made. Until that time,
4084 // it is not reasonable to do arithmetic with the addresses of oops (we don't
4085 // have access to the addresses!). This does not seem to currently happen,
4086 // but this assertion here is to help prevent its occurrence.
4087 tty->print_cr("Found oop constant with non-zero offset");
4088 ShouldNotReachHere();
4089 }
4090
4091 return (intptr_t)const_oop()->constant_encoding();
4092 }
4093
4094
4095 //-----------------------------filter------------------------------------------
4096 // Do not allow interface-vs.-noninterface joins to collapse to top.
4097 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const {
4098
4099 const Type* ft = join_helper(kills, include_speculative);
4145 dump_speculative(st);
4146 }
4147
4148 void TypeOopPtr::dump_instance_id(outputStream* st) const {
4149 if (_instance_id == InstanceTop) {
4150 st->print(",iid=top");
4151 } else if (_instance_id == InstanceBot) {
4152 st->print(",iid=bot");
4153 } else {
4154 st->print(",iid=%d", _instance_id);
4155 }
4156 }
4157 #endif
4158
4159 //------------------------------singleton--------------------------------------
4160 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
4161 // constants
4162 bool TypeOopPtr::singleton(void) const {
4163 // detune optimizer to not generate constant oop + constant offset as a constant!
4164 // TopPTR, Null, AnyNull, Constant are all singletons
4165 return (offset() == 0) && !below_centerline(_ptr);
4166 }
4167
4168 //------------------------------add_offset-------------------------------------
4169 const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const {
4170 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
4171 }
4172
4173 const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const {
4174 return make(_ptr, Offset(offset), _instance_id, with_offset_speculative(offset), _inline_depth);
4175 }
4176
4177 /**
4178 * Return same type without a speculative part
4179 */
4180 const TypeOopPtr* TypeOopPtr::remove_speculative() const {
4181 if (_speculative == nullptr) {
4182 return this;
4183 }
4184 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4185 return make(_ptr, _offset, _instance_id, nullptr, _inline_depth);
4186 }
4187
4188 /**
4189 * Return same type but drop speculative part if we know we won't use
4190 * it
4191 */
4192 const Type* TypeOopPtr::cleanup_speculative() const {
4193 // If the klass is exact and the ptr is not null then there's
4194 // nothing that the speculative type can help us with
4267 const TypeInstPtr *TypeInstPtr::BOTTOM;
4268 const TypeInstPtr *TypeInstPtr::MIRROR;
4269 const TypeInstPtr *TypeInstPtr::MARK;
4270 const TypeInstPtr *TypeInstPtr::KLASS;
4271
4272 // Is there a single ciKlass* that can represent that type?
4273 ciKlass* TypeInstPtr::exact_klass_helper() const {
4274 if (_interfaces->empty()) {
4275 return _klass;
4276 }
4277 if (_klass != ciEnv::current()->Object_klass()) {
4278 if (_interfaces->eq(_klass->as_instance_klass())) {
4279 return _klass;
4280 }
4281 return nullptr;
4282 }
4283 return _interfaces->exact_klass();
4284 }
4285
4286 //------------------------------TypeInstPtr-------------------------------------
4287 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset off,
4288 FlatInArray flat_in_array, int instance_id, const TypePtr* speculative, int inline_depth)
4289 : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, Offset::bottom, instance_id, speculative, inline_depth),
4290 _flat_in_array(flat_in_array) {
4291
4292 assert(flat_in_array != Uninitialized, "must be set now");
4293 assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here");
4294 assert(k != nullptr &&
4295 (k->is_loaded() || o == nullptr),
4296 "cannot have constants with non-loaded klass");
4297 };
4298
4299 //------------------------------make-------------------------------------------
4300 const TypeInstPtr *TypeInstPtr::make(PTR ptr,
4301 ciKlass* k,
4302 const TypeInterfaces* interfaces,
4303 bool xk,
4304 ciObject* o,
4305 Offset offset,
4306 FlatInArray flat_in_array,
4307 int instance_id,
4308 const TypePtr* speculative,
4309 int inline_depth) {
4310 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance");
4311 // Either const_oop() is null or else ptr is Constant
4312 assert( (!o && ptr != Constant) || (o && ptr == Constant),
4313 "constant pointers must have a value supplied" );
4314 // Ptr is never Null
4315 assert( ptr != Null, "null pointers are not typed" );
4316
4317 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4318 ciInstanceKlass* ik = k->as_instance_klass();
4319 if (ptr == Constant) {
4320 // Note: This case includes meta-object constants, such as methods.
4321 xk = true;
4322 } else if (k->is_loaded()) {
4323 if (!xk && ik->is_final()) xk = true; // no inexact final klass
4324 assert(!ik->is_interface(), "no interface here");
4325 if (xk && ik->is_interface()) xk = false; // no exact interface
4326 }
4327
4328 if (flat_in_array == Uninitialized) {
4329 flat_in_array = compute_flat_in_array(ik, xk);
4330 }
4331 // Now hash this baby
4332 TypeInstPtr *result =
4333 (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o, offset, flat_in_array, instance_id, speculative, inline_depth))->hashcons();
4334
4335 return result;
4336 }
4337
4338 const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) {
4339 if (k->is_instance_klass()) {
4340 if (k->is_loaded()) {
4341 if (k->is_interface() && interface_handling == ignore_interfaces) {
4342 assert(interface, "no interface expected");
4343 k = ciEnv::current()->Object_klass();
4344 const TypeInterfaces* interfaces = TypeInterfaces::make();
4345 return interfaces;
4346 }
4347 GrowableArray<ciInstanceKlass *>* k_interfaces = k->as_instance_klass()->transitive_interfaces();
4348 const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces);
4349 if (k->is_interface()) {
4350 assert(interface, "no interface expected");
4351 k = ciEnv::current()->Object_klass();
4352 } else {
4353 assert(klass, "no instance klass expected");
4379 switch (bt) {
4380 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
4381 case T_INT: return TypeInt::make(constant.as_int());
4382 case T_CHAR: return TypeInt::make(constant.as_char());
4383 case T_BYTE: return TypeInt::make(constant.as_byte());
4384 case T_SHORT: return TypeInt::make(constant.as_short());
4385 case T_FLOAT: return TypeF::make(constant.as_float());
4386 case T_DOUBLE: return TypeD::make(constant.as_double());
4387 case T_LONG: return TypeLong::make(constant.as_long());
4388 default: break;
4389 }
4390 fatal("Invalid boxed value type '%s'", type2name(bt));
4391 return nullptr;
4392 }
4393
4394 //------------------------------cast_to_ptr_type-------------------------------
4395 const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
4396 if( ptr == _ptr ) return this;
4397 // Reconstruct _sig info here since not a problem with later lazy
4398 // construction, _sig will show up on demand.
4399 return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _flat_in_array, _instance_id, _speculative, _inline_depth);
4400 }
4401
4402
4403 //-----------------------------cast_to_exactness-------------------------------
4404 const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
4405 if( klass_is_exact == _klass_is_exact ) return this;
4406 if (!_klass->is_loaded()) return this;
4407 ciInstanceKlass* ik = _klass->as_instance_klass();
4408 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
4409 assert(!ik->is_interface(), "no interface here");
4410 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact);
4411 return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, flat_in_array, _instance_id, _speculative, _inline_depth);
4412 }
4413
4414 //-----------------------------cast_to_instance_id----------------------------
4415 const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const {
4416 if( instance_id == _instance_id ) return this;
4417 return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth);
4418 }
4419
4420 //------------------------------xmeet_unloaded---------------------------------
4421 // Compute the MEET of two InstPtrs when at least one is unloaded.
4422 // Assume classes are different since called after check for same name/class-loader
4423 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const {
4424 Offset off = meet_offset(tinst->offset());
4425 PTR ptr = meet_ptr(tinst->ptr());
4426 int instance_id = meet_instance_id(tinst->instance_id());
4427 const TypePtr* speculative = xmeet_speculative(tinst);
4428 int depth = meet_inline_depth(tinst->inline_depth());
4429
4430 const TypeInstPtr *loaded = is_loaded() ? this : tinst;
4431 const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
4432 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
4433 //
4434 // Meet unloaded class with java/lang/Object
4435 //
4436 // Meet
4437 // | Unloaded Class
4438 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
4439 // ===================================================================
4440 // TOP | ..........................Unloaded......................|
4441 // AnyNull | U-AN |................Unloaded......................|
4442 // Constant | ... O-NN .................................. | O-BOT |
4443 // NotNull | ... O-NN .................................. | O-BOT |
4444 // BOTTOM | ........................Object-BOTTOM ..................|
4445 //
4446 assert(loaded->ptr() != TypePtr::Null, "insanity check");
4447 //
4448 if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4449 else if (loaded->ptr() == TypePtr::AnyNull) {
4450 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array());
4451 return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, flat_in_array, instance_id,
4452 speculative, depth);
4453 }
4454 else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4455 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
4456 if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4457 else { return TypeInstPtr::NOTNULL->with_speculative(speculative); }
4458 }
4459 else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4460
4461 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative);
4462 }
4463
4464 // Both are unloaded, not the same class, not Object
4465 // Or meet unloaded with a different loaded class, not java/lang/Object
4466 if (ptr != TypePtr::BotPTR) {
4467 return TypeInstPtr::NOTNULL->with_speculative(speculative);
4468 }
4469 return TypeInstPtr::BOTTOM->with_speculative(speculative);
4470 }
4471
4472
4473 //------------------------------meet-------------------------------------------
4497 case Top:
4498 return this;
4499
4500 default: // All else is a mistake
4501 typerr(t);
4502
4503 case MetadataPtr:
4504 case KlassPtr:
4505 case InstKlassPtr:
4506 case AryKlassPtr:
4507 case RawPtr: return TypePtr::BOTTOM;
4508
4509 case AryPtr: { // All arrays inherit from Object class
4510 // Call in reverse direction to avoid duplication
4511 return t->is_aryptr()->xmeet_helper(this);
4512 }
4513
4514 case OopPtr: { // Meeting to OopPtrs
4515 // Found a OopPtr type vs self-InstPtr type
4516 const TypeOopPtr *tp = t->is_oopptr();
4517 Offset offset = meet_offset(tp->offset());
4518 PTR ptr = meet_ptr(tp->ptr());
4519 switch (tp->ptr()) {
4520 case TopPTR:
4521 case AnyNull: {
4522 int instance_id = meet_instance_id(InstanceTop);
4523 const TypePtr* speculative = xmeet_speculative(tp);
4524 int depth = meet_inline_depth(tp->inline_depth());
4525 return make(ptr, klass(), _interfaces, klass_is_exact(),
4526 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth);
4527 }
4528 case NotNull:
4529 case BotPTR: {
4530 int instance_id = meet_instance_id(tp->instance_id());
4531 const TypePtr* speculative = xmeet_speculative(tp);
4532 int depth = meet_inline_depth(tp->inline_depth());
4533 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4534 }
4535 default: typerr(t);
4536 }
4537 }
4538
4539 case AnyPtr: { // Meeting to AnyPtrs
4540 // Found an AnyPtr type vs self-InstPtr type
4541 const TypePtr *tp = t->is_ptr();
4542 Offset offset = meet_offset(tp->offset());
4543 PTR ptr = meet_ptr(tp->ptr());
4544 int instance_id = meet_instance_id(InstanceTop);
4545 const TypePtr* speculative = xmeet_speculative(tp);
4546 int depth = meet_inline_depth(tp->inline_depth());
4547 switch (tp->ptr()) {
4548 case Null:
4549 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4550 // else fall through to AnyNull
4551 case TopPTR:
4552 case AnyNull: {
4553 return make(ptr, klass(), _interfaces, klass_is_exact(),
4554 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth);
4555 }
4556 case NotNull:
4557 case BotPTR:
4558 return TypePtr::make(AnyPtr, ptr, offset, speculative,depth);
4559 default: typerr(t);
4560 }
4561 }
4562
4563 /*
4564 A-top }
4565 / | \ } Tops
4566 B-top A-any C-top }
4567 | / | \ | } Any-nulls
4568 B-any | C-any }
4569 | | |
4570 B-con A-con C-con } constants; not comparable across classes
4571 | | |
4572 B-not | C-not }
4573 | \ | / | } not-nulls
4574 B-bot A-not C-bot }
4575 \ | / } Bottoms
4576 A-bot }
4577 */
4578
4579 case InstPtr: { // Meeting 2 Oops?
4580 // Found an InstPtr sub-type vs self-InstPtr type
4581 const TypeInstPtr *tinst = t->is_instptr();
4582 Offset off = meet_offset(tinst->offset());
4583 PTR ptr = meet_ptr(tinst->ptr());
4584 int instance_id = meet_instance_id(tinst->instance_id());
4585 const TypePtr* speculative = xmeet_speculative(tinst);
4586 int depth = meet_inline_depth(tinst->inline_depth());
4587 const TypeInterfaces* interfaces = meet_interfaces(tinst);
4588
4589 ciKlass* tinst_klass = tinst->klass();
4590 ciKlass* this_klass = klass();
4591
4592 ciKlass* res_klass = nullptr;
4593 bool res_xk = false;
4594 const Type* res;
4595 MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk);
4596
4597 if (kind == UNLOADED) {
4598 // One of these classes has not been loaded
4599 const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces);
4600 #ifndef PRODUCT
4601 if (PrintOpto && Verbose) {
4602 tty->print("meet of unloaded classes resulted in: ");
4603 unloaded_meet->dump();
4604 tty->cr();
4605 tty->print(" this == ");
4606 dump();
4607 tty->cr();
4608 tty->print(" tinst == ");
4609 tinst->dump();
4610 tty->cr();
4611 }
4612 #endif
4613 res = unloaded_meet;
4614 } else {
4615 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array());
4616 if (kind == NOT_SUBTYPE && instance_id > 0) {
4617 instance_id = InstanceBot;
4618 } else if (kind == LCA) {
4619 instance_id = InstanceBot;
4620 }
4621 ciObject* o = nullptr; // Assume not constant when done
4622 ciObject* this_oop = const_oop();
4623 ciObject* tinst_oop = tinst->const_oop();
4624 if (ptr == Constant) {
4625 if (this_oop != nullptr && tinst_oop != nullptr &&
4626 this_oop->equals(tinst_oop))
4627 o = this_oop;
4628 else if (above_centerline(_ptr)) {
4629 assert(!tinst_klass->is_interface(), "");
4630 o = tinst_oop;
4631 } else if (above_centerline(tinst->_ptr)) {
4632 assert(!this_klass->is_interface(), "");
4633 o = this_oop;
4634 } else
4635 ptr = NotNull;
4636 }
4637 res = make(ptr, res_klass, interfaces, res_xk, o, off, flat_in_array, instance_id, speculative, depth);
4638 }
4639
4640 return res;
4641
4642 } // End of case InstPtr
4643
4644 } // End of switch
4645 return this; // Return the double constant
4646 }
4647
4648 template<class T> TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type,
4649 ciKlass*& res_klass, bool& res_xk) {
4650 ciKlass* this_klass = this_type->klass();
4651 ciKlass* other_klass = other_type->klass();
4652
4653 bool this_xk = this_type->klass_is_exact();
4654 bool other_xk = other_type->klass_is_exact();
4655 PTR this_ptr = this_type->ptr();
4656 PTR other_ptr = other_type->ptr();
4657 const TypeInterfaces* this_interfaces = this_type->interfaces();
4658 const TypeInterfaces* other_interfaces = other_type->interfaces();
4659 // Check for easy case; klasses are equal (and perhaps not loaded!)
4660 // If we have constants, then we created oops so classes are loaded
4661 // and we can handle the constants further down. This case handles
4662 // both-not-loaded or both-loaded classes
4663 if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) {
4664 res_klass = this_klass;
4665 res_xk = this_xk;
4666 return QUICK;
4667 }
4668
4669 // Classes require inspection in the Java klass hierarchy. Must be loaded.
4670 if (!other_klass->is_loaded() || !this_klass->is_loaded()) {
4671 return UNLOADED;
4672 }
4678 // If both are up and they do NOT subtype, "fall hard".
4679 // If both are down and they subtype, take the supertype class.
4680 // If both are down and they do NOT subtype, "fall hard".
4681 // Constants treated as down.
4682
4683 // Now, reorder the above list; observe that both-down+subtype is also
4684 // "fall hard"; "fall hard" becomes the default case:
4685 // If we split one up & one down AND they subtype, take the down man.
4686 // If both are up and they subtype, take the subtype class.
4687
4688 // If both are down and they subtype, "fall hard".
4689 // If both are down and they do NOT subtype, "fall hard".
4690 // If both are up and they do NOT subtype, "fall hard".
4691 // If we split one up & one down AND they do NOT subtype, "fall hard".
4692
4693 // If a proper subtype is exact, and we return it, we return it exactly.
4694 // If a proper supertype is exact, there can be no subtyping relationship!
4695 // If both types are equal to the subtype, exactness is and-ed below the
4696 // centerline and or-ed above it. (N.B. Constants are always exact.)
4697
4698 const T* subtype = nullptr;
4699 bool subtype_exact = false;
4700 if (this_type->is_same_java_type_as(other_type)) {
4701 // Same klass
4702 subtype = this_type;
4703 subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk);
4704 } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) {
4705 subtype = this_type; // Pick subtyping class
4706 subtype_exact = this_xk;
4707 } else if (!this_xk && other_type->is_meet_subtype_of(this_type)) {
4708 subtype = other_type; // Pick subtyping class
4709 subtype_exact = other_xk;
4710 }
4711
4712 if (subtype != nullptr) {
4713 if (above_centerline(ptr)) {
4714 // Both types are empty.
4715 this_type = other_type = subtype;
4716 this_xk = other_xk = subtype_exact;
4717 } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) {
4718 // this_type is empty while other_type is not. Take other_type.
4719 this_type = other_type;
4720 this_xk = other_xk;
4721 } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) {
4722 // other_type is empty while this_type is not. Take this_type.
4723 other_type = this_type; // this is down; keep down man
4724 } else {
4725 // this_type and other_type are both non-empty.
4726 this_xk = subtype_exact; // either they are equal, or we'll do an LCA
4727 }
4728 }
4729
4730 // Check for classes now being equal
4731 if (this_type->is_same_java_type_as(other_type)) {
4732 // If the klasses are equal, the constants may still differ. Fall to
4733 // NotNull if they do (neither constant is null; that is a special case
4734 // handled elsewhere).
4735 res_klass = this_type->klass();
4736 res_xk = this_xk;
4737 return SUBTYPE;
4738 } // Else classes are not equal
4739
4740 // Since klasses are different, we require a LCA in the Java
4741 // class hierarchy - which means we have to fall to at least NotNull.
4742 if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) {
4743 ptr = NotNull;
4744 }
4745
4746 interfaces = this_interfaces->intersection_with(other_interfaces);
4747
4748 // Now we find the LCA of Java classes
4749 ciKlass* k = this_klass->least_common_ancestor(other_klass);
4750
4751 res_klass = k;
4752 res_xk = false;
4753 return LCA;
4754 }
4755
4756 // Top-Flat Flat Not-Flat Maybe-Flat
4757 // -------------------------------------------------------------
4758 // Top-Flat Top-Flat Flat Not-Flat Maybe-Flat
4759 // Flat Flat Flat Maybe-Flat Maybe-Flat
4760 // Not-Flat Not-Flat Maybe-Flat Not-Flat Maybe-Flat
4761 // Maybe-Flat Maybe-Flat Maybe-Flat Maybe-Flat Maybe-flat
4762 TypePtr::FlatInArray TypePtr::meet_flat_in_array(const FlatInArray left, const FlatInArray right) {
4763 if (left == TopFlat) {
4764 return right;
4765 }
4766 if (right == TopFlat) {
4767 return left;
4768 }
4769 if (left == MaybeFlat || right == MaybeFlat) {
4770 return MaybeFlat;
4771 }
4772
4773 switch (left) {
4774 case Flat:
4775 if (right == Flat) {
4776 return Flat;
4777 }
4778 return MaybeFlat;
4779 case NotFlat:
4780 if (right == NotFlat) {
4781 return NotFlat;
4782 }
4783 return MaybeFlat;
4784 default:
4785 ShouldNotReachHere();
4786 return Uninitialized;
4787 }
4788 }
4789
4790 //------------------------java_mirror_type--------------------------------------
4791 ciType* TypeInstPtr::java_mirror_type() const {
4792 // must be a singleton type
4793 if( const_oop() == nullptr ) return nullptr;
4794
4795 // must be of type java.lang.Class
4796 if( klass() != ciEnv::current()->Class_klass() ) return nullptr;
4797 return const_oop()->as_instance()->java_mirror_type();
4798 }
4799
4800
4801 //------------------------------xdual------------------------------------------
4802 // Dual: do NOT dual on klasses. This means I do NOT understand the Java
4803 // inheritance mechanism.
4804 const Type* TypeInstPtr::xdual() const {
4805 return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(),
4806 dual_flat_in_array(), dual_instance_id(), dual_speculative(), dual_inline_depth());
4807 }
4808
4809 //------------------------------eq---------------------------------------------
4810 // Structural equality check for Type representations
4811 bool TypeInstPtr::eq( const Type *t ) const {
4812 const TypeInstPtr *p = t->is_instptr();
4813 return
4814 klass()->equals(p->klass()) &&
4815 _flat_in_array == p->_flat_in_array &&
4816 _interfaces->eq(p->_interfaces) &&
4817 TypeOopPtr::eq(p); // Check sub-type stuff
4818 }
4819
4820 //------------------------------hash-------------------------------------------
4821 // Type-specific hashing function.
4822 uint TypeInstPtr::hash() const {
4823 return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash() + static_cast<uint>(_flat_in_array);
4824 }
4825
4826 bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4827 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4828 }
4829
4830
4831 bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4832 return TypePtr::is_same_java_type_as_helper_for_instance(this, other);
4833 }
4834
4835 bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4836 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4837 }
4838
4839
4840 //------------------------------dump2------------------------------------------
4841 // Dump oop Type
4842 #ifndef PRODUCT
4843 void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const {
4847 _interfaces->dump(st);
4848
4849 if (_ptr == Constant && (WizardMode || Verbose)) {
4850 ResourceMark rm;
4851 stringStream ss;
4852
4853 st->print(" ");
4854 const_oop()->print_oop(&ss);
4855 // 'const_oop->print_oop()' may emit newlines('\n') into ss.
4856 // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node.
4857 char* buf = ss.as_string(/* c_heap= */false);
4858 StringUtils::replace_no_expand(buf, "\n", "");
4859 st->print_raw(buf);
4860 }
4861
4862 st->print(":%s", ptr_msg[_ptr]);
4863 if (_klass_is_exact) {
4864 st->print(":exact");
4865 }
4866
4867 st->print(" *");
4868
4869 dump_offset(st);
4870 dump_instance_id(st);
4871 dump_inline_depth(st);
4872 dump_speculative(st);
4873 dump_flat_in_array(_flat_in_array, st);
4874 }
4875 #endif
4876
4877 bool TypeInstPtr::empty() const {
4878 if (_flat_in_array == TopFlat) {
4879 return true;
4880 }
4881 return TypeOopPtr::empty();
4882 }
4883
4884 //------------------------------add_offset-------------------------------------
4885 const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const {
4886 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset), _flat_in_array,
4887 _instance_id, add_offset_speculative(offset), _inline_depth);
4888 }
4889
4890 const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const {
4891 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), Offset(offset), _flat_in_array,
4892 _instance_id, with_offset_speculative(offset), _inline_depth);
4893 }
4894
4895 const TypeInstPtr* TypeInstPtr::remove_speculative() const {
4896 if (_speculative == nullptr) {
4897 return this;
4898 }
4899 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4900 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array,
4901 _instance_id, nullptr, _inline_depth);
4902 }
4903
4904 const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const {
4905 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, speculative, _inline_depth);
4906 }
4907
4908 const TypePtr* TypeInstPtr::with_inline_depth(int depth) const {
4909 if (!UseInlineDepthForSpeculativeTypes) {
4910 return this;
4911 }
4912 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, _speculative, depth);
4913 }
4914
4915 const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const {
4916 assert(is_known_instance(), "should be known");
4917 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth);
4918 }
4919
4920 const TypeInstPtr *TypeInstPtr::cast_to_flat_in_array() const {
4921 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, Flat, _instance_id, _speculative, _inline_depth);
4922 }
4923
4924 const TypeInstPtr *TypeInstPtr::cast_to_maybe_flat_in_array() const {
4925 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, MaybeFlat, _instance_id, _speculative, _inline_depth);
4926 }
4927
4928 const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const {
4929 bool xk = klass_is_exact();
4930 ciInstanceKlass* ik = klass()->as_instance_klass();
4931 if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) {
4932 if (_interfaces->eq(ik)) {
4933 Compile* C = Compile::current();
4934 Dependencies* deps = C->dependencies();
4935 deps->assert_leaf_type(ik);
4936 xk = true;
4937 }
4938 }
4939 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array);
4940 return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, Offset(0), flat_in_array);
4941 }
4942
4943 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) {
4944 static_assert(std::is_base_of<T2, T1>::value, "");
4945
4946 if (!this_one->is_instance_type(other)) {
4947 return false;
4948 }
4949
4950 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4951 return true;
4952 }
4953
4954 return this_one->klass()->is_subtype_of(other->klass()) &&
4955 (!this_xk || this_one->_interfaces->contains(other->_interfaces));
4956 }
4957
4958
4959 bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4960 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4965 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4966 return true;
4967 }
4968
4969 if (this_one->is_instance_type(other)) {
4970 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces);
4971 }
4972
4973 int dummy;
4974 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
4975 if (this_top_or_bottom) {
4976 return false;
4977 }
4978
4979 const T1* other_ary = this_one->is_array_type(other);
4980 const TypePtr* other_elem = other_ary->elem()->make_ptr();
4981 const TypePtr* this_elem = this_one->elem()->make_ptr();
4982 if (other_elem != nullptr && this_elem != nullptr) {
4983 return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk);
4984 }
4985 if (other_elem == nullptr && this_elem == nullptr) {
4986 return this_one->klass()->is_subtype_of(other->klass());
4987 }
4988
4989 return false;
4990 }
4991
4992 bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4993 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4994 }
4995
4996 bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4997 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4998 }
4999
5000 bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
5001 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
5002 }
5003
5004 //=============================================================================
5005 // Convenience common pre-built types.
5006 const TypeAryPtr* TypeAryPtr::BOTTOM;
5007 const TypeAryPtr *TypeAryPtr::RANGE;
5008 const TypeAryPtr *TypeAryPtr::OOPS;
5009 const TypeAryPtr *TypeAryPtr::NARROWOOPS;
5010 const TypeAryPtr *TypeAryPtr::BYTES;
5011 const TypeAryPtr *TypeAryPtr::SHORTS;
5012 const TypeAryPtr *TypeAryPtr::CHARS;
5013 const TypeAryPtr *TypeAryPtr::INTS;
5014 const TypeAryPtr *TypeAryPtr::LONGS;
5015 const TypeAryPtr *TypeAryPtr::FLOATS;
5016 const TypeAryPtr *TypeAryPtr::DOUBLES;
5017 const TypeAryPtr *TypeAryPtr::INLINES;
5018
5019 //------------------------------make-------------------------------------------
5020 const TypeAryPtr* TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset,
5021 int instance_id, const TypePtr* speculative, int inline_depth) {
5022 assert(!(k == nullptr && ary->_elem->isa_int()),
5023 "integral arrays must be pre-equipped with a class");
5024 if (!xk) xk = ary->ary_must_be_exact();
5025 assert(instance_id <= 0 || xk, "instances are always exactly typed");
5026 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
5027 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
5028 k = nullptr;
5029 }
5030 return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, field_offset, instance_id, false, speculative, inline_depth))->hashcons();
5031 }
5032
5033 //------------------------------make-------------------------------------------
5034 const TypeAryPtr* TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset,
5035 int instance_id, const TypePtr* speculative, int inline_depth,
5036 bool is_autobox_cache) {
5037 assert(!(k == nullptr && ary->_elem->isa_int()),
5038 "integral arrays must be pre-equipped with a class");
5039 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
5040 if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact();
5041 assert(instance_id <= 0 || xk, "instances are always exactly typed");
5042 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
5043 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
5044 k = nullptr;
5045 }
5046 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, field_offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons();
5047 }
5048
5049 //------------------------------cast_to_ptr_type-------------------------------
5050 const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
5051 if( ptr == _ptr ) return this;
5052 return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5053 }
5054
5055
5056 //-----------------------------cast_to_exactness-------------------------------
5057 const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
5058 if( klass_is_exact == _klass_is_exact ) return this;
5059 if (_ary->ary_must_be_exact()) return this; // cannot clear xk
5060 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5061 }
5062
5063 //-----------------------------cast_to_instance_id----------------------------
5064 const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const {
5065 if( instance_id == _instance_id ) return this;
5066 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth, _is_autobox_cache);
5067 }
5068
5069
5070 //-----------------------------max_array_length-------------------------------
5071 // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization.
5072 jint TypeAryPtr::max_array_length(BasicType etype) {
5073 if (!is_java_primitive(etype) && !::is_reference_type(etype)) {
5074 if (etype == T_NARROWOOP) {
5075 etype = T_OBJECT;
5076 } else if (etype == T_ILLEGAL) { // bottom[]
5077 etype = T_BYTE; // will produce conservatively high value
5078 } else {
5079 fatal("not an element type: %s", type2name(etype));
5080 }
5081 }
5082 return arrayOopDesc::max_array_length(etype);
5083 }
5084
5085 //-----------------------------narrow_size_type-------------------------------
5086 // Narrow the given size type to the index range for the given array base type.
5104 if (size->is_con()) {
5105 lo = hi;
5106 }
5107 chg = true;
5108 }
5109 // Negative length arrays will produce weird intermediate dead fast-path code
5110 if (lo > hi) {
5111 return TypeInt::ZERO;
5112 }
5113 if (!chg) {
5114 return size;
5115 }
5116 return TypeInt::make(lo, hi, Type::WidenMin);
5117 }
5118
5119 //-------------------------------cast_to_size----------------------------------
5120 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
5121 assert(new_size != nullptr, "");
5122 new_size = narrow_size_type(new_size);
5123 if (new_size == size()) return this;
5124 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5125 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5126 }
5127
5128 const TypeAryPtr* TypeAryPtr::cast_to_flat(bool flat) const {
5129 if (flat == is_flat()) {
5130 return this;
5131 }
5132 assert(!flat || !is_not_flat(), "inconsistency");
5133 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), flat, is_not_flat(), is_not_null_free(), is_atomic());
5134 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5135 if (res->speculative() == res->remove_speculative()) {
5136 return res->remove_speculative();
5137 }
5138 return res;
5139 }
5140
5141 //-------------------------------cast_to_not_flat------------------------------
5142 const TypeAryPtr* TypeAryPtr::cast_to_not_flat(bool not_flat) const {
5143 if (not_flat == is_not_flat()) {
5144 return this;
5145 }
5146 assert(!not_flat || !is_flat(), "inconsistency");
5147 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), not_flat, is_not_null_free(), is_atomic());
5148 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5149 // We keep the speculative part if it contains information about flat-/nullability.
5150 // Make sure it's removed if it's not better than the non-speculative type anymore.
5151 if (res->speculative() == res->remove_speculative()) {
5152 return res->remove_speculative();
5153 }
5154 return res;
5155 }
5156
5157 const TypeAryPtr* TypeAryPtr::cast_to_null_free(bool null_free) const {
5158 if (null_free == is_null_free()) {
5159 return this;
5160 }
5161 assert(!null_free || !is_not_null_free(), "inconsistency");
5162 const Type* elem = this->elem();
5163 const Type* new_elem = elem->make_ptr();
5164 if (null_free) {
5165 new_elem = new_elem->join_speculative(TypePtr::NOTNULL);
5166 } else {
5167 new_elem = new_elem->meet_speculative(TypePtr::NULL_PTR);
5168 }
5169 new_elem = elem->isa_narrowoop() ? new_elem->make_narrowoop() : new_elem;
5170 const TypeAry* new_ary = TypeAry::make(new_elem, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5171 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5172 if (res->speculative() == res->remove_speculative()) {
5173 return res->remove_speculative();
5174 }
5175 assert(res->speculative() == nullptr || res->speculative()->with_inline_depth(res->inline_depth())->higher_equal(res->remove_speculative()),
5176 "speculative type must not be narrower than non-speculative type");
5177 return res;
5178 }
5179
5180 //-------------------------------cast_to_not_null_free-------------------------
5181 const TypeAryPtr* TypeAryPtr::cast_to_not_null_free(bool not_null_free) const {
5182 if (not_null_free == is_not_null_free()) {
5183 return this;
5184 }
5185 assert(!not_null_free || !is_null_free(), "inconsistency");
5186 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), is_not_flat(), not_null_free, is_atomic());
5187 const TypePtr* new_spec = _speculative;
5188 if (new_spec != nullptr) {
5189 // Could be 'null free' from profiling, which would contradict the cast.
5190 new_spec = new_spec->is_aryptr()->cast_to_null_free(false)->cast_to_not_null_free();
5191 }
5192 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset,
5193 _instance_id, new_spec, _inline_depth, _is_autobox_cache);
5194 // We keep the speculative part if it contains information about flat-/nullability.
5195 // Make sure it's removed if it's not better than the non-speculative type anymore.
5196 if (res->speculative() == res->remove_speculative()) {
5197 return res->remove_speculative();
5198 }
5199 assert(res->speculative() == nullptr || res->speculative()->with_inline_depth(res->inline_depth())->higher_equal(res->remove_speculative()),
5200 "speculative type must not be narrower than non-speculative type");
5201 return res;
5202 }
5203
5204 //---------------------------------update_properties---------------------------
5205 const TypeAryPtr* TypeAryPtr::update_properties(const TypeAryPtr* from) const {
5206 if ((from->is_flat() && is_not_flat()) ||
5207 (from->is_not_flat() && is_flat()) ||
5208 (from->is_null_free() && is_not_null_free()) ||
5209 (from->is_not_null_free() && is_null_free())) {
5210 return nullptr; // Inconsistent properties
5211 }
5212 const TypeAryPtr* res = this;
5213 if (from->is_not_null_free()) {
5214 res = res->cast_to_not_null_free();
5215 }
5216 if (from->is_not_flat()) {
5217 res = res->cast_to_not_flat();
5218 }
5219 return res;
5220 }
5221
5222 jint TypeAryPtr::flat_layout_helper() const {
5223 return exact_klass()->as_flat_array_klass()->layout_helper();
5224 }
5225
5226 int TypeAryPtr::flat_elem_size() const {
5227 return exact_klass()->as_flat_array_klass()->element_byte_size();
5228 }
5229
5230 int TypeAryPtr::flat_log_elem_size() const {
5231 return exact_klass()->as_flat_array_klass()->log2_element_size();
5232 }
5233
5234 //------------------------------cast_to_stable---------------------------------
5235 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const {
5236 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable()))
5237 return this;
5238
5239 const Type* elem = this->elem();
5240 const TypePtr* elem_ptr = elem->make_ptr();
5241
5242 if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) {
5243 // If this is widened from a narrow oop, TypeAry::make will re-narrow it.
5244 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1);
5245 }
5246
5247 const TypeAry* new_ary = TypeAry::make(elem, size(), stable, is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5248
5249 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5250 }
5251
5252 //-----------------------------stable_dimension--------------------------------
5253 int TypeAryPtr::stable_dimension() const {
5254 if (!is_stable()) return 0;
5255 int dim = 1;
5256 const TypePtr* elem_ptr = elem()->make_ptr();
5257 if (elem_ptr != nullptr && elem_ptr->isa_aryptr())
5258 dim += elem_ptr->is_aryptr()->stable_dimension();
5259 return dim;
5260 }
5261
5262 //----------------------cast_to_autobox_cache-----------------------------------
5263 const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const {
5264 if (is_autobox_cache()) return this;
5265 const TypeOopPtr* etype = elem()->make_oopptr();
5266 if (etype == nullptr) return this;
5267 // The pointers in the autobox arrays are always non-null.
5268 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
5269 const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic());
5270 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true);
5271 }
5272
5273 //------------------------------eq---------------------------------------------
5274 // Structural equality check for Type representations
5275 bool TypeAryPtr::eq( const Type *t ) const {
5276 const TypeAryPtr *p = t->is_aryptr();
5277 return
5278 _ary == p->_ary && // Check array
5279 TypeOopPtr::eq(p) &&// Check sub-parts
5280 _field_offset == p->_field_offset;
5281 }
5282
5283 //------------------------------hash-------------------------------------------
5284 // Type-specific hashing function.
5285 uint TypeAryPtr::hash(void) const {
5286 return (uint)(uintptr_t)_ary + TypeOopPtr::hash() + _field_offset.get();
5287 }
5288
5289 bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
5290 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
5291 }
5292
5293 bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
5294 return TypePtr::is_same_java_type_as_helper_for_array(this, other);
5295 }
5296
5297 bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
5298 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
5299 }
5300 //------------------------------meet-------------------------------------------
5301 // Compute the MEET of two types. It returns a new Type object.
5302 const Type *TypeAryPtr::xmeet_helper(const Type *t) const {
5303 // Perform a fast test for common case; meeting the same types together.
5304 if( this == t ) return this; // Meeting same type-rep?
5305 // Current "this->_base" is Pointer
5306 switch (t->base()) { // switch on original type
5313 case HalfFloatBot:
5314 case FloatTop:
5315 case FloatCon:
5316 case FloatBot:
5317 case DoubleTop:
5318 case DoubleCon:
5319 case DoubleBot:
5320 case NarrowOop:
5321 case NarrowKlass:
5322 case Bottom: // Ye Olde Default
5323 return Type::BOTTOM;
5324 case Top:
5325 return this;
5326
5327 default: // All else is a mistake
5328 typerr(t);
5329
5330 case OopPtr: { // Meeting to OopPtrs
5331 // Found a OopPtr type vs self-AryPtr type
5332 const TypeOopPtr *tp = t->is_oopptr();
5333 Offset offset = meet_offset(tp->offset());
5334 PTR ptr = meet_ptr(tp->ptr());
5335 int depth = meet_inline_depth(tp->inline_depth());
5336 const TypePtr* speculative = xmeet_speculative(tp);
5337 switch (tp->ptr()) {
5338 case TopPTR:
5339 case AnyNull: {
5340 int instance_id = meet_instance_id(InstanceTop);
5341 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
5342 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5343 }
5344 case BotPTR:
5345 case NotNull: {
5346 int instance_id = meet_instance_id(tp->instance_id());
5347 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
5348 }
5349 default: ShouldNotReachHere();
5350 }
5351 }
5352
5353 case AnyPtr: { // Meeting two AnyPtrs
5354 // Found an AnyPtr type vs self-AryPtr type
5355 const TypePtr *tp = t->is_ptr();
5356 Offset offset = meet_offset(tp->offset());
5357 PTR ptr = meet_ptr(tp->ptr());
5358 const TypePtr* speculative = xmeet_speculative(tp);
5359 int depth = meet_inline_depth(tp->inline_depth());
5360 switch (tp->ptr()) {
5361 case TopPTR:
5362 return this;
5363 case BotPTR:
5364 case NotNull:
5365 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
5366 case Null:
5367 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
5368 // else fall through to AnyNull
5369 case AnyNull: {
5370 int instance_id = meet_instance_id(InstanceTop);
5371 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
5372 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5373 }
5374 default: ShouldNotReachHere();
5375 }
5376 }
5377
5378 case MetadataPtr:
5379 case KlassPtr:
5380 case InstKlassPtr:
5381 case AryKlassPtr:
5382 case RawPtr: return TypePtr::BOTTOM;
5383
5384 case AryPtr: { // Meeting 2 references?
5385 const TypeAryPtr *tap = t->is_aryptr();
5386 Offset off = meet_offset(tap->offset());
5387 Offset field_off = meet_field_offset(tap->field_offset());
5388 const Type* tm = _ary->meet_speculative(tap->_ary);
5389 const TypeAry* tary = tm->isa_ary();
5390 if (tary == nullptr) {
5391 assert(tm == Type::TOP || tm == Type::BOTTOM, "");
5392 return tm;
5393 }
5394 PTR ptr = meet_ptr(tap->ptr());
5395 int instance_id = meet_instance_id(tap->instance_id());
5396 const TypePtr* speculative = xmeet_speculative(tap);
5397 int depth = meet_inline_depth(tap->inline_depth());
5398
5399 ciKlass* res_klass = nullptr;
5400 bool res_xk = false;
5401 bool res_flat = false;
5402 bool res_not_flat = false;
5403 bool res_not_null_free = false;
5404 bool res_atomic = false;
5405 const Type* elem = tary->_elem;
5406 if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic) == NOT_SUBTYPE) {
5407 instance_id = InstanceBot;
5408 } else if (this->is_flat() != tap->is_flat()) {
5409 // Meeting flat inline type array with non-flat array. Adjust (field) offset accordingly.
5410 if (tary->_flat) {
5411 // Result is in a flat representation
5412 off = Offset(is_flat() ? offset() : tap->offset());
5413 field_off = is_flat() ? field_offset() : tap->field_offset();
5414 } else if (below_centerline(ptr)) {
5415 // Result is in a non-flat representation
5416 off = Offset(flat_offset()).meet(Offset(tap->flat_offset()));
5417 field_off = (field_off == Offset::top) ? Offset::top : Offset::bottom;
5418 } else if (flat_offset() == tap->flat_offset()) {
5419 off = Offset(!is_flat() ? offset() : tap->offset());
5420 field_off = !is_flat() ? field_offset() : tap->field_offset();
5421 }
5422 }
5423
5424 ciObject* o = nullptr; // Assume not constant when done
5425 ciObject* this_oop = const_oop();
5426 ciObject* tap_oop = tap->const_oop();
5427 if (ptr == Constant) {
5428 if (this_oop != nullptr && tap_oop != nullptr &&
5429 this_oop->equals(tap_oop)) {
5430 o = tap_oop;
5431 } else if (above_centerline(_ptr)) {
5432 o = tap_oop;
5433 } else if (above_centerline(tap->_ptr)) {
5434 o = this_oop;
5435 } else {
5436 ptr = NotNull;
5437 }
5438 }
5439 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);
5440 }
5441
5442 // All arrays inherit from Object class
5443 case InstPtr: {
5444 const TypeInstPtr *tp = t->is_instptr();
5445 Offset offset = meet_offset(tp->offset());
5446 PTR ptr = meet_ptr(tp->ptr());
5447 int instance_id = meet_instance_id(tp->instance_id());
5448 const TypePtr* speculative = xmeet_speculative(tp);
5449 int depth = meet_inline_depth(tp->inline_depth());
5450 const TypeInterfaces* interfaces = meet_interfaces(tp);
5451 const TypeInterfaces* tp_interfaces = tp->_interfaces;
5452 const TypeInterfaces* this_interfaces = _interfaces;
5453
5454 switch (ptr) {
5455 case TopPTR:
5456 case AnyNull: // Fall 'down' to dual of object klass
5457 // For instances when a subclass meets a superclass we fall
5458 // below the centerline when the superclass is exact. We need to
5459 // do the same here.
5460 //
5461 // Flat in array:
5462 // We do
5463 // dual(TypeAryPtr) MEET dual(TypeInstPtr)
5464 // If TypeInstPtr is anything else than Object, then the result of the meet is bottom Object (i.e. we could have
5465 // instances or arrays).
5466 // If TypeInstPtr is an Object and either
5467 // - exact
5468 // - inexact AND flat in array == dual(not flat in array) (i.e. not an array type)
5469 // then the result of the meet is bottom Object (i.e. we could have instances or arrays).
5470 // Otherwise, we meet two array pointers and create a new TypeAryPtr.
5471 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
5472 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
5473 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5474 } else {
5475 // cannot subclass, so the meet has to fall badly below the centerline
5476 ptr = NotNull;
5477 instance_id = InstanceBot;
5478 interfaces = this_interfaces->intersection_with(tp_interfaces);
5479 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
5480 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, flat_in_array, instance_id, speculative, depth);
5481 }
5482 case Constant:
5483 case NotNull:
5484 case BotPTR: { // Fall down to object klass
5485 // LCA is object_klass, but if we subclass from the top we can do better
5486 if (above_centerline(tp->ptr())) {
5487 // If 'tp' is above the centerline and it is Object class
5488 // then we can subclass in the Java class hierarchy.
5489 // For instances when a subclass meets a superclass we fall
5490 // below the centerline when the superclass is exact. We need
5491 // to do the same here.
5492
5493 // Flat in array: We do TypeAryPtr MEET dual(TypeInstPtr), same applies as above in TopPTR/AnyNull case.
5494 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
5495 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
5496 // that is, my array type is a subtype of 'tp' klass
5497 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
5498 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth);
5499 }
5500 }
5501 // The other case cannot happen, since t cannot be a subtype of an array.
5502 // The meet falls down to Object class below centerline.
5503 if (ptr == Constant) {
5504 ptr = NotNull;
5505 }
5506 if (instance_id > 0) {
5507 instance_id = InstanceBot;
5508 }
5509
5510 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
5511 interfaces = this_interfaces->intersection_with(tp_interfaces);
5512 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset,
5513 flat_in_array, instance_id, speculative, depth);
5514 }
5515 default: typerr(t);
5516 }
5517 }
5518 }
5519 return this; // Lint noise
5520 }
5521
5522
5523 template<class T> TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary, const T* other_ary,
5524 ciKlass*& res_klass, bool& res_xk, bool &res_flat, bool& res_not_flat, bool& res_not_null_free, bool &res_atomic) {
5525 int dummy;
5526 bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM);
5527 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
5528 ciKlass* this_klass = this_ary->klass();
5529 ciKlass* other_klass = other_ary->klass();
5530 bool this_xk = this_ary->klass_is_exact();
5531 bool other_xk = other_ary->klass_is_exact();
5532 PTR this_ptr = this_ary->ptr();
5533 PTR other_ptr = other_ary->ptr();
5534 bool this_flat = this_ary->is_flat();
5535 bool this_not_flat = this_ary->is_not_flat();
5536 bool other_flat = other_ary->is_flat();
5537 bool other_not_flat = other_ary->is_not_flat();
5538 bool this_not_null_free = this_ary->is_not_null_free();
5539 bool other_not_null_free = other_ary->is_not_null_free();
5540 bool this_atomic = this_ary->is_atomic();
5541 bool other_atomic = other_ary->is_atomic();
5542 const bool same_nullness = this_ary->is_null_free() == other_ary->is_null_free();
5543 res_klass = nullptr;
5544 MeetResult result = SUBTYPE;
5545 res_flat = this_flat && other_flat;
5546 bool res_null_free = this_ary->is_null_free() && other_ary->is_null_free();
5547 res_not_flat = this_not_flat && other_not_flat;
5548 res_not_null_free = this_not_null_free && other_not_null_free;
5549 res_atomic = this_atomic && other_atomic;
5550
5551 if (elem->isa_int()) {
5552 // Integral array element types have irrelevant lattice relations.
5553 // It is the klass that determines array layout, not the element type.
5554 if (this_top_or_bottom) {
5555 res_klass = other_klass;
5556 } else if (other_top_or_bottom || other_klass == this_klass) {
5557 res_klass = this_klass;
5558 } else {
5559 // Something like byte[int+] meets char[int+].
5560 // This must fall to bottom, not (int[-128..65535])[int+].
5561 // instance_id = InstanceBot;
5562 elem = Type::BOTTOM;
5563 result = NOT_SUBTYPE;
5564 if (above_centerline(ptr) || ptr == Constant) {
5565 ptr = NotNull;
5566 res_xk = false;
5567 return NOT_SUBTYPE;
5568 }
5569 }
5570 } else {// Non integral arrays.
5571 // Must fall to bottom if exact klasses in upper lattice
5572 // are not equal or super klass is exact.
5573 if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) &&
5574 // meet with top[] and bottom[] are processed further down:
5575 !this_top_or_bottom && !other_top_or_bottom &&
5576 // both are exact and not equal:
5578 // 'tap' is exact and super or unrelated:
5579 (other_xk && !other_ary->is_meet_subtype_of(this_ary)) ||
5580 // 'this' is exact and super or unrelated:
5581 (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) {
5582 if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) {
5583 elem = Type::BOTTOM;
5584 }
5585 ptr = NotNull;
5586 res_xk = false;
5587 return NOT_SUBTYPE;
5588 }
5589 }
5590
5591 res_xk = false;
5592 switch (other_ptr) {
5593 case AnyNull:
5594 case TopPTR:
5595 // Compute new klass on demand, do not use tap->_klass
5596 if (below_centerline(this_ptr)) {
5597 res_xk = this_xk;
5598 if (this_ary->is_flat()) {
5599 elem = this_ary->elem();
5600 }
5601 } else {
5602 res_xk = (other_xk || this_xk);
5603 }
5604 break;
5605 case Constant: {
5606 if (this_ptr == Constant && same_nullness) {
5607 // Only exact if same nullness since:
5608 // null-free [LMyValue <: nullable [LMyValue.
5609 res_xk = true;
5610 } else if (above_centerline(this_ptr)) {
5611 res_xk = true;
5612 } else {
5613 // Only precise for identical arrays
5614 res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom));
5615 // Even though MyValue is final, [LMyValue is only exact if the array
5616 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue.
5617 if (res_xk && !res_null_free && !res_not_null_free) {
5618 ptr = NotNull;
5619 res_xk = false;
5620 }
5621 }
5622 break;
5623 }
5624 case NotNull:
5625 case BotPTR:
5626 // Compute new klass on demand, do not use tap->_klass
5627 if (above_centerline(this_ptr)) {
5628 res_xk = other_xk;
5629 if (other_ary->is_flat()) {
5630 elem = other_ary->elem();
5631 }
5632 } else {
5633 res_xk = (other_xk && this_xk) &&
5634 (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays
5635 // Even though MyValue is final, [LMyValue is only exact if the array
5636 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue.
5637 if (res_xk && !res_null_free && !res_not_null_free) {
5638 ptr = NotNull;
5639 res_xk = false;
5640 }
5641 }
5642 break;
5643 default: {
5644 ShouldNotReachHere();
5645 return result;
5646 }
5647 }
5648 return result;
5649 }
5650
5651
5652 //------------------------------xdual------------------------------------------
5653 // Dual: compute field-by-field dual
5654 const Type *TypeAryPtr::xdual() const {
5655 bool xk = _klass_is_exact;
5656 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());
5657 }
5658
5659 Type::Offset TypeAryPtr::meet_field_offset(const Type::Offset offset) const {
5660 return _field_offset.meet(offset);
5661 }
5662
5663 //------------------------------dual_offset------------------------------------
5664 Type::Offset TypeAryPtr::dual_field_offset() const {
5665 return _field_offset.dual();
5666 }
5667
5668 //------------------------------dump2------------------------------------------
5669 #ifndef PRODUCT
5670 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5671 st->print("aryptr:");
5672 _ary->dump2(d, depth, st);
5673 _interfaces->dump(st);
5674
5675 if (_ptr == Constant) {
5676 const_oop()->print(st);
5677 }
5678
5679 st->print(":%s", ptr_msg[_ptr]);
5680 if (_klass_is_exact) {
5681 st->print(":exact");
5682 }
5683
5684 if (is_flat()) {
5685 st->print(":flat");
5686 st->print("(");
5687 _field_offset.dump2(st);
5688 st->print(")");
5689 } else if (is_not_flat()) {
5690 st->print(":not_flat");
5691 }
5692 if (is_null_free()) {
5693 st->print(":null free");
5694 }
5695 if (is_atomic()) {
5696 st->print(":atomic");
5697 }
5698 if (Verbose) {
5699 if (is_not_flat()) {
5700 st->print(":not flat");
5701 }
5702 if (is_not_null_free()) {
5703 st->print(":nullable");
5704 }
5705 }
5706 if (offset() != 0) {
5707 BasicType basic_elem_type = elem()->basic_type();
5708 int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
5709 if( _offset == Offset::top ) st->print("+undefined");
5710 else if( _offset == Offset::bottom ) st->print("+any");
5711 else if( offset() < header_size ) st->print("+%d", offset());
5712 else {
5713 if (basic_elem_type == T_ILLEGAL) {
5714 st->print("+any");
5715 } else {
5716 int elem_size = type2aelembytes(basic_elem_type);
5717 st->print("[%d]", (offset() - header_size)/elem_size);
5718 }
5719 }
5720 }
5721
5722 dump_instance_id(st);
5723 dump_inline_depth(st);
5724 dump_speculative(st);
5725 }
5726 #endif
5727
5728 bool TypeAryPtr::empty(void) const {
5729 if (_ary->empty()) return true;
5730 // FIXME: Does this belong here? Or in the meet code itself?
5731 if (is_flat() && is_not_flat()) {
5732 return true;
5733 }
5734 return TypeOopPtr::empty();
5735 }
5736
5737 //------------------------------add_offset-------------------------------------
5738 const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const {
5739 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);
5740 }
5741
5742 const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const {
5743 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);
5744 }
5745
5746 const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const {
5747 return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache);
5748 }
5749
5750 const TypeAryPtr* TypeAryPtr::remove_speculative() const {
5751 if (_speculative == nullptr) {
5752 return this;
5753 }
5754 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
5755 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);
5756 }
5757
5758 const Type* TypeAryPtr::cleanup_speculative() const {
5759 if (speculative() == nullptr) {
5760 return this;
5761 }
5762 // Keep speculative part if it contains information about flat-/nullability
5763 const TypeAryPtr* spec_aryptr = speculative()->isa_aryptr();
5764 if (spec_aryptr != nullptr && !above_centerline(spec_aryptr->ptr()) &&
5765 (spec_aryptr->is_not_flat() || spec_aryptr->is_not_null_free())) {
5766 return this;
5767 }
5768 return TypeOopPtr::cleanup_speculative();
5769 }
5770
5771 const TypePtr* TypeAryPtr::with_inline_depth(int depth) const {
5772 if (!UseInlineDepthForSpeculativeTypes) {
5773 return this;
5774 }
5775 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, depth, _is_autobox_cache);
5776 }
5777
5778 const TypeAryPtr* TypeAryPtr::with_field_offset(int offset) const {
5779 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);
5780 }
5781
5782 const TypePtr* TypeAryPtr::add_field_offset_and_offset(intptr_t offset) const {
5783 int adj = 0;
5784 if (is_flat() && klass_is_exact() && offset != Type::OffsetBot && offset != Type::OffsetTop) {
5785 if (_offset.get() != OffsetBot && _offset.get() != OffsetTop) {
5786 adj = _offset.get();
5787 offset += _offset.get();
5788 }
5789 uint header = arrayOopDesc::base_offset_in_bytes(T_FLAT_ELEMENT);
5790 if (_field_offset.get() != OffsetBot && _field_offset.get() != OffsetTop) {
5791 offset += _field_offset.get();
5792 if (_offset.get() == OffsetBot || _offset.get() == OffsetTop) {
5793 offset += header;
5794 }
5795 }
5796 if (elem()->make_oopptr()->is_inlinetypeptr() && (offset >= (intptr_t)header || offset < 0)) {
5797 // Try to get the field of the inline type array element we are pointing to
5798 ciInlineKlass* vk = elem()->inline_klass();
5799 int shift = flat_log_elem_size();
5800 int mask = (1 << shift) - 1;
5801 intptr_t field_offset = ((offset - header) & mask);
5802 ciField* field = vk->get_field_by_offset(field_offset + vk->payload_offset(), false);
5803 if (field != nullptr || field_offset == vk->null_marker_offset_in_payload()) {
5804 return with_field_offset(field_offset)->add_offset(offset - field_offset - adj);
5805 }
5806 }
5807 }
5808 return add_offset(offset - adj);
5809 }
5810
5811 // Return offset incremented by field_offset for flat inline type arrays
5812 int TypeAryPtr::flat_offset() const {
5813 int offset = _offset.get();
5814 if (offset != Type::OffsetBot && offset != Type::OffsetTop &&
5815 _field_offset != Offset::bottom && _field_offset != Offset::top) {
5816 offset += _field_offset.get();
5817 }
5818 return offset;
5819 }
5820
5821 const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const {
5822 assert(is_known_instance(), "should be known");
5823 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth);
5824 }
5825
5826 //=============================================================================
5827
5828
5829 //------------------------------hash-------------------------------------------
5830 // Type-specific hashing function.
5831 uint TypeNarrowPtr::hash(void) const {
5832 return _ptrtype->hash() + 7;
5833 }
5834
5835 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton
5836 return _ptrtype->singleton();
5837 }
5838
5839 bool TypeNarrowPtr::empty(void) const {
5840 return _ptrtype->empty();
5841 }
5842
5843 intptr_t TypeNarrowPtr::get_con() const {
5844 return _ptrtype->get_con();
5845 }
5846
5847 bool TypeNarrowPtr::eq( const Type *t ) const {
5848 const TypeNarrowPtr* tc = isa_same_narrowptr(t);
5902 case HalfFloatTop:
5903 case HalfFloatCon:
5904 case HalfFloatBot:
5905 case FloatTop:
5906 case FloatCon:
5907 case FloatBot:
5908 case DoubleTop:
5909 case DoubleCon:
5910 case DoubleBot:
5911 case AnyPtr:
5912 case RawPtr:
5913 case OopPtr:
5914 case InstPtr:
5915 case AryPtr:
5916 case MetadataPtr:
5917 case KlassPtr:
5918 case InstKlassPtr:
5919 case AryKlassPtr:
5920 case NarrowOop:
5921 case NarrowKlass:
5922 case Bottom: // Ye Olde Default
5923 return Type::BOTTOM;
5924 case Top:
5925 return this;
5926
5927 default: // All else is a mistake
5928 typerr(t);
5929
5930 } // End of switch
5931
5932 return this;
5933 }
5934
5935 #ifndef PRODUCT
5936 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
5937 _ptrtype->dump2(d, depth, st);
5938 }
5939 #endif
5940
5941 const TypeNarrowOop *TypeNarrowOop::BOTTOM;
5985 return (one == two) && TypePtr::eq(t);
5986 } else {
5987 return one->equals(two) && TypePtr::eq(t);
5988 }
5989 }
5990
5991 //------------------------------hash-------------------------------------------
5992 // Type-specific hashing function.
5993 uint TypeMetadataPtr::hash(void) const {
5994 return
5995 (metadata() ? metadata()->hash() : 0) +
5996 TypePtr::hash();
5997 }
5998
5999 //------------------------------singleton--------------------------------------
6000 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
6001 // constants
6002 bool TypeMetadataPtr::singleton(void) const {
6003 // detune optimizer to not generate constant metadata + constant offset as a constant!
6004 // TopPTR, Null, AnyNull, Constant are all singletons
6005 return (offset() == 0) && !below_centerline(_ptr);
6006 }
6007
6008 //------------------------------add_offset-------------------------------------
6009 const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const {
6010 return make( _ptr, _metadata, xadd_offset(offset));
6011 }
6012
6013 //-----------------------------filter------------------------------------------
6014 // Do not allow interface-vs.-noninterface joins to collapse to top.
6015 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const {
6016 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr();
6017 if (ft == nullptr || ft->empty())
6018 return Type::TOP; // Canonical empty value
6019 return ft;
6020 }
6021
6022 //------------------------------get_con----------------------------------------
6023 intptr_t TypeMetadataPtr::get_con() const {
6024 assert( _ptr == Null || _ptr == Constant, "" );
6025 assert(offset() >= 0, "");
6026
6027 if (offset() != 0) {
6028 // After being ported to the compiler interface, the compiler no longer
6029 // directly manipulates the addresses of oops. Rather, it only has a pointer
6030 // to a handle at compile time. This handle is embedded in the generated
6031 // code and dereferenced at the time the nmethod is made. Until that time,
6032 // it is not reasonable to do arithmetic with the addresses of oops (we don't
6033 // have access to the addresses!). This does not seem to currently happen,
6034 // but this assertion here is to help prevent its occurrence.
6035 tty->print_cr("Found oop constant with non-zero offset");
6036 ShouldNotReachHere();
6037 }
6038
6039 return (intptr_t)metadata()->constant_encoding();
6040 }
6041
6042 //------------------------------cast_to_ptr_type-------------------------------
6043 const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const {
6044 if( ptr == _ptr ) return this;
6045 return make(ptr, metadata(), _offset);
6046 }
6047
6061 case HalfFloatBot:
6062 case FloatTop:
6063 case FloatCon:
6064 case FloatBot:
6065 case DoubleTop:
6066 case DoubleCon:
6067 case DoubleBot:
6068 case NarrowOop:
6069 case NarrowKlass:
6070 case Bottom: // Ye Olde Default
6071 return Type::BOTTOM;
6072 case Top:
6073 return this;
6074
6075 default: // All else is a mistake
6076 typerr(t);
6077
6078 case AnyPtr: {
6079 // Found an AnyPtr type vs self-OopPtr type
6080 const TypePtr *tp = t->is_ptr();
6081 Offset offset = meet_offset(tp->offset());
6082 PTR ptr = meet_ptr(tp->ptr());
6083 switch (tp->ptr()) {
6084 case Null:
6085 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6086 // else fall through:
6087 case TopPTR:
6088 case AnyNull: {
6089 return make(ptr, _metadata, offset);
6090 }
6091 case BotPTR:
6092 case NotNull:
6093 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6094 default: typerr(t);
6095 }
6096 }
6097
6098 case RawPtr:
6099 case KlassPtr:
6100 case InstKlassPtr:
6101 case AryKlassPtr:
6102 case OopPtr:
6103 case InstPtr:
6104 case AryPtr:
6105 return TypePtr::BOTTOM; // Oop meet raw is not well defined
6106
6107 case MetadataPtr: {
6108 const TypeMetadataPtr *tp = t->is_metadataptr();
6109 Offset offset = meet_offset(tp->offset());
6110 PTR tptr = tp->ptr();
6111 PTR ptr = meet_ptr(tptr);
6112 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata();
6113 if (tptr == TopPTR || _ptr == TopPTR ||
6114 metadata()->equals(tp->metadata())) {
6115 return make(ptr, md, offset);
6116 }
6117 // metadata is different
6118 if( ptr == Constant ) { // Cannot be equal constants, so...
6119 if( tptr == Constant && _ptr != Constant) return t;
6120 if( _ptr == Constant && tptr != Constant) return this;
6121 ptr = NotNull; // Fall down in lattice
6122 }
6123 return make(ptr, nullptr, offset);
6124 break;
6125 }
6126 } // End of switch
6127 return this; // Return the double constant
6128 }
6129
6133 const Type *TypeMetadataPtr::xdual() const {
6134 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset());
6135 }
6136
6137 //------------------------------dump2------------------------------------------
6138 #ifndef PRODUCT
6139 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
6140 st->print("metadataptr:%s", ptr_msg[_ptr]);
6141 if (metadata() != nullptr) {
6142 st->print(":" INTPTR_FORMAT, p2i(metadata()));
6143 }
6144 dump_offset(st);
6145 }
6146 #endif
6147
6148
6149 //=============================================================================
6150 // Convenience common pre-built type.
6151 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM;
6152
6153 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, Offset offset):
6154 TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) {
6155 }
6156
6157 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) {
6158 return make(Constant, m, Offset(0));
6159 }
6160 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) {
6161 return make(Constant, m, Offset(0));
6162 }
6163
6164 //------------------------------make-------------------------------------------
6165 // Create a meta data constant
6166 const TypeMetadataPtr* TypeMetadataPtr::make(PTR ptr, ciMetadata* m, Offset offset) {
6167 assert(m == nullptr || !m->is_klass(), "wrong type");
6168 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons();
6169 }
6170
6171
6172 const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const {
6173 const Type* elem = _ary->_elem;
6174 bool xk = klass_is_exact();
6175 bool is_refined = false;
6176 if (elem->make_oopptr() != nullptr) {
6177 is_refined = true;
6178 elem = elem->make_oopptr()->as_klass_type(try_for_exact);
6179 if (elem->isa_aryklassptr()) {
6180 const TypeAryKlassPtr* elem_klass = elem->is_aryklassptr();
6181 if (elem_klass->is_refined_type()) {
6182 elem = elem_klass->cast_to_non_refined();
6183 }
6184 } else {
6185 const TypeInstKlassPtr* elem_klass = elem->is_instklassptr();
6186 if (try_for_exact && !xk && elem_klass->klass_is_exact() &&
6187 !elem_klass->exact_klass()->as_instance_klass()->can_be_inline_klass()) {
6188 xk = true;
6189 }
6190 }
6191 }
6192 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);
6193 }
6194
6195 const TypeKlassPtr* TypeKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) {
6196 if (klass->is_instance_klass()) {
6197 return TypeInstKlassPtr::make(klass, interface_handling);
6198 }
6199 return TypeAryKlassPtr::make(klass, interface_handling);
6200 }
6201
6202 TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, Offset offset)
6203 : TypePtr(t, ptr, offset), _klass(klass), _interfaces(interfaces) {
6204 assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) ||
6205 klass->is_type_array_klass() || klass->is_flat_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here");
6206 }
6207
6208 // Is there a single ciKlass* that can represent that type?
6209 ciKlass* TypeKlassPtr::exact_klass_helper() const {
6210 assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface");
6211 if (_interfaces->empty()) {
6212 return _klass;
6213 }
6214 if (_klass != ciEnv::current()->Object_klass()) {
6215 if (_interfaces->eq(_klass->as_instance_klass())) {
6216 return _klass;
6217 }
6218 return nullptr;
6219 }
6220 return _interfaces->exact_klass();
6221 }
6222
6223 //------------------------------eq---------------------------------------------
6224 // Structural equality check for Type representations
6225 bool TypeKlassPtr::eq(const Type *t) const {
6226 const TypeKlassPtr *p = t->is_klassptr();
6227 return
6228 _interfaces->eq(p->_interfaces) &&
6229 TypePtr::eq(p);
6230 }
6231
6232 //------------------------------hash-------------------------------------------
6233 // Type-specific hashing function.
6234 uint TypeKlassPtr::hash(void) const {
6235 return TypePtr::hash() + _interfaces->hash();
6236 }
6237
6238 //------------------------------singleton--------------------------------------
6239 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
6240 // constants
6241 bool TypeKlassPtr::singleton(void) const {
6242 // detune optimizer to not generate constant klass + constant offset as a constant!
6243 // TopPTR, Null, AnyNull, Constant are all singletons
6244 return (offset() == 0) && !below_centerline(_ptr);
6245 }
6246
6247 // Do not allow interface-vs.-noninterface joins to collapse to top.
6248 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const {
6249 // logic here mirrors the one from TypeOopPtr::filter. See comments
6250 // there.
6251 const Type* ft = join_helper(kills, include_speculative);
6252
6253 if (ft->empty()) {
6254 return Type::TOP; // Canonical empty value
6255 }
6256
6257 return ft;
6258 }
6259
6260 const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const {
6261 if (above_centerline(_ptr) && above_centerline(other->_ptr)) {
6262 return _interfaces->union_with(other->_interfaces);
6263 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) {
6264 return other->_interfaces;
6265 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) {
6266 return _interfaces;
6267 }
6268 return _interfaces->intersection_with(other->_interfaces);
6269 }
6270
6271 //------------------------------get_con----------------------------------------
6272 intptr_t TypeKlassPtr::get_con() const {
6273 assert( _ptr == Null || _ptr == Constant, "" );
6274 assert( offset() >= 0, "" );
6275
6276 if (offset() != 0) {
6277 // After being ported to the compiler interface, the compiler no longer
6278 // directly manipulates the addresses of oops. Rather, it only has a pointer
6279 // to a handle at compile time. This handle is embedded in the generated
6280 // code and dereferenced at the time the nmethod is made. Until that time,
6281 // it is not reasonable to do arithmetic with the addresses of oops (we don't
6282 // have access to the addresses!). This does not seem to currently happen,
6283 // but this assertion here is to help prevent its occurrence.
6284 tty->print_cr("Found oop constant with non-zero offset");
6285 ShouldNotReachHere();
6286 }
6287
6288 ciKlass* k = exact_klass();
6289
6290 return (intptr_t)k->constant_encoding();
6291 }
6292
6293 //=============================================================================
6294 // Convenience common pre-built types.
6295
6296 // Not-null object klass or below
6297 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT;
6298 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL;
6299
6300 bool TypeInstKlassPtr::eq(const Type *t) const {
6301 const TypeInstKlassPtr* p = t->is_instklassptr();
6302 return
6303 klass()->equals(p->klass()) &&
6304 _flat_in_array == p->_flat_in_array &&
6305 TypeKlassPtr::eq(p);
6306 }
6307
6308 uint TypeInstKlassPtr::hash() const {
6309 return klass()->hash() + TypeKlassPtr::hash() + static_cast<uint>(_flat_in_array);
6310 }
6311
6312 const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, Offset offset, FlatInArray flat_in_array) {
6313 if (flat_in_array == Uninitialized) {
6314 flat_in_array = compute_flat_in_array(k->as_instance_klass(), ptr == Constant);
6315 }
6316 TypeInstKlassPtr *r =
6317 (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset, flat_in_array))->hashcons();
6318
6319 return r;
6320 }
6321
6322 bool TypeInstKlassPtr::empty() const {
6323 if (_flat_in_array == TopFlat) {
6324 return true;
6325 }
6326 return TypeKlassPtr::empty();
6327 }
6328
6329 //------------------------------add_offset-------------------------------------
6330 // Access internals of klass object
6331 const TypePtr *TypeInstKlassPtr::add_offset( intptr_t offset ) const {
6332 return make(_ptr, klass(), _interfaces, xadd_offset(offset), _flat_in_array);
6333 }
6334
6335 const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const {
6336 return make(_ptr, klass(), _interfaces, Offset(offset), _flat_in_array);
6337 }
6338
6339 //------------------------------cast_to_ptr_type-------------------------------
6340 const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const {
6341 assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type");
6342 if( ptr == _ptr ) return this;
6343 return make(ptr, _klass, _interfaces, _offset, _flat_in_array);
6344 }
6345
6346
6347 bool TypeInstKlassPtr::must_be_exact() const {
6348 if (!_klass->is_loaded()) return false;
6349 ciInstanceKlass* ik = _klass->as_instance_klass();
6350 if (ik->is_final()) return true; // cannot clear xk
6351 return false;
6352 }
6353
6354 //-----------------------------cast_to_exactness-------------------------------
6355 const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const {
6356 if (klass_is_exact == (_ptr == Constant)) return this;
6357 if (must_be_exact()) return this;
6358 ciKlass* k = klass();
6359 FlatInArray flat_in_array = compute_flat_in_array(k->as_instance_klass(), klass_is_exact);
6360 return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset, flat_in_array);
6361 }
6362
6363
6364 //-----------------------------as_instance_type--------------------------------
6365 // Corresponding type for an instance of the given class.
6366 // It will be NotNull, and exact if and only if the klass type is exact.
6367 const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const {
6368 ciKlass* k = klass();
6369 bool xk = klass_is_exact();
6370 Compile* C = Compile::current();
6371 Dependencies* deps = C->dependencies();
6372 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
6373 // Element is an instance
6374 bool klass_is_exact = false;
6375 const TypeInterfaces* interfaces = _interfaces;
6376 ciInstanceKlass* ik = k->as_instance_klass();
6377 if (k->is_loaded()) {
6378 // Try to set klass_is_exact.
6379 klass_is_exact = ik->is_final();
6380 if (!klass_is_exact && klass_change
6381 && deps != nullptr && UseUniqueSubclasses) {
6382 ciInstanceKlass* sub = ik->unique_concrete_subklass();
6383 if (sub != nullptr) {
6384 if (_interfaces->eq(sub)) {
6385 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
6386 k = ik = sub;
6387 xk = sub->is_final();
6388 }
6389 }
6390 }
6391 }
6392
6393 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array);
6394 return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, Offset(0), flat_in_array);
6395 }
6396
6397 //------------------------------xmeet------------------------------------------
6398 // Compute the MEET of two types, return a new Type object.
6399 const Type *TypeInstKlassPtr::xmeet( const Type *t ) const {
6400 // Perform a fast test for common case; meeting the same types together.
6401 if( this == t ) return this; // Meeting same type-rep?
6402
6403 // Current "this->_base" is Pointer
6404 switch (t->base()) { // switch on original type
6405
6406 case Int: // Mixing ints & oops happens when javac
6407 case Long: // reuses local variables
6408 case HalfFloatTop:
6409 case HalfFloatCon:
6410 case HalfFloatBot:
6411 case FloatTop:
6412 case FloatCon:
6413 case FloatBot:
6414 case DoubleTop:
6415 case DoubleCon:
6416 case DoubleBot:
6417 case NarrowOop:
6418 case NarrowKlass:
6419 case Bottom: // Ye Olde Default
6420 return Type::BOTTOM;
6421 case Top:
6422 return this;
6423
6424 default: // All else is a mistake
6425 typerr(t);
6426
6427 case AnyPtr: { // Meeting to AnyPtrs
6428 // Found an AnyPtr type vs self-KlassPtr type
6429 const TypePtr *tp = t->is_ptr();
6430 Offset offset = meet_offset(tp->offset());
6431 PTR ptr = meet_ptr(tp->ptr());
6432 switch (tp->ptr()) {
6433 case TopPTR:
6434 return this;
6435 case Null:
6436 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6437 case AnyNull:
6438 return make(ptr, klass(), _interfaces, offset, _flat_in_array);
6439 case BotPTR:
6440 case NotNull:
6441 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6442 default: typerr(t);
6443 }
6444 }
6445
6446 case RawPtr:
6447 case MetadataPtr:
6448 case OopPtr:
6449 case AryPtr: // Meet with AryPtr
6450 case InstPtr: // Meet with InstPtr
6451 return TypePtr::BOTTOM;
6452
6453 //
6454 // A-top }
6455 // / | \ } Tops
6456 // B-top A-any C-top }
6457 // | / | \ | } Any-nulls
6458 // B-any | C-any }
6459 // | | |
6460 // B-con A-con C-con } constants; not comparable across classes
6461 // | | |
6462 // B-not | C-not }
6463 // | \ | / | } not-nulls
6464 // B-bot A-not C-bot }
6465 // \ | / } Bottoms
6466 // A-bot }
6467 //
6468
6469 case InstKlassPtr: { // Meet two KlassPtr types
6470 const TypeInstKlassPtr *tkls = t->is_instklassptr();
6471 Offset off = meet_offset(tkls->offset());
6472 PTR ptr = meet_ptr(tkls->ptr());
6473 const TypeInterfaces* interfaces = meet_interfaces(tkls);
6474
6475 ciKlass* res_klass = nullptr;
6476 bool res_xk = false;
6477 const FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tkls->flat_in_array());
6478 switch (meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) {
6479 case UNLOADED:
6480 ShouldNotReachHere();
6481 case SUBTYPE:
6482 case NOT_SUBTYPE:
6483 case LCA:
6484 case QUICK: {
6485 assert(res_xk == (ptr == Constant), "");
6486 const Type* res = make(ptr, res_klass, interfaces, off, flat_in_array);
6487 return res;
6488 }
6489 default:
6490 ShouldNotReachHere();
6491 }
6492 } // End of case KlassPtr
6493 case AryKlassPtr: { // All arrays inherit from Object class
6494 const TypeAryKlassPtr *tp = t->is_aryklassptr();
6495 Offset offset = meet_offset(tp->offset());
6496 PTR ptr = meet_ptr(tp->ptr());
6497 const TypeInterfaces* interfaces = meet_interfaces(tp);
6498 const TypeInterfaces* tp_interfaces = tp->_interfaces;
6499 const TypeInterfaces* this_interfaces = _interfaces;
6500
6501 switch (ptr) {
6502 case TopPTR:
6503 case AnyNull: // Fall 'down' to dual of object klass
6504 // For instances when a subclass meets a superclass we fall
6505 // below the centerline when the superclass is exact. We need to
6506 // do the same here.
6507 //
6508 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
6509 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) &&
6510 !klass_is_exact() && !is_not_flat_in_array()) {
6511 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());
6512 } else {
6513 // cannot subclass, so the meet has to fall badly below the centerline
6514 ptr = NotNull;
6515 interfaces = _interfaces->intersection_with(tp->_interfaces);
6516 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat);
6517 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array);
6518 }
6519 case Constant:
6520 case NotNull:
6521 case BotPTR: { // Fall down to object klass
6522 // LCA is object_klass, but if we subclass from the top we can do better
6523 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
6524 // If 'this' (InstPtr) is above the centerline and it is Object class
6525 // then we can subclass in the Java class hierarchy.
6526 // For instances when a subclass meets a superclass we fall
6527 // below the centerline when the superclass is exact. We need
6528 // to do the same here.
6529 //
6530 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
6531 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) &&
6532 !klass_is_exact() && !is_not_flat_in_array()) {
6533 // that is, tp's array type is a subtype of my klass
6534 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());
6535 }
6536 }
6537 // The other case cannot happen, since I cannot be a subtype of an array.
6538 // The meet falls down to Object class below centerline.
6539 if( ptr == Constant )
6540 ptr = NotNull;
6541 interfaces = this_interfaces->intersection_with(tp_interfaces);
6542 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat);
6543 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array);
6544 }
6545 default: typerr(t);
6546 }
6547 }
6548
6549 } // End of switch
6550 return this; // Return the double constant
6551 }
6552
6553 //------------------------------xdual------------------------------------------
6554 // Dual: compute field-by-field dual
6555 const Type* TypeInstKlassPtr::xdual() const {
6556 return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset(), dual_flat_in_array());
6557 }
6558
6559 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) {
6560 static_assert(std::is_base_of<T2, T1>::value, "");
6561 if (!this_one->is_loaded() || !other->is_loaded()) {
6562 return false;
6563 }
6564 if (!this_one->is_instance_type(other)) {
6565 return false;
6566 }
6567
6568 if (!other_exact) {
6569 return false;
6570 }
6571
6572 if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) {
6573 return true;
6574 }
6575
6576 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
6630
6631 if (this_exact) {
6632 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
6633 }
6634
6635 return true;
6636 }
6637
6638 bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6639 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
6640 }
6641
6642 const TypeKlassPtr* TypeInstKlassPtr::try_improve() const {
6643 if (!UseUniqueSubclasses) {
6644 return this;
6645 }
6646 ciKlass* k = klass();
6647 Compile* C = Compile::current();
6648 Dependencies* deps = C->dependencies();
6649 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
6650 if (k->is_loaded()) {
6651 ciInstanceKlass* ik = k->as_instance_klass();
6652 if (deps != nullptr) {
6653 ciInstanceKlass* sub = ik->unique_concrete_subklass();
6654 if (sub != nullptr) {
6655 bool improve_to_exact = sub->is_final() && _ptr == NotNull;
6656 const TypeInstKlassPtr* improved = TypeInstKlassPtr::make(improve_to_exact ? Constant : _ptr, sub, _offset);
6657 if (improved->_interfaces->contains(_interfaces)) {
6658 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
6659 return improved;
6660 }
6661 }
6662 }
6663 }
6664 return this;
6665 }
6666
6667 bool TypeInstKlassPtr::can_be_inline_array() const {
6668 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryKlassPtr::_array_interfaces->contains(_interfaces);
6669 }
6670
6671 #ifndef PRODUCT
6672 void TypeInstKlassPtr::dump2(Dict& d, uint depth, outputStream* st) const {
6673 st->print("instklassptr:");
6674 klass()->print_name_on(st);
6675 _interfaces->dump(st);
6676 st->print(":%s", ptr_msg[_ptr]);
6677 dump_offset(st);
6678 dump_flat_in_array(_flat_in_array, st);
6679 }
6680 #endif // PRODUCT
6681
6682 bool TypeAryKlassPtr::can_be_inline_array() const {
6683 return _elem->isa_instklassptr() && _elem->is_instklassptr()->_klass->can_be_inline_klass();
6684 }
6685
6686 bool TypeInstPtr::can_be_inline_array() const {
6687 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryPtr::_array_interfaces->contains(_interfaces);
6688 }
6689
6690 bool TypeAryPtr::can_be_inline_array() const {
6691 return elem()->make_ptr() && elem()->make_ptr()->isa_instptr() && elem()->make_ptr()->is_instptr()->_klass->can_be_inline_klass();
6692 }
6693
6694 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) {
6695 return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type))->hashcons();
6696 }
6697
6698 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) {
6699 const Type* etype;
6700 if (k->is_obj_array_klass()) {
6701 // Element is an object array. Recursively call ourself.
6702 ciKlass* eklass = k->as_obj_array_klass()->element_klass();
6703 etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false);
6704 k = nullptr;
6705 } else if (k->is_type_array_klass()) {
6706 // Element is an typeArray
6707 etype = get_const_basic_type(k->as_type_array_klass()->element_type());
6708 } else {
6709 ShouldNotReachHere();
6710 }
6711
6712 return TypeAryKlassPtr::make(ptr, etype, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type);
6713 }
6714
6715 const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) {
6716 ciArrayKlass* k = klass->as_array_klass();
6717 if (k->is_refined()) {
6718 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, !k->is_flat_array_klass(), !k->is_elem_null_free(),
6719 k->is_flat_array_klass(), k->is_elem_null_free(), k->is_elem_atomic(), true);
6720 } else {
6721 // Use the default combination to canonicalize all non-refined klass pointers
6722 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, true, true, false, false, true, false);
6723 }
6724 }
6725
6726 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_non_refined() const {
6727 assert(is_refined_type(), "must be a refined type");
6728 PTR ptr = _ptr;
6729 // There can be multiple refined array types corresponding to a single unrefined type
6730 if (ptr == NotNull && elem()->is_klassptr()->klass_is_exact()) {
6731 ptr = Constant;
6732 }
6733 return make(ptr, elem(), nullptr, _offset, true, true, false, false, true, false);
6734 }
6735
6736 // Get the (non-)refined array klass ptr
6737 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_refined_array_klass_ptr(bool refined) const {
6738 if ((refined == is_refined_type()) || !klass_is_exact() || !exact_klass()->is_obj_array_klass()) {
6739 return this;
6740 }
6741 ciArrayKlass* k = exact_klass()->as_array_klass();
6742 k = ciObjArrayKlass::make(k->element_klass(), refined);
6743 return make(k, trust_interfaces);
6744 }
6745
6746 //------------------------------eq---------------------------------------------
6747 // Structural equality check for Type representations
6748 bool TypeAryKlassPtr::eq(const Type *t) const {
6749 const TypeAryKlassPtr *p = t->is_aryklassptr();
6750 return
6751 _elem == p->_elem && // Check array
6752 _flat == p->_flat &&
6753 _not_flat == p->_not_flat &&
6754 _null_free == p->_null_free &&
6755 _not_null_free == p->_not_null_free &&
6756 _atomic == p->_atomic &&
6757 _refined_type == p->_refined_type &&
6758 TypeKlassPtr::eq(p); // Check sub-parts
6759 }
6760
6761 //------------------------------hash-------------------------------------------
6762 // Type-specific hashing function.
6763 uint TypeAryKlassPtr::hash(void) const {
6764 return (uint)(uintptr_t)_elem + TypeKlassPtr::hash() + (uint)(_not_flat ? 43 : 0) +
6765 (uint)(_not_null_free ? 44 : 0) + (uint)(_flat ? 45 : 0) + (uint)(_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0) + (uint)(_refined_type ? 48 : 0);
6766 }
6767
6768 //----------------------compute_klass------------------------------------------
6769 // Compute the defining klass for this class
6770 ciKlass* TypeAryPtr::compute_klass() const {
6771 // Compute _klass based on element type.
6772 ciKlass* k_ary = nullptr;
6773 const TypeInstPtr *tinst;
6774 const TypeAryPtr *tary;
6775 const Type* el = elem();
6776 if (el->isa_narrowoop()) {
6777 el = el->make_ptr();
6778 }
6779
6780 // Get element klass
6781 if ((tinst = el->isa_instptr()) != nullptr) {
6782 // Leave k_ary at nullptr.
6783 } else if ((tary = el->isa_aryptr()) != nullptr) {
6784 // Leave k_ary at nullptr.
6785 } else if ((el->base() == Type::Top) ||
6786 (el->base() == Type::Bottom)) {
6787 // element type of Bottom occurs from meet of basic type
6788 // and object; Top occurs when doing join on Bottom.
6789 // Leave k_ary at null.
6790 } else {
6791 assert(!el->isa_int(), "integral arrays must be pre-equipped with a class");
6792 // Compute array klass directly from basic type
6793 k_ary = ciTypeArrayKlass::make(el->basic_type());
6794 }
6795 return k_ary;
6796 }
6797
6798 //------------------------------klass------------------------------------------
6799 // Return the defining klass for this class
6800 ciKlass* TypeAryPtr::klass() const {
6801 if( _klass ) return _klass; // Return cached value, if possible
6802
6803 // Oops, need to compute _klass and cache it
6804 ciKlass* k_ary = compute_klass();
6812 // type TypeAryPtr::OOPS. This Type is shared between all
6813 // active compilations. However, the ciKlass which represents
6814 // this Type is *not* shared between compilations, so caching
6815 // this value would result in fetching a dangling pointer.
6816 //
6817 // Recomputing the underlying ciKlass for each request is
6818 // a bit less efficient than caching, but calls to
6819 // TypeAryPtr::OOPS->klass() are not common enough to matter.
6820 ((TypeAryPtr*)this)->_klass = k_ary;
6821 }
6822 return k_ary;
6823 }
6824
6825 // Is there a single ciKlass* that can represent that type?
6826 ciKlass* TypeAryPtr::exact_klass_helper() const {
6827 if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) {
6828 ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper();
6829 if (k == nullptr) {
6830 return nullptr;
6831 }
6832 if (k->is_array_klass() && k->as_array_klass()->is_refined()) {
6833 // We have no mechanism to create an array of refined arrays
6834 k = ciObjArrayKlass::make(k->as_array_klass()->element_klass(), false);
6835 }
6836 if (klass_is_exact()) {
6837 return ciObjArrayKlass::make(k, true, is_null_free(), is_atomic());
6838 } else {
6839 // We may reach here if called recursively, must be an unrefined type then
6840 return ciObjArrayKlass::make(k, false);
6841 }
6842 }
6843
6844 return klass();
6845 }
6846
6847 const Type* TypeAryPtr::base_element_type(int& dims) const {
6848 const Type* elem = this->elem();
6849 dims = 1;
6850 while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) {
6851 elem = elem->make_ptr()->is_aryptr()->elem();
6852 dims++;
6853 }
6854 return elem;
6855 }
6856
6857 //------------------------------add_offset-------------------------------------
6858 // Access internals of klass object
6859 const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const {
6860 return make(_ptr, elem(), klass(), xadd_offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type);
6861 }
6862
6863 const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const {
6864 return make(_ptr, elem(), klass(), Offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type);
6865 }
6866
6867 //------------------------------cast_to_ptr_type-------------------------------
6868 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const {
6869 assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type");
6870 if (ptr == _ptr) return this;
6871 return make(ptr, elem(), _klass, _offset, is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type);
6872 }
6873
6874 bool TypeAryKlassPtr::must_be_exact() const {
6875 assert(klass_is_exact(), "precondition");
6876 if (_elem == Type::BOTTOM || _elem == Type::TOP) {
6877 return false;
6878 }
6879 const TypeKlassPtr* elem = _elem->isa_klassptr();
6880 if (elem == nullptr) {
6881 // primitive arrays
6882 return true;
6883 }
6884
6885 // refined types are final
6886 return _refined_type;
6887 }
6888
6889 //-----------------------------cast_to_exactness-------------------------------
6890 const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const {
6891 if (klass_is_exact == this->klass_is_exact()) {
6892 return this;
6893 }
6894 if (!klass_is_exact && must_be_exact()) {
6895 return this;
6896 }
6897 const Type* elem = this->elem();
6898 if (elem->isa_klassptr() && !klass_is_exact) {
6899 elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact);
6900 }
6901
6902 if (klass_is_exact) {
6903 // cast_to_exactness(true) really means get the LCA of all values represented by this
6904 // TypeAryKlassPtr. As a result, it must be an unrefined klass pointer.
6905 return make(Constant, elem, nullptr, _offset, true, true, false, false, true, false);
6906 } else {
6907 // cast_to_exactness(false) means get the TypeAryKlassPtr representing all values that subtype
6908 // this value
6909 bool not_inline = !_elem->isa_instklassptr() || !_elem->is_instklassptr()->instance_klass()->can_be_inline_klass();
6910 bool not_flat = !UseArrayFlattening || not_inline ||
6911 (_elem->isa_instklassptr() && _elem->is_instklassptr()->instance_klass()->is_inlinetype() && !_elem->is_instklassptr()->instance_klass()->maybe_flat_in_array());
6912 bool not_null_free = not_inline;
6913 bool atomic = not_flat;
6914 return make(NotNull, elem, nullptr, _offset, not_flat, not_null_free, false, false, atomic, false);
6915 }
6916 }
6917
6918 //-----------------------------as_instance_type--------------------------------
6919 // Corresponding type for an instance of the given class.
6920 // It will be NotNull, and exact if and only if the klass type is exact.
6921 const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const {
6922 ciKlass* k = klass();
6923 bool xk = klass_is_exact();
6924 const Type* el = nullptr;
6925 if (elem()->isa_klassptr()) {
6926 el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false);
6927 k = nullptr;
6928 } else {
6929 el = elem();
6930 }
6931 bool null_free = _null_free;
6932 if (null_free && el->isa_ptr()) {
6933 el = el->is_ptr()->join_speculative(TypePtr::NOTNULL);
6934 }
6935 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));
6936 }
6937
6938
6939 //------------------------------xmeet------------------------------------------
6940 // Compute the MEET of two types, return a new Type object.
6941 const Type *TypeAryKlassPtr::xmeet( const Type *t ) const {
6942 // Perform a fast test for common case; meeting the same types together.
6943 if( this == t ) return this; // Meeting same type-rep?
6944
6945 // Current "this->_base" is Pointer
6946 switch (t->base()) { // switch on original type
6947
6948 case Int: // Mixing ints & oops happens when javac
6949 case Long: // reuses local variables
6950 case HalfFloatTop:
6951 case HalfFloatCon:
6952 case HalfFloatBot:
6953 case FloatTop:
6954 case FloatCon:
6955 case FloatBot:
6956 case DoubleTop:
6957 case DoubleCon:
6958 case DoubleBot:
6959 case NarrowOop:
6960 case NarrowKlass:
6961 case Bottom: // Ye Olde Default
6962 return Type::BOTTOM;
6963 case Top:
6964 return this;
6965
6966 default: // All else is a mistake
6967 typerr(t);
6968
6969 case AnyPtr: { // Meeting to AnyPtrs
6970 // Found an AnyPtr type vs self-KlassPtr type
6971 const TypePtr *tp = t->is_ptr();
6972 Offset offset = meet_offset(tp->offset());
6973 PTR ptr = meet_ptr(tp->ptr());
6974 switch (tp->ptr()) {
6975 case TopPTR:
6976 return this;
6977 case Null:
6978 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6979 case AnyNull:
6980 return make(ptr, _elem, klass(), offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type());
6981 case BotPTR:
6982 case NotNull:
6983 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6984 default: typerr(t);
6985 }
6986 }
6987
6988 case RawPtr:
6989 case MetadataPtr:
6990 case OopPtr:
6991 case AryPtr: // Meet with AryPtr
6992 case InstPtr: // Meet with InstPtr
6993 return TypePtr::BOTTOM;
6994
6995 //
6996 // A-top }
6997 // / | \ } Tops
6998 // B-top A-any C-top }
6999 // | / | \ | } Any-nulls
7000 // B-any | C-any }
7001 // | | |
7002 // B-con A-con C-con } constants; not comparable across classes
7003 // | | |
7004 // B-not | C-not }
7005 // | \ | / | } not-nulls
7006 // B-bot A-not C-bot }
7007 // \ | / } Bottoms
7008 // A-bot }
7009 //
7010
7011 case AryKlassPtr: { // Meet two KlassPtr types
7012 const TypeAryKlassPtr *tap = t->is_aryklassptr();
7013 Offset off = meet_offset(tap->offset());
7014 const Type* elem = _elem->meet(tap->_elem);
7015 PTR ptr = meet_ptr(tap->ptr());
7016 ciKlass* res_klass = nullptr;
7017 bool res_xk = false;
7018 bool res_flat = false;
7019 bool res_not_flat = false;
7020 bool res_not_null_free = false;
7021 bool res_atomic = false;
7022 MeetResult res = meet_aryptr(ptr, elem, this, tap,
7023 res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic);
7024 assert(res_xk == (ptr == Constant), "");
7025 bool flat = meet_flat(tap->_flat);
7026 bool null_free = meet_null_free(tap->_null_free);
7027 bool atomic = meet_atomic(tap->_atomic);
7028 bool refined_type = _refined_type && tap->_refined_type;
7029 if (res == NOT_SUBTYPE) {
7030 flat = false;
7031 null_free = false;
7032 atomic = false;
7033 refined_type = false;
7034 } else if (res == SUBTYPE) {
7035 if (above_centerline(tap->ptr()) && !above_centerline(this->ptr())) {
7036 flat = _flat;
7037 null_free = _null_free;
7038 atomic = _atomic;
7039 refined_type = _refined_type;
7040 } else if (above_centerline(this->ptr()) && !above_centerline(tap->ptr())) {
7041 flat = tap->_flat;
7042 null_free = tap->_null_free;
7043 atomic = tap->_atomic;
7044 refined_type = tap->_refined_type;
7045 } else if (above_centerline(this->ptr()) && above_centerline(tap->ptr())) {
7046 flat = _flat || tap->_flat;
7047 null_free = _null_free || tap->_null_free;
7048 atomic = _atomic || tap->_atomic;
7049 refined_type = _refined_type || tap->_refined_type;
7050 } else if (res_xk && _refined_type != tap->_refined_type) {
7051 // This can happen if the phi emitted by LibraryCallKit::load_default_refined_array_klass/load_non_refined_array_klass
7052 // is processed before the typeArray guard is folded. Both inputs are constant but the input corresponding to the
7053 // typeArray will go away. Don't constant fold it yet but wait for the control input to collapse.
7054 ptr = PTR::NotNull;
7055 }
7056 }
7057 return make(ptr, elem, res_klass, off, res_not_flat, res_not_null_free, flat, null_free, atomic, refined_type);
7058 } // End of case KlassPtr
7059 case InstKlassPtr: {
7060 const TypeInstKlassPtr *tp = t->is_instklassptr();
7061 Offset offset = meet_offset(tp->offset());
7062 PTR ptr = meet_ptr(tp->ptr());
7063 const TypeInterfaces* interfaces = meet_interfaces(tp);
7064 const TypeInterfaces* tp_interfaces = tp->_interfaces;
7065 const TypeInterfaces* this_interfaces = _interfaces;
7066
7067 switch (ptr) {
7068 case TopPTR:
7069 case AnyNull: // Fall 'down' to dual of object klass
7070 // For instances when a subclass meets a superclass we fall
7071 // below the centerline when the superclass is exact. We need to
7072 // do the same here.
7073 //
7074 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
7075 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
7076 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
7077 return TypeAryKlassPtr::make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type());
7078 } else {
7079 // cannot subclass, so the meet has to fall badly below the centerline
7080 ptr = NotNull;
7081 interfaces = this_interfaces->intersection_with(tp->_interfaces);
7082 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
7083 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array);
7084 }
7085 case Constant:
7086 case NotNull:
7087 case BotPTR: { // Fall down to object klass
7088 // LCA is object_klass, but if we subclass from the top we can do better
7089 if (above_centerline(tp->ptr())) {
7090 // If 'tp' is above the centerline and it is Object class
7091 // then we can subclass in the Java class hierarchy.
7092 // For instances when a subclass meets a superclass we fall
7093 // below the centerline when the superclass is exact. We need
7094 // to do the same here.
7095 //
7096 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper().
7097 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
7098 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) {
7099 // that is, my array type is a subtype of 'tp' klass
7100 return make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type());
7101 }
7102 }
7103 // The other case cannot happen, since t cannot be a subtype of an array.
7104 // The meet falls down to Object class below centerline.
7105 if (ptr == Constant)
7106 ptr = NotNull;
7107 interfaces = this_interfaces->intersection_with(tp_interfaces);
7108 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array());
7109 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, tp->flat_in_array());
7110 }
7111 default: typerr(t);
7112 }
7113 }
7114
7115 } // End of switch
7116 return this; // Return the double constant
7117 }
7118
7119 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) {
7120 static_assert(std::is_base_of<T2, T1>::value, "");
7121
7122 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) {
7123 return true;
7124 }
7125
7126 int dummy;
7127 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
7128
7129 if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
7130 return false;
7131 }
7132
7133 if (this_one->is_instance_type(other)) {
7134 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) &&
7135 other_exact;
7136 }
7137
7138 assert(this_one->is_array_type(other), "");
7139 const T1* other_ary = this_one->is_array_type(other);
7140 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
7141 if (other_top_or_bottom) {
7142 return false;
7143 }
7144
7145 const TypePtr* other_elem = other_ary->elem()->make_ptr();
7146 const TypePtr* this_elem = this_one->elem()->make_ptr();
7147 if (this_elem != nullptr && other_elem != nullptr) {
7148 if (other->is_null_free() && !this_one->is_null_free()) {
7149 return false; // A nullable array can't be a subtype of a null-free array
7150 }
7151 return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
7152 }
7153 if (this_elem == nullptr && other_elem == nullptr) {
7154 return this_one->klass()->is_subtype_of(other->klass());
7155 }
7156 return false;
7157 }
7158
7159 bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
7160 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
7161 }
7162
7163 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) {
7164 static_assert(std::is_base_of<T2, T1>::value, "");
7165
7166 int dummy;
7167 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
7168
7169 if (!this_one->is_array_type(other) ||
7170 !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
7223 }
7224
7225 const TypePtr* this_elem = this_one->elem()->make_ptr();
7226 const TypePtr* other_elem = other_ary->elem()->make_ptr();
7227 if (other_elem != nullptr && this_elem != nullptr) {
7228 return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
7229 }
7230 if (other_elem == nullptr && this_elem == nullptr) {
7231 return this_one->klass()->is_subtype_of(other->klass());
7232 }
7233 return false;
7234 }
7235
7236 bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
7237 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
7238 }
7239
7240 //------------------------------xdual------------------------------------------
7241 // Dual: compute field-by-field dual
7242 const Type *TypeAryKlassPtr::xdual() const {
7243 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);
7244 }
7245
7246 // Is there a single ciKlass* that can represent that type?
7247 ciKlass* TypeAryKlassPtr::exact_klass_helper() const {
7248 if (elem()->isa_klassptr()) {
7249 ciKlass* k = elem()->is_klassptr()->exact_klass_helper();
7250 if (k == nullptr) {
7251 return nullptr;
7252 }
7253 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());
7254 k = ciArrayKlass::make(k, is_null_free(), is_atomic(), _refined_type);
7255 return k;
7256 }
7257
7258 return klass();
7259 }
7260
7261 ciKlass* TypeAryKlassPtr::klass() const {
7262 if (_klass != nullptr) {
7263 return _klass;
7264 }
7265 ciKlass* k = nullptr;
7266 if (elem()->isa_klassptr()) {
7267 // leave null
7268 } else if ((elem()->base() == Type::Top) ||
7269 (elem()->base() == Type::Bottom)) {
7270 } else {
7271 k = ciTypeArrayKlass::make(elem()->basic_type());
7272 ((TypeAryKlassPtr*)this)->_klass = k;
7273 }
7274 return k;
7275 }
7276
7277 //------------------------------dump2------------------------------------------
7278 // Dump Klass Type
7279 #ifndef PRODUCT
7280 void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
7281 st->print("aryklassptr:[");
7282 _elem->dump2(d, depth, st);
7283 _interfaces->dump(st);
7284 st->print(":%s", ptr_msg[_ptr]);
7285 if (_flat) st->print(":flat");
7286 if (_null_free) st->print(":null free");
7287 if (_atomic) st->print(":atomic");
7288 if (_refined_type) st->print(":refined_type");
7289 if (Verbose) {
7290 if (_not_flat) st->print(":not flat");
7291 if (_not_null_free) st->print(":nullable");
7292 }
7293 dump_offset(st);
7294 }
7295 #endif
7296
7297 const Type* TypeAryKlassPtr::base_element_type(int& dims) const {
7298 const Type* elem = this->elem();
7299 dims = 1;
7300 while (elem->isa_aryklassptr()) {
7301 elem = elem->is_aryklassptr()->elem();
7302 dims++;
7303 }
7304 return elem;
7305 }
7306
7307 //=============================================================================
7308 // Convenience common pre-built types.
7309
7310 //------------------------------make-------------------------------------------
7311 const TypeFunc *TypeFunc::make(const TypeTuple *domain_sig, const TypeTuple* domain_cc,
7312 const TypeTuple *range_sig, const TypeTuple *range_cc) {
7313 return (TypeFunc*)(new TypeFunc(domain_sig, domain_cc, range_sig, range_cc))->hashcons();
7314 }
7315
7316 const TypeFunc *TypeFunc::make(const TypeTuple *domain, const TypeTuple *range) {
7317 return make(domain, domain, range, range);
7318 }
7319
7320 //------------------------------osr_domain-----------------------------
7321 const TypeTuple* osr_domain() {
7322 const Type **fields = TypeTuple::fields(2);
7323 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // address of osr buffer
7324 return TypeTuple::make(TypeFunc::Parms+1, fields);
7325 }
7326
7327 //------------------------------make-------------------------------------------
7328 const TypeFunc* TypeFunc::make(ciMethod* method, bool is_osr_compilation) {
7329 Compile* C = Compile::current();
7330 const TypeFunc* tf = nullptr;
7331 if (!is_osr_compilation) {
7332 tf = C->last_tf(method); // check cache
7333 if (tf != nullptr) return tf; // The hit rate here is almost 50%.
7334 }
7335 // Inline types are not passed/returned by reference, instead each field of
7336 // the inline type is passed/returned as an argument. We maintain two views of
7337 // the argument/return list here: one based on the signature (with an inline
7338 // type argument/return as a single slot), one based on the actual calling
7339 // convention (with an inline type argument/return as a list of its fields).
7340 bool has_scalar_args = method->has_scalarized_args() && !is_osr_compilation;
7341 // Fall back to the non-scalarized calling convention when compiling a call via a mismatching method
7342 if (method != C->method() && method->mismatch()) {
7343 has_scalar_args = false;
7344 }
7345 const TypeTuple* domain_sig = is_osr_compilation ? osr_domain() : TypeTuple::make_domain(method, ignore_interfaces, false);
7346 const TypeTuple* domain_cc = has_scalar_args ? TypeTuple::make_domain(method, ignore_interfaces, true) : domain_sig;
7347 ciSignature* sig = method->signature();
7348 bool has_scalar_ret = !method->is_native() && sig->return_type()->is_inlinetype() && sig->return_type()->as_inline_klass()->can_be_returned_as_fields();
7349 const TypeTuple* range_sig = TypeTuple::make_range(sig, ignore_interfaces, false);
7350 const TypeTuple* range_cc = has_scalar_ret ? TypeTuple::make_range(sig, ignore_interfaces, true) : range_sig;
7351 tf = TypeFunc::make(domain_sig, domain_cc, range_sig, range_cc);
7352 if (!is_osr_compilation) {
7353 C->set_last_tf(method, tf); // fill cache
7354 }
7355 return tf;
7356 }
7357
7358 //------------------------------meet-------------------------------------------
7359 // Compute the MEET of two types. It returns a new Type object.
7360 const Type *TypeFunc::xmeet( const Type *t ) const {
7361 // Perform a fast test for common case; meeting the same types together.
7362 if( this == t ) return this; // Meeting same type-rep?
7363
7364 // Current "this->_base" is Func
7365 switch (t->base()) { // switch on original type
7366
7367 case Bottom: // Ye Olde Default
7368 return t;
7369
7370 default: // All else is a mistake
7371 typerr(t);
7372
7373 case Top:
7374 break;
7375 }
7376 return this; // Return the double constant
7377 }
7378
7379 //------------------------------xdual------------------------------------------
7380 // Dual: compute field-by-field dual
7381 const Type *TypeFunc::xdual() const {
7382 return this;
7383 }
7384
7385 //------------------------------eq---------------------------------------------
7386 // Structural equality check for Type representations
7387 bool TypeFunc::eq( const Type *t ) const {
7388 const TypeFunc *a = (const TypeFunc*)t;
7389 return _domain_sig == a->_domain_sig &&
7390 _domain_cc == a->_domain_cc &&
7391 _range_sig == a->_range_sig &&
7392 _range_cc == a->_range_cc;
7393 }
7394
7395 //------------------------------hash-------------------------------------------
7396 // Type-specific hashing function.
7397 uint TypeFunc::hash(void) const {
7398 return (uint)(intptr_t)_domain_sig + (uint)(intptr_t)_domain_cc + (uint)(intptr_t)_range_sig + (uint)(intptr_t)_range_cc;
7399 }
7400
7401 //------------------------------dump2------------------------------------------
7402 // Dump Function Type
7403 #ifndef PRODUCT
7404 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
7405 if( _range_sig->cnt() <= Parms )
7406 st->print("void");
7407 else {
7408 uint i;
7409 for (i = Parms; i < _range_sig->cnt()-1; i++) {
7410 _range_sig->field_at(i)->dump2(d,depth,st);
7411 st->print("/");
7412 }
7413 _range_sig->field_at(i)->dump2(d,depth,st);
7414 }
7415 st->print(" ");
7416 st->print("( ");
7417 if( !depth || d[this] ) { // Check for recursive dump
7418 st->print("...)");
7419 return;
7420 }
7421 d.Insert((void*)this,(void*)this); // Stop recursion
7422 if (Parms < _domain_sig->cnt())
7423 _domain_sig->field_at(Parms)->dump2(d,depth-1,st);
7424 for (uint i = Parms+1; i < _domain_sig->cnt(); i++) {
7425 st->print(", ");
7426 _domain_sig->field_at(i)->dump2(d,depth-1,st);
7427 }
7428 st->print(" )");
7429 }
7430 #endif
7431
7432 //------------------------------singleton--------------------------------------
7433 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
7434 // constants (Ldi nodes). Singletons are integer, float or double constants
7435 // or a single symbol.
7436 bool TypeFunc::singleton(void) const {
7437 return false; // Never a singleton
7438 }
7439
7440 bool TypeFunc::empty(void) const {
7441 return false; // Never empty
7442 }
7443
7444
7445 BasicType TypeFunc::return_type() const{
7446 if (range_sig()->cnt() == TypeFunc::Parms) {
7447 return T_VOID;
7448 }
7449 return range_sig()->field_at(TypeFunc::Parms)->basic_type();
7450 }
|