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