Mon, 22 Oct 2018 05:26:38 -0400
8155635: C2: Mixed unsafe accesses break alias analysis
Reviewed-by: kvn
1 /*
2 * Copyright (c) 1997, 2018, 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 */
25 #include "precompiled.hpp"
26 #include "ci/ciMethodData.hpp"
27 #include "ci/ciTypeFlow.hpp"
28 #include "classfile/symbolTable.hpp"
29 #include "classfile/systemDictionary.hpp"
30 #include "compiler/compileLog.hpp"
31 #include "libadt/dict.hpp"
32 #include "memory/gcLocker.hpp"
33 #include "memory/oopFactory.hpp"
34 #include "memory/resourceArea.hpp"
35 #include "oops/instanceKlass.hpp"
36 #include "oops/instanceMirrorKlass.hpp"
37 #include "oops/objArrayKlass.hpp"
38 #include "oops/typeArrayKlass.hpp"
39 #include "opto/matcher.hpp"
40 #include "opto/node.hpp"
41 #include "opto/opcodes.hpp"
42 #include "opto/type.hpp"
44 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
46 // Portions of code courtesy of Clifford Click
48 // Optimization - Graph Style
50 // Dictionary of types shared among compilations.
51 Dict* Type::_shared_type_dict = NULL;
53 // Array which maps compiler types to Basic Types
54 const Type::TypeInfo Type::_type_info[Type::lastype] = {
55 { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg, relocInfo::none }, // Bad
56 { Control, T_ILLEGAL, "control", false, 0, relocInfo::none }, // Control
57 { Bottom, T_VOID, "top", false, 0, relocInfo::none }, // Top
58 { Bad, T_INT, "int:", false, Op_RegI, relocInfo::none }, // Int
59 { Bad, T_LONG, "long:", false, Op_RegL, relocInfo::none }, // Long
60 { Half, T_VOID, "half", false, 0, relocInfo::none }, // Half
61 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN, relocInfo::none }, // NarrowOop
62 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN, relocInfo::none }, // NarrowKlass
63 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg, relocInfo::none }, // Tuple
64 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg, relocInfo::none }, // Array
66 #ifdef SPARC
67 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS
68 { Bad, T_ILLEGAL, "vectord:", false, Op_RegD, relocInfo::none }, // VectorD
69 { Bad, T_ILLEGAL, "vectorx:", false, 0, relocInfo::none }, // VectorX
70 { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY
71 #elif defined(PPC64)
72 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS
73 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // VectorD
74 { Bad, T_ILLEGAL, "vectorx:", false, 0, relocInfo::none }, // VectorX
75 { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY
76 #else // all other
77 { Bad, T_ILLEGAL, "vectors:", false, Op_VecS, relocInfo::none }, // VectorS
78 { Bad, T_ILLEGAL, "vectord:", false, Op_VecD, relocInfo::none }, // VectorD
79 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX
80 { Bad, T_ILLEGAL, "vectory:", false, Op_VecY, relocInfo::none }, // VectorY
81 #endif
82 { Bad, T_ADDRESS, "anyptr:", false, Op_RegP, relocInfo::none }, // AnyPtr
83 { Bad, T_ADDRESS, "rawptr:", false, Op_RegP, relocInfo::none }, // RawPtr
84 { Bad, T_OBJECT, "oop:", true, Op_RegP, relocInfo::oop_type }, // OopPtr
85 { Bad, T_OBJECT, "inst:", true, Op_RegP, relocInfo::oop_type }, // InstPtr
86 { Bad, T_OBJECT, "ary:", true, Op_RegP, relocInfo::oop_type }, // AryPtr
87 { Bad, T_METADATA, "metadata:", false, Op_RegP, relocInfo::metadata_type }, // MetadataPtr
88 { Bad, T_METADATA, "klass:", false, Op_RegP, relocInfo::metadata_type }, // KlassPtr
89 { Bad, T_OBJECT, "func", false, 0, relocInfo::none }, // Function
90 { Abio, T_ILLEGAL, "abIO", false, 0, relocInfo::none }, // Abio
91 { Return_Address, T_ADDRESS, "return_address",false, Op_RegP, relocInfo::none }, // Return_Address
92 { Memory, T_ILLEGAL, "memory", false, 0, relocInfo::none }, // Memory
93 { FloatBot, T_FLOAT, "float_top", false, Op_RegF, relocInfo::none }, // FloatTop
94 { FloatCon, T_FLOAT, "ftcon:", false, Op_RegF, relocInfo::none }, // FloatCon
95 { FloatTop, T_FLOAT, "float", false, Op_RegF, relocInfo::none }, // FloatBot
96 { DoubleBot, T_DOUBLE, "double_top", false, Op_RegD, relocInfo::none }, // DoubleTop
97 { DoubleCon, T_DOUBLE, "dblcon:", false, Op_RegD, relocInfo::none }, // DoubleCon
98 { DoubleTop, T_DOUBLE, "double", false, Op_RegD, relocInfo::none }, // DoubleBot
99 { Top, T_ILLEGAL, "bottom", false, 0, relocInfo::none } // Bottom
100 };
102 // Map ideal registers (machine types) to ideal types
103 const Type *Type::mreg2type[_last_machine_leaf];
105 // Map basic types to canonical Type* pointers.
106 const Type* Type:: _const_basic_type[T_CONFLICT+1];
108 // Map basic types to constant-zero Types.
109 const Type* Type:: _zero_type[T_CONFLICT+1];
111 // Map basic types to array-body alias types.
112 const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1];
114 //=============================================================================
115 // Convenience common pre-built types.
116 const Type *Type::ABIO; // State-of-machine only
117 const Type *Type::BOTTOM; // All values
118 const Type *Type::CONTROL; // Control only
119 const Type *Type::DOUBLE; // All doubles
120 const Type *Type::FLOAT; // All floats
121 const Type *Type::HALF; // Placeholder half of doublewide type
122 const Type *Type::MEMORY; // Abstract store only
123 const Type *Type::RETURN_ADDRESS;
124 const Type *Type::TOP; // No values in set
126 //------------------------------get_const_type---------------------------
127 const Type* Type::get_const_type(ciType* type) {
128 if (type == NULL) {
129 return NULL;
130 } else if (type->is_primitive_type()) {
131 return get_const_basic_type(type->basic_type());
132 } else {
133 return TypeOopPtr::make_from_klass(type->as_klass());
134 }
135 }
137 //---------------------------array_element_basic_type---------------------------------
138 // Mapping to the array element's basic type.
139 BasicType Type::array_element_basic_type() const {
140 BasicType bt = basic_type();
141 if (bt == T_INT) {
142 if (this == TypeInt::INT) return T_INT;
143 if (this == TypeInt::CHAR) return T_CHAR;
144 if (this == TypeInt::BYTE) return T_BYTE;
145 if (this == TypeInt::BOOL) return T_BOOLEAN;
146 if (this == TypeInt::SHORT) return T_SHORT;
147 return T_VOID;
148 }
149 return bt;
150 }
152 // For two instance arrays of same dimension, return the base element types.
153 // Otherwise or if the arrays have different dimensions, return NULL.
154 void Type::get_arrays_base_elements(const Type *a1, const Type *a2,
155 const TypeInstPtr **e1, const TypeInstPtr **e2) {
157 if (e1) *e1 = NULL;
158 if (e2) *e2 = NULL;
159 const TypeAryPtr* a1tap = (a1 == NULL) ? NULL : a1->isa_aryptr();
160 const TypeAryPtr* a2tap = (a2 == NULL) ? NULL : a2->isa_aryptr();
162 if (a1tap != NULL && a2tap != NULL) {
163 // Handle multidimensional arrays
164 const TypePtr* a1tp = a1tap->elem()->make_ptr();
165 const TypePtr* a2tp = a2tap->elem()->make_ptr();
166 while (a1tp && a1tp->isa_aryptr() && a2tp && a2tp->isa_aryptr()) {
167 a1tap = a1tp->is_aryptr();
168 a2tap = a2tp->is_aryptr();
169 a1tp = a1tap->elem()->make_ptr();
170 a2tp = a2tap->elem()->make_ptr();
171 }
172 if (a1tp && a1tp->isa_instptr() && a2tp && a2tp->isa_instptr()) {
173 if (e1) *e1 = a1tp->is_instptr();
174 if (e2) *e2 = a2tp->is_instptr();
175 }
176 }
177 }
179 //---------------------------get_typeflow_type---------------------------------
180 // Import a type produced by ciTypeFlow.
181 const Type* Type::get_typeflow_type(ciType* type) {
182 switch (type->basic_type()) {
184 case ciTypeFlow::StateVector::T_BOTTOM:
185 assert(type == ciTypeFlow::StateVector::bottom_type(), "");
186 return Type::BOTTOM;
188 case ciTypeFlow::StateVector::T_TOP:
189 assert(type == ciTypeFlow::StateVector::top_type(), "");
190 return Type::TOP;
192 case ciTypeFlow::StateVector::T_NULL:
193 assert(type == ciTypeFlow::StateVector::null_type(), "");
194 return TypePtr::NULL_PTR;
196 case ciTypeFlow::StateVector::T_LONG2:
197 // The ciTypeFlow pass pushes a long, then the half.
198 // We do the same.
199 assert(type == ciTypeFlow::StateVector::long2_type(), "");
200 return TypeInt::TOP;
202 case ciTypeFlow::StateVector::T_DOUBLE2:
203 // The ciTypeFlow pass pushes double, then the half.
204 // Our convention is the same.
205 assert(type == ciTypeFlow::StateVector::double2_type(), "");
206 return Type::TOP;
208 case T_ADDRESS:
209 assert(type->is_return_address(), "");
210 return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci());
212 default:
213 // make sure we did not mix up the cases:
214 assert(type != ciTypeFlow::StateVector::bottom_type(), "");
215 assert(type != ciTypeFlow::StateVector::top_type(), "");
216 assert(type != ciTypeFlow::StateVector::null_type(), "");
217 assert(type != ciTypeFlow::StateVector::long2_type(), "");
218 assert(type != ciTypeFlow::StateVector::double2_type(), "");
219 assert(!type->is_return_address(), "");
221 return Type::get_const_type(type);
222 }
223 }
226 //-----------------------make_from_constant------------------------------------
227 const Type* Type::make_from_constant(ciConstant constant,
228 bool require_constant, bool is_autobox_cache) {
229 switch (constant.basic_type()) {
230 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
231 case T_CHAR: return TypeInt::make(constant.as_char());
232 case T_BYTE: return TypeInt::make(constant.as_byte());
233 case T_SHORT: return TypeInt::make(constant.as_short());
234 case T_INT: return TypeInt::make(constant.as_int());
235 case T_LONG: return TypeLong::make(constant.as_long());
236 case T_FLOAT: return TypeF::make(constant.as_float());
237 case T_DOUBLE: return TypeD::make(constant.as_double());
238 case T_ARRAY:
239 case T_OBJECT:
240 {
241 // cases:
242 // can_be_constant = (oop not scavengable || ScavengeRootsInCode != 0)
243 // should_be_constant = (oop not scavengable || ScavengeRootsInCode >= 2)
244 // An oop is not scavengable if it is in the perm gen.
245 ciObject* oop_constant = constant.as_object();
246 if (oop_constant->is_null_object()) {
247 return Type::get_zero_type(T_OBJECT);
248 } else if (require_constant || oop_constant->should_be_constant()) {
249 return TypeOopPtr::make_from_constant(oop_constant, require_constant, is_autobox_cache);
250 }
251 }
252 }
253 // Fall through to failure
254 return NULL;
255 }
258 //------------------------------make-------------------------------------------
259 // Create a simple Type, with default empty symbol sets. Then hashcons it
260 // and look for an existing copy in the type dictionary.
261 const Type *Type::make( enum TYPES t ) {
262 return (new Type(t))->hashcons();
263 }
265 //------------------------------cmp--------------------------------------------
266 int Type::cmp( const Type *const t1, const Type *const t2 ) {
267 if( t1->_base != t2->_base )
268 return 1; // Missed badly
269 assert(t1 != t2 || t1->eq(t2), "eq must be reflexive");
270 return !t1->eq(t2); // Return ZERO if equal
271 }
273 const Type* Type::maybe_remove_speculative(bool include_speculative) const {
274 if (!include_speculative) {
275 return remove_speculative();
276 }
277 return this;
278 }
280 //------------------------------hash-------------------------------------------
281 int Type::uhash( const Type *const t ) {
282 return t->hash();
283 }
285 #define SMALLINT ((juint)3) // a value too insignificant to consider widening
287 //--------------------------Initialize_shared----------------------------------
288 void Type::Initialize_shared(Compile* current) {
289 // This method does not need to be locked because the first system
290 // compilations (stub compilations) occur serially. If they are
291 // changed to proceed in parallel, then this section will need
292 // locking.
294 Arena* save = current->type_arena();
295 Arena* shared_type_arena = new (mtCompiler)Arena(mtCompiler);
297 current->set_type_arena(shared_type_arena);
298 _shared_type_dict =
299 new (shared_type_arena) Dict( (CmpKey)Type::cmp, (Hash)Type::uhash,
300 shared_type_arena, 128 );
301 current->set_type_dict(_shared_type_dict);
303 // Make shared pre-built types.
304 CONTROL = make(Control); // Control only
305 TOP = make(Top); // No values in set
306 MEMORY = make(Memory); // Abstract store only
307 ABIO = make(Abio); // State-of-machine only
308 RETURN_ADDRESS=make(Return_Address);
309 FLOAT = make(FloatBot); // All floats
310 DOUBLE = make(DoubleBot); // All doubles
311 BOTTOM = make(Bottom); // Everything
312 HALF = make(Half); // Placeholder half of doublewide type
314 TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero)
315 TypeF::ONE = TypeF::make(1.0); // Float 1
317 TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero)
318 TypeD::ONE = TypeD::make(1.0); // Double 1
320 TypeInt::MINUS_1 = TypeInt::make(-1); // -1
321 TypeInt::ZERO = TypeInt::make( 0); // 0
322 TypeInt::ONE = TypeInt::make( 1); // 1
323 TypeInt::BOOL = TypeInt::make(0,1, WidenMin); // 0 or 1, FALSE or TRUE.
324 TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes
325 TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1
326 TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE
327 TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO
328 TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin);
329 TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL
330 TypeInt::BYTE = TypeInt::make(-128,127, WidenMin); // Bytes
331 TypeInt::UBYTE = TypeInt::make(0, 255, WidenMin); // Unsigned Bytes
332 TypeInt::CHAR = TypeInt::make(0,65535, WidenMin); // Java chars
333 TypeInt::SHORT = TypeInt::make(-32768,32767, WidenMin); // Java shorts
334 TypeInt::POS = TypeInt::make(0,max_jint, WidenMin); // Non-neg values
335 TypeInt::POS1 = TypeInt::make(1,max_jint, WidenMin); // Positive values
336 TypeInt::INT = TypeInt::make(min_jint,max_jint, WidenMax); // 32-bit integers
337 TypeInt::SYMINT = TypeInt::make(-max_jint,max_jint,WidenMin); // symmetric range
338 TypeInt::TYPE_DOMAIN = TypeInt::INT;
339 // CmpL is overloaded both as the bytecode computation returning
340 // a trinary (-1,0,+1) integer result AND as an efficient long
341 // compare returning optimizer ideal-type flags.
342 assert( TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" );
343 assert( TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" );
344 assert( TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" );
345 assert( TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" );
346 assert( (juint)(TypeInt::CC->_hi - TypeInt::CC->_lo) <= SMALLINT, "CC is truly small");
348 TypeLong::MINUS_1 = TypeLong::make(-1); // -1
349 TypeLong::ZERO = TypeLong::make( 0); // 0
350 TypeLong::ONE = TypeLong::make( 1); // 1
351 TypeLong::POS = TypeLong::make(0,max_jlong, WidenMin); // Non-neg values
352 TypeLong::LONG = TypeLong::make(min_jlong,max_jlong,WidenMax); // 64-bit integers
353 TypeLong::INT = TypeLong::make((jlong)min_jint,(jlong)max_jint,WidenMin);
354 TypeLong::UINT = TypeLong::make(0,(jlong)max_juint,WidenMin);
355 TypeLong::TYPE_DOMAIN = TypeLong::LONG;
357 const Type **fboth =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
358 fboth[0] = Type::CONTROL;
359 fboth[1] = Type::CONTROL;
360 TypeTuple::IFBOTH = TypeTuple::make( 2, fboth );
362 const Type **ffalse =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
363 ffalse[0] = Type::CONTROL;
364 ffalse[1] = Type::TOP;
365 TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse );
367 const Type **fneither =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
368 fneither[0] = Type::TOP;
369 fneither[1] = Type::TOP;
370 TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither );
372 const Type **ftrue =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
373 ftrue[0] = Type::TOP;
374 ftrue[1] = Type::CONTROL;
375 TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue );
377 const Type **floop =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
378 floop[0] = Type::CONTROL;
379 floop[1] = TypeInt::INT;
380 TypeTuple::LOOPBODY = TypeTuple::make( 2, floop );
382 TypePtr::NULL_PTR= TypePtr::make( AnyPtr, TypePtr::Null, 0 );
383 TypePtr::NOTNULL = TypePtr::make( AnyPtr, TypePtr::NotNull, OffsetBot );
384 TypePtr::BOTTOM = TypePtr::make( AnyPtr, TypePtr::BotPTR, OffsetBot );
386 TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR );
387 TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull );
389 const Type **fmembar = TypeTuple::fields(0);
390 TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar);
392 const Type **fsc = (const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
393 fsc[0] = TypeInt::CC;
394 fsc[1] = Type::MEMORY;
395 TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc);
397 TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass());
398 TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass());
399 TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass());
400 TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
401 false, 0, oopDesc::mark_offset_in_bytes());
402 TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
403 false, 0, oopDesc::klass_offset_in_bytes());
404 TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot, TypeOopPtr::InstanceBot, NULL);
406 TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, NULL, OffsetBot);
408 TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR );
409 TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM );
411 TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR );
413 mreg2type[Op_Node] = Type::BOTTOM;
414 mreg2type[Op_Set ] = 0;
415 mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM;
416 mreg2type[Op_RegI] = TypeInt::INT;
417 mreg2type[Op_RegP] = TypePtr::BOTTOM;
418 mreg2type[Op_RegF] = Type::FLOAT;
419 mreg2type[Op_RegD] = Type::DOUBLE;
420 mreg2type[Op_RegL] = TypeLong::LONG;
421 mreg2type[Op_RegFlags] = TypeInt::CC;
423 TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), NULL /* current->env()->Object_klass() */, false, arrayOopDesc::length_offset_in_bytes());
425 TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
427 #ifdef _LP64
428 if (UseCompressedOops) {
429 assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop");
430 TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS;
431 } else
432 #endif
433 {
434 // There is no shared klass for Object[]. See note in TypeAryPtr::klass().
435 TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
436 }
437 TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot);
438 TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot);
439 TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot);
440 TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot);
441 TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot);
442 TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot);
443 TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot);
445 // Nobody should ask _array_body_type[T_NARROWOOP]. Use NULL as assert.
446 TypeAryPtr::_array_body_type[T_NARROWOOP] = NULL;
447 TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS;
448 TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays
449 TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES;
450 TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array
451 TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS;
452 TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS;
453 TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS;
454 TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS;
455 TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS;
456 TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES;
458 TypeKlassPtr::OBJECT = TypeKlassPtr::make( TypePtr::NotNull, current->env()->Object_klass(), 0 );
459 TypeKlassPtr::OBJECT_OR_NULL = TypeKlassPtr::make( TypePtr::BotPTR, current->env()->Object_klass(), 0 );
461 const Type **fi2c = TypeTuple::fields(2);
462 fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method*
463 fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer
464 TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c);
466 const Type **intpair = TypeTuple::fields(2);
467 intpair[0] = TypeInt::INT;
468 intpair[1] = TypeInt::INT;
469 TypeTuple::INT_PAIR = TypeTuple::make(2, intpair);
471 const Type **longpair = TypeTuple::fields(2);
472 longpair[0] = TypeLong::LONG;
473 longpair[1] = TypeLong::LONG;
474 TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair);
476 const Type **intccpair = TypeTuple::fields(2);
477 intccpair[0] = TypeInt::INT;
478 intccpair[1] = TypeInt::CC;
479 TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair);
481 const Type **longccpair = TypeTuple::fields(2);
482 longccpair[0] = TypeLong::LONG;
483 longccpair[1] = TypeInt::CC;
484 TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair);
486 _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM;
487 _const_basic_type[T_NARROWKLASS] = Type::BOTTOM;
488 _const_basic_type[T_BOOLEAN] = TypeInt::BOOL;
489 _const_basic_type[T_CHAR] = TypeInt::CHAR;
490 _const_basic_type[T_BYTE] = TypeInt::BYTE;
491 _const_basic_type[T_SHORT] = TypeInt::SHORT;
492 _const_basic_type[T_INT] = TypeInt::INT;
493 _const_basic_type[T_LONG] = TypeLong::LONG;
494 _const_basic_type[T_FLOAT] = Type::FLOAT;
495 _const_basic_type[T_DOUBLE] = Type::DOUBLE;
496 _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM;
497 _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays
498 _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way
499 _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs
500 _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not?
502 _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR;
503 _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR;
504 _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0
505 _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0
506 _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0
507 _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0
508 _zero_type[T_INT] = TypeInt::ZERO;
509 _zero_type[T_LONG] = TypeLong::ZERO;
510 _zero_type[T_FLOAT] = TypeF::ZERO;
511 _zero_type[T_DOUBLE] = TypeD::ZERO;
512 _zero_type[T_OBJECT] = TypePtr::NULL_PTR;
513 _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop
514 _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null
515 _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all
517 // get_zero_type() should not happen for T_CONFLICT
518 _zero_type[T_CONFLICT]= NULL;
520 // Vector predefined types, it needs initialized _const_basic_type[].
521 if (Matcher::vector_size_supported(T_BYTE,4)) {
522 TypeVect::VECTS = TypeVect::make(T_BYTE,4);
523 }
524 if (Matcher::vector_size_supported(T_FLOAT,2)) {
525 TypeVect::VECTD = TypeVect::make(T_FLOAT,2);
526 }
527 if (Matcher::vector_size_supported(T_FLOAT,4)) {
528 TypeVect::VECTX = TypeVect::make(T_FLOAT,4);
529 }
530 if (Matcher::vector_size_supported(T_FLOAT,8)) {
531 TypeVect::VECTY = TypeVect::make(T_FLOAT,8);
532 }
533 mreg2type[Op_VecS] = TypeVect::VECTS;
534 mreg2type[Op_VecD] = TypeVect::VECTD;
535 mreg2type[Op_VecX] = TypeVect::VECTX;
536 mreg2type[Op_VecY] = TypeVect::VECTY;
538 // Restore working type arena.
539 current->set_type_arena(save);
540 current->set_type_dict(NULL);
541 }
543 //------------------------------Initialize-------------------------------------
544 void Type::Initialize(Compile* current) {
545 assert(current->type_arena() != NULL, "must have created type arena");
547 if (_shared_type_dict == NULL) {
548 Initialize_shared(current);
549 }
551 Arena* type_arena = current->type_arena();
553 // Create the hash-cons'ing dictionary with top-level storage allocation
554 Dict *tdic = new (type_arena) Dict( (CmpKey)Type::cmp,(Hash)Type::uhash, type_arena, 128 );
555 current->set_type_dict(tdic);
557 // Transfer the shared types.
558 DictI i(_shared_type_dict);
559 for( ; i.test(); ++i ) {
560 Type* t = (Type*)i._value;
561 tdic->Insert(t,t); // New Type, insert into Type table
562 }
563 }
565 //------------------------------hashcons---------------------------------------
566 // Do the hash-cons trick. If the Type already exists in the type table,
567 // delete the current Type and return the existing Type. Otherwise stick the
568 // current Type in the Type table.
569 const Type *Type::hashcons(void) {
570 debug_only(base()); // Check the assertion in Type::base().
571 // Look up the Type in the Type dictionary
572 Dict *tdic = type_dict();
573 Type* old = (Type*)(tdic->Insert(this, this, false));
574 if( old ) { // Pre-existing Type?
575 if( old != this ) // Yes, this guy is not the pre-existing?
576 delete this; // Yes, Nuke this guy
577 assert( old->_dual, "" );
578 return old; // Return pre-existing
579 }
581 // Every type has a dual (to make my lattice symmetric).
582 // Since we just discovered a new Type, compute its dual right now.
583 assert( !_dual, "" ); // No dual yet
584 _dual = xdual(); // Compute the dual
585 if( cmp(this,_dual)==0 ) { // Handle self-symmetric
586 _dual = this;
587 return this;
588 }
589 assert( !_dual->_dual, "" ); // No reverse dual yet
590 assert( !(*tdic)[_dual], "" ); // Dual not in type system either
591 // New Type, insert into Type table
592 tdic->Insert((void*)_dual,(void*)_dual);
593 ((Type*)_dual)->_dual = this; // Finish up being symmetric
594 #ifdef ASSERT
595 Type *dual_dual = (Type*)_dual->xdual();
596 assert( eq(dual_dual), "xdual(xdual()) should be identity" );
597 delete dual_dual;
598 #endif
599 return this; // Return new Type
600 }
602 //------------------------------eq---------------------------------------------
603 // Structural equality check for Type representations
604 bool Type::eq( const Type * ) const {
605 return true; // Nothing else can go wrong
606 }
608 //------------------------------hash-------------------------------------------
609 // Type-specific hashing function.
610 int Type::hash(void) const {
611 return _base;
612 }
614 //------------------------------is_finite--------------------------------------
615 // Has a finite value
616 bool Type::is_finite() const {
617 return false;
618 }
620 //------------------------------is_nan-----------------------------------------
621 // Is not a number (NaN)
622 bool Type::is_nan() const {
623 return false;
624 }
626 //----------------------interface_vs_oop---------------------------------------
627 #ifdef ASSERT
628 bool Type::interface_vs_oop_helper(const Type *t) const {
629 bool result = false;
631 const TypePtr* this_ptr = this->make_ptr(); // In case it is narrow_oop
632 const TypePtr* t_ptr = t->make_ptr();
633 if( this_ptr == NULL || t_ptr == NULL )
634 return result;
636 const TypeInstPtr* this_inst = this_ptr->isa_instptr();
637 const TypeInstPtr* t_inst = t_ptr->isa_instptr();
638 if( this_inst && this_inst->is_loaded() && t_inst && t_inst->is_loaded() ) {
639 bool this_interface = this_inst->klass()->is_interface();
640 bool t_interface = t_inst->klass()->is_interface();
641 result = this_interface ^ t_interface;
642 }
644 return result;
645 }
647 bool Type::interface_vs_oop(const Type *t) const {
648 if (interface_vs_oop_helper(t)) {
649 return true;
650 }
651 // Now check the speculative parts as well
652 const TypeOopPtr* this_spec = isa_oopptr() != NULL ? isa_oopptr()->speculative() : NULL;
653 const TypeOopPtr* t_spec = t->isa_oopptr() != NULL ? t->isa_oopptr()->speculative() : NULL;
654 if (this_spec != NULL && t_spec != NULL) {
655 if (this_spec->interface_vs_oop_helper(t_spec)) {
656 return true;
657 }
658 return false;
659 }
660 if (this_spec != NULL && this_spec->interface_vs_oop_helper(t)) {
661 return true;
662 }
663 if (t_spec != NULL && interface_vs_oop_helper(t_spec)) {
664 return true;
665 }
666 return false;
667 }
669 #endif
671 //------------------------------meet-------------------------------------------
672 // Compute the MEET of two types. NOT virtual. It enforces that meet is
673 // commutative and the lattice is symmetric.
674 const Type *Type::meet_helper(const Type *t, bool include_speculative) const {
675 if (isa_narrowoop() && t->isa_narrowoop()) {
676 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
677 return result->make_narrowoop();
678 }
679 if (isa_narrowklass() && t->isa_narrowklass()) {
680 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative);
681 return result->make_narrowklass();
682 }
684 const Type *this_t = maybe_remove_speculative(include_speculative);
685 t = t->maybe_remove_speculative(include_speculative);
687 const Type *mt = this_t->xmeet(t);
688 if (isa_narrowoop() || t->isa_narrowoop()) return mt;
689 if (isa_narrowklass() || t->isa_narrowklass()) return mt;
690 #ifdef ASSERT
691 assert(mt == t->xmeet(this_t), "meet not commutative");
692 const Type* dual_join = mt->_dual;
693 const Type *t2t = dual_join->xmeet(t->_dual);
694 const Type *t2this = dual_join->xmeet(this_t->_dual);
696 // Interface meet Oop is Not Symmetric:
697 // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull
698 // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull
700 if( !interface_vs_oop(t) && (t2t != t->_dual || t2this != this_t->_dual) ) {
701 tty->print_cr("=== Meet Not Symmetric ===");
702 tty->print("t = "); t->dump(); tty->cr();
703 tty->print("this= "); this_t->dump(); tty->cr();
704 tty->print("mt=(t meet this)= "); mt->dump(); tty->cr();
706 tty->print("t_dual= "); t->_dual->dump(); tty->cr();
707 tty->print("this_dual= "); this_t->_dual->dump(); tty->cr();
708 tty->print("mt_dual= "); mt->_dual->dump(); tty->cr();
710 tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr();
711 tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr();
713 fatal("meet not symmetric" );
714 }
715 #endif
716 return mt;
717 }
719 //------------------------------xmeet------------------------------------------
720 // Compute the MEET of two types. It returns a new Type object.
721 const Type *Type::xmeet( const Type *t ) const {
722 // Perform a fast test for common case; meeting the same types together.
723 if( this == t ) return this; // Meeting same type-rep?
725 // Meeting TOP with anything?
726 if( _base == Top ) return t;
728 // Meeting BOTTOM with anything?
729 if( _base == Bottom ) return BOTTOM;
731 // Current "this->_base" is one of: Bad, Multi, Control, Top,
732 // Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype.
733 switch (t->base()) { // Switch on original type
735 // Cut in half the number of cases I must handle. Only need cases for when
736 // the given enum "t->type" is less than or equal to the local enum "type".
737 case FloatCon:
738 case DoubleCon:
739 case Int:
740 case Long:
741 return t->xmeet(this);
743 case OopPtr:
744 return t->xmeet(this);
746 case InstPtr:
747 return t->xmeet(this);
749 case MetadataPtr:
750 case KlassPtr:
751 return t->xmeet(this);
753 case AryPtr:
754 return t->xmeet(this);
756 case NarrowOop:
757 return t->xmeet(this);
759 case NarrowKlass:
760 return t->xmeet(this);
762 case Bad: // Type check
763 default: // Bogus type not in lattice
764 typerr(t);
765 return Type::BOTTOM;
767 case Bottom: // Ye Olde Default
768 return t;
770 case FloatTop:
771 if( _base == FloatTop ) return this;
772 case FloatBot: // Float
773 if( _base == FloatBot || _base == FloatTop ) return FLOAT;
774 if( _base == DoubleTop || _base == DoubleBot ) return Type::BOTTOM;
775 typerr(t);
776 return Type::BOTTOM;
778 case DoubleTop:
779 if( _base == DoubleTop ) return this;
780 case DoubleBot: // Double
781 if( _base == DoubleBot || _base == DoubleTop ) return DOUBLE;
782 if( _base == FloatTop || _base == FloatBot ) return Type::BOTTOM;
783 typerr(t);
784 return Type::BOTTOM;
786 // These next few cases must match exactly or it is a compile-time error.
787 case Control: // Control of code
788 case Abio: // State of world outside of program
789 case Memory:
790 if( _base == t->_base ) return this;
791 typerr(t);
792 return Type::BOTTOM;
794 case Top: // Top of the lattice
795 return this;
796 }
798 // The type is unchanged
799 return this;
800 }
802 //-----------------------------filter------------------------------------------
803 const Type *Type::filter_helper(const Type *kills, bool include_speculative) const {
804 const Type* ft = join_helper(kills, include_speculative);
805 if (ft->empty())
806 return Type::TOP; // Canonical empty value
807 return ft;
808 }
810 //------------------------------xdual------------------------------------------
811 // Compute dual right now.
812 const Type::TYPES Type::dual_type[Type::lastype] = {
813 Bad, // Bad
814 Control, // Control
815 Bottom, // Top
816 Bad, // Int - handled in v-call
817 Bad, // Long - handled in v-call
818 Half, // Half
819 Bad, // NarrowOop - handled in v-call
820 Bad, // NarrowKlass - handled in v-call
822 Bad, // Tuple - handled in v-call
823 Bad, // Array - handled in v-call
824 Bad, // VectorS - handled in v-call
825 Bad, // VectorD - handled in v-call
826 Bad, // VectorX - handled in v-call
827 Bad, // VectorY - handled in v-call
829 Bad, // AnyPtr - handled in v-call
830 Bad, // RawPtr - handled in v-call
831 Bad, // OopPtr - handled in v-call
832 Bad, // InstPtr - handled in v-call
833 Bad, // AryPtr - handled in v-call
835 Bad, // MetadataPtr - handled in v-call
836 Bad, // KlassPtr - handled in v-call
838 Bad, // Function - handled in v-call
839 Abio, // Abio
840 Return_Address,// Return_Address
841 Memory, // Memory
842 FloatBot, // FloatTop
843 FloatCon, // FloatCon
844 FloatTop, // FloatBot
845 DoubleBot, // DoubleTop
846 DoubleCon, // DoubleCon
847 DoubleTop, // DoubleBot
848 Top // Bottom
849 };
851 const Type *Type::xdual() const {
852 // Note: the base() accessor asserts the sanity of _base.
853 assert(_type_info[base()].dual_type != Bad, "implement with v-call");
854 return new Type(_type_info[_base].dual_type);
855 }
857 //------------------------------has_memory-------------------------------------
858 bool Type::has_memory() const {
859 Type::TYPES tx = base();
860 if (tx == Memory) return true;
861 if (tx == Tuple) {
862 const TypeTuple *t = is_tuple();
863 for (uint i=0; i < t->cnt(); i++) {
864 tx = t->field_at(i)->base();
865 if (tx == Memory) return true;
866 }
867 }
868 return false;
869 }
871 #ifndef PRODUCT
872 //------------------------------dump2------------------------------------------
873 void Type::dump2( Dict &d, uint depth, outputStream *st ) const {
874 st->print("%s", _type_info[_base].msg);
875 }
877 //------------------------------dump-------------------------------------------
878 void Type::dump_on(outputStream *st) const {
879 ResourceMark rm;
880 Dict d(cmpkey,hashkey); // Stop recursive type dumping
881 dump2(d,1, st);
882 if (is_ptr_to_narrowoop()) {
883 st->print(" [narrow]");
884 } else if (is_ptr_to_narrowklass()) {
885 st->print(" [narrowklass]");
886 }
887 }
889 //-----------------------------------------------------------------------------
890 const char* Type::str(const Type* t) {
891 stringStream ss;
892 t->dump_on(&ss);
893 return ss.as_string();
894 }
895 #endif
897 //------------------------------singleton--------------------------------------
898 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
899 // constants (Ldi nodes). Singletons are integer, float or double constants.
900 bool Type::singleton(void) const {
901 return _base == Top || _base == Half;
902 }
904 //------------------------------empty------------------------------------------
905 // TRUE if Type is a type with no values, FALSE otherwise.
906 bool Type::empty(void) const {
907 switch (_base) {
908 case DoubleTop:
909 case FloatTop:
910 case Top:
911 return true;
913 case Half:
914 case Abio:
915 case Return_Address:
916 case Memory:
917 case Bottom:
918 case FloatBot:
919 case DoubleBot:
920 return false; // never a singleton, therefore never empty
921 }
923 ShouldNotReachHere();
924 return false;
925 }
927 //------------------------------dump_stats-------------------------------------
928 // Dump collected statistics to stderr
929 #ifndef PRODUCT
930 void Type::dump_stats() {
931 tty->print("Types made: %d\n", type_dict()->Size());
932 }
933 #endif
935 //------------------------------typerr-----------------------------------------
936 void Type::typerr( const Type *t ) const {
937 #ifndef PRODUCT
938 tty->print("\nError mixing types: ");
939 dump();
940 tty->print(" and ");
941 t->dump();
942 tty->print("\n");
943 #endif
944 ShouldNotReachHere();
945 }
948 //=============================================================================
949 // Convenience common pre-built types.
950 const TypeF *TypeF::ZERO; // Floating point zero
951 const TypeF *TypeF::ONE; // Floating point one
953 //------------------------------make-------------------------------------------
954 // Create a float constant
955 const TypeF *TypeF::make(float f) {
956 return (TypeF*)(new TypeF(f))->hashcons();
957 }
959 //------------------------------meet-------------------------------------------
960 // Compute the MEET of two types. It returns a new Type object.
961 const Type *TypeF::xmeet( const Type *t ) const {
962 // Perform a fast test for common case; meeting the same types together.
963 if( this == t ) return this; // Meeting same type-rep?
965 // Current "this->_base" is FloatCon
966 switch (t->base()) { // Switch on original type
967 case AnyPtr: // Mixing with oops happens when javac
968 case RawPtr: // reuses local variables
969 case OopPtr:
970 case InstPtr:
971 case AryPtr:
972 case MetadataPtr:
973 case KlassPtr:
974 case NarrowOop:
975 case NarrowKlass:
976 case Int:
977 case Long:
978 case DoubleTop:
979 case DoubleCon:
980 case DoubleBot:
981 case Bottom: // Ye Olde Default
982 return Type::BOTTOM;
984 case FloatBot:
985 return t;
987 default: // All else is a mistake
988 typerr(t);
990 case FloatCon: // Float-constant vs Float-constant?
991 if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants?
992 // must compare bitwise as positive zero, negative zero and NaN have
993 // all the same representation in C++
994 return FLOAT; // Return generic float
995 // Equal constants
996 case Top:
997 case FloatTop:
998 break; // Return the float constant
999 }
1000 return this; // Return the float constant
1001 }
1003 //------------------------------xdual------------------------------------------
1004 // Dual: symmetric
1005 const Type *TypeF::xdual() const {
1006 return this;
1007 }
1009 //------------------------------eq---------------------------------------------
1010 // Structural equality check for Type representations
1011 bool TypeF::eq(const Type *t) const {
1012 // Bitwise comparison to distinguish between +/-0. These values must be treated
1013 // as different to be consistent with C1 and the interpreter.
1014 return (jint_cast(_f) == jint_cast(t->getf()));
1015 }
1017 //------------------------------hash-------------------------------------------
1018 // Type-specific hashing function.
1019 int TypeF::hash(void) const {
1020 return *(int*)(&_f);
1021 }
1023 //------------------------------is_finite--------------------------------------
1024 // Has a finite value
1025 bool TypeF::is_finite() const {
1026 return g_isfinite(getf()) != 0;
1027 }
1029 //------------------------------is_nan-----------------------------------------
1030 // Is not a number (NaN)
1031 bool TypeF::is_nan() const {
1032 return g_isnan(getf()) != 0;
1033 }
1035 //------------------------------dump2------------------------------------------
1036 // Dump float constant Type
1037 #ifndef PRODUCT
1038 void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const {
1039 Type::dump2(d,depth, st);
1040 st->print("%f", _f);
1041 }
1042 #endif
1044 //------------------------------singleton--------------------------------------
1045 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1046 // constants (Ldi nodes). Singletons are integer, float or double constants
1047 // or a single symbol.
1048 bool TypeF::singleton(void) const {
1049 return true; // Always a singleton
1050 }
1052 bool TypeF::empty(void) const {
1053 return false; // always exactly a singleton
1054 }
1056 //=============================================================================
1057 // Convenience common pre-built types.
1058 const TypeD *TypeD::ZERO; // Floating point zero
1059 const TypeD *TypeD::ONE; // Floating point one
1061 //------------------------------make-------------------------------------------
1062 const TypeD *TypeD::make(double d) {
1063 return (TypeD*)(new TypeD(d))->hashcons();
1064 }
1066 //------------------------------meet-------------------------------------------
1067 // Compute the MEET of two types. It returns a new Type object.
1068 const Type *TypeD::xmeet( const Type *t ) const {
1069 // Perform a fast test for common case; meeting the same types together.
1070 if( this == t ) return this; // Meeting same type-rep?
1072 // Current "this->_base" is DoubleCon
1073 switch (t->base()) { // Switch on original type
1074 case AnyPtr: // Mixing with oops happens when javac
1075 case RawPtr: // reuses local variables
1076 case OopPtr:
1077 case InstPtr:
1078 case AryPtr:
1079 case MetadataPtr:
1080 case KlassPtr:
1081 case NarrowOop:
1082 case NarrowKlass:
1083 case Int:
1084 case Long:
1085 case FloatTop:
1086 case FloatCon:
1087 case FloatBot:
1088 case Bottom: // Ye Olde Default
1089 return Type::BOTTOM;
1091 case DoubleBot:
1092 return t;
1094 default: // All else is a mistake
1095 typerr(t);
1097 case DoubleCon: // Double-constant vs Double-constant?
1098 if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet)
1099 return DOUBLE; // Return generic double
1100 case Top:
1101 case DoubleTop:
1102 break;
1103 }
1104 return this; // Return the double constant
1105 }
1107 //------------------------------xdual------------------------------------------
1108 // Dual: symmetric
1109 const Type *TypeD::xdual() const {
1110 return this;
1111 }
1113 //------------------------------eq---------------------------------------------
1114 // Structural equality check for Type representations
1115 bool TypeD::eq(const Type *t) const {
1116 // Bitwise comparison to distinguish between +/-0. These values must be treated
1117 // as different to be consistent with C1 and the interpreter.
1118 return (jlong_cast(_d) == jlong_cast(t->getd()));
1119 }
1121 //------------------------------hash-------------------------------------------
1122 // Type-specific hashing function.
1123 int TypeD::hash(void) const {
1124 return *(int*)(&_d);
1125 }
1127 //------------------------------is_finite--------------------------------------
1128 // Has a finite value
1129 bool TypeD::is_finite() const {
1130 return g_isfinite(getd()) != 0;
1131 }
1133 //------------------------------is_nan-----------------------------------------
1134 // Is not a number (NaN)
1135 bool TypeD::is_nan() const {
1136 return g_isnan(getd()) != 0;
1137 }
1139 //------------------------------dump2------------------------------------------
1140 // Dump double constant Type
1141 #ifndef PRODUCT
1142 void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const {
1143 Type::dump2(d,depth,st);
1144 st->print("%f", _d);
1145 }
1146 #endif
1148 //------------------------------singleton--------------------------------------
1149 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1150 // constants (Ldi nodes). Singletons are integer, float or double constants
1151 // or a single symbol.
1152 bool TypeD::singleton(void) const {
1153 return true; // Always a singleton
1154 }
1156 bool TypeD::empty(void) const {
1157 return false; // always exactly a singleton
1158 }
1160 //=============================================================================
1161 // Convience common pre-built types.
1162 const TypeInt *TypeInt::MINUS_1;// -1
1163 const TypeInt *TypeInt::ZERO; // 0
1164 const TypeInt *TypeInt::ONE; // 1
1165 const TypeInt *TypeInt::BOOL; // 0 or 1, FALSE or TRUE.
1166 const TypeInt *TypeInt::CC; // -1,0 or 1, condition codes
1167 const TypeInt *TypeInt::CC_LT; // [-1] == MINUS_1
1168 const TypeInt *TypeInt::CC_GT; // [1] == ONE
1169 const TypeInt *TypeInt::CC_EQ; // [0] == ZERO
1170 const TypeInt *TypeInt::CC_LE; // [-1,0]
1171 const TypeInt *TypeInt::CC_GE; // [0,1] == BOOL (!)
1172 const TypeInt *TypeInt::BYTE; // Bytes, -128 to 127
1173 const TypeInt *TypeInt::UBYTE; // Unsigned Bytes, 0 to 255
1174 const TypeInt *TypeInt::CHAR; // Java chars, 0-65535
1175 const TypeInt *TypeInt::SHORT; // Java shorts, -32768-32767
1176 const TypeInt *TypeInt::POS; // Positive 32-bit integers or zero
1177 const TypeInt *TypeInt::POS1; // Positive 32-bit integers
1178 const TypeInt *TypeInt::INT; // 32-bit integers
1179 const TypeInt *TypeInt::SYMINT; // symmetric range [-max_jint..max_jint]
1180 const TypeInt *TypeInt::TYPE_DOMAIN; // alias for TypeInt::INT
1182 //------------------------------TypeInt----------------------------------------
1183 TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) {
1184 }
1186 //------------------------------make-------------------------------------------
1187 const TypeInt *TypeInt::make( jint lo ) {
1188 return (TypeInt*)(new TypeInt(lo,lo,WidenMin))->hashcons();
1189 }
1191 static int normalize_int_widen( jint lo, jint hi, int w ) {
1192 // Certain normalizations keep us sane when comparing types.
1193 // The 'SMALLINT' covers constants and also CC and its relatives.
1194 if (lo <= hi) {
1195 if (((juint)hi - lo) <= SMALLINT) w = Type::WidenMin;
1196 if (((juint)hi - lo) >= max_juint) w = Type::WidenMax; // TypeInt::INT
1197 } else {
1198 if (((juint)lo - hi) <= SMALLINT) w = Type::WidenMin;
1199 if (((juint)lo - hi) >= max_juint) w = Type::WidenMin; // dual TypeInt::INT
1200 }
1201 return w;
1202 }
1204 const TypeInt *TypeInt::make( jint lo, jint hi, int w ) {
1205 w = normalize_int_widen(lo, hi, w);
1206 return (TypeInt*)(new TypeInt(lo,hi,w))->hashcons();
1207 }
1209 //------------------------------meet-------------------------------------------
1210 // Compute the MEET of two types. It returns a new Type representation object
1211 // with reference count equal to the number of Types pointing at it.
1212 // Caller should wrap a Types around it.
1213 const Type *TypeInt::xmeet( const Type *t ) const {
1214 // Perform a fast test for common case; meeting the same types together.
1215 if( this == t ) return this; // Meeting same type?
1217 // Currently "this->_base" is a TypeInt
1218 switch (t->base()) { // Switch on original type
1219 case AnyPtr: // Mixing with oops happens when javac
1220 case RawPtr: // reuses local variables
1221 case OopPtr:
1222 case InstPtr:
1223 case AryPtr:
1224 case MetadataPtr:
1225 case KlassPtr:
1226 case NarrowOop:
1227 case NarrowKlass:
1228 case Long:
1229 case FloatTop:
1230 case FloatCon:
1231 case FloatBot:
1232 case DoubleTop:
1233 case DoubleCon:
1234 case DoubleBot:
1235 case Bottom: // Ye Olde Default
1236 return Type::BOTTOM;
1237 default: // All else is a mistake
1238 typerr(t);
1239 case Top: // No change
1240 return this;
1241 case Int: // Int vs Int?
1242 break;
1243 }
1245 // Expand covered set
1246 const TypeInt *r = t->is_int();
1247 return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) );
1248 }
1250 //------------------------------xdual------------------------------------------
1251 // Dual: reverse hi & lo; flip widen
1252 const Type *TypeInt::xdual() const {
1253 int w = normalize_int_widen(_hi,_lo, WidenMax-_widen);
1254 return new TypeInt(_hi,_lo,w);
1255 }
1257 //------------------------------widen------------------------------------------
1258 // Only happens for optimistic top-down optimizations.
1259 const Type *TypeInt::widen( const Type *old, const Type* limit ) const {
1260 // Coming from TOP or such; no widening
1261 if( old->base() != Int ) return this;
1262 const TypeInt *ot = old->is_int();
1264 // If new guy is equal to old guy, no widening
1265 if( _lo == ot->_lo && _hi == ot->_hi )
1266 return old;
1268 // If new guy contains old, then we widened
1269 if( _lo <= ot->_lo && _hi >= ot->_hi ) {
1270 // New contains old
1271 // If new guy is already wider than old, no widening
1272 if( _widen > ot->_widen ) return this;
1273 // If old guy was a constant, do not bother
1274 if (ot->_lo == ot->_hi) return this;
1275 // Now widen new guy.
1276 // Check for widening too far
1277 if (_widen == WidenMax) {
1278 int max = max_jint;
1279 int min = min_jint;
1280 if (limit->isa_int()) {
1281 max = limit->is_int()->_hi;
1282 min = limit->is_int()->_lo;
1283 }
1284 if (min < _lo && _hi < max) {
1285 // If neither endpoint is extremal yet, push out the endpoint
1286 // which is closer to its respective limit.
1287 if (_lo >= 0 || // easy common case
1288 (juint)(_lo - min) >= (juint)(max - _hi)) {
1289 // Try to widen to an unsigned range type of 31 bits:
1290 return make(_lo, max, WidenMax);
1291 } else {
1292 return make(min, _hi, WidenMax);
1293 }
1294 }
1295 return TypeInt::INT;
1296 }
1297 // Returned widened new guy
1298 return make(_lo,_hi,_widen+1);
1299 }
1301 // If old guy contains new, then we probably widened too far & dropped to
1302 // bottom. Return the wider fellow.
1303 if ( ot->_lo <= _lo && ot->_hi >= _hi )
1304 return old;
1306 //fatal("Integer value range is not subset");
1307 //return this;
1308 return TypeInt::INT;
1309 }
1311 //------------------------------narrow---------------------------------------
1312 // Only happens for pessimistic optimizations.
1313 const Type *TypeInt::narrow( const Type *old ) const {
1314 if (_lo >= _hi) return this; // already narrow enough
1315 if (old == NULL) return this;
1316 const TypeInt* ot = old->isa_int();
1317 if (ot == NULL) return this;
1318 jint olo = ot->_lo;
1319 jint ohi = ot->_hi;
1321 // If new guy is equal to old guy, no narrowing
1322 if (_lo == olo && _hi == ohi) return old;
1324 // If old guy was maximum range, allow the narrowing
1325 if (olo == min_jint && ohi == max_jint) return this;
1327 if (_lo < olo || _hi > ohi)
1328 return this; // doesn't narrow; pretty wierd
1330 // The new type narrows the old type, so look for a "death march".
1331 // See comments on PhaseTransform::saturate.
1332 juint nrange = _hi - _lo;
1333 juint orange = ohi - olo;
1334 if (nrange < max_juint - 1 && nrange > (orange >> 1) + (SMALLINT*2)) {
1335 // Use the new type only if the range shrinks a lot.
1336 // We do not want the optimizer computing 2^31 point by point.
1337 return old;
1338 }
1340 return this;
1341 }
1343 //-----------------------------filter------------------------------------------
1344 const Type *TypeInt::filter_helper(const Type *kills, bool include_speculative) const {
1345 const TypeInt* ft = join_helper(kills, include_speculative)->isa_int();
1346 if (ft == NULL || ft->empty())
1347 return Type::TOP; // Canonical empty value
1348 if (ft->_widen < this->_widen) {
1349 // Do not allow the value of kill->_widen to affect the outcome.
1350 // The widen bits must be allowed to run freely through the graph.
1351 ft = TypeInt::make(ft->_lo, ft->_hi, this->_widen);
1352 }
1353 return ft;
1354 }
1356 //------------------------------eq---------------------------------------------
1357 // Structural equality check for Type representations
1358 bool TypeInt::eq( const Type *t ) const {
1359 const TypeInt *r = t->is_int(); // Handy access
1360 return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen;
1361 }
1363 //------------------------------hash-------------------------------------------
1364 // Type-specific hashing function.
1365 int TypeInt::hash(void) const {
1366 return _lo+_hi+_widen+(int)Type::Int;
1367 }
1369 //------------------------------is_finite--------------------------------------
1370 // Has a finite value
1371 bool TypeInt::is_finite() const {
1372 return true;
1373 }
1375 //------------------------------dump2------------------------------------------
1376 // Dump TypeInt
1377 #ifndef PRODUCT
1378 static const char* intname(char* buf, jint n) {
1379 if (n == min_jint)
1380 return "min";
1381 else if (n < min_jint + 10000)
1382 sprintf(buf, "min+" INT32_FORMAT, n - min_jint);
1383 else if (n == max_jint)
1384 return "max";
1385 else if (n > max_jint - 10000)
1386 sprintf(buf, "max-" INT32_FORMAT, max_jint - n);
1387 else
1388 sprintf(buf, INT32_FORMAT, n);
1389 return buf;
1390 }
1392 void TypeInt::dump2( Dict &d, uint depth, outputStream *st ) const {
1393 char buf[40], buf2[40];
1394 if (_lo == min_jint && _hi == max_jint)
1395 st->print("int");
1396 else if (is_con())
1397 st->print("int:%s", intname(buf, get_con()));
1398 else if (_lo == BOOL->_lo && _hi == BOOL->_hi)
1399 st->print("bool");
1400 else if (_lo == BYTE->_lo && _hi == BYTE->_hi)
1401 st->print("byte");
1402 else if (_lo == CHAR->_lo && _hi == CHAR->_hi)
1403 st->print("char");
1404 else if (_lo == SHORT->_lo && _hi == SHORT->_hi)
1405 st->print("short");
1406 else if (_hi == max_jint)
1407 st->print("int:>=%s", intname(buf, _lo));
1408 else if (_lo == min_jint)
1409 st->print("int:<=%s", intname(buf, _hi));
1410 else
1411 st->print("int:%s..%s", intname(buf, _lo), intname(buf2, _hi));
1413 if (_widen != 0 && this != TypeInt::INT)
1414 st->print(":%.*s", _widen, "wwww");
1415 }
1416 #endif
1418 //------------------------------singleton--------------------------------------
1419 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1420 // constants.
1421 bool TypeInt::singleton(void) const {
1422 return _lo >= _hi;
1423 }
1425 bool TypeInt::empty(void) const {
1426 return _lo > _hi;
1427 }
1429 //=============================================================================
1430 // Convenience common pre-built types.
1431 const TypeLong *TypeLong::MINUS_1;// -1
1432 const TypeLong *TypeLong::ZERO; // 0
1433 const TypeLong *TypeLong::ONE; // 1
1434 const TypeLong *TypeLong::POS; // >=0
1435 const TypeLong *TypeLong::LONG; // 64-bit integers
1436 const TypeLong *TypeLong::INT; // 32-bit subrange
1437 const TypeLong *TypeLong::UINT; // 32-bit unsigned subrange
1438 const TypeLong *TypeLong::TYPE_DOMAIN; // alias for TypeLong::LONG
1440 //------------------------------TypeLong---------------------------------------
1441 TypeLong::TypeLong( jlong lo, jlong hi, int w ) : Type(Long), _lo(lo), _hi(hi), _widen(w) {
1442 }
1444 //------------------------------make-------------------------------------------
1445 const TypeLong *TypeLong::make( jlong lo ) {
1446 return (TypeLong*)(new TypeLong(lo,lo,WidenMin))->hashcons();
1447 }
1449 static int normalize_long_widen( jlong lo, jlong hi, int w ) {
1450 // Certain normalizations keep us sane when comparing types.
1451 // The 'SMALLINT' covers constants.
1452 if (lo <= hi) {
1453 if (((julong)hi - lo) <= SMALLINT) w = Type::WidenMin;
1454 if (((julong)hi - lo) >= max_julong) w = Type::WidenMax; // TypeLong::LONG
1455 } else {
1456 if (((julong)lo - hi) <= SMALLINT) w = Type::WidenMin;
1457 if (((julong)lo - hi) >= max_julong) w = Type::WidenMin; // dual TypeLong::LONG
1458 }
1459 return w;
1460 }
1462 const TypeLong *TypeLong::make( jlong lo, jlong hi, int w ) {
1463 w = normalize_long_widen(lo, hi, w);
1464 return (TypeLong*)(new TypeLong(lo,hi,w))->hashcons();
1465 }
1468 //------------------------------meet-------------------------------------------
1469 // Compute the MEET of two types. It returns a new Type representation object
1470 // with reference count equal to the number of Types pointing at it.
1471 // Caller should wrap a Types around it.
1472 const Type *TypeLong::xmeet( const Type *t ) const {
1473 // Perform a fast test for common case; meeting the same types together.
1474 if( this == t ) return this; // Meeting same type?
1476 // Currently "this->_base" is a TypeLong
1477 switch (t->base()) { // Switch on original type
1478 case AnyPtr: // Mixing with oops happens when javac
1479 case RawPtr: // reuses local variables
1480 case OopPtr:
1481 case InstPtr:
1482 case AryPtr:
1483 case MetadataPtr:
1484 case KlassPtr:
1485 case NarrowOop:
1486 case NarrowKlass:
1487 case Int:
1488 case FloatTop:
1489 case FloatCon:
1490 case FloatBot:
1491 case DoubleTop:
1492 case DoubleCon:
1493 case DoubleBot:
1494 case Bottom: // Ye Olde Default
1495 return Type::BOTTOM;
1496 default: // All else is a mistake
1497 typerr(t);
1498 case Top: // No change
1499 return this;
1500 case Long: // Long vs Long?
1501 break;
1502 }
1504 // Expand covered set
1505 const TypeLong *r = t->is_long(); // Turn into a TypeLong
1506 return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) );
1507 }
1509 //------------------------------xdual------------------------------------------
1510 // Dual: reverse hi & lo; flip widen
1511 const Type *TypeLong::xdual() const {
1512 int w = normalize_long_widen(_hi,_lo, WidenMax-_widen);
1513 return new TypeLong(_hi,_lo,w);
1514 }
1516 //------------------------------widen------------------------------------------
1517 // Only happens for optimistic top-down optimizations.
1518 const Type *TypeLong::widen( const Type *old, const Type* limit ) const {
1519 // Coming from TOP or such; no widening
1520 if( old->base() != Long ) return this;
1521 const TypeLong *ot = old->is_long();
1523 // If new guy is equal to old guy, no widening
1524 if( _lo == ot->_lo && _hi == ot->_hi )
1525 return old;
1527 // If new guy contains old, then we widened
1528 if( _lo <= ot->_lo && _hi >= ot->_hi ) {
1529 // New contains old
1530 // If new guy is already wider than old, no widening
1531 if( _widen > ot->_widen ) return this;
1532 // If old guy was a constant, do not bother
1533 if (ot->_lo == ot->_hi) return this;
1534 // Now widen new guy.
1535 // Check for widening too far
1536 if (_widen == WidenMax) {
1537 jlong max = max_jlong;
1538 jlong min = min_jlong;
1539 if (limit->isa_long()) {
1540 max = limit->is_long()->_hi;
1541 min = limit->is_long()->_lo;
1542 }
1543 if (min < _lo && _hi < max) {
1544 // If neither endpoint is extremal yet, push out the endpoint
1545 // which is closer to its respective limit.
1546 if (_lo >= 0 || // easy common case
1547 (julong)(_lo - min) >= (julong)(max - _hi)) {
1548 // Try to widen to an unsigned range type of 32/63 bits:
1549 if (max >= max_juint && _hi < max_juint)
1550 return make(_lo, max_juint, WidenMax);
1551 else
1552 return make(_lo, max, WidenMax);
1553 } else {
1554 return make(min, _hi, WidenMax);
1555 }
1556 }
1557 return TypeLong::LONG;
1558 }
1559 // Returned widened new guy
1560 return make(_lo,_hi,_widen+1);
1561 }
1563 // If old guy contains new, then we probably widened too far & dropped to
1564 // bottom. Return the wider fellow.
1565 if ( ot->_lo <= _lo && ot->_hi >= _hi )
1566 return old;
1568 // fatal("Long value range is not subset");
1569 // return this;
1570 return TypeLong::LONG;
1571 }
1573 //------------------------------narrow----------------------------------------
1574 // Only happens for pessimistic optimizations.
1575 const Type *TypeLong::narrow( const Type *old ) const {
1576 if (_lo >= _hi) return this; // already narrow enough
1577 if (old == NULL) return this;
1578 const TypeLong* ot = old->isa_long();
1579 if (ot == NULL) return this;
1580 jlong olo = ot->_lo;
1581 jlong ohi = ot->_hi;
1583 // If new guy is equal to old guy, no narrowing
1584 if (_lo == olo && _hi == ohi) return old;
1586 // If old guy was maximum range, allow the narrowing
1587 if (olo == min_jlong && ohi == max_jlong) return this;
1589 if (_lo < olo || _hi > ohi)
1590 return this; // doesn't narrow; pretty wierd
1592 // The new type narrows the old type, so look for a "death march".
1593 // See comments on PhaseTransform::saturate.
1594 julong nrange = _hi - _lo;
1595 julong orange = ohi - olo;
1596 if (nrange < max_julong - 1 && nrange > (orange >> 1) + (SMALLINT*2)) {
1597 // Use the new type only if the range shrinks a lot.
1598 // We do not want the optimizer computing 2^31 point by point.
1599 return old;
1600 }
1602 return this;
1603 }
1605 //-----------------------------filter------------------------------------------
1606 const Type *TypeLong::filter_helper(const Type *kills, bool include_speculative) const {
1607 const TypeLong* ft = join_helper(kills, include_speculative)->isa_long();
1608 if (ft == NULL || ft->empty())
1609 return Type::TOP; // Canonical empty value
1610 if (ft->_widen < this->_widen) {
1611 // Do not allow the value of kill->_widen to affect the outcome.
1612 // The widen bits must be allowed to run freely through the graph.
1613 ft = TypeLong::make(ft->_lo, ft->_hi, this->_widen);
1614 }
1615 return ft;
1616 }
1618 //------------------------------eq---------------------------------------------
1619 // Structural equality check for Type representations
1620 bool TypeLong::eq( const Type *t ) const {
1621 const TypeLong *r = t->is_long(); // Handy access
1622 return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen;
1623 }
1625 //------------------------------hash-------------------------------------------
1626 // Type-specific hashing function.
1627 int TypeLong::hash(void) const {
1628 return (int)(_lo+_hi+_widen+(int)Type::Long);
1629 }
1631 //------------------------------is_finite--------------------------------------
1632 // Has a finite value
1633 bool TypeLong::is_finite() const {
1634 return true;
1635 }
1637 //------------------------------dump2------------------------------------------
1638 // Dump TypeLong
1639 #ifndef PRODUCT
1640 static const char* longnamenear(jlong x, const char* xname, char* buf, jlong n) {
1641 if (n > x) {
1642 if (n >= x + 10000) return NULL;
1643 sprintf(buf, "%s+" JLONG_FORMAT, xname, n - x);
1644 } else if (n < x) {
1645 if (n <= x - 10000) return NULL;
1646 sprintf(buf, "%s-" JLONG_FORMAT, xname, x - n);
1647 } else {
1648 return xname;
1649 }
1650 return buf;
1651 }
1653 static const char* longname(char* buf, jlong n) {
1654 const char* str;
1655 if (n == min_jlong)
1656 return "min";
1657 else if (n < min_jlong + 10000)
1658 sprintf(buf, "min+" JLONG_FORMAT, n - min_jlong);
1659 else if (n == max_jlong)
1660 return "max";
1661 else if (n > max_jlong - 10000)
1662 sprintf(buf, "max-" JLONG_FORMAT, max_jlong - n);
1663 else if ((str = longnamenear(max_juint, "maxuint", buf, n)) != NULL)
1664 return str;
1665 else if ((str = longnamenear(max_jint, "maxint", buf, n)) != NULL)
1666 return str;
1667 else if ((str = longnamenear(min_jint, "minint", buf, n)) != NULL)
1668 return str;
1669 else
1670 sprintf(buf, JLONG_FORMAT, n);
1671 return buf;
1672 }
1674 void TypeLong::dump2( Dict &d, uint depth, outputStream *st ) const {
1675 char buf[80], buf2[80];
1676 if (_lo == min_jlong && _hi == max_jlong)
1677 st->print("long");
1678 else if (is_con())
1679 st->print("long:%s", longname(buf, get_con()));
1680 else if (_hi == max_jlong)
1681 st->print("long:>=%s", longname(buf, _lo));
1682 else if (_lo == min_jlong)
1683 st->print("long:<=%s", longname(buf, _hi));
1684 else
1685 st->print("long:%s..%s", longname(buf, _lo), longname(buf2, _hi));
1687 if (_widen != 0 && this != TypeLong::LONG)
1688 st->print(":%.*s", _widen, "wwww");
1689 }
1690 #endif
1692 //------------------------------singleton--------------------------------------
1693 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1694 // constants
1695 bool TypeLong::singleton(void) const {
1696 return _lo >= _hi;
1697 }
1699 bool TypeLong::empty(void) const {
1700 return _lo > _hi;
1701 }
1703 //=============================================================================
1704 // Convenience common pre-built types.
1705 const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable
1706 const TypeTuple *TypeTuple::IFFALSE;
1707 const TypeTuple *TypeTuple::IFTRUE;
1708 const TypeTuple *TypeTuple::IFNEITHER;
1709 const TypeTuple *TypeTuple::LOOPBODY;
1710 const TypeTuple *TypeTuple::MEMBAR;
1711 const TypeTuple *TypeTuple::STORECONDITIONAL;
1712 const TypeTuple *TypeTuple::START_I2C;
1713 const TypeTuple *TypeTuple::INT_PAIR;
1714 const TypeTuple *TypeTuple::LONG_PAIR;
1715 const TypeTuple *TypeTuple::INT_CC_PAIR;
1716 const TypeTuple *TypeTuple::LONG_CC_PAIR;
1719 //------------------------------make-------------------------------------------
1720 // Make a TypeTuple from the range of a method signature
1721 const TypeTuple *TypeTuple::make_range(ciSignature* sig) {
1722 ciType* return_type = sig->return_type();
1723 uint total_fields = TypeFunc::Parms + return_type->size();
1724 const Type **field_array = fields(total_fields);
1725 switch (return_type->basic_type()) {
1726 case T_LONG:
1727 field_array[TypeFunc::Parms] = TypeLong::LONG;
1728 field_array[TypeFunc::Parms+1] = Type::HALF;
1729 break;
1730 case T_DOUBLE:
1731 field_array[TypeFunc::Parms] = Type::DOUBLE;
1732 field_array[TypeFunc::Parms+1] = Type::HALF;
1733 break;
1734 case T_OBJECT:
1735 case T_ARRAY:
1736 case T_BOOLEAN:
1737 case T_CHAR:
1738 case T_FLOAT:
1739 case T_BYTE:
1740 case T_SHORT:
1741 case T_INT:
1742 field_array[TypeFunc::Parms] = get_const_type(return_type);
1743 break;
1744 case T_VOID:
1745 break;
1746 default:
1747 ShouldNotReachHere();
1748 }
1749 return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons();
1750 }
1752 // Make a TypeTuple from the domain of a method signature
1753 const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig) {
1754 uint total_fields = TypeFunc::Parms + sig->size();
1756 uint pos = TypeFunc::Parms;
1757 const Type **field_array;
1758 if (recv != NULL) {
1759 total_fields++;
1760 field_array = fields(total_fields);
1761 // Use get_const_type here because it respects UseUniqueSubclasses:
1762 field_array[pos++] = get_const_type(recv)->join_speculative(TypePtr::NOTNULL);
1763 } else {
1764 field_array = fields(total_fields);
1765 }
1767 int i = 0;
1768 while (pos < total_fields) {
1769 ciType* type = sig->type_at(i);
1771 switch (type->basic_type()) {
1772 case T_LONG:
1773 field_array[pos++] = TypeLong::LONG;
1774 field_array[pos++] = Type::HALF;
1775 break;
1776 case T_DOUBLE:
1777 field_array[pos++] = Type::DOUBLE;
1778 field_array[pos++] = Type::HALF;
1779 break;
1780 case T_OBJECT:
1781 case T_ARRAY:
1782 case T_FLOAT:
1783 case T_INT:
1784 field_array[pos++] = get_const_type(type);
1785 break;
1786 case T_BOOLEAN:
1787 case T_CHAR:
1788 case T_BYTE:
1789 case T_SHORT:
1790 field_array[pos++] = TypeInt::INT;
1791 break;
1792 default:
1793 ShouldNotReachHere();
1794 }
1795 i++;
1796 }
1797 return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons();
1798 }
1800 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) {
1801 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons();
1802 }
1804 //------------------------------fields-----------------------------------------
1805 // Subroutine call type with space allocated for argument types
1806 const Type **TypeTuple::fields( uint arg_cnt ) {
1807 const Type **flds = (const Type **)(Compile::current()->type_arena()->Amalloc_4((TypeFunc::Parms+arg_cnt)*sizeof(Type*) ));
1808 flds[TypeFunc::Control ] = Type::CONTROL;
1809 flds[TypeFunc::I_O ] = Type::ABIO;
1810 flds[TypeFunc::Memory ] = Type::MEMORY;
1811 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM;
1812 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS;
1814 return flds;
1815 }
1817 //------------------------------meet-------------------------------------------
1818 // Compute the MEET of two types. It returns a new Type object.
1819 const Type *TypeTuple::xmeet( const Type *t ) const {
1820 // Perform a fast test for common case; meeting the same types together.
1821 if( this == t ) return this; // Meeting same type-rep?
1823 // Current "this->_base" is Tuple
1824 switch (t->base()) { // switch on original type
1826 case Bottom: // Ye Olde Default
1827 return t;
1829 default: // All else is a mistake
1830 typerr(t);
1832 case Tuple: { // Meeting 2 signatures?
1833 const TypeTuple *x = t->is_tuple();
1834 assert( _cnt == x->_cnt, "" );
1835 const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) ));
1836 for( uint i=0; i<_cnt; i++ )
1837 fields[i] = field_at(i)->xmeet( x->field_at(i) );
1838 return TypeTuple::make(_cnt,fields);
1839 }
1840 case Top:
1841 break;
1842 }
1843 return this; // Return the double constant
1844 }
1846 //------------------------------xdual------------------------------------------
1847 // Dual: compute field-by-field dual
1848 const Type *TypeTuple::xdual() const {
1849 const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) ));
1850 for( uint i=0; i<_cnt; i++ )
1851 fields[i] = _fields[i]->dual();
1852 return new TypeTuple(_cnt,fields);
1853 }
1855 //------------------------------eq---------------------------------------------
1856 // Structural equality check for Type representations
1857 bool TypeTuple::eq( const Type *t ) const {
1858 const TypeTuple *s = (const TypeTuple *)t;
1859 if (_cnt != s->_cnt) return false; // Unequal field counts
1860 for (uint i = 0; i < _cnt; i++)
1861 if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION!
1862 return false; // Missed
1863 return true;
1864 }
1866 //------------------------------hash-------------------------------------------
1867 // Type-specific hashing function.
1868 int TypeTuple::hash(void) const {
1869 intptr_t sum = _cnt;
1870 for( uint i=0; i<_cnt; i++ )
1871 sum += (intptr_t)_fields[i]; // Hash on pointers directly
1872 return sum;
1873 }
1875 //------------------------------dump2------------------------------------------
1876 // Dump signature Type
1877 #ifndef PRODUCT
1878 void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const {
1879 st->print("{");
1880 if( !depth || d[this] ) { // Check for recursive print
1881 st->print("...}");
1882 return;
1883 }
1884 d.Insert((void*)this, (void*)this); // Stop recursion
1885 if( _cnt ) {
1886 uint i;
1887 for( i=0; i<_cnt-1; i++ ) {
1888 st->print("%d:", i);
1889 _fields[i]->dump2(d, depth-1, st);
1890 st->print(", ");
1891 }
1892 st->print("%d:", i);
1893 _fields[i]->dump2(d, depth-1, st);
1894 }
1895 st->print("}");
1896 }
1897 #endif
1899 //------------------------------singleton--------------------------------------
1900 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1901 // constants (Ldi nodes). Singletons are integer, float or double constants
1902 // or a single symbol.
1903 bool TypeTuple::singleton(void) const {
1904 return false; // Never a singleton
1905 }
1907 bool TypeTuple::empty(void) const {
1908 for( uint i=0; i<_cnt; i++ ) {
1909 if (_fields[i]->empty()) return true;
1910 }
1911 return false;
1912 }
1914 //=============================================================================
1915 // Convenience common pre-built types.
1917 inline const TypeInt* normalize_array_size(const TypeInt* size) {
1918 // Certain normalizations keep us sane when comparing types.
1919 // We do not want arrayOop variables to differ only by the wideness
1920 // of their index types. Pick minimum wideness, since that is the
1921 // forced wideness of small ranges anyway.
1922 if (size->_widen != Type::WidenMin)
1923 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin);
1924 else
1925 return size;
1926 }
1928 //------------------------------make-------------------------------------------
1929 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable) {
1930 if (UseCompressedOops && elem->isa_oopptr()) {
1931 elem = elem->make_narrowoop();
1932 }
1933 size = normalize_array_size(size);
1934 return (TypeAry*)(new TypeAry(elem,size,stable))->hashcons();
1935 }
1937 //------------------------------meet-------------------------------------------
1938 // Compute the MEET of two types. It returns a new Type object.
1939 const Type *TypeAry::xmeet( const Type *t ) const {
1940 // Perform a fast test for common case; meeting the same types together.
1941 if( this == t ) return this; // Meeting same type-rep?
1943 // Current "this->_base" is Ary
1944 switch (t->base()) { // switch on original type
1946 case Bottom: // Ye Olde Default
1947 return t;
1949 default: // All else is a mistake
1950 typerr(t);
1952 case Array: { // Meeting 2 arrays?
1953 const TypeAry *a = t->is_ary();
1954 return TypeAry::make(_elem->meet_speculative(a->_elem),
1955 _size->xmeet(a->_size)->is_int(),
1956 _stable & a->_stable);
1957 }
1958 case Top:
1959 break;
1960 }
1961 return this; // Return the double constant
1962 }
1964 //------------------------------xdual------------------------------------------
1965 // Dual: compute field-by-field dual
1966 const Type *TypeAry::xdual() const {
1967 const TypeInt* size_dual = _size->dual()->is_int();
1968 size_dual = normalize_array_size(size_dual);
1969 return new TypeAry(_elem->dual(), size_dual, !_stable);
1970 }
1972 //------------------------------eq---------------------------------------------
1973 // Structural equality check for Type representations
1974 bool TypeAry::eq( const Type *t ) const {
1975 const TypeAry *a = (const TypeAry*)t;
1976 return _elem == a->_elem &&
1977 _stable == a->_stable &&
1978 _size == a->_size;
1979 }
1981 //------------------------------hash-------------------------------------------
1982 // Type-specific hashing function.
1983 int TypeAry::hash(void) const {
1984 return (intptr_t)_elem + (intptr_t)_size + (_stable ? 43 : 0);
1985 }
1987 /**
1988 * Return same type without a speculative part in the element
1989 */
1990 const Type* TypeAry::remove_speculative() const {
1991 return make(_elem->remove_speculative(), _size, _stable);
1992 }
1994 //----------------------interface_vs_oop---------------------------------------
1995 #ifdef ASSERT
1996 bool TypeAry::interface_vs_oop(const Type *t) const {
1997 const TypeAry* t_ary = t->is_ary();
1998 if (t_ary) {
1999 const TypePtr* this_ptr = _elem->make_ptr(); // In case we have narrow_oops
2000 const TypePtr* t_ptr = t_ary->_elem->make_ptr();
2001 if(this_ptr != NULL && t_ptr != NULL) {
2002 return this_ptr->interface_vs_oop(t_ptr);
2003 }
2004 }
2005 return false;
2006 }
2007 #endif
2009 //------------------------------dump2------------------------------------------
2010 #ifndef PRODUCT
2011 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const {
2012 if (_stable) st->print("stable:");
2013 _elem->dump2(d, depth, st);
2014 st->print("[");
2015 _size->dump2(d, depth, st);
2016 st->print("]");
2017 }
2018 #endif
2020 //------------------------------singleton--------------------------------------
2021 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2022 // constants (Ldi nodes). Singletons are integer, float or double constants
2023 // or a single symbol.
2024 bool TypeAry::singleton(void) const {
2025 return false; // Never a singleton
2026 }
2028 bool TypeAry::empty(void) const {
2029 return _elem->empty() || _size->empty();
2030 }
2032 //--------------------------ary_must_be_exact----------------------------------
2033 bool TypeAry::ary_must_be_exact() const {
2034 if (!UseExactTypes) return false;
2035 // This logic looks at the element type of an array, and returns true
2036 // if the element type is either a primitive or a final instance class.
2037 // In such cases, an array built on this ary must have no subclasses.
2038 if (_elem == BOTTOM) return false; // general array not exact
2039 if (_elem == TOP ) return false; // inverted general array not exact
2040 const TypeOopPtr* toop = NULL;
2041 if (UseCompressedOops && _elem->isa_narrowoop()) {
2042 toop = _elem->make_ptr()->isa_oopptr();
2043 } else {
2044 toop = _elem->isa_oopptr();
2045 }
2046 if (!toop) return true; // a primitive type, like int
2047 ciKlass* tklass = toop->klass();
2048 if (tklass == NULL) return false; // unloaded class
2049 if (!tklass->is_loaded()) return false; // unloaded class
2050 const TypeInstPtr* tinst;
2051 if (_elem->isa_narrowoop())
2052 tinst = _elem->make_ptr()->isa_instptr();
2053 else
2054 tinst = _elem->isa_instptr();
2055 if (tinst)
2056 return tklass->as_instance_klass()->is_final();
2057 const TypeAryPtr* tap;
2058 if (_elem->isa_narrowoop())
2059 tap = _elem->make_ptr()->isa_aryptr();
2060 else
2061 tap = _elem->isa_aryptr();
2062 if (tap)
2063 return tap->ary()->ary_must_be_exact();
2064 return false;
2065 }
2067 //==============================TypeVect=======================================
2068 // Convenience common pre-built types.
2069 const TypeVect *TypeVect::VECTS = NULL; // 32-bit vectors
2070 const TypeVect *TypeVect::VECTD = NULL; // 64-bit vectors
2071 const TypeVect *TypeVect::VECTX = NULL; // 128-bit vectors
2072 const TypeVect *TypeVect::VECTY = NULL; // 256-bit vectors
2074 //------------------------------make-------------------------------------------
2075 const TypeVect* TypeVect::make(const Type *elem, uint length) {
2076 BasicType elem_bt = elem->array_element_basic_type();
2077 assert(is_java_primitive(elem_bt), "only primitive types in vector");
2078 assert(length > 1 && is_power_of_2(length), "vector length is power of 2");
2079 assert(Matcher::vector_size_supported(elem_bt, length), "length in range");
2080 int size = length * type2aelembytes(elem_bt);
2081 switch (Matcher::vector_ideal_reg(size)) {
2082 case Op_VecS:
2083 return (TypeVect*)(new TypeVectS(elem, length))->hashcons();
2084 case Op_RegL:
2085 case Op_VecD:
2086 case Op_RegD:
2087 return (TypeVect*)(new TypeVectD(elem, length))->hashcons();
2088 case Op_VecX:
2089 return (TypeVect*)(new TypeVectX(elem, length))->hashcons();
2090 case Op_VecY:
2091 return (TypeVect*)(new TypeVectY(elem, length))->hashcons();
2092 }
2093 ShouldNotReachHere();
2094 return NULL;
2095 }
2097 //------------------------------meet-------------------------------------------
2098 // Compute the MEET of two types. It returns a new Type object.
2099 const Type *TypeVect::xmeet( const Type *t ) const {
2100 // Perform a fast test for common case; meeting the same types together.
2101 if( this == t ) return this; // Meeting same type-rep?
2103 // Current "this->_base" is Vector
2104 switch (t->base()) { // switch on original type
2106 case Bottom: // Ye Olde Default
2107 return t;
2109 default: // All else is a mistake
2110 typerr(t);
2112 case VectorS:
2113 case VectorD:
2114 case VectorX:
2115 case VectorY: { // Meeting 2 vectors?
2116 const TypeVect* v = t->is_vect();
2117 assert( base() == v->base(), "");
2118 assert(length() == v->length(), "");
2119 assert(element_basic_type() == v->element_basic_type(), "");
2120 return TypeVect::make(_elem->xmeet(v->_elem), _length);
2121 }
2122 case Top:
2123 break;
2124 }
2125 return this;
2126 }
2128 //------------------------------xdual------------------------------------------
2129 // Dual: compute field-by-field dual
2130 const Type *TypeVect::xdual() const {
2131 return new TypeVect(base(), _elem->dual(), _length);
2132 }
2134 //------------------------------eq---------------------------------------------
2135 // Structural equality check for Type representations
2136 bool TypeVect::eq(const Type *t) const {
2137 const TypeVect *v = t->is_vect();
2138 return (_elem == v->_elem) && (_length == v->_length);
2139 }
2141 //------------------------------hash-------------------------------------------
2142 // Type-specific hashing function.
2143 int TypeVect::hash(void) const {
2144 return (intptr_t)_elem + (intptr_t)_length;
2145 }
2147 //------------------------------singleton--------------------------------------
2148 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2149 // constants (Ldi nodes). Vector is singleton if all elements are the same
2150 // constant value (when vector is created with Replicate code).
2151 bool TypeVect::singleton(void) const {
2152 // There is no Con node for vectors yet.
2153 // return _elem->singleton();
2154 return false;
2155 }
2157 bool TypeVect::empty(void) const {
2158 return _elem->empty();
2159 }
2161 //------------------------------dump2------------------------------------------
2162 #ifndef PRODUCT
2163 void TypeVect::dump2(Dict &d, uint depth, outputStream *st) const {
2164 switch (base()) {
2165 case VectorS:
2166 st->print("vectors["); break;
2167 case VectorD:
2168 st->print("vectord["); break;
2169 case VectorX:
2170 st->print("vectorx["); break;
2171 case VectorY:
2172 st->print("vectory["); break;
2173 default:
2174 ShouldNotReachHere();
2175 }
2176 st->print("%d]:{", _length);
2177 _elem->dump2(d, depth, st);
2178 st->print("}");
2179 }
2180 #endif
2183 //=============================================================================
2184 // Convenience common pre-built types.
2185 const TypePtr *TypePtr::NULL_PTR;
2186 const TypePtr *TypePtr::NOTNULL;
2187 const TypePtr *TypePtr::BOTTOM;
2189 //------------------------------meet-------------------------------------------
2190 // Meet over the PTR enum
2191 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = {
2192 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,
2193 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,},
2194 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,},
2195 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,},
2196 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,},
2197 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,},
2198 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,}
2199 };
2201 //------------------------------make-------------------------------------------
2202 const TypePtr *TypePtr::make( TYPES t, enum PTR ptr, int offset ) {
2203 return (TypePtr*)(new TypePtr(t,ptr,offset))->hashcons();
2204 }
2206 //------------------------------cast_to_ptr_type-------------------------------
2207 const Type *TypePtr::cast_to_ptr_type(PTR ptr) const {
2208 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
2209 if( ptr == _ptr ) return this;
2210 return make(_base, ptr, _offset);
2211 }
2213 //------------------------------get_con----------------------------------------
2214 intptr_t TypePtr::get_con() const {
2215 assert( _ptr == Null, "" );
2216 return _offset;
2217 }
2219 //------------------------------meet-------------------------------------------
2220 // Compute the MEET of two types. It returns a new Type object.
2221 const Type *TypePtr::xmeet( const Type *t ) const {
2222 // Perform a fast test for common case; meeting the same types together.
2223 if( this == t ) return this; // Meeting same type-rep?
2225 // Current "this->_base" is AnyPtr
2226 switch (t->base()) { // switch on original type
2227 case Int: // Mixing ints & oops happens when javac
2228 case Long: // reuses local variables
2229 case FloatTop:
2230 case FloatCon:
2231 case FloatBot:
2232 case DoubleTop:
2233 case DoubleCon:
2234 case DoubleBot:
2235 case NarrowOop:
2236 case NarrowKlass:
2237 case Bottom: // Ye Olde Default
2238 return Type::BOTTOM;
2239 case Top:
2240 return this;
2242 case AnyPtr: { // Meeting to AnyPtrs
2243 const TypePtr *tp = t->is_ptr();
2244 return make( AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()) );
2245 }
2246 case RawPtr: // For these, flip the call around to cut down
2247 case OopPtr:
2248 case InstPtr: // on the cases I have to handle.
2249 case AryPtr:
2250 case MetadataPtr:
2251 case KlassPtr:
2252 return t->xmeet(this); // Call in reverse direction
2253 default: // All else is a mistake
2254 typerr(t);
2256 }
2257 return this;
2258 }
2260 //------------------------------meet_offset------------------------------------
2261 int TypePtr::meet_offset( int offset ) const {
2262 // Either is 'TOP' offset? Return the other offset!
2263 if( _offset == OffsetTop ) return offset;
2264 if( offset == OffsetTop ) return _offset;
2265 // If either is different, return 'BOTTOM' offset
2266 if( _offset != offset ) return OffsetBot;
2267 return _offset;
2268 }
2270 //------------------------------dual_offset------------------------------------
2271 int TypePtr::dual_offset( ) const {
2272 if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM'
2273 if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP'
2274 return _offset; // Map everything else into self
2275 }
2277 //------------------------------xdual------------------------------------------
2278 // Dual: compute field-by-field dual
2279 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
2280 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
2281 };
2282 const Type *TypePtr::xdual() const {
2283 return new TypePtr( AnyPtr, dual_ptr(), dual_offset() );
2284 }
2286 //------------------------------xadd_offset------------------------------------
2287 int TypePtr::xadd_offset( intptr_t offset ) const {
2288 // Adding to 'TOP' offset? Return 'TOP'!
2289 if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop;
2290 // Adding to 'BOTTOM' offset? Return 'BOTTOM'!
2291 if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot;
2292 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'!
2293 offset += (intptr_t)_offset;
2294 if (offset != (int)offset || offset == OffsetTop) return OffsetBot;
2296 // assert( _offset >= 0 && _offset+offset >= 0, "" );
2297 // It is possible to construct a negative offset during PhaseCCP
2299 return (int)offset; // Sum valid offsets
2300 }
2302 //------------------------------add_offset-------------------------------------
2303 const TypePtr *TypePtr::add_offset( intptr_t offset ) const {
2304 return make( AnyPtr, _ptr, xadd_offset(offset) );
2305 }
2307 //------------------------------eq---------------------------------------------
2308 // Structural equality check for Type representations
2309 bool TypePtr::eq( const Type *t ) const {
2310 const TypePtr *a = (const TypePtr*)t;
2311 return _ptr == a->ptr() && _offset == a->offset();
2312 }
2314 //------------------------------hash-------------------------------------------
2315 // Type-specific hashing function.
2316 int TypePtr::hash(void) const {
2317 return _ptr + _offset;
2318 }
2320 //------------------------------dump2------------------------------------------
2321 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
2322 "TopPTR","AnyNull","Constant","NULL","NotNull","BotPTR"
2323 };
2325 #ifndef PRODUCT
2326 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
2327 if( _ptr == Null ) st->print("NULL");
2328 else st->print("%s *", ptr_msg[_ptr]);
2329 if( _offset == OffsetTop ) st->print("+top");
2330 else if( _offset == OffsetBot ) st->print("+bot");
2331 else if( _offset ) st->print("+%d", _offset);
2332 }
2333 #endif
2335 //------------------------------singleton--------------------------------------
2336 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2337 // constants
2338 bool TypePtr::singleton(void) const {
2339 // TopPTR, Null, AnyNull, Constant are all singletons
2340 return (_offset != OffsetBot) && !below_centerline(_ptr);
2341 }
2343 bool TypePtr::empty(void) const {
2344 return (_offset == OffsetTop) || above_centerline(_ptr);
2345 }
2347 //=============================================================================
2348 // Convenience common pre-built types.
2349 const TypeRawPtr *TypeRawPtr::BOTTOM;
2350 const TypeRawPtr *TypeRawPtr::NOTNULL;
2352 //------------------------------make-------------------------------------------
2353 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
2354 assert( ptr != Constant, "what is the constant?" );
2355 assert( ptr != Null, "Use TypePtr for NULL" );
2356 return (TypeRawPtr*)(new TypeRawPtr(ptr,0))->hashcons();
2357 }
2359 const TypeRawPtr *TypeRawPtr::make( address bits ) {
2360 assert( bits, "Use TypePtr for NULL" );
2361 return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons();
2362 }
2364 //------------------------------cast_to_ptr_type-------------------------------
2365 const Type *TypeRawPtr::cast_to_ptr_type(PTR ptr) const {
2366 assert( ptr != Constant, "what is the constant?" );
2367 assert( ptr != Null, "Use TypePtr for NULL" );
2368 assert( _bits==0, "Why cast a constant address?");
2369 if( ptr == _ptr ) return this;
2370 return make(ptr);
2371 }
2373 //------------------------------get_con----------------------------------------
2374 intptr_t TypeRawPtr::get_con() const {
2375 assert( _ptr == Null || _ptr == Constant, "" );
2376 return (intptr_t)_bits;
2377 }
2379 //------------------------------meet-------------------------------------------
2380 // Compute the MEET of two types. It returns a new Type object.
2381 const Type *TypeRawPtr::xmeet( const Type *t ) const {
2382 // Perform a fast test for common case; meeting the same types together.
2383 if( this == t ) return this; // Meeting same type-rep?
2385 // Current "this->_base" is RawPtr
2386 switch( t->base() ) { // switch on original type
2387 case Bottom: // Ye Olde Default
2388 return t;
2389 case Top:
2390 return this;
2391 case AnyPtr: // Meeting to AnyPtrs
2392 break;
2393 case RawPtr: { // might be top, bot, any/not or constant
2394 enum PTR tptr = t->is_ptr()->ptr();
2395 enum PTR ptr = meet_ptr( tptr );
2396 if( ptr == Constant ) { // Cannot be equal constants, so...
2397 if( tptr == Constant && _ptr != Constant) return t;
2398 if( _ptr == Constant && tptr != Constant) return this;
2399 ptr = NotNull; // Fall down in lattice
2400 }
2401 return make( ptr );
2402 }
2404 case OopPtr:
2405 case InstPtr:
2406 case AryPtr:
2407 case MetadataPtr:
2408 case KlassPtr:
2409 return TypePtr::BOTTOM; // Oop meet raw is not well defined
2410 default: // All else is a mistake
2411 typerr(t);
2412 }
2414 // Found an AnyPtr type vs self-RawPtr type
2415 const TypePtr *tp = t->is_ptr();
2416 switch (tp->ptr()) {
2417 case TypePtr::TopPTR: return this;
2418 case TypePtr::BotPTR: return t;
2419 case TypePtr::Null:
2420 if( _ptr == TypePtr::TopPTR ) return t;
2421 return TypeRawPtr::BOTTOM;
2422 case TypePtr::NotNull: return TypePtr::make( AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0) );
2423 case TypePtr::AnyNull:
2424 if( _ptr == TypePtr::Constant) return this;
2425 return make( meet_ptr(TypePtr::AnyNull) );
2426 default: ShouldNotReachHere();
2427 }
2428 return this;
2429 }
2431 //------------------------------xdual------------------------------------------
2432 // Dual: compute field-by-field dual
2433 const Type *TypeRawPtr::xdual() const {
2434 return new TypeRawPtr( dual_ptr(), _bits );
2435 }
2437 //------------------------------add_offset-------------------------------------
2438 const TypePtr *TypeRawPtr::add_offset( intptr_t offset ) const {
2439 if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer
2440 if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer
2441 if( offset == 0 ) return this; // No change
2442 switch (_ptr) {
2443 case TypePtr::TopPTR:
2444 case TypePtr::BotPTR:
2445 case TypePtr::NotNull:
2446 return this;
2447 case TypePtr::Null:
2448 case TypePtr::Constant: {
2449 address bits = _bits+offset;
2450 if ( bits == 0 ) return TypePtr::NULL_PTR;
2451 return make( bits );
2452 }
2453 default: ShouldNotReachHere();
2454 }
2455 return NULL; // Lint noise
2456 }
2458 //------------------------------eq---------------------------------------------
2459 // Structural equality check for Type representations
2460 bool TypeRawPtr::eq( const Type *t ) const {
2461 const TypeRawPtr *a = (const TypeRawPtr*)t;
2462 return _bits == a->_bits && TypePtr::eq(t);
2463 }
2465 //------------------------------hash-------------------------------------------
2466 // Type-specific hashing function.
2467 int TypeRawPtr::hash(void) const {
2468 return (intptr_t)_bits + TypePtr::hash();
2469 }
2471 //------------------------------dump2------------------------------------------
2472 #ifndef PRODUCT
2473 void TypeRawPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
2474 if( _ptr == Constant )
2475 st->print(INTPTR_FORMAT, _bits);
2476 else
2477 st->print("rawptr:%s", ptr_msg[_ptr]);
2478 }
2479 #endif
2481 //=============================================================================
2482 // Convenience common pre-built type.
2483 const TypeOopPtr *TypeOopPtr::BOTTOM;
2485 //------------------------------TypeOopPtr-------------------------------------
2486 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, bool xk, ciObject* o, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth)
2487 : TypePtr(t, ptr, offset),
2488 _const_oop(o), _klass(k),
2489 _klass_is_exact(xk),
2490 _is_ptr_to_narrowoop(false),
2491 _is_ptr_to_narrowklass(false),
2492 _is_ptr_to_boxed_value(false),
2493 _instance_id(instance_id),
2494 _speculative(speculative),
2495 _inline_depth(inline_depth){
2496 if (Compile::current()->eliminate_boxing() && (t == InstPtr) &&
2497 (offset > 0) && xk && (k != 0) && k->is_instance_klass()) {
2498 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset);
2499 }
2500 #ifdef _LP64
2501 if (_offset != 0) {
2502 if (_offset == oopDesc::klass_offset_in_bytes()) {
2503 _is_ptr_to_narrowklass = UseCompressedClassPointers;
2504 } else if (klass() == NULL) {
2505 // Array with unknown body type
2506 assert(this->isa_aryptr(), "only arrays without klass");
2507 _is_ptr_to_narrowoop = UseCompressedOops;
2508 } else if (this->isa_aryptr()) {
2509 _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() &&
2510 _offset != arrayOopDesc::length_offset_in_bytes());
2511 } else if (klass()->is_instance_klass()) {
2512 ciInstanceKlass* ik = klass()->as_instance_klass();
2513 ciField* field = NULL;
2514 if (this->isa_klassptr()) {
2515 // Perm objects don't use compressed references
2516 } else if (_offset == OffsetBot || _offset == OffsetTop) {
2517 // unsafe access
2518 _is_ptr_to_narrowoop = UseCompressedOops;
2519 } else { // exclude unsafe ops
2520 assert(this->isa_instptr(), "must be an instance ptr.");
2522 if (klass() == ciEnv::current()->Class_klass() &&
2523 (_offset == java_lang_Class::klass_offset_in_bytes() ||
2524 _offset == java_lang_Class::array_klass_offset_in_bytes())) {
2525 // Special hidden fields from the Class.
2526 assert(this->isa_instptr(), "must be an instance ptr.");
2527 _is_ptr_to_narrowoop = false;
2528 } else if (klass() == ciEnv::current()->Class_klass() &&
2529 _offset >= InstanceMirrorKlass::offset_of_static_fields()) {
2530 // Static fields
2531 assert(o != NULL, "must be constant");
2532 ciInstanceKlass* k = o->as_instance()->java_lang_Class_klass()->as_instance_klass();
2533 ciField* field = k->get_field_by_offset(_offset, true);
2534 assert(field != NULL, "missing field");
2535 BasicType basic_elem_type = field->layout_type();
2536 _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT ||
2537 basic_elem_type == T_ARRAY);
2538 } else {
2539 // Instance fields which contains a compressed oop references.
2540 field = ik->get_field_by_offset(_offset, false);
2541 if (field != NULL) {
2542 BasicType basic_elem_type = field->layout_type();
2543 _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT ||
2544 basic_elem_type == T_ARRAY);
2545 } else if (klass()->equals(ciEnv::current()->Object_klass())) {
2546 // Compile::find_alias_type() cast exactness on all types to verify
2547 // that it does not affect alias type.
2548 _is_ptr_to_narrowoop = UseCompressedOops;
2549 } else {
2550 // Type for the copy start in LibraryCallKit::inline_native_clone().
2551 _is_ptr_to_narrowoop = UseCompressedOops;
2552 }
2553 }
2554 }
2555 }
2556 }
2557 #endif
2558 }
2560 //------------------------------make-------------------------------------------
2561 const TypeOopPtr *TypeOopPtr::make(PTR ptr,
2562 int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) {
2563 assert(ptr != Constant, "no constant generic pointers");
2564 ciKlass* k = Compile::current()->env()->Object_klass();
2565 bool xk = false;
2566 ciObject* o = NULL;
2567 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, xk, o, offset, instance_id, speculative, inline_depth))->hashcons();
2568 }
2571 //------------------------------cast_to_ptr_type-------------------------------
2572 const Type *TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
2573 assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
2574 if( ptr == _ptr ) return this;
2575 return make(ptr, _offset, _instance_id, _speculative, _inline_depth);
2576 }
2578 //-----------------------------cast_to_instance_id----------------------------
2579 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
2580 // There are no instances of a general oop.
2581 // Return self unchanged.
2582 return this;
2583 }
2585 //-----------------------------cast_to_exactness-------------------------------
2586 const Type *TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
2587 // There is no such thing as an exact general oop.
2588 // Return self unchanged.
2589 return this;
2590 }
2593 //------------------------------as_klass_type----------------------------------
2594 // Return the klass type corresponding to this instance or array type.
2595 // It is the type that is loaded from an object of this type.
2596 const TypeKlassPtr* TypeOopPtr::as_klass_type() const {
2597 ciKlass* k = klass();
2598 bool xk = klass_is_exact();
2599 if (k == NULL)
2600 return TypeKlassPtr::OBJECT;
2601 else
2602 return TypeKlassPtr::make(xk? Constant: NotNull, k, 0);
2603 }
2605 const Type *TypeOopPtr::xmeet(const Type *t) const {
2606 const Type* res = xmeet_helper(t);
2607 if (res->isa_oopptr() == NULL) {
2608 return res;
2609 }
2611 const TypeOopPtr* res_oopptr = res->is_oopptr();
2612 if (res_oopptr->speculative() != NULL) {
2613 // type->speculative() == NULL means that speculation is no better
2614 // than type, i.e. type->speculative() == type. So there are 2
2615 // ways to represent the fact that we have no useful speculative
2616 // data and we should use a single one to be able to test for
2617 // equality between types. Check whether type->speculative() ==
2618 // type and set speculative to NULL if it is the case.
2619 if (res_oopptr->remove_speculative() == res_oopptr->speculative()) {
2620 return res_oopptr->remove_speculative();
2621 }
2622 }
2624 return res;
2625 }
2627 //------------------------------meet-------------------------------------------
2628 // Compute the MEET of two types. It returns a new Type object.
2629 const Type *TypeOopPtr::xmeet_helper(const Type *t) const {
2630 // Perform a fast test for common case; meeting the same types together.
2631 if( this == t ) return this; // Meeting same type-rep?
2633 // Current "this->_base" is OopPtr
2634 switch (t->base()) { // switch on original type
2636 case Int: // Mixing ints & oops happens when javac
2637 case Long: // reuses local variables
2638 case FloatTop:
2639 case FloatCon:
2640 case FloatBot:
2641 case DoubleTop:
2642 case DoubleCon:
2643 case DoubleBot:
2644 case NarrowOop:
2645 case NarrowKlass:
2646 case Bottom: // Ye Olde Default
2647 return Type::BOTTOM;
2648 case Top:
2649 return this;
2651 default: // All else is a mistake
2652 typerr(t);
2654 case RawPtr:
2655 case MetadataPtr:
2656 case KlassPtr:
2657 return TypePtr::BOTTOM; // Oop meet raw is not well defined
2659 case AnyPtr: {
2660 // Found an AnyPtr type vs self-OopPtr type
2661 const TypePtr *tp = t->is_ptr();
2662 int offset = meet_offset(tp->offset());
2663 PTR ptr = meet_ptr(tp->ptr());
2664 switch (tp->ptr()) {
2665 case Null:
2666 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset);
2667 // else fall through:
2668 case TopPTR:
2669 case AnyNull: {
2670 int instance_id = meet_instance_id(InstanceTop);
2671 const TypeOopPtr* speculative = _speculative;
2672 return make(ptr, offset, instance_id, speculative, _inline_depth);
2673 }
2674 case BotPTR:
2675 case NotNull:
2676 return TypePtr::make(AnyPtr, ptr, offset);
2677 default: typerr(t);
2678 }
2679 }
2681 case OopPtr: { // Meeting to other OopPtrs
2682 const TypeOopPtr *tp = t->is_oopptr();
2683 int instance_id = meet_instance_id(tp->instance_id());
2684 const TypeOopPtr* speculative = xmeet_speculative(tp);
2685 int depth = meet_inline_depth(tp->inline_depth());
2686 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth);
2687 }
2689 case InstPtr: // For these, flip the call around to cut down
2690 case AryPtr:
2691 return t->xmeet(this); // Call in reverse direction
2693 } // End of switch
2694 return this; // Return the double constant
2695 }
2698 //------------------------------xdual------------------------------------------
2699 // Dual of a pure heap pointer. No relevant klass or oop information.
2700 const Type *TypeOopPtr::xdual() const {
2701 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here");
2702 assert(const_oop() == NULL, "no constants here");
2703 return new TypeOopPtr(_base, dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
2704 }
2706 //--------------------------make_from_klass_common-----------------------------
2707 // Computes the element-type given a klass.
2708 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact) {
2709 if (klass->is_instance_klass()) {
2710 Compile* C = Compile::current();
2711 Dependencies* deps = C->dependencies();
2712 assert((deps != NULL) == (C->method() != NULL && C->method()->code_size() > 0), "sanity");
2713 // Element is an instance
2714 bool klass_is_exact = false;
2715 if (klass->is_loaded()) {
2716 // Try to set klass_is_exact.
2717 ciInstanceKlass* ik = klass->as_instance_klass();
2718 klass_is_exact = ik->is_final();
2719 if (!klass_is_exact && klass_change
2720 && deps != NULL && UseUniqueSubclasses) {
2721 ciInstanceKlass* sub = ik->unique_concrete_subklass();
2722 if (sub != NULL) {
2723 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
2724 klass = ik = sub;
2725 klass_is_exact = sub->is_final();
2726 }
2727 }
2728 if (!klass_is_exact && try_for_exact
2729 && deps != NULL && UseExactTypes) {
2730 if (!ik->is_interface() && !ik->has_subklass()) {
2731 // Add a dependence; if concrete subclass added we need to recompile
2732 deps->assert_leaf_type(ik);
2733 klass_is_exact = true;
2734 }
2735 }
2736 }
2737 return TypeInstPtr::make(TypePtr::BotPTR, klass, klass_is_exact, NULL, 0);
2738 } else if (klass->is_obj_array_klass()) {
2739 // Element is an object array. Recursively call ourself.
2740 const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(klass->as_obj_array_klass()->element_klass(), false, try_for_exact);
2741 bool xk = etype->klass_is_exact();
2742 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
2743 // We used to pass NotNull in here, asserting that the sub-arrays
2744 // are all not-null. This is not true in generally, as code can
2745 // slam NULLs down in the subarrays.
2746 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, xk, 0);
2747 return arr;
2748 } else if (klass->is_type_array_klass()) {
2749 // Element is an typeArray
2750 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
2751 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
2752 // We used to pass NotNull in here, asserting that the array pointer
2753 // is not-null. That was not true in general.
2754 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0);
2755 return arr;
2756 } else {
2757 ShouldNotReachHere();
2758 return NULL;
2759 }
2760 }
2762 //------------------------------make_from_constant-----------------------------
2763 // Make a java pointer from an oop constant
2764 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o,
2765 bool require_constant,
2766 bool is_autobox_cache) {
2767 assert(!o->is_null_object(), "null object not yet handled here.");
2768 ciKlass* klass = o->klass();
2769 if (klass->is_instance_klass()) {
2770 // Element is an instance
2771 if (require_constant) {
2772 if (!o->can_be_constant()) return NULL;
2773 } else if (!o->should_be_constant()) {
2774 return TypeInstPtr::make(TypePtr::NotNull, klass, true, NULL, 0);
2775 }
2776 return TypeInstPtr::make(o);
2777 } else if (klass->is_obj_array_klass()) {
2778 // Element is an object array. Recursively call ourself.
2779 const TypeOopPtr *etype =
2780 TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass());
2781 if (is_autobox_cache) {
2782 // The pointers in the autobox arrays are always non-null.
2783 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
2784 }
2785 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
2786 // We used to pass NotNull in here, asserting that the sub-arrays
2787 // are all not-null. This is not true in generally, as code can
2788 // slam NULLs down in the subarrays.
2789 if (require_constant) {
2790 if (!o->can_be_constant()) return NULL;
2791 } else if (!o->should_be_constant()) {
2792 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
2793 }
2794 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0, InstanceBot, NULL, InlineDepthBottom, is_autobox_cache);
2795 return arr;
2796 } else if (klass->is_type_array_klass()) {
2797 // Element is an typeArray
2798 const Type* etype =
2799 (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
2800 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
2801 // We used to pass NotNull in here, asserting that the array pointer
2802 // is not-null. That was not true in general.
2803 if (require_constant) {
2804 if (!o->can_be_constant()) return NULL;
2805 } else if (!o->should_be_constant()) {
2806 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
2807 }
2808 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
2809 return arr;
2810 }
2812 fatal("unhandled object type");
2813 return NULL;
2814 }
2816 //------------------------------get_con----------------------------------------
2817 intptr_t TypeOopPtr::get_con() const {
2818 assert( _ptr == Null || _ptr == Constant, "" );
2819 assert( _offset >= 0, "" );
2821 if (_offset != 0) {
2822 // After being ported to the compiler interface, the compiler no longer
2823 // directly manipulates the addresses of oops. Rather, it only has a pointer
2824 // to a handle at compile time. This handle is embedded in the generated
2825 // code and dereferenced at the time the nmethod is made. Until that time,
2826 // it is not reasonable to do arithmetic with the addresses of oops (we don't
2827 // have access to the addresses!). This does not seem to currently happen,
2828 // but this assertion here is to help prevent its occurence.
2829 tty->print_cr("Found oop constant with non-zero offset");
2830 ShouldNotReachHere();
2831 }
2833 return (intptr_t)const_oop()->constant_encoding();
2834 }
2837 //-----------------------------filter------------------------------------------
2838 // Do not allow interface-vs.-noninterface joins to collapse to top.
2839 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const {
2841 const Type* ft = join_helper(kills, include_speculative);
2842 const TypeInstPtr* ftip = ft->isa_instptr();
2843 const TypeInstPtr* ktip = kills->isa_instptr();
2845 if (ft->empty()) {
2846 // Check for evil case of 'this' being a class and 'kills' expecting an
2847 // interface. This can happen because the bytecodes do not contain
2848 // enough type info to distinguish a Java-level interface variable
2849 // from a Java-level object variable. If we meet 2 classes which
2850 // both implement interface I, but their meet is at 'j/l/O' which
2851 // doesn't implement I, we have no way to tell if the result should
2852 // be 'I' or 'j/l/O'. Thus we'll pick 'j/l/O'. If this then flows
2853 // into a Phi which "knows" it's an Interface type we'll have to
2854 // uplift the type.
2855 if (!empty()) {
2856 if (ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) {
2857 return kills; // Uplift to interface
2858 }
2859 // Also check for evil cases of 'this' being a class array
2860 // and 'kills' expecting an array of interfaces.
2861 Type::get_arrays_base_elements(ft, kills, NULL, &ktip);
2862 if (ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) {
2863 return kills; // Uplift to array of interface
2864 }
2865 }
2867 return Type::TOP; // Canonical empty value
2868 }
2870 // If we have an interface-typed Phi or cast and we narrow to a class type,
2871 // the join should report back the class. However, if we have a J/L/Object
2872 // class-typed Phi and an interface flows in, it's possible that the meet &
2873 // join report an interface back out. This isn't possible but happens
2874 // because the type system doesn't interact well with interfaces.
2875 if (ftip != NULL && ktip != NULL &&
2876 ftip->is_loaded() && ftip->klass()->is_interface() &&
2877 ktip->is_loaded() && !ktip->klass()->is_interface()) {
2878 // Happens in a CTW of rt.jar, 320-341, no extra flags
2879 assert(!ftip->klass_is_exact(), "interface could not be exact");
2880 return ktip->cast_to_ptr_type(ftip->ptr());
2881 }
2883 return ft;
2884 }
2886 //------------------------------eq---------------------------------------------
2887 // Structural equality check for Type representations
2888 bool TypeOopPtr::eq( const Type *t ) const {
2889 const TypeOopPtr *a = (const TypeOopPtr*)t;
2890 if (_klass_is_exact != a->_klass_is_exact ||
2891 _instance_id != a->_instance_id ||
2892 !eq_speculative(a) ||
2893 _inline_depth != a->_inline_depth) return false;
2894 ciObject* one = const_oop();
2895 ciObject* two = a->const_oop();
2896 if (one == NULL || two == NULL) {
2897 return (one == two) && TypePtr::eq(t);
2898 } else {
2899 return one->equals(two) && TypePtr::eq(t);
2900 }
2901 }
2903 //------------------------------hash-------------------------------------------
2904 // Type-specific hashing function.
2905 int TypeOopPtr::hash(void) const {
2906 return
2907 (const_oop() ? const_oop()->hash() : 0) +
2908 _klass_is_exact +
2909 _instance_id +
2910 hash_speculative() +
2911 _inline_depth +
2912 TypePtr::hash();
2913 }
2915 //------------------------------dump2------------------------------------------
2916 #ifndef PRODUCT
2917 void TypeOopPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
2918 st->print("oopptr:%s", ptr_msg[_ptr]);
2919 if( _klass_is_exact ) st->print(":exact");
2920 if( const_oop() ) st->print(INTPTR_FORMAT, const_oop());
2921 switch( _offset ) {
2922 case OffsetTop: st->print("+top"); break;
2923 case OffsetBot: st->print("+any"); break;
2924 case 0: break;
2925 default: st->print("+%d",_offset); break;
2926 }
2927 if (_instance_id == InstanceTop)
2928 st->print(",iid=top");
2929 else if (_instance_id != InstanceBot)
2930 st->print(",iid=%d",_instance_id);
2932 dump_inline_depth(st);
2933 dump_speculative(st);
2934 }
2936 /**
2937 *dump the speculative part of the type
2938 */
2939 void TypeOopPtr::dump_speculative(outputStream *st) const {
2940 if (_speculative != NULL) {
2941 st->print(" (speculative=");
2942 _speculative->dump_on(st);
2943 st->print(")");
2944 }
2945 }
2947 void TypeOopPtr::dump_inline_depth(outputStream *st) const {
2948 if (_inline_depth != InlineDepthBottom) {
2949 if (_inline_depth == InlineDepthTop) {
2950 st->print(" (inline_depth=InlineDepthTop)");
2951 } else {
2952 st->print(" (inline_depth=%d)", _inline_depth);
2953 }
2954 }
2955 }
2956 #endif
2958 //------------------------------singleton--------------------------------------
2959 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2960 // constants
2961 bool TypeOopPtr::singleton(void) const {
2962 // detune optimizer to not generate constant oop + constant offset as a constant!
2963 // TopPTR, Null, AnyNull, Constant are all singletons
2964 return (_offset == 0) && !below_centerline(_ptr);
2965 }
2967 //------------------------------add_offset-------------------------------------
2968 const TypePtr *TypeOopPtr::add_offset(intptr_t offset) const {
2969 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
2970 }
2972 /**
2973 * Return same type without a speculative part
2974 */
2975 const Type* TypeOopPtr::remove_speculative() const {
2976 if (_speculative == NULL) {
2977 return this;
2978 }
2979 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
2980 return make(_ptr, _offset, _instance_id, NULL, _inline_depth);
2981 }
2983 /**
2984 * Return same type but with a different inline depth (used for speculation)
2985 *
2986 * @param depth depth to meet with
2987 */
2988 const TypeOopPtr* TypeOopPtr::with_inline_depth(int depth) const {
2989 if (!UseInlineDepthForSpeculativeTypes) {
2990 return this;
2991 }
2992 return make(_ptr, _offset, _instance_id, _speculative, depth);
2993 }
2995 /**
2996 * Check whether new profiling would improve speculative type
2997 *
2998 * @param exact_kls class from profiling
2999 * @param inline_depth inlining depth of profile point
3000 *
3001 * @return true if type profile is valuable
3002 */
3003 bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const {
3004 // no way to improve an already exact type
3005 if (klass_is_exact()) {
3006 return false;
3007 }
3008 // no profiling?
3009 if (exact_kls == NULL) {
3010 return false;
3011 }
3012 // no speculative type or non exact speculative type?
3013 if (speculative_type() == NULL) {
3014 return true;
3015 }
3016 // If the node already has an exact speculative type keep it,
3017 // unless it was provided by profiling that is at a deeper
3018 // inlining level. Profiling at a higher inlining depth is
3019 // expected to be less accurate.
3020 if (_speculative->inline_depth() == InlineDepthBottom) {
3021 return false;
3022 }
3023 assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison");
3024 return inline_depth < _speculative->inline_depth();
3025 }
3027 //------------------------------meet_instance_id--------------------------------
3028 int TypeOopPtr::meet_instance_id( int instance_id ) const {
3029 // Either is 'TOP' instance? Return the other instance!
3030 if( _instance_id == InstanceTop ) return instance_id;
3031 if( instance_id == InstanceTop ) return _instance_id;
3032 // If either is different, return 'BOTTOM' instance
3033 if( _instance_id != instance_id ) return InstanceBot;
3034 return _instance_id;
3035 }
3037 //------------------------------dual_instance_id--------------------------------
3038 int TypeOopPtr::dual_instance_id( ) const {
3039 if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM
3040 if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP
3041 return _instance_id; // Map everything else into self
3042 }
3044 /**
3045 * meet of the speculative parts of 2 types
3046 *
3047 * @param other type to meet with
3048 */
3049 const TypeOopPtr* TypeOopPtr::xmeet_speculative(const TypeOopPtr* other) const {
3050 bool this_has_spec = (_speculative != NULL);
3051 bool other_has_spec = (other->speculative() != NULL);
3053 if (!this_has_spec && !other_has_spec) {
3054 return NULL;
3055 }
3057 // If we are at a point where control flow meets and one branch has
3058 // a speculative type and the other has not, we meet the speculative
3059 // type of one branch with the actual type of the other. If the
3060 // actual type is exact and the speculative is as well, then the
3061 // result is a speculative type which is exact and we can continue
3062 // speculation further.
3063 const TypeOopPtr* this_spec = _speculative;
3064 const TypeOopPtr* other_spec = other->speculative();
3066 if (!this_has_spec) {
3067 this_spec = this;
3068 }
3070 if (!other_has_spec) {
3071 other_spec = other;
3072 }
3074 return this_spec->meet_speculative(other_spec)->is_oopptr();
3075 }
3077 /**
3078 * dual of the speculative part of the type
3079 */
3080 const TypeOopPtr* TypeOopPtr::dual_speculative() const {
3081 if (_speculative == NULL) {
3082 return NULL;
3083 }
3084 return _speculative->dual()->is_oopptr();
3085 }
3087 /**
3088 * add offset to the speculative part of the type
3089 *
3090 * @param offset offset to add
3091 */
3092 const TypeOopPtr* TypeOopPtr::add_offset_speculative(intptr_t offset) const {
3093 if (_speculative == NULL) {
3094 return NULL;
3095 }
3096 return _speculative->add_offset(offset)->is_oopptr();
3097 }
3099 /**
3100 * Are the speculative parts of 2 types equal?
3101 *
3102 * @param other type to compare this one to
3103 */
3104 bool TypeOopPtr::eq_speculative(const TypeOopPtr* other) const {
3105 if (_speculative == NULL || other->speculative() == NULL) {
3106 return _speculative == other->speculative();
3107 }
3109 if (_speculative->base() != other->speculative()->base()) {
3110 return false;
3111 }
3113 return _speculative->eq(other->speculative());
3114 }
3116 /**
3117 * Hash of the speculative part of the type
3118 */
3119 int TypeOopPtr::hash_speculative() const {
3120 if (_speculative == NULL) {
3121 return 0;
3122 }
3124 return _speculative->hash();
3125 }
3127 /**
3128 * dual of the inline depth for this type (used for speculation)
3129 */
3130 int TypeOopPtr::dual_inline_depth() const {
3131 return -inline_depth();
3132 }
3134 /**
3135 * meet of 2 inline depth (used for speculation)
3136 *
3137 * @param depth depth to meet with
3138 */
3139 int TypeOopPtr::meet_inline_depth(int depth) const {
3140 return MAX2(inline_depth(), depth);
3141 }
3143 //=============================================================================
3144 // Convenience common pre-built types.
3145 const TypeInstPtr *TypeInstPtr::NOTNULL;
3146 const TypeInstPtr *TypeInstPtr::BOTTOM;
3147 const TypeInstPtr *TypeInstPtr::MIRROR;
3148 const TypeInstPtr *TypeInstPtr::MARK;
3149 const TypeInstPtr *TypeInstPtr::KLASS;
3151 //------------------------------TypeInstPtr-------------------------------------
3152 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, bool xk, ciObject* o, int off, int instance_id, const TypeOopPtr* speculative, int inline_depth)
3153 : TypeOopPtr(InstPtr, ptr, k, xk, o, off, instance_id, speculative, inline_depth), _name(k->name()) {
3154 assert(k != NULL &&
3155 (k->is_loaded() || o == NULL),
3156 "cannot have constants with non-loaded klass");
3157 };
3159 //------------------------------make-------------------------------------------
3160 const TypeInstPtr *TypeInstPtr::make(PTR ptr,
3161 ciKlass* k,
3162 bool xk,
3163 ciObject* o,
3164 int offset,
3165 int instance_id,
3166 const TypeOopPtr* speculative,
3167 int inline_depth) {
3168 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance");
3169 // Either const_oop() is NULL or else ptr is Constant
3170 assert( (!o && ptr != Constant) || (o && ptr == Constant),
3171 "constant pointers must have a value supplied" );
3172 // Ptr is never Null
3173 assert( ptr != Null, "NULL pointers are not typed" );
3175 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
3176 if (!UseExactTypes) xk = false;
3177 if (ptr == Constant) {
3178 // Note: This case includes meta-object constants, such as methods.
3179 xk = true;
3180 } else if (k->is_loaded()) {
3181 ciInstanceKlass* ik = k->as_instance_klass();
3182 if (!xk && ik->is_final()) xk = true; // no inexact final klass
3183 if (xk && ik->is_interface()) xk = false; // no exact interface
3184 }
3186 // Now hash this baby
3187 TypeInstPtr *result =
3188 (TypeInstPtr*)(new TypeInstPtr(ptr, k, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons();
3190 return result;
3191 }
3193 /**
3194 * Create constant type for a constant boxed value
3195 */
3196 const Type* TypeInstPtr::get_const_boxed_value() const {
3197 assert(is_ptr_to_boxed_value(), "should be called only for boxed value");
3198 assert((const_oop() != NULL), "should be called only for constant object");
3199 ciConstant constant = const_oop()->as_instance()->field_value_by_offset(offset());
3200 BasicType bt = constant.basic_type();
3201 switch (bt) {
3202 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
3203 case T_INT: return TypeInt::make(constant.as_int());
3204 case T_CHAR: return TypeInt::make(constant.as_char());
3205 case T_BYTE: return TypeInt::make(constant.as_byte());
3206 case T_SHORT: return TypeInt::make(constant.as_short());
3207 case T_FLOAT: return TypeF::make(constant.as_float());
3208 case T_DOUBLE: return TypeD::make(constant.as_double());
3209 case T_LONG: return TypeLong::make(constant.as_long());
3210 default: break;
3211 }
3212 fatal(err_msg_res("Invalid boxed value type '%s'", type2name(bt)));
3213 return NULL;
3214 }
3216 //------------------------------cast_to_ptr_type-------------------------------
3217 const Type *TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
3218 if( ptr == _ptr ) return this;
3219 // Reconstruct _sig info here since not a problem with later lazy
3220 // construction, _sig will show up on demand.
3221 return make(ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, _inline_depth);
3222 }
3225 //-----------------------------cast_to_exactness-------------------------------
3226 const Type *TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
3227 if( klass_is_exact == _klass_is_exact ) return this;
3228 if (!UseExactTypes) return this;
3229 if (!_klass->is_loaded()) return this;
3230 ciInstanceKlass* ik = _klass->as_instance_klass();
3231 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
3232 if( ik->is_interface() ) return this; // cannot set xk
3233 return make(ptr(), klass(), klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth);
3234 }
3236 //-----------------------------cast_to_instance_id----------------------------
3237 const TypeOopPtr *TypeInstPtr::cast_to_instance_id(int instance_id) const {
3238 if( instance_id == _instance_id ) return this;
3239 return make(_ptr, klass(), _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth);
3240 }
3242 //------------------------------xmeet_unloaded---------------------------------
3243 // Compute the MEET of two InstPtrs when at least one is unloaded.
3244 // Assume classes are different since called after check for same name/class-loader
3245 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst) const {
3246 int off = meet_offset(tinst->offset());
3247 PTR ptr = meet_ptr(tinst->ptr());
3248 int instance_id = meet_instance_id(tinst->instance_id());
3249 const TypeOopPtr* speculative = xmeet_speculative(tinst);
3250 int depth = meet_inline_depth(tinst->inline_depth());
3252 const TypeInstPtr *loaded = is_loaded() ? this : tinst;
3253 const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
3254 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
3255 //
3256 // Meet unloaded class with java/lang/Object
3257 //
3258 // Meet
3259 // | Unloaded Class
3260 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
3261 // ===================================================================
3262 // TOP | ..........................Unloaded......................|
3263 // AnyNull | U-AN |................Unloaded......................|
3264 // Constant | ... O-NN .................................. | O-BOT |
3265 // NotNull | ... O-NN .................................. | O-BOT |
3266 // BOTTOM | ........................Object-BOTTOM ..................|
3267 //
3268 assert(loaded->ptr() != TypePtr::Null, "insanity check");
3269 //
3270 if( loaded->ptr() == TypePtr::TopPTR ) { return unloaded; }
3271 else if (loaded->ptr() == TypePtr::AnyNull) { return TypeInstPtr::make(ptr, unloaded->klass(), false, NULL, off, instance_id, speculative, depth); }
3272 else if (loaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; }
3273 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
3274 if (unloaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; }
3275 else { return TypeInstPtr::NOTNULL; }
3276 }
3277 else if( unloaded->ptr() == TypePtr::TopPTR ) { return unloaded; }
3279 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr();
3280 }
3282 // Both are unloaded, not the same class, not Object
3283 // Or meet unloaded with a different loaded class, not java/lang/Object
3284 if( ptr != TypePtr::BotPTR ) {
3285 return TypeInstPtr::NOTNULL;
3286 }
3287 return TypeInstPtr::BOTTOM;
3288 }
3291 //------------------------------meet-------------------------------------------
3292 // Compute the MEET of two types. It returns a new Type object.
3293 const Type *TypeInstPtr::xmeet_helper(const Type *t) const {
3294 // Perform a fast test for common case; meeting the same types together.
3295 if( this == t ) return this; // Meeting same type-rep?
3297 // Current "this->_base" is Pointer
3298 switch (t->base()) { // switch on original type
3300 case Int: // Mixing ints & oops happens when javac
3301 case Long: // reuses local variables
3302 case FloatTop:
3303 case FloatCon:
3304 case FloatBot:
3305 case DoubleTop:
3306 case DoubleCon:
3307 case DoubleBot:
3308 case NarrowOop:
3309 case NarrowKlass:
3310 case Bottom: // Ye Olde Default
3311 return Type::BOTTOM;
3312 case Top:
3313 return this;
3315 default: // All else is a mistake
3316 typerr(t);
3318 case MetadataPtr:
3319 case KlassPtr:
3320 case RawPtr: return TypePtr::BOTTOM;
3322 case AryPtr: { // All arrays inherit from Object class
3323 const TypeAryPtr *tp = t->is_aryptr();
3324 int offset = meet_offset(tp->offset());
3325 PTR ptr = meet_ptr(tp->ptr());
3326 int instance_id = meet_instance_id(tp->instance_id());
3327 const TypeOopPtr* speculative = xmeet_speculative(tp);
3328 int depth = meet_inline_depth(tp->inline_depth());
3329 switch (ptr) {
3330 case TopPTR:
3331 case AnyNull: // Fall 'down' to dual of object klass
3332 // For instances when a subclass meets a superclass we fall
3333 // below the centerline when the superclass is exact. We need to
3334 // do the same here.
3335 if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) {
3336 return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth);
3337 } else {
3338 // cannot subclass, so the meet has to fall badly below the centerline
3339 ptr = NotNull;
3340 instance_id = InstanceBot;
3341 return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth);
3342 }
3343 case Constant:
3344 case NotNull:
3345 case BotPTR: // Fall down to object klass
3346 // LCA is object_klass, but if we subclass from the top we can do better
3347 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
3348 // If 'this' (InstPtr) is above the centerline and it is Object class
3349 // then we can subclass in the Java class hierarchy.
3350 // For instances when a subclass meets a superclass we fall
3351 // below the centerline when the superclass is exact. We need
3352 // to do the same here.
3353 if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) {
3354 // that is, tp's array type is a subtype of my klass
3355 return TypeAryPtr::make(ptr, (ptr == Constant ? tp->const_oop() : NULL),
3356 tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth);
3357 }
3358 }
3359 // The other case cannot happen, since I cannot be a subtype of an array.
3360 // The meet falls down to Object class below centerline.
3361 if( ptr == Constant )
3362 ptr = NotNull;
3363 instance_id = InstanceBot;
3364 return make(ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth);
3365 default: typerr(t);
3366 }
3367 }
3369 case OopPtr: { // Meeting to OopPtrs
3370 // Found a OopPtr type vs self-InstPtr type
3371 const TypeOopPtr *tp = t->is_oopptr();
3372 int offset = meet_offset(tp->offset());
3373 PTR ptr = meet_ptr(tp->ptr());
3374 switch (tp->ptr()) {
3375 case TopPTR:
3376 case AnyNull: {
3377 int instance_id = meet_instance_id(InstanceTop);
3378 const TypeOopPtr* speculative = xmeet_speculative(tp);
3379 int depth = meet_inline_depth(tp->inline_depth());
3380 return make(ptr, klass(), klass_is_exact(),
3381 (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, depth);
3382 }
3383 case NotNull:
3384 case BotPTR: {
3385 int instance_id = meet_instance_id(tp->instance_id());
3386 const TypeOopPtr* speculative = xmeet_speculative(tp);
3387 int depth = meet_inline_depth(tp->inline_depth());
3388 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
3389 }
3390 default: typerr(t);
3391 }
3392 }
3394 case AnyPtr: { // Meeting to AnyPtrs
3395 // Found an AnyPtr type vs self-InstPtr type
3396 const TypePtr *tp = t->is_ptr();
3397 int offset = meet_offset(tp->offset());
3398 PTR ptr = meet_ptr(tp->ptr());
3399 switch (tp->ptr()) {
3400 case Null:
3401 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset);
3402 // else fall through to AnyNull
3403 case TopPTR:
3404 case AnyNull: {
3405 int instance_id = meet_instance_id(InstanceTop);
3406 const TypeOopPtr* speculative = _speculative;
3407 return make(ptr, klass(), klass_is_exact(),
3408 (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, _inline_depth);
3409 }
3410 case NotNull:
3411 case BotPTR:
3412 return TypePtr::make(AnyPtr, ptr, offset);
3413 default: typerr(t);
3414 }
3415 }
3417 /*
3418 A-top }
3419 / | \ } Tops
3420 B-top A-any C-top }
3421 | / | \ | } Any-nulls
3422 B-any | C-any }
3423 | | |
3424 B-con A-con C-con } constants; not comparable across classes
3425 | | |
3426 B-not | C-not }
3427 | \ | / | } not-nulls
3428 B-bot A-not C-bot }
3429 \ | / } Bottoms
3430 A-bot }
3431 */
3433 case InstPtr: { // Meeting 2 Oops?
3434 // Found an InstPtr sub-type vs self-InstPtr type
3435 const TypeInstPtr *tinst = t->is_instptr();
3436 int off = meet_offset( tinst->offset() );
3437 PTR ptr = meet_ptr( tinst->ptr() );
3438 int instance_id = meet_instance_id(tinst->instance_id());
3439 const TypeOopPtr* speculative = xmeet_speculative(tinst);
3440 int depth = meet_inline_depth(tinst->inline_depth());
3442 // Check for easy case; klasses are equal (and perhaps not loaded!)
3443 // If we have constants, then we created oops so classes are loaded
3444 // and we can handle the constants further down. This case handles
3445 // both-not-loaded or both-loaded classes
3446 if (ptr != Constant && klass()->equals(tinst->klass()) && klass_is_exact() == tinst->klass_is_exact()) {
3447 return make(ptr, klass(), klass_is_exact(), NULL, off, instance_id, speculative, depth);
3448 }
3450 // Classes require inspection in the Java klass hierarchy. Must be loaded.
3451 ciKlass* tinst_klass = tinst->klass();
3452 ciKlass* this_klass = this->klass();
3453 bool tinst_xk = tinst->klass_is_exact();
3454 bool this_xk = this->klass_is_exact();
3455 if (!tinst_klass->is_loaded() || !this_klass->is_loaded() ) {
3456 // One of these classes has not been loaded
3457 const TypeInstPtr *unloaded_meet = xmeet_unloaded(tinst);
3458 #ifndef PRODUCT
3459 if( PrintOpto && Verbose ) {
3460 tty->print("meet of unloaded classes resulted in: "); unloaded_meet->dump(); tty->cr();
3461 tty->print(" this == "); this->dump(); tty->cr();
3462 tty->print(" tinst == "); tinst->dump(); tty->cr();
3463 }
3464 #endif
3465 return unloaded_meet;
3466 }
3468 // Handle mixing oops and interfaces first.
3469 if( this_klass->is_interface() && !(tinst_klass->is_interface() ||
3470 tinst_klass == ciEnv::current()->Object_klass())) {
3471 ciKlass *tmp = tinst_klass; // Swap interface around
3472 tinst_klass = this_klass;
3473 this_klass = tmp;
3474 bool tmp2 = tinst_xk;
3475 tinst_xk = this_xk;
3476 this_xk = tmp2;
3477 }
3478 if (tinst_klass->is_interface() &&
3479 !(this_klass->is_interface() ||
3480 // Treat java/lang/Object as an honorary interface,
3481 // because we need a bottom for the interface hierarchy.
3482 this_klass == ciEnv::current()->Object_klass())) {
3483 // Oop meets interface!
3485 // See if the oop subtypes (implements) interface.
3486 ciKlass *k;
3487 bool xk;
3488 if( this_klass->is_subtype_of( tinst_klass ) ) {
3489 // Oop indeed subtypes. Now keep oop or interface depending
3490 // on whether we are both above the centerline or either is
3491 // below the centerline. If we are on the centerline
3492 // (e.g., Constant vs. AnyNull interface), use the constant.
3493 k = below_centerline(ptr) ? tinst_klass : this_klass;
3494 // If we are keeping this_klass, keep its exactness too.
3495 xk = below_centerline(ptr) ? tinst_xk : this_xk;
3496 } else { // Does not implement, fall to Object
3497 // Oop does not implement interface, so mixing falls to Object
3498 // just like the verifier does (if both are above the
3499 // centerline fall to interface)
3500 k = above_centerline(ptr) ? tinst_klass : ciEnv::current()->Object_klass();
3501 xk = above_centerline(ptr) ? tinst_xk : false;
3502 // Watch out for Constant vs. AnyNull interface.
3503 if (ptr == Constant) ptr = NotNull; // forget it was a constant
3504 instance_id = InstanceBot;
3505 }
3506 ciObject* o = NULL; // the Constant value, if any
3507 if (ptr == Constant) {
3508 // Find out which constant.
3509 o = (this_klass == klass()) ? const_oop() : tinst->const_oop();
3510 }
3511 return make(ptr, k, xk, o, off, instance_id, speculative, depth);
3512 }
3514 // Either oop vs oop or interface vs interface or interface vs Object
3516 // !!! Here's how the symmetry requirement breaks down into invariants:
3517 // If we split one up & one down AND they subtype, take the down man.
3518 // If we split one up & one down AND they do NOT subtype, "fall hard".
3519 // If both are up and they subtype, take the subtype class.
3520 // If both are up and they do NOT subtype, "fall hard".
3521 // If both are down and they subtype, take the supertype class.
3522 // If both are down and they do NOT subtype, "fall hard".
3523 // Constants treated as down.
3525 // Now, reorder the above list; observe that both-down+subtype is also
3526 // "fall hard"; "fall hard" becomes the default case:
3527 // If we split one up & one down AND they subtype, take the down man.
3528 // If both are up and they subtype, take the subtype class.
3530 // If both are down and they subtype, "fall hard".
3531 // If both are down and they do NOT subtype, "fall hard".
3532 // If both are up and they do NOT subtype, "fall hard".
3533 // If we split one up & one down AND they do NOT subtype, "fall hard".
3535 // If a proper subtype is exact, and we return it, we return it exactly.
3536 // If a proper supertype is exact, there can be no subtyping relationship!
3537 // If both types are equal to the subtype, exactness is and-ed below the
3538 // centerline and or-ed above it. (N.B. Constants are always exact.)
3540 // Check for subtyping:
3541 ciKlass *subtype = NULL;
3542 bool subtype_exact = false;
3543 if( tinst_klass->equals(this_klass) ) {
3544 subtype = this_klass;
3545 subtype_exact = below_centerline(ptr) ? (this_xk & tinst_xk) : (this_xk | tinst_xk);
3546 } else if( !tinst_xk && this_klass->is_subtype_of( tinst_klass ) ) {
3547 subtype = this_klass; // Pick subtyping class
3548 subtype_exact = this_xk;
3549 } else if( !this_xk && tinst_klass->is_subtype_of( this_klass ) ) {
3550 subtype = tinst_klass; // Pick subtyping class
3551 subtype_exact = tinst_xk;
3552 }
3554 if( subtype ) {
3555 if( above_centerline(ptr) ) { // both are up?
3556 this_klass = tinst_klass = subtype;
3557 this_xk = tinst_xk = subtype_exact;
3558 } else if( above_centerline(this ->_ptr) && !above_centerline(tinst->_ptr) ) {
3559 this_klass = tinst_klass; // tinst is down; keep down man
3560 this_xk = tinst_xk;
3561 } else if( above_centerline(tinst->_ptr) && !above_centerline(this ->_ptr) ) {
3562 tinst_klass = this_klass; // this is down; keep down man
3563 tinst_xk = this_xk;
3564 } else {
3565 this_xk = subtype_exact; // either they are equal, or we'll do an LCA
3566 }
3567 }
3569 // Check for classes now being equal
3570 if (tinst_klass->equals(this_klass)) {
3571 // If the klasses are equal, the constants may still differ. Fall to
3572 // NotNull if they do (neither constant is NULL; that is a special case
3573 // handled elsewhere).
3574 ciObject* o = NULL; // Assume not constant when done
3575 ciObject* this_oop = const_oop();
3576 ciObject* tinst_oop = tinst->const_oop();
3577 if( ptr == Constant ) {
3578 if (this_oop != NULL && tinst_oop != NULL &&
3579 this_oop->equals(tinst_oop) )
3580 o = this_oop;
3581 else if (above_centerline(this ->_ptr))
3582 o = tinst_oop;
3583 else if (above_centerline(tinst ->_ptr))
3584 o = this_oop;
3585 else
3586 ptr = NotNull;
3587 }
3588 return make(ptr, this_klass, this_xk, o, off, instance_id, speculative, depth);
3589 } // Else classes are not equal
3591 // Since klasses are different, we require a LCA in the Java
3592 // class hierarchy - which means we have to fall to at least NotNull.
3593 if( ptr == TopPTR || ptr == AnyNull || ptr == Constant )
3594 ptr = NotNull;
3595 instance_id = InstanceBot;
3597 // Now we find the LCA of Java classes
3598 ciKlass* k = this_klass->least_common_ancestor(tinst_klass);
3599 return make(ptr, k, false, NULL, off, instance_id, speculative, depth);
3600 } // End of case InstPtr
3602 } // End of switch
3603 return this; // Return the double constant
3604 }
3607 //------------------------java_mirror_type--------------------------------------
3608 ciType* TypeInstPtr::java_mirror_type() const {
3609 // must be a singleton type
3610 if( const_oop() == NULL ) return NULL;
3612 // must be of type java.lang.Class
3613 if( klass() != ciEnv::current()->Class_klass() ) return NULL;
3615 return const_oop()->as_instance()->java_mirror_type();
3616 }
3619 //------------------------------xdual------------------------------------------
3620 // Dual: do NOT dual on klasses. This means I do NOT understand the Java
3621 // inheritance mechanism.
3622 const Type *TypeInstPtr::xdual() const {
3623 return new TypeInstPtr(dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
3624 }
3626 //------------------------------eq---------------------------------------------
3627 // Structural equality check for Type representations
3628 bool TypeInstPtr::eq( const Type *t ) const {
3629 const TypeInstPtr *p = t->is_instptr();
3630 return
3631 klass()->equals(p->klass()) &&
3632 TypeOopPtr::eq(p); // Check sub-type stuff
3633 }
3635 //------------------------------hash-------------------------------------------
3636 // Type-specific hashing function.
3637 int TypeInstPtr::hash(void) const {
3638 int hash = klass()->hash() + TypeOopPtr::hash();
3639 return hash;
3640 }
3642 //------------------------------dump2------------------------------------------
3643 // Dump oop Type
3644 #ifndef PRODUCT
3645 void TypeInstPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
3646 // Print the name of the klass.
3647 klass()->print_name_on(st);
3649 switch( _ptr ) {
3650 case Constant:
3651 // TO DO: Make CI print the hex address of the underlying oop.
3652 if (WizardMode || Verbose) {
3653 const_oop()->print_oop(st);
3654 }
3655 case BotPTR:
3656 if (!WizardMode && !Verbose) {
3657 if( _klass_is_exact ) st->print(":exact");
3658 break;
3659 }
3660 case TopPTR:
3661 case AnyNull:
3662 case NotNull:
3663 st->print(":%s", ptr_msg[_ptr]);
3664 if( _klass_is_exact ) st->print(":exact");
3665 break;
3666 }
3668 if( _offset ) { // Dump offset, if any
3669 if( _offset == OffsetBot ) st->print("+any");
3670 else if( _offset == OffsetTop ) st->print("+unknown");
3671 else st->print("+%d", _offset);
3672 }
3674 st->print(" *");
3675 if (_instance_id == InstanceTop)
3676 st->print(",iid=top");
3677 else if (_instance_id != InstanceBot)
3678 st->print(",iid=%d",_instance_id);
3680 dump_inline_depth(st);
3681 dump_speculative(st);
3682 }
3683 #endif
3685 //------------------------------add_offset-------------------------------------
3686 const TypePtr *TypeInstPtr::add_offset(intptr_t offset) const {
3687 return make(_ptr, klass(), klass_is_exact(), const_oop(), xadd_offset(offset), _instance_id, add_offset_speculative(offset));
3688 }
3690 const Type *TypeInstPtr::remove_speculative() const {
3691 if (_speculative == NULL) {
3692 return this;
3693 }
3694 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
3695 return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, NULL, _inline_depth);
3696 }
3698 const TypeOopPtr *TypeInstPtr::with_inline_depth(int depth) const {
3699 if (!UseInlineDepthForSpeculativeTypes) {
3700 return this;
3701 }
3702 return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth);
3703 }
3705 //=============================================================================
3706 // Convenience common pre-built types.
3707 const TypeAryPtr *TypeAryPtr::RANGE;
3708 const TypeAryPtr *TypeAryPtr::OOPS;
3709 const TypeAryPtr *TypeAryPtr::NARROWOOPS;
3710 const TypeAryPtr *TypeAryPtr::BYTES;
3711 const TypeAryPtr *TypeAryPtr::SHORTS;
3712 const TypeAryPtr *TypeAryPtr::CHARS;
3713 const TypeAryPtr *TypeAryPtr::INTS;
3714 const TypeAryPtr *TypeAryPtr::LONGS;
3715 const TypeAryPtr *TypeAryPtr::FLOATS;
3716 const TypeAryPtr *TypeAryPtr::DOUBLES;
3718 //------------------------------make-------------------------------------------
3719 const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) {
3720 assert(!(k == NULL && ary->_elem->isa_int()),
3721 "integral arrays must be pre-equipped with a class");
3722 if (!xk) xk = ary->ary_must_be_exact();
3723 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
3724 if (!UseExactTypes) xk = (ptr == Constant);
3725 return (TypeAryPtr*)(new TypeAryPtr(ptr, NULL, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons();
3726 }
3728 //------------------------------make-------------------------------------------
3729 const TypeAryPtr *TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth, bool is_autobox_cache) {
3730 assert(!(k == NULL && ary->_elem->isa_int()),
3731 "integral arrays must be pre-equipped with a class");
3732 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
3733 if (!xk) xk = (o != NULL) || ary->ary_must_be_exact();
3734 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
3735 if (!UseExactTypes) xk = (ptr == Constant);
3736 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons();
3737 }
3739 //------------------------------cast_to_ptr_type-------------------------------
3740 const Type *TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
3741 if( ptr == _ptr ) return this;
3742 return make(ptr, const_oop(), _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
3743 }
3746 //-----------------------------cast_to_exactness-------------------------------
3747 const Type *TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
3748 if( klass_is_exact == _klass_is_exact ) return this;
3749 if (!UseExactTypes) return this;
3750 if (_ary->ary_must_be_exact()) return this; // cannot clear xk
3751 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
3752 }
3754 //-----------------------------cast_to_instance_id----------------------------
3755 const TypeOopPtr *TypeAryPtr::cast_to_instance_id(int instance_id) const {
3756 if( instance_id == _instance_id ) return this;
3757 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
3758 }
3760 //-----------------------------narrow_size_type-------------------------------
3761 // Local cache for arrayOopDesc::max_array_length(etype),
3762 // which is kind of slow (and cached elsewhere by other users).
3763 static jint max_array_length_cache[T_CONFLICT+1];
3764 static jint max_array_length(BasicType etype) {
3765 jint& cache = max_array_length_cache[etype];
3766 jint res = cache;
3767 if (res == 0) {
3768 switch (etype) {
3769 case T_NARROWOOP:
3770 etype = T_OBJECT;
3771 break;
3772 case T_NARROWKLASS:
3773 case T_CONFLICT:
3774 case T_ILLEGAL:
3775 case T_VOID:
3776 etype = T_BYTE; // will produce conservatively high value
3777 }
3778 cache = res = arrayOopDesc::max_array_length(etype);
3779 }
3780 return res;
3781 }
3783 // Narrow the given size type to the index range for the given array base type.
3784 // Return NULL if the resulting int type becomes empty.
3785 const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const {
3786 jint hi = size->_hi;
3787 jint lo = size->_lo;
3788 jint min_lo = 0;
3789 jint max_hi = max_array_length(elem()->basic_type());
3790 //if (index_not_size) --max_hi; // type of a valid array index, FTR
3791 bool chg = false;
3792 if (lo < min_lo) {
3793 lo = min_lo;
3794 if (size->is_con()) {
3795 hi = lo;
3796 }
3797 chg = true;
3798 }
3799 if (hi > max_hi) {
3800 hi = max_hi;
3801 if (size->is_con()) {
3802 lo = hi;
3803 }
3804 chg = true;
3805 }
3806 // Negative length arrays will produce weird intermediate dead fast-path code
3807 if (lo > hi)
3808 return TypeInt::ZERO;
3809 if (!chg)
3810 return size;
3811 return TypeInt::make(lo, hi, Type::WidenMin);
3812 }
3814 //-------------------------------cast_to_size----------------------------------
3815 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
3816 assert(new_size != NULL, "");
3817 new_size = narrow_size_type(new_size);
3818 if (new_size == size()) return this;
3819 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable());
3820 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
3821 }
3824 //------------------------------cast_to_stable---------------------------------
3825 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const {
3826 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable()))
3827 return this;
3829 const Type* elem = this->elem();
3830 const TypePtr* elem_ptr = elem->make_ptr();
3832 if (stable_dimension > 1 && elem_ptr != NULL && elem_ptr->isa_aryptr()) {
3833 // If this is widened from a narrow oop, TypeAry::make will re-narrow it.
3834 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1);
3835 }
3837 const TypeAry* new_ary = TypeAry::make(elem, size(), stable);
3839 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id);
3840 }
3842 //-----------------------------stable_dimension--------------------------------
3843 int TypeAryPtr::stable_dimension() const {
3844 if (!is_stable()) return 0;
3845 int dim = 1;
3846 const TypePtr* elem_ptr = elem()->make_ptr();
3847 if (elem_ptr != NULL && elem_ptr->isa_aryptr())
3848 dim += elem_ptr->is_aryptr()->stable_dimension();
3849 return dim;
3850 }
3852 //------------------------------eq---------------------------------------------
3853 // Structural equality check for Type representations
3854 bool TypeAryPtr::eq( const Type *t ) const {
3855 const TypeAryPtr *p = t->is_aryptr();
3856 return
3857 _ary == p->_ary && // Check array
3858 TypeOopPtr::eq(p); // Check sub-parts
3859 }
3861 //------------------------------hash-------------------------------------------
3862 // Type-specific hashing function.
3863 int TypeAryPtr::hash(void) const {
3864 return (intptr_t)_ary + TypeOopPtr::hash();
3865 }
3867 //------------------------------meet-------------------------------------------
3868 // Compute the MEET of two types. It returns a new Type object.
3869 const Type *TypeAryPtr::xmeet_helper(const Type *t) const {
3870 // Perform a fast test for common case; meeting the same types together.
3871 if( this == t ) return this; // Meeting same type-rep?
3872 // Current "this->_base" is Pointer
3873 switch (t->base()) { // switch on original type
3875 // Mixing ints & oops happens when javac reuses local variables
3876 case Int:
3877 case Long:
3878 case FloatTop:
3879 case FloatCon:
3880 case FloatBot:
3881 case DoubleTop:
3882 case DoubleCon:
3883 case DoubleBot:
3884 case NarrowOop:
3885 case NarrowKlass:
3886 case Bottom: // Ye Olde Default
3887 return Type::BOTTOM;
3888 case Top:
3889 return this;
3891 default: // All else is a mistake
3892 typerr(t);
3894 case OopPtr: { // Meeting to OopPtrs
3895 // Found a OopPtr type vs self-AryPtr type
3896 const TypeOopPtr *tp = t->is_oopptr();
3897 int offset = meet_offset(tp->offset());
3898 PTR ptr = meet_ptr(tp->ptr());
3899 int depth = meet_inline_depth(tp->inline_depth());
3900 switch (tp->ptr()) {
3901 case TopPTR:
3902 case AnyNull: {
3903 int instance_id = meet_instance_id(InstanceTop);
3904 const TypeOopPtr* speculative = xmeet_speculative(tp);
3905 return make(ptr, (ptr == Constant ? const_oop() : NULL),
3906 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
3907 }
3908 case BotPTR:
3909 case NotNull: {
3910 int instance_id = meet_instance_id(tp->instance_id());
3911 const TypeOopPtr* speculative = xmeet_speculative(tp);
3912 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
3913 }
3914 default: ShouldNotReachHere();
3915 }
3916 }
3918 case AnyPtr: { // Meeting two AnyPtrs
3919 // Found an AnyPtr type vs self-AryPtr type
3920 const TypePtr *tp = t->is_ptr();
3921 int offset = meet_offset(tp->offset());
3922 PTR ptr = meet_ptr(tp->ptr());
3923 switch (tp->ptr()) {
3924 case TopPTR:
3925 return this;
3926 case BotPTR:
3927 case NotNull:
3928 return TypePtr::make(AnyPtr, ptr, offset);
3929 case Null:
3930 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset);
3931 // else fall through to AnyNull
3932 case AnyNull: {
3933 int instance_id = meet_instance_id(InstanceTop);
3934 const TypeOopPtr* speculative = _speculative;
3935 return make(ptr, (ptr == Constant ? const_oop() : NULL),
3936 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, _inline_depth);
3937 }
3938 default: ShouldNotReachHere();
3939 }
3940 }
3942 case MetadataPtr:
3943 case KlassPtr:
3944 case RawPtr: return TypePtr::BOTTOM;
3946 case AryPtr: { // Meeting 2 references?
3947 const TypeAryPtr *tap = t->is_aryptr();
3948 int off = meet_offset(tap->offset());
3949 const TypeAry *tary = _ary->meet_speculative(tap->_ary)->is_ary();
3950 PTR ptr = meet_ptr(tap->ptr());
3951 int instance_id = meet_instance_id(tap->instance_id());
3952 const TypeOopPtr* speculative = xmeet_speculative(tap);
3953 int depth = meet_inline_depth(tap->inline_depth());
3954 ciKlass* lazy_klass = NULL;
3955 if (tary->_elem->isa_int()) {
3956 // Integral array element types have irrelevant lattice relations.
3957 // It is the klass that determines array layout, not the element type.
3958 if (_klass == NULL)
3959 lazy_klass = tap->_klass;
3960 else if (tap->_klass == NULL || tap->_klass == _klass) {
3961 lazy_klass = _klass;
3962 } else {
3963 // Something like byte[int+] meets char[int+].
3964 // This must fall to bottom, not (int[-128..65535])[int+].
3965 instance_id = InstanceBot;
3966 tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable);
3967 }
3968 } else // Non integral arrays.
3969 // Must fall to bottom if exact klasses in upper lattice
3970 // are not equal or super klass is exact.
3971 if ((above_centerline(ptr) || ptr == Constant) && klass() != tap->klass() &&
3972 // meet with top[] and bottom[] are processed further down:
3973 tap->_klass != NULL && this->_klass != NULL &&
3974 // both are exact and not equal:
3975 ((tap->_klass_is_exact && this->_klass_is_exact) ||
3976 // 'tap' is exact and super or unrelated:
3977 (tap->_klass_is_exact && !tap->klass()->is_subtype_of(klass())) ||
3978 // 'this' is exact and super or unrelated:
3979 (this->_klass_is_exact && !klass()->is_subtype_of(tap->klass())))) {
3980 if (above_centerline(ptr)) {
3981 tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable);
3982 }
3983 return make(NotNull, NULL, tary, lazy_klass, false, off, InstanceBot);
3984 }
3986 bool xk = false;
3987 switch (tap->ptr()) {
3988 case AnyNull:
3989 case TopPTR:
3990 // Compute new klass on demand, do not use tap->_klass
3991 if (below_centerline(this->_ptr)) {
3992 xk = this->_klass_is_exact;
3993 } else {
3994 xk = (tap->_klass_is_exact | this->_klass_is_exact);
3995 }
3996 return make(ptr, const_oop(), tary, lazy_klass, xk, off, instance_id, speculative, depth);
3997 case Constant: {
3998 ciObject* o = const_oop();
3999 if( _ptr == Constant ) {
4000 if( tap->const_oop() != NULL && !o->equals(tap->const_oop()) ) {
4001 xk = (klass() == tap->klass());
4002 ptr = NotNull;
4003 o = NULL;
4004 instance_id = InstanceBot;
4005 } else {
4006 xk = true;
4007 }
4008 } else if(above_centerline(_ptr)) {
4009 o = tap->const_oop();
4010 xk = true;
4011 } else {
4012 // Only precise for identical arrays
4013 xk = this->_klass_is_exact && (klass() == tap->klass());
4014 }
4015 return TypeAryPtr::make(ptr, o, tary, lazy_klass, xk, off, instance_id, speculative, depth);
4016 }
4017 case NotNull:
4018 case BotPTR:
4019 // Compute new klass on demand, do not use tap->_klass
4020 if (above_centerline(this->_ptr))
4021 xk = tap->_klass_is_exact;
4022 else xk = (tap->_klass_is_exact & this->_klass_is_exact) &&
4023 (klass() == tap->klass()); // Only precise for identical arrays
4024 return TypeAryPtr::make(ptr, NULL, tary, lazy_klass, xk, off, instance_id, speculative, depth);
4025 default: ShouldNotReachHere();
4026 }
4027 }
4029 // All arrays inherit from Object class
4030 case InstPtr: {
4031 const TypeInstPtr *tp = t->is_instptr();
4032 int offset = meet_offset(tp->offset());
4033 PTR ptr = meet_ptr(tp->ptr());
4034 int instance_id = meet_instance_id(tp->instance_id());
4035 const TypeOopPtr* speculative = xmeet_speculative(tp);
4036 int depth = meet_inline_depth(tp->inline_depth());
4037 switch (ptr) {
4038 case TopPTR:
4039 case AnyNull: // Fall 'down' to dual of object klass
4040 // For instances when a subclass meets a superclass we fall
4041 // below the centerline when the superclass is exact. We need to
4042 // do the same here.
4043 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) {
4044 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4045 } else {
4046 // cannot subclass, so the meet has to fall badly below the centerline
4047 ptr = NotNull;
4048 instance_id = InstanceBot;
4049 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth);
4050 }
4051 case Constant:
4052 case NotNull:
4053 case BotPTR: // Fall down to object klass
4054 // LCA is object_klass, but if we subclass from the top we can do better
4055 if (above_centerline(tp->ptr())) {
4056 // If 'tp' is above the centerline and it is Object class
4057 // then we can subclass in the Java class hierarchy.
4058 // For instances when a subclass meets a superclass we fall
4059 // below the centerline when the superclass is exact. We need
4060 // to do the same here.
4061 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) {
4062 // that is, my array type is a subtype of 'tp' klass
4063 return make(ptr, (ptr == Constant ? const_oop() : NULL),
4064 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4065 }
4066 }
4067 // The other case cannot happen, since t cannot be a subtype of an array.
4068 // The meet falls down to Object class below centerline.
4069 if( ptr == Constant )
4070 ptr = NotNull;
4071 instance_id = InstanceBot;
4072 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth);
4073 default: typerr(t);
4074 }
4075 }
4076 }
4077 return this; // Lint noise
4078 }
4080 //------------------------------xdual------------------------------------------
4081 // Dual: compute field-by-field dual
4082 const Type *TypeAryPtr::xdual() const {
4083 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());
4084 }
4086 //----------------------interface_vs_oop---------------------------------------
4087 #ifdef ASSERT
4088 bool TypeAryPtr::interface_vs_oop(const Type *t) const {
4089 const TypeAryPtr* t_aryptr = t->isa_aryptr();
4090 if (t_aryptr) {
4091 return _ary->interface_vs_oop(t_aryptr->_ary);
4092 }
4093 return false;
4094 }
4095 #endif
4097 //------------------------------dump2------------------------------------------
4098 #ifndef PRODUCT
4099 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
4100 _ary->dump2(d,depth,st);
4101 switch( _ptr ) {
4102 case Constant:
4103 const_oop()->print(st);
4104 break;
4105 case BotPTR:
4106 if (!WizardMode && !Verbose) {
4107 if( _klass_is_exact ) st->print(":exact");
4108 break;
4109 }
4110 case TopPTR:
4111 case AnyNull:
4112 case NotNull:
4113 st->print(":%s", ptr_msg[_ptr]);
4114 if( _klass_is_exact ) st->print(":exact");
4115 break;
4116 }
4118 if( _offset != 0 ) {
4119 int header_size = objArrayOopDesc::header_size() * wordSize;
4120 if( _offset == OffsetTop ) st->print("+undefined");
4121 else if( _offset == OffsetBot ) st->print("+any");
4122 else if( _offset < header_size ) st->print("+%d", _offset);
4123 else {
4124 BasicType basic_elem_type = elem()->basic_type();
4125 int array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
4126 int elem_size = type2aelembytes(basic_elem_type);
4127 st->print("[%d]", (_offset - array_base)/elem_size);
4128 }
4129 }
4130 st->print(" *");
4131 if (_instance_id == InstanceTop)
4132 st->print(",iid=top");
4133 else if (_instance_id != InstanceBot)
4134 st->print(",iid=%d",_instance_id);
4136 dump_inline_depth(st);
4137 dump_speculative(st);
4138 }
4139 #endif
4141 bool TypeAryPtr::empty(void) const {
4142 if (_ary->empty()) return true;
4143 return TypeOopPtr::empty();
4144 }
4146 //------------------------------add_offset-------------------------------------
4147 const TypePtr *TypeAryPtr::add_offset(intptr_t offset) const {
4148 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
4149 }
4151 const Type *TypeAryPtr::remove_speculative() const {
4152 if (_speculative == NULL) {
4153 return this;
4154 }
4155 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4156 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, NULL, _inline_depth);
4157 }
4159 const TypeOopPtr *TypeAryPtr::with_inline_depth(int depth) const {
4160 if (!UseInlineDepthForSpeculativeTypes) {
4161 return this;
4162 }
4163 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth);
4164 }
4166 //=============================================================================
4168 //------------------------------hash-------------------------------------------
4169 // Type-specific hashing function.
4170 int TypeNarrowPtr::hash(void) const {
4171 return _ptrtype->hash() + 7;
4172 }
4174 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton
4175 return _ptrtype->singleton();
4176 }
4178 bool TypeNarrowPtr::empty(void) const {
4179 return _ptrtype->empty();
4180 }
4182 intptr_t TypeNarrowPtr::get_con() const {
4183 return _ptrtype->get_con();
4184 }
4186 bool TypeNarrowPtr::eq( const Type *t ) const {
4187 const TypeNarrowPtr* tc = isa_same_narrowptr(t);
4188 if (tc != NULL) {
4189 if (_ptrtype->base() != tc->_ptrtype->base()) {
4190 return false;
4191 }
4192 return tc->_ptrtype->eq(_ptrtype);
4193 }
4194 return false;
4195 }
4197 const Type *TypeNarrowPtr::xdual() const { // Compute dual right now.
4198 const TypePtr* odual = _ptrtype->dual()->is_ptr();
4199 return make_same_narrowptr(odual);
4200 }
4203 const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const {
4204 if (isa_same_narrowptr(kills)) {
4205 const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative);
4206 if (ft->empty())
4207 return Type::TOP; // Canonical empty value
4208 if (ft->isa_ptr()) {
4209 return make_hash_same_narrowptr(ft->isa_ptr());
4210 }
4211 return ft;
4212 } else if (kills->isa_ptr()) {
4213 const Type* ft = _ptrtype->join_helper(kills, include_speculative);
4214 if (ft->empty())
4215 return Type::TOP; // Canonical empty value
4216 return ft;
4217 } else {
4218 return Type::TOP;
4219 }
4220 }
4222 //------------------------------xmeet------------------------------------------
4223 // Compute the MEET of two types. It returns a new Type object.
4224 const Type *TypeNarrowPtr::xmeet( const Type *t ) const {
4225 // Perform a fast test for common case; meeting the same types together.
4226 if( this == t ) return this; // Meeting same type-rep?
4228 if (t->base() == base()) {
4229 const Type* result = _ptrtype->xmeet(t->make_ptr());
4230 if (result->isa_ptr()) {
4231 return make_hash_same_narrowptr(result->is_ptr());
4232 }
4233 return result;
4234 }
4236 // Current "this->_base" is NarrowKlass or NarrowOop
4237 switch (t->base()) { // switch on original type
4239 case Int: // Mixing ints & oops happens when javac
4240 case Long: // reuses local variables
4241 case FloatTop:
4242 case FloatCon:
4243 case FloatBot:
4244 case DoubleTop:
4245 case DoubleCon:
4246 case DoubleBot:
4247 case AnyPtr:
4248 case RawPtr:
4249 case OopPtr:
4250 case InstPtr:
4251 case AryPtr:
4252 case MetadataPtr:
4253 case KlassPtr:
4254 case NarrowOop:
4255 case NarrowKlass:
4257 case Bottom: // Ye Olde Default
4258 return Type::BOTTOM;
4259 case Top:
4260 return this;
4262 default: // All else is a mistake
4263 typerr(t);
4265 } // End of switch
4267 return this;
4268 }
4270 #ifndef PRODUCT
4271 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
4272 _ptrtype->dump2(d, depth, st);
4273 }
4274 #endif
4276 const TypeNarrowOop *TypeNarrowOop::BOTTOM;
4277 const TypeNarrowOop *TypeNarrowOop::NULL_PTR;
4280 const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) {
4281 return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons();
4282 }
4285 #ifndef PRODUCT
4286 void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const {
4287 st->print("narrowoop: ");
4288 TypeNarrowPtr::dump2(d, depth, st);
4289 }
4290 #endif
4292 const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR;
4294 const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) {
4295 return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons();
4296 }
4298 #ifndef PRODUCT
4299 void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const {
4300 st->print("narrowklass: ");
4301 TypeNarrowPtr::dump2(d, depth, st);
4302 }
4303 #endif
4306 //------------------------------eq---------------------------------------------
4307 // Structural equality check for Type representations
4308 bool TypeMetadataPtr::eq( const Type *t ) const {
4309 const TypeMetadataPtr *a = (const TypeMetadataPtr*)t;
4310 ciMetadata* one = metadata();
4311 ciMetadata* two = a->metadata();
4312 if (one == NULL || two == NULL) {
4313 return (one == two) && TypePtr::eq(t);
4314 } else {
4315 return one->equals(two) && TypePtr::eq(t);
4316 }
4317 }
4319 //------------------------------hash-------------------------------------------
4320 // Type-specific hashing function.
4321 int TypeMetadataPtr::hash(void) const {
4322 return
4323 (metadata() ? metadata()->hash() : 0) +
4324 TypePtr::hash();
4325 }
4327 //------------------------------singleton--------------------------------------
4328 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
4329 // constants
4330 bool TypeMetadataPtr::singleton(void) const {
4331 // detune optimizer to not generate constant metadta + constant offset as a constant!
4332 // TopPTR, Null, AnyNull, Constant are all singletons
4333 return (_offset == 0) && !below_centerline(_ptr);
4334 }
4336 //------------------------------add_offset-------------------------------------
4337 const TypePtr *TypeMetadataPtr::add_offset( intptr_t offset ) const {
4338 return make( _ptr, _metadata, xadd_offset(offset));
4339 }
4341 //-----------------------------filter------------------------------------------
4342 // Do not allow interface-vs.-noninterface joins to collapse to top.
4343 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const {
4344 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr();
4345 if (ft == NULL || ft->empty())
4346 return Type::TOP; // Canonical empty value
4347 return ft;
4348 }
4350 //------------------------------get_con----------------------------------------
4351 intptr_t TypeMetadataPtr::get_con() const {
4352 assert( _ptr == Null || _ptr == Constant, "" );
4353 assert( _offset >= 0, "" );
4355 if (_offset != 0) {
4356 // After being ported to the compiler interface, the compiler no longer
4357 // directly manipulates the addresses of oops. Rather, it only has a pointer
4358 // to a handle at compile time. This handle is embedded in the generated
4359 // code and dereferenced at the time the nmethod is made. Until that time,
4360 // it is not reasonable to do arithmetic with the addresses of oops (we don't
4361 // have access to the addresses!). This does not seem to currently happen,
4362 // but this assertion here is to help prevent its occurence.
4363 tty->print_cr("Found oop constant with non-zero offset");
4364 ShouldNotReachHere();
4365 }
4367 return (intptr_t)metadata()->constant_encoding();
4368 }
4370 //------------------------------cast_to_ptr_type-------------------------------
4371 const Type *TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const {
4372 if( ptr == _ptr ) return this;
4373 return make(ptr, metadata(), _offset);
4374 }
4376 //------------------------------meet-------------------------------------------
4377 // Compute the MEET of two types. It returns a new Type object.
4378 const Type *TypeMetadataPtr::xmeet( const Type *t ) const {
4379 // Perform a fast test for common case; meeting the same types together.
4380 if( this == t ) return this; // Meeting same type-rep?
4382 // Current "this->_base" is OopPtr
4383 switch (t->base()) { // switch on original type
4385 case Int: // Mixing ints & oops happens when javac
4386 case Long: // reuses local variables
4387 case FloatTop:
4388 case FloatCon:
4389 case FloatBot:
4390 case DoubleTop:
4391 case DoubleCon:
4392 case DoubleBot:
4393 case NarrowOop:
4394 case NarrowKlass:
4395 case Bottom: // Ye Olde Default
4396 return Type::BOTTOM;
4397 case Top:
4398 return this;
4400 default: // All else is a mistake
4401 typerr(t);
4403 case AnyPtr: {
4404 // Found an AnyPtr type vs self-OopPtr type
4405 const TypePtr *tp = t->is_ptr();
4406 int offset = meet_offset(tp->offset());
4407 PTR ptr = meet_ptr(tp->ptr());
4408 switch (tp->ptr()) {
4409 case Null:
4410 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset);
4411 // else fall through:
4412 case TopPTR:
4413 case AnyNull: {
4414 return make(ptr, _metadata, offset);
4415 }
4416 case BotPTR:
4417 case NotNull:
4418 return TypePtr::make(AnyPtr, ptr, offset);
4419 default: typerr(t);
4420 }
4421 }
4423 case RawPtr:
4424 case KlassPtr:
4425 case OopPtr:
4426 case InstPtr:
4427 case AryPtr:
4428 return TypePtr::BOTTOM; // Oop meet raw is not well defined
4430 case MetadataPtr: {
4431 const TypeMetadataPtr *tp = t->is_metadataptr();
4432 int offset = meet_offset(tp->offset());
4433 PTR tptr = tp->ptr();
4434 PTR ptr = meet_ptr(tptr);
4435 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata();
4436 if (tptr == TopPTR || _ptr == TopPTR ||
4437 metadata()->equals(tp->metadata())) {
4438 return make(ptr, md, offset);
4439 }
4440 // metadata is different
4441 if( ptr == Constant ) { // Cannot be equal constants, so...
4442 if( tptr == Constant && _ptr != Constant) return t;
4443 if( _ptr == Constant && tptr != Constant) return this;
4444 ptr = NotNull; // Fall down in lattice
4445 }
4446 return make(ptr, NULL, offset);
4447 break;
4448 }
4449 } // End of switch
4450 return this; // Return the double constant
4451 }
4454 //------------------------------xdual------------------------------------------
4455 // Dual of a pure metadata pointer.
4456 const Type *TypeMetadataPtr::xdual() const {
4457 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset());
4458 }
4460 //------------------------------dump2------------------------------------------
4461 #ifndef PRODUCT
4462 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
4463 st->print("metadataptr:%s", ptr_msg[_ptr]);
4464 if( metadata() ) st->print(INTPTR_FORMAT, metadata());
4465 switch( _offset ) {
4466 case OffsetTop: st->print("+top"); break;
4467 case OffsetBot: st->print("+any"); break;
4468 case 0: break;
4469 default: st->print("+%d",_offset); break;
4470 }
4471 }
4472 #endif
4475 //=============================================================================
4476 // Convenience common pre-built type.
4477 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM;
4479 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset):
4480 TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) {
4481 }
4483 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) {
4484 return make(Constant, m, 0);
4485 }
4486 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) {
4487 return make(Constant, m, 0);
4488 }
4490 //------------------------------make-------------------------------------------
4491 // Create a meta data constant
4492 const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) {
4493 assert(m == NULL || !m->is_klass(), "wrong type");
4494 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons();
4495 }
4498 //=============================================================================
4499 // Convenience common pre-built types.
4501 // Not-null object klass or below
4502 const TypeKlassPtr *TypeKlassPtr::OBJECT;
4503 const TypeKlassPtr *TypeKlassPtr::OBJECT_OR_NULL;
4505 //------------------------------TypeKlassPtr-----------------------------------
4506 TypeKlassPtr::TypeKlassPtr( PTR ptr, ciKlass* klass, int offset )
4507 : TypePtr(KlassPtr, ptr, offset), _klass(klass), _klass_is_exact(ptr == Constant) {
4508 }
4510 //------------------------------make-------------------------------------------
4511 // ptr to klass 'k', if Constant, or possibly to a sub-klass if not a Constant
4512 const TypeKlassPtr *TypeKlassPtr::make( PTR ptr, ciKlass* k, int offset ) {
4513 assert( k != NULL, "Expect a non-NULL klass");
4514 assert(k->is_instance_klass() || k->is_array_klass(), "Incorrect type of klass oop");
4515 TypeKlassPtr *r =
4516 (TypeKlassPtr*)(new TypeKlassPtr(ptr, k, offset))->hashcons();
4518 return r;
4519 }
4521 //------------------------------eq---------------------------------------------
4522 // Structural equality check for Type representations
4523 bool TypeKlassPtr::eq( const Type *t ) const {
4524 const TypeKlassPtr *p = t->is_klassptr();
4525 return
4526 klass()->equals(p->klass()) &&
4527 TypePtr::eq(p);
4528 }
4530 //------------------------------hash-------------------------------------------
4531 // Type-specific hashing function.
4532 int TypeKlassPtr::hash(void) const {
4533 return klass()->hash() + TypePtr::hash();
4534 }
4536 //------------------------------singleton--------------------------------------
4537 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
4538 // constants
4539 bool TypeKlassPtr::singleton(void) const {
4540 // detune optimizer to not generate constant klass + constant offset as a constant!
4541 // TopPTR, Null, AnyNull, Constant are all singletons
4542 return (_offset == 0) && !below_centerline(_ptr);
4543 }
4545 // Do not allow interface-vs.-noninterface joins to collapse to top.
4546 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const {
4547 // logic here mirrors the one from TypeOopPtr::filter. See comments
4548 // there.
4549 const Type* ft = join_helper(kills, include_speculative);
4550 const TypeKlassPtr* ftkp = ft->isa_klassptr();
4551 const TypeKlassPtr* ktkp = kills->isa_klassptr();
4553 if (ft->empty()) {
4554 if (!empty() && ktkp != NULL && ktkp->klass()->is_loaded() && ktkp->klass()->is_interface())
4555 return kills; // Uplift to interface
4557 return Type::TOP; // Canonical empty value
4558 }
4560 // Interface klass type could be exact in opposite to interface type,
4561 // return it here instead of incorrect Constant ptr J/L/Object (6894807).
4562 if (ftkp != NULL && ktkp != NULL &&
4563 ftkp->is_loaded() && ftkp->klass()->is_interface() &&
4564 !ftkp->klass_is_exact() && // Keep exact interface klass
4565 ktkp->is_loaded() && !ktkp->klass()->is_interface()) {
4566 return ktkp->cast_to_ptr_type(ftkp->ptr());
4567 }
4569 return ft;
4570 }
4572 //----------------------compute_klass------------------------------------------
4573 // Compute the defining klass for this class
4574 ciKlass* TypeAryPtr::compute_klass(DEBUG_ONLY(bool verify)) const {
4575 // Compute _klass based on element type.
4576 ciKlass* k_ary = NULL;
4577 const TypeInstPtr *tinst;
4578 const TypeAryPtr *tary;
4579 const Type* el = elem();
4580 if (el->isa_narrowoop()) {
4581 el = el->make_ptr();
4582 }
4584 // Get element klass
4585 if ((tinst = el->isa_instptr()) != NULL) {
4586 // Compute array klass from element klass
4587 k_ary = ciObjArrayKlass::make(tinst->klass());
4588 } else if ((tary = el->isa_aryptr()) != NULL) {
4589 // Compute array klass from element klass
4590 ciKlass* k_elem = tary->klass();
4591 // If element type is something like bottom[], k_elem will be null.
4592 if (k_elem != NULL)
4593 k_ary = ciObjArrayKlass::make(k_elem);
4594 } else if ((el->base() == Type::Top) ||
4595 (el->base() == Type::Bottom)) {
4596 // element type of Bottom occurs from meet of basic type
4597 // and object; Top occurs when doing join on Bottom.
4598 // Leave k_ary at NULL.
4599 } else {
4600 // Cannot compute array klass directly from basic type,
4601 // since subtypes of TypeInt all have basic type T_INT.
4602 #ifdef ASSERT
4603 if (verify && el->isa_int()) {
4604 // Check simple cases when verifying klass.
4605 BasicType bt = T_ILLEGAL;
4606 if (el == TypeInt::BYTE) {
4607 bt = T_BYTE;
4608 } else if (el == TypeInt::SHORT) {
4609 bt = T_SHORT;
4610 } else if (el == TypeInt::CHAR) {
4611 bt = T_CHAR;
4612 } else if (el == TypeInt::INT) {
4613 bt = T_INT;
4614 } else {
4615 return _klass; // just return specified klass
4616 }
4617 return ciTypeArrayKlass::make(bt);
4618 }
4619 #endif
4620 assert(!el->isa_int(),
4621 "integral arrays must be pre-equipped with a class");
4622 // Compute array klass directly from basic type
4623 k_ary = ciTypeArrayKlass::make(el->basic_type());
4624 }
4625 return k_ary;
4626 }
4628 //------------------------------klass------------------------------------------
4629 // Return the defining klass for this class
4630 ciKlass* TypeAryPtr::klass() const {
4631 if( _klass ) return _klass; // Return cached value, if possible
4633 // Oops, need to compute _klass and cache it
4634 ciKlass* k_ary = compute_klass();
4636 if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) {
4637 // The _klass field acts as a cache of the underlying
4638 // ciKlass for this array type. In order to set the field,
4639 // we need to cast away const-ness.
4640 //
4641 // IMPORTANT NOTE: we *never* set the _klass field for the
4642 // type TypeAryPtr::OOPS. This Type is shared between all
4643 // active compilations. However, the ciKlass which represents
4644 // this Type is *not* shared between compilations, so caching
4645 // this value would result in fetching a dangling pointer.
4646 //
4647 // Recomputing the underlying ciKlass for each request is
4648 // a bit less efficient than caching, but calls to
4649 // TypeAryPtr::OOPS->klass() are not common enough to matter.
4650 ((TypeAryPtr*)this)->_klass = k_ary;
4651 if (UseCompressedOops && k_ary != NULL && k_ary->is_obj_array_klass() &&
4652 _offset != 0 && _offset != arrayOopDesc::length_offset_in_bytes()) {
4653 ((TypeAryPtr*)this)->_is_ptr_to_narrowoop = true;
4654 }
4655 }
4656 return k_ary;
4657 }
4660 //------------------------------add_offset-------------------------------------
4661 // Access internals of klass object
4662 const TypePtr *TypeKlassPtr::add_offset( intptr_t offset ) const {
4663 return make( _ptr, klass(), xadd_offset(offset) );
4664 }
4666 //------------------------------cast_to_ptr_type-------------------------------
4667 const Type *TypeKlassPtr::cast_to_ptr_type(PTR ptr) const {
4668 assert(_base == KlassPtr, "subclass must override cast_to_ptr_type");
4669 if( ptr == _ptr ) return this;
4670 return make(ptr, _klass, _offset);
4671 }
4674 //-----------------------------cast_to_exactness-------------------------------
4675 const Type *TypeKlassPtr::cast_to_exactness(bool klass_is_exact) const {
4676 if( klass_is_exact == _klass_is_exact ) return this;
4677 if (!UseExactTypes) return this;
4678 return make(klass_is_exact ? Constant : NotNull, _klass, _offset);
4679 }
4682 //-----------------------------as_instance_type--------------------------------
4683 // Corresponding type for an instance of the given class.
4684 // It will be NotNull, and exact if and only if the klass type is exact.
4685 const TypeOopPtr* TypeKlassPtr::as_instance_type() const {
4686 ciKlass* k = klass();
4687 bool xk = klass_is_exact();
4688 //return TypeInstPtr::make(TypePtr::NotNull, k, xk, NULL, 0);
4689 const TypeOopPtr* toop = TypeOopPtr::make_from_klass_raw(k);
4690 guarantee(toop != NULL, "need type for given klass");
4691 toop = toop->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
4692 return toop->cast_to_exactness(xk)->is_oopptr();
4693 }
4696 //------------------------------xmeet------------------------------------------
4697 // Compute the MEET of two types, return a new Type object.
4698 const Type *TypeKlassPtr::xmeet( const Type *t ) const {
4699 // Perform a fast test for common case; meeting the same types together.
4700 if( this == t ) return this; // Meeting same type-rep?
4702 // Current "this->_base" is Pointer
4703 switch (t->base()) { // switch on original type
4705 case Int: // Mixing ints & oops happens when javac
4706 case Long: // reuses local variables
4707 case FloatTop:
4708 case FloatCon:
4709 case FloatBot:
4710 case DoubleTop:
4711 case DoubleCon:
4712 case DoubleBot:
4713 case NarrowOop:
4714 case NarrowKlass:
4715 case Bottom: // Ye Olde Default
4716 return Type::BOTTOM;
4717 case Top:
4718 return this;
4720 default: // All else is a mistake
4721 typerr(t);
4723 case AnyPtr: { // Meeting to AnyPtrs
4724 // Found an AnyPtr type vs self-KlassPtr type
4725 const TypePtr *tp = t->is_ptr();
4726 int offset = meet_offset(tp->offset());
4727 PTR ptr = meet_ptr(tp->ptr());
4728 switch (tp->ptr()) {
4729 case TopPTR:
4730 return this;
4731 case Null:
4732 if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset );
4733 case AnyNull:
4734 return make( ptr, klass(), offset );
4735 case BotPTR:
4736 case NotNull:
4737 return TypePtr::make(AnyPtr, ptr, offset);
4738 default: typerr(t);
4739 }
4740 }
4742 case RawPtr:
4743 case MetadataPtr:
4744 case OopPtr:
4745 case AryPtr: // Meet with AryPtr
4746 case InstPtr: // Meet with InstPtr
4747 return TypePtr::BOTTOM;
4749 //
4750 // A-top }
4751 // / | \ } Tops
4752 // B-top A-any C-top }
4753 // | / | \ | } Any-nulls
4754 // B-any | C-any }
4755 // | | |
4756 // B-con A-con C-con } constants; not comparable across classes
4757 // | | |
4758 // B-not | C-not }
4759 // | \ | / | } not-nulls
4760 // B-bot A-not C-bot }
4761 // \ | / } Bottoms
4762 // A-bot }
4763 //
4765 case KlassPtr: { // Meet two KlassPtr types
4766 const TypeKlassPtr *tkls = t->is_klassptr();
4767 int off = meet_offset(tkls->offset());
4768 PTR ptr = meet_ptr(tkls->ptr());
4770 // Check for easy case; klasses are equal (and perhaps not loaded!)
4771 // If we have constants, then we created oops so classes are loaded
4772 // and we can handle the constants further down. This case handles
4773 // not-loaded classes
4774 if( ptr != Constant && tkls->klass()->equals(klass()) ) {
4775 return make( ptr, klass(), off );
4776 }
4778 // Classes require inspection in the Java klass hierarchy. Must be loaded.
4779 ciKlass* tkls_klass = tkls->klass();
4780 ciKlass* this_klass = this->klass();
4781 assert( tkls_klass->is_loaded(), "This class should have been loaded.");
4782 assert( this_klass->is_loaded(), "This class should have been loaded.");
4784 // If 'this' type is above the centerline and is a superclass of the
4785 // other, we can treat 'this' as having the same type as the other.
4786 if ((above_centerline(this->ptr())) &&
4787 tkls_klass->is_subtype_of(this_klass)) {
4788 this_klass = tkls_klass;
4789 }
4790 // If 'tinst' type is above the centerline and is a superclass of the
4791 // other, we can treat 'tinst' as having the same type as the other.
4792 if ((above_centerline(tkls->ptr())) &&
4793 this_klass->is_subtype_of(tkls_klass)) {
4794 tkls_klass = this_klass;
4795 }
4797 // Check for classes now being equal
4798 if (tkls_klass->equals(this_klass)) {
4799 // If the klasses are equal, the constants may still differ. Fall to
4800 // NotNull if they do (neither constant is NULL; that is a special case
4801 // handled elsewhere).
4802 if( ptr == Constant ) {
4803 if (this->_ptr == Constant && tkls->_ptr == Constant &&
4804 this->klass()->equals(tkls->klass()));
4805 else if (above_centerline(this->ptr()));
4806 else if (above_centerline(tkls->ptr()));
4807 else
4808 ptr = NotNull;
4809 }
4810 return make( ptr, this_klass, off );
4811 } // Else classes are not equal
4813 // Since klasses are different, we require the LCA in the Java
4814 // class hierarchy - which means we have to fall to at least NotNull.
4815 if( ptr == TopPTR || ptr == AnyNull || ptr == Constant )
4816 ptr = NotNull;
4817 // Now we find the LCA of Java classes
4818 ciKlass* k = this_klass->least_common_ancestor(tkls_klass);
4819 return make( ptr, k, off );
4820 } // End of case KlassPtr
4822 } // End of switch
4823 return this; // Return the double constant
4824 }
4826 //------------------------------xdual------------------------------------------
4827 // Dual: compute field-by-field dual
4828 const Type *TypeKlassPtr::xdual() const {
4829 return new TypeKlassPtr( dual_ptr(), klass(), dual_offset() );
4830 }
4832 //------------------------------get_con----------------------------------------
4833 intptr_t TypeKlassPtr::get_con() const {
4834 assert( _ptr == Null || _ptr == Constant, "" );
4835 assert( _offset >= 0, "" );
4837 if (_offset != 0) {
4838 // After being ported to the compiler interface, the compiler no longer
4839 // directly manipulates the addresses of oops. Rather, it only has a pointer
4840 // to a handle at compile time. This handle is embedded in the generated
4841 // code and dereferenced at the time the nmethod is made. Until that time,
4842 // it is not reasonable to do arithmetic with the addresses of oops (we don't
4843 // have access to the addresses!). This does not seem to currently happen,
4844 // but this assertion here is to help prevent its occurence.
4845 tty->print_cr("Found oop constant with non-zero offset");
4846 ShouldNotReachHere();
4847 }
4849 return (intptr_t)klass()->constant_encoding();
4850 }
4851 //------------------------------dump2------------------------------------------
4852 // Dump Klass Type
4853 #ifndef PRODUCT
4854 void TypeKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
4855 switch( _ptr ) {
4856 case Constant:
4857 st->print("precise ");
4858 case NotNull:
4859 {
4860 const char *name = klass()->name()->as_utf8();
4861 if( name ) {
4862 st->print("klass %s: " INTPTR_FORMAT, name, klass());
4863 } else {
4864 ShouldNotReachHere();
4865 }
4866 }
4867 case BotPTR:
4868 if( !WizardMode && !Verbose && !_klass_is_exact ) break;
4869 case TopPTR:
4870 case AnyNull:
4871 st->print(":%s", ptr_msg[_ptr]);
4872 if( _klass_is_exact ) st->print(":exact");
4873 break;
4874 }
4876 if( _offset ) { // Dump offset, if any
4877 if( _offset == OffsetBot ) { st->print("+any"); }
4878 else if( _offset == OffsetTop ) { st->print("+unknown"); }
4879 else { st->print("+%d", _offset); }
4880 }
4882 st->print(" *");
4883 }
4884 #endif
4888 //=============================================================================
4889 // Convenience common pre-built types.
4891 //------------------------------make-------------------------------------------
4892 const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) {
4893 return (TypeFunc*)(new TypeFunc(domain,range))->hashcons();
4894 }
4896 //------------------------------make-------------------------------------------
4897 const TypeFunc *TypeFunc::make(ciMethod* method) {
4898 Compile* C = Compile::current();
4899 const TypeFunc* tf = C->last_tf(method); // check cache
4900 if (tf != NULL) return tf; // The hit rate here is almost 50%.
4901 const TypeTuple *domain;
4902 if (method->is_static()) {
4903 domain = TypeTuple::make_domain(NULL, method->signature());
4904 } else {
4905 domain = TypeTuple::make_domain(method->holder(), method->signature());
4906 }
4907 const TypeTuple *range = TypeTuple::make_range(method->signature());
4908 tf = TypeFunc::make(domain, range);
4909 C->set_last_tf(method, tf); // fill cache
4910 return tf;
4911 }
4913 //------------------------------meet-------------------------------------------
4914 // Compute the MEET of two types. It returns a new Type object.
4915 const Type *TypeFunc::xmeet( const Type *t ) const {
4916 // Perform a fast test for common case; meeting the same types together.
4917 if( this == t ) return this; // Meeting same type-rep?
4919 // Current "this->_base" is Func
4920 switch (t->base()) { // switch on original type
4922 case Bottom: // Ye Olde Default
4923 return t;
4925 default: // All else is a mistake
4926 typerr(t);
4928 case Top:
4929 break;
4930 }
4931 return this; // Return the double constant
4932 }
4934 //------------------------------xdual------------------------------------------
4935 // Dual: compute field-by-field dual
4936 const Type *TypeFunc::xdual() const {
4937 return this;
4938 }
4940 //------------------------------eq---------------------------------------------
4941 // Structural equality check for Type representations
4942 bool TypeFunc::eq( const Type *t ) const {
4943 const TypeFunc *a = (const TypeFunc*)t;
4944 return _domain == a->_domain &&
4945 _range == a->_range;
4946 }
4948 //------------------------------hash-------------------------------------------
4949 // Type-specific hashing function.
4950 int TypeFunc::hash(void) const {
4951 return (intptr_t)_domain + (intptr_t)_range;
4952 }
4954 //------------------------------dump2------------------------------------------
4955 // Dump Function Type
4956 #ifndef PRODUCT
4957 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
4958 if( _range->_cnt <= Parms )
4959 st->print("void");
4960 else {
4961 uint i;
4962 for (i = Parms; i < _range->_cnt-1; i++) {
4963 _range->field_at(i)->dump2(d,depth,st);
4964 st->print("/");
4965 }
4966 _range->field_at(i)->dump2(d,depth,st);
4967 }
4968 st->print(" ");
4969 st->print("( ");
4970 if( !depth || d[this] ) { // Check for recursive dump
4971 st->print("...)");
4972 return;
4973 }
4974 d.Insert((void*)this,(void*)this); // Stop recursion
4975 if (Parms < _domain->_cnt)
4976 _domain->field_at(Parms)->dump2(d,depth-1,st);
4977 for (uint i = Parms+1; i < _domain->_cnt; i++) {
4978 st->print(", ");
4979 _domain->field_at(i)->dump2(d,depth-1,st);
4980 }
4981 st->print(" )");
4982 }
4983 #endif
4985 //------------------------------singleton--------------------------------------
4986 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
4987 // constants (Ldi nodes). Singletons are integer, float or double constants
4988 // or a single symbol.
4989 bool TypeFunc::singleton(void) const {
4990 return false; // Never a singleton
4991 }
4993 bool TypeFunc::empty(void) const {
4994 return false; // Never empty
4995 }
4998 BasicType TypeFunc::return_type() const{
4999 if (range()->cnt() == TypeFunc::Parms) {
5000 return T_VOID;
5001 }
5002 return range()->field_at(TypeFunc::Parms)->basic_type();
5003 }