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