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