1 /*
2 * Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_OPTO_TYPE_HPP
26 #define SHARE_OPTO_TYPE_HPP
27
28 #include "ci/ciValueKlass.hpp"
29 #include "opto/adlcVMDeps.hpp"
30 #include "runtime/handles.hpp"
31 #include "runtime/sharedRuntime.hpp"
32
33 // Portions of code courtesy of Clifford Click
34
35 // Optimization - Graph Style
36
37
38 // This class defines a Type lattice. The lattice is used in the constant
39 // propagation algorithms, and for some type-checking of the iloc code.
40 // Basic types include RSD's (lower bound, upper bound, stride for integers),
41 // float & double precision constants, sets of data-labels and code-labels.
42 // The complete lattice is described below. Subtypes have no relationship to
43 // up or down in the lattice; that is entirely determined by the behavior of
44 // the MEET/JOIN functions.
45
46 class Dict;
47 class Type;
48 class TypeD;
49 class TypeF;
50 class TypeInt;
51 class TypeLong;
52 class TypeNarrowPtr;
53 class TypeNarrowOop;
54 class TypeNarrowKlass;
55 class TypeAry;
56 class TypeTuple;
57 class TypeValueType;
58 class TypeVect;
59 class TypeVectS;
60 class TypeVectD;
61 class TypeVectX;
62 class TypeVectY;
63 class TypeVectZ;
64 class TypePtr;
65 class TypeRawPtr;
66 class TypeOopPtr;
67 class TypeInstPtr;
68 class TypeAryPtr;
69 class TypeKlassPtr;
70 class TypeMetadataPtr;
71
72 //------------------------------Type-------------------------------------------
73 // Basic Type object, represents a set of primitive Values.
74 // Types are hash-cons'd into a private class dictionary, so only one of each
75 // different kind of Type exists. Types are never modified after creation, so
76 // all their interesting fields are constant.
77 class Type {
78 friend class VMStructs;
79
80 public:
81 enum TYPES {
82 Bad=0, // Type check
83 Control, // Control of code (not in lattice)
84 Top, // Top of the lattice
85 Int, // Integer range (lo-hi)
86 Long, // Long integer range (lo-hi)
87 Half, // Placeholder half of doubleword
88 NarrowOop, // Compressed oop pointer
89 NarrowKlass, // Compressed klass pointer
90
91 Tuple, // Method signature or object layout
92 Array, // Array types
93 VectorS, // 32bit Vector types
94 VectorD, // 64bit Vector types
95 VectorX, // 128bit Vector types
96 VectorY, // 256bit Vector types
97 VectorZ, // 512bit Vector types
98 ValueType, // Value type
99
100 AnyPtr, // Any old raw, klass, inst, or array pointer
101 RawPtr, // Raw (non-oop) pointers
102 OopPtr, // Any and all Java heap entities
103 InstPtr, // Instance pointers (non-array objects)
104 AryPtr, // Array pointers
105 // (Ptr order matters: See is_ptr, isa_ptr, is_oopptr, isa_oopptr.)
106
107 MetadataPtr, // Generic metadata
108 KlassPtr, // Klass pointers
109
110 Function, // Function signature
111 Abio, // Abstract I/O
112 Return_Address, // Subroutine return address
113 Memory, // Abstract store
114 FloatTop, // No float value
115 FloatCon, // Floating point constant
116 FloatBot, // Any float value
117 DoubleTop, // No double value
118 DoubleCon, // Double precision constant
119 DoubleBot, // Any double value
120 Bottom, // Bottom of lattice
121 lastype // Bogus ending type (not in lattice)
122 };
123
124 // Signal values for offsets from a base pointer
125 enum OFFSET_SIGNALS {
126 OffsetTop = -2000000000, // undefined offset
127 OffsetBot = -2000000001 // any possible offset
128 };
129
130 class Offset {
131 private:
132 const int _offset;
133
134 public:
135 explicit Offset(int offset) : _offset(offset) {}
136
137 const Offset meet(const Offset other) const;
138 const Offset dual() const;
139 const Offset add(intptr_t offset) const;
140 bool operator==(const Offset& other) const {
141 return _offset == other._offset;
142 }
143 bool operator!=(const Offset& other) const {
144 return _offset != other._offset;
145 }
146 int get() const { return _offset; }
147
148 void dump2(outputStream *st) const;
149
150 static const Offset top;
151 static const Offset bottom;
152 };
153
154 // Min and max WIDEN values.
155 enum WIDEN {
156 WidenMin = 0,
157 WidenMax = 3
158 };
159
160 private:
161 typedef struct {
162 TYPES dual_type;
163 BasicType basic_type;
164 const char* msg;
165 bool isa_oop;
166 uint ideal_reg;
167 relocInfo::relocType reloc;
168 } TypeInfo;
169
170 // Dictionary of types shared among compilations.
171 static Dict* _shared_type_dict;
172 static const TypeInfo _type_info[];
173
174 static int uhash( const Type *const t );
175 // Structural equality check. Assumes that cmp() has already compared
176 // the _base types and thus knows it can cast 't' appropriately.
177 virtual bool eq( const Type *t ) const;
178
179 // Top-level hash-table of types
180 static Dict *type_dict() {
181 return Compile::current()->type_dict();
182 }
183
184 // DUAL operation: reflect around lattice centerline. Used instead of
185 // join to ensure my lattice is symmetric up and down. Dual is computed
186 // lazily, on demand, and cached in _dual.
187 const Type *_dual; // Cached dual value
188 // Table for efficient dualing of base types
189 static const TYPES dual_type[lastype];
190
191 #ifdef ASSERT
192 // One type is interface, the other is oop
193 virtual bool interface_vs_oop_helper(const Type *t) const;
194 #endif
195
196 const Type *meet_helper(const Type *t, bool include_speculative) const;
197
198 protected:
199 // Each class of type is also identified by its base.
200 const TYPES _base; // Enum of Types type
201
202 Type( TYPES t ) : _dual(NULL), _base(t) {} // Simple types
203 // ~Type(); // Use fast deallocation
204 const Type *hashcons(); // Hash-cons the type
205 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
206 const Type *join_helper(const Type *t, bool include_speculative) const {
207 return dual()->meet_helper(t->dual(), include_speculative)->dual();
208 }
209
210 public:
211
212 inline void* operator new( size_t x ) throw() {
213 Compile* compile = Compile::current();
214 compile->set_type_last_size(x);
215 void *temp = compile->type_arena()->Amalloc_D(x);
216 compile->set_type_hwm(temp);
217 return temp;
218 }
219 inline void operator delete( void* ptr ) {
220 Compile* compile = Compile::current();
221 compile->type_arena()->Afree(ptr,compile->type_last_size());
222 }
223
224 // Initialize the type system for a particular compilation.
225 static void Initialize(Compile* compile);
226
227 // Initialize the types shared by all compilations.
228 static void Initialize_shared(Compile* compile);
229
230 TYPES base() const {
231 assert(_base > Bad && _base < lastype, "sanity");
232 return _base;
233 }
234
235 // Create a new hash-consd type
236 static const Type *make(enum TYPES);
237 // Test for equivalence of types
238 static int cmp( const Type *const t1, const Type *const t2 );
239 // Test for higher or equal in lattice
240 // Variant that drops the speculative part of the types
241 bool higher_equal(const Type *t) const {
242 return !cmp(meet(t),t->remove_speculative());
243 }
244 // Variant that keeps the speculative part of the types
245 bool higher_equal_speculative(const Type *t) const {
246 return !cmp(meet_speculative(t),t);
247 }
248
249 // MEET operation; lower in lattice.
250 // Variant that drops the speculative part of the types
251 const Type *meet(const Type *t) const {
252 return meet_helper(t, false);
253 }
254 // Variant that keeps the speculative part of the types
255 const Type *meet_speculative(const Type *t) const {
256 return meet_helper(t, true)->cleanup_speculative();
257 }
258 // WIDEN: 'widens' for Ints and other range types
259 virtual const Type *widen( const Type *old, const Type* limit ) const { return this; }
260 // NARROW: complement for widen, used by pessimistic phases
261 virtual const Type *narrow( const Type *old ) const { return this; }
262
263 // DUAL operation: reflect around lattice centerline. Used instead of
264 // join to ensure my lattice is symmetric up and down.
265 const Type *dual() const { return _dual; }
266
267 // Compute meet dependent on base type
268 virtual const Type *xmeet( const Type *t ) const;
269 virtual const Type *xdual() const; // Compute dual right now.
270
271 // JOIN operation; higher in lattice. Done by finding the dual of the
272 // meet of the dual of the 2 inputs.
273 // Variant that drops the speculative part of the types
274 const Type *join(const Type *t) const {
275 return join_helper(t, false);
276 }
277 // Variant that keeps the speculative part of the types
278 const Type *join_speculative(const Type *t) const {
279 return join_helper(t, true)->cleanup_speculative();
280 }
281
282 // Modified version of JOIN adapted to the needs Node::Value.
283 // Normalizes all empty values to TOP. Does not kill _widen bits.
284 // Currently, it also works around limitations involving interface types.
285 // Variant that drops the speculative part of the types
286 const Type *filter(const Type *kills) const {
287 return filter_helper(kills, false);
288 }
289 // Variant that keeps the speculative part of the types
290 const Type *filter_speculative(const Type *kills) const {
291 return filter_helper(kills, true)->cleanup_speculative();
292 }
293
294 #ifdef ASSERT
295 // One type is interface, the other is oop
296 virtual bool interface_vs_oop(const Type *t) const;
297 #endif
298
299 // Returns true if this pointer points at memory which contains a
300 // compressed oop references.
301 bool is_ptr_to_narrowoop() const;
302 bool is_ptr_to_narrowklass() const;
303
304 // Convenience access
305 float getf() const;
306 double getd() const;
307
308 const TypeInt *is_int() const;
309 const TypeInt *isa_int() const; // Returns NULL if not an Int
310 const TypeLong *is_long() const;
311 const TypeLong *isa_long() const; // Returns NULL if not a Long
312 const TypeD *isa_double() const; // Returns NULL if not a Double{Top,Con,Bot}
313 const TypeD *is_double_constant() const; // Asserts it is a DoubleCon
314 const TypeD *isa_double_constant() const; // Returns NULL if not a DoubleCon
315 const TypeF *isa_float() const; // Returns NULL if not a Float{Top,Con,Bot}
316 const TypeF *is_float_constant() const; // Asserts it is a FloatCon
317 const TypeF *isa_float_constant() const; // Returns NULL if not a FloatCon
318 const TypeTuple *is_tuple() const; // Collection of fields, NOT a pointer
319 const TypeAry *is_ary() const; // Array, NOT array pointer
320 const TypeVect *is_vect() const; // Vector
321 const TypeVect *isa_vect() const; // Returns NULL if not a Vector
322 const TypePtr *is_ptr() const; // Asserts it is a ptr type
323 const TypePtr *isa_ptr() const; // Returns NULL if not ptr type
324 const TypeRawPtr *isa_rawptr() const; // NOT Java oop
325 const TypeRawPtr *is_rawptr() const; // Asserts is rawptr
326 const TypeNarrowOop *is_narrowoop() const; // Java-style GC'd pointer
327 const TypeNarrowOop *isa_narrowoop() const; // Returns NULL if not oop ptr type
328 const TypeNarrowKlass *is_narrowklass() const; // compressed klass pointer
329 const TypeNarrowKlass *isa_narrowklass() const;// Returns NULL if not oop ptr type
330 const TypeOopPtr *isa_oopptr() const; // Returns NULL if not oop ptr type
331 const TypeOopPtr *is_oopptr() const; // Java-style GC'd pointer
332 const TypeInstPtr *isa_instptr() const; // Returns NULL if not InstPtr
333 const TypeInstPtr *is_instptr() const; // Instance
334 const TypeAryPtr *isa_aryptr() const; // Returns NULL if not AryPtr
335 const TypeAryPtr *is_aryptr() const; // Array oop
336 const TypeValueType* isa_valuetype() const; // Returns NULL if not Value Type
337 const TypeValueType* is_valuetype() const; // Value Type
338
339 const TypeMetadataPtr *isa_metadataptr() const; // Returns NULL if not oop ptr type
340 const TypeMetadataPtr *is_metadataptr() const; // Java-style GC'd pointer
341 const TypeKlassPtr *isa_klassptr() const; // Returns NULL if not KlassPtr
342 const TypeKlassPtr *is_klassptr() const; // assert if not KlassPtr
343
344 virtual bool is_finite() const; // Has a finite value
345 virtual bool is_nan() const; // Is not a number (NaN)
346
347 bool is_valuetypeptr() const;
348 ciValueKlass* value_klass() const;
349
350 // Returns this ptr type or the equivalent ptr type for this compressed pointer.
351 const TypePtr* make_ptr() const;
352
353 // Returns this oopptr type or the equivalent oopptr type for this compressed pointer.
354 // Asserts if the underlying type is not an oopptr or narrowoop.
355 const TypeOopPtr* make_oopptr() const;
356
357 // Returns this compressed pointer or the equivalent compressed version
358 // of this pointer type.
359 const TypeNarrowOop* make_narrowoop() const;
360
361 // Returns this compressed klass pointer or the equivalent
362 // compressed version of this pointer type.
363 const TypeNarrowKlass* make_narrowklass() const;
364
365 // Special test for register pressure heuristic
366 bool is_floatingpoint() const; // True if Float or Double base type
367
368 // Do you have memory, directly or through a tuple?
369 bool has_memory( ) const;
370
371 // TRUE if type is a singleton
372 virtual bool singleton(void) const;
373
374 // TRUE if type is above the lattice centerline, and is therefore vacuous
375 virtual bool empty(void) const;
376
377 // Return a hash for this type. The hash function is public so ConNode
378 // (constants) can hash on their constant, which is represented by a Type.
379 virtual int hash() const;
380
381 // Map ideal registers (machine types) to ideal types
382 static const Type *mreg2type[];
383
384 // Printing, statistics
385 #ifndef PRODUCT
386 void dump_on(outputStream *st) const;
387 void dump() const {
388 dump_on(tty);
389 }
390 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
391 static void dump_stats();
392
393 static const char* str(const Type* t);
394 #endif
395 void typerr(const Type *t) const; // Mixing types error
396
397 // Create basic type
398 static const Type* get_const_basic_type(BasicType type) {
399 assert((uint)type <= T_CONFLICT && _const_basic_type[type] != NULL, "bad type");
400 return _const_basic_type[type];
401 }
402
403 // For two instance arrays of same dimension, return the base element types.
404 // Otherwise or if the arrays have different dimensions, return NULL.
405 static void get_arrays_base_elements(const Type *a1, const Type *a2,
406 const TypeInstPtr **e1, const TypeInstPtr **e2);
407
408 // Mapping to the array element's basic type.
409 BasicType array_element_basic_type() const;
410
411 // Create standard type for a ciType:
412 static const Type* get_const_type(ciType* type);
413
414 // Create standard zero value:
415 static const Type* get_zero_type(BasicType type) {
416 assert((uint)type <= T_CONFLICT && _zero_type[type] != NULL, "bad type");
417 return _zero_type[type];
418 }
419
420 // Report if this is a zero value (not top).
421 bool is_zero_type() const {
422 BasicType type = basic_type();
423 if (type == T_VOID || type >= T_CONFLICT)
424 return false;
425 else
426 return (this == _zero_type[type]);
427 }
428
429 // Convenience common pre-built types.
430 static const Type *ABIO;
431 static const Type *BOTTOM;
432 static const Type *CONTROL;
433 static const Type *DOUBLE;
434 static const Type *FLOAT;
435 static const Type *HALF;
436 static const Type *MEMORY;
437 static const Type *MULTI;
438 static const Type *RETURN_ADDRESS;
439 static const Type *TOP;
440
441 // Mapping from compiler type to VM BasicType
442 BasicType basic_type() const { return _type_info[_base].basic_type; }
443 uint ideal_reg() const { return _type_info[_base].ideal_reg; }
444 const char* msg() const { return _type_info[_base].msg; }
445 bool isa_oop_ptr() const { return _type_info[_base].isa_oop; }
446 relocInfo::relocType reloc() const { return _type_info[_base].reloc; }
447
448 // Mapping from CI type system to compiler type:
449 static const Type* get_typeflow_type(ciType* type);
450
451 static const Type* make_from_constant(ciConstant constant,
452 bool require_constant = false,
453 int stable_dimension = 0,
454 bool is_narrow = false,
455 bool is_autobox_cache = false);
456
457 static const Type* make_constant_from_field(ciInstance* holder,
458 int off,
459 bool is_unsigned_load,
460 BasicType loadbt);
461
462 static const Type* make_constant_from_field(ciField* field,
463 ciInstance* holder,
464 BasicType loadbt,
465 bool is_unsigned_load);
466
467 static const Type* make_constant_from_array_element(ciArray* array,
468 int off,
469 int stable_dimension,
470 BasicType loadbt,
471 bool is_unsigned_load);
472
473 // Speculative type helper methods. See TypePtr.
474 virtual const TypePtr* speculative() const { return NULL; }
475 virtual ciKlass* speculative_type() const { return NULL; }
476 virtual ciKlass* speculative_type_not_null() const { return NULL; }
477 virtual bool speculative_maybe_null() const { return true; }
478 virtual bool speculative_always_null() const { return true; }
479 virtual const Type* remove_speculative() const { return this; }
480 virtual const Type* cleanup_speculative() const { return this; }
481 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const { return exact_kls != NULL; }
482 virtual bool would_improve_ptr(ProfilePtrKind ptr_kind) const { return ptr_kind == ProfileAlwaysNull || ptr_kind == ProfileNeverNull; }
483 const Type* maybe_remove_speculative(bool include_speculative) const;
484
485 virtual bool maybe_null() const { return true; }
486
487 private:
488 // support arrays
489 static const BasicType _basic_type[];
490 static const Type* _zero_type[T_CONFLICT+1];
491 static const Type* _const_basic_type[T_CONFLICT+1];
492 };
493
494 //------------------------------TypeF------------------------------------------
495 // Class of Float-Constant Types.
496 class TypeF : public Type {
497 TypeF( float f ) : Type(FloatCon), _f(f) {};
498 public:
499 virtual bool eq( const Type *t ) const;
500 virtual int hash() const; // Type specific hashing
501 virtual bool singleton(void) const; // TRUE if type is a singleton
502 virtual bool empty(void) const; // TRUE if type is vacuous
503 public:
504 const float _f; // Float constant
505
506 static const TypeF *make(float f);
507
508 virtual bool is_finite() const; // Has a finite value
509 virtual bool is_nan() const; // Is not a number (NaN)
510
511 virtual const Type *xmeet( const Type *t ) const;
512 virtual const Type *xdual() const; // Compute dual right now.
513 // Convenience common pre-built types.
514 static const TypeF *ZERO; // positive zero only
515 static const TypeF *ONE;
516 static const TypeF *POS_INF;
517 static const TypeF *NEG_INF;
518 #ifndef PRODUCT
519 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
520 #endif
521 };
522
523 //------------------------------TypeD------------------------------------------
524 // Class of Double-Constant Types.
525 class TypeD : public Type {
526 TypeD( double d ) : Type(DoubleCon), _d(d) {};
527 public:
528 virtual bool eq( const Type *t ) const;
529 virtual int hash() const; // Type specific hashing
530 virtual bool singleton(void) const; // TRUE if type is a singleton
531 virtual bool empty(void) const; // TRUE if type is vacuous
532 public:
533 const double _d; // Double constant
534
535 static const TypeD *make(double d);
536
537 virtual bool is_finite() const; // Has a finite value
538 virtual bool is_nan() const; // Is not a number (NaN)
539
540 virtual const Type *xmeet( const Type *t ) const;
541 virtual const Type *xdual() const; // Compute dual right now.
542 // Convenience common pre-built types.
543 static const TypeD *ZERO; // positive zero only
544 static const TypeD *ONE;
545 static const TypeD *POS_INF;
546 static const TypeD *NEG_INF;
547 #ifndef PRODUCT
548 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
549 #endif
550 };
551
552 //------------------------------TypeInt----------------------------------------
553 // Class of integer ranges, the set of integers between a lower bound and an
554 // upper bound, inclusive.
555 class TypeInt : public Type {
556 TypeInt( jint lo, jint hi, int w );
557 protected:
558 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
559
560 public:
561 typedef jint NativeType;
562 virtual bool eq( const Type *t ) const;
563 virtual int hash() const; // Type specific hashing
564 virtual bool singleton(void) const; // TRUE if type is a singleton
565 virtual bool empty(void) const; // TRUE if type is vacuous
566 const jint _lo, _hi; // Lower bound, upper bound
567 const short _widen; // Limit on times we widen this sucker
568
569 static const TypeInt *make(jint lo);
570 // must always specify w
571 static const TypeInt *make(jint lo, jint hi, int w);
572
573 // Check for single integer
574 int is_con() const { return _lo==_hi; }
575 bool is_con(int i) const { return is_con() && _lo == i; }
576 jint get_con() const { assert( is_con(), "" ); return _lo; }
577
578 virtual bool is_finite() const; // Has a finite value
579
580 virtual const Type *xmeet( const Type *t ) const;
581 virtual const Type *xdual() const; // Compute dual right now.
582 virtual const Type *widen( const Type *t, const Type* limit_type ) const;
583 virtual const Type *narrow( const Type *t ) const;
584 // Do not kill _widen bits.
585 // Convenience common pre-built types.
586 static const TypeInt *MINUS_1;
587 static const TypeInt *ZERO;
588 static const TypeInt *ONE;
589 static const TypeInt *BOOL;
590 static const TypeInt *CC;
591 static const TypeInt *CC_LT; // [-1] == MINUS_1
592 static const TypeInt *CC_GT; // [1] == ONE
593 static const TypeInt *CC_EQ; // [0] == ZERO
594 static const TypeInt *CC_LE; // [-1,0]
595 static const TypeInt *CC_GE; // [0,1] == BOOL (!)
596 static const TypeInt *BYTE;
597 static const TypeInt *UBYTE;
598 static const TypeInt *CHAR;
599 static const TypeInt *SHORT;
600 static const TypeInt *POS;
601 static const TypeInt *POS1;
602 static const TypeInt *INT;
603 static const TypeInt *SYMINT; // symmetric range [-max_jint..max_jint]
604 static const TypeInt *TYPE_DOMAIN; // alias for TypeInt::INT
605
606 static const TypeInt *as_self(const Type *t) { return t->is_int(); }
607 #ifndef PRODUCT
608 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
609 #endif
610 };
611
612
613 //------------------------------TypeLong---------------------------------------
614 // Class of long integer ranges, the set of integers between a lower bound and
615 // an upper bound, inclusive.
616 class TypeLong : public Type {
617 TypeLong( jlong lo, jlong hi, int w );
618 protected:
619 // Do not kill _widen bits.
620 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
621 public:
622 typedef jlong NativeType;
623 virtual bool eq( const Type *t ) const;
624 virtual int hash() const; // Type specific hashing
625 virtual bool singleton(void) const; // TRUE if type is a singleton
626 virtual bool empty(void) const; // TRUE if type is vacuous
627 public:
628 const jlong _lo, _hi; // Lower bound, upper bound
629 const short _widen; // Limit on times we widen this sucker
630
631 static const TypeLong *make(jlong lo);
632 // must always specify w
633 static const TypeLong *make(jlong lo, jlong hi, int w);
634
635 // Check for single integer
636 int is_con() const { return _lo==_hi; }
637 bool is_con(int i) const { return is_con() && _lo == i; }
638 jlong get_con() const { assert( is_con(), "" ); return _lo; }
639
640 // Check for positive 32-bit value.
641 int is_positive_int() const { return _lo >= 0 && _hi <= (jlong)max_jint; }
642
643 virtual bool is_finite() const; // Has a finite value
644
645
646 virtual const Type *xmeet( const Type *t ) const;
647 virtual const Type *xdual() const; // Compute dual right now.
648 virtual const Type *widen( const Type *t, const Type* limit_type ) const;
649 virtual const Type *narrow( const Type *t ) const;
650 // Convenience common pre-built types.
651 static const TypeLong *MINUS_1;
652 static const TypeLong *ZERO;
653 static const TypeLong *ONE;
654 static const TypeLong *POS;
655 static const TypeLong *LONG;
656 static const TypeLong *INT; // 32-bit subrange [min_jint..max_jint]
657 static const TypeLong *UINT; // 32-bit unsigned [0..max_juint]
658 static const TypeLong *TYPE_DOMAIN; // alias for TypeLong::LONG
659
660 // static convenience methods.
661 static const TypeLong *as_self(const Type *t) { return t->is_long(); }
662
663 #ifndef PRODUCT
664 virtual void dump2( Dict &d, uint, outputStream *st ) const;// Specialized per-Type dumping
665 #endif
666 };
667
668 //------------------------------TypeTuple--------------------------------------
669 // Class of Tuple Types, essentially type collections for function signatures
670 // and class layouts. It happens to also be a fast cache for the HotSpot
671 // signature types.
672 class TypeTuple : public Type {
673 TypeTuple( uint cnt, const Type **fields ) : Type(Tuple), _cnt(cnt), _fields(fields) { }
674
675 const uint _cnt; // Count of fields
676 const Type ** const _fields; // Array of field types
677
678 public:
679 virtual bool eq( const Type *t ) const;
680 virtual int hash() const; // Type specific hashing
681 virtual bool singleton(void) const; // TRUE if type is a singleton
682 virtual bool empty(void) const; // TRUE if type is vacuous
683
684 // Accessors:
685 uint cnt() const { return _cnt; }
686 const Type* field_at(uint i) const {
687 assert(i < _cnt, "oob");
688 return _fields[i];
689 }
690 void set_field_at(uint i, const Type* t) {
691 assert(i < _cnt, "oob");
692 _fields[i] = t;
693 }
694
695 static const TypeTuple *make( uint cnt, const Type **fields );
696 static const TypeTuple *make_range(ciSignature* sig, bool ret_vt_fields = false);
697 static const TypeTuple *make_domain(ciMethod* method, bool vt_fields_as_args = false);
698
699 // Subroutine call type with space allocated for argument types
700 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly
701 static const Type **fields( uint arg_cnt );
702
703 virtual const Type *xmeet( const Type *t ) const;
704 virtual const Type *xdual() const; // Compute dual right now.
705 // Convenience common pre-built types.
706 static const TypeTuple *IFBOTH;
707 static const TypeTuple *IFFALSE;
708 static const TypeTuple *IFTRUE;
709 static const TypeTuple *IFNEITHER;
710 static const TypeTuple *LOOPBODY;
711 static const TypeTuple *MEMBAR;
712 static const TypeTuple *STORECONDITIONAL;
713 static const TypeTuple *START_I2C;
714 static const TypeTuple *INT_PAIR;
715 static const TypeTuple *LONG_PAIR;
716 static const TypeTuple *INT_CC_PAIR;
717 static const TypeTuple *LONG_CC_PAIR;
718 #ifndef PRODUCT
719 virtual void dump2( Dict &d, uint, outputStream *st ) const; // Specialized per-Type dumping
720 #endif
721 };
722
723 //------------------------------TypeAry----------------------------------------
724 // Class of Array Types
725 class TypeAry : public Type {
726 TypeAry(const Type* elem, const TypeInt* size, bool stable) : Type(Array),
727 _elem(elem), _size(size), _stable(stable) {}
728 public:
729 virtual bool eq( const Type *t ) const;
730 virtual int hash() const; // Type specific hashing
731 virtual bool singleton(void) const; // TRUE if type is a singleton
732 virtual bool empty(void) const; // TRUE if type is vacuous
733
734 private:
735 const Type *_elem; // Element type of array
736 const TypeInt *_size; // Elements in array
737 const bool _stable; // Are elements @Stable?
738 friend class TypeAryPtr;
739
740 public:
741 static const TypeAry* make(const Type* elem, const TypeInt* size, bool stable = false);
742
743 virtual const Type *xmeet( const Type *t ) const;
744 virtual const Type *xdual() const; // Compute dual right now.
745 bool ary_must_be_exact() const; // true if arrays of such are never generic
746 virtual const Type* remove_speculative() const;
747 virtual const Type* cleanup_speculative() const;
748
749 bool is_value_type_array() const { return _elem->isa_valuetype() != NULL; }
750
751 #ifdef ASSERT
752 // One type is interface, the other is oop
753 virtual bool interface_vs_oop(const Type *t) const;
754 #endif
755 #ifndef PRODUCT
756 virtual void dump2( Dict &d, uint, outputStream *st ) const; // Specialized per-Type dumping
757 #endif
758 };
759
760
761 //------------------------------TypeValue---------------------------------------
762 // Class of Value Type Types
763 class TypeValueType : public Type {
764 private:
765 ciValueKlass* _vk;
766
767 protected:
768 TypeValueType(ciValueKlass* vk) : Type(ValueType) { _vk = vk; }
769
770 public:
771 static const TypeValueType* make(ciValueKlass* vk);
772 ciValueKlass* value_klass() const { return _vk; }
773
774 virtual bool eq(const Type* t) const;
775 virtual int hash() const; // Type specific hashing
776 virtual bool singleton(void) const; // TRUE if type is a singleton
777 virtual bool empty(void) const; // TRUE if type is vacuous
778
779 virtual const Type* xmeet(const Type* t) const;
780 virtual const Type* xdual() const; // Compute dual right now.
781
782 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const { return false; }
783 virtual bool would_improve_ptr(ProfilePtrKind ptr_kind) const { return false; }
784
785 #ifndef PRODUCT
786 virtual void dump2(Dict &d, uint, outputStream* st) const; // Specialized per-Type dumping
787 #endif
788 };
789
790 //------------------------------TypeVect---------------------------------------
791 // Class of Vector Types
792 class TypeVect : public Type {
793 const Type* _elem; // Vector's element type
794 const uint _length; // Elements in vector (power of 2)
795
796 protected:
797 TypeVect(TYPES t, const Type* elem, uint length) : Type(t),
798 _elem(elem), _length(length) {}
799
800 public:
801 const Type* element_type() const { return _elem; }
802 BasicType element_basic_type() const { return _elem->array_element_basic_type(); }
803 uint length() const { return _length; }
804 uint length_in_bytes() const {
805 return _length * type2aelembytes(element_basic_type());
806 }
807
808 virtual bool eq(const Type *t) const;
809 virtual int hash() const; // Type specific hashing
810 virtual bool singleton(void) const; // TRUE if type is a singleton
811 virtual bool empty(void) const; // TRUE if type is vacuous
812
813 static const TypeVect *make(const BasicType elem_bt, uint length) {
814 // Use bottom primitive type.
815 return make(get_const_basic_type(elem_bt), length);
816 }
817 // Used directly by Replicate nodes to construct singleton vector.
818 static const TypeVect *make(const Type* elem, uint length);
819
820 virtual const Type *xmeet( const Type *t) const;
821 virtual const Type *xdual() const; // Compute dual right now.
822
823 static const TypeVect *VECTS;
824 static const TypeVect *VECTD;
825 static const TypeVect *VECTX;
826 static const TypeVect *VECTY;
827 static const TypeVect *VECTZ;
828
829 #ifndef PRODUCT
830 virtual void dump2(Dict &d, uint, outputStream *st) const; // Specialized per-Type dumping
831 #endif
832 };
833
834 class TypeVectS : public TypeVect {
835 friend class TypeVect;
836 TypeVectS(const Type* elem, uint length) : TypeVect(VectorS, elem, length) {}
837 };
838
839 class TypeVectD : public TypeVect {
840 friend class TypeVect;
841 TypeVectD(const Type* elem, uint length) : TypeVect(VectorD, elem, length) {}
842 };
843
844 class TypeVectX : public TypeVect {
845 friend class TypeVect;
846 TypeVectX(const Type* elem, uint length) : TypeVect(VectorX, elem, length) {}
847 };
848
849 class TypeVectY : public TypeVect {
850 friend class TypeVect;
851 TypeVectY(const Type* elem, uint length) : TypeVect(VectorY, elem, length) {}
852 };
853
854 class TypeVectZ : public TypeVect {
855 friend class TypeVect;
856 TypeVectZ(const Type* elem, uint length) : TypeVect(VectorZ, elem, length) {}
857 };
858
859 //------------------------------TypePtr----------------------------------------
860 // Class of machine Pointer Types: raw data, instances or arrays.
861 // If the _base enum is AnyPtr, then this refers to all of the above.
862 // Otherwise the _base will indicate which subset of pointers is affected,
863 // and the class will be inherited from.
864 class TypePtr : public Type {
865 friend class TypeNarrowPtr;
866 public:
867 enum PTR { TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, lastPTR };
868 protected:
869 TypePtr(TYPES t, PTR ptr, Offset offset,
870 const TypePtr* speculative = NULL,
871 int inline_depth = InlineDepthBottom) :
872 Type(t), _speculative(speculative), _inline_depth(inline_depth), _offset(offset),
873 _ptr(ptr) {}
874 static const PTR ptr_meet[lastPTR][lastPTR];
875 static const PTR ptr_dual[lastPTR];
876 static const char * const ptr_msg[lastPTR];
877
878 enum {
879 InlineDepthBottom = INT_MAX,
880 InlineDepthTop = -InlineDepthBottom
881 };
882
883 // Extra type information profiling gave us. We propagate it the
884 // same way the rest of the type info is propagated. If we want to
885 // use it, then we have to emit a guard: this part of the type is
886 // not something we know but something we speculate about the type.
887 const TypePtr* _speculative;
888 // For speculative types, we record at what inlining depth the
889 // profiling point that provided the data is. We want to favor
890 // profile data coming from outer scopes which are likely better for
891 // the current compilation.
892 int _inline_depth;
893
894 // utility methods to work on the speculative part of the type
895 const TypePtr* dual_speculative() const;
896 const TypePtr* xmeet_speculative(const TypePtr* other) const;
897 bool eq_speculative(const TypePtr* other) const;
898 int hash_speculative() const;
899 const TypePtr* add_offset_speculative(intptr_t offset) const;
900 #ifndef PRODUCT
901 void dump_speculative(outputStream *st) const;
902 #endif
903
904 // utility methods to work on the inline depth of the type
905 int dual_inline_depth() const;
906 int meet_inline_depth(int depth) const;
907 #ifndef PRODUCT
908 void dump_inline_depth(outputStream *st) const;
909 #endif
910
911 public:
912 const Offset _offset; // Offset into oop, with TOP & BOT
913 const PTR _ptr; // Pointer equivalence class
914
915 const int offset() const { return _offset.get(); }
916 const PTR ptr() const { return _ptr; }
917
918 static const TypePtr* make(TYPES t, PTR ptr, Offset offset,
919 const TypePtr* speculative = NULL,
920 int inline_depth = InlineDepthBottom);
921
922 // Return a 'ptr' version of this type
923 virtual const Type *cast_to_ptr_type(PTR ptr) const;
924
925 virtual intptr_t get_con() const;
926
927 Offset xadd_offset(intptr_t offset) const;
928 virtual const TypePtr *add_offset( intptr_t offset ) const;
929 virtual const int flattened_offset() const { return offset(); }
930
931 virtual bool eq(const Type *t) const;
932 virtual int hash() const; // Type specific hashing
933
934 virtual bool singleton(void) const; // TRUE if type is a singleton
935 virtual bool empty(void) const; // TRUE if type is vacuous
936 virtual const Type *xmeet( const Type *t ) const;
937 virtual const Type *xmeet_helper( const Type *t ) const;
938 Offset meet_offset(int offset) const;
939 Offset dual_offset() const;
940 virtual const Type *xdual() const; // Compute dual right now.
941
942 // meet, dual and join over pointer equivalence sets
943 PTR meet_ptr( const PTR in_ptr ) const { return ptr_meet[in_ptr][ptr()]; }
944 PTR dual_ptr() const { return ptr_dual[ptr()]; }
945
946 // This is textually confusing unless one recalls that
947 // join(t) == dual()->meet(t->dual())->dual().
948 PTR join_ptr( const PTR in_ptr ) const {
949 return ptr_dual[ ptr_meet[ ptr_dual[in_ptr] ] [ dual_ptr() ] ];
950 }
951
952 // Speculative type helper methods.
953 virtual const TypePtr* speculative() const { return _speculative; }
954 int inline_depth() const { return _inline_depth; }
955 virtual ciKlass* speculative_type() const;
956 virtual ciKlass* speculative_type_not_null() const;
957 virtual bool speculative_maybe_null() const;
958 virtual bool speculative_always_null() const;
959 virtual const Type* remove_speculative() const;
960 virtual const Type* cleanup_speculative() const;
961 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const;
962 virtual bool would_improve_ptr(ProfilePtrKind maybe_null) const;
963 virtual const TypePtr* with_inline_depth(int depth) const;
964
965 virtual bool maybe_null() const { return meet_ptr(Null) == ptr(); }
966
967 // Tests for relation to centerline of type lattice:
968 static bool above_centerline(PTR ptr) { return (ptr <= AnyNull); }
969 static bool below_centerline(PTR ptr) { return (ptr >= NotNull); }
970 // Convenience common pre-built types.
971 static const TypePtr *NULL_PTR;
972 static const TypePtr *NOTNULL;
973 static const TypePtr *BOTTOM;
974 #ifndef PRODUCT
975 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
976 #endif
977 };
978
979 //------------------------------TypeRawPtr-------------------------------------
980 // Class of raw pointers, pointers to things other than Oops. Examples
981 // include the stack pointer, top of heap, card-marking area, handles, etc.
982 class TypeRawPtr : public TypePtr {
983 protected:
984 TypeRawPtr(PTR ptr, address bits) : TypePtr(RawPtr,ptr,Offset(0)), _bits(bits){}
985 public:
986 virtual bool eq( const Type *t ) const;
987 virtual int hash() const; // Type specific hashing
988
989 const address _bits; // Constant value, if applicable
990
991 static const TypeRawPtr *make( PTR ptr );
992 static const TypeRawPtr *make( address bits );
993
994 // Return a 'ptr' version of this type
995 virtual const Type *cast_to_ptr_type(PTR ptr) const;
996
997 virtual intptr_t get_con() const;
998
999 virtual const TypePtr *add_offset( intptr_t offset ) const;
1000
1001 virtual const Type *xmeet( const Type *t ) const;
1002 virtual const Type *xdual() const; // Compute dual right now.
1003 // Convenience common pre-built types.
1004 static const TypeRawPtr *BOTTOM;
1005 static const TypeRawPtr *NOTNULL;
1006 #ifndef PRODUCT
1007 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
1008 #endif
1009 };
1010
1011 //------------------------------TypeOopPtr-------------------------------------
1012 // Some kind of oop (Java pointer), either instance or array.
1013 class TypeOopPtr : public TypePtr {
1014 protected:
1015 TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, bool xk, ciObject* o, Offset offset, Offset field_offset,
1016 int instance_id, const TypePtr* speculative, int inline_depth);
1017 public:
1018 virtual bool eq( const Type *t ) const;
1019 virtual int hash() const; // Type specific hashing
1020 virtual bool singleton(void) const; // TRUE if type is a singleton
1021 enum {
1022 InstanceTop = -1, // undefined instance
1023 InstanceBot = 0 // any possible instance
1024 };
1025 protected:
1026
1027 // Oop is NULL, unless this is a constant oop.
1028 ciObject* _const_oop; // Constant oop
1029 // If _klass is NULL, then so is _sig. This is an unloaded klass.
1030 ciKlass* _klass; // Klass object
1031 // Does the type exclude subclasses of the klass? (Inexact == polymorphic.)
1032 bool _klass_is_exact;
1033 bool _is_ptr_to_narrowoop;
1034 bool _is_ptr_to_narrowklass;
1035 bool _is_ptr_to_boxed_value;
1036
1037 // If not InstanceTop or InstanceBot, indicates that this is
1038 // a particular instance of this type which is distinct.
1039 // This is the node index of the allocation node creating this instance.
1040 int _instance_id;
1041
1042 static const TypeOopPtr* make_from_klass_common(ciKlass* klass, bool klass_change, bool try_for_exact);
1043
1044 int dual_instance_id() const;
1045 int meet_instance_id(int uid) const;
1046
1047 // Do not allow interface-vs.-noninterface joins to collapse to top.
1048 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
1049
1050 public:
1051 // Creates a type given a klass. Correctly handles multi-dimensional arrays
1052 // Respects UseUniqueSubclasses.
1053 // If the klass is final, the resulting type will be exact.
1054 static const TypeOopPtr* make_from_klass(ciKlass* klass) {
1055 return make_from_klass_common(klass, true, false);
1056 }
1057 // Same as before, but will produce an exact type, even if
1058 // the klass is not final, as long as it has exactly one implementation.
1059 static const TypeOopPtr* make_from_klass_unique(ciKlass* klass) {
1060 return make_from_klass_common(klass, true, true);
1061 }
1062 // Same as before, but does not respects UseUniqueSubclasses.
1063 // Use this only for creating array element types.
1064 static const TypeOopPtr* make_from_klass_raw(ciKlass* klass) {
1065 return make_from_klass_common(klass, false, false);
1066 }
1067 // Creates a singleton type given an object.
1068 // If the object cannot be rendered as a constant,
1069 // may return a non-singleton type.
1070 // If require_constant, produce a NULL if a singleton is not possible.
1071 static const TypeOopPtr* make_from_constant(ciObject* o,
1072 bool require_constant = false);
1073
1074 // Make a generic (unclassed) pointer to an oop.
1075 static const TypeOopPtr* make(PTR ptr, Offset offset, int instance_id,
1076 const TypePtr* speculative = NULL,
1077 int inline_depth = InlineDepthBottom);
1078
1079 ciObject* const_oop() const { return _const_oop; }
1080 virtual ciKlass* klass() const { return _klass; }
1081 bool klass_is_exact() const { return _klass_is_exact; }
1082
1083 // Returns true if this pointer points at memory which contains a
1084 // compressed oop references.
1085 bool is_ptr_to_narrowoop_nv() const { return _is_ptr_to_narrowoop; }
1086 bool is_ptr_to_narrowklass_nv() const { return _is_ptr_to_narrowklass; }
1087 bool is_ptr_to_boxed_value() const { return _is_ptr_to_boxed_value; }
1088 bool is_known_instance() const { return _instance_id > 0; }
1089 int instance_id() const { return _instance_id; }
1090 bool is_known_instance_field() const { return is_known_instance() && _offset.get() >= 0; }
1091
1092 virtual bool can_be_value_type() const { return EnableValhalla && (_klass == NULL || _klass->is_valuetype() || ((_klass->is_java_lang_Object() || _klass->is_interface()) && !klass_is_exact())); }
1093
1094 virtual intptr_t get_con() const;
1095
1096 virtual const Type *cast_to_ptr_type(PTR ptr) const;
1097
1098 virtual const Type *cast_to_exactness(bool klass_is_exact) const;
1099
1100 virtual const TypeOopPtr *cast_to_instance_id(int instance_id) const;
1101
1102 virtual const TypeOopPtr *cast_to_nonconst() const;
1103
1104 // corresponding pointer to klass, for a given instance
1105 const TypeKlassPtr* as_klass_type() const;
1106
1107 virtual const TypePtr *add_offset( intptr_t offset ) const;
1108
1109 // Speculative type helper methods.
1110 virtual const Type* remove_speculative() const;
1111 virtual const Type* cleanup_speculative() const;
1112 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const;
1113 virtual const TypePtr* with_inline_depth(int depth) const;
1114
1115 virtual const Type *xdual() const; // Compute dual right now.
1116 // the core of the computation of the meet for TypeOopPtr and for its subclasses
1117 virtual const Type *xmeet_helper(const Type *t) const;
1118
1119 // Convenience common pre-built type.
1120 static const TypeOopPtr *BOTTOM;
1121 #ifndef PRODUCT
1122 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
1123 #endif
1124 };
1125
1126 //------------------------------TypeInstPtr------------------------------------
1127 // Class of Java object pointers, pointing either to non-array Java instances
1128 // or to a Klass* (including array klasses).
1129 class TypeInstPtr : public TypeOopPtr {
1130 TypeInstPtr(PTR ptr, ciKlass* k, bool xk, ciObject* o, Offset offset, int instance_id,
1131 const TypePtr* speculative, int inline_depth);
1132 virtual bool eq( const Type *t ) const;
1133 virtual int hash() const; // Type specific hashing
1134
1135 ciSymbol* _name; // class name
1136
1137 public:
1138 ciSymbol* name() const { return _name; }
1139
1140 bool is_loaded() const { return _klass->is_loaded(); }
1141
1142 // Make a pointer to a constant oop.
1143 static const TypeInstPtr *make(ciObject* o) {
1144 return make(TypePtr::Constant, o->klass(), true, o, Offset(0), InstanceBot);
1145 }
1146 // Make a pointer to a constant oop with offset.
1147 static const TypeInstPtr* make(ciObject* o, Offset offset) {
1148 return make(TypePtr::Constant, o->klass(), true, o, offset, InstanceBot);
1149 }
1150
1151 // Make a pointer to some value of type klass.
1152 static const TypeInstPtr *make(PTR ptr, ciKlass* klass) {
1153 return make(ptr, klass, false, NULL, Offset(0), InstanceBot);
1154 }
1155
1156 // Make a pointer to some non-polymorphic value of exactly type klass.
1157 static const TypeInstPtr *make_exact(PTR ptr, ciKlass* klass) {
1158 return make(ptr, klass, true, NULL, Offset(0), InstanceBot);
1159 }
1160
1161 // Make a pointer to some value of type klass with offset.
1162 static const TypeInstPtr *make(PTR ptr, ciKlass* klass, Offset offset) {
1163 return make(ptr, klass, false, NULL, offset, InstanceBot);
1164 }
1165
1166 // Make a pointer to an oop.
1167 static const TypeInstPtr* make(PTR ptr, ciKlass* k, bool xk, ciObject* o, Offset offset,
1168 int instance_id = InstanceBot,
1169 const TypePtr* speculative = NULL,
1170 int inline_depth = InlineDepthBottom);
1171
1172 /** Create constant type for a constant boxed value */
1173 const Type* get_const_boxed_value() const;
1174
1175 // If this is a java.lang.Class constant, return the type for it or NULL.
1176 // Pass to Type::get_const_type to turn it to a type, which will usually
1177 // be a TypeInstPtr, but may also be a TypeInt::INT for int.class, etc.
1178 ciType* java_mirror_type() const;
1179
1180 virtual const Type *cast_to_ptr_type(PTR ptr) const;
1181
1182 virtual const Type *cast_to_exactness(bool klass_is_exact) const;
1183
1184 virtual const TypeOopPtr *cast_to_instance_id(int instance_id) const;
1185
1186 virtual const TypeOopPtr *cast_to_nonconst() const;
1187
1188 virtual const TypePtr *add_offset( intptr_t offset ) const;
1189
1190 // Speculative type helper methods.
1191 virtual const Type* remove_speculative() const;
1192 virtual const TypePtr* with_inline_depth(int depth) const;
1193
1194 // the core of the computation of the meet of 2 types
1195 virtual const Type *xmeet_helper(const Type *t) const;
1196 virtual const TypeInstPtr *xmeet_unloaded( const TypeInstPtr *t ) const;
1197 virtual const Type *xdual() const; // Compute dual right now.
1198
1199 // Convenience common pre-built types.
1200 static const TypeInstPtr *NOTNULL;
1201 static const TypeInstPtr *BOTTOM;
1202 static const TypeInstPtr *MIRROR;
1203 static const TypeInstPtr *MARK;
1204 static const TypeInstPtr *KLASS;
1205 #ifndef PRODUCT
1206 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping
1207 #endif
1208 };
1209
1210 //------------------------------TypeAryPtr-------------------------------------
1211 // Class of Java array pointers
1212 class TypeAryPtr : public TypeOopPtr {
1213 TypeAryPtr(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk,
1214 Offset offset, Offset field_offset, int instance_id, bool is_autobox_cache,
1215 const TypePtr* speculative, int inline_depth)
1216 : TypeOopPtr(AryPtr, ptr, k, xk, o, offset, field_offset, instance_id, speculative, inline_depth),
1217 _ary(ary),
1218 _is_autobox_cache(is_autobox_cache),
1219 _field_offset(field_offset)
1220 {
1221 #ifdef ASSERT
1222 if (k != NULL) {
1223 // Verify that specified klass and TypeAryPtr::klass() follow the same rules.
1224 ciKlass* ck = compute_klass(true);
1225 if (k != ck) {
1226 this->dump(); tty->cr();
1227 tty->print(" k: ");
1228 k->print(); tty->cr();
1229 tty->print("ck: ");
1230 if (ck != NULL) ck->print();
1231 else tty->print("<NULL>");
1232 tty->cr();
1233 assert(false, "unexpected TypeAryPtr::_klass");
1234 }
1235 }
1236 #endif
1237 }
1238 virtual bool eq( const Type *t ) const;
1239 virtual int hash() const; // Type specific hashing
1240 const TypeAry *_ary; // Array we point into
1241 const bool _is_autobox_cache;
1242 // For flattened value type arrays, each field of the value type in
1243 // the array has its own memory slice so we need to keep track of
1244 // which field is accessed
1245 const Offset _field_offset;
1246 Offset meet_field_offset(const Type::Offset offset) const;
1247 Offset dual_field_offset() const;
1248
1249 ciKlass* compute_klass(DEBUG_ONLY(bool verify = false)) const;
1250
1251 public:
1252 // Accessors
1253 ciKlass* klass() const;
1254 const TypeAry* ary() const { return _ary; }
1255 const Type* elem() const { return _ary->_elem; }
1256 const TypeInt* size() const { return _ary->_size; }
1257 bool is_stable() const { return _ary->_stable; }
1258
1259 bool is_autobox_cache() const { return _is_autobox_cache; }
1260
1261 static const TypeAryPtr* make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, Offset offset,
1262 Offset field_offset = Offset::bottom,
1263 int instance_id = InstanceBot,
1264 const TypePtr* speculative = NULL,
1265 int inline_depth = InlineDepthBottom);
1266 // Constant pointer to array
1267 static const TypeAryPtr* make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, Offset offset,
1268 Offset field_offset = Offset::bottom,
1269 int instance_id = InstanceBot,
1270 const TypePtr* speculative = NULL,
1271 int inline_depth = InlineDepthBottom,
1272 bool is_autobox_cache = false);
1273
1274 // Return a 'ptr' version of this type
1275 virtual const Type *cast_to_ptr_type(PTR ptr) const;
1276
1277 virtual const Type *cast_to_exactness(bool klass_is_exact) const;
1278
1279 virtual const TypeOopPtr *cast_to_instance_id(int instance_id) const;
1280
1281 virtual const TypeOopPtr *cast_to_nonconst() const;
1282
1283 virtual const TypeAryPtr* cast_to_size(const TypeInt* size) const;
1284 virtual const TypeInt* narrow_size_type(const TypeInt* size) const;
1285
1286 virtual bool empty(void) const; // TRUE if type is vacuous
1287 virtual const TypePtr *add_offset( intptr_t offset ) const;
1288
1289 // Speculative type helper methods.
1290 virtual const Type* remove_speculative() const;
1291 virtual const TypePtr* with_inline_depth(int depth) const;
1292
1293 // the core of the computation of the meet of 2 types
1294 virtual const Type *xmeet_helper(const Type *t) const;
1295 virtual const Type *xdual() const; // Compute dual right now.
1296
1297 const TypeAryPtr* cast_to_stable(bool stable, int stable_dimension = 1) const;
1298 int stable_dimension() const;
1299
1300 const TypeAryPtr* cast_to_autobox_cache(bool cache) const;
1301
1302 const int flattened_offset() const;
1303 const Offset field_offset() const { return _field_offset; }
1304 const TypeAryPtr* with_field_offset(int offset) const;
1305 const TypePtr* add_field_offset_and_offset(intptr_t offset) const;
1306
1307 virtual bool can_be_value_type() const { return false; }
1308
1309 // Convenience common pre-built types.
1310 static const TypeAryPtr *RANGE;
1311 static const TypeAryPtr *OOPS;
1312 static const TypeAryPtr *NARROWOOPS;
1313 static const TypeAryPtr *BYTES;
1314 static const TypeAryPtr *SHORTS;
1315 static const TypeAryPtr *CHARS;
1316 static const TypeAryPtr *INTS;
1317 static const TypeAryPtr *LONGS;
1318 static const TypeAryPtr *FLOATS;
1319 static const TypeAryPtr *DOUBLES;
1320 // selects one of the above:
1321 static const TypeAryPtr *get_array_body_type(BasicType elem) {
1322 assert((uint)elem <= T_CONFLICT && _array_body_type[elem] != NULL, "bad elem type");
1323 return _array_body_type[elem];
1324 }
1325 static const TypeAryPtr *_array_body_type[T_CONFLICT+1];
1326 // sharpen the type of an int which is used as an array size
1327 #ifdef ASSERT
1328 // One type is interface, the other is oop
1329 virtual bool interface_vs_oop(const Type *t) const;
1330 #endif
1331 #ifndef PRODUCT
1332 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping
1333 #endif
1334 };
1335
1336 //------------------------------TypeMetadataPtr-------------------------------------
1337 // Some kind of metadata, either Method*, MethodData* or CPCacheOop
1338 class TypeMetadataPtr : public TypePtr {
1339 protected:
1340 TypeMetadataPtr(PTR ptr, ciMetadata* metadata, Offset offset);
1341 // Do not allow interface-vs.-noninterface joins to collapse to top.
1342 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
1343 public:
1344 virtual bool eq( const Type *t ) const;
1345 virtual int hash() const; // Type specific hashing
1346 virtual bool singleton(void) const; // TRUE if type is a singleton
1347
1348 private:
1349 ciMetadata* _metadata;
1350
1351 public:
1352 static const TypeMetadataPtr* make(PTR ptr, ciMetadata* m, Offset offset);
1353
1354 static const TypeMetadataPtr* make(ciMethod* m);
1355 static const TypeMetadataPtr* make(ciMethodData* m);
1356
1357 ciMetadata* metadata() const { return _metadata; }
1358
1359 virtual const Type *cast_to_ptr_type(PTR ptr) const;
1360
1361 virtual const TypePtr *add_offset( intptr_t offset ) const;
1362
1363 virtual const Type *xmeet( const Type *t ) const;
1364 virtual const Type *xdual() const; // Compute dual right now.
1365
1366 virtual intptr_t get_con() const;
1367
1368 // Convenience common pre-built types.
1369 static const TypeMetadataPtr *BOTTOM;
1370
1371 #ifndef PRODUCT
1372 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
1373 #endif
1374 };
1375
1376 //------------------------------TypeKlassPtr-----------------------------------
1377 // Class of Java Klass pointers
1378 class TypeKlassPtr : public TypePtr {
1379 TypeKlassPtr(PTR ptr, ciKlass* klass, Offset offset);
1380
1381 protected:
1382 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
1383 public:
1384 virtual bool eq( const Type *t ) const;
1385 virtual int hash() const; // Type specific hashing
1386 virtual bool singleton(void) const; // TRUE if type is a singleton
1387 private:
1388
1389 ciKlass* _klass;
1390
1391 // Does the type exclude subclasses of the klass? (Inexact == polymorphic.)
1392 bool _klass_is_exact;
1393
1394 public:
1395 ciKlass* klass() const { return _klass; }
1396 bool klass_is_exact() const { return _klass_is_exact; }
1397
1398 bool is_loaded() const { return klass() != NULL && klass()->is_loaded(); }
1399
1400 // ptr to klass 'k'
1401 static const TypeKlassPtr* make(ciKlass* k) { return make( TypePtr::Constant, k, Offset(0)); }
1402 // ptr to klass 'k' with offset
1403 static const TypeKlassPtr* make(ciKlass* k, Offset offset) { return make( TypePtr::Constant, k, offset); }
1404 // ptr to klass 'k' or sub-klass
1405 static const TypeKlassPtr* make(PTR ptr, ciKlass* k, Offset offset);
1406
1407 virtual const Type *cast_to_ptr_type(PTR ptr) const;
1408
1409 virtual const Type *cast_to_exactness(bool klass_is_exact) const;
1410
1411 // corresponding pointer to instance, for a given class
1412 const TypeOopPtr* as_instance_type() const;
1413
1414 virtual const TypePtr *add_offset( intptr_t offset ) const;
1415 virtual const Type *xmeet( const Type *t ) const;
1416 virtual const Type *xdual() const; // Compute dual right now.
1417
1418 virtual intptr_t get_con() const;
1419
1420 // Convenience common pre-built types.
1421 static const TypeKlassPtr* OBJECT; // Not-null object klass or below
1422 static const TypeKlassPtr* OBJECT_OR_NULL; // Maybe-null version of same
1423 #ifndef PRODUCT
1424 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping
1425 #endif
1426 };
1427
1428 class TypeNarrowPtr : public Type {
1429 protected:
1430 const TypePtr* _ptrtype; // Could be TypePtr::NULL_PTR
1431
1432 TypeNarrowPtr(TYPES t, const TypePtr* ptrtype): Type(t),
1433 _ptrtype(ptrtype) {
1434 assert(ptrtype->offset() == 0 ||
1435 ptrtype->offset() == OffsetBot ||
1436 ptrtype->offset() == OffsetTop, "no real offsets");
1437 }
1438
1439 virtual const TypeNarrowPtr *isa_same_narrowptr(const Type *t) const = 0;
1440 virtual const TypeNarrowPtr *is_same_narrowptr(const Type *t) const = 0;
1441 virtual const TypeNarrowPtr *make_same_narrowptr(const TypePtr *t) const = 0;
1442 virtual const TypeNarrowPtr *make_hash_same_narrowptr(const TypePtr *t) const = 0;
1443 // Do not allow interface-vs.-noninterface joins to collapse to top.
1444 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
1445 public:
1446 virtual bool eq( const Type *t ) const;
1447 virtual int hash() const; // Type specific hashing
1448 virtual bool singleton(void) const; // TRUE if type is a singleton
1449
1450 virtual const Type *xmeet( const Type *t ) const;
1451 virtual const Type *xdual() const; // Compute dual right now.
1452
1453 virtual intptr_t get_con() const;
1454
1455 virtual bool empty(void) const; // TRUE if type is vacuous
1456
1457 // returns the equivalent ptr type for this compressed pointer
1458 const TypePtr *get_ptrtype() const {
1459 return _ptrtype;
1460 }
1461
1462 #ifndef PRODUCT
1463 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
1464 #endif
1465 };
1466
1467 //------------------------------TypeNarrowOop----------------------------------
1468 // A compressed reference to some kind of Oop. This type wraps around
1469 // a preexisting TypeOopPtr and forwards most of it's operations to
1470 // the underlying type. It's only real purpose is to track the
1471 // oopness of the compressed oop value when we expose the conversion
1472 // between the normal and the compressed form.
1473 class TypeNarrowOop : public TypeNarrowPtr {
1474 protected:
1475 TypeNarrowOop( const TypePtr* ptrtype): TypeNarrowPtr(NarrowOop, ptrtype) {
1476 }
1477
1478 virtual const TypeNarrowPtr *isa_same_narrowptr(const Type *t) const {
1479 return t->isa_narrowoop();
1480 }
1481
1482 virtual const TypeNarrowPtr *is_same_narrowptr(const Type *t) const {
1483 return t->is_narrowoop();
1484 }
1485
1486 virtual const TypeNarrowPtr *make_same_narrowptr(const TypePtr *t) const {
1487 return new TypeNarrowOop(t);
1488 }
1489
1490 virtual const TypeNarrowPtr *make_hash_same_narrowptr(const TypePtr *t) const {
1491 return (const TypeNarrowPtr*)((new TypeNarrowOop(t))->hashcons());
1492 }
1493
1494 public:
1495
1496 static const TypeNarrowOop *make( const TypePtr* type);
1497
1498 static const TypeNarrowOop* make_from_constant(ciObject* con, bool require_constant = false) {
1499 return make(TypeOopPtr::make_from_constant(con, require_constant));
1500 }
1501
1502 static const TypeNarrowOop *BOTTOM;
1503 static const TypeNarrowOop *NULL_PTR;
1504
1505 virtual const Type* remove_speculative() const;
1506 virtual const Type* cleanup_speculative() const;
1507
1508 #ifndef PRODUCT
1509 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
1510 #endif
1511 };
1512
1513 //------------------------------TypeNarrowKlass----------------------------------
1514 // A compressed reference to klass pointer. This type wraps around a
1515 // preexisting TypeKlassPtr and forwards most of it's operations to
1516 // the underlying type.
1517 class TypeNarrowKlass : public TypeNarrowPtr {
1518 protected:
1519 TypeNarrowKlass( const TypePtr* ptrtype): TypeNarrowPtr(NarrowKlass, ptrtype) {
1520 }
1521
1522 virtual const TypeNarrowPtr *isa_same_narrowptr(const Type *t) const {
1523 return t->isa_narrowklass();
1524 }
1525
1526 virtual const TypeNarrowPtr *is_same_narrowptr(const Type *t) const {
1527 return t->is_narrowklass();
1528 }
1529
1530 virtual const TypeNarrowPtr *make_same_narrowptr(const TypePtr *t) const {
1531 return new TypeNarrowKlass(t);
1532 }
1533
1534 virtual const TypeNarrowPtr *make_hash_same_narrowptr(const TypePtr *t) const {
1535 return (const TypeNarrowPtr*)((new TypeNarrowKlass(t))->hashcons());
1536 }
1537
1538 public:
1539 static const TypeNarrowKlass *make( const TypePtr* type);
1540
1541 // static const TypeNarrowKlass *BOTTOM;
1542 static const TypeNarrowKlass *NULL_PTR;
1543
1544 #ifndef PRODUCT
1545 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
1546 #endif
1547 };
1548
1549 //------------------------------TypeFunc---------------------------------------
1550 // Class of Array Types
1551 class TypeFunc : public Type {
1552 TypeFunc(const TypeTuple *domain_sig, const TypeTuple *domain_cc, const TypeTuple *range_sig, const TypeTuple *range_cc)
1553 : Type(Function), _domain_sig(domain_sig), _domain_cc(domain_cc), _range_sig(range_sig), _range_cc(range_cc) {}
1554 virtual bool eq( const Type *t ) const;
1555 virtual int hash() const; // Type specific hashing
1556 virtual bool singleton(void) const; // TRUE if type is a singleton
1557 virtual bool empty(void) const; // TRUE if type is vacuous
1558
1559 // Domains of inputs: value type arguments are not passed by
1560 // reference, instead each field of the value type is passed as an
1561 // argument. We maintain 2 views of the argument list here: one
1562 // based on the signature (with a value type argument as a single
1563 // slot), one based on the actual calling convention (with a value
1564 // type argument as a list of its fields).
1565 const TypeTuple* const _domain_sig;
1566 const TypeTuple* const _domain_cc;
1567 // Range of results. Similar to domains: a value type result can be
1568 // returned in registers in which case range_cc lists all fields and
1569 // is the actual calling convention.
1570 const TypeTuple* const _range_sig;
1571 const TypeTuple* const _range_cc;
1572
1573 public:
1574 // Constants are shared among ADLC and VM
1575 enum { Control = AdlcVMDeps::Control,
1576 I_O = AdlcVMDeps::I_O,
1577 Memory = AdlcVMDeps::Memory,
1578 FramePtr = AdlcVMDeps::FramePtr,
1579 ReturnAdr = AdlcVMDeps::ReturnAdr,
1580 Parms = AdlcVMDeps::Parms
1581 };
1582
1583
1584 // Accessors:
1585 const TypeTuple* domain_sig() const { return _domain_sig; }
1586 const TypeTuple* domain_cc() const { return _domain_cc; }
1587 const TypeTuple* range_sig() const { return _range_sig; }
1588 const TypeTuple* range_cc() const { return _range_cc; }
1589
1590 static const TypeFunc *make(ciMethod* method);
1591 static const TypeFunc *make(ciSignature signature, const Type* extra);
1592 static const TypeFunc *make(const TypeTuple* domain_sig, const TypeTuple* domain_cc,
1593 const TypeTuple* range_sig, const TypeTuple* range_cc);
1594 static const TypeFunc *make(const TypeTuple* domain, const TypeTuple* range);
1595
1596 virtual const Type *xmeet( const Type *t ) const;
1597 virtual const Type *xdual() const; // Compute dual right now.
1598
1599 BasicType return_type() const;
1600
1601 bool returns_value_type_as_fields() const { return range_sig() != range_cc(); }
1602
1603 #ifndef PRODUCT
1604 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping
1605 #endif
1606 // Convenience common pre-built types.
1607 };
1608
1609 //------------------------------accessors--------------------------------------
1610 inline bool Type::is_ptr_to_narrowoop() const {
1611 #ifdef _LP64
1612 return (isa_oopptr() != NULL && is_oopptr()->is_ptr_to_narrowoop_nv());
1613 #else
1614 return false;
1615 #endif
1616 }
1617
1618 inline bool Type::is_ptr_to_narrowklass() const {
1619 #ifdef _LP64
1620 return (isa_oopptr() != NULL && is_oopptr()->is_ptr_to_narrowklass_nv());
1621 #else
1622 return false;
1623 #endif
1624 }
1625
1626 inline float Type::getf() const {
1627 assert( _base == FloatCon, "Not a FloatCon" );
1628 return ((TypeF*)this)->_f;
1629 }
1630
1631 inline double Type::getd() const {
1632 assert( _base == DoubleCon, "Not a DoubleCon" );
1633 return ((TypeD*)this)->_d;
1634 }
1635
1636 inline const TypeInt *Type::is_int() const {
1637 assert( _base == Int, "Not an Int" );
1638 return (TypeInt*)this;
1639 }
1640
1641 inline const TypeInt *Type::isa_int() const {
1642 return ( _base == Int ? (TypeInt*)this : NULL);
1643 }
1644
1645 inline const TypeLong *Type::is_long() const {
1646 assert( _base == Long, "Not a Long" );
1647 return (TypeLong*)this;
1648 }
1649
1650 inline const TypeLong *Type::isa_long() const {
1651 return ( _base == Long ? (TypeLong*)this : NULL);
1652 }
1653
1654 inline const TypeF *Type::isa_float() const {
1655 return ((_base == FloatTop ||
1656 _base == FloatCon ||
1657 _base == FloatBot) ? (TypeF*)this : NULL);
1658 }
1659
1660 inline const TypeF *Type::is_float_constant() const {
1661 assert( _base == FloatCon, "Not a Float" );
1662 return (TypeF*)this;
1663 }
1664
1665 inline const TypeF *Type::isa_float_constant() const {
1666 return ( _base == FloatCon ? (TypeF*)this : NULL);
1667 }
1668
1669 inline const TypeD *Type::isa_double() const {
1670 return ((_base == DoubleTop ||
1671 _base == DoubleCon ||
1672 _base == DoubleBot) ? (TypeD*)this : NULL);
1673 }
1674
1675 inline const TypeD *Type::is_double_constant() const {
1676 assert( _base == DoubleCon, "Not a Double" );
1677 return (TypeD*)this;
1678 }
1679
1680 inline const TypeD *Type::isa_double_constant() const {
1681 return ( _base == DoubleCon ? (TypeD*)this : NULL);
1682 }
1683
1684 inline const TypeTuple *Type::is_tuple() const {
1685 assert( _base == Tuple, "Not a Tuple" );
1686 return (TypeTuple*)this;
1687 }
1688
1689 inline const TypeAry *Type::is_ary() const {
1690 assert( _base == Array , "Not an Array" );
1691 return (TypeAry*)this;
1692 }
1693
1694 inline const TypeVect *Type::is_vect() const {
1695 assert( _base >= VectorS && _base <= VectorZ, "Not a Vector" );
1696 return (TypeVect*)this;
1697 }
1698
1699 inline const TypeVect *Type::isa_vect() const {
1700 return (_base >= VectorS && _base <= VectorZ) ? (TypeVect*)this : NULL;
1701 }
1702
1703 inline const TypePtr *Type::is_ptr() const {
1704 // AnyPtr is the first Ptr and KlassPtr the last, with no non-ptrs between.
1705 assert(_base >= AnyPtr && _base <= KlassPtr, "Not a pointer");
1706 return (TypePtr*)this;
1707 }
1708
1709 inline const TypePtr *Type::isa_ptr() const {
1710 // AnyPtr is the first Ptr and KlassPtr the last, with no non-ptrs between.
1711 return (_base >= AnyPtr && _base <= KlassPtr) ? (TypePtr*)this : NULL;
1712 }
1713
1714 inline const TypeOopPtr *Type::is_oopptr() const {
1715 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1716 assert(_base >= OopPtr && _base <= AryPtr, "Not a Java pointer" ) ;
1717 return (TypeOopPtr*)this;
1718 }
1719
1720 inline const TypeOopPtr *Type::isa_oopptr() const {
1721 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1722 return (_base >= OopPtr && _base <= AryPtr) ? (TypeOopPtr*)this : NULL;
1723 }
1724
1725 inline const TypeRawPtr *Type::isa_rawptr() const {
1726 return (_base == RawPtr) ? (TypeRawPtr*)this : NULL;
1727 }
1728
1729 inline const TypeRawPtr *Type::is_rawptr() const {
1730 assert( _base == RawPtr, "Not a raw pointer" );
1731 return (TypeRawPtr*)this;
1732 }
1733
1734 inline const TypeInstPtr *Type::isa_instptr() const {
1735 return (_base == InstPtr) ? (TypeInstPtr*)this : NULL;
1736 }
1737
1738 inline const TypeInstPtr *Type::is_instptr() const {
1739 assert( _base == InstPtr, "Not an object pointer" );
1740 return (TypeInstPtr*)this;
1741 }
1742
1743 inline const TypeAryPtr *Type::isa_aryptr() const {
1744 return (_base == AryPtr) ? (TypeAryPtr*)this : NULL;
1745 }
1746
1747 inline const TypeAryPtr *Type::is_aryptr() const {
1748 assert( _base == AryPtr, "Not an array pointer" );
1749 return (TypeAryPtr*)this;
1750 }
1751
1752 inline const TypeValueType* Type::isa_valuetype() const {
1753 return (_base == ValueType) ? (TypeValueType*)this : NULL;
1754 }
1755
1756 inline const TypeValueType* Type::is_valuetype() const {
1757 assert(_base == ValueType, "Not a value type");
1758 return (TypeValueType*)this;
1759 }
1760
1761 inline const TypeNarrowOop *Type::is_narrowoop() const {
1762 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1763 assert(_base == NarrowOop, "Not a narrow oop" ) ;
1764 return (TypeNarrowOop*)this;
1765 }
1766
1767 inline const TypeNarrowOop *Type::isa_narrowoop() const {
1768 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1769 return (_base == NarrowOop) ? (TypeNarrowOop*)this : NULL;
1770 }
1771
1772 inline const TypeNarrowKlass *Type::is_narrowklass() const {
1773 assert(_base == NarrowKlass, "Not a narrow oop" ) ;
1774 return (TypeNarrowKlass*)this;
1775 }
1776
1777 inline const TypeNarrowKlass *Type::isa_narrowklass() const {
1778 return (_base == NarrowKlass) ? (TypeNarrowKlass*)this : NULL;
1779 }
1780
1781 inline const TypeMetadataPtr *Type::is_metadataptr() const {
1782 // MetadataPtr is the first and CPCachePtr the last
1783 assert(_base == MetadataPtr, "Not a metadata pointer" ) ;
1784 return (TypeMetadataPtr*)this;
1785 }
1786
1787 inline const TypeMetadataPtr *Type::isa_metadataptr() const {
1788 return (_base == MetadataPtr) ? (TypeMetadataPtr*)this : NULL;
1789 }
1790
1791 inline const TypeKlassPtr *Type::isa_klassptr() const {
1792 return (_base == KlassPtr) ? (TypeKlassPtr*)this : NULL;
1793 }
1794
1795 inline const TypeKlassPtr *Type::is_klassptr() const {
1796 assert( _base == KlassPtr, "Not a klass pointer" );
1797 return (TypeKlassPtr*)this;
1798 }
1799
1800 inline const TypePtr* Type::make_ptr() const {
1801 return (_base == NarrowOop) ? is_narrowoop()->get_ptrtype() :
1802 ((_base == NarrowKlass) ? is_narrowklass()->get_ptrtype() :
1803 isa_ptr());
1804 }
1805
1806 inline const TypeOopPtr* Type::make_oopptr() const {
1807 return (_base == NarrowOop) ? is_narrowoop()->get_ptrtype()->isa_oopptr() : isa_oopptr();
1808 }
1809
1810 inline const TypeNarrowOop* Type::make_narrowoop() const {
1811 return (_base == NarrowOop) ? is_narrowoop() :
1812 (isa_ptr() ? TypeNarrowOop::make(is_ptr()) : NULL);
1813 }
1814
1815 inline const TypeNarrowKlass* Type::make_narrowklass() const {
1816 return (_base == NarrowKlass) ? is_narrowklass() :
1817 (isa_ptr() ? TypeNarrowKlass::make(is_ptr()) : NULL);
1818 }
1819
1820 inline bool Type::is_floatingpoint() const {
1821 if( (_base == FloatCon) || (_base == FloatBot) ||
1822 (_base == DoubleCon) || (_base == DoubleBot) )
1823 return true;
1824 return false;
1825 }
1826
1827 inline bool Type::is_valuetypeptr() const {
1828 return isa_instptr() != NULL && is_instptr()->klass()->is_valuetype();
1829 }
1830
1831
1832 inline ciValueKlass* Type::value_klass() const {
1833 assert(is_valuetypeptr(), "must be a value type ptr");
1834 return is_instptr()->klass()->as_value_klass();
1835 }
1836
1837
1838 // ===============================================================
1839 // Things that need to be 64-bits in the 64-bit build but
1840 // 32-bits in the 32-bit build. Done this way to get full
1841 // optimization AND strong typing.
1842 #ifdef _LP64
1843
1844 // For type queries and asserts
1845 #define is_intptr_t is_long
1846 #define isa_intptr_t isa_long
1847 #define find_intptr_t_type find_long_type
1848 #define find_intptr_t_con find_long_con
1849 #define TypeX TypeLong
1850 #define Type_X Type::Long
1851 #define TypeX_X TypeLong::LONG
1852 #define TypeX_ZERO TypeLong::ZERO
1853 // For 'ideal_reg' machine registers
1854 #define Op_RegX Op_RegL
1855 // For phase->intcon variants
1856 #define MakeConX longcon
1857 #define ConXNode ConLNode
1858 // For array index arithmetic
1859 #define MulXNode MulLNode
1860 #define AndXNode AndLNode
1861 #define OrXNode OrLNode
1862 #define CmpXNode CmpLNode
1863 #define CmpUXNode CmpULNode
1864 #define SubXNode SubLNode
1865 #define LShiftXNode LShiftLNode
1866 // For object size computation:
1867 #define AddXNode AddLNode
1868 #define RShiftXNode RShiftLNode
1869 // For card marks and hashcodes
1870 #define URShiftXNode URShiftLNode
1871 // UseOptoBiasInlining
1872 #define XorXNode XorLNode
1873 #define StoreXConditionalNode StoreLConditionalNode
1874 #define LoadXNode LoadLNode
1875 #define StoreXNode StoreLNode
1876 // Opcodes
1877 #define Op_LShiftX Op_LShiftL
1878 #define Op_AndX Op_AndL
1879 #define Op_AddX Op_AddL
1880 #define Op_SubX Op_SubL
1881 #define Op_XorX Op_XorL
1882 #define Op_URShiftX Op_URShiftL
1883 // conversions
1884 #define ConvI2X(x) ConvI2L(x)
1885 #define ConvL2X(x) (x)
1886 #define ConvX2I(x) ConvL2I(x)
1887 #define ConvX2L(x) (x)
1888 #define ConvX2UL(x) (x)
1889
1890 #else
1891
1892 // For type queries and asserts
1893 #define is_intptr_t is_int
1894 #define isa_intptr_t isa_int
1895 #define find_intptr_t_type find_int_type
1896 #define find_intptr_t_con find_int_con
1897 #define TypeX TypeInt
1898 #define Type_X Type::Int
1899 #define TypeX_X TypeInt::INT
1900 #define TypeX_ZERO TypeInt::ZERO
1901 // For 'ideal_reg' machine registers
1902 #define Op_RegX Op_RegI
1903 // For phase->intcon variants
1904 #define MakeConX intcon
1905 #define ConXNode ConINode
1906 // For array index arithmetic
1907 #define MulXNode MulINode
1908 #define AndXNode AndINode
1909 #define OrXNode OrINode
1910 #define CmpXNode CmpINode
1911 #define CmpUXNode CmpUNode
1912 #define SubXNode SubINode
1913 #define LShiftXNode LShiftINode
1914 // For object size computation:
1915 #define AddXNode AddINode
1916 #define RShiftXNode RShiftINode
1917 // For card marks and hashcodes
1918 #define URShiftXNode URShiftINode
1919 // UseOptoBiasInlining
1920 #define XorXNode XorINode
1921 #define StoreXConditionalNode StoreIConditionalNode
1922 #define LoadXNode LoadINode
1923 #define StoreXNode StoreINode
1924 // Opcodes
1925 #define Op_LShiftX Op_LShiftI
1926 #define Op_AndX Op_AndI
1927 #define Op_AddX Op_AddI
1928 #define Op_SubX Op_SubI
1929 #define Op_XorX Op_XorI
1930 #define Op_URShiftX Op_URShiftI
1931 // conversions
1932 #define ConvI2X(x) (x)
1933 #define ConvL2X(x) ConvL2I(x)
1934 #define ConvX2I(x) (x)
1935 #define ConvX2L(x) ConvI2L(x)
1936 #define ConvX2UL(x) ConvI2UL(x)
1937
1938 #endif
1939
1940 #endif // SHARE_OPTO_TYPE_HPP