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