1 /*
2 * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
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
53 // Portions of code courtesy of Clifford Click
54
55 // Optimization - Graph Style
56
57 // Dictionary of types shared among compilations.
58 Dict* Type::_shared_type_dict = nullptr;
59
60 // Array which maps compiler types to Basic Types
61 const Type::TypeInfo Type::_type_info[Type::lastype] = {
62 { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg}, // Bad
63 { Control, T_ILLEGAL, "control", false, 0 }, // Control
64 { Bottom, T_VOID, "top", false, 0 }, // Top
65 { Bad, T_INT, "int:", false, Op_RegI }, // Int
66 { Bad, T_LONG, "long:", false, Op_RegL }, // Long
67 { Half, T_VOID, "half", false, 0 }, // Half
68 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN }, // NarrowOop
69 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN }, // NarrowKlass
70 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg}, // Tuple
71 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg}, // Array
72 { Bad, T_ARRAY, "interfaces:", false, Node::NotAMachineReg}, // Interfaces
73
74 #if defined(PPC64)
75 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask }, // VectorMask.
76 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA }, // VectorA.
77 { Bad, T_ILLEGAL, "vectors:", false, 0 }, // VectorS
78 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL }, // VectorD
79 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX }, // VectorX
80 { Bad, T_ILLEGAL, "vectory:", false, 0 }, // VectorY
81 { Bad, T_ILLEGAL, "vectorz:", false, 0 }, // VectorZ
82 #elif defined(S390)
83 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask }, // VectorMask.
84 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA }, // VectorA.
85 { Bad, T_ILLEGAL, "vectors:", false, 0 }, // VectorS
86 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL }, // VectorD
87 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX }, // VectorX
88 { Bad, T_ILLEGAL, "vectory:", false, 0 }, // VectorY
89 { Bad, T_ILLEGAL, "vectorz:", false, 0 }, // VectorZ
90 #else // all other
91 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask }, // VectorMask.
92 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA }, // VectorA.
93 { Bad, T_ILLEGAL, "vectors:", false, Op_VecS }, // VectorS
94 { Bad, T_ILLEGAL, "vectord:", false, Op_VecD }, // VectorD
95 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX }, // VectorX
96 { Bad, T_ILLEGAL, "vectory:", false, Op_VecY }, // VectorY
97 { Bad, T_ILLEGAL, "vectorz:", false, Op_VecZ }, // VectorZ
98 #endif
99 { Bad, T_ADDRESS, "anyptr:", false, Op_RegP }, // AnyPtr
100 { Bad, T_ADDRESS, "rawptr:", false, Op_RegP }, // RawPtr
101 { Bad, T_OBJECT, "oop:", true, Op_RegP }, // OopPtr
102 { Bad, T_OBJECT, "inst:", true, Op_RegP }, // InstPtr
103 { Bad, T_OBJECT, "ary:", true, Op_RegP }, // AryPtr
104 { Bad, T_METADATA, "metadata:", false, Op_RegP }, // MetadataPtr
105 { Bad, T_METADATA, "klass:", false, Op_RegP }, // KlassPtr
106 { Bad, T_METADATA, "instklass:", false, Op_RegP }, // InstKlassPtr
107 { Bad, T_METADATA, "aryklass:", false, Op_RegP }, // AryKlassPtr
108 { Bad, T_OBJECT, "func", false, 0 }, // Function
109 { Abio, T_ILLEGAL, "abIO", false, 0 }, // Abio
110 { Return_Address, T_ADDRESS, "return_address",false, Op_RegP }, // Return_Address
111 { Memory, T_ILLEGAL, "memory", false, 0 }, // Memory
112 { HalfFloatBot, T_SHORT, "halffloat_top", false, Op_RegF }, // HalfFloatTop
113 { HalfFloatCon, T_SHORT, "hfcon:", false, Op_RegF }, // HalfFloatCon
114 { HalfFloatTop, T_SHORT, "short", false, Op_RegF }, // HalfFloatBot
115 { FloatBot, T_FLOAT, "float_top", false, Op_RegF }, // FloatTop
116 { FloatCon, T_FLOAT, "ftcon:", false, Op_RegF }, // FloatCon
117 { FloatTop, T_FLOAT, "float", false, Op_RegF }, // FloatBot
118 { DoubleBot, T_DOUBLE, "double_top", false, Op_RegD }, // DoubleTop
119 { DoubleCon, T_DOUBLE, "dblcon:", false, Op_RegD }, // DoubleCon
120 { DoubleTop, T_DOUBLE, "double", false, Op_RegD }, // DoubleBot
121 { Top, T_ILLEGAL, "bottom", false, 0 } // Bottom
122 };
123
124 // Map ideal registers (machine types) to ideal types
125 const Type *Type::mreg2type[_last_machine_leaf];
126
127 // Map basic types to canonical Type* pointers.
128 const Type* Type:: _const_basic_type[T_CONFLICT+1];
129
130 // Map basic types to constant-zero Types.
131 const Type* Type:: _zero_type[T_CONFLICT+1];
132
133 // Map basic types to array-body alias types.
134 const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1];
135 const TypeInterfaces* TypeAryPtr::_array_interfaces = nullptr;
136 const TypeInterfaces* TypeAryKlassPtr::_array_interfaces = nullptr;
137
138 //=============================================================================
139 // Convenience common pre-built types.
140 const Type *Type::ABIO; // State-of-machine only
141 const Type *Type::BOTTOM; // All values
142 const Type *Type::CONTROL; // Control only
143 const Type *Type::DOUBLE; // All doubles
144 const Type *Type::HALF_FLOAT; // All half floats
145 const Type *Type::FLOAT; // All floats
146 const Type *Type::HALF; // Placeholder half of doublewide type
147 const Type *Type::MEMORY; // Abstract store only
148 const Type *Type::RETURN_ADDRESS;
149 const Type *Type::TOP; // No values in set
150
151 //------------------------------get_const_type---------------------------
152 const Type* Type::get_const_type(ciType* type, InterfaceHandling interface_handling) {
153 if (type == nullptr) {
154 return nullptr;
155 } else if (type->is_primitive_type()) {
156 return get_const_basic_type(type->basic_type());
157 } else {
158 return TypeOopPtr::make_from_klass(type->as_klass(), interface_handling);
159 }
160 }
161
162 //---------------------------array_element_basic_type---------------------------------
163 // Mapping to the array element's basic type.
164 BasicType Type::array_element_basic_type() const {
165 BasicType bt = basic_type();
166 if (bt == T_INT) {
167 if (this == TypeInt::INT) return T_INT;
168 if (this == TypeInt::CHAR) return T_CHAR;
169 if (this == TypeInt::BYTE) return T_BYTE;
170 if (this == TypeInt::BOOL) return T_BOOLEAN;
171 if (this == TypeInt::SHORT) return T_SHORT;
172 return T_VOID;
173 }
174 return bt;
175 }
176
177 // For two instance arrays of same dimension, return the base element types.
178 // Otherwise or if the arrays have different dimensions, return null.
179 void Type::get_arrays_base_elements(const Type *a1, const Type *a2,
180 const TypeInstPtr **e1, const TypeInstPtr **e2) {
181
182 if (e1) *e1 = nullptr;
183 if (e2) *e2 = nullptr;
184 const TypeAryPtr* a1tap = (a1 == nullptr) ? nullptr : a1->isa_aryptr();
185 const TypeAryPtr* a2tap = (a2 == nullptr) ? nullptr : a2->isa_aryptr();
186
187 if (a1tap != nullptr && a2tap != nullptr) {
188 // Handle multidimensional arrays
189 const TypePtr* a1tp = a1tap->elem()->make_ptr();
190 const TypePtr* a2tp = a2tap->elem()->make_ptr();
191 while (a1tp && a1tp->isa_aryptr() && a2tp && a2tp->isa_aryptr()) {
192 a1tap = a1tp->is_aryptr();
193 a2tap = a2tp->is_aryptr();
194 a1tp = a1tap->elem()->make_ptr();
195 a2tp = a2tap->elem()->make_ptr();
196 }
197 if (a1tp && a1tp->isa_instptr() && a2tp && a2tp->isa_instptr()) {
198 if (e1) *e1 = a1tp->is_instptr();
199 if (e2) *e2 = a2tp->is_instptr();
200 }
201 }
202 }
203
204 //---------------------------get_typeflow_type---------------------------------
205 // Import a type produced by ciTypeFlow.
206 const Type* Type::get_typeflow_type(ciType* type) {
207 switch (type->basic_type()) {
208
209 case ciTypeFlow::StateVector::T_BOTTOM:
210 assert(type == ciTypeFlow::StateVector::bottom_type(), "");
211 return Type::BOTTOM;
212
213 case ciTypeFlow::StateVector::T_TOP:
214 assert(type == ciTypeFlow::StateVector::top_type(), "");
215 return Type::TOP;
216
217 case ciTypeFlow::StateVector::T_NULL:
218 assert(type == ciTypeFlow::StateVector::null_type(), "");
219 return TypePtr::NULL_PTR;
220
221 case ciTypeFlow::StateVector::T_LONG2:
222 // The ciTypeFlow pass pushes a long, then the half.
223 // We do the same.
224 assert(type == ciTypeFlow::StateVector::long2_type(), "");
225 return TypeInt::TOP;
226
227 case ciTypeFlow::StateVector::T_DOUBLE2:
228 // The ciTypeFlow pass pushes double, then the half.
229 // Our convention is the same.
230 assert(type == ciTypeFlow::StateVector::double2_type(), "");
231 return Type::TOP;
232
233 case T_ADDRESS:
234 assert(type->is_return_address(), "");
235 return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci(), relocInfo::none);
236
237 default:
238 // make sure we did not mix up the cases:
239 assert(type != ciTypeFlow::StateVector::bottom_type(), "");
240 assert(type != ciTypeFlow::StateVector::top_type(), "");
241 assert(type != ciTypeFlow::StateVector::null_type(), "");
242 assert(type != ciTypeFlow::StateVector::long2_type(), "");
243 assert(type != ciTypeFlow::StateVector::double2_type(), "");
244 assert(!type->is_return_address(), "");
245
246 return Type::get_const_type(type);
247 }
248 }
249
250
251 //-----------------------make_from_constant------------------------------------
252 const Type* Type::make_from_constant(ciConstant constant, bool require_constant,
253 int stable_dimension, bool is_narrow_oop,
254 bool is_autobox_cache) {
255 switch (constant.basic_type()) {
256 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
257 case T_CHAR: return TypeInt::make(constant.as_char());
258 case T_BYTE: return TypeInt::make(constant.as_byte());
259 case T_SHORT: return TypeInt::make(constant.as_short());
260 case T_INT: return TypeInt::make(constant.as_int());
261 case T_LONG: return TypeLong::make(constant.as_long());
262 case T_FLOAT: return TypeF::make(constant.as_float());
263 case T_DOUBLE: return TypeD::make(constant.as_double());
264 case T_ARRAY:
265 case T_OBJECT: {
266 const Type* con_type = nullptr;
267 ciObject* oop_constant = constant.as_object();
268 if (oop_constant->is_null_object()) {
269 con_type = Type::get_zero_type(T_OBJECT);
270 } else {
271 guarantee(require_constant || oop_constant->should_be_constant(), "con_type must get computed");
272 con_type = TypeOopPtr::make_from_constant(oop_constant, require_constant);
273 if (Compile::current()->eliminate_boxing() && is_autobox_cache) {
274 con_type = con_type->is_aryptr()->cast_to_autobox_cache();
275 }
276 if (stable_dimension > 0) {
277 assert(FoldStableValues, "sanity");
278 assert(!con_type->is_zero_type(), "default value for stable field");
279 con_type = con_type->is_aryptr()->cast_to_stable(true, stable_dimension);
280 }
281 }
282 if (is_narrow_oop) {
283 con_type = con_type->make_narrowoop();
284 }
285 return con_type;
286 }
287 case T_ILLEGAL:
288 // Invalid ciConstant returned due to OutOfMemoryError in the CI
289 assert(Compile::current()->env()->failing(), "otherwise should not see this");
290 return nullptr;
291 default:
292 // Fall through to failure
293 return nullptr;
294 }
295 }
296
297 static ciConstant check_mismatched_access(ciConstant con, BasicType loadbt, bool is_unsigned) {
298 BasicType conbt = con.basic_type();
299 switch (conbt) {
300 case T_BOOLEAN: conbt = T_BYTE; break;
301 case T_ARRAY: conbt = T_OBJECT; break;
302 default: break;
303 }
304 switch (loadbt) {
305 case T_BOOLEAN: loadbt = T_BYTE; break;
306 case T_NARROWOOP: loadbt = T_OBJECT; break;
307 case T_ARRAY: loadbt = T_OBJECT; break;
308 case T_ADDRESS: loadbt = T_OBJECT; break;
309 default: break;
310 }
311 if (conbt == loadbt) {
312 if (is_unsigned && conbt == T_BYTE) {
313 // LoadB (T_BYTE) with a small mask (<=8-bit) is converted to LoadUB (T_BYTE).
314 return ciConstant(T_INT, con.as_int() & 0xFF);
315 } else {
316 return con;
317 }
318 }
319 if (conbt == T_SHORT && loadbt == T_CHAR) {
320 // LoadS (T_SHORT) with a small mask (<=16-bit) is converted to LoadUS (T_CHAR).
321 return ciConstant(T_INT, con.as_int() & 0xFFFF);
322 }
323 return ciConstant(); // T_ILLEGAL
324 }
325
326 // Try to constant-fold a stable array element.
327 const Type* Type::make_constant_from_array_element(ciArray* array, int off, int stable_dimension,
328 BasicType loadbt, bool is_unsigned_load) {
329 // Decode the results of GraphKit::array_element_address.
330 ciConstant element_value = array->element_value_by_offset(off);
331 if (element_value.basic_type() == T_ILLEGAL) {
332 return nullptr; // wrong offset
333 }
334 ciConstant con = check_mismatched_access(element_value, loadbt, is_unsigned_load);
335
336 assert(con.basic_type() != T_ILLEGAL, "elembt=%s; loadbt=%s; unsigned=%d",
337 type2name(element_value.basic_type()), type2name(loadbt), is_unsigned_load);
338
339 if (con.is_valid() && // not a mismatched access
340 !con.is_null_or_zero()) { // not a default value
341 bool is_narrow_oop = (loadbt == T_NARROWOOP);
342 return Type::make_from_constant(con, /*require_constant=*/true, stable_dimension, is_narrow_oop, /*is_autobox_cache=*/false);
343 }
344 return nullptr;
345 }
346
347 const Type* Type::make_constant_from_field(ciInstance* holder, int off, bool is_unsigned_load, BasicType loadbt) {
348 ciField* field;
349 ciType* type = holder->java_mirror_type();
350 if (type != nullptr && type->is_instance_klass() && off >= InstanceMirrorKlass::offset_of_static_fields()) {
351 // Static field
352 field = type->as_instance_klass()->get_field_by_offset(off, /*is_static=*/true);
353 } else {
354 // Instance field
355 field = holder->klass()->as_instance_klass()->get_field_by_offset(off, /*is_static=*/false);
356 }
357 if (field == nullptr) {
358 return nullptr; // Wrong offset
359 }
360 return Type::make_constant_from_field(field, holder, loadbt, is_unsigned_load);
361 }
362
363 const Type* Type::make_constant_from_field(ciField* field, ciInstance* holder,
364 BasicType loadbt, bool is_unsigned_load) {
365 if (!field->is_constant()) {
366 return nullptr; // Non-constant field
367 }
368 ciConstant field_value;
369 if (field->is_static()) {
370 // final static field
371 field_value = field->constant_value();
372 } else if (holder != nullptr) {
373 // final or stable non-static field
374 // Treat final non-static fields of trusted classes (classes in
375 // java.lang.invoke and sun.invoke packages and subpackages) as
376 // compile time constants.
377 field_value = field->constant_value_of(holder);
378 }
379 if (!field_value.is_valid()) {
380 return nullptr; // Not a constant
381 }
382
383 ciConstant con = check_mismatched_access(field_value, loadbt, is_unsigned_load);
384
385 assert(con.is_valid(), "elembt=%s; loadbt=%s; unsigned=%d",
386 type2name(field_value.basic_type()), type2name(loadbt), is_unsigned_load);
387
388 bool is_stable_array = FoldStableValues && field->is_stable() && field->type()->is_array_klass();
389 int stable_dimension = (is_stable_array ? field->type()->as_array_klass()->dimension() : 0);
390 bool is_narrow_oop = (loadbt == T_NARROWOOP);
391
392 const Type* con_type = make_from_constant(con, /*require_constant=*/ true,
393 stable_dimension, is_narrow_oop,
394 field->is_autobox_cache());
395 if (con_type != nullptr && field->is_call_site_target()) {
396 ciCallSite* call_site = holder->as_call_site();
397 if (!call_site->is_fully_initialized_constant_call_site()) {
398 ciMethodHandle* target = con.as_object()->as_method_handle();
399 Compile::current()->dependencies()->assert_call_site_target_value(call_site, target);
400 }
401 }
402 return con_type;
403 }
404
405 //------------------------------make-------------------------------------------
406 // Create a simple Type, with default empty symbol sets. Then hashcons it
407 // and look for an existing copy in the type dictionary.
408 const Type *Type::make( enum TYPES t ) {
409 return (new Type(t))->hashcons();
410 }
411
412 //------------------------------cmp--------------------------------------------
413 bool Type::equals(const Type* t1, const Type* t2) {
414 if (t1->_base != t2->_base) {
415 return false; // Missed badly
416 }
417
418 assert(t1 != t2 || t1->eq(t2), "eq must be reflexive");
419 return t1->eq(t2);
420 }
421
422 const Type* Type::maybe_remove_speculative(bool include_speculative) const {
423 if (!include_speculative) {
424 return remove_speculative();
425 }
426 return this;
427 }
428
429 //------------------------------hash-------------------------------------------
430 int Type::uhash( const Type *const t ) {
431 return (int)t->hash();
432 }
433
434 #define POSITIVE_INFINITE_F 0x7f800000 // hex representation for IEEE 754 single precision positive infinite
435 #define POSITIVE_INFINITE_D 0x7ff0000000000000 // hex representation for IEEE 754 double precision positive infinite
436
437 //--------------------------Initialize_shared----------------------------------
438 void Type::Initialize_shared(Compile* current) {
439 // This method does not need to be locked because the first system
440 // compilations (stub compilations) occur serially. If they are
441 // changed to proceed in parallel, then this section will need
442 // locking.
443
444 Arena* save = current->type_arena();
445 Arena* shared_type_arena = new (mtCompiler)Arena(mtCompiler, Arena::Tag::tag_type);
446
447 current->set_type_arena(shared_type_arena);
448
449 // Map the boolean result of Type::equals into a comparator result that CmpKey expects.
450 CmpKey type_cmp = [](const void* t1, const void* t2) -> int32_t {
451 return Type::equals((Type*) t1, (Type*) t2) ? 0 : 1;
452 };
453
454 _shared_type_dict = new (shared_type_arena) Dict(type_cmp, (Hash) Type::uhash, shared_type_arena, 128);
455 current->set_type_dict(_shared_type_dict);
456
457 // Make shared pre-built types.
458 CONTROL = make(Control); // Control only
459 TOP = make(Top); // No values in set
460 MEMORY = make(Memory); // Abstract store only
461 ABIO = make(Abio); // State-of-machine only
462 RETURN_ADDRESS=make(Return_Address);
463 FLOAT = make(FloatBot); // All floats
464 HALF_FLOAT = make(HalfFloatBot); // All half floats
465 DOUBLE = make(DoubleBot); // All doubles
466 BOTTOM = make(Bottom); // Everything
467 HALF = make(Half); // Placeholder half of doublewide type
468
469 TypeF::MAX = TypeF::make(max_jfloat); // Float MAX
470 TypeF::MIN = TypeF::make(min_jfloat); // Float MIN
471 TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero)
472 TypeF::ONE = TypeF::make(1.0); // Float 1
473 TypeF::POS_INF = TypeF::make(jfloat_cast(POSITIVE_INFINITE_F));
474 TypeF::NEG_INF = TypeF::make(-jfloat_cast(POSITIVE_INFINITE_F));
475
476 TypeH::MAX = TypeH::make(max_jfloat16); // HalfFloat MAX
477 TypeH::MIN = TypeH::make(min_jfloat16); // HalfFloat MIN
478 TypeH::ZERO = TypeH::make((jshort)0); // HalfFloat 0 (positive zero)
479 TypeH::ONE = TypeH::make(one_jfloat16); // HalfFloat 1
480 TypeH::POS_INF = TypeH::make(pos_inf_jfloat16);
481 TypeH::NEG_INF = TypeH::make(neg_inf_jfloat16);
482
483 TypeD::MAX = TypeD::make(max_jdouble); // Double MAX
484 TypeD::MIN = TypeD::make(min_jdouble); // Double MIN
485 TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero)
486 TypeD::ONE = TypeD::make(1.0); // Double 1
487 TypeD::POS_INF = TypeD::make(jdouble_cast(POSITIVE_INFINITE_D));
488 TypeD::NEG_INF = TypeD::make(-jdouble_cast(POSITIVE_INFINITE_D));
489
490 TypeInt::MAX = TypeInt::make(max_jint); // Int MAX
491 TypeInt::MIN = TypeInt::make(min_jint); // Int MIN
492 TypeInt::MINUS_1 = TypeInt::make(-1); // -1
493 TypeInt::ZERO = TypeInt::make( 0); // 0
494 TypeInt::ONE = TypeInt::make( 1); // 1
495 TypeInt::BOOL = TypeInt::make( 0, 1, WidenMin); // 0 or 1, FALSE or TRUE.
496 TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes
497 TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1
498 TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE
499 TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO
500 TypeInt::CC_NE = TypeInt::make_or_top(TypeIntPrototype<jint, juint>{{-1, 1}, {1, max_juint}, {0, 1}}, WidenMin)->is_int();
501 TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin);
502 TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL
503 TypeInt::BYTE = TypeInt::make(-128, 127, WidenMin); // Bytes
504 TypeInt::UBYTE = TypeInt::make(0, 255, WidenMin); // Unsigned Bytes
505 TypeInt::CHAR = TypeInt::make(0, 65535, WidenMin); // Java chars
506 TypeInt::SHORT = TypeInt::make(-32768, 32767, WidenMin); // Java shorts
507 TypeInt::NON_ZERO = TypeInt::make_or_top(TypeIntPrototype<jint, juint>{{min_jint, max_jint}, {1, max_juint}, {0, 0}}, WidenMin)->is_int();
508 TypeInt::POS = TypeInt::make(0, max_jint, WidenMin); // Non-neg values
509 TypeInt::POS1 = TypeInt::make(1, max_jint, WidenMin); // Positive values
510 TypeInt::INT = TypeInt::make(min_jint, max_jint, WidenMax); // 32-bit integers
511 TypeInt::SYMINT = TypeInt::make(-max_jint, max_jint, WidenMin); // symmetric range
512 TypeInt::TYPE_DOMAIN = TypeInt::INT;
513 // CmpL is overloaded both as the bytecode computation returning
514 // a trinary (-1, 0, +1) integer result AND as an efficient long
515 // compare returning optimizer ideal-type flags.
516 assert(TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" );
517 assert(TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" );
518 assert(TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" );
519 assert(TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" );
520
521 TypeLong::MAX = TypeLong::make(max_jlong); // Long MAX
522 TypeLong::MIN = TypeLong::make(min_jlong); // Long MIN
523 TypeLong::MINUS_1 = TypeLong::make(-1); // -1
524 TypeLong::ZERO = TypeLong::make( 0); // 0
525 TypeLong::ONE = TypeLong::make( 1); // 1
526 TypeLong::NON_ZERO = TypeLong::make_or_top(TypeIntPrototype<jlong, julong>{{min_jlong, max_jlong}, {1, max_julong}, {0, 0}}, WidenMin)->is_long();
527 TypeLong::POS = TypeLong::make(0, max_jlong, WidenMin); // Non-neg values
528 TypeLong::NEG = TypeLong::make(min_jlong, -1, WidenMin);
529 TypeLong::LONG = TypeLong::make(min_jlong, max_jlong, WidenMax); // 64-bit integers
530 TypeLong::INT = TypeLong::make((jlong)min_jint, (jlong)max_jint,WidenMin);
531 TypeLong::UINT = TypeLong::make(0, (jlong)max_juint, WidenMin);
532 TypeLong::TYPE_DOMAIN = TypeLong::LONG;
533
534 const Type **fboth =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
535 fboth[0] = Type::CONTROL;
536 fboth[1] = Type::CONTROL;
537 TypeTuple::IFBOTH = TypeTuple::make( 2, fboth );
538
539 const Type **ffalse =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
540 ffalse[0] = Type::CONTROL;
541 ffalse[1] = Type::TOP;
542 TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse );
543
544 const Type **fneither =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
545 fneither[0] = Type::TOP;
546 fneither[1] = Type::TOP;
547 TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither );
548
549 const Type **ftrue =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
550 ftrue[0] = Type::TOP;
551 ftrue[1] = Type::CONTROL;
552 TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue );
553
554 const Type **floop =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
555 floop[0] = Type::CONTROL;
556 floop[1] = TypeInt::INT;
557 TypeTuple::LOOPBODY = TypeTuple::make( 2, floop );
558
559 TypePtr::NULL_PTR= TypePtr::make(AnyPtr, TypePtr::Null, 0);
560 TypePtr::NOTNULL = TypePtr::make(AnyPtr, TypePtr::NotNull, OffsetBot);
561 TypePtr::BOTTOM = TypePtr::make(AnyPtr, TypePtr::BotPTR, OffsetBot);
562
563 TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR );
564 TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull );
565
566 const Type **fmembar = TypeTuple::fields(0);
567 TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar);
568
569 const Type **fsc = (const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*));
570 fsc[0] = TypeInt::CC;
571 fsc[1] = Type::MEMORY;
572 TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc);
573
574 TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass());
575 TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass());
576 TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass());
577 TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
578 false, nullptr, oopDesc::mark_offset_in_bytes());
579 TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
580 false, nullptr, oopDesc::klass_offset_in_bytes());
581 TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot, TypeOopPtr::InstanceBot);
582
583 TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, nullptr, OffsetBot);
584
585 TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR );
586 TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM );
587
588 TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR );
589
590 mreg2type[Op_Node] = Type::BOTTOM;
591 mreg2type[Op_Set ] = nullptr;
592 mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM;
593 mreg2type[Op_RegI] = TypeInt::INT;
594 mreg2type[Op_RegP] = TypePtr::BOTTOM;
595 mreg2type[Op_RegF] = Type::FLOAT;
596 mreg2type[Op_RegD] = Type::DOUBLE;
597 mreg2type[Op_RegL] = TypeLong::LONG;
598 mreg2type[Op_RegFlags] = TypeInt::CC;
599
600 GrowableArray<ciInstanceKlass*> array_interfaces;
601 array_interfaces.push(current->env()->Cloneable_klass());
602 array_interfaces.push(current->env()->Serializable_klass());
603 TypeAryPtr::_array_interfaces = TypeInterfaces::make(&array_interfaces);
604 TypeAryKlassPtr::_array_interfaces = TypeAryPtr::_array_interfaces;
605
606 TypeAryPtr::BOTTOM = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::BOTTOM, TypeInt::POS), nullptr, false, Type::OffsetBot);
607 TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), nullptr /* current->env()->Object_klass() */, false, arrayOopDesc::length_offset_in_bytes());
608
609 TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), nullptr /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
610
611 #ifdef _LP64
612 if (UseCompressedOops) {
613 assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop");
614 TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS;
615 } else
616 #endif
617 {
618 // There is no shared klass for Object[]. See note in TypeAryPtr::klass().
619 TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), nullptr /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
620 }
621 TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot);
622 TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot);
623 TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot);
624 TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot);
625 TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot);
626 TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot);
627 TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot);
628
629 // Nobody should ask _array_body_type[T_NARROWOOP]. Use null as assert.
630 TypeAryPtr::_array_body_type[T_NARROWOOP] = nullptr;
631 TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS;
632 TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays
633 TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES;
634 TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array
635 TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS;
636 TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS;
637 TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS;
638 TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS;
639 TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS;
640 TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES;
641
642 TypeInstKlassPtr::OBJECT = TypeInstKlassPtr::make(TypePtr::NotNull, current->env()->Object_klass(), 0);
643 TypeInstKlassPtr::OBJECT_OR_NULL = TypeInstKlassPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), 0);
644
645 const Type **fi2c = TypeTuple::fields(2);
646 fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method*
647 fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer
648 TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c);
649
650 const Type **intpair = TypeTuple::fields(2);
651 intpair[0] = TypeInt::INT;
652 intpair[1] = TypeInt::INT;
653 TypeTuple::INT_PAIR = TypeTuple::make(2, intpair);
654
655 const Type **longpair = TypeTuple::fields(2);
656 longpair[0] = TypeLong::LONG;
657 longpair[1] = TypeLong::LONG;
658 TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair);
659
660 const Type **intccpair = TypeTuple::fields(2);
661 intccpair[0] = TypeInt::INT;
662 intccpair[1] = TypeInt::CC;
663 TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair);
664
665 const Type **longccpair = TypeTuple::fields(2);
666 longccpair[0] = TypeLong::LONG;
667 longccpair[1] = TypeInt::CC;
668 TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair);
669
670 _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM;
671 _const_basic_type[T_NARROWKLASS] = Type::BOTTOM;
672 _const_basic_type[T_BOOLEAN] = TypeInt::BOOL;
673 _const_basic_type[T_CHAR] = TypeInt::CHAR;
674 _const_basic_type[T_BYTE] = TypeInt::BYTE;
675 _const_basic_type[T_SHORT] = TypeInt::SHORT;
676 _const_basic_type[T_INT] = TypeInt::INT;
677 _const_basic_type[T_LONG] = TypeLong::LONG;
678 _const_basic_type[T_FLOAT] = Type::FLOAT;
679 _const_basic_type[T_DOUBLE] = Type::DOUBLE;
680 _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM;
681 _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays
682 _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way
683 _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs
684 _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not?
685
686 _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR;
687 _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR;
688 _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0
689 _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0
690 _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0
691 _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0
692 _zero_type[T_INT] = TypeInt::ZERO;
693 _zero_type[T_LONG] = TypeLong::ZERO;
694 _zero_type[T_FLOAT] = TypeF::ZERO;
695 _zero_type[T_DOUBLE] = TypeD::ZERO;
696 _zero_type[T_OBJECT] = TypePtr::NULL_PTR;
697 _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop
698 _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null
699 _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all
700
701 // get_zero_type() should not happen for T_CONFLICT
702 _zero_type[T_CONFLICT]= nullptr;
703
704 TypeVect::VECTMASK = (TypeVect*)(new TypePVectMask(T_BOOLEAN, MaxVectorSize))->hashcons();
705 mreg2type[Op_RegVectMask] = TypeVect::VECTMASK;
706
707 if (Matcher::supports_scalable_vector()) {
708 TypeVect::VECTA = TypeVect::make(T_BYTE, Matcher::scalable_vector_reg_size(T_BYTE));
709 }
710
711 // Vector predefined types, it needs initialized _const_basic_type[].
712 if (Matcher::vector_size_supported(T_BYTE, 4)) {
713 TypeVect::VECTS = TypeVect::make(T_BYTE, 4);
714 }
715 if (Matcher::vector_size_supported(T_FLOAT, 2)) {
716 TypeVect::VECTD = TypeVect::make(T_FLOAT, 2);
717 }
718 if (Matcher::vector_size_supported(T_FLOAT, 4)) {
719 TypeVect::VECTX = TypeVect::make(T_FLOAT, 4);
720 }
721 if (Matcher::vector_size_supported(T_FLOAT, 8)) {
722 TypeVect::VECTY = TypeVect::make(T_FLOAT, 8);
723 }
724 if (Matcher::vector_size_supported(T_FLOAT, 16)) {
725 TypeVect::VECTZ = TypeVect::make(T_FLOAT, 16);
726 }
727
728 mreg2type[Op_VecA] = TypeVect::VECTA;
729 mreg2type[Op_VecS] = TypeVect::VECTS;
730 mreg2type[Op_VecD] = TypeVect::VECTD;
731 mreg2type[Op_VecX] = TypeVect::VECTX;
732 mreg2type[Op_VecY] = TypeVect::VECTY;
733 mreg2type[Op_VecZ] = TypeVect::VECTZ;
734
735 BarrierSetC2::make_clone_type();
736 LockNode::initialize_lock_Type();
737 ArrayCopyNode::initialize_arraycopy_Type();
738 OptoRuntime::initialize_types();
739
740 // Restore working type arena.
741 current->set_type_arena(save);
742 current->set_type_dict(nullptr);
743 }
744
745 //------------------------------Initialize-------------------------------------
746 void Type::Initialize(Compile* current) {
747 assert(current->type_arena() != nullptr, "must have created type arena");
748
749 if (_shared_type_dict == nullptr) {
750 Initialize_shared(current);
751 }
752
753 Arena* type_arena = current->type_arena();
754
755 // Create the hash-cons'ing dictionary with top-level storage allocation
756 Dict *tdic = new (type_arena) Dict(*_shared_type_dict, type_arena);
757 current->set_type_dict(tdic);
758 }
759
760 //------------------------------hashcons---------------------------------------
761 // Do the hash-cons trick. If the Type already exists in the type table,
762 // delete the current Type and return the existing Type. Otherwise stick the
763 // current Type in the Type table.
764 const Type *Type::hashcons(void) {
765 DEBUG_ONLY(base()); // Check the assertion in Type::base().
766 // Look up the Type in the Type dictionary
767 Dict *tdic = type_dict();
768 Type* old = (Type*)(tdic->Insert(this, this, false));
769 if( old ) { // Pre-existing Type?
770 if( old != this ) // Yes, this guy is not the pre-existing?
771 delete this; // Yes, Nuke this guy
772 assert( old->_dual, "" );
773 return old; // Return pre-existing
774 }
775
776 // Every type has a dual (to make my lattice symmetric).
777 // Since we just discovered a new Type, compute its dual right now.
778 assert( !_dual, "" ); // No dual yet
779 _dual = xdual(); // Compute the dual
780 if (equals(this, _dual)) { // Handle self-symmetric
781 if (_dual != this) {
782 delete _dual;
783 _dual = this;
784 }
785 return this;
786 }
787 assert( !_dual->_dual, "" ); // No reverse dual yet
788 assert( !(*tdic)[_dual], "" ); // Dual not in type system either
789 // New Type, insert into Type table
790 tdic->Insert((void*)_dual,(void*)_dual);
791 ((Type*)_dual)->_dual = this; // Finish up being symmetric
792 #ifdef ASSERT
793 Type *dual_dual = (Type*)_dual->xdual();
794 assert( eq(dual_dual), "xdual(xdual()) should be identity" );
795 delete dual_dual;
796 #endif
797 return this; // Return new Type
798 }
799
800 //------------------------------eq---------------------------------------------
801 // Structural equality check for Type representations
802 bool Type::eq( const Type * ) const {
803 return true; // Nothing else can go wrong
804 }
805
806 //------------------------------hash-------------------------------------------
807 // Type-specific hashing function.
808 uint Type::hash(void) const {
809 return _base;
810 }
811
812 //------------------------------is_finite--------------------------------------
813 // Has a finite value
814 bool Type::is_finite() const {
815 return false;
816 }
817
818 //------------------------------is_nan-----------------------------------------
819 // Is not a number (NaN)
820 bool Type::is_nan() const {
821 return false;
822 }
823
824 #ifdef ASSERT
825 class VerifyMeet;
826 class VerifyMeetResult : public ArenaObj {
827 friend class VerifyMeet;
828 friend class Type;
829 private:
830 class VerifyMeetResultEntry {
831 private:
832 const Type* _in1;
833 const Type* _in2;
834 const Type* _res;
835 public:
836 VerifyMeetResultEntry(const Type* in1, const Type* in2, const Type* res):
837 _in1(in1), _in2(in2), _res(res) {
838 }
839 VerifyMeetResultEntry():
840 _in1(nullptr), _in2(nullptr), _res(nullptr) {
841 }
842
843 bool operator==(const VerifyMeetResultEntry& rhs) const {
844 return _in1 == rhs._in1 &&
845 _in2 == rhs._in2 &&
846 _res == rhs._res;
847 }
848
849 bool operator!=(const VerifyMeetResultEntry& rhs) const {
850 return !(rhs == *this);
851 }
852
853 static int compare(const VerifyMeetResultEntry& v1, const VerifyMeetResultEntry& v2) {
854 if ((intptr_t) v1._in1 < (intptr_t) v2._in1) {
855 return -1;
856 } else if (v1._in1 == v2._in1) {
857 if ((intptr_t) v1._in2 < (intptr_t) v2._in2) {
858 return -1;
859 } else if (v1._in2 == v2._in2) {
860 assert(v1._res == v2._res || v1._res == nullptr || v2._res == nullptr, "same inputs should lead to same result");
861 return 0;
862 }
863 return 1;
864 }
865 return 1;
866 }
867 const Type* res() const { return _res; }
868 };
869 uint _depth;
870 GrowableArray<VerifyMeetResultEntry> _cache;
871
872 // With verification code, the meet of A and B causes the computation of:
873 // 1- meet(A, B)
874 // 2- meet(B, A)
875 // 3- meet(dual(meet(A, B)), dual(A))
876 // 4- meet(dual(meet(A, B)), dual(B))
877 // 5- meet(dual(A), dual(B))
878 // 6- meet(dual(B), dual(A))
879 // 7- meet(dual(meet(dual(A), dual(B))), A)
880 // 8- meet(dual(meet(dual(A), dual(B))), B)
881 //
882 // In addition the meet of A[] and B[] requires the computation of the meet of A and B.
883 //
884 // The meet of A[] and B[] triggers the computation of:
885 // 1- meet(A[], B[][)
886 // 1.1- meet(A, B)
887 // 1.2- meet(B, A)
888 // 1.3- meet(dual(meet(A, B)), dual(A))
889 // 1.4- meet(dual(meet(A, B)), dual(B))
890 // 1.5- meet(dual(A), dual(B))
891 // 1.6- meet(dual(B), dual(A))
892 // 1.7- meet(dual(meet(dual(A), dual(B))), A)
893 // 1.8- meet(dual(meet(dual(A), dual(B))), B)
894 // 2- meet(B[], A[])
895 // 2.1- meet(B, A) = 1.2
896 // 2.2- meet(A, B) = 1.1
897 // 2.3- meet(dual(meet(B, A)), dual(B)) = 1.4
898 // 2.4- meet(dual(meet(B, A)), dual(A)) = 1.3
899 // 2.5- meet(dual(B), dual(A)) = 1.6
900 // 2.6- meet(dual(A), dual(B)) = 1.5
901 // 2.7- meet(dual(meet(dual(B), dual(A))), B) = 1.8
902 // 2.8- meet(dual(meet(dual(B), dual(A))), B) = 1.7
903 // etc.
904 // The number of meet operations performed grows exponentially with the number of dimensions of the arrays but the number
905 // of different meet operations is linear in the number of dimensions. The function below caches meet results for the
906 // duration of the meet at the root of the recursive calls.
907 //
908 const Type* meet(const Type* t1, const Type* t2) {
909 bool found = false;
910 const VerifyMeetResultEntry meet(t1, t2, nullptr);
911 int pos = _cache.find_sorted<VerifyMeetResultEntry, VerifyMeetResultEntry::compare>(meet, found);
912 const Type* res = nullptr;
913 if (found) {
914 res = _cache.at(pos).res();
915 } else {
916 res = t1->xmeet(t2);
917 _cache.insert_sorted<VerifyMeetResultEntry::compare>(VerifyMeetResultEntry(t1, t2, res));
918 found = false;
919 _cache.find_sorted<VerifyMeetResultEntry, VerifyMeetResultEntry::compare>(meet, found);
920 assert(found, "should be in table after it's added");
921 }
922 return res;
923 }
924
925 void add(const Type* t1, const Type* t2, const Type* res) {
926 _cache.insert_sorted<VerifyMeetResultEntry::compare>(VerifyMeetResultEntry(t1, t2, res));
927 }
928
929 bool empty_cache() const {
930 return _cache.length() == 0;
931 }
932 public:
933 VerifyMeetResult(Compile* C) :
934 _depth(0), _cache(C->comp_arena(), 2, 0, VerifyMeetResultEntry()) {
935 }
936 };
937
938 void Type::assert_type_verify_empty() const {
939 assert(Compile::current()->_type_verify == nullptr || Compile::current()->_type_verify->empty_cache(), "cache should have been discarded");
940 }
941
942 class VerifyMeet {
943 private:
944 Compile* _C;
945 public:
946 VerifyMeet(Compile* C) : _C(C) {
947 if (C->_type_verify == nullptr) {
948 C->_type_verify = new (C->comp_arena())VerifyMeetResult(C);
949 }
950 _C->_type_verify->_depth++;
951 }
952
953 ~VerifyMeet() {
954 assert(_C->_type_verify->_depth != 0, "");
955 _C->_type_verify->_depth--;
956 if (_C->_type_verify->_depth == 0) {
957 _C->_type_verify->_cache.trunc_to(0);
958 }
959 }
960
961 const Type* meet(const Type* t1, const Type* t2) const {
962 return _C->_type_verify->meet(t1, t2);
963 }
964
965 void add(const Type* t1, const Type* t2, const Type* res) const {
966 _C->_type_verify->add(t1, t2, res);
967 }
968 };
969
970 void Type::check_symmetrical(const Type* t, const Type* mt, const VerifyMeet& verify) const {
971 Compile* C = Compile::current();
972 const Type* mt2 = verify.meet(t, this);
973 if (mt != mt2) {
974 tty->print_cr("=== Meet Not Commutative ===");
975 tty->print("t = "); t->dump(); tty->cr();
976 tty->print("this = "); dump(); tty->cr();
977 tty->print("t meet this = "); mt2->dump(); tty->cr();
978 tty->print("this meet t = "); mt->dump(); tty->cr();
979 fatal("meet not commutative");
980 }
981 const Type* dual_join = mt->_dual;
982 const Type* t2t = verify.meet(dual_join,t->_dual);
983 const Type* t2this = verify.meet(dual_join,this->_dual);
984
985 // Interface meet Oop is Not Symmetric:
986 // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull
987 // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull
988
989 if (t2t != t->_dual || t2this != this->_dual) {
990 tty->print_cr("=== Meet Not Symmetric ===");
991 tty->print("t = "); t->dump(); tty->cr();
992 tty->print("this= "); dump(); tty->cr();
993 tty->print("mt=(t meet this)= "); mt->dump(); tty->cr();
994
995 tty->print("t_dual= "); t->_dual->dump(); tty->cr();
996 tty->print("this_dual= "); _dual->dump(); tty->cr();
997 tty->print("mt_dual= "); mt->_dual->dump(); tty->cr();
998
999 tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr();
1000 tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr();
1001
1002 fatal("meet not symmetric");
1003 }
1004 }
1005 #endif
1006
1007 //------------------------------meet-------------------------------------------
1008 // Compute the MEET of two types. NOT virtual. It enforces that meet is
1009 // commutative and the lattice is symmetric.
1010 const Type *Type::meet_helper(const Type *t, bool include_speculative) const {
1011 if (isa_narrowoop() && t->isa_narrowoop()) {
1012 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
1013 return result->make_narrowoop();
1014 }
1015 if (isa_narrowklass() && t->isa_narrowklass()) {
1016 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
1017 return result->make_narrowklass();
1018 }
1019
1020 #ifdef ASSERT
1021 Compile* C = Compile::current();
1022 VerifyMeet verify(C);
1023 #endif
1024
1025 const Type *this_t = maybe_remove_speculative(include_speculative);
1026 t = t->maybe_remove_speculative(include_speculative);
1027
1028 const Type *mt = this_t->xmeet(t);
1029 #ifdef ASSERT
1030 verify.add(this_t, t, mt);
1031 if (isa_narrowoop() || t->isa_narrowoop()) {
1032 return mt;
1033 }
1034 if (isa_narrowklass() || t->isa_narrowklass()) {
1035 return mt;
1036 }
1037 this_t->check_symmetrical(t, mt, verify);
1038 const Type *mt_dual = verify.meet(this_t->_dual, t->_dual);
1039 this_t->_dual->check_symmetrical(t->_dual, mt_dual, verify);
1040 #endif
1041 return mt;
1042 }
1043
1044 //------------------------------xmeet------------------------------------------
1045 // Compute the MEET of two types. It returns a new Type object.
1046 const Type *Type::xmeet( const Type *t ) const {
1047 // Perform a fast test for common case; meeting the same types together.
1048 if( this == t ) return this; // Meeting same type-rep?
1049
1050 // Meeting TOP with anything?
1051 if( _base == Top ) return t;
1052
1053 // Meeting BOTTOM with anything?
1054 if( _base == Bottom ) return BOTTOM;
1055
1056 // Current "this->_base" is one of: Bad, Multi, Control, Top,
1057 // Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype.
1058 switch (t->base()) { // Switch on original type
1059
1060 // Cut in half the number of cases I must handle. Only need cases for when
1061 // the given enum "t->type" is less than or equal to the local enum "type".
1062 case HalfFloatCon:
1063 case FloatCon:
1064 case DoubleCon:
1065 case Int:
1066 case Long:
1067 return t->xmeet(this);
1068
1069 case OopPtr:
1070 return t->xmeet(this);
1071
1072 case InstPtr:
1073 return t->xmeet(this);
1074
1075 case MetadataPtr:
1076 case KlassPtr:
1077 case InstKlassPtr:
1078 case AryKlassPtr:
1079 return t->xmeet(this);
1080
1081 case AryPtr:
1082 return t->xmeet(this);
1083
1084 case NarrowOop:
1085 return t->xmeet(this);
1086
1087 case NarrowKlass:
1088 return t->xmeet(this);
1089
1090 case Bad: // Type check
1091 default: // Bogus type not in lattice
1092 typerr(t);
1093 return Type::BOTTOM;
1094
1095 case Bottom: // Ye Olde Default
1096 return t;
1097
1098 case HalfFloatTop:
1099 if (_base == HalfFloatTop) { return this; }
1100 case HalfFloatBot: // Half Float
1101 if (_base == HalfFloatBot || _base == HalfFloatTop) { return HALF_FLOAT; }
1102 if (_base == FloatBot || _base == FloatTop) { return Type::BOTTOM; }
1103 if (_base == DoubleTop || _base == DoubleBot) { return Type::BOTTOM; }
1104 typerr(t);
1105 return Type::BOTTOM;
1106
1107 case FloatTop:
1108 if (_base == FloatTop ) { return this; }
1109 case FloatBot: // Float
1110 if (_base == FloatBot || _base == FloatTop) { return FLOAT; }
1111 if (_base == HalfFloatTop || _base == HalfFloatBot) { return Type::BOTTOM; }
1112 if (_base == DoubleTop || _base == DoubleBot) { return Type::BOTTOM; }
1113 typerr(t);
1114 return Type::BOTTOM;
1115
1116 case DoubleTop:
1117 if (_base == DoubleTop) { return this; }
1118 case DoubleBot: // Double
1119 if (_base == DoubleBot || _base == DoubleTop) { return DOUBLE; }
1120 if (_base == HalfFloatTop || _base == HalfFloatBot) { return Type::BOTTOM; }
1121 if (_base == FloatTop || _base == FloatBot) { return Type::BOTTOM; }
1122 typerr(t);
1123 return Type::BOTTOM;
1124
1125 // These next few cases must match exactly or it is a compile-time error.
1126 case Control: // Control of code
1127 case Abio: // State of world outside of program
1128 case Memory:
1129 if (_base == t->_base) { return this; }
1130 typerr(t);
1131 return Type::BOTTOM;
1132
1133 case Top: // Top of the lattice
1134 return this;
1135 }
1136
1137 // The type is unchanged
1138 return this;
1139 }
1140
1141 //-----------------------------filter------------------------------------------
1142 const Type *Type::filter_helper(const Type *kills, bool include_speculative) const {
1143 const Type* ft = join_helper(kills, include_speculative);
1144 if (ft->empty())
1145 return Type::TOP; // Canonical empty value
1146 return ft;
1147 }
1148
1149 //------------------------------xdual------------------------------------------
1150 const Type *Type::xdual() const {
1151 // Note: the base() accessor asserts the sanity of _base.
1152 assert(_type_info[base()].dual_type != Bad, "implement with v-call");
1153 return new Type(_type_info[_base].dual_type);
1154 }
1155
1156 //------------------------------has_memory-------------------------------------
1157 bool Type::has_memory() const {
1158 Type::TYPES tx = base();
1159 if (tx == Memory) return true;
1160 if (tx == Tuple) {
1161 const TypeTuple *t = is_tuple();
1162 for (uint i=0; i < t->cnt(); i++) {
1163 tx = t->field_at(i)->base();
1164 if (tx == Memory) return true;
1165 }
1166 }
1167 return false;
1168 }
1169
1170 #ifndef PRODUCT
1171 //------------------------------dump2------------------------------------------
1172 void Type::dump2( Dict &d, uint depth, outputStream *st ) const {
1173 st->print("%s", _type_info[_base].msg);
1174 }
1175
1176 //------------------------------dump-------------------------------------------
1177 void Type::dump_on(outputStream *st) const {
1178 ResourceMark rm;
1179 Dict d(cmpkey,hashkey); // Stop recursive type dumping
1180 dump2(d,1, st);
1181 if (is_ptr_to_narrowoop()) {
1182 st->print(" [narrow]");
1183 } else if (is_ptr_to_narrowklass()) {
1184 st->print(" [narrowklass]");
1185 }
1186 }
1187
1188 //-----------------------------------------------------------------------------
1189 const char* Type::str(const Type* t) {
1190 stringStream ss;
1191 t->dump_on(&ss);
1192 return ss.as_string();
1193 }
1194 #endif
1195
1196 //------------------------------singleton--------------------------------------
1197 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1198 // constants (Ldi nodes). Singletons are integer, float or double constants.
1199 bool Type::singleton(void) const {
1200 return _base == Top || _base == Half;
1201 }
1202
1203 //------------------------------empty------------------------------------------
1204 // TRUE if Type is a type with no values, FALSE otherwise.
1205 bool Type::empty(void) const {
1206 switch (_base) {
1207 case DoubleTop:
1208 case FloatTop:
1209 case HalfFloatTop:
1210 case Top:
1211 return true;
1212
1213 case Half:
1214 case Abio:
1215 case Return_Address:
1216 case Memory:
1217 case Bottom:
1218 case HalfFloatBot:
1219 case FloatBot:
1220 case DoubleBot:
1221 return false; // never a singleton, therefore never empty
1222
1223 default:
1224 ShouldNotReachHere();
1225 return false;
1226 }
1227 }
1228
1229 //------------------------------dump_stats-------------------------------------
1230 // Dump collected statistics to stderr
1231 #ifndef PRODUCT
1232 void Type::dump_stats() {
1233 tty->print("Types made: %d\n", type_dict()->Size());
1234 }
1235 #endif
1236
1237 //------------------------------category---------------------------------------
1238 #ifndef PRODUCT
1239 Type::Category Type::category() const {
1240 const TypeTuple* tuple;
1241 switch (base()) {
1242 case Type::Int:
1243 case Type::Long:
1244 case Type::Half:
1245 case Type::NarrowOop:
1246 case Type::NarrowKlass:
1247 case Type::Array:
1248 case Type::VectorA:
1249 case Type::VectorS:
1250 case Type::VectorD:
1251 case Type::VectorX:
1252 case Type::VectorY:
1253 case Type::VectorZ:
1254 case Type::VectorMask:
1255 case Type::AnyPtr:
1256 case Type::RawPtr:
1257 case Type::OopPtr:
1258 case Type::InstPtr:
1259 case Type::AryPtr:
1260 case Type::MetadataPtr:
1261 case Type::KlassPtr:
1262 case Type::InstKlassPtr:
1263 case Type::AryKlassPtr:
1264 case Type::Function:
1265 case Type::Return_Address:
1266 case Type::HalfFloatTop:
1267 case Type::HalfFloatCon:
1268 case Type::HalfFloatBot:
1269 case Type::FloatTop:
1270 case Type::FloatCon:
1271 case Type::FloatBot:
1272 case Type::DoubleTop:
1273 case Type::DoubleCon:
1274 case Type::DoubleBot:
1275 return Category::Data;
1276 case Type::Memory:
1277 return Category::Memory;
1278 case Type::Control:
1279 return Category::Control;
1280 case Type::Top:
1281 case Type::Abio:
1282 case Type::Bottom:
1283 return Category::Other;
1284 case Type::Bad:
1285 case Type::lastype:
1286 return Category::Undef;
1287 case Type::Tuple:
1288 // Recursive case. Return CatMixed if the tuple contains types of
1289 // different categories (e.g. CallStaticJavaNode's type), or the specific
1290 // category if all types are of the same category (e.g. IfNode's type).
1291 tuple = is_tuple();
1292 if (tuple->cnt() == 0) {
1293 return Category::Undef;
1294 } else {
1295 Category first = tuple->field_at(0)->category();
1296 for (uint i = 1; i < tuple->cnt(); i++) {
1297 if (tuple->field_at(i)->category() != first) {
1298 return Category::Mixed;
1299 }
1300 }
1301 return first;
1302 }
1303 default:
1304 assert(false, "unmatched base type: all base types must be categorized");
1305 }
1306 return Category::Undef;
1307 }
1308
1309 bool Type::has_category(Type::Category cat) const {
1310 if (category() == cat) {
1311 return true;
1312 }
1313 if (category() == Category::Mixed) {
1314 const TypeTuple* tuple = is_tuple();
1315 for (uint i = 0; i < tuple->cnt(); i++) {
1316 if (tuple->field_at(i)->has_category(cat)) {
1317 return true;
1318 }
1319 }
1320 }
1321 return false;
1322 }
1323 #endif
1324
1325 //------------------------------typerr-----------------------------------------
1326 void Type::typerr( const Type *t ) const {
1327 #ifndef PRODUCT
1328 tty->print("\nError mixing types: ");
1329 dump();
1330 tty->print(" and ");
1331 t->dump();
1332 tty->print("\n");
1333 #endif
1334 ShouldNotReachHere();
1335 }
1336
1337
1338 //=============================================================================
1339 // Convenience common pre-built types.
1340 const TypeF *TypeF::MAX; // Floating point max
1341 const TypeF *TypeF::MIN; // Floating point min
1342 const TypeF *TypeF::ZERO; // Floating point zero
1343 const TypeF *TypeF::ONE; // Floating point one
1344 const TypeF *TypeF::POS_INF; // Floating point positive infinity
1345 const TypeF *TypeF::NEG_INF; // Floating point negative infinity
1346
1347 //------------------------------make-------------------------------------------
1348 // Create a float constant
1349 const TypeF *TypeF::make(float f) {
1350 return (TypeF*)(new TypeF(f))->hashcons();
1351 }
1352
1353 //------------------------------meet-------------------------------------------
1354 // Compute the MEET of two types. It returns a new Type object.
1355 const Type *TypeF::xmeet( const Type *t ) const {
1356 // Perform a fast test for common case; meeting the same types together.
1357 if( this == t ) return this; // Meeting same type-rep?
1358
1359 // Current "this->_base" is FloatCon
1360 switch (t->base()) { // Switch on original type
1361 case AnyPtr: // Mixing with oops happens when javac
1362 case RawPtr: // reuses local variables
1363 case OopPtr:
1364 case InstPtr:
1365 case AryPtr:
1366 case MetadataPtr:
1367 case KlassPtr:
1368 case InstKlassPtr:
1369 case AryKlassPtr:
1370 case NarrowOop:
1371 case NarrowKlass:
1372 case Int:
1373 case Long:
1374 case HalfFloatTop:
1375 case HalfFloatCon:
1376 case HalfFloatBot:
1377 case DoubleTop:
1378 case DoubleCon:
1379 case DoubleBot:
1380 case Bottom: // Ye Olde Default
1381 return Type::BOTTOM;
1382
1383 case FloatBot:
1384 return t;
1385
1386 default: // All else is a mistake
1387 typerr(t);
1388
1389 case FloatCon: // Float-constant vs Float-constant?
1390 if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants?
1391 // must compare bitwise as positive zero, negative zero and NaN have
1392 // all the same representation in C++
1393 return FLOAT; // Return generic float
1394 // Equal constants
1395 case Top:
1396 case FloatTop:
1397 break; // Return the float constant
1398 }
1399 return this; // Return the float constant
1400 }
1401
1402 //------------------------------xdual------------------------------------------
1403 // Dual: symmetric
1404 const Type *TypeF::xdual() const {
1405 return this;
1406 }
1407
1408 //------------------------------eq---------------------------------------------
1409 // Structural equality check for Type representations
1410 bool TypeF::eq(const Type *t) const {
1411 // Bitwise comparison to distinguish between +/-0. These values must be treated
1412 // as different to be consistent with C1 and the interpreter.
1413 return (jint_cast(_f) == jint_cast(t->getf()));
1414 }
1415
1416 //------------------------------hash-------------------------------------------
1417 // Type-specific hashing function.
1418 uint TypeF::hash(void) const {
1419 return *(uint*)(&_f);
1420 }
1421
1422 //------------------------------is_finite--------------------------------------
1423 // Has a finite value
1424 bool TypeF::is_finite() const {
1425 return g_isfinite(getf()) != 0;
1426 }
1427
1428 //------------------------------is_nan-----------------------------------------
1429 // Is not a number (NaN)
1430 bool TypeF::is_nan() const {
1431 return g_isnan(getf()) != 0;
1432 }
1433
1434 //------------------------------dump2------------------------------------------
1435 // Dump float constant Type
1436 #ifndef PRODUCT
1437 void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const {
1438 Type::dump2(d,depth, st);
1439 st->print("%f", _f);
1440 }
1441 #endif
1442
1443 //------------------------------singleton--------------------------------------
1444 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1445 // constants (Ldi nodes). Singletons are integer, float or double constants
1446 // or a single symbol.
1447 bool TypeF::singleton(void) const {
1448 return true; // Always a singleton
1449 }
1450
1451 bool TypeF::empty(void) const {
1452 return false; // always exactly a singleton
1453 }
1454
1455 //=============================================================================
1456 // Convenience common pre-built types.
1457 const TypeH* TypeH::MAX; // Half float max
1458 const TypeH* TypeH::MIN; // Half float min
1459 const TypeH* TypeH::ZERO; // Half float zero
1460 const TypeH* TypeH::ONE; // Half float one
1461 const TypeH* TypeH::POS_INF; // Half float positive infinity
1462 const TypeH* TypeH::NEG_INF; // Half float negative infinity
1463
1464 //------------------------------make-------------------------------------------
1465 // Create a halffloat constant
1466 const TypeH* TypeH::make(short f) {
1467 return (TypeH*)(new TypeH(f))->hashcons();
1468 }
1469
1470 const TypeH* TypeH::make(float f) {
1471 assert(StubRoutines::f2hf_adr() != nullptr, "");
1472 short hf = StubRoutines::f2hf(f);
1473 return (TypeH*)(new TypeH(hf))->hashcons();
1474 }
1475
1476 //------------------------------xmeet-------------------------------------------
1477 // Compute the MEET of two types. It returns a new Type object.
1478 const Type* TypeH::xmeet(const Type* t) const {
1479 // Perform a fast test for common case; meeting the same types together.
1480 if (this == t) return this; // Meeting same type-rep?
1481
1482 // Current "this->_base" is FloatCon
1483 switch (t->base()) { // Switch on original type
1484 case AnyPtr: // Mixing with oops happens when javac
1485 case RawPtr: // reuses local variables
1486 case OopPtr:
1487 case InstPtr:
1488 case AryPtr:
1489 case MetadataPtr:
1490 case KlassPtr:
1491 case InstKlassPtr:
1492 case AryKlassPtr:
1493 case NarrowOop:
1494 case NarrowKlass:
1495 case Int:
1496 case Long:
1497 case FloatTop:
1498 case FloatCon:
1499 case FloatBot:
1500 case DoubleTop:
1501 case DoubleCon:
1502 case DoubleBot:
1503 case Bottom: // Ye Olde Default
1504 return Type::BOTTOM;
1505
1506 case HalfFloatBot:
1507 return t;
1508
1509 default: // All else is a mistake
1510 typerr(t);
1511
1512 case HalfFloatCon: // Half float-constant vs Half float-constant?
1513 if (_f != t->geth()) { // unequal constants?
1514 // must compare bitwise as positive zero, negative zero and NaN have
1515 // all the same representation in C++
1516 return HALF_FLOAT; // Return generic float
1517 } // Equal constants
1518 case Top:
1519 case HalfFloatTop:
1520 break; // Return the Half float constant
1521 }
1522 return this; // Return the Half float constant
1523 }
1524
1525 //------------------------------xdual------------------------------------------
1526 // Dual: symmetric
1527 const Type* TypeH::xdual() const {
1528 return this;
1529 }
1530
1531 //------------------------------eq---------------------------------------------
1532 // Structural equality check for Type representations
1533 bool TypeH::eq(const Type* t) const {
1534 // Bitwise comparison to distinguish between +/-0. These values must be treated
1535 // as different to be consistent with C1 and the interpreter.
1536 return (_f == t->geth());
1537 }
1538
1539 //------------------------------hash-------------------------------------------
1540 // Type-specific hashing function.
1541 uint TypeH::hash(void) const {
1542 return *(jshort*)(&_f);
1543 }
1544
1545 //------------------------------is_finite--------------------------------------
1546 // Has a finite value
1547 bool TypeH::is_finite() const {
1548 assert(StubRoutines::hf2f_adr() != nullptr, "");
1549 float f = StubRoutines::hf2f(geth());
1550 return g_isfinite(f) != 0;
1551 }
1552
1553 float TypeH::getf() const {
1554 assert(StubRoutines::hf2f_adr() != nullptr, "");
1555 return StubRoutines::hf2f(geth());
1556 }
1557
1558 //------------------------------is_nan-----------------------------------------
1559 // Is not a number (NaN)
1560 bool TypeH::is_nan() const {
1561 assert(StubRoutines::hf2f_adr() != nullptr, "");
1562 float f = StubRoutines::hf2f(geth());
1563 return g_isnan(f) != 0;
1564 }
1565
1566 //------------------------------dump2------------------------------------------
1567 // Dump float constant Type
1568 #ifndef PRODUCT
1569 void TypeH::dump2(Dict &d, uint depth, outputStream* st) const {
1570 Type::dump2(d,depth, st);
1571 st->print("%f", getf());
1572 }
1573 #endif
1574
1575 //------------------------------singleton--------------------------------------
1576 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1577 // constants (Ldi nodes). Singletons are integer, half float, float or double constants
1578 // or a single symbol.
1579 bool TypeH::singleton(void) const {
1580 return true; // Always a singleton
1581 }
1582
1583 bool TypeH::empty(void) const {
1584 return false; // always exactly a singleton
1585 }
1586
1587 //=============================================================================
1588 // Convenience common pre-built types.
1589 const TypeD *TypeD::MAX; // Floating point max
1590 const TypeD *TypeD::MIN; // Floating point min
1591 const TypeD *TypeD::ZERO; // Floating point zero
1592 const TypeD *TypeD::ONE; // Floating point one
1593 const TypeD *TypeD::POS_INF; // Floating point positive infinity
1594 const TypeD *TypeD::NEG_INF; // Floating point negative infinity
1595
1596 //------------------------------make-------------------------------------------
1597 const TypeD *TypeD::make(double d) {
1598 return (TypeD*)(new TypeD(d))->hashcons();
1599 }
1600
1601 //------------------------------meet-------------------------------------------
1602 // Compute the MEET of two types. It returns a new Type object.
1603 const Type *TypeD::xmeet( const Type *t ) const {
1604 // Perform a fast test for common case; meeting the same types together.
1605 if( this == t ) return this; // Meeting same type-rep?
1606
1607 // Current "this->_base" is DoubleCon
1608 switch (t->base()) { // Switch on original type
1609 case AnyPtr: // Mixing with oops happens when javac
1610 case RawPtr: // reuses local variables
1611 case OopPtr:
1612 case InstPtr:
1613 case AryPtr:
1614 case MetadataPtr:
1615 case KlassPtr:
1616 case InstKlassPtr:
1617 case AryKlassPtr:
1618 case NarrowOop:
1619 case NarrowKlass:
1620 case Int:
1621 case Long:
1622 case HalfFloatTop:
1623 case HalfFloatCon:
1624 case HalfFloatBot:
1625 case FloatTop:
1626 case FloatCon:
1627 case FloatBot:
1628 case Bottom: // Ye Olde Default
1629 return Type::BOTTOM;
1630
1631 case DoubleBot:
1632 return t;
1633
1634 default: // All else is a mistake
1635 typerr(t);
1636
1637 case DoubleCon: // Double-constant vs Double-constant?
1638 if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet)
1639 return DOUBLE; // Return generic double
1640 case Top:
1641 case DoubleTop:
1642 break;
1643 }
1644 return this; // Return the double constant
1645 }
1646
1647 //------------------------------xdual------------------------------------------
1648 // Dual: symmetric
1649 const Type *TypeD::xdual() const {
1650 return this;
1651 }
1652
1653 //------------------------------eq---------------------------------------------
1654 // Structural equality check for Type representations
1655 bool TypeD::eq(const Type *t) const {
1656 // Bitwise comparison to distinguish between +/-0. These values must be treated
1657 // as different to be consistent with C1 and the interpreter.
1658 return (jlong_cast(_d) == jlong_cast(t->getd()));
1659 }
1660
1661 //------------------------------hash-------------------------------------------
1662 // Type-specific hashing function.
1663 uint TypeD::hash(void) const {
1664 return *(uint*)(&_d);
1665 }
1666
1667 //------------------------------is_finite--------------------------------------
1668 // Has a finite value
1669 bool TypeD::is_finite() const {
1670 return g_isfinite(getd()) != 0;
1671 }
1672
1673 //------------------------------is_nan-----------------------------------------
1674 // Is not a number (NaN)
1675 bool TypeD::is_nan() const {
1676 return g_isnan(getd()) != 0;
1677 }
1678
1679 //------------------------------dump2------------------------------------------
1680 // Dump double constant Type
1681 #ifndef PRODUCT
1682 void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const {
1683 Type::dump2(d,depth,st);
1684 st->print("%f", _d);
1685 }
1686 #endif
1687
1688 //------------------------------singleton--------------------------------------
1689 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1690 // constants (Ldi nodes). Singletons are integer, float or double constants
1691 // or a single symbol.
1692 bool TypeD::singleton(void) const {
1693 return true; // Always a singleton
1694 }
1695
1696 bool TypeD::empty(void) const {
1697 return false; // always exactly a singleton
1698 }
1699
1700 const TypeInteger* TypeInteger::make(jlong lo, jlong hi, int w, BasicType bt) {
1701 if (bt == T_INT) {
1702 return TypeInt::make(checked_cast<jint>(lo), checked_cast<jint>(hi), w);
1703 }
1704 assert(bt == T_LONG, "basic type not an int or long");
1705 return TypeLong::make(lo, hi, w);
1706 }
1707
1708 const TypeInteger* TypeInteger::make(jlong con, BasicType bt) {
1709 return make(con, con, WidenMin, bt);
1710 }
1711
1712 jlong TypeInteger::get_con_as_long(BasicType bt) const {
1713 if (bt == T_INT) {
1714 return is_int()->get_con();
1715 }
1716 assert(bt == T_LONG, "basic type not an int or long");
1717 return is_long()->get_con();
1718 }
1719
1720 const TypeInteger* TypeInteger::bottom(BasicType bt) {
1721 if (bt == T_INT) {
1722 return TypeInt::INT;
1723 }
1724 assert(bt == T_LONG, "basic type not an int or long");
1725 return TypeLong::LONG;
1726 }
1727
1728 const TypeInteger* TypeInteger::zero(BasicType bt) {
1729 if (bt == T_INT) {
1730 return TypeInt::ZERO;
1731 }
1732 assert(bt == T_LONG, "basic type not an int or long");
1733 return TypeLong::ZERO;
1734 }
1735
1736 const TypeInteger* TypeInteger::one(BasicType bt) {
1737 if (bt == T_INT) {
1738 return TypeInt::ONE;
1739 }
1740 assert(bt == T_LONG, "basic type not an int or long");
1741 return TypeLong::ONE;
1742 }
1743
1744 const TypeInteger* TypeInteger::minus_1(BasicType bt) {
1745 if (bt == T_INT) {
1746 return TypeInt::MINUS_1;
1747 }
1748 assert(bt == T_LONG, "basic type not an int or long");
1749 return TypeLong::MINUS_1;
1750 }
1751
1752 //=============================================================================
1753 // Convenience common pre-built types.
1754 const TypeInt* TypeInt::MAX; // INT_MAX
1755 const TypeInt* TypeInt::MIN; // INT_MIN
1756 const TypeInt* TypeInt::MINUS_1;// -1
1757 const TypeInt* TypeInt::ZERO; // 0
1758 const TypeInt* TypeInt::ONE; // 1
1759 const TypeInt* TypeInt::BOOL; // 0 or 1, FALSE or TRUE.
1760 const TypeInt* TypeInt::CC; // -1,0 or 1, condition codes
1761 const TypeInt* TypeInt::CC_LT; // [-1] == MINUS_1
1762 const TypeInt* TypeInt::CC_GT; // [1] == ONE
1763 const TypeInt* TypeInt::CC_EQ; // [0] == ZERO
1764 const TypeInt* TypeInt::CC_NE;
1765 const TypeInt* TypeInt::CC_LE; // [-1,0]
1766 const TypeInt* TypeInt::CC_GE; // [0,1] == BOOL (!)
1767 const TypeInt* TypeInt::BYTE; // Bytes, -128 to 127
1768 const TypeInt* TypeInt::UBYTE; // Unsigned Bytes, 0 to 255
1769 const TypeInt* TypeInt::CHAR; // Java chars, 0-65535
1770 const TypeInt* TypeInt::SHORT; // Java shorts, -32768-32767
1771 const TypeInt* TypeInt::NON_ZERO;
1772 const TypeInt* TypeInt::POS; // Positive 32-bit integers or zero
1773 const TypeInt* TypeInt::POS1; // Positive 32-bit integers
1774 const TypeInt* TypeInt::INT; // 32-bit integers
1775 const TypeInt* TypeInt::SYMINT; // symmetric range [-max_jint..max_jint]
1776 const TypeInt* TypeInt::TYPE_DOMAIN; // alias for TypeInt::INT
1777
1778 TypeInt::TypeInt(const TypeIntPrototype<jint, juint>& t, int widen, bool dual)
1779 : TypeInteger(Int, t.normalize_widen(widen), dual), _lo(t._srange._lo), _hi(t._srange._hi),
1780 _ulo(t._urange._lo), _uhi(t._urange._hi), _bits(t._bits) {
1781 DEBUG_ONLY(t.verify_constraints());
1782 }
1783
1784 const Type* TypeInt::make_or_top(const TypeIntPrototype<jint, juint>& t, int widen, bool dual) {
1785 auto canonicalized_t = t.canonicalize_constraints();
1786 if (canonicalized_t.empty()) {
1787 return dual ? Type::BOTTOM : Type::TOP;
1788 }
1789 return (new TypeInt(canonicalized_t._data, widen, dual))->hashcons()->is_int();
1790 }
1791
1792 const TypeInt* TypeInt::make(jint con) {
1793 juint ucon = con;
1794 return (new TypeInt(TypeIntPrototype<jint, juint>{{con, con}, {ucon, ucon}, {~ucon, ucon}},
1795 WidenMin, false))->hashcons()->is_int();
1796 }
1797
1798 const TypeInt* TypeInt::make(jint lo, jint hi, int widen) {
1799 assert(lo <= hi, "must be legal bounds");
1800 return make_or_top(TypeIntPrototype<jint, juint>{{lo, hi}, {0, max_juint}, {0, 0}}, widen)->is_int();
1801 }
1802
1803 const Type* TypeInt::make_or_top(const TypeIntPrototype<jint, juint>& t, int widen) {
1804 return make_or_top(t, widen, false);
1805 }
1806
1807 bool TypeInt::contains(jint i) const {
1808 assert(!_is_dual, "dual types should only be used for join calculation");
1809 juint u = i;
1810 return i >= _lo && i <= _hi &&
1811 u >= _ulo && u <= _uhi &&
1812 _bits.is_satisfied_by(u);
1813 }
1814
1815 bool TypeInt::contains(const TypeInt* t) const {
1816 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation");
1817 return TypeIntHelper::int_type_is_subset(this, t);
1818 }
1819
1820 #ifdef ASSERT
1821 bool TypeInt::strictly_contains(const TypeInt* t) const {
1822 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation");
1823 return TypeIntHelper::int_type_is_subset(this, t) && !TypeIntHelper::int_type_is_equal(this, t);
1824 }
1825 #endif // ASSERT
1826
1827 const Type* TypeInt::xmeet(const Type* t) const {
1828 return TypeIntHelper::int_type_xmeet(this, t);
1829 }
1830
1831 const Type* TypeInt::xdual() const {
1832 return new TypeInt(TypeIntPrototype<jint, juint>{{_lo, _hi}, {_ulo, _uhi}, _bits},
1833 _widen, !_is_dual);
1834 }
1835
1836 const Type* TypeInt::widen(const Type* old, const Type* limit) const {
1837 assert(!_is_dual, "dual types should only be used for join calculation");
1838 return TypeIntHelper::int_type_widen(this, old->isa_int(), limit->isa_int());
1839 }
1840
1841 const Type* TypeInt::narrow(const Type* old) const {
1842 assert(!_is_dual, "dual types should only be used for join calculation");
1843 if (old == nullptr) {
1844 return this;
1845 }
1846
1847 return TypeIntHelper::int_type_narrow(this, old->isa_int());
1848 }
1849
1850 //-----------------------------filter------------------------------------------
1851 const Type* TypeInt::filter_helper(const Type* kills, bool include_speculative) const {
1852 assert(!_is_dual, "dual types should only be used for join calculation");
1853 const TypeInt* ft = join_helper(kills, include_speculative)->isa_int();
1854 if (ft == nullptr) {
1855 return Type::TOP; // Canonical empty value
1856 }
1857 assert(!ft->_is_dual, "dual types should only be used for join calculation");
1858 if (ft->_widen < this->_widen) {
1859 // Do not allow the value of kill->_widen to affect the outcome.
1860 // The widen bits must be allowed to run freely through the graph.
1861 return (new TypeInt(TypeIntPrototype<jint, juint>{{ft->_lo, ft->_hi}, {ft->_ulo, ft->_uhi}, ft->_bits},
1862 this->_widen, false))->hashcons();
1863 }
1864 return ft;
1865 }
1866
1867 //------------------------------eq---------------------------------------------
1868 // Structural equality check for Type representations
1869 bool TypeInt::eq(const Type* t) const {
1870 const TypeInt* r = t->is_int();
1871 return TypeIntHelper::int_type_is_equal(this, r) && _widen == r->_widen && _is_dual == r->_is_dual;
1872 }
1873
1874 //------------------------------hash-------------------------------------------
1875 // Type-specific hashing function.
1876 uint TypeInt::hash(void) const {
1877 return (uint)_lo + (uint)_hi + (uint)_ulo + (uint)_uhi +
1878 (uint)_bits._zeros + (uint)_bits._ones + (uint)_widen + (uint)_is_dual + (uint)Type::Int;
1879 }
1880
1881 //------------------------------is_finite--------------------------------------
1882 // Has a finite value
1883 bool TypeInt::is_finite() const {
1884 return true;
1885 }
1886
1887 //------------------------------singleton--------------------------------------
1888 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1889 // constants.
1890 bool TypeInt::singleton(void) const {
1891 return _lo == _hi;
1892 }
1893
1894 bool TypeInt::empty(void) const {
1895 return false;
1896 }
1897
1898 //=============================================================================
1899 // Convenience common pre-built types.
1900 const TypeLong* TypeLong::MAX;
1901 const TypeLong* TypeLong::MIN;
1902 const TypeLong* TypeLong::MINUS_1;// -1
1903 const TypeLong* TypeLong::ZERO; // 0
1904 const TypeLong* TypeLong::ONE; // 1
1905 const TypeLong* TypeLong::NON_ZERO;
1906 const TypeLong* TypeLong::POS; // >=0
1907 const TypeLong* TypeLong::NEG;
1908 const TypeLong* TypeLong::LONG; // 64-bit integers
1909 const TypeLong* TypeLong::INT; // 32-bit subrange
1910 const TypeLong* TypeLong::UINT; // 32-bit unsigned subrange
1911 const TypeLong* TypeLong::TYPE_DOMAIN; // alias for TypeLong::LONG
1912
1913 TypeLong::TypeLong(const TypeIntPrototype<jlong, julong>& t, int widen, bool dual)
1914 : TypeInteger(Long, t.normalize_widen(widen), dual), _lo(t._srange._lo), _hi(t._srange._hi),
1915 _ulo(t._urange._lo), _uhi(t._urange._hi), _bits(t._bits) {
1916 DEBUG_ONLY(t.verify_constraints());
1917 }
1918
1919 const Type* TypeLong::make_or_top(const TypeIntPrototype<jlong, julong>& t, int widen, bool dual) {
1920 auto canonicalized_t = t.canonicalize_constraints();
1921 if (canonicalized_t.empty()) {
1922 return dual ? Type::BOTTOM : Type::TOP;
1923 }
1924 return (new TypeLong(canonicalized_t._data, widen, dual))->hashcons()->is_long();
1925 }
1926
1927 const TypeLong* TypeLong::make(jlong con) {
1928 julong ucon = con;
1929 return (new TypeLong(TypeIntPrototype<jlong, julong>{{con, con}, {ucon, ucon}, {~ucon, ucon}},
1930 WidenMin, false))->hashcons()->is_long();
1931 }
1932
1933 const TypeLong* TypeLong::make(jlong lo, jlong hi, int widen) {
1934 assert(lo <= hi, "must be legal bounds");
1935 return make_or_top(TypeIntPrototype<jlong, julong>{{lo, hi}, {0, max_julong}, {0, 0}}, widen)->is_long();
1936 }
1937
1938 const Type* TypeLong::make_or_top(const TypeIntPrototype<jlong, julong>& t, int widen) {
1939 return make_or_top(t, widen, false);
1940 }
1941
1942 bool TypeLong::contains(jlong i) const {
1943 assert(!_is_dual, "dual types should only be used for join calculation");
1944 julong u = i;
1945 return i >= _lo && i <= _hi &&
1946 u >= _ulo && u <= _uhi &&
1947 _bits.is_satisfied_by(u);
1948 }
1949
1950 bool TypeLong::contains(const TypeLong* t) const {
1951 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation");
1952 return TypeIntHelper::int_type_is_subset(this, t);
1953 }
1954
1955 #ifdef ASSERT
1956 bool TypeLong::strictly_contains(const TypeLong* t) const {
1957 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation");
1958 return TypeIntHelper::int_type_is_subset(this, t) && !TypeIntHelper::int_type_is_equal(this, t);
1959 }
1960 #endif // ASSERT
1961
1962 const Type* TypeLong::xmeet(const Type* t) const {
1963 return TypeIntHelper::int_type_xmeet(this, t);
1964 }
1965
1966 const Type* TypeLong::xdual() const {
1967 return new TypeLong(TypeIntPrototype<jlong, julong>{{_lo, _hi}, {_ulo, _uhi}, _bits},
1968 _widen, !_is_dual);
1969 }
1970
1971 const Type* TypeLong::widen(const Type* old, const Type* limit) const {
1972 assert(!_is_dual, "dual types should only be used for join calculation");
1973 return TypeIntHelper::int_type_widen(this, old->isa_long(), limit->isa_long());
1974 }
1975
1976 const Type* TypeLong::narrow(const Type* old) const {
1977 assert(!_is_dual, "dual types should only be used for join calculation");
1978 if (old == nullptr) {
1979 return this;
1980 }
1981
1982 return TypeIntHelper::int_type_narrow(this, old->isa_long());
1983 }
1984
1985 //-----------------------------filter------------------------------------------
1986 const Type* TypeLong::filter_helper(const Type* kills, bool include_speculative) const {
1987 assert(!_is_dual, "dual types should only be used for join calculation");
1988 const TypeLong* ft = join_helper(kills, include_speculative)->isa_long();
1989 if (ft == nullptr) {
1990 return Type::TOP; // Canonical empty value
1991 }
1992 assert(!ft->_is_dual, "dual types should only be used for join calculation");
1993 if (ft->_widen < this->_widen) {
1994 // Do not allow the value of kill->_widen to affect the outcome.
1995 // The widen bits must be allowed to run freely through the graph.
1996 return (new TypeLong(TypeIntPrototype<jlong, julong>{{ft->_lo, ft->_hi}, {ft->_ulo, ft->_uhi}, ft->_bits},
1997 this->_widen, false))->hashcons();
1998 }
1999 return ft;
2000 }
2001
2002 //------------------------------eq---------------------------------------------
2003 // Structural equality check for Type representations
2004 bool TypeLong::eq(const Type* t) const {
2005 const TypeLong* r = t->is_long();
2006 return TypeIntHelper::int_type_is_equal(this, r) && _widen == r->_widen && _is_dual == r->_is_dual;
2007 }
2008
2009 //------------------------------hash-------------------------------------------
2010 // Type-specific hashing function.
2011 uint TypeLong::hash(void) const {
2012 return (uint)_lo + (uint)_hi + (uint)_ulo + (uint)_uhi +
2013 (uint)_bits._zeros + (uint)_bits._ones + (uint)_widen + (uint)_is_dual + (uint)Type::Long;
2014 }
2015
2016 //------------------------------is_finite--------------------------------------
2017 // Has a finite value
2018 bool TypeLong::is_finite() const {
2019 return true;
2020 }
2021
2022 //------------------------------singleton--------------------------------------
2023 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2024 // constants
2025 bool TypeLong::singleton(void) const {
2026 return _lo == _hi;
2027 }
2028
2029 bool TypeLong::empty(void) const {
2030 return false;
2031 }
2032
2033 //------------------------------dump2------------------------------------------
2034 #ifndef PRODUCT
2035 void TypeInt::dump2(Dict& d, uint depth, outputStream* st) const {
2036 TypeIntHelper::int_type_dump(this, st, false);
2037 }
2038
2039 void TypeInt::dump_verbose() const {
2040 TypeIntHelper::int_type_dump(this, tty, true);
2041 }
2042
2043 void TypeLong::dump2(Dict& d, uint depth, outputStream* st) const {
2044 TypeIntHelper::int_type_dump(this, st, false);
2045 }
2046
2047 void TypeLong::dump_verbose() const {
2048 TypeIntHelper::int_type_dump(this, tty, true);
2049 }
2050 #endif
2051
2052 //=============================================================================
2053 // Convenience common pre-built types.
2054 const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable
2055 const TypeTuple *TypeTuple::IFFALSE;
2056 const TypeTuple *TypeTuple::IFTRUE;
2057 const TypeTuple *TypeTuple::IFNEITHER;
2058 const TypeTuple *TypeTuple::LOOPBODY;
2059 const TypeTuple *TypeTuple::MEMBAR;
2060 const TypeTuple *TypeTuple::STORECONDITIONAL;
2061 const TypeTuple *TypeTuple::START_I2C;
2062 const TypeTuple *TypeTuple::INT_PAIR;
2063 const TypeTuple *TypeTuple::LONG_PAIR;
2064 const TypeTuple *TypeTuple::INT_CC_PAIR;
2065 const TypeTuple *TypeTuple::LONG_CC_PAIR;
2066
2067 //------------------------------make-------------------------------------------
2068 // Make a TypeTuple from the range of a method signature
2069 const TypeTuple *TypeTuple::make_range(ciSignature* sig, InterfaceHandling interface_handling) {
2070 ciType* return_type = sig->return_type();
2071 uint arg_cnt = return_type->size();
2072 const Type **field_array = fields(arg_cnt);
2073 switch (return_type->basic_type()) {
2074 case T_LONG:
2075 field_array[TypeFunc::Parms] = TypeLong::LONG;
2076 field_array[TypeFunc::Parms+1] = Type::HALF;
2077 break;
2078 case T_DOUBLE:
2079 field_array[TypeFunc::Parms] = Type::DOUBLE;
2080 field_array[TypeFunc::Parms+1] = Type::HALF;
2081 break;
2082 case T_OBJECT:
2083 case T_ARRAY:
2084 case T_BOOLEAN:
2085 case T_CHAR:
2086 case T_FLOAT:
2087 case T_BYTE:
2088 case T_SHORT:
2089 case T_INT:
2090 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling);
2091 break;
2092 case T_VOID:
2093 break;
2094 default:
2095 ShouldNotReachHere();
2096 }
2097 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2098 }
2099
2100 // Make a TypeTuple from the domain of a method signature
2101 const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig, InterfaceHandling interface_handling) {
2102 uint arg_cnt = sig->size();
2103
2104 uint pos = TypeFunc::Parms;
2105 const Type **field_array;
2106 if (recv != nullptr) {
2107 arg_cnt++;
2108 field_array = fields(arg_cnt);
2109 // Use get_const_type here because it respects UseUniqueSubclasses:
2110 field_array[pos++] = get_const_type(recv, interface_handling)->join_speculative(TypePtr::NOTNULL);
2111 } else {
2112 field_array = fields(arg_cnt);
2113 }
2114
2115 int i = 0;
2116 while (pos < TypeFunc::Parms + arg_cnt) {
2117 ciType* type = sig->type_at(i);
2118
2119 switch (type->basic_type()) {
2120 case T_LONG:
2121 field_array[pos++] = TypeLong::LONG;
2122 field_array[pos++] = Type::HALF;
2123 break;
2124 case T_DOUBLE:
2125 field_array[pos++] = Type::DOUBLE;
2126 field_array[pos++] = Type::HALF;
2127 break;
2128 case T_OBJECT:
2129 case T_ARRAY:
2130 case T_FLOAT:
2131 case T_INT:
2132 field_array[pos++] = get_const_type(type, interface_handling);
2133 break;
2134 case T_BOOLEAN:
2135 case T_CHAR:
2136 case T_BYTE:
2137 case T_SHORT:
2138 field_array[pos++] = TypeInt::INT;
2139 break;
2140 default:
2141 ShouldNotReachHere();
2142 }
2143 i++;
2144 }
2145
2146 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons();
2147 }
2148
2149 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) {
2150 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons();
2151 }
2152
2153 //------------------------------fields-----------------------------------------
2154 // Subroutine call type with space allocated for argument types
2155 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly
2156 const Type **TypeTuple::fields( uint arg_cnt ) {
2157 const Type **flds = (const Type **)(Compile::current()->type_arena()->AmallocWords((TypeFunc::Parms+arg_cnt)*sizeof(Type*) ));
2158 flds[TypeFunc::Control ] = Type::CONTROL;
2159 flds[TypeFunc::I_O ] = Type::ABIO;
2160 flds[TypeFunc::Memory ] = Type::MEMORY;
2161 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM;
2162 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS;
2163
2164 return flds;
2165 }
2166
2167 //------------------------------meet-------------------------------------------
2168 // Compute the MEET of two types. It returns a new Type object.
2169 const Type *TypeTuple::xmeet( const Type *t ) const {
2170 // Perform a fast test for common case; meeting the same types together.
2171 if( this == t ) return this; // Meeting same type-rep?
2172
2173 // Current "this->_base" is Tuple
2174 switch (t->base()) { // switch on original type
2175
2176 case Bottom: // Ye Olde Default
2177 return t;
2178
2179 default: // All else is a mistake
2180 typerr(t);
2181
2182 case Tuple: { // Meeting 2 signatures?
2183 const TypeTuple *x = t->is_tuple();
2184 assert( _cnt == x->_cnt, "" );
2185 const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) ));
2186 for( uint i=0; i<_cnt; i++ )
2187 fields[i] = field_at(i)->xmeet( x->field_at(i) );
2188 return TypeTuple::make(_cnt,fields);
2189 }
2190 case Top:
2191 break;
2192 }
2193 return this; // Return the double constant
2194 }
2195
2196 //------------------------------xdual------------------------------------------
2197 // Dual: compute field-by-field dual
2198 const Type *TypeTuple::xdual() const {
2199 const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) ));
2200 for( uint i=0; i<_cnt; i++ )
2201 fields[i] = _fields[i]->dual();
2202 return new TypeTuple(_cnt,fields);
2203 }
2204
2205 //------------------------------eq---------------------------------------------
2206 // Structural equality check for Type representations
2207 bool TypeTuple::eq( const Type *t ) const {
2208 const TypeTuple *s = (const TypeTuple *)t;
2209 if (_cnt != s->_cnt) return false; // Unequal field counts
2210 for (uint i = 0; i < _cnt; i++)
2211 if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION!
2212 return false; // Missed
2213 return true;
2214 }
2215
2216 //------------------------------hash-------------------------------------------
2217 // Type-specific hashing function.
2218 uint TypeTuple::hash(void) const {
2219 uintptr_t sum = _cnt;
2220 for( uint i=0; i<_cnt; i++ )
2221 sum += (uintptr_t)_fields[i]; // Hash on pointers directly
2222 return (uint)sum;
2223 }
2224
2225 //------------------------------dump2------------------------------------------
2226 // Dump signature Type
2227 #ifndef PRODUCT
2228 void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const {
2229 st->print("{");
2230 if( !depth || d[this] ) { // Check for recursive print
2231 st->print("...}");
2232 return;
2233 }
2234 d.Insert((void*)this, (void*)this); // Stop recursion
2235 if( _cnt ) {
2236 uint i;
2237 for( i=0; i<_cnt-1; i++ ) {
2238 st->print("%d:", i);
2239 _fields[i]->dump2(d, depth-1, st);
2240 st->print(", ");
2241 }
2242 st->print("%d:", i);
2243 _fields[i]->dump2(d, depth-1, st);
2244 }
2245 st->print("}");
2246 }
2247 #endif
2248
2249 //------------------------------singleton--------------------------------------
2250 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2251 // constants (Ldi nodes). Singletons are integer, float or double constants
2252 // or a single symbol.
2253 bool TypeTuple::singleton(void) const {
2254 return false; // Never a singleton
2255 }
2256
2257 bool TypeTuple::empty(void) const {
2258 for( uint i=0; i<_cnt; i++ ) {
2259 if (_fields[i]->empty()) return true;
2260 }
2261 return false;
2262 }
2263
2264 //=============================================================================
2265 // Convenience common pre-built types.
2266
2267 inline const TypeInt* normalize_array_size(const TypeInt* size) {
2268 // Certain normalizations keep us sane when comparing types.
2269 // We do not want arrayOop variables to differ only by the wideness
2270 // of their index types. Pick minimum wideness, since that is the
2271 // forced wideness of small ranges anyway.
2272 if (size->_widen != Type::WidenMin)
2273 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin);
2274 else
2275 return size;
2276 }
2277
2278 //------------------------------make-------------------------------------------
2279 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable) {
2280 if (UseCompressedOops && elem->isa_oopptr()) {
2281 elem = elem->make_narrowoop();
2282 }
2283 size = normalize_array_size(size);
2284 return (TypeAry*)(new TypeAry(elem,size,stable))->hashcons();
2285 }
2286
2287 //------------------------------meet-------------------------------------------
2288 // Compute the MEET of two types. It returns a new Type object.
2289 const Type *TypeAry::xmeet( const Type *t ) const {
2290 // Perform a fast test for common case; meeting the same types together.
2291 if( this == t ) return this; // Meeting same type-rep?
2292
2293 // Current "this->_base" is Ary
2294 switch (t->base()) { // switch on original type
2295
2296 case Bottom: // Ye Olde Default
2297 return t;
2298
2299 default: // All else is a mistake
2300 typerr(t);
2301
2302 case Array: { // Meeting 2 arrays?
2303 const TypeAry* a = t->is_ary();
2304 const Type* size = _size->xmeet(a->_size);
2305 const TypeInt* isize = size->isa_int();
2306 if (isize == nullptr) {
2307 assert(size == Type::TOP || size == Type::BOTTOM, "");
2308 return size;
2309 }
2310 return TypeAry::make(_elem->meet_speculative(a->_elem),
2311 isize, _stable && a->_stable);
2312 }
2313 case Top:
2314 break;
2315 }
2316 return this; // Return the double constant
2317 }
2318
2319 //------------------------------xdual------------------------------------------
2320 // Dual: compute field-by-field dual
2321 const Type *TypeAry::xdual() const {
2322 const TypeInt* size_dual = _size->dual()->is_int();
2323 size_dual = normalize_array_size(size_dual);
2324 return new TypeAry(_elem->dual(), size_dual, !_stable);
2325 }
2326
2327 //------------------------------eq---------------------------------------------
2328 // Structural equality check for Type representations
2329 bool TypeAry::eq( const Type *t ) const {
2330 const TypeAry *a = (const TypeAry*)t;
2331 return _elem == a->_elem &&
2332 _stable == a->_stable &&
2333 _size == a->_size;
2334 }
2335
2336 //------------------------------hash-------------------------------------------
2337 // Type-specific hashing function.
2338 uint TypeAry::hash(void) const {
2339 return (uint)(uintptr_t)_elem + (uint)(uintptr_t)_size + (uint)(_stable ? 43 : 0);
2340 }
2341
2342 /**
2343 * Return same type without a speculative part in the element
2344 */
2345 const TypeAry* TypeAry::remove_speculative() const {
2346 return make(_elem->remove_speculative(), _size, _stable);
2347 }
2348
2349 /**
2350 * Return same type with cleaned up speculative part of element
2351 */
2352 const Type* TypeAry::cleanup_speculative() const {
2353 return make(_elem->cleanup_speculative(), _size, _stable);
2354 }
2355
2356 /**
2357 * Return same type but with a different inline depth (used for speculation)
2358 *
2359 * @param depth depth to meet with
2360 */
2361 const TypePtr* TypePtr::with_inline_depth(int depth) const {
2362 if (!UseInlineDepthForSpeculativeTypes) {
2363 return this;
2364 }
2365 return make(AnyPtr, _ptr, _offset, _speculative, depth, _reloc);
2366 }
2367
2368 //------------------------------dump2------------------------------------------
2369 #ifndef PRODUCT
2370 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const {
2371 if (_stable) st->print("stable:");
2372 _elem->dump2(d, depth, st);
2373 st->print("[");
2374 _size->dump2(d, depth, st);
2375 st->print("]");
2376 }
2377 #endif
2378
2379 //------------------------------singleton--------------------------------------
2380 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2381 // constants (Ldi nodes). Singletons are integer, float or double constants
2382 // or a single symbol.
2383 bool TypeAry::singleton(void) const {
2384 return false; // Never a singleton
2385 }
2386
2387 bool TypeAry::empty(void) const {
2388 return _elem->empty() || _size->empty();
2389 }
2390
2391 //--------------------------ary_must_be_exact----------------------------------
2392 bool TypeAry::ary_must_be_exact() const {
2393 // This logic looks at the element type of an array, and returns true
2394 // if the element type is either a primitive or a final instance class.
2395 // In such cases, an array built on this ary must have no subclasses.
2396 if (_elem == BOTTOM) return false; // general array not exact
2397 if (_elem == TOP ) return false; // inverted general array not exact
2398 const TypeOopPtr* toop = nullptr;
2399 if (UseCompressedOops && _elem->isa_narrowoop()) {
2400 toop = _elem->make_ptr()->isa_oopptr();
2401 } else {
2402 toop = _elem->isa_oopptr();
2403 }
2404 if (!toop) return true; // a primitive type, like int
2405 if (!toop->is_loaded()) return false; // unloaded class
2406 const TypeInstPtr* tinst;
2407 if (_elem->isa_narrowoop())
2408 tinst = _elem->make_ptr()->isa_instptr();
2409 else
2410 tinst = _elem->isa_instptr();
2411 if (tinst)
2412 return tinst->instance_klass()->is_final();
2413 const TypeAryPtr* tap;
2414 if (_elem->isa_narrowoop())
2415 tap = _elem->make_ptr()->isa_aryptr();
2416 else
2417 tap = _elem->isa_aryptr();
2418 if (tap)
2419 return tap->ary()->ary_must_be_exact();
2420 return false;
2421 }
2422
2423 //==============================TypeVect=======================================
2424 // Convenience common pre-built types.
2425 const TypeVect* TypeVect::VECTA = nullptr; // vector length agnostic
2426 const TypeVect* TypeVect::VECTS = nullptr; // 32-bit vectors
2427 const TypeVect* TypeVect::VECTD = nullptr; // 64-bit vectors
2428 const TypeVect* TypeVect::VECTX = nullptr; // 128-bit vectors
2429 const TypeVect* TypeVect::VECTY = nullptr; // 256-bit vectors
2430 const TypeVect* TypeVect::VECTZ = nullptr; // 512-bit vectors
2431 const TypeVect* TypeVect::VECTMASK = nullptr; // predicate/mask vector
2432
2433 //------------------------------make-------------------------------------------
2434 const TypeVect* TypeVect::make(BasicType elem_bt, uint length, bool is_mask) {
2435 if (is_mask) {
2436 return makemask(elem_bt, length);
2437 }
2438 assert(is_java_primitive(elem_bt), "only primitive types in vector");
2439 assert(Matcher::vector_size_supported(elem_bt, length), "length in range");
2440 int size = length * type2aelembytes(elem_bt);
2441 switch (Matcher::vector_ideal_reg(size)) {
2442 case Op_VecA:
2443 return (TypeVect*)(new TypeVectA(elem_bt, length))->hashcons();
2444 case Op_VecS:
2445 return (TypeVect*)(new TypeVectS(elem_bt, length))->hashcons();
2446 case Op_RegL:
2447 case Op_VecD:
2448 case Op_RegD:
2449 return (TypeVect*)(new TypeVectD(elem_bt, length))->hashcons();
2450 case Op_VecX:
2451 return (TypeVect*)(new TypeVectX(elem_bt, length))->hashcons();
2452 case Op_VecY:
2453 return (TypeVect*)(new TypeVectY(elem_bt, length))->hashcons();
2454 case Op_VecZ:
2455 return (TypeVect*)(new TypeVectZ(elem_bt, length))->hashcons();
2456 }
2457 ShouldNotReachHere();
2458 return nullptr;
2459 }
2460
2461 // Create a vector mask type with the given element basic type and length.
2462 // - Returns "TypePVectMask" (PVectMask) for platforms that support the predicate
2463 // feature and it is implemented properly in the backend, allowing the mask to
2464 // be stored in a predicate/mask register.
2465 // - Returns a normal vector type "TypeVectA ~ TypeVectZ" (NVectMask) otherwise,
2466 // where the vector mask is stored in a vector register.
2467 const TypeVect* TypeVect::makemask(BasicType elem_bt, uint length) {
2468 if (Matcher::has_predicated_vectors() &&
2469 Matcher::match_rule_supported_vector_masked(Op_VectorLoadMask, length, elem_bt)) {
2470 return TypePVectMask::make(elem_bt, length);
2471 } else {
2472 return make(elem_bt, length);
2473 }
2474 }
2475
2476 //------------------------------meet-------------------------------------------
2477 // Compute the MEET of two types. Since each TypeVect is the only instance of
2478 // its species, meeting often returns itself
2479 const Type* TypeVect::xmeet(const Type* t) const {
2480 // Perform a fast test for common case; meeting the same types together.
2481 if (this == t) {
2482 return this;
2483 }
2484
2485 // Current "this->_base" is Vector
2486 switch (t->base()) { // switch on original type
2487
2488 case Bottom: // Ye Olde Default
2489 return t;
2490
2491 default: // All else is a mistake
2492 typerr(t);
2493 case VectorMask:
2494 case VectorA:
2495 case VectorS:
2496 case VectorD:
2497 case VectorX:
2498 case VectorY:
2499 case VectorZ: { // Meeting 2 vectors?
2500 const TypeVect* v = t->is_vect();
2501 assert(base() == v->base(), "");
2502 assert(length() == v->length(), "");
2503 assert(element_basic_type() == v->element_basic_type(), "");
2504 return this;
2505 }
2506 case Top:
2507 break;
2508 }
2509 return this;
2510 }
2511
2512 //------------------------------xdual------------------------------------------
2513 // Since each TypeVect is the only instance of its species, it is self-dual
2514 const Type* TypeVect::xdual() const {
2515 return this;
2516 }
2517
2518 //------------------------------eq---------------------------------------------
2519 // Structural equality check for Type representations
2520 bool TypeVect::eq(const Type* t) const {
2521 const TypeVect* v = t->is_vect();
2522 return (element_basic_type() == v->element_basic_type()) && (length() == v->length());
2523 }
2524
2525 //------------------------------hash-------------------------------------------
2526 // Type-specific hashing function.
2527 uint TypeVect::hash(void) const {
2528 return (uint)base() + (uint)(uintptr_t)_elem_bt + (uint)(uintptr_t)_length;
2529 }
2530
2531 //------------------------------singleton--------------------------------------
2532 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2533 // constants (Ldi nodes). Vector is singleton if all elements are the same
2534 // constant value (when vector is created with Replicate code).
2535 bool TypeVect::singleton(void) const {
2536 // There is no Con node for vectors yet.
2537 // return _elem->singleton();
2538 return false;
2539 }
2540
2541 bool TypeVect::empty(void) const {
2542 return false;
2543 }
2544
2545 //------------------------------dump2------------------------------------------
2546 #ifndef PRODUCT
2547 void TypeVect::dump2(Dict& d, uint depth, outputStream* st) const {
2548 switch (base()) {
2549 case VectorA:
2550 st->print("vectora"); break;
2551 case VectorS:
2552 st->print("vectors"); break;
2553 case VectorD:
2554 st->print("vectord"); break;
2555 case VectorX:
2556 st->print("vectorx"); break;
2557 case VectorY:
2558 st->print("vectory"); break;
2559 case VectorZ:
2560 st->print("vectorz"); break;
2561 case VectorMask:
2562 st->print("vectormask"); break;
2563 default:
2564 ShouldNotReachHere();
2565 }
2566 st->print("<%c,%u>", type2char(element_basic_type()), length());
2567 }
2568 #endif
2569
2570 const TypePVectMask* TypePVectMask::make(const BasicType elem_bt, uint length) {
2571 return (TypePVectMask*) (new TypePVectMask(elem_bt, length))->hashcons();
2572 }
2573
2574 //=============================================================================
2575 // Convenience common pre-built types.
2576 const TypePtr *TypePtr::NULL_PTR;
2577 const TypePtr *TypePtr::NOTNULL;
2578 const TypePtr *TypePtr::BOTTOM;
2579
2580 //------------------------------meet-------------------------------------------
2581 // Meet over the PTR enum
2582 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = {
2583 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,
2584 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,},
2585 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,},
2586 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,},
2587 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,},
2588 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,},
2589 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,}
2590 };
2591
2592 //------------------------------make-------------------------------------------
2593 const TypePtr* TypePtr::make(TYPES t, enum PTR ptr, int offset,
2594 const TypePtr* speculative, int inline_depth,
2595 relocInfo::relocType reloc) {
2596 return (TypePtr*)(new TypePtr(t, ptr, offset, reloc, speculative, inline_depth))->hashcons();
2597 }
2598
2599 //------------------------------cast_to_ptr_type-------------------------------
2600 const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const {
2601 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
2602 if( ptr == _ptr ) return this;
2603 return make(_base, ptr, _offset, _speculative, _inline_depth, _reloc);
2604 }
2605
2606 //------------------------------get_con----------------------------------------
2607 intptr_t TypePtr::get_con() const {
2608 assert( _ptr == Null, "" );
2609 return _offset;
2610 }
2611
2612 //------------------------------meet-------------------------------------------
2613 // Compute the MEET of two types. It returns a new Type object.
2614 const Type *TypePtr::xmeet(const Type *t) const {
2615 const Type* res = xmeet_helper(t);
2616 if (res->isa_ptr() == nullptr) {
2617 return res;
2618 }
2619
2620 const TypePtr* res_ptr = res->is_ptr();
2621 if (res_ptr->speculative() != nullptr) {
2622 // type->speculative() is null means that speculation is no better
2623 // than type, i.e. type->speculative() == type. So there are 2
2624 // ways to represent the fact that we have no useful speculative
2625 // data and we should use a single one to be able to test for
2626 // equality between types. Check whether type->speculative() ==
2627 // type and set speculative to null if it is the case.
2628 if (res_ptr->remove_speculative() == res_ptr->speculative()) {
2629 return res_ptr->remove_speculative();
2630 }
2631 }
2632
2633 return res;
2634 }
2635
2636 const Type *TypePtr::xmeet_helper(const Type *t) const {
2637 // Perform a fast test for common case; meeting the same types together.
2638 if( this == t ) return this; // Meeting same type-rep?
2639
2640 // Current "this->_base" is AnyPtr
2641 switch (t->base()) { // switch on original type
2642 case Int: // Mixing ints & oops happens when javac
2643 case Long: // reuses local variables
2644 case HalfFloatTop:
2645 case HalfFloatCon:
2646 case HalfFloatBot:
2647 case FloatTop:
2648 case FloatCon:
2649 case FloatBot:
2650 case DoubleTop:
2651 case DoubleCon:
2652 case DoubleBot:
2653 case NarrowOop:
2654 case NarrowKlass:
2655 case Bottom: // Ye Olde Default
2656 return Type::BOTTOM;
2657 case Top:
2658 return this;
2659
2660 case AnyPtr: { // Meeting to AnyPtrs
2661 const TypePtr *tp = t->is_ptr();
2662 const TypePtr* speculative = xmeet_speculative(tp);
2663 int depth = meet_inline_depth(tp->inline_depth());
2664 return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth);
2665 }
2666 case RawPtr: // For these, flip the call around to cut down
2667 case OopPtr:
2668 case InstPtr: // on the cases I have to handle.
2669 case AryPtr:
2670 case MetadataPtr:
2671 case KlassPtr:
2672 case InstKlassPtr:
2673 case AryKlassPtr:
2674 return t->xmeet(this); // Call in reverse direction
2675 default: // All else is a mistake
2676 typerr(t);
2677
2678 }
2679 return this;
2680 }
2681
2682 //------------------------------meet_offset------------------------------------
2683 int TypePtr::meet_offset( int offset ) const {
2684 // Either is 'TOP' offset? Return the other offset!
2685 if( _offset == OffsetTop ) return offset;
2686 if( offset == OffsetTop ) return _offset;
2687 // If either is different, return 'BOTTOM' offset
2688 if( _offset != offset ) return OffsetBot;
2689 return _offset;
2690 }
2691
2692 //------------------------------dual_offset------------------------------------
2693 int TypePtr::dual_offset( ) const {
2694 if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM'
2695 if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP'
2696 return _offset; // Map everything else into self
2697 }
2698
2699 //------------------------------xdual------------------------------------------
2700 // Dual: compute field-by-field dual
2701 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
2702 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
2703 };
2704 const Type *TypePtr::xdual() const {
2705 return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), relocInfo::none, dual_speculative(), dual_inline_depth());
2706 }
2707
2708 //------------------------------xadd_offset------------------------------------
2709 int TypePtr::xadd_offset( intptr_t offset ) const {
2710 // Adding to 'TOP' offset? Return 'TOP'!
2711 if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop;
2712 // Adding to 'BOTTOM' offset? Return 'BOTTOM'!
2713 if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot;
2714 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'!
2715 offset += (intptr_t)_offset;
2716 if (offset != (int)offset || offset == OffsetTop) return OffsetBot;
2717
2718 // assert( _offset >= 0 && _offset+offset >= 0, "" );
2719 // It is possible to construct a negative offset during PhaseCCP
2720
2721 return (int)offset; // Sum valid offsets
2722 }
2723
2724 //------------------------------add_offset-------------------------------------
2725 const TypePtr *TypePtr::add_offset( intptr_t offset ) const {
2726 return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth, _reloc);
2727 }
2728
2729 const TypePtr *TypePtr::with_offset(intptr_t offset) const {
2730 return make(AnyPtr, _ptr, offset, _speculative, _inline_depth, _reloc);
2731 }
2732
2733 //------------------------------eq---------------------------------------------
2734 // Structural equality check for Type representations
2735 bool TypePtr::eq( const Type *t ) const {
2736 const TypePtr *a = (const TypePtr*)t;
2737 return _ptr == a->ptr() && _offset == a->offset() && _reloc == a->reloc() &&
2738 eq_speculative(a) && _inline_depth == a->_inline_depth;
2739 }
2740
2741 //------------------------------hash-------------------------------------------
2742 // Type-specific hashing function.
2743 uint TypePtr::hash(void) const {
2744 return (uint)_ptr + (uint)_offset + (uint)_reloc + (uint)hash_speculative() + (uint)_inline_depth;
2745 }
2746
2747 /**
2748 * Return same type without a speculative part
2749 */
2750 const TypePtr* TypePtr::remove_speculative() const {
2751 if (_speculative == nullptr) {
2752 return this;
2753 }
2754 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
2755 return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth, _reloc);
2756 }
2757
2758 /**
2759 * Return same type but drop speculative part if we know we won't use
2760 * it
2761 */
2762 const Type* TypePtr::cleanup_speculative() const {
2763 if (speculative() == nullptr) {
2764 return this;
2765 }
2766 const Type* no_spec = remove_speculative();
2767 // If this is NULL_PTR then we don't need the speculative type
2768 // (with_inline_depth in case the current type inline depth is
2769 // InlineDepthTop)
2770 if (no_spec == NULL_PTR->with_inline_depth(inline_depth())) {
2771 return no_spec;
2772 }
2773 if (above_centerline(speculative()->ptr())) {
2774 return no_spec;
2775 }
2776 const TypeOopPtr* spec_oopptr = speculative()->isa_oopptr();
2777 // If the speculative may be null and is an inexact klass then it
2778 // doesn't help
2779 if (speculative() != TypePtr::NULL_PTR && speculative()->maybe_null() &&
2780 (spec_oopptr == nullptr || !spec_oopptr->klass_is_exact())) {
2781 return no_spec;
2782 }
2783 return this;
2784 }
2785
2786 /**
2787 * dual of the speculative part of the type
2788 */
2789 const TypePtr* TypePtr::dual_speculative() const {
2790 if (_speculative == nullptr) {
2791 return nullptr;
2792 }
2793 return _speculative->dual()->is_ptr();
2794 }
2795
2796 /**
2797 * meet of the speculative parts of 2 types
2798 *
2799 * @param other type to meet with
2800 */
2801 const TypePtr* TypePtr::xmeet_speculative(const TypePtr* other) const {
2802 bool this_has_spec = (_speculative != nullptr);
2803 bool other_has_spec = (other->speculative() != nullptr);
2804
2805 if (!this_has_spec && !other_has_spec) {
2806 return nullptr;
2807 }
2808
2809 // If we are at a point where control flow meets and one branch has
2810 // a speculative type and the other has not, we meet the speculative
2811 // type of one branch with the actual type of the other. If the
2812 // actual type is exact and the speculative is as well, then the
2813 // result is a speculative type which is exact and we can continue
2814 // speculation further.
2815 const TypePtr* this_spec = _speculative;
2816 const TypePtr* other_spec = other->speculative();
2817
2818 if (!this_has_spec) {
2819 this_spec = this;
2820 }
2821
2822 if (!other_has_spec) {
2823 other_spec = other;
2824 }
2825
2826 return this_spec->meet(other_spec)->is_ptr();
2827 }
2828
2829 /**
2830 * dual of the inline depth for this type (used for speculation)
2831 */
2832 int TypePtr::dual_inline_depth() const {
2833 return -inline_depth();
2834 }
2835
2836 /**
2837 * meet of 2 inline depths (used for speculation)
2838 *
2839 * @param depth depth to meet with
2840 */
2841 int TypePtr::meet_inline_depth(int depth) const {
2842 return MAX2(inline_depth(), depth);
2843 }
2844
2845 /**
2846 * Are the speculative parts of 2 types equal?
2847 *
2848 * @param other type to compare this one to
2849 */
2850 bool TypePtr::eq_speculative(const TypePtr* other) const {
2851 if (_speculative == nullptr || other->speculative() == nullptr) {
2852 return _speculative == other->speculative();
2853 }
2854
2855 if (_speculative->base() != other->speculative()->base()) {
2856 return false;
2857 }
2858
2859 return _speculative->eq(other->speculative());
2860 }
2861
2862 /**
2863 * Hash of the speculative part of the type
2864 */
2865 int TypePtr::hash_speculative() const {
2866 if (_speculative == nullptr) {
2867 return 0;
2868 }
2869
2870 return _speculative->hash();
2871 }
2872
2873 /**
2874 * add offset to the speculative part of the type
2875 *
2876 * @param offset offset to add
2877 */
2878 const TypePtr* TypePtr::add_offset_speculative(intptr_t offset) const {
2879 if (_speculative == nullptr) {
2880 return nullptr;
2881 }
2882 return _speculative->add_offset(offset)->is_ptr();
2883 }
2884
2885 const TypePtr* TypePtr::with_offset_speculative(intptr_t offset) const {
2886 if (_speculative == nullptr) {
2887 return nullptr;
2888 }
2889 return _speculative->with_offset(offset)->is_ptr();
2890 }
2891
2892 /**
2893 * return exact klass from the speculative type if there's one
2894 */
2895 ciKlass* TypePtr::speculative_type() const {
2896 if (_speculative != nullptr && _speculative->isa_oopptr()) {
2897 const TypeOopPtr* speculative = _speculative->join(this)->is_oopptr();
2898 if (speculative->klass_is_exact()) {
2899 return speculative->exact_klass();
2900 }
2901 }
2902 return nullptr;
2903 }
2904
2905 /**
2906 * return true if speculative type may be null
2907 */
2908 bool TypePtr::speculative_maybe_null() const {
2909 if (_speculative != nullptr) {
2910 const TypePtr* speculative = _speculative->join(this)->is_ptr();
2911 return speculative->maybe_null();
2912 }
2913 return true;
2914 }
2915
2916 bool TypePtr::speculative_always_null() const {
2917 if (_speculative != nullptr) {
2918 const TypePtr* speculative = _speculative->join(this)->is_ptr();
2919 return speculative == TypePtr::NULL_PTR;
2920 }
2921 return false;
2922 }
2923
2924 /**
2925 * Same as TypePtr::speculative_type() but return the klass only if
2926 * the speculative tells us is not null
2927 */
2928 ciKlass* TypePtr::speculative_type_not_null() const {
2929 if (speculative_maybe_null()) {
2930 return nullptr;
2931 }
2932 return speculative_type();
2933 }
2934
2935 /**
2936 * Check whether new profiling would improve speculative type
2937 *
2938 * @param exact_kls class from profiling
2939 * @param inline_depth inlining depth of profile point
2940 *
2941 * @return true if type profile is valuable
2942 */
2943 bool TypePtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const {
2944 // no profiling?
2945 if (exact_kls == nullptr) {
2946 return false;
2947 }
2948 if (speculative() == TypePtr::NULL_PTR) {
2949 return false;
2950 }
2951 // no speculative type or non exact speculative type?
2952 if (speculative_type() == nullptr) {
2953 return true;
2954 }
2955 // If the node already has an exact speculative type keep it,
2956 // unless it was provided by profiling that is at a deeper
2957 // inlining level. Profiling at a higher inlining depth is
2958 // expected to be less accurate.
2959 if (_speculative->inline_depth() == InlineDepthBottom) {
2960 return false;
2961 }
2962 assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison");
2963 return inline_depth < _speculative->inline_depth();
2964 }
2965
2966 /**
2967 * Check whether new profiling would improve ptr (= tells us it is non
2968 * null)
2969 *
2970 * @param ptr_kind always null or not null?
2971 *
2972 * @return true if ptr profile is valuable
2973 */
2974 bool TypePtr::would_improve_ptr(ProfilePtrKind ptr_kind) const {
2975 // profiling doesn't tell us anything useful
2976 if (ptr_kind != ProfileAlwaysNull && ptr_kind != ProfileNeverNull) {
2977 return false;
2978 }
2979 // We already know this is not null
2980 if (!this->maybe_null()) {
2981 return false;
2982 }
2983 // We already know the speculative type cannot be null
2984 if (!speculative_maybe_null()) {
2985 return false;
2986 }
2987 // We already know this is always null
2988 if (this == TypePtr::NULL_PTR) {
2989 return false;
2990 }
2991 // We already know the speculative type is always null
2992 if (speculative_always_null()) {
2993 return false;
2994 }
2995 if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) {
2996 return false;
2997 }
2998 return true;
2999 }
3000
3001 //------------------------------dump2------------------------------------------
3002 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
3003 "TopPTR","AnyNull","Constant","null","NotNull","BotPTR"
3004 };
3005
3006 #ifndef PRODUCT
3007 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
3008 st->print("ptr:%s", ptr_msg[_ptr]);
3009 dump_offset(st);
3010 dump_inline_depth(st);
3011 dump_speculative(st);
3012 }
3013
3014 void TypePtr::dump_offset(outputStream* st) const {
3015 if (_offset == OffsetBot) {
3016 st->print("+bot");
3017 } else if (_offset == OffsetTop) {
3018 st->print("+top");
3019 } else {
3020 st->print("+%d", _offset);
3021 }
3022 }
3023
3024 /**
3025 *dump the speculative part of the type
3026 */
3027 void TypePtr::dump_speculative(outputStream *st) const {
3028 if (_speculative != nullptr) {
3029 st->print(" (speculative=");
3030 _speculative->dump_on(st);
3031 st->print(")");
3032 }
3033 }
3034
3035 /**
3036 *dump the inline depth of the type
3037 */
3038 void TypePtr::dump_inline_depth(outputStream *st) const {
3039 if (_inline_depth != InlineDepthBottom) {
3040 if (_inline_depth == InlineDepthTop) {
3041 st->print(" (inline_depth=InlineDepthTop)");
3042 } else {
3043 st->print(" (inline_depth=%d)", _inline_depth);
3044 }
3045 }
3046 }
3047 #endif
3048
3049 //------------------------------singleton--------------------------------------
3050 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3051 // constants
3052 bool TypePtr::singleton(void) const {
3053 // TopPTR, Null, AnyNull, Constant are all singletons
3054 return (_offset != OffsetBot) && !below_centerline(_ptr);
3055 }
3056
3057 bool TypePtr::empty(void) const {
3058 return (_offset == OffsetTop) || above_centerline(_ptr);
3059 }
3060
3061 //=============================================================================
3062 // Convenience common pre-built types.
3063 const TypeRawPtr *TypeRawPtr::BOTTOM;
3064 const TypeRawPtr *TypeRawPtr::NOTNULL;
3065
3066 //------------------------------make-------------------------------------------
3067 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
3068 assert( ptr != Constant, "what is the constant?" );
3069 assert( ptr != Null, "Use TypePtr for null" );
3070 return (TypeRawPtr*)(new TypeRawPtr(ptr, nullptr, relocInfo::none))->hashcons();
3071 }
3072
3073 const TypeRawPtr* TypeRawPtr::make(address bits, relocInfo::relocType reloc) {
3074 assert(bits != nullptr, "Use TypePtr for null");
3075 return (TypeRawPtr*)(new TypeRawPtr(Constant, bits, reloc))->hashcons();
3076 }
3077
3078 //------------------------------cast_to_ptr_type-------------------------------
3079 const TypeRawPtr* TypeRawPtr::cast_to_ptr_type(PTR ptr) const {
3080 assert( ptr != Constant, "what is the constant?" );
3081 assert( ptr != Null, "Use TypePtr for null" );
3082 assert( _bits == nullptr, "Why cast a constant address?");
3083 if( ptr == _ptr ) return this;
3084 return make(ptr);
3085 }
3086
3087 //------------------------------get_con----------------------------------------
3088 intptr_t TypeRawPtr::get_con() const {
3089 assert( _ptr == Null || _ptr == Constant, "" );
3090 return (intptr_t)_bits;
3091 }
3092
3093 //------------------------------meet-------------------------------------------
3094 // Compute the MEET of two types. It returns a new Type object.
3095 const Type *TypeRawPtr::xmeet( const Type *t ) const {
3096 // Perform a fast test for common case; meeting the same types together.
3097 if( this == t ) return this; // Meeting same type-rep?
3098
3099 // Current "this->_base" is RawPtr
3100 switch( t->base() ) { // switch on original type
3101 case Bottom: // Ye Olde Default
3102 return t;
3103 case Top:
3104 return this;
3105 case AnyPtr: // Meeting to AnyPtrs
3106 break;
3107 case RawPtr: { // might be top, bot, any/not or constant
3108 enum PTR tptr = t->is_ptr()->ptr();
3109 enum PTR ptr = meet_ptr( tptr );
3110 if( ptr == Constant ) { // Cannot be equal constants, so...
3111 if( tptr == Constant && _ptr != Constant) return t;
3112 if( _ptr == Constant && tptr != Constant) return this;
3113 ptr = NotNull; // Fall down in lattice
3114 }
3115 return make( ptr );
3116 }
3117
3118 case OopPtr:
3119 case InstPtr:
3120 case AryPtr:
3121 case MetadataPtr:
3122 case KlassPtr:
3123 case InstKlassPtr:
3124 case AryKlassPtr:
3125 return TypePtr::BOTTOM; // Oop meet raw is not well defined
3126 default: // All else is a mistake
3127 typerr(t);
3128 }
3129
3130 // Found an AnyPtr type vs self-RawPtr type
3131 const TypePtr *tp = t->is_ptr();
3132 switch (tp->ptr()) {
3133 case TypePtr::TopPTR: return this;
3134 case TypePtr::BotPTR: return t;
3135 case TypePtr::Null:
3136 if( _ptr == TypePtr::TopPTR ) return t;
3137 return TypeRawPtr::BOTTOM;
3138 case TypePtr::NotNull: return TypePtr::make(AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0), tp->speculative(), tp->inline_depth());
3139 case TypePtr::AnyNull:
3140 if( _ptr == TypePtr::Constant) return this;
3141 return make( meet_ptr(TypePtr::AnyNull) );
3142 default: ShouldNotReachHere();
3143 }
3144 return this;
3145 }
3146
3147 //------------------------------xdual------------------------------------------
3148 // Dual: compute field-by-field dual
3149 const Type *TypeRawPtr::xdual() const {
3150 return new TypeRawPtr(dual_ptr(), _bits, _reloc);
3151 }
3152
3153 //------------------------------add_offset-------------------------------------
3154 const TypePtr* TypeRawPtr::add_offset(intptr_t offset) const {
3155 if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer
3156 if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer
3157 if( offset == 0 ) return this; // No change
3158 switch (_ptr) {
3159 case TypePtr::TopPTR:
3160 case TypePtr::BotPTR:
3161 case TypePtr::NotNull:
3162 return this;
3163 case TypePtr::Constant: {
3164 uintptr_t bits = (uintptr_t)_bits;
3165 uintptr_t sum = bits + offset;
3166 if (( offset < 0 )
3167 ? ( sum > bits ) // Underflow?
3168 : ( sum < bits )) { // Overflow?
3169 return BOTTOM;
3170 } else if ( sum == 0 ) {
3171 return TypePtr::NULL_PTR;
3172 } else {
3173 return make((address)sum, _reloc);
3174 }
3175 }
3176 default: ShouldNotReachHere();
3177 }
3178 }
3179
3180 //------------------------------eq---------------------------------------------
3181 // Structural equality check for Type representations
3182 bool TypeRawPtr::eq( const Type *t ) const {
3183 const TypeRawPtr *a = (const TypeRawPtr*)t;
3184 return _bits == a->_bits && TypePtr::eq(t);
3185 }
3186
3187 //------------------------------hash-------------------------------------------
3188 // Type-specific hashing function.
3189 uint TypeRawPtr::hash(void) const {
3190 return (uint)(uintptr_t)_bits + (uint)TypePtr::hash();
3191 }
3192
3193 //------------------------------dump2------------------------------------------
3194 #ifndef PRODUCT
3195 void TypeRawPtr::dump2(Dict& d, uint depth, outputStream* st) const {
3196 if (_ptr == Constant) {
3197 st->print("rawptr:Constant:" INTPTR_FORMAT, p2i(_bits));
3198 } else {
3199 st->print("rawptr:%s", ptr_msg[_ptr]);
3200 }
3201 }
3202 #endif
3203
3204 //=============================================================================
3205 // Convenience common pre-built type.
3206 const TypeOopPtr *TypeOopPtr::BOTTOM;
3207
3208 TypeInterfaces::TypeInterfaces(ciInstanceKlass** interfaces_base, int nb_interfaces)
3209 : Type(Interfaces), _interfaces(interfaces_base, nb_interfaces),
3210 _hash(0), _exact_klass(nullptr) {
3211 _interfaces.sort(compare);
3212 initialize();
3213 }
3214
3215 const TypeInterfaces* TypeInterfaces::make(GrowableArray<ciInstanceKlass*>* interfaces) {
3216 // hashcons() can only delete the last thing that was allocated: to
3217 // make sure all memory for the newly created TypeInterfaces can be
3218 // freed if an identical one exists, allocate space for the array of
3219 // interfaces right after the TypeInterfaces object so that they
3220 // form a contiguous piece of memory.
3221 int nb_interfaces = interfaces == nullptr ? 0 : interfaces->length();
3222 size_t total_size = sizeof(TypeInterfaces) + nb_interfaces * sizeof(ciInstanceKlass*);
3223
3224 void* allocated_mem = operator new(total_size);
3225 ciInstanceKlass** interfaces_base = (ciInstanceKlass**)((char*)allocated_mem + sizeof(TypeInterfaces));
3226 for (int i = 0; i < nb_interfaces; ++i) {
3227 interfaces_base[i] = interfaces->at(i);
3228 }
3229 TypeInterfaces* result = ::new (allocated_mem) TypeInterfaces(interfaces_base, nb_interfaces);
3230 return (const TypeInterfaces*)result->hashcons();
3231 }
3232
3233 void TypeInterfaces::initialize() {
3234 compute_hash();
3235 compute_exact_klass();
3236 DEBUG_ONLY(_initialized = true;)
3237 }
3238
3239 int TypeInterfaces::compare(ciInstanceKlass* const& k1, ciInstanceKlass* const& k2) {
3240 if ((intptr_t)k1 < (intptr_t)k2) {
3241 return -1;
3242 } else if ((intptr_t)k1 > (intptr_t)k2) {
3243 return 1;
3244 }
3245 return 0;
3246 }
3247
3248 int TypeInterfaces::compare(ciInstanceKlass** k1, ciInstanceKlass** k2) {
3249 return compare(*k1, *k2);
3250 }
3251
3252 bool TypeInterfaces::eq(const Type* t) const {
3253 const TypeInterfaces* other = (const TypeInterfaces*)t;
3254 if (_interfaces.length() != other->_interfaces.length()) {
3255 return false;
3256 }
3257 for (int i = 0; i < _interfaces.length(); i++) {
3258 ciKlass* k1 = _interfaces.at(i);
3259 ciKlass* k2 = other->_interfaces.at(i);
3260 if (!k1->equals(k2)) {
3261 return false;
3262 }
3263 }
3264 return true;
3265 }
3266
3267 bool TypeInterfaces::eq(ciInstanceKlass* k) const {
3268 assert(k->is_loaded(), "should be loaded");
3269 GrowableArray<ciInstanceKlass *>* interfaces = k->transitive_interfaces();
3270 if (_interfaces.length() != interfaces->length()) {
3271 return false;
3272 }
3273 for (int i = 0; i < interfaces->length(); i++) {
3274 bool found = false;
3275 _interfaces.find_sorted<ciInstanceKlass*, compare>(interfaces->at(i), found);
3276 if (!found) {
3277 return false;
3278 }
3279 }
3280 return true;
3281 }
3282
3283
3284 uint TypeInterfaces::hash() const {
3285 assert(_initialized, "must be");
3286 return _hash;
3287 }
3288
3289 const Type* TypeInterfaces::xdual() const {
3290 return this;
3291 }
3292
3293 void TypeInterfaces::compute_hash() {
3294 uint hash = 0;
3295 for (int i = 0; i < _interfaces.length(); i++) {
3296 ciKlass* k = _interfaces.at(i);
3297 hash += k->hash();
3298 }
3299 _hash = hash;
3300 }
3301
3302 static int compare_interfaces(ciInstanceKlass** k1, ciInstanceKlass** k2) {
3303 return (int)((*k1)->ident() - (*k2)->ident());
3304 }
3305
3306 void TypeInterfaces::dump(outputStream* st) const {
3307 if (_interfaces.length() == 0) {
3308 return;
3309 }
3310 ResourceMark rm;
3311 st->print(" (");
3312 GrowableArray<ciInstanceKlass*> interfaces;
3313 interfaces.appendAll(&_interfaces);
3314 // Sort the interfaces so they are listed in the same order from one run to the other of the same compilation
3315 interfaces.sort(compare_interfaces);
3316 for (int i = 0; i < interfaces.length(); i++) {
3317 if (i > 0) {
3318 st->print(",");
3319 }
3320 ciKlass* k = interfaces.at(i);
3321 k->print_name_on(st);
3322 }
3323 st->print(")");
3324 }
3325
3326 #ifdef ASSERT
3327 void TypeInterfaces::verify() const {
3328 for (int i = 1; i < _interfaces.length(); i++) {
3329 ciInstanceKlass* k1 = _interfaces.at(i-1);
3330 ciInstanceKlass* k2 = _interfaces.at(i);
3331 assert(compare(k2, k1) > 0, "should be ordered");
3332 assert(k1 != k2, "no duplicate");
3333 }
3334 }
3335 #endif
3336
3337 const TypeInterfaces* TypeInterfaces::union_with(const TypeInterfaces* other) const {
3338 GrowableArray<ciInstanceKlass*> result_list;
3339 int i = 0;
3340 int j = 0;
3341 while (i < _interfaces.length() || j < other->_interfaces.length()) {
3342 while (i < _interfaces.length() &&
3343 (j >= other->_interfaces.length() ||
3344 compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) {
3345 result_list.push(_interfaces.at(i));
3346 i++;
3347 }
3348 while (j < other->_interfaces.length() &&
3349 (i >= _interfaces.length() ||
3350 compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) {
3351 result_list.push(other->_interfaces.at(j));
3352 j++;
3353 }
3354 if (i < _interfaces.length() &&
3355 j < other->_interfaces.length() &&
3356 _interfaces.at(i) == other->_interfaces.at(j)) {
3357 result_list.push(_interfaces.at(i));
3358 i++;
3359 j++;
3360 }
3361 }
3362 const TypeInterfaces* result = TypeInterfaces::make(&result_list);
3363 #ifdef ASSERT
3364 result->verify();
3365 for (int i = 0; i < _interfaces.length(); i++) {
3366 assert(result->_interfaces.contains(_interfaces.at(i)), "missing");
3367 }
3368 for (int i = 0; i < other->_interfaces.length(); i++) {
3369 assert(result->_interfaces.contains(other->_interfaces.at(i)), "missing");
3370 }
3371 for (int i = 0; i < result->_interfaces.length(); i++) {
3372 assert(_interfaces.contains(result->_interfaces.at(i)) || other->_interfaces.contains(result->_interfaces.at(i)), "missing");
3373 }
3374 #endif
3375 return result;
3376 }
3377
3378 const TypeInterfaces* TypeInterfaces::intersection_with(const TypeInterfaces* other) const {
3379 GrowableArray<ciInstanceKlass*> result_list;
3380 int i = 0;
3381 int j = 0;
3382 while (i < _interfaces.length() || j < other->_interfaces.length()) {
3383 while (i < _interfaces.length() &&
3384 (j >= other->_interfaces.length() ||
3385 compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) {
3386 i++;
3387 }
3388 while (j < other->_interfaces.length() &&
3389 (i >= _interfaces.length() ||
3390 compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) {
3391 j++;
3392 }
3393 if (i < _interfaces.length() &&
3394 j < other->_interfaces.length() &&
3395 _interfaces.at(i) == other->_interfaces.at(j)) {
3396 result_list.push(_interfaces.at(i));
3397 i++;
3398 j++;
3399 }
3400 }
3401 const TypeInterfaces* result = TypeInterfaces::make(&result_list);
3402 #ifdef ASSERT
3403 result->verify();
3404 for (int i = 0; i < _interfaces.length(); i++) {
3405 assert(!other->_interfaces.contains(_interfaces.at(i)) || result->_interfaces.contains(_interfaces.at(i)), "missing");
3406 }
3407 for (int i = 0; i < other->_interfaces.length(); i++) {
3408 assert(!_interfaces.contains(other->_interfaces.at(i)) || result->_interfaces.contains(other->_interfaces.at(i)), "missing");
3409 }
3410 for (int i = 0; i < result->_interfaces.length(); i++) {
3411 assert(_interfaces.contains(result->_interfaces.at(i)) && other->_interfaces.contains(result->_interfaces.at(i)), "missing");
3412 }
3413 #endif
3414 return result;
3415 }
3416
3417 // Is there a single ciKlass* that can represent the interface set?
3418 ciInstanceKlass* TypeInterfaces::exact_klass() const {
3419 assert(_initialized, "must be");
3420 return _exact_klass;
3421 }
3422
3423 void TypeInterfaces::compute_exact_klass() {
3424 if (_interfaces.length() == 0) {
3425 _exact_klass = nullptr;
3426 return;
3427 }
3428 ciInstanceKlass* res = nullptr;
3429 for (int i = 0; i < _interfaces.length(); i++) {
3430 ciInstanceKlass* interface = _interfaces.at(i);
3431 if (eq(interface)) {
3432 assert(res == nullptr, "");
3433 res = interface;
3434 }
3435 }
3436 _exact_klass = res;
3437 }
3438
3439 #ifdef ASSERT
3440 void TypeInterfaces::verify_is_loaded() const {
3441 for (int i = 0; i < _interfaces.length(); i++) {
3442 ciKlass* interface = _interfaces.at(i);
3443 assert(interface->is_loaded(), "Interface not loaded");
3444 }
3445 }
3446 #endif
3447
3448 // Can't be implemented because there's no way to know if the type is above or below the center line.
3449 const Type* TypeInterfaces::xmeet(const Type* t) const {
3450 ShouldNotReachHere();
3451 return Type::xmeet(t);
3452 }
3453
3454 bool TypeInterfaces::singleton(void) const {
3455 ShouldNotReachHere();
3456 return Type::singleton();
3457 }
3458
3459 bool TypeInterfaces::has_non_array_interface() const {
3460 assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?");
3461
3462 return !TypeAryPtr::_array_interfaces->contains(this);
3463 }
3464
3465 //------------------------------TypeOopPtr-------------------------------------
3466 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int offset,
3467 int instance_id, const TypePtr* speculative, int inline_depth)
3468 : TypePtr(t, ptr, offset, relocInfo::oop_type, speculative, inline_depth),
3469 _const_oop(o), _klass(k),
3470 _interfaces(interfaces),
3471 _klass_is_exact(xk),
3472 _is_ptr_to_narrowoop(false),
3473 _is_ptr_to_narrowklass(false),
3474 _is_ptr_to_boxed_value(false),
3475 _instance_id(instance_id) {
3476 #ifdef ASSERT
3477 if (klass() != nullptr && klass()->is_loaded()) {
3478 interfaces->verify_is_loaded();
3479 }
3480 #endif
3481 if (Compile::current()->eliminate_boxing() && (t == InstPtr) &&
3482 (offset > 0) && xk && (k != nullptr) && k->is_instance_klass()) {
3483 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset);
3484 }
3485 #ifdef _LP64
3486 if (_offset > 0 || _offset == Type::OffsetTop || _offset == Type::OffsetBot) {
3487 if (_offset == oopDesc::klass_offset_in_bytes()) {
3488 _is_ptr_to_narrowklass = true;
3489 } else if (klass() == nullptr) {
3490 // Array with unknown body type
3491 assert(this->isa_aryptr(), "only arrays without klass");
3492 _is_ptr_to_narrowoop = UseCompressedOops;
3493 } else if (this->isa_aryptr()) {
3494 _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() &&
3495 _offset != arrayOopDesc::length_offset_in_bytes());
3496 } else if (klass()->is_instance_klass()) {
3497 ciInstanceKlass* ik = klass()->as_instance_klass();
3498 if (this->isa_klassptr()) {
3499 // Perm objects don't use compressed references
3500 } else if (_offset == OffsetBot || _offset == OffsetTop) {
3501 // unsafe access
3502 _is_ptr_to_narrowoop = UseCompressedOops;
3503 } else {
3504 assert(this->isa_instptr(), "must be an instance ptr.");
3505
3506 if (klass() == ciEnv::current()->Class_klass() &&
3507 (_offset == java_lang_Class::klass_offset() ||
3508 _offset == java_lang_Class::array_klass_offset())) {
3509 // Special hidden fields from the Class.
3510 assert(this->isa_instptr(), "must be an instance ptr.");
3511 _is_ptr_to_narrowoop = false;
3512 } else if (klass() == ciEnv::current()->Class_klass() &&
3513 _offset >= InstanceMirrorKlass::offset_of_static_fields()) {
3514 // Static fields
3515 BasicType basic_elem_type = T_ILLEGAL;
3516 if (const_oop() != nullptr) {
3517 ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass();
3518 basic_elem_type = k->get_field_type_by_offset(_offset, true);
3519 }
3520 if (basic_elem_type != T_ILLEGAL) {
3521 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3522 } else {
3523 // unsafe access
3524 _is_ptr_to_narrowoop = UseCompressedOops;
3525 }
3526 } else {
3527 // Instance fields which contains a compressed oop references.
3528 BasicType basic_elem_type = ik->get_field_type_by_offset(_offset, false);
3529 if (basic_elem_type != T_ILLEGAL) {
3530 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type);
3531 } else if (klass()->equals(ciEnv::current()->Object_klass())) {
3532 // Compile::find_alias_type() cast exactness on all types to verify
3533 // that it does not affect alias type.
3534 _is_ptr_to_narrowoop = UseCompressedOops;
3535 } else {
3536 // Type for the copy start in LibraryCallKit::inline_native_clone().
3537 _is_ptr_to_narrowoop = UseCompressedOops;
3538 }
3539 }
3540 }
3541 }
3542 }
3543 #endif
3544 }
3545
3546 //------------------------------make-------------------------------------------
3547 const TypeOopPtr *TypeOopPtr::make(PTR ptr, int offset, int instance_id,
3548 const TypePtr* speculative, int inline_depth) {
3549 assert(ptr != Constant, "no constant generic pointers");
3550 ciKlass* k = Compile::current()->env()->Object_klass();
3551 bool xk = false;
3552 ciObject* o = nullptr;
3553 const TypeInterfaces* interfaces = TypeInterfaces::make();
3554 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, instance_id, speculative, inline_depth))->hashcons();
3555 }
3556
3557
3558 //------------------------------cast_to_ptr_type-------------------------------
3559 const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
3560 assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
3561 if( ptr == _ptr ) return this;
3562 return make(ptr, _offset, _instance_id, _speculative, _inline_depth);
3563 }
3564
3565 //-----------------------------cast_to_instance_id----------------------------
3566 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
3567 // There are no instances of a general oop.
3568 // Return self unchanged.
3569 return this;
3570 }
3571
3572 //-----------------------------cast_to_exactness-------------------------------
3573 const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
3574 // There is no such thing as an exact general oop.
3575 // Return self unchanged.
3576 return this;
3577 }
3578
3579
3580 //------------------------------as_klass_type----------------------------------
3581 // Return the klass type corresponding to this instance or array type.
3582 // It is the type that is loaded from an object of this type.
3583 const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const {
3584 ShouldNotReachHere();
3585 return nullptr;
3586 }
3587
3588 //------------------------------meet-------------------------------------------
3589 // Compute the MEET of two types. It returns a new Type object.
3590 const Type *TypeOopPtr::xmeet_helper(const Type *t) const {
3591 // Perform a fast test for common case; meeting the same types together.
3592 if( this == t ) return this; // Meeting same type-rep?
3593
3594 // Current "this->_base" is OopPtr
3595 switch (t->base()) { // switch on original type
3596
3597 case Int: // Mixing ints & oops happens when javac
3598 case Long: // reuses local variables
3599 case HalfFloatTop:
3600 case HalfFloatCon:
3601 case HalfFloatBot:
3602 case FloatTop:
3603 case FloatCon:
3604 case FloatBot:
3605 case DoubleTop:
3606 case DoubleCon:
3607 case DoubleBot:
3608 case NarrowOop:
3609 case NarrowKlass:
3610 case Bottom: // Ye Olde Default
3611 return Type::BOTTOM;
3612 case Top:
3613 return this;
3614
3615 default: // All else is a mistake
3616 typerr(t);
3617
3618 case RawPtr:
3619 case MetadataPtr:
3620 case KlassPtr:
3621 case InstKlassPtr:
3622 case AryKlassPtr:
3623 return TypePtr::BOTTOM; // Oop meet raw is not well defined
3624
3625 case AnyPtr: {
3626 // Found an AnyPtr type vs self-OopPtr type
3627 const TypePtr *tp = t->is_ptr();
3628 int offset = meet_offset(tp->offset());
3629 PTR ptr = meet_ptr(tp->ptr());
3630 const TypePtr* speculative = xmeet_speculative(tp);
3631 int depth = meet_inline_depth(tp->inline_depth());
3632 switch (tp->ptr()) {
3633 case Null:
3634 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3635 // else fall through:
3636 case TopPTR:
3637 case AnyNull: {
3638 int instance_id = meet_instance_id(InstanceTop);
3639 return make(ptr, offset, instance_id, speculative, depth);
3640 }
3641 case BotPTR:
3642 case NotNull:
3643 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
3644 default: typerr(t);
3645 }
3646 }
3647
3648 case OopPtr: { // Meeting to other OopPtrs
3649 const TypeOopPtr *tp = t->is_oopptr();
3650 int instance_id = meet_instance_id(tp->instance_id());
3651 const TypePtr* speculative = xmeet_speculative(tp);
3652 int depth = meet_inline_depth(tp->inline_depth());
3653 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth);
3654 }
3655
3656 case InstPtr: // For these, flip the call around to cut down
3657 case AryPtr:
3658 return t->xmeet(this); // Call in reverse direction
3659
3660 } // End of switch
3661 return this; // Return the double constant
3662 }
3663
3664
3665 //------------------------------xdual------------------------------------------
3666 // Dual of a pure heap pointer. No relevant klass or oop information.
3667 const Type *TypeOopPtr::xdual() const {
3668 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here");
3669 assert(const_oop() == nullptr, "no constants here");
3670 return new TypeOopPtr(_base, dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
3671 }
3672
3673 //--------------------------make_from_klass_common-----------------------------
3674 // Computes the element-type given a klass.
3675 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass* klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) {
3676 if (klass->is_instance_klass()) {
3677 Compile* C = Compile::current();
3678 Dependencies* deps = C->dependencies();
3679 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
3680 // Element is an instance
3681 bool klass_is_exact = false;
3682 if (klass->is_loaded()) {
3683 // Try to set klass_is_exact.
3684 ciInstanceKlass* ik = klass->as_instance_klass();
3685 klass_is_exact = ik->is_final();
3686 if (!klass_is_exact && klass_change
3687 && deps != nullptr && UseUniqueSubclasses) {
3688 ciInstanceKlass* sub = ik->unique_concrete_subklass();
3689 if (sub != nullptr) {
3690 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
3691 klass = ik = sub;
3692 klass_is_exact = sub->is_final();
3693 }
3694 }
3695 if (!klass_is_exact && try_for_exact && deps != nullptr &&
3696 !ik->is_interface() && !ik->has_subklass()) {
3697 // Add a dependence; if concrete subclass added we need to recompile
3698 deps->assert_leaf_type(ik);
3699 klass_is_exact = true;
3700 }
3701 }
3702 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
3703 return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, 0);
3704 } else if (klass->is_obj_array_klass()) {
3705 // Element is an object array. Recursively call ourself.
3706 ciKlass* eklass = klass->as_obj_array_klass()->element_klass();
3707 const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(eklass, false, try_for_exact, interface_handling);
3708 bool xk = etype->klass_is_exact();
3709 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
3710 // We used to pass NotNull in here, asserting that the sub-arrays
3711 // are all not-null. This is not true in generally, as code can
3712 // slam nulls down in the subarrays.
3713 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, 0);
3714 return arr;
3715 } else if (klass->is_type_array_klass()) {
3716 // Element is an typeArray
3717 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
3718 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
3719 // We used to pass NotNull in here, asserting that the array pointer
3720 // is not-null. That was not true in general.
3721 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0);
3722 return arr;
3723 } else {
3724 ShouldNotReachHere();
3725 return nullptr;
3726 }
3727 }
3728
3729 //------------------------------make_from_constant-----------------------------
3730 // Make a java pointer from an oop constant
3731 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) {
3732 assert(!o->is_null_object(), "null object not yet handled here.");
3733
3734 const bool make_constant = require_constant || o->should_be_constant();
3735
3736 ciKlass* klass = o->klass();
3737 if (klass->is_instance_klass()) {
3738 // Element is an instance
3739 if (make_constant) {
3740 return TypeInstPtr::make(o);
3741 } else {
3742 return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, 0);
3743 }
3744 } else if (klass->is_obj_array_klass()) {
3745 // Element is an object array. Recursively call ourself.
3746 const TypeOopPtr *etype =
3747 TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass(), trust_interfaces);
3748 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
3749 // We used to pass NotNull in here, asserting that the sub-arrays
3750 // are all not-null. This is not true in generally, as code can
3751 // slam nulls down in the subarrays.
3752 if (make_constant) {
3753 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
3754 } else {
3755 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
3756 }
3757 } else if (klass->is_type_array_klass()) {
3758 // Element is an typeArray
3759 const Type* etype =
3760 (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
3761 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
3762 // We used to pass NotNull in here, asserting that the array pointer
3763 // is not-null. That was not true in general.
3764 if (make_constant) {
3765 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
3766 } else {
3767 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
3768 }
3769 }
3770
3771 fatal("unhandled object type");
3772 return nullptr;
3773 }
3774
3775 //------------------------------get_con----------------------------------------
3776 intptr_t TypeOopPtr::get_con() const {
3777 assert( _ptr == Null || _ptr == Constant, "" );
3778 assert( _offset >= 0, "" );
3779
3780 if (_offset != 0) {
3781 // After being ported to the compiler interface, the compiler no longer
3782 // directly manipulates the addresses of oops. Rather, it only has a pointer
3783 // to a handle at compile time. This handle is embedded in the generated
3784 // code and dereferenced at the time the nmethod is made. Until that time,
3785 // it is not reasonable to do arithmetic with the addresses of oops (we don't
3786 // have access to the addresses!). This does not seem to currently happen,
3787 // but this assertion here is to help prevent its occurrence.
3788 tty->print_cr("Found oop constant with non-zero offset");
3789 ShouldNotReachHere();
3790 }
3791
3792 return (intptr_t)const_oop()->constant_encoding();
3793 }
3794
3795
3796 //-----------------------------filter------------------------------------------
3797 // Do not allow interface-vs.-noninterface joins to collapse to top.
3798 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const {
3799
3800 const Type* ft = join_helper(kills, include_speculative);
3801
3802 if (ft->empty()) {
3803 return Type::TOP; // Canonical empty value
3804 }
3805
3806 return ft;
3807 }
3808
3809 //------------------------------eq---------------------------------------------
3810 // Structural equality check for Type representations
3811 bool TypeOopPtr::eq( const Type *t ) const {
3812 const TypeOopPtr *a = (const TypeOopPtr*)t;
3813 if (_klass_is_exact != a->_klass_is_exact ||
3814 _instance_id != a->_instance_id) return false;
3815 ciObject* one = const_oop();
3816 ciObject* two = a->const_oop();
3817 if (one == nullptr || two == nullptr) {
3818 return (one == two) && TypePtr::eq(t);
3819 } else {
3820 return one->equals(two) && TypePtr::eq(t);
3821 }
3822 }
3823
3824 //------------------------------hash-------------------------------------------
3825 // Type-specific hashing function.
3826 uint TypeOopPtr::hash(void) const {
3827 return
3828 (uint)(const_oop() ? const_oop()->hash() : 0) +
3829 (uint)_klass_is_exact +
3830 (uint)_instance_id + TypePtr::hash();
3831 }
3832
3833 //------------------------------dump2------------------------------------------
3834 #ifndef PRODUCT
3835 void TypeOopPtr::dump2(Dict& d, uint depth, outputStream* st) const {
3836 st->print("oopptr:%s", ptr_msg[_ptr]);
3837 if (_klass_is_exact) {
3838 st->print(":exact");
3839 }
3840 if (const_oop() != nullptr) {
3841 st->print(":" INTPTR_FORMAT, p2i(const_oop()));
3842 }
3843 dump_offset(st);
3844 dump_instance_id(st);
3845 dump_inline_depth(st);
3846 dump_speculative(st);
3847 }
3848
3849 void TypeOopPtr::dump_instance_id(outputStream* st) const {
3850 if (_instance_id == InstanceTop) {
3851 st->print(",iid=top");
3852 } else if (_instance_id == InstanceBot) {
3853 st->print(",iid=bot");
3854 } else {
3855 st->print(",iid=%d", _instance_id);
3856 }
3857 }
3858 #endif
3859
3860 //------------------------------singleton--------------------------------------
3861 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
3862 // constants
3863 bool TypeOopPtr::singleton(void) const {
3864 // detune optimizer to not generate constant oop + constant offset as a constant!
3865 // TopPTR, Null, AnyNull, Constant are all singletons
3866 return (_offset == 0) && !below_centerline(_ptr);
3867 }
3868
3869 //------------------------------add_offset-------------------------------------
3870 const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const {
3871 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
3872 }
3873
3874 const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const {
3875 return make(_ptr, offset, _instance_id, with_offset_speculative(offset), _inline_depth);
3876 }
3877
3878 /**
3879 * Return same type without a speculative part
3880 */
3881 const TypeOopPtr* TypeOopPtr::remove_speculative() const {
3882 if (_speculative == nullptr) {
3883 return this;
3884 }
3885 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
3886 return make(_ptr, _offset, _instance_id, nullptr, _inline_depth);
3887 }
3888
3889 /**
3890 * Return same type but drop speculative part if we know we won't use
3891 * it
3892 */
3893 const Type* TypeOopPtr::cleanup_speculative() const {
3894 // If the klass is exact and the ptr is not null then there's
3895 // nothing that the speculative type can help us with
3896 if (klass_is_exact() && !maybe_null()) {
3897 return remove_speculative();
3898 }
3899 return TypePtr::cleanup_speculative();
3900 }
3901
3902 /**
3903 * Return same type but with a different inline depth (used for speculation)
3904 *
3905 * @param depth depth to meet with
3906 */
3907 const TypePtr* TypeOopPtr::with_inline_depth(int depth) const {
3908 if (!UseInlineDepthForSpeculativeTypes) {
3909 return this;
3910 }
3911 return make(_ptr, _offset, _instance_id, _speculative, depth);
3912 }
3913
3914 //------------------------------with_instance_id--------------------------------
3915 const TypePtr* TypeOopPtr::with_instance_id(int instance_id) const {
3916 assert(_instance_id != -1, "should be known");
3917 return make(_ptr, _offset, instance_id, _speculative, _inline_depth);
3918 }
3919
3920 //------------------------------meet_instance_id--------------------------------
3921 int TypeOopPtr::meet_instance_id( int instance_id ) const {
3922 // Either is 'TOP' instance? Return the other instance!
3923 if( _instance_id == InstanceTop ) return instance_id;
3924 if( instance_id == InstanceTop ) return _instance_id;
3925 // If either is different, return 'BOTTOM' instance
3926 if( _instance_id != instance_id ) return InstanceBot;
3927 return _instance_id;
3928 }
3929
3930 //------------------------------dual_instance_id--------------------------------
3931 int TypeOopPtr::dual_instance_id( ) const {
3932 if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM
3933 if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP
3934 return _instance_id; // Map everything else into self
3935 }
3936
3937
3938 const TypeInterfaces* TypeOopPtr::meet_interfaces(const TypeOopPtr* other) const {
3939 if (above_centerline(_ptr) && above_centerline(other->_ptr)) {
3940 return _interfaces->union_with(other->_interfaces);
3941 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) {
3942 return other->_interfaces;
3943 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) {
3944 return _interfaces;
3945 }
3946 return _interfaces->intersection_with(other->_interfaces);
3947 }
3948
3949 /**
3950 * Check whether new profiling would improve speculative type
3951 *
3952 * @param exact_kls class from profiling
3953 * @param inline_depth inlining depth of profile point
3954 *
3955 * @return true if type profile is valuable
3956 */
3957 bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const {
3958 // no way to improve an already exact type
3959 if (klass_is_exact()) {
3960 return false;
3961 }
3962 return TypePtr::would_improve_type(exact_kls, inline_depth);
3963 }
3964
3965 //=============================================================================
3966 // Convenience common pre-built types.
3967 const TypeInstPtr *TypeInstPtr::NOTNULL;
3968 const TypeInstPtr *TypeInstPtr::BOTTOM;
3969 const TypeInstPtr *TypeInstPtr::MIRROR;
3970 const TypeInstPtr *TypeInstPtr::MARK;
3971 const TypeInstPtr *TypeInstPtr::KLASS;
3972
3973 // Is there a single ciKlass* that can represent that type?
3974 ciKlass* TypeInstPtr::exact_klass_helper() const {
3975 if (_interfaces->empty()) {
3976 return _klass;
3977 }
3978 if (_klass != ciEnv::current()->Object_klass()) {
3979 if (_interfaces->eq(_klass->as_instance_klass())) {
3980 return _klass;
3981 }
3982 return nullptr;
3983 }
3984 return _interfaces->exact_klass();
3985 }
3986
3987 //------------------------------TypeInstPtr-------------------------------------
3988 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int off,
3989 int instance_id, const TypePtr* speculative, int inline_depth)
3990 : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, instance_id, speculative, inline_depth) {
3991 assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here");
3992 assert(k != nullptr &&
3993 (k->is_loaded() || o == nullptr),
3994 "cannot have constants with non-loaded klass");
3995 };
3996
3997 //------------------------------make-------------------------------------------
3998 const TypeInstPtr *TypeInstPtr::make(PTR ptr,
3999 ciKlass* k,
4000 const TypeInterfaces* interfaces,
4001 bool xk,
4002 ciObject* o,
4003 int offset,
4004 int instance_id,
4005 const TypePtr* speculative,
4006 int inline_depth) {
4007 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance");
4008 // Either const_oop() is null or else ptr is Constant
4009 assert( (!o && ptr != Constant) || (o && ptr == Constant),
4010 "constant pointers must have a value supplied" );
4011 // Ptr is never Null
4012 assert( ptr != Null, "null pointers are not typed" );
4013
4014 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4015 if (ptr == Constant) {
4016 // Note: This case includes meta-object constants, such as methods.
4017 xk = true;
4018 } else if (k->is_loaded()) {
4019 ciInstanceKlass* ik = k->as_instance_klass();
4020 if (!xk && ik->is_final()) xk = true; // no inexact final klass
4021 assert(!ik->is_interface(), "no interface here");
4022 if (xk && ik->is_interface()) xk = false; // no exact interface
4023 }
4024
4025 // Now hash this baby
4026 TypeInstPtr *result =
4027 (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons();
4028
4029 return result;
4030 }
4031
4032 const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) {
4033 if (k->is_instance_klass()) {
4034 if (k->is_loaded()) {
4035 if (k->is_interface() && interface_handling == ignore_interfaces) {
4036 assert(interface, "no interface expected");
4037 k = ciEnv::current()->Object_klass();
4038 const TypeInterfaces* interfaces = TypeInterfaces::make();
4039 return interfaces;
4040 }
4041 GrowableArray<ciInstanceKlass *>* k_interfaces = k->as_instance_klass()->transitive_interfaces();
4042 const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces);
4043 if (k->is_interface()) {
4044 assert(interface, "no interface expected");
4045 k = ciEnv::current()->Object_klass();
4046 } else {
4047 assert(klass, "no instance klass expected");
4048 }
4049 return interfaces;
4050 }
4051 const TypeInterfaces* interfaces = TypeInterfaces::make();
4052 return interfaces;
4053 }
4054 assert(array, "no array expected");
4055 assert(k->is_array_klass(), "Not an array?");
4056 ciType* e = k->as_array_klass()->base_element_type();
4057 if (e->is_loaded() && e->is_instance_klass() && e->as_instance_klass()->is_interface()) {
4058 if (interface_handling == ignore_interfaces) {
4059 k = ciObjArrayKlass::make(ciEnv::current()->Object_klass(), k->as_array_klass()->dimension());
4060 }
4061 }
4062 return TypeAryPtr::_array_interfaces;
4063 }
4064
4065 //------------------------------cast_to_ptr_type-------------------------------
4066 const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
4067 if( ptr == _ptr ) return this;
4068 // Reconstruct _sig info here since not a problem with later lazy
4069 // construction, _sig will show up on demand.
4070 return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _instance_id, _speculative, _inline_depth);
4071 }
4072
4073
4074 //-----------------------------cast_to_exactness-------------------------------
4075 const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
4076 if( klass_is_exact == _klass_is_exact ) return this;
4077 if (!_klass->is_loaded()) return this;
4078 ciInstanceKlass* ik = _klass->as_instance_klass();
4079 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
4080 assert(!ik->is_interface(), "no interface here");
4081 return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth);
4082 }
4083
4084 //-----------------------------cast_to_instance_id----------------------------
4085 const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const {
4086 if( instance_id == _instance_id ) return this;
4087 return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth);
4088 }
4089
4090 //------------------------------xmeet_unloaded---------------------------------
4091 // Compute the MEET of two InstPtrs when at least one is unloaded.
4092 // Assume classes are different since called after check for same name/class-loader
4093 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const {
4094 int off = meet_offset(tinst->offset());
4095 PTR ptr = meet_ptr(tinst->ptr());
4096 int instance_id = meet_instance_id(tinst->instance_id());
4097 const TypePtr* speculative = xmeet_speculative(tinst);
4098 int depth = meet_inline_depth(tinst->inline_depth());
4099
4100 const TypeInstPtr *loaded = is_loaded() ? this : tinst;
4101 const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
4102 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
4103 //
4104 // Meet unloaded class with java/lang/Object
4105 //
4106 // Meet
4107 // | Unloaded Class
4108 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
4109 // ===================================================================
4110 // TOP | ..........................Unloaded......................|
4111 // AnyNull | U-AN |................Unloaded......................|
4112 // Constant | ... O-NN .................................. | O-BOT |
4113 // NotNull | ... O-NN .................................. | O-BOT |
4114 // BOTTOM | ........................Object-BOTTOM ..................|
4115 //
4116 assert(loaded->ptr() != TypePtr::Null, "insanity check");
4117 //
4118 if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4119 else if (loaded->ptr() == TypePtr::AnyNull) { return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, instance_id, speculative, depth); }
4120 else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4121 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
4122 if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); }
4123 else { return TypeInstPtr::NOTNULL->with_speculative(speculative); }
4124 }
4125 else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); }
4126
4127 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative);
4128 }
4129
4130 // Both are unloaded, not the same class, not Object
4131 // Or meet unloaded with a different loaded class, not java/lang/Object
4132 if (ptr != TypePtr::BotPTR) {
4133 return TypeInstPtr::NOTNULL->with_speculative(speculative);
4134 }
4135 return TypeInstPtr::BOTTOM->with_speculative(speculative);
4136 }
4137
4138
4139 //------------------------------meet-------------------------------------------
4140 // Compute the MEET of two types. It returns a new Type object.
4141 const Type *TypeInstPtr::xmeet_helper(const Type *t) const {
4142 // Perform a fast test for common case; meeting the same types together.
4143 if( this == t ) return this; // Meeting same type-rep?
4144
4145 // Current "this->_base" is Pointer
4146 switch (t->base()) { // switch on original type
4147
4148 case Int: // Mixing ints & oops happens when javac
4149 case Long: // reuses local variables
4150 case HalfFloatTop:
4151 case HalfFloatCon:
4152 case HalfFloatBot:
4153 case FloatTop:
4154 case FloatCon:
4155 case FloatBot:
4156 case DoubleTop:
4157 case DoubleCon:
4158 case DoubleBot:
4159 case NarrowOop:
4160 case NarrowKlass:
4161 case Bottom: // Ye Olde Default
4162 return Type::BOTTOM;
4163 case Top:
4164 return this;
4165
4166 default: // All else is a mistake
4167 typerr(t);
4168
4169 case MetadataPtr:
4170 case KlassPtr:
4171 case InstKlassPtr:
4172 case AryKlassPtr:
4173 case RawPtr: return TypePtr::BOTTOM;
4174
4175 case AryPtr: { // All arrays inherit from Object class
4176 // Call in reverse direction to avoid duplication
4177 return t->is_aryptr()->xmeet_helper(this);
4178 }
4179
4180 case OopPtr: { // Meeting to OopPtrs
4181 // Found a OopPtr type vs self-InstPtr type
4182 const TypeOopPtr *tp = t->is_oopptr();
4183 int offset = meet_offset(tp->offset());
4184 PTR ptr = meet_ptr(tp->ptr());
4185 switch (tp->ptr()) {
4186 case TopPTR:
4187 case AnyNull: {
4188 int instance_id = meet_instance_id(InstanceTop);
4189 const TypePtr* speculative = xmeet_speculative(tp);
4190 int depth = meet_inline_depth(tp->inline_depth());
4191 return make(ptr, klass(), _interfaces, klass_is_exact(),
4192 (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth);
4193 }
4194 case NotNull:
4195 case BotPTR: {
4196 int instance_id = meet_instance_id(tp->instance_id());
4197 const TypePtr* speculative = xmeet_speculative(tp);
4198 int depth = meet_inline_depth(tp->inline_depth());
4199 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4200 }
4201 default: typerr(t);
4202 }
4203 }
4204
4205 case AnyPtr: { // Meeting to AnyPtrs
4206 // Found an AnyPtr type vs self-InstPtr type
4207 const TypePtr *tp = t->is_ptr();
4208 int offset = meet_offset(tp->offset());
4209 PTR ptr = meet_ptr(tp->ptr());
4210 int instance_id = meet_instance_id(InstanceTop);
4211 const TypePtr* speculative = xmeet_speculative(tp);
4212 int depth = meet_inline_depth(tp->inline_depth());
4213 switch (tp->ptr()) {
4214 case Null:
4215 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4216 // else fall through to AnyNull
4217 case TopPTR:
4218 case AnyNull: {
4219 return make(ptr, klass(), _interfaces, klass_is_exact(),
4220 (ptr == Constant ? const_oop() : nullptr), offset, instance_id, speculative, depth);
4221 }
4222 case NotNull:
4223 case BotPTR:
4224 return TypePtr::make(AnyPtr, ptr, offset, speculative,depth);
4225 default: typerr(t);
4226 }
4227 }
4228
4229 /*
4230 A-top }
4231 / | \ } Tops
4232 B-top A-any C-top }
4233 | / | \ | } Any-nulls
4234 B-any | C-any }
4235 | | |
4236 B-con A-con C-con } constants; not comparable across classes
4237 | | |
4238 B-not | C-not }
4239 | \ | / | } not-nulls
4240 B-bot A-not C-bot }
4241 \ | / } Bottoms
4242 A-bot }
4243 */
4244
4245 case InstPtr: { // Meeting 2 Oops?
4246 // Found an InstPtr sub-type vs self-InstPtr type
4247 const TypeInstPtr *tinst = t->is_instptr();
4248 int off = meet_offset(tinst->offset());
4249 PTR ptr = meet_ptr(tinst->ptr());
4250 int instance_id = meet_instance_id(tinst->instance_id());
4251 const TypePtr* speculative = xmeet_speculative(tinst);
4252 int depth = meet_inline_depth(tinst->inline_depth());
4253 const TypeInterfaces* interfaces = meet_interfaces(tinst);
4254
4255 ciKlass* tinst_klass = tinst->klass();
4256 ciKlass* this_klass = klass();
4257
4258 ciKlass* res_klass = nullptr;
4259 bool res_xk = false;
4260 const Type* res;
4261 MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk);
4262
4263 if (kind == UNLOADED) {
4264 // One of these classes has not been loaded
4265 const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces);
4266 #ifndef PRODUCT
4267 if (PrintOpto && Verbose) {
4268 tty->print("meet of unloaded classes resulted in: ");
4269 unloaded_meet->dump();
4270 tty->cr();
4271 tty->print(" this == ");
4272 dump();
4273 tty->cr();
4274 tty->print(" tinst == ");
4275 tinst->dump();
4276 tty->cr();
4277 }
4278 #endif
4279 res = unloaded_meet;
4280 } else {
4281 if (kind == NOT_SUBTYPE && instance_id > 0) {
4282 instance_id = InstanceBot;
4283 } else if (kind == LCA) {
4284 instance_id = InstanceBot;
4285 }
4286 ciObject* o = nullptr; // Assume not constant when done
4287 ciObject* this_oop = const_oop();
4288 ciObject* tinst_oop = tinst->const_oop();
4289 if (ptr == Constant) {
4290 if (this_oop != nullptr && tinst_oop != nullptr &&
4291 this_oop->equals(tinst_oop))
4292 o = this_oop;
4293 else if (above_centerline(_ptr)) {
4294 assert(!tinst_klass->is_interface(), "");
4295 o = tinst_oop;
4296 } else if (above_centerline(tinst->_ptr)) {
4297 assert(!this_klass->is_interface(), "");
4298 o = this_oop;
4299 } else
4300 ptr = NotNull;
4301 }
4302 res = make(ptr, res_klass, interfaces, res_xk, o, off, instance_id, speculative, depth);
4303 }
4304
4305 return res;
4306
4307 } // End of case InstPtr
4308
4309 } // End of switch
4310 return this; // Return the double constant
4311 }
4312
4313 template<class T> TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type,
4314 ciKlass*& res_klass, bool& res_xk) {
4315 ciKlass* this_klass = this_type->klass();
4316 ciKlass* other_klass = other_type->klass();
4317 bool this_xk = this_type->klass_is_exact();
4318 bool other_xk = other_type->klass_is_exact();
4319 PTR this_ptr = this_type->ptr();
4320 PTR other_ptr = other_type->ptr();
4321 const TypeInterfaces* this_interfaces = this_type->interfaces();
4322 const TypeInterfaces* other_interfaces = other_type->interfaces();
4323 // Check for easy case; klasses are equal (and perhaps not loaded!)
4324 // If we have constants, then we created oops so classes are loaded
4325 // and we can handle the constants further down. This case handles
4326 // both-not-loaded or both-loaded classes
4327 if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) {
4328 res_klass = this_klass;
4329 res_xk = this_xk;
4330 return QUICK;
4331 }
4332
4333 // Classes require inspection in the Java klass hierarchy. Must be loaded.
4334 if (!other_klass->is_loaded() || !this_klass->is_loaded()) {
4335 return UNLOADED;
4336 }
4337
4338 // !!! Here's how the symmetry requirement breaks down into invariants:
4339 // If we split one up & one down AND they subtype, take the down man.
4340 // If we split one up & one down AND they do NOT subtype, "fall hard".
4341 // If both are up and they subtype, take the subtype class.
4342 // If both are up and they do NOT subtype, "fall hard".
4343 // If both are down and they subtype, take the supertype class.
4344 // If both are down and they do NOT subtype, "fall hard".
4345 // Constants treated as down.
4346
4347 // Now, reorder the above list; observe that both-down+subtype is also
4348 // "fall hard"; "fall hard" becomes the default case:
4349 // If we split one up & one down AND they subtype, take the down man.
4350 // If both are up and they subtype, take the subtype class.
4351
4352 // If both are down and they subtype, "fall hard".
4353 // If both are down and they do NOT subtype, "fall hard".
4354 // If both are up and they do NOT subtype, "fall hard".
4355 // If we split one up & one down AND they do NOT subtype, "fall hard".
4356
4357 // If a proper subtype is exact, and we return it, we return it exactly.
4358 // If a proper supertype is exact, there can be no subtyping relationship!
4359 // If both types are equal to the subtype, exactness is and-ed below the
4360 // centerline and or-ed above it. (N.B. Constants are always exact.)
4361
4362 // Check for subtyping:
4363 const T* subtype = nullptr;
4364 bool subtype_exact = false;
4365 if (this_type->is_same_java_type_as(other_type)) {
4366 subtype = this_type;
4367 subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk);
4368 } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) {
4369 subtype = this_type; // Pick subtyping class
4370 subtype_exact = this_xk;
4371 } else if(!this_xk && other_type->is_meet_subtype_of(this_type)) {
4372 subtype = other_type; // Pick subtyping class
4373 subtype_exact = other_xk;
4374 }
4375
4376 if (subtype) {
4377 if (above_centerline(ptr)) { // both are up?
4378 this_type = other_type = subtype;
4379 this_xk = other_xk = subtype_exact;
4380 } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) {
4381 this_type = other_type; // tinst is down; keep down man
4382 this_xk = other_xk;
4383 } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) {
4384 other_type = this_type; // this is down; keep down man
4385 other_xk = this_xk;
4386 } else {
4387 this_xk = subtype_exact; // either they are equal, or we'll do an LCA
4388 }
4389 }
4390
4391 // Check for classes now being equal
4392 if (this_type->is_same_java_type_as(other_type)) {
4393 // If the klasses are equal, the constants may still differ. Fall to
4394 // NotNull if they do (neither constant is null; that is a special case
4395 // handled elsewhere).
4396 res_klass = this_type->klass();
4397 res_xk = this_xk;
4398 return SUBTYPE;
4399 } // Else classes are not equal
4400
4401 // Since klasses are different, we require a LCA in the Java
4402 // class hierarchy - which means we have to fall to at least NotNull.
4403 if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) {
4404 ptr = NotNull;
4405 }
4406
4407 interfaces = this_interfaces->intersection_with(other_interfaces);
4408
4409 // Now we find the LCA of Java classes
4410 ciKlass* k = this_klass->least_common_ancestor(other_klass);
4411
4412 res_klass = k;
4413 res_xk = false;
4414
4415 return LCA;
4416 }
4417
4418 //------------------------java_mirror_type--------------------------------------
4419 ciType* TypeInstPtr::java_mirror_type() const {
4420 // must be a singleton type
4421 if( const_oop() == nullptr ) return nullptr;
4422
4423 // must be of type java.lang.Class
4424 if( klass() != ciEnv::current()->Class_klass() ) return nullptr;
4425
4426 return const_oop()->as_instance()->java_mirror_type();
4427 }
4428
4429
4430 //------------------------------xdual------------------------------------------
4431 // Dual: do NOT dual on klasses. This means I do NOT understand the Java
4432 // inheritance mechanism.
4433 const Type *TypeInstPtr::xdual() const {
4434 return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
4435 }
4436
4437 //------------------------------eq---------------------------------------------
4438 // Structural equality check for Type representations
4439 bool TypeInstPtr::eq( const Type *t ) const {
4440 const TypeInstPtr *p = t->is_instptr();
4441 return
4442 klass()->equals(p->klass()) &&
4443 _interfaces->eq(p->_interfaces) &&
4444 TypeOopPtr::eq(p); // Check sub-type stuff
4445 }
4446
4447 //------------------------------hash-------------------------------------------
4448 // Type-specific hashing function.
4449 uint TypeInstPtr::hash(void) const {
4450 return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash();
4451 }
4452
4453 bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4454 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4455 }
4456
4457
4458 bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4459 return TypePtr::is_same_java_type_as_helper_for_instance(this, other);
4460 }
4461
4462 bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4463 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
4464 }
4465
4466
4467 //------------------------------dump2------------------------------------------
4468 // Dump oop Type
4469 #ifndef PRODUCT
4470 void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const {
4471 // Print the name of the klass.
4472 st->print("instptr:");
4473 klass()->print_name_on(st);
4474 _interfaces->dump(st);
4475
4476 if (_ptr == Constant && (WizardMode || Verbose)) {
4477 ResourceMark rm;
4478 stringStream ss;
4479
4480 st->print(" ");
4481 const_oop()->print_oop(&ss);
4482 // 'const_oop->print_oop()' may emit newlines('\n') into ss.
4483 // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node.
4484 char* buf = ss.as_string(/* c_heap= */false);
4485 StringUtils::replace_no_expand(buf, "\n", "");
4486 st->print_raw(buf);
4487 }
4488
4489 st->print(":%s", ptr_msg[_ptr]);
4490 if (_klass_is_exact) {
4491 st->print(":exact");
4492 }
4493
4494 dump_offset(st);
4495 dump_instance_id(st);
4496 dump_inline_depth(st);
4497 dump_speculative(st);
4498 }
4499 #endif
4500
4501 //------------------------------add_offset-------------------------------------
4502 const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const {
4503 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset),
4504 _instance_id, add_offset_speculative(offset), _inline_depth);
4505 }
4506
4507 const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const {
4508 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), offset,
4509 _instance_id, with_offset_speculative(offset), _inline_depth);
4510 }
4511
4512 const TypeInstPtr* TypeInstPtr::remove_speculative() const {
4513 if (_speculative == nullptr) {
4514 return this;
4515 }
4516 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4517 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset,
4518 _instance_id, nullptr, _inline_depth);
4519 }
4520
4521 const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const {
4522 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, speculative, _inline_depth);
4523 }
4524
4525 const TypePtr* TypeInstPtr::with_inline_depth(int depth) const {
4526 if (!UseInlineDepthForSpeculativeTypes) {
4527 return this;
4528 }
4529 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth);
4530 }
4531
4532 const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const {
4533 assert(is_known_instance(), "should be known");
4534 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, instance_id, _speculative, _inline_depth);
4535 }
4536
4537 const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const {
4538 bool xk = klass_is_exact();
4539 ciInstanceKlass* ik = klass()->as_instance_klass();
4540 if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) {
4541 if (_interfaces->eq(ik)) {
4542 Compile* C = Compile::current();
4543 Dependencies* deps = C->dependencies();
4544 deps->assert_leaf_type(ik);
4545 xk = true;
4546 }
4547 }
4548 return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, 0);
4549 }
4550
4551 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) {
4552 static_assert(std::is_base_of<T2, T1>::value, "");
4553
4554 if (!this_one->is_instance_type(other)) {
4555 return false;
4556 }
4557
4558 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4559 return true;
4560 }
4561
4562 return this_one->klass()->is_subtype_of(other->klass()) &&
4563 (!this_xk || this_one->_interfaces->contains(other->_interfaces));
4564 }
4565
4566
4567 bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4568 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4569 }
4570
4571 template <class T1, class T2> bool TypePtr::is_meet_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_xk, bool other_xk) {
4572 static_assert(std::is_base_of<T2, T1>::value, "");
4573 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) {
4574 return true;
4575 }
4576
4577 if (this_one->is_instance_type(other)) {
4578 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces);
4579 }
4580
4581 int dummy;
4582 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
4583 if (this_top_or_bottom) {
4584 return false;
4585 }
4586
4587 const T1* other_ary = this_one->is_array_type(other);
4588 const TypePtr* other_elem = other_ary->elem()->make_ptr();
4589 const TypePtr* this_elem = this_one->elem()->make_ptr();
4590 if (other_elem != nullptr && this_elem != nullptr) {
4591 return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk);
4592 }
4593
4594 if (other_elem == nullptr && this_elem == nullptr) {
4595 return this_one->klass()->is_subtype_of(other->klass());
4596 }
4597
4598 return false;
4599 }
4600
4601 bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const {
4602 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4603 }
4604
4605 bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4606 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk);
4607 }
4608
4609 bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const {
4610 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk);
4611 }
4612
4613 //=============================================================================
4614 // Convenience common pre-built types.
4615 const TypeAryPtr* TypeAryPtr::BOTTOM;
4616 const TypeAryPtr* TypeAryPtr::RANGE;
4617 const TypeAryPtr* TypeAryPtr::OOPS;
4618 const TypeAryPtr* TypeAryPtr::NARROWOOPS;
4619 const TypeAryPtr* TypeAryPtr::BYTES;
4620 const TypeAryPtr* TypeAryPtr::SHORTS;
4621 const TypeAryPtr* TypeAryPtr::CHARS;
4622 const TypeAryPtr* TypeAryPtr::INTS;
4623 const TypeAryPtr* TypeAryPtr::LONGS;
4624 const TypeAryPtr* TypeAryPtr::FLOATS;
4625 const TypeAryPtr* TypeAryPtr::DOUBLES;
4626
4627 //------------------------------make-------------------------------------------
4628 const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset,
4629 int instance_id, const TypePtr* speculative, int inline_depth) {
4630 assert(!(k == nullptr && ary->_elem->isa_int()),
4631 "integral arrays must be pre-equipped with a class");
4632 if (!xk) xk = ary->ary_must_be_exact();
4633 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4634 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
4635 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
4636 k = nullptr;
4637 }
4638 return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons();
4639 }
4640
4641 //------------------------------make-------------------------------------------
4642 const TypeAryPtr *TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset,
4643 int instance_id, const TypePtr* speculative, int inline_depth,
4644 bool is_autobox_cache) {
4645 assert(!(k == nullptr && ary->_elem->isa_int()),
4646 "integral arrays must be pre-equipped with a class");
4647 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
4648 if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact();
4649 assert(instance_id <= 0 || xk, "instances are always exactly typed");
4650 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() &&
4651 k->as_obj_array_klass()->base_element_klass()->is_interface()) {
4652 k = nullptr;
4653 }
4654 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons();
4655 }
4656
4657 //------------------------------cast_to_ptr_type-------------------------------
4658 const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
4659 if( ptr == _ptr ) return this;
4660 return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4661 }
4662
4663
4664 //-----------------------------cast_to_exactness-------------------------------
4665 const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
4666 if( klass_is_exact == _klass_is_exact ) return this;
4667 if (_ary->ary_must_be_exact()) return this; // cannot clear xk
4668 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
4669 }
4670
4671 //-----------------------------cast_to_instance_id----------------------------
4672 const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const {
4673 if( instance_id == _instance_id ) return this;
4674 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
4675 }
4676
4677
4678 //-----------------------------max_array_length-------------------------------
4679 // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization.
4680 jint TypeAryPtr::max_array_length(BasicType etype) {
4681 if (!is_java_primitive(etype) && !::is_reference_type(etype)) {
4682 if (etype == T_NARROWOOP) {
4683 etype = T_OBJECT;
4684 } else if (etype == T_ILLEGAL) { // bottom[]
4685 etype = T_BYTE; // will produce conservatively high value
4686 } else {
4687 fatal("not an element type: %s", type2name(etype));
4688 }
4689 }
4690 return arrayOopDesc::max_array_length(etype);
4691 }
4692
4693 //-----------------------------narrow_size_type-------------------------------
4694 // Narrow the given size type to the index range for the given array base type.
4695 // Return null if the resulting int type becomes empty.
4696 const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const {
4697 jint hi = size->_hi;
4698 jint lo = size->_lo;
4699 jint min_lo = 0;
4700 jint max_hi = max_array_length(elem()->array_element_basic_type());
4701 //if (index_not_size) --max_hi; // type of a valid array index, FTR
4702 bool chg = false;
4703 if (lo < min_lo) {
4704 lo = min_lo;
4705 if (size->is_con()) {
4706 hi = lo;
4707 }
4708 chg = true;
4709 }
4710 if (hi > max_hi) {
4711 hi = max_hi;
4712 if (size->is_con()) {
4713 lo = hi;
4714 }
4715 chg = true;
4716 }
4717 // Negative length arrays will produce weird intermediate dead fast-path code
4718 if (lo > hi) {
4719 return TypeInt::ZERO;
4720 }
4721 if (!chg) {
4722 return size;
4723 }
4724 return TypeInt::make(lo, hi, Type::WidenMin);
4725 }
4726
4727 //-------------------------------cast_to_size----------------------------------
4728 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
4729 assert(new_size != nullptr, "");
4730 new_size = narrow_size_type(new_size);
4731 if (new_size == size()) return this;
4732 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable());
4733 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4734 }
4735
4736 //------------------------------cast_to_stable---------------------------------
4737 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const {
4738 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable()))
4739 return this;
4740
4741 const Type* elem = this->elem();
4742 const TypePtr* elem_ptr = elem->make_ptr();
4743
4744 if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) {
4745 // If this is widened from a narrow oop, TypeAry::make will re-narrow it.
4746 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1);
4747 }
4748
4749 const TypeAry* new_ary = TypeAry::make(elem, size(), stable);
4750
4751 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
4752 }
4753
4754 //-----------------------------stable_dimension--------------------------------
4755 int TypeAryPtr::stable_dimension() const {
4756 if (!is_stable()) return 0;
4757 int dim = 1;
4758 const TypePtr* elem_ptr = elem()->make_ptr();
4759 if (elem_ptr != nullptr && elem_ptr->isa_aryptr())
4760 dim += elem_ptr->is_aryptr()->stable_dimension();
4761 return dim;
4762 }
4763
4764 //----------------------cast_to_autobox_cache-----------------------------------
4765 const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const {
4766 if (is_autobox_cache()) return this;
4767 const TypeOopPtr* etype = elem()->make_oopptr();
4768 if (etype == nullptr) return this;
4769 // The pointers in the autobox arrays are always non-null.
4770 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
4771 const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable());
4772 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true);
4773 }
4774
4775 //------------------------------eq---------------------------------------------
4776 // Structural equality check for Type representations
4777 bool TypeAryPtr::eq( const Type *t ) const {
4778 const TypeAryPtr *p = t->is_aryptr();
4779 return
4780 _ary == p->_ary && // Check array
4781 TypeOopPtr::eq(p); // Check sub-parts
4782 }
4783
4784 //------------------------------hash-------------------------------------------
4785 // Type-specific hashing function.
4786 uint TypeAryPtr::hash(void) const {
4787 return (uint)(uintptr_t)_ary + TypeOopPtr::hash();
4788 }
4789
4790 bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4791 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
4792 }
4793
4794 bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const {
4795 return TypePtr::is_same_java_type_as_helper_for_array(this, other);
4796 }
4797
4798 bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const {
4799 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
4800 }
4801 //------------------------------meet-------------------------------------------
4802 // Compute the MEET of two types. It returns a new Type object.
4803 const Type *TypeAryPtr::xmeet_helper(const Type *t) const {
4804 // Perform a fast test for common case; meeting the same types together.
4805 if( this == t ) return this; // Meeting same type-rep?
4806 // Current "this->_base" is Pointer
4807 switch (t->base()) { // switch on original type
4808
4809 // Mixing ints & oops happens when javac reuses local variables
4810 case Int:
4811 case Long:
4812 case HalfFloatTop:
4813 case HalfFloatCon:
4814 case HalfFloatBot:
4815 case FloatTop:
4816 case FloatCon:
4817 case FloatBot:
4818 case DoubleTop:
4819 case DoubleCon:
4820 case DoubleBot:
4821 case NarrowOop:
4822 case NarrowKlass:
4823 case Bottom: // Ye Olde Default
4824 return Type::BOTTOM;
4825 case Top:
4826 return this;
4827
4828 default: // All else is a mistake
4829 typerr(t);
4830
4831 case OopPtr: { // Meeting to OopPtrs
4832 // Found a OopPtr type vs self-AryPtr type
4833 const TypeOopPtr *tp = t->is_oopptr();
4834 int offset = meet_offset(tp->offset());
4835 PTR ptr = meet_ptr(tp->ptr());
4836 int depth = meet_inline_depth(tp->inline_depth());
4837 const TypePtr* speculative = xmeet_speculative(tp);
4838 switch (tp->ptr()) {
4839 case TopPTR:
4840 case AnyNull: {
4841 int instance_id = meet_instance_id(InstanceTop);
4842 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4843 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4844 }
4845 case BotPTR:
4846 case NotNull: {
4847 int instance_id = meet_instance_id(tp->instance_id());
4848 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
4849 }
4850 default: ShouldNotReachHere();
4851 }
4852 }
4853
4854 case AnyPtr: { // Meeting two AnyPtrs
4855 // Found an AnyPtr type vs self-AryPtr type
4856 const TypePtr *tp = t->is_ptr();
4857 int offset = meet_offset(tp->offset());
4858 PTR ptr = meet_ptr(tp->ptr());
4859 const TypePtr* speculative = xmeet_speculative(tp);
4860 int depth = meet_inline_depth(tp->inline_depth());
4861 switch (tp->ptr()) {
4862 case TopPTR:
4863 return this;
4864 case BotPTR:
4865 case NotNull:
4866 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4867 case Null:
4868 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth);
4869 // else fall through to AnyNull
4870 case AnyNull: {
4871 int instance_id = meet_instance_id(InstanceTop);
4872 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4873 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4874 }
4875 default: ShouldNotReachHere();
4876 }
4877 }
4878
4879 case MetadataPtr:
4880 case KlassPtr:
4881 case InstKlassPtr:
4882 case AryKlassPtr:
4883 case RawPtr: return TypePtr::BOTTOM;
4884
4885 case AryPtr: { // Meeting 2 references?
4886 const TypeAryPtr *tap = t->is_aryptr();
4887 int off = meet_offset(tap->offset());
4888 const Type* tm = _ary->meet_speculative(tap->_ary);
4889 const TypeAry* tary = tm->isa_ary();
4890 if (tary == nullptr) {
4891 assert(tm == Type::TOP || tm == Type::BOTTOM, "");
4892 return tm;
4893 }
4894 PTR ptr = meet_ptr(tap->ptr());
4895 int instance_id = meet_instance_id(tap->instance_id());
4896 const TypePtr* speculative = xmeet_speculative(tap);
4897 int depth = meet_inline_depth(tap->inline_depth());
4898
4899 ciKlass* res_klass = nullptr;
4900 bool res_xk = false;
4901 const Type* elem = tary->_elem;
4902 if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk) == NOT_SUBTYPE) {
4903 instance_id = InstanceBot;
4904 }
4905
4906 ciObject* o = nullptr; // Assume not constant when done
4907 ciObject* this_oop = const_oop();
4908 ciObject* tap_oop = tap->const_oop();
4909 if (ptr == Constant) {
4910 if (this_oop != nullptr && tap_oop != nullptr &&
4911 this_oop->equals(tap_oop)) {
4912 o = tap_oop;
4913 } else if (above_centerline(_ptr)) {
4914 o = tap_oop;
4915 } else if (above_centerline(tap->_ptr)) {
4916 o = this_oop;
4917 } else {
4918 ptr = NotNull;
4919 }
4920 }
4921 return make(ptr, o, TypeAry::make(elem, tary->_size, tary->_stable), res_klass, res_xk, off, instance_id, speculative, depth);
4922 }
4923
4924 // All arrays inherit from Object class
4925 case InstPtr: {
4926 const TypeInstPtr *tp = t->is_instptr();
4927 int offset = meet_offset(tp->offset());
4928 PTR ptr = meet_ptr(tp->ptr());
4929 int instance_id = meet_instance_id(tp->instance_id());
4930 const TypePtr* speculative = xmeet_speculative(tp);
4931 int depth = meet_inline_depth(tp->inline_depth());
4932 const TypeInterfaces* interfaces = meet_interfaces(tp);
4933 const TypeInterfaces* tp_interfaces = tp->_interfaces;
4934 const TypeInterfaces* this_interfaces = _interfaces;
4935
4936 switch (ptr) {
4937 case TopPTR:
4938 case AnyNull: // Fall 'down' to dual of object klass
4939 // For instances when a subclass meets a superclass we fall
4940 // below the centerline when the superclass is exact. We need to
4941 // do the same here.
4942 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) {
4943 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4944 } else {
4945 // cannot subclass, so the meet has to fall badly below the centerline
4946 ptr = NotNull;
4947 instance_id = InstanceBot;
4948 interfaces = this_interfaces->intersection_with(tp_interfaces);
4949 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr,offset, instance_id, speculative, depth);
4950 }
4951 case Constant:
4952 case NotNull:
4953 case BotPTR: // Fall down to object klass
4954 // LCA is object_klass, but if we subclass from the top we can do better
4955 if (above_centerline(tp->ptr())) {
4956 // If 'tp' is above the centerline and it is Object class
4957 // then we can subclass in the Java class hierarchy.
4958 // For instances when a subclass meets a superclass we fall
4959 // below the centerline when the superclass is exact. We need
4960 // to do the same here.
4961 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && !tp->klass_is_exact()) {
4962 // that is, my array type is a subtype of 'tp' klass
4963 return make(ptr, (ptr == Constant ? const_oop() : nullptr),
4964 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4965 }
4966 }
4967 // The other case cannot happen, since t cannot be a subtype of an array.
4968 // The meet falls down to Object class below centerline.
4969 if (ptr == Constant) {
4970 ptr = NotNull;
4971 }
4972 if (instance_id > 0) {
4973 instance_id = InstanceBot;
4974 }
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 default: typerr(t);
4978 }
4979 }
4980 }
4981 return this; // Lint noise
4982 }
4983
4984
4985 template<class T> TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary,
4986 const T* other_ary, ciKlass*& res_klass, bool& res_xk) {
4987 int dummy;
4988 bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM);
4989 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
4990 ciKlass* this_klass = this_ary->klass();
4991 ciKlass* other_klass = other_ary->klass();
4992 bool this_xk = this_ary->klass_is_exact();
4993 bool other_xk = other_ary->klass_is_exact();
4994 PTR this_ptr = this_ary->ptr();
4995 PTR other_ptr = other_ary->ptr();
4996 res_klass = nullptr;
4997 MeetResult result = SUBTYPE;
4998 if (elem->isa_int()) {
4999 // Integral array element types have irrelevant lattice relations.
5000 // It is the klass that determines array layout, not the element type.
5001 if (this_top_or_bottom)
5002 res_klass = other_klass;
5003 else if (other_top_or_bottom || other_klass == this_klass) {
5004 res_klass = this_klass;
5005 } else {
5006 // Something like byte[int+] meets char[int+].
5007 // This must fall to bottom, not (int[-128..65535])[int+].
5008 // instance_id = InstanceBot;
5009 elem = Type::BOTTOM;
5010 result = NOT_SUBTYPE;
5011 if (above_centerline(ptr) || ptr == Constant) {
5012 ptr = NotNull;
5013 res_xk = false;
5014 return NOT_SUBTYPE;
5015 }
5016 }
5017 } else {// Non integral arrays.
5018 // Must fall to bottom if exact klasses in upper lattice
5019 // are not equal or super klass is exact.
5020 if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) &&
5021 // meet with top[] and bottom[] are processed further down:
5022 !this_top_or_bottom && !other_top_or_bottom &&
5023 // both are exact and not equal:
5024 ((other_xk && this_xk) ||
5025 // 'tap' is exact and super or unrelated:
5026 (other_xk && !other_ary->is_meet_subtype_of(this_ary)) ||
5027 // 'this' is exact and super or unrelated:
5028 (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) {
5029 if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) {
5030 elem = Type::BOTTOM;
5031 }
5032 ptr = NotNull;
5033 res_xk = false;
5034 return NOT_SUBTYPE;
5035 }
5036 }
5037
5038 res_xk = false;
5039 switch (other_ptr) {
5040 case AnyNull:
5041 case TopPTR:
5042 // Compute new klass on demand, do not use tap->_klass
5043 if (below_centerline(this_ptr)) {
5044 res_xk = this_xk;
5045 } else {
5046 res_xk = (other_xk || this_xk);
5047 }
5048 return result;
5049 case Constant: {
5050 if (this_ptr == Constant) {
5051 res_xk = true;
5052 } else if(above_centerline(this_ptr)) {
5053 res_xk = true;
5054 } else {
5055 // Only precise for identical arrays
5056 res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom));
5057 }
5058 return result;
5059 }
5060 case NotNull:
5061 case BotPTR:
5062 // Compute new klass on demand, do not use tap->_klass
5063 if (above_centerline(this_ptr)) {
5064 res_xk = other_xk;
5065 } else {
5066 res_xk = (other_xk && this_xk) &&
5067 (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays
5068 }
5069 return result;
5070 default: {
5071 ShouldNotReachHere();
5072 return result;
5073 }
5074 }
5075 return result;
5076 }
5077
5078
5079 //------------------------------xdual------------------------------------------
5080 // Dual: compute field-by-field dual
5081 const Type *TypeAryPtr::xdual() const {
5082 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());
5083 }
5084
5085 //------------------------------dump2------------------------------------------
5086 #ifndef PRODUCT
5087 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5088 st->print("aryptr:");
5089 _ary->dump2(d, depth, st);
5090 _interfaces->dump(st);
5091
5092 if (_ptr == Constant) {
5093 const_oop()->print(st);
5094 }
5095
5096 st->print(":%s", ptr_msg[_ptr]);
5097 if (_klass_is_exact) {
5098 st->print(":exact");
5099 }
5100
5101 if( _offset != 0 ) {
5102 BasicType basic_elem_type = elem()->basic_type();
5103 int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
5104 if( _offset == OffsetTop ) st->print("+undefined");
5105 else if( _offset == OffsetBot ) st->print("+any");
5106 else if( _offset < header_size ) st->print("+%d", _offset);
5107 else {
5108 if (basic_elem_type == T_ILLEGAL) {
5109 st->print("+any");
5110 } else {
5111 int elem_size = type2aelembytes(basic_elem_type);
5112 st->print("[%d]", (_offset - header_size)/elem_size);
5113 }
5114 }
5115 }
5116
5117 dump_instance_id(st);
5118 dump_inline_depth(st);
5119 dump_speculative(st);
5120 }
5121 #endif
5122
5123 bool TypeAryPtr::empty(void) const {
5124 if (_ary->empty()) return true;
5125 return TypeOopPtr::empty();
5126 }
5127
5128 //------------------------------add_offset-------------------------------------
5129 const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const {
5130 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
5131 }
5132
5133 const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const {
5134 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, offset, _instance_id, with_offset_speculative(offset), _inline_depth);
5135 }
5136
5137 const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const {
5138 return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
5139 }
5140
5141 const TypeAryPtr* TypeAryPtr::remove_speculative() const {
5142 if (_speculative == nullptr) {
5143 return this;
5144 }
5145 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
5146 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, nullptr, _inline_depth);
5147 }
5148
5149 const TypePtr* TypeAryPtr::with_inline_depth(int depth) const {
5150 if (!UseInlineDepthForSpeculativeTypes) {
5151 return this;
5152 }
5153 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth);
5154 }
5155
5156 const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const {
5157 assert(is_known_instance(), "should be known");
5158 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
5159 }
5160
5161 //=============================================================================
5162
5163 //------------------------------hash-------------------------------------------
5164 // Type-specific hashing function.
5165 uint TypeNarrowPtr::hash(void) const {
5166 return _ptrtype->hash() + 7;
5167 }
5168
5169 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton
5170 return _ptrtype->singleton();
5171 }
5172
5173 bool TypeNarrowPtr::empty(void) const {
5174 return _ptrtype->empty();
5175 }
5176
5177 intptr_t TypeNarrowPtr::get_con() const {
5178 return _ptrtype->get_con();
5179 }
5180
5181 bool TypeNarrowPtr::eq( const Type *t ) const {
5182 const TypeNarrowPtr* tc = isa_same_narrowptr(t);
5183 if (tc != nullptr) {
5184 if (_ptrtype->base() != tc->_ptrtype->base()) {
5185 return false;
5186 }
5187 return tc->_ptrtype->eq(_ptrtype);
5188 }
5189 return false;
5190 }
5191
5192 const Type *TypeNarrowPtr::xdual() const { // Compute dual right now.
5193 const TypePtr* odual = _ptrtype->dual()->is_ptr();
5194 return make_same_narrowptr(odual);
5195 }
5196
5197
5198 const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const {
5199 if (isa_same_narrowptr(kills)) {
5200 const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative);
5201 if (ft->empty())
5202 return Type::TOP; // Canonical empty value
5203 if (ft->isa_ptr()) {
5204 return make_hash_same_narrowptr(ft->isa_ptr());
5205 }
5206 return ft;
5207 } else if (kills->isa_ptr()) {
5208 const Type* ft = _ptrtype->join_helper(kills, include_speculative);
5209 if (ft->empty())
5210 return Type::TOP; // Canonical empty value
5211 return ft;
5212 } else {
5213 return Type::TOP;
5214 }
5215 }
5216
5217 //------------------------------xmeet------------------------------------------
5218 // Compute the MEET of two types. It returns a new Type object.
5219 const Type *TypeNarrowPtr::xmeet( const Type *t ) const {
5220 // Perform a fast test for common case; meeting the same types together.
5221 if( this == t ) return this; // Meeting same type-rep?
5222
5223 if (t->base() == base()) {
5224 const Type* result = _ptrtype->xmeet(t->make_ptr());
5225 if (result->isa_ptr()) {
5226 return make_hash_same_narrowptr(result->is_ptr());
5227 }
5228 return result;
5229 }
5230
5231 // Current "this->_base" is NarrowKlass or NarrowOop
5232 switch (t->base()) { // switch on original type
5233
5234 case Int: // Mixing ints & oops happens when javac
5235 case Long: // reuses local variables
5236 case HalfFloatTop:
5237 case HalfFloatCon:
5238 case HalfFloatBot:
5239 case FloatTop:
5240 case FloatCon:
5241 case FloatBot:
5242 case DoubleTop:
5243 case DoubleCon:
5244 case DoubleBot:
5245 case AnyPtr:
5246 case RawPtr:
5247 case OopPtr:
5248 case InstPtr:
5249 case AryPtr:
5250 case MetadataPtr:
5251 case KlassPtr:
5252 case InstKlassPtr:
5253 case AryKlassPtr:
5254 case NarrowOop:
5255 case NarrowKlass:
5256
5257 case Bottom: // Ye Olde Default
5258 return Type::BOTTOM;
5259 case Top:
5260 return this;
5261
5262 default: // All else is a mistake
5263 typerr(t);
5264
5265 } // End of switch
5266
5267 return this;
5268 }
5269
5270 #ifndef PRODUCT
5271 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
5272 _ptrtype->dump2(d, depth, st);
5273 }
5274 #endif
5275
5276 const TypeNarrowOop *TypeNarrowOop::BOTTOM;
5277 const TypeNarrowOop *TypeNarrowOop::NULL_PTR;
5278
5279
5280 const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) {
5281 return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons();
5282 }
5283
5284 const TypeNarrowOop* TypeNarrowOop::remove_speculative() const {
5285 return make(_ptrtype->remove_speculative()->is_ptr());
5286 }
5287
5288 const Type* TypeNarrowOop::cleanup_speculative() const {
5289 return make(_ptrtype->cleanup_speculative()->is_ptr());
5290 }
5291
5292 #ifndef PRODUCT
5293 void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const {
5294 st->print("narrowoop: ");
5295 TypeNarrowPtr::dump2(d, depth, st);
5296 }
5297 #endif
5298
5299 const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR;
5300
5301 const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) {
5302 return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons();
5303 }
5304
5305 #ifndef PRODUCT
5306 void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const {
5307 st->print("narrowklass: ");
5308 TypeNarrowPtr::dump2(d, depth, st);
5309 }
5310 #endif
5311
5312
5313 //------------------------------eq---------------------------------------------
5314 // Structural equality check for Type representations
5315 bool TypeMetadataPtr::eq( const Type *t ) const {
5316 const TypeMetadataPtr *a = (const TypeMetadataPtr*)t;
5317 ciMetadata* one = metadata();
5318 ciMetadata* two = a->metadata();
5319 if (one == nullptr || two == nullptr) {
5320 return (one == two) && TypePtr::eq(t);
5321 } else {
5322 return one->equals(two) && TypePtr::eq(t);
5323 }
5324 }
5325
5326 //------------------------------hash-------------------------------------------
5327 // Type-specific hashing function.
5328 uint TypeMetadataPtr::hash(void) const {
5329 return
5330 (metadata() ? metadata()->hash() : 0) +
5331 TypePtr::hash();
5332 }
5333
5334 //------------------------------singleton--------------------------------------
5335 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5336 // constants
5337 bool TypeMetadataPtr::singleton(void) const {
5338 // detune optimizer to not generate constant metadata + constant offset as a constant!
5339 // TopPTR, Null, AnyNull, Constant are all singletons
5340 return (_offset == 0) && !below_centerline(_ptr);
5341 }
5342
5343 //------------------------------add_offset-------------------------------------
5344 const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const {
5345 return make( _ptr, _metadata, xadd_offset(offset));
5346 }
5347
5348 //-----------------------------filter------------------------------------------
5349 // Do not allow interface-vs.-noninterface joins to collapse to top.
5350 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const {
5351 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr();
5352 if (ft == nullptr || ft->empty())
5353 return Type::TOP; // Canonical empty value
5354 return ft;
5355 }
5356
5357 //------------------------------get_con----------------------------------------
5358 intptr_t TypeMetadataPtr::get_con() const {
5359 assert( _ptr == Null || _ptr == Constant, "" );
5360 assert( _offset >= 0, "" );
5361
5362 if (_offset != 0) {
5363 // After being ported to the compiler interface, the compiler no longer
5364 // directly manipulates the addresses of oops. Rather, it only has a pointer
5365 // to a handle at compile time. This handle is embedded in the generated
5366 // code and dereferenced at the time the nmethod is made. Until that time,
5367 // it is not reasonable to do arithmetic with the addresses of oops (we don't
5368 // have access to the addresses!). This does not seem to currently happen,
5369 // but this assertion here is to help prevent its occurrence.
5370 tty->print_cr("Found oop constant with non-zero offset");
5371 ShouldNotReachHere();
5372 }
5373
5374 return (intptr_t)metadata()->constant_encoding();
5375 }
5376
5377 //------------------------------cast_to_ptr_type-------------------------------
5378 const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const {
5379 if( ptr == _ptr ) return this;
5380 return make(ptr, metadata(), _offset);
5381 }
5382
5383 //------------------------------meet-------------------------------------------
5384 // Compute the MEET of two types. It returns a new Type object.
5385 const Type *TypeMetadataPtr::xmeet( const Type *t ) const {
5386 // Perform a fast test for common case; meeting the same types together.
5387 if( this == t ) return this; // Meeting same type-rep?
5388
5389 // Current "this->_base" is OopPtr
5390 switch (t->base()) { // switch on original type
5391
5392 case Int: // Mixing ints & oops happens when javac
5393 case Long: // reuses local variables
5394 case HalfFloatTop:
5395 case HalfFloatCon:
5396 case HalfFloatBot:
5397 case FloatTop:
5398 case FloatCon:
5399 case FloatBot:
5400 case DoubleTop:
5401 case DoubleCon:
5402 case DoubleBot:
5403 case NarrowOop:
5404 case NarrowKlass:
5405 case Bottom: // Ye Olde Default
5406 return Type::BOTTOM;
5407 case Top:
5408 return this;
5409
5410 default: // All else is a mistake
5411 typerr(t);
5412
5413 case AnyPtr: {
5414 // Found an AnyPtr type vs self-OopPtr type
5415 const TypePtr *tp = t->is_ptr();
5416 int offset = meet_offset(tp->offset());
5417 PTR ptr = meet_ptr(tp->ptr());
5418 switch (tp->ptr()) {
5419 case Null:
5420 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5421 // else fall through:
5422 case TopPTR:
5423 case AnyNull: {
5424 return make(ptr, _metadata, offset);
5425 }
5426 case BotPTR:
5427 case NotNull:
5428 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5429 default: typerr(t);
5430 }
5431 }
5432
5433 case RawPtr:
5434 case KlassPtr:
5435 case InstKlassPtr:
5436 case AryKlassPtr:
5437 case OopPtr:
5438 case InstPtr:
5439 case AryPtr:
5440 return TypePtr::BOTTOM; // Oop meet raw is not well defined
5441
5442 case MetadataPtr: {
5443 const TypeMetadataPtr *tp = t->is_metadataptr();
5444 int offset = meet_offset(tp->offset());
5445 PTR tptr = tp->ptr();
5446 PTR ptr = meet_ptr(tptr);
5447 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata();
5448 if (tptr == TopPTR || _ptr == TopPTR ||
5449 metadata()->equals(tp->metadata())) {
5450 return make(ptr, md, offset);
5451 }
5452 // metadata is different
5453 if( ptr == Constant ) { // Cannot be equal constants, so...
5454 if( tptr == Constant && _ptr != Constant) return t;
5455 if( _ptr == Constant && tptr != Constant) return this;
5456 ptr = NotNull; // Fall down in lattice
5457 }
5458 return make(ptr, nullptr, offset);
5459 break;
5460 }
5461 } // End of switch
5462 return this; // Return the double constant
5463 }
5464
5465
5466 //------------------------------xdual------------------------------------------
5467 // Dual of a pure metadata pointer.
5468 const Type *TypeMetadataPtr::xdual() const {
5469 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset());
5470 }
5471
5472 //------------------------------dump2------------------------------------------
5473 #ifndef PRODUCT
5474 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
5475 st->print("metadataptr:%s", ptr_msg[_ptr]);
5476 if (metadata() != nullptr) {
5477 st->print(":" INTPTR_FORMAT, p2i(metadata()));
5478 }
5479 dump_offset(st);
5480 }
5481 #endif
5482
5483
5484 //=============================================================================
5485 // Convenience common pre-built type.
5486 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM;
5487
5488 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset):
5489 TypePtr(MetadataPtr, ptr, offset, relocInfo::metadata_type), _metadata(metadata) {
5490 }
5491
5492 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) {
5493 return make(Constant, m, 0);
5494 }
5495 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) {
5496 return make(Constant, m, 0);
5497 }
5498
5499 //------------------------------make-------------------------------------------
5500 // Create a meta data constant
5501 const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) {
5502 assert(m == nullptr || !m->is_klass(), "wrong type");
5503 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons();
5504 }
5505
5506
5507 const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const {
5508 const Type* elem = _ary->_elem;
5509 bool xk = klass_is_exact();
5510 if (elem->make_oopptr() != nullptr) {
5511 elem = elem->make_oopptr()->as_klass_type(try_for_exact);
5512 if (elem->is_klassptr()->klass_is_exact()) {
5513 xk = true;
5514 }
5515 }
5516 return TypeAryKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, elem, klass(), 0);
5517 }
5518
5519 const TypeKlassPtr* TypeKlassPtr::make(ciKlass *klass, InterfaceHandling interface_handling) {
5520 if (klass->is_instance_klass()) {
5521 return TypeInstKlassPtr::make(klass, interface_handling);
5522 }
5523 return TypeAryKlassPtr::make(klass, interface_handling);
5524 }
5525
5526 const TypeKlassPtr* TypeKlassPtr::make(PTR ptr, ciKlass* klass, int offset, InterfaceHandling interface_handling) {
5527 if (klass->is_instance_klass()) {
5528 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling);
5529 return TypeInstKlassPtr::make(ptr, klass, interfaces, offset);
5530 }
5531 return TypeAryKlassPtr::make(ptr, klass, offset, interface_handling);
5532 }
5533
5534
5535 //------------------------------TypeKlassPtr-----------------------------------
5536 TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, int offset)
5537 : TypePtr(t, ptr, offset, relocInfo::metadata_type), _klass(klass), _interfaces(interfaces) {
5538 assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) ||
5539 klass->is_type_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here");
5540 }
5541
5542 // Is there a single ciKlass* that can represent that type?
5543 ciKlass* TypeKlassPtr::exact_klass_helper() const {
5544 assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface");
5545 if (_interfaces->empty()) {
5546 return _klass;
5547 }
5548 if (_klass != ciEnv::current()->Object_klass()) {
5549 if (_interfaces->eq(_klass->as_instance_klass())) {
5550 return _klass;
5551 }
5552 return nullptr;
5553 }
5554 return _interfaces->exact_klass();
5555 }
5556
5557 //------------------------------eq---------------------------------------------
5558 // Structural equality check for Type representations
5559 bool TypeKlassPtr::eq(const Type *t) const {
5560 const TypeKlassPtr *p = t->is_klassptr();
5561 return
5562 _interfaces->eq(p->_interfaces) &&
5563 TypePtr::eq(p);
5564 }
5565
5566 //------------------------------hash-------------------------------------------
5567 // Type-specific hashing function.
5568 uint TypeKlassPtr::hash(void) const {
5569 return TypePtr::hash() + _interfaces->hash();
5570 }
5571
5572 //------------------------------singleton--------------------------------------
5573 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5574 // constants
5575 bool TypeKlassPtr::singleton(void) const {
5576 // detune optimizer to not generate constant klass + constant offset as a constant!
5577 // TopPTR, Null, AnyNull, Constant are all singletons
5578 return (_offset == 0) && !below_centerline(_ptr);
5579 }
5580
5581 // Do not allow interface-vs.-noninterface joins to collapse to top.
5582 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const {
5583 // logic here mirrors the one from TypeOopPtr::filter. See comments
5584 // there.
5585 const Type* ft = join_helper(kills, include_speculative);
5586
5587 if (ft->empty()) {
5588 return Type::TOP; // Canonical empty value
5589 }
5590
5591 return ft;
5592 }
5593
5594 const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const {
5595 if (above_centerline(_ptr) && above_centerline(other->_ptr)) {
5596 return _interfaces->union_with(other->_interfaces);
5597 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) {
5598 return other->_interfaces;
5599 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) {
5600 return _interfaces;
5601 }
5602 return _interfaces->intersection_with(other->_interfaces);
5603 }
5604
5605 //------------------------------get_con----------------------------------------
5606 intptr_t TypeKlassPtr::get_con() const {
5607 assert( _ptr == Null || _ptr == Constant, "" );
5608 assert( _offset >= 0, "" );
5609
5610 if (_offset != 0) {
5611 // After being ported to the compiler interface, the compiler no longer
5612 // directly manipulates the addresses of oops. Rather, it only has a pointer
5613 // to a handle at compile time. This handle is embedded in the generated
5614 // code and dereferenced at the time the nmethod is made. Until that time,
5615 // it is not reasonable to do arithmetic with the addresses of oops (we don't
5616 // have access to the addresses!). This does not seem to currently happen,
5617 // but this assertion here is to help prevent its occurrence.
5618 tty->print_cr("Found oop constant with non-zero offset");
5619 ShouldNotReachHere();
5620 }
5621
5622 ciKlass* k = exact_klass();
5623
5624 return (intptr_t)k->constant_encoding();
5625 }
5626
5627 //=============================================================================
5628 // Convenience common pre-built types.
5629
5630 // Not-null object klass or below
5631 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT;
5632 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL;
5633
5634 bool TypeInstKlassPtr::eq(const Type *t) const {
5635 const TypeKlassPtr *p = t->is_klassptr();
5636 return
5637 klass()->equals(p->klass()) &&
5638 TypeKlassPtr::eq(p);
5639 }
5640
5641 uint TypeInstKlassPtr::hash(void) const {
5642 return klass()->hash() + TypeKlassPtr::hash();
5643 }
5644
5645 const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, int offset) {
5646 TypeInstKlassPtr *r =
5647 (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset))->hashcons();
5648
5649 return r;
5650 }
5651
5652 //------------------------------add_offset-------------------------------------
5653 // Access internals of klass object
5654 const TypePtr* TypeInstKlassPtr::add_offset( intptr_t offset ) const {
5655 return make( _ptr, klass(), _interfaces, xadd_offset(offset) );
5656 }
5657
5658 const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const {
5659 return make(_ptr, klass(), _interfaces, offset);
5660 }
5661
5662 //------------------------------cast_to_ptr_type-------------------------------
5663 const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const {
5664 assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type");
5665 if( ptr == _ptr ) return this;
5666 return make(ptr, _klass, _interfaces, _offset);
5667 }
5668
5669
5670 bool TypeInstKlassPtr::must_be_exact() const {
5671 if (!_klass->is_loaded()) return false;
5672 ciInstanceKlass* ik = _klass->as_instance_klass();
5673 if (ik->is_final()) return true; // cannot clear xk
5674 return false;
5675 }
5676
5677 //-----------------------------cast_to_exactness-------------------------------
5678 const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const {
5679 if (klass_is_exact == (_ptr == Constant)) return this;
5680 if (must_be_exact()) return this;
5681 ciKlass* k = klass();
5682 return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset);
5683 }
5684
5685
5686 //-----------------------------as_instance_type--------------------------------
5687 // Corresponding type for an instance of the given class.
5688 // It will be NotNull, and exact if and only if the klass type is exact.
5689 const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const {
5690 ciKlass* k = klass();
5691 bool xk = klass_is_exact();
5692 Compile* C = Compile::current();
5693 Dependencies* deps = C->dependencies();
5694 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
5695 // Element is an instance
5696 bool klass_is_exact = false;
5697 const TypeInterfaces* interfaces = _interfaces;
5698 if (k->is_loaded()) {
5699 // Try to set klass_is_exact.
5700 ciInstanceKlass* ik = k->as_instance_klass();
5701 klass_is_exact = ik->is_final();
5702 if (!klass_is_exact && klass_change
5703 && deps != nullptr && UseUniqueSubclasses) {
5704 ciInstanceKlass* sub = ik->unique_concrete_subklass();
5705 if (sub != nullptr) {
5706 if (_interfaces->eq(sub)) {
5707 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
5708 k = ik = sub;
5709 xk = sub->is_final();
5710 }
5711 }
5712 }
5713 }
5714 return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, 0);
5715 }
5716
5717 //------------------------------xmeet------------------------------------------
5718 // Compute the MEET of two types, return a new Type object.
5719 const Type *TypeInstKlassPtr::xmeet( const Type *t ) const {
5720 // Perform a fast test for common case; meeting the same types together.
5721 if( this == t ) return this; // Meeting same type-rep?
5722
5723 // Current "this->_base" is Pointer
5724 switch (t->base()) { // switch on original type
5725
5726 case Int: // Mixing ints & oops happens when javac
5727 case Long: // reuses local variables
5728 case HalfFloatTop:
5729 case HalfFloatCon:
5730 case HalfFloatBot:
5731 case FloatTop:
5732 case FloatCon:
5733 case FloatBot:
5734 case DoubleTop:
5735 case DoubleCon:
5736 case DoubleBot:
5737 case NarrowOop:
5738 case NarrowKlass:
5739 case Bottom: // Ye Olde Default
5740 return Type::BOTTOM;
5741 case Top:
5742 return this;
5743
5744 default: // All else is a mistake
5745 typerr(t);
5746
5747 case AnyPtr: { // Meeting to AnyPtrs
5748 // Found an AnyPtr type vs self-KlassPtr type
5749 const TypePtr *tp = t->is_ptr();
5750 int offset = meet_offset(tp->offset());
5751 PTR ptr = meet_ptr(tp->ptr());
5752 switch (tp->ptr()) {
5753 case TopPTR:
5754 return this;
5755 case Null:
5756 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5757 case AnyNull:
5758 return make( ptr, klass(), _interfaces, offset );
5759 case BotPTR:
5760 case NotNull:
5761 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
5762 default: typerr(t);
5763 }
5764 }
5765
5766 case RawPtr:
5767 case MetadataPtr:
5768 case OopPtr:
5769 case AryPtr: // Meet with AryPtr
5770 case InstPtr: // Meet with InstPtr
5771 return TypePtr::BOTTOM;
5772
5773 //
5774 // A-top }
5775 // / | \ } Tops
5776 // B-top A-any C-top }
5777 // | / | \ | } Any-nulls
5778 // B-any | C-any }
5779 // | | |
5780 // B-con A-con C-con } constants; not comparable across classes
5781 // | | |
5782 // B-not | C-not }
5783 // | \ | / | } not-nulls
5784 // B-bot A-not C-bot }
5785 // \ | / } Bottoms
5786 // A-bot }
5787 //
5788
5789 case InstKlassPtr: { // Meet two KlassPtr types
5790 const TypeInstKlassPtr *tkls = t->is_instklassptr();
5791 int off = meet_offset(tkls->offset());
5792 PTR ptr = meet_ptr(tkls->ptr());
5793 const TypeInterfaces* interfaces = meet_interfaces(tkls);
5794
5795 ciKlass* res_klass = nullptr;
5796 bool res_xk = false;
5797 switch(meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) {
5798 case UNLOADED:
5799 ShouldNotReachHere();
5800 case SUBTYPE:
5801 case NOT_SUBTYPE:
5802 case LCA:
5803 case QUICK: {
5804 assert(res_xk == (ptr == Constant), "");
5805 const Type* res = make(ptr, res_klass, interfaces, off);
5806 return res;
5807 }
5808 default:
5809 ShouldNotReachHere();
5810 }
5811 } // End of case KlassPtr
5812 case AryKlassPtr: { // All arrays inherit from Object class
5813 const TypeAryKlassPtr *tp = t->is_aryklassptr();
5814 int offset = meet_offset(tp->offset());
5815 PTR ptr = meet_ptr(tp->ptr());
5816 const TypeInterfaces* interfaces = meet_interfaces(tp);
5817 const TypeInterfaces* tp_interfaces = tp->_interfaces;
5818 const TypeInterfaces* this_interfaces = _interfaces;
5819
5820 switch (ptr) {
5821 case TopPTR:
5822 case AnyNull: // Fall 'down' to dual of object klass
5823 // For instances when a subclass meets a superclass we fall
5824 // below the centerline when the superclass is exact. We need to
5825 // do the same here.
5826 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) {
5827 return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset);
5828 } else {
5829 // cannot subclass, so the meet has to fall badly below the centerline
5830 ptr = NotNull;
5831 interfaces = _interfaces->intersection_with(tp->_interfaces);
5832 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
5833 }
5834 case Constant:
5835 case NotNull:
5836 case BotPTR: // Fall down to object klass
5837 // LCA is object_klass, but if we subclass from the top we can do better
5838 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
5839 // If 'this' (InstPtr) is above the centerline and it is Object class
5840 // then we can subclass in the Java class hierarchy.
5841 // For instances when a subclass meets a superclass we fall
5842 // below the centerline when the superclass is exact. We need
5843 // to do the same here.
5844 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && !klass_is_exact()) {
5845 // that is, tp's array type is a subtype of my klass
5846 return TypeAryKlassPtr::make(ptr,
5847 tp->elem(), tp->klass(), offset);
5848 }
5849 }
5850 // The other case cannot happen, since I cannot be a subtype of an array.
5851 // The meet falls down to Object class below centerline.
5852 if( ptr == Constant )
5853 ptr = NotNull;
5854 interfaces = this_interfaces->intersection_with(tp_interfaces);
5855 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
5856 default: typerr(t);
5857 }
5858 }
5859
5860 } // End of switch
5861 return this; // Return the double constant
5862 }
5863
5864 //------------------------------xdual------------------------------------------
5865 // Dual: compute field-by-field dual
5866 const Type *TypeInstKlassPtr::xdual() const {
5867 return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset());
5868 }
5869
5870 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) {
5871 static_assert(std::is_base_of<T2, T1>::value, "");
5872 if (!this_one->is_loaded() || !other->is_loaded()) {
5873 return false;
5874 }
5875 if (!this_one->is_instance_type(other)) {
5876 return false;
5877 }
5878
5879 if (!other_exact) {
5880 return false;
5881 }
5882
5883 if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) {
5884 return true;
5885 }
5886
5887 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
5888 }
5889
5890 bool TypeInstKlassPtr::might_be_an_array() const {
5891 if (!instance_klass()->is_java_lang_Object()) {
5892 // TypeInstKlassPtr can be an array only if it is java.lang.Object: the only supertype of array types.
5893 return false;
5894 }
5895 if (interfaces()->has_non_array_interface()) {
5896 // Arrays only implement Cloneable and Serializable. If we see any other interface, [this] cannot be an array.
5897 return false;
5898 }
5899 // Cannot prove it's not an array.
5900 return true;
5901 }
5902
5903 bool TypeInstKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
5904 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
5905 }
5906
5907 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_instance(const T1* this_one, const T2* other) {
5908 static_assert(std::is_base_of<T2, T1>::value, "");
5909 if (!this_one->is_loaded() || !other->is_loaded()) {
5910 return false;
5911 }
5912 if (!this_one->is_instance_type(other)) {
5913 return false;
5914 }
5915 return this_one->klass()->equals(other->klass()) && this_one->_interfaces->eq(other->_interfaces);
5916 }
5917
5918 bool TypeInstKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const {
5919 return TypePtr::is_same_java_type_as_helper_for_instance(this, other);
5920 }
5921
5922 template <class T1, class T2> bool TypePtr::maybe_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact) {
5923 static_assert(std::is_base_of<T2, T1>::value, "");
5924 if (!this_one->is_loaded() || !other->is_loaded()) {
5925 return true;
5926 }
5927
5928 if (this_one->is_array_type(other)) {
5929 return !this_exact && this_one->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->contains(this_one->_interfaces);
5930 }
5931
5932 assert(this_one->is_instance_type(other), "unsupported");
5933
5934 if (this_exact && other_exact) {
5935 return this_one->is_java_subtype_of(other);
5936 }
5937
5938 if (!this_one->klass()->is_subtype_of(other->klass()) && !other->klass()->is_subtype_of(this_one->klass())) {
5939 return false;
5940 }
5941
5942 if (this_exact) {
5943 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces);
5944 }
5945
5946 return true;
5947 }
5948
5949 bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
5950 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact);
5951 }
5952
5953 const TypeKlassPtr* TypeInstKlassPtr::try_improve() const {
5954 if (!UseUniqueSubclasses) {
5955 return this;
5956 }
5957 ciKlass* k = klass();
5958 Compile* C = Compile::current();
5959 Dependencies* deps = C->dependencies();
5960 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity");
5961 const TypeInterfaces* interfaces = _interfaces;
5962 if (k->is_loaded()) {
5963 ciInstanceKlass* ik = k->as_instance_klass();
5964 bool klass_is_exact = ik->is_final();
5965 if (!klass_is_exact &&
5966 deps != nullptr) {
5967 ciInstanceKlass* sub = ik->unique_concrete_subklass();
5968 if (sub != nullptr) {
5969 if (_interfaces->eq(sub)) {
5970 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
5971 k = ik = sub;
5972 klass_is_exact = sub->is_final();
5973 return TypeKlassPtr::make(klass_is_exact ? Constant : _ptr, k, _offset);
5974 }
5975 }
5976 }
5977 }
5978 return this;
5979 }
5980
5981 #ifndef PRODUCT
5982 void TypeInstKlassPtr::dump2(Dict& d, uint depth, outputStream* st) const {
5983 st->print("instklassptr:");
5984 klass()->print_name_on(st);
5985 _interfaces->dump(st);
5986 st->print(":%s", ptr_msg[_ptr]);
5987 dump_offset(st);
5988 }
5989 #endif // PRODUCT
5990
5991 const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, const Type* elem, ciKlass* k, int offset) {
5992 return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset))->hashcons();
5993 }
5994
5995 const TypeAryKlassPtr *TypeAryKlassPtr::make(PTR ptr, ciKlass* k, int offset, InterfaceHandling interface_handling) {
5996 if (k->is_obj_array_klass()) {
5997 // Element is an object array. Recursively call ourself.
5998 ciKlass* eklass = k->as_obj_array_klass()->element_klass();
5999 const TypeKlassPtr *etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false);
6000 return TypeAryKlassPtr::make(ptr, etype, nullptr, offset);
6001 } else if (k->is_type_array_klass()) {
6002 // Element is an typeArray
6003 const Type* etype = get_const_basic_type(k->as_type_array_klass()->element_type());
6004 return TypeAryKlassPtr::make(ptr, etype, k, offset);
6005 } else {
6006 ShouldNotReachHere();
6007 return nullptr;
6008 }
6009 }
6010
6011 const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) {
6012 return TypeAryKlassPtr::make(Constant, klass, 0, interface_handling);
6013 }
6014
6015 //------------------------------eq---------------------------------------------
6016 // Structural equality check for Type representations
6017 bool TypeAryKlassPtr::eq(const Type *t) const {
6018 const TypeAryKlassPtr *p = t->is_aryklassptr();
6019 return
6020 _elem == p->_elem && // Check array
6021 TypeKlassPtr::eq(p); // Check sub-parts
6022 }
6023
6024 //------------------------------hash-------------------------------------------
6025 // Type-specific hashing function.
6026 uint TypeAryKlassPtr::hash(void) const {
6027 return (uint)(uintptr_t)_elem + TypeKlassPtr::hash();
6028 }
6029
6030 //----------------------compute_klass------------------------------------------
6031 // Compute the defining klass for this class
6032 ciKlass* TypeAryPtr::compute_klass() const {
6033 // Compute _klass based on element type.
6034 ciKlass* k_ary = nullptr;
6035 const TypeInstPtr *tinst;
6036 const TypeAryPtr *tary;
6037 const Type* el = elem();
6038 if (el->isa_narrowoop()) {
6039 el = el->make_ptr();
6040 }
6041
6042 // Get element klass
6043 if ((tinst = el->isa_instptr()) != nullptr) {
6044 // Leave k_ary at null.
6045 } else if ((tary = el->isa_aryptr()) != nullptr) {
6046 // Leave k_ary at null.
6047 } else if ((el->base() == Type::Top) ||
6048 (el->base() == Type::Bottom)) {
6049 // element type of Bottom occurs from meet of basic type
6050 // and object; Top occurs when doing join on Bottom.
6051 // Leave k_ary at null.
6052 } else {
6053 assert(!el->isa_int(), "integral arrays must be pre-equipped with a class");
6054 // Compute array klass directly from basic type
6055 k_ary = ciTypeArrayKlass::make(el->basic_type());
6056 }
6057 return k_ary;
6058 }
6059
6060 //------------------------------klass------------------------------------------
6061 // Return the defining klass for this class
6062 ciKlass* TypeAryPtr::klass() const {
6063 if( _klass ) return _klass; // Return cached value, if possible
6064
6065 // Oops, need to compute _klass and cache it
6066 ciKlass* k_ary = compute_klass();
6067
6068 if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) {
6069 // The _klass field acts as a cache of the underlying
6070 // ciKlass for this array type. In order to set the field,
6071 // we need to cast away const-ness.
6072 //
6073 // IMPORTANT NOTE: we *never* set the _klass field for the
6074 // type TypeAryPtr::OOPS. This Type is shared between all
6075 // active compilations. However, the ciKlass which represents
6076 // this Type is *not* shared between compilations, so caching
6077 // this value would result in fetching a dangling pointer.
6078 //
6079 // Recomputing the underlying ciKlass for each request is
6080 // a bit less efficient than caching, but calls to
6081 // TypeAryPtr::OOPS->klass() are not common enough to matter.
6082 ((TypeAryPtr*)this)->_klass = k_ary;
6083 }
6084 return k_ary;
6085 }
6086
6087 // Is there a single ciKlass* that can represent that type?
6088 ciKlass* TypeAryPtr::exact_klass_helper() const {
6089 if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) {
6090 ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper();
6091 if (k == nullptr) {
6092 return nullptr;
6093 }
6094 k = ciObjArrayKlass::make(k);
6095 return k;
6096 }
6097
6098 return klass();
6099 }
6100
6101 const Type* TypeAryPtr::base_element_type(int& dims) const {
6102 const Type* elem = this->elem();
6103 dims = 1;
6104 while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) {
6105 elem = elem->make_ptr()->is_aryptr()->elem();
6106 dims++;
6107 }
6108 return elem;
6109 }
6110
6111 //------------------------------add_offset-------------------------------------
6112 // Access internals of klass object
6113 const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const {
6114 return make(_ptr, elem(), klass(), xadd_offset(offset));
6115 }
6116
6117 const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const {
6118 return make(_ptr, elem(), klass(), offset);
6119 }
6120
6121 //------------------------------cast_to_ptr_type-------------------------------
6122 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const {
6123 assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type");
6124 if (ptr == _ptr) return this;
6125 return make(ptr, elem(), _klass, _offset);
6126 }
6127
6128 bool TypeAryKlassPtr::must_be_exact() const {
6129 if (_elem == Type::BOTTOM) return false;
6130 if (_elem == Type::TOP ) return false;
6131 const TypeKlassPtr* tk = _elem->isa_klassptr();
6132 if (!tk) return true; // a primitive type, like int
6133 return tk->must_be_exact();
6134 }
6135
6136
6137 //-----------------------------cast_to_exactness-------------------------------
6138 const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const {
6139 if (must_be_exact()) return this; // cannot clear xk
6140 ciKlass* k = _klass;
6141 const Type* elem = this->elem();
6142 if (elem->isa_klassptr() && !klass_is_exact) {
6143 elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact);
6144 }
6145 return make(klass_is_exact ? Constant : NotNull, elem, k, _offset);
6146 }
6147
6148
6149 //-----------------------------as_instance_type--------------------------------
6150 // Corresponding type for an instance of the given class.
6151 // It will be NotNull, and exact if and only if the klass type is exact.
6152 const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const {
6153 ciKlass* k = klass();
6154 bool xk = klass_is_exact();
6155 const Type* el = nullptr;
6156 if (elem()->isa_klassptr()) {
6157 el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false);
6158 k = nullptr;
6159 } else {
6160 el = elem();
6161 }
6162 return TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(el, TypeInt::POS), k, xk, 0);
6163 }
6164
6165
6166 //------------------------------xmeet------------------------------------------
6167 // Compute the MEET of two types, return a new Type object.
6168 const Type *TypeAryKlassPtr::xmeet( const Type *t ) const {
6169 // Perform a fast test for common case; meeting the same types together.
6170 if( this == t ) return this; // Meeting same type-rep?
6171
6172 // Current "this->_base" is Pointer
6173 switch (t->base()) { // switch on original type
6174
6175 case Int: // Mixing ints & oops happens when javac
6176 case Long: // reuses local variables
6177 case HalfFloatTop:
6178 case HalfFloatCon:
6179 case HalfFloatBot:
6180 case FloatTop:
6181 case FloatCon:
6182 case FloatBot:
6183 case DoubleTop:
6184 case DoubleCon:
6185 case DoubleBot:
6186 case NarrowOop:
6187 case NarrowKlass:
6188 case Bottom: // Ye Olde Default
6189 return Type::BOTTOM;
6190 case Top:
6191 return this;
6192
6193 default: // All else is a mistake
6194 typerr(t);
6195
6196 case AnyPtr: { // Meeting to AnyPtrs
6197 // Found an AnyPtr type vs self-KlassPtr type
6198 const TypePtr *tp = t->is_ptr();
6199 int offset = meet_offset(tp->offset());
6200 PTR ptr = meet_ptr(tp->ptr());
6201 switch (tp->ptr()) {
6202 case TopPTR:
6203 return this;
6204 case Null:
6205 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6206 case AnyNull:
6207 return make( ptr, _elem, klass(), offset );
6208 case BotPTR:
6209 case NotNull:
6210 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth());
6211 default: typerr(t);
6212 }
6213 }
6214
6215 case RawPtr:
6216 case MetadataPtr:
6217 case OopPtr:
6218 case AryPtr: // Meet with AryPtr
6219 case InstPtr: // Meet with InstPtr
6220 return TypePtr::BOTTOM;
6221
6222 //
6223 // A-top }
6224 // / | \ } Tops
6225 // B-top A-any C-top }
6226 // | / | \ | } Any-nulls
6227 // B-any | C-any }
6228 // | | |
6229 // B-con A-con C-con } constants; not comparable across classes
6230 // | | |
6231 // B-not | C-not }
6232 // | \ | / | } not-nulls
6233 // B-bot A-not C-bot }
6234 // \ | / } Bottoms
6235 // A-bot }
6236 //
6237
6238 case AryKlassPtr: { // Meet two KlassPtr types
6239 const TypeAryKlassPtr *tap = t->is_aryklassptr();
6240 int off = meet_offset(tap->offset());
6241 const Type* elem = _elem->meet(tap->_elem);
6242
6243 PTR ptr = meet_ptr(tap->ptr());
6244 ciKlass* res_klass = nullptr;
6245 bool res_xk = false;
6246 meet_aryptr(ptr, elem, this, tap, res_klass, res_xk);
6247 assert(res_xk == (ptr == Constant), "");
6248 return make(ptr, elem, res_klass, off);
6249 } // End of case KlassPtr
6250 case InstKlassPtr: {
6251 const TypeInstKlassPtr *tp = t->is_instklassptr();
6252 int offset = meet_offset(tp->offset());
6253 PTR ptr = meet_ptr(tp->ptr());
6254 const TypeInterfaces* interfaces = meet_interfaces(tp);
6255 const TypeInterfaces* tp_interfaces = tp->_interfaces;
6256 const TypeInterfaces* this_interfaces = _interfaces;
6257
6258 switch (ptr) {
6259 case TopPTR:
6260 case AnyNull: // Fall 'down' to dual of object klass
6261 // For instances when a subclass meets a superclass we fall
6262 // below the centerline when the superclass is exact. We need to
6263 // do the same here.
6264 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
6265 !tp->klass_is_exact()) {
6266 return TypeAryKlassPtr::make(ptr, _elem, _klass, offset);
6267 } else {
6268 // cannot subclass, so the meet has to fall badly below the centerline
6269 ptr = NotNull;
6270 interfaces = this_interfaces->intersection_with(tp->_interfaces);
6271 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
6272 }
6273 case Constant:
6274 case NotNull:
6275 case BotPTR: // Fall down to object klass
6276 // LCA is object_klass, but if we subclass from the top we can do better
6277 if (above_centerline(tp->ptr())) {
6278 // If 'tp' is above the centerline and it is Object class
6279 // then we can subclass in the Java class hierarchy.
6280 // For instances when a subclass meets a superclass we fall
6281 // below the centerline when the superclass is exact. We need
6282 // to do the same here.
6283 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) &&
6284 !tp->klass_is_exact()) {
6285 // that is, my array type is a subtype of 'tp' klass
6286 return make(ptr, _elem, _klass, offset);
6287 }
6288 }
6289 // The other case cannot happen, since t cannot be a subtype of an array.
6290 // The meet falls down to Object class below centerline.
6291 if (ptr == Constant)
6292 ptr = NotNull;
6293 interfaces = this_interfaces->intersection_with(tp_interfaces);
6294 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset);
6295 default: typerr(t);
6296 }
6297 }
6298
6299 } // End of switch
6300 return this; // Return the double constant
6301 }
6302
6303 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) {
6304 static_assert(std::is_base_of<T2, T1>::value, "");
6305
6306 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) {
6307 return true;
6308 }
6309
6310 int dummy;
6311 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
6312
6313 if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
6314 return false;
6315 }
6316
6317 if (this_one->is_instance_type(other)) {
6318 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) &&
6319 other_exact;
6320 }
6321
6322 assert(this_one->is_array_type(other), "");
6323 const T1* other_ary = this_one->is_array_type(other);
6324 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
6325 if (other_top_or_bottom) {
6326 return false;
6327 }
6328
6329 const TypePtr* other_elem = other_ary->elem()->make_ptr();
6330 const TypePtr* this_elem = this_one->elem()->make_ptr();
6331 if (this_elem != nullptr && other_elem != nullptr) {
6332 return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
6333 }
6334 if (this_elem == nullptr && other_elem == nullptr) {
6335 return this_one->klass()->is_subtype_of(other->klass());
6336 }
6337 return false;
6338 }
6339
6340 bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6341 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
6342 }
6343
6344 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) {
6345 static_assert(std::is_base_of<T2, T1>::value, "");
6346
6347 int dummy;
6348 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
6349
6350 if (!this_one->is_array_type(other) ||
6351 !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) {
6352 return false;
6353 }
6354 const T1* other_ary = this_one->is_array_type(other);
6355 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
6356
6357 if (other_top_or_bottom) {
6358 return false;
6359 }
6360
6361 const TypePtr* other_elem = other_ary->elem()->make_ptr();
6362 const TypePtr* this_elem = this_one->elem()->make_ptr();
6363 if (other_elem != nullptr && this_elem != nullptr) {
6364 return this_one->is_reference_type(this_elem)->is_same_java_type_as(this_one->is_reference_type(other_elem));
6365 }
6366 if (other_elem == nullptr && this_elem == nullptr) {
6367 return this_one->klass()->equals(other->klass());
6368 }
6369 return false;
6370 }
6371
6372 bool TypeAryKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const {
6373 return TypePtr::is_same_java_type_as_helper_for_array(this, other);
6374 }
6375
6376 template <class T1, class T2> bool TypePtr::maybe_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact) {
6377 static_assert(std::is_base_of<T2, T1>::value, "");
6378 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) {
6379 return true;
6380 }
6381 if (!this_one->is_loaded() || !other->is_loaded()) {
6382 return true;
6383 }
6384 if (this_one->is_instance_type(other)) {
6385 return other->klass()->equals(ciEnv::current()->Object_klass()) &&
6386 this_one->_interfaces->contains(other->_interfaces);
6387 }
6388
6389 int dummy;
6390 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM);
6391 if (this_top_or_bottom) {
6392 return true;
6393 }
6394
6395 assert(this_one->is_array_type(other), "");
6396
6397 const T1* other_ary = this_one->is_array_type(other);
6398 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM);
6399 if (other_top_or_bottom) {
6400 return true;
6401 }
6402 if (this_exact && other_exact) {
6403 return this_one->is_java_subtype_of(other);
6404 }
6405
6406 const TypePtr* this_elem = this_one->elem()->make_ptr();
6407 const TypePtr* other_elem = other_ary->elem()->make_ptr();
6408 if (other_elem != nullptr && this_elem != nullptr) {
6409 return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact);
6410 }
6411 if (other_elem == nullptr && this_elem == nullptr) {
6412 return this_one->klass()->is_subtype_of(other->klass());
6413 }
6414 return false;
6415 }
6416
6417 bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const {
6418 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact);
6419 }
6420
6421 //------------------------------xdual------------------------------------------
6422 // Dual: compute field-by-field dual
6423 const Type *TypeAryKlassPtr::xdual() const {
6424 return new TypeAryKlassPtr(dual_ptr(), elem()->dual(), klass(), dual_offset());
6425 }
6426
6427 // Is there a single ciKlass* that can represent that type?
6428 ciKlass* TypeAryKlassPtr::exact_klass_helper() const {
6429 if (elem()->isa_klassptr()) {
6430 ciKlass* k = elem()->is_klassptr()->exact_klass_helper();
6431 if (k == nullptr) {
6432 return nullptr;
6433 }
6434 k = ciObjArrayKlass::make(k);
6435 return k;
6436 }
6437
6438 return klass();
6439 }
6440
6441 ciKlass* TypeAryKlassPtr::klass() const {
6442 if (_klass != nullptr) {
6443 return _klass;
6444 }
6445 ciKlass* k = nullptr;
6446 if (elem()->isa_klassptr()) {
6447 // leave null
6448 } else if ((elem()->base() == Type::Top) ||
6449 (elem()->base() == Type::Bottom)) {
6450 } else {
6451 k = ciTypeArrayKlass::make(elem()->basic_type());
6452 ((TypeAryKlassPtr*)this)->_klass = k;
6453 }
6454 return k;
6455 }
6456
6457 //------------------------------dump2------------------------------------------
6458 // Dump Klass Type
6459 #ifndef PRODUCT
6460 void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
6461 st->print("aryklassptr:[");
6462 _elem->dump2(d, depth, st);
6463 _interfaces->dump(st);
6464 st->print(":%s", ptr_msg[_ptr]);
6465 dump_offset(st);
6466 }
6467 #endif
6468
6469 const Type* TypeAryKlassPtr::base_element_type(int& dims) const {
6470 const Type* elem = this->elem();
6471 dims = 1;
6472 while (elem->isa_aryklassptr()) {
6473 elem = elem->is_aryklassptr()->elem();
6474 dims++;
6475 }
6476 return elem;
6477 }
6478
6479 //=============================================================================
6480 // Convenience common pre-built types.
6481
6482 //------------------------------make-------------------------------------------
6483 const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) {
6484 return (TypeFunc*)(new TypeFunc(domain,range))->hashcons();
6485 }
6486
6487 //------------------------------make-------------------------------------------
6488 const TypeFunc *TypeFunc::make(ciMethod* method) {
6489 Compile* C = Compile::current();
6490 const TypeFunc* tf = C->last_tf(method); // check cache
6491 if (tf != nullptr) return tf; // The hit rate here is almost 50%.
6492 const TypeTuple *domain;
6493 if (method->is_static()) {
6494 domain = TypeTuple::make_domain(nullptr, method->signature(), ignore_interfaces);
6495 } else {
6496 domain = TypeTuple::make_domain(method->holder(), method->signature(), ignore_interfaces);
6497 }
6498 const TypeTuple *range = TypeTuple::make_range(method->signature(), ignore_interfaces);
6499 tf = TypeFunc::make(domain, range);
6500 C->set_last_tf(method, tf); // fill cache
6501 return tf;
6502 }
6503
6504 //------------------------------meet-------------------------------------------
6505 // Compute the MEET of two types. It returns a new Type object.
6506 const Type *TypeFunc::xmeet( const Type *t ) const {
6507 // Perform a fast test for common case; meeting the same types together.
6508 if( this == t ) return this; // Meeting same type-rep?
6509
6510 // Current "this->_base" is Func
6511 switch (t->base()) { // switch on original type
6512
6513 case Bottom: // Ye Olde Default
6514 return t;
6515
6516 default: // All else is a mistake
6517 typerr(t);
6518
6519 case Top:
6520 break;
6521 }
6522 return this; // Return the double constant
6523 }
6524
6525 //------------------------------xdual------------------------------------------
6526 // Dual: compute field-by-field dual
6527 const Type *TypeFunc::xdual() const {
6528 return this;
6529 }
6530
6531 //------------------------------eq---------------------------------------------
6532 // Structural equality check for Type representations
6533 bool TypeFunc::eq( const Type *t ) const {
6534 const TypeFunc *a = (const TypeFunc*)t;
6535 return _domain == a->_domain &&
6536 _range == a->_range;
6537 }
6538
6539 //------------------------------hash-------------------------------------------
6540 // Type-specific hashing function.
6541 uint TypeFunc::hash(void) const {
6542 return (uint)(uintptr_t)_domain + (uint)(uintptr_t)_range;
6543 }
6544
6545 //------------------------------dump2------------------------------------------
6546 // Dump Function Type
6547 #ifndef PRODUCT
6548 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
6549 if( _range->cnt() <= Parms )
6550 st->print("void");
6551 else {
6552 uint i;
6553 for (i = Parms; i < _range->cnt()-1; i++) {
6554 _range->field_at(i)->dump2(d,depth,st);
6555 st->print("/");
6556 }
6557 _range->field_at(i)->dump2(d,depth,st);
6558 }
6559 st->print(" ");
6560 st->print("( ");
6561 if( !depth || d[this] ) { // Check for recursive dump
6562 st->print("...)");
6563 return;
6564 }
6565 d.Insert((void*)this,(void*)this); // Stop recursion
6566 if (Parms < _domain->cnt())
6567 _domain->field_at(Parms)->dump2(d,depth-1,st);
6568 for (uint i = Parms+1; i < _domain->cnt(); i++) {
6569 st->print(", ");
6570 _domain->field_at(i)->dump2(d,depth-1,st);
6571 }
6572 st->print(" )");
6573 }
6574 #endif
6575
6576 //------------------------------singleton--------------------------------------
6577 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
6578 // constants (Ldi nodes). Singletons are integer, float or double constants
6579 // or a single symbol.
6580 bool TypeFunc::singleton(void) const {
6581 return false; // Never a singleton
6582 }
6583
6584 bool TypeFunc::empty(void) const {
6585 return false; // Never empty
6586 }
6587
6588
6589 BasicType TypeFunc::return_type() const{
6590 if (range()->cnt() == TypeFunc::Parms) {
6591 return T_VOID;
6592 }
6593 return range()->field_at(TypeFunc::Parms)->basic_type();
6594 }