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