Wed, 10 Aug 2016 14:59:21 +0200
8152172: PPC64: Support AES intrinsics
Summary: Add support for AES intrinsics on PPC64.
Reviewed-by: kvn, mdoerr, simonis, zmajo
Contributed-by: Hiroshi H Horii <horii@jp.ibm.com>
1 /*
2 * Copyright (c) 1997, 2016, 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 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 }
888 #endif
890 //------------------------------singleton--------------------------------------
891 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
892 // constants (Ldi nodes). Singletons are integer, float or double constants.
893 bool Type::singleton(void) const {
894 return _base == Top || _base == Half;
895 }
897 //------------------------------empty------------------------------------------
898 // TRUE if Type is a type with no values, FALSE otherwise.
899 bool Type::empty(void) const {
900 switch (_base) {
901 case DoubleTop:
902 case FloatTop:
903 case Top:
904 return true;
906 case Half:
907 case Abio:
908 case Return_Address:
909 case Memory:
910 case Bottom:
911 case FloatBot:
912 case DoubleBot:
913 return false; // never a singleton, therefore never empty
914 }
916 ShouldNotReachHere();
917 return false;
918 }
920 //------------------------------dump_stats-------------------------------------
921 // Dump collected statistics to stderr
922 #ifndef PRODUCT
923 void Type::dump_stats() {
924 tty->print("Types made: %d\n", type_dict()->Size());
925 }
926 #endif
928 //------------------------------typerr-----------------------------------------
929 void Type::typerr( const Type *t ) const {
930 #ifndef PRODUCT
931 tty->print("\nError mixing types: ");
932 dump();
933 tty->print(" and ");
934 t->dump();
935 tty->print("\n");
936 #endif
937 ShouldNotReachHere();
938 }
941 //=============================================================================
942 // Convenience common pre-built types.
943 const TypeF *TypeF::ZERO; // Floating point zero
944 const TypeF *TypeF::ONE; // Floating point one
946 //------------------------------make-------------------------------------------
947 // Create a float constant
948 const TypeF *TypeF::make(float f) {
949 return (TypeF*)(new TypeF(f))->hashcons();
950 }
952 //------------------------------meet-------------------------------------------
953 // Compute the MEET of two types. It returns a new Type object.
954 const Type *TypeF::xmeet( const Type *t ) const {
955 // Perform a fast test for common case; meeting the same types together.
956 if( this == t ) return this; // Meeting same type-rep?
958 // Current "this->_base" is FloatCon
959 switch (t->base()) { // Switch on original type
960 case AnyPtr: // Mixing with oops happens when javac
961 case RawPtr: // reuses local variables
962 case OopPtr:
963 case InstPtr:
964 case AryPtr:
965 case MetadataPtr:
966 case KlassPtr:
967 case NarrowOop:
968 case NarrowKlass:
969 case Int:
970 case Long:
971 case DoubleTop:
972 case DoubleCon:
973 case DoubleBot:
974 case Bottom: // Ye Olde Default
975 return Type::BOTTOM;
977 case FloatBot:
978 return t;
980 default: // All else is a mistake
981 typerr(t);
983 case FloatCon: // Float-constant vs Float-constant?
984 if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants?
985 // must compare bitwise as positive zero, negative zero and NaN have
986 // all the same representation in C++
987 return FLOAT; // Return generic float
988 // Equal constants
989 case Top:
990 case FloatTop:
991 break; // Return the float constant
992 }
993 return this; // Return the float constant
994 }
996 //------------------------------xdual------------------------------------------
997 // Dual: symmetric
998 const Type *TypeF::xdual() const {
999 return this;
1000 }
1002 //------------------------------eq---------------------------------------------
1003 // Structural equality check for Type representations
1004 bool TypeF::eq( const Type *t ) const {
1005 if( g_isnan(_f) ||
1006 g_isnan(t->getf()) ) {
1007 // One or both are NANs. If both are NANs return true, else false.
1008 return (g_isnan(_f) && g_isnan(t->getf()));
1009 }
1010 if (_f == t->getf()) {
1011 // (NaN is impossible at this point, since it is not equal even to itself)
1012 if (_f == 0.0) {
1013 // difference between positive and negative zero
1014 if (jint_cast(_f) != jint_cast(t->getf())) return false;
1015 }
1016 return true;
1017 }
1018 return false;
1019 }
1021 //------------------------------hash-------------------------------------------
1022 // Type-specific hashing function.
1023 int TypeF::hash(void) const {
1024 return *(int*)(&_f);
1025 }
1027 //------------------------------is_finite--------------------------------------
1028 // Has a finite value
1029 bool TypeF::is_finite() const {
1030 return g_isfinite(getf()) != 0;
1031 }
1033 //------------------------------is_nan-----------------------------------------
1034 // Is not a number (NaN)
1035 bool TypeF::is_nan() const {
1036 return g_isnan(getf()) != 0;
1037 }
1039 //------------------------------dump2------------------------------------------
1040 // Dump float constant Type
1041 #ifndef PRODUCT
1042 void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const {
1043 Type::dump2(d,depth, st);
1044 st->print("%f", _f);
1045 }
1046 #endif
1048 //------------------------------singleton--------------------------------------
1049 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1050 // constants (Ldi nodes). Singletons are integer, float or double constants
1051 // or a single symbol.
1052 bool TypeF::singleton(void) const {
1053 return true; // Always a singleton
1054 }
1056 bool TypeF::empty(void) const {
1057 return false; // always exactly a singleton
1058 }
1060 //=============================================================================
1061 // Convenience common pre-built types.
1062 const TypeD *TypeD::ZERO; // Floating point zero
1063 const TypeD *TypeD::ONE; // Floating point one
1065 //------------------------------make-------------------------------------------
1066 const TypeD *TypeD::make(double d) {
1067 return (TypeD*)(new TypeD(d))->hashcons();
1068 }
1070 //------------------------------meet-------------------------------------------
1071 // Compute the MEET of two types. It returns a new Type object.
1072 const Type *TypeD::xmeet( const Type *t ) const {
1073 // Perform a fast test for common case; meeting the same types together.
1074 if( this == t ) return this; // Meeting same type-rep?
1076 // Current "this->_base" is DoubleCon
1077 switch (t->base()) { // Switch on original type
1078 case AnyPtr: // Mixing with oops happens when javac
1079 case RawPtr: // reuses local variables
1080 case OopPtr:
1081 case InstPtr:
1082 case AryPtr:
1083 case MetadataPtr:
1084 case KlassPtr:
1085 case NarrowOop:
1086 case NarrowKlass:
1087 case Int:
1088 case Long:
1089 case FloatTop:
1090 case FloatCon:
1091 case FloatBot:
1092 case Bottom: // Ye Olde Default
1093 return Type::BOTTOM;
1095 case DoubleBot:
1096 return t;
1098 default: // All else is a mistake
1099 typerr(t);
1101 case DoubleCon: // Double-constant vs Double-constant?
1102 if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet)
1103 return DOUBLE; // Return generic double
1104 case Top:
1105 case DoubleTop:
1106 break;
1107 }
1108 return this; // Return the double constant
1109 }
1111 //------------------------------xdual------------------------------------------
1112 // Dual: symmetric
1113 const Type *TypeD::xdual() const {
1114 return this;
1115 }
1117 //------------------------------eq---------------------------------------------
1118 // Structural equality check for Type representations
1119 bool TypeD::eq( const Type *t ) const {
1120 if( g_isnan(_d) ||
1121 g_isnan(t->getd()) ) {
1122 // One or both are NANs. If both are NANs return true, else false.
1123 return (g_isnan(_d) && g_isnan(t->getd()));
1124 }
1125 if (_d == t->getd()) {
1126 // (NaN is impossible at this point, since it is not equal even to itself)
1127 if (_d == 0.0) {
1128 // difference between positive and negative zero
1129 if (jlong_cast(_d) != jlong_cast(t->getd())) return false;
1130 }
1131 return true;
1132 }
1133 return false;
1134 }
1136 //------------------------------hash-------------------------------------------
1137 // Type-specific hashing function.
1138 int TypeD::hash(void) const {
1139 return *(int*)(&_d);
1140 }
1142 //------------------------------is_finite--------------------------------------
1143 // Has a finite value
1144 bool TypeD::is_finite() const {
1145 return g_isfinite(getd()) != 0;
1146 }
1148 //------------------------------is_nan-----------------------------------------
1149 // Is not a number (NaN)
1150 bool TypeD::is_nan() const {
1151 return g_isnan(getd()) != 0;
1152 }
1154 //------------------------------dump2------------------------------------------
1155 // Dump double constant Type
1156 #ifndef PRODUCT
1157 void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const {
1158 Type::dump2(d,depth,st);
1159 st->print("%f", _d);
1160 }
1161 #endif
1163 //------------------------------singleton--------------------------------------
1164 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1165 // constants (Ldi nodes). Singletons are integer, float or double constants
1166 // or a single symbol.
1167 bool TypeD::singleton(void) const {
1168 return true; // Always a singleton
1169 }
1171 bool TypeD::empty(void) const {
1172 return false; // always exactly a singleton
1173 }
1175 //=============================================================================
1176 // Convience common pre-built types.
1177 const TypeInt *TypeInt::MINUS_1;// -1
1178 const TypeInt *TypeInt::ZERO; // 0
1179 const TypeInt *TypeInt::ONE; // 1
1180 const TypeInt *TypeInt::BOOL; // 0 or 1, FALSE or TRUE.
1181 const TypeInt *TypeInt::CC; // -1,0 or 1, condition codes
1182 const TypeInt *TypeInt::CC_LT; // [-1] == MINUS_1
1183 const TypeInt *TypeInt::CC_GT; // [1] == ONE
1184 const TypeInt *TypeInt::CC_EQ; // [0] == ZERO
1185 const TypeInt *TypeInt::CC_LE; // [-1,0]
1186 const TypeInt *TypeInt::CC_GE; // [0,1] == BOOL (!)
1187 const TypeInt *TypeInt::BYTE; // Bytes, -128 to 127
1188 const TypeInt *TypeInt::UBYTE; // Unsigned Bytes, 0 to 255
1189 const TypeInt *TypeInt::CHAR; // Java chars, 0-65535
1190 const TypeInt *TypeInt::SHORT; // Java shorts, -32768-32767
1191 const TypeInt *TypeInt::POS; // Positive 32-bit integers or zero
1192 const TypeInt *TypeInt::POS1; // Positive 32-bit integers
1193 const TypeInt *TypeInt::INT; // 32-bit integers
1194 const TypeInt *TypeInt::SYMINT; // symmetric range [-max_jint..max_jint]
1195 const TypeInt *TypeInt::TYPE_DOMAIN; // alias for TypeInt::INT
1197 //------------------------------TypeInt----------------------------------------
1198 TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) {
1199 }
1201 //------------------------------make-------------------------------------------
1202 const TypeInt *TypeInt::make( jint lo ) {
1203 return (TypeInt*)(new TypeInt(lo,lo,WidenMin))->hashcons();
1204 }
1206 static int normalize_int_widen( jint lo, jint hi, int w ) {
1207 // Certain normalizations keep us sane when comparing types.
1208 // The 'SMALLINT' covers constants and also CC and its relatives.
1209 if (lo <= hi) {
1210 if (((juint)hi - lo) <= SMALLINT) w = Type::WidenMin;
1211 if (((juint)hi - lo) >= max_juint) w = Type::WidenMax; // TypeInt::INT
1212 } else {
1213 if (((juint)lo - hi) <= SMALLINT) w = Type::WidenMin;
1214 if (((juint)lo - hi) >= max_juint) w = Type::WidenMin; // dual TypeInt::INT
1215 }
1216 return w;
1217 }
1219 const TypeInt *TypeInt::make( jint lo, jint hi, int w ) {
1220 w = normalize_int_widen(lo, hi, w);
1221 return (TypeInt*)(new TypeInt(lo,hi,w))->hashcons();
1222 }
1224 //------------------------------meet-------------------------------------------
1225 // Compute the MEET of two types. It returns a new Type representation object
1226 // with reference count equal to the number of Types pointing at it.
1227 // Caller should wrap a Types around it.
1228 const Type *TypeInt::xmeet( const Type *t ) const {
1229 // Perform a fast test for common case; meeting the same types together.
1230 if( this == t ) return this; // Meeting same type?
1232 // Currently "this->_base" is a TypeInt
1233 switch (t->base()) { // Switch on original type
1234 case AnyPtr: // Mixing with oops happens when javac
1235 case RawPtr: // reuses local variables
1236 case OopPtr:
1237 case InstPtr:
1238 case AryPtr:
1239 case MetadataPtr:
1240 case KlassPtr:
1241 case NarrowOop:
1242 case NarrowKlass:
1243 case Long:
1244 case FloatTop:
1245 case FloatCon:
1246 case FloatBot:
1247 case DoubleTop:
1248 case DoubleCon:
1249 case DoubleBot:
1250 case Bottom: // Ye Olde Default
1251 return Type::BOTTOM;
1252 default: // All else is a mistake
1253 typerr(t);
1254 case Top: // No change
1255 return this;
1256 case Int: // Int vs Int?
1257 break;
1258 }
1260 // Expand covered set
1261 const TypeInt *r = t->is_int();
1262 return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) );
1263 }
1265 //------------------------------xdual------------------------------------------
1266 // Dual: reverse hi & lo; flip widen
1267 const Type *TypeInt::xdual() const {
1268 int w = normalize_int_widen(_hi,_lo, WidenMax-_widen);
1269 return new TypeInt(_hi,_lo,w);
1270 }
1272 //------------------------------widen------------------------------------------
1273 // Only happens for optimistic top-down optimizations.
1274 const Type *TypeInt::widen( const Type *old, const Type* limit ) const {
1275 // Coming from TOP or such; no widening
1276 if( old->base() != Int ) return this;
1277 const TypeInt *ot = old->is_int();
1279 // If new guy is equal to old guy, no widening
1280 if( _lo == ot->_lo && _hi == ot->_hi )
1281 return old;
1283 // If new guy contains old, then we widened
1284 if( _lo <= ot->_lo && _hi >= ot->_hi ) {
1285 // New contains old
1286 // If new guy is already wider than old, no widening
1287 if( _widen > ot->_widen ) return this;
1288 // If old guy was a constant, do not bother
1289 if (ot->_lo == ot->_hi) return this;
1290 // Now widen new guy.
1291 // Check for widening too far
1292 if (_widen == WidenMax) {
1293 int max = max_jint;
1294 int min = min_jint;
1295 if (limit->isa_int()) {
1296 max = limit->is_int()->_hi;
1297 min = limit->is_int()->_lo;
1298 }
1299 if (min < _lo && _hi < max) {
1300 // If neither endpoint is extremal yet, push out the endpoint
1301 // which is closer to its respective limit.
1302 if (_lo >= 0 || // easy common case
1303 (juint)(_lo - min) >= (juint)(max - _hi)) {
1304 // Try to widen to an unsigned range type of 31 bits:
1305 return make(_lo, max, WidenMax);
1306 } else {
1307 return make(min, _hi, WidenMax);
1308 }
1309 }
1310 return TypeInt::INT;
1311 }
1312 // Returned widened new guy
1313 return make(_lo,_hi,_widen+1);
1314 }
1316 // If old guy contains new, then we probably widened too far & dropped to
1317 // bottom. Return the wider fellow.
1318 if ( ot->_lo <= _lo && ot->_hi >= _hi )
1319 return old;
1321 //fatal("Integer value range is not subset");
1322 //return this;
1323 return TypeInt::INT;
1324 }
1326 //------------------------------narrow---------------------------------------
1327 // Only happens for pessimistic optimizations.
1328 const Type *TypeInt::narrow( const Type *old ) const {
1329 if (_lo >= _hi) return this; // already narrow enough
1330 if (old == NULL) return this;
1331 const TypeInt* ot = old->isa_int();
1332 if (ot == NULL) return this;
1333 jint olo = ot->_lo;
1334 jint ohi = ot->_hi;
1336 // If new guy is equal to old guy, no narrowing
1337 if (_lo == olo && _hi == ohi) return old;
1339 // If old guy was maximum range, allow the narrowing
1340 if (olo == min_jint && ohi == max_jint) return this;
1342 if (_lo < olo || _hi > ohi)
1343 return this; // doesn't narrow; pretty wierd
1345 // The new type narrows the old type, so look for a "death march".
1346 // See comments on PhaseTransform::saturate.
1347 juint nrange = _hi - _lo;
1348 juint orange = ohi - olo;
1349 if (nrange < max_juint - 1 && nrange > (orange >> 1) + (SMALLINT*2)) {
1350 // Use the new type only if the range shrinks a lot.
1351 // We do not want the optimizer computing 2^31 point by point.
1352 return old;
1353 }
1355 return this;
1356 }
1358 //-----------------------------filter------------------------------------------
1359 const Type *TypeInt::filter_helper(const Type *kills, bool include_speculative) const {
1360 const TypeInt* ft = join_helper(kills, include_speculative)->isa_int();
1361 if (ft == NULL || ft->empty())
1362 return Type::TOP; // Canonical empty value
1363 if (ft->_widen < this->_widen) {
1364 // Do not allow the value of kill->_widen to affect the outcome.
1365 // The widen bits must be allowed to run freely through the graph.
1366 ft = TypeInt::make(ft->_lo, ft->_hi, this->_widen);
1367 }
1368 return ft;
1369 }
1371 //------------------------------eq---------------------------------------------
1372 // Structural equality check for Type representations
1373 bool TypeInt::eq( const Type *t ) const {
1374 const TypeInt *r = t->is_int(); // Handy access
1375 return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen;
1376 }
1378 //------------------------------hash-------------------------------------------
1379 // Type-specific hashing function.
1380 int TypeInt::hash(void) const {
1381 return _lo+_hi+_widen+(int)Type::Int;
1382 }
1384 //------------------------------is_finite--------------------------------------
1385 // Has a finite value
1386 bool TypeInt::is_finite() const {
1387 return true;
1388 }
1390 //------------------------------dump2------------------------------------------
1391 // Dump TypeInt
1392 #ifndef PRODUCT
1393 static const char* intname(char* buf, jint n) {
1394 if (n == min_jint)
1395 return "min";
1396 else if (n < min_jint + 10000)
1397 sprintf(buf, "min+" INT32_FORMAT, n - min_jint);
1398 else if (n == max_jint)
1399 return "max";
1400 else if (n > max_jint - 10000)
1401 sprintf(buf, "max-" INT32_FORMAT, max_jint - n);
1402 else
1403 sprintf(buf, INT32_FORMAT, n);
1404 return buf;
1405 }
1407 void TypeInt::dump2( Dict &d, uint depth, outputStream *st ) const {
1408 char buf[40], buf2[40];
1409 if (_lo == min_jint && _hi == max_jint)
1410 st->print("int");
1411 else if (is_con())
1412 st->print("int:%s", intname(buf, get_con()));
1413 else if (_lo == BOOL->_lo && _hi == BOOL->_hi)
1414 st->print("bool");
1415 else if (_lo == BYTE->_lo && _hi == BYTE->_hi)
1416 st->print("byte");
1417 else if (_lo == CHAR->_lo && _hi == CHAR->_hi)
1418 st->print("char");
1419 else if (_lo == SHORT->_lo && _hi == SHORT->_hi)
1420 st->print("short");
1421 else if (_hi == max_jint)
1422 st->print("int:>=%s", intname(buf, _lo));
1423 else if (_lo == min_jint)
1424 st->print("int:<=%s", intname(buf, _hi));
1425 else
1426 st->print("int:%s..%s", intname(buf, _lo), intname(buf2, _hi));
1428 if (_widen != 0 && this != TypeInt::INT)
1429 st->print(":%.*s", _widen, "wwww");
1430 }
1431 #endif
1433 //------------------------------singleton--------------------------------------
1434 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1435 // constants.
1436 bool TypeInt::singleton(void) const {
1437 return _lo >= _hi;
1438 }
1440 bool TypeInt::empty(void) const {
1441 return _lo > _hi;
1442 }
1444 //=============================================================================
1445 // Convenience common pre-built types.
1446 const TypeLong *TypeLong::MINUS_1;// -1
1447 const TypeLong *TypeLong::ZERO; // 0
1448 const TypeLong *TypeLong::ONE; // 1
1449 const TypeLong *TypeLong::POS; // >=0
1450 const TypeLong *TypeLong::LONG; // 64-bit integers
1451 const TypeLong *TypeLong::INT; // 32-bit subrange
1452 const TypeLong *TypeLong::UINT; // 32-bit unsigned subrange
1453 const TypeLong *TypeLong::TYPE_DOMAIN; // alias for TypeLong::LONG
1455 //------------------------------TypeLong---------------------------------------
1456 TypeLong::TypeLong( jlong lo, jlong hi, int w ) : Type(Long), _lo(lo), _hi(hi), _widen(w) {
1457 }
1459 //------------------------------make-------------------------------------------
1460 const TypeLong *TypeLong::make( jlong lo ) {
1461 return (TypeLong*)(new TypeLong(lo,lo,WidenMin))->hashcons();
1462 }
1464 static int normalize_long_widen( jlong lo, jlong hi, int w ) {
1465 // Certain normalizations keep us sane when comparing types.
1466 // The 'SMALLINT' covers constants.
1467 if (lo <= hi) {
1468 if (((julong)hi - lo) <= SMALLINT) w = Type::WidenMin;
1469 if (((julong)hi - lo) >= max_julong) w = Type::WidenMax; // TypeLong::LONG
1470 } else {
1471 if (((julong)lo - hi) <= SMALLINT) w = Type::WidenMin;
1472 if (((julong)lo - hi) >= max_julong) w = Type::WidenMin; // dual TypeLong::LONG
1473 }
1474 return w;
1475 }
1477 const TypeLong *TypeLong::make( jlong lo, jlong hi, int w ) {
1478 w = normalize_long_widen(lo, hi, w);
1479 return (TypeLong*)(new TypeLong(lo,hi,w))->hashcons();
1480 }
1483 //------------------------------meet-------------------------------------------
1484 // Compute the MEET of two types. It returns a new Type representation object
1485 // with reference count equal to the number of Types pointing at it.
1486 // Caller should wrap a Types around it.
1487 const Type *TypeLong::xmeet( const Type *t ) const {
1488 // Perform a fast test for common case; meeting the same types together.
1489 if( this == t ) return this; // Meeting same type?
1491 // Currently "this->_base" is a TypeLong
1492 switch (t->base()) { // Switch on original type
1493 case AnyPtr: // Mixing with oops happens when javac
1494 case RawPtr: // reuses local variables
1495 case OopPtr:
1496 case InstPtr:
1497 case AryPtr:
1498 case MetadataPtr:
1499 case KlassPtr:
1500 case NarrowOop:
1501 case NarrowKlass:
1502 case Int:
1503 case FloatTop:
1504 case FloatCon:
1505 case FloatBot:
1506 case DoubleTop:
1507 case DoubleCon:
1508 case DoubleBot:
1509 case Bottom: // Ye Olde Default
1510 return Type::BOTTOM;
1511 default: // All else is a mistake
1512 typerr(t);
1513 case Top: // No change
1514 return this;
1515 case Long: // Long vs Long?
1516 break;
1517 }
1519 // Expand covered set
1520 const TypeLong *r = t->is_long(); // Turn into a TypeLong
1521 return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) );
1522 }
1524 //------------------------------xdual------------------------------------------
1525 // Dual: reverse hi & lo; flip widen
1526 const Type *TypeLong::xdual() const {
1527 int w = normalize_long_widen(_hi,_lo, WidenMax-_widen);
1528 return new TypeLong(_hi,_lo,w);
1529 }
1531 //------------------------------widen------------------------------------------
1532 // Only happens for optimistic top-down optimizations.
1533 const Type *TypeLong::widen( const Type *old, const Type* limit ) const {
1534 // Coming from TOP or such; no widening
1535 if( old->base() != Long ) return this;
1536 const TypeLong *ot = old->is_long();
1538 // If new guy is equal to old guy, no widening
1539 if( _lo == ot->_lo && _hi == ot->_hi )
1540 return old;
1542 // If new guy contains old, then we widened
1543 if( _lo <= ot->_lo && _hi >= ot->_hi ) {
1544 // New contains old
1545 // If new guy is already wider than old, no widening
1546 if( _widen > ot->_widen ) return this;
1547 // If old guy was a constant, do not bother
1548 if (ot->_lo == ot->_hi) return this;
1549 // Now widen new guy.
1550 // Check for widening too far
1551 if (_widen == WidenMax) {
1552 jlong max = max_jlong;
1553 jlong min = min_jlong;
1554 if (limit->isa_long()) {
1555 max = limit->is_long()->_hi;
1556 min = limit->is_long()->_lo;
1557 }
1558 if (min < _lo && _hi < max) {
1559 // If neither endpoint is extremal yet, push out the endpoint
1560 // which is closer to its respective limit.
1561 if (_lo >= 0 || // easy common case
1562 (julong)(_lo - min) >= (julong)(max - _hi)) {
1563 // Try to widen to an unsigned range type of 32/63 bits:
1564 if (max >= max_juint && _hi < max_juint)
1565 return make(_lo, max_juint, WidenMax);
1566 else
1567 return make(_lo, max, WidenMax);
1568 } else {
1569 return make(min, _hi, WidenMax);
1570 }
1571 }
1572 return TypeLong::LONG;
1573 }
1574 // Returned widened new guy
1575 return make(_lo,_hi,_widen+1);
1576 }
1578 // If old guy contains new, then we probably widened too far & dropped to
1579 // bottom. Return the wider fellow.
1580 if ( ot->_lo <= _lo && ot->_hi >= _hi )
1581 return old;
1583 // fatal("Long value range is not subset");
1584 // return this;
1585 return TypeLong::LONG;
1586 }
1588 //------------------------------narrow----------------------------------------
1589 // Only happens for pessimistic optimizations.
1590 const Type *TypeLong::narrow( const Type *old ) const {
1591 if (_lo >= _hi) return this; // already narrow enough
1592 if (old == NULL) return this;
1593 const TypeLong* ot = old->isa_long();
1594 if (ot == NULL) return this;
1595 jlong olo = ot->_lo;
1596 jlong ohi = ot->_hi;
1598 // If new guy is equal to old guy, no narrowing
1599 if (_lo == olo && _hi == ohi) return old;
1601 // If old guy was maximum range, allow the narrowing
1602 if (olo == min_jlong && ohi == max_jlong) return this;
1604 if (_lo < olo || _hi > ohi)
1605 return this; // doesn't narrow; pretty wierd
1607 // The new type narrows the old type, so look for a "death march".
1608 // See comments on PhaseTransform::saturate.
1609 julong nrange = _hi - _lo;
1610 julong orange = ohi - olo;
1611 if (nrange < max_julong - 1 && nrange > (orange >> 1) + (SMALLINT*2)) {
1612 // Use the new type only if the range shrinks a lot.
1613 // We do not want the optimizer computing 2^31 point by point.
1614 return old;
1615 }
1617 return this;
1618 }
1620 //-----------------------------filter------------------------------------------
1621 const Type *TypeLong::filter_helper(const Type *kills, bool include_speculative) const {
1622 const TypeLong* ft = join_helper(kills, include_speculative)->isa_long();
1623 if (ft == NULL || ft->empty())
1624 return Type::TOP; // Canonical empty value
1625 if (ft->_widen < this->_widen) {
1626 // Do not allow the value of kill->_widen to affect the outcome.
1627 // The widen bits must be allowed to run freely through the graph.
1628 ft = TypeLong::make(ft->_lo, ft->_hi, this->_widen);
1629 }
1630 return ft;
1631 }
1633 //------------------------------eq---------------------------------------------
1634 // Structural equality check for Type representations
1635 bool TypeLong::eq( const Type *t ) const {
1636 const TypeLong *r = t->is_long(); // Handy access
1637 return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen;
1638 }
1640 //------------------------------hash-------------------------------------------
1641 // Type-specific hashing function.
1642 int TypeLong::hash(void) const {
1643 return (int)(_lo+_hi+_widen+(int)Type::Long);
1644 }
1646 //------------------------------is_finite--------------------------------------
1647 // Has a finite value
1648 bool TypeLong::is_finite() const {
1649 return true;
1650 }
1652 //------------------------------dump2------------------------------------------
1653 // Dump TypeLong
1654 #ifndef PRODUCT
1655 static const char* longnamenear(jlong x, const char* xname, char* buf, jlong n) {
1656 if (n > x) {
1657 if (n >= x + 10000) return NULL;
1658 sprintf(buf, "%s+" JLONG_FORMAT, xname, n - x);
1659 } else if (n < x) {
1660 if (n <= x - 10000) return NULL;
1661 sprintf(buf, "%s-" JLONG_FORMAT, xname, x - n);
1662 } else {
1663 return xname;
1664 }
1665 return buf;
1666 }
1668 static const char* longname(char* buf, jlong n) {
1669 const char* str;
1670 if (n == min_jlong)
1671 return "min";
1672 else if (n < min_jlong + 10000)
1673 sprintf(buf, "min+" JLONG_FORMAT, n - min_jlong);
1674 else if (n == max_jlong)
1675 return "max";
1676 else if (n > max_jlong - 10000)
1677 sprintf(buf, "max-" JLONG_FORMAT, max_jlong - n);
1678 else if ((str = longnamenear(max_juint, "maxuint", buf, n)) != NULL)
1679 return str;
1680 else if ((str = longnamenear(max_jint, "maxint", buf, n)) != NULL)
1681 return str;
1682 else if ((str = longnamenear(min_jint, "minint", buf, n)) != NULL)
1683 return str;
1684 else
1685 sprintf(buf, JLONG_FORMAT, n);
1686 return buf;
1687 }
1689 void TypeLong::dump2( Dict &d, uint depth, outputStream *st ) const {
1690 char buf[80], buf2[80];
1691 if (_lo == min_jlong && _hi == max_jlong)
1692 st->print("long");
1693 else if (is_con())
1694 st->print("long:%s", longname(buf, get_con()));
1695 else if (_hi == max_jlong)
1696 st->print("long:>=%s", longname(buf, _lo));
1697 else if (_lo == min_jlong)
1698 st->print("long:<=%s", longname(buf, _hi));
1699 else
1700 st->print("long:%s..%s", longname(buf, _lo), longname(buf2, _hi));
1702 if (_widen != 0 && this != TypeLong::LONG)
1703 st->print(":%.*s", _widen, "wwww");
1704 }
1705 #endif
1707 //------------------------------singleton--------------------------------------
1708 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1709 // constants
1710 bool TypeLong::singleton(void) const {
1711 return _lo >= _hi;
1712 }
1714 bool TypeLong::empty(void) const {
1715 return _lo > _hi;
1716 }
1718 //=============================================================================
1719 // Convenience common pre-built types.
1720 const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable
1721 const TypeTuple *TypeTuple::IFFALSE;
1722 const TypeTuple *TypeTuple::IFTRUE;
1723 const TypeTuple *TypeTuple::IFNEITHER;
1724 const TypeTuple *TypeTuple::LOOPBODY;
1725 const TypeTuple *TypeTuple::MEMBAR;
1726 const TypeTuple *TypeTuple::STORECONDITIONAL;
1727 const TypeTuple *TypeTuple::START_I2C;
1728 const TypeTuple *TypeTuple::INT_PAIR;
1729 const TypeTuple *TypeTuple::LONG_PAIR;
1730 const TypeTuple *TypeTuple::INT_CC_PAIR;
1731 const TypeTuple *TypeTuple::LONG_CC_PAIR;
1734 //------------------------------make-------------------------------------------
1735 // Make a TypeTuple from the range of a method signature
1736 const TypeTuple *TypeTuple::make_range(ciSignature* sig) {
1737 ciType* return_type = sig->return_type();
1738 uint total_fields = TypeFunc::Parms + return_type->size();
1739 const Type **field_array = fields(total_fields);
1740 switch (return_type->basic_type()) {
1741 case T_LONG:
1742 field_array[TypeFunc::Parms] = TypeLong::LONG;
1743 field_array[TypeFunc::Parms+1] = Type::HALF;
1744 break;
1745 case T_DOUBLE:
1746 field_array[TypeFunc::Parms] = Type::DOUBLE;
1747 field_array[TypeFunc::Parms+1] = Type::HALF;
1748 break;
1749 case T_OBJECT:
1750 case T_ARRAY:
1751 case T_BOOLEAN:
1752 case T_CHAR:
1753 case T_FLOAT:
1754 case T_BYTE:
1755 case T_SHORT:
1756 case T_INT:
1757 field_array[TypeFunc::Parms] = get_const_type(return_type);
1758 break;
1759 case T_VOID:
1760 break;
1761 default:
1762 ShouldNotReachHere();
1763 }
1764 return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons();
1765 }
1767 // Make a TypeTuple from the domain of a method signature
1768 const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig) {
1769 uint total_fields = TypeFunc::Parms + sig->size();
1771 uint pos = TypeFunc::Parms;
1772 const Type **field_array;
1773 if (recv != NULL) {
1774 total_fields++;
1775 field_array = fields(total_fields);
1776 // Use get_const_type here because it respects UseUniqueSubclasses:
1777 field_array[pos++] = get_const_type(recv)->join_speculative(TypePtr::NOTNULL);
1778 } else {
1779 field_array = fields(total_fields);
1780 }
1782 int i = 0;
1783 while (pos < total_fields) {
1784 ciType* type = sig->type_at(i);
1786 switch (type->basic_type()) {
1787 case T_LONG:
1788 field_array[pos++] = TypeLong::LONG;
1789 field_array[pos++] = Type::HALF;
1790 break;
1791 case T_DOUBLE:
1792 field_array[pos++] = Type::DOUBLE;
1793 field_array[pos++] = Type::HALF;
1794 break;
1795 case T_OBJECT:
1796 case T_ARRAY:
1797 case T_FLOAT:
1798 case T_INT:
1799 field_array[pos++] = get_const_type(type);
1800 break;
1801 case T_BOOLEAN:
1802 case T_CHAR:
1803 case T_BYTE:
1804 case T_SHORT:
1805 field_array[pos++] = TypeInt::INT;
1806 break;
1807 default:
1808 ShouldNotReachHere();
1809 }
1810 i++;
1811 }
1812 return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons();
1813 }
1815 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) {
1816 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons();
1817 }
1819 //------------------------------fields-----------------------------------------
1820 // Subroutine call type with space allocated for argument types
1821 const Type **TypeTuple::fields( uint arg_cnt ) {
1822 const Type **flds = (const Type **)(Compile::current()->type_arena()->Amalloc_4((TypeFunc::Parms+arg_cnt)*sizeof(Type*) ));
1823 flds[TypeFunc::Control ] = Type::CONTROL;
1824 flds[TypeFunc::I_O ] = Type::ABIO;
1825 flds[TypeFunc::Memory ] = Type::MEMORY;
1826 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM;
1827 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS;
1829 return flds;
1830 }
1832 //------------------------------meet-------------------------------------------
1833 // Compute the MEET of two types. It returns a new Type object.
1834 const Type *TypeTuple::xmeet( const Type *t ) const {
1835 // Perform a fast test for common case; meeting the same types together.
1836 if( this == t ) return this; // Meeting same type-rep?
1838 // Current "this->_base" is Tuple
1839 switch (t->base()) { // switch on original type
1841 case Bottom: // Ye Olde Default
1842 return t;
1844 default: // All else is a mistake
1845 typerr(t);
1847 case Tuple: { // Meeting 2 signatures?
1848 const TypeTuple *x = t->is_tuple();
1849 assert( _cnt == x->_cnt, "" );
1850 const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) ));
1851 for( uint i=0; i<_cnt; i++ )
1852 fields[i] = field_at(i)->xmeet( x->field_at(i) );
1853 return TypeTuple::make(_cnt,fields);
1854 }
1855 case Top:
1856 break;
1857 }
1858 return this; // Return the double constant
1859 }
1861 //------------------------------xdual------------------------------------------
1862 // Dual: compute field-by-field dual
1863 const Type *TypeTuple::xdual() const {
1864 const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) ));
1865 for( uint i=0; i<_cnt; i++ )
1866 fields[i] = _fields[i]->dual();
1867 return new TypeTuple(_cnt,fields);
1868 }
1870 //------------------------------eq---------------------------------------------
1871 // Structural equality check for Type representations
1872 bool TypeTuple::eq( const Type *t ) const {
1873 const TypeTuple *s = (const TypeTuple *)t;
1874 if (_cnt != s->_cnt) return false; // Unequal field counts
1875 for (uint i = 0; i < _cnt; i++)
1876 if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION!
1877 return false; // Missed
1878 return true;
1879 }
1881 //------------------------------hash-------------------------------------------
1882 // Type-specific hashing function.
1883 int TypeTuple::hash(void) const {
1884 intptr_t sum = _cnt;
1885 for( uint i=0; i<_cnt; i++ )
1886 sum += (intptr_t)_fields[i]; // Hash on pointers directly
1887 return sum;
1888 }
1890 //------------------------------dump2------------------------------------------
1891 // Dump signature Type
1892 #ifndef PRODUCT
1893 void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const {
1894 st->print("{");
1895 if( !depth || d[this] ) { // Check for recursive print
1896 st->print("...}");
1897 return;
1898 }
1899 d.Insert((void*)this, (void*)this); // Stop recursion
1900 if( _cnt ) {
1901 uint i;
1902 for( i=0; i<_cnt-1; i++ ) {
1903 st->print("%d:", i);
1904 _fields[i]->dump2(d, depth-1, st);
1905 st->print(", ");
1906 }
1907 st->print("%d:", i);
1908 _fields[i]->dump2(d, depth-1, st);
1909 }
1910 st->print("}");
1911 }
1912 #endif
1914 //------------------------------singleton--------------------------------------
1915 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
1916 // constants (Ldi nodes). Singletons are integer, float or double constants
1917 // or a single symbol.
1918 bool TypeTuple::singleton(void) const {
1919 return false; // Never a singleton
1920 }
1922 bool TypeTuple::empty(void) const {
1923 for( uint i=0; i<_cnt; i++ ) {
1924 if (_fields[i]->empty()) return true;
1925 }
1926 return false;
1927 }
1929 //=============================================================================
1930 // Convenience common pre-built types.
1932 inline const TypeInt* normalize_array_size(const TypeInt* size) {
1933 // Certain normalizations keep us sane when comparing types.
1934 // We do not want arrayOop variables to differ only by the wideness
1935 // of their index types. Pick minimum wideness, since that is the
1936 // forced wideness of small ranges anyway.
1937 if (size->_widen != Type::WidenMin)
1938 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin);
1939 else
1940 return size;
1941 }
1943 //------------------------------make-------------------------------------------
1944 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable) {
1945 if (UseCompressedOops && elem->isa_oopptr()) {
1946 elem = elem->make_narrowoop();
1947 }
1948 size = normalize_array_size(size);
1949 return (TypeAry*)(new TypeAry(elem,size,stable))->hashcons();
1950 }
1952 //------------------------------meet-------------------------------------------
1953 // Compute the MEET of two types. It returns a new Type object.
1954 const Type *TypeAry::xmeet( const Type *t ) const {
1955 // Perform a fast test for common case; meeting the same types together.
1956 if( this == t ) return this; // Meeting same type-rep?
1958 // Current "this->_base" is Ary
1959 switch (t->base()) { // switch on original type
1961 case Bottom: // Ye Olde Default
1962 return t;
1964 default: // All else is a mistake
1965 typerr(t);
1967 case Array: { // Meeting 2 arrays?
1968 const TypeAry *a = t->is_ary();
1969 return TypeAry::make(_elem->meet_speculative(a->_elem),
1970 _size->xmeet(a->_size)->is_int(),
1971 _stable & a->_stable);
1972 }
1973 case Top:
1974 break;
1975 }
1976 return this; // Return the double constant
1977 }
1979 //------------------------------xdual------------------------------------------
1980 // Dual: compute field-by-field dual
1981 const Type *TypeAry::xdual() const {
1982 const TypeInt* size_dual = _size->dual()->is_int();
1983 size_dual = normalize_array_size(size_dual);
1984 return new TypeAry(_elem->dual(), size_dual, !_stable);
1985 }
1987 //------------------------------eq---------------------------------------------
1988 // Structural equality check for Type representations
1989 bool TypeAry::eq( const Type *t ) const {
1990 const TypeAry *a = (const TypeAry*)t;
1991 return _elem == a->_elem &&
1992 _stable == a->_stable &&
1993 _size == a->_size;
1994 }
1996 //------------------------------hash-------------------------------------------
1997 // Type-specific hashing function.
1998 int TypeAry::hash(void) const {
1999 return (intptr_t)_elem + (intptr_t)_size + (_stable ? 43 : 0);
2000 }
2002 /**
2003 * Return same type without a speculative part in the element
2004 */
2005 const Type* TypeAry::remove_speculative() const {
2006 return make(_elem->remove_speculative(), _size, _stable);
2007 }
2009 //----------------------interface_vs_oop---------------------------------------
2010 #ifdef ASSERT
2011 bool TypeAry::interface_vs_oop(const Type *t) const {
2012 const TypeAry* t_ary = t->is_ary();
2013 if (t_ary) {
2014 const TypePtr* this_ptr = _elem->make_ptr(); // In case we have narrow_oops
2015 const TypePtr* t_ptr = t_ary->_elem->make_ptr();
2016 if(this_ptr != NULL && t_ptr != NULL) {
2017 return this_ptr->interface_vs_oop(t_ptr);
2018 }
2019 }
2020 return false;
2021 }
2022 #endif
2024 //------------------------------dump2------------------------------------------
2025 #ifndef PRODUCT
2026 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const {
2027 if (_stable) st->print("stable:");
2028 _elem->dump2(d, depth, st);
2029 st->print("[");
2030 _size->dump2(d, depth, st);
2031 st->print("]");
2032 }
2033 #endif
2035 //------------------------------singleton--------------------------------------
2036 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2037 // constants (Ldi nodes). Singletons are integer, float or double constants
2038 // or a single symbol.
2039 bool TypeAry::singleton(void) const {
2040 return false; // Never a singleton
2041 }
2043 bool TypeAry::empty(void) const {
2044 return _elem->empty() || _size->empty();
2045 }
2047 //--------------------------ary_must_be_exact----------------------------------
2048 bool TypeAry::ary_must_be_exact() const {
2049 if (!UseExactTypes) return false;
2050 // This logic looks at the element type of an array, and returns true
2051 // if the element type is either a primitive or a final instance class.
2052 // In such cases, an array built on this ary must have no subclasses.
2053 if (_elem == BOTTOM) return false; // general array not exact
2054 if (_elem == TOP ) return false; // inverted general array not exact
2055 const TypeOopPtr* toop = NULL;
2056 if (UseCompressedOops && _elem->isa_narrowoop()) {
2057 toop = _elem->make_ptr()->isa_oopptr();
2058 } else {
2059 toop = _elem->isa_oopptr();
2060 }
2061 if (!toop) return true; // a primitive type, like int
2062 ciKlass* tklass = toop->klass();
2063 if (tklass == NULL) return false; // unloaded class
2064 if (!tklass->is_loaded()) return false; // unloaded class
2065 const TypeInstPtr* tinst;
2066 if (_elem->isa_narrowoop())
2067 tinst = _elem->make_ptr()->isa_instptr();
2068 else
2069 tinst = _elem->isa_instptr();
2070 if (tinst)
2071 return tklass->as_instance_klass()->is_final();
2072 const TypeAryPtr* tap;
2073 if (_elem->isa_narrowoop())
2074 tap = _elem->make_ptr()->isa_aryptr();
2075 else
2076 tap = _elem->isa_aryptr();
2077 if (tap)
2078 return tap->ary()->ary_must_be_exact();
2079 return false;
2080 }
2082 //==============================TypeVect=======================================
2083 // Convenience common pre-built types.
2084 const TypeVect *TypeVect::VECTS = NULL; // 32-bit vectors
2085 const TypeVect *TypeVect::VECTD = NULL; // 64-bit vectors
2086 const TypeVect *TypeVect::VECTX = NULL; // 128-bit vectors
2087 const TypeVect *TypeVect::VECTY = NULL; // 256-bit vectors
2089 //------------------------------make-------------------------------------------
2090 const TypeVect* TypeVect::make(const Type *elem, uint length) {
2091 BasicType elem_bt = elem->array_element_basic_type();
2092 assert(is_java_primitive(elem_bt), "only primitive types in vector");
2093 assert(length > 1 && is_power_of_2(length), "vector length is power of 2");
2094 assert(Matcher::vector_size_supported(elem_bt, length), "length in range");
2095 int size = length * type2aelembytes(elem_bt);
2096 switch (Matcher::vector_ideal_reg(size)) {
2097 case Op_VecS:
2098 return (TypeVect*)(new TypeVectS(elem, length))->hashcons();
2099 case Op_RegL:
2100 case Op_VecD:
2101 case Op_RegD:
2102 return (TypeVect*)(new TypeVectD(elem, length))->hashcons();
2103 case Op_VecX:
2104 return (TypeVect*)(new TypeVectX(elem, length))->hashcons();
2105 case Op_VecY:
2106 return (TypeVect*)(new TypeVectY(elem, length))->hashcons();
2107 }
2108 ShouldNotReachHere();
2109 return NULL;
2110 }
2112 //------------------------------meet-------------------------------------------
2113 // Compute the MEET of two types. It returns a new Type object.
2114 const Type *TypeVect::xmeet( const Type *t ) const {
2115 // Perform a fast test for common case; meeting the same types together.
2116 if( this == t ) return this; // Meeting same type-rep?
2118 // Current "this->_base" is Vector
2119 switch (t->base()) { // switch on original type
2121 case Bottom: // Ye Olde Default
2122 return t;
2124 default: // All else is a mistake
2125 typerr(t);
2127 case VectorS:
2128 case VectorD:
2129 case VectorX:
2130 case VectorY: { // Meeting 2 vectors?
2131 const TypeVect* v = t->is_vect();
2132 assert( base() == v->base(), "");
2133 assert(length() == v->length(), "");
2134 assert(element_basic_type() == v->element_basic_type(), "");
2135 return TypeVect::make(_elem->xmeet(v->_elem), _length);
2136 }
2137 case Top:
2138 break;
2139 }
2140 return this;
2141 }
2143 //------------------------------xdual------------------------------------------
2144 // Dual: compute field-by-field dual
2145 const Type *TypeVect::xdual() const {
2146 return new TypeVect(base(), _elem->dual(), _length);
2147 }
2149 //------------------------------eq---------------------------------------------
2150 // Structural equality check for Type representations
2151 bool TypeVect::eq(const Type *t) const {
2152 const TypeVect *v = t->is_vect();
2153 return (_elem == v->_elem) && (_length == v->_length);
2154 }
2156 //------------------------------hash-------------------------------------------
2157 // Type-specific hashing function.
2158 int TypeVect::hash(void) const {
2159 return (intptr_t)_elem + (intptr_t)_length;
2160 }
2162 //------------------------------singleton--------------------------------------
2163 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2164 // constants (Ldi nodes). Vector is singleton if all elements are the same
2165 // constant value (when vector is created with Replicate code).
2166 bool TypeVect::singleton(void) const {
2167 // There is no Con node for vectors yet.
2168 // return _elem->singleton();
2169 return false;
2170 }
2172 bool TypeVect::empty(void) const {
2173 return _elem->empty();
2174 }
2176 //------------------------------dump2------------------------------------------
2177 #ifndef PRODUCT
2178 void TypeVect::dump2(Dict &d, uint depth, outputStream *st) const {
2179 switch (base()) {
2180 case VectorS:
2181 st->print("vectors["); break;
2182 case VectorD:
2183 st->print("vectord["); break;
2184 case VectorX:
2185 st->print("vectorx["); break;
2186 case VectorY:
2187 st->print("vectory["); break;
2188 default:
2189 ShouldNotReachHere();
2190 }
2191 st->print("%d]:{", _length);
2192 _elem->dump2(d, depth, st);
2193 st->print("}");
2194 }
2195 #endif
2198 //=============================================================================
2199 // Convenience common pre-built types.
2200 const TypePtr *TypePtr::NULL_PTR;
2201 const TypePtr *TypePtr::NOTNULL;
2202 const TypePtr *TypePtr::BOTTOM;
2204 //------------------------------meet-------------------------------------------
2205 // Meet over the PTR enum
2206 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = {
2207 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,
2208 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,},
2209 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,},
2210 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,},
2211 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,},
2212 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,},
2213 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,}
2214 };
2216 //------------------------------make-------------------------------------------
2217 const TypePtr *TypePtr::make( TYPES t, enum PTR ptr, int offset ) {
2218 return (TypePtr*)(new TypePtr(t,ptr,offset))->hashcons();
2219 }
2221 //------------------------------cast_to_ptr_type-------------------------------
2222 const Type *TypePtr::cast_to_ptr_type(PTR ptr) const {
2223 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
2224 if( ptr == _ptr ) return this;
2225 return make(_base, ptr, _offset);
2226 }
2228 //------------------------------get_con----------------------------------------
2229 intptr_t TypePtr::get_con() const {
2230 assert( _ptr == Null, "" );
2231 return _offset;
2232 }
2234 //------------------------------meet-------------------------------------------
2235 // Compute the MEET of two types. It returns a new Type object.
2236 const Type *TypePtr::xmeet( const Type *t ) const {
2237 // Perform a fast test for common case; meeting the same types together.
2238 if( this == t ) return this; // Meeting same type-rep?
2240 // Current "this->_base" is AnyPtr
2241 switch (t->base()) { // switch on original type
2242 case Int: // Mixing ints & oops happens when javac
2243 case Long: // reuses local variables
2244 case FloatTop:
2245 case FloatCon:
2246 case FloatBot:
2247 case DoubleTop:
2248 case DoubleCon:
2249 case DoubleBot:
2250 case NarrowOop:
2251 case NarrowKlass:
2252 case Bottom: // Ye Olde Default
2253 return Type::BOTTOM;
2254 case Top:
2255 return this;
2257 case AnyPtr: { // Meeting to AnyPtrs
2258 const TypePtr *tp = t->is_ptr();
2259 return make( AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()) );
2260 }
2261 case RawPtr: // For these, flip the call around to cut down
2262 case OopPtr:
2263 case InstPtr: // on the cases I have to handle.
2264 case AryPtr:
2265 case MetadataPtr:
2266 case KlassPtr:
2267 return t->xmeet(this); // Call in reverse direction
2268 default: // All else is a mistake
2269 typerr(t);
2271 }
2272 return this;
2273 }
2275 //------------------------------meet_offset------------------------------------
2276 int TypePtr::meet_offset( int offset ) const {
2277 // Either is 'TOP' offset? Return the other offset!
2278 if( _offset == OffsetTop ) return offset;
2279 if( offset == OffsetTop ) return _offset;
2280 // If either is different, return 'BOTTOM' offset
2281 if( _offset != offset ) return OffsetBot;
2282 return _offset;
2283 }
2285 //------------------------------dual_offset------------------------------------
2286 int TypePtr::dual_offset( ) const {
2287 if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM'
2288 if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP'
2289 return _offset; // Map everything else into self
2290 }
2292 //------------------------------xdual------------------------------------------
2293 // Dual: compute field-by-field dual
2294 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
2295 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
2296 };
2297 const Type *TypePtr::xdual() const {
2298 return new TypePtr( AnyPtr, dual_ptr(), dual_offset() );
2299 }
2301 //------------------------------xadd_offset------------------------------------
2302 int TypePtr::xadd_offset( intptr_t offset ) const {
2303 // Adding to 'TOP' offset? Return 'TOP'!
2304 if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop;
2305 // Adding to 'BOTTOM' offset? Return 'BOTTOM'!
2306 if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot;
2307 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'!
2308 offset += (intptr_t)_offset;
2309 if (offset != (int)offset || offset == OffsetTop) return OffsetBot;
2311 // assert( _offset >= 0 && _offset+offset >= 0, "" );
2312 // It is possible to construct a negative offset during PhaseCCP
2314 return (int)offset; // Sum valid offsets
2315 }
2317 //------------------------------add_offset-------------------------------------
2318 const TypePtr *TypePtr::add_offset( intptr_t offset ) const {
2319 return make( AnyPtr, _ptr, xadd_offset(offset) );
2320 }
2322 //------------------------------eq---------------------------------------------
2323 // Structural equality check for Type representations
2324 bool TypePtr::eq( const Type *t ) const {
2325 const TypePtr *a = (const TypePtr*)t;
2326 return _ptr == a->ptr() && _offset == a->offset();
2327 }
2329 //------------------------------hash-------------------------------------------
2330 // Type-specific hashing function.
2331 int TypePtr::hash(void) const {
2332 return _ptr + _offset;
2333 }
2335 //------------------------------dump2------------------------------------------
2336 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
2337 "TopPTR","AnyNull","Constant","NULL","NotNull","BotPTR"
2338 };
2340 #ifndef PRODUCT
2341 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
2342 if( _ptr == Null ) st->print("NULL");
2343 else st->print("%s *", ptr_msg[_ptr]);
2344 if( _offset == OffsetTop ) st->print("+top");
2345 else if( _offset == OffsetBot ) st->print("+bot");
2346 else if( _offset ) st->print("+%d", _offset);
2347 }
2348 #endif
2350 //------------------------------singleton--------------------------------------
2351 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2352 // constants
2353 bool TypePtr::singleton(void) const {
2354 // TopPTR, Null, AnyNull, Constant are all singletons
2355 return (_offset != OffsetBot) && !below_centerline(_ptr);
2356 }
2358 bool TypePtr::empty(void) const {
2359 return (_offset == OffsetTop) || above_centerline(_ptr);
2360 }
2362 //=============================================================================
2363 // Convenience common pre-built types.
2364 const TypeRawPtr *TypeRawPtr::BOTTOM;
2365 const TypeRawPtr *TypeRawPtr::NOTNULL;
2367 //------------------------------make-------------------------------------------
2368 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
2369 assert( ptr != Constant, "what is the constant?" );
2370 assert( ptr != Null, "Use TypePtr for NULL" );
2371 return (TypeRawPtr*)(new TypeRawPtr(ptr,0))->hashcons();
2372 }
2374 const TypeRawPtr *TypeRawPtr::make( address bits ) {
2375 assert( bits, "Use TypePtr for NULL" );
2376 return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons();
2377 }
2379 //------------------------------cast_to_ptr_type-------------------------------
2380 const Type *TypeRawPtr::cast_to_ptr_type(PTR ptr) const {
2381 assert( ptr != Constant, "what is the constant?" );
2382 assert( ptr != Null, "Use TypePtr for NULL" );
2383 assert( _bits==0, "Why cast a constant address?");
2384 if( ptr == _ptr ) return this;
2385 return make(ptr);
2386 }
2388 //------------------------------get_con----------------------------------------
2389 intptr_t TypeRawPtr::get_con() const {
2390 assert( _ptr == Null || _ptr == Constant, "" );
2391 return (intptr_t)_bits;
2392 }
2394 //------------------------------meet-------------------------------------------
2395 // Compute the MEET of two types. It returns a new Type object.
2396 const Type *TypeRawPtr::xmeet( const Type *t ) const {
2397 // Perform a fast test for common case; meeting the same types together.
2398 if( this == t ) return this; // Meeting same type-rep?
2400 // Current "this->_base" is RawPtr
2401 switch( t->base() ) { // switch on original type
2402 case Bottom: // Ye Olde Default
2403 return t;
2404 case Top:
2405 return this;
2406 case AnyPtr: // Meeting to AnyPtrs
2407 break;
2408 case RawPtr: { // might be top, bot, any/not or constant
2409 enum PTR tptr = t->is_ptr()->ptr();
2410 enum PTR ptr = meet_ptr( tptr );
2411 if( ptr == Constant ) { // Cannot be equal constants, so...
2412 if( tptr == Constant && _ptr != Constant) return t;
2413 if( _ptr == Constant && tptr != Constant) return this;
2414 ptr = NotNull; // Fall down in lattice
2415 }
2416 return make( ptr );
2417 }
2419 case OopPtr:
2420 case InstPtr:
2421 case AryPtr:
2422 case MetadataPtr:
2423 case KlassPtr:
2424 return TypePtr::BOTTOM; // Oop meet raw is not well defined
2425 default: // All else is a mistake
2426 typerr(t);
2427 }
2429 // Found an AnyPtr type vs self-RawPtr type
2430 const TypePtr *tp = t->is_ptr();
2431 switch (tp->ptr()) {
2432 case TypePtr::TopPTR: return this;
2433 case TypePtr::BotPTR: return t;
2434 case TypePtr::Null:
2435 if( _ptr == TypePtr::TopPTR ) return t;
2436 return TypeRawPtr::BOTTOM;
2437 case TypePtr::NotNull: return TypePtr::make( AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0) );
2438 case TypePtr::AnyNull:
2439 if( _ptr == TypePtr::Constant) return this;
2440 return make( meet_ptr(TypePtr::AnyNull) );
2441 default: ShouldNotReachHere();
2442 }
2443 return this;
2444 }
2446 //------------------------------xdual------------------------------------------
2447 // Dual: compute field-by-field dual
2448 const Type *TypeRawPtr::xdual() const {
2449 return new TypeRawPtr( dual_ptr(), _bits );
2450 }
2452 //------------------------------add_offset-------------------------------------
2453 const TypePtr *TypeRawPtr::add_offset( intptr_t offset ) const {
2454 if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer
2455 if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer
2456 if( offset == 0 ) return this; // No change
2457 switch (_ptr) {
2458 case TypePtr::TopPTR:
2459 case TypePtr::BotPTR:
2460 case TypePtr::NotNull:
2461 return this;
2462 case TypePtr::Null:
2463 case TypePtr::Constant: {
2464 address bits = _bits+offset;
2465 if ( bits == 0 ) return TypePtr::NULL_PTR;
2466 return make( bits );
2467 }
2468 default: ShouldNotReachHere();
2469 }
2470 return NULL; // Lint noise
2471 }
2473 //------------------------------eq---------------------------------------------
2474 // Structural equality check for Type representations
2475 bool TypeRawPtr::eq( const Type *t ) const {
2476 const TypeRawPtr *a = (const TypeRawPtr*)t;
2477 return _bits == a->_bits && TypePtr::eq(t);
2478 }
2480 //------------------------------hash-------------------------------------------
2481 // Type-specific hashing function.
2482 int TypeRawPtr::hash(void) const {
2483 return (intptr_t)_bits + TypePtr::hash();
2484 }
2486 //------------------------------dump2------------------------------------------
2487 #ifndef PRODUCT
2488 void TypeRawPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
2489 if( _ptr == Constant )
2490 st->print(INTPTR_FORMAT, _bits);
2491 else
2492 st->print("rawptr:%s", ptr_msg[_ptr]);
2493 }
2494 #endif
2496 //=============================================================================
2497 // Convenience common pre-built type.
2498 const TypeOopPtr *TypeOopPtr::BOTTOM;
2500 //------------------------------TypeOopPtr-------------------------------------
2501 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, bool xk, ciObject* o, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth)
2502 : TypePtr(t, ptr, offset),
2503 _const_oop(o), _klass(k),
2504 _klass_is_exact(xk),
2505 _is_ptr_to_narrowoop(false),
2506 _is_ptr_to_narrowklass(false),
2507 _is_ptr_to_boxed_value(false),
2508 _instance_id(instance_id),
2509 _speculative(speculative),
2510 _inline_depth(inline_depth){
2511 if (Compile::current()->eliminate_boxing() && (t == InstPtr) &&
2512 (offset > 0) && xk && (k != 0) && k->is_instance_klass()) {
2513 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset);
2514 }
2515 #ifdef _LP64
2516 if (_offset != 0) {
2517 if (_offset == oopDesc::klass_offset_in_bytes()) {
2518 _is_ptr_to_narrowklass = UseCompressedClassPointers;
2519 } else if (klass() == NULL) {
2520 // Array with unknown body type
2521 assert(this->isa_aryptr(), "only arrays without klass");
2522 _is_ptr_to_narrowoop = UseCompressedOops;
2523 } else if (this->isa_aryptr()) {
2524 _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() &&
2525 _offset != arrayOopDesc::length_offset_in_bytes());
2526 } else if (klass()->is_instance_klass()) {
2527 ciInstanceKlass* ik = klass()->as_instance_klass();
2528 ciField* field = NULL;
2529 if (this->isa_klassptr()) {
2530 // Perm objects don't use compressed references
2531 } else if (_offset == OffsetBot || _offset == OffsetTop) {
2532 // unsafe access
2533 _is_ptr_to_narrowoop = UseCompressedOops;
2534 } else { // exclude unsafe ops
2535 assert(this->isa_instptr(), "must be an instance ptr.");
2537 if (klass() == ciEnv::current()->Class_klass() &&
2538 (_offset == java_lang_Class::klass_offset_in_bytes() ||
2539 _offset == java_lang_Class::array_klass_offset_in_bytes())) {
2540 // Special hidden fields from the Class.
2541 assert(this->isa_instptr(), "must be an instance ptr.");
2542 _is_ptr_to_narrowoop = false;
2543 } else if (klass() == ciEnv::current()->Class_klass() &&
2544 _offset >= InstanceMirrorKlass::offset_of_static_fields()) {
2545 // Static fields
2546 assert(o != NULL, "must be constant");
2547 ciInstanceKlass* k = o->as_instance()->java_lang_Class_klass()->as_instance_klass();
2548 ciField* field = k->get_field_by_offset(_offset, true);
2549 assert(field != NULL, "missing field");
2550 BasicType basic_elem_type = field->layout_type();
2551 _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT ||
2552 basic_elem_type == T_ARRAY);
2553 } else {
2554 // Instance fields which contains a compressed oop references.
2555 field = ik->get_field_by_offset(_offset, false);
2556 if (field != NULL) {
2557 BasicType basic_elem_type = field->layout_type();
2558 _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT ||
2559 basic_elem_type == T_ARRAY);
2560 } else if (klass()->equals(ciEnv::current()->Object_klass())) {
2561 // Compile::find_alias_type() cast exactness on all types to verify
2562 // that it does not affect alias type.
2563 _is_ptr_to_narrowoop = UseCompressedOops;
2564 } else {
2565 // Type for the copy start in LibraryCallKit::inline_native_clone().
2566 _is_ptr_to_narrowoop = UseCompressedOops;
2567 }
2568 }
2569 }
2570 }
2571 }
2572 #endif
2573 }
2575 //------------------------------make-------------------------------------------
2576 const TypeOopPtr *TypeOopPtr::make(PTR ptr,
2577 int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) {
2578 assert(ptr != Constant, "no constant generic pointers");
2579 ciKlass* k = Compile::current()->env()->Object_klass();
2580 bool xk = false;
2581 ciObject* o = NULL;
2582 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, xk, o, offset, instance_id, speculative, inline_depth))->hashcons();
2583 }
2586 //------------------------------cast_to_ptr_type-------------------------------
2587 const Type *TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
2588 assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
2589 if( ptr == _ptr ) return this;
2590 return make(ptr, _offset, _instance_id, _speculative, _inline_depth);
2591 }
2593 //-----------------------------cast_to_instance_id----------------------------
2594 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const {
2595 // There are no instances of a general oop.
2596 // Return self unchanged.
2597 return this;
2598 }
2600 //-----------------------------cast_to_exactness-------------------------------
2601 const Type *TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
2602 // There is no such thing as an exact general oop.
2603 // Return self unchanged.
2604 return this;
2605 }
2608 //------------------------------as_klass_type----------------------------------
2609 // Return the klass type corresponding to this instance or array type.
2610 // It is the type that is loaded from an object of this type.
2611 const TypeKlassPtr* TypeOopPtr::as_klass_type() const {
2612 ciKlass* k = klass();
2613 bool xk = klass_is_exact();
2614 if (k == NULL)
2615 return TypeKlassPtr::OBJECT;
2616 else
2617 return TypeKlassPtr::make(xk? Constant: NotNull, k, 0);
2618 }
2620 const Type *TypeOopPtr::xmeet(const Type *t) const {
2621 const Type* res = xmeet_helper(t);
2622 if (res->isa_oopptr() == NULL) {
2623 return res;
2624 }
2626 const TypeOopPtr* res_oopptr = res->is_oopptr();
2627 if (res_oopptr->speculative() != NULL) {
2628 // type->speculative() == NULL means that speculation is no better
2629 // than type, i.e. type->speculative() == type. So there are 2
2630 // ways to represent the fact that we have no useful speculative
2631 // data and we should use a single one to be able to test for
2632 // equality between types. Check whether type->speculative() ==
2633 // type and set speculative to NULL if it is the case.
2634 if (res_oopptr->remove_speculative() == res_oopptr->speculative()) {
2635 return res_oopptr->remove_speculative();
2636 }
2637 }
2639 return res;
2640 }
2642 //------------------------------meet-------------------------------------------
2643 // Compute the MEET of two types. It returns a new Type object.
2644 const Type *TypeOopPtr::xmeet_helper(const Type *t) const {
2645 // Perform a fast test for common case; meeting the same types together.
2646 if( this == t ) return this; // Meeting same type-rep?
2648 // Current "this->_base" is OopPtr
2649 switch (t->base()) { // switch on original type
2651 case Int: // Mixing ints & oops happens when javac
2652 case Long: // reuses local variables
2653 case FloatTop:
2654 case FloatCon:
2655 case FloatBot:
2656 case DoubleTop:
2657 case DoubleCon:
2658 case DoubleBot:
2659 case NarrowOop:
2660 case NarrowKlass:
2661 case Bottom: // Ye Olde Default
2662 return Type::BOTTOM;
2663 case Top:
2664 return this;
2666 default: // All else is a mistake
2667 typerr(t);
2669 case RawPtr:
2670 case MetadataPtr:
2671 case KlassPtr:
2672 return TypePtr::BOTTOM; // Oop meet raw is not well defined
2674 case AnyPtr: {
2675 // Found an AnyPtr type vs self-OopPtr type
2676 const TypePtr *tp = t->is_ptr();
2677 int offset = meet_offset(tp->offset());
2678 PTR ptr = meet_ptr(tp->ptr());
2679 switch (tp->ptr()) {
2680 case Null:
2681 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset);
2682 // else fall through:
2683 case TopPTR:
2684 case AnyNull: {
2685 int instance_id = meet_instance_id(InstanceTop);
2686 const TypeOopPtr* speculative = _speculative;
2687 return make(ptr, offset, instance_id, speculative, _inline_depth);
2688 }
2689 case BotPTR:
2690 case NotNull:
2691 return TypePtr::make(AnyPtr, ptr, offset);
2692 default: typerr(t);
2693 }
2694 }
2696 case OopPtr: { // Meeting to other OopPtrs
2697 const TypeOopPtr *tp = t->is_oopptr();
2698 int instance_id = meet_instance_id(tp->instance_id());
2699 const TypeOopPtr* speculative = xmeet_speculative(tp);
2700 int depth = meet_inline_depth(tp->inline_depth());
2701 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth);
2702 }
2704 case InstPtr: // For these, flip the call around to cut down
2705 case AryPtr:
2706 return t->xmeet(this); // Call in reverse direction
2708 } // End of switch
2709 return this; // Return the double constant
2710 }
2713 //------------------------------xdual------------------------------------------
2714 // Dual of a pure heap pointer. No relevant klass or oop information.
2715 const Type *TypeOopPtr::xdual() const {
2716 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here");
2717 assert(const_oop() == NULL, "no constants here");
2718 return new TypeOopPtr(_base, dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
2719 }
2721 //--------------------------make_from_klass_common-----------------------------
2722 // Computes the element-type given a klass.
2723 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact) {
2724 if (klass->is_instance_klass()) {
2725 Compile* C = Compile::current();
2726 Dependencies* deps = C->dependencies();
2727 assert((deps != NULL) == (C->method() != NULL && C->method()->code_size() > 0), "sanity");
2728 // Element is an instance
2729 bool klass_is_exact = false;
2730 if (klass->is_loaded()) {
2731 // Try to set klass_is_exact.
2732 ciInstanceKlass* ik = klass->as_instance_klass();
2733 klass_is_exact = ik->is_final();
2734 if (!klass_is_exact && klass_change
2735 && deps != NULL && UseUniqueSubclasses) {
2736 ciInstanceKlass* sub = ik->unique_concrete_subklass();
2737 if (sub != NULL) {
2738 deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
2739 klass = ik = sub;
2740 klass_is_exact = sub->is_final();
2741 }
2742 }
2743 if (!klass_is_exact && try_for_exact
2744 && deps != NULL && UseExactTypes) {
2745 if (!ik->is_interface() && !ik->has_subklass()) {
2746 // Add a dependence; if concrete subclass added we need to recompile
2747 deps->assert_leaf_type(ik);
2748 klass_is_exact = true;
2749 }
2750 }
2751 }
2752 return TypeInstPtr::make(TypePtr::BotPTR, klass, klass_is_exact, NULL, 0);
2753 } else if (klass->is_obj_array_klass()) {
2754 // Element is an object array. Recursively call ourself.
2755 const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(klass->as_obj_array_klass()->element_klass(), false, try_for_exact);
2756 bool xk = etype->klass_is_exact();
2757 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
2758 // We used to pass NotNull in here, asserting that the sub-arrays
2759 // are all not-null. This is not true in generally, as code can
2760 // slam NULLs down in the subarrays.
2761 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, xk, 0);
2762 return arr;
2763 } else if (klass->is_type_array_klass()) {
2764 // Element is an typeArray
2765 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
2766 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
2767 // We used to pass NotNull in here, asserting that the array pointer
2768 // is not-null. That was not true in general.
2769 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0);
2770 return arr;
2771 } else {
2772 ShouldNotReachHere();
2773 return NULL;
2774 }
2775 }
2777 //------------------------------make_from_constant-----------------------------
2778 // Make a java pointer from an oop constant
2779 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o,
2780 bool require_constant,
2781 bool is_autobox_cache) {
2782 assert(!o->is_null_object(), "null object not yet handled here.");
2783 ciKlass* klass = o->klass();
2784 if (klass->is_instance_klass()) {
2785 // Element is an instance
2786 if (require_constant) {
2787 if (!o->can_be_constant()) return NULL;
2788 } else if (!o->should_be_constant()) {
2789 return TypeInstPtr::make(TypePtr::NotNull, klass, true, NULL, 0);
2790 }
2791 return TypeInstPtr::make(o);
2792 } else if (klass->is_obj_array_klass()) {
2793 // Element is an object array. Recursively call ourself.
2794 const TypeOopPtr *etype =
2795 TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass());
2796 if (is_autobox_cache) {
2797 // The pointers in the autobox arrays are always non-null.
2798 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
2799 }
2800 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
2801 // We used to pass NotNull in here, asserting that the sub-arrays
2802 // are all not-null. This is not true in generally, as code can
2803 // slam NULLs down in the subarrays.
2804 if (require_constant) {
2805 if (!o->can_be_constant()) return NULL;
2806 } else if (!o->should_be_constant()) {
2807 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
2808 }
2809 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0, InstanceBot, NULL, InlineDepthBottom, is_autobox_cache);
2810 return arr;
2811 } else if (klass->is_type_array_klass()) {
2812 // Element is an typeArray
2813 const Type* etype =
2814 (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
2815 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
2816 // We used to pass NotNull in here, asserting that the array pointer
2817 // is not-null. That was not true in general.
2818 if (require_constant) {
2819 if (!o->can_be_constant()) return NULL;
2820 } else if (!o->should_be_constant()) {
2821 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
2822 }
2823 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
2824 return arr;
2825 }
2827 fatal("unhandled object type");
2828 return NULL;
2829 }
2831 //------------------------------get_con----------------------------------------
2832 intptr_t TypeOopPtr::get_con() const {
2833 assert( _ptr == Null || _ptr == Constant, "" );
2834 assert( _offset >= 0, "" );
2836 if (_offset != 0) {
2837 // After being ported to the compiler interface, the compiler no longer
2838 // directly manipulates the addresses of oops. Rather, it only has a pointer
2839 // to a handle at compile time. This handle is embedded in the generated
2840 // code and dereferenced at the time the nmethod is made. Until that time,
2841 // it is not reasonable to do arithmetic with the addresses of oops (we don't
2842 // have access to the addresses!). This does not seem to currently happen,
2843 // but this assertion here is to help prevent its occurence.
2844 tty->print_cr("Found oop constant with non-zero offset");
2845 ShouldNotReachHere();
2846 }
2848 return (intptr_t)const_oop()->constant_encoding();
2849 }
2852 //-----------------------------filter------------------------------------------
2853 // Do not allow interface-vs.-noninterface joins to collapse to top.
2854 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const {
2856 const Type* ft = join_helper(kills, include_speculative);
2857 const TypeInstPtr* ftip = ft->isa_instptr();
2858 const TypeInstPtr* ktip = kills->isa_instptr();
2860 if (ft->empty()) {
2861 // Check for evil case of 'this' being a class and 'kills' expecting an
2862 // interface. This can happen because the bytecodes do not contain
2863 // enough type info to distinguish a Java-level interface variable
2864 // from a Java-level object variable. If we meet 2 classes which
2865 // both implement interface I, but their meet is at 'j/l/O' which
2866 // doesn't implement I, we have no way to tell if the result should
2867 // be 'I' or 'j/l/O'. Thus we'll pick 'j/l/O'. If this then flows
2868 // into a Phi which "knows" it's an Interface type we'll have to
2869 // uplift the type.
2870 if (!empty()) {
2871 if (ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) {
2872 return kills; // Uplift to interface
2873 }
2874 // Also check for evil cases of 'this' being a class array
2875 // and 'kills' expecting an array of interfaces.
2876 Type::get_arrays_base_elements(ft, kills, NULL, &ktip);
2877 if (ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) {
2878 return kills; // Uplift to array of interface
2879 }
2880 }
2882 return Type::TOP; // Canonical empty value
2883 }
2885 // If we have an interface-typed Phi or cast and we narrow to a class type,
2886 // the join should report back the class. However, if we have a J/L/Object
2887 // class-typed Phi and an interface flows in, it's possible that the meet &
2888 // join report an interface back out. This isn't possible but happens
2889 // because the type system doesn't interact well with interfaces.
2890 if (ftip != NULL && ktip != NULL &&
2891 ftip->is_loaded() && ftip->klass()->is_interface() &&
2892 ktip->is_loaded() && !ktip->klass()->is_interface()) {
2893 // Happens in a CTW of rt.jar, 320-341, no extra flags
2894 assert(!ftip->klass_is_exact(), "interface could not be exact");
2895 return ktip->cast_to_ptr_type(ftip->ptr());
2896 }
2898 return ft;
2899 }
2901 //------------------------------eq---------------------------------------------
2902 // Structural equality check for Type representations
2903 bool TypeOopPtr::eq( const Type *t ) const {
2904 const TypeOopPtr *a = (const TypeOopPtr*)t;
2905 if (_klass_is_exact != a->_klass_is_exact ||
2906 _instance_id != a->_instance_id ||
2907 !eq_speculative(a) ||
2908 _inline_depth != a->_inline_depth) return false;
2909 ciObject* one = const_oop();
2910 ciObject* two = a->const_oop();
2911 if (one == NULL || two == NULL) {
2912 return (one == two) && TypePtr::eq(t);
2913 } else {
2914 return one->equals(two) && TypePtr::eq(t);
2915 }
2916 }
2918 //------------------------------hash-------------------------------------------
2919 // Type-specific hashing function.
2920 int TypeOopPtr::hash(void) const {
2921 return
2922 (const_oop() ? const_oop()->hash() : 0) +
2923 _klass_is_exact +
2924 _instance_id +
2925 hash_speculative() +
2926 _inline_depth +
2927 TypePtr::hash();
2928 }
2930 //------------------------------dump2------------------------------------------
2931 #ifndef PRODUCT
2932 void TypeOopPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
2933 st->print("oopptr:%s", ptr_msg[_ptr]);
2934 if( _klass_is_exact ) st->print(":exact");
2935 if( const_oop() ) st->print(INTPTR_FORMAT, const_oop());
2936 switch( _offset ) {
2937 case OffsetTop: st->print("+top"); break;
2938 case OffsetBot: st->print("+any"); break;
2939 case 0: break;
2940 default: st->print("+%d",_offset); break;
2941 }
2942 if (_instance_id == InstanceTop)
2943 st->print(",iid=top");
2944 else if (_instance_id != InstanceBot)
2945 st->print(",iid=%d",_instance_id);
2947 dump_inline_depth(st);
2948 dump_speculative(st);
2949 }
2951 /**
2952 *dump the speculative part of the type
2953 */
2954 void TypeOopPtr::dump_speculative(outputStream *st) const {
2955 if (_speculative != NULL) {
2956 st->print(" (speculative=");
2957 _speculative->dump_on(st);
2958 st->print(")");
2959 }
2960 }
2962 void TypeOopPtr::dump_inline_depth(outputStream *st) const {
2963 if (_inline_depth != InlineDepthBottom) {
2964 if (_inline_depth == InlineDepthTop) {
2965 st->print(" (inline_depth=InlineDepthTop)");
2966 } else {
2967 st->print(" (inline_depth=%d)", _inline_depth);
2968 }
2969 }
2970 }
2971 #endif
2973 //------------------------------singleton--------------------------------------
2974 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
2975 // constants
2976 bool TypeOopPtr::singleton(void) const {
2977 // detune optimizer to not generate constant oop + constant offset as a constant!
2978 // TopPTR, Null, AnyNull, Constant are all singletons
2979 return (_offset == 0) && !below_centerline(_ptr);
2980 }
2982 //------------------------------add_offset-------------------------------------
2983 const TypePtr *TypeOopPtr::add_offset(intptr_t offset) const {
2984 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
2985 }
2987 /**
2988 * Return same type without a speculative part
2989 */
2990 const Type* TypeOopPtr::remove_speculative() const {
2991 if (_speculative == NULL) {
2992 return this;
2993 }
2994 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
2995 return make(_ptr, _offset, _instance_id, NULL, _inline_depth);
2996 }
2998 /**
2999 * Return same type but with a different inline depth (used for speculation)
3000 *
3001 * @param depth depth to meet with
3002 */
3003 const TypeOopPtr* TypeOopPtr::with_inline_depth(int depth) const {
3004 if (!UseInlineDepthForSpeculativeTypes) {
3005 return this;
3006 }
3007 return make(_ptr, _offset, _instance_id, _speculative, depth);
3008 }
3010 /**
3011 * Check whether new profiling would improve speculative type
3012 *
3013 * @param exact_kls class from profiling
3014 * @param inline_depth inlining depth of profile point
3015 *
3016 * @return true if type profile is valuable
3017 */
3018 bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const {
3019 // no way to improve an already exact type
3020 if (klass_is_exact()) {
3021 return false;
3022 }
3023 // no profiling?
3024 if (exact_kls == NULL) {
3025 return false;
3026 }
3027 // no speculative type or non exact speculative type?
3028 if (speculative_type() == NULL) {
3029 return true;
3030 }
3031 // If the node already has an exact speculative type keep it,
3032 // unless it was provided by profiling that is at a deeper
3033 // inlining level. Profiling at a higher inlining depth is
3034 // expected to be less accurate.
3035 if (_speculative->inline_depth() == InlineDepthBottom) {
3036 return false;
3037 }
3038 assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison");
3039 return inline_depth < _speculative->inline_depth();
3040 }
3042 //------------------------------meet_instance_id--------------------------------
3043 int TypeOopPtr::meet_instance_id( int instance_id ) const {
3044 // Either is 'TOP' instance? Return the other instance!
3045 if( _instance_id == InstanceTop ) return instance_id;
3046 if( instance_id == InstanceTop ) return _instance_id;
3047 // If either is different, return 'BOTTOM' instance
3048 if( _instance_id != instance_id ) return InstanceBot;
3049 return _instance_id;
3050 }
3052 //------------------------------dual_instance_id--------------------------------
3053 int TypeOopPtr::dual_instance_id( ) const {
3054 if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM
3055 if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP
3056 return _instance_id; // Map everything else into self
3057 }
3059 /**
3060 * meet of the speculative parts of 2 types
3061 *
3062 * @param other type to meet with
3063 */
3064 const TypeOopPtr* TypeOopPtr::xmeet_speculative(const TypeOopPtr* other) const {
3065 bool this_has_spec = (_speculative != NULL);
3066 bool other_has_spec = (other->speculative() != NULL);
3068 if (!this_has_spec && !other_has_spec) {
3069 return NULL;
3070 }
3072 // If we are at a point where control flow meets and one branch has
3073 // a speculative type and the other has not, we meet the speculative
3074 // type of one branch with the actual type of the other. If the
3075 // actual type is exact and the speculative is as well, then the
3076 // result is a speculative type which is exact and we can continue
3077 // speculation further.
3078 const TypeOopPtr* this_spec = _speculative;
3079 const TypeOopPtr* other_spec = other->speculative();
3081 if (!this_has_spec) {
3082 this_spec = this;
3083 }
3085 if (!other_has_spec) {
3086 other_spec = other;
3087 }
3089 return this_spec->meet_speculative(other_spec)->is_oopptr();
3090 }
3092 /**
3093 * dual of the speculative part of the type
3094 */
3095 const TypeOopPtr* TypeOopPtr::dual_speculative() const {
3096 if (_speculative == NULL) {
3097 return NULL;
3098 }
3099 return _speculative->dual()->is_oopptr();
3100 }
3102 /**
3103 * add offset to the speculative part of the type
3104 *
3105 * @param offset offset to add
3106 */
3107 const TypeOopPtr* TypeOopPtr::add_offset_speculative(intptr_t offset) const {
3108 if (_speculative == NULL) {
3109 return NULL;
3110 }
3111 return _speculative->add_offset(offset)->is_oopptr();
3112 }
3114 /**
3115 * Are the speculative parts of 2 types equal?
3116 *
3117 * @param other type to compare this one to
3118 */
3119 bool TypeOopPtr::eq_speculative(const TypeOopPtr* other) const {
3120 if (_speculative == NULL || other->speculative() == NULL) {
3121 return _speculative == other->speculative();
3122 }
3124 if (_speculative->base() != other->speculative()->base()) {
3125 return false;
3126 }
3128 return _speculative->eq(other->speculative());
3129 }
3131 /**
3132 * Hash of the speculative part of the type
3133 */
3134 int TypeOopPtr::hash_speculative() const {
3135 if (_speculative == NULL) {
3136 return 0;
3137 }
3139 return _speculative->hash();
3140 }
3142 /**
3143 * dual of the inline depth for this type (used for speculation)
3144 */
3145 int TypeOopPtr::dual_inline_depth() const {
3146 return -inline_depth();
3147 }
3149 /**
3150 * meet of 2 inline depth (used for speculation)
3151 *
3152 * @param depth depth to meet with
3153 */
3154 int TypeOopPtr::meet_inline_depth(int depth) const {
3155 return MAX2(inline_depth(), depth);
3156 }
3158 //=============================================================================
3159 // Convenience common pre-built types.
3160 const TypeInstPtr *TypeInstPtr::NOTNULL;
3161 const TypeInstPtr *TypeInstPtr::BOTTOM;
3162 const TypeInstPtr *TypeInstPtr::MIRROR;
3163 const TypeInstPtr *TypeInstPtr::MARK;
3164 const TypeInstPtr *TypeInstPtr::KLASS;
3166 //------------------------------TypeInstPtr-------------------------------------
3167 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, bool xk, ciObject* o, int off, int instance_id, const TypeOopPtr* speculative, int inline_depth)
3168 : TypeOopPtr(InstPtr, ptr, k, xk, o, off, instance_id, speculative, inline_depth), _name(k->name()) {
3169 assert(k != NULL &&
3170 (k->is_loaded() || o == NULL),
3171 "cannot have constants with non-loaded klass");
3172 };
3174 //------------------------------make-------------------------------------------
3175 const TypeInstPtr *TypeInstPtr::make(PTR ptr,
3176 ciKlass* k,
3177 bool xk,
3178 ciObject* o,
3179 int offset,
3180 int instance_id,
3181 const TypeOopPtr* speculative,
3182 int inline_depth) {
3183 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance");
3184 // Either const_oop() is NULL or else ptr is Constant
3185 assert( (!o && ptr != Constant) || (o && ptr == Constant),
3186 "constant pointers must have a value supplied" );
3187 // Ptr is never Null
3188 assert( ptr != Null, "NULL pointers are not typed" );
3190 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
3191 if (!UseExactTypes) xk = false;
3192 if (ptr == Constant) {
3193 // Note: This case includes meta-object constants, such as methods.
3194 xk = true;
3195 } else if (k->is_loaded()) {
3196 ciInstanceKlass* ik = k->as_instance_klass();
3197 if (!xk && ik->is_final()) xk = true; // no inexact final klass
3198 if (xk && ik->is_interface()) xk = false; // no exact interface
3199 }
3201 // Now hash this baby
3202 TypeInstPtr *result =
3203 (TypeInstPtr*)(new TypeInstPtr(ptr, k, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons();
3205 return result;
3206 }
3208 /**
3209 * Create constant type for a constant boxed value
3210 */
3211 const Type* TypeInstPtr::get_const_boxed_value() const {
3212 assert(is_ptr_to_boxed_value(), "should be called only for boxed value");
3213 assert((const_oop() != NULL), "should be called only for constant object");
3214 ciConstant constant = const_oop()->as_instance()->field_value_by_offset(offset());
3215 BasicType bt = constant.basic_type();
3216 switch (bt) {
3217 case T_BOOLEAN: return TypeInt::make(constant.as_boolean());
3218 case T_INT: return TypeInt::make(constant.as_int());
3219 case T_CHAR: return TypeInt::make(constant.as_char());
3220 case T_BYTE: return TypeInt::make(constant.as_byte());
3221 case T_SHORT: return TypeInt::make(constant.as_short());
3222 case T_FLOAT: return TypeF::make(constant.as_float());
3223 case T_DOUBLE: return TypeD::make(constant.as_double());
3224 case T_LONG: return TypeLong::make(constant.as_long());
3225 default: break;
3226 }
3227 fatal(err_msg_res("Invalid boxed value type '%s'", type2name(bt)));
3228 return NULL;
3229 }
3231 //------------------------------cast_to_ptr_type-------------------------------
3232 const Type *TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
3233 if( ptr == _ptr ) return this;
3234 // Reconstruct _sig info here since not a problem with later lazy
3235 // construction, _sig will show up on demand.
3236 return make(ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, _inline_depth);
3237 }
3240 //-----------------------------cast_to_exactness-------------------------------
3241 const Type *TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
3242 if( klass_is_exact == _klass_is_exact ) return this;
3243 if (!UseExactTypes) return this;
3244 if (!_klass->is_loaded()) return this;
3245 ciInstanceKlass* ik = _klass->as_instance_klass();
3246 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
3247 if( ik->is_interface() ) return this; // cannot set xk
3248 return make(ptr(), klass(), klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth);
3249 }
3251 //-----------------------------cast_to_instance_id----------------------------
3252 const TypeOopPtr *TypeInstPtr::cast_to_instance_id(int instance_id) const {
3253 if( instance_id == _instance_id ) return this;
3254 return make(_ptr, klass(), _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth);
3255 }
3257 //------------------------------xmeet_unloaded---------------------------------
3258 // Compute the MEET of two InstPtrs when at least one is unloaded.
3259 // Assume classes are different since called after check for same name/class-loader
3260 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst) const {
3261 int off = meet_offset(tinst->offset());
3262 PTR ptr = meet_ptr(tinst->ptr());
3263 int instance_id = meet_instance_id(tinst->instance_id());
3264 const TypeOopPtr* speculative = xmeet_speculative(tinst);
3265 int depth = meet_inline_depth(tinst->inline_depth());
3267 const TypeInstPtr *loaded = is_loaded() ? this : tinst;
3268 const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
3269 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
3270 //
3271 // Meet unloaded class with java/lang/Object
3272 //
3273 // Meet
3274 // | Unloaded Class
3275 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
3276 // ===================================================================
3277 // TOP | ..........................Unloaded......................|
3278 // AnyNull | U-AN |................Unloaded......................|
3279 // Constant | ... O-NN .................................. | O-BOT |
3280 // NotNull | ... O-NN .................................. | O-BOT |
3281 // BOTTOM | ........................Object-BOTTOM ..................|
3282 //
3283 assert(loaded->ptr() != TypePtr::Null, "insanity check");
3284 //
3285 if( loaded->ptr() == TypePtr::TopPTR ) { return unloaded; }
3286 else if (loaded->ptr() == TypePtr::AnyNull) { return TypeInstPtr::make(ptr, unloaded->klass(), false, NULL, off, instance_id, speculative, depth); }
3287 else if (loaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; }
3288 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
3289 if (unloaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; }
3290 else { return TypeInstPtr::NOTNULL; }
3291 }
3292 else if( unloaded->ptr() == TypePtr::TopPTR ) { return unloaded; }
3294 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr();
3295 }
3297 // Both are unloaded, not the same class, not Object
3298 // Or meet unloaded with a different loaded class, not java/lang/Object
3299 if( ptr != TypePtr::BotPTR ) {
3300 return TypeInstPtr::NOTNULL;
3301 }
3302 return TypeInstPtr::BOTTOM;
3303 }
3306 //------------------------------meet-------------------------------------------
3307 // Compute the MEET of two types. It returns a new Type object.
3308 const Type *TypeInstPtr::xmeet_helper(const Type *t) const {
3309 // Perform a fast test for common case; meeting the same types together.
3310 if( this == t ) return this; // Meeting same type-rep?
3312 // Current "this->_base" is Pointer
3313 switch (t->base()) { // switch on original type
3315 case Int: // Mixing ints & oops happens when javac
3316 case Long: // reuses local variables
3317 case FloatTop:
3318 case FloatCon:
3319 case FloatBot:
3320 case DoubleTop:
3321 case DoubleCon:
3322 case DoubleBot:
3323 case NarrowOop:
3324 case NarrowKlass:
3325 case Bottom: // Ye Olde Default
3326 return Type::BOTTOM;
3327 case Top:
3328 return this;
3330 default: // All else is a mistake
3331 typerr(t);
3333 case MetadataPtr:
3334 case KlassPtr:
3335 case RawPtr: return TypePtr::BOTTOM;
3337 case AryPtr: { // All arrays inherit from Object class
3338 const TypeAryPtr *tp = t->is_aryptr();
3339 int offset = meet_offset(tp->offset());
3340 PTR ptr = meet_ptr(tp->ptr());
3341 int instance_id = meet_instance_id(tp->instance_id());
3342 const TypeOopPtr* speculative = xmeet_speculative(tp);
3343 int depth = meet_inline_depth(tp->inline_depth());
3344 switch (ptr) {
3345 case TopPTR:
3346 case AnyNull: // Fall 'down' to dual of object klass
3347 // For instances when a subclass meets a superclass we fall
3348 // below the centerline when the superclass is exact. We need to
3349 // do the same here.
3350 if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) {
3351 return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth);
3352 } else {
3353 // cannot subclass, so the meet has to fall badly below the centerline
3354 ptr = NotNull;
3355 instance_id = InstanceBot;
3356 return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth);
3357 }
3358 case Constant:
3359 case NotNull:
3360 case BotPTR: // Fall down to object klass
3361 // LCA is object_klass, but if we subclass from the top we can do better
3362 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
3363 // If 'this' (InstPtr) is above the centerline and it is Object class
3364 // then we can subclass in the Java class hierarchy.
3365 // For instances when a subclass meets a superclass we fall
3366 // below the centerline when the superclass is exact. We need
3367 // to do the same here.
3368 if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) {
3369 // that is, tp's array type is a subtype of my klass
3370 return TypeAryPtr::make(ptr, (ptr == Constant ? tp->const_oop() : NULL),
3371 tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth);
3372 }
3373 }
3374 // The other case cannot happen, since I cannot be a subtype of an array.
3375 // The meet falls down to Object class below centerline.
3376 if( ptr == Constant )
3377 ptr = NotNull;
3378 instance_id = InstanceBot;
3379 return make(ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth);
3380 default: typerr(t);
3381 }
3382 }
3384 case OopPtr: { // Meeting to OopPtrs
3385 // Found a OopPtr type vs self-InstPtr type
3386 const TypeOopPtr *tp = t->is_oopptr();
3387 int offset = meet_offset(tp->offset());
3388 PTR ptr = meet_ptr(tp->ptr());
3389 switch (tp->ptr()) {
3390 case TopPTR:
3391 case AnyNull: {
3392 int instance_id = meet_instance_id(InstanceTop);
3393 const TypeOopPtr* speculative = xmeet_speculative(tp);
3394 int depth = meet_inline_depth(tp->inline_depth());
3395 return make(ptr, klass(), klass_is_exact(),
3396 (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, depth);
3397 }
3398 case NotNull:
3399 case BotPTR: {
3400 int instance_id = meet_instance_id(tp->instance_id());
3401 const TypeOopPtr* speculative = xmeet_speculative(tp);
3402 int depth = meet_inline_depth(tp->inline_depth());
3403 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
3404 }
3405 default: typerr(t);
3406 }
3407 }
3409 case AnyPtr: { // Meeting to AnyPtrs
3410 // Found an AnyPtr type vs self-InstPtr type
3411 const TypePtr *tp = t->is_ptr();
3412 int offset = meet_offset(tp->offset());
3413 PTR ptr = meet_ptr(tp->ptr());
3414 switch (tp->ptr()) {
3415 case Null:
3416 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset);
3417 // else fall through to AnyNull
3418 case TopPTR:
3419 case AnyNull: {
3420 int instance_id = meet_instance_id(InstanceTop);
3421 const TypeOopPtr* speculative = _speculative;
3422 return make(ptr, klass(), klass_is_exact(),
3423 (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, _inline_depth);
3424 }
3425 case NotNull:
3426 case BotPTR:
3427 return TypePtr::make(AnyPtr, ptr, offset);
3428 default: typerr(t);
3429 }
3430 }
3432 /*
3433 A-top }
3434 / | \ } Tops
3435 B-top A-any C-top }
3436 | / | \ | } Any-nulls
3437 B-any | C-any }
3438 | | |
3439 B-con A-con C-con } constants; not comparable across classes
3440 | | |
3441 B-not | C-not }
3442 | \ | / | } not-nulls
3443 B-bot A-not C-bot }
3444 \ | / } Bottoms
3445 A-bot }
3446 */
3448 case InstPtr: { // Meeting 2 Oops?
3449 // Found an InstPtr sub-type vs self-InstPtr type
3450 const TypeInstPtr *tinst = t->is_instptr();
3451 int off = meet_offset( tinst->offset() );
3452 PTR ptr = meet_ptr( tinst->ptr() );
3453 int instance_id = meet_instance_id(tinst->instance_id());
3454 const TypeOopPtr* speculative = xmeet_speculative(tinst);
3455 int depth = meet_inline_depth(tinst->inline_depth());
3457 // Check for easy case; klasses are equal (and perhaps not loaded!)
3458 // If we have constants, then we created oops so classes are loaded
3459 // and we can handle the constants further down. This case handles
3460 // both-not-loaded or both-loaded classes
3461 if (ptr != Constant && klass()->equals(tinst->klass()) && klass_is_exact() == tinst->klass_is_exact()) {
3462 return make(ptr, klass(), klass_is_exact(), NULL, off, instance_id, speculative, depth);
3463 }
3465 // Classes require inspection in the Java klass hierarchy. Must be loaded.
3466 ciKlass* tinst_klass = tinst->klass();
3467 ciKlass* this_klass = this->klass();
3468 bool tinst_xk = tinst->klass_is_exact();
3469 bool this_xk = this->klass_is_exact();
3470 if (!tinst_klass->is_loaded() || !this_klass->is_loaded() ) {
3471 // One of these classes has not been loaded
3472 const TypeInstPtr *unloaded_meet = xmeet_unloaded(tinst);
3473 #ifndef PRODUCT
3474 if( PrintOpto && Verbose ) {
3475 tty->print("meet of unloaded classes resulted in: "); unloaded_meet->dump(); tty->cr();
3476 tty->print(" this == "); this->dump(); tty->cr();
3477 tty->print(" tinst == "); tinst->dump(); tty->cr();
3478 }
3479 #endif
3480 return unloaded_meet;
3481 }
3483 // Handle mixing oops and interfaces first.
3484 if( this_klass->is_interface() && !(tinst_klass->is_interface() ||
3485 tinst_klass == ciEnv::current()->Object_klass())) {
3486 ciKlass *tmp = tinst_klass; // Swap interface around
3487 tinst_klass = this_klass;
3488 this_klass = tmp;
3489 bool tmp2 = tinst_xk;
3490 tinst_xk = this_xk;
3491 this_xk = tmp2;
3492 }
3493 if (tinst_klass->is_interface() &&
3494 !(this_klass->is_interface() ||
3495 // Treat java/lang/Object as an honorary interface,
3496 // because we need a bottom for the interface hierarchy.
3497 this_klass == ciEnv::current()->Object_klass())) {
3498 // Oop meets interface!
3500 // See if the oop subtypes (implements) interface.
3501 ciKlass *k;
3502 bool xk;
3503 if( this_klass->is_subtype_of( tinst_klass ) ) {
3504 // Oop indeed subtypes. Now keep oop or interface depending
3505 // on whether we are both above the centerline or either is
3506 // below the centerline. If we are on the centerline
3507 // (e.g., Constant vs. AnyNull interface), use the constant.
3508 k = below_centerline(ptr) ? tinst_klass : this_klass;
3509 // If we are keeping this_klass, keep its exactness too.
3510 xk = below_centerline(ptr) ? tinst_xk : this_xk;
3511 } else { // Does not implement, fall to Object
3512 // Oop does not implement interface, so mixing falls to Object
3513 // just like the verifier does (if both are above the
3514 // centerline fall to interface)
3515 k = above_centerline(ptr) ? tinst_klass : ciEnv::current()->Object_klass();
3516 xk = above_centerline(ptr) ? tinst_xk : false;
3517 // Watch out for Constant vs. AnyNull interface.
3518 if (ptr == Constant) ptr = NotNull; // forget it was a constant
3519 instance_id = InstanceBot;
3520 }
3521 ciObject* o = NULL; // the Constant value, if any
3522 if (ptr == Constant) {
3523 // Find out which constant.
3524 o = (this_klass == klass()) ? const_oop() : tinst->const_oop();
3525 }
3526 return make(ptr, k, xk, o, off, instance_id, speculative, depth);
3527 }
3529 // Either oop vs oop or interface vs interface or interface vs Object
3531 // !!! Here's how the symmetry requirement breaks down into invariants:
3532 // If we split one up & one down AND they subtype, take the down man.
3533 // If we split one up & one down AND they do NOT subtype, "fall hard".
3534 // If both are up and they subtype, take the subtype class.
3535 // If both are up and they do NOT subtype, "fall hard".
3536 // If both are down and they subtype, take the supertype class.
3537 // If both are down and they do NOT subtype, "fall hard".
3538 // Constants treated as down.
3540 // Now, reorder the above list; observe that both-down+subtype is also
3541 // "fall hard"; "fall hard" becomes the default case:
3542 // If we split one up & one down AND they subtype, take the down man.
3543 // If both are up and they subtype, take the subtype class.
3545 // If both are down and they subtype, "fall hard".
3546 // If both are down and they do NOT subtype, "fall hard".
3547 // If both are up and they do NOT subtype, "fall hard".
3548 // If we split one up & one down AND they do NOT subtype, "fall hard".
3550 // If a proper subtype is exact, and we return it, we return it exactly.
3551 // If a proper supertype is exact, there can be no subtyping relationship!
3552 // If both types are equal to the subtype, exactness is and-ed below the
3553 // centerline and or-ed above it. (N.B. Constants are always exact.)
3555 // Check for subtyping:
3556 ciKlass *subtype = NULL;
3557 bool subtype_exact = false;
3558 if( tinst_klass->equals(this_klass) ) {
3559 subtype = this_klass;
3560 subtype_exact = below_centerline(ptr) ? (this_xk & tinst_xk) : (this_xk | tinst_xk);
3561 } else if( !tinst_xk && this_klass->is_subtype_of( tinst_klass ) ) {
3562 subtype = this_klass; // Pick subtyping class
3563 subtype_exact = this_xk;
3564 } else if( !this_xk && tinst_klass->is_subtype_of( this_klass ) ) {
3565 subtype = tinst_klass; // Pick subtyping class
3566 subtype_exact = tinst_xk;
3567 }
3569 if( subtype ) {
3570 if( above_centerline(ptr) ) { // both are up?
3571 this_klass = tinst_klass = subtype;
3572 this_xk = tinst_xk = subtype_exact;
3573 } else if( above_centerline(this ->_ptr) && !above_centerline(tinst->_ptr) ) {
3574 this_klass = tinst_klass; // tinst is down; keep down man
3575 this_xk = tinst_xk;
3576 } else if( above_centerline(tinst->_ptr) && !above_centerline(this ->_ptr) ) {
3577 tinst_klass = this_klass; // this is down; keep down man
3578 tinst_xk = this_xk;
3579 } else {
3580 this_xk = subtype_exact; // either they are equal, or we'll do an LCA
3581 }
3582 }
3584 // Check for classes now being equal
3585 if (tinst_klass->equals(this_klass)) {
3586 // If the klasses are equal, the constants may still differ. Fall to
3587 // NotNull if they do (neither constant is NULL; that is a special case
3588 // handled elsewhere).
3589 ciObject* o = NULL; // Assume not constant when done
3590 ciObject* this_oop = const_oop();
3591 ciObject* tinst_oop = tinst->const_oop();
3592 if( ptr == Constant ) {
3593 if (this_oop != NULL && tinst_oop != NULL &&
3594 this_oop->equals(tinst_oop) )
3595 o = this_oop;
3596 else if (above_centerline(this ->_ptr))
3597 o = tinst_oop;
3598 else if (above_centerline(tinst ->_ptr))
3599 o = this_oop;
3600 else
3601 ptr = NotNull;
3602 }
3603 return make(ptr, this_klass, this_xk, o, off, instance_id, speculative, depth);
3604 } // Else classes are not equal
3606 // Since klasses are different, we require a LCA in the Java
3607 // class hierarchy - which means we have to fall to at least NotNull.
3608 if( ptr == TopPTR || ptr == AnyNull || ptr == Constant )
3609 ptr = NotNull;
3610 instance_id = InstanceBot;
3612 // Now we find the LCA of Java classes
3613 ciKlass* k = this_klass->least_common_ancestor(tinst_klass);
3614 return make(ptr, k, false, NULL, off, instance_id, speculative, depth);
3615 } // End of case InstPtr
3617 } // End of switch
3618 return this; // Return the double constant
3619 }
3622 //------------------------java_mirror_type--------------------------------------
3623 ciType* TypeInstPtr::java_mirror_type() const {
3624 // must be a singleton type
3625 if( const_oop() == NULL ) return NULL;
3627 // must be of type java.lang.Class
3628 if( klass() != ciEnv::current()->Class_klass() ) return NULL;
3630 return const_oop()->as_instance()->java_mirror_type();
3631 }
3634 //------------------------------xdual------------------------------------------
3635 // Dual: do NOT dual on klasses. This means I do NOT understand the Java
3636 // inheritance mechanism.
3637 const Type *TypeInstPtr::xdual() const {
3638 return new TypeInstPtr(dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth());
3639 }
3641 //------------------------------eq---------------------------------------------
3642 // Structural equality check for Type representations
3643 bool TypeInstPtr::eq( const Type *t ) const {
3644 const TypeInstPtr *p = t->is_instptr();
3645 return
3646 klass()->equals(p->klass()) &&
3647 TypeOopPtr::eq(p); // Check sub-type stuff
3648 }
3650 //------------------------------hash-------------------------------------------
3651 // Type-specific hashing function.
3652 int TypeInstPtr::hash(void) const {
3653 int hash = klass()->hash() + TypeOopPtr::hash();
3654 return hash;
3655 }
3657 //------------------------------dump2------------------------------------------
3658 // Dump oop Type
3659 #ifndef PRODUCT
3660 void TypeInstPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
3661 // Print the name of the klass.
3662 klass()->print_name_on(st);
3664 switch( _ptr ) {
3665 case Constant:
3666 // TO DO: Make CI print the hex address of the underlying oop.
3667 if (WizardMode || Verbose) {
3668 const_oop()->print_oop(st);
3669 }
3670 case BotPTR:
3671 if (!WizardMode && !Verbose) {
3672 if( _klass_is_exact ) st->print(":exact");
3673 break;
3674 }
3675 case TopPTR:
3676 case AnyNull:
3677 case NotNull:
3678 st->print(":%s", ptr_msg[_ptr]);
3679 if( _klass_is_exact ) st->print(":exact");
3680 break;
3681 }
3683 if( _offset ) { // Dump offset, if any
3684 if( _offset == OffsetBot ) st->print("+any");
3685 else if( _offset == OffsetTop ) st->print("+unknown");
3686 else st->print("+%d", _offset);
3687 }
3689 st->print(" *");
3690 if (_instance_id == InstanceTop)
3691 st->print(",iid=top");
3692 else if (_instance_id != InstanceBot)
3693 st->print(",iid=%d",_instance_id);
3695 dump_inline_depth(st);
3696 dump_speculative(st);
3697 }
3698 #endif
3700 //------------------------------add_offset-------------------------------------
3701 const TypePtr *TypeInstPtr::add_offset(intptr_t offset) const {
3702 return make(_ptr, klass(), klass_is_exact(), const_oop(), xadd_offset(offset), _instance_id, add_offset_speculative(offset));
3703 }
3705 const Type *TypeInstPtr::remove_speculative() const {
3706 if (_speculative == NULL) {
3707 return this;
3708 }
3709 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
3710 return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, NULL, _inline_depth);
3711 }
3713 const TypeOopPtr *TypeInstPtr::with_inline_depth(int depth) const {
3714 if (!UseInlineDepthForSpeculativeTypes) {
3715 return this;
3716 }
3717 return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth);
3718 }
3720 //=============================================================================
3721 // Convenience common pre-built types.
3722 const TypeAryPtr *TypeAryPtr::RANGE;
3723 const TypeAryPtr *TypeAryPtr::OOPS;
3724 const TypeAryPtr *TypeAryPtr::NARROWOOPS;
3725 const TypeAryPtr *TypeAryPtr::BYTES;
3726 const TypeAryPtr *TypeAryPtr::SHORTS;
3727 const TypeAryPtr *TypeAryPtr::CHARS;
3728 const TypeAryPtr *TypeAryPtr::INTS;
3729 const TypeAryPtr *TypeAryPtr::LONGS;
3730 const TypeAryPtr *TypeAryPtr::FLOATS;
3731 const TypeAryPtr *TypeAryPtr::DOUBLES;
3733 //------------------------------make-------------------------------------------
3734 const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) {
3735 assert(!(k == NULL && ary->_elem->isa_int()),
3736 "integral arrays must be pre-equipped with a class");
3737 if (!xk) xk = ary->ary_must_be_exact();
3738 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
3739 if (!UseExactTypes) xk = (ptr == Constant);
3740 return (TypeAryPtr*)(new TypeAryPtr(ptr, NULL, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons();
3741 }
3743 //------------------------------make-------------------------------------------
3744 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) {
3745 assert(!(k == NULL && ary->_elem->isa_int()),
3746 "integral arrays must be pre-equipped with a class");
3747 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
3748 if (!xk) xk = (o != NULL) || ary->ary_must_be_exact();
3749 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed");
3750 if (!UseExactTypes) xk = (ptr == Constant);
3751 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons();
3752 }
3754 //------------------------------cast_to_ptr_type-------------------------------
3755 const Type *TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
3756 if( ptr == _ptr ) return this;
3757 return make(ptr, const_oop(), _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
3758 }
3761 //-----------------------------cast_to_exactness-------------------------------
3762 const Type *TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
3763 if( klass_is_exact == _klass_is_exact ) return this;
3764 if (!UseExactTypes) return this;
3765 if (_ary->ary_must_be_exact()) return this; // cannot clear xk
3766 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth);
3767 }
3769 //-----------------------------cast_to_instance_id----------------------------
3770 const TypeOopPtr *TypeAryPtr::cast_to_instance_id(int instance_id) const {
3771 if( instance_id == _instance_id ) return this;
3772 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth);
3773 }
3775 //-----------------------------narrow_size_type-------------------------------
3776 // Local cache for arrayOopDesc::max_array_length(etype),
3777 // which is kind of slow (and cached elsewhere by other users).
3778 static jint max_array_length_cache[T_CONFLICT+1];
3779 static jint max_array_length(BasicType etype) {
3780 jint& cache = max_array_length_cache[etype];
3781 jint res = cache;
3782 if (res == 0) {
3783 switch (etype) {
3784 case T_NARROWOOP:
3785 etype = T_OBJECT;
3786 break;
3787 case T_NARROWKLASS:
3788 case T_CONFLICT:
3789 case T_ILLEGAL:
3790 case T_VOID:
3791 etype = T_BYTE; // will produce conservatively high value
3792 }
3793 cache = res = arrayOopDesc::max_array_length(etype);
3794 }
3795 return res;
3796 }
3798 // Narrow the given size type to the index range for the given array base type.
3799 // Return NULL if the resulting int type becomes empty.
3800 const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const {
3801 jint hi = size->_hi;
3802 jint lo = size->_lo;
3803 jint min_lo = 0;
3804 jint max_hi = max_array_length(elem()->basic_type());
3805 //if (index_not_size) --max_hi; // type of a valid array index, FTR
3806 bool chg = false;
3807 if (lo < min_lo) {
3808 lo = min_lo;
3809 if (size->is_con()) {
3810 hi = lo;
3811 }
3812 chg = true;
3813 }
3814 if (hi > max_hi) {
3815 hi = max_hi;
3816 if (size->is_con()) {
3817 lo = hi;
3818 }
3819 chg = true;
3820 }
3821 // Negative length arrays will produce weird intermediate dead fast-path code
3822 if (lo > hi)
3823 return TypeInt::ZERO;
3824 if (!chg)
3825 return size;
3826 return TypeInt::make(lo, hi, Type::WidenMin);
3827 }
3829 //-------------------------------cast_to_size----------------------------------
3830 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
3831 assert(new_size != NULL, "");
3832 new_size = narrow_size_type(new_size);
3833 if (new_size == size()) return this;
3834 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable());
3835 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth);
3836 }
3839 //------------------------------cast_to_stable---------------------------------
3840 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const {
3841 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable()))
3842 return this;
3844 const Type* elem = this->elem();
3845 const TypePtr* elem_ptr = elem->make_ptr();
3847 if (stable_dimension > 1 && elem_ptr != NULL && elem_ptr->isa_aryptr()) {
3848 // If this is widened from a narrow oop, TypeAry::make will re-narrow it.
3849 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1);
3850 }
3852 const TypeAry* new_ary = TypeAry::make(elem, size(), stable);
3854 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id);
3855 }
3857 //-----------------------------stable_dimension--------------------------------
3858 int TypeAryPtr::stable_dimension() const {
3859 if (!is_stable()) return 0;
3860 int dim = 1;
3861 const TypePtr* elem_ptr = elem()->make_ptr();
3862 if (elem_ptr != NULL && elem_ptr->isa_aryptr())
3863 dim += elem_ptr->is_aryptr()->stable_dimension();
3864 return dim;
3865 }
3867 //------------------------------eq---------------------------------------------
3868 // Structural equality check for Type representations
3869 bool TypeAryPtr::eq( const Type *t ) const {
3870 const TypeAryPtr *p = t->is_aryptr();
3871 return
3872 _ary == p->_ary && // Check array
3873 TypeOopPtr::eq(p); // Check sub-parts
3874 }
3876 //------------------------------hash-------------------------------------------
3877 // Type-specific hashing function.
3878 int TypeAryPtr::hash(void) const {
3879 return (intptr_t)_ary + TypeOopPtr::hash();
3880 }
3882 //------------------------------meet-------------------------------------------
3883 // Compute the MEET of two types. It returns a new Type object.
3884 const Type *TypeAryPtr::xmeet_helper(const Type *t) const {
3885 // Perform a fast test for common case; meeting the same types together.
3886 if( this == t ) return this; // Meeting same type-rep?
3887 // Current "this->_base" is Pointer
3888 switch (t->base()) { // switch on original type
3890 // Mixing ints & oops happens when javac reuses local variables
3891 case Int:
3892 case Long:
3893 case FloatTop:
3894 case FloatCon:
3895 case FloatBot:
3896 case DoubleTop:
3897 case DoubleCon:
3898 case DoubleBot:
3899 case NarrowOop:
3900 case NarrowKlass:
3901 case Bottom: // Ye Olde Default
3902 return Type::BOTTOM;
3903 case Top:
3904 return this;
3906 default: // All else is a mistake
3907 typerr(t);
3909 case OopPtr: { // Meeting to OopPtrs
3910 // Found a OopPtr type vs self-AryPtr type
3911 const TypeOopPtr *tp = t->is_oopptr();
3912 int offset = meet_offset(tp->offset());
3913 PTR ptr = meet_ptr(tp->ptr());
3914 int depth = meet_inline_depth(tp->inline_depth());
3915 switch (tp->ptr()) {
3916 case TopPTR:
3917 case AnyNull: {
3918 int instance_id = meet_instance_id(InstanceTop);
3919 const TypeOopPtr* speculative = xmeet_speculative(tp);
3920 return make(ptr, (ptr == Constant ? const_oop() : NULL),
3921 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
3922 }
3923 case BotPTR:
3924 case NotNull: {
3925 int instance_id = meet_instance_id(tp->instance_id());
3926 const TypeOopPtr* speculative = xmeet_speculative(tp);
3927 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth);
3928 }
3929 default: ShouldNotReachHere();
3930 }
3931 }
3933 case AnyPtr: { // Meeting two AnyPtrs
3934 // Found an AnyPtr type vs self-AryPtr type
3935 const TypePtr *tp = t->is_ptr();
3936 int offset = meet_offset(tp->offset());
3937 PTR ptr = meet_ptr(tp->ptr());
3938 switch (tp->ptr()) {
3939 case TopPTR:
3940 return this;
3941 case BotPTR:
3942 case NotNull:
3943 return TypePtr::make(AnyPtr, ptr, offset);
3944 case Null:
3945 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset);
3946 // else fall through to AnyNull
3947 case AnyNull: {
3948 int instance_id = meet_instance_id(InstanceTop);
3949 const TypeOopPtr* speculative = _speculative;
3950 return make(ptr, (ptr == Constant ? const_oop() : NULL),
3951 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, _inline_depth);
3952 }
3953 default: ShouldNotReachHere();
3954 }
3955 }
3957 case MetadataPtr:
3958 case KlassPtr:
3959 case RawPtr: return TypePtr::BOTTOM;
3961 case AryPtr: { // Meeting 2 references?
3962 const TypeAryPtr *tap = t->is_aryptr();
3963 int off = meet_offset(tap->offset());
3964 const TypeAry *tary = _ary->meet_speculative(tap->_ary)->is_ary();
3965 PTR ptr = meet_ptr(tap->ptr());
3966 int instance_id = meet_instance_id(tap->instance_id());
3967 const TypeOopPtr* speculative = xmeet_speculative(tap);
3968 int depth = meet_inline_depth(tap->inline_depth());
3969 ciKlass* lazy_klass = NULL;
3970 if (tary->_elem->isa_int()) {
3971 // Integral array element types have irrelevant lattice relations.
3972 // It is the klass that determines array layout, not the element type.
3973 if (_klass == NULL)
3974 lazy_klass = tap->_klass;
3975 else if (tap->_klass == NULL || tap->_klass == _klass) {
3976 lazy_klass = _klass;
3977 } else {
3978 // Something like byte[int+] meets char[int+].
3979 // This must fall to bottom, not (int[-128..65535])[int+].
3980 instance_id = InstanceBot;
3981 tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable);
3982 }
3983 } else // Non integral arrays.
3984 // Must fall to bottom if exact klasses in upper lattice
3985 // are not equal or super klass is exact.
3986 if ((above_centerline(ptr) || ptr == Constant) && klass() != tap->klass() &&
3987 // meet with top[] and bottom[] are processed further down:
3988 tap->_klass != NULL && this->_klass != NULL &&
3989 // both are exact and not equal:
3990 ((tap->_klass_is_exact && this->_klass_is_exact) ||
3991 // 'tap' is exact and super or unrelated:
3992 (tap->_klass_is_exact && !tap->klass()->is_subtype_of(klass())) ||
3993 // 'this' is exact and super or unrelated:
3994 (this->_klass_is_exact && !klass()->is_subtype_of(tap->klass())))) {
3995 if (above_centerline(ptr)) {
3996 tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable);
3997 }
3998 return make(NotNull, NULL, tary, lazy_klass, false, off, InstanceBot);
3999 }
4001 bool xk = false;
4002 switch (tap->ptr()) {
4003 case AnyNull:
4004 case TopPTR:
4005 // Compute new klass on demand, do not use tap->_klass
4006 if (below_centerline(this->_ptr)) {
4007 xk = this->_klass_is_exact;
4008 } else {
4009 xk = (tap->_klass_is_exact | this->_klass_is_exact);
4010 }
4011 return make(ptr, const_oop(), tary, lazy_klass, xk, off, instance_id, speculative, depth);
4012 case Constant: {
4013 ciObject* o = const_oop();
4014 if( _ptr == Constant ) {
4015 if( tap->const_oop() != NULL && !o->equals(tap->const_oop()) ) {
4016 xk = (klass() == tap->klass());
4017 ptr = NotNull;
4018 o = NULL;
4019 instance_id = InstanceBot;
4020 } else {
4021 xk = true;
4022 }
4023 } else if(above_centerline(_ptr)) {
4024 o = tap->const_oop();
4025 xk = true;
4026 } else {
4027 // Only precise for identical arrays
4028 xk = this->_klass_is_exact && (klass() == tap->klass());
4029 }
4030 return TypeAryPtr::make(ptr, o, tary, lazy_klass, xk, off, instance_id, speculative, depth);
4031 }
4032 case NotNull:
4033 case BotPTR:
4034 // Compute new klass on demand, do not use tap->_klass
4035 if (above_centerline(this->_ptr))
4036 xk = tap->_klass_is_exact;
4037 else xk = (tap->_klass_is_exact & this->_klass_is_exact) &&
4038 (klass() == tap->klass()); // Only precise for identical arrays
4039 return TypeAryPtr::make(ptr, NULL, tary, lazy_klass, xk, off, instance_id, speculative, depth);
4040 default: ShouldNotReachHere();
4041 }
4042 }
4044 // All arrays inherit from Object class
4045 case InstPtr: {
4046 const TypeInstPtr *tp = t->is_instptr();
4047 int offset = meet_offset(tp->offset());
4048 PTR ptr = meet_ptr(tp->ptr());
4049 int instance_id = meet_instance_id(tp->instance_id());
4050 const TypeOopPtr* speculative = xmeet_speculative(tp);
4051 int depth = meet_inline_depth(tp->inline_depth());
4052 switch (ptr) {
4053 case TopPTR:
4054 case AnyNull: // Fall 'down' to dual of object klass
4055 // For instances when a subclass meets a superclass we fall
4056 // below the centerline when the superclass is exact. We need to
4057 // do the same here.
4058 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) {
4059 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4060 } else {
4061 // cannot subclass, so the meet has to fall badly below the centerline
4062 ptr = NotNull;
4063 instance_id = InstanceBot;
4064 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth);
4065 }
4066 case Constant:
4067 case NotNull:
4068 case BotPTR: // Fall down to object klass
4069 // LCA is object_klass, but if we subclass from the top we can do better
4070 if (above_centerline(tp->ptr())) {
4071 // If 'tp' is above the centerline and it is Object class
4072 // then we can subclass in the Java class hierarchy.
4073 // For instances when a subclass meets a superclass we fall
4074 // below the centerline when the superclass is exact. We need
4075 // to do the same here.
4076 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) {
4077 // that is, my array type is a subtype of 'tp' klass
4078 return make(ptr, (ptr == Constant ? const_oop() : NULL),
4079 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth);
4080 }
4081 }
4082 // The other case cannot happen, since t cannot be a subtype of an array.
4083 // The meet falls down to Object class below centerline.
4084 if( ptr == Constant )
4085 ptr = NotNull;
4086 instance_id = InstanceBot;
4087 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth);
4088 default: typerr(t);
4089 }
4090 }
4091 }
4092 return this; // Lint noise
4093 }
4095 //------------------------------xdual------------------------------------------
4096 // Dual: compute field-by-field dual
4097 const Type *TypeAryPtr::xdual() const {
4098 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());
4099 }
4101 //----------------------interface_vs_oop---------------------------------------
4102 #ifdef ASSERT
4103 bool TypeAryPtr::interface_vs_oop(const Type *t) const {
4104 const TypeAryPtr* t_aryptr = t->isa_aryptr();
4105 if (t_aryptr) {
4106 return _ary->interface_vs_oop(t_aryptr->_ary);
4107 }
4108 return false;
4109 }
4110 #endif
4112 //------------------------------dump2------------------------------------------
4113 #ifndef PRODUCT
4114 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
4115 _ary->dump2(d,depth,st);
4116 switch( _ptr ) {
4117 case Constant:
4118 const_oop()->print(st);
4119 break;
4120 case BotPTR:
4121 if (!WizardMode && !Verbose) {
4122 if( _klass_is_exact ) st->print(":exact");
4123 break;
4124 }
4125 case TopPTR:
4126 case AnyNull:
4127 case NotNull:
4128 st->print(":%s", ptr_msg[_ptr]);
4129 if( _klass_is_exact ) st->print(":exact");
4130 break;
4131 }
4133 if( _offset != 0 ) {
4134 int header_size = objArrayOopDesc::header_size() * wordSize;
4135 if( _offset == OffsetTop ) st->print("+undefined");
4136 else if( _offset == OffsetBot ) st->print("+any");
4137 else if( _offset < header_size ) st->print("+%d", _offset);
4138 else {
4139 BasicType basic_elem_type = elem()->basic_type();
4140 int array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
4141 int elem_size = type2aelembytes(basic_elem_type);
4142 st->print("[%d]", (_offset - array_base)/elem_size);
4143 }
4144 }
4145 st->print(" *");
4146 if (_instance_id == InstanceTop)
4147 st->print(",iid=top");
4148 else if (_instance_id != InstanceBot)
4149 st->print(",iid=%d",_instance_id);
4151 dump_inline_depth(st);
4152 dump_speculative(st);
4153 }
4154 #endif
4156 bool TypeAryPtr::empty(void) const {
4157 if (_ary->empty()) return true;
4158 return TypeOopPtr::empty();
4159 }
4161 //------------------------------add_offset-------------------------------------
4162 const TypePtr *TypeAryPtr::add_offset(intptr_t offset) const {
4163 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth);
4164 }
4166 const Type *TypeAryPtr::remove_speculative() const {
4167 if (_speculative == NULL) {
4168 return this;
4169 }
4170 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth");
4171 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, NULL, _inline_depth);
4172 }
4174 const TypeOopPtr *TypeAryPtr::with_inline_depth(int depth) const {
4175 if (!UseInlineDepthForSpeculativeTypes) {
4176 return this;
4177 }
4178 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth);
4179 }
4181 //=============================================================================
4183 //------------------------------hash-------------------------------------------
4184 // Type-specific hashing function.
4185 int TypeNarrowPtr::hash(void) const {
4186 return _ptrtype->hash() + 7;
4187 }
4189 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton
4190 return _ptrtype->singleton();
4191 }
4193 bool TypeNarrowPtr::empty(void) const {
4194 return _ptrtype->empty();
4195 }
4197 intptr_t TypeNarrowPtr::get_con() const {
4198 return _ptrtype->get_con();
4199 }
4201 bool TypeNarrowPtr::eq( const Type *t ) const {
4202 const TypeNarrowPtr* tc = isa_same_narrowptr(t);
4203 if (tc != NULL) {
4204 if (_ptrtype->base() != tc->_ptrtype->base()) {
4205 return false;
4206 }
4207 return tc->_ptrtype->eq(_ptrtype);
4208 }
4209 return false;
4210 }
4212 const Type *TypeNarrowPtr::xdual() const { // Compute dual right now.
4213 const TypePtr* odual = _ptrtype->dual()->is_ptr();
4214 return make_same_narrowptr(odual);
4215 }
4218 const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const {
4219 if (isa_same_narrowptr(kills)) {
4220 const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative);
4221 if (ft->empty())
4222 return Type::TOP; // Canonical empty value
4223 if (ft->isa_ptr()) {
4224 return make_hash_same_narrowptr(ft->isa_ptr());
4225 }
4226 return ft;
4227 } else if (kills->isa_ptr()) {
4228 const Type* ft = _ptrtype->join_helper(kills, include_speculative);
4229 if (ft->empty())
4230 return Type::TOP; // Canonical empty value
4231 return ft;
4232 } else {
4233 return Type::TOP;
4234 }
4235 }
4237 //------------------------------xmeet------------------------------------------
4238 // Compute the MEET of two types. It returns a new Type object.
4239 const Type *TypeNarrowPtr::xmeet( const Type *t ) const {
4240 // Perform a fast test for common case; meeting the same types together.
4241 if( this == t ) return this; // Meeting same type-rep?
4243 if (t->base() == base()) {
4244 const Type* result = _ptrtype->xmeet(t->make_ptr());
4245 if (result->isa_ptr()) {
4246 return make_hash_same_narrowptr(result->is_ptr());
4247 }
4248 return result;
4249 }
4251 // Current "this->_base" is NarrowKlass or NarrowOop
4252 switch (t->base()) { // switch on original type
4254 case Int: // Mixing ints & oops happens when javac
4255 case Long: // reuses local variables
4256 case FloatTop:
4257 case FloatCon:
4258 case FloatBot:
4259 case DoubleTop:
4260 case DoubleCon:
4261 case DoubleBot:
4262 case AnyPtr:
4263 case RawPtr:
4264 case OopPtr:
4265 case InstPtr:
4266 case AryPtr:
4267 case MetadataPtr:
4268 case KlassPtr:
4269 case NarrowOop:
4270 case NarrowKlass:
4272 case Bottom: // Ye Olde Default
4273 return Type::BOTTOM;
4274 case Top:
4275 return this;
4277 default: // All else is a mistake
4278 typerr(t);
4280 } // End of switch
4282 return this;
4283 }
4285 #ifndef PRODUCT
4286 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
4287 _ptrtype->dump2(d, depth, st);
4288 }
4289 #endif
4291 const TypeNarrowOop *TypeNarrowOop::BOTTOM;
4292 const TypeNarrowOop *TypeNarrowOop::NULL_PTR;
4295 const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) {
4296 return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons();
4297 }
4300 #ifndef PRODUCT
4301 void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const {
4302 st->print("narrowoop: ");
4303 TypeNarrowPtr::dump2(d, depth, st);
4304 }
4305 #endif
4307 const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR;
4309 const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) {
4310 return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons();
4311 }
4313 #ifndef PRODUCT
4314 void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const {
4315 st->print("narrowklass: ");
4316 TypeNarrowPtr::dump2(d, depth, st);
4317 }
4318 #endif
4321 //------------------------------eq---------------------------------------------
4322 // Structural equality check for Type representations
4323 bool TypeMetadataPtr::eq( const Type *t ) const {
4324 const TypeMetadataPtr *a = (const TypeMetadataPtr*)t;
4325 ciMetadata* one = metadata();
4326 ciMetadata* two = a->metadata();
4327 if (one == NULL || two == NULL) {
4328 return (one == two) && TypePtr::eq(t);
4329 } else {
4330 return one->equals(two) && TypePtr::eq(t);
4331 }
4332 }
4334 //------------------------------hash-------------------------------------------
4335 // Type-specific hashing function.
4336 int TypeMetadataPtr::hash(void) const {
4337 return
4338 (metadata() ? metadata()->hash() : 0) +
4339 TypePtr::hash();
4340 }
4342 //------------------------------singleton--------------------------------------
4343 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
4344 // constants
4345 bool TypeMetadataPtr::singleton(void) const {
4346 // detune optimizer to not generate constant metadta + constant offset as a constant!
4347 // TopPTR, Null, AnyNull, Constant are all singletons
4348 return (_offset == 0) && !below_centerline(_ptr);
4349 }
4351 //------------------------------add_offset-------------------------------------
4352 const TypePtr *TypeMetadataPtr::add_offset( intptr_t offset ) const {
4353 return make( _ptr, _metadata, xadd_offset(offset));
4354 }
4356 //-----------------------------filter------------------------------------------
4357 // Do not allow interface-vs.-noninterface joins to collapse to top.
4358 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const {
4359 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr();
4360 if (ft == NULL || ft->empty())
4361 return Type::TOP; // Canonical empty value
4362 return ft;
4363 }
4365 //------------------------------get_con----------------------------------------
4366 intptr_t TypeMetadataPtr::get_con() const {
4367 assert( _ptr == Null || _ptr == Constant, "" );
4368 assert( _offset >= 0, "" );
4370 if (_offset != 0) {
4371 // After being ported to the compiler interface, the compiler no longer
4372 // directly manipulates the addresses of oops. Rather, it only has a pointer
4373 // to a handle at compile time. This handle is embedded in the generated
4374 // code and dereferenced at the time the nmethod is made. Until that time,
4375 // it is not reasonable to do arithmetic with the addresses of oops (we don't
4376 // have access to the addresses!). This does not seem to currently happen,
4377 // but this assertion here is to help prevent its occurence.
4378 tty->print_cr("Found oop constant with non-zero offset");
4379 ShouldNotReachHere();
4380 }
4382 return (intptr_t)metadata()->constant_encoding();
4383 }
4385 //------------------------------cast_to_ptr_type-------------------------------
4386 const Type *TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const {
4387 if( ptr == _ptr ) return this;
4388 return make(ptr, metadata(), _offset);
4389 }
4391 //------------------------------meet-------------------------------------------
4392 // Compute the MEET of two types. It returns a new Type object.
4393 const Type *TypeMetadataPtr::xmeet( const Type *t ) const {
4394 // Perform a fast test for common case; meeting the same types together.
4395 if( this == t ) return this; // Meeting same type-rep?
4397 // Current "this->_base" is OopPtr
4398 switch (t->base()) { // switch on original type
4400 case Int: // Mixing ints & oops happens when javac
4401 case Long: // reuses local variables
4402 case FloatTop:
4403 case FloatCon:
4404 case FloatBot:
4405 case DoubleTop:
4406 case DoubleCon:
4407 case DoubleBot:
4408 case NarrowOop:
4409 case NarrowKlass:
4410 case Bottom: // Ye Olde Default
4411 return Type::BOTTOM;
4412 case Top:
4413 return this;
4415 default: // All else is a mistake
4416 typerr(t);
4418 case AnyPtr: {
4419 // Found an AnyPtr type vs self-OopPtr type
4420 const TypePtr *tp = t->is_ptr();
4421 int offset = meet_offset(tp->offset());
4422 PTR ptr = meet_ptr(tp->ptr());
4423 switch (tp->ptr()) {
4424 case Null:
4425 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset);
4426 // else fall through:
4427 case TopPTR:
4428 case AnyNull: {
4429 return make(ptr, _metadata, offset);
4430 }
4431 case BotPTR:
4432 case NotNull:
4433 return TypePtr::make(AnyPtr, ptr, offset);
4434 default: typerr(t);
4435 }
4436 }
4438 case RawPtr:
4439 case KlassPtr:
4440 case OopPtr:
4441 case InstPtr:
4442 case AryPtr:
4443 return TypePtr::BOTTOM; // Oop meet raw is not well defined
4445 case MetadataPtr: {
4446 const TypeMetadataPtr *tp = t->is_metadataptr();
4447 int offset = meet_offset(tp->offset());
4448 PTR tptr = tp->ptr();
4449 PTR ptr = meet_ptr(tptr);
4450 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata();
4451 if (tptr == TopPTR || _ptr == TopPTR ||
4452 metadata()->equals(tp->metadata())) {
4453 return make(ptr, md, offset);
4454 }
4455 // metadata is different
4456 if( ptr == Constant ) { // Cannot be equal constants, so...
4457 if( tptr == Constant && _ptr != Constant) return t;
4458 if( _ptr == Constant && tptr != Constant) return this;
4459 ptr = NotNull; // Fall down in lattice
4460 }
4461 return make(ptr, NULL, offset);
4462 break;
4463 }
4464 } // End of switch
4465 return this; // Return the double constant
4466 }
4469 //------------------------------xdual------------------------------------------
4470 // Dual of a pure metadata pointer.
4471 const Type *TypeMetadataPtr::xdual() const {
4472 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset());
4473 }
4475 //------------------------------dump2------------------------------------------
4476 #ifndef PRODUCT
4477 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
4478 st->print("metadataptr:%s", ptr_msg[_ptr]);
4479 if( metadata() ) st->print(INTPTR_FORMAT, metadata());
4480 switch( _offset ) {
4481 case OffsetTop: st->print("+top"); break;
4482 case OffsetBot: st->print("+any"); break;
4483 case 0: break;
4484 default: st->print("+%d",_offset); break;
4485 }
4486 }
4487 #endif
4490 //=============================================================================
4491 // Convenience common pre-built type.
4492 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM;
4494 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset):
4495 TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) {
4496 }
4498 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) {
4499 return make(Constant, m, 0);
4500 }
4501 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) {
4502 return make(Constant, m, 0);
4503 }
4505 //------------------------------make-------------------------------------------
4506 // Create a meta data constant
4507 const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) {
4508 assert(m == NULL || !m->is_klass(), "wrong type");
4509 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons();
4510 }
4513 //=============================================================================
4514 // Convenience common pre-built types.
4516 // Not-null object klass or below
4517 const TypeKlassPtr *TypeKlassPtr::OBJECT;
4518 const TypeKlassPtr *TypeKlassPtr::OBJECT_OR_NULL;
4520 //------------------------------TypeKlassPtr-----------------------------------
4521 TypeKlassPtr::TypeKlassPtr( PTR ptr, ciKlass* klass, int offset )
4522 : TypePtr(KlassPtr, ptr, offset), _klass(klass), _klass_is_exact(ptr == Constant) {
4523 }
4525 //------------------------------make-------------------------------------------
4526 // ptr to klass 'k', if Constant, or possibly to a sub-klass if not a Constant
4527 const TypeKlassPtr *TypeKlassPtr::make( PTR ptr, ciKlass* k, int offset ) {
4528 assert( k != NULL, "Expect a non-NULL klass");
4529 assert(k->is_instance_klass() || k->is_array_klass(), "Incorrect type of klass oop");
4530 TypeKlassPtr *r =
4531 (TypeKlassPtr*)(new TypeKlassPtr(ptr, k, offset))->hashcons();
4533 return r;
4534 }
4536 //------------------------------eq---------------------------------------------
4537 // Structural equality check for Type representations
4538 bool TypeKlassPtr::eq( const Type *t ) const {
4539 const TypeKlassPtr *p = t->is_klassptr();
4540 return
4541 klass()->equals(p->klass()) &&
4542 TypePtr::eq(p);
4543 }
4545 //------------------------------hash-------------------------------------------
4546 // Type-specific hashing function.
4547 int TypeKlassPtr::hash(void) const {
4548 return klass()->hash() + TypePtr::hash();
4549 }
4551 //------------------------------singleton--------------------------------------
4552 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
4553 // constants
4554 bool TypeKlassPtr::singleton(void) const {
4555 // detune optimizer to not generate constant klass + constant offset as a constant!
4556 // TopPTR, Null, AnyNull, Constant are all singletons
4557 return (_offset == 0) && !below_centerline(_ptr);
4558 }
4560 // Do not allow interface-vs.-noninterface joins to collapse to top.
4561 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const {
4562 // logic here mirrors the one from TypeOopPtr::filter. See comments
4563 // there.
4564 const Type* ft = join_helper(kills, include_speculative);
4565 const TypeKlassPtr* ftkp = ft->isa_klassptr();
4566 const TypeKlassPtr* ktkp = kills->isa_klassptr();
4568 if (ft->empty()) {
4569 if (!empty() && ktkp != NULL && ktkp->klass()->is_loaded() && ktkp->klass()->is_interface())
4570 return kills; // Uplift to interface
4572 return Type::TOP; // Canonical empty value
4573 }
4575 // Interface klass type could be exact in opposite to interface type,
4576 // return it here instead of incorrect Constant ptr J/L/Object (6894807).
4577 if (ftkp != NULL && ktkp != NULL &&
4578 ftkp->is_loaded() && ftkp->klass()->is_interface() &&
4579 !ftkp->klass_is_exact() && // Keep exact interface klass
4580 ktkp->is_loaded() && !ktkp->klass()->is_interface()) {
4581 return ktkp->cast_to_ptr_type(ftkp->ptr());
4582 }
4584 return ft;
4585 }
4587 //----------------------compute_klass------------------------------------------
4588 // Compute the defining klass for this class
4589 ciKlass* TypeAryPtr::compute_klass(DEBUG_ONLY(bool verify)) const {
4590 // Compute _klass based on element type.
4591 ciKlass* k_ary = NULL;
4592 const TypeInstPtr *tinst;
4593 const TypeAryPtr *tary;
4594 const Type* el = elem();
4595 if (el->isa_narrowoop()) {
4596 el = el->make_ptr();
4597 }
4599 // Get element klass
4600 if ((tinst = el->isa_instptr()) != NULL) {
4601 // Compute array klass from element klass
4602 k_ary = ciObjArrayKlass::make(tinst->klass());
4603 } else if ((tary = el->isa_aryptr()) != NULL) {
4604 // Compute array klass from element klass
4605 ciKlass* k_elem = tary->klass();
4606 // If element type is something like bottom[], k_elem will be null.
4607 if (k_elem != NULL)
4608 k_ary = ciObjArrayKlass::make(k_elem);
4609 } else if ((el->base() == Type::Top) ||
4610 (el->base() == Type::Bottom)) {
4611 // element type of Bottom occurs from meet of basic type
4612 // and object; Top occurs when doing join on Bottom.
4613 // Leave k_ary at NULL.
4614 } else {
4615 // Cannot compute array klass directly from basic type,
4616 // since subtypes of TypeInt all have basic type T_INT.
4617 #ifdef ASSERT
4618 if (verify && el->isa_int()) {
4619 // Check simple cases when verifying klass.
4620 BasicType bt = T_ILLEGAL;
4621 if (el == TypeInt::BYTE) {
4622 bt = T_BYTE;
4623 } else if (el == TypeInt::SHORT) {
4624 bt = T_SHORT;
4625 } else if (el == TypeInt::CHAR) {
4626 bt = T_CHAR;
4627 } else if (el == TypeInt::INT) {
4628 bt = T_INT;
4629 } else {
4630 return _klass; // just return specified klass
4631 }
4632 return ciTypeArrayKlass::make(bt);
4633 }
4634 #endif
4635 assert(!el->isa_int(),
4636 "integral arrays must be pre-equipped with a class");
4637 // Compute array klass directly from basic type
4638 k_ary = ciTypeArrayKlass::make(el->basic_type());
4639 }
4640 return k_ary;
4641 }
4643 //------------------------------klass------------------------------------------
4644 // Return the defining klass for this class
4645 ciKlass* TypeAryPtr::klass() const {
4646 if( _klass ) return _klass; // Return cached value, if possible
4648 // Oops, need to compute _klass and cache it
4649 ciKlass* k_ary = compute_klass();
4651 if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) {
4652 // The _klass field acts as a cache of the underlying
4653 // ciKlass for this array type. In order to set the field,
4654 // we need to cast away const-ness.
4655 //
4656 // IMPORTANT NOTE: we *never* set the _klass field for the
4657 // type TypeAryPtr::OOPS. This Type is shared between all
4658 // active compilations. However, the ciKlass which represents
4659 // this Type is *not* shared between compilations, so caching
4660 // this value would result in fetching a dangling pointer.
4661 //
4662 // Recomputing the underlying ciKlass for each request is
4663 // a bit less efficient than caching, but calls to
4664 // TypeAryPtr::OOPS->klass() are not common enough to matter.
4665 ((TypeAryPtr*)this)->_klass = k_ary;
4666 if (UseCompressedOops && k_ary != NULL && k_ary->is_obj_array_klass() &&
4667 _offset != 0 && _offset != arrayOopDesc::length_offset_in_bytes()) {
4668 ((TypeAryPtr*)this)->_is_ptr_to_narrowoop = true;
4669 }
4670 }
4671 return k_ary;
4672 }
4675 //------------------------------add_offset-------------------------------------
4676 // Access internals of klass object
4677 const TypePtr *TypeKlassPtr::add_offset( intptr_t offset ) const {
4678 return make( _ptr, klass(), xadd_offset(offset) );
4679 }
4681 //------------------------------cast_to_ptr_type-------------------------------
4682 const Type *TypeKlassPtr::cast_to_ptr_type(PTR ptr) const {
4683 assert(_base == KlassPtr, "subclass must override cast_to_ptr_type");
4684 if( ptr == _ptr ) return this;
4685 return make(ptr, _klass, _offset);
4686 }
4689 //-----------------------------cast_to_exactness-------------------------------
4690 const Type *TypeKlassPtr::cast_to_exactness(bool klass_is_exact) const {
4691 if( klass_is_exact == _klass_is_exact ) return this;
4692 if (!UseExactTypes) return this;
4693 return make(klass_is_exact ? Constant : NotNull, _klass, _offset);
4694 }
4697 //-----------------------------as_instance_type--------------------------------
4698 // Corresponding type for an instance of the given class.
4699 // It will be NotNull, and exact if and only if the klass type is exact.
4700 const TypeOopPtr* TypeKlassPtr::as_instance_type() const {
4701 ciKlass* k = klass();
4702 bool xk = klass_is_exact();
4703 //return TypeInstPtr::make(TypePtr::NotNull, k, xk, NULL, 0);
4704 const TypeOopPtr* toop = TypeOopPtr::make_from_klass_raw(k);
4705 guarantee(toop != NULL, "need type for given klass");
4706 toop = toop->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
4707 return toop->cast_to_exactness(xk)->is_oopptr();
4708 }
4711 //------------------------------xmeet------------------------------------------
4712 // Compute the MEET of two types, return a new Type object.
4713 const Type *TypeKlassPtr::xmeet( const Type *t ) const {
4714 // Perform a fast test for common case; meeting the same types together.
4715 if( this == t ) return this; // Meeting same type-rep?
4717 // Current "this->_base" is Pointer
4718 switch (t->base()) { // switch on original type
4720 case Int: // Mixing ints & oops happens when javac
4721 case Long: // reuses local variables
4722 case FloatTop:
4723 case FloatCon:
4724 case FloatBot:
4725 case DoubleTop:
4726 case DoubleCon:
4727 case DoubleBot:
4728 case NarrowOop:
4729 case NarrowKlass:
4730 case Bottom: // Ye Olde Default
4731 return Type::BOTTOM;
4732 case Top:
4733 return this;
4735 default: // All else is a mistake
4736 typerr(t);
4738 case AnyPtr: { // Meeting to AnyPtrs
4739 // Found an AnyPtr type vs self-KlassPtr type
4740 const TypePtr *tp = t->is_ptr();
4741 int offset = meet_offset(tp->offset());
4742 PTR ptr = meet_ptr(tp->ptr());
4743 switch (tp->ptr()) {
4744 case TopPTR:
4745 return this;
4746 case Null:
4747 if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset );
4748 case AnyNull:
4749 return make( ptr, klass(), offset );
4750 case BotPTR:
4751 case NotNull:
4752 return TypePtr::make(AnyPtr, ptr, offset);
4753 default: typerr(t);
4754 }
4755 }
4757 case RawPtr:
4758 case MetadataPtr:
4759 case OopPtr:
4760 case AryPtr: // Meet with AryPtr
4761 case InstPtr: // Meet with InstPtr
4762 return TypePtr::BOTTOM;
4764 //
4765 // A-top }
4766 // / | \ } Tops
4767 // B-top A-any C-top }
4768 // | / | \ | } Any-nulls
4769 // B-any | C-any }
4770 // | | |
4771 // B-con A-con C-con } constants; not comparable across classes
4772 // | | |
4773 // B-not | C-not }
4774 // | \ | / | } not-nulls
4775 // B-bot A-not C-bot }
4776 // \ | / } Bottoms
4777 // A-bot }
4778 //
4780 case KlassPtr: { // Meet two KlassPtr types
4781 const TypeKlassPtr *tkls = t->is_klassptr();
4782 int off = meet_offset(tkls->offset());
4783 PTR ptr = meet_ptr(tkls->ptr());
4785 // Check for easy case; klasses are equal (and perhaps not loaded!)
4786 // If we have constants, then we created oops so classes are loaded
4787 // and we can handle the constants further down. This case handles
4788 // not-loaded classes
4789 if( ptr != Constant && tkls->klass()->equals(klass()) ) {
4790 return make( ptr, klass(), off );
4791 }
4793 // Classes require inspection in the Java klass hierarchy. Must be loaded.
4794 ciKlass* tkls_klass = tkls->klass();
4795 ciKlass* this_klass = this->klass();
4796 assert( tkls_klass->is_loaded(), "This class should have been loaded.");
4797 assert( this_klass->is_loaded(), "This class should have been loaded.");
4799 // If 'this' type is above the centerline and is a superclass of the
4800 // other, we can treat 'this' as having the same type as the other.
4801 if ((above_centerline(this->ptr())) &&
4802 tkls_klass->is_subtype_of(this_klass)) {
4803 this_klass = tkls_klass;
4804 }
4805 // If 'tinst' type is above the centerline and is a superclass of the
4806 // other, we can treat 'tinst' as having the same type as the other.
4807 if ((above_centerline(tkls->ptr())) &&
4808 this_klass->is_subtype_of(tkls_klass)) {
4809 tkls_klass = this_klass;
4810 }
4812 // Check for classes now being equal
4813 if (tkls_klass->equals(this_klass)) {
4814 // If the klasses are equal, the constants may still differ. Fall to
4815 // NotNull if they do (neither constant is NULL; that is a special case
4816 // handled elsewhere).
4817 if( ptr == Constant ) {
4818 if (this->_ptr == Constant && tkls->_ptr == Constant &&
4819 this->klass()->equals(tkls->klass()));
4820 else if (above_centerline(this->ptr()));
4821 else if (above_centerline(tkls->ptr()));
4822 else
4823 ptr = NotNull;
4824 }
4825 return make( ptr, this_klass, off );
4826 } // Else classes are not equal
4828 // Since klasses are different, we require the LCA in the Java
4829 // class hierarchy - which means we have to fall to at least NotNull.
4830 if( ptr == TopPTR || ptr == AnyNull || ptr == Constant )
4831 ptr = NotNull;
4832 // Now we find the LCA of Java classes
4833 ciKlass* k = this_klass->least_common_ancestor(tkls_klass);
4834 return make( ptr, k, off );
4835 } // End of case KlassPtr
4837 } // End of switch
4838 return this; // Return the double constant
4839 }
4841 //------------------------------xdual------------------------------------------
4842 // Dual: compute field-by-field dual
4843 const Type *TypeKlassPtr::xdual() const {
4844 return new TypeKlassPtr( dual_ptr(), klass(), dual_offset() );
4845 }
4847 //------------------------------get_con----------------------------------------
4848 intptr_t TypeKlassPtr::get_con() const {
4849 assert( _ptr == Null || _ptr == Constant, "" );
4850 assert( _offset >= 0, "" );
4852 if (_offset != 0) {
4853 // After being ported to the compiler interface, the compiler no longer
4854 // directly manipulates the addresses of oops. Rather, it only has a pointer
4855 // to a handle at compile time. This handle is embedded in the generated
4856 // code and dereferenced at the time the nmethod is made. Until that time,
4857 // it is not reasonable to do arithmetic with the addresses of oops (we don't
4858 // have access to the addresses!). This does not seem to currently happen,
4859 // but this assertion here is to help prevent its occurence.
4860 tty->print_cr("Found oop constant with non-zero offset");
4861 ShouldNotReachHere();
4862 }
4864 return (intptr_t)klass()->constant_encoding();
4865 }
4866 //------------------------------dump2------------------------------------------
4867 // Dump Klass Type
4868 #ifndef PRODUCT
4869 void TypeKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
4870 switch( _ptr ) {
4871 case Constant:
4872 st->print("precise ");
4873 case NotNull:
4874 {
4875 const char *name = klass()->name()->as_utf8();
4876 if( name ) {
4877 st->print("klass %s: " INTPTR_FORMAT, name, klass());
4878 } else {
4879 ShouldNotReachHere();
4880 }
4881 }
4882 case BotPTR:
4883 if( !WizardMode && !Verbose && !_klass_is_exact ) break;
4884 case TopPTR:
4885 case AnyNull:
4886 st->print(":%s", ptr_msg[_ptr]);
4887 if( _klass_is_exact ) st->print(":exact");
4888 break;
4889 }
4891 if( _offset ) { // Dump offset, if any
4892 if( _offset == OffsetBot ) { st->print("+any"); }
4893 else if( _offset == OffsetTop ) { st->print("+unknown"); }
4894 else { st->print("+%d", _offset); }
4895 }
4897 st->print(" *");
4898 }
4899 #endif
4903 //=============================================================================
4904 // Convenience common pre-built types.
4906 //------------------------------make-------------------------------------------
4907 const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) {
4908 return (TypeFunc*)(new TypeFunc(domain,range))->hashcons();
4909 }
4911 //------------------------------make-------------------------------------------
4912 const TypeFunc *TypeFunc::make(ciMethod* method) {
4913 Compile* C = Compile::current();
4914 const TypeFunc* tf = C->last_tf(method); // check cache
4915 if (tf != NULL) return tf; // The hit rate here is almost 50%.
4916 const TypeTuple *domain;
4917 if (method->is_static()) {
4918 domain = TypeTuple::make_domain(NULL, method->signature());
4919 } else {
4920 domain = TypeTuple::make_domain(method->holder(), method->signature());
4921 }
4922 const TypeTuple *range = TypeTuple::make_range(method->signature());
4923 tf = TypeFunc::make(domain, range);
4924 C->set_last_tf(method, tf); // fill cache
4925 return tf;
4926 }
4928 //------------------------------meet-------------------------------------------
4929 // Compute the MEET of two types. It returns a new Type object.
4930 const Type *TypeFunc::xmeet( const Type *t ) const {
4931 // Perform a fast test for common case; meeting the same types together.
4932 if( this == t ) return this; // Meeting same type-rep?
4934 // Current "this->_base" is Func
4935 switch (t->base()) { // switch on original type
4937 case Bottom: // Ye Olde Default
4938 return t;
4940 default: // All else is a mistake
4941 typerr(t);
4943 case Top:
4944 break;
4945 }
4946 return this; // Return the double constant
4947 }
4949 //------------------------------xdual------------------------------------------
4950 // Dual: compute field-by-field dual
4951 const Type *TypeFunc::xdual() const {
4952 return this;
4953 }
4955 //------------------------------eq---------------------------------------------
4956 // Structural equality check for Type representations
4957 bool TypeFunc::eq( const Type *t ) const {
4958 const TypeFunc *a = (const TypeFunc*)t;
4959 return _domain == a->_domain &&
4960 _range == a->_range;
4961 }
4963 //------------------------------hash-------------------------------------------
4964 // Type-specific hashing function.
4965 int TypeFunc::hash(void) const {
4966 return (intptr_t)_domain + (intptr_t)_range;
4967 }
4969 //------------------------------dump2------------------------------------------
4970 // Dump Function Type
4971 #ifndef PRODUCT
4972 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
4973 if( _range->_cnt <= Parms )
4974 st->print("void");
4975 else {
4976 uint i;
4977 for (i = Parms; i < _range->_cnt-1; i++) {
4978 _range->field_at(i)->dump2(d,depth,st);
4979 st->print("/");
4980 }
4981 _range->field_at(i)->dump2(d,depth,st);
4982 }
4983 st->print(" ");
4984 st->print("( ");
4985 if( !depth || d[this] ) { // Check for recursive dump
4986 st->print("...)");
4987 return;
4988 }
4989 d.Insert((void*)this,(void*)this); // Stop recursion
4990 if (Parms < _domain->_cnt)
4991 _domain->field_at(Parms)->dump2(d,depth-1,st);
4992 for (uint i = Parms+1; i < _domain->_cnt; i++) {
4993 st->print(", ");
4994 _domain->field_at(i)->dump2(d,depth-1,st);
4995 }
4996 st->print(" )");
4997 }
4998 #endif
5000 //------------------------------singleton--------------------------------------
5001 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
5002 // constants (Ldi nodes). Singletons are integer, float or double constants
5003 // or a single symbol.
5004 bool TypeFunc::singleton(void) const {
5005 return false; // Never a singleton
5006 }
5008 bool TypeFunc::empty(void) const {
5009 return false; // Never empty
5010 }
5013 BasicType TypeFunc::return_type() const{
5014 if (range()->cnt() == TypeFunc::Parms) {
5015 return T_VOID;
5016 }
5017 return range()->field_at(TypeFunc::Parms)->basic_type();
5018 }