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