1 /* 2 * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_OPTO_TYPE_HPP 26 #define SHARE_OPTO_TYPE_HPP 27 28 #include "opto/adlcVMDeps.hpp" 29 #include "opto/compile.hpp" 30 #include "opto/rangeinference.hpp" 31 #include "runtime/handles.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 TypeH; 51 class TypeInteger; 52 class TypeInt; 53 class TypeLong; 54 class TypeNarrowPtr; 55 class TypeNarrowOop; 56 class TypeNarrowKlass; 57 class TypeAry; 58 class TypeTuple; 59 class TypeVect; 60 class TypeVectA; 61 class TypeVectS; 62 class TypeVectD; 63 class TypeVectX; 64 class TypeVectY; 65 class TypeVectZ; 66 class TypePVectMask; 67 class TypePtr; 68 class TypeRawPtr; 69 class TypeOopPtr; 70 class TypeInstPtr; 71 class TypeAryPtr; 72 class TypeKlassPtr; 73 class TypeInstKlassPtr; 74 class TypeAryKlassPtr; 75 class TypeMetadataPtr; 76 class VerifyMeet; 77 78 template <class T, class U> 79 class TypeIntPrototype; 80 81 //------------------------------Type------------------------------------------- 82 // Basic Type object, represents a set of primitive Values. 83 // Types are hash-cons'd into a private class dictionary, so only one of each 84 // different kind of Type exists. Types are never modified after creation, so 85 // all their interesting fields are constant. 86 class Type { 87 88 public: 89 enum TYPES { 90 Bad=0, // Type check 91 Control, // Control of code (not in lattice) 92 Top, // Top of the lattice 93 Int, // Integer range (lo-hi) 94 Long, // Long integer range (lo-hi) 95 Half, // Placeholder half of doubleword 96 NarrowOop, // Compressed oop pointer 97 NarrowKlass, // Compressed klass pointer 98 99 Tuple, // Method signature or object layout 100 Array, // Array types 101 102 Interfaces, // Set of implemented interfaces for oop types 103 104 VectorMask, // Vector predicate/mask type 105 VectorA, // (Scalable) Vector types for vector length agnostic 106 VectorS, // 32bit Vector types 107 VectorD, // 64bit Vector types 108 VectorX, // 128bit Vector types 109 VectorY, // 256bit Vector types 110 VectorZ, // 512bit Vector types 111 112 AnyPtr, // Any old raw, klass, inst, or array pointer 113 RawPtr, // Raw (non-oop) pointers 114 OopPtr, // Any and all Java heap entities 115 InstPtr, // Instance pointers (non-array objects) 116 AryPtr, // Array pointers 117 // (Ptr order matters: See is_ptr, isa_ptr, is_oopptr, isa_oopptr.) 118 119 MetadataPtr, // Generic metadata 120 KlassPtr, // Klass pointers 121 InstKlassPtr, 122 AryKlassPtr, 123 124 Function, // Function signature 125 Abio, // Abstract I/O 126 Return_Address, // Subroutine return address 127 Memory, // Abstract store 128 HalfFloatTop, // No float value 129 HalfFloatCon, // Floating point constant 130 HalfFloatBot, // Any float value 131 FloatTop, // No float value 132 FloatCon, // Floating point constant 133 FloatBot, // Any float value 134 DoubleTop, // No double value 135 DoubleCon, // Double precision constant 136 DoubleBot, // Any double value 137 Bottom, // Bottom of lattice 138 lastype // Bogus ending type (not in lattice) 139 }; 140 141 // Signal values for offsets from a base pointer 142 enum OFFSET_SIGNALS { 143 OffsetTop = -2000000000, // undefined offset 144 OffsetBot = -2000000001 // any possible offset 145 }; 146 147 // Min and max WIDEN values. 148 enum WIDEN { 149 WidenMin = 0, 150 WidenMax = 3 151 }; 152 153 private: 154 typedef struct { 155 TYPES dual_type; 156 BasicType basic_type; 157 const char* msg; 158 bool isa_oop; 159 uint ideal_reg; 160 } TypeInfo; 161 162 // Dictionary of types shared among compilations. 163 static Dict* _shared_type_dict; 164 static const TypeInfo _type_info[]; 165 166 static int uhash( const Type *const t ); 167 // Structural equality check. Assumes that equals() has already compared 168 // the _base types and thus knows it can cast 't' appropriately. 169 virtual bool eq( const Type *t ) const; 170 171 // Top-level hash-table of types 172 static Dict *type_dict() { 173 return Compile::current()->type_dict(); 174 } 175 176 // DUAL operation: reflect around lattice centerline. Used instead of 177 // join to ensure my lattice is symmetric up and down. Dual is computed 178 // lazily, on demand, and cached in _dual. 179 const Type *_dual; // Cached dual value 180 181 182 const Type *meet_helper(const Type *t, bool include_speculative) const; 183 void check_symmetrical(const Type* t, const Type* mt, const VerifyMeet& verify) const NOT_DEBUG_RETURN; 184 185 protected: 186 // Each class of type is also identified by its base. 187 const TYPES _base; // Enum of Types type 188 189 Type( TYPES t ) : _dual(nullptr), _base(t) {} // Simple types 190 // ~Type(); // Use fast deallocation 191 const Type *hashcons(); // Hash-cons the type 192 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const; 193 const Type *join_helper(const Type *t, bool include_speculative) const { 194 assert_type_verify_empty(); 195 return dual()->meet_helper(t->dual(), include_speculative)->dual(); 196 } 197 198 void assert_type_verify_empty() const NOT_DEBUG_RETURN; 199 200 public: 201 202 inline void* operator new( size_t x ) throw() { 203 Compile* compile = Compile::current(); 204 compile->set_type_last_size(x); 205 return compile->type_arena()->AmallocWords(x); 206 } 207 inline void operator delete( void* ptr ) { 208 Compile* compile = Compile::current(); 209 compile->type_arena()->Afree(ptr,compile->type_last_size()); 210 } 211 212 // Initialize the type system for a particular compilation. 213 static void Initialize(Compile* compile); 214 215 // Initialize the types shared by all compilations. 216 static void Initialize_shared(Compile* compile); 217 218 TYPES base() const { 219 assert(_base > Bad && _base < lastype, "sanity"); 220 return _base; 221 } 222 223 // Create a new hash-consd type 224 static const Type *make(enum TYPES); 225 // Test for equivalence of types 226 static bool equals(const Type* t1, const Type* t2); 227 // Test for higher or equal in lattice 228 // Variant that drops the speculative part of the types 229 bool higher_equal(const Type* t) const { 230 return equals(meet(t), t->remove_speculative()); 231 } 232 // Variant that keeps the speculative part of the types 233 bool higher_equal_speculative(const Type* t) const { 234 return equals(meet_speculative(t), t); 235 } 236 237 // MEET operation; lower in lattice. 238 // Variant that drops the speculative part of the types 239 const Type *meet(const Type *t) const { 240 return meet_helper(t, false); 241 } 242 // Variant that keeps the speculative part of the types 243 const Type *meet_speculative(const Type *t) const { 244 return meet_helper(t, true)->cleanup_speculative(); 245 } 246 // WIDEN: 'widens' for Ints and other range types 247 virtual const Type *widen( const Type *old, const Type* limit ) const { return this; } 248 // NARROW: complement for widen, used by pessimistic phases 249 virtual const Type *narrow( const Type *old ) const { return this; } 250 251 // DUAL operation: reflect around lattice centerline. Used instead of 252 // join to ensure my lattice is symmetric up and down. 253 const Type *dual() const { return _dual; } 254 255 // Compute meet dependent on base type 256 virtual const Type *xmeet( const Type *t ) const; 257 virtual const Type *xdual() const; // Compute dual right now. 258 259 // JOIN operation; higher in lattice. Done by finding the dual of the 260 // meet of the dual of the 2 inputs. 261 // Variant that drops the speculative part of the types 262 const Type *join(const Type *t) const { 263 return join_helper(t, false); 264 } 265 // Variant that keeps the speculative part of the types 266 const Type *join_speculative(const Type *t) const { 267 return join_helper(t, true)->cleanup_speculative(); 268 } 269 270 // Modified version of JOIN adapted to the needs Node::Value. 271 // Normalizes all empty values to TOP. Does not kill _widen bits. 272 // Variant that drops the speculative part of the types 273 const Type *filter(const Type *kills) const { 274 return filter_helper(kills, false); 275 } 276 // Variant that keeps the speculative part of the types 277 const Type *filter_speculative(const Type *kills) const { 278 return filter_helper(kills, true)->cleanup_speculative(); 279 } 280 281 // Returns true if this pointer points at memory which contains a 282 // compressed oop references. 283 bool is_ptr_to_narrowoop() const; 284 bool is_ptr_to_narrowklass() const; 285 286 // Convenience access 287 short geth() const; 288 virtual float getf() const; 289 double getd() const; 290 291 // This has the same semantics as std::dynamic_cast<TypeClass*>(this) 292 template <typename TypeClass> 293 const TypeClass* try_cast() const; 294 295 const TypeInt *is_int() const; 296 const TypeInt *isa_int() const; // Returns null if not an Int 297 const TypeInteger* is_integer(BasicType bt) const; 298 const TypeInteger* isa_integer(BasicType bt) const; 299 const TypeLong *is_long() const; 300 const TypeLong *isa_long() const; // Returns null if not a Long 301 const TypeD *isa_double() const; // Returns null if not a Double{Top,Con,Bot} 302 const TypeD *is_double_constant() const; // Asserts it is a DoubleCon 303 const TypeD *isa_double_constant() const; // Returns null if not a DoubleCon 304 const TypeH *isa_half_float() const; // Returns null if not a HalfFloat{Top,Con,Bot} 305 const TypeH *is_half_float_constant() const; // Asserts it is a HalfFloatCon 306 const TypeH *isa_half_float_constant() const; // Returns null if not a HalfFloatCon 307 const TypeF *isa_float() const; // Returns null if not a Float{Top,Con,Bot} 308 const TypeF *is_float_constant() const; // Asserts it is a FloatCon 309 const TypeF *isa_float_constant() const; // Returns null if not a FloatCon 310 const TypeTuple *is_tuple() const; // Collection of fields, NOT a pointer 311 const TypeAry *is_ary() const; // Array, NOT array pointer 312 const TypeAry *isa_ary() const; // Returns null of not ary 313 const TypeVect *is_vect() const; // Vector 314 const TypeVect *isa_vect() const; // Returns null if not a Vector 315 const TypePVectMask *is_pvectmask() const; // Predicate/Mask Vector 316 const TypePVectMask *isa_pvectmask() const; // Returns null if not a Vector Predicate/Mask 317 const TypePtr *is_ptr() const; // Asserts it is a ptr type 318 const TypePtr *isa_ptr() const; // Returns null if not ptr type 319 const TypeRawPtr *isa_rawptr() const; // NOT Java oop 320 const TypeRawPtr *is_rawptr() const; // Asserts is rawptr 321 const TypeNarrowOop *is_narrowoop() const; // Java-style GC'd pointer 322 const TypeNarrowOop *isa_narrowoop() const; // Returns null if not oop ptr type 323 const TypeNarrowKlass *is_narrowklass() const; // compressed klass pointer 324 const TypeNarrowKlass *isa_narrowklass() const;// Returns null if not oop ptr type 325 const TypeOopPtr *isa_oopptr() const; // Returns null if not oop ptr type 326 const TypeOopPtr *is_oopptr() const; // Java-style GC'd pointer 327 const TypeInstPtr *isa_instptr() const; // Returns null if not InstPtr 328 const TypeInstPtr *is_instptr() const; // Instance 329 const TypeAryPtr *isa_aryptr() const; // Returns null if not AryPtr 330 const TypeAryPtr *is_aryptr() const; // Array oop 331 332 template <typename TypeClass> 333 const TypeClass* cast() const; 334 335 const TypeMetadataPtr *isa_metadataptr() const; // Returns null if not oop ptr type 336 const TypeMetadataPtr *is_metadataptr() const; // Java-style GC'd pointer 337 const TypeKlassPtr *isa_klassptr() const; // Returns null if not KlassPtr 338 const TypeKlassPtr *is_klassptr() const; // assert if not KlassPtr 339 const TypeInstKlassPtr *isa_instklassptr() const; // Returns null if not IntKlassPtr 340 const TypeInstKlassPtr *is_instklassptr() const; // assert if not IntKlassPtr 341 const TypeAryKlassPtr *isa_aryklassptr() const; // Returns null if not AryKlassPtr 342 const TypeAryKlassPtr *is_aryklassptr() const; // assert if not AryKlassPtr 343 344 virtual bool is_finite() const; // Has a finite value 345 virtual bool is_nan() const; // Is not a number (NaN) 346 347 // Returns this ptr type or the equivalent ptr type for this compressed pointer. 348 const TypePtr* make_ptr() const; 349 350 // Returns this oopptr type or the equivalent oopptr type for this compressed pointer. 351 // Asserts if the underlying type is not an oopptr or narrowoop. 352 const TypeOopPtr* make_oopptr() const; 353 354 // Returns this compressed pointer or the equivalent compressed version 355 // of this pointer type. 356 const TypeNarrowOop* make_narrowoop() const; 357 358 // Returns this compressed klass pointer or the equivalent 359 // compressed version of this pointer type. 360 const TypeNarrowKlass* make_narrowklass() const; 361 362 // Special test for register pressure heuristic 363 bool is_floatingpoint() const; // True if Float or Double base type 364 365 // Do you have memory, directly or through a tuple? 366 bool has_memory( ) const; 367 368 // TRUE if type is a singleton 369 virtual bool singleton(void) const; 370 371 // TRUE if type is above the lattice centerline, and is therefore vacuous 372 virtual bool empty(void) const; 373 374 // Return a hash for this type. The hash function is public so ConNode 375 // (constants) can hash on their constant, which is represented by a Type. 376 virtual uint hash() const; 377 378 // Map ideal registers (machine types) to ideal types 379 static const Type *mreg2type[]; 380 381 // Printing, statistics 382 #ifndef PRODUCT 383 void dump_on(outputStream *st) const; 384 void dump() const { 385 dump_on(tty); 386 } 387 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 388 static void dump_stats(); 389 // Groups of types, for debugging and visualization only. 390 enum class Category { 391 Data, 392 Memory, 393 Mixed, // Tuples with types of different categories. 394 Control, 395 Other, // {Type::Top, Type::Abio, Type::Bottom}. 396 Undef // {Type::Bad, Type::lastype}, for completeness. 397 }; 398 // Return the category of this type. 399 Category category() const; 400 // Check recursively in tuples. 401 bool has_category(Category cat) const; 402 403 static const char* str(const Type* t); 404 #endif // !PRODUCT 405 void typerr(const Type *t) const; // Mixing types error 406 407 // Create basic type 408 static const Type* get_const_basic_type(BasicType type) { 409 assert((uint)type <= T_CONFLICT && _const_basic_type[type] != nullptr, "bad type"); 410 return _const_basic_type[type]; 411 } 412 413 // For two instance arrays of same dimension, return the base element types. 414 // Otherwise or if the arrays have different dimensions, return null. 415 static void get_arrays_base_elements(const Type *a1, const Type *a2, 416 const TypeInstPtr **e1, const TypeInstPtr **e2); 417 418 // Mapping to the array element's basic type. 419 BasicType array_element_basic_type() const; 420 421 enum InterfaceHandling { 422 trust_interfaces, 423 ignore_interfaces 424 }; 425 // Create standard type for a ciType: 426 static const Type* get_const_type(ciType* type, InterfaceHandling interface_handling = ignore_interfaces); 427 428 // Create standard zero value: 429 static const Type* get_zero_type(BasicType type) { 430 assert((uint)type <= T_CONFLICT && _zero_type[type] != nullptr, "bad type"); 431 return _zero_type[type]; 432 } 433 434 // Report if this is a zero value (not top). 435 bool is_zero_type() const { 436 BasicType type = basic_type(); 437 if (type == T_VOID || type >= T_CONFLICT) 438 return false; 439 else 440 return (this == _zero_type[type]); 441 } 442 443 // Convenience common pre-built types. 444 static const Type *ABIO; 445 static const Type *BOTTOM; 446 static const Type *CONTROL; 447 static const Type *DOUBLE; 448 static const Type *FLOAT; 449 static const Type *HALF_FLOAT; 450 static const Type *HALF; 451 static const Type *MEMORY; 452 static const Type *MULTI; 453 static const Type *RETURN_ADDRESS; 454 static const Type *TOP; 455 456 // Mapping from compiler type to VM BasicType 457 BasicType basic_type() const { return _type_info[_base].basic_type; } 458 uint ideal_reg() const { return _type_info[_base].ideal_reg; } 459 const char* msg() const { return _type_info[_base].msg; } 460 bool isa_oop_ptr() const { return _type_info[_base].isa_oop; } 461 462 // Mapping from CI type system to compiler type: 463 static const Type* get_typeflow_type(ciType* type); 464 465 static const Type* make_from_constant(ciConstant constant, 466 bool require_constant = false, 467 int stable_dimension = 0, 468 bool is_narrow = false, 469 bool is_autobox_cache = false); 470 471 static const Type* make_constant_from_field(ciInstance* holder, 472 int off, 473 bool is_unsigned_load, 474 BasicType loadbt); 475 476 static const Type* make_constant_from_field(ciField* field, 477 ciInstance* holder, 478 BasicType loadbt, 479 bool is_unsigned_load); 480 481 static const Type* make_constant_from_array_element(ciArray* array, 482 int off, 483 int stable_dimension, 484 BasicType loadbt, 485 bool is_unsigned_load); 486 487 // Speculative type helper methods. See TypePtr. 488 virtual const TypePtr* speculative() const { return nullptr; } 489 virtual ciKlass* speculative_type() const { return nullptr; } 490 virtual ciKlass* speculative_type_not_null() const { return nullptr; } 491 virtual bool speculative_maybe_null() const { return true; } 492 virtual bool speculative_always_null() const { return true; } 493 virtual const Type* remove_speculative() const { return this; } 494 virtual const Type* cleanup_speculative() const { return this; } 495 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const { return exact_kls != nullptr; } 496 virtual bool would_improve_ptr(ProfilePtrKind ptr_kind) const { return ptr_kind == ProfileAlwaysNull || ptr_kind == ProfileNeverNull; } 497 const Type* maybe_remove_speculative(bool include_speculative) const; 498 499 virtual bool maybe_null() const { return true; } 500 virtual bool is_known_instance() const { return false; } 501 502 private: 503 // support arrays 504 static const Type* _zero_type[T_CONFLICT+1]; 505 static const Type* _const_basic_type[T_CONFLICT+1]; 506 }; 507 508 //------------------------------TypeF------------------------------------------ 509 // Class of Float-Constant Types. 510 class TypeF : public Type { 511 TypeF( float f ) : Type(FloatCon), _f(f) {}; 512 public: 513 virtual bool eq( const Type *t ) const; 514 virtual uint hash() const; // Type specific hashing 515 virtual bool singleton(void) const; // TRUE if type is a singleton 516 virtual bool empty(void) const; // TRUE if type is vacuous 517 public: 518 const float _f; // Float constant 519 520 static const TypeF *make(float f); 521 522 virtual bool is_finite() const; // Has a finite value 523 virtual bool is_nan() const; // Is not a number (NaN) 524 525 virtual const Type *xmeet( const Type *t ) const; 526 virtual const Type *xdual() const; // Compute dual right now. 527 // Convenience common pre-built types. 528 static const TypeF *MAX; 529 static const TypeF *MIN; 530 static const TypeF *ZERO; // positive zero only 531 static const TypeF *ONE; 532 static const TypeF *POS_INF; 533 static const TypeF *NEG_INF; 534 #ifndef PRODUCT 535 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 536 #endif 537 }; 538 539 // Class of Half Float-Constant Types. 540 class TypeH : public Type { 541 TypeH(short f) : Type(HalfFloatCon), _f(f) {}; 542 public: 543 virtual bool eq(const Type* t) const; 544 virtual uint hash() const; // Type specific hashing 545 virtual bool singleton(void) const; // TRUE if type is a singleton 546 virtual bool empty(void) const; // TRUE if type is vacuous 547 public: 548 const short _f; // Half Float constant 549 550 static const TypeH* make(float f); 551 static const TypeH* make(short f); 552 553 virtual bool is_finite() const; // Has a finite value 554 virtual bool is_nan() const; // Is not a number (NaN) 555 556 virtual float getf() const; 557 virtual const Type* xmeet(const Type* t) const; 558 virtual const Type* xdual() const; // Compute dual right now. 559 // Convenience common pre-built types. 560 static const TypeH* MAX; 561 static const TypeH* MIN; 562 static const TypeH* ZERO; // positive zero only 563 static const TypeH* ONE; 564 static const TypeH* POS_INF; 565 static const TypeH* NEG_INF; 566 #ifndef PRODUCT 567 virtual void dump2(Dict &d, uint depth, outputStream* st) const; 568 #endif 569 }; 570 571 //------------------------------TypeD------------------------------------------ 572 // Class of Double-Constant Types. 573 class TypeD : public Type { 574 TypeD( double d ) : Type(DoubleCon), _d(d) {}; 575 public: 576 virtual bool eq( const Type *t ) const; 577 virtual uint hash() const; // Type specific hashing 578 virtual bool singleton(void) const; // TRUE if type is a singleton 579 virtual bool empty(void) const; // TRUE if type is vacuous 580 public: 581 const double _d; // Double constant 582 583 static const TypeD *make(double d); 584 585 virtual bool is_finite() const; // Has a finite value 586 virtual bool is_nan() const; // Is not a number (NaN) 587 588 virtual const Type *xmeet( const Type *t ) const; 589 virtual const Type *xdual() const; // Compute dual right now. 590 // Convenience common pre-built types. 591 static const TypeD *MAX; 592 static const TypeD *MIN; 593 static const TypeD *ZERO; // positive zero only 594 static const TypeD *ONE; 595 static const TypeD *POS_INF; 596 static const TypeD *NEG_INF; 597 #ifndef PRODUCT 598 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 599 #endif 600 }; 601 602 class TypeInteger : public Type { 603 protected: 604 TypeInteger(TYPES t, int w, bool dual) : Type(t), _is_dual(dual), _widen(w) {} 605 606 // Denote that a set is a dual set. 607 // Dual sets are only used to compute the join of 2 sets, and not used 608 // outside. 609 const bool _is_dual; 610 611 public: 612 const short _widen; // Limit on times we widen this sucker 613 614 virtual jlong hi_as_long() const = 0; 615 virtual jlong lo_as_long() const = 0; 616 jlong get_con_as_long(BasicType bt) const; 617 bool is_con() const { return lo_as_long() == hi_as_long(); } 618 virtual short widen_limit() const { return _widen; } 619 620 static const TypeInteger* make(jlong lo, jlong hi, int w, BasicType bt); 621 static const TypeInteger* make(jlong con, BasicType bt); 622 623 static const TypeInteger* bottom(BasicType type); 624 static const TypeInteger* zero(BasicType type); 625 static const TypeInteger* one(BasicType type); 626 static const TypeInteger* minus_1(BasicType type); 627 }; 628 629 /** 630 * Definition: 631 * 632 * A TypeInt represents a set of non-empty jint values. A jint v is an element 633 * of a TypeInt iff: 634 * 635 * v >= _lo && v <= _hi && 636 * juint(v) >= _ulo && juint(v) <= _uhi && 637 * _bits.is_satisfied_by(v) 638 * 639 * Multiple sets of parameters can represent the same set. 640 * E.g: consider 2 TypeInt t1, t2 641 * 642 * t1._lo = 2, t1._hi = 7, t1._ulo = 0, t1._uhi = 5, t1._bits._zeros = 0x00000000, t1._bits._ones = 0x1 643 * t2._lo = 3, t2._hi = 5, t2._ulo = 3, t2._uhi = 5, t2._bits._zeros = 0xFFFFFFF8, t2._bits._ones = 0x1 644 * 645 * Then, t1 and t2 both represent the set {3, 5}. We can also see that the 646 * constraints of t2 are the tightest possible. I.e there exists no TypeInt t3 647 * which also represents {3, 5} such that any of these would be true: 648 * 649 * 1) t3._lo > t2._lo 650 * 2) t3._hi < t2._hi 651 * 3) t3._ulo > t2._ulo 652 * 4) t3._uhi < t2._uhi 653 * 5) (t3._bits._zeros &~ t2._bis._zeros) != 0 654 * 6) (t3._bits._ones &~ t2._bits._ones) != 0 655 * 656 * The 5-th condition mean that the subtraction of the bitsets represented by 657 * t3._bits._zeros and t2._bits._zeros is not empty, which means that the 658 * bits in t3._bits._zeros is not a subset of those in t2._bits._zeros, the 659 * same applies to _bits._ones 660 * 661 * To simplify reasoning about the types in optimizations, we canonicalize 662 * every TypeInt to its tightest form, already at construction. E.g a TypeInt 663 * t with t._lo < 0 will definitely contain negative values. It also makes it 664 * trivial to determine if a TypeInt instance is a subset of another. 665 * 666 * Lemmas: 667 * 668 * 1. Since every TypeInt instance is non-empty and canonicalized, all the 669 * bounds must also be elements of such TypeInt. Or else, we can tighten the 670 * bounds by narrowing it by one, which contradicts the assumption of the 671 * TypeInt being canonical. 672 * 673 * 2. 674 * 2.1. _lo <= jint(_ulo) 675 * 2.2. _lo <= _hi 676 * 2.3. _lo <= jint(_uhi) 677 * 2.4. _ulo <= juint(_lo) 678 * 2.5. _ulo <= juint(_hi) 679 * 2.6. _ulo <= _uhi 680 * 2.7. _hi >= _lo 681 * 2.8. _hi >= jint(_ulo) 682 * 2.9. _hi >= jint(_uhi) 683 * 2.10. _uhi >= juint(_lo) 684 * 2.11. _uhi >= _ulo 685 * 2.12. _uhi >= juint(_hi) 686 * 687 * Proof of lemma 2: 688 * 689 * 2.1. _lo <= jint(_ulo): 690 * According the lemma 1, _ulo is an element of the TypeInt, so in the 691 * signed domain, it must not be less than the smallest element of that 692 * TypeInt, which is _lo. Which means that _lo <= _ulo in the signed 693 * domain, or in a more programmatical way, _lo <= jint(_ulo). 694 * 2.2. _lo <= _hi: 695 * According the lemma 1, _hi is an element of the TypeInt, so in the 696 * signed domain, it must not be less than the smallest element of that 697 * TypeInt, which is _lo. Which means that _lo <= _hi. 698 * 699 * The other inequalities can be proved in a similar manner. 700 * 701 * 3. Given 2 jint values x, y where either both >= 0 or both < 0. Then: 702 * 703 * x <= y iff juint(x) <= juint(y) 704 * I.e. x <= y in the signed domain iff x <= y in the unsigned domain 705 * 706 * 4. Either _lo == jint(_ulo) and _hi == jint(_uhi), or each element of a 707 * TypeInt lies in either interval [_lo, jint(_uhi)] or [jint(_ulo), _hi] 708 * (note that these intervals are disjoint in this case). 709 * 710 * Proof of lemma 4: 711 * 712 * For a TypeInt t, there are 3 possible cases: 713 * 714 * a. t._lo >= 0, we have: 715 * 716 * 0 <= t_lo <= jint(t._ulo) (lemma 2.1) 717 * juint(t._lo) <= juint(jint(t._ulo)) (lemma 3) 718 * == t._ulo (juint(jint(v)) == v with juint v) 719 * <= juint(t._lo) (lemma 2.4) 720 * 721 * Which means that t._lo == jint(t._ulo). 722 * 723 * Furthermore, 724 * 725 * 0 <= t._lo <= t._hi (lemma 2.2) 726 * 0 <= t._lo <= jint(t._uhi) (lemma 2.3) 727 * t._hi >= jint(t._uhi) (lemma 2.9) 728 * 729 * juint(t._hi) >= juint(jint(t._uhi)) (lemma 3) 730 * == t._uhi (juint(jint(v)) == v with juint v) 731 * >= juint(t._hi) (lemma 2.12) 732 * 733 * Which means that t._hi == jint(t._uhi). 734 * In this case, t._lo == jint(t._ulo) and t._hi == jint(t._uhi) 735 * 736 * b. t._hi < 0. Similarly, we can conclude that: 737 * t._lo == jint(t._ulo) and t._hi == jint(t._uhi) 738 * 739 * c. t._lo < 0, t._hi >= 0. 740 * 741 * Since t._ulo <= juint(t._hi) (lemma 2.5), we must have jint(t._ulo) >= 0 742 * because all negative values is larger than all non-negative values in the 743 * unsigned domain. 744 * 745 * Since t._uhi >= juint(t._lo) (lemma 2.10), we must have jint(t._uhi) < 0 746 * similar to the reasoning above. 747 * 748 * In this case, each element of t belongs to either [t._lo, jint(t._uhi)] or 749 * [jint(t._ulo), t._hi]. 750 * 751 * Below is an illustration of the TypeInt in this case, the intervals that 752 * the elements can be in are marked using the = symbol. Note how the 753 * negative range in the signed domain wrap around in the unsigned domain. 754 * 755 * Signed: 756 * -----lo=========uhi---------0--------ulo==========hi----- 757 * Unsigned: 758 * 0--------ulo==========hi----------lo=========uhi--------- 759 * 760 * This property is useful for our analysis of TypeInt values. Additionally, 761 * it can be seen that _lo and jint(_uhi) are both < 0 or both >= 0, and the 762 * same applies to jint(_ulo) and _hi. 763 * 764 * We call [_lo, jint(_uhi)] and [jint(_ulo), _hi] "simple intervals". Then, 765 * a TypeInt consists of 2 simple intervals, each of which has its bounds 766 * being both >= 0 or both < 0. If both simple intervals lie in the same half 767 * of the integer domain, they must be the same (i.e _lo == jint(_ulo) and 768 * _hi == jint(_uhi)). Otherwise, [_lo, jint(_uhi)] must lie in the negative 769 * half and [jint(_ulo), _hi] must lie in the non-negative half of the signed 770 * domain (equivalently, [_lo, jint(_uhi)] must lie in the upper half and 771 * [jint(_ulo), _hi] must lie in the lower half of the unsigned domain). 772 */ 773 class TypeInt : public TypeInteger { 774 private: 775 TypeInt(const TypeIntPrototype<jint, juint>& t, int w, bool dual); 776 static const Type* make_or_top(const TypeIntPrototype<jint, juint>& t, int widen, bool dual); 777 778 friend class TypeIntHelper; 779 780 protected: 781 virtual const Type* filter_helper(const Type* kills, bool include_speculative) const; 782 783 public: 784 typedef jint NativeType; 785 typedef juint NativeUType; 786 virtual bool eq(const Type* t) const; 787 virtual uint hash() const; // Type specific hashing 788 virtual bool singleton(void) const; // TRUE if type is a singleton 789 virtual bool empty(void) const; // TRUE if type is vacuous 790 // A value is in the set represented by this TypeInt if it satisfies all 791 // the below constraints, see contains(jint) 792 const jint _lo, _hi; // Lower bound, upper bound in the signed domain 793 const juint _ulo, _uhi; // Lower bound, upper bound in the unsigned domain 794 const KnownBits<juint> _bits; 795 796 static const TypeInt* make(jint con); 797 // must always specify w 798 static const TypeInt* make(jint lo, jint hi, int widen); 799 static const TypeInt* make_unsigned(juint ulo, juint uhi, int widen); 800 static const Type* make_or_top(const TypeIntPrototype<jint, juint>& t, int widen); 801 static const TypeInt* make(const TypeIntPrototype<jint, juint>& t, int widen) { return make_or_top(t, widen)->is_int(); } 802 static const TypeInt* make(const TypeIntMirror<jint, juint>& t, int widen) { 803 return (new TypeInt(TypeIntPrototype<jint, juint>{{t._lo, t._hi}, {t._ulo, t._uhi}, t._bits}, widen, false))->hashcons()->is_int(); 804 } 805 806 // Check for single integer 807 bool is_con() const { return _lo == _hi; } 808 bool is_con(jint i) const { return is_con() && _lo == i; } 809 jint get_con() const { assert(is_con(), ""); return _lo; } 810 // Check if a jint/TypeInt is a subset of this TypeInt (i.e. all elements of the 811 // argument are also elements of this type) 812 bool contains(jint i) const; 813 bool contains(const TypeInt* t) const; 814 815 #ifdef ASSERT 816 // Check whether t is a proper subset (i.e. a subset that is not equal to the superset) of this 817 bool strictly_contains(const TypeInt* t) const; 818 #endif // ASSERT 819 820 virtual bool is_finite() const; // Has a finite value 821 822 virtual const Type* xmeet(const Type* t) const; 823 virtual const Type* xdual() const; // Compute dual right now. 824 virtual const Type* widen(const Type* t, const Type* limit_type) const; 825 virtual const Type* narrow(const Type* t) const; 826 827 virtual jlong hi_as_long() const { return _hi; } 828 virtual jlong lo_as_long() const { return _lo; } 829 830 // Do not kill _widen bits. 831 // Convenience common pre-built types. 832 static const TypeInt* MAX; 833 static const TypeInt* MIN; 834 static const TypeInt* MINUS_1; 835 static const TypeInt* ZERO; 836 static const TypeInt* ONE; 837 static const TypeInt* BOOL; 838 static const TypeInt* CC; 839 static const TypeInt* CC_LT; // [-1] == MINUS_1 840 static const TypeInt* CC_GT; // [1] == ONE 841 static const TypeInt* CC_EQ; // [0] == ZERO 842 static const TypeInt* CC_NE; // [-1, 1] 843 static const TypeInt* CC_LE; // [-1,0] 844 static const TypeInt* CC_GE; // [0,1] == BOOL (!) 845 static const TypeInt* BYTE; 846 static const TypeInt* UBYTE; 847 static const TypeInt* CHAR; 848 static const TypeInt* SHORT; 849 static const TypeInt* NON_ZERO; 850 static const TypeInt* POS; 851 static const TypeInt* POS1; 852 static const TypeInt* INT; 853 static const TypeInt* SYMINT; // symmetric range [-max_jint..max_jint] 854 static const TypeInt* TYPE_DOMAIN; // alias for TypeInt::INT 855 856 static const TypeInt* as_self(const Type* t) { return t->is_int(); } 857 #ifndef PRODUCT 858 virtual void dump2(Dict& d, uint depth, outputStream* st) const; 859 void dump_verbose() const; 860 #endif 861 }; 862 863 // Similar to TypeInt 864 class TypeLong : public TypeInteger { 865 private: 866 TypeLong(const TypeIntPrototype<jlong, julong>& t, int w, bool dual); 867 static const Type* make_or_top(const TypeIntPrototype<jlong, julong>& t, int widen, bool dual); 868 869 friend class TypeIntHelper; 870 871 protected: 872 // Do not kill _widen bits. 873 virtual const Type* filter_helper(const Type* kills, bool include_speculative) const; 874 public: 875 typedef jlong NativeType; 876 typedef julong NativeUType; 877 virtual bool eq( const Type *t ) const; 878 virtual uint hash() const; // Type specific hashing 879 virtual bool singleton(void) const; // TRUE if type is a singleton 880 virtual bool empty(void) const; // TRUE if type is vacuous 881 public: 882 // A value is in the set represented by this TypeLong if it satisfies all 883 // the below constraints, see contains(jlong) 884 const jlong _lo, _hi; // Lower bound, upper bound in the signed domain 885 const julong _ulo, _uhi; // Lower bound, upper bound in the unsigned domain 886 const KnownBits<julong> _bits; 887 888 static const TypeLong* make(jlong con); 889 // must always specify w 890 static const TypeLong* make(jlong lo, jlong hi, int widen); 891 static const TypeLong* make_unsigned(julong ulo, julong uhi, int widen); 892 static const Type* make_or_top(const TypeIntPrototype<jlong, julong>& t, int widen); 893 static const TypeLong* make(const TypeIntPrototype<jlong, julong>& t, int widen) { return make_or_top(t, widen)->is_long(); } 894 static const TypeLong* make(const TypeIntMirror<jlong, julong>& t, int widen) { 895 return (new TypeLong(TypeIntPrototype<jlong, julong>{{t._lo, t._hi}, {t._ulo, t._uhi}, t._bits}, widen, false))->hashcons()->is_long(); 896 } 897 898 // Check for single integer 899 bool is_con() const { return _lo == _hi; } 900 bool is_con(jlong i) const { return is_con() && _lo == i; } 901 jlong get_con() const { assert(is_con(), "" ); return _lo; } 902 // Check if a jlong/TypeLong is a subset of this TypeLong (i.e. all elements of the 903 // argument are also elements of this type) 904 bool contains(jlong i) const; 905 bool contains(const TypeLong* t) const; 906 907 #ifdef ASSERT 908 // Check whether t is a proper subset (i.e. a subset that is not equal to the superset) of this 909 bool strictly_contains(const TypeLong* t) const; 910 #endif // ASSERT 911 912 // Check for positive 32-bit value. 913 bool is_positive_int() const { return _lo >= 0 && _hi <= (jlong)max_jint; } 914 915 virtual bool is_finite() const; // Has a finite value 916 917 virtual jlong hi_as_long() const { return _hi; } 918 virtual jlong lo_as_long() const { return _lo; } 919 920 virtual const Type* xmeet(const Type* t) const; 921 virtual const Type* xdual() const; // Compute dual right now. 922 virtual const Type* widen(const Type* t, const Type* limit_type) const; 923 virtual const Type* narrow(const Type* t) const; 924 // Convenience common pre-built types. 925 static const TypeLong* MAX; 926 static const TypeLong* MIN; 927 static const TypeLong* MINUS_1; 928 static const TypeLong* ZERO; 929 static const TypeLong* ONE; 930 static const TypeLong* NON_ZERO; 931 static const TypeLong* POS; 932 static const TypeLong* NEG; 933 static const TypeLong* LONG; 934 static const TypeLong* INT; // 32-bit subrange [min_jint..max_jint] 935 static const TypeLong* UINT; // 32-bit unsigned [0..max_juint] 936 static const TypeLong* TYPE_DOMAIN; // alias for TypeLong::LONG 937 938 // static convenience methods. 939 static const TypeLong* as_self(const Type* t) { return t->is_long(); } 940 941 #ifndef PRODUCT 942 virtual void dump2(Dict& d, uint, outputStream* st) const;// Specialized per-Type dumping 943 void dump_verbose() const; 944 #endif 945 }; 946 947 //------------------------------TypeTuple-------------------------------------- 948 // Class of Tuple Types, essentially type collections for function signatures 949 // and class layouts. It happens to also be a fast cache for the HotSpot 950 // signature types. 951 class TypeTuple : public Type { 952 TypeTuple( uint cnt, const Type **fields ) : Type(Tuple), _cnt(cnt), _fields(fields) { } 953 954 const uint _cnt; // Count of fields 955 const Type ** const _fields; // Array of field types 956 957 public: 958 virtual bool eq( const Type *t ) const; 959 virtual uint hash() const; // Type specific hashing 960 virtual bool singleton(void) const; // TRUE if type is a singleton 961 virtual bool empty(void) const; // TRUE if type is vacuous 962 963 // Accessors: 964 uint cnt() const { return _cnt; } 965 const Type* field_at(uint i) const { 966 assert(i < _cnt, "oob"); 967 return _fields[i]; 968 } 969 void set_field_at(uint i, const Type* t) { 970 assert(i < _cnt, "oob"); 971 _fields[i] = t; 972 } 973 974 static const TypeTuple *make( uint cnt, const Type **fields ); 975 static const TypeTuple *make_range(ciSignature *sig, InterfaceHandling interface_handling = ignore_interfaces); 976 static const TypeTuple *make_domain(ciInstanceKlass* recv, ciSignature *sig, InterfaceHandling interface_handling); 977 978 // Subroutine call type with space allocated for argument types 979 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly 980 static const Type **fields( uint arg_cnt ); 981 982 virtual const Type *xmeet( const Type *t ) const; 983 virtual const Type *xdual() const; // Compute dual right now. 984 // Convenience common pre-built types. 985 static const TypeTuple *IFBOTH; 986 static const TypeTuple *IFFALSE; 987 static const TypeTuple *IFTRUE; 988 static const TypeTuple *IFNEITHER; 989 static const TypeTuple *LOOPBODY; 990 static const TypeTuple *MEMBAR; 991 static const TypeTuple *STORECONDITIONAL; 992 static const TypeTuple *START_I2C; 993 static const TypeTuple *INT_PAIR; 994 static const TypeTuple *LONG_PAIR; 995 static const TypeTuple *INT_CC_PAIR; 996 static const TypeTuple *LONG_CC_PAIR; 997 #ifndef PRODUCT 998 virtual void dump2( Dict &d, uint, outputStream *st ) const; // Specialized per-Type dumping 999 #endif 1000 }; 1001 1002 //------------------------------TypeAry---------------------------------------- 1003 // Class of Array Types 1004 class TypeAry : public Type { 1005 TypeAry(const Type* elem, const TypeInt* size, bool stable) : Type(Array), 1006 _elem(elem), _size(size), _stable(stable) {} 1007 public: 1008 virtual bool eq( const Type *t ) const; 1009 virtual uint hash() const; // Type specific hashing 1010 virtual bool singleton(void) const; // TRUE if type is a singleton 1011 virtual bool empty(void) const; // TRUE if type is vacuous 1012 1013 private: 1014 const Type *_elem; // Element type of array 1015 const TypeInt *_size; // Elements in array 1016 const bool _stable; // Are elements @Stable? 1017 friend class TypeAryPtr; 1018 1019 public: 1020 static const TypeAry* make(const Type* elem, const TypeInt* size, bool stable = false); 1021 1022 virtual const Type *xmeet( const Type *t ) const; 1023 virtual const Type *xdual() const; // Compute dual right now. 1024 bool ary_must_be_exact() const; // true if arrays of such are never generic 1025 virtual const TypeAry* remove_speculative() const; 1026 virtual const Type* cleanup_speculative() const; 1027 #ifndef PRODUCT 1028 virtual void dump2( Dict &d, uint, outputStream *st ) const; // Specialized per-Type dumping 1029 #endif 1030 }; 1031 1032 //------------------------------TypeVect--------------------------------------- 1033 // Basic class of vector (mask) types. 1034 class TypeVect : public Type { 1035 const BasicType _elem_bt; // Vector's element type 1036 const uint _length; // Elements in vector (power of 2) 1037 1038 protected: 1039 TypeVect(TYPES t, BasicType elem_bt, uint length) : Type(t), 1040 _elem_bt(elem_bt), _length(length) {} 1041 1042 public: 1043 BasicType element_basic_type() const { return _elem_bt; } 1044 uint length() const { return _length; } 1045 uint length_in_bytes() const { 1046 return _length * type2aelembytes(element_basic_type()); 1047 } 1048 1049 virtual bool eq(const Type* t) const; 1050 virtual uint hash() const; // Type specific hashing 1051 virtual bool singleton(void) const; // TRUE if type is a singleton 1052 virtual bool empty(void) const; // TRUE if type is vacuous 1053 1054 static const TypeVect* make(const BasicType elem_bt, uint length, bool is_mask = false); 1055 static const TypeVect* makemask(const BasicType elem_bt, uint length); 1056 1057 virtual const Type* xmeet( const Type *t) const; 1058 virtual const Type* xdual() const; // Compute dual right now. 1059 1060 static const TypeVect* VECTA; 1061 static const TypeVect* VECTS; 1062 static const TypeVect* VECTD; 1063 static const TypeVect* VECTX; 1064 static const TypeVect* VECTY; 1065 static const TypeVect* VECTZ; 1066 static const TypeVect* VECTMASK; 1067 1068 #ifndef PRODUCT 1069 virtual void dump2(Dict& d, uint, outputStream* st) const; // Specialized per-Type dumping 1070 #endif 1071 }; 1072 1073 // TypeVect subclasses representing vectors or vector masks with "BVectMask" or "NVectMask" 1074 // layout (see vectornode.hpp for detailed notes on vector mask representations), mapped 1075 // to vector registers and distinguished by vector register size: 1076 // 1077 // - TypeVectA: Scalable vector type (variable size, e.g., AArch64 SVE, RISC-V RVV) 1078 // - TypeVectS: 32-bit vector type 1079 // - TypeVectD: 64-bit vector type 1080 // - TypeVectX: 128-bit vector type 1081 // - TypeVectY: 256-bit vector type 1082 // - TypeVectZ: 512-bit vector type 1083 class TypeVectA : public TypeVect { 1084 friend class TypeVect; 1085 TypeVectA(BasicType elem_bt, uint length) : TypeVect(VectorA, elem_bt, length) {} 1086 }; 1087 1088 class TypeVectS : public TypeVect { 1089 friend class TypeVect; 1090 TypeVectS(BasicType elem_bt, uint length) : TypeVect(VectorS, elem_bt, length) {} 1091 }; 1092 1093 class TypeVectD : public TypeVect { 1094 friend class TypeVect; 1095 TypeVectD(BasicType elem_bt, uint length) : TypeVect(VectorD, elem_bt, length) {} 1096 }; 1097 1098 class TypeVectX : public TypeVect { 1099 friend class TypeVect; 1100 TypeVectX(BasicType elem_bt, uint length) : TypeVect(VectorX, elem_bt, length) {} 1101 }; 1102 1103 class TypeVectY : public TypeVect { 1104 friend class TypeVect; 1105 TypeVectY(BasicType elem_bt, uint length) : TypeVect(VectorY, elem_bt, length) {} 1106 }; 1107 1108 class TypeVectZ : public TypeVect { 1109 friend class TypeVect; 1110 TypeVectZ(BasicType elem_bt, uint length) : TypeVect(VectorZ, elem_bt, length) {} 1111 }; 1112 1113 // Class of TypePVectMask, representing vector masks with "PVectMask" layout (see 1114 // vectornode.hpp for detailed notes on vector mask representations), mapped to 1115 // dedicated hardware predicate/mask registers. 1116 class TypePVectMask : public TypeVect { 1117 public: 1118 friend class TypeVect; 1119 TypePVectMask(BasicType elem_bt, uint length) : TypeVect(VectorMask, elem_bt, length) {} 1120 static const TypePVectMask* make(const BasicType elem_bt, uint length); 1121 }; 1122 1123 // Set of implemented interfaces. Referenced from TypeOopPtr and TypeKlassPtr. 1124 class TypeInterfaces : public Type { 1125 private: 1126 GrowableArrayFromArray<ciInstanceKlass*> _interfaces; 1127 uint _hash; 1128 ciInstanceKlass* _exact_klass; 1129 DEBUG_ONLY(bool _initialized;) 1130 1131 void initialize(); 1132 1133 void verify() const NOT_DEBUG_RETURN; 1134 void compute_hash(); 1135 void compute_exact_klass(); 1136 1137 TypeInterfaces(ciInstanceKlass** interfaces_base, int nb_interfaces); 1138 1139 NONCOPYABLE(TypeInterfaces); 1140 public: 1141 static const TypeInterfaces* make(GrowableArray<ciInstanceKlass*>* interfaces = nullptr); 1142 bool eq(const Type* other) const; 1143 bool eq(ciInstanceKlass* k) const; 1144 bool is_subset(ciInstanceKlass* k) const; 1145 uint hash() const; 1146 const Type *xdual() const; 1147 void dump(outputStream* st) const; 1148 const TypeInterfaces* union_with(const TypeInterfaces* other) const; 1149 const TypeInterfaces* intersection_with(const TypeInterfaces* other) const; 1150 bool contains(const TypeInterfaces* other) const { 1151 return intersection_with(other)->eq(other); 1152 } 1153 bool empty() const { return _interfaces.length() == 0; } 1154 1155 ciInstanceKlass* exact_klass() const; 1156 void verify_is_loaded() const NOT_DEBUG_RETURN; 1157 1158 static int compare(ciInstanceKlass* const& k1, ciInstanceKlass* const& k2); 1159 static int compare(ciInstanceKlass** k1, ciInstanceKlass** k2); 1160 1161 const Type* xmeet(const Type* t) const; 1162 1163 bool singleton(void) const; 1164 bool has_non_array_interface() const; 1165 }; 1166 1167 //------------------------------TypePtr---------------------------------------- 1168 // Class of machine Pointer Types: raw data, instances or arrays. 1169 // If the _base enum is AnyPtr, then this refers to all of the above. 1170 // Otherwise the _base will indicate which subset of pointers is affected, 1171 // and the class will be inherited from. 1172 class TypePtr : public Type { 1173 friend class TypeNarrowPtr; 1174 friend class Type; 1175 protected: 1176 static const TypeInterfaces* interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling); 1177 1178 public: 1179 enum PTR { TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, lastPTR }; 1180 protected: 1181 TypePtr(TYPES t, PTR ptr, int offset, 1182 relocInfo::relocType reloc, 1183 const TypePtr* speculative = nullptr, 1184 int inline_depth = InlineDepthBottom) : 1185 Type(t), _speculative(speculative), _inline_depth(inline_depth), _offset(offset), 1186 _ptr(ptr), _reloc(reloc) {} 1187 static const PTR ptr_meet[lastPTR][lastPTR]; 1188 static const PTR ptr_dual[lastPTR]; 1189 static const char * const ptr_msg[lastPTR]; 1190 1191 enum { 1192 InlineDepthBottom = INT_MAX, 1193 InlineDepthTop = -InlineDepthBottom 1194 }; 1195 1196 // Extra type information profiling gave us. We propagate it the 1197 // same way the rest of the type info is propagated. If we want to 1198 // use it, then we have to emit a guard: this part of the type is 1199 // not something we know but something we speculate about the type. 1200 const TypePtr* _speculative; 1201 // For speculative types, we record at what inlining depth the 1202 // profiling point that provided the data is. We want to favor 1203 // profile data coming from outer scopes which are likely better for 1204 // the current compilation. 1205 int _inline_depth; 1206 1207 // utility methods to work on the speculative part of the type 1208 const TypePtr* dual_speculative() const; 1209 const TypePtr* xmeet_speculative(const TypePtr* other) const; 1210 bool eq_speculative(const TypePtr* other) const; 1211 int hash_speculative() const; 1212 const TypePtr* add_offset_speculative(intptr_t offset) const; 1213 const TypePtr* with_offset_speculative(intptr_t offset) const; 1214 1215 // utility methods to work on the inline depth of the type 1216 int dual_inline_depth() const; 1217 int meet_inline_depth(int depth) const; 1218 1219 #ifndef PRODUCT 1220 void dump_speculative(outputStream* st) const; 1221 void dump_inline_depth(outputStream* st) const; 1222 void dump_offset(outputStream* st) const; 1223 #endif 1224 1225 // TypeInstPtr (TypeAryPtr resp.) and TypeInstKlassPtr (TypeAryKlassPtr resp.) implement very similar meet logic. 1226 // The logic for meeting 2 instances (2 arrays resp.) is shared in the 2 utility methods below. However the logic for 1227 // the oop and klass versions can be slightly different and extra logic may have to be executed depending on what 1228 // exact case the meet falls into. The MeetResult struct is used by the utility methods to communicate what case was 1229 // encountered so the right logic specific to klasses or oops can be executed., 1230 enum MeetResult { 1231 QUICK, 1232 UNLOADED, 1233 SUBTYPE, 1234 NOT_SUBTYPE, 1235 LCA 1236 }; 1237 template<class T> static TypePtr::MeetResult meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, 1238 const T* other_type, ciKlass*& res_klass, bool& res_xk); 1239 1240 template<class T> static MeetResult meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary, const T* other_ary, 1241 ciKlass*& res_klass, bool& res_xk); 1242 1243 template <class T1, class T2> static bool is_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact); 1244 template <class T1, class T2> static bool is_same_java_type_as_helper_for_instance(const T1* this_one, const T2* other); 1245 template <class T1, class T2> static bool maybe_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact); 1246 template <class T1, class T2> static bool is_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact); 1247 template <class T1, class T2> static bool is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other); 1248 template <class T1, class T2> static bool maybe_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact); 1249 template <class T1, class T2> static bool is_meet_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_xk, bool other_xk); 1250 template <class T1, class T2> static bool is_meet_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_xk, bool other_xk); 1251 public: 1252 const int _offset; // Offset into oop, with TOP & BOT 1253 const PTR _ptr; // Pointer equivalence class 1254 const relocInfo::relocType _reloc; 1255 1256 int offset() const { return _offset; } 1257 PTR ptr() const { return _ptr; } 1258 relocInfo::relocType reloc() const { return _reloc; } 1259 1260 static const TypePtr *make(TYPES t, PTR ptr, int offset, 1261 const TypePtr* speculative = nullptr, 1262 int inline_depth = InlineDepthBottom, 1263 relocInfo::relocType reloc = relocInfo::none); 1264 1265 // Return a 'ptr' version of this type 1266 virtual const TypePtr* cast_to_ptr_type(PTR ptr) const; 1267 1268 virtual intptr_t get_con() const; 1269 1270 int xadd_offset( intptr_t offset ) const; 1271 virtual const TypePtr* add_offset(intptr_t offset) const; 1272 virtual const TypePtr* with_offset(intptr_t offset) const; 1273 virtual bool eq(const Type *t) const; 1274 virtual uint hash() const; // Type specific hashing 1275 1276 virtual bool singleton(void) const; // TRUE if type is a singleton 1277 virtual bool empty(void) const; // TRUE if type is vacuous 1278 virtual const Type *xmeet( const Type *t ) const; 1279 virtual const Type *xmeet_helper( const Type *t ) const; 1280 int meet_offset( int offset ) const; 1281 int dual_offset( ) const; 1282 virtual const Type *xdual() const; // Compute dual right now. 1283 1284 // meet, dual and join over pointer equivalence sets 1285 PTR meet_ptr( const PTR in_ptr ) const { return ptr_meet[in_ptr][ptr()]; } 1286 PTR dual_ptr() const { return ptr_dual[ptr()]; } 1287 1288 // This is textually confusing unless one recalls that 1289 // join(t) == dual()->meet(t->dual())->dual(). 1290 PTR join_ptr( const PTR in_ptr ) const { 1291 return ptr_dual[ ptr_meet[ ptr_dual[in_ptr] ] [ dual_ptr() ] ]; 1292 } 1293 1294 // Speculative type helper methods. 1295 virtual const TypePtr* speculative() const { return _speculative; } 1296 int inline_depth() const { return _inline_depth; } 1297 virtual ciKlass* speculative_type() const; 1298 virtual ciKlass* speculative_type_not_null() const; 1299 virtual bool speculative_maybe_null() const; 1300 virtual bool speculative_always_null() const; 1301 virtual const TypePtr* remove_speculative() const; 1302 virtual const Type* cleanup_speculative() const; 1303 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const; 1304 virtual bool would_improve_ptr(ProfilePtrKind maybe_null) const; 1305 virtual const TypePtr* with_inline_depth(int depth) const; 1306 1307 virtual bool maybe_null() const { return meet_ptr(Null) == ptr(); } 1308 1309 // Tests for relation to centerline of type lattice: 1310 static bool above_centerline(PTR ptr) { return (ptr <= AnyNull); } 1311 static bool below_centerline(PTR ptr) { return (ptr >= NotNull); } 1312 // Convenience common pre-built types. 1313 static const TypePtr *NULL_PTR; 1314 static const TypePtr *NOTNULL; 1315 static const TypePtr *BOTTOM; 1316 #ifndef PRODUCT 1317 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 1318 #endif 1319 }; 1320 1321 //------------------------------TypeRawPtr------------------------------------- 1322 // Class of raw pointers, pointers to things other than Oops. Examples 1323 // include the stack pointer, top of heap, card-marking area, handles, etc. 1324 class TypeRawPtr : public TypePtr { 1325 protected: 1326 TypeRawPtr(PTR ptr, address bits, relocInfo::relocType reloc) : TypePtr(RawPtr, ptr, 0, reloc), _bits(bits){} 1327 public: 1328 virtual bool eq( const Type *t ) const; 1329 virtual uint hash() const; // Type specific hashing 1330 1331 const address _bits; // Constant value, if applicable 1332 1333 static const TypeRawPtr* make(PTR ptr); 1334 static const TypeRawPtr* make(address bits, relocInfo::relocType reloc = relocInfo::external_word_type); 1335 1336 // Return a 'ptr' version of this type 1337 virtual const TypeRawPtr* cast_to_ptr_type(PTR ptr) const; 1338 1339 virtual intptr_t get_con() const; 1340 1341 virtual const TypePtr* add_offset(intptr_t offset) const; 1342 virtual const TypeRawPtr* with_offset(intptr_t offset) const { ShouldNotReachHere(); return nullptr;} 1343 1344 virtual const Type *xmeet( const Type *t ) const; 1345 virtual const Type *xdual() const; // Compute dual right now. 1346 // Convenience common pre-built types. 1347 static const TypeRawPtr *BOTTOM; 1348 static const TypeRawPtr *NOTNULL; 1349 #ifndef PRODUCT 1350 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 1351 #endif 1352 }; 1353 1354 //------------------------------TypeOopPtr------------------------------------- 1355 // Some kind of oop (Java pointer), either instance or array. 1356 class TypeOopPtr : public TypePtr { 1357 friend class TypeAry; 1358 friend class TypePtr; 1359 friend class TypeInstPtr; 1360 friend class TypeAryPtr; 1361 protected: 1362 TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int offset, int instance_id, 1363 const TypePtr* speculative, int inline_depth); 1364 public: 1365 virtual bool eq( const Type *t ) const; 1366 virtual uint hash() const; // Type specific hashing 1367 virtual bool singleton(void) const; // TRUE if type is a singleton 1368 enum { 1369 InstanceTop = -1, // undefined instance 1370 InstanceBot = 0 // any possible instance 1371 }; 1372 protected: 1373 1374 // Oop is null, unless this is a constant oop. 1375 ciObject* _const_oop; // Constant oop 1376 // If _klass is null, then so is _sig. This is an unloaded klass. 1377 ciKlass* _klass; // Klass object 1378 1379 const TypeInterfaces* _interfaces; 1380 1381 // Does the type exclude subclasses of the klass? (Inexact == polymorphic.) 1382 bool _klass_is_exact; 1383 bool _is_ptr_to_narrowoop; 1384 bool _is_ptr_to_narrowklass; 1385 bool _is_ptr_to_boxed_value; 1386 1387 // If not InstanceTop or InstanceBot, indicates that this is 1388 // a particular instance of this type which is distinct. 1389 // This is the node index of the allocation node creating this instance. 1390 int _instance_id; 1391 1392 static const TypeOopPtr* make_from_klass_common(ciKlass* klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling); 1393 1394 int dual_instance_id() const; 1395 int meet_instance_id(int uid) const; 1396 1397 const TypeInterfaces* meet_interfaces(const TypeOopPtr* other) const; 1398 1399 // Do not allow interface-vs.-noninterface joins to collapse to top. 1400 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const; 1401 1402 virtual ciKlass* exact_klass_helper() const { return nullptr; } 1403 virtual ciKlass* klass() const { return _klass; } 1404 1405 #ifndef PRODUCT 1406 void dump_instance_id(outputStream* st) const; 1407 #endif // PRODUCT 1408 1409 public: 1410 1411 bool is_java_subtype_of(const TypeOopPtr* other) const { 1412 return is_java_subtype_of_helper(other, klass_is_exact(), other->klass_is_exact()); 1413 } 1414 1415 bool is_same_java_type_as(const TypePtr* other) const { 1416 return is_same_java_type_as_helper(other->is_oopptr()); 1417 } 1418 1419 virtual bool is_same_java_type_as_helper(const TypeOopPtr* other) const { 1420 ShouldNotReachHere(); return false; 1421 } 1422 1423 bool maybe_java_subtype_of(const TypeOopPtr* other) const { 1424 return maybe_java_subtype_of_helper(other, klass_is_exact(), other->klass_is_exact()); 1425 } 1426 virtual bool is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { ShouldNotReachHere(); return false; } 1427 virtual bool maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { ShouldNotReachHere(); return false; } 1428 1429 1430 // Creates a type given a klass. Correctly handles multi-dimensional arrays 1431 // Respects UseUniqueSubclasses. 1432 // If the klass is final, the resulting type will be exact. 1433 static const TypeOopPtr* make_from_klass(ciKlass* klass, InterfaceHandling interface_handling = ignore_interfaces) { 1434 return make_from_klass_common(klass, true, false, interface_handling); 1435 } 1436 // Same as before, but will produce an exact type, even if 1437 // the klass is not final, as long as it has exactly one implementation. 1438 static const TypeOopPtr* make_from_klass_unique(ciKlass* klass, InterfaceHandling interface_handling= ignore_interfaces) { 1439 return make_from_klass_common(klass, true, true, interface_handling); 1440 } 1441 // Same as before, but does not respects UseUniqueSubclasses. 1442 // Use this only for creating array element types. 1443 static const TypeOopPtr* make_from_klass_raw(ciKlass* klass, InterfaceHandling interface_handling = ignore_interfaces) { 1444 return make_from_klass_common(klass, false, false, interface_handling); 1445 } 1446 // Creates a singleton type given an object. 1447 // If the object cannot be rendered as a constant, 1448 // may return a non-singleton type. 1449 // If require_constant, produce a null if a singleton is not possible. 1450 static const TypeOopPtr* make_from_constant(ciObject* o, 1451 bool require_constant = false); 1452 1453 // Make a generic (unclassed) pointer to an oop. 1454 static const TypeOopPtr* make(PTR ptr, int offset, int instance_id, 1455 const TypePtr* speculative = nullptr, 1456 int inline_depth = InlineDepthBottom); 1457 1458 ciObject* const_oop() const { return _const_oop; } 1459 // Exact klass, possibly an interface or an array of interface 1460 ciKlass* exact_klass(bool maybe_null = false) const { assert(klass_is_exact(), ""); ciKlass* k = exact_klass_helper(); assert(k != nullptr || maybe_null, ""); return k; } 1461 ciKlass* unloaded_klass() const { assert(!is_loaded(), "only for unloaded types"); return klass(); } 1462 1463 virtual bool is_loaded() const { return klass()->is_loaded(); } 1464 virtual bool klass_is_exact() const { return _klass_is_exact; } 1465 1466 // Returns true if this pointer points at memory which contains a 1467 // compressed oop references. 1468 bool is_ptr_to_narrowoop_nv() const { return _is_ptr_to_narrowoop; } 1469 bool is_ptr_to_narrowklass_nv() const { return _is_ptr_to_narrowklass; } 1470 bool is_ptr_to_boxed_value() const { return _is_ptr_to_boxed_value; } 1471 bool is_known_instance() const { return _instance_id > 0; } 1472 int instance_id() const { return _instance_id; } 1473 bool is_known_instance_field() const { return is_known_instance() && _offset >= 0; } 1474 1475 virtual intptr_t get_con() const; 1476 1477 virtual const TypeOopPtr* cast_to_ptr_type(PTR ptr) const; 1478 1479 virtual const TypeOopPtr* cast_to_exactness(bool klass_is_exact) const; 1480 1481 virtual const TypeOopPtr *cast_to_instance_id(int instance_id) const; 1482 1483 // corresponding pointer to klass, for a given instance 1484 virtual const TypeKlassPtr* as_klass_type(bool try_for_exact = false) const; 1485 1486 virtual const TypeOopPtr* with_offset(intptr_t offset) const; 1487 virtual const TypePtr* add_offset(intptr_t offset) const; 1488 1489 // Speculative type helper methods. 1490 virtual const TypeOopPtr* remove_speculative() const; 1491 virtual const Type* cleanup_speculative() const; 1492 virtual bool would_improve_type(ciKlass* exact_kls, int inline_depth) const; 1493 virtual const TypePtr* with_inline_depth(int depth) const; 1494 1495 virtual const TypePtr* with_instance_id(int instance_id) const; 1496 1497 virtual const Type *xdual() const; // Compute dual right now. 1498 // the core of the computation of the meet for TypeOopPtr and for its subclasses 1499 virtual const Type *xmeet_helper(const Type *t) const; 1500 1501 // Convenience common pre-built type. 1502 static const TypeOopPtr *BOTTOM; 1503 #ifndef PRODUCT 1504 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 1505 #endif 1506 private: 1507 virtual bool is_meet_subtype_of(const TypePtr* other) const { 1508 return is_meet_subtype_of_helper(other->is_oopptr(), klass_is_exact(), other->is_oopptr()->klass_is_exact()); 1509 } 1510 1511 virtual bool is_meet_subtype_of_helper(const TypeOopPtr* other, bool this_xk, bool other_xk) const { 1512 ShouldNotReachHere(); return false; 1513 } 1514 1515 virtual const TypeInterfaces* interfaces() const { 1516 return _interfaces; 1517 }; 1518 1519 const TypeOopPtr* is_reference_type(const Type* other) const { 1520 return other->isa_oopptr(); 1521 } 1522 1523 const TypeAryPtr* is_array_type(const TypeOopPtr* other) const { 1524 return other->isa_aryptr(); 1525 } 1526 1527 const TypeInstPtr* is_instance_type(const TypeOopPtr* other) const { 1528 return other->isa_instptr(); 1529 } 1530 }; 1531 1532 //------------------------------TypeInstPtr------------------------------------ 1533 // Class of Java object pointers, pointing either to non-array Java instances 1534 // or to a Klass* (including array klasses). 1535 class TypeInstPtr : public TypeOopPtr { 1536 TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int off, int instance_id, 1537 const TypePtr* speculative, int inline_depth); 1538 virtual bool eq( const Type *t ) const; 1539 virtual uint hash() const; // Type specific hashing 1540 1541 ciKlass* exact_klass_helper() const; 1542 1543 public: 1544 1545 // Instance klass, ignoring any interface 1546 ciInstanceKlass* instance_klass() const { 1547 assert(!(klass()->is_loaded() && klass()->is_interface()), ""); 1548 return klass()->as_instance_klass(); 1549 } 1550 1551 bool is_same_java_type_as_helper(const TypeOopPtr* other) const; 1552 bool is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const; 1553 bool maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const; 1554 1555 // Make a pointer to a constant oop. 1556 static const TypeInstPtr *make(ciObject* o) { 1557 ciKlass* k = o->klass(); 1558 const TypeInterfaces* interfaces = TypePtr::interfaces(k, true, false, false, ignore_interfaces); 1559 return make(TypePtr::Constant, k, interfaces, true, o, 0, InstanceBot); 1560 } 1561 // Make a pointer to a constant oop with offset. 1562 static const TypeInstPtr *make(ciObject* o, int offset) { 1563 ciKlass* k = o->klass(); 1564 const TypeInterfaces* interfaces = TypePtr::interfaces(k, true, false, false, ignore_interfaces); 1565 return make(TypePtr::Constant, k, interfaces, true, o, offset, InstanceBot); 1566 } 1567 1568 // Make a pointer to some value of type klass. 1569 static const TypeInstPtr *make(PTR ptr, ciKlass* klass, InterfaceHandling interface_handling = ignore_interfaces) { 1570 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling); 1571 return make(ptr, klass, interfaces, false, nullptr, 0, InstanceBot); 1572 } 1573 1574 // Make a pointer to some non-polymorphic value of exactly type klass. 1575 static const TypeInstPtr *make_exact(PTR ptr, ciKlass* klass) { 1576 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, false, false, ignore_interfaces); 1577 return make(ptr, klass, interfaces, true, nullptr, 0, InstanceBot); 1578 } 1579 1580 // Make a pointer to some value of type klass with offset. 1581 static const TypeInstPtr *make(PTR ptr, ciKlass* klass, int offset) { 1582 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, false, false, ignore_interfaces); 1583 return make(ptr, klass, interfaces, false, nullptr, offset, InstanceBot); 1584 } 1585 1586 static const TypeInstPtr *make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, int offset, 1587 int instance_id = InstanceBot, 1588 const TypePtr* speculative = nullptr, 1589 int inline_depth = InlineDepthBottom); 1590 1591 static const TypeInstPtr *make(PTR ptr, ciKlass* k, bool xk, ciObject* o, int offset, int instance_id = InstanceBot) { 1592 const TypeInterfaces* interfaces = TypePtr::interfaces(k, true, false, false, ignore_interfaces); 1593 return make(ptr, k, interfaces, xk, o, offset, instance_id); 1594 } 1595 1596 // If this is a java.lang.Class constant, return the type for it or null. 1597 // Pass to Type::get_const_type to turn it to a type, which will usually 1598 // be a TypeInstPtr, but may also be a TypeInt::INT for int.class, etc. 1599 ciType* java_mirror_type() const; 1600 1601 virtual const TypeInstPtr* cast_to_ptr_type(PTR ptr) const; 1602 1603 virtual const TypeInstPtr* cast_to_exactness(bool klass_is_exact) const; 1604 1605 virtual const TypeInstPtr* cast_to_instance_id(int instance_id) const; 1606 1607 virtual const TypePtr* add_offset(intptr_t offset) const; 1608 virtual const TypeInstPtr* with_offset(intptr_t offset) const; 1609 1610 // Speculative type helper methods. 1611 virtual const TypeInstPtr* remove_speculative() const; 1612 const TypeInstPtr* with_speculative(const TypePtr* speculative) const; 1613 virtual const TypePtr* with_inline_depth(int depth) const; 1614 virtual const TypePtr* with_instance_id(int instance_id) const; 1615 1616 // the core of the computation of the meet of 2 types 1617 virtual const Type *xmeet_helper(const Type *t) const; 1618 virtual const TypeInstPtr *xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const; 1619 virtual const Type *xdual() const; // Compute dual right now. 1620 1621 const TypeKlassPtr* as_klass_type(bool try_for_exact = false) const; 1622 1623 // Convenience common pre-built types. 1624 static const TypeInstPtr *NOTNULL; 1625 static const TypeInstPtr *BOTTOM; 1626 static const TypeInstPtr *MIRROR; 1627 static const TypeInstPtr *MARK; 1628 static const TypeInstPtr *KLASS; 1629 #ifndef PRODUCT 1630 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping 1631 #endif 1632 1633 private: 1634 virtual bool is_meet_subtype_of_helper(const TypeOopPtr* other, bool this_xk, bool other_xk) const; 1635 1636 virtual bool is_meet_same_type_as(const TypePtr* other) const { 1637 return _klass->equals(other->is_instptr()->_klass) && _interfaces->eq(other->is_instptr()->_interfaces); 1638 } 1639 1640 }; 1641 1642 //------------------------------TypeAryPtr------------------------------------- 1643 // Class of Java array pointers 1644 class TypeAryPtr : public TypeOopPtr { 1645 friend class Type; 1646 friend class TypePtr; 1647 friend class TypeInterfaces; 1648 1649 TypeAryPtr( PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, 1650 int offset, int instance_id, bool is_autobox_cache, 1651 const TypePtr* speculative, int inline_depth) 1652 : TypeOopPtr(AryPtr,ptr,k,_array_interfaces,xk,o,offset, instance_id, speculative, inline_depth), 1653 _ary(ary), 1654 _is_autobox_cache(is_autobox_cache) 1655 { 1656 int dummy; 1657 bool top_or_bottom = (base_element_type(dummy) == Type::TOP || base_element_type(dummy) == Type::BOTTOM); 1658 1659 if (UseCompressedOops && (elem()->make_oopptr() != nullptr && !top_or_bottom) && 1660 _offset != 0 && _offset != arrayOopDesc::length_offset_in_bytes() && 1661 _offset != arrayOopDesc::klass_offset_in_bytes()) { 1662 _is_ptr_to_narrowoop = true; 1663 } 1664 1665 } 1666 virtual bool eq( const Type *t ) const; 1667 virtual uint hash() const; // Type specific hashing 1668 const TypeAry *_ary; // Array we point into 1669 const bool _is_autobox_cache; 1670 1671 ciKlass* compute_klass() const; 1672 1673 // A pointer to delay allocation to Type::Initialize_shared() 1674 1675 static const TypeInterfaces* _array_interfaces; 1676 ciKlass* exact_klass_helper() const; 1677 // Only guaranteed non null for array of basic types 1678 ciKlass* klass() const; 1679 1680 public: 1681 1682 bool is_same_java_type_as_helper(const TypeOopPtr* other) const; 1683 bool is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const; 1684 bool maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const; 1685 1686 // returns base element type, an instance klass (and not interface) for object arrays 1687 const Type* base_element_type(int& dims) const; 1688 1689 // Accessors 1690 bool is_loaded() const { return (_ary->_elem->make_oopptr() ? _ary->_elem->make_oopptr()->is_loaded() : true); } 1691 1692 const TypeAry* ary() const { return _ary; } 1693 const Type* elem() const { return _ary->_elem; } 1694 const TypeInt* size() const { return _ary->_size; } 1695 bool is_stable() const { return _ary->_stable; } 1696 1697 bool is_autobox_cache() const { return _is_autobox_cache; } 1698 1699 static const TypeAryPtr *make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, 1700 int instance_id = InstanceBot, 1701 const TypePtr* speculative = nullptr, 1702 int inline_depth = InlineDepthBottom); 1703 // Constant pointer to array 1704 static const TypeAryPtr *make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset, 1705 int instance_id = InstanceBot, 1706 const TypePtr* speculative = nullptr, 1707 int inline_depth = InlineDepthBottom, bool is_autobox_cache = false); 1708 1709 // Return a 'ptr' version of this type 1710 virtual const TypeAryPtr* cast_to_ptr_type(PTR ptr) const; 1711 1712 virtual const TypeAryPtr* cast_to_exactness(bool klass_is_exact) const; 1713 1714 virtual const TypeAryPtr* cast_to_instance_id(int instance_id) const; 1715 1716 virtual const TypeAryPtr* cast_to_size(const TypeInt* size) const; 1717 virtual const TypeInt* narrow_size_type(const TypeInt* size) const; 1718 1719 virtual bool empty(void) const; // TRUE if type is vacuous 1720 virtual const TypePtr *add_offset( intptr_t offset ) const; 1721 virtual const TypeAryPtr *with_offset( intptr_t offset ) const; 1722 const TypeAryPtr* with_ary(const TypeAry* ary) const; 1723 1724 // Speculative type helper methods. 1725 virtual const TypeAryPtr* remove_speculative() const; 1726 virtual const TypePtr* with_inline_depth(int depth) const; 1727 virtual const TypePtr* with_instance_id(int instance_id) const; 1728 1729 // the core of the computation of the meet of 2 types 1730 virtual const Type *xmeet_helper(const Type *t) const; 1731 virtual const Type *xdual() const; // Compute dual right now. 1732 1733 const TypeAryPtr* cast_to_stable(bool stable, int stable_dimension = 1) const; 1734 int stable_dimension() const; 1735 1736 const TypeAryPtr* cast_to_autobox_cache() const; 1737 1738 static jint max_array_length(BasicType etype) ; 1739 virtual const TypeKlassPtr* as_klass_type(bool try_for_exact = false) const; 1740 1741 // Convenience common pre-built types. 1742 static const TypeAryPtr* BOTTOM; 1743 static const TypeAryPtr* RANGE; 1744 static const TypeAryPtr* OOPS; 1745 static const TypeAryPtr* NARROWOOPS; 1746 static const TypeAryPtr* BYTES; 1747 static const TypeAryPtr* SHORTS; 1748 static const TypeAryPtr* CHARS; 1749 static const TypeAryPtr* INTS; 1750 static const TypeAryPtr* LONGS; 1751 static const TypeAryPtr* FLOATS; 1752 static const TypeAryPtr* DOUBLES; 1753 // selects one of the above: 1754 static const TypeAryPtr *get_array_body_type(BasicType elem) { 1755 assert((uint)elem <= T_CONFLICT && _array_body_type[elem] != nullptr, "bad elem type"); 1756 return _array_body_type[elem]; 1757 } 1758 static const TypeAryPtr *_array_body_type[T_CONFLICT+1]; 1759 // sharpen the type of an int which is used as an array size 1760 #ifndef PRODUCT 1761 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping 1762 #endif 1763 private: 1764 virtual bool is_meet_subtype_of_helper(const TypeOopPtr* other, bool this_xk, bool other_xk) const; 1765 }; 1766 1767 //------------------------------TypeMetadataPtr------------------------------------- 1768 // Some kind of metadata, either Method*, MethodData* or CPCacheOop 1769 class TypeMetadataPtr : public TypePtr { 1770 protected: 1771 TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset); 1772 // Do not allow interface-vs.-noninterface joins to collapse to top. 1773 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const; 1774 public: 1775 virtual bool eq( const Type *t ) const; 1776 virtual uint hash() const; // Type specific hashing 1777 virtual bool singleton(void) const; // TRUE if type is a singleton 1778 1779 private: 1780 ciMetadata* _metadata; 1781 1782 public: 1783 static const TypeMetadataPtr* make(PTR ptr, ciMetadata* m, int offset); 1784 1785 static const TypeMetadataPtr* make(ciMethod* m); 1786 static const TypeMetadataPtr* make(ciMethodData* m); 1787 1788 ciMetadata* metadata() const { return _metadata; } 1789 1790 virtual const TypeMetadataPtr* cast_to_ptr_type(PTR ptr) const; 1791 1792 virtual const TypePtr *add_offset( intptr_t offset ) const; 1793 1794 virtual const Type *xmeet( const Type *t ) const; 1795 virtual const Type *xdual() const; // Compute dual right now. 1796 1797 virtual intptr_t get_con() const; 1798 1799 // Convenience common pre-built types. 1800 static const TypeMetadataPtr *BOTTOM; 1801 1802 #ifndef PRODUCT 1803 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 1804 #endif 1805 }; 1806 1807 //------------------------------TypeKlassPtr----------------------------------- 1808 // Class of Java Klass pointers 1809 class TypeKlassPtr : public TypePtr { 1810 friend class TypeInstKlassPtr; 1811 friend class TypeAryKlassPtr; 1812 friend class TypePtr; 1813 protected: 1814 TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, int offset); 1815 1816 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const; 1817 1818 public: 1819 virtual bool eq( const Type *t ) const; 1820 virtual uint hash() const; 1821 virtual bool singleton(void) const; // TRUE if type is a singleton 1822 1823 protected: 1824 1825 ciKlass* _klass; 1826 const TypeInterfaces* _interfaces; 1827 const TypeInterfaces* meet_interfaces(const TypeKlassPtr* other) const; 1828 virtual bool must_be_exact() const { ShouldNotReachHere(); return false; } 1829 virtual ciKlass* exact_klass_helper() const; 1830 virtual ciKlass* klass() const { return _klass; } 1831 1832 public: 1833 1834 bool is_java_subtype_of(const TypeKlassPtr* other) const { 1835 return is_java_subtype_of_helper(other, klass_is_exact(), other->klass_is_exact()); 1836 } 1837 bool is_same_java_type_as(const TypePtr* other) const { 1838 return is_same_java_type_as_helper(other->is_klassptr()); 1839 } 1840 1841 bool maybe_java_subtype_of(const TypeKlassPtr* other) const { 1842 return maybe_java_subtype_of_helper(other, klass_is_exact(), other->klass_is_exact()); 1843 } 1844 virtual bool is_same_java_type_as_helper(const TypeKlassPtr* other) const { ShouldNotReachHere(); return false; } 1845 virtual bool is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { ShouldNotReachHere(); return false; } 1846 virtual bool maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { ShouldNotReachHere(); return false; } 1847 1848 // Exact klass, possibly an interface or an array of interface 1849 ciKlass* exact_klass(bool maybe_null = false) const { assert(klass_is_exact(), ""); ciKlass* k = exact_klass_helper(); assert(k != nullptr || maybe_null, ""); return k; } 1850 virtual bool klass_is_exact() const { return _ptr == Constant; } 1851 1852 static const TypeKlassPtr* make(ciKlass* klass, InterfaceHandling interface_handling = ignore_interfaces); 1853 static const TypeKlassPtr *make(PTR ptr, ciKlass* klass, int offset, InterfaceHandling interface_handling = ignore_interfaces); 1854 1855 virtual bool is_loaded() const { return _klass->is_loaded(); } 1856 1857 virtual const TypeKlassPtr* cast_to_ptr_type(PTR ptr) const { ShouldNotReachHere(); return nullptr; } 1858 1859 virtual const TypeKlassPtr *cast_to_exactness(bool klass_is_exact) const { ShouldNotReachHere(); return nullptr; } 1860 1861 // corresponding pointer to instance, for a given class 1862 virtual const TypeOopPtr* as_instance_type(bool klass_change = true) const { ShouldNotReachHere(); return nullptr; } 1863 1864 virtual const TypePtr *add_offset( intptr_t offset ) const { ShouldNotReachHere(); return nullptr; } 1865 virtual const Type *xmeet( const Type *t ) const { ShouldNotReachHere(); return nullptr; } 1866 virtual const Type *xdual() const { ShouldNotReachHere(); return nullptr; } 1867 1868 virtual intptr_t get_con() const; 1869 1870 virtual const TypeKlassPtr* with_offset(intptr_t offset) const { ShouldNotReachHere(); return nullptr; } 1871 1872 virtual const TypeKlassPtr* try_improve() const { return this; } 1873 1874 private: 1875 virtual bool is_meet_subtype_of(const TypePtr* other) const { 1876 return is_meet_subtype_of_helper(other->is_klassptr(), klass_is_exact(), other->is_klassptr()->klass_is_exact()); 1877 } 1878 1879 virtual bool is_meet_subtype_of_helper(const TypeKlassPtr* other, bool this_xk, bool other_xk) const { 1880 ShouldNotReachHere(); return false; 1881 } 1882 1883 virtual const TypeInterfaces* interfaces() const { 1884 return _interfaces; 1885 }; 1886 1887 const TypeKlassPtr* is_reference_type(const Type* other) const { 1888 return other->isa_klassptr(); 1889 } 1890 1891 const TypeAryKlassPtr* is_array_type(const TypeKlassPtr* other) const { 1892 return other->isa_aryklassptr(); 1893 } 1894 1895 const TypeInstKlassPtr* is_instance_type(const TypeKlassPtr* other) const { 1896 return other->isa_instklassptr(); 1897 } 1898 }; 1899 1900 // Instance klass pointer, mirrors TypeInstPtr 1901 class TypeInstKlassPtr : public TypeKlassPtr { 1902 1903 TypeInstKlassPtr(PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, int offset) 1904 : TypeKlassPtr(InstKlassPtr, ptr, klass, interfaces, offset) { 1905 assert(klass->is_instance_klass() && (!klass->is_loaded() || !klass->is_interface()), ""); 1906 } 1907 1908 virtual bool must_be_exact() const; 1909 1910 public: 1911 // Instance klass ignoring any interface 1912 ciInstanceKlass* instance_klass() const { 1913 assert(!klass()->is_interface(), ""); 1914 return klass()->as_instance_klass(); 1915 } 1916 1917 bool might_be_an_array() const; 1918 1919 bool is_same_java_type_as_helper(const TypeKlassPtr* other) const; 1920 bool is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const; 1921 bool maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const; 1922 1923 static const TypeInstKlassPtr *make(ciKlass* k, InterfaceHandling interface_handling) { 1924 const TypeInterfaces* interfaces = TypePtr::interfaces(k, true, true, false, interface_handling); 1925 return make(TypePtr::Constant, k, interfaces, 0); 1926 } 1927 static const TypeInstKlassPtr* make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, int offset); 1928 1929 static const TypeInstKlassPtr* make(PTR ptr, ciKlass* k, int offset) { 1930 const TypeInterfaces* interfaces = TypePtr::interfaces(k, true, false, false, ignore_interfaces); 1931 return make(ptr, k, interfaces, offset); 1932 } 1933 1934 virtual const TypeInstKlassPtr* cast_to_ptr_type(PTR ptr) const; 1935 1936 virtual const TypeKlassPtr *cast_to_exactness(bool klass_is_exact) const; 1937 1938 // corresponding pointer to instance, for a given class 1939 virtual const TypeOopPtr* as_instance_type(bool klass_change = true) const; 1940 virtual uint hash() const; 1941 virtual bool eq(const Type *t) const; 1942 1943 virtual const TypePtr *add_offset( intptr_t offset ) const; 1944 virtual const Type *xmeet( const Type *t ) const; 1945 virtual const Type *xdual() const; 1946 virtual const TypeInstKlassPtr* with_offset(intptr_t offset) const; 1947 1948 virtual const TypeKlassPtr* try_improve() const; 1949 1950 // Convenience common pre-built types. 1951 static const TypeInstKlassPtr* OBJECT; // Not-null object klass or below 1952 static const TypeInstKlassPtr* OBJECT_OR_NULL; // Maybe-null version of same 1953 1954 #ifndef PRODUCT 1955 virtual void dump2(Dict& d, uint depth, outputStream* st) const; 1956 #endif // PRODUCT 1957 1958 private: 1959 virtual bool is_meet_subtype_of_helper(const TypeKlassPtr* other, bool this_xk, bool other_xk) const; 1960 }; 1961 1962 // Array klass pointer, mirrors TypeAryPtr 1963 class TypeAryKlassPtr : public TypeKlassPtr { 1964 friend class TypeInstKlassPtr; 1965 friend class Type; 1966 friend class TypePtr; 1967 1968 const Type *_elem; 1969 1970 static const TypeInterfaces* _array_interfaces; 1971 TypeAryKlassPtr(PTR ptr, const Type *elem, ciKlass* klass, int offset) 1972 : TypeKlassPtr(AryKlassPtr, ptr, klass, _array_interfaces, offset), _elem(elem) { 1973 assert(klass == nullptr || klass->is_type_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), ""); 1974 } 1975 1976 virtual ciKlass* exact_klass_helper() const; 1977 // Only guaranteed non null for array of basic types 1978 virtual ciKlass* klass() const; 1979 1980 virtual bool must_be_exact() const; 1981 1982 public: 1983 1984 // returns base element type, an instance klass (and not interface) for object arrays 1985 const Type* base_element_type(int& dims) const; 1986 1987 static const TypeAryKlassPtr *make(PTR ptr, ciKlass* k, int offset, InterfaceHandling interface_handling); 1988 1989 bool is_same_java_type_as_helper(const TypeKlassPtr* other) const; 1990 bool is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const; 1991 bool maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const; 1992 1993 bool is_loaded() const { return (_elem->isa_klassptr() ? _elem->is_klassptr()->is_loaded() : true); } 1994 1995 static const TypeAryKlassPtr *make(PTR ptr, const Type *elem, ciKlass* k, int offset); 1996 static const TypeAryKlassPtr* make(ciKlass* klass, InterfaceHandling interface_handling); 1997 1998 const Type *elem() const { return _elem; } 1999 2000 virtual bool eq(const Type *t) const; 2001 virtual uint hash() const; // Type specific hashing 2002 2003 virtual const TypeAryKlassPtr* cast_to_ptr_type(PTR ptr) const; 2004 2005 virtual const TypeKlassPtr *cast_to_exactness(bool klass_is_exact) const; 2006 2007 // corresponding pointer to instance, for a given class 2008 virtual const TypeOopPtr* as_instance_type(bool klass_change = true) const; 2009 2010 virtual const TypePtr *add_offset( intptr_t offset ) const; 2011 virtual const Type *xmeet( const Type *t ) const; 2012 virtual const Type *xdual() const; // Compute dual right now. 2013 2014 virtual const TypeAryKlassPtr* with_offset(intptr_t offset) const; 2015 2016 virtual bool empty(void) const { 2017 return TypeKlassPtr::empty() || _elem->empty(); 2018 } 2019 2020 #ifndef PRODUCT 2021 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping 2022 #endif 2023 private: 2024 virtual bool is_meet_subtype_of_helper(const TypeKlassPtr* other, bool this_xk, bool other_xk) const; 2025 }; 2026 2027 class TypeNarrowPtr : public Type { 2028 protected: 2029 const TypePtr* _ptrtype; // Could be TypePtr::NULL_PTR 2030 2031 TypeNarrowPtr(TYPES t, const TypePtr* ptrtype): Type(t), 2032 _ptrtype(ptrtype) { 2033 assert(ptrtype->offset() == 0 || 2034 ptrtype->offset() == OffsetBot || 2035 ptrtype->offset() == OffsetTop, "no real offsets"); 2036 } 2037 2038 virtual const TypeNarrowPtr *isa_same_narrowptr(const Type *t) const = 0; 2039 virtual const TypeNarrowPtr *is_same_narrowptr(const Type *t) const = 0; 2040 virtual const TypeNarrowPtr *make_same_narrowptr(const TypePtr *t) const = 0; 2041 virtual const TypeNarrowPtr *make_hash_same_narrowptr(const TypePtr *t) const = 0; 2042 // Do not allow interface-vs.-noninterface joins to collapse to top. 2043 virtual const Type *filter_helper(const Type *kills, bool include_speculative) const; 2044 public: 2045 virtual bool eq( const Type *t ) const; 2046 virtual uint hash() const; // Type specific hashing 2047 virtual bool singleton(void) const; // TRUE if type is a singleton 2048 2049 virtual const Type *xmeet( const Type *t ) const; 2050 virtual const Type *xdual() const; // Compute dual right now. 2051 2052 virtual intptr_t get_con() const; 2053 2054 virtual bool empty(void) const; // TRUE if type is vacuous 2055 2056 // returns the equivalent ptr type for this compressed pointer 2057 const TypePtr *get_ptrtype() const { 2058 return _ptrtype; 2059 } 2060 2061 bool is_known_instance() const { 2062 return _ptrtype->is_known_instance(); 2063 } 2064 2065 #ifndef PRODUCT 2066 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 2067 #endif 2068 }; 2069 2070 //------------------------------TypeNarrowOop---------------------------------- 2071 // A compressed reference to some kind of Oop. This type wraps around 2072 // a preexisting TypeOopPtr and forwards most of it's operations to 2073 // the underlying type. It's only real purpose is to track the 2074 // oopness of the compressed oop value when we expose the conversion 2075 // between the normal and the compressed form. 2076 class TypeNarrowOop : public TypeNarrowPtr { 2077 protected: 2078 TypeNarrowOop( const TypePtr* ptrtype): TypeNarrowPtr(NarrowOop, ptrtype) { 2079 } 2080 2081 virtual const TypeNarrowPtr *isa_same_narrowptr(const Type *t) const { 2082 return t->isa_narrowoop(); 2083 } 2084 2085 virtual const TypeNarrowPtr *is_same_narrowptr(const Type *t) const { 2086 return t->is_narrowoop(); 2087 } 2088 2089 virtual const TypeNarrowPtr *make_same_narrowptr(const TypePtr *t) const { 2090 return new TypeNarrowOop(t); 2091 } 2092 2093 virtual const TypeNarrowPtr *make_hash_same_narrowptr(const TypePtr *t) const { 2094 return (const TypeNarrowPtr*)((new TypeNarrowOop(t))->hashcons()); 2095 } 2096 2097 public: 2098 2099 static const TypeNarrowOop *make( const TypePtr* type); 2100 2101 static const TypeNarrowOop* make_from_constant(ciObject* con, bool require_constant = false) { 2102 return make(TypeOopPtr::make_from_constant(con, require_constant)); 2103 } 2104 2105 static const TypeNarrowOop *BOTTOM; 2106 static const TypeNarrowOop *NULL_PTR; 2107 2108 virtual const TypeNarrowOop* remove_speculative() const; 2109 virtual const Type* cleanup_speculative() const; 2110 2111 #ifndef PRODUCT 2112 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 2113 #endif 2114 }; 2115 2116 //------------------------------TypeNarrowKlass---------------------------------- 2117 // A compressed reference to klass pointer. This type wraps around a 2118 // preexisting TypeKlassPtr and forwards most of it's operations to 2119 // the underlying type. 2120 class TypeNarrowKlass : public TypeNarrowPtr { 2121 protected: 2122 TypeNarrowKlass( const TypePtr* ptrtype): TypeNarrowPtr(NarrowKlass, ptrtype) { 2123 } 2124 2125 virtual const TypeNarrowPtr *isa_same_narrowptr(const Type *t) const { 2126 return t->isa_narrowklass(); 2127 } 2128 2129 virtual const TypeNarrowPtr *is_same_narrowptr(const Type *t) const { 2130 return t->is_narrowklass(); 2131 } 2132 2133 virtual const TypeNarrowPtr *make_same_narrowptr(const TypePtr *t) const { 2134 return new TypeNarrowKlass(t); 2135 } 2136 2137 virtual const TypeNarrowPtr *make_hash_same_narrowptr(const TypePtr *t) const { 2138 return (const TypeNarrowPtr*)((new TypeNarrowKlass(t))->hashcons()); 2139 } 2140 2141 public: 2142 static const TypeNarrowKlass *make( const TypePtr* type); 2143 2144 // static const TypeNarrowKlass *BOTTOM; 2145 static const TypeNarrowKlass *NULL_PTR; 2146 2147 #ifndef PRODUCT 2148 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; 2149 #endif 2150 }; 2151 2152 //------------------------------TypeFunc--------------------------------------- 2153 // Class of Array Types 2154 class TypeFunc : public Type { 2155 TypeFunc( const TypeTuple *domain, const TypeTuple *range ) : Type(Function), _domain(domain), _range(range) {} 2156 virtual bool eq( const Type *t ) const; 2157 virtual uint hash() const; // Type specific hashing 2158 virtual bool singleton(void) const; // TRUE if type is a singleton 2159 virtual bool empty(void) const; // TRUE if type is vacuous 2160 2161 const TypeTuple* const _domain; // Domain of inputs 2162 const TypeTuple* const _range; // Range of results 2163 2164 public: 2165 // Constants are shared among ADLC and VM 2166 enum { Control = AdlcVMDeps::Control, 2167 I_O = AdlcVMDeps::I_O, 2168 Memory = AdlcVMDeps::Memory, 2169 FramePtr = AdlcVMDeps::FramePtr, 2170 ReturnAdr = AdlcVMDeps::ReturnAdr, 2171 Parms = AdlcVMDeps::Parms 2172 }; 2173 2174 2175 // Accessors: 2176 const TypeTuple* domain() const { return _domain; } 2177 const TypeTuple* range() const { return _range; } 2178 2179 static const TypeFunc *make(ciMethod* method); 2180 static const TypeFunc *make(ciSignature signature, const Type* extra); 2181 static const TypeFunc *make(const TypeTuple* domain, const TypeTuple* range); 2182 2183 virtual const Type *xmeet( const Type *t ) const; 2184 virtual const Type *xdual() const; // Compute dual right now. 2185 2186 BasicType return_type() const; 2187 2188 #ifndef PRODUCT 2189 virtual void dump2( Dict &d, uint depth, outputStream *st ) const; // Specialized per-Type dumping 2190 #endif 2191 // Convenience common pre-built types. 2192 }; 2193 2194 //------------------------------accessors-------------------------------------- 2195 inline bool Type::is_ptr_to_narrowoop() const { 2196 #ifdef _LP64 2197 return (isa_oopptr() != nullptr && is_oopptr()->is_ptr_to_narrowoop_nv()); 2198 #else 2199 return false; 2200 #endif 2201 } 2202 2203 inline bool Type::is_ptr_to_narrowklass() const { 2204 #ifdef _LP64 2205 return (isa_oopptr() != nullptr && is_oopptr()->is_ptr_to_narrowklass_nv()); 2206 #else 2207 return false; 2208 #endif 2209 } 2210 2211 inline float Type::getf() const { 2212 assert( _base == FloatCon, "Not a FloatCon" ); 2213 return ((TypeF*)this)->_f; 2214 } 2215 2216 inline short Type::geth() const { 2217 assert(_base == HalfFloatCon, "Not a HalfFloatCon"); 2218 return ((TypeH*)this)->_f; 2219 } 2220 2221 inline double Type::getd() const { 2222 assert( _base == DoubleCon, "Not a DoubleCon" ); 2223 return ((TypeD*)this)->_d; 2224 } 2225 2226 inline const TypeInteger *Type::is_integer(BasicType bt) const { 2227 assert((bt == T_INT && _base == Int) || (bt == T_LONG && _base == Long), "Not an Int"); 2228 return (TypeInteger*)this; 2229 } 2230 2231 inline const TypeInteger *Type::isa_integer(BasicType bt) const { 2232 return (((bt == T_INT && _base == Int) || (bt == T_LONG && _base == Long)) ? (TypeInteger*)this : nullptr); 2233 } 2234 2235 inline const TypeInt *Type::is_int() const { 2236 assert( _base == Int, "Not an Int" ); 2237 return (TypeInt*)this; 2238 } 2239 2240 inline const TypeInt *Type::isa_int() const { 2241 return ( _base == Int ? (TypeInt*)this : nullptr); 2242 } 2243 2244 inline const TypeLong *Type::is_long() const { 2245 assert( _base == Long, "Not a Long" ); 2246 return (TypeLong*)this; 2247 } 2248 2249 inline const TypeLong *Type::isa_long() const { 2250 return ( _base == Long ? (TypeLong*)this : nullptr); 2251 } 2252 2253 inline const TypeH* Type::isa_half_float() const { 2254 return ((_base == HalfFloatTop || 2255 _base == HalfFloatCon || 2256 _base == HalfFloatBot) ? (TypeH*)this : nullptr); 2257 } 2258 2259 inline const TypeH* Type::is_half_float_constant() const { 2260 assert( _base == HalfFloatCon, "Not a HalfFloat" ); 2261 return (TypeH*)this; 2262 } 2263 2264 inline const TypeH* Type::isa_half_float_constant() const { 2265 return (_base == HalfFloatCon ? (TypeH*)this : nullptr); 2266 } 2267 2268 inline const TypeF *Type::isa_float() const { 2269 return ((_base == FloatTop || 2270 _base == FloatCon || 2271 _base == FloatBot) ? (TypeF*)this : nullptr); 2272 } 2273 2274 inline const TypeF *Type::is_float_constant() const { 2275 assert( _base == FloatCon, "Not a Float" ); 2276 return (TypeF*)this; 2277 } 2278 2279 inline const TypeF *Type::isa_float_constant() const { 2280 return ( _base == FloatCon ? (TypeF*)this : nullptr); 2281 } 2282 2283 inline const TypeD *Type::isa_double() const { 2284 return ((_base == DoubleTop || 2285 _base == DoubleCon || 2286 _base == DoubleBot) ? (TypeD*)this : nullptr); 2287 } 2288 2289 inline const TypeD *Type::is_double_constant() const { 2290 assert( _base == DoubleCon, "Not a Double" ); 2291 return (TypeD*)this; 2292 } 2293 2294 inline const TypeD *Type::isa_double_constant() const { 2295 return ( _base == DoubleCon ? (TypeD*)this : nullptr); 2296 } 2297 2298 inline const TypeTuple *Type::is_tuple() const { 2299 assert( _base == Tuple, "Not a Tuple" ); 2300 return (TypeTuple*)this; 2301 } 2302 2303 inline const TypeAry *Type::is_ary() const { 2304 assert( _base == Array , "Not an Array" ); 2305 return (TypeAry*)this; 2306 } 2307 2308 inline const TypeAry *Type::isa_ary() const { 2309 return ((_base == Array) ? (TypeAry*)this : nullptr); 2310 } 2311 2312 inline const TypePVectMask *Type::is_pvectmask() const { 2313 assert( _base == VectorMask, "Not a Vector Mask" ); 2314 return (TypePVectMask*)this; 2315 } 2316 2317 inline const TypePVectMask *Type::isa_pvectmask() const { 2318 return (_base == VectorMask) ? (TypePVectMask*)this : nullptr; 2319 } 2320 2321 inline const TypeVect *Type::is_vect() const { 2322 assert( _base >= VectorMask && _base <= VectorZ, "Not a Vector" ); 2323 return (TypeVect*)this; 2324 } 2325 2326 inline const TypeVect *Type::isa_vect() const { 2327 return (_base >= VectorMask && _base <= VectorZ) ? (TypeVect*)this : nullptr; 2328 } 2329 2330 inline const TypePtr *Type::is_ptr() const { 2331 // AnyPtr is the first Ptr and KlassPtr the last, with no non-ptrs between. 2332 assert(_base >= AnyPtr && _base <= AryKlassPtr, "Not a pointer"); 2333 return (TypePtr*)this; 2334 } 2335 2336 inline const TypePtr *Type::isa_ptr() const { 2337 // AnyPtr is the first Ptr and KlassPtr the last, with no non-ptrs between. 2338 return (_base >= AnyPtr && _base <= AryKlassPtr) ? (TypePtr*)this : nullptr; 2339 } 2340 2341 inline const TypeOopPtr *Type::is_oopptr() const { 2342 // OopPtr is the first and KlassPtr the last, with no non-oops between. 2343 assert(_base >= OopPtr && _base <= AryPtr, "Not a Java pointer" ) ; 2344 return (TypeOopPtr*)this; 2345 } 2346 2347 inline const TypeOopPtr *Type::isa_oopptr() const { 2348 // OopPtr is the first and KlassPtr the last, with no non-oops between. 2349 return (_base >= OopPtr && _base <= AryPtr) ? (TypeOopPtr*)this : nullptr; 2350 } 2351 2352 inline const TypeRawPtr *Type::isa_rawptr() const { 2353 return (_base == RawPtr) ? (TypeRawPtr*)this : nullptr; 2354 } 2355 2356 inline const TypeRawPtr *Type::is_rawptr() const { 2357 assert( _base == RawPtr, "Not a raw pointer" ); 2358 return (TypeRawPtr*)this; 2359 } 2360 2361 inline const TypeInstPtr *Type::isa_instptr() const { 2362 return (_base == InstPtr) ? (TypeInstPtr*)this : nullptr; 2363 } 2364 2365 inline const TypeInstPtr *Type::is_instptr() const { 2366 assert( _base == InstPtr, "Not an object pointer" ); 2367 return (TypeInstPtr*)this; 2368 } 2369 2370 inline const TypeAryPtr *Type::isa_aryptr() const { 2371 return (_base == AryPtr) ? (TypeAryPtr*)this : nullptr; 2372 } 2373 2374 inline const TypeAryPtr *Type::is_aryptr() const { 2375 assert( _base == AryPtr, "Not an array pointer" ); 2376 return (TypeAryPtr*)this; 2377 } 2378 2379 inline const TypeNarrowOop *Type::is_narrowoop() const { 2380 // OopPtr is the first and KlassPtr the last, with no non-oops between. 2381 assert(_base == NarrowOop, "Not a narrow oop" ) ; 2382 return (TypeNarrowOop*)this; 2383 } 2384 2385 inline const TypeNarrowOop *Type::isa_narrowoop() const { 2386 // OopPtr is the first and KlassPtr the last, with no non-oops between. 2387 return (_base == NarrowOop) ? (TypeNarrowOop*)this : nullptr; 2388 } 2389 2390 inline const TypeNarrowKlass *Type::is_narrowklass() const { 2391 assert(_base == NarrowKlass, "Not a narrow oop" ) ; 2392 return (TypeNarrowKlass*)this; 2393 } 2394 2395 inline const TypeNarrowKlass *Type::isa_narrowklass() const { 2396 return (_base == NarrowKlass) ? (TypeNarrowKlass*)this : nullptr; 2397 } 2398 2399 inline const TypeMetadataPtr *Type::is_metadataptr() const { 2400 // MetadataPtr is the first and CPCachePtr the last 2401 assert(_base == MetadataPtr, "Not a metadata pointer" ) ; 2402 return (TypeMetadataPtr*)this; 2403 } 2404 2405 inline const TypeMetadataPtr *Type::isa_metadataptr() const { 2406 return (_base == MetadataPtr) ? (TypeMetadataPtr*)this : nullptr; 2407 } 2408 2409 inline const TypeKlassPtr *Type::isa_klassptr() const { 2410 return (_base >= KlassPtr && _base <= AryKlassPtr ) ? (TypeKlassPtr*)this : nullptr; 2411 } 2412 2413 inline const TypeKlassPtr *Type::is_klassptr() const { 2414 assert(_base >= KlassPtr && _base <= AryKlassPtr, "Not a klass pointer"); 2415 return (TypeKlassPtr*)this; 2416 } 2417 2418 inline const TypeInstKlassPtr *Type::isa_instklassptr() const { 2419 return (_base == InstKlassPtr) ? (TypeInstKlassPtr*)this : nullptr; 2420 } 2421 2422 inline const TypeInstKlassPtr *Type::is_instklassptr() const { 2423 assert(_base == InstKlassPtr, "Not a klass pointer"); 2424 return (TypeInstKlassPtr*)this; 2425 } 2426 2427 inline const TypeAryKlassPtr *Type::isa_aryklassptr() const { 2428 return (_base == AryKlassPtr) ? (TypeAryKlassPtr*)this : nullptr; 2429 } 2430 2431 inline const TypeAryKlassPtr *Type::is_aryklassptr() const { 2432 assert(_base == AryKlassPtr, "Not a klass pointer"); 2433 return (TypeAryKlassPtr*)this; 2434 } 2435 2436 inline const TypePtr* Type::make_ptr() const { 2437 return (_base == NarrowOop) ? is_narrowoop()->get_ptrtype() : 2438 ((_base == NarrowKlass) ? is_narrowklass()->get_ptrtype() : 2439 isa_ptr()); 2440 } 2441 2442 inline const TypeOopPtr* Type::make_oopptr() const { 2443 return (_base == NarrowOop) ? is_narrowoop()->get_ptrtype()->isa_oopptr() : isa_oopptr(); 2444 } 2445 2446 inline const TypeNarrowOop* Type::make_narrowoop() const { 2447 return (_base == NarrowOop) ? is_narrowoop() : 2448 (isa_ptr() ? TypeNarrowOop::make(is_ptr()) : nullptr); 2449 } 2450 2451 inline const TypeNarrowKlass* Type::make_narrowklass() const { 2452 return (_base == NarrowKlass) ? is_narrowklass() : 2453 (isa_ptr() ? TypeNarrowKlass::make(is_ptr()) : nullptr); 2454 } 2455 2456 inline bool Type::is_floatingpoint() const { 2457 if( (_base == HalfFloatCon) || (_base == HalfFloatBot) || 2458 (_base == FloatCon) || (_base == FloatBot) || 2459 (_base == DoubleCon) || (_base == DoubleBot) ) 2460 return true; 2461 return false; 2462 } 2463 2464 template <> 2465 inline const TypeInt* Type::cast<TypeInt>() const { 2466 return is_int(); 2467 } 2468 2469 template <> 2470 inline const TypeLong* Type::cast<TypeLong>() const { 2471 return is_long(); 2472 } 2473 2474 template <> 2475 inline const TypeInt* Type::try_cast<TypeInt>() const { 2476 return isa_int(); 2477 } 2478 2479 template <> 2480 inline const TypeLong* Type::try_cast<TypeLong>() const { 2481 return isa_long(); 2482 } 2483 2484 // =============================================================== 2485 // Things that need to be 64-bits in the 64-bit build but 2486 // 32-bits in the 32-bit build. Done this way to get full 2487 // optimization AND strong typing. 2488 #ifdef _LP64 2489 2490 // For type queries and asserts 2491 #define is_intptr_t is_long 2492 #define isa_intptr_t isa_long 2493 #define find_intptr_t_type find_long_type 2494 #define find_intptr_t_con find_long_con 2495 #define TypeX TypeLong 2496 #define Type_X Type::Long 2497 #define TypeX_X TypeLong::LONG 2498 #define TypeX_ZERO TypeLong::ZERO 2499 // For 'ideal_reg' machine registers 2500 #define Op_RegX Op_RegL 2501 // For phase->intcon variants 2502 #define MakeConX longcon 2503 #define ConXNode ConLNode 2504 // For array index arithmetic 2505 #define MulXNode MulLNode 2506 #define AndXNode AndLNode 2507 #define OrXNode OrLNode 2508 #define CmpXNode CmpLNode 2509 #define SubXNode SubLNode 2510 #define LShiftXNode LShiftLNode 2511 // For object size computation: 2512 #define AddXNode AddLNode 2513 #define RShiftXNode RShiftLNode 2514 // For card marks and hashcodes 2515 #define URShiftXNode URShiftLNode 2516 // For pointer-sized accesses 2517 #define LoadXNode LoadLNode 2518 #define StoreXNode StoreLNode 2519 // Opcodes 2520 #define Op_LShiftX Op_LShiftL 2521 #define Op_AndX Op_AndL 2522 #define Op_AddX Op_AddL 2523 #define Op_SubX Op_SubL 2524 #define Op_XorX Op_XorL 2525 #define Op_URShiftX Op_URShiftL 2526 #define Op_LoadX Op_LoadL 2527 // conversions 2528 #define ConvI2X(x) ConvI2L(x) 2529 #define ConvL2X(x) (x) 2530 #define ConvX2I(x) ConvL2I(x) 2531 #define ConvX2L(x) (x) 2532 #define ConvX2UL(x) (x) 2533 2534 #else 2535 2536 // For type queries and asserts 2537 #define is_intptr_t is_int 2538 #define isa_intptr_t isa_int 2539 #define find_intptr_t_type find_int_type 2540 #define find_intptr_t_con find_int_con 2541 #define TypeX TypeInt 2542 #define Type_X Type::Int 2543 #define TypeX_X TypeInt::INT 2544 #define TypeX_ZERO TypeInt::ZERO 2545 // For 'ideal_reg' machine registers 2546 #define Op_RegX Op_RegI 2547 // For phase->intcon variants 2548 #define MakeConX intcon 2549 #define ConXNode ConINode 2550 // For array index arithmetic 2551 #define MulXNode MulINode 2552 #define AndXNode AndINode 2553 #define OrXNode OrINode 2554 #define CmpXNode CmpINode 2555 #define SubXNode SubINode 2556 #define LShiftXNode LShiftINode 2557 // For object size computation: 2558 #define AddXNode AddINode 2559 #define RShiftXNode RShiftINode 2560 // For card marks and hashcodes 2561 #define URShiftXNode URShiftINode 2562 // For pointer-sized accesses 2563 #define LoadXNode LoadINode 2564 #define StoreXNode StoreINode 2565 // Opcodes 2566 #define Op_LShiftX Op_LShiftI 2567 #define Op_AndX Op_AndI 2568 #define Op_AddX Op_AddI 2569 #define Op_SubX Op_SubI 2570 #define Op_XorX Op_XorI 2571 #define Op_URShiftX Op_URShiftI 2572 #define Op_LoadX Op_LoadI 2573 // conversions 2574 #define ConvI2X(x) (x) 2575 #define ConvL2X(x) ConvL2I(x) 2576 #define ConvX2I(x) (x) 2577 #define ConvX2L(x) ConvI2L(x) 2578 #define ConvX2UL(x) ConvI2UL(x) 2579 2580 #endif 2581 2582 #endif // SHARE_OPTO_TYPE_HPP --- EOF ---