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