author | kvn |
Fri, 01 Aug 2008 10:06:45 -0700 | |
changeset 1055 | f4fb9fb08038 |
parent 955 | 723d7b577fba |
child 1068 | 720698d9c89b |
permissions | -rw-r--r-- |
1 | 1 |
/* |
670 | 2 |
* Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. |
1 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
|
20 |
* CA 95054 USA or visit www.sun.com if you need additional information or |
|
21 |
* have any questions. |
|
22 |
* |
|
23 |
*/ |
|
24 |
||
25 |
// Portions of code courtesy of Clifford Click |
|
26 |
||
27 |
// Optimization - Graph Style |
|
28 |
||
29 |
#include "incls/_precompiled.incl" |
|
30 |
#include "incls/_type.cpp.incl" |
|
31 |
||
32 |
// Dictionary of types shared among compilations. |
|
33 |
Dict* Type::_shared_type_dict = NULL; |
|
34 |
||
35 |
// Array which maps compiler types to Basic Types |
|
36 |
const BasicType Type::_basic_type[Type::lastype] = { |
|
37 |
T_ILLEGAL, // Bad |
|
38 |
T_ILLEGAL, // Control |
|
39 |
T_VOID, // Top |
|
40 |
T_INT, // Int |
|
41 |
T_LONG, // Long |
|
42 |
T_VOID, // Half |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
43 |
T_NARROWOOP, // NarrowOop |
1 | 44 |
|
45 |
T_ILLEGAL, // Tuple |
|
46 |
T_ARRAY, // Array |
|
47 |
||
48 |
T_ADDRESS, // AnyPtr // shows up in factory methods for NULL_PTR |
|
49 |
T_ADDRESS, // RawPtr |
|
50 |
T_OBJECT, // OopPtr |
|
51 |
T_OBJECT, // InstPtr |
|
52 |
T_OBJECT, // AryPtr |
|
53 |
T_OBJECT, // KlassPtr |
|
54 |
||
55 |
T_OBJECT, // Function |
|
56 |
T_ILLEGAL, // Abio |
|
57 |
T_ADDRESS, // Return_Address |
|
58 |
T_ILLEGAL, // Memory |
|
59 |
T_FLOAT, // FloatTop |
|
60 |
T_FLOAT, // FloatCon |
|
61 |
T_FLOAT, // FloatBot |
|
62 |
T_DOUBLE, // DoubleTop |
|
63 |
T_DOUBLE, // DoubleCon |
|
64 |
T_DOUBLE, // DoubleBot |
|
65 |
T_ILLEGAL, // Bottom |
|
66 |
}; |
|
67 |
||
68 |
// Map ideal registers (machine types) to ideal types |
|
69 |
const Type *Type::mreg2type[_last_machine_leaf]; |
|
70 |
||
71 |
// Map basic types to canonical Type* pointers. |
|
72 |
const Type* Type:: _const_basic_type[T_CONFLICT+1]; |
|
73 |
||
74 |
// Map basic types to constant-zero Types. |
|
75 |
const Type* Type:: _zero_type[T_CONFLICT+1]; |
|
76 |
||
77 |
// Map basic types to array-body alias types. |
|
78 |
const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1]; |
|
79 |
||
80 |
//============================================================================= |
|
81 |
// Convenience common pre-built types. |
|
82 |
const Type *Type::ABIO; // State-of-machine only |
|
83 |
const Type *Type::BOTTOM; // All values |
|
84 |
const Type *Type::CONTROL; // Control only |
|
85 |
const Type *Type::DOUBLE; // All doubles |
|
86 |
const Type *Type::FLOAT; // All floats |
|
87 |
const Type *Type::HALF; // Placeholder half of doublewide type |
|
88 |
const Type *Type::MEMORY; // Abstract store only |
|
89 |
const Type *Type::RETURN_ADDRESS; |
|
90 |
const Type *Type::TOP; // No values in set |
|
91 |
||
92 |
//------------------------------get_const_type--------------------------- |
|
93 |
const Type* Type::get_const_type(ciType* type) { |
|
94 |
if (type == NULL) { |
|
95 |
return NULL; |
|
96 |
} else if (type->is_primitive_type()) { |
|
97 |
return get_const_basic_type(type->basic_type()); |
|
98 |
} else { |
|
99 |
return TypeOopPtr::make_from_klass(type->as_klass()); |
|
100 |
} |
|
101 |
} |
|
102 |
||
103 |
//---------------------------array_element_basic_type--------------------------------- |
|
104 |
// Mapping to the array element's basic type. |
|
105 |
BasicType Type::array_element_basic_type() const { |
|
106 |
BasicType bt = basic_type(); |
|
107 |
if (bt == T_INT) { |
|
108 |
if (this == TypeInt::INT) return T_INT; |
|
109 |
if (this == TypeInt::CHAR) return T_CHAR; |
|
110 |
if (this == TypeInt::BYTE) return T_BYTE; |
|
111 |
if (this == TypeInt::BOOL) return T_BOOLEAN; |
|
112 |
if (this == TypeInt::SHORT) return T_SHORT; |
|
113 |
return T_VOID; |
|
114 |
} |
|
115 |
return bt; |
|
116 |
} |
|
117 |
||
118 |
//---------------------------get_typeflow_type--------------------------------- |
|
119 |
// Import a type produced by ciTypeFlow. |
|
120 |
const Type* Type::get_typeflow_type(ciType* type) { |
|
121 |
switch (type->basic_type()) { |
|
122 |
||
123 |
case ciTypeFlow::StateVector::T_BOTTOM: |
|
124 |
assert(type == ciTypeFlow::StateVector::bottom_type(), ""); |
|
125 |
return Type::BOTTOM; |
|
126 |
||
127 |
case ciTypeFlow::StateVector::T_TOP: |
|
128 |
assert(type == ciTypeFlow::StateVector::top_type(), ""); |
|
129 |
return Type::TOP; |
|
130 |
||
131 |
case ciTypeFlow::StateVector::T_NULL: |
|
132 |
assert(type == ciTypeFlow::StateVector::null_type(), ""); |
|
133 |
return TypePtr::NULL_PTR; |
|
134 |
||
135 |
case ciTypeFlow::StateVector::T_LONG2: |
|
136 |
// The ciTypeFlow pass pushes a long, then the half. |
|
137 |
// We do the same. |
|
138 |
assert(type == ciTypeFlow::StateVector::long2_type(), ""); |
|
139 |
return TypeInt::TOP; |
|
140 |
||
141 |
case ciTypeFlow::StateVector::T_DOUBLE2: |
|
142 |
// The ciTypeFlow pass pushes double, then the half. |
|
143 |
// Our convention is the same. |
|
144 |
assert(type == ciTypeFlow::StateVector::double2_type(), ""); |
|
145 |
return Type::TOP; |
|
146 |
||
147 |
case T_ADDRESS: |
|
148 |
assert(type->is_return_address(), ""); |
|
149 |
return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci()); |
|
150 |
||
151 |
default: |
|
152 |
// make sure we did not mix up the cases: |
|
153 |
assert(type != ciTypeFlow::StateVector::bottom_type(), ""); |
|
154 |
assert(type != ciTypeFlow::StateVector::top_type(), ""); |
|
155 |
assert(type != ciTypeFlow::StateVector::null_type(), ""); |
|
156 |
assert(type != ciTypeFlow::StateVector::long2_type(), ""); |
|
157 |
assert(type != ciTypeFlow::StateVector::double2_type(), ""); |
|
158 |
assert(!type->is_return_address(), ""); |
|
159 |
||
160 |
return Type::get_const_type(type); |
|
161 |
} |
|
162 |
} |
|
163 |
||
164 |
||
165 |
//------------------------------make------------------------------------------- |
|
166 |
// Create a simple Type, with default empty symbol sets. Then hashcons it |
|
167 |
// and look for an existing copy in the type dictionary. |
|
168 |
const Type *Type::make( enum TYPES t ) { |
|
169 |
return (new Type(t))->hashcons(); |
|
170 |
} |
|
769 | 171 |
|
1 | 172 |
//------------------------------cmp-------------------------------------------- |
173 |
int Type::cmp( const Type *const t1, const Type *const t2 ) { |
|
174 |
if( t1->_base != t2->_base ) |
|
175 |
return 1; // Missed badly |
|
176 |
assert(t1 != t2 || t1->eq(t2), "eq must be reflexive"); |
|
177 |
return !t1->eq(t2); // Return ZERO if equal |
|
178 |
} |
|
179 |
||
180 |
//------------------------------hash------------------------------------------- |
|
181 |
int Type::uhash( const Type *const t ) { |
|
182 |
return t->hash(); |
|
183 |
} |
|
184 |
||
185 |
//--------------------------Initialize_shared---------------------------------- |
|
186 |
void Type::Initialize_shared(Compile* current) { |
|
187 |
// This method does not need to be locked because the first system |
|
188 |
// compilations (stub compilations) occur serially. If they are |
|
189 |
// changed to proceed in parallel, then this section will need |
|
190 |
// locking. |
|
191 |
||
192 |
Arena* save = current->type_arena(); |
|
193 |
Arena* shared_type_arena = new Arena(); |
|
194 |
||
195 |
current->set_type_arena(shared_type_arena); |
|
196 |
_shared_type_dict = |
|
197 |
new (shared_type_arena) Dict( (CmpKey)Type::cmp, (Hash)Type::uhash, |
|
198 |
shared_type_arena, 128 ); |
|
199 |
current->set_type_dict(_shared_type_dict); |
|
200 |
||
201 |
// Make shared pre-built types. |
|
202 |
CONTROL = make(Control); // Control only |
|
203 |
TOP = make(Top); // No values in set |
|
204 |
MEMORY = make(Memory); // Abstract store only |
|
205 |
ABIO = make(Abio); // State-of-machine only |
|
206 |
RETURN_ADDRESS=make(Return_Address); |
|
207 |
FLOAT = make(FloatBot); // All floats |
|
208 |
DOUBLE = make(DoubleBot); // All doubles |
|
209 |
BOTTOM = make(Bottom); // Everything |
|
210 |
HALF = make(Half); // Placeholder half of doublewide type |
|
211 |
||
212 |
TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero) |
|
213 |
TypeF::ONE = TypeF::make(1.0); // Float 1 |
|
214 |
||
215 |
TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero) |
|
216 |
TypeD::ONE = TypeD::make(1.0); // Double 1 |
|
217 |
||
218 |
TypeInt::MINUS_1 = TypeInt::make(-1); // -1 |
|
219 |
TypeInt::ZERO = TypeInt::make( 0); // 0 |
|
220 |
TypeInt::ONE = TypeInt::make( 1); // 1 |
|
221 |
TypeInt::BOOL = TypeInt::make(0,1, WidenMin); // 0 or 1, FALSE or TRUE. |
|
222 |
TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes |
|
223 |
TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1 |
|
224 |
TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE |
|
225 |
TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO |
|
226 |
TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin); |
|
227 |
TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL |
|
228 |
TypeInt::BYTE = TypeInt::make(-128,127, WidenMin); // Bytes |
|
229 |
TypeInt::CHAR = TypeInt::make(0,65535, WidenMin); // Java chars |
|
230 |
TypeInt::SHORT = TypeInt::make(-32768,32767, WidenMin); // Java shorts |
|
231 |
TypeInt::POS = TypeInt::make(0,max_jint, WidenMin); // Non-neg values |
|
232 |
TypeInt::POS1 = TypeInt::make(1,max_jint, WidenMin); // Positive values |
|
233 |
TypeInt::INT = TypeInt::make(min_jint,max_jint, WidenMax); // 32-bit integers |
|
234 |
TypeInt::SYMINT = TypeInt::make(-max_jint,max_jint,WidenMin); // symmetric range |
|
235 |
// CmpL is overloaded both as the bytecode computation returning |
|
236 |
// a trinary (-1,0,+1) integer result AND as an efficient long |
|
237 |
// compare returning optimizer ideal-type flags. |
|
238 |
assert( TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" ); |
|
239 |
assert( TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" ); |
|
240 |
assert( TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" ); |
|
241 |
assert( TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" ); |
|
242 |
||
243 |
TypeLong::MINUS_1 = TypeLong::make(-1); // -1 |
|
244 |
TypeLong::ZERO = TypeLong::make( 0); // 0 |
|
245 |
TypeLong::ONE = TypeLong::make( 1); // 1 |
|
246 |
TypeLong::POS = TypeLong::make(0,max_jlong, WidenMin); // Non-neg values |
|
247 |
TypeLong::LONG = TypeLong::make(min_jlong,max_jlong,WidenMax); // 64-bit integers |
|
248 |
TypeLong::INT = TypeLong::make((jlong)min_jint,(jlong)max_jint,WidenMin); |
|
249 |
TypeLong::UINT = TypeLong::make(0,(jlong)max_juint,WidenMin); |
|
250 |
||
251 |
const Type **fboth =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); |
|
252 |
fboth[0] = Type::CONTROL; |
|
253 |
fboth[1] = Type::CONTROL; |
|
254 |
TypeTuple::IFBOTH = TypeTuple::make( 2, fboth ); |
|
255 |
||
256 |
const Type **ffalse =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); |
|
257 |
ffalse[0] = Type::CONTROL; |
|
258 |
ffalse[1] = Type::TOP; |
|
259 |
TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse ); |
|
260 |
||
261 |
const Type **fneither =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); |
|
262 |
fneither[0] = Type::TOP; |
|
263 |
fneither[1] = Type::TOP; |
|
264 |
TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither ); |
|
265 |
||
266 |
const Type **ftrue =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); |
|
267 |
ftrue[0] = Type::TOP; |
|
268 |
ftrue[1] = Type::CONTROL; |
|
269 |
TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue ); |
|
270 |
||
271 |
const Type **floop =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); |
|
272 |
floop[0] = Type::CONTROL; |
|
273 |
floop[1] = TypeInt::INT; |
|
274 |
TypeTuple::LOOPBODY = TypeTuple::make( 2, floop ); |
|
275 |
||
276 |
TypePtr::NULL_PTR= TypePtr::make( AnyPtr, TypePtr::Null, 0 ); |
|
277 |
TypePtr::NOTNULL = TypePtr::make( AnyPtr, TypePtr::NotNull, OffsetBot ); |
|
278 |
TypePtr::BOTTOM = TypePtr::make( AnyPtr, TypePtr::BotPTR, OffsetBot ); |
|
279 |
||
280 |
TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR ); |
|
281 |
TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull ); |
|
282 |
||
283 |
const Type **fmembar = TypeTuple::fields(0); |
|
284 |
TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar); |
|
285 |
||
286 |
const Type **fsc = (const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); |
|
287 |
fsc[0] = TypeInt::CC; |
|
288 |
fsc[1] = Type::MEMORY; |
|
289 |
TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc); |
|
290 |
||
291 |
TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass()); |
|
292 |
TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass()); |
|
293 |
TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass()); |
|
294 |
TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), |
|
295 |
false, 0, oopDesc::mark_offset_in_bytes()); |
|
296 |
TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), |
|
297 |
false, 0, oopDesc::klass_offset_in_bytes()); |
|
298 |
TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot); |
|
299 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
300 |
TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR ); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
301 |
TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM ); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
302 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
303 |
mreg2type[Op_Node] = Type::BOTTOM; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
304 |
mreg2type[Op_Set ] = 0; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
305 |
mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
306 |
mreg2type[Op_RegI] = TypeInt::INT; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
307 |
mreg2type[Op_RegP] = TypePtr::BOTTOM; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
308 |
mreg2type[Op_RegF] = Type::FLOAT; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
309 |
mreg2type[Op_RegD] = Type::DOUBLE; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
310 |
mreg2type[Op_RegL] = TypeLong::LONG; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
311 |
mreg2type[Op_RegFlags] = TypeInt::CC; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
312 |
|
1 | 313 |
TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), current->env()->Object_klass(), false, arrayOopDesc::length_offset_in_bytes()); |
589 | 314 |
|
315 |
TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); |
|
316 |
||
317 |
#ifdef _LP64 |
|
318 |
if (UseCompressedOops) { |
|
319 |
TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS; |
|
320 |
} else |
|
321 |
#endif |
|
322 |
{ |
|
323 |
// There is no shared klass for Object[]. See note in TypeAryPtr::klass(). |
|
324 |
TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); |
|
325 |
} |
|
1 | 326 |
TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot); |
327 |
TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot); |
|
328 |
TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot); |
|
329 |
TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot); |
|
330 |
TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot); |
|
331 |
TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot); |
|
332 |
TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot); |
|
333 |
||
589 | 334 |
// Nobody should ask _array_body_type[T_NARROWOOP]. Use NULL as assert. |
335 |
TypeAryPtr::_array_body_type[T_NARROWOOP] = NULL; |
|
1 | 336 |
TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS; |
589 | 337 |
TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays |
1 | 338 |
TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES; |
339 |
TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array |
|
340 |
TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS; |
|
341 |
TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS; |
|
342 |
TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS; |
|
343 |
TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS; |
|
344 |
TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS; |
|
345 |
TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES; |
|
346 |
||
347 |
TypeKlassPtr::OBJECT = TypeKlassPtr::make( TypePtr::NotNull, current->env()->Object_klass(), 0 ); |
|
348 |
TypeKlassPtr::OBJECT_OR_NULL = TypeKlassPtr::make( TypePtr::BotPTR, current->env()->Object_klass(), 0 ); |
|
349 |
||
350 |
const Type **fi2c = TypeTuple::fields(2); |
|
351 |
fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // methodOop |
|
352 |
fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer |
|
353 |
TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c); |
|
354 |
||
355 |
const Type **intpair = TypeTuple::fields(2); |
|
356 |
intpair[0] = TypeInt::INT; |
|
357 |
intpair[1] = TypeInt::INT; |
|
358 |
TypeTuple::INT_PAIR = TypeTuple::make(2, intpair); |
|
359 |
||
360 |
const Type **longpair = TypeTuple::fields(2); |
|
361 |
longpair[0] = TypeLong::LONG; |
|
362 |
longpair[1] = TypeLong::LONG; |
|
363 |
TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair); |
|
364 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
365 |
_const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM; |
1 | 366 |
_const_basic_type[T_BOOLEAN] = TypeInt::BOOL; |
367 |
_const_basic_type[T_CHAR] = TypeInt::CHAR; |
|
368 |
_const_basic_type[T_BYTE] = TypeInt::BYTE; |
|
369 |
_const_basic_type[T_SHORT] = TypeInt::SHORT; |
|
370 |
_const_basic_type[T_INT] = TypeInt::INT; |
|
371 |
_const_basic_type[T_LONG] = TypeLong::LONG; |
|
372 |
_const_basic_type[T_FLOAT] = Type::FLOAT; |
|
373 |
_const_basic_type[T_DOUBLE] = Type::DOUBLE; |
|
374 |
_const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM; |
|
375 |
_const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays |
|
376 |
_const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way |
|
377 |
_const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs |
|
378 |
_const_basic_type[T_CONFLICT]= Type::BOTTOM; // why not? |
|
379 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
380 |
_zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR; |
1 | 381 |
_zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0 |
382 |
_zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0 |
|
383 |
_zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0 |
|
384 |
_zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0 |
|
385 |
_zero_type[T_INT] = TypeInt::ZERO; |
|
386 |
_zero_type[T_LONG] = TypeLong::ZERO; |
|
387 |
_zero_type[T_FLOAT] = TypeF::ZERO; |
|
388 |
_zero_type[T_DOUBLE] = TypeD::ZERO; |
|
389 |
_zero_type[T_OBJECT] = TypePtr::NULL_PTR; |
|
390 |
_zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop |
|
391 |
_zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null |
|
392 |
_zero_type[T_VOID] = Type::TOP; // the only void value is no value at all |
|
393 |
||
394 |
// get_zero_type() should not happen for T_CONFLICT |
|
395 |
_zero_type[T_CONFLICT]= NULL; |
|
396 |
||
397 |
// Restore working type arena. |
|
398 |
current->set_type_arena(save); |
|
399 |
current->set_type_dict(NULL); |
|
400 |
} |
|
401 |
||
402 |
//------------------------------Initialize------------------------------------- |
|
403 |
void Type::Initialize(Compile* current) { |
|
404 |
assert(current->type_arena() != NULL, "must have created type arena"); |
|
405 |
||
406 |
if (_shared_type_dict == NULL) { |
|
407 |
Initialize_shared(current); |
|
408 |
} |
|
409 |
||
410 |
Arena* type_arena = current->type_arena(); |
|
411 |
||
412 |
// Create the hash-cons'ing dictionary with top-level storage allocation |
|
413 |
Dict *tdic = new (type_arena) Dict( (CmpKey)Type::cmp,(Hash)Type::uhash, type_arena, 128 ); |
|
414 |
current->set_type_dict(tdic); |
|
415 |
||
416 |
// Transfer the shared types. |
|
417 |
DictI i(_shared_type_dict); |
|
418 |
for( ; i.test(); ++i ) { |
|
419 |
Type* t = (Type*)i._value; |
|
420 |
tdic->Insert(t,t); // New Type, insert into Type table |
|
421 |
} |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
422 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
423 |
#ifdef ASSERT |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
424 |
verify_lastype(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
425 |
#endif |
1 | 426 |
} |
427 |
||
428 |
//------------------------------hashcons--------------------------------------- |
|
429 |
// Do the hash-cons trick. If the Type already exists in the type table, |
|
430 |
// delete the current Type and return the existing Type. Otherwise stick the |
|
431 |
// current Type in the Type table. |
|
432 |
const Type *Type::hashcons(void) { |
|
433 |
debug_only(base()); // Check the assertion in Type::base(). |
|
434 |
// Look up the Type in the Type dictionary |
|
435 |
Dict *tdic = type_dict(); |
|
436 |
Type* old = (Type*)(tdic->Insert(this, this, false)); |
|
437 |
if( old ) { // Pre-existing Type? |
|
438 |
if( old != this ) // Yes, this guy is not the pre-existing? |
|
439 |
delete this; // Yes, Nuke this guy |
|
440 |
assert( old->_dual, "" ); |
|
441 |
return old; // Return pre-existing |
|
442 |
} |
|
443 |
||
444 |
// Every type has a dual (to make my lattice symmetric). |
|
445 |
// Since we just discovered a new Type, compute its dual right now. |
|
446 |
assert( !_dual, "" ); // No dual yet |
|
447 |
_dual = xdual(); // Compute the dual |
|
448 |
if( cmp(this,_dual)==0 ) { // Handle self-symmetric |
|
449 |
_dual = this; |
|
450 |
return this; |
|
451 |
} |
|
452 |
assert( !_dual->_dual, "" ); // No reverse dual yet |
|
453 |
assert( !(*tdic)[_dual], "" ); // Dual not in type system either |
|
454 |
// New Type, insert into Type table |
|
455 |
tdic->Insert((void*)_dual,(void*)_dual); |
|
456 |
((Type*)_dual)->_dual = this; // Finish up being symmetric |
|
457 |
#ifdef ASSERT |
|
458 |
Type *dual_dual = (Type*)_dual->xdual(); |
|
459 |
assert( eq(dual_dual), "xdual(xdual()) should be identity" ); |
|
460 |
delete dual_dual; |
|
461 |
#endif |
|
462 |
return this; // Return new Type |
|
463 |
} |
|
464 |
||
465 |
//------------------------------eq--------------------------------------------- |
|
466 |
// Structural equality check for Type representations |
|
467 |
bool Type::eq( const Type * ) const { |
|
468 |
return true; // Nothing else can go wrong |
|
469 |
} |
|
470 |
||
471 |
//------------------------------hash------------------------------------------- |
|
472 |
// Type-specific hashing function. |
|
473 |
int Type::hash(void) const { |
|
474 |
return _base; |
|
475 |
} |
|
476 |
||
477 |
//------------------------------is_finite-------------------------------------- |
|
478 |
// Has a finite value |
|
479 |
bool Type::is_finite() const { |
|
480 |
return false; |
|
481 |
} |
|
482 |
||
483 |
//------------------------------is_nan----------------------------------------- |
|
484 |
// Is not a number (NaN) |
|
485 |
bool Type::is_nan() const { |
|
486 |
return false; |
|
487 |
} |
|
488 |
||
489 |
//------------------------------meet------------------------------------------- |
|
490 |
// Compute the MEET of two types. NOT virtual. It enforces that meet is |
|
491 |
// commutative and the lattice is symmetric. |
|
492 |
const Type *Type::meet( const Type *t ) const { |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
493 |
if (isa_narrowoop() && t->isa_narrowoop()) { |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
494 |
const Type* result = make_ptr()->meet(t->make_ptr()); |
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
495 |
return result->make_narrowoop(); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
496 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
497 |
|
1 | 498 |
const Type *mt = xmeet(t); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
499 |
if (isa_narrowoop() || t->isa_narrowoop()) return mt; |
1 | 500 |
#ifdef ASSERT |
501 |
assert( mt == t->xmeet(this), "meet not commutative" ); |
|
502 |
const Type* dual_join = mt->_dual; |
|
503 |
const Type *t2t = dual_join->xmeet(t->_dual); |
|
504 |
const Type *t2this = dual_join->xmeet( _dual); |
|
505 |
||
506 |
// Interface meet Oop is Not Symmetric: |
|
507 |
// Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull |
|
508 |
// Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull |
|
509 |
const TypeInstPtr* this_inst = this->isa_instptr(); |
|
510 |
const TypeInstPtr* t_inst = t->isa_instptr(); |
|
511 |
bool interface_vs_oop = false; |
|
512 |
if( this_inst && this_inst->is_loaded() && t_inst && t_inst->is_loaded() ) { |
|
513 |
bool this_interface = this_inst->klass()->is_interface(); |
|
514 |
bool t_interface = t_inst->klass()->is_interface(); |
|
515 |
interface_vs_oop = this_interface ^ t_interface; |
|
516 |
} |
|
769 | 517 |
|
518 |
if( !interface_vs_oop && (t2t != t->_dual || t2this != _dual) ) { |
|
1 | 519 |
tty->print_cr("=== Meet Not Symmetric ==="); |
520 |
tty->print("t = "); t->dump(); tty->cr(); |
|
521 |
tty->print("this= "); dump(); tty->cr(); |
|
522 |
tty->print("mt=(t meet this)= "); mt->dump(); tty->cr(); |
|
523 |
||
524 |
tty->print("t_dual= "); t->_dual->dump(); tty->cr(); |
|
525 |
tty->print("this_dual= "); _dual->dump(); tty->cr(); |
|
526 |
tty->print("mt_dual= "); mt->_dual->dump(); tty->cr(); |
|
527 |
||
528 |
tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr(); |
|
529 |
tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr(); |
|
530 |
||
531 |
fatal("meet not symmetric" ); |
|
532 |
} |
|
533 |
#endif |
|
534 |
return mt; |
|
535 |
} |
|
536 |
||
537 |
//------------------------------xmeet------------------------------------------ |
|
538 |
// Compute the MEET of two types. It returns a new Type object. |
|
539 |
const Type *Type::xmeet( const Type *t ) const { |
|
540 |
// Perform a fast test for common case; meeting the same types together. |
|
541 |
if( this == t ) return this; // Meeting same type-rep? |
|
542 |
||
543 |
// Meeting TOP with anything? |
|
544 |
if( _base == Top ) return t; |
|
545 |
||
546 |
// Meeting BOTTOM with anything? |
|
547 |
if( _base == Bottom ) return BOTTOM; |
|
548 |
||
549 |
// Current "this->_base" is one of: Bad, Multi, Control, Top, |
|
550 |
// Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype. |
|
551 |
switch (t->base()) { // Switch on original type |
|
552 |
||
553 |
// Cut in half the number of cases I must handle. Only need cases for when |
|
554 |
// the given enum "t->type" is less than or equal to the local enum "type". |
|
555 |
case FloatCon: |
|
556 |
case DoubleCon: |
|
557 |
case Int: |
|
558 |
case Long: |
|
559 |
return t->xmeet(this); |
|
560 |
||
561 |
case OopPtr: |
|
562 |
return t->xmeet(this); |
|
563 |
||
564 |
case InstPtr: |
|
565 |
return t->xmeet(this); |
|
566 |
||
567 |
case KlassPtr: |
|
568 |
return t->xmeet(this); |
|
569 |
||
570 |
case AryPtr: |
|
571 |
return t->xmeet(this); |
|
572 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
573 |
case NarrowOop: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
574 |
return t->xmeet(this); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
575 |
|
1 | 576 |
case Bad: // Type check |
577 |
default: // Bogus type not in lattice |
|
578 |
typerr(t); |
|
579 |
return Type::BOTTOM; |
|
580 |
||
581 |
case Bottom: // Ye Olde Default |
|
582 |
return t; |
|
583 |
||
584 |
case FloatTop: |
|
585 |
if( _base == FloatTop ) return this; |
|
586 |
case FloatBot: // Float |
|
587 |
if( _base == FloatBot || _base == FloatTop ) return FLOAT; |
|
588 |
if( _base == DoubleTop || _base == DoubleBot ) return Type::BOTTOM; |
|
589 |
typerr(t); |
|
590 |
return Type::BOTTOM; |
|
591 |
||
592 |
case DoubleTop: |
|
593 |
if( _base == DoubleTop ) return this; |
|
594 |
case DoubleBot: // Double |
|
595 |
if( _base == DoubleBot || _base == DoubleTop ) return DOUBLE; |
|
596 |
if( _base == FloatTop || _base == FloatBot ) return Type::BOTTOM; |
|
597 |
typerr(t); |
|
598 |
return Type::BOTTOM; |
|
599 |
||
600 |
// These next few cases must match exactly or it is a compile-time error. |
|
601 |
case Control: // Control of code |
|
602 |
case Abio: // State of world outside of program |
|
603 |
case Memory: |
|
604 |
if( _base == t->_base ) return this; |
|
605 |
typerr(t); |
|
606 |
return Type::BOTTOM; |
|
607 |
||
608 |
case Top: // Top of the lattice |
|
609 |
return this; |
|
610 |
} |
|
611 |
||
612 |
// The type is unchanged |
|
613 |
return this; |
|
614 |
} |
|
615 |
||
616 |
//-----------------------------filter------------------------------------------ |
|
617 |
const Type *Type::filter( const Type *kills ) const { |
|
618 |
const Type* ft = join(kills); |
|
619 |
if (ft->empty()) |
|
620 |
return Type::TOP; // Canonical empty value |
|
621 |
return ft; |
|
622 |
} |
|
623 |
||
624 |
//------------------------------xdual------------------------------------------ |
|
625 |
// Compute dual right now. |
|
626 |
const Type::TYPES Type::dual_type[Type::lastype] = { |
|
627 |
Bad, // Bad |
|
628 |
Control, // Control |
|
629 |
Bottom, // Top |
|
630 |
Bad, // Int - handled in v-call |
|
631 |
Bad, // Long - handled in v-call |
|
632 |
Half, // Half |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
633 |
Bad, // NarrowOop - handled in v-call |
1 | 634 |
|
635 |
Bad, // Tuple - handled in v-call |
|
636 |
Bad, // Array - handled in v-call |
|
637 |
||
638 |
Bad, // AnyPtr - handled in v-call |
|
639 |
Bad, // RawPtr - handled in v-call |
|
640 |
Bad, // OopPtr - handled in v-call |
|
641 |
Bad, // InstPtr - handled in v-call |
|
642 |
Bad, // AryPtr - handled in v-call |
|
643 |
Bad, // KlassPtr - handled in v-call |
|
644 |
||
645 |
Bad, // Function - handled in v-call |
|
646 |
Abio, // Abio |
|
647 |
Return_Address,// Return_Address |
|
648 |
Memory, // Memory |
|
649 |
FloatBot, // FloatTop |
|
650 |
FloatCon, // FloatCon |
|
651 |
FloatTop, // FloatBot |
|
652 |
DoubleBot, // DoubleTop |
|
653 |
DoubleCon, // DoubleCon |
|
654 |
DoubleTop, // DoubleBot |
|
655 |
Top // Bottom |
|
656 |
}; |
|
657 |
||
658 |
const Type *Type::xdual() const { |
|
659 |
// Note: the base() accessor asserts the sanity of _base. |
|
660 |
assert(dual_type[base()] != Bad, "implement with v-call"); |
|
661 |
return new Type(dual_type[_base]); |
|
662 |
} |
|
663 |
||
664 |
//------------------------------has_memory------------------------------------- |
|
665 |
bool Type::has_memory() const { |
|
666 |
Type::TYPES tx = base(); |
|
667 |
if (tx == Memory) return true; |
|
668 |
if (tx == Tuple) { |
|
669 |
const TypeTuple *t = is_tuple(); |
|
670 |
for (uint i=0; i < t->cnt(); i++) { |
|
671 |
tx = t->field_at(i)->base(); |
|
672 |
if (tx == Memory) return true; |
|
673 |
} |
|
674 |
} |
|
675 |
return false; |
|
676 |
} |
|
677 |
||
678 |
#ifndef PRODUCT |
|
679 |
//------------------------------dump2------------------------------------------ |
|
680 |
void Type::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
681 |
st->print(msg[_base]); |
|
682 |
} |
|
683 |
||
684 |
//------------------------------dump------------------------------------------- |
|
685 |
void Type::dump_on(outputStream *st) const { |
|
686 |
ResourceMark rm; |
|
687 |
Dict d(cmpkey,hashkey); // Stop recursive type dumping |
|
688 |
dump2(d,1, st); |
|
589 | 689 |
if (is_ptr_to_narrowoop()) { |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
690 |
st->print(" [narrow]"); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
691 |
} |
1 | 692 |
} |
693 |
||
694 |
//------------------------------data------------------------------------------- |
|
695 |
const char * const Type::msg[Type::lastype] = { |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
696 |
"bad","control","top","int:","long:","half", "narrowoop:", |
1 | 697 |
"tuple:", "aryptr", |
698 |
"anyptr:", "rawptr:", "java:", "inst:", "ary:", "klass:", |
|
699 |
"func", "abIO", "return_address", "memory", |
|
700 |
"float_top", "ftcon:", "float", |
|
701 |
"double_top", "dblcon:", "double", |
|
702 |
"bottom" |
|
703 |
}; |
|
704 |
#endif |
|
705 |
||
706 |
//------------------------------singleton-------------------------------------- |
|
707 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
708 |
// constants (Ldi nodes). Singletons are integer, float or double constants. |
|
709 |
bool Type::singleton(void) const { |
|
710 |
return _base == Top || _base == Half; |
|
711 |
} |
|
712 |
||
713 |
//------------------------------empty------------------------------------------ |
|
714 |
// TRUE if Type is a type with no values, FALSE otherwise. |
|
715 |
bool Type::empty(void) const { |
|
716 |
switch (_base) { |
|
717 |
case DoubleTop: |
|
718 |
case FloatTop: |
|
719 |
case Top: |
|
720 |
return true; |
|
721 |
||
722 |
case Half: |
|
723 |
case Abio: |
|
724 |
case Return_Address: |
|
725 |
case Memory: |
|
726 |
case Bottom: |
|
727 |
case FloatBot: |
|
728 |
case DoubleBot: |
|
729 |
return false; // never a singleton, therefore never empty |
|
730 |
} |
|
731 |
||
732 |
ShouldNotReachHere(); |
|
733 |
return false; |
|
734 |
} |
|
735 |
||
736 |
//------------------------------dump_stats------------------------------------- |
|
737 |
// Dump collected statistics to stderr |
|
738 |
#ifndef PRODUCT |
|
739 |
void Type::dump_stats() { |
|
740 |
tty->print("Types made: %d\n", type_dict()->Size()); |
|
741 |
} |
|
742 |
#endif |
|
743 |
||
744 |
//------------------------------typerr----------------------------------------- |
|
745 |
void Type::typerr( const Type *t ) const { |
|
746 |
#ifndef PRODUCT |
|
747 |
tty->print("\nError mixing types: "); |
|
748 |
dump(); |
|
749 |
tty->print(" and "); |
|
750 |
t->dump(); |
|
751 |
tty->print("\n"); |
|
752 |
#endif |
|
753 |
ShouldNotReachHere(); |
|
754 |
} |
|
755 |
||
756 |
//------------------------------isa_oop_ptr------------------------------------ |
|
757 |
// Return true if type is an oop pointer type. False for raw pointers. |
|
758 |
static char isa_oop_ptr_tbl[Type::lastype] = { |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
759 |
0,0,0,0,0,0,0/*narrowoop*/,0/*tuple*/, 0/*ary*/, |
1 | 760 |
0/*anyptr*/,0/*rawptr*/,1/*OopPtr*/,1/*InstPtr*/,1/*AryPtr*/,1/*KlassPtr*/, |
761 |
0/*func*/,0,0/*return_address*/,0, |
|
762 |
/*floats*/0,0,0, /*doubles*/0,0,0, |
|
763 |
0 |
|
764 |
}; |
|
765 |
bool Type::isa_oop_ptr() const { |
|
766 |
return isa_oop_ptr_tbl[_base] != 0; |
|
767 |
} |
|
768 |
||
769 |
//------------------------------dump_stats------------------------------------- |
|
770 |
// // Check that arrays match type enum |
|
771 |
#ifndef PRODUCT |
|
772 |
void Type::verify_lastype() { |
|
773 |
// Check that arrays match enumeration |
|
774 |
assert( Type::dual_type [Type::lastype - 1] == Type::Top, "did not update array"); |
|
775 |
assert( strcmp(Type::msg [Type::lastype - 1],"bottom") == 0, "did not update array"); |
|
776 |
// assert( PhiNode::tbl [Type::lastype - 1] == NULL, "did not update array"); |
|
777 |
assert( Matcher::base2reg[Type::lastype - 1] == 0, "did not update array"); |
|
778 |
assert( isa_oop_ptr_tbl [Type::lastype - 1] == (char)0, "did not update array"); |
|
779 |
} |
|
780 |
#endif |
|
781 |
||
782 |
//============================================================================= |
|
783 |
// Convenience common pre-built types. |
|
784 |
const TypeF *TypeF::ZERO; // Floating point zero |
|
785 |
const TypeF *TypeF::ONE; // Floating point one |
|
786 |
||
787 |
//------------------------------make------------------------------------------- |
|
788 |
// Create a float constant |
|
789 |
const TypeF *TypeF::make(float f) { |
|
790 |
return (TypeF*)(new TypeF(f))->hashcons(); |
|
791 |
} |
|
792 |
||
793 |
//------------------------------meet------------------------------------------- |
|
794 |
// Compute the MEET of two types. It returns a new Type object. |
|
795 |
const Type *TypeF::xmeet( const Type *t ) const { |
|
796 |
// Perform a fast test for common case; meeting the same types together. |
|
797 |
if( this == t ) return this; // Meeting same type-rep? |
|
798 |
||
799 |
// Current "this->_base" is FloatCon |
|
800 |
switch (t->base()) { // Switch on original type |
|
801 |
case AnyPtr: // Mixing with oops happens when javac |
|
802 |
case RawPtr: // reuses local variables |
|
803 |
case OopPtr: |
|
804 |
case InstPtr: |
|
805 |
case KlassPtr: |
|
806 |
case AryPtr: |
|
1055
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
807 |
case NarrowOop: |
1 | 808 |
case Int: |
809 |
case Long: |
|
810 |
case DoubleTop: |
|
811 |
case DoubleCon: |
|
812 |
case DoubleBot: |
|
813 |
case Bottom: // Ye Olde Default |
|
814 |
return Type::BOTTOM; |
|
815 |
||
816 |
case FloatBot: |
|
817 |
return t; |
|
818 |
||
819 |
default: // All else is a mistake |
|
820 |
typerr(t); |
|
821 |
||
822 |
case FloatCon: // Float-constant vs Float-constant? |
|
823 |
if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants? |
|
824 |
// must compare bitwise as positive zero, negative zero and NaN have |
|
825 |
// all the same representation in C++ |
|
826 |
return FLOAT; // Return generic float |
|
827 |
// Equal constants |
|
828 |
case Top: |
|
829 |
case FloatTop: |
|
830 |
break; // Return the float constant |
|
831 |
} |
|
832 |
return this; // Return the float constant |
|
833 |
} |
|
834 |
||
835 |
//------------------------------xdual------------------------------------------ |
|
836 |
// Dual: symmetric |
|
837 |
const Type *TypeF::xdual() const { |
|
838 |
return this; |
|
839 |
} |
|
840 |
||
841 |
//------------------------------eq--------------------------------------------- |
|
842 |
// Structural equality check for Type representations |
|
843 |
bool TypeF::eq( const Type *t ) const { |
|
844 |
if( g_isnan(_f) || |
|
845 |
g_isnan(t->getf()) ) { |
|
846 |
// One or both are NANs. If both are NANs return true, else false. |
|
847 |
return (g_isnan(_f) && g_isnan(t->getf())); |
|
848 |
} |
|
849 |
if (_f == t->getf()) { |
|
850 |
// (NaN is impossible at this point, since it is not equal even to itself) |
|
851 |
if (_f == 0.0) { |
|
852 |
// difference between positive and negative zero |
|
853 |
if (jint_cast(_f) != jint_cast(t->getf())) return false; |
|
854 |
} |
|
855 |
return true; |
|
856 |
} |
|
857 |
return false; |
|
858 |
} |
|
859 |
||
860 |
//------------------------------hash------------------------------------------- |
|
861 |
// Type-specific hashing function. |
|
862 |
int TypeF::hash(void) const { |
|
863 |
return *(int*)(&_f); |
|
864 |
} |
|
865 |
||
866 |
//------------------------------is_finite-------------------------------------- |
|
867 |
// Has a finite value |
|
868 |
bool TypeF::is_finite() const { |
|
869 |
return g_isfinite(getf()) != 0; |
|
870 |
} |
|
871 |
||
872 |
//------------------------------is_nan----------------------------------------- |
|
873 |
// Is not a number (NaN) |
|
874 |
bool TypeF::is_nan() const { |
|
875 |
return g_isnan(getf()) != 0; |
|
876 |
} |
|
877 |
||
878 |
//------------------------------dump2------------------------------------------ |
|
879 |
// Dump float constant Type |
|
880 |
#ifndef PRODUCT |
|
881 |
void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
882 |
Type::dump2(d,depth, st); |
|
883 |
st->print("%f", _f); |
|
884 |
} |
|
885 |
#endif |
|
886 |
||
887 |
//------------------------------singleton-------------------------------------- |
|
888 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
889 |
// constants (Ldi nodes). Singletons are integer, float or double constants |
|
890 |
// or a single symbol. |
|
891 |
bool TypeF::singleton(void) const { |
|
892 |
return true; // Always a singleton |
|
893 |
} |
|
894 |
||
895 |
bool TypeF::empty(void) const { |
|
896 |
return false; // always exactly a singleton |
|
897 |
} |
|
898 |
||
899 |
//============================================================================= |
|
900 |
// Convenience common pre-built types. |
|
901 |
const TypeD *TypeD::ZERO; // Floating point zero |
|
902 |
const TypeD *TypeD::ONE; // Floating point one |
|
903 |
||
904 |
//------------------------------make------------------------------------------- |
|
905 |
const TypeD *TypeD::make(double d) { |
|
906 |
return (TypeD*)(new TypeD(d))->hashcons(); |
|
907 |
} |
|
908 |
||
909 |
//------------------------------meet------------------------------------------- |
|
910 |
// Compute the MEET of two types. It returns a new Type object. |
|
911 |
const Type *TypeD::xmeet( const Type *t ) const { |
|
912 |
// Perform a fast test for common case; meeting the same types together. |
|
913 |
if( this == t ) return this; // Meeting same type-rep? |
|
914 |
||
915 |
// Current "this->_base" is DoubleCon |
|
916 |
switch (t->base()) { // Switch on original type |
|
917 |
case AnyPtr: // Mixing with oops happens when javac |
|
918 |
case RawPtr: // reuses local variables |
|
919 |
case OopPtr: |
|
920 |
case InstPtr: |
|
921 |
case KlassPtr: |
|
922 |
case AryPtr: |
|
609
14b769235815
6711083: 64bit JVM crashes with Internal Error (type.cpp:763) - ShouldNotReachHere() with enabled COOPs
never
parents:
589
diff
changeset
|
923 |
case NarrowOop: |
1 | 924 |
case Int: |
925 |
case Long: |
|
926 |
case FloatTop: |
|
927 |
case FloatCon: |
|
928 |
case FloatBot: |
|
929 |
case Bottom: // Ye Olde Default |
|
930 |
return Type::BOTTOM; |
|
931 |
||
932 |
case DoubleBot: |
|
933 |
return t; |
|
934 |
||
935 |
default: // All else is a mistake |
|
936 |
typerr(t); |
|
937 |
||
938 |
case DoubleCon: // Double-constant vs Double-constant? |
|
939 |
if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet) |
|
940 |
return DOUBLE; // Return generic double |
|
941 |
case Top: |
|
942 |
case DoubleTop: |
|
943 |
break; |
|
944 |
} |
|
945 |
return this; // Return the double constant |
|
946 |
} |
|
947 |
||
948 |
//------------------------------xdual------------------------------------------ |
|
949 |
// Dual: symmetric |
|
950 |
const Type *TypeD::xdual() const { |
|
951 |
return this; |
|
952 |
} |
|
953 |
||
954 |
//------------------------------eq--------------------------------------------- |
|
955 |
// Structural equality check for Type representations |
|
956 |
bool TypeD::eq( const Type *t ) const { |
|
957 |
if( g_isnan(_d) || |
|
958 |
g_isnan(t->getd()) ) { |
|
959 |
// One or both are NANs. If both are NANs return true, else false. |
|
960 |
return (g_isnan(_d) && g_isnan(t->getd())); |
|
961 |
} |
|
962 |
if (_d == t->getd()) { |
|
963 |
// (NaN is impossible at this point, since it is not equal even to itself) |
|
964 |
if (_d == 0.0) { |
|
965 |
// difference between positive and negative zero |
|
966 |
if (jlong_cast(_d) != jlong_cast(t->getd())) return false; |
|
967 |
} |
|
968 |
return true; |
|
969 |
} |
|
970 |
return false; |
|
971 |
} |
|
972 |
||
973 |
//------------------------------hash------------------------------------------- |
|
974 |
// Type-specific hashing function. |
|
975 |
int TypeD::hash(void) const { |
|
976 |
return *(int*)(&_d); |
|
977 |
} |
|
978 |
||
979 |
//------------------------------is_finite-------------------------------------- |
|
980 |
// Has a finite value |
|
981 |
bool TypeD::is_finite() const { |
|
982 |
return g_isfinite(getd()) != 0; |
|
983 |
} |
|
984 |
||
985 |
//------------------------------is_nan----------------------------------------- |
|
986 |
// Is not a number (NaN) |
|
987 |
bool TypeD::is_nan() const { |
|
988 |
return g_isnan(getd()) != 0; |
|
989 |
} |
|
990 |
||
991 |
//------------------------------dump2------------------------------------------ |
|
992 |
// Dump double constant Type |
|
993 |
#ifndef PRODUCT |
|
994 |
void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
995 |
Type::dump2(d,depth,st); |
|
996 |
st->print("%f", _d); |
|
997 |
} |
|
998 |
#endif |
|
999 |
||
1000 |
//------------------------------singleton-------------------------------------- |
|
1001 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
1002 |
// constants (Ldi nodes). Singletons are integer, float or double constants |
|
1003 |
// or a single symbol. |
|
1004 |
bool TypeD::singleton(void) const { |
|
1005 |
return true; // Always a singleton |
|
1006 |
} |
|
1007 |
||
1008 |
bool TypeD::empty(void) const { |
|
1009 |
return false; // always exactly a singleton |
|
1010 |
} |
|
1011 |
||
1012 |
//============================================================================= |
|
1013 |
// Convience common pre-built types. |
|
1014 |
const TypeInt *TypeInt::MINUS_1;// -1 |
|
1015 |
const TypeInt *TypeInt::ZERO; // 0 |
|
1016 |
const TypeInt *TypeInt::ONE; // 1 |
|
1017 |
const TypeInt *TypeInt::BOOL; // 0 or 1, FALSE or TRUE. |
|
1018 |
const TypeInt *TypeInt::CC; // -1,0 or 1, condition codes |
|
1019 |
const TypeInt *TypeInt::CC_LT; // [-1] == MINUS_1 |
|
1020 |
const TypeInt *TypeInt::CC_GT; // [1] == ONE |
|
1021 |
const TypeInt *TypeInt::CC_EQ; // [0] == ZERO |
|
1022 |
const TypeInt *TypeInt::CC_LE; // [-1,0] |
|
1023 |
const TypeInt *TypeInt::CC_GE; // [0,1] == BOOL (!) |
|
1024 |
const TypeInt *TypeInt::BYTE; // Bytes, -128 to 127 |
|
1025 |
const TypeInt *TypeInt::CHAR; // Java chars, 0-65535 |
|
1026 |
const TypeInt *TypeInt::SHORT; // Java shorts, -32768-32767 |
|
1027 |
const TypeInt *TypeInt::POS; // Positive 32-bit integers or zero |
|
1028 |
const TypeInt *TypeInt::POS1; // Positive 32-bit integers |
|
1029 |
const TypeInt *TypeInt::INT; // 32-bit integers |
|
1030 |
const TypeInt *TypeInt::SYMINT; // symmetric range [-max_jint..max_jint] |
|
1031 |
||
1032 |
//------------------------------TypeInt---------------------------------------- |
|
1033 |
TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) { |
|
1034 |
} |
|
1035 |
||
1036 |
//------------------------------make------------------------------------------- |
|
1037 |
const TypeInt *TypeInt::make( jint lo ) { |
|
1038 |
return (TypeInt*)(new TypeInt(lo,lo,WidenMin))->hashcons(); |
|
1039 |
} |
|
1040 |
||
1041 |
#define SMALLINT ((juint)3) // a value too insignificant to consider widening |
|
1042 |
||
1043 |
const TypeInt *TypeInt::make( jint lo, jint hi, int w ) { |
|
1044 |
// Certain normalizations keep us sane when comparing types. |
|
1045 |
// The 'SMALLINT' covers constants and also CC and its relatives. |
|
1046 |
assert(CC == NULL || (juint)(CC->_hi - CC->_lo) <= SMALLINT, "CC is truly small"); |
|
1047 |
if (lo <= hi) { |
|
1048 |
if ((juint)(hi - lo) <= SMALLINT) w = Type::WidenMin; |
|
1049 |
if ((juint)(hi - lo) >= max_juint) w = Type::WidenMax; // plain int |
|
1050 |
} |
|
1051 |
return (TypeInt*)(new TypeInt(lo,hi,w))->hashcons(); |
|
1052 |
} |
|
1053 |
||
1054 |
//------------------------------meet------------------------------------------- |
|
1055 |
// Compute the MEET of two types. It returns a new Type representation object |
|
1056 |
// with reference count equal to the number of Types pointing at it. |
|
1057 |
// Caller should wrap a Types around it. |
|
1058 |
const Type *TypeInt::xmeet( const Type *t ) const { |
|
1059 |
// Perform a fast test for common case; meeting the same types together. |
|
1060 |
if( this == t ) return this; // Meeting same type? |
|
1061 |
||
1062 |
// Currently "this->_base" is a TypeInt |
|
1063 |
switch (t->base()) { // Switch on original type |
|
1064 |
case AnyPtr: // Mixing with oops happens when javac |
|
1065 |
case RawPtr: // reuses local variables |
|
1066 |
case OopPtr: |
|
1067 |
case InstPtr: |
|
1068 |
case KlassPtr: |
|
1069 |
case AryPtr: |
|
609
14b769235815
6711083: 64bit JVM crashes with Internal Error (type.cpp:763) - ShouldNotReachHere() with enabled COOPs
never
parents:
589
diff
changeset
|
1070 |
case NarrowOop: |
1 | 1071 |
case Long: |
1072 |
case FloatTop: |
|
1073 |
case FloatCon: |
|
1074 |
case FloatBot: |
|
1075 |
case DoubleTop: |
|
1076 |
case DoubleCon: |
|
1077 |
case DoubleBot: |
|
1078 |
case Bottom: // Ye Olde Default |
|
1079 |
return Type::BOTTOM; |
|
1080 |
default: // All else is a mistake |
|
1081 |
typerr(t); |
|
1082 |
case Top: // No change |
|
1083 |
return this; |
|
1084 |
case Int: // Int vs Int? |
|
1085 |
break; |
|
1086 |
} |
|
1087 |
||
1088 |
// Expand covered set |
|
1089 |
const TypeInt *r = t->is_int(); |
|
1090 |
// (Avoid TypeInt::make, to avoid the argument normalizations it enforces.) |
|
1091 |
return (new TypeInt( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ))->hashcons(); |
|
1092 |
} |
|
1093 |
||
1094 |
//------------------------------xdual------------------------------------------ |
|
1095 |
// Dual: reverse hi & lo; flip widen |
|
1096 |
const Type *TypeInt::xdual() const { |
|
1097 |
return new TypeInt(_hi,_lo,WidenMax-_widen); |
|
1098 |
} |
|
1099 |
||
1100 |
//------------------------------widen------------------------------------------ |
|
1101 |
// Only happens for optimistic top-down optimizations. |
|
1102 |
const Type *TypeInt::widen( const Type *old ) const { |
|
1103 |
// Coming from TOP or such; no widening |
|
1104 |
if( old->base() != Int ) return this; |
|
1105 |
const TypeInt *ot = old->is_int(); |
|
1106 |
||
1107 |
// If new guy is equal to old guy, no widening |
|
1108 |
if( _lo == ot->_lo && _hi == ot->_hi ) |
|
1109 |
return old; |
|
1110 |
||
1111 |
// If new guy contains old, then we widened |
|
1112 |
if( _lo <= ot->_lo && _hi >= ot->_hi ) { |
|
1113 |
// New contains old |
|
1114 |
// If new guy is already wider than old, no widening |
|
1115 |
if( _widen > ot->_widen ) return this; |
|
1116 |
// If old guy was a constant, do not bother |
|
1117 |
if (ot->_lo == ot->_hi) return this; |
|
1118 |
// Now widen new guy. |
|
1119 |
// Check for widening too far |
|
1120 |
if (_widen == WidenMax) { |
|
1121 |
if (min_jint < _lo && _hi < max_jint) { |
|
1122 |
// If neither endpoint is extremal yet, push out the endpoint |
|
1123 |
// which is closer to its respective limit. |
|
1124 |
if (_lo >= 0 || // easy common case |
|
1125 |
(juint)(_lo - min_jint) >= (juint)(max_jint - _hi)) { |
|
1126 |
// Try to widen to an unsigned range type of 31 bits: |
|
1127 |
return make(_lo, max_jint, WidenMax); |
|
1128 |
} else { |
|
1129 |
return make(min_jint, _hi, WidenMax); |
|
1130 |
} |
|
1131 |
} |
|
1132 |
return TypeInt::INT; |
|
1133 |
} |
|
1134 |
// Returned widened new guy |
|
1135 |
return make(_lo,_hi,_widen+1); |
|
1136 |
} |
|
1137 |
||
1138 |
// If old guy contains new, then we probably widened too far & dropped to |
|
1139 |
// bottom. Return the wider fellow. |
|
1140 |
if ( ot->_lo <= _lo && ot->_hi >= _hi ) |
|
1141 |
return old; |
|
1142 |
||
1143 |
//fatal("Integer value range is not subset"); |
|
1144 |
//return this; |
|
1145 |
return TypeInt::INT; |
|
1146 |
} |
|
1147 |
||
1148 |
//------------------------------narrow--------------------------------------- |
|
1149 |
// Only happens for pessimistic optimizations. |
|
1150 |
const Type *TypeInt::narrow( const Type *old ) const { |
|
1151 |
if (_lo >= _hi) return this; // already narrow enough |
|
1152 |
if (old == NULL) return this; |
|
1153 |
const TypeInt* ot = old->isa_int(); |
|
1154 |
if (ot == NULL) return this; |
|
1155 |
jint olo = ot->_lo; |
|
1156 |
jint ohi = ot->_hi; |
|
1157 |
||
1158 |
// If new guy is equal to old guy, no narrowing |
|
1159 |
if (_lo == olo && _hi == ohi) return old; |
|
1160 |
||
1161 |
// If old guy was maximum range, allow the narrowing |
|
1162 |
if (olo == min_jint && ohi == max_jint) return this; |
|
1163 |
||
1164 |
if (_lo < olo || _hi > ohi) |
|
1165 |
return this; // doesn't narrow; pretty wierd |
|
1166 |
||
1167 |
// The new type narrows the old type, so look for a "death march". |
|
1168 |
// See comments on PhaseTransform::saturate. |
|
1169 |
juint nrange = _hi - _lo; |
|
1170 |
juint orange = ohi - olo; |
|
1171 |
if (nrange < max_juint - 1 && nrange > (orange >> 1) + (SMALLINT*2)) { |
|
1172 |
// Use the new type only if the range shrinks a lot. |
|
1173 |
// We do not want the optimizer computing 2^31 point by point. |
|
1174 |
return old; |
|
1175 |
} |
|
1176 |
||
1177 |
return this; |
|
1178 |
} |
|
1179 |
||
1180 |
//-----------------------------filter------------------------------------------ |
|
1181 |
const Type *TypeInt::filter( const Type *kills ) const { |
|
1182 |
const TypeInt* ft = join(kills)->isa_int(); |
|
1183 |
if (ft == NULL || ft->_lo > ft->_hi) |
|
1184 |
return Type::TOP; // Canonical empty value |
|
1185 |
if (ft->_widen < this->_widen) { |
|
1186 |
// Do not allow the value of kill->_widen to affect the outcome. |
|
1187 |
// The widen bits must be allowed to run freely through the graph. |
|
1188 |
ft = TypeInt::make(ft->_lo, ft->_hi, this->_widen); |
|
1189 |
} |
|
1190 |
return ft; |
|
1191 |
} |
|
1192 |
||
1193 |
//------------------------------eq--------------------------------------------- |
|
1194 |
// Structural equality check for Type representations |
|
1195 |
bool TypeInt::eq( const Type *t ) const { |
|
1196 |
const TypeInt *r = t->is_int(); // Handy access |
|
1197 |
return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen; |
|
1198 |
} |
|
1199 |
||
1200 |
//------------------------------hash------------------------------------------- |
|
1201 |
// Type-specific hashing function. |
|
1202 |
int TypeInt::hash(void) const { |
|
1203 |
return _lo+_hi+_widen+(int)Type::Int; |
|
1204 |
} |
|
1205 |
||
1206 |
//------------------------------is_finite-------------------------------------- |
|
1207 |
// Has a finite value |
|
1208 |
bool TypeInt::is_finite() const { |
|
1209 |
return true; |
|
1210 |
} |
|
1211 |
||
1212 |
//------------------------------dump2------------------------------------------ |
|
1213 |
// Dump TypeInt |
|
1214 |
#ifndef PRODUCT |
|
1215 |
static const char* intname(char* buf, jint n) { |
|
1216 |
if (n == min_jint) |
|
1217 |
return "min"; |
|
1218 |
else if (n < min_jint + 10000) |
|
1219 |
sprintf(buf, "min+" INT32_FORMAT, n - min_jint); |
|
1220 |
else if (n == max_jint) |
|
1221 |
return "max"; |
|
1222 |
else if (n > max_jint - 10000) |
|
1223 |
sprintf(buf, "max-" INT32_FORMAT, max_jint - n); |
|
1224 |
else |
|
1225 |
sprintf(buf, INT32_FORMAT, n); |
|
1226 |
return buf; |
|
1227 |
} |
|
1228 |
||
1229 |
void TypeInt::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
1230 |
char buf[40], buf2[40]; |
|
1231 |
if (_lo == min_jint && _hi == max_jint) |
|
1232 |
st->print("int"); |
|
1233 |
else if (is_con()) |
|
1234 |
st->print("int:%s", intname(buf, get_con())); |
|
1235 |
else if (_lo == BOOL->_lo && _hi == BOOL->_hi) |
|
1236 |
st->print("bool"); |
|
1237 |
else if (_lo == BYTE->_lo && _hi == BYTE->_hi) |
|
1238 |
st->print("byte"); |
|
1239 |
else if (_lo == CHAR->_lo && _hi == CHAR->_hi) |
|
1240 |
st->print("char"); |
|
1241 |
else if (_lo == SHORT->_lo && _hi == SHORT->_hi) |
|
1242 |
st->print("short"); |
|
1243 |
else if (_hi == max_jint) |
|
1244 |
st->print("int:>=%s", intname(buf, _lo)); |
|
1245 |
else if (_lo == min_jint) |
|
1246 |
st->print("int:<=%s", intname(buf, _hi)); |
|
1247 |
else |
|
1248 |
st->print("int:%s..%s", intname(buf, _lo), intname(buf2, _hi)); |
|
1249 |
||
1250 |
if (_widen != 0 && this != TypeInt::INT) |
|
1251 |
st->print(":%.*s", _widen, "wwww"); |
|
1252 |
} |
|
1253 |
#endif |
|
1254 |
||
1255 |
//------------------------------singleton-------------------------------------- |
|
1256 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
1257 |
// constants. |
|
1258 |
bool TypeInt::singleton(void) const { |
|
1259 |
return _lo >= _hi; |
|
1260 |
} |
|
1261 |
||
1262 |
bool TypeInt::empty(void) const { |
|
1263 |
return _lo > _hi; |
|
1264 |
} |
|
1265 |
||
1266 |
//============================================================================= |
|
1267 |
// Convenience common pre-built types. |
|
1268 |
const TypeLong *TypeLong::MINUS_1;// -1 |
|
1269 |
const TypeLong *TypeLong::ZERO; // 0 |
|
1270 |
const TypeLong *TypeLong::ONE; // 1 |
|
1271 |
const TypeLong *TypeLong::POS; // >=0 |
|
1272 |
const TypeLong *TypeLong::LONG; // 64-bit integers |
|
1273 |
const TypeLong *TypeLong::INT; // 32-bit subrange |
|
1274 |
const TypeLong *TypeLong::UINT; // 32-bit unsigned subrange |
|
1275 |
||
1276 |
//------------------------------TypeLong--------------------------------------- |
|
1277 |
TypeLong::TypeLong( jlong lo, jlong hi, int w ) : Type(Long), _lo(lo), _hi(hi), _widen(w) { |
|
1278 |
} |
|
1279 |
||
1280 |
//------------------------------make------------------------------------------- |
|
1281 |
const TypeLong *TypeLong::make( jlong lo ) { |
|
1282 |
return (TypeLong*)(new TypeLong(lo,lo,WidenMin))->hashcons(); |
|
1283 |
} |
|
1284 |
||
1285 |
const TypeLong *TypeLong::make( jlong lo, jlong hi, int w ) { |
|
1286 |
// Certain normalizations keep us sane when comparing types. |
|
1287 |
// The '1' covers constants. |
|
1288 |
if (lo <= hi) { |
|
1289 |
if ((julong)(hi - lo) <= SMALLINT) w = Type::WidenMin; |
|
1290 |
if ((julong)(hi - lo) >= max_julong) w = Type::WidenMax; // plain long |
|
1291 |
} |
|
1292 |
return (TypeLong*)(new TypeLong(lo,hi,w))->hashcons(); |
|
1293 |
} |
|
1294 |
||
1295 |
||
1296 |
//------------------------------meet------------------------------------------- |
|
1297 |
// Compute the MEET of two types. It returns a new Type representation object |
|
1298 |
// with reference count equal to the number of Types pointing at it. |
|
1299 |
// Caller should wrap a Types around it. |
|
1300 |
const Type *TypeLong::xmeet( const Type *t ) const { |
|
1301 |
// Perform a fast test for common case; meeting the same types together. |
|
1302 |
if( this == t ) return this; // Meeting same type? |
|
1303 |
||
1304 |
// Currently "this->_base" is a TypeLong |
|
1305 |
switch (t->base()) { // Switch on original type |
|
1306 |
case AnyPtr: // Mixing with oops happens when javac |
|
1307 |
case RawPtr: // reuses local variables |
|
1308 |
case OopPtr: |
|
1309 |
case InstPtr: |
|
1310 |
case KlassPtr: |
|
1311 |
case AryPtr: |
|
609
14b769235815
6711083: 64bit JVM crashes with Internal Error (type.cpp:763) - ShouldNotReachHere() with enabled COOPs
never
parents:
589
diff
changeset
|
1312 |
case NarrowOop: |
1 | 1313 |
case Int: |
1314 |
case FloatTop: |
|
1315 |
case FloatCon: |
|
1316 |
case FloatBot: |
|
1317 |
case DoubleTop: |
|
1318 |
case DoubleCon: |
|
1319 |
case DoubleBot: |
|
1320 |
case Bottom: // Ye Olde Default |
|
1321 |
return Type::BOTTOM; |
|
1322 |
default: // All else is a mistake |
|
1323 |
typerr(t); |
|
1324 |
case Top: // No change |
|
1325 |
return this; |
|
1326 |
case Long: // Long vs Long? |
|
1327 |
break; |
|
1328 |
} |
|
1329 |
||
1330 |
// Expand covered set |
|
1331 |
const TypeLong *r = t->is_long(); // Turn into a TypeLong |
|
1332 |
// (Avoid TypeLong::make, to avoid the argument normalizations it enforces.) |
|
1333 |
return (new TypeLong( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ))->hashcons(); |
|
1334 |
} |
|
1335 |
||
1336 |
//------------------------------xdual------------------------------------------ |
|
1337 |
// Dual: reverse hi & lo; flip widen |
|
1338 |
const Type *TypeLong::xdual() const { |
|
1339 |
return new TypeLong(_hi,_lo,WidenMax-_widen); |
|
1340 |
} |
|
1341 |
||
1342 |
//------------------------------widen------------------------------------------ |
|
1343 |
// Only happens for optimistic top-down optimizations. |
|
1344 |
const Type *TypeLong::widen( const Type *old ) const { |
|
1345 |
// Coming from TOP or such; no widening |
|
1346 |
if( old->base() != Long ) return this; |
|
1347 |
const TypeLong *ot = old->is_long(); |
|
1348 |
||
1349 |
// If new guy is equal to old guy, no widening |
|
1350 |
if( _lo == ot->_lo && _hi == ot->_hi ) |
|
1351 |
return old; |
|
1352 |
||
1353 |
// If new guy contains old, then we widened |
|
1354 |
if( _lo <= ot->_lo && _hi >= ot->_hi ) { |
|
1355 |
// New contains old |
|
1356 |
// If new guy is already wider than old, no widening |
|
1357 |
if( _widen > ot->_widen ) return this; |
|
1358 |
// If old guy was a constant, do not bother |
|
1359 |
if (ot->_lo == ot->_hi) return this; |
|
1360 |
// Now widen new guy. |
|
1361 |
// Check for widening too far |
|
1362 |
if (_widen == WidenMax) { |
|
1363 |
if (min_jlong < _lo && _hi < max_jlong) { |
|
1364 |
// If neither endpoint is extremal yet, push out the endpoint |
|
1365 |
// which is closer to its respective limit. |
|
1366 |
if (_lo >= 0 || // easy common case |
|
1367 |
(julong)(_lo - min_jlong) >= (julong)(max_jlong - _hi)) { |
|
1368 |
// Try to widen to an unsigned range type of 32/63 bits: |
|
1369 |
if (_hi < max_juint) |
|
1370 |
return make(_lo, max_juint, WidenMax); |
|
1371 |
else |
|
1372 |
return make(_lo, max_jlong, WidenMax); |
|
1373 |
} else { |
|
1374 |
return make(min_jlong, _hi, WidenMax); |
|
1375 |
} |
|
1376 |
} |
|
1377 |
return TypeLong::LONG; |
|
1378 |
} |
|
1379 |
// Returned widened new guy |
|
1380 |
return make(_lo,_hi,_widen+1); |
|
1381 |
} |
|
1382 |
||
1383 |
// If old guy contains new, then we probably widened too far & dropped to |
|
1384 |
// bottom. Return the wider fellow. |
|
1385 |
if ( ot->_lo <= _lo && ot->_hi >= _hi ) |
|
1386 |
return old; |
|
1387 |
||
1388 |
// fatal("Long value range is not subset"); |
|
1389 |
// return this; |
|
1390 |
return TypeLong::LONG; |
|
1391 |
} |
|
1392 |
||
1393 |
//------------------------------narrow---------------------------------------- |
|
1394 |
// Only happens for pessimistic optimizations. |
|
1395 |
const Type *TypeLong::narrow( const Type *old ) const { |
|
1396 |
if (_lo >= _hi) return this; // already narrow enough |
|
1397 |
if (old == NULL) return this; |
|
1398 |
const TypeLong* ot = old->isa_long(); |
|
1399 |
if (ot == NULL) return this; |
|
1400 |
jlong olo = ot->_lo; |
|
1401 |
jlong ohi = ot->_hi; |
|
1402 |
||
1403 |
// If new guy is equal to old guy, no narrowing |
|
1404 |
if (_lo == olo && _hi == ohi) return old; |
|
1405 |
||
1406 |
// If old guy was maximum range, allow the narrowing |
|
1407 |
if (olo == min_jlong && ohi == max_jlong) return this; |
|
1408 |
||
1409 |
if (_lo < olo || _hi > ohi) |
|
1410 |
return this; // doesn't narrow; pretty wierd |
|
1411 |
||
1412 |
// The new type narrows the old type, so look for a "death march". |
|
1413 |
// See comments on PhaseTransform::saturate. |
|
1414 |
julong nrange = _hi - _lo; |
|
1415 |
julong orange = ohi - olo; |
|
1416 |
if (nrange < max_julong - 1 && nrange > (orange >> 1) + (SMALLINT*2)) { |
|
1417 |
// Use the new type only if the range shrinks a lot. |
|
1418 |
// We do not want the optimizer computing 2^31 point by point. |
|
1419 |
return old; |
|
1420 |
} |
|
1421 |
||
1422 |
return this; |
|
1423 |
} |
|
1424 |
||
1425 |
//-----------------------------filter------------------------------------------ |
|
1426 |
const Type *TypeLong::filter( const Type *kills ) const { |
|
1427 |
const TypeLong* ft = join(kills)->isa_long(); |
|
1428 |
if (ft == NULL || ft->_lo > ft->_hi) |
|
1429 |
return Type::TOP; // Canonical empty value |
|
1430 |
if (ft->_widen < this->_widen) { |
|
1431 |
// Do not allow the value of kill->_widen to affect the outcome. |
|
1432 |
// The widen bits must be allowed to run freely through the graph. |
|
1433 |
ft = TypeLong::make(ft->_lo, ft->_hi, this->_widen); |
|
1434 |
} |
|
1435 |
return ft; |
|
1436 |
} |
|
1437 |
||
1438 |
//------------------------------eq--------------------------------------------- |
|
1439 |
// Structural equality check for Type representations |
|
1440 |
bool TypeLong::eq( const Type *t ) const { |
|
1441 |
const TypeLong *r = t->is_long(); // Handy access |
|
1442 |
return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen; |
|
1443 |
} |
|
1444 |
||
1445 |
//------------------------------hash------------------------------------------- |
|
1446 |
// Type-specific hashing function. |
|
1447 |
int TypeLong::hash(void) const { |
|
1448 |
return (int)(_lo+_hi+_widen+(int)Type::Long); |
|
1449 |
} |
|
1450 |
||
1451 |
//------------------------------is_finite-------------------------------------- |
|
1452 |
// Has a finite value |
|
1453 |
bool TypeLong::is_finite() const { |
|
1454 |
return true; |
|
1455 |
} |
|
1456 |
||
1457 |
//------------------------------dump2------------------------------------------ |
|
1458 |
// Dump TypeLong |
|
1459 |
#ifndef PRODUCT |
|
1460 |
static const char* longnamenear(jlong x, const char* xname, char* buf, jlong n) { |
|
1461 |
if (n > x) { |
|
1462 |
if (n >= x + 10000) return NULL; |
|
1463 |
sprintf(buf, "%s+" INT64_FORMAT, xname, n - x); |
|
1464 |
} else if (n < x) { |
|
1465 |
if (n <= x - 10000) return NULL; |
|
1466 |
sprintf(buf, "%s-" INT64_FORMAT, xname, x - n); |
|
1467 |
} else { |
|
1468 |
return xname; |
|
1469 |
} |
|
1470 |
return buf; |
|
1471 |
} |
|
1472 |
||
1473 |
static const char* longname(char* buf, jlong n) { |
|
1474 |
const char* str; |
|
1475 |
if (n == min_jlong) |
|
1476 |
return "min"; |
|
1477 |
else if (n < min_jlong + 10000) |
|
1478 |
sprintf(buf, "min+" INT64_FORMAT, n - min_jlong); |
|
1479 |
else if (n == max_jlong) |
|
1480 |
return "max"; |
|
1481 |
else if (n > max_jlong - 10000) |
|
1482 |
sprintf(buf, "max-" INT64_FORMAT, max_jlong - n); |
|
1483 |
else if ((str = longnamenear(max_juint, "maxuint", buf, n)) != NULL) |
|
1484 |
return str; |
|
1485 |
else if ((str = longnamenear(max_jint, "maxint", buf, n)) != NULL) |
|
1486 |
return str; |
|
1487 |
else if ((str = longnamenear(min_jint, "minint", buf, n)) != NULL) |
|
1488 |
return str; |
|
1489 |
else |
|
1490 |
sprintf(buf, INT64_FORMAT, n); |
|
1491 |
return buf; |
|
1492 |
} |
|
1493 |
||
1494 |
void TypeLong::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
1495 |
char buf[80], buf2[80]; |
|
1496 |
if (_lo == min_jlong && _hi == max_jlong) |
|
1497 |
st->print("long"); |
|
1498 |
else if (is_con()) |
|
1499 |
st->print("long:%s", longname(buf, get_con())); |
|
1500 |
else if (_hi == max_jlong) |
|
1501 |
st->print("long:>=%s", longname(buf, _lo)); |
|
1502 |
else if (_lo == min_jlong) |
|
1503 |
st->print("long:<=%s", longname(buf, _hi)); |
|
1504 |
else |
|
1505 |
st->print("long:%s..%s", longname(buf, _lo), longname(buf2, _hi)); |
|
1506 |
||
1507 |
if (_widen != 0 && this != TypeLong::LONG) |
|
1508 |
st->print(":%.*s", _widen, "wwww"); |
|
1509 |
} |
|
1510 |
#endif |
|
1511 |
||
1512 |
//------------------------------singleton-------------------------------------- |
|
1513 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
1514 |
// constants |
|
1515 |
bool TypeLong::singleton(void) const { |
|
1516 |
return _lo >= _hi; |
|
1517 |
} |
|
1518 |
||
1519 |
bool TypeLong::empty(void) const { |
|
1520 |
return _lo > _hi; |
|
1521 |
} |
|
1522 |
||
1523 |
//============================================================================= |
|
1524 |
// Convenience common pre-built types. |
|
1525 |
const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable |
|
1526 |
const TypeTuple *TypeTuple::IFFALSE; |
|
1527 |
const TypeTuple *TypeTuple::IFTRUE; |
|
1528 |
const TypeTuple *TypeTuple::IFNEITHER; |
|
1529 |
const TypeTuple *TypeTuple::LOOPBODY; |
|
1530 |
const TypeTuple *TypeTuple::MEMBAR; |
|
1531 |
const TypeTuple *TypeTuple::STORECONDITIONAL; |
|
1532 |
const TypeTuple *TypeTuple::START_I2C; |
|
1533 |
const TypeTuple *TypeTuple::INT_PAIR; |
|
1534 |
const TypeTuple *TypeTuple::LONG_PAIR; |
|
1535 |
||
1536 |
||
1537 |
//------------------------------make------------------------------------------- |
|
1538 |
// Make a TypeTuple from the range of a method signature |
|
1539 |
const TypeTuple *TypeTuple::make_range(ciSignature* sig) { |
|
1540 |
ciType* return_type = sig->return_type(); |
|
1541 |
uint total_fields = TypeFunc::Parms + return_type->size(); |
|
1542 |
const Type **field_array = fields(total_fields); |
|
1543 |
switch (return_type->basic_type()) { |
|
1544 |
case T_LONG: |
|
1545 |
field_array[TypeFunc::Parms] = TypeLong::LONG; |
|
1546 |
field_array[TypeFunc::Parms+1] = Type::HALF; |
|
1547 |
break; |
|
1548 |
case T_DOUBLE: |
|
1549 |
field_array[TypeFunc::Parms] = Type::DOUBLE; |
|
1550 |
field_array[TypeFunc::Parms+1] = Type::HALF; |
|
1551 |
break; |
|
1552 |
case T_OBJECT: |
|
1553 |
case T_ARRAY: |
|
1554 |
case T_BOOLEAN: |
|
1555 |
case T_CHAR: |
|
1556 |
case T_FLOAT: |
|
1557 |
case T_BYTE: |
|
1558 |
case T_SHORT: |
|
1559 |
case T_INT: |
|
1560 |
field_array[TypeFunc::Parms] = get_const_type(return_type); |
|
1561 |
break; |
|
1562 |
case T_VOID: |
|
1563 |
break; |
|
1564 |
default: |
|
1565 |
ShouldNotReachHere(); |
|
1566 |
} |
|
1567 |
return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons(); |
|
1568 |
} |
|
1569 |
||
1570 |
// Make a TypeTuple from the domain of a method signature |
|
1571 |
const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig) { |
|
1572 |
uint total_fields = TypeFunc::Parms + sig->size(); |
|
1573 |
||
1574 |
uint pos = TypeFunc::Parms; |
|
1575 |
const Type **field_array; |
|
1576 |
if (recv != NULL) { |
|
1577 |
total_fields++; |
|
1578 |
field_array = fields(total_fields); |
|
1579 |
// Use get_const_type here because it respects UseUniqueSubclasses: |
|
1580 |
field_array[pos++] = get_const_type(recv)->join(TypePtr::NOTNULL); |
|
1581 |
} else { |
|
1582 |
field_array = fields(total_fields); |
|
1583 |
} |
|
1584 |
||
1585 |
int i = 0; |
|
1586 |
while (pos < total_fields) { |
|
1587 |
ciType* type = sig->type_at(i); |
|
1588 |
||
1589 |
switch (type->basic_type()) { |
|
1590 |
case T_LONG: |
|
1591 |
field_array[pos++] = TypeLong::LONG; |
|
1592 |
field_array[pos++] = Type::HALF; |
|
1593 |
break; |
|
1594 |
case T_DOUBLE: |
|
1595 |
field_array[pos++] = Type::DOUBLE; |
|
1596 |
field_array[pos++] = Type::HALF; |
|
1597 |
break; |
|
1598 |
case T_OBJECT: |
|
1599 |
case T_ARRAY: |
|
1600 |
case T_BOOLEAN: |
|
1601 |
case T_CHAR: |
|
1602 |
case T_FLOAT: |
|
1603 |
case T_BYTE: |
|
1604 |
case T_SHORT: |
|
1605 |
case T_INT: |
|
1606 |
field_array[pos++] = get_const_type(type); |
|
1607 |
break; |
|
1608 |
default: |
|
1609 |
ShouldNotReachHere(); |
|
1610 |
} |
|
1611 |
i++; |
|
1612 |
} |
|
1613 |
return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons(); |
|
1614 |
} |
|
1615 |
||
1616 |
const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) { |
|
1617 |
return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons(); |
|
1618 |
} |
|
1619 |
||
1620 |
//------------------------------fields----------------------------------------- |
|
1621 |
// Subroutine call type with space allocated for argument types |
|
1622 |
const Type **TypeTuple::fields( uint arg_cnt ) { |
|
1623 |
const Type **flds = (const Type **)(Compile::current()->type_arena()->Amalloc_4((TypeFunc::Parms+arg_cnt)*sizeof(Type*) )); |
|
1624 |
flds[TypeFunc::Control ] = Type::CONTROL; |
|
1625 |
flds[TypeFunc::I_O ] = Type::ABIO; |
|
1626 |
flds[TypeFunc::Memory ] = Type::MEMORY; |
|
1627 |
flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM; |
|
1628 |
flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS; |
|
1629 |
||
1630 |
return flds; |
|
1631 |
} |
|
1632 |
||
1633 |
//------------------------------meet------------------------------------------- |
|
1634 |
// Compute the MEET of two types. It returns a new Type object. |
|
1635 |
const Type *TypeTuple::xmeet( const Type *t ) const { |
|
1636 |
// Perform a fast test for common case; meeting the same types together. |
|
1637 |
if( this == t ) return this; // Meeting same type-rep? |
|
1638 |
||
1639 |
// Current "this->_base" is Tuple |
|
1640 |
switch (t->base()) { // switch on original type |
|
1641 |
||
1642 |
case Bottom: // Ye Olde Default |
|
1643 |
return t; |
|
1644 |
||
1645 |
default: // All else is a mistake |
|
1646 |
typerr(t); |
|
1647 |
||
1648 |
case Tuple: { // Meeting 2 signatures? |
|
1649 |
const TypeTuple *x = t->is_tuple(); |
|
1650 |
assert( _cnt == x->_cnt, "" ); |
|
1651 |
const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) )); |
|
1652 |
for( uint i=0; i<_cnt; i++ ) |
|
1653 |
fields[i] = field_at(i)->xmeet( x->field_at(i) ); |
|
1654 |
return TypeTuple::make(_cnt,fields); |
|
1655 |
} |
|
1656 |
case Top: |
|
1657 |
break; |
|
1658 |
} |
|
1659 |
return this; // Return the double constant |
|
1660 |
} |
|
1661 |
||
1662 |
//------------------------------xdual------------------------------------------ |
|
1663 |
// Dual: compute field-by-field dual |
|
1664 |
const Type *TypeTuple::xdual() const { |
|
1665 |
const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) )); |
|
1666 |
for( uint i=0; i<_cnt; i++ ) |
|
1667 |
fields[i] = _fields[i]->dual(); |
|
1668 |
return new TypeTuple(_cnt,fields); |
|
1669 |
} |
|
1670 |
||
1671 |
//------------------------------eq--------------------------------------------- |
|
1672 |
// Structural equality check for Type representations |
|
1673 |
bool TypeTuple::eq( const Type *t ) const { |
|
1674 |
const TypeTuple *s = (const TypeTuple *)t; |
|
1675 |
if (_cnt != s->_cnt) return false; // Unequal field counts |
|
1676 |
for (uint i = 0; i < _cnt; i++) |
|
1677 |
if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION! |
|
1678 |
return false; // Missed |
|
1679 |
return true; |
|
1680 |
} |
|
1681 |
||
1682 |
//------------------------------hash------------------------------------------- |
|
1683 |
// Type-specific hashing function. |
|
1684 |
int TypeTuple::hash(void) const { |
|
1685 |
intptr_t sum = _cnt; |
|
1686 |
for( uint i=0; i<_cnt; i++ ) |
|
1687 |
sum += (intptr_t)_fields[i]; // Hash on pointers directly |
|
1688 |
return sum; |
|
1689 |
} |
|
1690 |
||
1691 |
//------------------------------dump2------------------------------------------ |
|
1692 |
// Dump signature Type |
|
1693 |
#ifndef PRODUCT |
|
1694 |
void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
1695 |
st->print("{"); |
|
1696 |
if( !depth || d[this] ) { // Check for recursive print |
|
1697 |
st->print("...}"); |
|
1698 |
return; |
|
1699 |
} |
|
1700 |
d.Insert((void*)this, (void*)this); // Stop recursion |
|
1701 |
if( _cnt ) { |
|
1702 |
uint i; |
|
1703 |
for( i=0; i<_cnt-1; i++ ) { |
|
1704 |
st->print("%d:", i); |
|
1705 |
_fields[i]->dump2(d, depth-1, st); |
|
1706 |
st->print(", "); |
|
1707 |
} |
|
1708 |
st->print("%d:", i); |
|
1709 |
_fields[i]->dump2(d, depth-1, st); |
|
1710 |
} |
|
1711 |
st->print("}"); |
|
1712 |
} |
|
1713 |
#endif |
|
1714 |
||
1715 |
//------------------------------singleton-------------------------------------- |
|
1716 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
1717 |
// constants (Ldi nodes). Singletons are integer, float or double constants |
|
1718 |
// or a single symbol. |
|
1719 |
bool TypeTuple::singleton(void) const { |
|
1720 |
return false; // Never a singleton |
|
1721 |
} |
|
1722 |
||
1723 |
bool TypeTuple::empty(void) const { |
|
1724 |
for( uint i=0; i<_cnt; i++ ) { |
|
1725 |
if (_fields[i]->empty()) return true; |
|
1726 |
} |
|
1727 |
return false; |
|
1728 |
} |
|
1729 |
||
1730 |
//============================================================================= |
|
1731 |
// Convenience common pre-built types. |
|
1732 |
||
1733 |
inline const TypeInt* normalize_array_size(const TypeInt* size) { |
|
1734 |
// Certain normalizations keep us sane when comparing types. |
|
1735 |
// We do not want arrayOop variables to differ only by the wideness |
|
1736 |
// of their index types. Pick minimum wideness, since that is the |
|
1737 |
// forced wideness of small ranges anyway. |
|
1738 |
if (size->_widen != Type::WidenMin) |
|
1739 |
return TypeInt::make(size->_lo, size->_hi, Type::WidenMin); |
|
1740 |
else |
|
1741 |
return size; |
|
1742 |
} |
|
1743 |
||
1744 |
//------------------------------make------------------------------------------- |
|
1745 |
const TypeAry *TypeAry::make( const Type *elem, const TypeInt *size) { |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1746 |
if (UseCompressedOops && elem->isa_oopptr()) { |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1747 |
elem = elem->make_narrowoop(); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1748 |
} |
1 | 1749 |
size = normalize_array_size(size); |
1750 |
return (TypeAry*)(new TypeAry(elem,size))->hashcons(); |
|
1751 |
} |
|
1752 |
||
1753 |
//------------------------------meet------------------------------------------- |
|
1754 |
// Compute the MEET of two types. It returns a new Type object. |
|
1755 |
const Type *TypeAry::xmeet( const Type *t ) const { |
|
1756 |
// Perform a fast test for common case; meeting the same types together. |
|
1757 |
if( this == t ) return this; // Meeting same type-rep? |
|
1758 |
||
1759 |
// Current "this->_base" is Ary |
|
1760 |
switch (t->base()) { // switch on original type |
|
1761 |
||
1762 |
case Bottom: // Ye Olde Default |
|
1763 |
return t; |
|
1764 |
||
1765 |
default: // All else is a mistake |
|
1766 |
typerr(t); |
|
1767 |
||
1768 |
case Array: { // Meeting 2 arrays? |
|
1769 |
const TypeAry *a = t->is_ary(); |
|
1770 |
return TypeAry::make(_elem->meet(a->_elem), |
|
1771 |
_size->xmeet(a->_size)->is_int()); |
|
1772 |
} |
|
1773 |
case Top: |
|
1774 |
break; |
|
1775 |
} |
|
1776 |
return this; // Return the double constant |
|
1777 |
} |
|
1778 |
||
1779 |
//------------------------------xdual------------------------------------------ |
|
1780 |
// Dual: compute field-by-field dual |
|
1781 |
const Type *TypeAry::xdual() const { |
|
1782 |
const TypeInt* size_dual = _size->dual()->is_int(); |
|
1783 |
size_dual = normalize_array_size(size_dual); |
|
1784 |
return new TypeAry( _elem->dual(), size_dual); |
|
1785 |
} |
|
1786 |
||
1787 |
//------------------------------eq--------------------------------------------- |
|
1788 |
// Structural equality check for Type representations |
|
1789 |
bool TypeAry::eq( const Type *t ) const { |
|
1790 |
const TypeAry *a = (const TypeAry*)t; |
|
1791 |
return _elem == a->_elem && |
|
1792 |
_size == a->_size; |
|
1793 |
} |
|
1794 |
||
1795 |
//------------------------------hash------------------------------------------- |
|
1796 |
// Type-specific hashing function. |
|
1797 |
int TypeAry::hash(void) const { |
|
1798 |
return (intptr_t)_elem + (intptr_t)_size; |
|
1799 |
} |
|
1800 |
||
1801 |
//------------------------------dump2------------------------------------------ |
|
1802 |
#ifndef PRODUCT |
|
1803 |
void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
1804 |
_elem->dump2(d, depth, st); |
|
1805 |
st->print("["); |
|
1806 |
_size->dump2(d, depth, st); |
|
1807 |
st->print("]"); |
|
1808 |
} |
|
1809 |
#endif |
|
1810 |
||
1811 |
//------------------------------singleton-------------------------------------- |
|
1812 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
1813 |
// constants (Ldi nodes). Singletons are integer, float or double constants |
|
1814 |
// or a single symbol. |
|
1815 |
bool TypeAry::singleton(void) const { |
|
1816 |
return false; // Never a singleton |
|
1817 |
} |
|
1818 |
||
1819 |
bool TypeAry::empty(void) const { |
|
1820 |
return _elem->empty() || _size->empty(); |
|
1821 |
} |
|
1822 |
||
1823 |
//--------------------------ary_must_be_exact---------------------------------- |
|
1824 |
bool TypeAry::ary_must_be_exact() const { |
|
1825 |
if (!UseExactTypes) return false; |
|
1826 |
// This logic looks at the element type of an array, and returns true |
|
1827 |
// if the element type is either a primitive or a final instance class. |
|
1828 |
// In such cases, an array built on this ary must have no subclasses. |
|
1829 |
if (_elem == BOTTOM) return false; // general array not exact |
|
1830 |
if (_elem == TOP ) return false; // inverted general array not exact |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1831 |
const TypeOopPtr* toop = NULL; |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1832 |
if (UseCompressedOops && _elem->isa_narrowoop()) { |
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1833 |
toop = _elem->make_ptr()->isa_oopptr(); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1834 |
} else { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1835 |
toop = _elem->isa_oopptr(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1836 |
} |
1 | 1837 |
if (!toop) return true; // a primitive type, like int |
1838 |
ciKlass* tklass = toop->klass(); |
|
1839 |
if (tklass == NULL) return false; // unloaded class |
|
1840 |
if (!tklass->is_loaded()) return false; // unloaded class |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1841 |
const TypeInstPtr* tinst; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1842 |
if (_elem->isa_narrowoop()) |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1843 |
tinst = _elem->make_ptr()->isa_instptr(); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1844 |
else |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1845 |
tinst = _elem->isa_instptr(); |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1846 |
if (tinst) |
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1847 |
return tklass->as_instance_klass()->is_final(); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1848 |
const TypeAryPtr* tap; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1849 |
if (_elem->isa_narrowoop()) |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1850 |
tap = _elem->make_ptr()->isa_aryptr(); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1851 |
else |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1852 |
tap = _elem->isa_aryptr(); |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1853 |
if (tap) |
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
1854 |
return tap->ary()->ary_must_be_exact(); |
1 | 1855 |
return false; |
1856 |
} |
|
1857 |
||
1858 |
//============================================================================= |
|
1859 |
// Convenience common pre-built types. |
|
1860 |
const TypePtr *TypePtr::NULL_PTR; |
|
1861 |
const TypePtr *TypePtr::NOTNULL; |
|
1862 |
const TypePtr *TypePtr::BOTTOM; |
|
1863 |
||
1864 |
//------------------------------meet------------------------------------------- |
|
1865 |
// Meet over the PTR enum |
|
1866 |
const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = { |
|
1867 |
// TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, |
|
1868 |
{ /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,}, |
|
1869 |
{ /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,}, |
|
1870 |
{ /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,}, |
|
1871 |
{ /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,}, |
|
1872 |
{ /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,}, |
|
1873 |
{ /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,} |
|
1874 |
}; |
|
1875 |
||
1876 |
//------------------------------make------------------------------------------- |
|
1877 |
const TypePtr *TypePtr::make( TYPES t, enum PTR ptr, int offset ) { |
|
1878 |
return (TypePtr*)(new TypePtr(t,ptr,offset))->hashcons(); |
|
1879 |
} |
|
1880 |
||
1881 |
//------------------------------cast_to_ptr_type------------------------------- |
|
1882 |
const Type *TypePtr::cast_to_ptr_type(PTR ptr) const { |
|
1883 |
assert(_base == AnyPtr, "subclass must override cast_to_ptr_type"); |
|
1884 |
if( ptr == _ptr ) return this; |
|
1885 |
return make(_base, ptr, _offset); |
|
1886 |
} |
|
1887 |
||
1888 |
//------------------------------get_con---------------------------------------- |
|
1889 |
intptr_t TypePtr::get_con() const { |
|
1890 |
assert( _ptr == Null, "" ); |
|
1891 |
return _offset; |
|
1892 |
} |
|
1893 |
||
1894 |
//------------------------------meet------------------------------------------- |
|
1895 |
// Compute the MEET of two types. It returns a new Type object. |
|
1896 |
const Type *TypePtr::xmeet( const Type *t ) const { |
|
1897 |
// Perform a fast test for common case; meeting the same types together. |
|
1898 |
if( this == t ) return this; // Meeting same type-rep? |
|
1899 |
||
1900 |
// Current "this->_base" is AnyPtr |
|
1901 |
switch (t->base()) { // switch on original type |
|
1902 |
case Int: // Mixing ints & oops happens when javac |
|
1903 |
case Long: // reuses local variables |
|
1904 |
case FloatTop: |
|
1905 |
case FloatCon: |
|
1906 |
case FloatBot: |
|
1907 |
case DoubleTop: |
|
1908 |
case DoubleCon: |
|
1909 |
case DoubleBot: |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
1910 |
case NarrowOop: |
1 | 1911 |
case Bottom: // Ye Olde Default |
1912 |
return Type::BOTTOM; |
|
1913 |
case Top: |
|
1914 |
return this; |
|
1915 |
||
1916 |
case AnyPtr: { // Meeting to AnyPtrs |
|
1917 |
const TypePtr *tp = t->is_ptr(); |
|
1918 |
return make( AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()) ); |
|
1919 |
} |
|
1920 |
case RawPtr: // For these, flip the call around to cut down |
|
1921 |
case OopPtr: |
|
1922 |
case InstPtr: // on the cases I have to handle. |
|
1923 |
case KlassPtr: |
|
1924 |
case AryPtr: |
|
1925 |
return t->xmeet(this); // Call in reverse direction |
|
1926 |
default: // All else is a mistake |
|
1927 |
typerr(t); |
|
1928 |
||
1929 |
} |
|
1930 |
return this; |
|
1931 |
} |
|
1932 |
||
1933 |
//------------------------------meet_offset------------------------------------ |
|
1934 |
int TypePtr::meet_offset( int offset ) const { |
|
1935 |
// Either is 'TOP' offset? Return the other offset! |
|
1936 |
if( _offset == OffsetTop ) return offset; |
|
1937 |
if( offset == OffsetTop ) return _offset; |
|
1938 |
// If either is different, return 'BOTTOM' offset |
|
1939 |
if( _offset != offset ) return OffsetBot; |
|
1940 |
return _offset; |
|
1941 |
} |
|
1942 |
||
1943 |
//------------------------------dual_offset------------------------------------ |
|
1944 |
int TypePtr::dual_offset( ) const { |
|
1945 |
if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM' |
|
1946 |
if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP' |
|
1947 |
return _offset; // Map everything else into self |
|
1948 |
} |
|
1949 |
||
1950 |
//------------------------------xdual------------------------------------------ |
|
1951 |
// Dual: compute field-by-field dual |
|
1952 |
const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = { |
|
1953 |
BotPTR, NotNull, Constant, Null, AnyNull, TopPTR |
|
1954 |
}; |
|
1955 |
const Type *TypePtr::xdual() const { |
|
1956 |
return new TypePtr( AnyPtr, dual_ptr(), dual_offset() ); |
|
1957 |
} |
|
1958 |
||
1959 |
//------------------------------add_offset------------------------------------- |
|
1960 |
const TypePtr *TypePtr::add_offset( int offset ) const { |
|
1961 |
if( offset == 0 ) return this; // No change |
|
1962 |
if( _offset == OffsetBot ) return this; |
|
1963 |
if( offset == OffsetBot ) offset = OffsetBot; |
|
1964 |
else if( _offset == OffsetTop || offset == OffsetTop ) offset = OffsetTop; |
|
1965 |
else offset += _offset; |
|
1966 |
return make( AnyPtr, _ptr, offset ); |
|
1967 |
} |
|
1968 |
||
1969 |
//------------------------------eq--------------------------------------------- |
|
1970 |
// Structural equality check for Type representations |
|
1971 |
bool TypePtr::eq( const Type *t ) const { |
|
1972 |
const TypePtr *a = (const TypePtr*)t; |
|
1973 |
return _ptr == a->ptr() && _offset == a->offset(); |
|
1974 |
} |
|
1975 |
||
1976 |
//------------------------------hash------------------------------------------- |
|
1977 |
// Type-specific hashing function. |
|
1978 |
int TypePtr::hash(void) const { |
|
1979 |
return _ptr + _offset; |
|
1980 |
} |
|
1981 |
||
1982 |
//------------------------------dump2------------------------------------------ |
|
1983 |
const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = { |
|
1984 |
"TopPTR","AnyNull","Constant","NULL","NotNull","BotPTR" |
|
1985 |
}; |
|
1986 |
||
1987 |
#ifndef PRODUCT |
|
1988 |
void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
1989 |
if( _ptr == Null ) st->print("NULL"); |
|
1990 |
else st->print("%s *", ptr_msg[_ptr]); |
|
1991 |
if( _offset == OffsetTop ) st->print("+top"); |
|
1992 |
else if( _offset == OffsetBot ) st->print("+bot"); |
|
1993 |
else if( _offset ) st->print("+%d", _offset); |
|
1994 |
} |
|
1995 |
#endif |
|
1996 |
||
1997 |
//------------------------------singleton-------------------------------------- |
|
1998 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
1999 |
// constants |
|
2000 |
bool TypePtr::singleton(void) const { |
|
2001 |
// TopPTR, Null, AnyNull, Constant are all singletons |
|
2002 |
return (_offset != OffsetBot) && !below_centerline(_ptr); |
|
2003 |
} |
|
2004 |
||
2005 |
bool TypePtr::empty(void) const { |
|
2006 |
return (_offset == OffsetTop) || above_centerline(_ptr); |
|
2007 |
} |
|
2008 |
||
2009 |
//============================================================================= |
|
2010 |
// Convenience common pre-built types. |
|
2011 |
const TypeRawPtr *TypeRawPtr::BOTTOM; |
|
2012 |
const TypeRawPtr *TypeRawPtr::NOTNULL; |
|
2013 |
||
2014 |
//------------------------------make------------------------------------------- |
|
2015 |
const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) { |
|
2016 |
assert( ptr != Constant, "what is the constant?" ); |
|
2017 |
assert( ptr != Null, "Use TypePtr for NULL" ); |
|
2018 |
return (TypeRawPtr*)(new TypeRawPtr(ptr,0))->hashcons(); |
|
2019 |
} |
|
2020 |
||
2021 |
const TypeRawPtr *TypeRawPtr::make( address bits ) { |
|
2022 |
assert( bits, "Use TypePtr for NULL" ); |
|
2023 |
return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons(); |
|
2024 |
} |
|
2025 |
||
2026 |
//------------------------------cast_to_ptr_type------------------------------- |
|
2027 |
const Type *TypeRawPtr::cast_to_ptr_type(PTR ptr) const { |
|
2028 |
assert( ptr != Constant, "what is the constant?" ); |
|
2029 |
assert( ptr != Null, "Use TypePtr for NULL" ); |
|
2030 |
assert( _bits==0, "Why cast a constant address?"); |
|
2031 |
if( ptr == _ptr ) return this; |
|
2032 |
return make(ptr); |
|
2033 |
} |
|
2034 |
||
2035 |
//------------------------------get_con---------------------------------------- |
|
2036 |
intptr_t TypeRawPtr::get_con() const { |
|
2037 |
assert( _ptr == Null || _ptr == Constant, "" ); |
|
2038 |
return (intptr_t)_bits; |
|
2039 |
} |
|
2040 |
||
2041 |
//------------------------------meet------------------------------------------- |
|
2042 |
// Compute the MEET of two types. It returns a new Type object. |
|
2043 |
const Type *TypeRawPtr::xmeet( const Type *t ) const { |
|
2044 |
// Perform a fast test for common case; meeting the same types together. |
|
2045 |
if( this == t ) return this; // Meeting same type-rep? |
|
2046 |
||
2047 |
// Current "this->_base" is RawPtr |
|
2048 |
switch( t->base() ) { // switch on original type |
|
2049 |
case Bottom: // Ye Olde Default |
|
2050 |
return t; |
|
2051 |
case Top: |
|
2052 |
return this; |
|
2053 |
case AnyPtr: // Meeting to AnyPtrs |
|
2054 |
break; |
|
2055 |
case RawPtr: { // might be top, bot, any/not or constant |
|
2056 |
enum PTR tptr = t->is_ptr()->ptr(); |
|
2057 |
enum PTR ptr = meet_ptr( tptr ); |
|
2058 |
if( ptr == Constant ) { // Cannot be equal constants, so... |
|
2059 |
if( tptr == Constant && _ptr != Constant) return t; |
|
2060 |
if( _ptr == Constant && tptr != Constant) return this; |
|
2061 |
ptr = NotNull; // Fall down in lattice |
|
2062 |
} |
|
2063 |
return make( ptr ); |
|
2064 |
} |
|
2065 |
||
2066 |
case OopPtr: |
|
2067 |
case InstPtr: |
|
2068 |
case KlassPtr: |
|
2069 |
case AryPtr: |
|
2070 |
return TypePtr::BOTTOM; // Oop meet raw is not well defined |
|
2071 |
default: // All else is a mistake |
|
2072 |
typerr(t); |
|
2073 |
} |
|
2074 |
||
2075 |
// Found an AnyPtr type vs self-RawPtr type |
|
2076 |
const TypePtr *tp = t->is_ptr(); |
|
2077 |
switch (tp->ptr()) { |
|
2078 |
case TypePtr::TopPTR: return this; |
|
2079 |
case TypePtr::BotPTR: return t; |
|
2080 |
case TypePtr::Null: |
|
2081 |
if( _ptr == TypePtr::TopPTR ) return t; |
|
2082 |
return TypeRawPtr::BOTTOM; |
|
2083 |
case TypePtr::NotNull: return TypePtr::make( AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0) ); |
|
2084 |
case TypePtr::AnyNull: |
|
2085 |
if( _ptr == TypePtr::Constant) return this; |
|
2086 |
return make( meet_ptr(TypePtr::AnyNull) ); |
|
2087 |
default: ShouldNotReachHere(); |
|
2088 |
} |
|
2089 |
return this; |
|
2090 |
} |
|
2091 |
||
2092 |
//------------------------------xdual------------------------------------------ |
|
2093 |
// Dual: compute field-by-field dual |
|
2094 |
const Type *TypeRawPtr::xdual() const { |
|
2095 |
return new TypeRawPtr( dual_ptr(), _bits ); |
|
2096 |
} |
|
2097 |
||
2098 |
//------------------------------add_offset------------------------------------- |
|
2099 |
const TypePtr *TypeRawPtr::add_offset( int offset ) const { |
|
2100 |
if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer |
|
2101 |
if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer |
|
2102 |
if( offset == 0 ) return this; // No change |
|
2103 |
switch (_ptr) { |
|
2104 |
case TypePtr::TopPTR: |
|
2105 |
case TypePtr::BotPTR: |
|
2106 |
case TypePtr::NotNull: |
|
2107 |
return this; |
|
2108 |
case TypePtr::Null: |
|
2109 |
case TypePtr::Constant: |
|
2110 |
return make( _bits+offset ); |
|
2111 |
default: ShouldNotReachHere(); |
|
2112 |
} |
|
2113 |
return NULL; // Lint noise |
|
2114 |
} |
|
2115 |
||
2116 |
//------------------------------eq--------------------------------------------- |
|
2117 |
// Structural equality check for Type representations |
|
2118 |
bool TypeRawPtr::eq( const Type *t ) const { |
|
2119 |
const TypeRawPtr *a = (const TypeRawPtr*)t; |
|
2120 |
return _bits == a->_bits && TypePtr::eq(t); |
|
2121 |
} |
|
2122 |
||
2123 |
//------------------------------hash------------------------------------------- |
|
2124 |
// Type-specific hashing function. |
|
2125 |
int TypeRawPtr::hash(void) const { |
|
2126 |
return (intptr_t)_bits + TypePtr::hash(); |
|
2127 |
} |
|
2128 |
||
2129 |
//------------------------------dump2------------------------------------------ |
|
2130 |
#ifndef PRODUCT |
|
2131 |
void TypeRawPtr::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
2132 |
if( _ptr == Constant ) |
|
2133 |
st->print(INTPTR_FORMAT, _bits); |
|
2134 |
else |
|
2135 |
st->print("rawptr:%s", ptr_msg[_ptr]); |
|
2136 |
} |
|
2137 |
#endif |
|
2138 |
||
2139 |
//============================================================================= |
|
2140 |
// Convenience common pre-built type. |
|
2141 |
const TypeOopPtr *TypeOopPtr::BOTTOM; |
|
2142 |
||
589 | 2143 |
//------------------------------TypeOopPtr------------------------------------- |
2144 |
TypeOopPtr::TypeOopPtr( TYPES t, PTR ptr, ciKlass* k, bool xk, ciObject* o, int offset, int instance_id ) |
|
2145 |
: TypePtr(t, ptr, offset), |
|
2146 |
_const_oop(o), _klass(k), |
|
2147 |
_klass_is_exact(xk), |
|
2148 |
_is_ptr_to_narrowoop(false), |
|
2149 |
_instance_id(instance_id) { |
|
2150 |
#ifdef _LP64 |
|
2151 |
if (UseCompressedOops && _offset != 0) { |
|
2152 |
if (klass() == NULL) { |
|
2153 |
assert(this->isa_aryptr(), "only arrays without klass"); |
|
2154 |
_is_ptr_to_narrowoop = true; |
|
2155 |
} else if (_offset == oopDesc::klass_offset_in_bytes()) { |
|
2156 |
_is_ptr_to_narrowoop = true; |
|
2157 |
} else if (this->isa_aryptr()) { |
|
2158 |
_is_ptr_to_narrowoop = (klass()->is_obj_array_klass() && |
|
2159 |
_offset != arrayOopDesc::length_offset_in_bytes()); |
|
2160 |
} else if (klass() == ciEnv::current()->Class_klass() && |
|
2161 |
(_offset == java_lang_Class::klass_offset_in_bytes() || |
|
2162 |
_offset == java_lang_Class::array_klass_offset_in_bytes())) { |
|
2163 |
// Special hidden fields from the Class. |
|
2164 |
assert(this->isa_instptr(), "must be an instance ptr."); |
|
2165 |
_is_ptr_to_narrowoop = true; |
|
2166 |
} else if (klass()->is_instance_klass()) { |
|
2167 |
ciInstanceKlass* ik = klass()->as_instance_klass(); |
|
2168 |
ciField* field = NULL; |
|
2169 |
if (this->isa_klassptr()) { |
|
2170 |
// Perm objects don't use compressed references, except for |
|
2171 |
// static fields which are currently compressed. |
|
2172 |
field = ik->get_field_by_offset(_offset, true); |
|
2173 |
if (field != NULL) { |
|
2174 |
BasicType basic_elem_type = field->layout_type(); |
|
2175 |
_is_ptr_to_narrowoop = (basic_elem_type == T_OBJECT || |
|
2176 |
basic_elem_type == T_ARRAY); |
|
2177 |
} |
|
2178 |
} else if (_offset == OffsetBot || _offset == OffsetTop) { |
|
2179 |
// unsafe access |
|
2180 |
_is_ptr_to_narrowoop = true; |
|
2181 |
} else { // exclude unsafe ops |
|
2182 |
assert(this->isa_instptr(), "must be an instance ptr."); |
|
2183 |
// Field which contains a compressed oop references. |
|
2184 |
field = ik->get_field_by_offset(_offset, false); |
|
2185 |
if (field != NULL) { |
|
2186 |
BasicType basic_elem_type = field->layout_type(); |
|
2187 |
_is_ptr_to_narrowoop = (basic_elem_type == T_OBJECT || |
|
2188 |
basic_elem_type == T_ARRAY); |
|
2189 |
} else if (klass()->equals(ciEnv::current()->Object_klass())) { |
|
2190 |
// Compile::find_alias_type() cast exactness on all types to verify |
|
2191 |
// that it does not affect alias type. |
|
2192 |
_is_ptr_to_narrowoop = true; |
|
2193 |
} else { |
|
2194 |
// Type for the copy start in LibraryCallKit::inline_native_clone(). |
|
2195 |
assert(!klass_is_exact(), "only non-exact klass"); |
|
2196 |
_is_ptr_to_narrowoop = true; |
|
2197 |
} |
|
2198 |
} |
|
2199 |
} |
|
2200 |
} |
|
2201 |
#endif |
|
2202 |
} |
|
2203 |
||
1 | 2204 |
//------------------------------make------------------------------------------- |
2205 |
const TypeOopPtr *TypeOopPtr::make(PTR ptr, |
|
2206 |
int offset) { |
|
2207 |
assert(ptr != Constant, "no constant generic pointers"); |
|
2208 |
ciKlass* k = ciKlassKlass::make(); |
|
2209 |
bool xk = false; |
|
2210 |
ciObject* o = NULL; |
|
769 | 2211 |
return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, xk, o, offset, InstanceBot))->hashcons(); |
1 | 2212 |
} |
2213 |
||
2214 |
||
2215 |
//------------------------------cast_to_ptr_type------------------------------- |
|
2216 |
const Type *TypeOopPtr::cast_to_ptr_type(PTR ptr) const { |
|
2217 |
assert(_base == OopPtr, "subclass must override cast_to_ptr_type"); |
|
2218 |
if( ptr == _ptr ) return this; |
|
2219 |
return make(ptr, _offset); |
|
2220 |
} |
|
2221 |
||
955 | 2222 |
//-----------------------------cast_to_instance_id---------------------------- |
769 | 2223 |
const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const { |
1 | 2224 |
// There are no instances of a general oop. |
2225 |
// Return self unchanged. |
|
2226 |
return this; |
|
2227 |
} |
|
2228 |
||
2229 |
//-----------------------------cast_to_exactness------------------------------- |
|
2230 |
const Type *TypeOopPtr::cast_to_exactness(bool klass_is_exact) const { |
|
2231 |
// There is no such thing as an exact general oop. |
|
2232 |
// Return self unchanged. |
|
2233 |
return this; |
|
2234 |
} |
|
2235 |
||
2236 |
||
2237 |
//------------------------------as_klass_type---------------------------------- |
|
2238 |
// Return the klass type corresponding to this instance or array type. |
|
2239 |
// It is the type that is loaded from an object of this type. |
|
2240 |
const TypeKlassPtr* TypeOopPtr::as_klass_type() const { |
|
2241 |
ciKlass* k = klass(); |
|
2242 |
bool xk = klass_is_exact(); |
|
2243 |
if (k == NULL || !k->is_java_klass()) |
|
2244 |
return TypeKlassPtr::OBJECT; |
|
2245 |
else |
|
2246 |
return TypeKlassPtr::make(xk? Constant: NotNull, k, 0); |
|
2247 |
} |
|
2248 |
||
2249 |
||
2250 |
//------------------------------meet------------------------------------------- |
|
2251 |
// Compute the MEET of two types. It returns a new Type object. |
|
2252 |
const Type *TypeOopPtr::xmeet( const Type *t ) const { |
|
2253 |
// Perform a fast test for common case; meeting the same types together. |
|
2254 |
if( this == t ) return this; // Meeting same type-rep? |
|
2255 |
||
2256 |
// Current "this->_base" is OopPtr |
|
2257 |
switch (t->base()) { // switch on original type |
|
2258 |
||
2259 |
case Int: // Mixing ints & oops happens when javac |
|
2260 |
case Long: // reuses local variables |
|
2261 |
case FloatTop: |
|
2262 |
case FloatCon: |
|
2263 |
case FloatBot: |
|
2264 |
case DoubleTop: |
|
2265 |
case DoubleCon: |
|
2266 |
case DoubleBot: |
|
1055
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
2267 |
case NarrowOop: |
1 | 2268 |
case Bottom: // Ye Olde Default |
2269 |
return Type::BOTTOM; |
|
2270 |
case Top: |
|
2271 |
return this; |
|
2272 |
||
2273 |
default: // All else is a mistake |
|
2274 |
typerr(t); |
|
2275 |
||
2276 |
case RawPtr: |
|
2277 |
return TypePtr::BOTTOM; // Oop meet raw is not well defined |
|
2278 |
||
2279 |
case AnyPtr: { |
|
2280 |
// Found an AnyPtr type vs self-OopPtr type |
|
2281 |
const TypePtr *tp = t->is_ptr(); |
|
2282 |
int offset = meet_offset(tp->offset()); |
|
2283 |
PTR ptr = meet_ptr(tp->ptr()); |
|
2284 |
switch (tp->ptr()) { |
|
2285 |
case Null: |
|
2286 |
if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset); |
|
2287 |
// else fall through: |
|
2288 |
case TopPTR: |
|
2289 |
case AnyNull: |
|
2290 |
return make(ptr, offset); |
|
2291 |
case BotPTR: |
|
2292 |
case NotNull: |
|
2293 |
return TypePtr::make(AnyPtr, ptr, offset); |
|
2294 |
default: typerr(t); |
|
2295 |
} |
|
2296 |
} |
|
2297 |
||
2298 |
case OopPtr: { // Meeting to other OopPtrs |
|
2299 |
const TypeOopPtr *tp = t->is_oopptr(); |
|
2300 |
return make( meet_ptr(tp->ptr()), meet_offset(tp->offset()) ); |
|
2301 |
} |
|
2302 |
||
2303 |
case InstPtr: // For these, flip the call around to cut down |
|
2304 |
case KlassPtr: // on the cases I have to handle. |
|
2305 |
case AryPtr: |
|
2306 |
return t->xmeet(this); // Call in reverse direction |
|
2307 |
||
2308 |
} // End of switch |
|
2309 |
return this; // Return the double constant |
|
2310 |
} |
|
2311 |
||
2312 |
||
2313 |
//------------------------------xdual------------------------------------------ |
|
2314 |
// Dual of a pure heap pointer. No relevant klass or oop information. |
|
2315 |
const Type *TypeOopPtr::xdual() const { |
|
2316 |
assert(klass() == ciKlassKlass::make(), "no klasses here"); |
|
2317 |
assert(const_oop() == NULL, "no constants here"); |
|
769 | 2318 |
return new TypeOopPtr(_base, dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id() ); |
1 | 2319 |
} |
2320 |
||
2321 |
//--------------------------make_from_klass_common----------------------------- |
|
2322 |
// Computes the element-type given a klass. |
|
2323 |
const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact) { |
|
2324 |
assert(klass->is_java_klass(), "must be java language klass"); |
|
2325 |
if (klass->is_instance_klass()) { |
|
2326 |
Compile* C = Compile::current(); |
|
2327 |
Dependencies* deps = C->dependencies(); |
|
2328 |
assert((deps != NULL) == (C->method() != NULL && C->method()->code_size() > 0), "sanity"); |
|
2329 |
// Element is an instance |
|
2330 |
bool klass_is_exact = false; |
|
2331 |
if (klass->is_loaded()) { |
|
2332 |
// Try to set klass_is_exact. |
|
2333 |
ciInstanceKlass* ik = klass->as_instance_klass(); |
|
2334 |
klass_is_exact = ik->is_final(); |
|
2335 |
if (!klass_is_exact && klass_change |
|
2336 |
&& deps != NULL && UseUniqueSubclasses) { |
|
2337 |
ciInstanceKlass* sub = ik->unique_concrete_subklass(); |
|
2338 |
if (sub != NULL) { |
|
2339 |
deps->assert_abstract_with_unique_concrete_subtype(ik, sub); |
|
2340 |
klass = ik = sub; |
|
2341 |
klass_is_exact = sub->is_final(); |
|
2342 |
} |
|
2343 |
} |
|
2344 |
if (!klass_is_exact && try_for_exact |
|
2345 |
&& deps != NULL && UseExactTypes) { |
|
2346 |
if (!ik->is_interface() && !ik->has_subklass()) { |
|
2347 |
// Add a dependence; if concrete subclass added we need to recompile |
|
2348 |
deps->assert_leaf_type(ik); |
|
2349 |
klass_is_exact = true; |
|
2350 |
} |
|
2351 |
} |
|
2352 |
} |
|
2353 |
return TypeInstPtr::make(TypePtr::BotPTR, klass, klass_is_exact, NULL, 0); |
|
2354 |
} else if (klass->is_obj_array_klass()) { |
|
2355 |
// Element is an object array. Recursively call ourself. |
|
2356 |
const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(klass->as_obj_array_klass()->element_klass(), false, try_for_exact); |
|
2357 |
bool xk = etype->klass_is_exact(); |
|
2358 |
const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); |
|
2359 |
// We used to pass NotNull in here, asserting that the sub-arrays |
|
2360 |
// are all not-null. This is not true in generally, as code can |
|
2361 |
// slam NULLs down in the subarrays. |
|
2362 |
const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, xk, 0); |
|
2363 |
return arr; |
|
2364 |
} else if (klass->is_type_array_klass()) { |
|
2365 |
// Element is an typeArray |
|
2366 |
const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type()); |
|
2367 |
const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); |
|
2368 |
// We used to pass NotNull in here, asserting that the array pointer |
|
2369 |
// is not-null. That was not true in general. |
|
2370 |
const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0); |
|
2371 |
return arr; |
|
2372 |
} else { |
|
2373 |
ShouldNotReachHere(); |
|
2374 |
return NULL; |
|
2375 |
} |
|
2376 |
} |
|
2377 |
||
2378 |
//------------------------------make_from_constant----------------------------- |
|
2379 |
// Make a java pointer from an oop constant |
|
2380 |
const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o) { |
|
2381 |
if (o->is_method_data() || o->is_method()) { |
|
2382 |
// Treat much like a typeArray of bytes, like below, but fake the type... |
|
2383 |
assert(o->has_encoding(), "must be a perm space object"); |
|
2384 |
const Type* etype = (Type*)get_const_basic_type(T_BYTE); |
|
2385 |
const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); |
|
2386 |
ciKlass *klass = ciTypeArrayKlass::make((BasicType) T_BYTE); |
|
2387 |
assert(o->has_encoding(), "method data oops should be tenured"); |
|
2388 |
const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0); |
|
2389 |
return arr; |
|
2390 |
} else { |
|
2391 |
assert(o->is_java_object(), "must be java language object"); |
|
2392 |
assert(!o->is_null_object(), "null object not yet handled here."); |
|
2393 |
ciKlass *klass = o->klass(); |
|
2394 |
if (klass->is_instance_klass()) { |
|
2395 |
// Element is an instance |
|
2396 |
if (!o->has_encoding()) { // not a perm-space constant |
|
2397 |
// %%% remove this restriction by rewriting non-perm ConPNodes in a later phase |
|
2398 |
return TypeInstPtr::make(TypePtr::NotNull, klass, true, NULL, 0); |
|
2399 |
} |
|
2400 |
return TypeInstPtr::make(o); |
|
2401 |
} else if (klass->is_obj_array_klass()) { |
|
2402 |
// Element is an object array. Recursively call ourself. |
|
2403 |
const Type *etype = |
|
2404 |
TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass()); |
|
2405 |
const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); |
|
2406 |
// We used to pass NotNull in here, asserting that the sub-arrays |
|
2407 |
// are all not-null. This is not true in generally, as code can |
|
2408 |
// slam NULLs down in the subarrays. |
|
2409 |
if (!o->has_encoding()) { // not a perm-space constant |
|
2410 |
// %%% remove this restriction by rewriting non-perm ConPNodes in a later phase |
|
2411 |
return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); |
|
2412 |
} |
|
2413 |
const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0); |
|
2414 |
return arr; |
|
2415 |
} else if (klass->is_type_array_klass()) { |
|
2416 |
// Element is an typeArray |
|
2417 |
const Type* etype = |
|
2418 |
(Type*)get_const_basic_type(klass->as_type_array_klass()->element_type()); |
|
2419 |
const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); |
|
2420 |
// We used to pass NotNull in here, asserting that the array pointer |
|
2421 |
// is not-null. That was not true in general. |
|
2422 |
if (!o->has_encoding()) { // not a perm-space constant |
|
2423 |
// %%% remove this restriction by rewriting non-perm ConPNodes in a later phase |
|
2424 |
return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); |
|
2425 |
} |
|
2426 |
const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0); |
|
2427 |
return arr; |
|
2428 |
} |
|
2429 |
} |
|
2430 |
||
2431 |
ShouldNotReachHere(); |
|
2432 |
return NULL; |
|
2433 |
} |
|
2434 |
||
2435 |
//------------------------------get_con---------------------------------------- |
|
2436 |
intptr_t TypeOopPtr::get_con() const { |
|
2437 |
assert( _ptr == Null || _ptr == Constant, "" ); |
|
2438 |
assert( _offset >= 0, "" ); |
|
2439 |
||
2440 |
if (_offset != 0) { |
|
2441 |
// After being ported to the compiler interface, the compiler no longer |
|
2442 |
// directly manipulates the addresses of oops. Rather, it only has a pointer |
|
2443 |
// to a handle at compile time. This handle is embedded in the generated |
|
2444 |
// code and dereferenced at the time the nmethod is made. Until that time, |
|
2445 |
// it is not reasonable to do arithmetic with the addresses of oops (we don't |
|
2446 |
// have access to the addresses!). This does not seem to currently happen, |
|
2447 |
// but this assertion here is to help prevent its occurrance. |
|
2448 |
tty->print_cr("Found oop constant with non-zero offset"); |
|
2449 |
ShouldNotReachHere(); |
|
2450 |
} |
|
2451 |
||
2452 |
return (intptr_t)const_oop()->encoding(); |
|
2453 |
} |
|
2454 |
||
2455 |
||
2456 |
//-----------------------------filter------------------------------------------ |
|
2457 |
// Do not allow interface-vs.-noninterface joins to collapse to top. |
|
2458 |
const Type *TypeOopPtr::filter( const Type *kills ) const { |
|
2459 |
||
2460 |
const Type* ft = join(kills); |
|
2461 |
const TypeInstPtr* ftip = ft->isa_instptr(); |
|
2462 |
const TypeInstPtr* ktip = kills->isa_instptr(); |
|
2463 |
||
2464 |
if (ft->empty()) { |
|
2465 |
// Check for evil case of 'this' being a class and 'kills' expecting an |
|
2466 |
// interface. This can happen because the bytecodes do not contain |
|
2467 |
// enough type info to distinguish a Java-level interface variable |
|
2468 |
// from a Java-level object variable. If we meet 2 classes which |
|
2469 |
// both implement interface I, but their meet is at 'j/l/O' which |
|
2470 |
// doesn't implement I, we have no way to tell if the result should |
|
2471 |
// be 'I' or 'j/l/O'. Thus we'll pick 'j/l/O'. If this then flows |
|
2472 |
// into a Phi which "knows" it's an Interface type we'll have to |
|
2473 |
// uplift the type. |
|
2474 |
if (!empty() && ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) |
|
2475 |
return kills; // Uplift to interface |
|
2476 |
||
2477 |
return Type::TOP; // Canonical empty value |
|
2478 |
} |
|
2479 |
||
2480 |
// If we have an interface-typed Phi or cast and we narrow to a class type, |
|
2481 |
// the join should report back the class. However, if we have a J/L/Object |
|
2482 |
// class-typed Phi and an interface flows in, it's possible that the meet & |
|
2483 |
// join report an interface back out. This isn't possible but happens |
|
2484 |
// because the type system doesn't interact well with interfaces. |
|
2485 |
if (ftip != NULL && ktip != NULL && |
|
2486 |
ftip->is_loaded() && ftip->klass()->is_interface() && |
|
2487 |
ktip->is_loaded() && !ktip->klass()->is_interface()) { |
|
2488 |
// Happens in a CTW of rt.jar, 320-341, no extra flags |
|
2489 |
return ktip->cast_to_ptr_type(ftip->ptr()); |
|
2490 |
} |
|
2491 |
||
2492 |
return ft; |
|
2493 |
} |
|
2494 |
||
2495 |
//------------------------------eq--------------------------------------------- |
|
2496 |
// Structural equality check for Type representations |
|
2497 |
bool TypeOopPtr::eq( const Type *t ) const { |
|
2498 |
const TypeOopPtr *a = (const TypeOopPtr*)t; |
|
2499 |
if (_klass_is_exact != a->_klass_is_exact || |
|
2500 |
_instance_id != a->_instance_id) return false; |
|
2501 |
ciObject* one = const_oop(); |
|
2502 |
ciObject* two = a->const_oop(); |
|
2503 |
if (one == NULL || two == NULL) { |
|
2504 |
return (one == two) && TypePtr::eq(t); |
|
2505 |
} else { |
|
2506 |
return one->equals(two) && TypePtr::eq(t); |
|
2507 |
} |
|
2508 |
} |
|
2509 |
||
2510 |
//------------------------------hash------------------------------------------- |
|
2511 |
// Type-specific hashing function. |
|
2512 |
int TypeOopPtr::hash(void) const { |
|
2513 |
return |
|
2514 |
(const_oop() ? const_oop()->hash() : 0) + |
|
2515 |
_klass_is_exact + |
|
2516 |
_instance_id + |
|
2517 |
TypePtr::hash(); |
|
2518 |
} |
|
2519 |
||
2520 |
//------------------------------dump2------------------------------------------ |
|
2521 |
#ifndef PRODUCT |
|
2522 |
void TypeOopPtr::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
2523 |
st->print("oopptr:%s", ptr_msg[_ptr]); |
|
2524 |
if( _klass_is_exact ) st->print(":exact"); |
|
2525 |
if( const_oop() ) st->print(INTPTR_FORMAT, const_oop()); |
|
2526 |
switch( _offset ) { |
|
2527 |
case OffsetTop: st->print("+top"); break; |
|
2528 |
case OffsetBot: st->print("+any"); break; |
|
2529 |
case 0: break; |
|
2530 |
default: st->print("+%d",_offset); break; |
|
2531 |
} |
|
769 | 2532 |
if (_instance_id == InstanceTop) |
2533 |
st->print(",iid=top"); |
|
2534 |
else if (_instance_id != InstanceBot) |
|
1 | 2535 |
st->print(",iid=%d",_instance_id); |
2536 |
} |
|
2537 |
#endif |
|
2538 |
||
2539 |
//------------------------------singleton-------------------------------------- |
|
2540 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
2541 |
// constants |
|
2542 |
bool TypeOopPtr::singleton(void) const { |
|
2543 |
// detune optimizer to not generate constant oop + constant offset as a constant! |
|
2544 |
// TopPTR, Null, AnyNull, Constant are all singletons |
|
2545 |
return (_offset == 0) && !below_centerline(_ptr); |
|
2546 |
} |
|
2547 |
||
2548 |
//------------------------------xadd_offset------------------------------------ |
|
2549 |
int TypeOopPtr::xadd_offset( int offset ) const { |
|
2550 |
// Adding to 'TOP' offset? Return 'TOP'! |
|
2551 |
if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop; |
|
2552 |
// Adding to 'BOTTOM' offset? Return 'BOTTOM'! |
|
2553 |
if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot; |
|
2554 |
||
2555 |
// assert( _offset >= 0 && _offset+offset >= 0, "" ); |
|
2556 |
// It is possible to construct a negative offset during PhaseCCP |
|
2557 |
||
2558 |
return _offset+offset; // Sum valid offsets |
|
2559 |
} |
|
2560 |
||
2561 |
//------------------------------add_offset------------------------------------- |
|
2562 |
const TypePtr *TypeOopPtr::add_offset( int offset ) const { |
|
2563 |
return make( _ptr, xadd_offset(offset) ); |
|
2564 |
} |
|
2565 |
||
769 | 2566 |
//------------------------------meet_instance_id-------------------------------- |
2567 |
int TypeOopPtr::meet_instance_id( int instance_id ) const { |
|
2568 |
// Either is 'TOP' instance? Return the other instance! |
|
2569 |
if( _instance_id == InstanceTop ) return instance_id; |
|
2570 |
if( instance_id == InstanceTop ) return _instance_id; |
|
2571 |
// If either is different, return 'BOTTOM' instance |
|
2572 |
if( _instance_id != instance_id ) return InstanceBot; |
|
2573 |
return _instance_id; |
|
1 | 2574 |
} |
2575 |
||
769 | 2576 |
//------------------------------dual_instance_id-------------------------------- |
2577 |
int TypeOopPtr::dual_instance_id( ) const { |
|
2578 |
if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM |
|
2579 |
if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP |
|
2580 |
return _instance_id; // Map everything else into self |
|
2581 |
} |
|
2582 |
||
2583 |
||
1 | 2584 |
//============================================================================= |
2585 |
// Convenience common pre-built types. |
|
2586 |
const TypeInstPtr *TypeInstPtr::NOTNULL; |
|
2587 |
const TypeInstPtr *TypeInstPtr::BOTTOM; |
|
2588 |
const TypeInstPtr *TypeInstPtr::MIRROR; |
|
2589 |
const TypeInstPtr *TypeInstPtr::MARK; |
|
2590 |
const TypeInstPtr *TypeInstPtr::KLASS; |
|
2591 |
||
2592 |
//------------------------------TypeInstPtr------------------------------------- |
|
2593 |
TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, bool xk, ciObject* o, int off, int instance_id) |
|
2594 |
: TypeOopPtr(InstPtr, ptr, k, xk, o, off, instance_id), _name(k->name()) { |
|
2595 |
assert(k != NULL && |
|
2596 |
(k->is_loaded() || o == NULL), |
|
2597 |
"cannot have constants with non-loaded klass"); |
|
2598 |
}; |
|
2599 |
||
2600 |
//------------------------------make------------------------------------------- |
|
2601 |
const TypeInstPtr *TypeInstPtr::make(PTR ptr, |
|
2602 |
ciKlass* k, |
|
2603 |
bool xk, |
|
2604 |
ciObject* o, |
|
2605 |
int offset, |
|
2606 |
int instance_id) { |
|
2607 |
assert( !k->is_loaded() || k->is_instance_klass() || |
|
2608 |
k->is_method_klass(), "Must be for instance or method"); |
|
2609 |
// Either const_oop() is NULL or else ptr is Constant |
|
2610 |
assert( (!o && ptr != Constant) || (o && ptr == Constant), |
|
2611 |
"constant pointers must have a value supplied" ); |
|
2612 |
// Ptr is never Null |
|
2613 |
assert( ptr != Null, "NULL pointers are not typed" ); |
|
2614 |
||
955 | 2615 |
assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); |
1 | 2616 |
if (!UseExactTypes) xk = false; |
2617 |
if (ptr == Constant) { |
|
2618 |
// Note: This case includes meta-object constants, such as methods. |
|
2619 |
xk = true; |
|
2620 |
} else if (k->is_loaded()) { |
|
2621 |
ciInstanceKlass* ik = k->as_instance_klass(); |
|
2622 |
if (!xk && ik->is_final()) xk = true; // no inexact final klass |
|
2623 |
if (xk && ik->is_interface()) xk = false; // no exact interface |
|
2624 |
} |
|
2625 |
||
2626 |
// Now hash this baby |
|
2627 |
TypeInstPtr *result = |
|
2628 |
(TypeInstPtr*)(new TypeInstPtr(ptr, k, xk, o ,offset, instance_id))->hashcons(); |
|
2629 |
||
2630 |
return result; |
|
2631 |
} |
|
2632 |
||
2633 |
||
2634 |
//------------------------------cast_to_ptr_type------------------------------- |
|
2635 |
const Type *TypeInstPtr::cast_to_ptr_type(PTR ptr) const { |
|
2636 |
if( ptr == _ptr ) return this; |
|
2637 |
// Reconstruct _sig info here since not a problem with later lazy |
|
2638 |
// construction, _sig will show up on demand. |
|
769 | 2639 |
return make(ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id); |
1 | 2640 |
} |
2641 |
||
2642 |
||
2643 |
//-----------------------------cast_to_exactness------------------------------- |
|
2644 |
const Type *TypeInstPtr::cast_to_exactness(bool klass_is_exact) const { |
|
2645 |
if( klass_is_exact == _klass_is_exact ) return this; |
|
2646 |
if (!UseExactTypes) return this; |
|
2647 |
if (!_klass->is_loaded()) return this; |
|
2648 |
ciInstanceKlass* ik = _klass->as_instance_klass(); |
|
2649 |
if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk |
|
2650 |
if( ik->is_interface() ) return this; // cannot set xk |
|
2651 |
return make(ptr(), klass(), klass_is_exact, const_oop(), _offset, _instance_id); |
|
2652 |
} |
|
2653 |
||
955 | 2654 |
//-----------------------------cast_to_instance_id---------------------------- |
769 | 2655 |
const TypeOopPtr *TypeInstPtr::cast_to_instance_id(int instance_id) const { |
2656 |
if( instance_id == _instance_id ) return this; |
|
955 | 2657 |
return make(_ptr, klass(), _klass_is_exact, const_oop(), _offset, instance_id); |
1 | 2658 |
} |
2659 |
||
2660 |
//------------------------------xmeet_unloaded--------------------------------- |
|
2661 |
// Compute the MEET of two InstPtrs when at least one is unloaded. |
|
2662 |
// Assume classes are different since called after check for same name/class-loader |
|
2663 |
const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst) const { |
|
2664 |
int off = meet_offset(tinst->offset()); |
|
2665 |
PTR ptr = meet_ptr(tinst->ptr()); |
|
2666 |
||
2667 |
const TypeInstPtr *loaded = is_loaded() ? this : tinst; |
|
2668 |
const TypeInstPtr *unloaded = is_loaded() ? tinst : this; |
|
2669 |
if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) { |
|
2670 |
// |
|
2671 |
// Meet unloaded class with java/lang/Object |
|
2672 |
// |
|
2673 |
// Meet |
|
2674 |
// | Unloaded Class |
|
2675 |
// Object | TOP | AnyNull | Constant | NotNull | BOTTOM | |
|
2676 |
// =================================================================== |
|
2677 |
// TOP | ..........................Unloaded......................| |
|
2678 |
// AnyNull | U-AN |................Unloaded......................| |
|
2679 |
// Constant | ... O-NN .................................. | O-BOT | |
|
2680 |
// NotNull | ... O-NN .................................. | O-BOT | |
|
2681 |
// BOTTOM | ........................Object-BOTTOM ..................| |
|
2682 |
// |
|
2683 |
assert(loaded->ptr() != TypePtr::Null, "insanity check"); |
|
2684 |
// |
|
2685 |
if( loaded->ptr() == TypePtr::TopPTR ) { return unloaded; } |
|
2686 |
else if (loaded->ptr() == TypePtr::AnyNull) { return TypeInstPtr::make( ptr, unloaded->klass() ); } |
|
2687 |
else if (loaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; } |
|
2688 |
else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) { |
|
2689 |
if (unloaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; } |
|
2690 |
else { return TypeInstPtr::NOTNULL; } |
|
2691 |
} |
|
2692 |
else if( unloaded->ptr() == TypePtr::TopPTR ) { return unloaded; } |
|
2693 |
||
2694 |
return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr(); |
|
2695 |
} |
|
2696 |
||
2697 |
// Both are unloaded, not the same class, not Object |
|
2698 |
// Or meet unloaded with a different loaded class, not java/lang/Object |
|
2699 |
if( ptr != TypePtr::BotPTR ) { |
|
2700 |
return TypeInstPtr::NOTNULL; |
|
2701 |
} |
|
2702 |
return TypeInstPtr::BOTTOM; |
|
2703 |
} |
|
2704 |
||
2705 |
||
2706 |
//------------------------------meet------------------------------------------- |
|
2707 |
// Compute the MEET of two types. It returns a new Type object. |
|
2708 |
const Type *TypeInstPtr::xmeet( const Type *t ) const { |
|
2709 |
// Perform a fast test for common case; meeting the same types together. |
|
2710 |
if( this == t ) return this; // Meeting same type-rep? |
|
2711 |
||
2712 |
// Current "this->_base" is Pointer |
|
2713 |
switch (t->base()) { // switch on original type |
|
2714 |
||
2715 |
case Int: // Mixing ints & oops happens when javac |
|
2716 |
case Long: // reuses local variables |
|
2717 |
case FloatTop: |
|
2718 |
case FloatCon: |
|
2719 |
case FloatBot: |
|
2720 |
case DoubleTop: |
|
2721 |
case DoubleCon: |
|
2722 |
case DoubleBot: |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
2723 |
case NarrowOop: |
1 | 2724 |
case Bottom: // Ye Olde Default |
2725 |
return Type::BOTTOM; |
|
2726 |
case Top: |
|
2727 |
return this; |
|
2728 |
||
2729 |
default: // All else is a mistake |
|
2730 |
typerr(t); |
|
2731 |
||
2732 |
case RawPtr: return TypePtr::BOTTOM; |
|
2733 |
||
2734 |
case AryPtr: { // All arrays inherit from Object class |
|
2735 |
const TypeAryPtr *tp = t->is_aryptr(); |
|
2736 |
int offset = meet_offset(tp->offset()); |
|
2737 |
PTR ptr = meet_ptr(tp->ptr()); |
|
769 | 2738 |
int instance_id = meet_instance_id(tp->instance_id()); |
1 | 2739 |
switch (ptr) { |
2740 |
case TopPTR: |
|
2741 |
case AnyNull: // Fall 'down' to dual of object klass |
|
2742 |
if (klass()->equals(ciEnv::current()->Object_klass())) { |
|
769 | 2743 |
return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id); |
1 | 2744 |
} else { |
2745 |
// cannot subclass, so the meet has to fall badly below the centerline |
|
2746 |
ptr = NotNull; |
|
769 | 2747 |
instance_id = InstanceBot; |
2748 |
return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id); |
|
1 | 2749 |
} |
2750 |
case Constant: |
|
2751 |
case NotNull: |
|
2752 |
case BotPTR: // Fall down to object klass |
|
2753 |
// LCA is object_klass, but if we subclass from the top we can do better |
|
2754 |
if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull ) |
|
2755 |
// If 'this' (InstPtr) is above the centerline and it is Object class |
|
2756 |
// then we can subclass in the Java class heirarchy. |
|
2757 |
if (klass()->equals(ciEnv::current()->Object_klass())) { |
|
2758 |
// that is, tp's array type is a subtype of my klass |
|
769 | 2759 |
return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id); |
1 | 2760 |
} |
2761 |
} |
|
2762 |
// The other case cannot happen, since I cannot be a subtype of an array. |
|
2763 |
// The meet falls down to Object class below centerline. |
|
2764 |
if( ptr == Constant ) |
|
2765 |
ptr = NotNull; |
|
769 | 2766 |
instance_id = InstanceBot; |
2767 |
return make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id ); |
|
1 | 2768 |
default: typerr(t); |
2769 |
} |
|
2770 |
} |
|
2771 |
||
2772 |
case OopPtr: { // Meeting to OopPtrs |
|
2773 |
// Found a OopPtr type vs self-InstPtr type |
|
2774 |
const TypePtr *tp = t->is_oopptr(); |
|
2775 |
int offset = meet_offset(tp->offset()); |
|
2776 |
PTR ptr = meet_ptr(tp->ptr()); |
|
2777 |
switch (tp->ptr()) { |
|
2778 |
case TopPTR: |
|
769 | 2779 |
case AnyNull: { |
2780 |
int instance_id = meet_instance_id(InstanceTop); |
|
1 | 2781 |
return make(ptr, klass(), klass_is_exact(), |
769 | 2782 |
(ptr == Constant ? const_oop() : NULL), offset, instance_id); |
2783 |
} |
|
1 | 2784 |
case NotNull: |
2785 |
case BotPTR: |
|
2786 |
return TypeOopPtr::make(ptr, offset); |
|
2787 |
default: typerr(t); |
|
2788 |
} |
|
2789 |
} |
|
2790 |
||
2791 |
case AnyPtr: { // Meeting to AnyPtrs |
|
2792 |
// Found an AnyPtr type vs self-InstPtr type |
|
2793 |
const TypePtr *tp = t->is_ptr(); |
|
2794 |
int offset = meet_offset(tp->offset()); |
|
2795 |
PTR ptr = meet_ptr(tp->ptr()); |
|
2796 |
switch (tp->ptr()) { |
|
2797 |
case Null: |
|
2798 |
if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset ); |
|
769 | 2799 |
// else fall through to AnyNull |
1 | 2800 |
case TopPTR: |
769 | 2801 |
case AnyNull: { |
2802 |
int instance_id = meet_instance_id(InstanceTop); |
|
1 | 2803 |
return make( ptr, klass(), klass_is_exact(), |
769 | 2804 |
(ptr == Constant ? const_oop() : NULL), offset, instance_id); |
2805 |
} |
|
1 | 2806 |
case NotNull: |
2807 |
case BotPTR: |
|
2808 |
return TypePtr::make( AnyPtr, ptr, offset ); |
|
2809 |
default: typerr(t); |
|
2810 |
} |
|
2811 |
} |
|
2812 |
||
2813 |
/* |
|
2814 |
A-top } |
|
2815 |
/ | \ } Tops |
|
2816 |
B-top A-any C-top } |
|
2817 |
| / | \ | } Any-nulls |
|
2818 |
B-any | C-any } |
|
2819 |
| | | |
|
2820 |
B-con A-con C-con } constants; not comparable across classes |
|
2821 |
| | | |
|
2822 |
B-not | C-not } |
|
2823 |
| \ | / | } not-nulls |
|
2824 |
B-bot A-not C-bot } |
|
2825 |
\ | / } Bottoms |
|
2826 |
A-bot } |
|
2827 |
*/ |
|
2828 |
||
2829 |
case InstPtr: { // Meeting 2 Oops? |
|
2830 |
// Found an InstPtr sub-type vs self-InstPtr type |
|
2831 |
const TypeInstPtr *tinst = t->is_instptr(); |
|
2832 |
int off = meet_offset( tinst->offset() ); |
|
2833 |
PTR ptr = meet_ptr( tinst->ptr() ); |
|
769 | 2834 |
int instance_id = meet_instance_id(tinst->instance_id()); |
1 | 2835 |
|
2836 |
// Check for easy case; klasses are equal (and perhaps not loaded!) |
|
2837 |
// If we have constants, then we created oops so classes are loaded |
|
2838 |
// and we can handle the constants further down. This case handles |
|
2839 |
// both-not-loaded or both-loaded classes |
|
2840 |
if (ptr != Constant && klass()->equals(tinst->klass()) && klass_is_exact() == tinst->klass_is_exact()) { |
|
2841 |
return make( ptr, klass(), klass_is_exact(), NULL, off, instance_id ); |
|
2842 |
} |
|
2843 |
||
2844 |
// Classes require inspection in the Java klass hierarchy. Must be loaded. |
|
2845 |
ciKlass* tinst_klass = tinst->klass(); |
|
2846 |
ciKlass* this_klass = this->klass(); |
|
2847 |
bool tinst_xk = tinst->klass_is_exact(); |
|
2848 |
bool this_xk = this->klass_is_exact(); |
|
2849 |
if (!tinst_klass->is_loaded() || !this_klass->is_loaded() ) { |
|
2850 |
// One of these classes has not been loaded |
|
2851 |
const TypeInstPtr *unloaded_meet = xmeet_unloaded(tinst); |
|
2852 |
#ifndef PRODUCT |
|
2853 |
if( PrintOpto && Verbose ) { |
|
2854 |
tty->print("meet of unloaded classes resulted in: "); unloaded_meet->dump(); tty->cr(); |
|
2855 |
tty->print(" this == "); this->dump(); tty->cr(); |
|
2856 |
tty->print(" tinst == "); tinst->dump(); tty->cr(); |
|
2857 |
} |
|
2858 |
#endif |
|
2859 |
return unloaded_meet; |
|
2860 |
} |
|
2861 |
||
2862 |
// Handle mixing oops and interfaces first. |
|
2863 |
if( this_klass->is_interface() && !tinst_klass->is_interface() ) { |
|
2864 |
ciKlass *tmp = tinst_klass; // Swap interface around |
|
2865 |
tinst_klass = this_klass; |
|
2866 |
this_klass = tmp; |
|
2867 |
bool tmp2 = tinst_xk; |
|
2868 |
tinst_xk = this_xk; |
|
2869 |
this_xk = tmp2; |
|
2870 |
} |
|
2871 |
if (tinst_klass->is_interface() && |
|
2872 |
!(this_klass->is_interface() || |
|
2873 |
// Treat java/lang/Object as an honorary interface, |
|
2874 |
// because we need a bottom for the interface hierarchy. |
|
2875 |
this_klass == ciEnv::current()->Object_klass())) { |
|
2876 |
// Oop meets interface! |
|
2877 |
||
2878 |
// See if the oop subtypes (implements) interface. |
|
2879 |
ciKlass *k; |
|
2880 |
bool xk; |
|
2881 |
if( this_klass->is_subtype_of( tinst_klass ) ) { |
|
2882 |
// Oop indeed subtypes. Now keep oop or interface depending |
|
2883 |
// on whether we are both above the centerline or either is |
|
2884 |
// below the centerline. If we are on the centerline |
|
2885 |
// (e.g., Constant vs. AnyNull interface), use the constant. |
|
2886 |
k = below_centerline(ptr) ? tinst_klass : this_klass; |
|
2887 |
// If we are keeping this_klass, keep its exactness too. |
|
2888 |
xk = below_centerline(ptr) ? tinst_xk : this_xk; |
|
2889 |
} else { // Does not implement, fall to Object |
|
2890 |
// Oop does not implement interface, so mixing falls to Object |
|
2891 |
// just like the verifier does (if both are above the |
|
2892 |
// centerline fall to interface) |
|
2893 |
k = above_centerline(ptr) ? tinst_klass : ciEnv::current()->Object_klass(); |
|
2894 |
xk = above_centerline(ptr) ? tinst_xk : false; |
|
2895 |
// Watch out for Constant vs. AnyNull interface. |
|
2896 |
if (ptr == Constant) ptr = NotNull; // forget it was a constant |
|
955 | 2897 |
instance_id = InstanceBot; |
1 | 2898 |
} |
2899 |
ciObject* o = NULL; // the Constant value, if any |
|
2900 |
if (ptr == Constant) { |
|
2901 |
// Find out which constant. |
|
2902 |
o = (this_klass == klass()) ? const_oop() : tinst->const_oop(); |
|
2903 |
} |
|
769 | 2904 |
return make( ptr, k, xk, o, off, instance_id ); |
1 | 2905 |
} |
2906 |
||
2907 |
// Either oop vs oop or interface vs interface or interface vs Object |
|
2908 |
||
2909 |
// !!! Here's how the symmetry requirement breaks down into invariants: |
|
2910 |
// If we split one up & one down AND they subtype, take the down man. |
|
2911 |
// If we split one up & one down AND they do NOT subtype, "fall hard". |
|
2912 |
// If both are up and they subtype, take the subtype class. |
|
2913 |
// If both are up and they do NOT subtype, "fall hard". |
|
2914 |
// If both are down and they subtype, take the supertype class. |
|
2915 |
// If both are down and they do NOT subtype, "fall hard". |
|
2916 |
// Constants treated as down. |
|
2917 |
||
2918 |
// Now, reorder the above list; observe that both-down+subtype is also |
|
2919 |
// "fall hard"; "fall hard" becomes the default case: |
|
2920 |
// If we split one up & one down AND they subtype, take the down man. |
|
2921 |
// If both are up and they subtype, take the subtype class. |
|
2922 |
||
2923 |
// If both are down and they subtype, "fall hard". |
|
2924 |
// If both are down and they do NOT subtype, "fall hard". |
|
2925 |
// If both are up and they do NOT subtype, "fall hard". |
|
2926 |
// If we split one up & one down AND they do NOT subtype, "fall hard". |
|
2927 |
||
2928 |
// If a proper subtype is exact, and we return it, we return it exactly. |
|
2929 |
// If a proper supertype is exact, there can be no subtyping relationship! |
|
2930 |
// If both types are equal to the subtype, exactness is and-ed below the |
|
2931 |
// centerline and or-ed above it. (N.B. Constants are always exact.) |
|
2932 |
||
2933 |
// Check for subtyping: |
|
2934 |
ciKlass *subtype = NULL; |
|
2935 |
bool subtype_exact = false; |
|
2936 |
if( tinst_klass->equals(this_klass) ) { |
|
2937 |
subtype = this_klass; |
|
2938 |
subtype_exact = below_centerline(ptr) ? (this_xk & tinst_xk) : (this_xk | tinst_xk); |
|
2939 |
} else if( !tinst_xk && this_klass->is_subtype_of( tinst_klass ) ) { |
|
2940 |
subtype = this_klass; // Pick subtyping class |
|
2941 |
subtype_exact = this_xk; |
|
2942 |
} else if( !this_xk && tinst_klass->is_subtype_of( this_klass ) ) { |
|
2943 |
subtype = tinst_klass; // Pick subtyping class |
|
2944 |
subtype_exact = tinst_xk; |
|
2945 |
} |
|
2946 |
||
2947 |
if( subtype ) { |
|
2948 |
if( above_centerline(ptr) ) { // both are up? |
|
2949 |
this_klass = tinst_klass = subtype; |
|
2950 |
this_xk = tinst_xk = subtype_exact; |
|
2951 |
} else if( above_centerline(this ->_ptr) && !above_centerline(tinst->_ptr) ) { |
|
2952 |
this_klass = tinst_klass; // tinst is down; keep down man |
|
2953 |
this_xk = tinst_xk; |
|
2954 |
} else if( above_centerline(tinst->_ptr) && !above_centerline(this ->_ptr) ) { |
|
2955 |
tinst_klass = this_klass; // this is down; keep down man |
|
2956 |
tinst_xk = this_xk; |
|
2957 |
} else { |
|
2958 |
this_xk = subtype_exact; // either they are equal, or we'll do an LCA |
|
2959 |
} |
|
2960 |
} |
|
2961 |
||
2962 |
// Check for classes now being equal |
|
2963 |
if (tinst_klass->equals(this_klass)) { |
|
2964 |
// If the klasses are equal, the constants may still differ. Fall to |
|
2965 |
// NotNull if they do (neither constant is NULL; that is a special case |
|
2966 |
// handled elsewhere). |
|
2967 |
ciObject* o = NULL; // Assume not constant when done |
|
2968 |
ciObject* this_oop = const_oop(); |
|
2969 |
ciObject* tinst_oop = tinst->const_oop(); |
|
2970 |
if( ptr == Constant ) { |
|
2971 |
if (this_oop != NULL && tinst_oop != NULL && |
|
2972 |
this_oop->equals(tinst_oop) ) |
|
2973 |
o = this_oop; |
|
2974 |
else if (above_centerline(this ->_ptr)) |
|
2975 |
o = tinst_oop; |
|
2976 |
else if (above_centerline(tinst ->_ptr)) |
|
2977 |
o = this_oop; |
|
2978 |
else |
|
2979 |
ptr = NotNull; |
|
2980 |
} |
|
2981 |
return make( ptr, this_klass, this_xk, o, off, instance_id ); |
|
2982 |
} // Else classes are not equal |
|
2983 |
||
2984 |
// Since klasses are different, we require a LCA in the Java |
|
2985 |
// class hierarchy - which means we have to fall to at least NotNull. |
|
2986 |
if( ptr == TopPTR || ptr == AnyNull || ptr == Constant ) |
|
2987 |
ptr = NotNull; |
|
955 | 2988 |
instance_id = InstanceBot; |
1 | 2989 |
|
2990 |
// Now we find the LCA of Java classes |
|
2991 |
ciKlass* k = this_klass->least_common_ancestor(tinst_klass); |
|
769 | 2992 |
return make( ptr, k, false, NULL, off, instance_id ); |
1 | 2993 |
} // End of case InstPtr |
2994 |
||
2995 |
case KlassPtr: |
|
2996 |
return TypeInstPtr::BOTTOM; |
|
2997 |
||
2998 |
} // End of switch |
|
2999 |
return this; // Return the double constant |
|
3000 |
} |
|
3001 |
||
3002 |
||
3003 |
//------------------------java_mirror_type-------------------------------------- |
|
3004 |
ciType* TypeInstPtr::java_mirror_type() const { |
|
3005 |
// must be a singleton type |
|
3006 |
if( const_oop() == NULL ) return NULL; |
|
3007 |
||
3008 |
// must be of type java.lang.Class |
|
3009 |
if( klass() != ciEnv::current()->Class_klass() ) return NULL; |
|
3010 |
||
3011 |
return const_oop()->as_instance()->java_mirror_type(); |
|
3012 |
} |
|
3013 |
||
3014 |
||
3015 |
//------------------------------xdual------------------------------------------ |
|
3016 |
// Dual: do NOT dual on klasses. This means I do NOT understand the Java |
|
3017 |
// inheritence mechanism. |
|
3018 |
const Type *TypeInstPtr::xdual() const { |
|
769 | 3019 |
return new TypeInstPtr( dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id() ); |
1 | 3020 |
} |
3021 |
||
3022 |
//------------------------------eq--------------------------------------------- |
|
3023 |
// Structural equality check for Type representations |
|
3024 |
bool TypeInstPtr::eq( const Type *t ) const { |
|
3025 |
const TypeInstPtr *p = t->is_instptr(); |
|
3026 |
return |
|
3027 |
klass()->equals(p->klass()) && |
|
3028 |
TypeOopPtr::eq(p); // Check sub-type stuff |
|
3029 |
} |
|
3030 |
||
3031 |
//------------------------------hash------------------------------------------- |
|
3032 |
// Type-specific hashing function. |
|
3033 |
int TypeInstPtr::hash(void) const { |
|
3034 |
int hash = klass()->hash() + TypeOopPtr::hash(); |
|
3035 |
return hash; |
|
3036 |
} |
|
3037 |
||
3038 |
//------------------------------dump2------------------------------------------ |
|
3039 |
// Dump oop Type |
|
3040 |
#ifndef PRODUCT |
|
3041 |
void TypeInstPtr::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
3042 |
// Print the name of the klass. |
|
3043 |
klass()->print_name_on(st); |
|
3044 |
||
3045 |
switch( _ptr ) { |
|
3046 |
case Constant: |
|
3047 |
// TO DO: Make CI print the hex address of the underlying oop. |
|
3048 |
if (WizardMode || Verbose) { |
|
3049 |
const_oop()->print_oop(st); |
|
3050 |
} |
|
3051 |
case BotPTR: |
|
3052 |
if (!WizardMode && !Verbose) { |
|
3053 |
if( _klass_is_exact ) st->print(":exact"); |
|
3054 |
break; |
|
3055 |
} |
|
3056 |
case TopPTR: |
|
3057 |
case AnyNull: |
|
3058 |
case NotNull: |
|
3059 |
st->print(":%s", ptr_msg[_ptr]); |
|
3060 |
if( _klass_is_exact ) st->print(":exact"); |
|
3061 |
break; |
|
3062 |
} |
|
3063 |
||
3064 |
if( _offset ) { // Dump offset, if any |
|
3065 |
if( _offset == OffsetBot ) st->print("+any"); |
|
3066 |
else if( _offset == OffsetTop ) st->print("+unknown"); |
|
3067 |
else st->print("+%d", _offset); |
|
3068 |
} |
|
3069 |
||
3070 |
st->print(" *"); |
|
769 | 3071 |
if (_instance_id == InstanceTop) |
3072 |
st->print(",iid=top"); |
|
3073 |
else if (_instance_id != InstanceBot) |
|
1 | 3074 |
st->print(",iid=%d",_instance_id); |
3075 |
} |
|
3076 |
#endif |
|
3077 |
||
3078 |
//------------------------------add_offset------------------------------------- |
|
3079 |
const TypePtr *TypeInstPtr::add_offset( int offset ) const { |
|
3080 |
return make( _ptr, klass(), klass_is_exact(), const_oop(), xadd_offset(offset), _instance_id ); |
|
3081 |
} |
|
3082 |
||
3083 |
//============================================================================= |
|
3084 |
// Convenience common pre-built types. |
|
3085 |
const TypeAryPtr *TypeAryPtr::RANGE; |
|
3086 |
const TypeAryPtr *TypeAryPtr::OOPS; |
|
589 | 3087 |
const TypeAryPtr *TypeAryPtr::NARROWOOPS; |
1 | 3088 |
const TypeAryPtr *TypeAryPtr::BYTES; |
3089 |
const TypeAryPtr *TypeAryPtr::SHORTS; |
|
3090 |
const TypeAryPtr *TypeAryPtr::CHARS; |
|
3091 |
const TypeAryPtr *TypeAryPtr::INTS; |
|
3092 |
const TypeAryPtr *TypeAryPtr::LONGS; |
|
3093 |
const TypeAryPtr *TypeAryPtr::FLOATS; |
|
3094 |
const TypeAryPtr *TypeAryPtr::DOUBLES; |
|
3095 |
||
3096 |
//------------------------------make------------------------------------------- |
|
3097 |
const TypeAryPtr *TypeAryPtr::make( PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id ) { |
|
3098 |
assert(!(k == NULL && ary->_elem->isa_int()), |
|
3099 |
"integral arrays must be pre-equipped with a class"); |
|
3100 |
if (!xk) xk = ary->ary_must_be_exact(); |
|
955 | 3101 |
assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); |
1 | 3102 |
if (!UseExactTypes) xk = (ptr == Constant); |
3103 |
return (TypeAryPtr*)(new TypeAryPtr(ptr, NULL, ary, k, xk, offset, instance_id))->hashcons(); |
|
3104 |
} |
|
3105 |
||
3106 |
//------------------------------make------------------------------------------- |
|
3107 |
const TypeAryPtr *TypeAryPtr::make( PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id ) { |
|
3108 |
assert(!(k == NULL && ary->_elem->isa_int()), |
|
3109 |
"integral arrays must be pre-equipped with a class"); |
|
3110 |
assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" ); |
|
3111 |
if (!xk) xk = (o != NULL) || ary->ary_must_be_exact(); |
|
955 | 3112 |
assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); |
1 | 3113 |
if (!UseExactTypes) xk = (ptr == Constant); |
3114 |
return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id))->hashcons(); |
|
3115 |
} |
|
3116 |
||
3117 |
//------------------------------cast_to_ptr_type------------------------------- |
|
3118 |
const Type *TypeAryPtr::cast_to_ptr_type(PTR ptr) const { |
|
3119 |
if( ptr == _ptr ) return this; |
|
769 | 3120 |
return make(ptr, const_oop(), _ary, klass(), klass_is_exact(), _offset, _instance_id); |
1 | 3121 |
} |
3122 |
||
3123 |
||
3124 |
//-----------------------------cast_to_exactness------------------------------- |
|
3125 |
const Type *TypeAryPtr::cast_to_exactness(bool klass_is_exact) const { |
|
3126 |
if( klass_is_exact == _klass_is_exact ) return this; |
|
3127 |
if (!UseExactTypes) return this; |
|
3128 |
if (_ary->ary_must_be_exact()) return this; // cannot clear xk |
|
3129 |
return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id); |
|
3130 |
} |
|
3131 |
||
955 | 3132 |
//-----------------------------cast_to_instance_id---------------------------- |
769 | 3133 |
const TypeOopPtr *TypeAryPtr::cast_to_instance_id(int instance_id) const { |
3134 |
if( instance_id == _instance_id ) return this; |
|
955 | 3135 |
return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id); |
1 | 3136 |
} |
3137 |
||
3138 |
//-----------------------------narrow_size_type------------------------------- |
|
3139 |
// Local cache for arrayOopDesc::max_array_length(etype), |
|
3140 |
// which is kind of slow (and cached elsewhere by other users). |
|
3141 |
static jint max_array_length_cache[T_CONFLICT+1]; |
|
3142 |
static jint max_array_length(BasicType etype) { |
|
3143 |
jint& cache = max_array_length_cache[etype]; |
|
3144 |
jint res = cache; |
|
3145 |
if (res == 0) { |
|
3146 |
switch (etype) { |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3147 |
case T_NARROWOOP: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3148 |
etype = T_OBJECT; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3149 |
break; |
1 | 3150 |
case T_CONFLICT: |
3151 |
case T_ILLEGAL: |
|
3152 |
case T_VOID: |
|
3153 |
etype = T_BYTE; // will produce conservatively high value |
|
3154 |
} |
|
3155 |
cache = res = arrayOopDesc::max_array_length(etype); |
|
3156 |
} |
|
3157 |
return res; |
|
3158 |
} |
|
3159 |
||
3160 |
// Narrow the given size type to the index range for the given array base type. |
|
3161 |
// Return NULL if the resulting int type becomes empty. |
|
3162 |
const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size, BasicType elem) { |
|
3163 |
jint hi = size->_hi; |
|
3164 |
jint lo = size->_lo; |
|
3165 |
jint min_lo = 0; |
|
3166 |
jint max_hi = max_array_length(elem); |
|
3167 |
//if (index_not_size) --max_hi; // type of a valid array index, FTR |
|
3168 |
bool chg = false; |
|
3169 |
if (lo < min_lo) { lo = min_lo; chg = true; } |
|
3170 |
if (hi > max_hi) { hi = max_hi; chg = true; } |
|
3171 |
if (lo > hi) |
|
3172 |
return NULL; |
|
3173 |
if (!chg) |
|
3174 |
return size; |
|
3175 |
return TypeInt::make(lo, hi, Type::WidenMin); |
|
3176 |
} |
|
3177 |
||
3178 |
//-------------------------------cast_to_size---------------------------------- |
|
3179 |
const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const { |
|
3180 |
assert(new_size != NULL, ""); |
|
3181 |
new_size = narrow_size_type(new_size, elem()->basic_type()); |
|
3182 |
if (new_size == NULL) // Negative length arrays will produce weird |
|
3183 |
new_size = TypeInt::ZERO; // intermediate dead fast-path goo |
|
3184 |
if (new_size == size()) return this; |
|
3185 |
const TypeAry* new_ary = TypeAry::make(elem(), new_size); |
|
769 | 3186 |
return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id); |
1 | 3187 |
} |
3188 |
||
3189 |
||
3190 |
//------------------------------eq--------------------------------------------- |
|
3191 |
// Structural equality check for Type representations |
|
3192 |
bool TypeAryPtr::eq( const Type *t ) const { |
|
3193 |
const TypeAryPtr *p = t->is_aryptr(); |
|
3194 |
return |
|
3195 |
_ary == p->_ary && // Check array |
|
3196 |
TypeOopPtr::eq(p); // Check sub-parts |
|
3197 |
} |
|
3198 |
||
3199 |
//------------------------------hash------------------------------------------- |
|
3200 |
// Type-specific hashing function. |
|
3201 |
int TypeAryPtr::hash(void) const { |
|
3202 |
return (intptr_t)_ary + TypeOopPtr::hash(); |
|
3203 |
} |
|
3204 |
||
3205 |
//------------------------------meet------------------------------------------- |
|
3206 |
// Compute the MEET of two types. It returns a new Type object. |
|
3207 |
const Type *TypeAryPtr::xmeet( const Type *t ) const { |
|
3208 |
// Perform a fast test for common case; meeting the same types together. |
|
3209 |
if( this == t ) return this; // Meeting same type-rep? |
|
3210 |
// Current "this->_base" is Pointer |
|
3211 |
switch (t->base()) { // switch on original type |
|
3212 |
||
3213 |
// Mixing ints & oops happens when javac reuses local variables |
|
3214 |
case Int: |
|
3215 |
case Long: |
|
3216 |
case FloatTop: |
|
3217 |
case FloatCon: |
|
3218 |
case FloatBot: |
|
3219 |
case DoubleTop: |
|
3220 |
case DoubleCon: |
|
3221 |
case DoubleBot: |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3222 |
case NarrowOop: |
1 | 3223 |
case Bottom: // Ye Olde Default |
3224 |
return Type::BOTTOM; |
|
3225 |
case Top: |
|
3226 |
return this; |
|
3227 |
||
3228 |
default: // All else is a mistake |
|
3229 |
typerr(t); |
|
3230 |
||
3231 |
case OopPtr: { // Meeting to OopPtrs |
|
3232 |
// Found a OopPtr type vs self-AryPtr type |
|
3233 |
const TypePtr *tp = t->is_oopptr(); |
|
3234 |
int offset = meet_offset(tp->offset()); |
|
3235 |
PTR ptr = meet_ptr(tp->ptr()); |
|
3236 |
switch (tp->ptr()) { |
|
3237 |
case TopPTR: |
|
769 | 3238 |
case AnyNull: { |
3239 |
int instance_id = meet_instance_id(InstanceTop); |
|
3240 |
return make(ptr, (ptr == Constant ? const_oop() : NULL), |
|
3241 |
_ary, _klass, _klass_is_exact, offset, instance_id); |
|
3242 |
} |
|
1 | 3243 |
case BotPTR: |
3244 |
case NotNull: |
|
3245 |
return TypeOopPtr::make(ptr, offset); |
|
3246 |
default: ShouldNotReachHere(); |
|
3247 |
} |
|
3248 |
} |
|
3249 |
||
3250 |
case AnyPtr: { // Meeting two AnyPtrs |
|
3251 |
// Found an AnyPtr type vs self-AryPtr type |
|
3252 |
const TypePtr *tp = t->is_ptr(); |
|
3253 |
int offset = meet_offset(tp->offset()); |
|
3254 |
PTR ptr = meet_ptr(tp->ptr()); |
|
3255 |
switch (tp->ptr()) { |
|
3256 |
case TopPTR: |
|
3257 |
return this; |
|
3258 |
case BotPTR: |
|
3259 |
case NotNull: |
|
3260 |
return TypePtr::make(AnyPtr, ptr, offset); |
|
3261 |
case Null: |
|
3262 |
if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset); |
|
769 | 3263 |
// else fall through to AnyNull |
3264 |
case AnyNull: { |
|
3265 |
int instance_id = meet_instance_id(InstanceTop); |
|
3266 |
return make( ptr, (ptr == Constant ? const_oop() : NULL), |
|
3267 |
_ary, _klass, _klass_is_exact, offset, instance_id); |
|
3268 |
} |
|
1 | 3269 |
default: ShouldNotReachHere(); |
3270 |
} |
|
3271 |
} |
|
3272 |
||
3273 |
case RawPtr: return TypePtr::BOTTOM; |
|
3274 |
||
3275 |
case AryPtr: { // Meeting 2 references? |
|
3276 |
const TypeAryPtr *tap = t->is_aryptr(); |
|
3277 |
int off = meet_offset(tap->offset()); |
|
3278 |
const TypeAry *tary = _ary->meet(tap->_ary)->is_ary(); |
|
3279 |
PTR ptr = meet_ptr(tap->ptr()); |
|
769 | 3280 |
int instance_id = meet_instance_id(tap->instance_id()); |
1 | 3281 |
ciKlass* lazy_klass = NULL; |
3282 |
if (tary->_elem->isa_int()) { |
|
3283 |
// Integral array element types have irrelevant lattice relations. |
|
3284 |
// It is the klass that determines array layout, not the element type. |
|
3285 |
if (_klass == NULL) |
|
3286 |
lazy_klass = tap->_klass; |
|
3287 |
else if (tap->_klass == NULL || tap->_klass == _klass) { |
|
3288 |
lazy_klass = _klass; |
|
3289 |
} else { |
|
3290 |
// Something like byte[int+] meets char[int+]. |
|
3291 |
// This must fall to bottom, not (int[-128..65535])[int+]. |
|
955 | 3292 |
instance_id = InstanceBot; |
1 | 3293 |
tary = TypeAry::make(Type::BOTTOM, tary->_size); |
3294 |
} |
|
3295 |
} |
|
3296 |
bool xk; |
|
3297 |
switch (tap->ptr()) { |
|
3298 |
case AnyNull: |
|
3299 |
case TopPTR: |
|
3300 |
// Compute new klass on demand, do not use tap->_klass |
|
3301 |
xk = (tap->_klass_is_exact | this->_klass_is_exact); |
|
769 | 3302 |
return make( ptr, const_oop(), tary, lazy_klass, xk, off, instance_id ); |
1 | 3303 |
case Constant: { |
3304 |
ciObject* o = const_oop(); |
|
3305 |
if( _ptr == Constant ) { |
|
3306 |
if( tap->const_oop() != NULL && !o->equals(tap->const_oop()) ) { |
|
3307 |
ptr = NotNull; |
|
3308 |
o = NULL; |
|
955 | 3309 |
instance_id = InstanceBot; |
1 | 3310 |
} |
3311 |
} else if( above_centerline(_ptr) ) { |
|
3312 |
o = tap->const_oop(); |
|
3313 |
} |
|
3314 |
xk = true; |
|
769 | 3315 |
return TypeAryPtr::make( ptr, o, tary, tap->_klass, xk, off, instance_id ); |
1 | 3316 |
} |
3317 |
case NotNull: |
|
3318 |
case BotPTR: |
|
3319 |
// Compute new klass on demand, do not use tap->_klass |
|
3320 |
if (above_centerline(this->_ptr)) |
|
3321 |
xk = tap->_klass_is_exact; |
|
3322 |
else if (above_centerline(tap->_ptr)) |
|
3323 |
xk = this->_klass_is_exact; |
|
3324 |
else xk = (tap->_klass_is_exact & this->_klass_is_exact) && |
|
3325 |
(klass() == tap->klass()); // Only precise for identical arrays |
|
769 | 3326 |
return TypeAryPtr::make( ptr, NULL, tary, lazy_klass, xk, off, instance_id ); |
1 | 3327 |
default: ShouldNotReachHere(); |
3328 |
} |
|
3329 |
} |
|
3330 |
||
3331 |
// All arrays inherit from Object class |
|
3332 |
case InstPtr: { |
|
3333 |
const TypeInstPtr *tp = t->is_instptr(); |
|
3334 |
int offset = meet_offset(tp->offset()); |
|
3335 |
PTR ptr = meet_ptr(tp->ptr()); |
|
769 | 3336 |
int instance_id = meet_instance_id(tp->instance_id()); |
1 | 3337 |
switch (ptr) { |
3338 |
case TopPTR: |
|
3339 |
case AnyNull: // Fall 'down' to dual of object klass |
|
3340 |
if( tp->klass()->equals(ciEnv::current()->Object_klass()) ) { |
|
769 | 3341 |
return TypeAryPtr::make( ptr, _ary, _klass, _klass_is_exact, offset, instance_id ); |
1 | 3342 |
} else { |
3343 |
// cannot subclass, so the meet has to fall badly below the centerline |
|
3344 |
ptr = NotNull; |
|
769 | 3345 |
instance_id = InstanceBot; |
3346 |
return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id); |
|
1 | 3347 |
} |
3348 |
case Constant: |
|
3349 |
case NotNull: |
|
3350 |
case BotPTR: // Fall down to object klass |
|
3351 |
// LCA is object_klass, but if we subclass from the top we can do better |
|
3352 |
if (above_centerline(tp->ptr())) { |
|
3353 |
// If 'tp' is above the centerline and it is Object class |
|
3354 |
// then we can subclass in the Java class heirarchy. |
|
3355 |
if( tp->klass()->equals(ciEnv::current()->Object_klass()) ) { |
|
3356 |
// that is, my array type is a subtype of 'tp' klass |
|
769 | 3357 |
return make( ptr, _ary, _klass, _klass_is_exact, offset, instance_id ); |
1 | 3358 |
} |
3359 |
} |
|
3360 |
// The other case cannot happen, since t cannot be a subtype of an array. |
|
3361 |
// The meet falls down to Object class below centerline. |
|
3362 |
if( ptr == Constant ) |
|
3363 |
ptr = NotNull; |
|
769 | 3364 |
instance_id = InstanceBot; |
3365 |
return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id); |
|
1 | 3366 |
default: typerr(t); |
3367 |
} |
|
3368 |
} |
|
3369 |
||
3370 |
case KlassPtr: |
|
3371 |
return TypeInstPtr::BOTTOM; |
|
3372 |
||
3373 |
} |
|
3374 |
return this; // Lint noise |
|
3375 |
} |
|
3376 |
||
3377 |
//------------------------------xdual------------------------------------------ |
|
3378 |
// Dual: compute field-by-field dual |
|
3379 |
const Type *TypeAryPtr::xdual() const { |
|
769 | 3380 |
return new TypeAryPtr( dual_ptr(), _const_oop, _ary->dual()->is_ary(),_klass, _klass_is_exact, dual_offset(), dual_instance_id() ); |
1 | 3381 |
} |
3382 |
||
3383 |
//------------------------------dump2------------------------------------------ |
|
3384 |
#ifndef PRODUCT |
|
3385 |
void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
3386 |
_ary->dump2(d,depth,st); |
|
3387 |
switch( _ptr ) { |
|
3388 |
case Constant: |
|
3389 |
const_oop()->print(st); |
|
3390 |
break; |
|
3391 |
case BotPTR: |
|
3392 |
if (!WizardMode && !Verbose) { |
|
3393 |
if( _klass_is_exact ) st->print(":exact"); |
|
3394 |
break; |
|
3395 |
} |
|
3396 |
case TopPTR: |
|
3397 |
case AnyNull: |
|
3398 |
case NotNull: |
|
3399 |
st->print(":%s", ptr_msg[_ptr]); |
|
3400 |
if( _klass_is_exact ) st->print(":exact"); |
|
3401 |
break; |
|
3402 |
} |
|
3403 |
||
237
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3404 |
if( _offset != 0 ) { |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3405 |
int header_size = objArrayOopDesc::header_size() * wordSize; |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3406 |
if( _offset == OffsetTop ) st->print("+undefined"); |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3407 |
else if( _offset == OffsetBot ) st->print("+any"); |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3408 |
else if( _offset < header_size ) st->print("+%d", _offset); |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3409 |
else { |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3410 |
BasicType basic_elem_type = elem()->basic_type(); |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3411 |
int array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type); |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3412 |
int elem_size = type2aelembytes(basic_elem_type); |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3413 |
st->print("[%d]", (_offset - array_base)/elem_size); |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3414 |
} |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3415 |
} |
fba97e902303
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
1
diff
changeset
|
3416 |
st->print(" *"); |
769 | 3417 |
if (_instance_id == InstanceTop) |
3418 |
st->print(",iid=top"); |
|
3419 |
else if (_instance_id != InstanceBot) |
|
1 | 3420 |
st->print(",iid=%d",_instance_id); |
3421 |
} |
|
3422 |
#endif |
|
3423 |
||
3424 |
bool TypeAryPtr::empty(void) const { |
|
3425 |
if (_ary->empty()) return true; |
|
3426 |
return TypeOopPtr::empty(); |
|
3427 |
} |
|
3428 |
||
3429 |
//------------------------------add_offset------------------------------------- |
|
3430 |
const TypePtr *TypeAryPtr::add_offset( int offset ) const { |
|
3431 |
return make( _ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id ); |
|
3432 |
} |
|
3433 |
||
3434 |
||
3435 |
//============================================================================= |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3436 |
const TypeNarrowOop *TypeNarrowOop::BOTTOM; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3437 |
const TypeNarrowOop *TypeNarrowOop::NULL_PTR; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3438 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3439 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3440 |
const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3441 |
return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3442 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3443 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3444 |
//------------------------------hash------------------------------------------- |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3445 |
// Type-specific hashing function. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3446 |
int TypeNarrowOop::hash(void) const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3447 |
return _ooptype->hash() + 7; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3448 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3449 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3450 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3451 |
bool TypeNarrowOop::eq( const Type *t ) const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3452 |
const TypeNarrowOop* tc = t->isa_narrowoop(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3453 |
if (tc != NULL) { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3454 |
if (_ooptype->base() != tc->_ooptype->base()) { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3455 |
return false; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3456 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3457 |
return tc->_ooptype->eq(_ooptype); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3458 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3459 |
return false; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3460 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3461 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3462 |
bool TypeNarrowOop::singleton(void) const { // TRUE if type is a singleton |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3463 |
return _ooptype->singleton(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3464 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3465 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3466 |
bool TypeNarrowOop::empty(void) const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3467 |
return _ooptype->empty(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3468 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3469 |
|
1055
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3470 |
//------------------------------xmeet------------------------------------------ |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3471 |
// Compute the MEET of two types. It returns a new Type object. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3472 |
const Type *TypeNarrowOop::xmeet( const Type *t ) const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3473 |
// Perform a fast test for common case; meeting the same types together. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3474 |
if( this == t ) return this; // Meeting same type-rep? |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3475 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3476 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3477 |
// Current "this->_base" is OopPtr |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3478 |
switch (t->base()) { // switch on original type |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3479 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3480 |
case Int: // Mixing ints & oops happens when javac |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3481 |
case Long: // reuses local variables |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3482 |
case FloatTop: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3483 |
case FloatCon: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3484 |
case FloatBot: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3485 |
case DoubleTop: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3486 |
case DoubleCon: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3487 |
case DoubleBot: |
1055
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3488 |
case AnyPtr: |
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3489 |
case RawPtr: |
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3490 |
case OopPtr: |
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3491 |
case InstPtr: |
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3492 |
case KlassPtr: |
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3493 |
case AryPtr: |
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3494 |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3495 |
case Bottom: // Ye Olde Default |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3496 |
return Type::BOTTOM; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3497 |
case Top: |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3498 |
return this; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3499 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3500 |
case NarrowOop: { |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
3501 |
const Type* result = _ooptype->xmeet(t->make_ptr()); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3502 |
if (result->isa_ptr()) { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3503 |
return TypeNarrowOop::make(result->is_ptr()); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3504 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3505 |
return result; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3506 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3507 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3508 |
default: // All else is a mistake |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3509 |
typerr(t); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3510 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3511 |
} // End of switch |
1055
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3512 |
|
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3513 |
return this; |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3514 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3515 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3516 |
const Type *TypeNarrowOop::xdual() const { // Compute dual right now. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3517 |
const TypePtr* odual = _ooptype->dual()->is_ptr(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3518 |
return new TypeNarrowOop(odual); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3519 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3520 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3521 |
const Type *TypeNarrowOop::filter( const Type *kills ) const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3522 |
if (kills->isa_narrowoop()) { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3523 |
const Type* ft =_ooptype->filter(kills->is_narrowoop()->_ooptype); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3524 |
if (ft->empty()) |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3525 |
return Type::TOP; // Canonical empty value |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3526 |
if (ft->isa_ptr()) { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3527 |
return make(ft->isa_ptr()); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3528 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3529 |
return ft; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3530 |
} else if (kills->isa_ptr()) { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3531 |
const Type* ft = _ooptype->join(kills); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3532 |
if (ft->empty()) |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3533 |
return Type::TOP; // Canonical empty value |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3534 |
return ft; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3535 |
} else { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3536 |
return Type::TOP; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3537 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3538 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3539 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3540 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3541 |
intptr_t TypeNarrowOop::get_con() const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3542 |
return _ooptype->get_con(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3543 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3544 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3545 |
#ifndef PRODUCT |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3546 |
void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3547 |
tty->print("narrowoop: "); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3548 |
_ooptype->dump2(d, depth, st); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3549 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3550 |
#endif |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3551 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3552 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3553 |
//============================================================================= |
1 | 3554 |
// Convenience common pre-built types. |
3555 |
||
3556 |
// Not-null object klass or below |
|
3557 |
const TypeKlassPtr *TypeKlassPtr::OBJECT; |
|
3558 |
const TypeKlassPtr *TypeKlassPtr::OBJECT_OR_NULL; |
|
3559 |
||
3560 |
//------------------------------TypeKlasPtr------------------------------------ |
|
3561 |
TypeKlassPtr::TypeKlassPtr( PTR ptr, ciKlass* klass, int offset ) |
|
3562 |
: TypeOopPtr(KlassPtr, ptr, klass, (ptr==Constant), (ptr==Constant ? klass : NULL), offset, 0) { |
|
3563 |
} |
|
3564 |
||
3565 |
//------------------------------make------------------------------------------- |
|
3566 |
// ptr to klass 'k', if Constant, or possibly to a sub-klass if not a Constant |
|
3567 |
const TypeKlassPtr *TypeKlassPtr::make( PTR ptr, ciKlass* k, int offset ) { |
|
3568 |
assert( k != NULL, "Expect a non-NULL klass"); |
|
3569 |
assert(k->is_instance_klass() || k->is_array_klass() || |
|
3570 |
k->is_method_klass(), "Incorrect type of klass oop"); |
|
3571 |
TypeKlassPtr *r = |
|
3572 |
(TypeKlassPtr*)(new TypeKlassPtr(ptr, k, offset))->hashcons(); |
|
3573 |
||
3574 |
return r; |
|
3575 |
} |
|
3576 |
||
3577 |
//------------------------------eq--------------------------------------------- |
|
3578 |
// Structural equality check for Type representations |
|
3579 |
bool TypeKlassPtr::eq( const Type *t ) const { |
|
3580 |
const TypeKlassPtr *p = t->is_klassptr(); |
|
3581 |
return |
|
3582 |
klass()->equals(p->klass()) && |
|
3583 |
TypeOopPtr::eq(p); |
|
3584 |
} |
|
3585 |
||
3586 |
//------------------------------hash------------------------------------------- |
|
3587 |
// Type-specific hashing function. |
|
3588 |
int TypeKlassPtr::hash(void) const { |
|
3589 |
return klass()->hash() + TypeOopPtr::hash(); |
|
3590 |
} |
|
3591 |
||
3592 |
||
3593 |
//------------------------------klass------------------------------------------ |
|
3594 |
// Return the defining klass for this class |
|
3595 |
ciKlass* TypeAryPtr::klass() const { |
|
3596 |
if( _klass ) return _klass; // Return cached value, if possible |
|
3597 |
||
3598 |
// Oops, need to compute _klass and cache it |
|
3599 |
ciKlass* k_ary = NULL; |
|
3600 |
const TypeInstPtr *tinst; |
|
3601 |
const TypeAryPtr *tary; |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3602 |
const Type* el = elem(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3603 |
if (el->isa_narrowoop()) { |
767
64fb1fd7186d
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
609
diff
changeset
|
3604 |
el = el->make_ptr(); |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3605 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3606 |
|
1 | 3607 |
// Get element klass |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3608 |
if ((tinst = el->isa_instptr()) != NULL) { |
1 | 3609 |
// Compute array klass from element klass |
3610 |
k_ary = ciObjArrayKlass::make(tinst->klass()); |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3611 |
} else if ((tary = el->isa_aryptr()) != NULL) { |
1 | 3612 |
// Compute array klass from element klass |
3613 |
ciKlass* k_elem = tary->klass(); |
|
3614 |
// If element type is something like bottom[], k_elem will be null. |
|
3615 |
if (k_elem != NULL) |
|
3616 |
k_ary = ciObjArrayKlass::make(k_elem); |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3617 |
} else if ((el->base() == Type::Top) || |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3618 |
(el->base() == Type::Bottom)) { |
1 | 3619 |
// element type of Bottom occurs from meet of basic type |
3620 |
// and object; Top occurs when doing join on Bottom. |
|
3621 |
// Leave k_ary at NULL. |
|
3622 |
} else { |
|
3623 |
// Cannot compute array klass directly from basic type, |
|
3624 |
// since subtypes of TypeInt all have basic type T_INT. |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3625 |
assert(!el->isa_int(), |
1 | 3626 |
"integral arrays must be pre-equipped with a class"); |
3627 |
// Compute array klass directly from basic type |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3628 |
k_ary = ciTypeArrayKlass::make(el->basic_type()); |
1 | 3629 |
} |
3630 |
||
589 | 3631 |
if( this != TypeAryPtr::OOPS ) { |
1 | 3632 |
// The _klass field acts as a cache of the underlying |
3633 |
// ciKlass for this array type. In order to set the field, |
|
3634 |
// we need to cast away const-ness. |
|
3635 |
// |
|
3636 |
// IMPORTANT NOTE: we *never* set the _klass field for the |
|
3637 |
// type TypeAryPtr::OOPS. This Type is shared between all |
|
3638 |
// active compilations. However, the ciKlass which represents |
|
3639 |
// this Type is *not* shared between compilations, so caching |
|
3640 |
// this value would result in fetching a dangling pointer. |
|
3641 |
// |
|
3642 |
// Recomputing the underlying ciKlass for each request is |
|
3643 |
// a bit less efficient than caching, but calls to |
|
3644 |
// TypeAryPtr::OOPS->klass() are not common enough to matter. |
|
3645 |
((TypeAryPtr*)this)->_klass = k_ary; |
|
589 | 3646 |
if (UseCompressedOops && k_ary != NULL && k_ary->is_obj_array_klass() && |
3647 |
_offset != 0 && _offset != arrayOopDesc::length_offset_in_bytes()) { |
|
3648 |
((TypeAryPtr*)this)->_is_ptr_to_narrowoop = true; |
|
3649 |
} |
|
3650 |
} |
|
1 | 3651 |
return k_ary; |
3652 |
} |
|
3653 |
||
3654 |
||
3655 |
//------------------------------add_offset------------------------------------- |
|
3656 |
// Access internals of klass object |
|
3657 |
const TypePtr *TypeKlassPtr::add_offset( int offset ) const { |
|
3658 |
return make( _ptr, klass(), xadd_offset(offset) ); |
|
3659 |
} |
|
3660 |
||
3661 |
//------------------------------cast_to_ptr_type------------------------------- |
|
3662 |
const Type *TypeKlassPtr::cast_to_ptr_type(PTR ptr) const { |
|
3663 |
assert(_base == OopPtr, "subclass must override cast_to_ptr_type"); |
|
3664 |
if( ptr == _ptr ) return this; |
|
3665 |
return make(ptr, _klass, _offset); |
|
3666 |
} |
|
3667 |
||
3668 |
||
3669 |
//-----------------------------cast_to_exactness------------------------------- |
|
3670 |
const Type *TypeKlassPtr::cast_to_exactness(bool klass_is_exact) const { |
|
3671 |
if( klass_is_exact == _klass_is_exact ) return this; |
|
3672 |
if (!UseExactTypes) return this; |
|
3673 |
return make(klass_is_exact ? Constant : NotNull, _klass, _offset); |
|
3674 |
} |
|
3675 |
||
3676 |
||
3677 |
//-----------------------------as_instance_type-------------------------------- |
|
3678 |
// Corresponding type for an instance of the given class. |
|
3679 |
// It will be NotNull, and exact if and only if the klass type is exact. |
|
3680 |
const TypeOopPtr* TypeKlassPtr::as_instance_type() const { |
|
3681 |
ciKlass* k = klass(); |
|
3682 |
bool xk = klass_is_exact(); |
|
3683 |
//return TypeInstPtr::make(TypePtr::NotNull, k, xk, NULL, 0); |
|
3684 |
const TypeOopPtr* toop = TypeOopPtr::make_from_klass_raw(k); |
|
3685 |
toop = toop->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); |
|
3686 |
return toop->cast_to_exactness(xk)->is_oopptr(); |
|
3687 |
} |
|
3688 |
||
3689 |
||
3690 |
//------------------------------xmeet------------------------------------------ |
|
3691 |
// Compute the MEET of two types, return a new Type object. |
|
3692 |
const Type *TypeKlassPtr::xmeet( const Type *t ) const { |
|
3693 |
// Perform a fast test for common case; meeting the same types together. |
|
3694 |
if( this == t ) return this; // Meeting same type-rep? |
|
3695 |
||
3696 |
// Current "this->_base" is Pointer |
|
3697 |
switch (t->base()) { // switch on original type |
|
3698 |
||
3699 |
case Int: // Mixing ints & oops happens when javac |
|
3700 |
case Long: // reuses local variables |
|
3701 |
case FloatTop: |
|
3702 |
case FloatCon: |
|
3703 |
case FloatBot: |
|
3704 |
case DoubleTop: |
|
3705 |
case DoubleCon: |
|
3706 |
case DoubleBot: |
|
1055
f4fb9fb08038
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
955
diff
changeset
|
3707 |
case NarrowOop: |
1 | 3708 |
case Bottom: // Ye Olde Default |
3709 |
return Type::BOTTOM; |
|
3710 |
case Top: |
|
3711 |
return this; |
|
3712 |
||
3713 |
default: // All else is a mistake |
|
3714 |
typerr(t); |
|
3715 |
||
3716 |
case RawPtr: return TypePtr::BOTTOM; |
|
3717 |
||
3718 |
case OopPtr: { // Meeting to OopPtrs |
|
3719 |
// Found a OopPtr type vs self-KlassPtr type |
|
3720 |
const TypePtr *tp = t->is_oopptr(); |
|
3721 |
int offset = meet_offset(tp->offset()); |
|
3722 |
PTR ptr = meet_ptr(tp->ptr()); |
|
3723 |
switch (tp->ptr()) { |
|
3724 |
case TopPTR: |
|
3725 |
case AnyNull: |
|
3726 |
return make(ptr, klass(), offset); |
|
3727 |
case BotPTR: |
|
3728 |
case NotNull: |
|
3729 |
return TypePtr::make(AnyPtr, ptr, offset); |
|
3730 |
default: typerr(t); |
|
3731 |
} |
|
3732 |
} |
|
3733 |
||
3734 |
case AnyPtr: { // Meeting to AnyPtrs |
|
3735 |
// Found an AnyPtr type vs self-KlassPtr type |
|
3736 |
const TypePtr *tp = t->is_ptr(); |
|
3737 |
int offset = meet_offset(tp->offset()); |
|
3738 |
PTR ptr = meet_ptr(tp->ptr()); |
|
3739 |
switch (tp->ptr()) { |
|
3740 |
case TopPTR: |
|
3741 |
return this; |
|
3742 |
case Null: |
|
3743 |
if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset ); |
|
3744 |
case AnyNull: |
|
3745 |
return make( ptr, klass(), offset ); |
|
3746 |
case BotPTR: |
|
3747 |
case NotNull: |
|
3748 |
return TypePtr::make(AnyPtr, ptr, offset); |
|
3749 |
default: typerr(t); |
|
3750 |
} |
|
3751 |
} |
|
3752 |
||
3753 |
case AryPtr: // Meet with AryPtr |
|
3754 |
case InstPtr: // Meet with InstPtr |
|
3755 |
return TypeInstPtr::BOTTOM; |
|
3756 |
||
3757 |
// |
|
3758 |
// A-top } |
|
3759 |
// / | \ } Tops |
|
3760 |
// B-top A-any C-top } |
|
3761 |
// | / | \ | } Any-nulls |
|
3762 |
// B-any | C-any } |
|
3763 |
// | | | |
|
3764 |
// B-con A-con C-con } constants; not comparable across classes |
|
3765 |
// | | | |
|
3766 |
// B-not | C-not } |
|
3767 |
// | \ | / | } not-nulls |
|
3768 |
// B-bot A-not C-bot } |
|
3769 |
// \ | / } Bottoms |
|
3770 |
// A-bot } |
|
3771 |
// |
|
3772 |
||
3773 |
case KlassPtr: { // Meet two KlassPtr types |
|
3774 |
const TypeKlassPtr *tkls = t->is_klassptr(); |
|
3775 |
int off = meet_offset(tkls->offset()); |
|
3776 |
PTR ptr = meet_ptr(tkls->ptr()); |
|
3777 |
||
3778 |
// Check for easy case; klasses are equal (and perhaps not loaded!) |
|
3779 |
// If we have constants, then we created oops so classes are loaded |
|
3780 |
// and we can handle the constants further down. This case handles |
|
3781 |
// not-loaded classes |
|
3782 |
if( ptr != Constant && tkls->klass()->equals(klass()) ) { |
|
3783 |
return make( ptr, klass(), off ); |
|
3784 |
} |
|
3785 |
||
3786 |
// Classes require inspection in the Java klass hierarchy. Must be loaded. |
|
3787 |
ciKlass* tkls_klass = tkls->klass(); |
|
3788 |
ciKlass* this_klass = this->klass(); |
|
3789 |
assert( tkls_klass->is_loaded(), "This class should have been loaded."); |
|
3790 |
assert( this_klass->is_loaded(), "This class should have been loaded."); |
|
3791 |
||
3792 |
// If 'this' type is above the centerline and is a superclass of the |
|
3793 |
// other, we can treat 'this' as having the same type as the other. |
|
3794 |
if ((above_centerline(this->ptr())) && |
|
3795 |
tkls_klass->is_subtype_of(this_klass)) { |
|
3796 |
this_klass = tkls_klass; |
|
3797 |
} |
|
3798 |
// If 'tinst' type is above the centerline and is a superclass of the |
|
3799 |
// other, we can treat 'tinst' as having the same type as the other. |
|
3800 |
if ((above_centerline(tkls->ptr())) && |
|
3801 |
this_klass->is_subtype_of(tkls_klass)) { |
|
3802 |
tkls_klass = this_klass; |
|
3803 |
} |
|
3804 |
||
3805 |
// Check for classes now being equal |
|
3806 |
if (tkls_klass->equals(this_klass)) { |
|
3807 |
// If the klasses are equal, the constants may still differ. Fall to |
|
3808 |
// NotNull if they do (neither constant is NULL; that is a special case |
|
3809 |
// handled elsewhere). |
|
3810 |
ciObject* o = NULL; // Assume not constant when done |
|
3811 |
ciObject* this_oop = const_oop(); |
|
3812 |
ciObject* tkls_oop = tkls->const_oop(); |
|
3813 |
if( ptr == Constant ) { |
|
3814 |
if (this_oop != NULL && tkls_oop != NULL && |
|
3815 |
this_oop->equals(tkls_oop) ) |
|
3816 |
o = this_oop; |
|
3817 |
else if (above_centerline(this->ptr())) |
|
3818 |
o = tkls_oop; |
|
3819 |
else if (above_centerline(tkls->ptr())) |
|
3820 |
o = this_oop; |
|
3821 |
else |
|
3822 |
ptr = NotNull; |
|
3823 |
} |
|
3824 |
return make( ptr, this_klass, off ); |
|
3825 |
} // Else classes are not equal |
|
3826 |
||
3827 |
// Since klasses are different, we require the LCA in the Java |
|
3828 |
// class hierarchy - which means we have to fall to at least NotNull. |
|
3829 |
if( ptr == TopPTR || ptr == AnyNull || ptr == Constant ) |
|
3830 |
ptr = NotNull; |
|
3831 |
// Now we find the LCA of Java classes |
|
3832 |
ciKlass* k = this_klass->least_common_ancestor(tkls_klass); |
|
3833 |
return make( ptr, k, off ); |
|
3834 |
} // End of case KlassPtr |
|
3835 |
||
3836 |
} // End of switch |
|
3837 |
return this; // Return the double constant |
|
3838 |
} |
|
3839 |
||
3840 |
//------------------------------xdual------------------------------------------ |
|
3841 |
// Dual: compute field-by-field dual |
|
3842 |
const Type *TypeKlassPtr::xdual() const { |
|
3843 |
return new TypeKlassPtr( dual_ptr(), klass(), dual_offset() ); |
|
3844 |
} |
|
3845 |
||
3846 |
//------------------------------dump2------------------------------------------ |
|
3847 |
// Dump Klass Type |
|
3848 |
#ifndef PRODUCT |
|
3849 |
void TypeKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const { |
|
3850 |
switch( _ptr ) { |
|
3851 |
case Constant: |
|
3852 |
st->print("precise "); |
|
3853 |
case NotNull: |
|
3854 |
{ |
|
3855 |
const char *name = klass()->name()->as_utf8(); |
|
3856 |
if( name ) { |
|
3857 |
st->print("klass %s: " INTPTR_FORMAT, name, klass()); |
|
3858 |
} else { |
|
3859 |
ShouldNotReachHere(); |
|
3860 |
} |
|
3861 |
} |
|
3862 |
case BotPTR: |
|
3863 |
if( !WizardMode && !Verbose && !_klass_is_exact ) break; |
|
3864 |
case TopPTR: |
|
3865 |
case AnyNull: |
|
3866 |
st->print(":%s", ptr_msg[_ptr]); |
|
3867 |
if( _klass_is_exact ) st->print(":exact"); |
|
3868 |
break; |
|
3869 |
} |
|
3870 |
||
3871 |
if( _offset ) { // Dump offset, if any |
|
3872 |
if( _offset == OffsetBot ) { st->print("+any"); } |
|
3873 |
else if( _offset == OffsetTop ) { st->print("+unknown"); } |
|
3874 |
else { st->print("+%d", _offset); } |
|
3875 |
} |
|
3876 |
||
3877 |
st->print(" *"); |
|
3878 |
} |
|
3879 |
#endif |
|
3880 |
||
3881 |
||
3882 |
||
3883 |
//============================================================================= |
|
3884 |
// Convenience common pre-built types. |
|
3885 |
||
3886 |
//------------------------------make------------------------------------------- |
|
3887 |
const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) { |
|
3888 |
return (TypeFunc*)(new TypeFunc(domain,range))->hashcons(); |
|
3889 |
} |
|
3890 |
||
3891 |
//------------------------------make------------------------------------------- |
|
3892 |
const TypeFunc *TypeFunc::make(ciMethod* method) { |
|
3893 |
Compile* C = Compile::current(); |
|
3894 |
const TypeFunc* tf = C->last_tf(method); // check cache |
|
3895 |
if (tf != NULL) return tf; // The hit rate here is almost 50%. |
|
3896 |
const TypeTuple *domain; |
|
3897 |
if (method->flags().is_static()) { |
|
3898 |
domain = TypeTuple::make_domain(NULL, method->signature()); |
|
3899 |
} else { |
|
3900 |
domain = TypeTuple::make_domain(method->holder(), method->signature()); |
|
3901 |
} |
|
3902 |
const TypeTuple *range = TypeTuple::make_range(method->signature()); |
|
3903 |
tf = TypeFunc::make(domain, range); |
|
3904 |
C->set_last_tf(method, tf); // fill cache |
|
3905 |
return tf; |
|
3906 |
} |
|
3907 |
||
3908 |
//------------------------------meet------------------------------------------- |
|
3909 |
// Compute the MEET of two types. It returns a new Type object. |
|
3910 |
const Type *TypeFunc::xmeet( const Type *t ) const { |
|
3911 |
// Perform a fast test for common case; meeting the same types together. |
|
3912 |
if( this == t ) return this; // Meeting same type-rep? |
|
3913 |
||
3914 |
// Current "this->_base" is Func |
|
3915 |
switch (t->base()) { // switch on original type |
|
3916 |
||
3917 |
case Bottom: // Ye Olde Default |
|
3918 |
return t; |
|
3919 |
||
3920 |
default: // All else is a mistake |
|
3921 |
typerr(t); |
|
3922 |
||
3923 |
case Top: |
|
3924 |
break; |
|
3925 |
} |
|
3926 |
return this; // Return the double constant |
|
3927 |
} |
|
3928 |
||
3929 |
//------------------------------xdual------------------------------------------ |
|
3930 |
// Dual: compute field-by-field dual |
|
3931 |
const Type *TypeFunc::xdual() const { |
|
3932 |
return this; |
|
3933 |
} |
|
3934 |
||
3935 |
//------------------------------eq--------------------------------------------- |
|
3936 |
// Structural equality check for Type representations |
|
3937 |
bool TypeFunc::eq( const Type *t ) const { |
|
3938 |
const TypeFunc *a = (const TypeFunc*)t; |
|
3939 |
return _domain == a->_domain && |
|
3940 |
_range == a->_range; |
|
3941 |
} |
|
3942 |
||
3943 |
//------------------------------hash------------------------------------------- |
|
3944 |
// Type-specific hashing function. |
|
3945 |
int TypeFunc::hash(void) const { |
|
3946 |
return (intptr_t)_domain + (intptr_t)_range; |
|
3947 |
} |
|
3948 |
||
3949 |
//------------------------------dump2------------------------------------------ |
|
3950 |
// Dump Function Type |
|
3951 |
#ifndef PRODUCT |
|
3952 |
void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
3953 |
if( _range->_cnt <= Parms ) |
|
3954 |
st->print("void"); |
|
3955 |
else { |
|
3956 |
uint i; |
|
3957 |
for (i = Parms; i < _range->_cnt-1; i++) { |
|
3958 |
_range->field_at(i)->dump2(d,depth,st); |
|
3959 |
st->print("/"); |
|
3960 |
} |
|
3961 |
_range->field_at(i)->dump2(d,depth,st); |
|
3962 |
} |
|
3963 |
st->print(" "); |
|
3964 |
st->print("( "); |
|
3965 |
if( !depth || d[this] ) { // Check for recursive dump |
|
3966 |
st->print("...)"); |
|
3967 |
return; |
|
3968 |
} |
|
3969 |
d.Insert((void*)this,(void*)this); // Stop recursion |
|
3970 |
if (Parms < _domain->_cnt) |
|
3971 |
_domain->field_at(Parms)->dump2(d,depth-1,st); |
|
3972 |
for (uint i = Parms+1; i < _domain->_cnt; i++) { |
|
3973 |
st->print(", "); |
|
3974 |
_domain->field_at(i)->dump2(d,depth-1,st); |
|
3975 |
} |
|
3976 |
st->print(" )"); |
|
3977 |
} |
|
3978 |
||
3979 |
//------------------------------print_flattened-------------------------------- |
|
3980 |
// Print a 'flattened' signature |
|
3981 |
static const char * const flat_type_msg[Type::lastype] = { |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
237
diff
changeset
|
3982 |
"bad","control","top","int","long","_", "narrowoop", |
1 | 3983 |
"tuple:", "array:", |
3984 |
"ptr", "rawptr", "ptr", "ptr", "ptr", "ptr", |
|
3985 |
"func", "abIO", "return_address", "mem", |
|
3986 |
"float_top", "ftcon:", "flt", |
|
3987 |
"double_top", "dblcon:", "dbl", |
|
3988 |
"bottom" |
|
3989 |
}; |
|
3990 |
||
3991 |
void TypeFunc::print_flattened() const { |
|
3992 |
if( _range->_cnt <= Parms ) |
|
3993 |
tty->print("void"); |
|
3994 |
else { |
|
3995 |
uint i; |
|
3996 |
for (i = Parms; i < _range->_cnt-1; i++) |
|
3997 |
tty->print("%s/",flat_type_msg[_range->field_at(i)->base()]); |
|
3998 |
tty->print("%s",flat_type_msg[_range->field_at(i)->base()]); |
|
3999 |
} |
|
4000 |
tty->print(" ( "); |
|
4001 |
if (Parms < _domain->_cnt) |
|
4002 |
tty->print("%s",flat_type_msg[_domain->field_at(Parms)->base()]); |
|
4003 |
for (uint i = Parms+1; i < _domain->_cnt; i++) |
|
4004 |
tty->print(", %s",flat_type_msg[_domain->field_at(i)->base()]); |
|
4005 |
tty->print(" )"); |
|
4006 |
} |
|
4007 |
#endif |
|
4008 |
||
4009 |
//------------------------------singleton-------------------------------------- |
|
4010 |
// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
4011 |
// constants (Ldi nodes). Singletons are integer, float or double constants |
|
4012 |
// or a single symbol. |
|
4013 |
bool TypeFunc::singleton(void) const { |
|
4014 |
return false; // Never a singleton |
|
4015 |
} |
|
4016 |
||
4017 |
bool TypeFunc::empty(void) const { |
|
4018 |
return false; // Never empty |
|
4019 |
} |
|
4020 |
||
4021 |
||
4022 |
BasicType TypeFunc::return_type() const{ |
|
4023 |
if (range()->cnt() == TypeFunc::Parms) { |
|
4024 |
return T_VOID; |
|
4025 |
} |
|
4026 |
return range()->field_at(TypeFunc::Parms)->basic_type(); |
|
4027 |
} |