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