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 #include "ci/ciField.hpp" 26 #include "ci/ciFlatArray.hpp" 27 #include "ci/ciFlatArrayKlass.hpp" 28 #include "ci/ciInlineKlass.hpp" 29 #include "ci/ciMethodData.hpp" 30 #include "ci/ciObjArrayKlass.hpp" 31 #include "ci/ciTypeFlow.hpp" 32 #include "classfile/javaClasses.hpp" 33 #include "classfile/symbolTable.hpp" 34 #include "classfile/vmSymbols.hpp" 35 #include "compiler/compileLog.hpp" 36 #include "libadt/dict.hpp" 37 #include "memory/oopFactory.hpp" 38 #include "memory/resourceArea.hpp" 39 #include "oops/instanceKlass.hpp" 40 #include "oops/instanceMirrorKlass.hpp" 41 #include "oops/objArrayKlass.hpp" 42 #include "oops/typeArrayKlass.hpp" 43 #include "opto/arraycopynode.hpp" 44 #include "opto/callnode.hpp" 45 #include "opto/matcher.hpp" 46 #include "opto/node.hpp" 47 #include "opto/opcodes.hpp" 48 #include "opto/rangeinference.hpp" 49 #include "opto/runtime.hpp" 50 #include "opto/type.hpp" 51 #include "runtime/globals.hpp" 52 #include "runtime/stubRoutines.hpp" 53 #include "utilities/checkedCast.hpp" 54 #include "utilities/debug.hpp" 55 #include "utilities/globalDefinitions.hpp" 56 #include "utilities/ostream.hpp" 57 #include "utilities/powerOfTwo.hpp" 58 #include "utilities/stringUtils.hpp" 59 #if INCLUDE_SHENANDOAHGC 60 #include "gc/shenandoah/c2/shenandoahBarrierSetC2.hpp" 61 #endif // INCLUDE_SHENANDOAHGC 62 63 // Portions of code courtesy of Clifford Click 64 65 // Optimization - Graph Style 66 67 // Dictionary of types shared among compilations. 68 Dict* Type::_shared_type_dict = nullptr; 69 const Type::Offset Type::Offset::top(Type::OffsetTop); 70 const Type::Offset Type::Offset::bottom(Type::OffsetBot); 71 72 const Type::Offset Type::Offset::meet(const Type::Offset other) const { 73 // Either is 'TOP' offset? Return the other offset! 74 if (_offset == OffsetTop) return other; 75 if (other._offset == OffsetTop) return *this; 76 // If either is different, return 'BOTTOM' offset 77 if (_offset != other._offset) return bottom; 78 return Offset(_offset); 79 } 80 81 const Type::Offset Type::Offset::dual() const { 82 if (_offset == OffsetTop) return bottom;// Map 'TOP' into 'BOTTOM' 83 if (_offset == OffsetBot) return top;// Map 'BOTTOM' into 'TOP' 84 return Offset(_offset); // Map everything else into self 85 } 86 87 const Type::Offset Type::Offset::add(intptr_t offset) const { 88 // Adding to 'TOP' offset? Return 'TOP'! 89 if (_offset == OffsetTop || offset == OffsetTop) return top; 90 // Adding to 'BOTTOM' offset? Return 'BOTTOM'! 91 if (_offset == OffsetBot || offset == OffsetBot) return bottom; 92 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'! 93 offset += (intptr_t)_offset; 94 if (offset != (int)offset || offset == OffsetTop) return bottom; 95 96 // assert( _offset >= 0 && _offset+offset >= 0, "" ); 97 // It is possible to construct a negative offset during PhaseCCP 98 99 return Offset((int)offset); // Sum valid offsets 100 } 101 102 void Type::Offset::dump2(outputStream *st) const { 103 if (_offset == 0) { 104 return; 105 } else if (_offset == OffsetTop) { 106 st->print("+top"); 107 } else if (_offset == OffsetBot) { 108 st->print("+bot"); 109 } else { 110 st->print("+%d", _offset); 111 } 112 } 113 114 // Array which maps compiler types to Basic Types 115 const Type::TypeInfo Type::_type_info[Type::lastype] = { 116 { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg, relocInfo::none }, // Bad 117 { Control, T_ILLEGAL, "control", false, 0, relocInfo::none }, // Control 118 { Bottom, T_VOID, "top", false, 0, relocInfo::none }, // Top 119 { Bad, T_INT, "int:", false, Op_RegI, relocInfo::none }, // Int 120 { Bad, T_LONG, "long:", false, Op_RegL, relocInfo::none }, // Long 121 { Half, T_VOID, "half", false, 0, relocInfo::none }, // Half 122 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN, relocInfo::none }, // NarrowOop 123 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN, relocInfo::none }, // NarrowKlass 124 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg, relocInfo::none }, // Tuple 125 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg, relocInfo::none }, // Array 126 { Bad, T_ARRAY, "interfaces:", false, Node::NotAMachineReg, relocInfo::none }, // Interfaces 127 128 #if defined(PPC64) 129 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask. 130 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA. 131 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS 132 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // VectorD 133 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX 134 { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY 135 { Bad, T_ILLEGAL, "vectorz:", false, 0, relocInfo::none }, // VectorZ 136 #elif defined(S390) 137 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask. 138 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA. 139 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS 140 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // VectorD 141 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX 142 { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY 143 { Bad, T_ILLEGAL, "vectorz:", false, 0, relocInfo::none }, // VectorZ 144 #else // all other 145 { Bad, T_ILLEGAL, "vectormask:", false, Op_RegVectMask, relocInfo::none }, // VectorMask. 146 { Bad, T_ILLEGAL, "vectora:", false, Op_VecA, relocInfo::none }, // VectorA. 147 { Bad, T_ILLEGAL, "vectors:", false, Op_VecS, relocInfo::none }, // VectorS 148 { Bad, T_ILLEGAL, "vectord:", false, Op_VecD, relocInfo::none }, // VectorD 149 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX 150 { Bad, T_ILLEGAL, "vectory:", false, Op_VecY, relocInfo::none }, // VectorY 151 { Bad, T_ILLEGAL, "vectorz:", false, Op_VecZ, relocInfo::none }, // VectorZ 152 #endif 153 { Bad, T_ADDRESS, "anyptr:", false, Op_RegP, relocInfo::none }, // AnyPtr 154 { Bad, T_ADDRESS, "rawptr:", false, Op_RegP, relocInfo::external_word_type }, // RawPtr 155 { Bad, T_OBJECT, "oop:", true, Op_RegP, relocInfo::oop_type }, // OopPtr 156 { Bad, T_OBJECT, "inst:", true, Op_RegP, relocInfo::oop_type }, // InstPtr 157 { Bad, T_OBJECT, "ary:", true, Op_RegP, relocInfo::oop_type }, // AryPtr 158 { Bad, T_METADATA, "metadata:", false, Op_RegP, relocInfo::metadata_type }, // MetadataPtr 159 { Bad, T_METADATA, "klass:", false, Op_RegP, relocInfo::metadata_type }, // KlassPtr 160 { Bad, T_METADATA, "instklass:", false, Op_RegP, relocInfo::metadata_type }, // InstKlassPtr 161 { Bad, T_METADATA, "aryklass:", false, Op_RegP, relocInfo::metadata_type }, // AryKlassPtr 162 { Bad, T_OBJECT, "func", false, 0, relocInfo::none }, // Function 163 { Abio, T_ILLEGAL, "abIO", false, 0, relocInfo::none }, // Abio 164 { Return_Address, T_ADDRESS, "return_address",false, Op_RegP, relocInfo::none }, // Return_Address 165 { Memory, T_ILLEGAL, "memory", false, 0, relocInfo::none }, // Memory 166 { HalfFloatBot, T_SHORT, "halffloat_top", false, Op_RegF, relocInfo::none }, // HalfFloatTop 167 { HalfFloatCon, T_SHORT, "hfcon:", false, Op_RegF, relocInfo::none }, // HalfFloatCon 168 { HalfFloatTop, T_SHORT, "short", false, Op_RegF, relocInfo::none }, // HalfFloatBot 169 { FloatBot, T_FLOAT, "float_top", false, Op_RegF, relocInfo::none }, // FloatTop 170 { FloatCon, T_FLOAT, "ftcon:", false, Op_RegF, relocInfo::none }, // FloatCon 171 { FloatTop, T_FLOAT, "float", false, Op_RegF, relocInfo::none }, // FloatBot 172 { DoubleBot, T_DOUBLE, "double_top", false, Op_RegD, relocInfo::none }, // DoubleTop 173 { DoubleCon, T_DOUBLE, "dblcon:", false, Op_RegD, relocInfo::none }, // DoubleCon 174 { DoubleTop, T_DOUBLE, "double", false, Op_RegD, relocInfo::none }, // DoubleBot 175 { Top, T_ILLEGAL, "bottom", false, 0, relocInfo::none } // Bottom 176 }; 177 178 // Map ideal registers (machine types) to ideal types 179 const Type *Type::mreg2type[_last_machine_leaf]; 180 181 // Map basic types to canonical Type* pointers. 182 const Type* Type:: _const_basic_type[T_CONFLICT+1]; 183 184 // Map basic types to constant-zero Types. 185 const Type* Type:: _zero_type[T_CONFLICT+1]; 186 187 // Map basic types to array-body alias types. 188 const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1]; 189 const TypeInterfaces* TypeAryPtr::_array_interfaces = nullptr; 190 const TypeInterfaces* TypeAryKlassPtr::_array_interfaces = nullptr; 191 192 //============================================================================= 193 // Convenience common pre-built types. 194 const Type *Type::ABIO; // State-of-machine only 195 const Type *Type::BOTTOM; // All values 196 const Type *Type::CONTROL; // Control only 197 const Type *Type::DOUBLE; // All doubles 198 const Type *Type::HALF_FLOAT; // All half floats 199 const Type *Type::FLOAT; // All floats 200 const Type *Type::HALF; // Placeholder half of doublewide type 201 const Type *Type::MEMORY; // Abstract store only 202 const Type *Type::RETURN_ADDRESS; 203 const Type *Type::TOP; // No values in set 204 205 //------------------------------get_const_type--------------------------- 206 const Type* Type::get_const_type(ciType* type, InterfaceHandling interface_handling) { 207 if (type == nullptr) { 208 return nullptr; 209 } else if (type->is_primitive_type()) { 210 return get_const_basic_type(type->basic_type()); 211 } else { 212 return TypeOopPtr::make_from_klass(type->as_klass(), interface_handling); 213 } 214 } 215 216 //---------------------------array_element_basic_type--------------------------------- 217 // Mapping to the array element's basic type. 218 BasicType Type::array_element_basic_type() const { 219 BasicType bt = basic_type(); 220 if (bt == T_INT) { 221 if (this == TypeInt::INT) return T_INT; 222 if (this == TypeInt::CHAR) return T_CHAR; 223 if (this == TypeInt::BYTE) return T_BYTE; 224 if (this == TypeInt::BOOL) return T_BOOLEAN; 225 if (this == TypeInt::SHORT) return T_SHORT; 226 return T_VOID; 227 } 228 return bt; 229 } 230 231 // For two instance arrays of same dimension, return the base element types. 232 // Otherwise or if the arrays have different dimensions, return null. 233 void Type::get_arrays_base_elements(const Type *a1, const Type *a2, 234 const TypeInstPtr **e1, const TypeInstPtr **e2) { 235 236 if (e1) *e1 = nullptr; 237 if (e2) *e2 = nullptr; 238 const TypeAryPtr* a1tap = (a1 == nullptr) ? nullptr : a1->isa_aryptr(); 239 const TypeAryPtr* a2tap = (a2 == nullptr) ? nullptr : a2->isa_aryptr(); 240 241 if (a1tap != nullptr && a2tap != nullptr) { 242 // Handle multidimensional arrays 243 const TypePtr* a1tp = a1tap->elem()->make_ptr(); 244 const TypePtr* a2tp = a2tap->elem()->make_ptr(); 245 while (a1tp && a1tp->isa_aryptr() && a2tp && a2tp->isa_aryptr()) { 246 a1tap = a1tp->is_aryptr(); 247 a2tap = a2tp->is_aryptr(); 248 a1tp = a1tap->elem()->make_ptr(); 249 a2tp = a2tap->elem()->make_ptr(); 250 } 251 if (a1tp && a1tp->isa_instptr() && a2tp && a2tp->isa_instptr()) { 252 if (e1) *e1 = a1tp->is_instptr(); 253 if (e2) *e2 = a2tp->is_instptr(); 254 } 255 } 256 } 257 258 //---------------------------get_typeflow_type--------------------------------- 259 // Import a type produced by ciTypeFlow. 260 const Type* Type::get_typeflow_type(ciType* type) { 261 switch (type->basic_type()) { 262 263 case ciTypeFlow::StateVector::T_BOTTOM: 264 assert(type == ciTypeFlow::StateVector::bottom_type(), ""); 265 return Type::BOTTOM; 266 267 case ciTypeFlow::StateVector::T_TOP: 268 assert(type == ciTypeFlow::StateVector::top_type(), ""); 269 return Type::TOP; 270 271 case ciTypeFlow::StateVector::T_NULL: 272 assert(type == ciTypeFlow::StateVector::null_type(), ""); 273 return TypePtr::NULL_PTR; 274 275 case ciTypeFlow::StateVector::T_LONG2: 276 // The ciTypeFlow pass pushes a long, then the half. 277 // We do the same. 278 assert(type == ciTypeFlow::StateVector::long2_type(), ""); 279 return TypeInt::TOP; 280 281 case ciTypeFlow::StateVector::T_DOUBLE2: 282 // The ciTypeFlow pass pushes double, then the half. 283 // Our convention is the same. 284 assert(type == ciTypeFlow::StateVector::double2_type(), ""); 285 return Type::TOP; 286 287 case T_ADDRESS: 288 assert(type->is_return_address(), ""); 289 return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci()); 290 291 case T_OBJECT: 292 return Type::get_const_type(type->unwrap())->join_speculative(type->is_null_free() ? TypePtr::NOTNULL : TypePtr::BOTTOM); 293 294 default: 295 // make sure we did not mix up the cases: 296 assert(type != ciTypeFlow::StateVector::bottom_type(), ""); 297 assert(type != ciTypeFlow::StateVector::top_type(), ""); 298 assert(type != ciTypeFlow::StateVector::null_type(), ""); 299 assert(type != ciTypeFlow::StateVector::long2_type(), ""); 300 assert(type != ciTypeFlow::StateVector::double2_type(), ""); 301 assert(!type->is_return_address(), ""); 302 303 return Type::get_const_type(type); 304 } 305 } 306 307 308 //-----------------------make_from_constant------------------------------------ 309 const Type* Type::make_from_constant(ciConstant constant, bool require_constant, 310 int stable_dimension, bool is_narrow_oop, 311 bool is_autobox_cache) { 312 switch (constant.basic_type()) { 313 case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); 314 case T_CHAR: return TypeInt::make(constant.as_char()); 315 case T_BYTE: return TypeInt::make(constant.as_byte()); 316 case T_SHORT: return TypeInt::make(constant.as_short()); 317 case T_INT: return TypeInt::make(constant.as_int()); 318 case T_LONG: return TypeLong::make(constant.as_long()); 319 case T_FLOAT: return TypeF::make(constant.as_float()); 320 case T_DOUBLE: return TypeD::make(constant.as_double()); 321 case T_ARRAY: 322 case T_OBJECT: { 323 const Type* con_type = nullptr; 324 ciObject* oop_constant = constant.as_object(); 325 if (oop_constant->is_null_object()) { 326 con_type = Type::get_zero_type(T_OBJECT); 327 } else { 328 guarantee(require_constant || oop_constant->should_be_constant(), "con_type must get computed"); 329 con_type = TypeOopPtr::make_from_constant(oop_constant, require_constant); 330 if (Compile::current()->eliminate_boxing() && is_autobox_cache) { 331 con_type = con_type->is_aryptr()->cast_to_autobox_cache(); 332 } 333 if (stable_dimension > 0) { 334 assert(FoldStableValues, "sanity"); 335 assert(!con_type->is_zero_type(), "default value for stable field"); 336 con_type = con_type->is_aryptr()->cast_to_stable(true, stable_dimension); 337 } 338 } 339 if (is_narrow_oop) { 340 con_type = con_type->make_narrowoop(); 341 } 342 return con_type; 343 } 344 case T_ILLEGAL: 345 // Invalid ciConstant returned due to OutOfMemoryError in the CI 346 assert(Compile::current()->env()->failing(), "otherwise should not see this"); 347 return nullptr; 348 default: 349 // Fall through to failure 350 return nullptr; 351 } 352 } 353 354 static ciConstant check_mismatched_access(ciConstant con, BasicType loadbt, bool is_unsigned) { 355 BasicType conbt = con.basic_type(); 356 switch (conbt) { 357 case T_BOOLEAN: conbt = T_BYTE; break; 358 case T_ARRAY: conbt = T_OBJECT; break; 359 default: break; 360 } 361 switch (loadbt) { 362 case T_BOOLEAN: loadbt = T_BYTE; break; 363 case T_NARROWOOP: loadbt = T_OBJECT; break; 364 case T_ARRAY: loadbt = T_OBJECT; break; 365 case T_ADDRESS: loadbt = T_OBJECT; break; 366 default: break; 367 } 368 if (conbt == loadbt) { 369 if (is_unsigned && conbt == T_BYTE) { 370 // LoadB (T_BYTE) with a small mask (<=8-bit) is converted to LoadUB (T_BYTE). 371 return ciConstant(T_INT, con.as_int() & 0xFF); 372 } else { 373 return con; 374 } 375 } 376 if (conbt == T_SHORT && loadbt == T_CHAR) { 377 // LoadS (T_SHORT) with a small mask (<=16-bit) is converted to LoadUS (T_CHAR). 378 return ciConstant(T_INT, con.as_int() & 0xFFFF); 379 } 380 return ciConstant(); // T_ILLEGAL 381 } 382 383 static const Type* make_constant_from_non_flat_array_element(ciArray* array, int off, int stable_dimension, 384 BasicType loadbt, bool is_unsigned_load) { 385 // Decode the results of GraphKit::array_element_address. 386 ciConstant element_value = array->element_value_by_offset(off); 387 if (element_value.basic_type() == T_ILLEGAL) { 388 return nullptr; // wrong offset 389 } 390 ciConstant con = check_mismatched_access(element_value, loadbt, is_unsigned_load); 391 392 assert(con.basic_type() != T_ILLEGAL, "elembt=%s; loadbt=%s; unsigned=%d", 393 type2name(element_value.basic_type()), type2name(loadbt), is_unsigned_load); 394 395 if (con.is_valid() && // not a mismatched access 396 !con.is_null_or_zero()) { // not a default value 397 bool is_narrow_oop = (loadbt == T_NARROWOOP); 398 return Type::make_from_constant(con, /*require_constant=*/true, stable_dimension, is_narrow_oop, /*is_autobox_cache=*/false); 399 } 400 return nullptr; 401 } 402 403 static const Type* make_constant_from_flat_array_element(ciFlatArray* array, int off, int field_offset, int stable_dimension, 404 BasicType loadbt, bool is_unsigned_load) { 405 if (!array->is_null_free()) { 406 ciConstant nm_value = array->null_marker_of_element_by_offset(off); 407 if (!nm_value.is_valid() || !nm_value.as_boolean()) { 408 return nullptr; 409 } 410 } 411 ciConstant element_value = array->field_value_by_offset(off + field_offset); 412 if (element_value.basic_type() == T_ILLEGAL) { 413 return nullptr; // wrong offset 414 } 415 ciConstant con = check_mismatched_access(element_value, loadbt, is_unsigned_load); 416 417 assert(con.basic_type() != T_ILLEGAL, "elembt=%s; loadbt=%s; unsigned=%d", 418 type2name(element_value.basic_type()), type2name(loadbt), is_unsigned_load); 419 420 if (con.is_valid()) { // not a mismatched access 421 bool is_narrow_oop = (loadbt == T_NARROWOOP); 422 return Type::make_from_constant(con, /*require_constant=*/true, stable_dimension, is_narrow_oop, /*is_autobox_cache=*/false); 423 } 424 return nullptr; 425 } 426 427 // Try to constant-fold a stable array element. 428 const Type* Type::make_constant_from_array_element(ciArray* array, int off, int field_offset, int stable_dimension, 429 BasicType loadbt, bool is_unsigned_load) { 430 if (array->is_flat()) { 431 return make_constant_from_flat_array_element(array->as_flat_array(), off, field_offset, stable_dimension, loadbt, is_unsigned_load); 432 } 433 return make_constant_from_non_flat_array_element(array, off, stable_dimension, loadbt, is_unsigned_load); 434 } 435 436 const Type* Type::make_constant_from_field(ciInstance* holder, int off, bool is_unsigned_load, BasicType loadbt) { 437 ciField* field; 438 ciType* type = holder->java_mirror_type(); 439 if (type != nullptr && type->is_instance_klass() && off >= InstanceMirrorKlass::offset_of_static_fields()) { 440 // Static field 441 field = type->as_instance_klass()->get_field_by_offset(off, /*is_static=*/true); 442 } else { 443 // Instance field 444 field = holder->klass()->as_instance_klass()->get_field_by_offset(off, /*is_static=*/false); 445 } 446 if (field == nullptr) { 447 return nullptr; // Wrong offset 448 } 449 return Type::make_constant_from_field(field, holder, loadbt, is_unsigned_load); 450 } 451 452 const Type* Type::make_constant_from_field(ciField* field, ciInstance* holder, 453 BasicType loadbt, bool is_unsigned_load) { 454 if (!field->is_constant()) { 455 return nullptr; // Non-constant field 456 } 457 ciConstant field_value; 458 if (field->is_static()) { 459 // final static field 460 field_value = field->constant_value(); 461 } else if (holder != nullptr) { 462 // final or stable non-static field 463 // Treat final non-static fields of trusted classes (classes in 464 // java.lang.invoke and sun.invoke packages and subpackages) as 465 // compile time constants. 466 field_value = field->constant_value_of(holder); 467 } 468 if (!field_value.is_valid()) { 469 return nullptr; // Not a constant 470 } 471 472 ciConstant con = check_mismatched_access(field_value, loadbt, is_unsigned_load); 473 474 assert(con.is_valid(), "elembt=%s; loadbt=%s; unsigned=%d", 475 type2name(field_value.basic_type()), type2name(loadbt), is_unsigned_load); 476 477 bool is_stable_array = FoldStableValues && field->is_stable() && field->type()->is_array_klass(); 478 int stable_dimension = (is_stable_array ? field->type()->as_array_klass()->dimension() : 0); 479 bool is_narrow_oop = (loadbt == T_NARROWOOP); 480 481 const Type* con_type = make_from_constant(con, /*require_constant=*/ true, 482 stable_dimension, is_narrow_oop, 483 field->is_autobox_cache()); 484 if (con_type != nullptr && field->is_call_site_target()) { 485 ciCallSite* call_site = holder->as_call_site(); 486 if (!call_site->is_fully_initialized_constant_call_site()) { 487 ciMethodHandle* target = con.as_object()->as_method_handle(); 488 Compile::current()->dependencies()->assert_call_site_target_value(call_site, target); 489 } 490 } 491 return con_type; 492 } 493 494 //------------------------------make------------------------------------------- 495 // Create a simple Type, with default empty symbol sets. Then hashcons it 496 // and look for an existing copy in the type dictionary. 497 const Type *Type::make( enum TYPES t ) { 498 return (new Type(t))->hashcons(); 499 } 500 501 //------------------------------cmp-------------------------------------------- 502 bool Type::equals(const Type* t1, const Type* t2) { 503 if (t1->_base != t2->_base) { 504 return false; // Missed badly 505 } 506 507 assert(t1 != t2 || t1->eq(t2), "eq must be reflexive"); 508 return t1->eq(t2); 509 } 510 511 const Type* Type::maybe_remove_speculative(bool include_speculative) const { 512 if (!include_speculative) { 513 return remove_speculative(); 514 } 515 return this; 516 } 517 518 //------------------------------hash------------------------------------------- 519 int Type::uhash( const Type *const t ) { 520 return (int)t->hash(); 521 } 522 523 #define POSITIVE_INFINITE_F 0x7f800000 // hex representation for IEEE 754 single precision positive infinite 524 #define POSITIVE_INFINITE_D 0x7ff0000000000000 // hex representation for IEEE 754 double precision positive infinite 525 526 //--------------------------Initialize_shared---------------------------------- 527 void Type::Initialize_shared(Compile* current) { 528 // This method does not need to be locked because the first system 529 // compilations (stub compilations) occur serially. If they are 530 // changed to proceed in parallel, then this section will need 531 // locking. 532 533 Arena* save = current->type_arena(); 534 Arena* shared_type_arena = new (mtCompiler)Arena(mtCompiler, Arena::Tag::tag_type); 535 536 current->set_type_arena(shared_type_arena); 537 538 // Map the boolean result of Type::equals into a comparator result that CmpKey expects. 539 CmpKey type_cmp = [](const void* t1, const void* t2) -> int32_t { 540 return Type::equals((Type*) t1, (Type*) t2) ? 0 : 1; 541 }; 542 543 _shared_type_dict = new (shared_type_arena) Dict(type_cmp, (Hash) Type::uhash, shared_type_arena, 128); 544 current->set_type_dict(_shared_type_dict); 545 546 // Make shared pre-built types. 547 CONTROL = make(Control); // Control only 548 TOP = make(Top); // No values in set 549 MEMORY = make(Memory); // Abstract store only 550 ABIO = make(Abio); // State-of-machine only 551 RETURN_ADDRESS=make(Return_Address); 552 FLOAT = make(FloatBot); // All floats 553 HALF_FLOAT = make(HalfFloatBot); // All half floats 554 DOUBLE = make(DoubleBot); // All doubles 555 BOTTOM = make(Bottom); // Everything 556 HALF = make(Half); // Placeholder half of doublewide type 557 558 TypeF::MAX = TypeF::make(max_jfloat); // Float MAX 559 TypeF::MIN = TypeF::make(min_jfloat); // Float MIN 560 TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero) 561 TypeF::ONE = TypeF::make(1.0); // Float 1 562 TypeF::POS_INF = TypeF::make(jfloat_cast(POSITIVE_INFINITE_F)); 563 TypeF::NEG_INF = TypeF::make(-jfloat_cast(POSITIVE_INFINITE_F)); 564 565 TypeH::MAX = TypeH::make(max_jfloat16); // HalfFloat MAX 566 TypeH::MIN = TypeH::make(min_jfloat16); // HalfFloat MIN 567 TypeH::ZERO = TypeH::make((jshort)0); // HalfFloat 0 (positive zero) 568 TypeH::ONE = TypeH::make(one_jfloat16); // HalfFloat 1 569 TypeH::POS_INF = TypeH::make(pos_inf_jfloat16); 570 TypeH::NEG_INF = TypeH::make(neg_inf_jfloat16); 571 572 TypeD::MAX = TypeD::make(max_jdouble); // Double MAX 573 TypeD::MIN = TypeD::make(min_jdouble); // Double MIN 574 TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero) 575 TypeD::ONE = TypeD::make(1.0); // Double 1 576 TypeD::POS_INF = TypeD::make(jdouble_cast(POSITIVE_INFINITE_D)); 577 TypeD::NEG_INF = TypeD::make(-jdouble_cast(POSITIVE_INFINITE_D)); 578 579 TypeInt::MAX = TypeInt::make(max_jint); // Int MAX 580 TypeInt::MIN = TypeInt::make(min_jint); // Int MIN 581 TypeInt::MINUS_1 = TypeInt::make(-1); // -1 582 TypeInt::ZERO = TypeInt::make( 0); // 0 583 TypeInt::ONE = TypeInt::make( 1); // 1 584 TypeInt::BOOL = TypeInt::make( 0, 1, WidenMin); // 0 or 1, FALSE or TRUE. 585 TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes 586 TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1 587 TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE 588 TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO 589 TypeInt::CC_NE = TypeInt::make_or_top(TypeIntPrototype<jint, juint>{{-1, 1}, {1, max_juint}, {0, 1}}, WidenMin)->is_int(); 590 TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin); 591 TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL 592 TypeInt::BYTE = TypeInt::make(-128, 127, WidenMin); // Bytes 593 TypeInt::UBYTE = TypeInt::make(0, 255, WidenMin); // Unsigned Bytes 594 TypeInt::CHAR = TypeInt::make(0, 65535, WidenMin); // Java chars 595 TypeInt::SHORT = TypeInt::make(-32768, 32767, WidenMin); // Java shorts 596 TypeInt::NON_ZERO = TypeInt::make_or_top(TypeIntPrototype<jint, juint>{{min_jint, max_jint}, {1, max_juint}, {0, 0}}, WidenMin)->is_int(); 597 TypeInt::POS = TypeInt::make(0, max_jint, WidenMin); // Non-neg values 598 TypeInt::POS1 = TypeInt::make(1, max_jint, WidenMin); // Positive values 599 TypeInt::INT = TypeInt::make(min_jint, max_jint, WidenMax); // 32-bit integers 600 TypeInt::SYMINT = TypeInt::make(-max_jint, max_jint, WidenMin); // symmetric range 601 TypeInt::TYPE_DOMAIN = TypeInt::INT; 602 // CmpL is overloaded both as the bytecode computation returning 603 // a trinary (-1, 0, +1) integer result AND as an efficient long 604 // compare returning optimizer ideal-type flags. 605 assert(TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" ); 606 assert(TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" ); 607 assert(TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" ); 608 assert(TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" ); 609 610 TypeLong::MAX = TypeLong::make(max_jlong); // Long MAX 611 TypeLong::MIN = TypeLong::make(min_jlong); // Long MIN 612 TypeLong::MINUS_1 = TypeLong::make(-1); // -1 613 TypeLong::ZERO = TypeLong::make( 0); // 0 614 TypeLong::ONE = TypeLong::make( 1); // 1 615 TypeLong::NON_ZERO = TypeLong::make_or_top(TypeIntPrototype<jlong, julong>{{min_jlong, max_jlong}, {1, max_julong}, {0, 0}}, WidenMin)->is_long(); 616 TypeLong::POS = TypeLong::make(0, max_jlong, WidenMin); // Non-neg values 617 TypeLong::NEG = TypeLong::make(min_jlong, -1, WidenMin); 618 TypeLong::LONG = TypeLong::make(min_jlong, max_jlong, WidenMax); // 64-bit integers 619 TypeLong::INT = TypeLong::make((jlong)min_jint, (jlong)max_jint,WidenMin); 620 TypeLong::UINT = TypeLong::make(0, (jlong)max_juint, WidenMin); 621 TypeLong::TYPE_DOMAIN = TypeLong::LONG; 622 623 const Type **fboth =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); 624 fboth[0] = Type::CONTROL; 625 fboth[1] = Type::CONTROL; 626 TypeTuple::IFBOTH = TypeTuple::make( 2, fboth ); 627 628 const Type **ffalse =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); 629 ffalse[0] = Type::CONTROL; 630 ffalse[1] = Type::TOP; 631 TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse ); 632 633 const Type **fneither =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); 634 fneither[0] = Type::TOP; 635 fneither[1] = Type::TOP; 636 TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither ); 637 638 const Type **ftrue =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); 639 ftrue[0] = Type::TOP; 640 ftrue[1] = Type::CONTROL; 641 TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue ); 642 643 const Type **floop =(const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); 644 floop[0] = Type::CONTROL; 645 floop[1] = TypeInt::INT; 646 TypeTuple::LOOPBODY = TypeTuple::make( 2, floop ); 647 648 TypePtr::NULL_PTR= TypePtr::make(AnyPtr, TypePtr::Null, Offset(0)); 649 TypePtr::NOTNULL = TypePtr::make(AnyPtr, TypePtr::NotNull, Offset::bottom); 650 TypePtr::BOTTOM = TypePtr::make(AnyPtr, TypePtr::BotPTR, Offset::bottom); 651 652 TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR ); 653 TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull ); 654 655 const Type **fmembar = TypeTuple::fields(0); 656 TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar); 657 658 const Type **fsc = (const Type**)shared_type_arena->AmallocWords(2*sizeof(Type*)); 659 fsc[0] = TypeInt::CC; 660 fsc[1] = Type::MEMORY; 661 TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc); 662 663 TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass()); 664 TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass()); 665 TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass()); 666 TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), 667 false, nullptr, Offset(oopDesc::mark_offset_in_bytes())); 668 TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), 669 false, nullptr, Offset(oopDesc::klass_offset_in_bytes())); 670 TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, Offset::bottom, TypeOopPtr::InstanceBot); 671 672 TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, nullptr, Offset::bottom); 673 674 TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR ); 675 TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM ); 676 677 TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR ); 678 679 mreg2type[Op_Node] = Type::BOTTOM; 680 mreg2type[Op_Set ] = nullptr; 681 mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM; 682 mreg2type[Op_RegI] = TypeInt::INT; 683 mreg2type[Op_RegP] = TypePtr::BOTTOM; 684 mreg2type[Op_RegF] = Type::FLOAT; 685 mreg2type[Op_RegD] = Type::DOUBLE; 686 mreg2type[Op_RegL] = TypeLong::LONG; 687 mreg2type[Op_RegFlags] = TypeInt::CC; 688 689 GrowableArray<ciInstanceKlass*> array_interfaces; 690 array_interfaces.push(current->env()->Cloneable_klass()); 691 array_interfaces.push(current->env()->Serializable_klass()); 692 TypeAryPtr::_array_interfaces = TypeInterfaces::make(&array_interfaces); 693 TypeAryKlassPtr::_array_interfaces = TypeAryPtr::_array_interfaces; 694 695 TypeAryPtr::BOTTOM = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::BOTTOM, TypeInt::POS, false, false, false, false, false), nullptr, false, Offset::bottom); 696 TypeAryPtr::RANGE = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS, false, false, false, false, false), nullptr /* current->env()->Object_klass() */, false, Offset(arrayOopDesc::length_offset_in_bytes())); 697 698 TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS, false, false, false, false, false), nullptr /*ciArrayKlass::make(o)*/, false, Offset::bottom); 699 700 #ifdef _LP64 701 if (UseCompressedOops) { 702 assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop"); 703 TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS; 704 } else 705 #endif 706 { 707 // There is no shared klass for Object[]. See note in TypeAryPtr::klass(). 708 TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS, false, false, false, false, false), nullptr /*ciArrayKlass::make(o)*/, false, Offset::bottom); 709 } 710 TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_BYTE), true, Offset::bottom); 711 TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_SHORT), true, Offset::bottom); 712 TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_CHAR), true, Offset::bottom); 713 TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_INT), true, Offset::bottom); 714 TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_LONG), true, Offset::bottom); 715 TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_FLOAT), true, Offset::bottom); 716 TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS, false, false, true, true, true), ciTypeArrayKlass::make(T_DOUBLE), true, Offset::bottom); 717 TypeAryPtr::INLINES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS, /* stable= */ false, /* flat= */ true, false, false, false), nullptr, false, Offset::bottom); 718 719 // Nobody should ask _array_body_type[T_NARROWOOP]. Use null as assert. 720 TypeAryPtr::_array_body_type[T_NARROWOOP] = nullptr; 721 TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS; 722 TypeAryPtr::_array_body_type[T_FLAT_ELEMENT] = TypeAryPtr::OOPS; 723 TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays 724 TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES; 725 TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array 726 TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS; 727 TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS; 728 TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS; 729 TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS; 730 TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS; 731 TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES; 732 733 TypeInstKlassPtr::OBJECT = TypeInstKlassPtr::make(TypePtr::NotNull, current->env()->Object_klass(), Offset(0)); 734 TypeInstKlassPtr::OBJECT_OR_NULL = TypeInstKlassPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), Offset(0)); 735 736 const Type **fi2c = TypeTuple::fields(2); 737 fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method* 738 fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer 739 TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c); 740 741 const Type **intpair = TypeTuple::fields(2); 742 intpair[0] = TypeInt::INT; 743 intpair[1] = TypeInt::INT; 744 TypeTuple::INT_PAIR = TypeTuple::make(2, intpair); 745 746 const Type **longpair = TypeTuple::fields(2); 747 longpair[0] = TypeLong::LONG; 748 longpair[1] = TypeLong::LONG; 749 TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair); 750 751 const Type **intccpair = TypeTuple::fields(2); 752 intccpair[0] = TypeInt::INT; 753 intccpair[1] = TypeInt::CC; 754 TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair); 755 756 const Type **longccpair = TypeTuple::fields(2); 757 longccpair[0] = TypeLong::LONG; 758 longccpair[1] = TypeInt::CC; 759 TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair); 760 761 _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM; 762 _const_basic_type[T_NARROWKLASS] = Type::BOTTOM; 763 _const_basic_type[T_BOOLEAN] = TypeInt::BOOL; 764 _const_basic_type[T_CHAR] = TypeInt::CHAR; 765 _const_basic_type[T_BYTE] = TypeInt::BYTE; 766 _const_basic_type[T_SHORT] = TypeInt::SHORT; 767 _const_basic_type[T_INT] = TypeInt::INT; 768 _const_basic_type[T_LONG] = TypeLong::LONG; 769 _const_basic_type[T_FLOAT] = Type::FLOAT; 770 _const_basic_type[T_DOUBLE] = Type::DOUBLE; 771 _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM; 772 _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays 773 _const_basic_type[T_FLAT_ELEMENT] = TypeInstPtr::BOTTOM; 774 _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way 775 _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs 776 _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not? 777 778 _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR; 779 _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR; 780 _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0 781 _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0 782 _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0 783 _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0 784 _zero_type[T_INT] = TypeInt::ZERO; 785 _zero_type[T_LONG] = TypeLong::ZERO; 786 _zero_type[T_FLOAT] = TypeF::ZERO; 787 _zero_type[T_DOUBLE] = TypeD::ZERO; 788 _zero_type[T_OBJECT] = TypePtr::NULL_PTR; 789 _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop 790 _zero_type[T_FLAT_ELEMENT] = TypePtr::NULL_PTR; 791 _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null 792 _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all 793 794 // get_zero_type() should not happen for T_CONFLICT 795 _zero_type[T_CONFLICT]= nullptr; 796 797 TypeVect::VECTMASK = (TypeVect*)(new TypeVectMask(T_BOOLEAN, MaxVectorSize))->hashcons(); 798 mreg2type[Op_RegVectMask] = TypeVect::VECTMASK; 799 800 if (Matcher::supports_scalable_vector()) { 801 TypeVect::VECTA = TypeVect::make(T_BYTE, Matcher::scalable_vector_reg_size(T_BYTE)); 802 } 803 804 // Vector predefined types, it needs initialized _const_basic_type[]. 805 if (Matcher::vector_size_supported(T_BYTE, 4)) { 806 TypeVect::VECTS = TypeVect::make(T_BYTE, 4); 807 } 808 if (Matcher::vector_size_supported(T_FLOAT, 2)) { 809 TypeVect::VECTD = TypeVect::make(T_FLOAT, 2); 810 } 811 if (Matcher::vector_size_supported(T_FLOAT, 4)) { 812 TypeVect::VECTX = TypeVect::make(T_FLOAT, 4); 813 } 814 if (Matcher::vector_size_supported(T_FLOAT, 8)) { 815 TypeVect::VECTY = TypeVect::make(T_FLOAT, 8); 816 } 817 if (Matcher::vector_size_supported(T_FLOAT, 16)) { 818 TypeVect::VECTZ = TypeVect::make(T_FLOAT, 16); 819 } 820 821 mreg2type[Op_VecA] = TypeVect::VECTA; 822 mreg2type[Op_VecS] = TypeVect::VECTS; 823 mreg2type[Op_VecD] = TypeVect::VECTD; 824 mreg2type[Op_VecX] = TypeVect::VECTX; 825 mreg2type[Op_VecY] = TypeVect::VECTY; 826 mreg2type[Op_VecZ] = TypeVect::VECTZ; 827 828 #if INCLUDE_SHENANDOAHGC 829 ShenandoahBarrierSetC2::init(); 830 #endif //INCLUDE_SHENANDOAHGC 831 832 BarrierSetC2::make_clone_type(); 833 LockNode::initialize_lock_Type(); 834 ArrayCopyNode::initialize_arraycopy_Type(); 835 OptoRuntime::initialize_types(); 836 837 // Restore working type arena. 838 current->set_type_arena(save); 839 current->set_type_dict(nullptr); 840 } 841 842 //------------------------------Initialize------------------------------------- 843 void Type::Initialize(Compile* current) { 844 assert(current->type_arena() != nullptr, "must have created type arena"); 845 846 if (_shared_type_dict == nullptr) { 847 Initialize_shared(current); 848 } 849 850 Arena* type_arena = current->type_arena(); 851 852 // Create the hash-cons'ing dictionary with top-level storage allocation 853 Dict *tdic = new (type_arena) Dict(*_shared_type_dict, type_arena); 854 current->set_type_dict(tdic); 855 } 856 857 //------------------------------hashcons--------------------------------------- 858 // Do the hash-cons trick. If the Type already exists in the type table, 859 // delete the current Type and return the existing Type. Otherwise stick the 860 // current Type in the Type table. 861 const Type *Type::hashcons(void) { 862 DEBUG_ONLY(base()); // Check the assertion in Type::base(). 863 // Look up the Type in the Type dictionary 864 Dict *tdic = type_dict(); 865 Type* old = (Type*)(tdic->Insert(this, this, false)); 866 if( old ) { // Pre-existing Type? 867 if( old != this ) // Yes, this guy is not the pre-existing? 868 delete this; // Yes, Nuke this guy 869 assert( old->_dual, "" ); 870 return old; // Return pre-existing 871 } 872 873 // Every type has a dual (to make my lattice symmetric). 874 // Since we just discovered a new Type, compute its dual right now. 875 assert( !_dual, "" ); // No dual yet 876 _dual = xdual(); // Compute the dual 877 if (equals(this, _dual)) { // Handle self-symmetric 878 if (_dual != this) { 879 delete _dual; 880 _dual = this; 881 } 882 return this; 883 } 884 assert( !_dual->_dual, "" ); // No reverse dual yet 885 assert( !(*tdic)[_dual], "" ); // Dual not in type system either 886 // New Type, insert into Type table 887 tdic->Insert((void*)_dual,(void*)_dual); 888 ((Type*)_dual)->_dual = this; // Finish up being symmetric 889 #ifdef ASSERT 890 Type *dual_dual = (Type*)_dual->xdual(); 891 assert( eq(dual_dual), "xdual(xdual()) should be identity" ); 892 delete dual_dual; 893 #endif 894 return this; // Return new Type 895 } 896 897 //------------------------------eq--------------------------------------------- 898 // Structural equality check for Type representations 899 bool Type::eq( const Type * ) const { 900 return true; // Nothing else can go wrong 901 } 902 903 //------------------------------hash------------------------------------------- 904 // Type-specific hashing function. 905 uint Type::hash(void) const { 906 return _base; 907 } 908 909 //------------------------------is_finite-------------------------------------- 910 // Has a finite value 911 bool Type::is_finite() const { 912 return false; 913 } 914 915 //------------------------------is_nan----------------------------------------- 916 // Is not a number (NaN) 917 bool Type::is_nan() const { 918 return false; 919 } 920 921 #ifdef ASSERT 922 class VerifyMeet; 923 class VerifyMeetResult : public ArenaObj { 924 friend class VerifyMeet; 925 friend class Type; 926 private: 927 class VerifyMeetResultEntry { 928 private: 929 const Type* _in1; 930 const Type* _in2; 931 const Type* _res; 932 public: 933 VerifyMeetResultEntry(const Type* in1, const Type* in2, const Type* res): 934 _in1(in1), _in2(in2), _res(res) { 935 } 936 VerifyMeetResultEntry(): 937 _in1(nullptr), _in2(nullptr), _res(nullptr) { 938 } 939 940 bool operator==(const VerifyMeetResultEntry& rhs) const { 941 return _in1 == rhs._in1 && 942 _in2 == rhs._in2 && 943 _res == rhs._res; 944 } 945 946 bool operator!=(const VerifyMeetResultEntry& rhs) const { 947 return !(rhs == *this); 948 } 949 950 static int compare(const VerifyMeetResultEntry& v1, const VerifyMeetResultEntry& v2) { 951 if ((intptr_t) v1._in1 < (intptr_t) v2._in1) { 952 return -1; 953 } else if (v1._in1 == v2._in1) { 954 if ((intptr_t) v1._in2 < (intptr_t) v2._in2) { 955 return -1; 956 } else if (v1._in2 == v2._in2) { 957 assert(v1._res == v2._res || v1._res == nullptr || v2._res == nullptr, "same inputs should lead to same result"); 958 return 0; 959 } 960 return 1; 961 } 962 return 1; 963 } 964 const Type* res() const { return _res; } 965 }; 966 uint _depth; 967 GrowableArray<VerifyMeetResultEntry> _cache; 968 969 // With verification code, the meet of A and B causes the computation of: 970 // 1- meet(A, B) 971 // 2- meet(B, A) 972 // 3- meet(dual(meet(A, B)), dual(A)) 973 // 4- meet(dual(meet(A, B)), dual(B)) 974 // 5- meet(dual(A), dual(B)) 975 // 6- meet(dual(B), dual(A)) 976 // 7- meet(dual(meet(dual(A), dual(B))), A) 977 // 8- meet(dual(meet(dual(A), dual(B))), B) 978 // 979 // In addition the meet of A[] and B[] requires the computation of the meet of A and B. 980 // 981 // The meet of A[] and B[] triggers the computation of: 982 // 1- meet(A[], B[][) 983 // 1.1- meet(A, B) 984 // 1.2- meet(B, A) 985 // 1.3- meet(dual(meet(A, B)), dual(A)) 986 // 1.4- meet(dual(meet(A, B)), dual(B)) 987 // 1.5- meet(dual(A), dual(B)) 988 // 1.6- meet(dual(B), dual(A)) 989 // 1.7- meet(dual(meet(dual(A), dual(B))), A) 990 // 1.8- meet(dual(meet(dual(A), dual(B))), B) 991 // 2- meet(B[], A[]) 992 // 2.1- meet(B, A) = 1.2 993 // 2.2- meet(A, B) = 1.1 994 // 2.3- meet(dual(meet(B, A)), dual(B)) = 1.4 995 // 2.4- meet(dual(meet(B, A)), dual(A)) = 1.3 996 // 2.5- meet(dual(B), dual(A)) = 1.6 997 // 2.6- meet(dual(A), dual(B)) = 1.5 998 // 2.7- meet(dual(meet(dual(B), dual(A))), B) = 1.8 999 // 2.8- meet(dual(meet(dual(B), dual(A))), B) = 1.7 1000 // etc. 1001 // The number of meet operations performed grows exponentially with the number of dimensions of the arrays but the number 1002 // of different meet operations is linear in the number of dimensions. The function below caches meet results for the 1003 // duration of the meet at the root of the recursive calls. 1004 // 1005 const Type* meet(const Type* t1, const Type* t2) { 1006 bool found = false; 1007 const VerifyMeetResultEntry meet(t1, t2, nullptr); 1008 int pos = _cache.find_sorted<VerifyMeetResultEntry, VerifyMeetResultEntry::compare>(meet, found); 1009 const Type* res = nullptr; 1010 if (found) { 1011 res = _cache.at(pos).res(); 1012 } else { 1013 res = t1->xmeet(t2); 1014 _cache.insert_sorted<VerifyMeetResultEntry::compare>(VerifyMeetResultEntry(t1, t2, res)); 1015 found = false; 1016 _cache.find_sorted<VerifyMeetResultEntry, VerifyMeetResultEntry::compare>(meet, found); 1017 assert(found, "should be in table after it's added"); 1018 } 1019 return res; 1020 } 1021 1022 void add(const Type* t1, const Type* t2, const Type* res) { 1023 _cache.insert_sorted<VerifyMeetResultEntry::compare>(VerifyMeetResultEntry(t1, t2, res)); 1024 } 1025 1026 bool empty_cache() const { 1027 return _cache.length() == 0; 1028 } 1029 public: 1030 VerifyMeetResult(Compile* C) : 1031 _depth(0), _cache(C->comp_arena(), 2, 0, VerifyMeetResultEntry()) { 1032 } 1033 }; 1034 1035 void Type::assert_type_verify_empty() const { 1036 assert(Compile::current()->_type_verify == nullptr || Compile::current()->_type_verify->empty_cache(), "cache should have been discarded"); 1037 } 1038 1039 class VerifyMeet { 1040 private: 1041 Compile* _C; 1042 public: 1043 VerifyMeet(Compile* C) : _C(C) { 1044 if (C->_type_verify == nullptr) { 1045 C->_type_verify = new (C->comp_arena())VerifyMeetResult(C); 1046 } 1047 _C->_type_verify->_depth++; 1048 } 1049 1050 ~VerifyMeet() { 1051 assert(_C->_type_verify->_depth != 0, ""); 1052 _C->_type_verify->_depth--; 1053 if (_C->_type_verify->_depth == 0) { 1054 _C->_type_verify->_cache.trunc_to(0); 1055 } 1056 } 1057 1058 const Type* meet(const Type* t1, const Type* t2) const { 1059 return _C->_type_verify->meet(t1, t2); 1060 } 1061 1062 void add(const Type* t1, const Type* t2, const Type* res) const { 1063 _C->_type_verify->add(t1, t2, res); 1064 } 1065 }; 1066 1067 void Type::check_symmetrical(const Type* t, const Type* mt, const VerifyMeet& verify) const { 1068 Compile* C = Compile::current(); 1069 const Type* mt2 = verify.meet(t, this); 1070 1071 // Verify that: 1072 // this meet t == t meet this 1073 if (mt != mt2) { 1074 tty->print_cr("=== Meet Not Commutative ==="); 1075 tty->print("t = "); t->dump(); tty->cr(); 1076 tty->print("this = "); dump(); tty->cr(); 1077 tty->print("t meet this = "); mt2->dump(); tty->cr(); 1078 tty->print("this meet t = "); mt->dump(); tty->cr(); 1079 fatal("meet not commutative"); 1080 } 1081 const Type* dual_join = mt->_dual; 1082 const Type* t2t = verify.meet(dual_join,t->_dual); 1083 const Type* t2this = verify.meet(dual_join,this->_dual); 1084 1085 // Interface meet Oop is Not Symmetric: 1086 // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull 1087 // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull 1088 1089 // Verify that: 1090 // 1) mt_dual meet t_dual == t_dual 1091 // which corresponds to 1092 // !(t meet this) meet !t == 1093 // (!t join !this) meet !t == !t 1094 // 2) mt_dual meet this_dual == this_dual 1095 // which corresponds to 1096 // !(t meet this) meet !this == 1097 // (!t join !this) meet !this == !this 1098 if (t2t != t->_dual || t2this != this->_dual) { 1099 tty->print_cr("=== Meet Not Symmetric ==="); 1100 tty->print("t = "); t->dump(); tty->cr(); 1101 tty->print("this= "); dump(); tty->cr(); 1102 tty->print("mt=(t meet this)= "); mt->dump(); tty->cr(); 1103 1104 tty->print("t_dual= "); t->_dual->dump(); tty->cr(); 1105 tty->print("this_dual= "); _dual->dump(); tty->cr(); 1106 tty->print("mt_dual= "); mt->_dual->dump(); tty->cr(); 1107 1108 // 1) 1109 tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr(); 1110 // 2) 1111 tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr(); 1112 tty->cr(); 1113 tty->print_cr("Fail: "); 1114 if (t2t != t->_dual) { 1115 tty->print_cr("- mt_dual meet t_dual != t_dual"); 1116 } 1117 if (t2this != this->_dual) { 1118 tty->print_cr("- mt_dual meet this_dual != this_dual"); 1119 } 1120 tty->cr(); 1121 1122 fatal("meet not symmetric"); 1123 } 1124 } 1125 #endif 1126 1127 //------------------------------meet------------------------------------------- 1128 // Compute the MEET of two types. NOT virtual. It enforces that meet is 1129 // commutative and the lattice is symmetric. 1130 const Type *Type::meet_helper(const Type *t, bool include_speculative) const { 1131 if (isa_narrowoop() && t->isa_narrowoop()) { 1132 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); 1133 return result->make_narrowoop(); 1134 } 1135 if (isa_narrowklass() && t->isa_narrowklass()) { 1136 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); 1137 return result->make_narrowklass(); 1138 } 1139 1140 #ifdef ASSERT 1141 Compile* C = Compile::current(); 1142 VerifyMeet verify(C); 1143 #endif 1144 1145 const Type *this_t = maybe_remove_speculative(include_speculative); 1146 t = t->maybe_remove_speculative(include_speculative); 1147 1148 const Type *mt = this_t->xmeet(t); 1149 #ifdef ASSERT 1150 verify.add(this_t, t, mt); 1151 if (isa_narrowoop() || t->isa_narrowoop()) { 1152 return mt; 1153 } 1154 if (isa_narrowklass() || t->isa_narrowklass()) { 1155 return mt; 1156 } 1157 // TODO 8350865 This currently triggers a verification failure, the code around "// Even though MyValue is final" needs adjustments 1158 if ((this_t->isa_ptr() && this_t->is_ptr()->is_not_flat()) || 1159 (this_t->_dual->isa_ptr() && this_t->_dual->is_ptr()->is_not_flat())) return mt; 1160 this_t->check_symmetrical(t, mt, verify); 1161 const Type *mt_dual = verify.meet(this_t->_dual, t->_dual); 1162 this_t->_dual->check_symmetrical(t->_dual, mt_dual, verify); 1163 #endif 1164 return mt; 1165 } 1166 1167 //------------------------------xmeet------------------------------------------ 1168 // Compute the MEET of two types. It returns a new Type object. 1169 const Type *Type::xmeet( const Type *t ) const { 1170 // Perform a fast test for common case; meeting the same types together. 1171 if( this == t ) return this; // Meeting same type-rep? 1172 1173 // Meeting TOP with anything? 1174 if( _base == Top ) return t; 1175 1176 // Meeting BOTTOM with anything? 1177 if( _base == Bottom ) return BOTTOM; 1178 1179 // Current "this->_base" is one of: Bad, Multi, Control, Top, 1180 // Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype. 1181 switch (t->base()) { // Switch on original type 1182 1183 // Cut in half the number of cases I must handle. Only need cases for when 1184 // the given enum "t->type" is less than or equal to the local enum "type". 1185 case HalfFloatCon: 1186 case FloatCon: 1187 case DoubleCon: 1188 case Int: 1189 case Long: 1190 return t->xmeet(this); 1191 1192 case OopPtr: 1193 return t->xmeet(this); 1194 1195 case InstPtr: 1196 return t->xmeet(this); 1197 1198 case MetadataPtr: 1199 case KlassPtr: 1200 case InstKlassPtr: 1201 case AryKlassPtr: 1202 return t->xmeet(this); 1203 1204 case AryPtr: 1205 return t->xmeet(this); 1206 1207 case NarrowOop: 1208 return t->xmeet(this); 1209 1210 case NarrowKlass: 1211 return t->xmeet(this); 1212 1213 case Bad: // Type check 1214 default: // Bogus type not in lattice 1215 typerr(t); 1216 return Type::BOTTOM; 1217 1218 case Bottom: // Ye Olde Default 1219 return t; 1220 1221 case HalfFloatTop: 1222 if (_base == HalfFloatTop) { return this; } 1223 case HalfFloatBot: // Half Float 1224 if (_base == HalfFloatBot || _base == HalfFloatTop) { return HALF_FLOAT; } 1225 if (_base == FloatBot || _base == FloatTop) { return Type::BOTTOM; } 1226 if (_base == DoubleTop || _base == DoubleBot) { return Type::BOTTOM; } 1227 typerr(t); 1228 return Type::BOTTOM; 1229 1230 case FloatTop: 1231 if (_base == FloatTop ) { return this; } 1232 case FloatBot: // Float 1233 if (_base == FloatBot || _base == FloatTop) { return FLOAT; } 1234 if (_base == HalfFloatTop || _base == HalfFloatBot) { return Type::BOTTOM; } 1235 if (_base == DoubleTop || _base == DoubleBot) { return Type::BOTTOM; } 1236 typerr(t); 1237 return Type::BOTTOM; 1238 1239 case DoubleTop: 1240 if (_base == DoubleTop) { return this; } 1241 case DoubleBot: // Double 1242 if (_base == DoubleBot || _base == DoubleTop) { return DOUBLE; } 1243 if (_base == HalfFloatTop || _base == HalfFloatBot) { return Type::BOTTOM; } 1244 if (_base == FloatTop || _base == FloatBot) { return Type::BOTTOM; } 1245 typerr(t); 1246 return Type::BOTTOM; 1247 1248 // These next few cases must match exactly or it is a compile-time error. 1249 case Control: // Control of code 1250 case Abio: // State of world outside of program 1251 case Memory: 1252 if (_base == t->_base) { return this; } 1253 typerr(t); 1254 return Type::BOTTOM; 1255 1256 case Top: // Top of the lattice 1257 return this; 1258 } 1259 1260 // The type is unchanged 1261 return this; 1262 } 1263 1264 //-----------------------------filter------------------------------------------ 1265 const Type *Type::filter_helper(const Type *kills, bool include_speculative) const { 1266 const Type* ft = join_helper(kills, include_speculative); 1267 if (ft->empty()) 1268 return Type::TOP; // Canonical empty value 1269 return ft; 1270 } 1271 1272 //------------------------------xdual------------------------------------------ 1273 const Type *Type::xdual() const { 1274 // Note: the base() accessor asserts the sanity of _base. 1275 assert(_type_info[base()].dual_type != Bad, "implement with v-call"); 1276 return new Type(_type_info[_base].dual_type); 1277 } 1278 1279 //------------------------------has_memory------------------------------------- 1280 bool Type::has_memory() const { 1281 Type::TYPES tx = base(); 1282 if (tx == Memory) return true; 1283 if (tx == Tuple) { 1284 const TypeTuple *t = is_tuple(); 1285 for (uint i=0; i < t->cnt(); i++) { 1286 tx = t->field_at(i)->base(); 1287 if (tx == Memory) return true; 1288 } 1289 } 1290 return false; 1291 } 1292 1293 #ifndef PRODUCT 1294 //------------------------------dump2------------------------------------------ 1295 void Type::dump2( Dict &d, uint depth, outputStream *st ) const { 1296 st->print("%s", _type_info[_base].msg); 1297 } 1298 1299 //------------------------------dump------------------------------------------- 1300 void Type::dump_on(outputStream *st) const { 1301 ResourceMark rm; 1302 Dict d(cmpkey,hashkey); // Stop recursive type dumping 1303 dump2(d,1, st); 1304 if (is_ptr_to_narrowoop()) { 1305 st->print(" [narrow]"); 1306 } else if (is_ptr_to_narrowklass()) { 1307 st->print(" [narrowklass]"); 1308 } 1309 } 1310 1311 //----------------------------------------------------------------------------- 1312 const char* Type::str(const Type* t) { 1313 stringStream ss; 1314 t->dump_on(&ss); 1315 return ss.as_string(); 1316 } 1317 #endif 1318 1319 //------------------------------singleton-------------------------------------- 1320 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 1321 // constants (Ldi nodes). Singletons are integer, float or double constants. 1322 bool Type::singleton(void) const { 1323 return _base == Top || _base == Half; 1324 } 1325 1326 //------------------------------empty------------------------------------------ 1327 // TRUE if Type is a type with no values, FALSE otherwise. 1328 bool Type::empty(void) const { 1329 switch (_base) { 1330 case DoubleTop: 1331 case FloatTop: 1332 case HalfFloatTop: 1333 case Top: 1334 return true; 1335 1336 case Half: 1337 case Abio: 1338 case Return_Address: 1339 case Memory: 1340 case Bottom: 1341 case HalfFloatBot: 1342 case FloatBot: 1343 case DoubleBot: 1344 return false; // never a singleton, therefore never empty 1345 1346 default: 1347 ShouldNotReachHere(); 1348 return false; 1349 } 1350 } 1351 1352 //------------------------------dump_stats------------------------------------- 1353 // Dump collected statistics to stderr 1354 #ifndef PRODUCT 1355 void Type::dump_stats() { 1356 tty->print("Types made: %d\n", type_dict()->Size()); 1357 } 1358 #endif 1359 1360 //------------------------------category--------------------------------------- 1361 #ifndef PRODUCT 1362 Type::Category Type::category() const { 1363 const TypeTuple* tuple; 1364 switch (base()) { 1365 case Type::Int: 1366 case Type::Long: 1367 case Type::Half: 1368 case Type::NarrowOop: 1369 case Type::NarrowKlass: 1370 case Type::Array: 1371 case Type::VectorA: 1372 case Type::VectorS: 1373 case Type::VectorD: 1374 case Type::VectorX: 1375 case Type::VectorY: 1376 case Type::VectorZ: 1377 case Type::VectorMask: 1378 case Type::AnyPtr: 1379 case Type::RawPtr: 1380 case Type::OopPtr: 1381 case Type::InstPtr: 1382 case Type::AryPtr: 1383 case Type::MetadataPtr: 1384 case Type::KlassPtr: 1385 case Type::InstKlassPtr: 1386 case Type::AryKlassPtr: 1387 case Type::Function: 1388 case Type::Return_Address: 1389 case Type::HalfFloatTop: 1390 case Type::HalfFloatCon: 1391 case Type::HalfFloatBot: 1392 case Type::FloatTop: 1393 case Type::FloatCon: 1394 case Type::FloatBot: 1395 case Type::DoubleTop: 1396 case Type::DoubleCon: 1397 case Type::DoubleBot: 1398 return Category::Data; 1399 case Type::Memory: 1400 return Category::Memory; 1401 case Type::Control: 1402 return Category::Control; 1403 case Type::Top: 1404 case Type::Abio: 1405 case Type::Bottom: 1406 return Category::Other; 1407 case Type::Bad: 1408 case Type::lastype: 1409 return Category::Undef; 1410 case Type::Tuple: 1411 // Recursive case. Return CatMixed if the tuple contains types of 1412 // different categories (e.g. CallStaticJavaNode's type), or the specific 1413 // category if all types are of the same category (e.g. IfNode's type). 1414 tuple = is_tuple(); 1415 if (tuple->cnt() == 0) { 1416 return Category::Undef; 1417 } else { 1418 Category first = tuple->field_at(0)->category(); 1419 for (uint i = 1; i < tuple->cnt(); i++) { 1420 if (tuple->field_at(i)->category() != first) { 1421 return Category::Mixed; 1422 } 1423 } 1424 return first; 1425 } 1426 default: 1427 assert(false, "unmatched base type: all base types must be categorized"); 1428 } 1429 return Category::Undef; 1430 } 1431 1432 bool Type::has_category(Type::Category cat) const { 1433 if (category() == cat) { 1434 return true; 1435 } 1436 if (category() == Category::Mixed) { 1437 const TypeTuple* tuple = is_tuple(); 1438 for (uint i = 0; i < tuple->cnt(); i++) { 1439 if (tuple->field_at(i)->has_category(cat)) { 1440 return true; 1441 } 1442 } 1443 } 1444 return false; 1445 } 1446 #endif 1447 1448 //------------------------------typerr----------------------------------------- 1449 void Type::typerr( const Type *t ) const { 1450 #ifndef PRODUCT 1451 tty->print("\nError mixing types: "); 1452 dump(); 1453 tty->print(" and "); 1454 t->dump(); 1455 tty->print("\n"); 1456 #endif 1457 ShouldNotReachHere(); 1458 } 1459 1460 1461 //============================================================================= 1462 // Convenience common pre-built types. 1463 const TypeF *TypeF::MAX; // Floating point max 1464 const TypeF *TypeF::MIN; // Floating point min 1465 const TypeF *TypeF::ZERO; // Floating point zero 1466 const TypeF *TypeF::ONE; // Floating point one 1467 const TypeF *TypeF::POS_INF; // Floating point positive infinity 1468 const TypeF *TypeF::NEG_INF; // Floating point negative infinity 1469 1470 //------------------------------make------------------------------------------- 1471 // Create a float constant 1472 const TypeF *TypeF::make(float f) { 1473 return (TypeF*)(new TypeF(f))->hashcons(); 1474 } 1475 1476 //------------------------------meet------------------------------------------- 1477 // Compute the MEET of two types. It returns a new Type object. 1478 const Type *TypeF::xmeet( const Type *t ) const { 1479 // Perform a fast test for common case; meeting the same types together. 1480 if( this == t ) return this; // Meeting same type-rep? 1481 1482 // Current "this->_base" is FloatCon 1483 switch (t->base()) { // Switch on original type 1484 case AnyPtr: // Mixing with oops happens when javac 1485 case RawPtr: // reuses local variables 1486 case OopPtr: 1487 case InstPtr: 1488 case AryPtr: 1489 case MetadataPtr: 1490 case KlassPtr: 1491 case InstKlassPtr: 1492 case AryKlassPtr: 1493 case NarrowOop: 1494 case NarrowKlass: 1495 case Int: 1496 case Long: 1497 case HalfFloatTop: 1498 case HalfFloatCon: 1499 case HalfFloatBot: 1500 case DoubleTop: 1501 case DoubleCon: 1502 case DoubleBot: 1503 case Bottom: // Ye Olde Default 1504 return Type::BOTTOM; 1505 1506 case FloatBot: 1507 return t; 1508 1509 default: // All else is a mistake 1510 typerr(t); 1511 1512 case FloatCon: // Float-constant vs Float-constant? 1513 if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants? 1514 // must compare bitwise as positive zero, negative zero and NaN have 1515 // all the same representation in C++ 1516 return FLOAT; // Return generic float 1517 // Equal constants 1518 case Top: 1519 case FloatTop: 1520 break; // Return the float constant 1521 } 1522 return this; // Return the float constant 1523 } 1524 1525 //------------------------------xdual------------------------------------------ 1526 // Dual: symmetric 1527 const Type *TypeF::xdual() const { 1528 return this; 1529 } 1530 1531 //------------------------------eq--------------------------------------------- 1532 // Structural equality check for Type representations 1533 bool TypeF::eq(const Type *t) const { 1534 // Bitwise comparison to distinguish between +/-0. These values must be treated 1535 // as different to be consistent with C1 and the interpreter. 1536 return (jint_cast(_f) == jint_cast(t->getf())); 1537 } 1538 1539 //------------------------------hash------------------------------------------- 1540 // Type-specific hashing function. 1541 uint TypeF::hash(void) const { 1542 return *(uint*)(&_f); 1543 } 1544 1545 //------------------------------is_finite-------------------------------------- 1546 // Has a finite value 1547 bool TypeF::is_finite() const { 1548 return g_isfinite(getf()) != 0; 1549 } 1550 1551 //------------------------------is_nan----------------------------------------- 1552 // Is not a number (NaN) 1553 bool TypeF::is_nan() const { 1554 return g_isnan(getf()) != 0; 1555 } 1556 1557 //------------------------------dump2------------------------------------------ 1558 // Dump float constant Type 1559 #ifndef PRODUCT 1560 void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const { 1561 Type::dump2(d,depth, st); 1562 st->print("%f", _f); 1563 } 1564 #endif 1565 1566 //------------------------------singleton-------------------------------------- 1567 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 1568 // constants (Ldi nodes). Singletons are integer, float or double constants 1569 // or a single symbol. 1570 bool TypeF::singleton(void) const { 1571 return true; // Always a singleton 1572 } 1573 1574 bool TypeF::empty(void) const { 1575 return false; // always exactly a singleton 1576 } 1577 1578 //============================================================================= 1579 // Convenience common pre-built types. 1580 const TypeH* TypeH::MAX; // Half float max 1581 const TypeH* TypeH::MIN; // Half float min 1582 const TypeH* TypeH::ZERO; // Half float zero 1583 const TypeH* TypeH::ONE; // Half float one 1584 const TypeH* TypeH::POS_INF; // Half float positive infinity 1585 const TypeH* TypeH::NEG_INF; // Half float negative infinity 1586 1587 //------------------------------make------------------------------------------- 1588 // Create a halffloat constant 1589 const TypeH* TypeH::make(short f) { 1590 return (TypeH*)(new TypeH(f))->hashcons(); 1591 } 1592 1593 const TypeH* TypeH::make(float f) { 1594 assert(StubRoutines::f2hf_adr() != nullptr, ""); 1595 short hf = StubRoutines::f2hf(f); 1596 return (TypeH*)(new TypeH(hf))->hashcons(); 1597 } 1598 1599 //------------------------------xmeet------------------------------------------- 1600 // Compute the MEET of two types. It returns a new Type object. 1601 const Type* TypeH::xmeet(const Type* t) const { 1602 // Perform a fast test for common case; meeting the same types together. 1603 if (this == t) return this; // Meeting same type-rep? 1604 1605 // Current "this->_base" is FloatCon 1606 switch (t->base()) { // Switch on original type 1607 case AnyPtr: // Mixing with oops happens when javac 1608 case RawPtr: // reuses local variables 1609 case OopPtr: 1610 case InstPtr: 1611 case AryPtr: 1612 case MetadataPtr: 1613 case KlassPtr: 1614 case InstKlassPtr: 1615 case AryKlassPtr: 1616 case NarrowOop: 1617 case NarrowKlass: 1618 case Int: 1619 case Long: 1620 case FloatTop: 1621 case FloatCon: 1622 case FloatBot: 1623 case DoubleTop: 1624 case DoubleCon: 1625 case DoubleBot: 1626 case Bottom: // Ye Olde Default 1627 return Type::BOTTOM; 1628 1629 case HalfFloatBot: 1630 return t; 1631 1632 default: // All else is a mistake 1633 typerr(t); 1634 1635 case HalfFloatCon: // Half float-constant vs Half float-constant? 1636 if (_f != t->geth()) { // unequal constants? 1637 // must compare bitwise as positive zero, negative zero and NaN have 1638 // all the same representation in C++ 1639 return HALF_FLOAT; // Return generic float 1640 } // Equal constants 1641 case Top: 1642 case HalfFloatTop: 1643 break; // Return the Half float constant 1644 } 1645 return this; // Return the Half float constant 1646 } 1647 1648 //------------------------------xdual------------------------------------------ 1649 // Dual: symmetric 1650 const Type* TypeH::xdual() const { 1651 return this; 1652 } 1653 1654 //------------------------------eq--------------------------------------------- 1655 // Structural equality check for Type representations 1656 bool TypeH::eq(const Type* t) const { 1657 // Bitwise comparison to distinguish between +/-0. These values must be treated 1658 // as different to be consistent with C1 and the interpreter. 1659 return (_f == t->geth()); 1660 } 1661 1662 //------------------------------hash------------------------------------------- 1663 // Type-specific hashing function. 1664 uint TypeH::hash(void) const { 1665 return *(jshort*)(&_f); 1666 } 1667 1668 //------------------------------is_finite-------------------------------------- 1669 // Has a finite value 1670 bool TypeH::is_finite() const { 1671 assert(StubRoutines::hf2f_adr() != nullptr, ""); 1672 float f = StubRoutines::hf2f(geth()); 1673 return g_isfinite(f) != 0; 1674 } 1675 1676 float TypeH::getf() const { 1677 assert(StubRoutines::hf2f_adr() != nullptr, ""); 1678 return StubRoutines::hf2f(geth()); 1679 } 1680 1681 //------------------------------is_nan----------------------------------------- 1682 // Is not a number (NaN) 1683 bool TypeH::is_nan() const { 1684 assert(StubRoutines::hf2f_adr() != nullptr, ""); 1685 float f = StubRoutines::hf2f(geth()); 1686 return g_isnan(f) != 0; 1687 } 1688 1689 //------------------------------dump2------------------------------------------ 1690 // Dump float constant Type 1691 #ifndef PRODUCT 1692 void TypeH::dump2(Dict &d, uint depth, outputStream* st) const { 1693 Type::dump2(d,depth, st); 1694 st->print("%f", getf()); 1695 } 1696 #endif 1697 1698 //------------------------------singleton-------------------------------------- 1699 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 1700 // constants (Ldi nodes). Singletons are integer, half float, float or double constants 1701 // or a single symbol. 1702 bool TypeH::singleton(void) const { 1703 return true; // Always a singleton 1704 } 1705 1706 bool TypeH::empty(void) const { 1707 return false; // always exactly a singleton 1708 } 1709 1710 //============================================================================= 1711 // Convenience common pre-built types. 1712 const TypeD *TypeD::MAX; // Floating point max 1713 const TypeD *TypeD::MIN; // Floating point min 1714 const TypeD *TypeD::ZERO; // Floating point zero 1715 const TypeD *TypeD::ONE; // Floating point one 1716 const TypeD *TypeD::POS_INF; // Floating point positive infinity 1717 const TypeD *TypeD::NEG_INF; // Floating point negative infinity 1718 1719 //------------------------------make------------------------------------------- 1720 const TypeD *TypeD::make(double d) { 1721 return (TypeD*)(new TypeD(d))->hashcons(); 1722 } 1723 1724 //------------------------------meet------------------------------------------- 1725 // Compute the MEET of two types. It returns a new Type object. 1726 const Type *TypeD::xmeet( const Type *t ) const { 1727 // Perform a fast test for common case; meeting the same types together. 1728 if( this == t ) return this; // Meeting same type-rep? 1729 1730 // Current "this->_base" is DoubleCon 1731 switch (t->base()) { // Switch on original type 1732 case AnyPtr: // Mixing with oops happens when javac 1733 case RawPtr: // reuses local variables 1734 case OopPtr: 1735 case InstPtr: 1736 case AryPtr: 1737 case MetadataPtr: 1738 case KlassPtr: 1739 case InstKlassPtr: 1740 case AryKlassPtr: 1741 case NarrowOop: 1742 case NarrowKlass: 1743 case Int: 1744 case Long: 1745 case HalfFloatTop: 1746 case HalfFloatCon: 1747 case HalfFloatBot: 1748 case FloatTop: 1749 case FloatCon: 1750 case FloatBot: 1751 case Bottom: // Ye Olde Default 1752 return Type::BOTTOM; 1753 1754 case DoubleBot: 1755 return t; 1756 1757 default: // All else is a mistake 1758 typerr(t); 1759 1760 case DoubleCon: // Double-constant vs Double-constant? 1761 if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet) 1762 return DOUBLE; // Return generic double 1763 case Top: 1764 case DoubleTop: 1765 break; 1766 } 1767 return this; // Return the double constant 1768 } 1769 1770 //------------------------------xdual------------------------------------------ 1771 // Dual: symmetric 1772 const Type *TypeD::xdual() const { 1773 return this; 1774 } 1775 1776 //------------------------------eq--------------------------------------------- 1777 // Structural equality check for Type representations 1778 bool TypeD::eq(const Type *t) const { 1779 // Bitwise comparison to distinguish between +/-0. These values must be treated 1780 // as different to be consistent with C1 and the interpreter. 1781 return (jlong_cast(_d) == jlong_cast(t->getd())); 1782 } 1783 1784 //------------------------------hash------------------------------------------- 1785 // Type-specific hashing function. 1786 uint TypeD::hash(void) const { 1787 return *(uint*)(&_d); 1788 } 1789 1790 //------------------------------is_finite-------------------------------------- 1791 // Has a finite value 1792 bool TypeD::is_finite() const { 1793 return g_isfinite(getd()) != 0; 1794 } 1795 1796 //------------------------------is_nan----------------------------------------- 1797 // Is not a number (NaN) 1798 bool TypeD::is_nan() const { 1799 return g_isnan(getd()) != 0; 1800 } 1801 1802 //------------------------------dump2------------------------------------------ 1803 // Dump double constant Type 1804 #ifndef PRODUCT 1805 void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const { 1806 Type::dump2(d,depth,st); 1807 st->print("%f", _d); 1808 } 1809 #endif 1810 1811 //------------------------------singleton-------------------------------------- 1812 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 1813 // constants (Ldi nodes). Singletons are integer, float or double constants 1814 // or a single symbol. 1815 bool TypeD::singleton(void) const { 1816 return true; // Always a singleton 1817 } 1818 1819 bool TypeD::empty(void) const { 1820 return false; // always exactly a singleton 1821 } 1822 1823 const TypeInteger* TypeInteger::make(jlong lo, jlong hi, int w, BasicType bt) { 1824 if (bt == T_INT) { 1825 return TypeInt::make(checked_cast<jint>(lo), checked_cast<jint>(hi), w); 1826 } 1827 assert(bt == T_LONG, "basic type not an int or long"); 1828 return TypeLong::make(lo, hi, w); 1829 } 1830 1831 const TypeInteger* TypeInteger::make(jlong con, BasicType bt) { 1832 return make(con, con, WidenMin, bt); 1833 } 1834 1835 jlong TypeInteger::get_con_as_long(BasicType bt) const { 1836 if (bt == T_INT) { 1837 return is_int()->get_con(); 1838 } 1839 assert(bt == T_LONG, "basic type not an int or long"); 1840 return is_long()->get_con(); 1841 } 1842 1843 const TypeInteger* TypeInteger::bottom(BasicType bt) { 1844 if (bt == T_INT) { 1845 return TypeInt::INT; 1846 } 1847 assert(bt == T_LONG, "basic type not an int or long"); 1848 return TypeLong::LONG; 1849 } 1850 1851 const TypeInteger* TypeInteger::zero(BasicType bt) { 1852 if (bt == T_INT) { 1853 return TypeInt::ZERO; 1854 } 1855 assert(bt == T_LONG, "basic type not an int or long"); 1856 return TypeLong::ZERO; 1857 } 1858 1859 const TypeInteger* TypeInteger::one(BasicType bt) { 1860 if (bt == T_INT) { 1861 return TypeInt::ONE; 1862 } 1863 assert(bt == T_LONG, "basic type not an int or long"); 1864 return TypeLong::ONE; 1865 } 1866 1867 const TypeInteger* TypeInteger::minus_1(BasicType bt) { 1868 if (bt == T_INT) { 1869 return TypeInt::MINUS_1; 1870 } 1871 assert(bt == T_LONG, "basic type not an int or long"); 1872 return TypeLong::MINUS_1; 1873 } 1874 1875 //============================================================================= 1876 // Convenience common pre-built types. 1877 const TypeInt* TypeInt::MAX; // INT_MAX 1878 const TypeInt* TypeInt::MIN; // INT_MIN 1879 const TypeInt* TypeInt::MINUS_1;// -1 1880 const TypeInt* TypeInt::ZERO; // 0 1881 const TypeInt* TypeInt::ONE; // 1 1882 const TypeInt* TypeInt::BOOL; // 0 or 1, FALSE or TRUE. 1883 const TypeInt* TypeInt::CC; // -1,0 or 1, condition codes 1884 const TypeInt* TypeInt::CC_LT; // [-1] == MINUS_1 1885 const TypeInt* TypeInt::CC_GT; // [1] == ONE 1886 const TypeInt* TypeInt::CC_EQ; // [0] == ZERO 1887 const TypeInt* TypeInt::CC_NE; 1888 const TypeInt* TypeInt::CC_LE; // [-1,0] 1889 const TypeInt* TypeInt::CC_GE; // [0,1] == BOOL (!) 1890 const TypeInt* TypeInt::BYTE; // Bytes, -128 to 127 1891 const TypeInt* TypeInt::UBYTE; // Unsigned Bytes, 0 to 255 1892 const TypeInt* TypeInt::CHAR; // Java chars, 0-65535 1893 const TypeInt* TypeInt::SHORT; // Java shorts, -32768-32767 1894 const TypeInt* TypeInt::NON_ZERO; 1895 const TypeInt* TypeInt::POS; // Positive 32-bit integers or zero 1896 const TypeInt* TypeInt::POS1; // Positive 32-bit integers 1897 const TypeInt* TypeInt::INT; // 32-bit integers 1898 const TypeInt* TypeInt::SYMINT; // symmetric range [-max_jint..max_jint] 1899 const TypeInt* TypeInt::TYPE_DOMAIN; // alias for TypeInt::INT 1900 1901 TypeInt::TypeInt(const TypeIntPrototype<jint, juint>& t, int widen, bool dual) 1902 : TypeInteger(Int, t.normalize_widen(widen), dual), _lo(t._srange._lo), _hi(t._srange._hi), 1903 _ulo(t._urange._lo), _uhi(t._urange._hi), _bits(t._bits) { 1904 DEBUG_ONLY(t.verify_constraints()); 1905 } 1906 1907 const Type* TypeInt::make_or_top(const TypeIntPrototype<jint, juint>& t, int widen, bool dual) { 1908 auto canonicalized_t = t.canonicalize_constraints(); 1909 if (canonicalized_t.empty()) { 1910 return dual ? Type::BOTTOM : Type::TOP; 1911 } 1912 return (new TypeInt(canonicalized_t._data, widen, dual))->hashcons()->is_int(); 1913 } 1914 1915 const TypeInt* TypeInt::make(jint con) { 1916 juint ucon = con; 1917 return (new TypeInt(TypeIntPrototype<jint, juint>{{con, con}, {ucon, ucon}, {~ucon, ucon}}, 1918 WidenMin, false))->hashcons()->is_int(); 1919 } 1920 1921 const TypeInt* TypeInt::make(jint lo, jint hi, int widen) { 1922 assert(lo <= hi, "must be legal bounds"); 1923 return make_or_top(TypeIntPrototype<jint, juint>{{lo, hi}, {0, max_juint}, {0, 0}}, widen)->is_int(); 1924 } 1925 1926 const Type* TypeInt::make_or_top(const TypeIntPrototype<jint, juint>& t, int widen) { 1927 return make_or_top(t, widen, false); 1928 } 1929 1930 bool TypeInt::contains(jint i) const { 1931 assert(!_is_dual, "dual types should only be used for join calculation"); 1932 juint u = i; 1933 return i >= _lo && i <= _hi && 1934 u >= _ulo && u <= _uhi && 1935 _bits.is_satisfied_by(u); 1936 } 1937 1938 bool TypeInt::contains(const TypeInt* t) const { 1939 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation"); 1940 return TypeIntHelper::int_type_is_subset(this, t); 1941 } 1942 1943 #ifdef ASSERT 1944 bool TypeInt::strictly_contains(const TypeInt* t) const { 1945 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation"); 1946 return TypeIntHelper::int_type_is_subset(this, t) && !TypeIntHelper::int_type_is_equal(this, t); 1947 } 1948 #endif // ASSERT 1949 1950 const Type* TypeInt::xmeet(const Type* t) const { 1951 return TypeIntHelper::int_type_xmeet(this, t); 1952 } 1953 1954 const Type* TypeInt::xdual() const { 1955 return new TypeInt(TypeIntPrototype<jint, juint>{{_lo, _hi}, {_ulo, _uhi}, _bits}, 1956 _widen, !_is_dual); 1957 } 1958 1959 const Type* TypeInt::widen(const Type* old, const Type* limit) const { 1960 assert(!_is_dual, "dual types should only be used for join calculation"); 1961 return TypeIntHelper::int_type_widen(this, old->isa_int(), limit->isa_int()); 1962 } 1963 1964 const Type* TypeInt::narrow(const Type* old) const { 1965 assert(!_is_dual, "dual types should only be used for join calculation"); 1966 if (old == nullptr) { 1967 return this; 1968 } 1969 1970 return TypeIntHelper::int_type_narrow(this, old->isa_int()); 1971 } 1972 1973 //-----------------------------filter------------------------------------------ 1974 const Type* TypeInt::filter_helper(const Type* kills, bool include_speculative) const { 1975 assert(!_is_dual, "dual types should only be used for join calculation"); 1976 const TypeInt* ft = join_helper(kills, include_speculative)->isa_int(); 1977 if (ft == nullptr) { 1978 return Type::TOP; // Canonical empty value 1979 } 1980 assert(!ft->_is_dual, "dual types should only be used for join calculation"); 1981 if (ft->_widen < this->_widen) { 1982 // Do not allow the value of kill->_widen to affect the outcome. 1983 // The widen bits must be allowed to run freely through the graph. 1984 return (new TypeInt(TypeIntPrototype<jint, juint>{{ft->_lo, ft->_hi}, {ft->_ulo, ft->_uhi}, ft->_bits}, 1985 this->_widen, false))->hashcons(); 1986 } 1987 return ft; 1988 } 1989 1990 //------------------------------eq--------------------------------------------- 1991 // Structural equality check for Type representations 1992 bool TypeInt::eq(const Type* t) const { 1993 const TypeInt* r = t->is_int(); 1994 return TypeIntHelper::int_type_is_equal(this, r) && _widen == r->_widen && _is_dual == r->_is_dual; 1995 } 1996 1997 //------------------------------hash------------------------------------------- 1998 // Type-specific hashing function. 1999 uint TypeInt::hash(void) const { 2000 return (uint)_lo + (uint)_hi + (uint)_ulo + (uint)_uhi + 2001 (uint)_bits._zeros + (uint)_bits._ones + (uint)_widen + (uint)_is_dual + (uint)Type::Int; 2002 } 2003 2004 //------------------------------is_finite-------------------------------------- 2005 // Has a finite value 2006 bool TypeInt::is_finite() const { 2007 return true; 2008 } 2009 2010 //------------------------------singleton-------------------------------------- 2011 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2012 // constants. 2013 bool TypeInt::singleton(void) const { 2014 return _lo == _hi; 2015 } 2016 2017 bool TypeInt::empty(void) const { 2018 return false; 2019 } 2020 2021 //============================================================================= 2022 // Convenience common pre-built types. 2023 const TypeLong* TypeLong::MAX; 2024 const TypeLong* TypeLong::MIN; 2025 const TypeLong* TypeLong::MINUS_1;// -1 2026 const TypeLong* TypeLong::ZERO; // 0 2027 const TypeLong* TypeLong::ONE; // 1 2028 const TypeLong* TypeLong::NON_ZERO; 2029 const TypeLong* TypeLong::POS; // >=0 2030 const TypeLong* TypeLong::NEG; 2031 const TypeLong* TypeLong::LONG; // 64-bit integers 2032 const TypeLong* TypeLong::INT; // 32-bit subrange 2033 const TypeLong* TypeLong::UINT; // 32-bit unsigned subrange 2034 const TypeLong* TypeLong::TYPE_DOMAIN; // alias for TypeLong::LONG 2035 2036 TypeLong::TypeLong(const TypeIntPrototype<jlong, julong>& t, int widen, bool dual) 2037 : TypeInteger(Long, t.normalize_widen(widen), dual), _lo(t._srange._lo), _hi(t._srange._hi), 2038 _ulo(t._urange._lo), _uhi(t._urange._hi), _bits(t._bits) { 2039 DEBUG_ONLY(t.verify_constraints()); 2040 } 2041 2042 const Type* TypeLong::make_or_top(const TypeIntPrototype<jlong, julong>& t, int widen, bool dual) { 2043 auto canonicalized_t = t.canonicalize_constraints(); 2044 if (canonicalized_t.empty()) { 2045 return dual ? Type::BOTTOM : Type::TOP; 2046 } 2047 return (new TypeLong(canonicalized_t._data, widen, dual))->hashcons()->is_long(); 2048 } 2049 2050 const TypeLong* TypeLong::make(jlong con) { 2051 julong ucon = con; 2052 return (new TypeLong(TypeIntPrototype<jlong, julong>{{con, con}, {ucon, ucon}, {~ucon, ucon}}, 2053 WidenMin, false))->hashcons()->is_long(); 2054 } 2055 2056 const TypeLong* TypeLong::make(jlong lo, jlong hi, int widen) { 2057 assert(lo <= hi, "must be legal bounds"); 2058 return make_or_top(TypeIntPrototype<jlong, julong>{{lo, hi}, {0, max_julong}, {0, 0}}, widen)->is_long(); 2059 } 2060 2061 const Type* TypeLong::make_or_top(const TypeIntPrototype<jlong, julong>& t, int widen) { 2062 return make_or_top(t, widen, false); 2063 } 2064 2065 bool TypeLong::contains(jlong i) const { 2066 assert(!_is_dual, "dual types should only be used for join calculation"); 2067 julong u = i; 2068 return i >= _lo && i <= _hi && 2069 u >= _ulo && u <= _uhi && 2070 _bits.is_satisfied_by(u); 2071 } 2072 2073 bool TypeLong::contains(const TypeLong* t) const { 2074 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation"); 2075 return TypeIntHelper::int_type_is_subset(this, t); 2076 } 2077 2078 #ifdef ASSERT 2079 bool TypeLong::strictly_contains(const TypeLong* t) const { 2080 assert(!_is_dual && !t->_is_dual, "dual types should only be used for join calculation"); 2081 return TypeIntHelper::int_type_is_subset(this, t) && !TypeIntHelper::int_type_is_equal(this, t); 2082 } 2083 #endif // ASSERT 2084 2085 const Type* TypeLong::xmeet(const Type* t) const { 2086 return TypeIntHelper::int_type_xmeet(this, t); 2087 } 2088 2089 const Type* TypeLong::xdual() const { 2090 return new TypeLong(TypeIntPrototype<jlong, julong>{{_lo, _hi}, {_ulo, _uhi}, _bits}, 2091 _widen, !_is_dual); 2092 } 2093 2094 const Type* TypeLong::widen(const Type* old, const Type* limit) const { 2095 assert(!_is_dual, "dual types should only be used for join calculation"); 2096 return TypeIntHelper::int_type_widen(this, old->isa_long(), limit->isa_long()); 2097 } 2098 2099 const Type* TypeLong::narrow(const Type* old) const { 2100 assert(!_is_dual, "dual types should only be used for join calculation"); 2101 if (old == nullptr) { 2102 return this; 2103 } 2104 2105 return TypeIntHelper::int_type_narrow(this, old->isa_long()); 2106 } 2107 2108 //-----------------------------filter------------------------------------------ 2109 const Type* TypeLong::filter_helper(const Type* kills, bool include_speculative) const { 2110 assert(!_is_dual, "dual types should only be used for join calculation"); 2111 const TypeLong* ft = join_helper(kills, include_speculative)->isa_long(); 2112 if (ft == nullptr) { 2113 return Type::TOP; // Canonical empty value 2114 } 2115 assert(!ft->_is_dual, "dual types should only be used for join calculation"); 2116 if (ft->_widen < this->_widen) { 2117 // Do not allow the value of kill->_widen to affect the outcome. 2118 // The widen bits must be allowed to run freely through the graph. 2119 return (new TypeLong(TypeIntPrototype<jlong, julong>{{ft->_lo, ft->_hi}, {ft->_ulo, ft->_uhi}, ft->_bits}, 2120 this->_widen, false))->hashcons(); 2121 } 2122 return ft; 2123 } 2124 2125 //------------------------------eq--------------------------------------------- 2126 // Structural equality check for Type representations 2127 bool TypeLong::eq(const Type* t) const { 2128 const TypeLong* r = t->is_long(); 2129 return TypeIntHelper::int_type_is_equal(this, r) && _widen == r->_widen && _is_dual == r->_is_dual; 2130 } 2131 2132 //------------------------------hash------------------------------------------- 2133 // Type-specific hashing function. 2134 uint TypeLong::hash(void) const { 2135 return (uint)_lo + (uint)_hi + (uint)_ulo + (uint)_uhi + 2136 (uint)_bits._zeros + (uint)_bits._ones + (uint)_widen + (uint)_is_dual + (uint)Type::Long; 2137 } 2138 2139 //------------------------------is_finite-------------------------------------- 2140 // Has a finite value 2141 bool TypeLong::is_finite() const { 2142 return true; 2143 } 2144 2145 //------------------------------singleton-------------------------------------- 2146 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2147 // constants 2148 bool TypeLong::singleton(void) const { 2149 return _lo == _hi; 2150 } 2151 2152 bool TypeLong::empty(void) const { 2153 return false; 2154 } 2155 2156 //------------------------------dump2------------------------------------------ 2157 #ifndef PRODUCT 2158 void TypeInt::dump2(Dict& d, uint depth, outputStream* st) const { 2159 TypeIntHelper::int_type_dump(this, st, false); 2160 } 2161 2162 void TypeInt::dump_verbose() const { 2163 TypeIntHelper::int_type_dump(this, tty, true); 2164 } 2165 2166 void TypeLong::dump2(Dict& d, uint depth, outputStream* st) const { 2167 TypeIntHelper::int_type_dump(this, st, false); 2168 } 2169 2170 void TypeLong::dump_verbose() const { 2171 TypeIntHelper::int_type_dump(this, tty, true); 2172 } 2173 #endif 2174 2175 //============================================================================= 2176 // Convenience common pre-built types. 2177 const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable 2178 const TypeTuple *TypeTuple::IFFALSE; 2179 const TypeTuple *TypeTuple::IFTRUE; 2180 const TypeTuple *TypeTuple::IFNEITHER; 2181 const TypeTuple *TypeTuple::LOOPBODY; 2182 const TypeTuple *TypeTuple::MEMBAR; 2183 const TypeTuple *TypeTuple::STORECONDITIONAL; 2184 const TypeTuple *TypeTuple::START_I2C; 2185 const TypeTuple *TypeTuple::INT_PAIR; 2186 const TypeTuple *TypeTuple::LONG_PAIR; 2187 const TypeTuple *TypeTuple::INT_CC_PAIR; 2188 const TypeTuple *TypeTuple::LONG_CC_PAIR; 2189 2190 static void collect_inline_fields(ciInlineKlass* vk, const Type** field_array, uint& pos) { 2191 for (int i = 0; i < vk->nof_declared_nonstatic_fields(); i++) { 2192 ciField* field = vk->declared_nonstatic_field_at(i); 2193 if (field->is_flat()) { 2194 collect_inline_fields(field->type()->as_inline_klass(), field_array, pos); 2195 if (!field->is_null_free()) { 2196 // Use T_INT instead of T_BOOLEAN here because the upper bits can contain garbage if the holder 2197 // is null and C2 will only zero them for T_INT assuming that T_BOOLEAN is already canonicalized. 2198 field_array[pos++] = Type::get_const_basic_type(T_INT); 2199 } 2200 } else { 2201 BasicType bt = field->type()->basic_type(); 2202 const Type* ft = Type::get_const_type(field->type()); 2203 field_array[pos++] = ft; 2204 if (type2size[bt] == 2) { 2205 field_array[pos++] = Type::HALF; 2206 } 2207 } 2208 } 2209 } 2210 2211 //------------------------------make------------------------------------------- 2212 // Make a TypeTuple from the range of a method signature 2213 const TypeTuple *TypeTuple::make_range(ciSignature* sig, InterfaceHandling interface_handling, bool ret_vt_fields) { 2214 ciType* return_type = sig->return_type(); 2215 uint arg_cnt = return_type->size(); 2216 if (ret_vt_fields) { 2217 arg_cnt = return_type->as_inline_klass()->inline_arg_slots() + 1; 2218 // InlineTypeNode::NullMarker field used for null checking 2219 arg_cnt++; 2220 } 2221 const Type **field_array = fields(arg_cnt); 2222 switch (return_type->basic_type()) { 2223 case T_LONG: 2224 field_array[TypeFunc::Parms] = TypeLong::LONG; 2225 field_array[TypeFunc::Parms+1] = Type::HALF; 2226 break; 2227 case T_DOUBLE: 2228 field_array[TypeFunc::Parms] = Type::DOUBLE; 2229 field_array[TypeFunc::Parms+1] = Type::HALF; 2230 break; 2231 case T_OBJECT: 2232 if (return_type->is_inlinetype() && ret_vt_fields) { 2233 uint pos = TypeFunc::Parms; 2234 field_array[pos++] = get_const_type(return_type); // Oop might be null when returning as fields 2235 collect_inline_fields(return_type->as_inline_klass(), field_array, pos); 2236 // InlineTypeNode::NullMarker field used for null checking 2237 field_array[pos++] = get_const_basic_type(T_BOOLEAN); 2238 assert(pos == (TypeFunc::Parms + arg_cnt), "out of bounds"); 2239 break; 2240 } else { 2241 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling)->join_speculative(TypePtr::BOTTOM); 2242 } 2243 break; 2244 case T_ARRAY: 2245 case T_BOOLEAN: 2246 case T_CHAR: 2247 case T_FLOAT: 2248 case T_BYTE: 2249 case T_SHORT: 2250 case T_INT: 2251 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling); 2252 break; 2253 case T_VOID: 2254 break; 2255 default: 2256 ShouldNotReachHere(); 2257 } 2258 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons(); 2259 } 2260 2261 // Make a TypeTuple from the domain of a method signature 2262 const TypeTuple *TypeTuple::make_domain(ciMethod* method, InterfaceHandling interface_handling, bool vt_fields_as_args) { 2263 ciSignature* sig = method->signature(); 2264 uint arg_cnt = sig->size() + (method->is_static() ? 0 : 1); 2265 if (vt_fields_as_args) { 2266 arg_cnt = 0; 2267 assert(method->get_sig_cc() != nullptr, "Should have scalarized signature"); 2268 for (ExtendedSignature sig_cc = ExtendedSignature(method->get_sig_cc(), SigEntryFilter()); !sig_cc.at_end(); ++sig_cc) { 2269 arg_cnt += type2size[(*sig_cc)._bt]; 2270 } 2271 } 2272 2273 uint pos = TypeFunc::Parms; 2274 const Type** field_array = fields(arg_cnt); 2275 if (!method->is_static()) { 2276 ciInstanceKlass* recv = method->holder(); 2277 if (vt_fields_as_args && recv->is_inlinetype() && recv->as_inline_klass()->can_be_passed_as_fields() && method->is_scalarized_arg(0)) { 2278 collect_inline_fields(recv->as_inline_klass(), field_array, pos); 2279 } else { 2280 field_array[pos++] = get_const_type(recv, interface_handling)->join_speculative(TypePtr::NOTNULL); 2281 } 2282 } 2283 2284 int i = 0; 2285 while (pos < TypeFunc::Parms + arg_cnt) { 2286 ciType* type = sig->type_at(i); 2287 BasicType bt = type->basic_type(); 2288 2289 switch (bt) { 2290 case T_LONG: 2291 field_array[pos++] = TypeLong::LONG; 2292 field_array[pos++] = Type::HALF; 2293 break; 2294 case T_DOUBLE: 2295 field_array[pos++] = Type::DOUBLE; 2296 field_array[pos++] = Type::HALF; 2297 break; 2298 case T_OBJECT: 2299 if (type->is_inlinetype() && vt_fields_as_args && method->is_scalarized_arg(i + (method->is_static() ? 0 : 1))) { 2300 // InlineTypeNode::NullMarker field used for null checking 2301 field_array[pos++] = get_const_basic_type(T_BOOLEAN); 2302 collect_inline_fields(type->as_inline_klass(), field_array, pos); 2303 } else { 2304 field_array[pos++] = get_const_type(type, interface_handling); 2305 } 2306 break; 2307 case T_ARRAY: 2308 case T_FLOAT: 2309 case T_INT: 2310 field_array[pos++] = get_const_type(type, interface_handling); 2311 break; 2312 case T_BOOLEAN: 2313 case T_CHAR: 2314 case T_BYTE: 2315 case T_SHORT: 2316 field_array[pos++] = TypeInt::INT; 2317 break; 2318 default: 2319 ShouldNotReachHere(); 2320 } 2321 i++; 2322 } 2323 assert(pos == TypeFunc::Parms + arg_cnt, "wrong number of arguments"); 2324 2325 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons(); 2326 } 2327 2328 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) { 2329 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons(); 2330 } 2331 2332 //------------------------------fields----------------------------------------- 2333 // Subroutine call type with space allocated for argument types 2334 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly 2335 const Type **TypeTuple::fields( uint arg_cnt ) { 2336 const Type **flds = (const Type **)(Compile::current()->type_arena()->AmallocWords((TypeFunc::Parms+arg_cnt)*sizeof(Type*) )); 2337 flds[TypeFunc::Control ] = Type::CONTROL; 2338 flds[TypeFunc::I_O ] = Type::ABIO; 2339 flds[TypeFunc::Memory ] = Type::MEMORY; 2340 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM; 2341 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS; 2342 2343 return flds; 2344 } 2345 2346 //------------------------------meet------------------------------------------- 2347 // Compute the MEET of two types. It returns a new Type object. 2348 const Type *TypeTuple::xmeet( const Type *t ) const { 2349 // Perform a fast test for common case; meeting the same types together. 2350 if( this == t ) return this; // Meeting same type-rep? 2351 2352 // Current "this->_base" is Tuple 2353 switch (t->base()) { // switch on original type 2354 2355 case Bottom: // Ye Olde Default 2356 return t; 2357 2358 default: // All else is a mistake 2359 typerr(t); 2360 2361 case Tuple: { // Meeting 2 signatures? 2362 const TypeTuple *x = t->is_tuple(); 2363 assert( _cnt == x->_cnt, "" ); 2364 const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) )); 2365 for( uint i=0; i<_cnt; i++ ) 2366 fields[i] = field_at(i)->xmeet( x->field_at(i) ); 2367 return TypeTuple::make(_cnt,fields); 2368 } 2369 case Top: 2370 break; 2371 } 2372 return this; // Return the double constant 2373 } 2374 2375 //------------------------------xdual------------------------------------------ 2376 // Dual: compute field-by-field dual 2377 const Type *TypeTuple::xdual() const { 2378 const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) )); 2379 for( uint i=0; i<_cnt; i++ ) 2380 fields[i] = _fields[i]->dual(); 2381 return new TypeTuple(_cnt,fields); 2382 } 2383 2384 //------------------------------eq--------------------------------------------- 2385 // Structural equality check for Type representations 2386 bool TypeTuple::eq( const Type *t ) const { 2387 const TypeTuple *s = (const TypeTuple *)t; 2388 if (_cnt != s->_cnt) return false; // Unequal field counts 2389 for (uint i = 0; i < _cnt; i++) 2390 if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION! 2391 return false; // Missed 2392 return true; 2393 } 2394 2395 //------------------------------hash------------------------------------------- 2396 // Type-specific hashing function. 2397 uint TypeTuple::hash(void) const { 2398 uintptr_t sum = _cnt; 2399 for( uint i=0; i<_cnt; i++ ) 2400 sum += (uintptr_t)_fields[i]; // Hash on pointers directly 2401 return (uint)sum; 2402 } 2403 2404 //------------------------------dump2------------------------------------------ 2405 // Dump signature Type 2406 #ifndef PRODUCT 2407 void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const { 2408 st->print("{"); 2409 if( !depth || d[this] ) { // Check for recursive print 2410 st->print("...}"); 2411 return; 2412 } 2413 d.Insert((void*)this, (void*)this); // Stop recursion 2414 if( _cnt ) { 2415 uint i; 2416 for( i=0; i<_cnt-1; i++ ) { 2417 st->print("%d:", i); 2418 _fields[i]->dump2(d, depth-1, st); 2419 st->print(", "); 2420 } 2421 st->print("%d:", i); 2422 _fields[i]->dump2(d, depth-1, st); 2423 } 2424 st->print("}"); 2425 } 2426 #endif 2427 2428 //------------------------------singleton-------------------------------------- 2429 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2430 // constants (Ldi nodes). Singletons are integer, float or double constants 2431 // or a single symbol. 2432 bool TypeTuple::singleton(void) const { 2433 return false; // Never a singleton 2434 } 2435 2436 bool TypeTuple::empty(void) const { 2437 for( uint i=0; i<_cnt; i++ ) { 2438 if (_fields[i]->empty()) return true; 2439 } 2440 return false; 2441 } 2442 2443 //============================================================================= 2444 // Convenience common pre-built types. 2445 2446 inline const TypeInt* normalize_array_size(const TypeInt* size) { 2447 // Certain normalizations keep us sane when comparing types. 2448 // We do not want arrayOop variables to differ only by the wideness 2449 // of their index types. Pick minimum wideness, since that is the 2450 // forced wideness of small ranges anyway. 2451 if (size->_widen != Type::WidenMin) 2452 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin); 2453 else 2454 return size; 2455 } 2456 2457 //------------------------------make------------------------------------------- 2458 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable, 2459 bool flat, bool not_flat, bool not_null_free, bool atomic) { 2460 if (UseCompressedOops && elem->isa_oopptr()) { 2461 elem = elem->make_narrowoop(); 2462 } 2463 size = normalize_array_size(size); 2464 return (TypeAry*)(new TypeAry(elem, size, stable, flat, not_flat, not_null_free, atomic))->hashcons(); 2465 } 2466 2467 //------------------------------meet------------------------------------------- 2468 // Compute the MEET of two types. It returns a new Type object. 2469 const Type *TypeAry::xmeet( const Type *t ) const { 2470 // Perform a fast test for common case; meeting the same types together. 2471 if( this == t ) return this; // Meeting same type-rep? 2472 2473 // Current "this->_base" is Ary 2474 switch (t->base()) { // switch on original type 2475 2476 case Bottom: // Ye Olde Default 2477 return t; 2478 2479 default: // All else is a mistake 2480 typerr(t); 2481 2482 case Array: { // Meeting 2 arrays? 2483 const TypeAry* a = t->is_ary(); 2484 const Type* size = _size->xmeet(a->_size); 2485 const TypeInt* isize = size->isa_int(); 2486 if (isize == nullptr) { 2487 assert(size == Type::TOP || size == Type::BOTTOM, ""); 2488 return size; 2489 } 2490 return TypeAry::make(_elem->meet_speculative(a->_elem), 2491 isize, _stable && a->_stable, 2492 _flat && a->_flat, 2493 _not_flat && a->_not_flat, 2494 _not_null_free && a->_not_null_free, 2495 _atomic && a->_atomic); 2496 } 2497 case Top: 2498 break; 2499 } 2500 return this; // Return the double constant 2501 } 2502 2503 //------------------------------xdual------------------------------------------ 2504 // Dual: compute field-by-field dual 2505 const Type *TypeAry::xdual() const { 2506 const TypeInt* size_dual = _size->dual()->is_int(); 2507 size_dual = normalize_array_size(size_dual); 2508 return new TypeAry(_elem->dual(), size_dual, !_stable, !_flat, !_not_flat, !_not_null_free, !_atomic); 2509 } 2510 2511 //------------------------------eq--------------------------------------------- 2512 // Structural equality check for Type representations 2513 bool TypeAry::eq( const Type *t ) const { 2514 const TypeAry *a = (const TypeAry*)t; 2515 return _elem == a->_elem && 2516 _stable == a->_stable && 2517 _size == a->_size && 2518 _flat == a->_flat && 2519 _not_flat == a->_not_flat && 2520 _not_null_free == a->_not_null_free && 2521 _atomic == a->_atomic; 2522 2523 } 2524 2525 //------------------------------hash------------------------------------------- 2526 // Type-specific hashing function. 2527 uint TypeAry::hash(void) const { 2528 return (uint)(uintptr_t)_elem + (uint)(uintptr_t)_size + (uint)(_stable ? 43 : 0) + 2529 (uint)(_flat ? 44 : 0) + (uint)(_not_flat ? 45 : 0) + (uint)(_not_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0); 2530 } 2531 2532 /** 2533 * Return same type without a speculative part in the element 2534 */ 2535 const TypeAry* TypeAry::remove_speculative() const { 2536 return make(_elem->remove_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic); 2537 } 2538 2539 /** 2540 * Return same type with cleaned up speculative part of element 2541 */ 2542 const Type* TypeAry::cleanup_speculative() const { 2543 return make(_elem->cleanup_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic); 2544 } 2545 2546 /** 2547 * Return same type but with a different inline depth (used for speculation) 2548 * 2549 * @param depth depth to meet with 2550 */ 2551 const TypePtr* TypePtr::with_inline_depth(int depth) const { 2552 if (!UseInlineDepthForSpeculativeTypes) { 2553 return this; 2554 } 2555 return make(AnyPtr, _ptr, _offset, _speculative, depth); 2556 } 2557 2558 //------------------------------dump2------------------------------------------ 2559 #ifndef PRODUCT 2560 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const { 2561 if (_stable) st->print("stable:"); 2562 if (_flat) st->print("flat:"); 2563 if (Verbose) { 2564 if (_not_flat) st->print("not flat:"); 2565 if (_not_null_free) st->print("not null free:"); 2566 } 2567 if (_atomic) st->print("atomic:"); 2568 _elem->dump2(d, depth, st); 2569 st->print("["); 2570 _size->dump2(d, depth, st); 2571 st->print("]"); 2572 } 2573 #endif 2574 2575 //------------------------------singleton-------------------------------------- 2576 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2577 // constants (Ldi nodes). Singletons are integer, float or double constants 2578 // or a single symbol. 2579 bool TypeAry::singleton(void) const { 2580 return false; // Never a singleton 2581 } 2582 2583 bool TypeAry::empty(void) const { 2584 return _elem->empty() || _size->empty(); 2585 } 2586 2587 //--------------------------ary_must_be_exact---------------------------------- 2588 bool TypeAry::ary_must_be_exact() const { 2589 // This logic looks at the element type of an array, and returns true 2590 // if the element type is either a primitive or a final instance class. 2591 // In such cases, an array built on this ary must have no subclasses. 2592 if (_elem == BOTTOM) return false; // general array not exact 2593 if (_elem == TOP ) return false; // inverted general array not exact 2594 const TypeOopPtr* toop = nullptr; 2595 if (UseCompressedOops && _elem->isa_narrowoop()) { 2596 toop = _elem->make_ptr()->isa_oopptr(); 2597 } else { 2598 toop = _elem->isa_oopptr(); 2599 } 2600 if (!toop) return true; // a primitive type, like int 2601 if (!toop->is_loaded()) return false; // unloaded class 2602 const TypeInstPtr* tinst; 2603 if (_elem->isa_narrowoop()) 2604 tinst = _elem->make_ptr()->isa_instptr(); 2605 else 2606 tinst = _elem->isa_instptr(); 2607 if (tinst) { 2608 if (tinst->instance_klass()->is_final()) { 2609 // Even though MyValue is final, [LMyValue is only exact if the array 2610 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue. 2611 // TODO 8350865 If we know that the array can't be null-free, it's allowed to be exact, right? 2612 // If so, we should add '&& !_not_null_free' 2613 if (tinst->is_inlinetypeptr() && (tinst->ptr() != TypePtr::NotNull)) { 2614 return false; 2615 } 2616 return true; 2617 } 2618 return false; 2619 } 2620 const TypeAryPtr* tap; 2621 if (_elem->isa_narrowoop()) 2622 tap = _elem->make_ptr()->isa_aryptr(); 2623 else 2624 tap = _elem->isa_aryptr(); 2625 if (tap) 2626 return tap->ary()->ary_must_be_exact(); 2627 return false; 2628 } 2629 2630 //==============================TypeVect======================================= 2631 // Convenience common pre-built types. 2632 const TypeVect* TypeVect::VECTA = nullptr; // vector length agnostic 2633 const TypeVect* TypeVect::VECTS = nullptr; // 32-bit vectors 2634 const TypeVect* TypeVect::VECTD = nullptr; // 64-bit vectors 2635 const TypeVect* TypeVect::VECTX = nullptr; // 128-bit vectors 2636 const TypeVect* TypeVect::VECTY = nullptr; // 256-bit vectors 2637 const TypeVect* TypeVect::VECTZ = nullptr; // 512-bit vectors 2638 const TypeVect* TypeVect::VECTMASK = nullptr; // predicate/mask vector 2639 2640 //------------------------------make------------------------------------------- 2641 const TypeVect* TypeVect::make(BasicType elem_bt, uint length, bool is_mask) { 2642 if (is_mask) { 2643 return makemask(elem_bt, length); 2644 } 2645 assert(is_java_primitive(elem_bt), "only primitive types in vector"); 2646 assert(Matcher::vector_size_supported(elem_bt, length), "length in range"); 2647 int size = length * type2aelembytes(elem_bt); 2648 switch (Matcher::vector_ideal_reg(size)) { 2649 case Op_VecA: 2650 return (TypeVect*)(new TypeVectA(elem_bt, length))->hashcons(); 2651 case Op_VecS: 2652 return (TypeVect*)(new TypeVectS(elem_bt, length))->hashcons(); 2653 case Op_RegL: 2654 case Op_VecD: 2655 case Op_RegD: 2656 return (TypeVect*)(new TypeVectD(elem_bt, length))->hashcons(); 2657 case Op_VecX: 2658 return (TypeVect*)(new TypeVectX(elem_bt, length))->hashcons(); 2659 case Op_VecY: 2660 return (TypeVect*)(new TypeVectY(elem_bt, length))->hashcons(); 2661 case Op_VecZ: 2662 return (TypeVect*)(new TypeVectZ(elem_bt, length))->hashcons(); 2663 } 2664 ShouldNotReachHere(); 2665 return nullptr; 2666 } 2667 2668 // Create a vector mask type with the given element basic type and length. 2669 // - Returns "TypeVectMask" (PVectMask) for platforms that support the predicate 2670 // feature and it is implemented properly in the backend, allowing the mask to 2671 // be stored in a predicate/mask register. 2672 // - Returns a normal vector type "TypeVectA ~ TypeVectZ" (NVectMask) otherwise, 2673 // where the vector mask is stored in a vector register. 2674 const TypeVect* TypeVect::makemask(BasicType elem_bt, uint length) { 2675 if (Matcher::has_predicated_vectors() && 2676 Matcher::match_rule_supported_vector_masked(Op_VectorLoadMask, length, elem_bt)) { 2677 return TypeVectMask::make(elem_bt, length); 2678 } else { 2679 return make(elem_bt, length); 2680 } 2681 } 2682 2683 //------------------------------meet------------------------------------------- 2684 // Compute the MEET of two types. Since each TypeVect is the only instance of 2685 // its species, meeting often returns itself 2686 const Type* TypeVect::xmeet(const Type* t) const { 2687 // Perform a fast test for common case; meeting the same types together. 2688 if (this == t) { 2689 return this; 2690 } 2691 2692 // Current "this->_base" is Vector 2693 switch (t->base()) { // switch on original type 2694 2695 case Bottom: // Ye Olde Default 2696 return t; 2697 2698 default: // All else is a mistake 2699 typerr(t); 2700 case VectorMask: 2701 case VectorA: 2702 case VectorS: 2703 case VectorD: 2704 case VectorX: 2705 case VectorY: 2706 case VectorZ: { // Meeting 2 vectors? 2707 const TypeVect* v = t->is_vect(); 2708 assert(base() == v->base(), ""); 2709 assert(length() == v->length(), ""); 2710 assert(element_basic_type() == v->element_basic_type(), ""); 2711 return this; 2712 } 2713 case Top: 2714 break; 2715 } 2716 return this; 2717 } 2718 2719 //------------------------------xdual------------------------------------------ 2720 // Since each TypeVect is the only instance of its species, it is self-dual 2721 const Type* TypeVect::xdual() const { 2722 return this; 2723 } 2724 2725 //------------------------------eq--------------------------------------------- 2726 // Structural equality check for Type representations 2727 bool TypeVect::eq(const Type* t) const { 2728 const TypeVect* v = t->is_vect(); 2729 return (element_basic_type() == v->element_basic_type()) && (length() == v->length()); 2730 } 2731 2732 //------------------------------hash------------------------------------------- 2733 // Type-specific hashing function. 2734 uint TypeVect::hash(void) const { 2735 return (uint)base() + (uint)(uintptr_t)_elem_bt + (uint)(uintptr_t)_length; 2736 } 2737 2738 //------------------------------singleton-------------------------------------- 2739 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2740 // constants (Ldi nodes). Vector is singleton if all elements are the same 2741 // constant value (when vector is created with Replicate code). 2742 bool TypeVect::singleton(void) const { 2743 // There is no Con node for vectors yet. 2744 // return _elem->singleton(); 2745 return false; 2746 } 2747 2748 bool TypeVect::empty(void) const { 2749 return false; 2750 } 2751 2752 //------------------------------dump2------------------------------------------ 2753 #ifndef PRODUCT 2754 void TypeVect::dump2(Dict& d, uint depth, outputStream* st) const { 2755 switch (base()) { 2756 case VectorA: 2757 st->print("vectora"); break; 2758 case VectorS: 2759 st->print("vectors"); break; 2760 case VectorD: 2761 st->print("vectord"); break; 2762 case VectorX: 2763 st->print("vectorx"); break; 2764 case VectorY: 2765 st->print("vectory"); break; 2766 case VectorZ: 2767 st->print("vectorz"); break; 2768 case VectorMask: 2769 st->print("vectormask"); break; 2770 default: 2771 ShouldNotReachHere(); 2772 } 2773 st->print("<%c,%u>", type2char(element_basic_type()), length()); 2774 } 2775 #endif 2776 2777 const TypeVectMask* TypeVectMask::make(const BasicType elem_bt, uint length) { 2778 return (TypeVectMask*) (new TypeVectMask(elem_bt, length))->hashcons(); 2779 } 2780 2781 //============================================================================= 2782 // Convenience common pre-built types. 2783 const TypePtr *TypePtr::NULL_PTR; 2784 const TypePtr *TypePtr::NOTNULL; 2785 const TypePtr *TypePtr::BOTTOM; 2786 2787 //------------------------------meet------------------------------------------- 2788 // Meet over the PTR enum 2789 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = { 2790 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, 2791 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,}, 2792 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,}, 2793 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,}, 2794 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,}, 2795 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,}, 2796 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,} 2797 }; 2798 2799 //------------------------------make------------------------------------------- 2800 const TypePtr* TypePtr::make(TYPES t, enum PTR ptr, Offset offset, const TypePtr* speculative, int inline_depth) { 2801 return (TypePtr*)(new TypePtr(t,ptr,offset, speculative, inline_depth))->hashcons(); 2802 } 2803 2804 //------------------------------cast_to_ptr_type------------------------------- 2805 const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const { 2806 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type"); 2807 if( ptr == _ptr ) return this; 2808 return make(_base, ptr, _offset, _speculative, _inline_depth); 2809 } 2810 2811 //------------------------------get_con---------------------------------------- 2812 intptr_t TypePtr::get_con() const { 2813 assert( _ptr == Null, "" ); 2814 return offset(); 2815 } 2816 2817 //------------------------------meet------------------------------------------- 2818 // Compute the MEET of two types. It returns a new Type object. 2819 const Type *TypePtr::xmeet(const Type *t) const { 2820 const Type* res = xmeet_helper(t); 2821 if (res->isa_ptr() == nullptr) { 2822 return res; 2823 } 2824 2825 const TypePtr* res_ptr = res->is_ptr(); 2826 if (res_ptr->speculative() != nullptr) { 2827 // type->speculative() is null means that speculation is no better 2828 // than type, i.e. type->speculative() == type. So there are 2 2829 // ways to represent the fact that we have no useful speculative 2830 // data and we should use a single one to be able to test for 2831 // equality between types. Check whether type->speculative() == 2832 // type and set speculative to null if it is the case. 2833 if (res_ptr->remove_speculative() == res_ptr->speculative()) { 2834 return res_ptr->remove_speculative(); 2835 } 2836 } 2837 2838 return res; 2839 } 2840 2841 const Type *TypePtr::xmeet_helper(const Type *t) const { 2842 // Perform a fast test for common case; meeting the same types together. 2843 if( this == t ) return this; // Meeting same type-rep? 2844 2845 // Current "this->_base" is AnyPtr 2846 switch (t->base()) { // switch on original type 2847 case Int: // Mixing ints & oops happens when javac 2848 case Long: // reuses local variables 2849 case HalfFloatTop: 2850 case HalfFloatCon: 2851 case HalfFloatBot: 2852 case FloatTop: 2853 case FloatCon: 2854 case FloatBot: 2855 case DoubleTop: 2856 case DoubleCon: 2857 case DoubleBot: 2858 case NarrowOop: 2859 case NarrowKlass: 2860 case Bottom: // Ye Olde Default 2861 return Type::BOTTOM; 2862 case Top: 2863 return this; 2864 2865 case AnyPtr: { // Meeting to AnyPtrs 2866 const TypePtr *tp = t->is_ptr(); 2867 const TypePtr* speculative = xmeet_speculative(tp); 2868 int depth = meet_inline_depth(tp->inline_depth()); 2869 return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth); 2870 } 2871 case RawPtr: // For these, flip the call around to cut down 2872 case OopPtr: 2873 case InstPtr: // on the cases I have to handle. 2874 case AryPtr: 2875 case MetadataPtr: 2876 case KlassPtr: 2877 case InstKlassPtr: 2878 case AryKlassPtr: 2879 return t->xmeet(this); // Call in reverse direction 2880 default: // All else is a mistake 2881 typerr(t); 2882 2883 } 2884 return this; 2885 } 2886 2887 //------------------------------meet_offset------------------------------------ 2888 Type::Offset TypePtr::meet_offset(int offset) const { 2889 return _offset.meet(Offset(offset)); 2890 } 2891 2892 //------------------------------dual_offset------------------------------------ 2893 Type::Offset TypePtr::dual_offset() const { 2894 return _offset.dual(); 2895 } 2896 2897 //------------------------------xdual------------------------------------------ 2898 // Dual: compute field-by-field dual 2899 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = { 2900 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR 2901 }; 2902 2903 const TypePtr::FlatInArray TypePtr::flat_in_array_dual[Uninitialized] = { 2904 /* TopFlat -> */ MaybeFlat, 2905 /* Flat -> */ NotFlat, 2906 /* NotFlat -> */ Flat, 2907 /* MaybeFlat -> */ TopFlat 2908 }; 2909 2910 const char* const TypePtr::flat_in_array_msg[Uninitialized] = { 2911 "TOP flat in array", "flat in array", "not flat in array", "maybe flat in array" 2912 }; 2913 2914 const Type *TypePtr::xdual() const { 2915 return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), dual_speculative(), dual_inline_depth()); 2916 } 2917 2918 //------------------------------xadd_offset------------------------------------ 2919 Type::Offset TypePtr::xadd_offset(intptr_t offset) const { 2920 return _offset.add(offset); 2921 } 2922 2923 //------------------------------add_offset------------------------------------- 2924 const TypePtr *TypePtr::add_offset( intptr_t offset ) const { 2925 return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth); 2926 } 2927 2928 const TypePtr *TypePtr::with_offset(intptr_t offset) const { 2929 return make(AnyPtr, _ptr, Offset(offset), _speculative, _inline_depth); 2930 } 2931 2932 //------------------------------eq--------------------------------------------- 2933 // Structural equality check for Type representations 2934 bool TypePtr::eq( const Type *t ) const { 2935 const TypePtr *a = (const TypePtr*)t; 2936 return _ptr == a->ptr() && _offset == a->_offset && eq_speculative(a) && _inline_depth == a->_inline_depth; 2937 } 2938 2939 //------------------------------hash------------------------------------------- 2940 // Type-specific hashing function. 2941 uint TypePtr::hash(void) const { 2942 return (uint)_ptr + (uint)offset() + (uint)hash_speculative() + (uint)_inline_depth; 2943 } 2944 2945 /** 2946 * Return same type without a speculative part 2947 */ 2948 const TypePtr* TypePtr::remove_speculative() const { 2949 if (_speculative == nullptr) { 2950 return this; 2951 } 2952 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 2953 return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth); 2954 } 2955 2956 /** 2957 * Return same type but drop speculative part if we know we won't use 2958 * it 2959 */ 2960 const Type* TypePtr::cleanup_speculative() const { 2961 if (speculative() == nullptr) { 2962 return this; 2963 } 2964 const Type* no_spec = remove_speculative(); 2965 // If this is NULL_PTR then we don't need the speculative type 2966 // (with_inline_depth in case the current type inline depth is 2967 // InlineDepthTop) 2968 if (no_spec == NULL_PTR->with_inline_depth(inline_depth())) { 2969 return no_spec; 2970 } 2971 if (above_centerline(speculative()->ptr())) { 2972 return no_spec; 2973 } 2974 const TypeOopPtr* spec_oopptr = speculative()->isa_oopptr(); 2975 // If the speculative may be null and is an inexact klass then it 2976 // doesn't help 2977 if (speculative() != TypePtr::NULL_PTR && speculative()->maybe_null() && 2978 (spec_oopptr == nullptr || !spec_oopptr->klass_is_exact())) { 2979 return no_spec; 2980 } 2981 return this; 2982 } 2983 2984 /** 2985 * dual of the speculative part of the type 2986 */ 2987 const TypePtr* TypePtr::dual_speculative() const { 2988 if (_speculative == nullptr) { 2989 return nullptr; 2990 } 2991 return _speculative->dual()->is_ptr(); 2992 } 2993 2994 /** 2995 * meet of the speculative parts of 2 types 2996 * 2997 * @param other type to meet with 2998 */ 2999 const TypePtr* TypePtr::xmeet_speculative(const TypePtr* other) const { 3000 bool this_has_spec = (_speculative != nullptr); 3001 bool other_has_spec = (other->speculative() != nullptr); 3002 3003 if (!this_has_spec && !other_has_spec) { 3004 return nullptr; 3005 } 3006 3007 // If we are at a point where control flow meets and one branch has 3008 // a speculative type and the other has not, we meet the speculative 3009 // type of one branch with the actual type of the other. If the 3010 // actual type is exact and the speculative is as well, then the 3011 // result is a speculative type which is exact and we can continue 3012 // speculation further. 3013 const TypePtr* this_spec = _speculative; 3014 const TypePtr* other_spec = other->speculative(); 3015 3016 if (!this_has_spec) { 3017 this_spec = this; 3018 } 3019 3020 if (!other_has_spec) { 3021 other_spec = other; 3022 } 3023 3024 return this_spec->meet(other_spec)->is_ptr(); 3025 } 3026 3027 /** 3028 * dual of the inline depth for this type (used for speculation) 3029 */ 3030 int TypePtr::dual_inline_depth() const { 3031 return -inline_depth(); 3032 } 3033 3034 /** 3035 * meet of 2 inline depths (used for speculation) 3036 * 3037 * @param depth depth to meet with 3038 */ 3039 int TypePtr::meet_inline_depth(int depth) const { 3040 return MAX2(inline_depth(), depth); 3041 } 3042 3043 /** 3044 * Are the speculative parts of 2 types equal? 3045 * 3046 * @param other type to compare this one to 3047 */ 3048 bool TypePtr::eq_speculative(const TypePtr* other) const { 3049 if (_speculative == nullptr || other->speculative() == nullptr) { 3050 return _speculative == other->speculative(); 3051 } 3052 3053 if (_speculative->base() != other->speculative()->base()) { 3054 return false; 3055 } 3056 3057 return _speculative->eq(other->speculative()); 3058 } 3059 3060 /** 3061 * Hash of the speculative part of the type 3062 */ 3063 int TypePtr::hash_speculative() const { 3064 if (_speculative == nullptr) { 3065 return 0; 3066 } 3067 3068 return _speculative->hash(); 3069 } 3070 3071 /** 3072 * add offset to the speculative part of the type 3073 * 3074 * @param offset offset to add 3075 */ 3076 const TypePtr* TypePtr::add_offset_speculative(intptr_t offset) const { 3077 if (_speculative == nullptr) { 3078 return nullptr; 3079 } 3080 return _speculative->add_offset(offset)->is_ptr(); 3081 } 3082 3083 const TypePtr* TypePtr::with_offset_speculative(intptr_t offset) const { 3084 if (_speculative == nullptr) { 3085 return nullptr; 3086 } 3087 return _speculative->with_offset(offset)->is_ptr(); 3088 } 3089 3090 /** 3091 * return exact klass from the speculative type if there's one 3092 */ 3093 ciKlass* TypePtr::speculative_type() const { 3094 if (_speculative != nullptr && _speculative->isa_oopptr()) { 3095 const TypeOopPtr* speculative = _speculative->join(this)->is_oopptr(); 3096 if (speculative->klass_is_exact()) { 3097 return speculative->exact_klass(); 3098 } 3099 } 3100 return nullptr; 3101 } 3102 3103 /** 3104 * return true if speculative type may be null 3105 */ 3106 bool TypePtr::speculative_maybe_null() const { 3107 if (_speculative != nullptr) { 3108 const TypePtr* speculative = _speculative->join(this)->is_ptr(); 3109 return speculative->maybe_null(); 3110 } 3111 return true; 3112 } 3113 3114 bool TypePtr::speculative_always_null() const { 3115 if (_speculative != nullptr) { 3116 const TypePtr* speculative = _speculative->join(this)->is_ptr(); 3117 return speculative == TypePtr::NULL_PTR; 3118 } 3119 return false; 3120 } 3121 3122 /** 3123 * Same as TypePtr::speculative_type() but return the klass only if 3124 * the speculative tells us is not null 3125 */ 3126 ciKlass* TypePtr::speculative_type_not_null() const { 3127 if (speculative_maybe_null()) { 3128 return nullptr; 3129 } 3130 return speculative_type(); 3131 } 3132 3133 /** 3134 * Check whether new profiling would improve speculative type 3135 * 3136 * @param exact_kls class from profiling 3137 * @param inline_depth inlining depth of profile point 3138 * 3139 * @return true if type profile is valuable 3140 */ 3141 bool TypePtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { 3142 // no profiling? 3143 if (exact_kls == nullptr) { 3144 return false; 3145 } 3146 if (speculative() == TypePtr::NULL_PTR) { 3147 return false; 3148 } 3149 // no speculative type or non exact speculative type? 3150 if (speculative_type() == nullptr) { 3151 return true; 3152 } 3153 // If the node already has an exact speculative type keep it, 3154 // unless it was provided by profiling that is at a deeper 3155 // inlining level. Profiling at a higher inlining depth is 3156 // expected to be less accurate. 3157 if (_speculative->inline_depth() == InlineDepthBottom) { 3158 return false; 3159 } 3160 assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison"); 3161 return inline_depth < _speculative->inline_depth(); 3162 } 3163 3164 /** 3165 * Check whether new profiling would improve ptr (= tells us it is non 3166 * null) 3167 * 3168 * @param ptr_kind always null or not null? 3169 * 3170 * @return true if ptr profile is valuable 3171 */ 3172 bool TypePtr::would_improve_ptr(ProfilePtrKind ptr_kind) const { 3173 // profiling doesn't tell us anything useful 3174 if (ptr_kind != ProfileAlwaysNull && ptr_kind != ProfileNeverNull) { 3175 return false; 3176 } 3177 // We already know this is not null 3178 if (!this->maybe_null()) { 3179 return false; 3180 } 3181 // We already know the speculative type cannot be null 3182 if (!speculative_maybe_null()) { 3183 return false; 3184 } 3185 // We already know this is always null 3186 if (this == TypePtr::NULL_PTR) { 3187 return false; 3188 } 3189 // We already know the speculative type is always null 3190 if (speculative_always_null()) { 3191 return false; 3192 } 3193 if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) { 3194 return false; 3195 } 3196 return true; 3197 } 3198 3199 TypePtr::FlatInArray TypePtr::compute_flat_in_array(ciInstanceKlass* instance_klass, bool is_exact) { 3200 if (!instance_klass->can_be_inline_klass(is_exact)) { 3201 // Definitely not a value class and thus never flat in an array. 3202 return NotFlat; 3203 } 3204 if (instance_klass->is_inlinetype() && instance_klass->as_inline_klass()->is_always_flat_in_array()) { 3205 return Flat; 3206 } 3207 // We don't know. 3208 return MaybeFlat; 3209 } 3210 3211 // Compute flat in array property if we don't know anything about it (i.e. old_flat_in_array == MaybeFlat). 3212 TypePtr::FlatInArray TypePtr::compute_flat_in_array_if_unknown(ciInstanceKlass* instance_klass, bool is_exact, 3213 FlatInArray old_flat_in_array) { 3214 // It is tempting to add verification code that "NotFlat == no value class" and "Flat == value class". 3215 // However, with type speculation, we could get contradicting flat in array properties that propagate through the 3216 // graph. We could try to stop the introduction of contradicting speculative types in terms of their flat in array 3217 // property. But this is hard because it is sometimes only recognized further down in the graph. Thus, we let an 3218 // inconsistent flat in array property propagating through the graph. This could lead to fold an actual live path 3219 // away. But in this case, the speculated type is wrong and we would trap earlier. 3220 if (old_flat_in_array == MaybeFlat) { 3221 return compute_flat_in_array(instance_klass, is_exact); 3222 } 3223 return old_flat_in_array; 3224 } 3225 3226 //------------------------------dump2------------------------------------------ 3227 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = { 3228 "TopPTR","AnyNull","Constant","null","NotNull","BotPTR" 3229 }; 3230 3231 #ifndef PRODUCT 3232 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const { 3233 st->print("ptr:%s", ptr_msg[_ptr]); 3234 dump_offset(st); 3235 dump_inline_depth(st); 3236 dump_speculative(st); 3237 } 3238 3239 void TypePtr::dump_offset(outputStream* st) const { 3240 _offset.dump2(st); 3241 } 3242 3243 /** 3244 *dump the speculative part of the type 3245 */ 3246 void TypePtr::dump_speculative(outputStream *st) const { 3247 if (_speculative != nullptr) { 3248 st->print(" (speculative="); 3249 _speculative->dump_on(st); 3250 st->print(")"); 3251 } 3252 } 3253 3254 /** 3255 *dump the inline depth of the type 3256 */ 3257 void TypePtr::dump_inline_depth(outputStream *st) const { 3258 if (_inline_depth != InlineDepthBottom) { 3259 if (_inline_depth == InlineDepthTop) { 3260 st->print(" (inline_depth=InlineDepthTop)"); 3261 } else { 3262 st->print(" (inline_depth=%d)", _inline_depth); 3263 } 3264 } 3265 } 3266 3267 void TypePtr::dump_flat_in_array(FlatInArray flat_in_array, outputStream* st) { 3268 switch (flat_in_array) { 3269 case MaybeFlat: 3270 case NotFlat: 3271 if (!Verbose) { 3272 break; 3273 } 3274 case TopFlat: 3275 case Flat: 3276 st->print(" (%s)", flat_in_array_msg[flat_in_array]); 3277 break; 3278 default: 3279 ShouldNotReachHere(); 3280 } 3281 } 3282 #endif 3283 3284 //------------------------------singleton-------------------------------------- 3285 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 3286 // constants 3287 bool TypePtr::singleton(void) const { 3288 // TopPTR, Null, AnyNull, Constant are all singletons 3289 return (_offset != Offset::bottom) && !below_centerline(_ptr); 3290 } 3291 3292 bool TypePtr::empty(void) const { 3293 return (_offset == Offset::top) || above_centerline(_ptr); 3294 } 3295 3296 //============================================================================= 3297 // Convenience common pre-built types. 3298 const TypeRawPtr *TypeRawPtr::BOTTOM; 3299 const TypeRawPtr *TypeRawPtr::NOTNULL; 3300 3301 //------------------------------make------------------------------------------- 3302 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) { 3303 assert( ptr != Constant, "what is the constant?" ); 3304 assert( ptr != Null, "Use TypePtr for null" ); 3305 return (TypeRawPtr*)(new TypeRawPtr(ptr,nullptr))->hashcons(); 3306 } 3307 3308 const TypeRawPtr *TypeRawPtr::make(address bits) { 3309 assert(bits != nullptr, "Use TypePtr for null"); 3310 return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons(); 3311 } 3312 3313 //------------------------------cast_to_ptr_type------------------------------- 3314 const TypeRawPtr* TypeRawPtr::cast_to_ptr_type(PTR ptr) const { 3315 assert( ptr != Constant, "what is the constant?" ); 3316 assert( ptr != Null, "Use TypePtr for null" ); 3317 assert( _bits == nullptr, "Why cast a constant address?"); 3318 if( ptr == _ptr ) return this; 3319 return make(ptr); 3320 } 3321 3322 //------------------------------get_con---------------------------------------- 3323 intptr_t TypeRawPtr::get_con() const { 3324 assert( _ptr == Null || _ptr == Constant, "" ); 3325 return (intptr_t)_bits; 3326 } 3327 3328 //------------------------------meet------------------------------------------- 3329 // Compute the MEET of two types. It returns a new Type object. 3330 const Type *TypeRawPtr::xmeet( const Type *t ) const { 3331 // Perform a fast test for common case; meeting the same types together. 3332 if( this == t ) return this; // Meeting same type-rep? 3333 3334 // Current "this->_base" is RawPtr 3335 switch( t->base() ) { // switch on original type 3336 case Bottom: // Ye Olde Default 3337 return t; 3338 case Top: 3339 return this; 3340 case AnyPtr: // Meeting to AnyPtrs 3341 break; 3342 case RawPtr: { // might be top, bot, any/not or constant 3343 enum PTR tptr = t->is_ptr()->ptr(); 3344 enum PTR ptr = meet_ptr( tptr ); 3345 if( ptr == Constant ) { // Cannot be equal constants, so... 3346 if( tptr == Constant && _ptr != Constant) return t; 3347 if( _ptr == Constant && tptr != Constant) return this; 3348 ptr = NotNull; // Fall down in lattice 3349 } 3350 return make( ptr ); 3351 } 3352 3353 case OopPtr: 3354 case InstPtr: 3355 case AryPtr: 3356 case MetadataPtr: 3357 case KlassPtr: 3358 case InstKlassPtr: 3359 case AryKlassPtr: 3360 return TypePtr::BOTTOM; // Oop meet raw is not well defined 3361 default: // All else is a mistake 3362 typerr(t); 3363 } 3364 3365 // Found an AnyPtr type vs self-RawPtr type 3366 const TypePtr *tp = t->is_ptr(); 3367 switch (tp->ptr()) { 3368 case TypePtr::TopPTR: return this; 3369 case TypePtr::BotPTR: return t; 3370 case TypePtr::Null: 3371 if( _ptr == TypePtr::TopPTR ) return t; 3372 return TypeRawPtr::BOTTOM; 3373 case TypePtr::NotNull: return TypePtr::make(AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0), tp->speculative(), tp->inline_depth()); 3374 case TypePtr::AnyNull: 3375 if( _ptr == TypePtr::Constant) return this; 3376 return make( meet_ptr(TypePtr::AnyNull) ); 3377 default: ShouldNotReachHere(); 3378 } 3379 return this; 3380 } 3381 3382 //------------------------------xdual------------------------------------------ 3383 // Dual: compute field-by-field dual 3384 const Type *TypeRawPtr::xdual() const { 3385 return new TypeRawPtr( dual_ptr(), _bits ); 3386 } 3387 3388 //------------------------------add_offset------------------------------------- 3389 const TypePtr* TypeRawPtr::add_offset(intptr_t offset) const { 3390 if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer 3391 if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer 3392 if( offset == 0 ) return this; // No change 3393 switch (_ptr) { 3394 case TypePtr::TopPTR: 3395 case TypePtr::BotPTR: 3396 case TypePtr::NotNull: 3397 return this; 3398 case TypePtr::Constant: { 3399 uintptr_t bits = (uintptr_t)_bits; 3400 uintptr_t sum = bits + offset; 3401 if (( offset < 0 ) 3402 ? ( sum > bits ) // Underflow? 3403 : ( sum < bits )) { // Overflow? 3404 return BOTTOM; 3405 } else if ( sum == 0 ) { 3406 return TypePtr::NULL_PTR; 3407 } else { 3408 return make( (address)sum ); 3409 } 3410 } 3411 default: ShouldNotReachHere(); 3412 } 3413 } 3414 3415 //------------------------------eq--------------------------------------------- 3416 // Structural equality check for Type representations 3417 bool TypeRawPtr::eq( const Type *t ) const { 3418 const TypeRawPtr *a = (const TypeRawPtr*)t; 3419 return _bits == a->_bits && TypePtr::eq(t); 3420 } 3421 3422 //------------------------------hash------------------------------------------- 3423 // Type-specific hashing function. 3424 uint TypeRawPtr::hash(void) const { 3425 return (uint)(uintptr_t)_bits + (uint)TypePtr::hash(); 3426 } 3427 3428 //------------------------------dump2------------------------------------------ 3429 #ifndef PRODUCT 3430 void TypeRawPtr::dump2(Dict& d, uint depth, outputStream* st) const { 3431 if (_ptr == Constant) { 3432 st->print("rawptr:Constant:" INTPTR_FORMAT, p2i(_bits)); 3433 } else { 3434 st->print("rawptr:%s", ptr_msg[_ptr]); 3435 } 3436 } 3437 #endif 3438 3439 //============================================================================= 3440 // Convenience common pre-built type. 3441 const TypeOopPtr *TypeOopPtr::BOTTOM; 3442 3443 TypeInterfaces::TypeInterfaces(ciInstanceKlass** interfaces_base, int nb_interfaces) 3444 : Type(Interfaces), _interfaces(interfaces_base, nb_interfaces), 3445 _hash(0), _exact_klass(nullptr) { 3446 _interfaces.sort(compare); 3447 initialize(); 3448 } 3449 3450 const TypeInterfaces* TypeInterfaces::make(GrowableArray<ciInstanceKlass*>* interfaces) { 3451 // hashcons() can only delete the last thing that was allocated: to 3452 // make sure all memory for the newly created TypeInterfaces can be 3453 // freed if an identical one exists, allocate space for the array of 3454 // interfaces right after the TypeInterfaces object so that they 3455 // form a contiguous piece of memory. 3456 int nb_interfaces = interfaces == nullptr ? 0 : interfaces->length(); 3457 size_t total_size = sizeof(TypeInterfaces) + nb_interfaces * sizeof(ciInstanceKlass*); 3458 3459 void* allocated_mem = operator new(total_size); 3460 ciInstanceKlass** interfaces_base = (ciInstanceKlass**)((char*)allocated_mem + sizeof(TypeInterfaces)); 3461 for (int i = 0; i < nb_interfaces; ++i) { 3462 interfaces_base[i] = interfaces->at(i); 3463 } 3464 TypeInterfaces* result = ::new (allocated_mem) TypeInterfaces(interfaces_base, nb_interfaces); 3465 return (const TypeInterfaces*)result->hashcons(); 3466 } 3467 3468 void TypeInterfaces::initialize() { 3469 compute_hash(); 3470 compute_exact_klass(); 3471 DEBUG_ONLY(_initialized = true;) 3472 } 3473 3474 int TypeInterfaces::compare(ciInstanceKlass* const& k1, ciInstanceKlass* const& k2) { 3475 if ((intptr_t)k1 < (intptr_t)k2) { 3476 return -1; 3477 } else if ((intptr_t)k1 > (intptr_t)k2) { 3478 return 1; 3479 } 3480 return 0; 3481 } 3482 3483 int TypeInterfaces::compare(ciInstanceKlass** k1, ciInstanceKlass** k2) { 3484 return compare(*k1, *k2); 3485 } 3486 3487 bool TypeInterfaces::eq(const Type* t) const { 3488 const TypeInterfaces* other = (const TypeInterfaces*)t; 3489 if (_interfaces.length() != other->_interfaces.length()) { 3490 return false; 3491 } 3492 for (int i = 0; i < _interfaces.length(); i++) { 3493 ciKlass* k1 = _interfaces.at(i); 3494 ciKlass* k2 = other->_interfaces.at(i); 3495 if (!k1->equals(k2)) { 3496 return false; 3497 } 3498 } 3499 return true; 3500 } 3501 3502 bool TypeInterfaces::eq(ciInstanceKlass* k) const { 3503 assert(k->is_loaded(), "should be loaded"); 3504 GrowableArray<ciInstanceKlass *>* interfaces = k->transitive_interfaces(); 3505 if (_interfaces.length() != interfaces->length()) { 3506 return false; 3507 } 3508 for (int i = 0; i < interfaces->length(); i++) { 3509 bool found = false; 3510 _interfaces.find_sorted<ciInstanceKlass*, compare>(interfaces->at(i), found); 3511 if (!found) { 3512 return false; 3513 } 3514 } 3515 return true; 3516 } 3517 3518 3519 uint TypeInterfaces::hash() const { 3520 assert(_initialized, "must be"); 3521 return _hash; 3522 } 3523 3524 const Type* TypeInterfaces::xdual() const { 3525 return this; 3526 } 3527 3528 void TypeInterfaces::compute_hash() { 3529 uint hash = 0; 3530 for (int i = 0; i < _interfaces.length(); i++) { 3531 ciKlass* k = _interfaces.at(i); 3532 hash += k->hash(); 3533 } 3534 _hash = hash; 3535 } 3536 3537 static int compare_interfaces(ciInstanceKlass** k1, ciInstanceKlass** k2) { 3538 return (int)((*k1)->ident() - (*k2)->ident()); 3539 } 3540 3541 void TypeInterfaces::dump(outputStream* st) const { 3542 if (_interfaces.length() == 0) { 3543 return; 3544 } 3545 ResourceMark rm; 3546 st->print(" ("); 3547 GrowableArray<ciInstanceKlass*> interfaces; 3548 interfaces.appendAll(&_interfaces); 3549 // Sort the interfaces so they are listed in the same order from one run to the other of the same compilation 3550 interfaces.sort(compare_interfaces); 3551 for (int i = 0; i < interfaces.length(); i++) { 3552 if (i > 0) { 3553 st->print(","); 3554 } 3555 ciKlass* k = interfaces.at(i); 3556 k->print_name_on(st); 3557 } 3558 st->print(")"); 3559 } 3560 3561 #ifdef ASSERT 3562 void TypeInterfaces::verify() const { 3563 for (int i = 1; i < _interfaces.length(); i++) { 3564 ciInstanceKlass* k1 = _interfaces.at(i-1); 3565 ciInstanceKlass* k2 = _interfaces.at(i); 3566 assert(compare(k2, k1) > 0, "should be ordered"); 3567 assert(k1 != k2, "no duplicate"); 3568 } 3569 } 3570 #endif 3571 3572 const TypeInterfaces* TypeInterfaces::union_with(const TypeInterfaces* other) const { 3573 GrowableArray<ciInstanceKlass*> result_list; 3574 int i = 0; 3575 int j = 0; 3576 while (i < _interfaces.length() || j < other->_interfaces.length()) { 3577 while (i < _interfaces.length() && 3578 (j >= other->_interfaces.length() || 3579 compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) { 3580 result_list.push(_interfaces.at(i)); 3581 i++; 3582 } 3583 while (j < other->_interfaces.length() && 3584 (i >= _interfaces.length() || 3585 compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) { 3586 result_list.push(other->_interfaces.at(j)); 3587 j++; 3588 } 3589 if (i < _interfaces.length() && 3590 j < other->_interfaces.length() && 3591 _interfaces.at(i) == other->_interfaces.at(j)) { 3592 result_list.push(_interfaces.at(i)); 3593 i++; 3594 j++; 3595 } 3596 } 3597 const TypeInterfaces* result = TypeInterfaces::make(&result_list); 3598 #ifdef ASSERT 3599 result->verify(); 3600 for (int i = 0; i < _interfaces.length(); i++) { 3601 assert(result->_interfaces.contains(_interfaces.at(i)), "missing"); 3602 } 3603 for (int i = 0; i < other->_interfaces.length(); i++) { 3604 assert(result->_interfaces.contains(other->_interfaces.at(i)), "missing"); 3605 } 3606 for (int i = 0; i < result->_interfaces.length(); i++) { 3607 assert(_interfaces.contains(result->_interfaces.at(i)) || other->_interfaces.contains(result->_interfaces.at(i)), "missing"); 3608 } 3609 #endif 3610 return result; 3611 } 3612 3613 const TypeInterfaces* TypeInterfaces::intersection_with(const TypeInterfaces* other) const { 3614 GrowableArray<ciInstanceKlass*> result_list; 3615 int i = 0; 3616 int j = 0; 3617 while (i < _interfaces.length() || j < other->_interfaces.length()) { 3618 while (i < _interfaces.length() && 3619 (j >= other->_interfaces.length() || 3620 compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) { 3621 i++; 3622 } 3623 while (j < other->_interfaces.length() && 3624 (i >= _interfaces.length() || 3625 compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) { 3626 j++; 3627 } 3628 if (i < _interfaces.length() && 3629 j < other->_interfaces.length() && 3630 _interfaces.at(i) == other->_interfaces.at(j)) { 3631 result_list.push(_interfaces.at(i)); 3632 i++; 3633 j++; 3634 } 3635 } 3636 const TypeInterfaces* result = TypeInterfaces::make(&result_list); 3637 #ifdef ASSERT 3638 result->verify(); 3639 for (int i = 0; i < _interfaces.length(); i++) { 3640 assert(!other->_interfaces.contains(_interfaces.at(i)) || result->_interfaces.contains(_interfaces.at(i)), "missing"); 3641 } 3642 for (int i = 0; i < other->_interfaces.length(); i++) { 3643 assert(!_interfaces.contains(other->_interfaces.at(i)) || result->_interfaces.contains(other->_interfaces.at(i)), "missing"); 3644 } 3645 for (int i = 0; i < result->_interfaces.length(); i++) { 3646 assert(_interfaces.contains(result->_interfaces.at(i)) && other->_interfaces.contains(result->_interfaces.at(i)), "missing"); 3647 } 3648 #endif 3649 return result; 3650 } 3651 3652 // Is there a single ciKlass* that can represent the interface set? 3653 ciInstanceKlass* TypeInterfaces::exact_klass() const { 3654 assert(_initialized, "must be"); 3655 return _exact_klass; 3656 } 3657 3658 void TypeInterfaces::compute_exact_klass() { 3659 if (_interfaces.length() == 0) { 3660 _exact_klass = nullptr; 3661 return; 3662 } 3663 ciInstanceKlass* res = nullptr; 3664 for (int i = 0; i < _interfaces.length(); i++) { 3665 ciInstanceKlass* interface = _interfaces.at(i); 3666 if (eq(interface)) { 3667 assert(res == nullptr, ""); 3668 res = interface; 3669 } 3670 } 3671 _exact_klass = res; 3672 } 3673 3674 #ifdef ASSERT 3675 void TypeInterfaces::verify_is_loaded() const { 3676 for (int i = 0; i < _interfaces.length(); i++) { 3677 ciKlass* interface = _interfaces.at(i); 3678 assert(interface->is_loaded(), "Interface not loaded"); 3679 } 3680 } 3681 #endif 3682 3683 // Can't be implemented because there's no way to know if the type is above or below the center line. 3684 const Type* TypeInterfaces::xmeet(const Type* t) const { 3685 ShouldNotReachHere(); 3686 return Type::xmeet(t); 3687 } 3688 3689 bool TypeInterfaces::singleton(void) const { 3690 ShouldNotReachHere(); 3691 return Type::singleton(); 3692 } 3693 3694 bool TypeInterfaces::has_non_array_interface() const { 3695 assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?"); 3696 3697 return !TypeAryPtr::_array_interfaces->contains(this); 3698 } 3699 3700 //------------------------------TypeOopPtr------------------------------------- 3701 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset offset, Offset field_offset, 3702 int instance_id, const TypePtr* speculative, int inline_depth) 3703 : TypePtr(t, ptr, offset, speculative, inline_depth), 3704 _const_oop(o), _klass(k), 3705 _interfaces(interfaces), 3706 _klass_is_exact(xk), 3707 _is_ptr_to_narrowoop(false), 3708 _is_ptr_to_narrowklass(false), 3709 _is_ptr_to_boxed_value(false), 3710 _is_ptr_to_strict_final_field(false), 3711 _instance_id(instance_id) { 3712 #ifdef ASSERT 3713 if (klass() != nullptr && klass()->is_loaded()) { 3714 interfaces->verify_is_loaded(); 3715 } 3716 #endif 3717 if (Compile::current()->eliminate_boxing() && (t == InstPtr) && 3718 (offset.get() > 0) && xk && (k != nullptr) && k->is_instance_klass()) { 3719 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset.get()); 3720 _is_ptr_to_strict_final_field = _is_ptr_to_boxed_value; 3721 } 3722 3723 if (klass() != nullptr && klass()->is_instance_klass() && klass()->is_loaded() && 3724 this->offset() != Type::OffsetBot && this->offset() != Type::OffsetTop) { 3725 ciField* field = klass()->as_instance_klass()->get_field_by_offset(this->offset(), false); 3726 if (field != nullptr && field->is_strict() && field->is_final()) { 3727 _is_ptr_to_strict_final_field = true; 3728 } 3729 } 3730 3731 #ifdef _LP64 3732 if (this->offset() > 0 || this->offset() == Type::OffsetTop || this->offset() == Type::OffsetBot) { 3733 if (this->offset() == oopDesc::klass_offset_in_bytes()) { 3734 _is_ptr_to_narrowklass = UseCompressedClassPointers; 3735 } else if (klass() == nullptr) { 3736 // Array with unknown body type 3737 assert(this->isa_aryptr(), "only arrays without klass"); 3738 _is_ptr_to_narrowoop = UseCompressedOops; 3739 } else if (UseCompressedOops && this->isa_aryptr() && this->offset() != arrayOopDesc::length_offset_in_bytes()) { 3740 if (klass()->is_flat_array_klass() && field_offset != Offset::top && field_offset != Offset::bottom) { 3741 // Check if the field of the inline type array element contains oops 3742 ciInlineKlass* vk = klass()->as_flat_array_klass()->element_klass()->as_inline_klass(); 3743 int foffset = field_offset.get() + vk->payload_offset(); 3744 BasicType field_bt; 3745 ciField* field = vk->get_field_by_offset(foffset, false); 3746 if (field != nullptr) { 3747 field_bt = field->layout_type(); 3748 } else { 3749 assert(field_offset.get() == vk->null_marker_offset_in_payload(), "no field or null marker of %s at offset %d", vk->name()->as_utf8(), foffset); 3750 field_bt = T_BOOLEAN; 3751 } 3752 _is_ptr_to_narrowoop = ::is_reference_type(field_bt); 3753 } else if (klass()->is_obj_array_klass()) { 3754 _is_ptr_to_narrowoop = true; 3755 } 3756 } else if (klass()->is_instance_klass()) { 3757 if (this->isa_klassptr()) { 3758 // Perm objects don't use compressed references 3759 } else if (_offset == Offset::bottom || _offset == Offset::top) { 3760 // unsafe access 3761 _is_ptr_to_narrowoop = UseCompressedOops; 3762 } else { 3763 assert(this->isa_instptr(), "must be an instance ptr."); 3764 if (klass() == ciEnv::current()->Class_klass() && 3765 (this->offset() == java_lang_Class::klass_offset() || 3766 this->offset() == java_lang_Class::array_klass_offset())) { 3767 // Special hidden fields from the Class. 3768 assert(this->isa_instptr(), "must be an instance ptr."); 3769 _is_ptr_to_narrowoop = false; 3770 } else if (klass() == ciEnv::current()->Class_klass() && 3771 this->offset() >= InstanceMirrorKlass::offset_of_static_fields()) { 3772 // Static fields 3773 BasicType basic_elem_type = T_ILLEGAL; 3774 if (const_oop() != nullptr) { 3775 ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass(); 3776 basic_elem_type = k->get_field_type_by_offset(this->offset(), true); 3777 } 3778 if (basic_elem_type != T_ILLEGAL) { 3779 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type); 3780 } else { 3781 // unsafe access 3782 _is_ptr_to_narrowoop = UseCompressedOops; 3783 } 3784 } else { 3785 // Instance fields which contains a compressed oop references. 3786 ciInstanceKlass* ik = klass()->as_instance_klass(); 3787 BasicType basic_elem_type = ik->get_field_type_by_offset(this->offset(), false); 3788 if (basic_elem_type != T_ILLEGAL) { 3789 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type); 3790 } else if (klass()->equals(ciEnv::current()->Object_klass())) { 3791 // Compile::find_alias_type() cast exactness on all types to verify 3792 // that it does not affect alias type. 3793 _is_ptr_to_narrowoop = UseCompressedOops; 3794 } else { 3795 // Type for the copy start in LibraryCallKit::inline_native_clone(). 3796 _is_ptr_to_narrowoop = UseCompressedOops; 3797 } 3798 } 3799 } 3800 } 3801 } 3802 #endif // _LP64 3803 } 3804 3805 //------------------------------make------------------------------------------- 3806 const TypeOopPtr *TypeOopPtr::make(PTR ptr, Offset offset, int instance_id, 3807 const TypePtr* speculative, int inline_depth) { 3808 assert(ptr != Constant, "no constant generic pointers"); 3809 ciKlass* k = Compile::current()->env()->Object_klass(); 3810 bool xk = false; 3811 ciObject* o = nullptr; 3812 const TypeInterfaces* interfaces = TypeInterfaces::make(); 3813 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, Offset::bottom, instance_id, speculative, inline_depth))->hashcons(); 3814 } 3815 3816 3817 //------------------------------cast_to_ptr_type------------------------------- 3818 const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const { 3819 assert(_base == OopPtr, "subclass must override cast_to_ptr_type"); 3820 if( ptr == _ptr ) return this; 3821 return make(ptr, _offset, _instance_id, _speculative, _inline_depth); 3822 } 3823 3824 //-----------------------------cast_to_instance_id---------------------------- 3825 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const { 3826 // There are no instances of a general oop. 3827 // Return self unchanged. 3828 return this; 3829 } 3830 3831 //-----------------------------cast_to_exactness------------------------------- 3832 const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const { 3833 // There is no such thing as an exact general oop. 3834 // Return self unchanged. 3835 return this; 3836 } 3837 3838 //------------------------------as_klass_type---------------------------------- 3839 // Return the klass type corresponding to this instance or array type. 3840 // It is the type that is loaded from an object of this type. 3841 const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const { 3842 ShouldNotReachHere(); 3843 return nullptr; 3844 } 3845 3846 //------------------------------meet------------------------------------------- 3847 // Compute the MEET of two types. It returns a new Type object. 3848 const Type *TypeOopPtr::xmeet_helper(const Type *t) const { 3849 // Perform a fast test for common case; meeting the same types together. 3850 if( this == t ) return this; // Meeting same type-rep? 3851 3852 // Current "this->_base" is OopPtr 3853 switch (t->base()) { // switch on original type 3854 3855 case Int: // Mixing ints & oops happens when javac 3856 case Long: // reuses local variables 3857 case HalfFloatTop: 3858 case HalfFloatCon: 3859 case HalfFloatBot: 3860 case FloatTop: 3861 case FloatCon: 3862 case FloatBot: 3863 case DoubleTop: 3864 case DoubleCon: 3865 case DoubleBot: 3866 case NarrowOop: 3867 case NarrowKlass: 3868 case Bottom: // Ye Olde Default 3869 return Type::BOTTOM; 3870 case Top: 3871 return this; 3872 3873 default: // All else is a mistake 3874 typerr(t); 3875 3876 case RawPtr: 3877 case MetadataPtr: 3878 case KlassPtr: 3879 case InstKlassPtr: 3880 case AryKlassPtr: 3881 return TypePtr::BOTTOM; // Oop meet raw is not well defined 3882 3883 case AnyPtr: { 3884 // Found an AnyPtr type vs self-OopPtr type 3885 const TypePtr *tp = t->is_ptr(); 3886 Offset offset = meet_offset(tp->offset()); 3887 PTR ptr = meet_ptr(tp->ptr()); 3888 const TypePtr* speculative = xmeet_speculative(tp); 3889 int depth = meet_inline_depth(tp->inline_depth()); 3890 switch (tp->ptr()) { 3891 case Null: 3892 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 3893 // else fall through: 3894 case TopPTR: 3895 case AnyNull: { 3896 int instance_id = meet_instance_id(InstanceTop); 3897 return make(ptr, offset, instance_id, speculative, depth); 3898 } 3899 case BotPTR: 3900 case NotNull: 3901 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 3902 default: typerr(t); 3903 } 3904 } 3905 3906 case OopPtr: { // Meeting to other OopPtrs 3907 const TypeOopPtr *tp = t->is_oopptr(); 3908 int instance_id = meet_instance_id(tp->instance_id()); 3909 const TypePtr* speculative = xmeet_speculative(tp); 3910 int depth = meet_inline_depth(tp->inline_depth()); 3911 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth); 3912 } 3913 3914 case InstPtr: // For these, flip the call around to cut down 3915 case AryPtr: 3916 return t->xmeet(this); // Call in reverse direction 3917 3918 } // End of switch 3919 return this; // Return the double constant 3920 } 3921 3922 3923 //------------------------------xdual------------------------------------------ 3924 // Dual of a pure heap pointer. No relevant klass or oop information. 3925 const Type *TypeOopPtr::xdual() const { 3926 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here"); 3927 assert(const_oop() == nullptr, "no constants here"); 3928 return new TypeOopPtr(_base, dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), Offset::bottom, dual_instance_id(), dual_speculative(), dual_inline_depth()); 3929 } 3930 3931 //--------------------------make_from_klass_common----------------------------- 3932 // Computes the element-type given a klass. 3933 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) { 3934 if (klass->is_instance_klass() || klass->is_inlinetype()) { 3935 Compile* C = Compile::current(); 3936 Dependencies* deps = C->dependencies(); 3937 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); 3938 // Element is an instance 3939 bool klass_is_exact = false; 3940 ciInstanceKlass* ik = klass->as_instance_klass(); 3941 if (klass->is_loaded()) { 3942 // Try to set klass_is_exact. 3943 klass_is_exact = ik->is_final(); 3944 if (!klass_is_exact && klass_change 3945 && deps != nullptr && UseUniqueSubclasses) { 3946 ciInstanceKlass* sub = ik->unique_concrete_subklass(); 3947 if (sub != nullptr) { 3948 deps->assert_abstract_with_unique_concrete_subtype(ik, sub); 3949 klass = ik = sub; 3950 klass_is_exact = sub->is_final(); 3951 } 3952 } 3953 if (!klass_is_exact && try_for_exact && deps != nullptr && 3954 !ik->is_interface() && !ik->has_subklass()) { 3955 // Add a dependence; if concrete subclass added we need to recompile 3956 deps->assert_leaf_type(ik); 3957 klass_is_exact = true; 3958 } 3959 } 3960 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact); 3961 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling); 3962 return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, Offset(0), flat_in_array); 3963 } else if (klass->is_obj_array_klass()) { 3964 // Element is an object or inline type array. Recursively call ourself. 3965 ciObjArrayKlass* array_klass = klass->as_obj_array_klass(); 3966 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_common(array_klass->element_klass(), /* klass_change= */ false, try_for_exact, interface_handling); 3967 bool xk = array_klass->is_loaded() && array_klass->is_refined(); 3968 3969 // Determine null-free/flat properties 3970 bool flat; 3971 bool not_flat; 3972 bool is_null_free; 3973 bool not_null_free; 3974 bool atomic; 3975 if (xk) { 3976 flat = array_klass->is_flat_array_klass(); 3977 not_flat = !flat; 3978 is_null_free = array_klass->is_elem_null_free(); 3979 not_null_free = !is_null_free; 3980 atomic = array_klass->is_elem_atomic(); 3981 3982 if (is_null_free) { 3983 etype = etype->join_speculative(NOTNULL)->is_oopptr(); 3984 } 3985 } else { 3986 const TypeOopPtr* exact_etype = etype; 3987 if (etype->can_be_inline_type()) { 3988 // Use exact type if element can be an inline type 3989 exact_etype = TypeOopPtr::make_from_klass_common(klass->as_array_klass()->element_klass(), /* klass_change= */ true, /* try_for_exact= */ true, interface_handling); 3990 } 3991 3992 flat = false; 3993 bool not_inline = !exact_etype->can_be_inline_type(); 3994 not_null_free = not_inline; 3995 not_flat = !UseArrayFlattening || not_inline || (exact_etype->is_inlinetypeptr() && !exact_etype->inline_klass()->maybe_flat_in_array()); 3996 atomic = not_flat; 3997 } 3998 3999 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS, /* stable= */ false, flat, not_flat, not_null_free, atomic); 4000 // We used to pass NotNull in here, asserting that the sub-arrays 4001 // are all not-null. This is not true in generally, as code can 4002 // slam nullptrs down in the subarrays. 4003 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, Offset(0)); 4004 return arr; 4005 } else if (klass->is_type_array_klass()) { 4006 // Element is an typeArray 4007 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type()); 4008 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS, 4009 /* stable= */ false, /* flat= */ false, /* not_flat= */ true, /* not_null_free= */ true, true); 4010 // We used to pass NotNull in here, asserting that the array pointer 4011 // is not-null. That was not true in general. 4012 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, Offset(0)); 4013 return arr; 4014 } else { 4015 ShouldNotReachHere(); 4016 return nullptr; 4017 } 4018 } 4019 4020 //------------------------------make_from_constant----------------------------- 4021 // Make a java pointer from an oop constant 4022 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) { 4023 assert(!o->is_null_object(), "null object not yet handled here."); 4024 4025 const bool make_constant = require_constant || o->should_be_constant(); 4026 4027 ciKlass* klass = o->klass(); 4028 if (klass->is_instance_klass() || klass->is_inlinetype()) { 4029 // Element is an instance or inline type 4030 if (make_constant) { 4031 return TypeInstPtr::make(o); 4032 } else { 4033 return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, Offset(0)); 4034 } 4035 } else if (klass->is_obj_array_klass()) { 4036 // Element is an object array. Recursively call ourself. 4037 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_raw(klass->as_array_klass()->element_klass(), trust_interfaces); 4038 bool is_flat = o->as_array()->is_flat(); 4039 bool is_null_free = o->as_array()->is_null_free(); 4040 if (is_null_free) { 4041 etype = etype->join_speculative(TypePtr::NOTNULL)->is_oopptr(); 4042 } 4043 bool is_atomic = o->as_array()->is_atomic(); 4044 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ is_flat, 4045 /* not_flat= */ !is_flat, /* not_null_free= */ !is_null_free, /* atomic= */ is_atomic); 4046 // We used to pass NotNull in here, asserting that the sub-arrays 4047 // are all not-null. This is not true in generally, as code can 4048 // slam nulls down in the subarrays. 4049 if (make_constant) { 4050 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0)); 4051 } else { 4052 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0)); 4053 } 4054 } else if (klass->is_type_array_klass()) { 4055 // Element is an typeArray 4056 const Type* etype = (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type()); 4057 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ false, 4058 /* not_flat= */ true, /* not_null_free= */ true, true); 4059 // We used to pass NotNull in here, asserting that the array pointer 4060 // is not-null. That was not true in general. 4061 if (make_constant) { 4062 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0)); 4063 } else { 4064 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0)); 4065 } 4066 } 4067 4068 fatal("unhandled object type"); 4069 return nullptr; 4070 } 4071 4072 //------------------------------get_con---------------------------------------- 4073 intptr_t TypeOopPtr::get_con() const { 4074 assert( _ptr == Null || _ptr == Constant, "" ); 4075 assert(offset() >= 0, ""); 4076 4077 if (offset() != 0) { 4078 // After being ported to the compiler interface, the compiler no longer 4079 // directly manipulates the addresses of oops. Rather, it only has a pointer 4080 // to a handle at compile time. This handle is embedded in the generated 4081 // code and dereferenced at the time the nmethod is made. Until that time, 4082 // it is not reasonable to do arithmetic with the addresses of oops (we don't 4083 // have access to the addresses!). This does not seem to currently happen, 4084 // but this assertion here is to help prevent its occurrence. 4085 tty->print_cr("Found oop constant with non-zero offset"); 4086 ShouldNotReachHere(); 4087 } 4088 4089 return (intptr_t)const_oop()->constant_encoding(); 4090 } 4091 4092 4093 //-----------------------------filter------------------------------------------ 4094 // Do not allow interface-vs.-noninterface joins to collapse to top. 4095 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const { 4096 4097 const Type* ft = join_helper(kills, include_speculative); 4098 4099 if (ft->empty()) { 4100 return Type::TOP; // Canonical empty value 4101 } 4102 4103 return ft; 4104 } 4105 4106 //------------------------------eq--------------------------------------------- 4107 // Structural equality check for Type representations 4108 bool TypeOopPtr::eq( const Type *t ) const { 4109 const TypeOopPtr *a = (const TypeOopPtr*)t; 4110 if (_klass_is_exact != a->_klass_is_exact || 4111 _instance_id != a->_instance_id) return false; 4112 ciObject* one = const_oop(); 4113 ciObject* two = a->const_oop(); 4114 if (one == nullptr || two == nullptr) { 4115 return (one == two) && TypePtr::eq(t); 4116 } else { 4117 return one->equals(two) && TypePtr::eq(t); 4118 } 4119 } 4120 4121 //------------------------------hash------------------------------------------- 4122 // Type-specific hashing function. 4123 uint TypeOopPtr::hash(void) const { 4124 return 4125 (uint)(const_oop() ? const_oop()->hash() : 0) + 4126 (uint)_klass_is_exact + 4127 (uint)_instance_id + TypePtr::hash(); 4128 } 4129 4130 //------------------------------dump2------------------------------------------ 4131 #ifndef PRODUCT 4132 void TypeOopPtr::dump2(Dict& d, uint depth, outputStream* st) const { 4133 st->print("oopptr:%s", ptr_msg[_ptr]); 4134 if (_klass_is_exact) { 4135 st->print(":exact"); 4136 } 4137 if (const_oop() != nullptr) { 4138 st->print(":" INTPTR_FORMAT, p2i(const_oop())); 4139 } 4140 dump_offset(st); 4141 dump_instance_id(st); 4142 dump_inline_depth(st); 4143 dump_speculative(st); 4144 } 4145 4146 void TypeOopPtr::dump_instance_id(outputStream* st) const { 4147 if (_instance_id == InstanceTop) { 4148 st->print(",iid=top"); 4149 } else if (_instance_id == InstanceBot) { 4150 st->print(",iid=bot"); 4151 } else { 4152 st->print(",iid=%d", _instance_id); 4153 } 4154 } 4155 #endif 4156 4157 //------------------------------singleton-------------------------------------- 4158 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 4159 // constants 4160 bool TypeOopPtr::singleton(void) const { 4161 // detune optimizer to not generate constant oop + constant offset as a constant! 4162 // TopPTR, Null, AnyNull, Constant are all singletons 4163 return (offset() == 0) && !below_centerline(_ptr); 4164 } 4165 4166 //------------------------------add_offset------------------------------------- 4167 const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const { 4168 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); 4169 } 4170 4171 const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const { 4172 return make(_ptr, Offset(offset), _instance_id, with_offset_speculative(offset), _inline_depth); 4173 } 4174 4175 /** 4176 * Return same type without a speculative part 4177 */ 4178 const TypeOopPtr* TypeOopPtr::remove_speculative() const { 4179 if (_speculative == nullptr) { 4180 return this; 4181 } 4182 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 4183 return make(_ptr, _offset, _instance_id, nullptr, _inline_depth); 4184 } 4185 4186 /** 4187 * Return same type but drop speculative part if we know we won't use 4188 * it 4189 */ 4190 const Type* TypeOopPtr::cleanup_speculative() const { 4191 // If the klass is exact and the ptr is not null then there's 4192 // nothing that the speculative type can help us with 4193 if (klass_is_exact() && !maybe_null()) { 4194 return remove_speculative(); 4195 } 4196 return TypePtr::cleanup_speculative(); 4197 } 4198 4199 /** 4200 * Return same type but with a different inline depth (used for speculation) 4201 * 4202 * @param depth depth to meet with 4203 */ 4204 const TypePtr* TypeOopPtr::with_inline_depth(int depth) const { 4205 if (!UseInlineDepthForSpeculativeTypes) { 4206 return this; 4207 } 4208 return make(_ptr, _offset, _instance_id, _speculative, depth); 4209 } 4210 4211 //------------------------------with_instance_id-------------------------------- 4212 const TypePtr* TypeOopPtr::with_instance_id(int instance_id) const { 4213 assert(_instance_id != -1, "should be known"); 4214 return make(_ptr, _offset, instance_id, _speculative, _inline_depth); 4215 } 4216 4217 //------------------------------meet_instance_id-------------------------------- 4218 int TypeOopPtr::meet_instance_id( int instance_id ) const { 4219 // Either is 'TOP' instance? Return the other instance! 4220 if( _instance_id == InstanceTop ) return instance_id; 4221 if( instance_id == InstanceTop ) return _instance_id; 4222 // If either is different, return 'BOTTOM' instance 4223 if( _instance_id != instance_id ) return InstanceBot; 4224 return _instance_id; 4225 } 4226 4227 //------------------------------dual_instance_id-------------------------------- 4228 int TypeOopPtr::dual_instance_id( ) const { 4229 if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM 4230 if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP 4231 return _instance_id; // Map everything else into self 4232 } 4233 4234 4235 const TypeInterfaces* TypeOopPtr::meet_interfaces(const TypeOopPtr* other) const { 4236 if (above_centerline(_ptr) && above_centerline(other->_ptr)) { 4237 return _interfaces->union_with(other->_interfaces); 4238 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) { 4239 return other->_interfaces; 4240 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) { 4241 return _interfaces; 4242 } 4243 return _interfaces->intersection_with(other->_interfaces); 4244 } 4245 4246 /** 4247 * Check whether new profiling would improve speculative type 4248 * 4249 * @param exact_kls class from profiling 4250 * @param inline_depth inlining depth of profile point 4251 * 4252 * @return true if type profile is valuable 4253 */ 4254 bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { 4255 // no way to improve an already exact type 4256 if (klass_is_exact()) { 4257 return false; 4258 } 4259 return TypePtr::would_improve_type(exact_kls, inline_depth); 4260 } 4261 4262 //============================================================================= 4263 // Convenience common pre-built types. 4264 const TypeInstPtr *TypeInstPtr::NOTNULL; 4265 const TypeInstPtr *TypeInstPtr::BOTTOM; 4266 const TypeInstPtr *TypeInstPtr::MIRROR; 4267 const TypeInstPtr *TypeInstPtr::MARK; 4268 const TypeInstPtr *TypeInstPtr::KLASS; 4269 4270 // Is there a single ciKlass* that can represent that type? 4271 ciKlass* TypeInstPtr::exact_klass_helper() const { 4272 if (_interfaces->empty()) { 4273 return _klass; 4274 } 4275 if (_klass != ciEnv::current()->Object_klass()) { 4276 if (_interfaces->eq(_klass->as_instance_klass())) { 4277 return _klass; 4278 } 4279 return nullptr; 4280 } 4281 return _interfaces->exact_klass(); 4282 } 4283 4284 //------------------------------TypeInstPtr------------------------------------- 4285 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset off, 4286 FlatInArray flat_in_array, int instance_id, const TypePtr* speculative, int inline_depth) 4287 : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, Offset::bottom, instance_id, speculative, inline_depth), 4288 _flat_in_array(flat_in_array) { 4289 4290 assert(flat_in_array != Uninitialized, "must be set now"); 4291 assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here"); 4292 assert(k != nullptr && 4293 (k->is_loaded() || o == nullptr), 4294 "cannot have constants with non-loaded klass"); 4295 }; 4296 4297 //------------------------------make------------------------------------------- 4298 const TypeInstPtr *TypeInstPtr::make(PTR ptr, 4299 ciKlass* k, 4300 const TypeInterfaces* interfaces, 4301 bool xk, 4302 ciObject* o, 4303 Offset offset, 4304 FlatInArray flat_in_array, 4305 int instance_id, 4306 const TypePtr* speculative, 4307 int inline_depth) { 4308 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance"); 4309 // Either const_oop() is null or else ptr is Constant 4310 assert( (!o && ptr != Constant) || (o && ptr == Constant), 4311 "constant pointers must have a value supplied" ); 4312 // Ptr is never Null 4313 assert( ptr != Null, "null pointers are not typed" ); 4314 4315 assert(instance_id <= 0 || xk, "instances are always exactly typed"); 4316 ciInstanceKlass* ik = k->as_instance_klass(); 4317 if (ptr == Constant) { 4318 // Note: This case includes meta-object constants, such as methods. 4319 xk = true; 4320 } else if (k->is_loaded()) { 4321 if (!xk && ik->is_final()) xk = true; // no inexact final klass 4322 assert(!ik->is_interface(), "no interface here"); 4323 if (xk && ik->is_interface()) xk = false; // no exact interface 4324 } 4325 4326 if (flat_in_array == Uninitialized) { 4327 flat_in_array = compute_flat_in_array(ik, xk); 4328 } 4329 // Now hash this baby 4330 TypeInstPtr *result = 4331 (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o, offset, flat_in_array, instance_id, speculative, inline_depth))->hashcons(); 4332 4333 return result; 4334 } 4335 4336 const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) { 4337 if (k->is_instance_klass()) { 4338 if (k->is_loaded()) { 4339 if (k->is_interface() && interface_handling == ignore_interfaces) { 4340 assert(interface, "no interface expected"); 4341 k = ciEnv::current()->Object_klass(); 4342 const TypeInterfaces* interfaces = TypeInterfaces::make(); 4343 return interfaces; 4344 } 4345 GrowableArray<ciInstanceKlass *>* k_interfaces = k->as_instance_klass()->transitive_interfaces(); 4346 const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces); 4347 if (k->is_interface()) { 4348 assert(interface, "no interface expected"); 4349 k = ciEnv::current()->Object_klass(); 4350 } else { 4351 assert(klass, "no instance klass expected"); 4352 } 4353 return interfaces; 4354 } 4355 const TypeInterfaces* interfaces = TypeInterfaces::make(); 4356 return interfaces; 4357 } 4358 assert(array, "no array expected"); 4359 assert(k->is_array_klass(), "Not an array?"); 4360 ciType* e = k->as_array_klass()->base_element_type(); 4361 if (e->is_loaded() && e->is_instance_klass() && e->as_instance_klass()->is_interface()) { 4362 if (interface_handling == ignore_interfaces) { 4363 k = ciObjArrayKlass::make(ciEnv::current()->Object_klass(), k->as_array_klass()->dimension()); 4364 } 4365 } 4366 return TypeAryPtr::_array_interfaces; 4367 } 4368 4369 /** 4370 * Create constant type for a constant boxed value 4371 */ 4372 const Type* TypeInstPtr::get_const_boxed_value() const { 4373 assert(is_ptr_to_boxed_value(), "should be called only for boxed value"); 4374 assert((const_oop() != nullptr), "should be called only for constant object"); 4375 ciConstant constant = const_oop()->as_instance()->field_value_by_offset(offset()); 4376 BasicType bt = constant.basic_type(); 4377 switch (bt) { 4378 case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); 4379 case T_INT: return TypeInt::make(constant.as_int()); 4380 case T_CHAR: return TypeInt::make(constant.as_char()); 4381 case T_BYTE: return TypeInt::make(constant.as_byte()); 4382 case T_SHORT: return TypeInt::make(constant.as_short()); 4383 case T_FLOAT: return TypeF::make(constant.as_float()); 4384 case T_DOUBLE: return TypeD::make(constant.as_double()); 4385 case T_LONG: return TypeLong::make(constant.as_long()); 4386 default: break; 4387 } 4388 fatal("Invalid boxed value type '%s'", type2name(bt)); 4389 return nullptr; 4390 } 4391 4392 //------------------------------cast_to_ptr_type------------------------------- 4393 const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const { 4394 if( ptr == _ptr ) return this; 4395 // Reconstruct _sig info here since not a problem with later lazy 4396 // construction, _sig will show up on demand. 4397 return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _flat_in_array, _instance_id, _speculative, _inline_depth); 4398 } 4399 4400 4401 //-----------------------------cast_to_exactness------------------------------- 4402 const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const { 4403 if( klass_is_exact == _klass_is_exact ) return this; 4404 if (!_klass->is_loaded()) return this; 4405 ciInstanceKlass* ik = _klass->as_instance_klass(); 4406 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk 4407 assert(!ik->is_interface(), "no interface here"); 4408 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact); 4409 return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, flat_in_array, _instance_id, _speculative, _inline_depth); 4410 } 4411 4412 //-----------------------------cast_to_instance_id---------------------------- 4413 const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const { 4414 if( instance_id == _instance_id ) return this; 4415 return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth); 4416 } 4417 4418 //------------------------------xmeet_unloaded--------------------------------- 4419 // Compute the MEET of two InstPtrs when at least one is unloaded. 4420 // Assume classes are different since called after check for same name/class-loader 4421 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const { 4422 Offset off = meet_offset(tinst->offset()); 4423 PTR ptr = meet_ptr(tinst->ptr()); 4424 int instance_id = meet_instance_id(tinst->instance_id()); 4425 const TypePtr* speculative = xmeet_speculative(tinst); 4426 int depth = meet_inline_depth(tinst->inline_depth()); 4427 4428 const TypeInstPtr *loaded = is_loaded() ? this : tinst; 4429 const TypeInstPtr *unloaded = is_loaded() ? tinst : this; 4430 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) { 4431 // 4432 // Meet unloaded class with java/lang/Object 4433 // 4434 // Meet 4435 // | Unloaded Class 4436 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM | 4437 // =================================================================== 4438 // TOP | ..........................Unloaded......................| 4439 // AnyNull | U-AN |................Unloaded......................| 4440 // Constant | ... O-NN .................................. | O-BOT | 4441 // NotNull | ... O-NN .................................. | O-BOT | 4442 // BOTTOM | ........................Object-BOTTOM ..................| 4443 // 4444 assert(loaded->ptr() != TypePtr::Null, "insanity check"); 4445 // 4446 if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); } 4447 else if (loaded->ptr() == TypePtr::AnyNull) { 4448 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array()); 4449 return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, flat_in_array, instance_id, 4450 speculative, depth); 4451 } 4452 else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); } 4453 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) { 4454 if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); } 4455 else { return TypeInstPtr::NOTNULL->with_speculative(speculative); } 4456 } 4457 else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); } 4458 4459 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative); 4460 } 4461 4462 // Both are unloaded, not the same class, not Object 4463 // Or meet unloaded with a different loaded class, not java/lang/Object 4464 if (ptr != TypePtr::BotPTR) { 4465 return TypeInstPtr::NOTNULL->with_speculative(speculative); 4466 } 4467 return TypeInstPtr::BOTTOM->with_speculative(speculative); 4468 } 4469 4470 4471 //------------------------------meet------------------------------------------- 4472 // Compute the MEET of two types. It returns a new Type object. 4473 const Type *TypeInstPtr::xmeet_helper(const Type *t) const { 4474 // Perform a fast test for common case; meeting the same types together. 4475 if( this == t ) return this; // Meeting same type-rep? 4476 4477 // Current "this->_base" is Pointer 4478 switch (t->base()) { // switch on original type 4479 4480 case Int: // Mixing ints & oops happens when javac 4481 case Long: // reuses local variables 4482 case HalfFloatTop: 4483 case HalfFloatCon: 4484 case HalfFloatBot: 4485 case FloatTop: 4486 case FloatCon: 4487 case FloatBot: 4488 case DoubleTop: 4489 case DoubleCon: 4490 case DoubleBot: 4491 case NarrowOop: 4492 case NarrowKlass: 4493 case Bottom: // Ye Olde Default 4494 return Type::BOTTOM; 4495 case Top: 4496 return this; 4497 4498 default: // All else is a mistake 4499 typerr(t); 4500 4501 case MetadataPtr: 4502 case KlassPtr: 4503 case InstKlassPtr: 4504 case AryKlassPtr: 4505 case RawPtr: return TypePtr::BOTTOM; 4506 4507 case AryPtr: { // All arrays inherit from Object class 4508 // Call in reverse direction to avoid duplication 4509 return t->is_aryptr()->xmeet_helper(this); 4510 } 4511 4512 case OopPtr: { // Meeting to OopPtrs 4513 // Found a OopPtr type vs self-InstPtr type 4514 const TypeOopPtr *tp = t->is_oopptr(); 4515 Offset offset = meet_offset(tp->offset()); 4516 PTR ptr = meet_ptr(tp->ptr()); 4517 switch (tp->ptr()) { 4518 case TopPTR: 4519 case AnyNull: { 4520 int instance_id = meet_instance_id(InstanceTop); 4521 const TypePtr* speculative = xmeet_speculative(tp); 4522 int depth = meet_inline_depth(tp->inline_depth()); 4523 return make(ptr, klass(), _interfaces, klass_is_exact(), 4524 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth); 4525 } 4526 case NotNull: 4527 case BotPTR: { 4528 int instance_id = meet_instance_id(tp->instance_id()); 4529 const TypePtr* speculative = xmeet_speculative(tp); 4530 int depth = meet_inline_depth(tp->inline_depth()); 4531 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); 4532 } 4533 default: typerr(t); 4534 } 4535 } 4536 4537 case AnyPtr: { // Meeting to AnyPtrs 4538 // Found an AnyPtr type vs self-InstPtr type 4539 const TypePtr *tp = t->is_ptr(); 4540 Offset offset = meet_offset(tp->offset()); 4541 PTR ptr = meet_ptr(tp->ptr()); 4542 int instance_id = meet_instance_id(InstanceTop); 4543 const TypePtr* speculative = xmeet_speculative(tp); 4544 int depth = meet_inline_depth(tp->inline_depth()); 4545 switch (tp->ptr()) { 4546 case Null: 4547 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 4548 // else fall through to AnyNull 4549 case TopPTR: 4550 case AnyNull: { 4551 return make(ptr, klass(), _interfaces, klass_is_exact(), 4552 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth); 4553 } 4554 case NotNull: 4555 case BotPTR: 4556 return TypePtr::make(AnyPtr, ptr, offset, speculative,depth); 4557 default: typerr(t); 4558 } 4559 } 4560 4561 /* 4562 A-top } 4563 / | \ } Tops 4564 B-top A-any C-top } 4565 | / | \ | } Any-nulls 4566 B-any | C-any } 4567 | | | 4568 B-con A-con C-con } constants; not comparable across classes 4569 | | | 4570 B-not | C-not } 4571 | \ | / | } not-nulls 4572 B-bot A-not C-bot } 4573 \ | / } Bottoms 4574 A-bot } 4575 */ 4576 4577 case InstPtr: { // Meeting 2 Oops? 4578 // Found an InstPtr sub-type vs self-InstPtr type 4579 const TypeInstPtr *tinst = t->is_instptr(); 4580 Offset off = meet_offset(tinst->offset()); 4581 PTR ptr = meet_ptr(tinst->ptr()); 4582 int instance_id = meet_instance_id(tinst->instance_id()); 4583 const TypePtr* speculative = xmeet_speculative(tinst); 4584 int depth = meet_inline_depth(tinst->inline_depth()); 4585 const TypeInterfaces* interfaces = meet_interfaces(tinst); 4586 4587 ciKlass* tinst_klass = tinst->klass(); 4588 ciKlass* this_klass = klass(); 4589 4590 ciKlass* res_klass = nullptr; 4591 bool res_xk = false; 4592 const Type* res; 4593 MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk); 4594 4595 if (kind == UNLOADED) { 4596 // One of these classes has not been loaded 4597 const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces); 4598 #ifndef PRODUCT 4599 if (PrintOpto && Verbose) { 4600 tty->print("meet of unloaded classes resulted in: "); 4601 unloaded_meet->dump(); 4602 tty->cr(); 4603 tty->print(" this == "); 4604 dump(); 4605 tty->cr(); 4606 tty->print(" tinst == "); 4607 tinst->dump(); 4608 tty->cr(); 4609 } 4610 #endif 4611 res = unloaded_meet; 4612 } else { 4613 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array()); 4614 if (kind == NOT_SUBTYPE && instance_id > 0) { 4615 instance_id = InstanceBot; 4616 } else if (kind == LCA) { 4617 instance_id = InstanceBot; 4618 } 4619 ciObject* o = nullptr; // Assume not constant when done 4620 ciObject* this_oop = const_oop(); 4621 ciObject* tinst_oop = tinst->const_oop(); 4622 if (ptr == Constant) { 4623 if (this_oop != nullptr && tinst_oop != nullptr && 4624 this_oop->equals(tinst_oop)) 4625 o = this_oop; 4626 else if (above_centerline(_ptr)) { 4627 assert(!tinst_klass->is_interface(), ""); 4628 o = tinst_oop; 4629 } else if (above_centerline(tinst->_ptr)) { 4630 assert(!this_klass->is_interface(), ""); 4631 o = this_oop; 4632 } else 4633 ptr = NotNull; 4634 } 4635 res = make(ptr, res_klass, interfaces, res_xk, o, off, flat_in_array, instance_id, speculative, depth); 4636 } 4637 4638 return res; 4639 4640 } // End of case InstPtr 4641 4642 } // End of switch 4643 return this; // Return the double constant 4644 } 4645 4646 template<class T> TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type, 4647 ciKlass*& res_klass, bool& res_xk) { 4648 ciKlass* this_klass = this_type->klass(); 4649 ciKlass* other_klass = other_type->klass(); 4650 4651 bool this_xk = this_type->klass_is_exact(); 4652 bool other_xk = other_type->klass_is_exact(); 4653 PTR this_ptr = this_type->ptr(); 4654 PTR other_ptr = other_type->ptr(); 4655 const TypeInterfaces* this_interfaces = this_type->interfaces(); 4656 const TypeInterfaces* other_interfaces = other_type->interfaces(); 4657 // Check for easy case; klasses are equal (and perhaps not loaded!) 4658 // If we have constants, then we created oops so classes are loaded 4659 // and we can handle the constants further down. This case handles 4660 // both-not-loaded or both-loaded classes 4661 if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) { 4662 res_klass = this_klass; 4663 res_xk = this_xk; 4664 return QUICK; 4665 } 4666 4667 // Classes require inspection in the Java klass hierarchy. Must be loaded. 4668 if (!other_klass->is_loaded() || !this_klass->is_loaded()) { 4669 return UNLOADED; 4670 } 4671 4672 // !!! Here's how the symmetry requirement breaks down into invariants: 4673 // If we split one up & one down AND they subtype, take the down man. 4674 // If we split one up & one down AND they do NOT subtype, "fall hard". 4675 // If both are up and they subtype, take the subtype class. 4676 // If both are up and they do NOT subtype, "fall hard". 4677 // If both are down and they subtype, take the supertype class. 4678 // If both are down and they do NOT subtype, "fall hard". 4679 // Constants treated as down. 4680 4681 // Now, reorder the above list; observe that both-down+subtype is also 4682 // "fall hard"; "fall hard" becomes the default case: 4683 // If we split one up & one down AND they subtype, take the down man. 4684 // If both are up and they subtype, take the subtype class. 4685 4686 // If both are down and they subtype, "fall hard". 4687 // If both are down and they do NOT subtype, "fall hard". 4688 // If both are up and they do NOT subtype, "fall hard". 4689 // If we split one up & one down AND they do NOT subtype, "fall hard". 4690 4691 // If a proper subtype is exact, and we return it, we return it exactly. 4692 // If a proper supertype is exact, there can be no subtyping relationship! 4693 // If both types are equal to the subtype, exactness is and-ed below the 4694 // centerline and or-ed above it. (N.B. Constants are always exact.) 4695 4696 const T* subtype = nullptr; 4697 bool subtype_exact = false; 4698 if (this_type->is_same_java_type_as(other_type)) { 4699 // Same klass 4700 subtype = this_type; 4701 subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk); 4702 } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) { 4703 subtype = this_type; // Pick subtyping class 4704 subtype_exact = this_xk; 4705 } else if (!this_xk && other_type->is_meet_subtype_of(this_type)) { 4706 subtype = other_type; // Pick subtyping class 4707 subtype_exact = other_xk; 4708 } 4709 4710 if (subtype != nullptr) { 4711 if (above_centerline(ptr)) { 4712 // Both types are empty. 4713 this_type = other_type = subtype; 4714 this_xk = other_xk = subtype_exact; 4715 } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) { 4716 // this_type is empty while other_type is not. Take other_type. 4717 this_type = other_type; 4718 this_xk = other_xk; 4719 } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) { 4720 // other_type is empty while this_type is not. Take this_type. 4721 other_type = this_type; // this is down; keep down man 4722 } else { 4723 // this_type and other_type are both non-empty. 4724 this_xk = subtype_exact; // either they are equal, or we'll do an LCA 4725 } 4726 } 4727 4728 // Check for classes now being equal 4729 if (this_type->is_same_java_type_as(other_type)) { 4730 // If the klasses are equal, the constants may still differ. Fall to 4731 // NotNull if they do (neither constant is null; that is a special case 4732 // handled elsewhere). 4733 res_klass = this_type->klass(); 4734 res_xk = this_xk; 4735 return SUBTYPE; 4736 } // Else classes are not equal 4737 4738 // Since klasses are different, we require a LCA in the Java 4739 // class hierarchy - which means we have to fall to at least NotNull. 4740 if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) { 4741 ptr = NotNull; 4742 } 4743 4744 interfaces = this_interfaces->intersection_with(other_interfaces); 4745 4746 // Now we find the LCA of Java classes 4747 ciKlass* k = this_klass->least_common_ancestor(other_klass); 4748 4749 res_klass = k; 4750 res_xk = false; 4751 return LCA; 4752 } 4753 4754 // Top-Flat Flat Not-Flat Maybe-Flat 4755 // ------------------------------------------------------------- 4756 // Top-Flat Top-Flat Flat Not-Flat Maybe-Flat 4757 // Flat Flat Flat Maybe-Flat Maybe-Flat 4758 // Not-Flat Not-Flat Maybe-Flat Not-Flat Maybe-Flat 4759 // Maybe-Flat Maybe-Flat Maybe-Flat Maybe-Flat Maybe-flat 4760 TypePtr::FlatInArray TypePtr::meet_flat_in_array(const FlatInArray left, const FlatInArray right) { 4761 if (left == TopFlat) { 4762 return right; 4763 } 4764 if (right == TopFlat) { 4765 return left; 4766 } 4767 if (left == MaybeFlat || right == MaybeFlat) { 4768 return MaybeFlat; 4769 } 4770 4771 switch (left) { 4772 case Flat: 4773 if (right == Flat) { 4774 return Flat; 4775 } 4776 return MaybeFlat; 4777 case NotFlat: 4778 if (right == NotFlat) { 4779 return NotFlat; 4780 } 4781 return MaybeFlat; 4782 default: 4783 ShouldNotReachHere(); 4784 return Uninitialized; 4785 } 4786 } 4787 4788 //------------------------java_mirror_type-------------------------------------- 4789 ciType* TypeInstPtr::java_mirror_type() const { 4790 // must be a singleton type 4791 if( const_oop() == nullptr ) return nullptr; 4792 4793 // must be of type java.lang.Class 4794 if( klass() != ciEnv::current()->Class_klass() ) return nullptr; 4795 return const_oop()->as_instance()->java_mirror_type(); 4796 } 4797 4798 4799 //------------------------------xdual------------------------------------------ 4800 // Dual: do NOT dual on klasses. This means I do NOT understand the Java 4801 // inheritance mechanism. 4802 const Type* TypeInstPtr::xdual() const { 4803 return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), 4804 dual_flat_in_array(), dual_instance_id(), dual_speculative(), dual_inline_depth()); 4805 } 4806 4807 //------------------------------eq--------------------------------------------- 4808 // Structural equality check for Type representations 4809 bool TypeInstPtr::eq( const Type *t ) const { 4810 const TypeInstPtr *p = t->is_instptr(); 4811 return 4812 klass()->equals(p->klass()) && 4813 _flat_in_array == p->_flat_in_array && 4814 _interfaces->eq(p->_interfaces) && 4815 TypeOopPtr::eq(p); // Check sub-type stuff 4816 } 4817 4818 //------------------------------hash------------------------------------------- 4819 // Type-specific hashing function. 4820 uint TypeInstPtr::hash() const { 4821 return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash() + static_cast<uint>(_flat_in_array); 4822 } 4823 4824 bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 4825 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 4826 } 4827 4828 4829 bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const { 4830 return TypePtr::is_same_java_type_as_helper_for_instance(this, other); 4831 } 4832 4833 bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 4834 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 4835 } 4836 4837 4838 //------------------------------dump2------------------------------------------ 4839 // Dump oop Type 4840 #ifndef PRODUCT 4841 void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const { 4842 // Print the name of the klass. 4843 st->print("instptr:"); 4844 klass()->print_name_on(st); 4845 _interfaces->dump(st); 4846 4847 if (_ptr == Constant && (WizardMode || Verbose)) { 4848 ResourceMark rm; 4849 stringStream ss; 4850 4851 st->print(" "); 4852 const_oop()->print_oop(&ss); 4853 // 'const_oop->print_oop()' may emit newlines('\n') into ss. 4854 // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node. 4855 char* buf = ss.as_string(/* c_heap= */false); 4856 StringUtils::replace_no_expand(buf, "\n", ""); 4857 st->print_raw(buf); 4858 } 4859 4860 st->print(":%s", ptr_msg[_ptr]); 4861 if (_klass_is_exact) { 4862 st->print(":exact"); 4863 } 4864 4865 st->print(" *"); 4866 4867 dump_offset(st); 4868 dump_instance_id(st); 4869 dump_inline_depth(st); 4870 dump_speculative(st); 4871 dump_flat_in_array(_flat_in_array, st); 4872 } 4873 #endif 4874 4875 bool TypeInstPtr::empty() const { 4876 if (_flat_in_array == TopFlat) { 4877 return true; 4878 } 4879 return TypeOopPtr::empty(); 4880 } 4881 4882 //------------------------------add_offset------------------------------------- 4883 const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const { 4884 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset), _flat_in_array, 4885 _instance_id, add_offset_speculative(offset), _inline_depth); 4886 } 4887 4888 const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const { 4889 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), Offset(offset), _flat_in_array, 4890 _instance_id, with_offset_speculative(offset), _inline_depth); 4891 } 4892 4893 const TypeInstPtr* TypeInstPtr::remove_speculative() const { 4894 if (_speculative == nullptr) { 4895 return this; 4896 } 4897 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 4898 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, 4899 _instance_id, nullptr, _inline_depth); 4900 } 4901 4902 const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const { 4903 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, speculative, _inline_depth); 4904 } 4905 4906 const TypePtr* TypeInstPtr::with_inline_depth(int depth) const { 4907 if (!UseInlineDepthForSpeculativeTypes) { 4908 return this; 4909 } 4910 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, _speculative, depth); 4911 } 4912 4913 const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const { 4914 assert(is_known_instance(), "should be known"); 4915 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth); 4916 } 4917 4918 const TypeInstPtr *TypeInstPtr::cast_to_flat_in_array() const { 4919 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, Flat, _instance_id, _speculative, _inline_depth); 4920 } 4921 4922 const TypeInstPtr *TypeInstPtr::cast_to_maybe_flat_in_array() const { 4923 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, MaybeFlat, _instance_id, _speculative, _inline_depth); 4924 } 4925 4926 const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const { 4927 bool xk = klass_is_exact(); 4928 ciInstanceKlass* ik = klass()->as_instance_klass(); 4929 if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) { 4930 if (_interfaces->eq(ik)) { 4931 Compile* C = Compile::current(); 4932 Dependencies* deps = C->dependencies(); 4933 deps->assert_leaf_type(ik); 4934 xk = true; 4935 } 4936 } 4937 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array); 4938 return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, Offset(0), flat_in_array); 4939 } 4940 4941 template <class T1, class T2> bool TypePtr::is_meet_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_xk, bool other_xk) { 4942 static_assert(std::is_base_of<T2, T1>::value, ""); 4943 4944 if (!this_one->is_instance_type(other)) { 4945 return false; 4946 } 4947 4948 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) { 4949 return true; 4950 } 4951 4952 return this_one->klass()->is_subtype_of(other->klass()) && 4953 (!this_xk || this_one->_interfaces->contains(other->_interfaces)); 4954 } 4955 4956 4957 bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const { 4958 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk); 4959 } 4960 4961 template <class T1, class T2> bool TypePtr::is_meet_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_xk, bool other_xk) { 4962 static_assert(std::is_base_of<T2, T1>::value, ""); 4963 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) { 4964 return true; 4965 } 4966 4967 if (this_one->is_instance_type(other)) { 4968 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces); 4969 } 4970 4971 int dummy; 4972 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 4973 if (this_top_or_bottom) { 4974 return false; 4975 } 4976 4977 const T1* other_ary = this_one->is_array_type(other); 4978 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 4979 const TypePtr* this_elem = this_one->elem()->make_ptr(); 4980 if (other_elem != nullptr && this_elem != nullptr) { 4981 return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk); 4982 } 4983 if (other_elem == nullptr && this_elem == nullptr) { 4984 return this_one->klass()->is_subtype_of(other->klass()); 4985 } 4986 4987 return false; 4988 } 4989 4990 bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const { 4991 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk); 4992 } 4993 4994 bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const { 4995 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk); 4996 } 4997 4998 bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const { 4999 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk); 5000 } 5001 5002 //============================================================================= 5003 // Convenience common pre-built types. 5004 const TypeAryPtr* TypeAryPtr::BOTTOM; 5005 const TypeAryPtr *TypeAryPtr::RANGE; 5006 const TypeAryPtr *TypeAryPtr::OOPS; 5007 const TypeAryPtr *TypeAryPtr::NARROWOOPS; 5008 const TypeAryPtr *TypeAryPtr::BYTES; 5009 const TypeAryPtr *TypeAryPtr::SHORTS; 5010 const TypeAryPtr *TypeAryPtr::CHARS; 5011 const TypeAryPtr *TypeAryPtr::INTS; 5012 const TypeAryPtr *TypeAryPtr::LONGS; 5013 const TypeAryPtr *TypeAryPtr::FLOATS; 5014 const TypeAryPtr *TypeAryPtr::DOUBLES; 5015 const TypeAryPtr *TypeAryPtr::INLINES; 5016 5017 //------------------------------make------------------------------------------- 5018 const TypeAryPtr* TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset, 5019 int instance_id, const TypePtr* speculative, int inline_depth) { 5020 assert(!(k == nullptr && ary->_elem->isa_int()), 5021 "integral arrays must be pre-equipped with a class"); 5022 if (!xk) xk = ary->ary_must_be_exact(); 5023 assert(instance_id <= 0 || xk, "instances are always exactly typed"); 5024 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() && 5025 k->as_obj_array_klass()->base_element_klass()->is_interface()) { 5026 k = nullptr; 5027 } 5028 return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, field_offset, instance_id, false, speculative, inline_depth))->hashcons(); 5029 } 5030 5031 //------------------------------make------------------------------------------- 5032 const TypeAryPtr* TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset, 5033 int instance_id, const TypePtr* speculative, int inline_depth, 5034 bool is_autobox_cache) { 5035 assert(!(k == nullptr && ary->_elem->isa_int()), 5036 "integral arrays must be pre-equipped with a class"); 5037 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" ); 5038 if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact(); 5039 assert(instance_id <= 0 || xk, "instances are always exactly typed"); 5040 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() && 5041 k->as_obj_array_klass()->base_element_klass()->is_interface()) { 5042 k = nullptr; 5043 } 5044 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, field_offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons(); 5045 } 5046 5047 //------------------------------cast_to_ptr_type------------------------------- 5048 const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const { 5049 if( ptr == _ptr ) return this; 5050 return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5051 } 5052 5053 5054 //-----------------------------cast_to_exactness------------------------------- 5055 const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const { 5056 if( klass_is_exact == _klass_is_exact ) return this; 5057 if (_ary->ary_must_be_exact()) return this; // cannot clear xk 5058 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5059 } 5060 5061 //-----------------------------cast_to_instance_id---------------------------- 5062 const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const { 5063 if( instance_id == _instance_id ) return this; 5064 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth, _is_autobox_cache); 5065 } 5066 5067 5068 //-----------------------------max_array_length------------------------------- 5069 // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization. 5070 jint TypeAryPtr::max_array_length(BasicType etype) { 5071 if (!is_java_primitive(etype) && !::is_reference_type(etype)) { 5072 if (etype == T_NARROWOOP) { 5073 etype = T_OBJECT; 5074 } else if (etype == T_ILLEGAL) { // bottom[] 5075 etype = T_BYTE; // will produce conservatively high value 5076 } else { 5077 fatal("not an element type: %s", type2name(etype)); 5078 } 5079 } 5080 return arrayOopDesc::max_array_length(etype); 5081 } 5082 5083 //-----------------------------narrow_size_type------------------------------- 5084 // Narrow the given size type to the index range for the given array base type. 5085 // Return null if the resulting int type becomes empty. 5086 const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const { 5087 jint hi = size->_hi; 5088 jint lo = size->_lo; 5089 jint min_lo = 0; 5090 jint max_hi = max_array_length(elem()->array_element_basic_type()); 5091 //if (index_not_size) --max_hi; // type of a valid array index, FTR 5092 bool chg = false; 5093 if (lo < min_lo) { 5094 lo = min_lo; 5095 if (size->is_con()) { 5096 hi = lo; 5097 } 5098 chg = true; 5099 } 5100 if (hi > max_hi) { 5101 hi = max_hi; 5102 if (size->is_con()) { 5103 lo = hi; 5104 } 5105 chg = true; 5106 } 5107 // Negative length arrays will produce weird intermediate dead fast-path code 5108 if (lo > hi) { 5109 return TypeInt::ZERO; 5110 } 5111 if (!chg) { 5112 return size; 5113 } 5114 return TypeInt::make(lo, hi, Type::WidenMin); 5115 } 5116 5117 //-------------------------------cast_to_size---------------------------------- 5118 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const { 5119 assert(new_size != nullptr, ""); 5120 new_size = narrow_size_type(new_size); 5121 if (new_size == size()) return this; 5122 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5123 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5124 } 5125 5126 const TypeAryPtr* TypeAryPtr::cast_to_flat(bool flat) const { 5127 if (flat == is_flat()) { 5128 return this; 5129 } 5130 assert(!flat || !is_not_flat(), "inconsistency"); 5131 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), flat, is_not_flat(), is_not_null_free(), is_atomic()); 5132 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5133 if (res->speculative() == res->remove_speculative()) { 5134 return res->remove_speculative(); 5135 } 5136 return res; 5137 } 5138 5139 //-------------------------------cast_to_not_flat------------------------------ 5140 const TypeAryPtr* TypeAryPtr::cast_to_not_flat(bool not_flat) const { 5141 if (not_flat == is_not_flat()) { 5142 return this; 5143 } 5144 assert(!not_flat || !is_flat(), "inconsistency"); 5145 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), not_flat, is_not_null_free(), is_atomic()); 5146 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5147 // We keep the speculative part if it contains information about flat-/nullability. 5148 // Make sure it's removed if it's not better than the non-speculative type anymore. 5149 if (res->speculative() == res->remove_speculative()) { 5150 return res->remove_speculative(); 5151 } 5152 return res; 5153 } 5154 5155 const TypeAryPtr* TypeAryPtr::cast_to_null_free(bool null_free) const { 5156 if (null_free == is_null_free()) { 5157 return this; 5158 } 5159 assert(!null_free || !is_not_null_free(), "inconsistency"); 5160 const Type* elem = this->elem(); 5161 const Type* new_elem = elem->make_ptr(); 5162 if (null_free) { 5163 new_elem = new_elem->join_speculative(TypePtr::NOTNULL); 5164 } else { 5165 new_elem = new_elem->meet_speculative(TypePtr::NULL_PTR); 5166 } 5167 new_elem = elem->isa_narrowoop() ? new_elem->make_narrowoop() : new_elem; 5168 const TypeAry* new_ary = TypeAry::make(new_elem, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5169 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5170 if (res->speculative() == res->remove_speculative()) { 5171 return res->remove_speculative(); 5172 } 5173 return res; 5174 } 5175 5176 //-------------------------------cast_to_not_null_free------------------------- 5177 const TypeAryPtr* TypeAryPtr::cast_to_not_null_free(bool not_null_free) const { 5178 if (not_null_free == is_not_null_free()) { 5179 return this; 5180 } 5181 assert(!not_null_free || !is_null_free(), "inconsistency"); 5182 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), is_not_flat(), not_null_free, is_atomic()); 5183 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, 5184 _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5185 // We keep the speculative part if it contains information about flat-/nullability. 5186 // Make sure it's removed if it's not better than the non-speculative type anymore. 5187 if (res->speculative() == res->remove_speculative()) { 5188 return res->remove_speculative(); 5189 } 5190 return res; 5191 } 5192 5193 //---------------------------------update_properties--------------------------- 5194 const TypeAryPtr* TypeAryPtr::update_properties(const TypeAryPtr* from) const { 5195 if ((from->is_flat() && is_not_flat()) || 5196 (from->is_not_flat() && is_flat()) || 5197 (from->is_null_free() && is_not_null_free()) || 5198 (from->is_not_null_free() && is_null_free())) { 5199 return nullptr; // Inconsistent properties 5200 } 5201 const TypeAryPtr* res = this; 5202 if (from->is_not_null_free()) { 5203 res = res->cast_to_not_null_free(); 5204 } 5205 if (from->is_not_flat()) { 5206 res = res->cast_to_not_flat(); 5207 } 5208 return res; 5209 } 5210 5211 jint TypeAryPtr::flat_layout_helper() const { 5212 return exact_klass()->as_flat_array_klass()->layout_helper(); 5213 } 5214 5215 int TypeAryPtr::flat_elem_size() const { 5216 return exact_klass()->as_flat_array_klass()->element_byte_size(); 5217 } 5218 5219 int TypeAryPtr::flat_log_elem_size() const { 5220 return exact_klass()->as_flat_array_klass()->log2_element_size(); 5221 } 5222 5223 //------------------------------cast_to_stable--------------------------------- 5224 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const { 5225 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable())) 5226 return this; 5227 5228 const Type* elem = this->elem(); 5229 const TypePtr* elem_ptr = elem->make_ptr(); 5230 5231 if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) { 5232 // If this is widened from a narrow oop, TypeAry::make will re-narrow it. 5233 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1); 5234 } 5235 5236 const TypeAry* new_ary = TypeAry::make(elem, size(), stable, is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5237 5238 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5239 } 5240 5241 //-----------------------------stable_dimension-------------------------------- 5242 int TypeAryPtr::stable_dimension() const { 5243 if (!is_stable()) return 0; 5244 int dim = 1; 5245 const TypePtr* elem_ptr = elem()->make_ptr(); 5246 if (elem_ptr != nullptr && elem_ptr->isa_aryptr()) 5247 dim += elem_ptr->is_aryptr()->stable_dimension(); 5248 return dim; 5249 } 5250 5251 //----------------------cast_to_autobox_cache----------------------------------- 5252 const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const { 5253 if (is_autobox_cache()) return this; 5254 const TypeOopPtr* etype = elem()->make_oopptr(); 5255 if (etype == nullptr) return this; 5256 // The pointers in the autobox arrays are always non-null. 5257 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); 5258 const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5259 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true); 5260 } 5261 5262 //------------------------------eq--------------------------------------------- 5263 // Structural equality check for Type representations 5264 bool TypeAryPtr::eq( const Type *t ) const { 5265 const TypeAryPtr *p = t->is_aryptr(); 5266 return 5267 _ary == p->_ary && // Check array 5268 TypeOopPtr::eq(p) &&// Check sub-parts 5269 _field_offset == p->_field_offset; 5270 } 5271 5272 //------------------------------hash------------------------------------------- 5273 // Type-specific hashing function. 5274 uint TypeAryPtr::hash(void) const { 5275 return (uint)(uintptr_t)_ary + TypeOopPtr::hash() + _field_offset.get(); 5276 } 5277 5278 bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 5279 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 5280 } 5281 5282 bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const { 5283 return TypePtr::is_same_java_type_as_helper_for_array(this, other); 5284 } 5285 5286 bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 5287 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 5288 } 5289 //------------------------------meet------------------------------------------- 5290 // Compute the MEET of two types. It returns a new Type object. 5291 const Type *TypeAryPtr::xmeet_helper(const Type *t) const { 5292 // Perform a fast test for common case; meeting the same types together. 5293 if( this == t ) return this; // Meeting same type-rep? 5294 // Current "this->_base" is Pointer 5295 switch (t->base()) { // switch on original type 5296 5297 // Mixing ints & oops happens when javac reuses local variables 5298 case Int: 5299 case Long: 5300 case HalfFloatTop: 5301 case HalfFloatCon: 5302 case HalfFloatBot: 5303 case FloatTop: 5304 case FloatCon: 5305 case FloatBot: 5306 case DoubleTop: 5307 case DoubleCon: 5308 case DoubleBot: 5309 case NarrowOop: 5310 case NarrowKlass: 5311 case Bottom: // Ye Olde Default 5312 return Type::BOTTOM; 5313 case Top: 5314 return this; 5315 5316 default: // All else is a mistake 5317 typerr(t); 5318 5319 case OopPtr: { // Meeting to OopPtrs 5320 // Found a OopPtr type vs self-AryPtr type 5321 const TypeOopPtr *tp = t->is_oopptr(); 5322 Offset offset = meet_offset(tp->offset()); 5323 PTR ptr = meet_ptr(tp->ptr()); 5324 int depth = meet_inline_depth(tp->inline_depth()); 5325 const TypePtr* speculative = xmeet_speculative(tp); 5326 switch (tp->ptr()) { 5327 case TopPTR: 5328 case AnyNull: { 5329 int instance_id = meet_instance_id(InstanceTop); 5330 return make(ptr, (ptr == Constant ? const_oop() : nullptr), 5331 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5332 } 5333 case BotPTR: 5334 case NotNull: { 5335 int instance_id = meet_instance_id(tp->instance_id()); 5336 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); 5337 } 5338 default: ShouldNotReachHere(); 5339 } 5340 } 5341 5342 case AnyPtr: { // Meeting two AnyPtrs 5343 // Found an AnyPtr type vs self-AryPtr type 5344 const TypePtr *tp = t->is_ptr(); 5345 Offset offset = meet_offset(tp->offset()); 5346 PTR ptr = meet_ptr(tp->ptr()); 5347 const TypePtr* speculative = xmeet_speculative(tp); 5348 int depth = meet_inline_depth(tp->inline_depth()); 5349 switch (tp->ptr()) { 5350 case TopPTR: 5351 return this; 5352 case BotPTR: 5353 case NotNull: 5354 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 5355 case Null: 5356 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 5357 // else fall through to AnyNull 5358 case AnyNull: { 5359 int instance_id = meet_instance_id(InstanceTop); 5360 return make(ptr, (ptr == Constant ? const_oop() : nullptr), 5361 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5362 } 5363 default: ShouldNotReachHere(); 5364 } 5365 } 5366 5367 case MetadataPtr: 5368 case KlassPtr: 5369 case InstKlassPtr: 5370 case AryKlassPtr: 5371 case RawPtr: return TypePtr::BOTTOM; 5372 5373 case AryPtr: { // Meeting 2 references? 5374 const TypeAryPtr *tap = t->is_aryptr(); 5375 Offset off = meet_offset(tap->offset()); 5376 Offset field_off = meet_field_offset(tap->field_offset()); 5377 const Type* tm = _ary->meet_speculative(tap->_ary); 5378 const TypeAry* tary = tm->isa_ary(); 5379 if (tary == nullptr) { 5380 assert(tm == Type::TOP || tm == Type::BOTTOM, ""); 5381 return tm; 5382 } 5383 PTR ptr = meet_ptr(tap->ptr()); 5384 int instance_id = meet_instance_id(tap->instance_id()); 5385 const TypePtr* speculative = xmeet_speculative(tap); 5386 int depth = meet_inline_depth(tap->inline_depth()); 5387 5388 ciKlass* res_klass = nullptr; 5389 bool res_xk = false; 5390 bool res_flat = false; 5391 bool res_not_flat = false; 5392 bool res_not_null_free = false; 5393 bool res_atomic = false; 5394 const Type* elem = tary->_elem; 5395 if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic) == NOT_SUBTYPE) { 5396 instance_id = InstanceBot; 5397 } else if (this->is_flat() != tap->is_flat()) { 5398 // Meeting flat inline type array with non-flat array. Adjust (field) offset accordingly. 5399 if (tary->_flat) { 5400 // Result is in a flat representation 5401 off = Offset(is_flat() ? offset() : tap->offset()); 5402 field_off = is_flat() ? field_offset() : tap->field_offset(); 5403 } else if (below_centerline(ptr)) { 5404 // Result is in a non-flat representation 5405 off = Offset(flat_offset()).meet(Offset(tap->flat_offset())); 5406 field_off = (field_off == Offset::top) ? Offset::top : Offset::bottom; 5407 } else if (flat_offset() == tap->flat_offset()) { 5408 off = Offset(!is_flat() ? offset() : tap->offset()); 5409 field_off = !is_flat() ? field_offset() : tap->field_offset(); 5410 } 5411 } 5412 5413 ciObject* o = nullptr; // Assume not constant when done 5414 ciObject* this_oop = const_oop(); 5415 ciObject* tap_oop = tap->const_oop(); 5416 if (ptr == Constant) { 5417 if (this_oop != nullptr && tap_oop != nullptr && 5418 this_oop->equals(tap_oop)) { 5419 o = tap_oop; 5420 } else if (above_centerline(_ptr)) { 5421 o = tap_oop; 5422 } else if (above_centerline(tap->_ptr)) { 5423 o = this_oop; 5424 } else { 5425 ptr = NotNull; 5426 } 5427 } 5428 return make(ptr, o, TypeAry::make(elem, tary->_size, tary->_stable, res_flat, res_not_flat, res_not_null_free, res_atomic), res_klass, res_xk, off, field_off, instance_id, speculative, depth); 5429 } 5430 5431 // All arrays inherit from Object class 5432 case InstPtr: { 5433 const TypeInstPtr *tp = t->is_instptr(); 5434 Offset offset = meet_offset(tp->offset()); 5435 PTR ptr = meet_ptr(tp->ptr()); 5436 int instance_id = meet_instance_id(tp->instance_id()); 5437 const TypePtr* speculative = xmeet_speculative(tp); 5438 int depth = meet_inline_depth(tp->inline_depth()); 5439 const TypeInterfaces* interfaces = meet_interfaces(tp); 5440 const TypeInterfaces* tp_interfaces = tp->_interfaces; 5441 const TypeInterfaces* this_interfaces = _interfaces; 5442 5443 switch (ptr) { 5444 case TopPTR: 5445 case AnyNull: // Fall 'down' to dual of object klass 5446 // For instances when a subclass meets a superclass we fall 5447 // below the centerline when the superclass is exact. We need to 5448 // do the same here. 5449 // 5450 // Flat in array: 5451 // We do 5452 // dual(TypeAryPtr) MEET dual(TypeInstPtr) 5453 // If TypeInstPtr is anything else than Object, then the result of the meet is bottom Object (i.e. we could have 5454 // instances or arrays). 5455 // If TypeInstPtr is an Object and either 5456 // - exact 5457 // - inexact AND flat in array == dual(not flat in array) (i.e. not an array type) 5458 // then the result of the meet is bottom Object (i.e. we could have instances or arrays). 5459 // Otherwise, we meet two array pointers and create a new TypeAryPtr. 5460 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 5461 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 5462 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5463 } else { 5464 // cannot subclass, so the meet has to fall badly below the centerline 5465 ptr = NotNull; 5466 instance_id = InstanceBot; 5467 interfaces = this_interfaces->intersection_with(tp_interfaces); 5468 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 5469 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, flat_in_array, instance_id, speculative, depth); 5470 } 5471 case Constant: 5472 case NotNull: 5473 case BotPTR: { // Fall down to object klass 5474 // LCA is object_klass, but if we subclass from the top we can do better 5475 if (above_centerline(tp->ptr())) { 5476 // If 'tp' is above the centerline and it is Object class 5477 // then we can subclass in the Java class hierarchy. 5478 // For instances when a subclass meets a superclass we fall 5479 // below the centerline when the superclass is exact. We need 5480 // to do the same here. 5481 5482 // Flat in array: We do TypeAryPtr MEET dual(TypeInstPtr), same applies as above in TopPTR/AnyNull case. 5483 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 5484 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 5485 // that is, my array type is a subtype of 'tp' klass 5486 return make(ptr, (ptr == Constant ? const_oop() : nullptr), 5487 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5488 } 5489 } 5490 // The other case cannot happen, since t cannot be a subtype of an array. 5491 // The meet falls down to Object class below centerline. 5492 if (ptr == Constant) { 5493 ptr = NotNull; 5494 } 5495 if (instance_id > 0) { 5496 instance_id = InstanceBot; 5497 } 5498 5499 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 5500 interfaces = this_interfaces->intersection_with(tp_interfaces); 5501 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, 5502 flat_in_array, instance_id, speculative, depth); 5503 } 5504 default: typerr(t); 5505 } 5506 } 5507 } 5508 return this; // Lint noise 5509 } 5510 5511 5512 template<class T> TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary, const T* other_ary, 5513 ciKlass*& res_klass, bool& res_xk, bool &res_flat, bool& res_not_flat, bool& res_not_null_free, bool &res_atomic) { 5514 int dummy; 5515 bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM); 5516 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 5517 ciKlass* this_klass = this_ary->klass(); 5518 ciKlass* other_klass = other_ary->klass(); 5519 bool this_xk = this_ary->klass_is_exact(); 5520 bool other_xk = other_ary->klass_is_exact(); 5521 PTR this_ptr = this_ary->ptr(); 5522 PTR other_ptr = other_ary->ptr(); 5523 bool this_flat = this_ary->is_flat(); 5524 bool this_not_flat = this_ary->is_not_flat(); 5525 bool other_flat = other_ary->is_flat(); 5526 bool other_not_flat = other_ary->is_not_flat(); 5527 bool this_not_null_free = this_ary->is_not_null_free(); 5528 bool other_not_null_free = other_ary->is_not_null_free(); 5529 bool this_atomic = this_ary->is_atomic(); 5530 bool other_atomic = other_ary->is_atomic(); 5531 const bool same_nullness = this_ary->is_null_free() == other_ary->is_null_free(); 5532 res_klass = nullptr; 5533 MeetResult result = SUBTYPE; 5534 res_flat = this_flat && other_flat; 5535 bool res_null_free = this_ary->is_null_free() && other_ary->is_null_free(); 5536 res_not_flat = this_not_flat && other_not_flat; 5537 res_not_null_free = this_not_null_free && other_not_null_free; 5538 res_atomic = this_atomic && other_atomic; 5539 5540 if (elem->isa_int()) { 5541 // Integral array element types have irrelevant lattice relations. 5542 // It is the klass that determines array layout, not the element type. 5543 if (this_top_or_bottom) { 5544 res_klass = other_klass; 5545 } else if (other_top_or_bottom || other_klass == this_klass) { 5546 res_klass = this_klass; 5547 } else { 5548 // Something like byte[int+] meets char[int+]. 5549 // This must fall to bottom, not (int[-128..65535])[int+]. 5550 // instance_id = InstanceBot; 5551 elem = Type::BOTTOM; 5552 result = NOT_SUBTYPE; 5553 if (above_centerline(ptr) || ptr == Constant) { 5554 ptr = NotNull; 5555 res_xk = false; 5556 return NOT_SUBTYPE; 5557 } 5558 } 5559 } else {// Non integral arrays. 5560 // Must fall to bottom if exact klasses in upper lattice 5561 // are not equal or super klass is exact. 5562 if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) && 5563 // meet with top[] and bottom[] are processed further down: 5564 !this_top_or_bottom && !other_top_or_bottom && 5565 // both are exact and not equal: 5566 ((other_xk && this_xk) || 5567 // 'tap' is exact and super or unrelated: 5568 (other_xk && !other_ary->is_meet_subtype_of(this_ary)) || 5569 // 'this' is exact and super or unrelated: 5570 (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) { 5571 if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) { 5572 elem = Type::BOTTOM; 5573 } 5574 ptr = NotNull; 5575 res_xk = false; 5576 return NOT_SUBTYPE; 5577 } 5578 } 5579 5580 res_xk = false; 5581 switch (other_ptr) { 5582 case AnyNull: 5583 case TopPTR: 5584 // Compute new klass on demand, do not use tap->_klass 5585 if (below_centerline(this_ptr)) { 5586 res_xk = this_xk; 5587 if (this_ary->is_flat()) { 5588 elem = this_ary->elem(); 5589 } 5590 } else { 5591 res_xk = (other_xk || this_xk); 5592 } 5593 break; 5594 case Constant: { 5595 if (this_ptr == Constant && same_nullness) { 5596 // Only exact if same nullness since: 5597 // null-free [LMyValue <: nullable [LMyValue. 5598 res_xk = true; 5599 } else if (above_centerline(this_ptr)) { 5600 res_xk = true; 5601 } else { 5602 // Only precise for identical arrays 5603 res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); 5604 // Even though MyValue is final, [LMyValue is only exact if the array 5605 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue. 5606 if (res_xk && !res_null_free && !res_not_null_free) { 5607 ptr = NotNull; 5608 res_xk = false; 5609 } 5610 } 5611 break; 5612 } 5613 case NotNull: 5614 case BotPTR: 5615 // Compute new klass on demand, do not use tap->_klass 5616 if (above_centerline(this_ptr)) { 5617 res_xk = other_xk; 5618 if (other_ary->is_flat()) { 5619 elem = other_ary->elem(); 5620 } 5621 } else { 5622 res_xk = (other_xk && this_xk) && 5623 (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays 5624 // Even though MyValue is final, [LMyValue is only exact if the array 5625 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue. 5626 if (res_xk && !res_null_free && !res_not_null_free) { 5627 ptr = NotNull; 5628 res_xk = false; 5629 } 5630 } 5631 break; 5632 default: { 5633 ShouldNotReachHere(); 5634 return result; 5635 } 5636 } 5637 return result; 5638 } 5639 5640 5641 //------------------------------xdual------------------------------------------ 5642 // Dual: compute field-by-field dual 5643 const Type *TypeAryPtr::xdual() const { 5644 bool xk = _klass_is_exact; 5645 return new TypeAryPtr(dual_ptr(), _const_oop, _ary->dual()->is_ary(), _klass, xk, dual_offset(), dual_field_offset(), dual_instance_id(), is_autobox_cache(), dual_speculative(), dual_inline_depth()); 5646 } 5647 5648 Type::Offset TypeAryPtr::meet_field_offset(const Type::Offset offset) const { 5649 return _field_offset.meet(offset); 5650 } 5651 5652 //------------------------------dual_offset------------------------------------ 5653 Type::Offset TypeAryPtr::dual_field_offset() const { 5654 return _field_offset.dual(); 5655 } 5656 5657 //------------------------------dump2------------------------------------------ 5658 #ifndef PRODUCT 5659 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const { 5660 st->print("aryptr:"); 5661 _ary->dump2(d, depth, st); 5662 _interfaces->dump(st); 5663 5664 if (_ptr == Constant) { 5665 const_oop()->print(st); 5666 } 5667 5668 st->print(":%s", ptr_msg[_ptr]); 5669 if (_klass_is_exact) { 5670 st->print(":exact"); 5671 } 5672 5673 if (is_flat()) { 5674 st->print(":flat"); 5675 st->print("("); 5676 _field_offset.dump2(st); 5677 st->print(")"); 5678 } else if (is_not_flat()) { 5679 st->print(":not_flat"); 5680 } 5681 if (is_null_free()) { 5682 st->print(":null free"); 5683 } 5684 if (is_atomic()) { 5685 st->print(":atomic"); 5686 } 5687 if (Verbose) { 5688 if (is_not_flat()) { 5689 st->print(":not flat"); 5690 } 5691 if (is_not_null_free()) { 5692 st->print(":nullable"); 5693 } 5694 } 5695 if (offset() != 0) { 5696 BasicType basic_elem_type = elem()->basic_type(); 5697 int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type); 5698 if( _offset == Offset::top ) st->print("+undefined"); 5699 else if( _offset == Offset::bottom ) st->print("+any"); 5700 else if( offset() < header_size ) st->print("+%d", offset()); 5701 else { 5702 if (basic_elem_type == T_ILLEGAL) { 5703 st->print("+any"); 5704 } else { 5705 int elem_size = type2aelembytes(basic_elem_type); 5706 st->print("[%d]", (offset() - header_size)/elem_size); 5707 } 5708 } 5709 } 5710 5711 dump_instance_id(st); 5712 dump_inline_depth(st); 5713 dump_speculative(st); 5714 } 5715 #endif 5716 5717 bool TypeAryPtr::empty(void) const { 5718 if (_ary->empty()) return true; 5719 // FIXME: Does this belong here? Or in the meet code itself? 5720 if (is_flat() && is_not_flat()) { 5721 return true; 5722 } 5723 return TypeOopPtr::empty(); 5724 } 5725 5726 //------------------------------add_offset------------------------------------- 5727 const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const { 5728 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _field_offset, _instance_id, add_offset_speculative(offset), _inline_depth, _is_autobox_cache); 5729 } 5730 5731 const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const { 5732 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, Offset(offset), _field_offset, _instance_id, with_offset_speculative(offset), _inline_depth, _is_autobox_cache); 5733 } 5734 5735 const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const { 5736 return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5737 } 5738 5739 const TypeAryPtr* TypeAryPtr::remove_speculative() const { 5740 if (_speculative == nullptr) { 5741 return this; 5742 } 5743 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 5744 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, _instance_id, nullptr, _inline_depth, _is_autobox_cache); 5745 } 5746 5747 const Type* TypeAryPtr::cleanup_speculative() const { 5748 if (speculative() == nullptr) { 5749 return this; 5750 } 5751 // Keep speculative part if it contains information about flat-/nullability 5752 const TypeAryPtr* spec_aryptr = speculative()->isa_aryptr(); 5753 if (spec_aryptr != nullptr && !above_centerline(spec_aryptr->ptr()) && 5754 (spec_aryptr->is_not_flat() || spec_aryptr->is_not_null_free())) { 5755 return this; 5756 } 5757 return TypeOopPtr::cleanup_speculative(); 5758 } 5759 5760 const TypePtr* TypeAryPtr::with_inline_depth(int depth) const { 5761 if (!UseInlineDepthForSpeculativeTypes) { 5762 return this; 5763 } 5764 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, depth, _is_autobox_cache); 5765 } 5766 5767 const TypeAryPtr* TypeAryPtr::with_field_offset(int offset) const { 5768 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, Offset(offset), _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5769 } 5770 5771 const TypePtr* TypeAryPtr::add_field_offset_and_offset(intptr_t offset) const { 5772 int adj = 0; 5773 if (is_flat() && klass_is_exact() && offset != Type::OffsetBot && offset != Type::OffsetTop) { 5774 if (_offset.get() != OffsetBot && _offset.get() != OffsetTop) { 5775 adj = _offset.get(); 5776 offset += _offset.get(); 5777 } 5778 uint header = arrayOopDesc::base_offset_in_bytes(T_FLAT_ELEMENT); 5779 if (_field_offset.get() != OffsetBot && _field_offset.get() != OffsetTop) { 5780 offset += _field_offset.get(); 5781 if (_offset.get() == OffsetBot || _offset.get() == OffsetTop) { 5782 offset += header; 5783 } 5784 } 5785 if (elem()->make_oopptr()->is_inlinetypeptr() && (offset >= (intptr_t)header || offset < 0)) { 5786 // Try to get the field of the inline type array element we are pointing to 5787 ciInlineKlass* vk = elem()->inline_klass(); 5788 int shift = flat_log_elem_size(); 5789 int mask = (1 << shift) - 1; 5790 intptr_t field_offset = ((offset - header) & mask); 5791 ciField* field = vk->get_field_by_offset(field_offset + vk->payload_offset(), false); 5792 if (field != nullptr || field_offset == vk->null_marker_offset_in_payload()) { 5793 return with_field_offset(field_offset)->add_offset(offset - field_offset - adj); 5794 } 5795 } 5796 } 5797 return add_offset(offset - adj); 5798 } 5799 5800 // Return offset incremented by field_offset for flat inline type arrays 5801 int TypeAryPtr::flat_offset() const { 5802 int offset = _offset.get(); 5803 if (offset != Type::OffsetBot && offset != Type::OffsetTop && 5804 _field_offset != Offset::bottom && _field_offset != Offset::top) { 5805 offset += _field_offset.get(); 5806 } 5807 return offset; 5808 } 5809 5810 const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const { 5811 assert(is_known_instance(), "should be known"); 5812 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth); 5813 } 5814 5815 //============================================================================= 5816 5817 5818 //------------------------------hash------------------------------------------- 5819 // Type-specific hashing function. 5820 uint TypeNarrowPtr::hash(void) const { 5821 return _ptrtype->hash() + 7; 5822 } 5823 5824 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton 5825 return _ptrtype->singleton(); 5826 } 5827 5828 bool TypeNarrowPtr::empty(void) const { 5829 return _ptrtype->empty(); 5830 } 5831 5832 intptr_t TypeNarrowPtr::get_con() const { 5833 return _ptrtype->get_con(); 5834 } 5835 5836 bool TypeNarrowPtr::eq( const Type *t ) const { 5837 const TypeNarrowPtr* tc = isa_same_narrowptr(t); 5838 if (tc != nullptr) { 5839 if (_ptrtype->base() != tc->_ptrtype->base()) { 5840 return false; 5841 } 5842 return tc->_ptrtype->eq(_ptrtype); 5843 } 5844 return false; 5845 } 5846 5847 const Type *TypeNarrowPtr::xdual() const { // Compute dual right now. 5848 const TypePtr* odual = _ptrtype->dual()->is_ptr(); 5849 return make_same_narrowptr(odual); 5850 } 5851 5852 5853 const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const { 5854 if (isa_same_narrowptr(kills)) { 5855 const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative); 5856 if (ft->empty()) 5857 return Type::TOP; // Canonical empty value 5858 if (ft->isa_ptr()) { 5859 return make_hash_same_narrowptr(ft->isa_ptr()); 5860 } 5861 return ft; 5862 } else if (kills->isa_ptr()) { 5863 const Type* ft = _ptrtype->join_helper(kills, include_speculative); 5864 if (ft->empty()) 5865 return Type::TOP; // Canonical empty value 5866 return ft; 5867 } else { 5868 return Type::TOP; 5869 } 5870 } 5871 5872 //------------------------------xmeet------------------------------------------ 5873 // Compute the MEET of two types. It returns a new Type object. 5874 const Type *TypeNarrowPtr::xmeet( const Type *t ) const { 5875 // Perform a fast test for common case; meeting the same types together. 5876 if( this == t ) return this; // Meeting same type-rep? 5877 5878 if (t->base() == base()) { 5879 const Type* result = _ptrtype->xmeet(t->make_ptr()); 5880 if (result->isa_ptr()) { 5881 return make_hash_same_narrowptr(result->is_ptr()); 5882 } 5883 return result; 5884 } 5885 5886 // Current "this->_base" is NarrowKlass or NarrowOop 5887 switch (t->base()) { // switch on original type 5888 5889 case Int: // Mixing ints & oops happens when javac 5890 case Long: // reuses local variables 5891 case HalfFloatTop: 5892 case HalfFloatCon: 5893 case HalfFloatBot: 5894 case FloatTop: 5895 case FloatCon: 5896 case FloatBot: 5897 case DoubleTop: 5898 case DoubleCon: 5899 case DoubleBot: 5900 case AnyPtr: 5901 case RawPtr: 5902 case OopPtr: 5903 case InstPtr: 5904 case AryPtr: 5905 case MetadataPtr: 5906 case KlassPtr: 5907 case InstKlassPtr: 5908 case AryKlassPtr: 5909 case NarrowOop: 5910 case NarrowKlass: 5911 case Bottom: // Ye Olde Default 5912 return Type::BOTTOM; 5913 case Top: 5914 return this; 5915 5916 default: // All else is a mistake 5917 typerr(t); 5918 5919 } // End of switch 5920 5921 return this; 5922 } 5923 5924 #ifndef PRODUCT 5925 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const { 5926 _ptrtype->dump2(d, depth, st); 5927 } 5928 #endif 5929 5930 const TypeNarrowOop *TypeNarrowOop::BOTTOM; 5931 const TypeNarrowOop *TypeNarrowOop::NULL_PTR; 5932 5933 5934 const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) { 5935 return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons(); 5936 } 5937 5938 const TypeNarrowOop* TypeNarrowOop::remove_speculative() const { 5939 return make(_ptrtype->remove_speculative()->is_ptr()); 5940 } 5941 5942 const Type* TypeNarrowOop::cleanup_speculative() const { 5943 return make(_ptrtype->cleanup_speculative()->is_ptr()); 5944 } 5945 5946 #ifndef PRODUCT 5947 void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const { 5948 st->print("narrowoop: "); 5949 TypeNarrowPtr::dump2(d, depth, st); 5950 } 5951 #endif 5952 5953 const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR; 5954 5955 const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) { 5956 return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons(); 5957 } 5958 5959 #ifndef PRODUCT 5960 void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const { 5961 st->print("narrowklass: "); 5962 TypeNarrowPtr::dump2(d, depth, st); 5963 } 5964 #endif 5965 5966 5967 //------------------------------eq--------------------------------------------- 5968 // Structural equality check for Type representations 5969 bool TypeMetadataPtr::eq( const Type *t ) const { 5970 const TypeMetadataPtr *a = (const TypeMetadataPtr*)t; 5971 ciMetadata* one = metadata(); 5972 ciMetadata* two = a->metadata(); 5973 if (one == nullptr || two == nullptr) { 5974 return (one == two) && TypePtr::eq(t); 5975 } else { 5976 return one->equals(two) && TypePtr::eq(t); 5977 } 5978 } 5979 5980 //------------------------------hash------------------------------------------- 5981 // Type-specific hashing function. 5982 uint TypeMetadataPtr::hash(void) const { 5983 return 5984 (metadata() ? metadata()->hash() : 0) + 5985 TypePtr::hash(); 5986 } 5987 5988 //------------------------------singleton-------------------------------------- 5989 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 5990 // constants 5991 bool TypeMetadataPtr::singleton(void) const { 5992 // detune optimizer to not generate constant metadata + constant offset as a constant! 5993 // TopPTR, Null, AnyNull, Constant are all singletons 5994 return (offset() == 0) && !below_centerline(_ptr); 5995 } 5996 5997 //------------------------------add_offset------------------------------------- 5998 const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const { 5999 return make( _ptr, _metadata, xadd_offset(offset)); 6000 } 6001 6002 //-----------------------------filter------------------------------------------ 6003 // Do not allow interface-vs.-noninterface joins to collapse to top. 6004 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const { 6005 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr(); 6006 if (ft == nullptr || ft->empty()) 6007 return Type::TOP; // Canonical empty value 6008 return ft; 6009 } 6010 6011 //------------------------------get_con---------------------------------------- 6012 intptr_t TypeMetadataPtr::get_con() const { 6013 assert( _ptr == Null || _ptr == Constant, "" ); 6014 assert(offset() >= 0, ""); 6015 6016 if (offset() != 0) { 6017 // After being ported to the compiler interface, the compiler no longer 6018 // directly manipulates the addresses of oops. Rather, it only has a pointer 6019 // to a handle at compile time. This handle is embedded in the generated 6020 // code and dereferenced at the time the nmethod is made. Until that time, 6021 // it is not reasonable to do arithmetic with the addresses of oops (we don't 6022 // have access to the addresses!). This does not seem to currently happen, 6023 // but this assertion here is to help prevent its occurrence. 6024 tty->print_cr("Found oop constant with non-zero offset"); 6025 ShouldNotReachHere(); 6026 } 6027 6028 return (intptr_t)metadata()->constant_encoding(); 6029 } 6030 6031 //------------------------------cast_to_ptr_type------------------------------- 6032 const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const { 6033 if( ptr == _ptr ) return this; 6034 return make(ptr, metadata(), _offset); 6035 } 6036 6037 //------------------------------meet------------------------------------------- 6038 // Compute the MEET of two types. It returns a new Type object. 6039 const Type *TypeMetadataPtr::xmeet( const Type *t ) const { 6040 // Perform a fast test for common case; meeting the same types together. 6041 if( this == t ) return this; // Meeting same type-rep? 6042 6043 // Current "this->_base" is OopPtr 6044 switch (t->base()) { // switch on original type 6045 6046 case Int: // Mixing ints & oops happens when javac 6047 case Long: // reuses local variables 6048 case HalfFloatTop: 6049 case HalfFloatCon: 6050 case HalfFloatBot: 6051 case FloatTop: 6052 case FloatCon: 6053 case FloatBot: 6054 case DoubleTop: 6055 case DoubleCon: 6056 case DoubleBot: 6057 case NarrowOop: 6058 case NarrowKlass: 6059 case Bottom: // Ye Olde Default 6060 return Type::BOTTOM; 6061 case Top: 6062 return this; 6063 6064 default: // All else is a mistake 6065 typerr(t); 6066 6067 case AnyPtr: { 6068 // Found an AnyPtr type vs self-OopPtr type 6069 const TypePtr *tp = t->is_ptr(); 6070 Offset offset = meet_offset(tp->offset()); 6071 PTR ptr = meet_ptr(tp->ptr()); 6072 switch (tp->ptr()) { 6073 case Null: 6074 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6075 // else fall through: 6076 case TopPTR: 6077 case AnyNull: { 6078 return make(ptr, _metadata, offset); 6079 } 6080 case BotPTR: 6081 case NotNull: 6082 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6083 default: typerr(t); 6084 } 6085 } 6086 6087 case RawPtr: 6088 case KlassPtr: 6089 case InstKlassPtr: 6090 case AryKlassPtr: 6091 case OopPtr: 6092 case InstPtr: 6093 case AryPtr: 6094 return TypePtr::BOTTOM; // Oop meet raw is not well defined 6095 6096 case MetadataPtr: { 6097 const TypeMetadataPtr *tp = t->is_metadataptr(); 6098 Offset offset = meet_offset(tp->offset()); 6099 PTR tptr = tp->ptr(); 6100 PTR ptr = meet_ptr(tptr); 6101 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata(); 6102 if (tptr == TopPTR || _ptr == TopPTR || 6103 metadata()->equals(tp->metadata())) { 6104 return make(ptr, md, offset); 6105 } 6106 // metadata is different 6107 if( ptr == Constant ) { // Cannot be equal constants, so... 6108 if( tptr == Constant && _ptr != Constant) return t; 6109 if( _ptr == Constant && tptr != Constant) return this; 6110 ptr = NotNull; // Fall down in lattice 6111 } 6112 return make(ptr, nullptr, offset); 6113 break; 6114 } 6115 } // End of switch 6116 return this; // Return the double constant 6117 } 6118 6119 6120 //------------------------------xdual------------------------------------------ 6121 // Dual of a pure metadata pointer. 6122 const Type *TypeMetadataPtr::xdual() const { 6123 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset()); 6124 } 6125 6126 //------------------------------dump2------------------------------------------ 6127 #ifndef PRODUCT 6128 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const { 6129 st->print("metadataptr:%s", ptr_msg[_ptr]); 6130 if (metadata() != nullptr) { 6131 st->print(":" INTPTR_FORMAT, p2i(metadata())); 6132 } 6133 dump_offset(st); 6134 } 6135 #endif 6136 6137 6138 //============================================================================= 6139 // Convenience common pre-built type. 6140 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM; 6141 6142 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, Offset offset): 6143 TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) { 6144 } 6145 6146 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) { 6147 return make(Constant, m, Offset(0)); 6148 } 6149 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) { 6150 return make(Constant, m, Offset(0)); 6151 } 6152 6153 //------------------------------make------------------------------------------- 6154 // Create a meta data constant 6155 const TypeMetadataPtr* TypeMetadataPtr::make(PTR ptr, ciMetadata* m, Offset offset) { 6156 assert(m == nullptr || !m->is_klass(), "wrong type"); 6157 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons(); 6158 } 6159 6160 6161 const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const { 6162 const Type* elem = _ary->_elem; 6163 bool xk = klass_is_exact(); 6164 bool is_refined = false; 6165 if (elem->make_oopptr() != nullptr) { 6166 is_refined = true; 6167 elem = elem->make_oopptr()->as_klass_type(try_for_exact); 6168 if (elem->isa_aryklassptr()) { 6169 const TypeAryKlassPtr* elem_klass = elem->is_aryklassptr(); 6170 if (elem_klass->is_refined_type()) { 6171 elem = elem_klass->cast_to_non_refined(); 6172 } 6173 } else { 6174 const TypeInstKlassPtr* elem_klass = elem->is_instklassptr(); 6175 if (try_for_exact && !xk && elem_klass->klass_is_exact() && 6176 !elem_klass->exact_klass()->as_instance_klass()->can_be_inline_klass()) { 6177 xk = true; 6178 } 6179 } 6180 } 6181 return TypeAryKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, elem, klass(), Offset(0), is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined); 6182 } 6183 6184 const TypeKlassPtr* TypeKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) { 6185 if (klass->is_instance_klass()) { 6186 return TypeInstKlassPtr::make(klass, interface_handling); 6187 } 6188 return TypeAryKlassPtr::make(klass, interface_handling); 6189 } 6190 6191 TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, Offset offset) 6192 : TypePtr(t, ptr, offset), _klass(klass), _interfaces(interfaces) { 6193 assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) || 6194 klass->is_type_array_klass() || klass->is_flat_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here"); 6195 } 6196 6197 // Is there a single ciKlass* that can represent that type? 6198 ciKlass* TypeKlassPtr::exact_klass_helper() const { 6199 assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface"); 6200 if (_interfaces->empty()) { 6201 return _klass; 6202 } 6203 if (_klass != ciEnv::current()->Object_klass()) { 6204 if (_interfaces->eq(_klass->as_instance_klass())) { 6205 return _klass; 6206 } 6207 return nullptr; 6208 } 6209 return _interfaces->exact_klass(); 6210 } 6211 6212 //------------------------------eq--------------------------------------------- 6213 // Structural equality check for Type representations 6214 bool TypeKlassPtr::eq(const Type *t) const { 6215 const TypeKlassPtr *p = t->is_klassptr(); 6216 return 6217 _interfaces->eq(p->_interfaces) && 6218 TypePtr::eq(p); 6219 } 6220 6221 //------------------------------hash------------------------------------------- 6222 // Type-specific hashing function. 6223 uint TypeKlassPtr::hash(void) const { 6224 return TypePtr::hash() + _interfaces->hash(); 6225 } 6226 6227 //------------------------------singleton-------------------------------------- 6228 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 6229 // constants 6230 bool TypeKlassPtr::singleton(void) const { 6231 // detune optimizer to not generate constant klass + constant offset as a constant! 6232 // TopPTR, Null, AnyNull, Constant are all singletons 6233 return (offset() == 0) && !below_centerline(_ptr); 6234 } 6235 6236 // Do not allow interface-vs.-noninterface joins to collapse to top. 6237 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const { 6238 // logic here mirrors the one from TypeOopPtr::filter. See comments 6239 // there. 6240 const Type* ft = join_helper(kills, include_speculative); 6241 6242 if (ft->empty()) { 6243 return Type::TOP; // Canonical empty value 6244 } 6245 6246 return ft; 6247 } 6248 6249 const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const { 6250 if (above_centerline(_ptr) && above_centerline(other->_ptr)) { 6251 return _interfaces->union_with(other->_interfaces); 6252 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) { 6253 return other->_interfaces; 6254 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) { 6255 return _interfaces; 6256 } 6257 return _interfaces->intersection_with(other->_interfaces); 6258 } 6259 6260 //------------------------------get_con---------------------------------------- 6261 intptr_t TypeKlassPtr::get_con() const { 6262 assert( _ptr == Null || _ptr == Constant, "" ); 6263 assert( offset() >= 0, "" ); 6264 6265 if (offset() != 0) { 6266 // After being ported to the compiler interface, the compiler no longer 6267 // directly manipulates the addresses of oops. Rather, it only has a pointer 6268 // to a handle at compile time. This handle is embedded in the generated 6269 // code and dereferenced at the time the nmethod is made. Until that time, 6270 // it is not reasonable to do arithmetic with the addresses of oops (we don't 6271 // have access to the addresses!). This does not seem to currently happen, 6272 // but this assertion here is to help prevent its occurrence. 6273 tty->print_cr("Found oop constant with non-zero offset"); 6274 ShouldNotReachHere(); 6275 } 6276 6277 ciKlass* k = exact_klass(); 6278 6279 return (intptr_t)k->constant_encoding(); 6280 } 6281 6282 //============================================================================= 6283 // Convenience common pre-built types. 6284 6285 // Not-null object klass or below 6286 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT; 6287 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL; 6288 6289 bool TypeInstKlassPtr::eq(const Type *t) const { 6290 const TypeInstKlassPtr* p = t->is_instklassptr(); 6291 return 6292 klass()->equals(p->klass()) && 6293 _flat_in_array == p->_flat_in_array && 6294 TypeKlassPtr::eq(p); 6295 } 6296 6297 uint TypeInstKlassPtr::hash() const { 6298 return klass()->hash() + TypeKlassPtr::hash() + static_cast<uint>(_flat_in_array); 6299 } 6300 6301 const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, Offset offset, FlatInArray flat_in_array) { 6302 if (flat_in_array == Uninitialized) { 6303 flat_in_array = compute_flat_in_array(k->as_instance_klass(), ptr == Constant); 6304 } 6305 TypeInstKlassPtr *r = 6306 (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset, flat_in_array))->hashcons(); 6307 6308 return r; 6309 } 6310 6311 bool TypeInstKlassPtr::empty() const { 6312 if (_flat_in_array == TopFlat) { 6313 return true; 6314 } 6315 return TypeKlassPtr::empty(); 6316 } 6317 6318 //------------------------------add_offset------------------------------------- 6319 // Access internals of klass object 6320 const TypePtr *TypeInstKlassPtr::add_offset( intptr_t offset ) const { 6321 return make(_ptr, klass(), _interfaces, xadd_offset(offset), _flat_in_array); 6322 } 6323 6324 const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const { 6325 return make(_ptr, klass(), _interfaces, Offset(offset), _flat_in_array); 6326 } 6327 6328 //------------------------------cast_to_ptr_type------------------------------- 6329 const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const { 6330 assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type"); 6331 if( ptr == _ptr ) return this; 6332 return make(ptr, _klass, _interfaces, _offset, _flat_in_array); 6333 } 6334 6335 6336 bool TypeInstKlassPtr::must_be_exact() const { 6337 if (!_klass->is_loaded()) return false; 6338 ciInstanceKlass* ik = _klass->as_instance_klass(); 6339 if (ik->is_final()) return true; // cannot clear xk 6340 return false; 6341 } 6342 6343 //-----------------------------cast_to_exactness------------------------------- 6344 const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const { 6345 if (klass_is_exact == (_ptr == Constant)) return this; 6346 if (must_be_exact()) return this; 6347 ciKlass* k = klass(); 6348 FlatInArray flat_in_array = compute_flat_in_array(k->as_instance_klass(), klass_is_exact); 6349 return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset, flat_in_array); 6350 } 6351 6352 6353 //-----------------------------as_instance_type-------------------------------- 6354 // Corresponding type for an instance of the given class. 6355 // It will be NotNull, and exact if and only if the klass type is exact. 6356 const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const { 6357 ciKlass* k = klass(); 6358 bool xk = klass_is_exact(); 6359 Compile* C = Compile::current(); 6360 Dependencies* deps = C->dependencies(); 6361 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); 6362 // Element is an instance 6363 bool klass_is_exact = false; 6364 const TypeInterfaces* interfaces = _interfaces; 6365 ciInstanceKlass* ik = k->as_instance_klass(); 6366 if (k->is_loaded()) { 6367 // Try to set klass_is_exact. 6368 klass_is_exact = ik->is_final(); 6369 if (!klass_is_exact && klass_change 6370 && deps != nullptr && UseUniqueSubclasses) { 6371 ciInstanceKlass* sub = ik->unique_concrete_subklass(); 6372 if (sub != nullptr) { 6373 if (_interfaces->eq(sub)) { 6374 deps->assert_abstract_with_unique_concrete_subtype(ik, sub); 6375 k = ik = sub; 6376 xk = sub->is_final(); 6377 } 6378 } 6379 } 6380 } 6381 6382 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array); 6383 return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, Offset(0), flat_in_array); 6384 } 6385 6386 //------------------------------xmeet------------------------------------------ 6387 // Compute the MEET of two types, return a new Type object. 6388 const Type *TypeInstKlassPtr::xmeet( const Type *t ) const { 6389 // Perform a fast test for common case; meeting the same types together. 6390 if( this == t ) return this; // Meeting same type-rep? 6391 6392 // Current "this->_base" is Pointer 6393 switch (t->base()) { // switch on original type 6394 6395 case Int: // Mixing ints & oops happens when javac 6396 case Long: // reuses local variables 6397 case HalfFloatTop: 6398 case HalfFloatCon: 6399 case HalfFloatBot: 6400 case FloatTop: 6401 case FloatCon: 6402 case FloatBot: 6403 case DoubleTop: 6404 case DoubleCon: 6405 case DoubleBot: 6406 case NarrowOop: 6407 case NarrowKlass: 6408 case Bottom: // Ye Olde Default 6409 return Type::BOTTOM; 6410 case Top: 6411 return this; 6412 6413 default: // All else is a mistake 6414 typerr(t); 6415 6416 case AnyPtr: { // Meeting to AnyPtrs 6417 // Found an AnyPtr type vs self-KlassPtr type 6418 const TypePtr *tp = t->is_ptr(); 6419 Offset offset = meet_offset(tp->offset()); 6420 PTR ptr = meet_ptr(tp->ptr()); 6421 switch (tp->ptr()) { 6422 case TopPTR: 6423 return this; 6424 case Null: 6425 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6426 case AnyNull: 6427 return make(ptr, klass(), _interfaces, offset, _flat_in_array); 6428 case BotPTR: 6429 case NotNull: 6430 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6431 default: typerr(t); 6432 } 6433 } 6434 6435 case RawPtr: 6436 case MetadataPtr: 6437 case OopPtr: 6438 case AryPtr: // Meet with AryPtr 6439 case InstPtr: // Meet with InstPtr 6440 return TypePtr::BOTTOM; 6441 6442 // 6443 // A-top } 6444 // / | \ } Tops 6445 // B-top A-any C-top } 6446 // | / | \ | } Any-nulls 6447 // B-any | C-any } 6448 // | | | 6449 // B-con A-con C-con } constants; not comparable across classes 6450 // | | | 6451 // B-not | C-not } 6452 // | \ | / | } not-nulls 6453 // B-bot A-not C-bot } 6454 // \ | / } Bottoms 6455 // A-bot } 6456 // 6457 6458 case InstKlassPtr: { // Meet two KlassPtr types 6459 const TypeInstKlassPtr *tkls = t->is_instklassptr(); 6460 Offset off = meet_offset(tkls->offset()); 6461 PTR ptr = meet_ptr(tkls->ptr()); 6462 const TypeInterfaces* interfaces = meet_interfaces(tkls); 6463 6464 ciKlass* res_klass = nullptr; 6465 bool res_xk = false; 6466 const FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tkls->flat_in_array()); 6467 switch (meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) { 6468 case UNLOADED: 6469 ShouldNotReachHere(); 6470 case SUBTYPE: 6471 case NOT_SUBTYPE: 6472 case LCA: 6473 case QUICK: { 6474 assert(res_xk == (ptr == Constant), ""); 6475 const Type* res = make(ptr, res_klass, interfaces, off, flat_in_array); 6476 return res; 6477 } 6478 default: 6479 ShouldNotReachHere(); 6480 } 6481 } // End of case KlassPtr 6482 case AryKlassPtr: { // All arrays inherit from Object class 6483 const TypeAryKlassPtr *tp = t->is_aryklassptr(); 6484 Offset offset = meet_offset(tp->offset()); 6485 PTR ptr = meet_ptr(tp->ptr()); 6486 const TypeInterfaces* interfaces = meet_interfaces(tp); 6487 const TypeInterfaces* tp_interfaces = tp->_interfaces; 6488 const TypeInterfaces* this_interfaces = _interfaces; 6489 6490 switch (ptr) { 6491 case TopPTR: 6492 case AnyNull: // Fall 'down' to dual of object klass 6493 // For instances when a subclass meets a superclass we fall 6494 // below the centerline when the superclass is exact. We need to 6495 // do the same here. 6496 // 6497 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 6498 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && 6499 !klass_is_exact() && !is_not_flat_in_array()) { 6500 return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset, tp->is_not_flat(), tp->is_not_null_free(), tp->is_flat(), tp->is_null_free(), tp->is_atomic(), tp->is_refined_type()); 6501 } else { 6502 // cannot subclass, so the meet has to fall badly below the centerline 6503 ptr = NotNull; 6504 interfaces = _interfaces->intersection_with(tp->_interfaces); 6505 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat); 6506 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array); 6507 } 6508 case Constant: 6509 case NotNull: 6510 case BotPTR: { // Fall down to object klass 6511 // LCA is object_klass, but if we subclass from the top we can do better 6512 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull ) 6513 // If 'this' (InstPtr) is above the centerline and it is Object class 6514 // then we can subclass in the Java class hierarchy. 6515 // For instances when a subclass meets a superclass we fall 6516 // below the centerline when the superclass is exact. We need 6517 // to do the same here. 6518 // 6519 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 6520 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && 6521 !klass_is_exact() && !is_not_flat_in_array()) { 6522 // that is, tp's array type is a subtype of my klass 6523 return TypeAryKlassPtr::make(ptr, tp->elem(), tp->klass(), offset, tp->is_not_flat(), tp->is_not_null_free(), tp->is_flat(), tp->is_null_free(), tp->is_atomic(), tp->is_refined_type()); 6524 } 6525 } 6526 // The other case cannot happen, since I cannot be a subtype of an array. 6527 // The meet falls down to Object class below centerline. 6528 if( ptr == Constant ) 6529 ptr = NotNull; 6530 interfaces = this_interfaces->intersection_with(tp_interfaces); 6531 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat); 6532 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array); 6533 } 6534 default: typerr(t); 6535 } 6536 } 6537 6538 } // End of switch 6539 return this; // Return the double constant 6540 } 6541 6542 //------------------------------xdual------------------------------------------ 6543 // Dual: compute field-by-field dual 6544 const Type* TypeInstKlassPtr::xdual() const { 6545 return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset(), dual_flat_in_array()); 6546 } 6547 6548 template <class T1, class T2> bool TypePtr::is_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { 6549 static_assert(std::is_base_of<T2, T1>::value, ""); 6550 if (!this_one->is_loaded() || !other->is_loaded()) { 6551 return false; 6552 } 6553 if (!this_one->is_instance_type(other)) { 6554 return false; 6555 } 6556 6557 if (!other_exact) { 6558 return false; 6559 } 6560 6561 if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) { 6562 return true; 6563 } 6564 6565 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces); 6566 } 6567 6568 bool TypeInstKlassPtr::might_be_an_array() const { 6569 if (!instance_klass()->is_java_lang_Object()) { 6570 // TypeInstKlassPtr can be an array only if it is java.lang.Object: the only supertype of array types. 6571 return false; 6572 } 6573 if (interfaces()->has_non_array_interface()) { 6574 // Arrays only implement Cloneable and Serializable. If we see any other interface, [this] cannot be an array. 6575 return false; 6576 } 6577 // Cannot prove it's not an array. 6578 return true; 6579 } 6580 6581 bool TypeInstKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 6582 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 6583 } 6584 6585 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_instance(const T1* this_one, const T2* other) { 6586 static_assert(std::is_base_of<T2, T1>::value, ""); 6587 if (!this_one->is_loaded() || !other->is_loaded()) { 6588 return false; 6589 } 6590 if (!this_one->is_instance_type(other)) { 6591 return false; 6592 } 6593 return this_one->klass()->equals(other->klass()) && this_one->_interfaces->eq(other->_interfaces); 6594 } 6595 6596 bool TypeInstKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const { 6597 return TypePtr::is_same_java_type_as_helper_for_instance(this, other); 6598 } 6599 6600 template <class T1, class T2> bool TypePtr::maybe_java_subtype_of_helper_for_instance(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { 6601 static_assert(std::is_base_of<T2, T1>::value, ""); 6602 if (!this_one->is_loaded() || !other->is_loaded()) { 6603 return true; 6604 } 6605 6606 if (this_one->is_array_type(other)) { 6607 return !this_exact && this_one->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->contains(this_one->_interfaces); 6608 } 6609 6610 assert(this_one->is_instance_type(other), "unsupported"); 6611 6612 if (this_exact && other_exact) { 6613 return this_one->is_java_subtype_of(other); 6614 } 6615 6616 if (!this_one->klass()->is_subtype_of(other->klass()) && !other->klass()->is_subtype_of(this_one->klass())) { 6617 return false; 6618 } 6619 6620 if (this_exact) { 6621 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces); 6622 } 6623 6624 return true; 6625 } 6626 6627 bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 6628 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 6629 } 6630 6631 const TypeKlassPtr* TypeInstKlassPtr::try_improve() const { 6632 if (!UseUniqueSubclasses) { 6633 return this; 6634 } 6635 ciKlass* k = klass(); 6636 Compile* C = Compile::current(); 6637 Dependencies* deps = C->dependencies(); 6638 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); 6639 if (k->is_loaded()) { 6640 ciInstanceKlass* ik = k->as_instance_klass(); 6641 if (deps != nullptr) { 6642 ciInstanceKlass* sub = ik->unique_concrete_subklass(); 6643 if (sub != nullptr) { 6644 bool improve_to_exact = sub->is_final() && _ptr == NotNull; 6645 const TypeInstKlassPtr* improved = TypeInstKlassPtr::make(improve_to_exact ? Constant : _ptr, sub, _offset); 6646 if (improved->_interfaces->contains(_interfaces)) { 6647 deps->assert_abstract_with_unique_concrete_subtype(ik, sub); 6648 return improved; 6649 } 6650 } 6651 } 6652 } 6653 return this; 6654 } 6655 6656 bool TypeInstKlassPtr::can_be_inline_array() const { 6657 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryKlassPtr::_array_interfaces->contains(_interfaces); 6658 } 6659 6660 #ifndef PRODUCT 6661 void TypeInstKlassPtr::dump2(Dict& d, uint depth, outputStream* st) const { 6662 st->print("instklassptr:"); 6663 klass()->print_name_on(st); 6664 _interfaces->dump(st); 6665 st->print(":%s", ptr_msg[_ptr]); 6666 dump_offset(st); 6667 dump_flat_in_array(_flat_in_array, st); 6668 } 6669 #endif // PRODUCT 6670 6671 bool TypeAryKlassPtr::can_be_inline_array() const { 6672 return _elem->isa_instklassptr() && _elem->is_instklassptr()->_klass->can_be_inline_klass(); 6673 } 6674 6675 bool TypeInstPtr::can_be_inline_array() const { 6676 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryPtr::_array_interfaces->contains(_interfaces); 6677 } 6678 6679 bool TypeAryPtr::can_be_inline_array() const { 6680 return elem()->make_ptr() && elem()->make_ptr()->isa_instptr() && elem()->make_ptr()->is_instptr()->_klass->can_be_inline_klass(); 6681 } 6682 6683 const TypeAryKlassPtr *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) { 6684 return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type))->hashcons(); 6685 } 6686 6687 const TypeAryKlassPtr* 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) { 6688 const Type* etype; 6689 if (k->is_obj_array_klass()) { 6690 // Element is an object array. Recursively call ourself. 6691 ciKlass* eklass = k->as_obj_array_klass()->element_klass(); 6692 etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false); 6693 k = nullptr; 6694 } else if (k->is_type_array_klass()) { 6695 // Element is an typeArray 6696 etype = get_const_basic_type(k->as_type_array_klass()->element_type()); 6697 } else { 6698 ShouldNotReachHere(); 6699 } 6700 6701 return TypeAryKlassPtr::make(ptr, etype, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type); 6702 } 6703 6704 const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) { 6705 ciArrayKlass* k = klass->as_array_klass(); 6706 if (k->is_refined()) { 6707 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, !k->is_flat_array_klass(), !k->is_elem_null_free(), 6708 k->is_flat_array_klass(), k->is_elem_null_free(), k->is_elem_atomic(), true); 6709 } else { 6710 // Use the default combination to canonicalize all non-refined klass pointers 6711 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, true, true, false, false, true, false); 6712 } 6713 } 6714 6715 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_non_refined() const { 6716 assert(is_refined_type(), "must be a refined type"); 6717 PTR ptr = _ptr; 6718 // There can be multiple refined array types corresponding to a single unrefined type 6719 if (ptr == NotNull && elem()->is_klassptr()->klass_is_exact()) { 6720 ptr = Constant; 6721 } 6722 return make(ptr, elem(), nullptr, _offset, true, true, false, false, true, false); 6723 } 6724 6725 // Get the (non-)refined array klass ptr 6726 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_refined_array_klass_ptr(bool refined) const { 6727 if ((refined == is_refined_type()) || !klass_is_exact() || !exact_klass()->is_obj_array_klass()) { 6728 return this; 6729 } 6730 ciArrayKlass* k = exact_klass()->as_array_klass(); 6731 k = ciObjArrayKlass::make(k->element_klass(), refined); 6732 return make(k, trust_interfaces); 6733 } 6734 6735 //------------------------------eq--------------------------------------------- 6736 // Structural equality check for Type representations 6737 bool TypeAryKlassPtr::eq(const Type *t) const { 6738 const TypeAryKlassPtr *p = t->is_aryklassptr(); 6739 return 6740 _elem == p->_elem && // Check array 6741 _flat == p->_flat && 6742 _not_flat == p->_not_flat && 6743 _null_free == p->_null_free && 6744 _not_null_free == p->_not_null_free && 6745 _atomic == p->_atomic && 6746 _refined_type == p->_refined_type && 6747 TypeKlassPtr::eq(p); // Check sub-parts 6748 } 6749 6750 //------------------------------hash------------------------------------------- 6751 // Type-specific hashing function. 6752 uint TypeAryKlassPtr::hash(void) const { 6753 return (uint)(uintptr_t)_elem + TypeKlassPtr::hash() + (uint)(_not_flat ? 43 : 0) + 6754 (uint)(_not_null_free ? 44 : 0) + (uint)(_flat ? 45 : 0) + (uint)(_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0) + (uint)(_refined_type ? 48 : 0); 6755 } 6756 6757 //----------------------compute_klass------------------------------------------ 6758 // Compute the defining klass for this class 6759 ciKlass* TypeAryPtr::compute_klass() const { 6760 // Compute _klass based on element type. 6761 ciKlass* k_ary = nullptr; 6762 const TypeInstPtr *tinst; 6763 const TypeAryPtr *tary; 6764 const Type* el = elem(); 6765 if (el->isa_narrowoop()) { 6766 el = el->make_ptr(); 6767 } 6768 6769 // Get element klass 6770 if ((tinst = el->isa_instptr()) != nullptr) { 6771 // Leave k_ary at nullptr. 6772 } else if ((tary = el->isa_aryptr()) != nullptr) { 6773 // Leave k_ary at nullptr. 6774 } else if ((el->base() == Type::Top) || 6775 (el->base() == Type::Bottom)) { 6776 // element type of Bottom occurs from meet of basic type 6777 // and object; Top occurs when doing join on Bottom. 6778 // Leave k_ary at null. 6779 } else { 6780 assert(!el->isa_int(), "integral arrays must be pre-equipped with a class"); 6781 // Compute array klass directly from basic type 6782 k_ary = ciTypeArrayKlass::make(el->basic_type()); 6783 } 6784 return k_ary; 6785 } 6786 6787 //------------------------------klass------------------------------------------ 6788 // Return the defining klass for this class 6789 ciKlass* TypeAryPtr::klass() const { 6790 if( _klass ) return _klass; // Return cached value, if possible 6791 6792 // Oops, need to compute _klass and cache it 6793 ciKlass* k_ary = compute_klass(); 6794 6795 if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) { 6796 // The _klass field acts as a cache of the underlying 6797 // ciKlass for this array type. In order to set the field, 6798 // we need to cast away const-ness. 6799 // 6800 // IMPORTANT NOTE: we *never* set the _klass field for the 6801 // type TypeAryPtr::OOPS. This Type is shared between all 6802 // active compilations. However, the ciKlass which represents 6803 // this Type is *not* shared between compilations, so caching 6804 // this value would result in fetching a dangling pointer. 6805 // 6806 // Recomputing the underlying ciKlass for each request is 6807 // a bit less efficient than caching, but calls to 6808 // TypeAryPtr::OOPS->klass() are not common enough to matter. 6809 ((TypeAryPtr*)this)->_klass = k_ary; 6810 } 6811 return k_ary; 6812 } 6813 6814 // Is there a single ciKlass* that can represent that type? 6815 ciKlass* TypeAryPtr::exact_klass_helper() const { 6816 if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) { 6817 ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper(); 6818 if (k == nullptr) { 6819 return nullptr; 6820 } 6821 if (k->is_array_klass() && k->as_array_klass()->is_refined()) { 6822 // We have no mechanism to create an array of refined arrays 6823 k = ciObjArrayKlass::make(k->as_array_klass()->element_klass(), false); 6824 } 6825 if (klass_is_exact()) { 6826 return ciObjArrayKlass::make(k, true, is_null_free(), is_atomic()); 6827 } else { 6828 // We may reach here if called recursively, must be an unrefined type then 6829 return ciObjArrayKlass::make(k, false); 6830 } 6831 } 6832 6833 return klass(); 6834 } 6835 6836 const Type* TypeAryPtr::base_element_type(int& dims) const { 6837 const Type* elem = this->elem(); 6838 dims = 1; 6839 while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) { 6840 elem = elem->make_ptr()->is_aryptr()->elem(); 6841 dims++; 6842 } 6843 return elem; 6844 } 6845 6846 //------------------------------add_offset------------------------------------- 6847 // Access internals of klass object 6848 const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const { 6849 return make(_ptr, elem(), klass(), xadd_offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type); 6850 } 6851 6852 const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const { 6853 return make(_ptr, elem(), klass(), Offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type); 6854 } 6855 6856 //------------------------------cast_to_ptr_type------------------------------- 6857 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const { 6858 assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type"); 6859 if (ptr == _ptr) return this; 6860 return make(ptr, elem(), _klass, _offset, is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type); 6861 } 6862 6863 bool TypeAryKlassPtr::must_be_exact() const { 6864 assert(klass_is_exact(), "precondition"); 6865 if (_elem == Type::BOTTOM || _elem == Type::TOP) { 6866 return false; 6867 } 6868 const TypeKlassPtr* elem = _elem->isa_klassptr(); 6869 if (elem == nullptr) { 6870 // primitive arrays 6871 return true; 6872 } 6873 6874 // refined types are final 6875 return _refined_type; 6876 } 6877 6878 //-----------------------------cast_to_exactness------------------------------- 6879 const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const { 6880 if (klass_is_exact == this->klass_is_exact()) { 6881 return this; 6882 } 6883 if (!klass_is_exact && must_be_exact()) { 6884 return this; 6885 } 6886 const Type* elem = this->elem(); 6887 if (elem->isa_klassptr() && !klass_is_exact) { 6888 elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact); 6889 } 6890 6891 if (klass_is_exact) { 6892 // cast_to_exactness(true) really means get the LCA of all values represented by this 6893 // TypeAryKlassPtr. As a result, it must be an unrefined klass pointer. 6894 return make(Constant, elem, nullptr, _offset, true, true, false, false, true, false); 6895 } else { 6896 // cast_to_exactness(false) means get the TypeAryKlassPtr representing all values that subtype 6897 // this value 6898 bool not_inline = !_elem->isa_instklassptr() || !_elem->is_instklassptr()->instance_klass()->can_be_inline_klass(); 6899 bool not_flat = !UseArrayFlattening || not_inline || 6900 (_elem->isa_instklassptr() && _elem->is_instklassptr()->instance_klass()->is_inlinetype() && !_elem->is_instklassptr()->instance_klass()->maybe_flat_in_array()); 6901 bool not_null_free = not_inline; 6902 bool atomic = not_flat; 6903 return make(NotNull, elem, nullptr, _offset, not_flat, not_null_free, false, false, atomic, false); 6904 } 6905 } 6906 6907 //-----------------------------as_instance_type-------------------------------- 6908 // Corresponding type for an instance of the given class. 6909 // It will be NotNull, and exact if and only if the klass type is exact. 6910 const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const { 6911 ciKlass* k = klass(); 6912 bool xk = klass_is_exact(); 6913 const Type* el = nullptr; 6914 if (elem()->isa_klassptr()) { 6915 el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false); 6916 k = nullptr; 6917 } else { 6918 el = elem(); 6919 } 6920 bool null_free = _null_free; 6921 if (null_free && el->isa_ptr()) { 6922 el = el->is_ptr()->join_speculative(TypePtr::NOTNULL); 6923 } 6924 return TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(el, TypeInt::POS, false, is_flat(), is_not_flat(), is_not_null_free(), is_atomic()), k, xk, Offset(0)); 6925 } 6926 6927 6928 //------------------------------xmeet------------------------------------------ 6929 // Compute the MEET of two types, return a new Type object. 6930 const Type *TypeAryKlassPtr::xmeet( const Type *t ) const { 6931 // Perform a fast test for common case; meeting the same types together. 6932 if( this == t ) return this; // Meeting same type-rep? 6933 6934 // Current "this->_base" is Pointer 6935 switch (t->base()) { // switch on original type 6936 6937 case Int: // Mixing ints & oops happens when javac 6938 case Long: // reuses local variables 6939 case HalfFloatTop: 6940 case HalfFloatCon: 6941 case HalfFloatBot: 6942 case FloatTop: 6943 case FloatCon: 6944 case FloatBot: 6945 case DoubleTop: 6946 case DoubleCon: 6947 case DoubleBot: 6948 case NarrowOop: 6949 case NarrowKlass: 6950 case Bottom: // Ye Olde Default 6951 return Type::BOTTOM; 6952 case Top: 6953 return this; 6954 6955 default: // All else is a mistake 6956 typerr(t); 6957 6958 case AnyPtr: { // Meeting to AnyPtrs 6959 // Found an AnyPtr type vs self-KlassPtr type 6960 const TypePtr *tp = t->is_ptr(); 6961 Offset offset = meet_offset(tp->offset()); 6962 PTR ptr = meet_ptr(tp->ptr()); 6963 switch (tp->ptr()) { 6964 case TopPTR: 6965 return this; 6966 case Null: 6967 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6968 case AnyNull: 6969 return make(ptr, _elem, klass(), offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type()); 6970 case BotPTR: 6971 case NotNull: 6972 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6973 default: typerr(t); 6974 } 6975 } 6976 6977 case RawPtr: 6978 case MetadataPtr: 6979 case OopPtr: 6980 case AryPtr: // Meet with AryPtr 6981 case InstPtr: // Meet with InstPtr 6982 return TypePtr::BOTTOM; 6983 6984 // 6985 // A-top } 6986 // / | \ } Tops 6987 // B-top A-any C-top } 6988 // | / | \ | } Any-nulls 6989 // B-any | C-any } 6990 // | | | 6991 // B-con A-con C-con } constants; not comparable across classes 6992 // | | | 6993 // B-not | C-not } 6994 // | \ | / | } not-nulls 6995 // B-bot A-not C-bot } 6996 // \ | / } Bottoms 6997 // A-bot } 6998 // 6999 7000 case AryKlassPtr: { // Meet two KlassPtr types 7001 const TypeAryKlassPtr *tap = t->is_aryklassptr(); 7002 Offset off = meet_offset(tap->offset()); 7003 const Type* elem = _elem->meet(tap->_elem); 7004 PTR ptr = meet_ptr(tap->ptr()); 7005 ciKlass* res_klass = nullptr; 7006 bool res_xk = false; 7007 bool res_flat = false; 7008 bool res_not_flat = false; 7009 bool res_not_null_free = false; 7010 bool res_atomic = false; 7011 MeetResult res = meet_aryptr(ptr, elem, this, tap, 7012 res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic); 7013 assert(res_xk == (ptr == Constant), ""); 7014 bool flat = meet_flat(tap->_flat); 7015 bool null_free = meet_null_free(tap->_null_free); 7016 bool atomic = meet_atomic(tap->_atomic); 7017 bool refined_type = _refined_type && tap->_refined_type; 7018 if (res == NOT_SUBTYPE) { 7019 flat = false; 7020 null_free = false; 7021 atomic = false; 7022 refined_type = false; 7023 } else if (res == SUBTYPE) { 7024 if (above_centerline(tap->ptr()) && !above_centerline(this->ptr())) { 7025 flat = _flat; 7026 null_free = _null_free; 7027 atomic = _atomic; 7028 refined_type = _refined_type; 7029 } else if (above_centerline(this->ptr()) && !above_centerline(tap->ptr())) { 7030 flat = tap->_flat; 7031 null_free = tap->_null_free; 7032 atomic = tap->_atomic; 7033 refined_type = tap->_refined_type; 7034 } else if (above_centerline(this->ptr()) && above_centerline(tap->ptr())) { 7035 flat = _flat || tap->_flat; 7036 null_free = _null_free || tap->_null_free; 7037 atomic = _atomic || tap->_atomic; 7038 refined_type = _refined_type || tap->_refined_type; 7039 } else if (res_xk && _refined_type != tap->_refined_type) { 7040 // This can happen if the phi emitted by LibraryCallKit::load_default_refined_array_klass/load_non_refined_array_klass 7041 // is processed before the typeArray guard is folded. Both inputs are constant but the input corresponding to the 7042 // typeArray will go away. Don't constant fold it yet but wait for the control input to collapse. 7043 ptr = PTR::NotNull; 7044 } 7045 } 7046 return make(ptr, elem, res_klass, off, res_not_flat, res_not_null_free, flat, null_free, atomic, refined_type); 7047 } // End of case KlassPtr 7048 case InstKlassPtr: { 7049 const TypeInstKlassPtr *tp = t->is_instklassptr(); 7050 Offset offset = meet_offset(tp->offset()); 7051 PTR ptr = meet_ptr(tp->ptr()); 7052 const TypeInterfaces* interfaces = meet_interfaces(tp); 7053 const TypeInterfaces* tp_interfaces = tp->_interfaces; 7054 const TypeInterfaces* this_interfaces = _interfaces; 7055 7056 switch (ptr) { 7057 case TopPTR: 7058 case AnyNull: // Fall 'down' to dual of object klass 7059 // For instances when a subclass meets a superclass we fall 7060 // below the centerline when the superclass is exact. We need to 7061 // do the same here. 7062 // 7063 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 7064 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 7065 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 7066 return TypeAryKlassPtr::make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type()); 7067 } else { 7068 // cannot subclass, so the meet has to fall badly below the centerline 7069 ptr = NotNull; 7070 interfaces = this_interfaces->intersection_with(tp->_interfaces); 7071 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 7072 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array); 7073 } 7074 case Constant: 7075 case NotNull: 7076 case BotPTR: { // Fall down to object klass 7077 // LCA is object_klass, but if we subclass from the top we can do better 7078 if (above_centerline(tp->ptr())) { 7079 // If 'tp' is above the centerline and it is Object class 7080 // then we can subclass in the Java class hierarchy. 7081 // For instances when a subclass meets a superclass we fall 7082 // below the centerline when the superclass is exact. We need 7083 // to do the same here. 7084 // 7085 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 7086 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 7087 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 7088 // that is, my array type is a subtype of 'tp' klass 7089 return make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type()); 7090 } 7091 } 7092 // The other case cannot happen, since t cannot be a subtype of an array. 7093 // The meet falls down to Object class below centerline. 7094 if (ptr == Constant) 7095 ptr = NotNull; 7096 interfaces = this_interfaces->intersection_with(tp_interfaces); 7097 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 7098 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, tp->flat_in_array()); 7099 } 7100 default: typerr(t); 7101 } 7102 } 7103 7104 } // End of switch 7105 return this; // Return the double constant 7106 } 7107 7108 template <class T1, class T2> bool TypePtr::is_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { 7109 static_assert(std::is_base_of<T2, T1>::value, ""); 7110 7111 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) { 7112 return true; 7113 } 7114 7115 int dummy; 7116 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 7117 7118 if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) { 7119 return false; 7120 } 7121 7122 if (this_one->is_instance_type(other)) { 7123 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) && 7124 other_exact; 7125 } 7126 7127 assert(this_one->is_array_type(other), ""); 7128 const T1* other_ary = this_one->is_array_type(other); 7129 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 7130 if (other_top_or_bottom) { 7131 return false; 7132 } 7133 7134 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 7135 const TypePtr* this_elem = this_one->elem()->make_ptr(); 7136 if (this_elem != nullptr && other_elem != nullptr) { 7137 if (other->is_null_free() && !this_one->is_null_free()) { 7138 return false; // A nullable array can't be a subtype of a null-free array 7139 } 7140 return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact); 7141 } 7142 if (this_elem == nullptr && other_elem == nullptr) { 7143 return this_one->klass()->is_subtype_of(other->klass()); 7144 } 7145 return false; 7146 } 7147 7148 bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 7149 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 7150 } 7151 7152 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) { 7153 static_assert(std::is_base_of<T2, T1>::value, ""); 7154 7155 int dummy; 7156 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 7157 7158 if (!this_one->is_array_type(other) || 7159 !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) { 7160 return false; 7161 } 7162 const T1* other_ary = this_one->is_array_type(other); 7163 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 7164 7165 if (other_top_or_bottom) { 7166 return false; 7167 } 7168 7169 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 7170 const TypePtr* this_elem = this_one->elem()->make_ptr(); 7171 if (other_elem != nullptr && this_elem != nullptr) { 7172 return this_one->is_reference_type(this_elem)->is_same_java_type_as(this_one->is_reference_type(other_elem)); 7173 } 7174 if (other_elem == nullptr && this_elem == nullptr) { 7175 return this_one->klass()->equals(other->klass()); 7176 } 7177 return false; 7178 } 7179 7180 bool TypeAryKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const { 7181 return TypePtr::is_same_java_type_as_helper_for_array(this, other); 7182 } 7183 7184 template <class T1, class T2> bool TypePtr::maybe_java_subtype_of_helper_for_array(const T1* this_one, const T2* other, bool this_exact, bool other_exact) { 7185 static_assert(std::is_base_of<T2, T1>::value, ""); 7186 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) { 7187 return true; 7188 } 7189 if (!this_one->is_loaded() || !other->is_loaded()) { 7190 return true; 7191 } 7192 if (this_one->is_instance_type(other)) { 7193 return other->klass()->equals(ciEnv::current()->Object_klass()) && 7194 this_one->_interfaces->contains(other->_interfaces); 7195 } 7196 7197 int dummy; 7198 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 7199 if (this_top_or_bottom) { 7200 return true; 7201 } 7202 7203 assert(this_one->is_array_type(other), ""); 7204 7205 const T1* other_ary = this_one->is_array_type(other); 7206 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 7207 if (other_top_or_bottom) { 7208 return true; 7209 } 7210 if (this_exact && other_exact) { 7211 return this_one->is_java_subtype_of(other); 7212 } 7213 7214 const TypePtr* this_elem = this_one->elem()->make_ptr(); 7215 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 7216 if (other_elem != nullptr && this_elem != nullptr) { 7217 return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact); 7218 } 7219 if (other_elem == nullptr && this_elem == nullptr) { 7220 return this_one->klass()->is_subtype_of(other->klass()); 7221 } 7222 return false; 7223 } 7224 7225 bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 7226 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 7227 } 7228 7229 //------------------------------xdual------------------------------------------ 7230 // Dual: compute field-by-field dual 7231 const Type *TypeAryKlassPtr::xdual() const { 7232 return new TypeAryKlassPtr(dual_ptr(), elem()->dual(), klass(), dual_offset(), !is_not_flat(), !is_not_null_free(), dual_flat(), dual_null_free(), dual_atomic(), _refined_type); 7233 } 7234 7235 // Is there a single ciKlass* that can represent that type? 7236 ciKlass* TypeAryKlassPtr::exact_klass_helper() const { 7237 if (elem()->isa_klassptr()) { 7238 ciKlass* k = elem()->is_klassptr()->exact_klass_helper(); 7239 if (k == nullptr) { 7240 return nullptr; 7241 } 7242 assert(!k->is_array_klass() || !k->as_array_klass()->is_refined(), "no mechanism to create an array of refined arrays %s", k->name()->as_utf8()); 7243 k = ciArrayKlass::make(k, is_null_free(), is_atomic(), _refined_type); 7244 return k; 7245 } 7246 7247 return klass(); 7248 } 7249 7250 ciKlass* TypeAryKlassPtr::klass() const { 7251 if (_klass != nullptr) { 7252 return _klass; 7253 } 7254 ciKlass* k = nullptr; 7255 if (elem()->isa_klassptr()) { 7256 // leave null 7257 } else if ((elem()->base() == Type::Top) || 7258 (elem()->base() == Type::Bottom)) { 7259 } else { 7260 k = ciTypeArrayKlass::make(elem()->basic_type()); 7261 ((TypeAryKlassPtr*)this)->_klass = k; 7262 } 7263 return k; 7264 } 7265 7266 //------------------------------dump2------------------------------------------ 7267 // Dump Klass Type 7268 #ifndef PRODUCT 7269 void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const { 7270 st->print("aryklassptr:["); 7271 _elem->dump2(d, depth, st); 7272 _interfaces->dump(st); 7273 st->print(":%s", ptr_msg[_ptr]); 7274 if (_flat) st->print(":flat"); 7275 if (_null_free) st->print(":null free"); 7276 if (_atomic) st->print(":atomic"); 7277 if (_refined_type) st->print(":refined_type"); 7278 if (Verbose) { 7279 if (_not_flat) st->print(":not flat"); 7280 if (_not_null_free) st->print(":nullable"); 7281 } 7282 dump_offset(st); 7283 } 7284 #endif 7285 7286 const Type* TypeAryKlassPtr::base_element_type(int& dims) const { 7287 const Type* elem = this->elem(); 7288 dims = 1; 7289 while (elem->isa_aryklassptr()) { 7290 elem = elem->is_aryklassptr()->elem(); 7291 dims++; 7292 } 7293 return elem; 7294 } 7295 7296 //============================================================================= 7297 // Convenience common pre-built types. 7298 7299 //------------------------------make------------------------------------------- 7300 const TypeFunc *TypeFunc::make(const TypeTuple *domain_sig, const TypeTuple* domain_cc, 7301 const TypeTuple *range_sig, const TypeTuple *range_cc) { 7302 return (TypeFunc*)(new TypeFunc(domain_sig, domain_cc, range_sig, range_cc))->hashcons(); 7303 } 7304 7305 const TypeFunc *TypeFunc::make(const TypeTuple *domain, const TypeTuple *range) { 7306 return make(domain, domain, range, range); 7307 } 7308 7309 //------------------------------osr_domain----------------------------- 7310 const TypeTuple* osr_domain() { 7311 const Type **fields = TypeTuple::fields(2); 7312 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // address of osr buffer 7313 return TypeTuple::make(TypeFunc::Parms+1, fields); 7314 } 7315 7316 //------------------------------make------------------------------------------- 7317 const TypeFunc* TypeFunc::make(ciMethod* method, bool is_osr_compilation) { 7318 Compile* C = Compile::current(); 7319 const TypeFunc* tf = nullptr; 7320 if (!is_osr_compilation) { 7321 tf = C->last_tf(method); // check cache 7322 if (tf != nullptr) return tf; // The hit rate here is almost 50%. 7323 } 7324 // Inline types are not passed/returned by reference, instead each field of 7325 // the inline type is passed/returned as an argument. We maintain two views of 7326 // the argument/return list here: one based on the signature (with an inline 7327 // type argument/return as a single slot), one based on the actual calling 7328 // convention (with an inline type argument/return as a list of its fields). 7329 bool has_scalar_args = method->has_scalarized_args() && !is_osr_compilation; 7330 // Fall back to the non-scalarized calling convention when compiling a call via a mismatching method 7331 if (method != C->method() && method->mismatch()) { 7332 has_scalar_args = false; 7333 } 7334 const TypeTuple* domain_sig = is_osr_compilation ? osr_domain() : TypeTuple::make_domain(method, ignore_interfaces, false); 7335 const TypeTuple* domain_cc = has_scalar_args ? TypeTuple::make_domain(method, ignore_interfaces, true) : domain_sig; 7336 ciSignature* sig = method->signature(); 7337 bool has_scalar_ret = !method->is_native() && sig->return_type()->is_inlinetype() && sig->return_type()->as_inline_klass()->can_be_returned_as_fields(); 7338 const TypeTuple* range_sig = TypeTuple::make_range(sig, ignore_interfaces, false); 7339 const TypeTuple* range_cc = has_scalar_ret ? TypeTuple::make_range(sig, ignore_interfaces, true) : range_sig; 7340 tf = TypeFunc::make(domain_sig, domain_cc, range_sig, range_cc); 7341 if (!is_osr_compilation) { 7342 C->set_last_tf(method, tf); // fill cache 7343 } 7344 return tf; 7345 } 7346 7347 //------------------------------meet------------------------------------------- 7348 // Compute the MEET of two types. It returns a new Type object. 7349 const Type *TypeFunc::xmeet( const Type *t ) const { 7350 // Perform a fast test for common case; meeting the same types together. 7351 if( this == t ) return this; // Meeting same type-rep? 7352 7353 // Current "this->_base" is Func 7354 switch (t->base()) { // switch on original type 7355 7356 case Bottom: // Ye Olde Default 7357 return t; 7358 7359 default: // All else is a mistake 7360 typerr(t); 7361 7362 case Top: 7363 break; 7364 } 7365 return this; // Return the double constant 7366 } 7367 7368 //------------------------------xdual------------------------------------------ 7369 // Dual: compute field-by-field dual 7370 const Type *TypeFunc::xdual() const { 7371 return this; 7372 } 7373 7374 //------------------------------eq--------------------------------------------- 7375 // Structural equality check for Type representations 7376 bool TypeFunc::eq( const Type *t ) const { 7377 const TypeFunc *a = (const TypeFunc*)t; 7378 return _domain_sig == a->_domain_sig && 7379 _domain_cc == a->_domain_cc && 7380 _range_sig == a->_range_sig && 7381 _range_cc == a->_range_cc; 7382 } 7383 7384 //------------------------------hash------------------------------------------- 7385 // Type-specific hashing function. 7386 uint TypeFunc::hash(void) const { 7387 return (uint)(intptr_t)_domain_sig + (uint)(intptr_t)_domain_cc + (uint)(intptr_t)_range_sig + (uint)(intptr_t)_range_cc; 7388 } 7389 7390 //------------------------------dump2------------------------------------------ 7391 // Dump Function Type 7392 #ifndef PRODUCT 7393 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const { 7394 if( _range_sig->cnt() <= Parms ) 7395 st->print("void"); 7396 else { 7397 uint i; 7398 for (i = Parms; i < _range_sig->cnt()-1; i++) { 7399 _range_sig->field_at(i)->dump2(d,depth,st); 7400 st->print("/"); 7401 } 7402 _range_sig->field_at(i)->dump2(d,depth,st); 7403 } 7404 st->print(" "); 7405 st->print("( "); 7406 if( !depth || d[this] ) { // Check for recursive dump 7407 st->print("...)"); 7408 return; 7409 } 7410 d.Insert((void*)this,(void*)this); // Stop recursion 7411 if (Parms < _domain_sig->cnt()) 7412 _domain_sig->field_at(Parms)->dump2(d,depth-1,st); 7413 for (uint i = Parms+1; i < _domain_sig->cnt(); i++) { 7414 st->print(", "); 7415 _domain_sig->field_at(i)->dump2(d,depth-1,st); 7416 } 7417 st->print(" )"); 7418 } 7419 #endif 7420 7421 //------------------------------singleton-------------------------------------- 7422 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 7423 // constants (Ldi nodes). Singletons are integer, float or double constants 7424 // or a single symbol. 7425 bool TypeFunc::singleton(void) const { 7426 return false; // Never a singleton 7427 } 7428 7429 bool TypeFunc::empty(void) const { 7430 return false; // Never empty 7431 } 7432 7433 7434 BasicType TypeFunc::return_type() const{ 7435 if (range_sig()->cnt() == TypeFunc::Parms) { 7436 return T_VOID; 7437 } 7438 return range_sig()->field_at(TypeFunc::Parms)->basic_type(); 7439 } --- EOF ---