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