1 /*
2 * Copyright (c) 1997, 2013, 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 "libadt/port.hpp"
29 #include "opto/adlcVMDeps.hpp"
30 #include "runtime/handles.hpp"
31
32 // Portions of code courtesy of Clifford Click
33
34 // Optimization - Graph Style
35
36
37 // This class defines a Type lattice. The lattice is used in the constant
38 // propagation algorithms, and for some type-checking of the iloc code.
39 // Basic types include RSD's (lower bound, upper bound, stride for integers),
40 // float & double precision constants, sets of data-labels and code-labels.
41 // The complete lattice is described below. Subtypes have no relationship to
42 // up or down in the lattice; that is entirely determined by the behavior of
43 // the MEET/JOIN functions.
44
45 class Dict;
46 class Type;
47 class TypeD;
48 class TypeF;
49 class TypeInt;
50 class TypeLong;
51 class TypeNarrowPtr;
52 class TypeNarrowOop;
53 class TypeNarrowKlass;
54 class TypeAry;
55 class TypeTuple;
56 class TypeVect;
57 class TypeVectS;
58 class TypeVectD;
59 class TypeVectX;
60 class TypeVectY;
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
95 AnyPtr, // Any old raw, klass, inst, or array pointer
96 RawPtr, // Raw (non-oop) pointers
97 OopPtr, // Any and all Java heap entities
98 InstPtr, // Instance pointers (non-array objects)
99 AryPtr, // Array pointers
100 // (Ptr order matters: See is_ptr, isa_ptr, is_oopptr, isa_oopptr.)
101
102 MetadataPtr, // Generic metadata
103 KlassPtr, // Klass pointers
104
105 Function, // Function signature
106 Abio, // Abstract I/O
107 Return_Address, // Subroutine return address
108 Memory, // Abstract store
109 FloatTop, // No float value
110 FloatCon, // Floating point constant
111 FloatBot, // Any float value
112 DoubleTop, // No double value
113 DoubleCon, // Double precision constant
114 DoubleBot, // Any double value
115 Bottom, // Bottom of lattice
116 lastype // Bogus ending type (not in lattice)
117 };
118
119 // Signal values for offsets from a base pointer
120 enum OFFSET_SIGNALS {
121 OffsetTop = -2000000000, // undefined offset
122 OffsetBot = -2000000001 // any possible offset
123 };
124
125 // Min and max WIDEN values.
126 enum WIDEN {
127 WidenMin = 0,
128 WidenMax = 3
129 };
130
131 private:
132 typedef struct {
133 const TYPES dual_type;
134 const BasicType basic_type;
135 const char* msg;
136 const bool isa_oop;
137 const int ideal_reg;
138 const relocInfo::relocType reloc;
139 } TypeInfo;
140
141 // Dictionary of types shared among compilations.
142 static Dict* _shared_type_dict;
143 static TypeInfo _type_info[];
144
145 static int uhash( const Type *const t );
146 // Structural equality check. Assumes that cmp() has already compared
147 // the _base types and thus knows it can cast 't' appropriately.
148 virtual bool eq( const Type *t ) const;
149
150 // Top-level hash-table of types
151 static Dict *type_dict() {
152 return Compile::current()->type_dict();
153 }
154
155 // DUAL operation: reflect around lattice centerline. Used instead of
156 // join to ensure my lattice is symmetric up and down. Dual is computed
157 // lazily, on demand, and cached in _dual.
158 const Type *_dual; // Cached dual value
159 // Table for efficient dualing of base types
160 static const TYPES dual_type[lastype];
161
162 #ifdef ASSERT
163 // One type is interface, the other is oop
164 virtual bool interface_vs_oop_helper(const Type *t) const;
165 #endif
166
167 const Type *meet_helper(const Type *t, bool include_speculative) const;
168
169 protected:
170 // Each class of type is also identified by its base.
171 const TYPES _base; // Enum of Types type
172
173 Type( TYPES t ) : _dual(NULL), _base(t) {} // Simple types
174 // ~Type(); // Use fast deallocation
175 const Type *hashcons(); // Hash-cons the type
176 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
177 const Type *join_helper(const Type *t, bool include_speculative) const {
178 return dual()->meet_helper(t->dual(), include_speculative)->dual();
179 }
180
181 public:
182
183 inline void* operator new( size_t x ) throw() {
184 Compile* compile = Compile::current();
185 compile->set_type_last_size(x);
186 void *temp = compile->type_arena()->Amalloc_D(x);
187 compile->set_type_hwm(temp);
188 return temp;
189 }
190 inline void operator delete( void* ptr ) {
191 Compile* compile = Compile::current();
192 compile->type_arena()->Afree(ptr,compile->type_last_size());
193 }
194
195 // Initialize the type system for a particular compilation.
196 static void Initialize(Compile* compile);
197
198 // Initialize the types shared by all compilations.
199 static void Initialize_shared(Compile* compile);
200
201 TYPES base() const {
202 assert(_base > Bad && _base < lastype, "sanity");
203 return _base;
204 }
205
206 // Create a new hash-consd type
207 static const Type *make(enum TYPES);
208 // Test for equivalence of types
209 static int cmp( const Type *const t1, const Type *const t2 );
210 // Test for higher or equal in lattice
211 // Variant that drops the speculative part of the types
212 int higher_equal(const Type *t) const {
213 return !cmp(meet(t),t->remove_speculative());
214 }
215 // Variant that keeps the speculative part of the types
216 int higher_equal_speculative(const Type *t) const {
217 return !cmp(meet_speculative(t),t);
218 }
219
220 // MEET operation; lower in lattice.
221 // Variant that drops the speculative part of the types
222 const Type *meet(const Type *t) const {
223 return meet_helper(t, false);
224 }
225 // Variant that keeps the speculative part of the types
226 const Type *meet_speculative(const Type *t) const {
227 return meet_helper(t, true)->cleanup_speculative();
228 }
229 // WIDEN: 'widens' for Ints and other range types
230 virtual const Type *widen( const Type *old, const Type* limit ) const { return this; }
231 // NARROW: complement for widen, used by pessimistic phases
232 virtual const Type *narrow( const Type *old ) const { return this; }
233
234 // DUAL operation: reflect around lattice centerline. Used instead of
235 // join to ensure my lattice is symmetric up and down.
236 const Type *dual() const { return _dual; }
237
238 // Compute meet dependent on base type
239 virtual const Type *xmeet( const Type *t ) const;
240 virtual const Type *xdual() const; // Compute dual right now.
241
242 // JOIN operation; higher in lattice. Done by finding the dual of the
243 // meet of the dual of the 2 inputs.
244 // Variant that drops the speculative part of the types
245 const Type *join(const Type *t) const {
246 return join_helper(t, false);
247 }
248 // Variant that keeps the speculative part of the types
249 const Type *join_speculative(const Type *t) const {
250 return join_helper(t, true)->cleanup_speculative();
251 }
252
253 // Modified version of JOIN adapted to the needs Node::Value.
254 // Normalizes all empty values to TOP. Does not kill _widen bits.
255 // Currently, it also works around limitations involving interface types.
256 // Variant that drops the speculative part of the types
257 const Type *filter(const Type *kills) const {
258 return filter_helper(kills, false);
259 }
260 // Variant that keeps the speculative part of the types
261 const Type *filter_speculative(const Type *kills) const {
262 return filter_helper(kills, true)->cleanup_speculative();
263 }
264
265 #ifdef ASSERT
266 // One type is interface, the other is oop
267 virtual bool interface_vs_oop(const Type *t) const;
268 #endif
269
270 // Returns true if this pointer points at memory which contains a
271 // compressed oop references.
272 bool is_ptr_to_narrowoop() const;
273 bool is_ptr_to_narrowklass() const;
274
275 bool is_ptr_to_boxing_obj() const;
276
277
278 // Convenience access
279 float getf() const;
280 double getd() const;
281
282 const TypeInt *is_int() const;
283 const TypeInt *isa_int() const; // Returns NULL if not an Int
284 const TypeLong *is_long() const;
285 const TypeLong *isa_long() const; // Returns NULL if not a Long
286 const TypeD *isa_double() const; // Returns NULL if not a Double{Top,Con,Bot}
287 const TypeD *is_double_constant() const; // Asserts it is a DoubleCon
288 const TypeD *isa_double_constant() const; // Returns NULL if not a DoubleCon
289 const TypeF *isa_float() const; // Returns NULL if not a Float{Top,Con,Bot}
290 const TypeF *is_float_constant() const; // Asserts it is a FloatCon
291 const TypeF *isa_float_constant() const; // Returns NULL if not a FloatCon
292 const TypeTuple *is_tuple() const; // Collection of fields, NOT a pointer
293 const TypeAry *is_ary() const; // Array, NOT array pointer
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 #endif
362 void typerr(const Type *t) const; // Mixing types error
363
364 // Create basic type
365 static const Type* get_const_basic_type(BasicType type) {
366 assert((uint)type <= T_CONFLICT && _const_basic_type[type] != NULL, "bad type");
367 return _const_basic_type[type];
368 }
369
370 // Mapping to the array element's basic type.
371 BasicType array_element_basic_type() const;
372
373 // Create standard type for a ciType:
374 static const Type* get_const_type(ciType* type);
375
376 // Create standard zero value:
377 static const Type* get_zero_type(BasicType type) {
378 assert((uint)type <= T_CONFLICT && _zero_type[type] != NULL, "bad type");
379 return _zero_type[type];
380 }
381
382 // Report if this is a zero value (not top).
383 bool is_zero_type() const {
384 BasicType type = basic_type();
385 if (type == T_VOID || type >= T_CONFLICT)
386 return false;
387 else
388 return (this == _zero_type[type]);
389 }
390
391 // Convenience common pre-built types.
392 static const Type *ABIO;
393 static const Type *BOTTOM;
394 static const Type *CONTROL;
395 static const Type *DOUBLE;
396 static const Type *FLOAT;
397 static const Type *HALF;
398 static const Type *MEMORY;
399 static const Type *MULTI;
400 static const Type *RETURN_ADDRESS;
401 static const Type *TOP;
402
403 // Mapping from compiler type to VM BasicType
404 BasicType basic_type() const { return _type_info[_base].basic_type; }
405 int ideal_reg() const { return _type_info[_base].ideal_reg; }
406 const char* msg() const { return _type_info[_base].msg; }
407 bool isa_oop_ptr() const { return _type_info[_base].isa_oop; }
408 relocInfo::relocType reloc() const { return _type_info[_base].reloc; }
409
410 // Mapping from CI type system to compiler type:
411 static const Type* get_typeflow_type(ciType* type);
412
413 static const Type* make_from_constant(ciConstant constant,
414 bool require_constant = false,
415 bool is_autobox_cache = false);
416
417 // Speculative type helper methods. See TypePtr.
418 virtual const TypePtr* speculative() const { return NULL; }
419 virtual ciKlass* speculative_type() const { return NULL; }
420 virtual ciKlass* speculative_type_not_null() const { return NULL; }
421 virtual bool speculative_maybe_null() const { return true; }
422 virtual const Type* remove_speculative() const { return this; }
423 virtual const Type* cleanup_speculative() const { return this; }
424 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const { return exact_kls != NULL; }
425 virtual bool would_improve_ptr(bool maybe_null) const { return !maybe_null; }
426 const Type* maybe_remove_speculative(bool include_speculative) const;
427
428 virtual bool maybe_null() const { return true; }
429
430 private:
431 // support arrays
432 static const BasicType _basic_type[];
433 static const Type* _zero_type[T_CONFLICT+1];
434 static const Type* _const_basic_type[T_CONFLICT+1];
435 };
436
437 //------------------------------TypeF------------------------------------------
438 // Class of Float-Constant Types.
439 class TypeF : public Type {
440 TypeF( float f ) : Type(FloatCon), _f(f) {};
441 public:
442 virtual bool eq( const Type *t ) const;
443 virtual int hash() const; // Type specific hashing
444 virtual bool singleton(void) const; // TRUE if type is a singleton
445 virtual bool empty(void) const; // TRUE if type is vacuous
446 public:
447 const float _f; // Float constant
448
449 static const TypeF *make(float f);
450
451 virtual bool is_finite() const; // Has a finite value
452 virtual bool is_nan() const; // Is not a number (NaN)
453
454 virtual const Type *xmeet( const Type *t ) const;
455 virtual const Type *xdual() const; // Compute dual right now.
456 // Convenience common pre-built types.
457 static const TypeF *ZERO; // positive zero only
458 static const TypeF *ONE;
459 #ifndef PRODUCT
460 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
461 #endif
462 };
463
464 //------------------------------TypeD------------------------------------------
465 // Class of Double-Constant Types.
466 class TypeD : public Type {
467 TypeD( double d ) : Type(DoubleCon), _d(d) {};
468 public:
469 virtual bool eq( const Type *t ) const;
470 virtual int hash() const; // Type specific hashing
471 virtual bool singleton(void) const; // TRUE if type is a singleton
472 virtual bool empty(void) const; // TRUE if type is vacuous
473 public:
474 const double _d; // Double constant
475
476 static const TypeD *make(double d);
477
478 virtual bool is_finite() const; // Has a finite value
479 virtual bool is_nan() const; // Is not a number (NaN)
480
481 virtual const Type *xmeet( const Type *t ) const;
482 virtual const Type *xdual() const; // Compute dual right now.
483 // Convenience common pre-built types.
484 static const TypeD *ZERO; // positive zero only
485 static const TypeD *ONE;
486 #ifndef PRODUCT
487 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
488 #endif
489 };
490
491 //------------------------------TypeInt----------------------------------------
492 // Class of integer ranges, the set of integers between a lower bound and an
493 // upper bound, inclusive.
494 class TypeInt : public Type {
495 TypeInt( jint lo, jint hi, int w );
496 protected:
497 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
498
499 public:
500 typedef jint NativeType;
501 virtual bool eq( const Type *t ) const;
502 virtual int hash() const; // Type specific hashing
503 virtual bool singleton(void) const; // TRUE if type is a singleton
504 virtual bool empty(void) const; // TRUE if type is vacuous
505 const jint _lo, _hi; // Lower bound, upper bound
506 const short _widen; // Limit on times we widen this sucker
507
508 static const TypeInt *make(jint lo);
509 // must always specify w
510 static const TypeInt *make(jint lo, jint hi, int w);
511
512 // Check for single integer
513 int is_con() const { return _lo==_hi; }
514 bool is_con(int i) const { return is_con() && _lo == i; }
515 jint get_con() const { assert( is_con(), "" ); return _lo; }
516
517 virtual bool is_finite() const; // Has a finite value
518
519 virtual const Type *xmeet( const Type *t ) const;
520 virtual const Type *xdual() const; // Compute dual right now.
521 virtual const Type *widen( const Type *t, const Type* limit_type ) const;
522 virtual const Type *narrow( const Type *t ) const;
523 // Do not kill _widen bits.
524 // Convenience common pre-built types.
525 static const TypeInt *MINUS_1;
526 static const TypeInt *ZERO;
527 static const TypeInt *ONE;
528 static const TypeInt *BOOL;
529 static const TypeInt *CC;
530 static const TypeInt *CC_LT; // [-1] == MINUS_1
531 static const TypeInt *CC_GT; // [1] == ONE
532 static const TypeInt *CC_EQ; // [0] == ZERO
533 static const TypeInt *CC_LE; // [-1,0]
534 static const TypeInt *CC_GE; // [0,1] == BOOL (!)
535 static const TypeInt *BYTE;
536 static const TypeInt *UBYTE;
537 static const TypeInt *CHAR;
538 static const TypeInt *SHORT;
539 static const TypeInt *POS;
540 static const TypeInt *POS1;
541 static const TypeInt *INT;
542 static const TypeInt *SYMINT; // symmetric range [-max_jint..max_jint]
543 static const TypeInt *TYPE_DOMAIN; // alias for TypeInt::INT
544
545 static const TypeInt *as_self(const Type *t) { return t->is_int(); }
546 #ifndef PRODUCT
547 virtual void dump2( Dict &d, uint depth, outputStream *st ) const;
548 #endif
549 };
550
551
552 //------------------------------TypeLong---------------------------------------
553 // Class of long integer ranges, the set of integers between a lower bound and
554 // an upper bound, inclusive.
555 class TypeLong : public Type {
556 TypeLong( jlong lo, jlong hi, int w );
557 protected:
558 // Do not kill _widen bits.
559 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const;
560 public:
561 typedef jlong NativeType;
562 virtual bool eq( const Type *t ) const;
563 virtual int hash() const; // Type specific hashing
564 virtual bool singleton(void) const; // TRUE if type is a singleton
565 virtual bool empty(void) const; // TRUE if type is vacuous
566 public:
567 const jlong _lo, _hi; // Lower bound, upper bound
568 const short _widen; // Limit on times we widen this sucker
569
570 static const TypeLong *make(jlong lo);
571 // must always specify w
572 static const TypeLong *make(jlong lo, jlong hi, int w);
573
574 // Check for single integer
575 int is_con() const { return _lo==_hi; }
576 bool is_con(int i) const { return is_con() && _lo == i; }
577 jlong get_con() const { assert( is_con(), "" ); return _lo; }
578
579 // Check for positive 32-bit value.
580 int is_positive_int() const { return _lo >= 0 && _hi <= (jlong)max_jint; }
581
582 virtual bool is_finite() const; // Has a finite value
583
584
585 virtual const Type *xmeet( const Type *t ) const;
586 virtual const Type *xdual() const; // Compute dual right now.
587 virtual const Type *widen( const Type *t, const Type* limit_type ) const;
588 virtual const Type *narrow( const Type *t ) const;
589 // Convenience common pre-built types.
590 static const TypeLong *MINUS_1;
591 static const TypeLong *ZERO;
592 static const TypeLong *ONE;
593 static const TypeLong *POS;
594 static const TypeLong *LONG;
595 static const TypeLong *INT; // 32-bit subrange [min_jint..max_jint]
596 static const TypeLong *UINT; // 32-bit unsigned [0..max_juint]
597 static const TypeLong *TYPE_DOMAIN; // alias for TypeLong::LONG
598
599 // static convenience methods.
600 static const TypeLong *as_self(const Type *t) { return t->is_long(); }
601
602 #ifndef PRODUCT
603 virtual void dump2( Dict &d, uint, outputStream *st ) const;// Specialized per-Type dumping
604 #endif
605 };
606
607 //------------------------------TypeTuple--------------------------------------
608 // Class of Tuple Types, essentially type collections for function signatures
609 // and class layouts. It happens to also be a fast cache for the HotSpot
610 // signature types.
611 class TypeTuple : public Type {
612 TypeTuple( uint cnt, const Type **fields ) : Type(Tuple), _cnt(cnt), _fields(fields) { }
613 public:
614 virtual bool eq( const Type *t ) const;
615 virtual int hash() const; // Type specific hashing
616 virtual bool singleton(void) const; // TRUE if type is a singleton
617 virtual bool empty(void) const; // TRUE if type is vacuous
618
619 public:
620 const uint _cnt; // Count of fields
621 const Type ** const _fields; // Array of field types
622
623 // Accessors:
624 uint cnt() const { return _cnt; }
625 const Type* field_at(uint i) const {
626 assert(i < _cnt, "oob");
627 return _fields[i];
628 }
629 void set_field_at(uint i, const Type* t) {
630 assert(i < _cnt, "oob");
631 _fields[i] = t;
632 }
633
634 static const TypeTuple *make( uint cnt, const Type **fields );
635 static const TypeTuple *make_range(ciSignature *sig);
636 static const TypeTuple *make_domain(ciInstanceKlass* recv, ciSignature *sig);
637
638 // Subroutine call type with space allocated for argument types
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 public:
1452 // Constants are shared among ADLC and VM
1453 enum { Control = AdlcVMDeps::Control,
1454 I_O = AdlcVMDeps::I_O,
1455 Memory = AdlcVMDeps::Memory,
1456 FramePtr = AdlcVMDeps::FramePtr,
1457 ReturnAdr = AdlcVMDeps::ReturnAdr,
1458 Parms = AdlcVMDeps::Parms
1459 };
1460
1461 const TypeTuple* const _domain; // Domain of inputs
1462 const TypeTuple* const _range; // Range of results
1463
1464 // Accessors:
1465 const TypeTuple* domain() const { return _domain; }
1466 const TypeTuple* range() const { return _range; }
1467
1468 static const TypeFunc *make(ciMethod* method);
1469 static const TypeFunc *make(ciSignature signature, const Type* extra);
1470 static const TypeFunc *make(const TypeTuple* domain, const TypeTuple* range);
1471
1472 virtual const Type *xmeet( const Type *t ) const;
1473 virtual const Type *xdual() const; // Compute dual right now.
1474
1475 BasicType return_type() const;
1476
1477 #ifndef PRODUCT
1478 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping
1479 #endif
1480 // Convenience common pre-built types.
1481 };
1482
1483 //------------------------------accessors--------------------------------------
1484 inline bool Type::is_ptr_to_narrowoop() const {
1485 #ifdef _LP64
1486 return (isa_oopptr() != NULL && is_oopptr()->is_ptr_to_narrowoop_nv());
1487 #else
1488 return false;
1489 #endif
1490 }
1491
1492 inline bool Type::is_ptr_to_narrowklass() const {
1493 #ifdef _LP64
1494 return (isa_oopptr() != NULL && is_oopptr()->is_ptr_to_narrowklass_nv());
1495 #else
1496 return false;
1497 #endif
1498 }
1499
1500 inline float Type::getf() const {
1501 assert( _base == FloatCon, "Not a FloatCon" );
1502 return ((TypeF*)this)->_f;
1503 }
1504
1505 inline double Type::getd() const {
1506 assert( _base == DoubleCon, "Not a DoubleCon" );
1507 return ((TypeD*)this)->_d;
1508 }
1509
1510 inline const TypeInt *Type::is_int() const {
1511 assert( _base == Int, "Not an Int" );
1512 return (TypeInt*)this;
1513 }
1514
1515 inline const TypeInt *Type::isa_int() const {
1516 return ( _base == Int ? (TypeInt*)this : NULL);
1517 }
1518
1519 inline const TypeLong *Type::is_long() const {
1520 assert( _base == Long, "Not a Long" );
1521 return (TypeLong*)this;
1522 }
1523
1524 inline const TypeLong *Type::isa_long() const {
1525 return ( _base == Long ? (TypeLong*)this : NULL);
1526 }
1527
1528 inline const TypeF *Type::isa_float() const {
1529 return ((_base == FloatTop ||
1530 _base == FloatCon ||
1531 _base == FloatBot) ? (TypeF*)this : NULL);
1532 }
1533
1534 inline const TypeF *Type::is_float_constant() const {
1535 assert( _base == FloatCon, "Not a Float" );
1536 return (TypeF*)this;
1537 }
1538
1539 inline const TypeF *Type::isa_float_constant() const {
1540 return ( _base == FloatCon ? (TypeF*)this : NULL);
1541 }
1542
1543 inline const TypeD *Type::isa_double() const {
1544 return ((_base == DoubleTop ||
1545 _base == DoubleCon ||
1546 _base == DoubleBot) ? (TypeD*)this : NULL);
1547 }
1548
1549 inline const TypeD *Type::is_double_constant() const {
1550 assert( _base == DoubleCon, "Not a Double" );
1551 return (TypeD*)this;
1552 }
1553
1554 inline const TypeD *Type::isa_double_constant() const {
1555 return ( _base == DoubleCon ? (TypeD*)this : NULL);
1556 }
1557
1558 inline const TypeTuple *Type::is_tuple() const {
1559 assert( _base == Tuple, "Not a Tuple" );
1560 return (TypeTuple*)this;
1561 }
1562
1563 inline const TypeAry *Type::is_ary() const {
1564 assert( _base == Array , "Not an Array" );
1565 return (TypeAry*)this;
1566 }
1567
1568 inline const TypeVect *Type::is_vect() const {
1569 assert( _base >= VectorS && _base <= VectorY, "Not a Vector" );
1570 return (TypeVect*)this;
1571 }
1572
1573 inline const TypeVect *Type::isa_vect() const {
1574 return (_base >= VectorS && _base <= VectorY) ? (TypeVect*)this : NULL;
1575 }
1576
1577 inline const TypePtr *Type::is_ptr() const {
1578 // AnyPtr is the first Ptr and KlassPtr the last, with no non-ptrs between.
1579 assert(_base >= AnyPtr && _base <= KlassPtr, "Not a pointer");
1580 return (TypePtr*)this;
1581 }
1582
1583 inline const TypePtr *Type::isa_ptr() const {
1584 // AnyPtr is the first Ptr and KlassPtr the last, with no non-ptrs between.
1585 return (_base >= AnyPtr && _base <= KlassPtr) ? (TypePtr*)this : NULL;
1586 }
1587
1588 inline const TypeOopPtr *Type::is_oopptr() const {
1589 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1590 assert(_base >= OopPtr && _base <= AryPtr, "Not a Java pointer" ) ;
1591 return (TypeOopPtr*)this;
1592 }
1593
1594 inline const TypeOopPtr *Type::isa_oopptr() const {
1595 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1596 return (_base >= OopPtr && _base <= AryPtr) ? (TypeOopPtr*)this : NULL;
1597 }
1598
1599 inline const TypeRawPtr *Type::isa_rawptr() const {
1600 return (_base == RawPtr) ? (TypeRawPtr*)this : NULL;
1601 }
1602
1603 inline const TypeRawPtr *Type::is_rawptr() const {
1604 assert( _base == RawPtr, "Not a raw pointer" );
1605 return (TypeRawPtr*)this;
1606 }
1607
1608 inline const TypeInstPtr *Type::isa_instptr() const {
1609 return (_base == InstPtr) ? (TypeInstPtr*)this : NULL;
1610 }
1611
1612 inline const TypeInstPtr *Type::is_instptr() const {
1613 assert( _base == InstPtr, "Not an object pointer" );
1614 return (TypeInstPtr*)this;
1615 }
1616
1617 inline const TypeAryPtr *Type::isa_aryptr() const {
1618 return (_base == AryPtr) ? (TypeAryPtr*)this : NULL;
1619 }
1620
1621 inline const TypeAryPtr *Type::is_aryptr() const {
1622 assert( _base == AryPtr, "Not an array pointer" );
1623 return (TypeAryPtr*)this;
1624 }
1625
1626 inline const TypeNarrowOop *Type::is_narrowoop() const {
1627 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1628 assert(_base == NarrowOop, "Not a narrow oop" ) ;
1629 return (TypeNarrowOop*)this;
1630 }
1631
1632 inline const TypeNarrowOop *Type::isa_narrowoop() const {
1633 // OopPtr is the first and KlassPtr the last, with no non-oops between.
1634 return (_base == NarrowOop) ? (TypeNarrowOop*)this : NULL;
1635 }
1636
1637 inline const TypeNarrowKlass *Type::is_narrowklass() const {
1638 assert(_base == NarrowKlass, "Not a narrow oop" ) ;
1639 return (TypeNarrowKlass*)this;
1640 }
1641
1642 inline const TypeNarrowKlass *Type::isa_narrowklass() const {
1643 return (_base == NarrowKlass) ? (TypeNarrowKlass*)this : NULL;
1644 }
1645
1646 inline const TypeMetadataPtr *Type::is_metadataptr() const {
1647 // MetadataPtr is the first and CPCachePtr the last
1648 assert(_base == MetadataPtr, "Not a metadata pointer" ) ;
1649 return (TypeMetadataPtr*)this;
1650 }
1651
1652 inline const TypeMetadataPtr *Type::isa_metadataptr() const {
1653 return (_base == MetadataPtr) ? (TypeMetadataPtr*)this : NULL;
1654 }
1655
1656 inline const TypeKlassPtr *Type::isa_klassptr() const {
1657 return (_base == KlassPtr) ? (TypeKlassPtr*)this : NULL;
1658 }
1659
1660 inline const TypeKlassPtr *Type::is_klassptr() const {
1661 assert( _base == KlassPtr, "Not a klass pointer" );
1662 return (TypeKlassPtr*)this;
1663 }
1664
1665 inline const TypePtr* Type::make_ptr() const {
1666 return (_base == NarrowOop) ? is_narrowoop()->get_ptrtype() :
1667 ((_base == NarrowKlass) ? is_narrowklass()->get_ptrtype() :
1668 (isa_ptr() ? is_ptr() : NULL));
1669 }
1670
1671 inline const TypeOopPtr* Type::make_oopptr() const {
1672 return (_base == NarrowOop) ? is_narrowoop()->get_ptrtype()->is_oopptr() : is_oopptr();
1673 }
1674
1675 inline const TypeNarrowOop* Type::make_narrowoop() const {
1676 return (_base == NarrowOop) ? is_narrowoop() :
1677 (isa_ptr() ? TypeNarrowOop::make(is_ptr()) : NULL);
1678 }
1679
1680 inline const TypeNarrowKlass* Type::make_narrowklass() const {
1681 return (_base == NarrowKlass) ? is_narrowklass() :
1682 (isa_ptr() ? TypeNarrowKlass::make(is_ptr()) : NULL);
1683 }
1684
1685 inline bool Type::is_floatingpoint() const {
1686 if( (_base == FloatCon) || (_base == FloatBot) ||
1687 (_base == DoubleCon) || (_base == DoubleBot) )
1688 return true;
1689 return false;
1690 }
1691
1692 inline bool Type::is_ptr_to_boxing_obj() const {
1693 const TypeInstPtr* tp = isa_instptr();
1694 return (tp != NULL) && (tp->offset() == 0) &&
1695 tp->klass()->is_instance_klass() &&
1696 tp->klass()->as_instance_klass()->is_box_klass();
1697 }
1698
1699
1700 // ===============================================================
1701 // Things that need to be 64-bits in the 64-bit build but
1702 // 32-bits in the 32-bit build. Done this way to get full
1703 // optimization AND strong typing.
1704 #ifdef _LP64
1705
1706 // For type queries and asserts
1707 #define is_intptr_t is_long
1708 #define isa_intptr_t isa_long
1709 #define find_intptr_t_type find_long_type
1710 #define find_intptr_t_con find_long_con
1711 #define TypeX TypeLong
1712 #define Type_X Type::Long
1713 #define TypeX_X TypeLong::LONG
1714 #define TypeX_ZERO TypeLong::ZERO
1715 // For 'ideal_reg' machine registers
1716 #define Op_RegX Op_RegL
1717 // For phase->intcon variants
1718 #define MakeConX longcon
1719 #define ConXNode ConLNode
1720 // For array index arithmetic
1721 #define MulXNode MulLNode
1722 #define AndXNode AndLNode
1723 #define OrXNode OrLNode
1724 #define CmpXNode CmpLNode
1725 #define SubXNode SubLNode
1726 #define LShiftXNode LShiftLNode
1727 // For object size computation:
1728 #define AddXNode AddLNode
1729 #define RShiftXNode RShiftLNode
1730 // For card marks and hashcodes
1731 #define URShiftXNode URShiftLNode
1732 // UseOptoBiasInlining
1733 #define XorXNode XorLNode
1734 #define StoreXConditionalNode StoreLConditionalNode
1735 // Opcodes
1736 #define Op_LShiftX Op_LShiftL
1737 #define Op_AndX Op_AndL
1738 #define Op_AddX Op_AddL
1739 #define Op_SubX Op_SubL
1740 #define Op_XorX Op_XorL
1741 #define Op_URShiftX Op_URShiftL
1742 // conversions
1743 #define ConvI2X(x) ConvI2L(x)
1744 #define ConvL2X(x) (x)
1745 #define ConvX2I(x) ConvL2I(x)
1746 #define ConvX2L(x) (x)
1747 #define ConvX2UL(x) (x)
1748
1749 #else
1750
1751 // For type queries and asserts
1752 #define is_intptr_t is_int
1753 #define isa_intptr_t isa_int
1754 #define find_intptr_t_type find_int_type
1755 #define find_intptr_t_con find_int_con
1756 #define TypeX TypeInt
1757 #define Type_X Type::Int
1758 #define TypeX_X TypeInt::INT
1759 #define TypeX_ZERO TypeInt::ZERO
1760 // For 'ideal_reg' machine registers
1761 #define Op_RegX Op_RegI
1762 // For phase->intcon variants
1763 #define MakeConX intcon
1764 #define ConXNode ConINode
1765 // For array index arithmetic
1766 #define MulXNode MulINode
1767 #define AndXNode AndINode
1768 #define OrXNode OrINode
1769 #define CmpXNode CmpINode
1770 #define SubXNode SubINode
1771 #define LShiftXNode LShiftINode
1772 // For object size computation:
1773 #define AddXNode AddINode
1774 #define RShiftXNode RShiftINode
1775 // For card marks and hashcodes
1776 #define URShiftXNode URShiftINode
1777 // UseOptoBiasInlining
1778 #define XorXNode XorINode
1779 #define StoreXConditionalNode StoreIConditionalNode
1780 // Opcodes
1781 #define Op_LShiftX Op_LShiftI
1782 #define Op_AndX Op_AndI
1783 #define Op_AddX Op_AddI
1784 #define Op_SubX Op_SubI
1785 #define Op_XorX Op_XorI
1786 #define Op_URShiftX Op_URShiftI
1787 // conversions
1788 #define ConvI2X(x) (x)
1789 #define ConvL2X(x) ConvL2I(x)
1790 #define ConvX2I(x) (x)
1791 #define ConvX2L(x) ConvI2L(x)
1792 #define ConvX2UL(x) ConvI2UL(x)
1793
1794 #endif
1795
1796 #endif // SHARE_VM_OPTO_TYPE_HPP