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 TypePVectMask(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, bool is_call) { 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 if (is_call) { 2219 // InlineTypeNode::NullMarker field returned by scalarized calls 2220 arg_cnt++; 2221 } 2222 } 2223 const Type **field_array = fields(arg_cnt); 2224 switch (return_type->basic_type()) { 2225 case T_LONG: 2226 field_array[TypeFunc::Parms] = TypeLong::LONG; 2227 field_array[TypeFunc::Parms+1] = Type::HALF; 2228 break; 2229 case T_DOUBLE: 2230 field_array[TypeFunc::Parms] = Type::DOUBLE; 2231 field_array[TypeFunc::Parms+1] = Type::HALF; 2232 break; 2233 case T_OBJECT: 2234 if (ret_vt_fields) { 2235 uint pos = TypeFunc::Parms; 2236 field_array[pos++] = get_const_type(return_type); // Oop might be null when returning as fields 2237 collect_inline_fields(return_type->as_inline_klass(), field_array, pos); 2238 if (is_call) { 2239 // InlineTypeNode::NullMarker field returned by scalarized calls 2240 field_array[pos++] = get_const_basic_type(T_BOOLEAN); 2241 } 2242 assert(pos == (TypeFunc::Parms + arg_cnt), "out of bounds"); 2243 break; 2244 } else { 2245 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling)->join_speculative(TypePtr::BOTTOM); 2246 } 2247 break; 2248 case T_ARRAY: 2249 case T_BOOLEAN: 2250 case T_CHAR: 2251 case T_FLOAT: 2252 case T_BYTE: 2253 case T_SHORT: 2254 case T_INT: 2255 field_array[TypeFunc::Parms] = get_const_type(return_type, interface_handling); 2256 break; 2257 case T_VOID: 2258 break; 2259 default: 2260 ShouldNotReachHere(); 2261 } 2262 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons(); 2263 } 2264 2265 // Make a TypeTuple from the domain of a method signature 2266 const TypeTuple *TypeTuple::make_domain(ciMethod* method, InterfaceHandling interface_handling, bool vt_fields_as_args) { 2267 ciSignature* sig = method->signature(); 2268 uint arg_cnt = sig->size() + (method->is_static() ? 0 : 1); 2269 if (vt_fields_as_args) { 2270 arg_cnt = 0; 2271 assert(method->get_sig_cc() != nullptr, "Should have scalarized signature"); 2272 for (ExtendedSignature sig_cc = ExtendedSignature(method->get_sig_cc(), SigEntryFilter()); !sig_cc.at_end(); ++sig_cc) { 2273 arg_cnt += type2size[(*sig_cc)._bt]; 2274 } 2275 } 2276 2277 uint pos = TypeFunc::Parms; 2278 const Type** field_array = fields(arg_cnt); 2279 if (!method->is_static()) { 2280 ciInstanceKlass* recv = method->holder(); 2281 if (vt_fields_as_args && recv->is_inlinetype() && recv->as_inline_klass()->can_be_passed_as_fields() && method->is_scalarized_arg(0)) { 2282 field_array[pos++] = get_const_type(recv, interface_handling); // buffer argument 2283 collect_inline_fields(recv->as_inline_klass(), field_array, pos); 2284 } else { 2285 field_array[pos++] = get_const_type(recv, interface_handling)->join_speculative(TypePtr::NOTNULL); 2286 } 2287 } 2288 2289 int i = 0; 2290 while (pos < TypeFunc::Parms + arg_cnt) { 2291 ciType* type = sig->type_at(i); 2292 BasicType bt = type->basic_type(); 2293 2294 switch (bt) { 2295 case T_LONG: 2296 field_array[pos++] = TypeLong::LONG; 2297 field_array[pos++] = Type::HALF; 2298 break; 2299 case T_DOUBLE: 2300 field_array[pos++] = Type::DOUBLE; 2301 field_array[pos++] = Type::HALF; 2302 break; 2303 case T_OBJECT: 2304 if (type->is_inlinetype() && vt_fields_as_args && method->is_scalarized_arg(i + (method->is_static() ? 0 : 1))) { 2305 field_array[pos++] = get_const_type(type, interface_handling); // buffer argument 2306 // InlineTypeNode::NullMarker field used for null checking 2307 field_array[pos++] = get_const_basic_type(T_BOOLEAN); 2308 collect_inline_fields(type->as_inline_klass(), field_array, pos); 2309 } else { 2310 field_array[pos++] = get_const_type(type, interface_handling); 2311 } 2312 break; 2313 case T_ARRAY: 2314 case T_FLOAT: 2315 case T_INT: 2316 field_array[pos++] = get_const_type(type, interface_handling); 2317 break; 2318 case T_BOOLEAN: 2319 case T_CHAR: 2320 case T_BYTE: 2321 case T_SHORT: 2322 field_array[pos++] = TypeInt::INT; 2323 break; 2324 default: 2325 ShouldNotReachHere(); 2326 } 2327 i++; 2328 } 2329 assert(pos == TypeFunc::Parms + arg_cnt, "wrong number of arguments"); 2330 2331 return (TypeTuple*)(new TypeTuple(TypeFunc::Parms + arg_cnt, field_array))->hashcons(); 2332 } 2333 2334 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) { 2335 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons(); 2336 } 2337 2338 //------------------------------fields----------------------------------------- 2339 // Subroutine call type with space allocated for argument types 2340 // Memory for Control, I_O, Memory, FramePtr, and ReturnAdr is allocated implicitly 2341 const Type **TypeTuple::fields( uint arg_cnt ) { 2342 const Type **flds = (const Type **)(Compile::current()->type_arena()->AmallocWords((TypeFunc::Parms+arg_cnt)*sizeof(Type*) )); 2343 flds[TypeFunc::Control ] = Type::CONTROL; 2344 flds[TypeFunc::I_O ] = Type::ABIO; 2345 flds[TypeFunc::Memory ] = Type::MEMORY; 2346 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM; 2347 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS; 2348 2349 return flds; 2350 } 2351 2352 //------------------------------meet------------------------------------------- 2353 // Compute the MEET of two types. It returns a new Type object. 2354 const Type *TypeTuple::xmeet( const Type *t ) const { 2355 // Perform a fast test for common case; meeting the same types together. 2356 if( this == t ) return this; // Meeting same type-rep? 2357 2358 // Current "this->_base" is Tuple 2359 switch (t->base()) { // switch on original type 2360 2361 case Bottom: // Ye Olde Default 2362 return t; 2363 2364 default: // All else is a mistake 2365 typerr(t); 2366 2367 case Tuple: { // Meeting 2 signatures? 2368 const TypeTuple *x = t->is_tuple(); 2369 assert( _cnt == x->_cnt, "" ); 2370 const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) )); 2371 for( uint i=0; i<_cnt; i++ ) 2372 fields[i] = field_at(i)->xmeet( x->field_at(i) ); 2373 return TypeTuple::make(_cnt,fields); 2374 } 2375 case Top: 2376 break; 2377 } 2378 return this; // Return the double constant 2379 } 2380 2381 //------------------------------xdual------------------------------------------ 2382 // Dual: compute field-by-field dual 2383 const Type *TypeTuple::xdual() const { 2384 const Type **fields = (const Type **)(Compile::current()->type_arena()->AmallocWords( _cnt*sizeof(Type*) )); 2385 for( uint i=0; i<_cnt; i++ ) 2386 fields[i] = _fields[i]->dual(); 2387 return new TypeTuple(_cnt,fields); 2388 } 2389 2390 //------------------------------eq--------------------------------------------- 2391 // Structural equality check for Type representations 2392 bool TypeTuple::eq( const Type *t ) const { 2393 const TypeTuple *s = (const TypeTuple *)t; 2394 if (_cnt != s->_cnt) return false; // Unequal field counts 2395 for (uint i = 0; i < _cnt; i++) 2396 if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION! 2397 return false; // Missed 2398 return true; 2399 } 2400 2401 //------------------------------hash------------------------------------------- 2402 // Type-specific hashing function. 2403 uint TypeTuple::hash(void) const { 2404 uintptr_t sum = _cnt; 2405 for( uint i=0; i<_cnt; i++ ) 2406 sum += (uintptr_t)_fields[i]; // Hash on pointers directly 2407 return (uint)sum; 2408 } 2409 2410 //------------------------------dump2------------------------------------------ 2411 // Dump signature Type 2412 #ifndef PRODUCT 2413 void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const { 2414 st->print("{"); 2415 if( !depth || d[this] ) { // Check for recursive print 2416 st->print("...}"); 2417 return; 2418 } 2419 d.Insert((void*)this, (void*)this); // Stop recursion 2420 if( _cnt ) { 2421 uint i; 2422 for( i=0; i<_cnt-1; i++ ) { 2423 st->print("%d:", i); 2424 _fields[i]->dump2(d, depth-1, st); 2425 st->print(", "); 2426 } 2427 st->print("%d:", i); 2428 _fields[i]->dump2(d, depth-1, st); 2429 } 2430 st->print("}"); 2431 } 2432 #endif 2433 2434 //------------------------------singleton-------------------------------------- 2435 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2436 // constants (Ldi nodes). Singletons are integer, float or double constants 2437 // or a single symbol. 2438 bool TypeTuple::singleton(void) const { 2439 return false; // Never a singleton 2440 } 2441 2442 bool TypeTuple::empty(void) const { 2443 for( uint i=0; i<_cnt; i++ ) { 2444 if (_fields[i]->empty()) return true; 2445 } 2446 return false; 2447 } 2448 2449 //============================================================================= 2450 // Convenience common pre-built types. 2451 2452 inline const TypeInt* normalize_array_size(const TypeInt* size) { 2453 // Certain normalizations keep us sane when comparing types. 2454 // We do not want arrayOop variables to differ only by the wideness 2455 // of their index types. Pick minimum wideness, since that is the 2456 // forced wideness of small ranges anyway. 2457 if (size->_widen != Type::WidenMin) 2458 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin); 2459 else 2460 return size; 2461 } 2462 2463 //------------------------------make------------------------------------------- 2464 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable, 2465 bool flat, bool not_flat, bool not_null_free, bool atomic) { 2466 if (UseCompressedOops && elem->isa_oopptr()) { 2467 elem = elem->make_narrowoop(); 2468 } 2469 size = normalize_array_size(size); 2470 return (TypeAry*)(new TypeAry(elem, size, stable, flat, not_flat, not_null_free, atomic))->hashcons(); 2471 } 2472 2473 //------------------------------meet------------------------------------------- 2474 // Compute the MEET of two types. It returns a new Type object. 2475 const Type *TypeAry::xmeet( const Type *t ) const { 2476 // Perform a fast test for common case; meeting the same types together. 2477 if( this == t ) return this; // Meeting same type-rep? 2478 2479 // Current "this->_base" is Ary 2480 switch (t->base()) { // switch on original type 2481 2482 case Bottom: // Ye Olde Default 2483 return t; 2484 2485 default: // All else is a mistake 2486 typerr(t); 2487 2488 case Array: { // Meeting 2 arrays? 2489 const TypeAry* a = t->is_ary(); 2490 const Type* size = _size->xmeet(a->_size); 2491 const TypeInt* isize = size->isa_int(); 2492 if (isize == nullptr) { 2493 assert(size == Type::TOP || size == Type::BOTTOM, ""); 2494 return size; 2495 } 2496 return TypeAry::make(_elem->meet_speculative(a->_elem), 2497 isize, _stable && a->_stable, 2498 _flat && a->_flat, 2499 _not_flat && a->_not_flat, 2500 _not_null_free && a->_not_null_free, 2501 _atomic && a->_atomic); 2502 } 2503 case Top: 2504 break; 2505 } 2506 return this; // Return the double constant 2507 } 2508 2509 //------------------------------xdual------------------------------------------ 2510 // Dual: compute field-by-field dual 2511 const Type *TypeAry::xdual() const { 2512 const TypeInt* size_dual = _size->dual()->is_int(); 2513 size_dual = normalize_array_size(size_dual); 2514 return new TypeAry(_elem->dual(), size_dual, !_stable, !_flat, !_not_flat, !_not_null_free, !_atomic); 2515 } 2516 2517 //------------------------------eq--------------------------------------------- 2518 // Structural equality check for Type representations 2519 bool TypeAry::eq( const Type *t ) const { 2520 const TypeAry *a = (const TypeAry*)t; 2521 return _elem == a->_elem && 2522 _stable == a->_stable && 2523 _size == a->_size && 2524 _flat == a->_flat && 2525 _not_flat == a->_not_flat && 2526 _not_null_free == a->_not_null_free && 2527 _atomic == a->_atomic; 2528 2529 } 2530 2531 //------------------------------hash------------------------------------------- 2532 // Type-specific hashing function. 2533 uint TypeAry::hash(void) const { 2534 return (uint)(uintptr_t)_elem + (uint)(uintptr_t)_size + (uint)(_stable ? 43 : 0) + 2535 (uint)(_flat ? 44 : 0) + (uint)(_not_flat ? 45 : 0) + (uint)(_not_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0); 2536 } 2537 2538 /** 2539 * Return same type without a speculative part in the element 2540 */ 2541 const TypeAry* TypeAry::remove_speculative() const { 2542 return make(_elem->remove_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic); 2543 } 2544 2545 /** 2546 * Return same type with cleaned up speculative part of element 2547 */ 2548 const Type* TypeAry::cleanup_speculative() const { 2549 return make(_elem->cleanup_speculative(), _size, _stable, _flat, _not_flat, _not_null_free, _atomic); 2550 } 2551 2552 /** 2553 * Return same type but with a different inline depth (used for speculation) 2554 * 2555 * @param depth depth to meet with 2556 */ 2557 const TypePtr* TypePtr::with_inline_depth(int depth) const { 2558 if (!UseInlineDepthForSpeculativeTypes) { 2559 return this; 2560 } 2561 return make(AnyPtr, _ptr, _offset, _speculative, depth); 2562 } 2563 2564 //------------------------------dump2------------------------------------------ 2565 #ifndef PRODUCT 2566 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const { 2567 if (_stable) st->print("stable:"); 2568 if (_flat) st->print("flat:"); 2569 if (Verbose) { 2570 if (_not_flat) st->print("not flat:"); 2571 if (_not_null_free) st->print("not null free:"); 2572 } 2573 if (_atomic) st->print("atomic:"); 2574 _elem->dump2(d, depth, st); 2575 st->print("["); 2576 _size->dump2(d, depth, st); 2577 st->print("]"); 2578 } 2579 #endif 2580 2581 //------------------------------singleton-------------------------------------- 2582 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2583 // constants (Ldi nodes). Singletons are integer, float or double constants 2584 // or a single symbol. 2585 bool TypeAry::singleton(void) const { 2586 return false; // Never a singleton 2587 } 2588 2589 bool TypeAry::empty(void) const { 2590 return _elem->empty() || _size->empty(); 2591 } 2592 2593 //--------------------------ary_must_be_exact---------------------------------- 2594 bool TypeAry::ary_must_be_exact() const { 2595 // This logic looks at the element type of an array, and returns true 2596 // if the element type is either a primitive or a final instance class. 2597 // In such cases, an array built on this ary must have no subclasses. 2598 if (_elem == BOTTOM) return false; // general array not exact 2599 if (_elem == TOP ) return false; // inverted general array not exact 2600 const TypeOopPtr* toop = nullptr; 2601 if (UseCompressedOops && _elem->isa_narrowoop()) { 2602 toop = _elem->make_ptr()->isa_oopptr(); 2603 } else { 2604 toop = _elem->isa_oopptr(); 2605 } 2606 if (!toop) return true; // a primitive type, like int 2607 if (!toop->is_loaded()) return false; // unloaded class 2608 const TypeInstPtr* tinst; 2609 if (_elem->isa_narrowoop()) 2610 tinst = _elem->make_ptr()->isa_instptr(); 2611 else 2612 tinst = _elem->isa_instptr(); 2613 if (tinst) { 2614 if (tinst->instance_klass()->is_final()) { 2615 // Even though MyValue is final, [LMyValue is only exact if the array 2616 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue. 2617 // TODO 8350865 If we know that the array can't be null-free, it's allowed to be exact, right? 2618 // If so, we should add '&& !_not_null_free' 2619 if (tinst->is_inlinetypeptr() && (tinst->ptr() != TypePtr::NotNull)) { 2620 return false; 2621 } 2622 return true; 2623 } 2624 return false; 2625 } 2626 const TypeAryPtr* tap; 2627 if (_elem->isa_narrowoop()) 2628 tap = _elem->make_ptr()->isa_aryptr(); 2629 else 2630 tap = _elem->isa_aryptr(); 2631 if (tap) 2632 return tap->ary()->ary_must_be_exact(); 2633 return false; 2634 } 2635 2636 //==============================TypeVect======================================= 2637 // Convenience common pre-built types. 2638 const TypeVect* TypeVect::VECTA = nullptr; // vector length agnostic 2639 const TypeVect* TypeVect::VECTS = nullptr; // 32-bit vectors 2640 const TypeVect* TypeVect::VECTD = nullptr; // 64-bit vectors 2641 const TypeVect* TypeVect::VECTX = nullptr; // 128-bit vectors 2642 const TypeVect* TypeVect::VECTY = nullptr; // 256-bit vectors 2643 const TypeVect* TypeVect::VECTZ = nullptr; // 512-bit vectors 2644 const TypeVect* TypeVect::VECTMASK = nullptr; // predicate/mask vector 2645 2646 //------------------------------make------------------------------------------- 2647 const TypeVect* TypeVect::make(BasicType elem_bt, uint length, bool is_mask) { 2648 if (is_mask) { 2649 return makemask(elem_bt, length); 2650 } 2651 assert(is_java_primitive(elem_bt), "only primitive types in vector"); 2652 assert(Matcher::vector_size_supported(elem_bt, length), "length in range"); 2653 int size = length * type2aelembytes(elem_bt); 2654 switch (Matcher::vector_ideal_reg(size)) { 2655 case Op_VecA: 2656 return (TypeVect*)(new TypeVectA(elem_bt, length))->hashcons(); 2657 case Op_VecS: 2658 return (TypeVect*)(new TypeVectS(elem_bt, length))->hashcons(); 2659 case Op_RegL: 2660 case Op_VecD: 2661 case Op_RegD: 2662 return (TypeVect*)(new TypeVectD(elem_bt, length))->hashcons(); 2663 case Op_VecX: 2664 return (TypeVect*)(new TypeVectX(elem_bt, length))->hashcons(); 2665 case Op_VecY: 2666 return (TypeVect*)(new TypeVectY(elem_bt, length))->hashcons(); 2667 case Op_VecZ: 2668 return (TypeVect*)(new TypeVectZ(elem_bt, length))->hashcons(); 2669 } 2670 ShouldNotReachHere(); 2671 return nullptr; 2672 } 2673 2674 // Create a vector mask type with the given element basic type and length. 2675 // - Returns "TypePVectMask" (PVectMask) for platforms that support the predicate 2676 // feature and it is implemented properly in the backend, allowing the mask to 2677 // be stored in a predicate/mask register. 2678 // - Returns a normal vector type "TypeVectA ~ TypeVectZ" (NVectMask) otherwise, 2679 // where the vector mask is stored in a vector register. 2680 const TypeVect* TypeVect::makemask(BasicType elem_bt, uint length) { 2681 if (Matcher::has_predicated_vectors() && 2682 Matcher::match_rule_supported_vector_masked(Op_VectorLoadMask, length, elem_bt)) { 2683 return TypePVectMask::make(elem_bt, length); 2684 } else { 2685 return make(elem_bt, length); 2686 } 2687 } 2688 2689 //------------------------------meet------------------------------------------- 2690 // Compute the MEET of two types. Since each TypeVect is the only instance of 2691 // its species, meeting often returns itself 2692 const Type* TypeVect::xmeet(const Type* t) const { 2693 // Perform a fast test for common case; meeting the same types together. 2694 if (this == t) { 2695 return this; 2696 } 2697 2698 // Current "this->_base" is Vector 2699 switch (t->base()) { // switch on original type 2700 2701 case Bottom: // Ye Olde Default 2702 return t; 2703 2704 default: // All else is a mistake 2705 typerr(t); 2706 case VectorMask: 2707 case VectorA: 2708 case VectorS: 2709 case VectorD: 2710 case VectorX: 2711 case VectorY: 2712 case VectorZ: { // Meeting 2 vectors? 2713 const TypeVect* v = t->is_vect(); 2714 assert(base() == v->base(), ""); 2715 assert(length() == v->length(), ""); 2716 assert(element_basic_type() == v->element_basic_type(), ""); 2717 return this; 2718 } 2719 case Top: 2720 break; 2721 } 2722 return this; 2723 } 2724 2725 //------------------------------xdual------------------------------------------ 2726 // Since each TypeVect is the only instance of its species, it is self-dual 2727 const Type* TypeVect::xdual() const { 2728 return this; 2729 } 2730 2731 //------------------------------eq--------------------------------------------- 2732 // Structural equality check for Type representations 2733 bool TypeVect::eq(const Type* t) const { 2734 const TypeVect* v = t->is_vect(); 2735 return (element_basic_type() == v->element_basic_type()) && (length() == v->length()); 2736 } 2737 2738 //------------------------------hash------------------------------------------- 2739 // Type-specific hashing function. 2740 uint TypeVect::hash(void) const { 2741 return (uint)base() + (uint)(uintptr_t)_elem_bt + (uint)(uintptr_t)_length; 2742 } 2743 2744 //------------------------------singleton-------------------------------------- 2745 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 2746 // constants (Ldi nodes). Vector is singleton if all elements are the same 2747 // constant value (when vector is created with Replicate code). 2748 bool TypeVect::singleton(void) const { 2749 // There is no Con node for vectors yet. 2750 // return _elem->singleton(); 2751 return false; 2752 } 2753 2754 bool TypeVect::empty(void) const { 2755 return false; 2756 } 2757 2758 //------------------------------dump2------------------------------------------ 2759 #ifndef PRODUCT 2760 void TypeVect::dump2(Dict& d, uint depth, outputStream* st) const { 2761 switch (base()) { 2762 case VectorA: 2763 st->print("vectora"); break; 2764 case VectorS: 2765 st->print("vectors"); break; 2766 case VectorD: 2767 st->print("vectord"); break; 2768 case VectorX: 2769 st->print("vectorx"); break; 2770 case VectorY: 2771 st->print("vectory"); break; 2772 case VectorZ: 2773 st->print("vectorz"); break; 2774 case VectorMask: 2775 st->print("vectormask"); break; 2776 default: 2777 ShouldNotReachHere(); 2778 } 2779 st->print("<%c,%u>", type2char(element_basic_type()), length()); 2780 } 2781 #endif 2782 2783 const TypePVectMask* TypePVectMask::make(const BasicType elem_bt, uint length) { 2784 return (TypePVectMask*) (new TypePVectMask(elem_bt, length))->hashcons(); 2785 } 2786 2787 //============================================================================= 2788 // Convenience common pre-built types. 2789 const TypePtr *TypePtr::NULL_PTR; 2790 const TypePtr *TypePtr::NOTNULL; 2791 const TypePtr *TypePtr::BOTTOM; 2792 2793 //------------------------------meet------------------------------------------- 2794 // Meet over the PTR enum 2795 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = { 2796 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, 2797 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,}, 2798 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,}, 2799 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,}, 2800 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,}, 2801 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,}, 2802 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,} 2803 }; 2804 2805 //------------------------------make------------------------------------------- 2806 const TypePtr* TypePtr::make(TYPES t, enum PTR ptr, Offset offset, const TypePtr* speculative, int inline_depth) { 2807 return (TypePtr*)(new TypePtr(t,ptr,offset, speculative, inline_depth))->hashcons(); 2808 } 2809 2810 //------------------------------cast_to_ptr_type------------------------------- 2811 const TypePtr* TypePtr::cast_to_ptr_type(PTR ptr) const { 2812 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type"); 2813 if( ptr == _ptr ) return this; 2814 return make(_base, ptr, _offset, _speculative, _inline_depth); 2815 } 2816 2817 //------------------------------get_con---------------------------------------- 2818 intptr_t TypePtr::get_con() const { 2819 assert( _ptr == Null, "" ); 2820 return offset(); 2821 } 2822 2823 //------------------------------meet------------------------------------------- 2824 // Compute the MEET of two types. It returns a new Type object. 2825 const Type *TypePtr::xmeet(const Type *t) const { 2826 const Type* res = xmeet_helper(t); 2827 if (res->isa_ptr() == nullptr) { 2828 return res; 2829 } 2830 2831 const TypePtr* res_ptr = res->is_ptr(); 2832 if (res_ptr->speculative() != nullptr) { 2833 // type->speculative() is null means that speculation is no better 2834 // than type, i.e. type->speculative() == type. So there are 2 2835 // ways to represent the fact that we have no useful speculative 2836 // data and we should use a single one to be able to test for 2837 // equality between types. Check whether type->speculative() == 2838 // type and set speculative to null if it is the case. 2839 if (res_ptr->remove_speculative() == res_ptr->speculative()) { 2840 return res_ptr->remove_speculative(); 2841 } 2842 } 2843 2844 return res; 2845 } 2846 2847 const Type *TypePtr::xmeet_helper(const Type *t) const { 2848 // Perform a fast test for common case; meeting the same types together. 2849 if( this == t ) return this; // Meeting same type-rep? 2850 2851 // Current "this->_base" is AnyPtr 2852 switch (t->base()) { // switch on original type 2853 case Int: // Mixing ints & oops happens when javac 2854 case Long: // reuses local variables 2855 case HalfFloatTop: 2856 case HalfFloatCon: 2857 case HalfFloatBot: 2858 case FloatTop: 2859 case FloatCon: 2860 case FloatBot: 2861 case DoubleTop: 2862 case DoubleCon: 2863 case DoubleBot: 2864 case NarrowOop: 2865 case NarrowKlass: 2866 case Bottom: // Ye Olde Default 2867 return Type::BOTTOM; 2868 case Top: 2869 return this; 2870 2871 case AnyPtr: { // Meeting to AnyPtrs 2872 const TypePtr *tp = t->is_ptr(); 2873 const TypePtr* speculative = xmeet_speculative(tp); 2874 int depth = meet_inline_depth(tp->inline_depth()); 2875 return make(AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()), speculative, depth); 2876 } 2877 case RawPtr: // For these, flip the call around to cut down 2878 case OopPtr: 2879 case InstPtr: // on the cases I have to handle. 2880 case AryPtr: 2881 case MetadataPtr: 2882 case KlassPtr: 2883 case InstKlassPtr: 2884 case AryKlassPtr: 2885 return t->xmeet(this); // Call in reverse direction 2886 default: // All else is a mistake 2887 typerr(t); 2888 2889 } 2890 return this; 2891 } 2892 2893 //------------------------------meet_offset------------------------------------ 2894 Type::Offset TypePtr::meet_offset(int offset) const { 2895 return _offset.meet(Offset(offset)); 2896 } 2897 2898 //------------------------------dual_offset------------------------------------ 2899 Type::Offset TypePtr::dual_offset() const { 2900 return _offset.dual(); 2901 } 2902 2903 //------------------------------xdual------------------------------------------ 2904 // Dual: compute field-by-field dual 2905 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = { 2906 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR 2907 }; 2908 2909 const TypePtr::FlatInArray TypePtr::flat_in_array_dual[Uninitialized] = { 2910 /* TopFlat -> */ MaybeFlat, 2911 /* Flat -> */ NotFlat, 2912 /* NotFlat -> */ Flat, 2913 /* MaybeFlat -> */ TopFlat 2914 }; 2915 2916 const char* const TypePtr::flat_in_array_msg[Uninitialized] = { 2917 "TOP flat in array", "flat in array", "not flat in array", "maybe flat in array" 2918 }; 2919 2920 const Type *TypePtr::xdual() const { 2921 return new TypePtr(AnyPtr, dual_ptr(), dual_offset(), dual_speculative(), dual_inline_depth()); 2922 } 2923 2924 //------------------------------xadd_offset------------------------------------ 2925 Type::Offset TypePtr::xadd_offset(intptr_t offset) const { 2926 return _offset.add(offset); 2927 } 2928 2929 //------------------------------add_offset------------------------------------- 2930 const TypePtr *TypePtr::add_offset( intptr_t offset ) const { 2931 return make(AnyPtr, _ptr, xadd_offset(offset), _speculative, _inline_depth); 2932 } 2933 2934 const TypePtr *TypePtr::with_offset(intptr_t offset) const { 2935 return make(AnyPtr, _ptr, Offset(offset), _speculative, _inline_depth); 2936 } 2937 2938 //------------------------------eq--------------------------------------------- 2939 // Structural equality check for Type representations 2940 bool TypePtr::eq( const Type *t ) const { 2941 const TypePtr *a = (const TypePtr*)t; 2942 return _ptr == a->ptr() && _offset == a->_offset && eq_speculative(a) && _inline_depth == a->_inline_depth; 2943 } 2944 2945 //------------------------------hash------------------------------------------- 2946 // Type-specific hashing function. 2947 uint TypePtr::hash(void) const { 2948 return (uint)_ptr + (uint)offset() + (uint)hash_speculative() + (uint)_inline_depth; 2949 } 2950 2951 /** 2952 * Return same type without a speculative part 2953 */ 2954 const TypePtr* TypePtr::remove_speculative() const { 2955 if (_speculative == nullptr) { 2956 return this; 2957 } 2958 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 2959 return make(AnyPtr, _ptr, _offset, nullptr, _inline_depth); 2960 } 2961 2962 /** 2963 * Return same type but drop speculative part if we know we won't use 2964 * it 2965 */ 2966 const Type* TypePtr::cleanup_speculative() const { 2967 if (speculative() == nullptr) { 2968 return this; 2969 } 2970 const Type* no_spec = remove_speculative(); 2971 // If this is NULL_PTR then we don't need the speculative type 2972 // (with_inline_depth in case the current type inline depth is 2973 // InlineDepthTop) 2974 if (no_spec == NULL_PTR->with_inline_depth(inline_depth())) { 2975 return no_spec; 2976 } 2977 if (above_centerline(speculative()->ptr())) { 2978 return no_spec; 2979 } 2980 const TypeOopPtr* spec_oopptr = speculative()->isa_oopptr(); 2981 // If the speculative may be null and is an inexact klass then it 2982 // doesn't help 2983 if (speculative() != TypePtr::NULL_PTR && speculative()->maybe_null() && 2984 (spec_oopptr == nullptr || !spec_oopptr->klass_is_exact())) { 2985 return no_spec; 2986 } 2987 return this; 2988 } 2989 2990 /** 2991 * dual of the speculative part of the type 2992 */ 2993 const TypePtr* TypePtr::dual_speculative() const { 2994 if (_speculative == nullptr) { 2995 return nullptr; 2996 } 2997 return _speculative->dual()->is_ptr(); 2998 } 2999 3000 /** 3001 * meet of the speculative parts of 2 types 3002 * 3003 * @param other type to meet with 3004 */ 3005 const TypePtr* TypePtr::xmeet_speculative(const TypePtr* other) const { 3006 bool this_has_spec = (_speculative != nullptr); 3007 bool other_has_spec = (other->speculative() != nullptr); 3008 3009 if (!this_has_spec && !other_has_spec) { 3010 return nullptr; 3011 } 3012 3013 // If we are at a point where control flow meets and one branch has 3014 // a speculative type and the other has not, we meet the speculative 3015 // type of one branch with the actual type of the other. If the 3016 // actual type is exact and the speculative is as well, then the 3017 // result is a speculative type which is exact and we can continue 3018 // speculation further. 3019 const TypePtr* this_spec = _speculative; 3020 const TypePtr* other_spec = other->speculative(); 3021 3022 if (!this_has_spec) { 3023 this_spec = this; 3024 } 3025 3026 if (!other_has_spec) { 3027 other_spec = other; 3028 } 3029 3030 return this_spec->meet(other_spec)->is_ptr(); 3031 } 3032 3033 /** 3034 * dual of the inline depth for this type (used for speculation) 3035 */ 3036 int TypePtr::dual_inline_depth() const { 3037 return -inline_depth(); 3038 } 3039 3040 /** 3041 * meet of 2 inline depths (used for speculation) 3042 * 3043 * @param depth depth to meet with 3044 */ 3045 int TypePtr::meet_inline_depth(int depth) const { 3046 return MAX2(inline_depth(), depth); 3047 } 3048 3049 /** 3050 * Are the speculative parts of 2 types equal? 3051 * 3052 * @param other type to compare this one to 3053 */ 3054 bool TypePtr::eq_speculative(const TypePtr* other) const { 3055 if (_speculative == nullptr || other->speculative() == nullptr) { 3056 return _speculative == other->speculative(); 3057 } 3058 3059 if (_speculative->base() != other->speculative()->base()) { 3060 return false; 3061 } 3062 3063 return _speculative->eq(other->speculative()); 3064 } 3065 3066 /** 3067 * Hash of the speculative part of the type 3068 */ 3069 int TypePtr::hash_speculative() const { 3070 if (_speculative == nullptr) { 3071 return 0; 3072 } 3073 3074 return _speculative->hash(); 3075 } 3076 3077 /** 3078 * add offset to the speculative part of the type 3079 * 3080 * @param offset offset to add 3081 */ 3082 const TypePtr* TypePtr::add_offset_speculative(intptr_t offset) const { 3083 if (_speculative == nullptr) { 3084 return nullptr; 3085 } 3086 return _speculative->add_offset(offset)->is_ptr(); 3087 } 3088 3089 const TypePtr* TypePtr::with_offset_speculative(intptr_t offset) const { 3090 if (_speculative == nullptr) { 3091 return nullptr; 3092 } 3093 return _speculative->with_offset(offset)->is_ptr(); 3094 } 3095 3096 /** 3097 * return exact klass from the speculative type if there's one 3098 */ 3099 ciKlass* TypePtr::speculative_type() const { 3100 if (_speculative != nullptr && _speculative->isa_oopptr()) { 3101 const TypeOopPtr* speculative = _speculative->join(this)->is_oopptr(); 3102 if (speculative->klass_is_exact()) { 3103 return speculative->exact_klass(); 3104 } 3105 } 3106 return nullptr; 3107 } 3108 3109 /** 3110 * return true if speculative type may be null 3111 */ 3112 bool TypePtr::speculative_maybe_null() const { 3113 if (_speculative != nullptr) { 3114 const TypePtr* speculative = _speculative->join(this)->is_ptr(); 3115 return speculative->maybe_null(); 3116 } 3117 return true; 3118 } 3119 3120 bool TypePtr::speculative_always_null() const { 3121 if (_speculative != nullptr) { 3122 const TypePtr* speculative = _speculative->join(this)->is_ptr(); 3123 return speculative == TypePtr::NULL_PTR; 3124 } 3125 return false; 3126 } 3127 3128 /** 3129 * Same as TypePtr::speculative_type() but return the klass only if 3130 * the speculative tells us is not null 3131 */ 3132 ciKlass* TypePtr::speculative_type_not_null() const { 3133 if (speculative_maybe_null()) { 3134 return nullptr; 3135 } 3136 return speculative_type(); 3137 } 3138 3139 /** 3140 * Check whether new profiling would improve speculative type 3141 * 3142 * @param exact_kls class from profiling 3143 * @param inline_depth inlining depth of profile point 3144 * 3145 * @return true if type profile is valuable 3146 */ 3147 bool TypePtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { 3148 // no profiling? 3149 if (exact_kls == nullptr) { 3150 return false; 3151 } 3152 if (speculative() == TypePtr::NULL_PTR) { 3153 return false; 3154 } 3155 // no speculative type or non exact speculative type? 3156 if (speculative_type() == nullptr) { 3157 return true; 3158 } 3159 // If the node already has an exact speculative type keep it, 3160 // unless it was provided by profiling that is at a deeper 3161 // inlining level. Profiling at a higher inlining depth is 3162 // expected to be less accurate. 3163 if (_speculative->inline_depth() == InlineDepthBottom) { 3164 return false; 3165 } 3166 assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison"); 3167 return inline_depth < _speculative->inline_depth(); 3168 } 3169 3170 /** 3171 * Check whether new profiling would improve ptr (= tells us it is non 3172 * null) 3173 * 3174 * @param ptr_kind always null or not null? 3175 * 3176 * @return true if ptr profile is valuable 3177 */ 3178 bool TypePtr::would_improve_ptr(ProfilePtrKind ptr_kind) const { 3179 // profiling doesn't tell us anything useful 3180 if (ptr_kind != ProfileAlwaysNull && ptr_kind != ProfileNeverNull) { 3181 return false; 3182 } 3183 // We already know this is not null 3184 if (!this->maybe_null()) { 3185 return false; 3186 } 3187 // We already know the speculative type cannot be null 3188 if (!speculative_maybe_null()) { 3189 return false; 3190 } 3191 // We already know this is always null 3192 if (this == TypePtr::NULL_PTR) { 3193 return false; 3194 } 3195 // We already know the speculative type is always null 3196 if (speculative_always_null()) { 3197 return false; 3198 } 3199 if (ptr_kind == ProfileAlwaysNull && speculative() != nullptr && speculative()->isa_oopptr()) { 3200 return false; 3201 } 3202 return true; 3203 } 3204 3205 TypePtr::FlatInArray TypePtr::compute_flat_in_array(ciInstanceKlass* instance_klass, bool is_exact) { 3206 if (!instance_klass->can_be_inline_klass(is_exact)) { 3207 // Definitely not a value class and thus never flat in an array. 3208 return NotFlat; 3209 } 3210 if (instance_klass->is_inlinetype() && instance_klass->as_inline_klass()->is_always_flat_in_array()) { 3211 return Flat; 3212 } 3213 // We don't know. 3214 return MaybeFlat; 3215 } 3216 3217 // Compute flat in array property if we don't know anything about it (i.e. old_flat_in_array == MaybeFlat). 3218 TypePtr::FlatInArray TypePtr::compute_flat_in_array_if_unknown(ciInstanceKlass* instance_klass, bool is_exact, 3219 FlatInArray old_flat_in_array) { 3220 // It is tempting to add verification code that "NotFlat == no value class" and "Flat == value class". 3221 // However, with type speculation, we could get contradicting flat in array properties that propagate through the 3222 // graph. We could try to stop the introduction of contradicting speculative types in terms of their flat in array 3223 // property. But this is hard because it is sometimes only recognized further down in the graph. Thus, we let an 3224 // inconsistent flat in array property propagating through the graph. This could lead to fold an actual live path 3225 // away. But in this case, the speculated type is wrong and we would trap earlier. 3226 if (old_flat_in_array == MaybeFlat) { 3227 return compute_flat_in_array(instance_klass, is_exact); 3228 } 3229 return old_flat_in_array; 3230 } 3231 3232 //------------------------------dump2------------------------------------------ 3233 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = { 3234 "TopPTR","AnyNull","Constant","null","NotNull","BotPTR" 3235 }; 3236 3237 #ifndef PRODUCT 3238 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const { 3239 st->print("ptr:%s", ptr_msg[_ptr]); 3240 dump_offset(st); 3241 dump_inline_depth(st); 3242 dump_speculative(st); 3243 } 3244 3245 void TypePtr::dump_offset(outputStream* st) const { 3246 _offset.dump2(st); 3247 } 3248 3249 /** 3250 *dump the speculative part of the type 3251 */ 3252 void TypePtr::dump_speculative(outputStream *st) const { 3253 if (_speculative != nullptr) { 3254 st->print(" (speculative="); 3255 _speculative->dump_on(st); 3256 st->print(")"); 3257 } 3258 } 3259 3260 /** 3261 *dump the inline depth of the type 3262 */ 3263 void TypePtr::dump_inline_depth(outputStream *st) const { 3264 if (_inline_depth != InlineDepthBottom) { 3265 if (_inline_depth == InlineDepthTop) { 3266 st->print(" (inline_depth=InlineDepthTop)"); 3267 } else { 3268 st->print(" (inline_depth=%d)", _inline_depth); 3269 } 3270 } 3271 } 3272 3273 void TypePtr::dump_flat_in_array(FlatInArray flat_in_array, outputStream* st) { 3274 switch (flat_in_array) { 3275 case MaybeFlat: 3276 case NotFlat: 3277 if (!Verbose) { 3278 break; 3279 } 3280 case TopFlat: 3281 case Flat: 3282 st->print(" (%s)", flat_in_array_msg[flat_in_array]); 3283 break; 3284 default: 3285 ShouldNotReachHere(); 3286 } 3287 } 3288 #endif 3289 3290 //------------------------------singleton-------------------------------------- 3291 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 3292 // constants 3293 bool TypePtr::singleton(void) const { 3294 // TopPTR, Null, AnyNull, Constant are all singletons 3295 return (_offset != Offset::bottom) && !below_centerline(_ptr); 3296 } 3297 3298 bool TypePtr::empty(void) const { 3299 return (_offset == Offset::top) || above_centerline(_ptr); 3300 } 3301 3302 //============================================================================= 3303 // Convenience common pre-built types. 3304 const TypeRawPtr *TypeRawPtr::BOTTOM; 3305 const TypeRawPtr *TypeRawPtr::NOTNULL; 3306 3307 //------------------------------make------------------------------------------- 3308 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) { 3309 assert( ptr != Constant, "what is the constant?" ); 3310 assert( ptr != Null, "Use TypePtr for null" ); 3311 return (TypeRawPtr*)(new TypeRawPtr(ptr,nullptr))->hashcons(); 3312 } 3313 3314 const TypeRawPtr *TypeRawPtr::make(address bits) { 3315 assert(bits != nullptr, "Use TypePtr for null"); 3316 return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons(); 3317 } 3318 3319 //------------------------------cast_to_ptr_type------------------------------- 3320 const TypeRawPtr* TypeRawPtr::cast_to_ptr_type(PTR ptr) const { 3321 assert( ptr != Constant, "what is the constant?" ); 3322 assert( ptr != Null, "Use TypePtr for null" ); 3323 assert( _bits == nullptr, "Why cast a constant address?"); 3324 if( ptr == _ptr ) return this; 3325 return make(ptr); 3326 } 3327 3328 //------------------------------get_con---------------------------------------- 3329 intptr_t TypeRawPtr::get_con() const { 3330 assert( _ptr == Null || _ptr == Constant, "" ); 3331 return (intptr_t)_bits; 3332 } 3333 3334 //------------------------------meet------------------------------------------- 3335 // Compute the MEET of two types. It returns a new Type object. 3336 const Type *TypeRawPtr::xmeet( const Type *t ) const { 3337 // Perform a fast test for common case; meeting the same types together. 3338 if( this == t ) return this; // Meeting same type-rep? 3339 3340 // Current "this->_base" is RawPtr 3341 switch( t->base() ) { // switch on original type 3342 case Bottom: // Ye Olde Default 3343 return t; 3344 case Top: 3345 return this; 3346 case AnyPtr: // Meeting to AnyPtrs 3347 break; 3348 case RawPtr: { // might be top, bot, any/not or constant 3349 enum PTR tptr = t->is_ptr()->ptr(); 3350 enum PTR ptr = meet_ptr( tptr ); 3351 if( ptr == Constant ) { // Cannot be equal constants, so... 3352 if( tptr == Constant && _ptr != Constant) return t; 3353 if( _ptr == Constant && tptr != Constant) return this; 3354 ptr = NotNull; // Fall down in lattice 3355 } 3356 return make( ptr ); 3357 } 3358 3359 case OopPtr: 3360 case InstPtr: 3361 case AryPtr: 3362 case MetadataPtr: 3363 case KlassPtr: 3364 case InstKlassPtr: 3365 case AryKlassPtr: 3366 return TypePtr::BOTTOM; // Oop meet raw is not well defined 3367 default: // All else is a mistake 3368 typerr(t); 3369 } 3370 3371 // Found an AnyPtr type vs self-RawPtr type 3372 const TypePtr *tp = t->is_ptr(); 3373 switch (tp->ptr()) { 3374 case TypePtr::TopPTR: return this; 3375 case TypePtr::BotPTR: return t; 3376 case TypePtr::Null: 3377 if( _ptr == TypePtr::TopPTR ) return t; 3378 return TypeRawPtr::BOTTOM; 3379 case TypePtr::NotNull: return TypePtr::make(AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0), tp->speculative(), tp->inline_depth()); 3380 case TypePtr::AnyNull: 3381 if( _ptr == TypePtr::Constant) return this; 3382 return make( meet_ptr(TypePtr::AnyNull) ); 3383 default: ShouldNotReachHere(); 3384 } 3385 return this; 3386 } 3387 3388 //------------------------------xdual------------------------------------------ 3389 // Dual: compute field-by-field dual 3390 const Type *TypeRawPtr::xdual() const { 3391 return new TypeRawPtr( dual_ptr(), _bits ); 3392 } 3393 3394 //------------------------------add_offset------------------------------------- 3395 const TypePtr* TypeRawPtr::add_offset(intptr_t offset) const { 3396 if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer 3397 if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer 3398 if( offset == 0 ) return this; // No change 3399 switch (_ptr) { 3400 case TypePtr::TopPTR: 3401 case TypePtr::BotPTR: 3402 case TypePtr::NotNull: 3403 return this; 3404 case TypePtr::Constant: { 3405 uintptr_t bits = (uintptr_t)_bits; 3406 uintptr_t sum = bits + offset; 3407 if (( offset < 0 ) 3408 ? ( sum > bits ) // Underflow? 3409 : ( sum < bits )) { // Overflow? 3410 return BOTTOM; 3411 } else if ( sum == 0 ) { 3412 return TypePtr::NULL_PTR; 3413 } else { 3414 return make( (address)sum ); 3415 } 3416 } 3417 default: ShouldNotReachHere(); 3418 } 3419 } 3420 3421 //------------------------------eq--------------------------------------------- 3422 // Structural equality check for Type representations 3423 bool TypeRawPtr::eq( const Type *t ) const { 3424 const TypeRawPtr *a = (const TypeRawPtr*)t; 3425 return _bits == a->_bits && TypePtr::eq(t); 3426 } 3427 3428 //------------------------------hash------------------------------------------- 3429 // Type-specific hashing function. 3430 uint TypeRawPtr::hash(void) const { 3431 return (uint)(uintptr_t)_bits + (uint)TypePtr::hash(); 3432 } 3433 3434 //------------------------------dump2------------------------------------------ 3435 #ifndef PRODUCT 3436 void TypeRawPtr::dump2(Dict& d, uint depth, outputStream* st) const { 3437 if (_ptr == Constant) { 3438 st->print("rawptr:Constant:" INTPTR_FORMAT, p2i(_bits)); 3439 } else { 3440 st->print("rawptr:%s", ptr_msg[_ptr]); 3441 } 3442 } 3443 #endif 3444 3445 //============================================================================= 3446 // Convenience common pre-built type. 3447 const TypeOopPtr *TypeOopPtr::BOTTOM; 3448 3449 TypeInterfaces::TypeInterfaces(ciInstanceKlass** interfaces_base, int nb_interfaces) 3450 : Type(Interfaces), _interfaces(interfaces_base, nb_interfaces), 3451 _hash(0), _exact_klass(nullptr) { 3452 _interfaces.sort(compare); 3453 initialize(); 3454 } 3455 3456 const TypeInterfaces* TypeInterfaces::make(GrowableArray<ciInstanceKlass*>* interfaces) { 3457 // hashcons() can only delete the last thing that was allocated: to 3458 // make sure all memory for the newly created TypeInterfaces can be 3459 // freed if an identical one exists, allocate space for the array of 3460 // interfaces right after the TypeInterfaces object so that they 3461 // form a contiguous piece of memory. 3462 int nb_interfaces = interfaces == nullptr ? 0 : interfaces->length(); 3463 size_t total_size = sizeof(TypeInterfaces) + nb_interfaces * sizeof(ciInstanceKlass*); 3464 3465 void* allocated_mem = operator new(total_size); 3466 ciInstanceKlass** interfaces_base = (ciInstanceKlass**)((char*)allocated_mem + sizeof(TypeInterfaces)); 3467 for (int i = 0; i < nb_interfaces; ++i) { 3468 interfaces_base[i] = interfaces->at(i); 3469 } 3470 TypeInterfaces* result = ::new (allocated_mem) TypeInterfaces(interfaces_base, nb_interfaces); 3471 return (const TypeInterfaces*)result->hashcons(); 3472 } 3473 3474 void TypeInterfaces::initialize() { 3475 compute_hash(); 3476 compute_exact_klass(); 3477 DEBUG_ONLY(_initialized = true;) 3478 } 3479 3480 int TypeInterfaces::compare(ciInstanceKlass* const& k1, ciInstanceKlass* const& k2) { 3481 if ((intptr_t)k1 < (intptr_t)k2) { 3482 return -1; 3483 } else if ((intptr_t)k1 > (intptr_t)k2) { 3484 return 1; 3485 } 3486 return 0; 3487 } 3488 3489 int TypeInterfaces::compare(ciInstanceKlass** k1, ciInstanceKlass** k2) { 3490 return compare(*k1, *k2); 3491 } 3492 3493 bool TypeInterfaces::eq(const Type* t) const { 3494 const TypeInterfaces* other = (const TypeInterfaces*)t; 3495 if (_interfaces.length() != other->_interfaces.length()) { 3496 return false; 3497 } 3498 for (int i = 0; i < _interfaces.length(); i++) { 3499 ciKlass* k1 = _interfaces.at(i); 3500 ciKlass* k2 = other->_interfaces.at(i); 3501 if (!k1->equals(k2)) { 3502 return false; 3503 } 3504 } 3505 return true; 3506 } 3507 3508 bool TypeInterfaces::eq(ciInstanceKlass* k) const { 3509 assert(k->is_loaded(), "should be loaded"); 3510 GrowableArray<ciInstanceKlass *>* interfaces = k->transitive_interfaces(); 3511 if (_interfaces.length() != interfaces->length()) { 3512 return false; 3513 } 3514 for (int i = 0; i < interfaces->length(); i++) { 3515 bool found = false; 3516 _interfaces.find_sorted<ciInstanceKlass*, compare>(interfaces->at(i), found); 3517 if (!found) { 3518 return false; 3519 } 3520 } 3521 return true; 3522 } 3523 3524 3525 uint TypeInterfaces::hash() const { 3526 assert(_initialized, "must be"); 3527 return _hash; 3528 } 3529 3530 const Type* TypeInterfaces::xdual() const { 3531 return this; 3532 } 3533 3534 void TypeInterfaces::compute_hash() { 3535 uint hash = 0; 3536 for (int i = 0; i < _interfaces.length(); i++) { 3537 ciKlass* k = _interfaces.at(i); 3538 hash += k->hash(); 3539 } 3540 _hash = hash; 3541 } 3542 3543 static int compare_interfaces(ciInstanceKlass** k1, ciInstanceKlass** k2) { 3544 return (int)((*k1)->ident() - (*k2)->ident()); 3545 } 3546 3547 void TypeInterfaces::dump(outputStream* st) const { 3548 if (_interfaces.length() == 0) { 3549 return; 3550 } 3551 ResourceMark rm; 3552 st->print(" ("); 3553 GrowableArray<ciInstanceKlass*> interfaces; 3554 interfaces.appendAll(&_interfaces); 3555 // Sort the interfaces so they are listed in the same order from one run to the other of the same compilation 3556 interfaces.sort(compare_interfaces); 3557 for (int i = 0; i < interfaces.length(); i++) { 3558 if (i > 0) { 3559 st->print(","); 3560 } 3561 ciKlass* k = interfaces.at(i); 3562 k->print_name_on(st); 3563 } 3564 st->print(")"); 3565 } 3566 3567 #ifdef ASSERT 3568 void TypeInterfaces::verify() const { 3569 for (int i = 1; i < _interfaces.length(); i++) { 3570 ciInstanceKlass* k1 = _interfaces.at(i-1); 3571 ciInstanceKlass* k2 = _interfaces.at(i); 3572 assert(compare(k2, k1) > 0, "should be ordered"); 3573 assert(k1 != k2, "no duplicate"); 3574 } 3575 } 3576 #endif 3577 3578 const TypeInterfaces* TypeInterfaces::union_with(const TypeInterfaces* other) const { 3579 GrowableArray<ciInstanceKlass*> result_list; 3580 int i = 0; 3581 int j = 0; 3582 while (i < _interfaces.length() || j < other->_interfaces.length()) { 3583 while (i < _interfaces.length() && 3584 (j >= other->_interfaces.length() || 3585 compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) { 3586 result_list.push(_interfaces.at(i)); 3587 i++; 3588 } 3589 while (j < other->_interfaces.length() && 3590 (i >= _interfaces.length() || 3591 compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) { 3592 result_list.push(other->_interfaces.at(j)); 3593 j++; 3594 } 3595 if (i < _interfaces.length() && 3596 j < other->_interfaces.length() && 3597 _interfaces.at(i) == other->_interfaces.at(j)) { 3598 result_list.push(_interfaces.at(i)); 3599 i++; 3600 j++; 3601 } 3602 } 3603 const TypeInterfaces* result = TypeInterfaces::make(&result_list); 3604 #ifdef ASSERT 3605 result->verify(); 3606 for (int i = 0; i < _interfaces.length(); i++) { 3607 assert(result->_interfaces.contains(_interfaces.at(i)), "missing"); 3608 } 3609 for (int i = 0; i < other->_interfaces.length(); i++) { 3610 assert(result->_interfaces.contains(other->_interfaces.at(i)), "missing"); 3611 } 3612 for (int i = 0; i < result->_interfaces.length(); i++) { 3613 assert(_interfaces.contains(result->_interfaces.at(i)) || other->_interfaces.contains(result->_interfaces.at(i)), "missing"); 3614 } 3615 #endif 3616 return result; 3617 } 3618 3619 const TypeInterfaces* TypeInterfaces::intersection_with(const TypeInterfaces* other) const { 3620 GrowableArray<ciInstanceKlass*> result_list; 3621 int i = 0; 3622 int j = 0; 3623 while (i < _interfaces.length() || j < other->_interfaces.length()) { 3624 while (i < _interfaces.length() && 3625 (j >= other->_interfaces.length() || 3626 compare(_interfaces.at(i), other->_interfaces.at(j)) < 0)) { 3627 i++; 3628 } 3629 while (j < other->_interfaces.length() && 3630 (i >= _interfaces.length() || 3631 compare(other->_interfaces.at(j), _interfaces.at(i)) < 0)) { 3632 j++; 3633 } 3634 if (i < _interfaces.length() && 3635 j < other->_interfaces.length() && 3636 _interfaces.at(i) == other->_interfaces.at(j)) { 3637 result_list.push(_interfaces.at(i)); 3638 i++; 3639 j++; 3640 } 3641 } 3642 const TypeInterfaces* result = TypeInterfaces::make(&result_list); 3643 #ifdef ASSERT 3644 result->verify(); 3645 for (int i = 0; i < _interfaces.length(); i++) { 3646 assert(!other->_interfaces.contains(_interfaces.at(i)) || result->_interfaces.contains(_interfaces.at(i)), "missing"); 3647 } 3648 for (int i = 0; i < other->_interfaces.length(); i++) { 3649 assert(!_interfaces.contains(other->_interfaces.at(i)) || result->_interfaces.contains(other->_interfaces.at(i)), "missing"); 3650 } 3651 for (int i = 0; i < result->_interfaces.length(); i++) { 3652 assert(_interfaces.contains(result->_interfaces.at(i)) && other->_interfaces.contains(result->_interfaces.at(i)), "missing"); 3653 } 3654 #endif 3655 return result; 3656 } 3657 3658 // Is there a single ciKlass* that can represent the interface set? 3659 ciInstanceKlass* TypeInterfaces::exact_klass() const { 3660 assert(_initialized, "must be"); 3661 return _exact_klass; 3662 } 3663 3664 void TypeInterfaces::compute_exact_klass() { 3665 if (_interfaces.length() == 0) { 3666 _exact_klass = nullptr; 3667 return; 3668 } 3669 ciInstanceKlass* res = nullptr; 3670 for (int i = 0; i < _interfaces.length(); i++) { 3671 ciInstanceKlass* interface = _interfaces.at(i); 3672 if (eq(interface)) { 3673 assert(res == nullptr, ""); 3674 res = interface; 3675 } 3676 } 3677 _exact_klass = res; 3678 } 3679 3680 #ifdef ASSERT 3681 void TypeInterfaces::verify_is_loaded() const { 3682 for (int i = 0; i < _interfaces.length(); i++) { 3683 ciKlass* interface = _interfaces.at(i); 3684 assert(interface->is_loaded(), "Interface not loaded"); 3685 } 3686 } 3687 #endif 3688 3689 // Can't be implemented because there's no way to know if the type is above or below the center line. 3690 const Type* TypeInterfaces::xmeet(const Type* t) const { 3691 ShouldNotReachHere(); 3692 return Type::xmeet(t); 3693 } 3694 3695 bool TypeInterfaces::singleton(void) const { 3696 ShouldNotReachHere(); 3697 return Type::singleton(); 3698 } 3699 3700 bool TypeInterfaces::has_non_array_interface() const { 3701 assert(TypeAryPtr::_array_interfaces != nullptr, "How come Type::Initialize_shared wasn't called yet?"); 3702 3703 return !TypeAryPtr::_array_interfaces->contains(this); 3704 } 3705 3706 //------------------------------TypeOopPtr------------------------------------- 3707 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset offset, Offset field_offset, 3708 int instance_id, const TypePtr* speculative, int inline_depth) 3709 : TypePtr(t, ptr, offset, speculative, inline_depth), 3710 _const_oop(o), _klass(k), 3711 _interfaces(interfaces), 3712 _klass_is_exact(xk), 3713 _is_ptr_to_narrowoop(false), 3714 _is_ptr_to_narrowklass(false), 3715 _is_ptr_to_boxed_value(false), 3716 _is_ptr_to_strict_final_field(false), 3717 _instance_id(instance_id) { 3718 #ifdef ASSERT 3719 if (klass() != nullptr && klass()->is_loaded()) { 3720 interfaces->verify_is_loaded(); 3721 } 3722 #endif 3723 if (Compile::current()->eliminate_boxing() && (t == InstPtr) && 3724 (offset.get() > 0) && xk && (k != nullptr) && k->is_instance_klass()) { 3725 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset.get()); 3726 _is_ptr_to_strict_final_field = _is_ptr_to_boxed_value; 3727 } 3728 3729 if (klass() != nullptr && klass()->is_instance_klass() && klass()->is_loaded() && 3730 this->offset() != Type::OffsetBot && this->offset() != Type::OffsetTop) { 3731 ciField* field = klass()->as_instance_klass()->get_field_by_offset(this->offset(), false); 3732 if (field != nullptr && field->is_strict() && field->is_final()) { 3733 _is_ptr_to_strict_final_field = true; 3734 } 3735 } 3736 3737 #ifdef _LP64 3738 if (this->offset() > 0 || this->offset() == Type::OffsetTop || this->offset() == Type::OffsetBot) { 3739 if (this->offset() == oopDesc::klass_offset_in_bytes()) { 3740 _is_ptr_to_narrowklass = true; 3741 } else if (klass() == nullptr) { 3742 // Array with unknown body type 3743 assert(this->isa_aryptr(), "only arrays without klass"); 3744 _is_ptr_to_narrowoop = UseCompressedOops; 3745 } else if (UseCompressedOops && this->isa_aryptr() && this->offset() != arrayOopDesc::length_offset_in_bytes()) { 3746 if (klass()->is_flat_array_klass() && field_offset != Offset::top && field_offset != Offset::bottom) { 3747 // Check if the field of the inline type array element contains oops 3748 ciInlineKlass* vk = klass()->as_flat_array_klass()->element_klass()->as_inline_klass(); 3749 int foffset = field_offset.get() + vk->payload_offset(); 3750 BasicType field_bt; 3751 ciField* field = vk->get_field_by_offset(foffset, false); 3752 if (field != nullptr) { 3753 field_bt = field->layout_type(); 3754 } else { 3755 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); 3756 field_bt = T_BOOLEAN; 3757 } 3758 _is_ptr_to_narrowoop = ::is_reference_type(field_bt); 3759 } else if (klass()->is_obj_array_klass()) { 3760 _is_ptr_to_narrowoop = true; 3761 } 3762 } else if (klass()->is_instance_klass()) { 3763 if (this->isa_klassptr()) { 3764 // Perm objects don't use compressed references 3765 } else if (_offset == Offset::bottom || _offset == Offset::top) { 3766 // unsafe access 3767 _is_ptr_to_narrowoop = UseCompressedOops; 3768 } else { 3769 assert(this->isa_instptr(), "must be an instance ptr."); 3770 if (klass() == ciEnv::current()->Class_klass() && 3771 (this->offset() == java_lang_Class::klass_offset() || 3772 this->offset() == java_lang_Class::array_klass_offset())) { 3773 // Special hidden fields from the Class. 3774 assert(this->isa_instptr(), "must be an instance ptr."); 3775 _is_ptr_to_narrowoop = false; 3776 } else if (klass() == ciEnv::current()->Class_klass() && 3777 this->offset() >= InstanceMirrorKlass::offset_of_static_fields()) { 3778 // Static fields 3779 BasicType basic_elem_type = T_ILLEGAL; 3780 if (const_oop() != nullptr) { 3781 ciInstanceKlass* k = const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass(); 3782 basic_elem_type = k->get_field_type_by_offset(this->offset(), true); 3783 } 3784 if (basic_elem_type != T_ILLEGAL) { 3785 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type); 3786 } else { 3787 // unsafe access 3788 _is_ptr_to_narrowoop = UseCompressedOops; 3789 } 3790 } else { 3791 // Instance fields which contains a compressed oop references. 3792 ciInstanceKlass* ik = klass()->as_instance_klass(); 3793 BasicType basic_elem_type = ik->get_field_type_by_offset(this->offset(), false); 3794 if (basic_elem_type != T_ILLEGAL) { 3795 _is_ptr_to_narrowoop = UseCompressedOops && ::is_reference_type(basic_elem_type); 3796 } else if (klass()->equals(ciEnv::current()->Object_klass())) { 3797 // Compile::find_alias_type() cast exactness on all types to verify 3798 // that it does not affect alias type. 3799 _is_ptr_to_narrowoop = UseCompressedOops; 3800 } else { 3801 // Type for the copy start in LibraryCallKit::inline_native_clone(). 3802 _is_ptr_to_narrowoop = UseCompressedOops; 3803 } 3804 } 3805 } 3806 } 3807 } 3808 #endif // _LP64 3809 } 3810 3811 //------------------------------make------------------------------------------- 3812 const TypeOopPtr *TypeOopPtr::make(PTR ptr, Offset offset, int instance_id, 3813 const TypePtr* speculative, int inline_depth) { 3814 assert(ptr != Constant, "no constant generic pointers"); 3815 ciKlass* k = Compile::current()->env()->Object_klass(); 3816 bool xk = false; 3817 ciObject* o = nullptr; 3818 const TypeInterfaces* interfaces = TypeInterfaces::make(); 3819 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, interfaces, xk, o, offset, Offset::bottom, instance_id, speculative, inline_depth))->hashcons(); 3820 } 3821 3822 3823 //------------------------------cast_to_ptr_type------------------------------- 3824 const TypeOopPtr* TypeOopPtr::cast_to_ptr_type(PTR ptr) const { 3825 assert(_base == OopPtr, "subclass must override cast_to_ptr_type"); 3826 if( ptr == _ptr ) return this; 3827 return make(ptr, _offset, _instance_id, _speculative, _inline_depth); 3828 } 3829 3830 //-----------------------------cast_to_instance_id---------------------------- 3831 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const { 3832 // There are no instances of a general oop. 3833 // Return self unchanged. 3834 return this; 3835 } 3836 3837 //-----------------------------cast_to_exactness------------------------------- 3838 const TypeOopPtr* TypeOopPtr::cast_to_exactness(bool klass_is_exact) const { 3839 // There is no such thing as an exact general oop. 3840 // Return self unchanged. 3841 return this; 3842 } 3843 3844 //------------------------------as_klass_type---------------------------------- 3845 // Return the klass type corresponding to this instance or array type. 3846 // It is the type that is loaded from an object of this type. 3847 const TypeKlassPtr* TypeOopPtr::as_klass_type(bool try_for_exact) const { 3848 ShouldNotReachHere(); 3849 return nullptr; 3850 } 3851 3852 //------------------------------meet------------------------------------------- 3853 // Compute the MEET of two types. It returns a new Type object. 3854 const Type *TypeOopPtr::xmeet_helper(const Type *t) const { 3855 // Perform a fast test for common case; meeting the same types together. 3856 if( this == t ) return this; // Meeting same type-rep? 3857 3858 // Current "this->_base" is OopPtr 3859 switch (t->base()) { // switch on original type 3860 3861 case Int: // Mixing ints & oops happens when javac 3862 case Long: // reuses local variables 3863 case HalfFloatTop: 3864 case HalfFloatCon: 3865 case HalfFloatBot: 3866 case FloatTop: 3867 case FloatCon: 3868 case FloatBot: 3869 case DoubleTop: 3870 case DoubleCon: 3871 case DoubleBot: 3872 case NarrowOop: 3873 case NarrowKlass: 3874 case Bottom: // Ye Olde Default 3875 return Type::BOTTOM; 3876 case Top: 3877 return this; 3878 3879 default: // All else is a mistake 3880 typerr(t); 3881 3882 case RawPtr: 3883 case MetadataPtr: 3884 case KlassPtr: 3885 case InstKlassPtr: 3886 case AryKlassPtr: 3887 return TypePtr::BOTTOM; // Oop meet raw is not well defined 3888 3889 case AnyPtr: { 3890 // Found an AnyPtr type vs self-OopPtr type 3891 const TypePtr *tp = t->is_ptr(); 3892 Offset offset = meet_offset(tp->offset()); 3893 PTR ptr = meet_ptr(tp->ptr()); 3894 const TypePtr* speculative = xmeet_speculative(tp); 3895 int depth = meet_inline_depth(tp->inline_depth()); 3896 switch (tp->ptr()) { 3897 case Null: 3898 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 3899 // else fall through: 3900 case TopPTR: 3901 case AnyNull: { 3902 int instance_id = meet_instance_id(InstanceTop); 3903 return make(ptr, offset, instance_id, speculative, depth); 3904 } 3905 case BotPTR: 3906 case NotNull: 3907 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 3908 default: typerr(t); 3909 } 3910 } 3911 3912 case OopPtr: { // Meeting to other OopPtrs 3913 const TypeOopPtr *tp = t->is_oopptr(); 3914 int instance_id = meet_instance_id(tp->instance_id()); 3915 const TypePtr* speculative = xmeet_speculative(tp); 3916 int depth = meet_inline_depth(tp->inline_depth()); 3917 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth); 3918 } 3919 3920 case InstPtr: // For these, flip the call around to cut down 3921 case AryPtr: 3922 return t->xmeet(this); // Call in reverse direction 3923 3924 } // End of switch 3925 return this; // Return the double constant 3926 } 3927 3928 3929 //------------------------------xdual------------------------------------------ 3930 // Dual of a pure heap pointer. No relevant klass or oop information. 3931 const Type *TypeOopPtr::xdual() const { 3932 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here"); 3933 assert(const_oop() == nullptr, "no constants here"); 3934 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()); 3935 } 3936 3937 //--------------------------make_from_klass_common----------------------------- 3938 // Computes the element-type given a klass. 3939 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact, InterfaceHandling interface_handling) { 3940 if (klass->is_instance_klass() || klass->is_inlinetype()) { 3941 Compile* C = Compile::current(); 3942 Dependencies* deps = C->dependencies(); 3943 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); 3944 // Element is an instance 3945 bool klass_is_exact = false; 3946 ciInstanceKlass* ik = klass->as_instance_klass(); 3947 if (klass->is_loaded()) { 3948 // Try to set klass_is_exact. 3949 klass_is_exact = ik->is_final(); 3950 if (!klass_is_exact && klass_change 3951 && deps != nullptr && UseUniqueSubclasses) { 3952 ciInstanceKlass* sub = ik->unique_concrete_subklass(); 3953 if (sub != nullptr) { 3954 deps->assert_abstract_with_unique_concrete_subtype(ik, sub); 3955 klass = ik = sub; 3956 klass_is_exact = sub->is_final(); 3957 } 3958 } 3959 if (!klass_is_exact && try_for_exact && deps != nullptr && 3960 !ik->is_interface() && !ik->has_subklass()) { 3961 // Add a dependence; if concrete subclass added we need to recompile 3962 deps->assert_leaf_type(ik); 3963 klass_is_exact = true; 3964 } 3965 } 3966 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact); 3967 const TypeInterfaces* interfaces = TypePtr::interfaces(klass, true, true, false, interface_handling); 3968 return TypeInstPtr::make(TypePtr::BotPTR, klass, interfaces, klass_is_exact, nullptr, Offset(0), flat_in_array); 3969 } else if (klass->is_obj_array_klass()) { 3970 // Element is an object or inline type array. Recursively call ourself. 3971 ciObjArrayKlass* array_klass = klass->as_obj_array_klass(); 3972 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_common(array_klass->element_klass(), /* klass_change= */ false, try_for_exact, interface_handling); 3973 bool xk = array_klass->is_loaded() && array_klass->is_refined(); 3974 3975 // Determine null-free/flat properties 3976 bool flat; 3977 bool not_flat; 3978 bool not_null_free; 3979 bool atomic; 3980 if (xk) { 3981 flat = array_klass->is_flat_array_klass(); 3982 not_flat = !flat; 3983 bool is_null_free = array_klass->is_elem_null_free(); 3984 not_null_free = !is_null_free; 3985 atomic = array_klass->is_elem_atomic(); 3986 3987 if (is_null_free) { 3988 etype = etype->join_speculative(NOTNULL)->is_oopptr(); 3989 } 3990 } else { 3991 const TypeOopPtr* exact_etype = etype; 3992 if (etype->can_be_inline_type()) { 3993 // Use exact type if element can be an inline type 3994 exact_etype = TypeOopPtr::make_from_klass_common(klass->as_array_klass()->element_klass(), /* klass_change= */ true, /* try_for_exact= */ true, interface_handling); 3995 } 3996 3997 flat = false; 3998 bool not_inline = !exact_etype->can_be_inline_type(); 3999 not_null_free = not_inline; 4000 not_flat = !UseArrayFlattening || not_inline || (exact_etype->is_inlinetypeptr() && !exact_etype->inline_klass()->maybe_flat_in_array()); 4001 atomic = not_flat; 4002 } 4003 4004 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS, /* stable= */ false, flat, not_flat, not_null_free, atomic); 4005 // We used to pass NotNull in here, asserting that the sub-arrays 4006 // are all not-null. This is not true in generally, as code can 4007 // slam nullptrs down in the subarrays. 4008 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, nullptr, xk, Offset(0)); 4009 return arr; 4010 } else if (klass->is_type_array_klass()) { 4011 // Element is an typeArray 4012 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type()); 4013 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS, 4014 /* stable= */ false, /* flat= */ false, /* not_flat= */ true, /* not_null_free= */ true, true); 4015 // We used to pass NotNull in here, asserting that the array pointer 4016 // is not-null. That was not true in general. 4017 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, Offset(0)); 4018 return arr; 4019 } else { 4020 ShouldNotReachHere(); 4021 return nullptr; 4022 } 4023 } 4024 4025 //------------------------------make_from_constant----------------------------- 4026 // Make a java pointer from an oop constant 4027 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, bool require_constant) { 4028 assert(!o->is_null_object(), "null object not yet handled here."); 4029 4030 const bool make_constant = require_constant || o->should_be_constant(); 4031 4032 ciKlass* klass = o->klass(); 4033 if (klass->is_instance_klass() || klass->is_inlinetype()) { 4034 // Element is an instance or inline type 4035 if (make_constant) { 4036 return TypeInstPtr::make(o); 4037 } else { 4038 return TypeInstPtr::make(TypePtr::NotNull, klass, true, nullptr, Offset(0)); 4039 } 4040 } else if (klass->is_obj_array_klass()) { 4041 // Element is an object array. Recursively call ourself. 4042 const TypeOopPtr* etype = TypeOopPtr::make_from_klass_raw(klass->as_array_klass()->element_klass(), trust_interfaces); 4043 bool is_flat = o->as_array()->is_flat(); 4044 bool is_null_free = o->as_array()->is_null_free(); 4045 if (is_null_free) { 4046 etype = etype->join_speculative(TypePtr::NOTNULL)->is_oopptr(); 4047 } 4048 bool is_atomic = o->as_array()->is_atomic(); 4049 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ is_flat, 4050 /* not_flat= */ !is_flat, /* not_null_free= */ !is_null_free, /* atomic= */ is_atomic); 4051 // We used to pass NotNull in here, asserting that the sub-arrays 4052 // are all not-null. This is not true in generally, as code can 4053 // slam nulls down in the subarrays. 4054 if (make_constant) { 4055 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0)); 4056 } else { 4057 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0)); 4058 } 4059 } else if (klass->is_type_array_klass()) { 4060 // Element is an typeArray 4061 const Type* etype = (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type()); 4062 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()), /* stable= */ false, /* flat= */ false, 4063 /* not_flat= */ true, /* not_null_free= */ true, true); 4064 // We used to pass NotNull in here, asserting that the array pointer 4065 // is not-null. That was not true in general. 4066 if (make_constant) { 4067 return TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, Offset(0)); 4068 } else { 4069 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, Offset(0)); 4070 } 4071 } 4072 4073 fatal("unhandled object type"); 4074 return nullptr; 4075 } 4076 4077 //------------------------------get_con---------------------------------------- 4078 intptr_t TypeOopPtr::get_con() const { 4079 assert( _ptr == Null || _ptr == Constant, "" ); 4080 assert(offset() >= 0, ""); 4081 4082 if (offset() != 0) { 4083 // After being ported to the compiler interface, the compiler no longer 4084 // directly manipulates the addresses of oops. Rather, it only has a pointer 4085 // to a handle at compile time. This handle is embedded in the generated 4086 // code and dereferenced at the time the nmethod is made. Until that time, 4087 // it is not reasonable to do arithmetic with the addresses of oops (we don't 4088 // have access to the addresses!). This does not seem to currently happen, 4089 // but this assertion here is to help prevent its occurrence. 4090 tty->print_cr("Found oop constant with non-zero offset"); 4091 ShouldNotReachHere(); 4092 } 4093 4094 return (intptr_t)const_oop()->constant_encoding(); 4095 } 4096 4097 4098 //-----------------------------filter------------------------------------------ 4099 // Do not allow interface-vs.-noninterface joins to collapse to top. 4100 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const { 4101 4102 const Type* ft = join_helper(kills, include_speculative); 4103 4104 if (ft->empty()) { 4105 return Type::TOP; // Canonical empty value 4106 } 4107 4108 return ft; 4109 } 4110 4111 //------------------------------eq--------------------------------------------- 4112 // Structural equality check for Type representations 4113 bool TypeOopPtr::eq( const Type *t ) const { 4114 const TypeOopPtr *a = (const TypeOopPtr*)t; 4115 if (_klass_is_exact != a->_klass_is_exact || 4116 _instance_id != a->_instance_id) return false; 4117 ciObject* one = const_oop(); 4118 ciObject* two = a->const_oop(); 4119 if (one == nullptr || two == nullptr) { 4120 return (one == two) && TypePtr::eq(t); 4121 } else { 4122 return one->equals(two) && TypePtr::eq(t); 4123 } 4124 } 4125 4126 //------------------------------hash------------------------------------------- 4127 // Type-specific hashing function. 4128 uint TypeOopPtr::hash(void) const { 4129 return 4130 (uint)(const_oop() ? const_oop()->hash() : 0) + 4131 (uint)_klass_is_exact + 4132 (uint)_instance_id + TypePtr::hash(); 4133 } 4134 4135 //------------------------------dump2------------------------------------------ 4136 #ifndef PRODUCT 4137 void TypeOopPtr::dump2(Dict& d, uint depth, outputStream* st) const { 4138 st->print("oopptr:%s", ptr_msg[_ptr]); 4139 if (_klass_is_exact) { 4140 st->print(":exact"); 4141 } 4142 if (const_oop() != nullptr) { 4143 st->print(":" INTPTR_FORMAT, p2i(const_oop())); 4144 } 4145 dump_offset(st); 4146 dump_instance_id(st); 4147 dump_inline_depth(st); 4148 dump_speculative(st); 4149 } 4150 4151 void TypeOopPtr::dump_instance_id(outputStream* st) const { 4152 if (_instance_id == InstanceTop) { 4153 st->print(",iid=top"); 4154 } else if (_instance_id == InstanceBot) { 4155 st->print(",iid=bot"); 4156 } else { 4157 st->print(",iid=%d", _instance_id); 4158 } 4159 } 4160 #endif 4161 4162 //------------------------------singleton-------------------------------------- 4163 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 4164 // constants 4165 bool TypeOopPtr::singleton(void) const { 4166 // detune optimizer to not generate constant oop + constant offset as a constant! 4167 // TopPTR, Null, AnyNull, Constant are all singletons 4168 return (offset() == 0) && !below_centerline(_ptr); 4169 } 4170 4171 //------------------------------add_offset------------------------------------- 4172 const TypePtr* TypeOopPtr::add_offset(intptr_t offset) const { 4173 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); 4174 } 4175 4176 const TypeOopPtr* TypeOopPtr::with_offset(intptr_t offset) const { 4177 return make(_ptr, Offset(offset), _instance_id, with_offset_speculative(offset), _inline_depth); 4178 } 4179 4180 /** 4181 * Return same type without a speculative part 4182 */ 4183 const TypeOopPtr* TypeOopPtr::remove_speculative() const { 4184 if (_speculative == nullptr) { 4185 return this; 4186 } 4187 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 4188 return make(_ptr, _offset, _instance_id, nullptr, _inline_depth); 4189 } 4190 4191 /** 4192 * Return same type but drop speculative part if we know we won't use 4193 * it 4194 */ 4195 const Type* TypeOopPtr::cleanup_speculative() const { 4196 // If the klass is exact and the ptr is not null then there's 4197 // nothing that the speculative type can help us with 4198 if (klass_is_exact() && !maybe_null()) { 4199 return remove_speculative(); 4200 } 4201 return TypePtr::cleanup_speculative(); 4202 } 4203 4204 /** 4205 * Return same type but with a different inline depth (used for speculation) 4206 * 4207 * @param depth depth to meet with 4208 */ 4209 const TypePtr* TypeOopPtr::with_inline_depth(int depth) const { 4210 if (!UseInlineDepthForSpeculativeTypes) { 4211 return this; 4212 } 4213 return make(_ptr, _offset, _instance_id, _speculative, depth); 4214 } 4215 4216 //------------------------------with_instance_id-------------------------------- 4217 const TypePtr* TypeOopPtr::with_instance_id(int instance_id) const { 4218 assert(_instance_id != -1, "should be known"); 4219 return make(_ptr, _offset, instance_id, _speculative, _inline_depth); 4220 } 4221 4222 //------------------------------meet_instance_id-------------------------------- 4223 int TypeOopPtr::meet_instance_id( int instance_id ) const { 4224 // Either is 'TOP' instance? Return the other instance! 4225 if( _instance_id == InstanceTop ) return instance_id; 4226 if( instance_id == InstanceTop ) return _instance_id; 4227 // If either is different, return 'BOTTOM' instance 4228 if( _instance_id != instance_id ) return InstanceBot; 4229 return _instance_id; 4230 } 4231 4232 //------------------------------dual_instance_id-------------------------------- 4233 int TypeOopPtr::dual_instance_id( ) const { 4234 if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM 4235 if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP 4236 return _instance_id; // Map everything else into self 4237 } 4238 4239 4240 const TypeInterfaces* TypeOopPtr::meet_interfaces(const TypeOopPtr* other) const { 4241 if (above_centerline(_ptr) && above_centerline(other->_ptr)) { 4242 return _interfaces->union_with(other->_interfaces); 4243 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) { 4244 return other->_interfaces; 4245 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) { 4246 return _interfaces; 4247 } 4248 return _interfaces->intersection_with(other->_interfaces); 4249 } 4250 4251 /** 4252 * Check whether new profiling would improve speculative type 4253 * 4254 * @param exact_kls class from profiling 4255 * @param inline_depth inlining depth of profile point 4256 * 4257 * @return true if type profile is valuable 4258 */ 4259 bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { 4260 // no way to improve an already exact type 4261 if (klass_is_exact()) { 4262 return false; 4263 } 4264 return TypePtr::would_improve_type(exact_kls, inline_depth); 4265 } 4266 4267 //============================================================================= 4268 // Convenience common pre-built types. 4269 const TypeInstPtr *TypeInstPtr::NOTNULL; 4270 const TypeInstPtr *TypeInstPtr::BOTTOM; 4271 const TypeInstPtr *TypeInstPtr::MIRROR; 4272 const TypeInstPtr *TypeInstPtr::MARK; 4273 const TypeInstPtr *TypeInstPtr::KLASS; 4274 4275 // Is there a single ciKlass* that can represent that type? 4276 ciKlass* TypeInstPtr::exact_klass_helper() const { 4277 if (_interfaces->empty()) { 4278 return _klass; 4279 } 4280 if (_klass != ciEnv::current()->Object_klass()) { 4281 if (_interfaces->eq(_klass->as_instance_klass())) { 4282 return _klass; 4283 } 4284 return nullptr; 4285 } 4286 return _interfaces->exact_klass(); 4287 } 4288 4289 //------------------------------TypeInstPtr------------------------------------- 4290 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, bool xk, ciObject* o, Offset off, 4291 FlatInArray flat_in_array, int instance_id, const TypePtr* speculative, int inline_depth) 4292 : TypeOopPtr(InstPtr, ptr, k, interfaces, xk, o, off, Offset::bottom, instance_id, speculative, inline_depth), 4293 _flat_in_array(flat_in_array) { 4294 4295 assert(flat_in_array != Uninitialized, "must be set now"); 4296 assert(k == nullptr || !k->is_loaded() || !k->is_interface(), "no interface here"); 4297 assert(k != nullptr && 4298 (k->is_loaded() || o == nullptr), 4299 "cannot have constants with non-loaded klass"); 4300 }; 4301 4302 //------------------------------make------------------------------------------- 4303 const TypeInstPtr *TypeInstPtr::make(PTR ptr, 4304 ciKlass* k, 4305 const TypeInterfaces* interfaces, 4306 bool xk, 4307 ciObject* o, 4308 Offset offset, 4309 FlatInArray flat_in_array, 4310 int instance_id, 4311 const TypePtr* speculative, 4312 int inline_depth) { 4313 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance"); 4314 // Either const_oop() is null or else ptr is Constant 4315 assert( (!o && ptr != Constant) || (o && ptr == Constant), 4316 "constant pointers must have a value supplied" ); 4317 // Ptr is never Null 4318 assert( ptr != Null, "null pointers are not typed" ); 4319 4320 assert(instance_id <= 0 || xk, "instances are always exactly typed"); 4321 ciInstanceKlass* ik = k->as_instance_klass(); 4322 if (ptr == Constant) { 4323 // Note: This case includes meta-object constants, such as methods. 4324 xk = true; 4325 } else if (k->is_loaded()) { 4326 if (!xk && ik->is_final()) xk = true; // no inexact final klass 4327 assert(!ik->is_interface(), "no interface here"); 4328 if (xk && ik->is_interface()) xk = false; // no exact interface 4329 } 4330 4331 if (flat_in_array == Uninitialized) { 4332 flat_in_array = compute_flat_in_array(ik, xk); 4333 } 4334 // Now hash this baby 4335 TypeInstPtr *result = 4336 (TypeInstPtr*)(new TypeInstPtr(ptr, k, interfaces, xk, o, offset, flat_in_array, instance_id, speculative, inline_depth))->hashcons(); 4337 4338 return result; 4339 } 4340 4341 const TypeInterfaces* TypePtr::interfaces(ciKlass*& k, bool klass, bool interface, bool array, InterfaceHandling interface_handling) { 4342 if (k->is_instance_klass()) { 4343 if (k->is_loaded()) { 4344 if (k->is_interface() && interface_handling == ignore_interfaces) { 4345 assert(interface, "no interface expected"); 4346 k = ciEnv::current()->Object_klass(); 4347 const TypeInterfaces* interfaces = TypeInterfaces::make(); 4348 return interfaces; 4349 } 4350 GrowableArray<ciInstanceKlass *>* k_interfaces = k->as_instance_klass()->transitive_interfaces(); 4351 const TypeInterfaces* interfaces = TypeInterfaces::make(k_interfaces); 4352 if (k->is_interface()) { 4353 assert(interface, "no interface expected"); 4354 k = ciEnv::current()->Object_klass(); 4355 } else { 4356 assert(klass, "no instance klass expected"); 4357 } 4358 return interfaces; 4359 } 4360 const TypeInterfaces* interfaces = TypeInterfaces::make(); 4361 return interfaces; 4362 } 4363 assert(array, "no array expected"); 4364 assert(k->is_array_klass(), "Not an array?"); 4365 ciType* e = k->as_array_klass()->base_element_type(); 4366 if (e->is_loaded() && e->is_instance_klass() && e->as_instance_klass()->is_interface()) { 4367 if (interface_handling == ignore_interfaces) { 4368 k = ciObjArrayKlass::make(ciEnv::current()->Object_klass(), k->as_array_klass()->dimension()); 4369 } 4370 } 4371 return TypeAryPtr::_array_interfaces; 4372 } 4373 4374 //------------------------------cast_to_ptr_type------------------------------- 4375 const TypeInstPtr* TypeInstPtr::cast_to_ptr_type(PTR ptr) const { 4376 if( ptr == _ptr ) return this; 4377 // Reconstruct _sig info here since not a problem with later lazy 4378 // construction, _sig will show up on demand. 4379 return make(ptr, klass(), _interfaces, klass_is_exact(), ptr == Constant ? const_oop() : nullptr, _offset, _flat_in_array, _instance_id, _speculative, _inline_depth); 4380 } 4381 4382 4383 //-----------------------------cast_to_exactness------------------------------- 4384 const TypeInstPtr* TypeInstPtr::cast_to_exactness(bool klass_is_exact) const { 4385 if( klass_is_exact == _klass_is_exact ) return this; 4386 if (!_klass->is_loaded()) return this; 4387 ciInstanceKlass* ik = _klass->as_instance_klass(); 4388 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk 4389 assert(!ik->is_interface(), "no interface here"); 4390 FlatInArray flat_in_array = compute_flat_in_array(ik, klass_is_exact); 4391 return make(ptr(), klass(), _interfaces, klass_is_exact, const_oop(), _offset, flat_in_array, _instance_id, _speculative, _inline_depth); 4392 } 4393 4394 //-----------------------------cast_to_instance_id---------------------------- 4395 const TypeInstPtr* TypeInstPtr::cast_to_instance_id(int instance_id) const { 4396 if( instance_id == _instance_id ) return this; 4397 return make(_ptr, klass(), _interfaces, _klass_is_exact, const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth); 4398 } 4399 4400 //------------------------------xmeet_unloaded--------------------------------- 4401 // Compute the MEET of two InstPtrs when at least one is unloaded. 4402 // Assume classes are different since called after check for same name/class-loader 4403 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst, const TypeInterfaces* interfaces) const { 4404 Offset off = meet_offset(tinst->offset()); 4405 PTR ptr = meet_ptr(tinst->ptr()); 4406 int instance_id = meet_instance_id(tinst->instance_id()); 4407 const TypePtr* speculative = xmeet_speculative(tinst); 4408 int depth = meet_inline_depth(tinst->inline_depth()); 4409 4410 const TypeInstPtr *loaded = is_loaded() ? this : tinst; 4411 const TypeInstPtr *unloaded = is_loaded() ? tinst : this; 4412 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) { 4413 // 4414 // Meet unloaded class with java/lang/Object 4415 // 4416 // Meet 4417 // | Unloaded Class 4418 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM | 4419 // =================================================================== 4420 // TOP | ..........................Unloaded......................| 4421 // AnyNull | U-AN |................Unloaded......................| 4422 // Constant | ... O-NN .................................. | O-BOT | 4423 // NotNull | ... O-NN .................................. | O-BOT | 4424 // BOTTOM | ........................Object-BOTTOM ..................| 4425 // 4426 assert(loaded->ptr() != TypePtr::Null, "insanity check"); 4427 // 4428 if (loaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); } 4429 else if (loaded->ptr() == TypePtr::AnyNull) { 4430 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array()); 4431 return make(ptr, unloaded->klass(), interfaces, false, nullptr, off, flat_in_array, instance_id, 4432 speculative, depth); 4433 } 4434 else if (loaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); } 4435 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) { 4436 if (unloaded->ptr() == TypePtr::BotPTR) { return TypeInstPtr::BOTTOM->with_speculative(speculative); } 4437 else { return TypeInstPtr::NOTNULL->with_speculative(speculative); } 4438 } 4439 else if (unloaded->ptr() == TypePtr::TopPTR) { return unloaded->with_speculative(speculative); } 4440 4441 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr()->with_speculative(speculative); 4442 } 4443 4444 // Both are unloaded, not the same class, not Object 4445 // Or meet unloaded with a different loaded class, not java/lang/Object 4446 if (ptr != TypePtr::BotPTR) { 4447 return TypeInstPtr::NOTNULL->with_speculative(speculative); 4448 } 4449 return TypeInstPtr::BOTTOM->with_speculative(speculative); 4450 } 4451 4452 4453 //------------------------------meet------------------------------------------- 4454 // Compute the MEET of two types. It returns a new Type object. 4455 const Type *TypeInstPtr::xmeet_helper(const Type *t) const { 4456 // Perform a fast test for common case; meeting the same types together. 4457 if( this == t ) return this; // Meeting same type-rep? 4458 4459 // Current "this->_base" is Pointer 4460 switch (t->base()) { // switch on original type 4461 4462 case Int: // Mixing ints & oops happens when javac 4463 case Long: // reuses local variables 4464 case HalfFloatTop: 4465 case HalfFloatCon: 4466 case HalfFloatBot: 4467 case FloatTop: 4468 case FloatCon: 4469 case FloatBot: 4470 case DoubleTop: 4471 case DoubleCon: 4472 case DoubleBot: 4473 case NarrowOop: 4474 case NarrowKlass: 4475 case Bottom: // Ye Olde Default 4476 return Type::BOTTOM; 4477 case Top: 4478 return this; 4479 4480 default: // All else is a mistake 4481 typerr(t); 4482 4483 case MetadataPtr: 4484 case KlassPtr: 4485 case InstKlassPtr: 4486 case AryKlassPtr: 4487 case RawPtr: return TypePtr::BOTTOM; 4488 4489 case AryPtr: { // All arrays inherit from Object class 4490 // Call in reverse direction to avoid duplication 4491 return t->is_aryptr()->xmeet_helper(this); 4492 } 4493 4494 case OopPtr: { // Meeting to OopPtrs 4495 // Found a OopPtr type vs self-InstPtr type 4496 const TypeOopPtr *tp = t->is_oopptr(); 4497 Offset offset = meet_offset(tp->offset()); 4498 PTR ptr = meet_ptr(tp->ptr()); 4499 switch (tp->ptr()) { 4500 case TopPTR: 4501 case AnyNull: { 4502 int instance_id = meet_instance_id(InstanceTop); 4503 const TypePtr* speculative = xmeet_speculative(tp); 4504 int depth = meet_inline_depth(tp->inline_depth()); 4505 return make(ptr, klass(), _interfaces, klass_is_exact(), 4506 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth); 4507 } 4508 case NotNull: 4509 case BotPTR: { 4510 int instance_id = meet_instance_id(tp->instance_id()); 4511 const TypePtr* speculative = xmeet_speculative(tp); 4512 int depth = meet_inline_depth(tp->inline_depth()); 4513 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); 4514 } 4515 default: typerr(t); 4516 } 4517 } 4518 4519 case AnyPtr: { // Meeting to AnyPtrs 4520 // Found an AnyPtr type vs self-InstPtr type 4521 const TypePtr *tp = t->is_ptr(); 4522 Offset offset = meet_offset(tp->offset()); 4523 PTR ptr = meet_ptr(tp->ptr()); 4524 int instance_id = meet_instance_id(InstanceTop); 4525 const TypePtr* speculative = xmeet_speculative(tp); 4526 int depth = meet_inline_depth(tp->inline_depth()); 4527 switch (tp->ptr()) { 4528 case Null: 4529 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 4530 // else fall through to AnyNull 4531 case TopPTR: 4532 case AnyNull: { 4533 return make(ptr, klass(), _interfaces, klass_is_exact(), 4534 (ptr == Constant ? const_oop() : nullptr), offset, flat_in_array(), instance_id, speculative, depth); 4535 } 4536 case NotNull: 4537 case BotPTR: 4538 return TypePtr::make(AnyPtr, ptr, offset, speculative,depth); 4539 default: typerr(t); 4540 } 4541 } 4542 4543 /* 4544 A-top } 4545 / | \ } Tops 4546 B-top A-any C-top } 4547 | / | \ | } Any-nulls 4548 B-any | C-any } 4549 | | | 4550 B-con A-con C-con } constants; not comparable across classes 4551 | | | 4552 B-not | C-not } 4553 | \ | / | } not-nulls 4554 B-bot A-not C-bot } 4555 \ | / } Bottoms 4556 A-bot } 4557 */ 4558 4559 case InstPtr: { // Meeting 2 Oops? 4560 // Found an InstPtr sub-type vs self-InstPtr type 4561 const TypeInstPtr *tinst = t->is_instptr(); 4562 Offset off = meet_offset(tinst->offset()); 4563 PTR ptr = meet_ptr(tinst->ptr()); 4564 int instance_id = meet_instance_id(tinst->instance_id()); 4565 const TypePtr* speculative = xmeet_speculative(tinst); 4566 int depth = meet_inline_depth(tinst->inline_depth()); 4567 const TypeInterfaces* interfaces = meet_interfaces(tinst); 4568 4569 ciKlass* tinst_klass = tinst->klass(); 4570 ciKlass* this_klass = klass(); 4571 4572 ciKlass* res_klass = nullptr; 4573 bool res_xk = false; 4574 const Type* res; 4575 MeetResult kind = meet_instptr(ptr, interfaces, this, tinst, res_klass, res_xk); 4576 4577 if (kind == UNLOADED) { 4578 // One of these classes has not been loaded 4579 const TypeInstPtr* unloaded_meet = xmeet_unloaded(tinst, interfaces); 4580 #ifndef PRODUCT 4581 if (PrintOpto && Verbose) { 4582 tty->print("meet of unloaded classes resulted in: "); 4583 unloaded_meet->dump(); 4584 tty->cr(); 4585 tty->print(" this == "); 4586 dump(); 4587 tty->cr(); 4588 tty->print(" tinst == "); 4589 tinst->dump(); 4590 tty->cr(); 4591 } 4592 #endif 4593 res = unloaded_meet; 4594 } else { 4595 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tinst->flat_in_array()); 4596 if (kind == NOT_SUBTYPE && instance_id > 0) { 4597 instance_id = InstanceBot; 4598 } else if (kind == LCA) { 4599 instance_id = InstanceBot; 4600 } 4601 ciObject* o = nullptr; // Assume not constant when done 4602 ciObject* this_oop = const_oop(); 4603 ciObject* tinst_oop = tinst->const_oop(); 4604 if (ptr == Constant) { 4605 if (this_oop != nullptr && tinst_oop != nullptr && 4606 this_oop->equals(tinst_oop)) 4607 o = this_oop; 4608 else if (above_centerline(_ptr)) { 4609 assert(!tinst_klass->is_interface(), ""); 4610 o = tinst_oop; 4611 } else if (above_centerline(tinst->_ptr)) { 4612 assert(!this_klass->is_interface(), ""); 4613 o = this_oop; 4614 } else 4615 ptr = NotNull; 4616 } 4617 res = make(ptr, res_klass, interfaces, res_xk, o, off, flat_in_array, instance_id, speculative, depth); 4618 } 4619 4620 return res; 4621 4622 } // End of case InstPtr 4623 4624 } // End of switch 4625 return this; // Return the double constant 4626 } 4627 4628 template<class T> TypePtr::MeetResult TypePtr::meet_instptr(PTR& ptr, const TypeInterfaces*& interfaces, const T* this_type, const T* other_type, 4629 ciKlass*& res_klass, bool& res_xk) { 4630 ciKlass* this_klass = this_type->klass(); 4631 ciKlass* other_klass = other_type->klass(); 4632 4633 bool this_xk = this_type->klass_is_exact(); 4634 bool other_xk = other_type->klass_is_exact(); 4635 PTR this_ptr = this_type->ptr(); 4636 PTR other_ptr = other_type->ptr(); 4637 const TypeInterfaces* this_interfaces = this_type->interfaces(); 4638 const TypeInterfaces* other_interfaces = other_type->interfaces(); 4639 // Check for easy case; klasses are equal (and perhaps not loaded!) 4640 // If we have constants, then we created oops so classes are loaded 4641 // and we can handle the constants further down. This case handles 4642 // both-not-loaded or both-loaded classes 4643 if (ptr != Constant && this_klass->equals(other_klass) && this_xk == other_xk) { 4644 res_klass = this_klass; 4645 res_xk = this_xk; 4646 return QUICK; 4647 } 4648 4649 // Classes require inspection in the Java klass hierarchy. Must be loaded. 4650 if (!other_klass->is_loaded() || !this_klass->is_loaded()) { 4651 return UNLOADED; 4652 } 4653 4654 // !!! Here's how the symmetry requirement breaks down into invariants: 4655 // If we split one up & one down AND they subtype, take the down man. 4656 // If we split one up & one down AND they do NOT subtype, "fall hard". 4657 // If both are up and they subtype, take the subtype class. 4658 // If both are up and they do NOT subtype, "fall hard". 4659 // If both are down and they subtype, take the supertype class. 4660 // If both are down and they do NOT subtype, "fall hard". 4661 // Constants treated as down. 4662 4663 // Now, reorder the above list; observe that both-down+subtype is also 4664 // "fall hard"; "fall hard" becomes the default case: 4665 // If we split one up & one down AND they subtype, take the down man. 4666 // If both are up and they subtype, take the subtype class. 4667 4668 // If both are down and they subtype, "fall hard". 4669 // If both are down and they do NOT subtype, "fall hard". 4670 // If both are up and they do NOT subtype, "fall hard". 4671 // If we split one up & one down AND they do NOT subtype, "fall hard". 4672 4673 // If a proper subtype is exact, and we return it, we return it exactly. 4674 // If a proper supertype is exact, there can be no subtyping relationship! 4675 // If both types are equal to the subtype, exactness is and-ed below the 4676 // centerline and or-ed above it. (N.B. Constants are always exact.) 4677 4678 const T* subtype = nullptr; 4679 bool subtype_exact = false; 4680 if (this_type->is_same_java_type_as(other_type)) { 4681 // Same klass 4682 subtype = this_type; 4683 subtype_exact = below_centerline(ptr) ? (this_xk && other_xk) : (this_xk || other_xk); 4684 } else if (!other_xk && this_type->is_meet_subtype_of(other_type)) { 4685 subtype = this_type; // Pick subtyping class 4686 subtype_exact = this_xk; 4687 } else if (!this_xk && other_type->is_meet_subtype_of(this_type)) { 4688 subtype = other_type; // Pick subtyping class 4689 subtype_exact = other_xk; 4690 } 4691 4692 if (subtype != nullptr) { 4693 if (above_centerline(ptr)) { 4694 // Both types are empty. 4695 this_type = other_type = subtype; 4696 this_xk = other_xk = subtype_exact; 4697 } else if (above_centerline(this_ptr) && !above_centerline(other_ptr)) { 4698 // this_type is empty while other_type is not. Take other_type. 4699 this_type = other_type; 4700 this_xk = other_xk; 4701 } else if (above_centerline(other_ptr) && !above_centerline(this_ptr)) { 4702 // other_type is empty while this_type is not. Take this_type. 4703 other_type = this_type; // this is down; keep down man 4704 } else { 4705 // this_type and other_type are both non-empty. 4706 this_xk = subtype_exact; // either they are equal, or we'll do an LCA 4707 } 4708 } 4709 4710 // Check for classes now being equal 4711 if (this_type->is_same_java_type_as(other_type)) { 4712 // If the klasses are equal, the constants may still differ. Fall to 4713 // NotNull if they do (neither constant is null; that is a special case 4714 // handled elsewhere). 4715 res_klass = this_type->klass(); 4716 res_xk = this_xk; 4717 return SUBTYPE; 4718 } // Else classes are not equal 4719 4720 // Since klasses are different, we require a LCA in the Java 4721 // class hierarchy - which means we have to fall to at least NotNull. 4722 if (ptr == TopPTR || ptr == AnyNull || ptr == Constant) { 4723 ptr = NotNull; 4724 } 4725 4726 interfaces = this_interfaces->intersection_with(other_interfaces); 4727 4728 // Now we find the LCA of Java classes 4729 ciKlass* k = this_klass->least_common_ancestor(other_klass); 4730 4731 res_klass = k; 4732 res_xk = false; 4733 return LCA; 4734 } 4735 4736 // Top-Flat Flat Not-Flat Maybe-Flat 4737 // ------------------------------------------------------------- 4738 // Top-Flat Top-Flat Flat Not-Flat Maybe-Flat 4739 // Flat Flat Flat Maybe-Flat Maybe-Flat 4740 // Not-Flat Not-Flat Maybe-Flat Not-Flat Maybe-Flat 4741 // Maybe-Flat Maybe-Flat Maybe-Flat Maybe-Flat Maybe-flat 4742 TypePtr::FlatInArray TypePtr::meet_flat_in_array(const FlatInArray left, const FlatInArray right) { 4743 if (left == TopFlat) { 4744 return right; 4745 } 4746 if (right == TopFlat) { 4747 return left; 4748 } 4749 if (left == MaybeFlat || right == MaybeFlat) { 4750 return MaybeFlat; 4751 } 4752 4753 switch (left) { 4754 case Flat: 4755 if (right == Flat) { 4756 return Flat; 4757 } 4758 return MaybeFlat; 4759 case NotFlat: 4760 if (right == NotFlat) { 4761 return NotFlat; 4762 } 4763 return MaybeFlat; 4764 default: 4765 ShouldNotReachHere(); 4766 return Uninitialized; 4767 } 4768 } 4769 4770 //------------------------java_mirror_type-------------------------------------- 4771 ciType* TypeInstPtr::java_mirror_type() const { 4772 // must be a singleton type 4773 if( const_oop() == nullptr ) return nullptr; 4774 4775 // must be of type java.lang.Class 4776 if( klass() != ciEnv::current()->Class_klass() ) return nullptr; 4777 return const_oop()->as_instance()->java_mirror_type(); 4778 } 4779 4780 4781 //------------------------------xdual------------------------------------------ 4782 // Dual: do NOT dual on klasses. This means I do NOT understand the Java 4783 // inheritance mechanism. 4784 const Type* TypeInstPtr::xdual() const { 4785 return new TypeInstPtr(dual_ptr(), klass(), _interfaces, klass_is_exact(), const_oop(), dual_offset(), 4786 dual_flat_in_array(), dual_instance_id(), dual_speculative(), dual_inline_depth()); 4787 } 4788 4789 //------------------------------eq--------------------------------------------- 4790 // Structural equality check for Type representations 4791 bool TypeInstPtr::eq( const Type *t ) const { 4792 const TypeInstPtr *p = t->is_instptr(); 4793 return 4794 klass()->equals(p->klass()) && 4795 _flat_in_array == p->_flat_in_array && 4796 _interfaces->eq(p->_interfaces) && 4797 TypeOopPtr::eq(p); // Check sub-type stuff 4798 } 4799 4800 //------------------------------hash------------------------------------------- 4801 // Type-specific hashing function. 4802 uint TypeInstPtr::hash() const { 4803 return klass()->hash() + TypeOopPtr::hash() + _interfaces->hash() + static_cast<uint>(_flat_in_array); 4804 } 4805 4806 bool TypeInstPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 4807 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 4808 } 4809 4810 4811 bool TypeInstPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const { 4812 return TypePtr::is_same_java_type_as_helper_for_instance(this, other); 4813 } 4814 4815 bool TypeInstPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 4816 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 4817 } 4818 4819 4820 //------------------------------dump2------------------------------------------ 4821 // Dump oop Type 4822 #ifndef PRODUCT 4823 void TypeInstPtr::dump2(Dict &d, uint depth, outputStream* st) const { 4824 // Print the name of the klass. 4825 st->print("instptr:"); 4826 klass()->print_name_on(st); 4827 _interfaces->dump(st); 4828 4829 if (_ptr == Constant && (WizardMode || Verbose)) { 4830 ResourceMark rm; 4831 stringStream ss; 4832 4833 st->print(" "); 4834 const_oop()->print_oop(&ss); 4835 // 'const_oop->print_oop()' may emit newlines('\n') into ss. 4836 // suppress newlines from it so -XX:+Verbose -XX:+PrintIdeal dumps one-liner for each node. 4837 char* buf = ss.as_string(/* c_heap= */false); 4838 StringUtils::replace_no_expand(buf, "\n", ""); 4839 st->print_raw(buf); 4840 } 4841 4842 st->print(":%s", ptr_msg[_ptr]); 4843 if (_klass_is_exact) { 4844 st->print(":exact"); 4845 } 4846 4847 st->print(" *"); 4848 4849 dump_offset(st); 4850 dump_instance_id(st); 4851 dump_inline_depth(st); 4852 dump_speculative(st); 4853 dump_flat_in_array(_flat_in_array, st); 4854 } 4855 #endif 4856 4857 bool TypeInstPtr::empty() const { 4858 if (_flat_in_array == TopFlat) { 4859 return true; 4860 } 4861 return TypeOopPtr::empty(); 4862 } 4863 4864 //------------------------------add_offset------------------------------------- 4865 const TypePtr* TypeInstPtr::add_offset(intptr_t offset) const { 4866 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), xadd_offset(offset), _flat_in_array, 4867 _instance_id, add_offset_speculative(offset), _inline_depth); 4868 } 4869 4870 const TypeInstPtr* TypeInstPtr::with_offset(intptr_t offset) const { 4871 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), Offset(offset), _flat_in_array, 4872 _instance_id, with_offset_speculative(offset), _inline_depth); 4873 } 4874 4875 const TypeInstPtr* TypeInstPtr::remove_speculative() const { 4876 if (_speculative == nullptr) { 4877 return this; 4878 } 4879 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 4880 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, 4881 _instance_id, nullptr, _inline_depth); 4882 } 4883 4884 const TypeInstPtr* TypeInstPtr::with_speculative(const TypePtr* speculative) const { 4885 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, speculative, _inline_depth); 4886 } 4887 4888 const TypePtr* TypeInstPtr::with_inline_depth(int depth) const { 4889 if (!UseInlineDepthForSpeculativeTypes) { 4890 return this; 4891 } 4892 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, _instance_id, _speculative, depth); 4893 } 4894 4895 const TypePtr* TypeInstPtr::with_instance_id(int instance_id) const { 4896 assert(is_known_instance(), "should be known"); 4897 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, _flat_in_array, instance_id, _speculative, _inline_depth); 4898 } 4899 4900 const TypeInstPtr *TypeInstPtr::cast_to_flat_in_array() const { 4901 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, Flat, _instance_id, _speculative, _inline_depth); 4902 } 4903 4904 const TypeInstPtr *TypeInstPtr::cast_to_maybe_flat_in_array() const { 4905 return make(_ptr, klass(), _interfaces, klass_is_exact(), const_oop(), _offset, MaybeFlat, _instance_id, _speculative, _inline_depth); 4906 } 4907 4908 const TypeKlassPtr* TypeInstPtr::as_klass_type(bool try_for_exact) const { 4909 bool xk = klass_is_exact(); 4910 ciInstanceKlass* ik = klass()->as_instance_klass(); 4911 if (try_for_exact && !xk && !ik->has_subklass() && !ik->is_final()) { 4912 if (_interfaces->eq(ik)) { 4913 Compile* C = Compile::current(); 4914 Dependencies* deps = C->dependencies(); 4915 deps->assert_leaf_type(ik); 4916 xk = true; 4917 } 4918 } 4919 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array); 4920 return TypeInstKlassPtr::make(xk ? TypePtr::Constant : TypePtr::NotNull, klass(), _interfaces, Offset(0), flat_in_array); 4921 } 4922 4923 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) { 4924 static_assert(std::is_base_of<T2, T1>::value, ""); 4925 4926 if (!this_one->is_instance_type(other)) { 4927 return false; 4928 } 4929 4930 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) { 4931 return true; 4932 } 4933 4934 return this_one->klass()->is_subtype_of(other->klass()) && 4935 (!this_xk || this_one->_interfaces->contains(other->_interfaces)); 4936 } 4937 4938 4939 bool TypeInstPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const { 4940 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk); 4941 } 4942 4943 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) { 4944 static_assert(std::is_base_of<T2, T1>::value, ""); 4945 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty()) { 4946 return true; 4947 } 4948 4949 if (this_one->is_instance_type(other)) { 4950 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces); 4951 } 4952 4953 int dummy; 4954 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 4955 if (this_top_or_bottom) { 4956 return false; 4957 } 4958 4959 const T1* other_ary = this_one->is_array_type(other); 4960 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 4961 const TypePtr* this_elem = this_one->elem()->make_ptr(); 4962 if (other_elem != nullptr && this_elem != nullptr) { 4963 return this_one->is_reference_type(this_elem)->is_meet_subtype_of_helper(this_one->is_reference_type(other_elem), this_xk, other_xk); 4964 } 4965 if (other_elem == nullptr && this_elem == nullptr) { 4966 return this_one->klass()->is_subtype_of(other->klass()); 4967 } 4968 4969 return false; 4970 } 4971 4972 bool TypeAryPtr::is_meet_subtype_of_helper(const TypeOopPtr *other, bool this_xk, bool other_xk) const { 4973 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk); 4974 } 4975 4976 bool TypeInstKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const { 4977 return TypePtr::is_meet_subtype_of_helper_for_instance(this, other, this_xk, other_xk); 4978 } 4979 4980 bool TypeAryKlassPtr::is_meet_subtype_of_helper(const TypeKlassPtr *other, bool this_xk, bool other_xk) const { 4981 return TypePtr::is_meet_subtype_of_helper_for_array(this, other, this_xk, other_xk); 4982 } 4983 4984 //============================================================================= 4985 // Convenience common pre-built types. 4986 const TypeAryPtr* TypeAryPtr::BOTTOM; 4987 const TypeAryPtr *TypeAryPtr::RANGE; 4988 const TypeAryPtr *TypeAryPtr::OOPS; 4989 const TypeAryPtr *TypeAryPtr::NARROWOOPS; 4990 const TypeAryPtr *TypeAryPtr::BYTES; 4991 const TypeAryPtr *TypeAryPtr::SHORTS; 4992 const TypeAryPtr *TypeAryPtr::CHARS; 4993 const TypeAryPtr *TypeAryPtr::INTS; 4994 const TypeAryPtr *TypeAryPtr::LONGS; 4995 const TypeAryPtr *TypeAryPtr::FLOATS; 4996 const TypeAryPtr *TypeAryPtr::DOUBLES; 4997 const TypeAryPtr *TypeAryPtr::INLINES; 4998 4999 //------------------------------make------------------------------------------- 5000 const TypeAryPtr* TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset, 5001 int instance_id, const TypePtr* speculative, int inline_depth) { 5002 assert(!(k == nullptr && ary->_elem->isa_int()), 5003 "integral arrays must be pre-equipped with a class"); 5004 if (!xk) xk = ary->ary_must_be_exact(); 5005 assert(instance_id <= 0 || xk, "instances are always exactly typed"); 5006 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() && 5007 k->as_obj_array_klass()->base_element_klass()->is_interface()) { 5008 k = nullptr; 5009 } 5010 return (TypeAryPtr*)(new TypeAryPtr(ptr, nullptr, ary, k, xk, offset, field_offset, instance_id, false, speculative, inline_depth))->hashcons(); 5011 } 5012 5013 //------------------------------make------------------------------------------- 5014 const TypeAryPtr* TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, Offset offset, Offset field_offset, 5015 int instance_id, const TypePtr* speculative, int inline_depth, 5016 bool is_autobox_cache) { 5017 assert(!(k == nullptr && ary->_elem->isa_int()), 5018 "integral arrays must be pre-equipped with a class"); 5019 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" ); 5020 if (!xk) xk = (o != nullptr) || ary->ary_must_be_exact(); 5021 assert(instance_id <= 0 || xk, "instances are always exactly typed"); 5022 if (k != nullptr && k->is_loaded() && k->is_obj_array_klass() && 5023 k->as_obj_array_klass()->base_element_klass()->is_interface()) { 5024 k = nullptr; 5025 } 5026 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, field_offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons(); 5027 } 5028 5029 //------------------------------cast_to_ptr_type------------------------------- 5030 const TypeAryPtr* TypeAryPtr::cast_to_ptr_type(PTR ptr) const { 5031 if( ptr == _ptr ) return this; 5032 return make(ptr, ptr == Constant ? const_oop() : nullptr, _ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5033 } 5034 5035 5036 //-----------------------------cast_to_exactness------------------------------- 5037 const TypeAryPtr* TypeAryPtr::cast_to_exactness(bool klass_is_exact) const { 5038 if( klass_is_exact == _klass_is_exact ) return this; 5039 if (_ary->ary_must_be_exact()) return this; // cannot clear xk 5040 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5041 } 5042 5043 //-----------------------------cast_to_instance_id---------------------------- 5044 const TypeAryPtr* TypeAryPtr::cast_to_instance_id(int instance_id) const { 5045 if( instance_id == _instance_id ) return this; 5046 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth, _is_autobox_cache); 5047 } 5048 5049 5050 //-----------------------------max_array_length------------------------------- 5051 // A wrapper around arrayOopDesc::max_array_length(etype) with some input normalization. 5052 jint TypeAryPtr::max_array_length(BasicType etype) { 5053 if (!is_java_primitive(etype) && !::is_reference_type(etype)) { 5054 if (etype == T_NARROWOOP) { 5055 etype = T_OBJECT; 5056 } else if (etype == T_ILLEGAL) { // bottom[] 5057 etype = T_BYTE; // will produce conservatively high value 5058 } else { 5059 fatal("not an element type: %s", type2name(etype)); 5060 } 5061 } 5062 return arrayOopDesc::max_array_length(etype); 5063 } 5064 5065 //-----------------------------narrow_size_type------------------------------- 5066 // Narrow the given size type to the index range for the given array base type. 5067 // Return null if the resulting int type becomes empty. 5068 const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const { 5069 jint hi = size->_hi; 5070 jint lo = size->_lo; 5071 jint min_lo = 0; 5072 jint max_hi = max_array_length(elem()->array_element_basic_type()); 5073 //if (index_not_size) --max_hi; // type of a valid array index, FTR 5074 bool chg = false; 5075 if (lo < min_lo) { 5076 lo = min_lo; 5077 if (size->is_con()) { 5078 hi = lo; 5079 } 5080 chg = true; 5081 } 5082 if (hi > max_hi) { 5083 hi = max_hi; 5084 if (size->is_con()) { 5085 lo = hi; 5086 } 5087 chg = true; 5088 } 5089 // Negative length arrays will produce weird intermediate dead fast-path code 5090 if (lo > hi) { 5091 return TypeInt::ZERO; 5092 } 5093 if (!chg) { 5094 return size; 5095 } 5096 return TypeInt::make(lo, hi, Type::WidenMin); 5097 } 5098 5099 //-------------------------------cast_to_size---------------------------------- 5100 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const { 5101 assert(new_size != nullptr, ""); 5102 new_size = narrow_size_type(new_size); 5103 if (new_size == size()) return this; 5104 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5105 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5106 } 5107 5108 const TypeAryPtr* TypeAryPtr::cast_to_flat(bool flat) const { 5109 if (flat == is_flat()) { 5110 return this; 5111 } 5112 assert(!flat || !is_not_flat(), "inconsistency"); 5113 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), flat, is_not_flat(), is_not_null_free(), is_atomic()); 5114 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5115 if (res->speculative() == res->remove_speculative()) { 5116 return res->remove_speculative(); 5117 } 5118 return res; 5119 } 5120 5121 //-------------------------------cast_to_not_flat------------------------------ 5122 const TypeAryPtr* TypeAryPtr::cast_to_not_flat(bool not_flat) const { 5123 if (not_flat == is_not_flat()) { 5124 return this; 5125 } 5126 assert(!not_flat || !is_flat(), "inconsistency"); 5127 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), not_flat, is_not_null_free(), is_atomic()); 5128 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5129 // We keep the speculative part if it contains information about flat-/nullability. 5130 // Make sure it's removed if it's not better than the non-speculative type anymore. 5131 if (res->speculative() == res->remove_speculative()) { 5132 return res->remove_speculative(); 5133 } 5134 return res; 5135 } 5136 5137 const TypeAryPtr* TypeAryPtr::cast_to_null_free(bool null_free) const { 5138 if (null_free == is_null_free()) { 5139 return this; 5140 } 5141 assert(!null_free || !is_not_null_free(), "inconsistency"); 5142 const Type* elem = this->elem(); 5143 const Type* new_elem = elem->make_ptr(); 5144 if (null_free) { 5145 new_elem = new_elem->join_speculative(TypePtr::NOTNULL); 5146 } else { 5147 new_elem = new_elem->meet_speculative(TypePtr::NULL_PTR); 5148 } 5149 new_elem = elem->isa_narrowoop() ? new_elem->make_narrowoop() : new_elem; 5150 const TypeAry* new_ary = TypeAry::make(new_elem, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5151 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5152 if (res->speculative() == res->remove_speculative()) { 5153 return res->remove_speculative(); 5154 } 5155 assert(res->speculative() == nullptr || res->speculative()->with_inline_depth(res->inline_depth())->higher_equal(res->remove_speculative()), 5156 "speculative type must not be narrower than non-speculative type"); 5157 return res; 5158 } 5159 5160 //-------------------------------cast_to_not_null_free------------------------- 5161 const TypeAryPtr* TypeAryPtr::cast_to_not_null_free(bool not_null_free) const { 5162 if (not_null_free == is_not_null_free()) { 5163 return this; 5164 } 5165 assert(!not_null_free || !is_null_free(), "inconsistency"); 5166 const TypeAry* new_ary = TypeAry::make(elem(), size(), is_stable(), is_flat(), is_not_flat(), not_null_free, is_atomic()); 5167 const TypePtr* new_spec = _speculative; 5168 if (new_spec != nullptr) { 5169 // Could be 'null free' from profiling, which would contradict the cast. 5170 new_spec = new_spec->is_aryptr()->cast_to_null_free(false)->cast_to_not_null_free(); 5171 } 5172 const TypeAryPtr* res = make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, 5173 _instance_id, new_spec, _inline_depth, _is_autobox_cache); 5174 // We keep the speculative part if it contains information about flat-/nullability. 5175 // Make sure it's removed if it's not better than the non-speculative type anymore. 5176 if (res->speculative() == res->remove_speculative()) { 5177 return res->remove_speculative(); 5178 } 5179 assert(res->speculative() == nullptr || res->speculative()->with_inline_depth(res->inline_depth())->higher_equal(res->remove_speculative()), 5180 "speculative type must not be narrower than non-speculative type"); 5181 return res; 5182 } 5183 5184 //---------------------------------update_properties--------------------------- 5185 const TypeAryPtr* TypeAryPtr::update_properties(const TypeAryPtr* from) const { 5186 if ((from->is_flat() && is_not_flat()) || 5187 (from->is_not_flat() && is_flat()) || 5188 (from->is_null_free() && is_not_null_free()) || 5189 (from->is_not_null_free() && is_null_free())) { 5190 return nullptr; // Inconsistent properties 5191 } 5192 const TypeAryPtr* res = this; 5193 if (from->is_not_null_free()) { 5194 res = res->cast_to_not_null_free(); 5195 } 5196 if (from->is_not_flat()) { 5197 res = res->cast_to_not_flat(); 5198 } 5199 return res; 5200 } 5201 5202 jint TypeAryPtr::flat_layout_helper() const { 5203 return exact_klass()->as_flat_array_klass()->layout_helper(); 5204 } 5205 5206 int TypeAryPtr::flat_elem_size() const { 5207 return exact_klass()->as_flat_array_klass()->element_byte_size(); 5208 } 5209 5210 int TypeAryPtr::flat_log_elem_size() const { 5211 return exact_klass()->as_flat_array_klass()->log2_element_size(); 5212 } 5213 5214 //------------------------------cast_to_stable--------------------------------- 5215 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const { 5216 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable())) 5217 return this; 5218 5219 const Type* elem = this->elem(); 5220 const TypePtr* elem_ptr = elem->make_ptr(); 5221 5222 if (stable_dimension > 1 && elem_ptr != nullptr && elem_ptr->isa_aryptr()) { 5223 // If this is widened from a narrow oop, TypeAry::make will re-narrow it. 5224 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1); 5225 } 5226 5227 const TypeAry* new_ary = TypeAry::make(elem, size(), stable, is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5228 5229 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5230 } 5231 5232 //-----------------------------stable_dimension-------------------------------- 5233 int TypeAryPtr::stable_dimension() const { 5234 if (!is_stable()) return 0; 5235 int dim = 1; 5236 const TypePtr* elem_ptr = elem()->make_ptr(); 5237 if (elem_ptr != nullptr && elem_ptr->isa_aryptr()) 5238 dim += elem_ptr->is_aryptr()->stable_dimension(); 5239 return dim; 5240 } 5241 5242 //----------------------cast_to_autobox_cache----------------------------------- 5243 const TypeAryPtr* TypeAryPtr::cast_to_autobox_cache() const { 5244 if (is_autobox_cache()) return this; 5245 const TypeOopPtr* etype = elem()->make_oopptr(); 5246 if (etype == nullptr) return this; 5247 // The pointers in the autobox arrays are always non-null. 5248 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); 5249 const TypeAry* new_ary = TypeAry::make(etype, size(), is_stable(), is_flat(), is_not_flat(), is_not_null_free(), is_atomic()); 5250 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _field_offset, _instance_id, _speculative, _inline_depth, /*is_autobox_cache=*/true); 5251 } 5252 5253 //------------------------------eq--------------------------------------------- 5254 // Structural equality check for Type representations 5255 bool TypeAryPtr::eq( const Type *t ) const { 5256 const TypeAryPtr *p = t->is_aryptr(); 5257 return 5258 _ary == p->_ary && // Check array 5259 TypeOopPtr::eq(p) &&// Check sub-parts 5260 _field_offset == p->_field_offset; 5261 } 5262 5263 //------------------------------hash------------------------------------------- 5264 // Type-specific hashing function. 5265 uint TypeAryPtr::hash(void) const { 5266 return (uint)(uintptr_t)_ary + TypeOopPtr::hash() + _field_offset.get(); 5267 } 5268 5269 bool TypeAryPtr::is_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 5270 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 5271 } 5272 5273 bool TypeAryPtr::is_same_java_type_as_helper(const TypeOopPtr* other) const { 5274 return TypePtr::is_same_java_type_as_helper_for_array(this, other); 5275 } 5276 5277 bool TypeAryPtr::maybe_java_subtype_of_helper(const TypeOopPtr* other, bool this_exact, bool other_exact) const { 5278 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 5279 } 5280 //------------------------------meet------------------------------------------- 5281 // Compute the MEET of two types. It returns a new Type object. 5282 const Type *TypeAryPtr::xmeet_helper(const Type *t) const { 5283 // Perform a fast test for common case; meeting the same types together. 5284 if( this == t ) return this; // Meeting same type-rep? 5285 // Current "this->_base" is Pointer 5286 switch (t->base()) { // switch on original type 5287 5288 // Mixing ints & oops happens when javac reuses local variables 5289 case Int: 5290 case Long: 5291 case HalfFloatTop: 5292 case HalfFloatCon: 5293 case HalfFloatBot: 5294 case FloatTop: 5295 case FloatCon: 5296 case FloatBot: 5297 case DoubleTop: 5298 case DoubleCon: 5299 case DoubleBot: 5300 case NarrowOop: 5301 case NarrowKlass: 5302 case Bottom: // Ye Olde Default 5303 return Type::BOTTOM; 5304 case Top: 5305 return this; 5306 5307 default: // All else is a mistake 5308 typerr(t); 5309 5310 case OopPtr: { // Meeting to OopPtrs 5311 // Found a OopPtr type vs self-AryPtr type 5312 const TypeOopPtr *tp = t->is_oopptr(); 5313 Offset offset = meet_offset(tp->offset()); 5314 PTR ptr = meet_ptr(tp->ptr()); 5315 int depth = meet_inline_depth(tp->inline_depth()); 5316 const TypePtr* speculative = xmeet_speculative(tp); 5317 switch (tp->ptr()) { 5318 case TopPTR: 5319 case AnyNull: { 5320 int instance_id = meet_instance_id(InstanceTop); 5321 return make(ptr, (ptr == Constant ? const_oop() : nullptr), 5322 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5323 } 5324 case BotPTR: 5325 case NotNull: { 5326 int instance_id = meet_instance_id(tp->instance_id()); 5327 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); 5328 } 5329 default: ShouldNotReachHere(); 5330 } 5331 } 5332 5333 case AnyPtr: { // Meeting two AnyPtrs 5334 // Found an AnyPtr type vs self-AryPtr type 5335 const TypePtr *tp = t->is_ptr(); 5336 Offset offset = meet_offset(tp->offset()); 5337 PTR ptr = meet_ptr(tp->ptr()); 5338 const TypePtr* speculative = xmeet_speculative(tp); 5339 int depth = meet_inline_depth(tp->inline_depth()); 5340 switch (tp->ptr()) { 5341 case TopPTR: 5342 return this; 5343 case BotPTR: 5344 case NotNull: 5345 return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 5346 case Null: 5347 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, speculative, depth); 5348 // else fall through to AnyNull 5349 case AnyNull: { 5350 int instance_id = meet_instance_id(InstanceTop); 5351 return make(ptr, (ptr == Constant ? const_oop() : nullptr), 5352 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5353 } 5354 default: ShouldNotReachHere(); 5355 } 5356 } 5357 5358 case MetadataPtr: 5359 case KlassPtr: 5360 case InstKlassPtr: 5361 case AryKlassPtr: 5362 case RawPtr: return TypePtr::BOTTOM; 5363 5364 case AryPtr: { // Meeting 2 references? 5365 const TypeAryPtr *tap = t->is_aryptr(); 5366 Offset off = meet_offset(tap->offset()); 5367 Offset field_off = meet_field_offset(tap->field_offset()); 5368 const Type* tm = _ary->meet_speculative(tap->_ary); 5369 const TypeAry* tary = tm->isa_ary(); 5370 if (tary == nullptr) { 5371 assert(tm == Type::TOP || tm == Type::BOTTOM, ""); 5372 return tm; 5373 } 5374 PTR ptr = meet_ptr(tap->ptr()); 5375 int instance_id = meet_instance_id(tap->instance_id()); 5376 const TypePtr* speculative = xmeet_speculative(tap); 5377 int depth = meet_inline_depth(tap->inline_depth()); 5378 5379 ciKlass* res_klass = nullptr; 5380 bool res_xk = false; 5381 bool res_flat = false; 5382 bool res_not_flat = false; 5383 bool res_not_null_free = false; 5384 bool res_atomic = false; 5385 const Type* elem = tary->_elem; 5386 if (meet_aryptr(ptr, elem, this, tap, res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic) == NOT_SUBTYPE) { 5387 instance_id = InstanceBot; 5388 } else if (this->is_flat() != tap->is_flat()) { 5389 // Meeting flat inline type array with non-flat array. Adjust (field) offset accordingly. 5390 if (tary->_flat) { 5391 // Result is in a flat representation 5392 off = Offset(is_flat() ? offset() : tap->offset()); 5393 field_off = is_flat() ? field_offset() : tap->field_offset(); 5394 } else if (below_centerline(ptr)) { 5395 // Result is in a non-flat representation 5396 off = Offset(flat_offset()).meet(Offset(tap->flat_offset())); 5397 field_off = (field_off == Offset::top) ? Offset::top : Offset::bottom; 5398 } else if (flat_offset() == tap->flat_offset()) { 5399 off = Offset(!is_flat() ? offset() : tap->offset()); 5400 field_off = !is_flat() ? field_offset() : tap->field_offset(); 5401 } 5402 } 5403 5404 ciObject* o = nullptr; // Assume not constant when done 5405 ciObject* this_oop = const_oop(); 5406 ciObject* tap_oop = tap->const_oop(); 5407 if (ptr == Constant) { 5408 if (this_oop != nullptr && tap_oop != nullptr && 5409 this_oop->equals(tap_oop)) { 5410 o = tap_oop; 5411 } else if (above_centerline(_ptr)) { 5412 o = tap_oop; 5413 } else if (above_centerline(tap->_ptr)) { 5414 o = this_oop; 5415 } else { 5416 ptr = NotNull; 5417 } 5418 } 5419 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); 5420 } 5421 5422 // All arrays inherit from Object class 5423 case InstPtr: { 5424 const TypeInstPtr *tp = t->is_instptr(); 5425 Offset offset = meet_offset(tp->offset()); 5426 PTR ptr = meet_ptr(tp->ptr()); 5427 int instance_id = meet_instance_id(tp->instance_id()); 5428 const TypePtr* speculative = xmeet_speculative(tp); 5429 int depth = meet_inline_depth(tp->inline_depth()); 5430 const TypeInterfaces* interfaces = meet_interfaces(tp); 5431 const TypeInterfaces* tp_interfaces = tp->_interfaces; 5432 const TypeInterfaces* this_interfaces = _interfaces; 5433 5434 switch (ptr) { 5435 case TopPTR: 5436 case AnyNull: // Fall 'down' to dual of object klass 5437 // For instances when a subclass meets a superclass we fall 5438 // below the centerline when the superclass is exact. We need to 5439 // do the same here. 5440 // 5441 // Flat in array: 5442 // We do 5443 // dual(TypeAryPtr) MEET dual(TypeInstPtr) 5444 // If TypeInstPtr is anything else than Object, then the result of the meet is bottom Object (i.e. we could have 5445 // instances or arrays). 5446 // If TypeInstPtr is an Object and either 5447 // - exact 5448 // - inexact AND flat in array == dual(not flat in array) (i.e. not an array type) 5449 // then the result of the meet is bottom Object (i.e. we could have instances or arrays). 5450 // Otherwise, we meet two array pointers and create a new TypeAryPtr. 5451 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 5452 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 5453 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5454 } else { 5455 // cannot subclass, so the meet has to fall badly below the centerline 5456 ptr = NotNull; 5457 instance_id = InstanceBot; 5458 interfaces = this_interfaces->intersection_with(tp_interfaces); 5459 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 5460 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, flat_in_array, instance_id, speculative, depth); 5461 } 5462 case Constant: 5463 case NotNull: 5464 case BotPTR: { // Fall down to object klass 5465 // LCA is object_klass, but if we subclass from the top we can do better 5466 if (above_centerline(tp->ptr())) { 5467 // If 'tp' is above the centerline and it is Object class 5468 // then we can subclass in the Java class hierarchy. 5469 // For instances when a subclass meets a superclass we fall 5470 // below the centerline when the superclass is exact. We need 5471 // to do the same here. 5472 5473 // Flat in array: We do TypeAryPtr MEET dual(TypeInstPtr), same applies as above in TopPTR/AnyNull case. 5474 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 5475 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 5476 // that is, my array type is a subtype of 'tp' klass 5477 return make(ptr, (ptr == Constant ? const_oop() : nullptr), 5478 _ary, _klass, _klass_is_exact, offset, _field_offset, instance_id, speculative, depth); 5479 } 5480 } 5481 // The other case cannot happen, since t cannot be a subtype of an array. 5482 // The meet falls down to Object class below centerline. 5483 if (ptr == Constant) { 5484 ptr = NotNull; 5485 } 5486 if (instance_id > 0) { 5487 instance_id = InstanceBot; 5488 } 5489 5490 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 5491 interfaces = this_interfaces->intersection_with(tp_interfaces); 5492 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, false, nullptr, offset, 5493 flat_in_array, instance_id, speculative, depth); 5494 } 5495 default: typerr(t); 5496 } 5497 } 5498 } 5499 return this; // Lint noise 5500 } 5501 5502 5503 template<class T> TypePtr::MeetResult TypePtr::meet_aryptr(PTR& ptr, const Type*& elem, const T* this_ary, const T* other_ary, 5504 ciKlass*& res_klass, bool& res_xk, bool &res_flat, bool& res_not_flat, bool& res_not_null_free, bool &res_atomic) { 5505 int dummy; 5506 bool this_top_or_bottom = (this_ary->base_element_type(dummy) == Type::TOP || this_ary->base_element_type(dummy) == Type::BOTTOM); 5507 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 5508 ciKlass* this_klass = this_ary->klass(); 5509 ciKlass* other_klass = other_ary->klass(); 5510 bool this_xk = this_ary->klass_is_exact(); 5511 bool other_xk = other_ary->klass_is_exact(); 5512 PTR this_ptr = this_ary->ptr(); 5513 PTR other_ptr = other_ary->ptr(); 5514 bool this_flat = this_ary->is_flat(); 5515 bool this_not_flat = this_ary->is_not_flat(); 5516 bool other_flat = other_ary->is_flat(); 5517 bool other_not_flat = other_ary->is_not_flat(); 5518 bool this_not_null_free = this_ary->is_not_null_free(); 5519 bool other_not_null_free = other_ary->is_not_null_free(); 5520 bool this_atomic = this_ary->is_atomic(); 5521 bool other_atomic = other_ary->is_atomic(); 5522 const bool same_nullness = this_ary->is_null_free() == other_ary->is_null_free(); 5523 res_klass = nullptr; 5524 MeetResult result = SUBTYPE; 5525 res_flat = this_flat && other_flat; 5526 bool res_null_free = this_ary->is_null_free() && other_ary->is_null_free(); 5527 res_not_flat = this_not_flat && other_not_flat; 5528 res_not_null_free = this_not_null_free && other_not_null_free; 5529 res_atomic = this_atomic && other_atomic; 5530 5531 if (elem->isa_int()) { 5532 // Integral array element types have irrelevant lattice relations. 5533 // It is the klass that determines array layout, not the element type. 5534 if (this_top_or_bottom) { 5535 res_klass = other_klass; 5536 } else if (other_top_or_bottom || other_klass == this_klass) { 5537 res_klass = this_klass; 5538 } else { 5539 // Something like byte[int+] meets char[int+]. 5540 // This must fall to bottom, not (int[-128..65535])[int+]. 5541 // instance_id = InstanceBot; 5542 elem = Type::BOTTOM; 5543 result = NOT_SUBTYPE; 5544 if (above_centerline(ptr) || ptr == Constant) { 5545 ptr = NotNull; 5546 res_xk = false; 5547 return NOT_SUBTYPE; 5548 } 5549 } 5550 } else {// Non integral arrays. 5551 // Must fall to bottom if exact klasses in upper lattice 5552 // are not equal or super klass is exact. 5553 if ((above_centerline(ptr) || ptr == Constant) && !this_ary->is_same_java_type_as(other_ary) && 5554 // meet with top[] and bottom[] are processed further down: 5555 !this_top_or_bottom && !other_top_or_bottom && 5556 // both are exact and not equal: 5557 ((other_xk && this_xk) || 5558 // 'tap' is exact and super or unrelated: 5559 (other_xk && !other_ary->is_meet_subtype_of(this_ary)) || 5560 // 'this' is exact and super or unrelated: 5561 (this_xk && !this_ary->is_meet_subtype_of(other_ary)))) { 5562 if (above_centerline(ptr) || (elem->make_ptr() && above_centerline(elem->make_ptr()->_ptr))) { 5563 elem = Type::BOTTOM; 5564 } 5565 ptr = NotNull; 5566 res_xk = false; 5567 return NOT_SUBTYPE; 5568 } 5569 } 5570 5571 res_xk = false; 5572 switch (other_ptr) { 5573 case AnyNull: 5574 case TopPTR: 5575 // Compute new klass on demand, do not use tap->_klass 5576 if (below_centerline(this_ptr)) { 5577 res_xk = this_xk; 5578 if (this_ary->is_flat()) { 5579 elem = this_ary->elem(); 5580 } 5581 } else { 5582 res_xk = (other_xk || this_xk); 5583 } 5584 break; 5585 case Constant: { 5586 if (this_ptr == Constant && same_nullness) { 5587 // Only exact if same nullness since: 5588 // null-free [LMyValue <: nullable [LMyValue. 5589 res_xk = true; 5590 } else if (above_centerline(this_ptr)) { 5591 res_xk = true; 5592 } else { 5593 // Only precise for identical arrays 5594 res_xk = this_xk && (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); 5595 // Even though MyValue is final, [LMyValue is only exact if the array 5596 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue. 5597 if (res_xk && !res_null_free && !res_not_null_free) { 5598 ptr = NotNull; 5599 res_xk = false; 5600 } 5601 } 5602 break; 5603 } 5604 case NotNull: 5605 case BotPTR: 5606 // Compute new klass on demand, do not use tap->_klass 5607 if (above_centerline(this_ptr)) { 5608 res_xk = other_xk; 5609 if (other_ary->is_flat()) { 5610 elem = other_ary->elem(); 5611 } 5612 } else { 5613 res_xk = (other_xk && this_xk) && 5614 (this_ary->is_same_java_type_as(other_ary) || (this_top_or_bottom && other_top_or_bottom)); // Only precise for identical arrays 5615 // Even though MyValue is final, [LMyValue is only exact if the array 5616 // is (not) null-free due to null-free [LMyValue <: null-able [LMyValue. 5617 if (res_xk && !res_null_free && !res_not_null_free) { 5618 ptr = NotNull; 5619 res_xk = false; 5620 } 5621 } 5622 break; 5623 default: { 5624 ShouldNotReachHere(); 5625 return result; 5626 } 5627 } 5628 return result; 5629 } 5630 5631 5632 //------------------------------xdual------------------------------------------ 5633 // Dual: compute field-by-field dual 5634 const Type *TypeAryPtr::xdual() const { 5635 bool xk = _klass_is_exact; 5636 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()); 5637 } 5638 5639 Type::Offset TypeAryPtr::meet_field_offset(const Type::Offset offset) const { 5640 return _field_offset.meet(offset); 5641 } 5642 5643 //------------------------------dual_offset------------------------------------ 5644 Type::Offset TypeAryPtr::dual_field_offset() const { 5645 return _field_offset.dual(); 5646 } 5647 5648 //------------------------------dump2------------------------------------------ 5649 #ifndef PRODUCT 5650 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const { 5651 st->print("aryptr:"); 5652 _ary->dump2(d, depth, st); 5653 _interfaces->dump(st); 5654 5655 if (_ptr == Constant) { 5656 const_oop()->print(st); 5657 } 5658 5659 st->print(":%s", ptr_msg[_ptr]); 5660 if (_klass_is_exact) { 5661 st->print(":exact"); 5662 } 5663 5664 if (is_flat()) { 5665 st->print(":flat"); 5666 st->print("("); 5667 _field_offset.dump2(st); 5668 st->print(")"); 5669 } else if (is_not_flat()) { 5670 st->print(":not_flat"); 5671 } 5672 if (is_null_free()) { 5673 st->print(":null free"); 5674 } 5675 if (is_atomic()) { 5676 st->print(":atomic"); 5677 } 5678 if (Verbose) { 5679 if (is_not_flat()) { 5680 st->print(":not flat"); 5681 } 5682 if (is_not_null_free()) { 5683 st->print(":nullable"); 5684 } 5685 } 5686 if (offset() != 0) { 5687 BasicType basic_elem_type = elem()->basic_type(); 5688 int header_size = arrayOopDesc::base_offset_in_bytes(basic_elem_type); 5689 if( _offset == Offset::top ) st->print("+undefined"); 5690 else if( _offset == Offset::bottom ) st->print("+any"); 5691 else if( offset() < header_size ) st->print("+%d", offset()); 5692 else { 5693 if (basic_elem_type == T_ILLEGAL) { 5694 st->print("+any"); 5695 } else { 5696 int elem_size = type2aelembytes(basic_elem_type); 5697 st->print("[%d]", (offset() - header_size)/elem_size); 5698 } 5699 } 5700 } 5701 5702 dump_instance_id(st); 5703 dump_inline_depth(st); 5704 dump_speculative(st); 5705 } 5706 #endif 5707 5708 bool TypeAryPtr::empty(void) const { 5709 if (_ary->empty()) return true; 5710 // TODO 8350865 This should go to the meet implementation 5711 if (is_flat() && is_not_flat()) { 5712 return true; 5713 } 5714 return TypeOopPtr::empty(); 5715 } 5716 5717 //------------------------------add_offset------------------------------------- 5718 const TypePtr* TypeAryPtr::add_offset(intptr_t offset) const { 5719 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); 5720 } 5721 5722 const TypeAryPtr* TypeAryPtr::with_offset(intptr_t offset) const { 5723 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); 5724 } 5725 5726 const TypeAryPtr* TypeAryPtr::with_ary(const TypeAry* ary) const { 5727 return make(_ptr, _const_oop, ary, _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, _inline_depth, _is_autobox_cache); 5728 } 5729 5730 const TypeAryPtr* TypeAryPtr::remove_speculative() const { 5731 if (_speculative == nullptr) { 5732 return this; 5733 } 5734 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); 5735 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); 5736 } 5737 5738 const Type* TypeAryPtr::cleanup_speculative() const { 5739 if (speculative() == nullptr) { 5740 return this; 5741 } 5742 // Keep speculative part if it contains information about flat-/nullability 5743 const TypeAryPtr* spec_aryptr = speculative()->isa_aryptr(); 5744 if (spec_aryptr != nullptr && !above_centerline(spec_aryptr->ptr()) && 5745 (spec_aryptr->is_not_flat() || spec_aryptr->is_not_null_free())) { 5746 return this; 5747 } 5748 return TypeOopPtr::cleanup_speculative(); 5749 } 5750 5751 const TypePtr* TypeAryPtr::with_inline_depth(int depth) const { 5752 if (!UseInlineDepthForSpeculativeTypes) { 5753 return this; 5754 } 5755 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, _instance_id, _speculative, depth, _is_autobox_cache); 5756 } 5757 5758 const TypeAryPtr* TypeAryPtr::with_field_offset(int offset) const { 5759 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); 5760 } 5761 5762 const TypePtr* TypeAryPtr::add_field_offset_and_offset(intptr_t offset) const { 5763 if (!is_flat() || !klass_is_exact() || offset == OffsetBot || offset == OffsetTop) { 5764 return add_offset(offset); 5765 } 5766 5767 // Handle flat concrete value class array with known 'offset' which could refer to an actual field in the flat storage. 5768 int adj = 0; 5769 if (_offset != Offset::bottom && _offset != Offset::top) { 5770 adj = _offset.get(); 5771 offset += _offset.get(); 5772 } 5773 uint header = arrayOopDesc::base_offset_in_bytes(T_FLAT_ELEMENT); 5774 if (_field_offset != Offset::bottom && _field_offset != Offset::top) { 5775 offset += _field_offset.get(); 5776 if (_offset == Offset::bottom || _offset == Offset::top) { 5777 offset += header; 5778 } 5779 } 5780 if (elem()->make_oopptr()->is_inlinetypeptr() && (offset >= (intptr_t)header || offset < 0)) { 5781 // Try to get the field of the inline type array element we are pointing to 5782 ciInlineKlass* vk = elem()->inline_klass(); 5783 int shift = flat_log_elem_size(); 5784 int mask = (1 << shift) - 1; 5785 int field_offset = static_cast<int>((offset - header) & mask); 5786 ciField* field = vk->get_field_by_offset(field_offset + vk->payload_offset(), false); 5787 if (field != nullptr || field_offset == vk->null_marker_offset_in_payload()) { 5788 return with_field_offset(field_offset)->add_offset(offset - field_offset - adj); 5789 } 5790 } 5791 return add_offset(offset - adj); 5792 } 5793 5794 // Return offset incremented by field_offset for flat inline type arrays 5795 int TypeAryPtr::flat_offset() const { 5796 int offset = _offset.get(); 5797 if (offset != OffsetBot && offset != OffsetTop && 5798 _field_offset != Offset::bottom && _field_offset != Offset::top) { 5799 offset += _field_offset.get(); 5800 } 5801 return offset; 5802 } 5803 5804 const TypePtr* TypeAryPtr::with_instance_id(int instance_id) const { 5805 assert(is_known_instance(), "should be known"); 5806 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _field_offset, instance_id, _speculative, _inline_depth); 5807 } 5808 5809 //============================================================================= 5810 5811 5812 //------------------------------hash------------------------------------------- 5813 // Type-specific hashing function. 5814 uint TypeNarrowPtr::hash(void) const { 5815 return _ptrtype->hash() + 7; 5816 } 5817 5818 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton 5819 return _ptrtype->singleton(); 5820 } 5821 5822 bool TypeNarrowPtr::empty(void) const { 5823 return _ptrtype->empty(); 5824 } 5825 5826 intptr_t TypeNarrowPtr::get_con() const { 5827 return _ptrtype->get_con(); 5828 } 5829 5830 bool TypeNarrowPtr::eq( const Type *t ) const { 5831 const TypeNarrowPtr* tc = isa_same_narrowptr(t); 5832 if (tc != nullptr) { 5833 if (_ptrtype->base() != tc->_ptrtype->base()) { 5834 return false; 5835 } 5836 return tc->_ptrtype->eq(_ptrtype); 5837 } 5838 return false; 5839 } 5840 5841 const Type *TypeNarrowPtr::xdual() const { // Compute dual right now. 5842 const TypePtr* odual = _ptrtype->dual()->is_ptr(); 5843 return make_same_narrowptr(odual); 5844 } 5845 5846 5847 const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const { 5848 if (isa_same_narrowptr(kills)) { 5849 const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative); 5850 if (ft->empty()) 5851 return Type::TOP; // Canonical empty value 5852 if (ft->isa_ptr()) { 5853 return make_hash_same_narrowptr(ft->isa_ptr()); 5854 } 5855 return ft; 5856 } else if (kills->isa_ptr()) { 5857 const Type* ft = _ptrtype->join_helper(kills, include_speculative); 5858 if (ft->empty()) 5859 return Type::TOP; // Canonical empty value 5860 return ft; 5861 } else { 5862 return Type::TOP; 5863 } 5864 } 5865 5866 //------------------------------xmeet------------------------------------------ 5867 // Compute the MEET of two types. It returns a new Type object. 5868 const Type *TypeNarrowPtr::xmeet( const Type *t ) const { 5869 // Perform a fast test for common case; meeting the same types together. 5870 if( this == t ) return this; // Meeting same type-rep? 5871 5872 if (t->base() == base()) { 5873 const Type* result = _ptrtype->xmeet(t->make_ptr()); 5874 if (result->isa_ptr()) { 5875 return make_hash_same_narrowptr(result->is_ptr()); 5876 } 5877 return result; 5878 } 5879 5880 // Current "this->_base" is NarrowKlass or NarrowOop 5881 switch (t->base()) { // switch on original type 5882 5883 case Int: // Mixing ints & oops happens when javac 5884 case Long: // reuses local variables 5885 case HalfFloatTop: 5886 case HalfFloatCon: 5887 case HalfFloatBot: 5888 case FloatTop: 5889 case FloatCon: 5890 case FloatBot: 5891 case DoubleTop: 5892 case DoubleCon: 5893 case DoubleBot: 5894 case AnyPtr: 5895 case RawPtr: 5896 case OopPtr: 5897 case InstPtr: 5898 case AryPtr: 5899 case MetadataPtr: 5900 case KlassPtr: 5901 case InstKlassPtr: 5902 case AryKlassPtr: 5903 case NarrowOop: 5904 case NarrowKlass: 5905 case Bottom: // Ye Olde Default 5906 return Type::BOTTOM; 5907 case Top: 5908 return this; 5909 5910 default: // All else is a mistake 5911 typerr(t); 5912 5913 } // End of switch 5914 5915 return this; 5916 } 5917 5918 #ifndef PRODUCT 5919 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const { 5920 _ptrtype->dump2(d, depth, st); 5921 } 5922 #endif 5923 5924 const TypeNarrowOop *TypeNarrowOop::BOTTOM; 5925 const TypeNarrowOop *TypeNarrowOop::NULL_PTR; 5926 5927 5928 const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) { 5929 return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons(); 5930 } 5931 5932 const TypeNarrowOop* TypeNarrowOop::remove_speculative() const { 5933 return make(_ptrtype->remove_speculative()->is_ptr()); 5934 } 5935 5936 const Type* TypeNarrowOop::cleanup_speculative() const { 5937 return make(_ptrtype->cleanup_speculative()->is_ptr()); 5938 } 5939 5940 #ifndef PRODUCT 5941 void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const { 5942 st->print("narrowoop: "); 5943 TypeNarrowPtr::dump2(d, depth, st); 5944 } 5945 #endif 5946 5947 const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR; 5948 5949 const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) { 5950 return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons(); 5951 } 5952 5953 #ifndef PRODUCT 5954 void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const { 5955 st->print("narrowklass: "); 5956 TypeNarrowPtr::dump2(d, depth, st); 5957 } 5958 #endif 5959 5960 5961 //------------------------------eq--------------------------------------------- 5962 // Structural equality check for Type representations 5963 bool TypeMetadataPtr::eq( const Type *t ) const { 5964 const TypeMetadataPtr *a = (const TypeMetadataPtr*)t; 5965 ciMetadata* one = metadata(); 5966 ciMetadata* two = a->metadata(); 5967 if (one == nullptr || two == nullptr) { 5968 return (one == two) && TypePtr::eq(t); 5969 } else { 5970 return one->equals(two) && TypePtr::eq(t); 5971 } 5972 } 5973 5974 //------------------------------hash------------------------------------------- 5975 // Type-specific hashing function. 5976 uint TypeMetadataPtr::hash(void) const { 5977 return 5978 (metadata() ? metadata()->hash() : 0) + 5979 TypePtr::hash(); 5980 } 5981 5982 //------------------------------singleton-------------------------------------- 5983 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 5984 // constants 5985 bool TypeMetadataPtr::singleton(void) const { 5986 // detune optimizer to not generate constant metadata + constant offset as a constant! 5987 // TopPTR, Null, AnyNull, Constant are all singletons 5988 return (offset() == 0) && !below_centerline(_ptr); 5989 } 5990 5991 //------------------------------add_offset------------------------------------- 5992 const TypePtr* TypeMetadataPtr::add_offset( intptr_t offset ) const { 5993 return make( _ptr, _metadata, xadd_offset(offset)); 5994 } 5995 5996 //-----------------------------filter------------------------------------------ 5997 // Do not allow interface-vs.-noninterface joins to collapse to top. 5998 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const { 5999 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr(); 6000 if (ft == nullptr || ft->empty()) 6001 return Type::TOP; // Canonical empty value 6002 return ft; 6003 } 6004 6005 //------------------------------get_con---------------------------------------- 6006 intptr_t TypeMetadataPtr::get_con() const { 6007 assert( _ptr == Null || _ptr == Constant, "" ); 6008 assert(offset() >= 0, ""); 6009 6010 if (offset() != 0) { 6011 // After being ported to the compiler interface, the compiler no longer 6012 // directly manipulates the addresses of oops. Rather, it only has a pointer 6013 // to a handle at compile time. This handle is embedded in the generated 6014 // code and dereferenced at the time the nmethod is made. Until that time, 6015 // it is not reasonable to do arithmetic with the addresses of oops (we don't 6016 // have access to the addresses!). This does not seem to currently happen, 6017 // but this assertion here is to help prevent its occurrence. 6018 tty->print_cr("Found oop constant with non-zero offset"); 6019 ShouldNotReachHere(); 6020 } 6021 6022 return (intptr_t)metadata()->constant_encoding(); 6023 } 6024 6025 //------------------------------cast_to_ptr_type------------------------------- 6026 const TypeMetadataPtr* TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const { 6027 if( ptr == _ptr ) return this; 6028 return make(ptr, metadata(), _offset); 6029 } 6030 6031 //------------------------------meet------------------------------------------- 6032 // Compute the MEET of two types. It returns a new Type object. 6033 const Type *TypeMetadataPtr::xmeet( const Type *t ) const { 6034 // Perform a fast test for common case; meeting the same types together. 6035 if( this == t ) return this; // Meeting same type-rep? 6036 6037 // Current "this->_base" is OopPtr 6038 switch (t->base()) { // switch on original type 6039 6040 case Int: // Mixing ints & oops happens when javac 6041 case Long: // reuses local variables 6042 case HalfFloatTop: 6043 case HalfFloatCon: 6044 case HalfFloatBot: 6045 case FloatTop: 6046 case FloatCon: 6047 case FloatBot: 6048 case DoubleTop: 6049 case DoubleCon: 6050 case DoubleBot: 6051 case NarrowOop: 6052 case NarrowKlass: 6053 case Bottom: // Ye Olde Default 6054 return Type::BOTTOM; 6055 case Top: 6056 return this; 6057 6058 default: // All else is a mistake 6059 typerr(t); 6060 6061 case AnyPtr: { 6062 // Found an AnyPtr type vs self-OopPtr type 6063 const TypePtr *tp = t->is_ptr(); 6064 Offset offset = meet_offset(tp->offset()); 6065 PTR ptr = meet_ptr(tp->ptr()); 6066 switch (tp->ptr()) { 6067 case Null: 6068 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6069 // else fall through: 6070 case TopPTR: 6071 case AnyNull: { 6072 return make(ptr, _metadata, offset); 6073 } 6074 case BotPTR: 6075 case NotNull: 6076 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6077 default: typerr(t); 6078 } 6079 } 6080 6081 case RawPtr: 6082 case KlassPtr: 6083 case InstKlassPtr: 6084 case AryKlassPtr: 6085 case OopPtr: 6086 case InstPtr: 6087 case AryPtr: 6088 return TypePtr::BOTTOM; // Oop meet raw is not well defined 6089 6090 case MetadataPtr: { 6091 const TypeMetadataPtr *tp = t->is_metadataptr(); 6092 Offset offset = meet_offset(tp->offset()); 6093 PTR tptr = tp->ptr(); 6094 PTR ptr = meet_ptr(tptr); 6095 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata(); 6096 if (tptr == TopPTR || _ptr == TopPTR || 6097 metadata()->equals(tp->metadata())) { 6098 return make(ptr, md, offset); 6099 } 6100 // metadata is different 6101 if( ptr == Constant ) { // Cannot be equal constants, so... 6102 if( tptr == Constant && _ptr != Constant) return t; 6103 if( _ptr == Constant && tptr != Constant) return this; 6104 ptr = NotNull; // Fall down in lattice 6105 } 6106 return make(ptr, nullptr, offset); 6107 break; 6108 } 6109 } // End of switch 6110 return this; // Return the double constant 6111 } 6112 6113 6114 //------------------------------xdual------------------------------------------ 6115 // Dual of a pure metadata pointer. 6116 const Type *TypeMetadataPtr::xdual() const { 6117 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset()); 6118 } 6119 6120 //------------------------------dump2------------------------------------------ 6121 #ifndef PRODUCT 6122 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const { 6123 st->print("metadataptr:%s", ptr_msg[_ptr]); 6124 if (metadata() != nullptr) { 6125 st->print(":" INTPTR_FORMAT, p2i(metadata())); 6126 } 6127 dump_offset(st); 6128 } 6129 #endif 6130 6131 6132 //============================================================================= 6133 // Convenience common pre-built type. 6134 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM; 6135 6136 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, Offset offset): 6137 TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) { 6138 } 6139 6140 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) { 6141 return make(Constant, m, Offset(0)); 6142 } 6143 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) { 6144 return make(Constant, m, Offset(0)); 6145 } 6146 6147 //------------------------------make------------------------------------------- 6148 // Create a meta data constant 6149 const TypeMetadataPtr* TypeMetadataPtr::make(PTR ptr, ciMetadata* m, Offset offset) { 6150 assert(m == nullptr || !m->is_klass(), "wrong type"); 6151 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons(); 6152 } 6153 6154 6155 const TypeKlassPtr* TypeAryPtr::as_klass_type(bool try_for_exact) const { 6156 const Type* elem = _ary->_elem; 6157 bool xk = klass_is_exact(); 6158 bool is_refined = false; 6159 if (elem->make_oopptr() != nullptr) { 6160 is_refined = true; 6161 elem = elem->make_oopptr()->as_klass_type(try_for_exact); 6162 if (elem->isa_aryklassptr()) { 6163 const TypeAryKlassPtr* elem_klass = elem->is_aryklassptr(); 6164 if (elem_klass->is_refined_type()) { 6165 elem = elem_klass->cast_to_non_refined(); 6166 } 6167 } else { 6168 const TypeInstKlassPtr* elem_klass = elem->is_instklassptr(); 6169 if (try_for_exact && !xk && elem_klass->klass_is_exact() && 6170 !elem_klass->exact_klass()->as_instance_klass()->can_be_inline_klass()) { 6171 xk = true; 6172 } 6173 } 6174 } 6175 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); 6176 } 6177 6178 const TypeKlassPtr* TypeKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) { 6179 if (klass->is_instance_klass()) { 6180 return TypeInstKlassPtr::make(klass, interface_handling); 6181 } 6182 return TypeAryKlassPtr::make(klass, interface_handling); 6183 } 6184 6185 TypeKlassPtr::TypeKlassPtr(TYPES t, PTR ptr, ciKlass* klass, const TypeInterfaces* interfaces, Offset offset) 6186 : TypePtr(t, ptr, offset), _klass(klass), _interfaces(interfaces) { 6187 assert(klass == nullptr || !klass->is_loaded() || (klass->is_instance_klass() && !klass->is_interface()) || 6188 klass->is_type_array_klass() || klass->is_flat_array_klass() || !klass->as_obj_array_klass()->base_element_klass()->is_interface(), "no interface here"); 6189 } 6190 6191 // Is there a single ciKlass* that can represent that type? 6192 ciKlass* TypeKlassPtr::exact_klass_helper() const { 6193 assert(_klass->is_instance_klass() && !_klass->is_interface(), "No interface"); 6194 if (_interfaces->empty()) { 6195 return _klass; 6196 } 6197 if (_klass != ciEnv::current()->Object_klass()) { 6198 if (_interfaces->eq(_klass->as_instance_klass())) { 6199 return _klass; 6200 } 6201 return nullptr; 6202 } 6203 return _interfaces->exact_klass(); 6204 } 6205 6206 //------------------------------eq--------------------------------------------- 6207 // Structural equality check for Type representations 6208 bool TypeKlassPtr::eq(const Type *t) const { 6209 const TypeKlassPtr *p = t->is_klassptr(); 6210 return 6211 _interfaces->eq(p->_interfaces) && 6212 TypePtr::eq(p); 6213 } 6214 6215 //------------------------------hash------------------------------------------- 6216 // Type-specific hashing function. 6217 uint TypeKlassPtr::hash(void) const { 6218 return TypePtr::hash() + _interfaces->hash(); 6219 } 6220 6221 //------------------------------singleton-------------------------------------- 6222 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 6223 // constants 6224 bool TypeKlassPtr::singleton(void) const { 6225 // detune optimizer to not generate constant klass + constant offset as a constant! 6226 // TopPTR, Null, AnyNull, Constant are all singletons 6227 return (offset() == 0) && !below_centerline(_ptr); 6228 } 6229 6230 // Do not allow interface-vs.-noninterface joins to collapse to top. 6231 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const { 6232 // logic here mirrors the one from TypeOopPtr::filter. See comments 6233 // there. 6234 const Type* ft = join_helper(kills, include_speculative); 6235 6236 if (ft->empty()) { 6237 return Type::TOP; // Canonical empty value 6238 } 6239 6240 return ft; 6241 } 6242 6243 const TypeInterfaces* TypeKlassPtr::meet_interfaces(const TypeKlassPtr* other) const { 6244 if (above_centerline(_ptr) && above_centerline(other->_ptr)) { 6245 return _interfaces->union_with(other->_interfaces); 6246 } else if (above_centerline(_ptr) && !above_centerline(other->_ptr)) { 6247 return other->_interfaces; 6248 } else if (above_centerline(other->_ptr) && !above_centerline(_ptr)) { 6249 return _interfaces; 6250 } 6251 return _interfaces->intersection_with(other->_interfaces); 6252 } 6253 6254 //------------------------------get_con---------------------------------------- 6255 intptr_t TypeKlassPtr::get_con() const { 6256 assert( _ptr == Null || _ptr == Constant, "" ); 6257 assert( offset() >= 0, "" ); 6258 6259 if (offset() != 0) { 6260 // After being ported to the compiler interface, the compiler no longer 6261 // directly manipulates the addresses of oops. Rather, it only has a pointer 6262 // to a handle at compile time. This handle is embedded in the generated 6263 // code and dereferenced at the time the nmethod is made. Until that time, 6264 // it is not reasonable to do arithmetic with the addresses of oops (we don't 6265 // have access to the addresses!). This does not seem to currently happen, 6266 // but this assertion here is to help prevent its occurrence. 6267 tty->print_cr("Found oop constant with non-zero offset"); 6268 ShouldNotReachHere(); 6269 } 6270 6271 ciKlass* k = exact_klass(); 6272 6273 return (intptr_t)k->constant_encoding(); 6274 } 6275 6276 //============================================================================= 6277 // Convenience common pre-built types. 6278 6279 // Not-null object klass or below 6280 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT; 6281 const TypeInstKlassPtr *TypeInstKlassPtr::OBJECT_OR_NULL; 6282 6283 bool TypeInstKlassPtr::eq(const Type *t) const { 6284 const TypeInstKlassPtr* p = t->is_instklassptr(); 6285 return 6286 klass()->equals(p->klass()) && 6287 _flat_in_array == p->_flat_in_array && 6288 TypeKlassPtr::eq(p); 6289 } 6290 6291 uint TypeInstKlassPtr::hash() const { 6292 return klass()->hash() + TypeKlassPtr::hash() + static_cast<uint>(_flat_in_array); 6293 } 6294 6295 const TypeInstKlassPtr *TypeInstKlassPtr::make(PTR ptr, ciKlass* k, const TypeInterfaces* interfaces, Offset offset, FlatInArray flat_in_array) { 6296 if (flat_in_array == Uninitialized) { 6297 flat_in_array = compute_flat_in_array(k->as_instance_klass(), ptr == Constant); 6298 } 6299 TypeInstKlassPtr *r = 6300 (TypeInstKlassPtr*)(new TypeInstKlassPtr(ptr, k, interfaces, offset, flat_in_array))->hashcons(); 6301 6302 return r; 6303 } 6304 6305 bool TypeInstKlassPtr::empty() const { 6306 if (_flat_in_array == TopFlat) { 6307 return true; 6308 } 6309 return TypeKlassPtr::empty(); 6310 } 6311 6312 //------------------------------add_offset------------------------------------- 6313 // Access internals of klass object 6314 const TypePtr *TypeInstKlassPtr::add_offset( intptr_t offset ) const { 6315 return make(_ptr, klass(), _interfaces, xadd_offset(offset), _flat_in_array); 6316 } 6317 6318 const TypeInstKlassPtr* TypeInstKlassPtr::with_offset(intptr_t offset) const { 6319 return make(_ptr, klass(), _interfaces, Offset(offset), _flat_in_array); 6320 } 6321 6322 //------------------------------cast_to_ptr_type------------------------------- 6323 const TypeInstKlassPtr* TypeInstKlassPtr::cast_to_ptr_type(PTR ptr) const { 6324 assert(_base == InstKlassPtr, "subclass must override cast_to_ptr_type"); 6325 if( ptr == _ptr ) return this; 6326 return make(ptr, _klass, _interfaces, _offset, _flat_in_array); 6327 } 6328 6329 6330 bool TypeInstKlassPtr::must_be_exact() const { 6331 if (!_klass->is_loaded()) return false; 6332 ciInstanceKlass* ik = _klass->as_instance_klass(); 6333 if (ik->is_final()) return true; // cannot clear xk 6334 return false; 6335 } 6336 6337 //-----------------------------cast_to_exactness------------------------------- 6338 const TypeKlassPtr* TypeInstKlassPtr::cast_to_exactness(bool klass_is_exact) const { 6339 if (klass_is_exact == (_ptr == Constant)) return this; 6340 if (must_be_exact()) return this; 6341 ciKlass* k = klass(); 6342 FlatInArray flat_in_array = compute_flat_in_array(k->as_instance_klass(), klass_is_exact); 6343 return make(klass_is_exact ? Constant : NotNull, k, _interfaces, _offset, flat_in_array); 6344 } 6345 6346 6347 //-----------------------------as_instance_type-------------------------------- 6348 // Corresponding type for an instance of the given class. 6349 // It will be NotNull, and exact if and only if the klass type is exact. 6350 const TypeOopPtr* TypeInstKlassPtr::as_instance_type(bool klass_change) const { 6351 ciKlass* k = klass(); 6352 bool xk = klass_is_exact(); 6353 Compile* C = Compile::current(); 6354 Dependencies* deps = C->dependencies(); 6355 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); 6356 // Element is an instance 6357 bool klass_is_exact = false; 6358 const TypeInterfaces* interfaces = _interfaces; 6359 ciInstanceKlass* ik = k->as_instance_klass(); 6360 if (k->is_loaded()) { 6361 // Try to set klass_is_exact. 6362 klass_is_exact = ik->is_final(); 6363 if (!klass_is_exact && klass_change 6364 && deps != nullptr && UseUniqueSubclasses) { 6365 ciInstanceKlass* sub = ik->unique_concrete_subklass(); 6366 if (sub != nullptr) { 6367 if (_interfaces->eq(sub)) { 6368 deps->assert_abstract_with_unique_concrete_subtype(ik, sub); 6369 k = ik = sub; 6370 xk = sub->is_final(); 6371 } 6372 } 6373 } 6374 } 6375 6376 FlatInArray flat_in_array = compute_flat_in_array_if_unknown(ik, xk, _flat_in_array); 6377 return TypeInstPtr::make(TypePtr::BotPTR, k, interfaces, xk, nullptr, Offset(0), flat_in_array); 6378 } 6379 6380 //------------------------------xmeet------------------------------------------ 6381 // Compute the MEET of two types, return a new Type object. 6382 const Type *TypeInstKlassPtr::xmeet( const Type *t ) const { 6383 // Perform a fast test for common case; meeting the same types together. 6384 if( this == t ) return this; // Meeting same type-rep? 6385 6386 // Current "this->_base" is Pointer 6387 switch (t->base()) { // switch on original type 6388 6389 case Int: // Mixing ints & oops happens when javac 6390 case Long: // reuses local variables 6391 case HalfFloatTop: 6392 case HalfFloatCon: 6393 case HalfFloatBot: 6394 case FloatTop: 6395 case FloatCon: 6396 case FloatBot: 6397 case DoubleTop: 6398 case DoubleCon: 6399 case DoubleBot: 6400 case NarrowOop: 6401 case NarrowKlass: 6402 case Bottom: // Ye Olde Default 6403 return Type::BOTTOM; 6404 case Top: 6405 return this; 6406 6407 default: // All else is a mistake 6408 typerr(t); 6409 6410 case AnyPtr: { // Meeting to AnyPtrs 6411 // Found an AnyPtr type vs self-KlassPtr type 6412 const TypePtr *tp = t->is_ptr(); 6413 Offset offset = meet_offset(tp->offset()); 6414 PTR ptr = meet_ptr(tp->ptr()); 6415 switch (tp->ptr()) { 6416 case TopPTR: 6417 return this; 6418 case Null: 6419 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6420 case AnyNull: 6421 return make(ptr, klass(), _interfaces, offset, _flat_in_array); 6422 case BotPTR: 6423 case NotNull: 6424 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6425 default: typerr(t); 6426 } 6427 } 6428 6429 case RawPtr: 6430 case MetadataPtr: 6431 case OopPtr: 6432 case AryPtr: // Meet with AryPtr 6433 case InstPtr: // Meet with InstPtr 6434 return TypePtr::BOTTOM; 6435 6436 // 6437 // A-top } 6438 // / | \ } Tops 6439 // B-top A-any C-top } 6440 // | / | \ | } Any-nulls 6441 // B-any | C-any } 6442 // | | | 6443 // B-con A-con C-con } constants; not comparable across classes 6444 // | | | 6445 // B-not | C-not } 6446 // | \ | / | } not-nulls 6447 // B-bot A-not C-bot } 6448 // \ | / } Bottoms 6449 // A-bot } 6450 // 6451 6452 case InstKlassPtr: { // Meet two KlassPtr types 6453 const TypeInstKlassPtr *tkls = t->is_instklassptr(); 6454 Offset off = meet_offset(tkls->offset()); 6455 PTR ptr = meet_ptr(tkls->ptr()); 6456 const TypeInterfaces* interfaces = meet_interfaces(tkls); 6457 6458 ciKlass* res_klass = nullptr; 6459 bool res_xk = false; 6460 const FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, tkls->flat_in_array()); 6461 switch (meet_instptr(ptr, interfaces, this, tkls, res_klass, res_xk)) { 6462 case UNLOADED: 6463 ShouldNotReachHere(); 6464 case SUBTYPE: 6465 case NOT_SUBTYPE: 6466 case LCA: 6467 case QUICK: { 6468 assert(res_xk == (ptr == Constant), ""); 6469 const Type* res = make(ptr, res_klass, interfaces, off, flat_in_array); 6470 return res; 6471 } 6472 default: 6473 ShouldNotReachHere(); 6474 } 6475 } // End of case KlassPtr 6476 case AryKlassPtr: { // All arrays inherit from Object class 6477 const TypeAryKlassPtr *tp = t->is_aryklassptr(); 6478 Offset offset = meet_offset(tp->offset()); 6479 PTR ptr = meet_ptr(tp->ptr()); 6480 const TypeInterfaces* interfaces = meet_interfaces(tp); 6481 const TypeInterfaces* tp_interfaces = tp->_interfaces; 6482 const TypeInterfaces* this_interfaces = _interfaces; 6483 6484 switch (ptr) { 6485 case TopPTR: 6486 case AnyNull: // Fall 'down' to dual of object klass 6487 // For instances when a subclass meets a superclass we fall 6488 // below the centerline when the superclass is exact. We need to 6489 // do the same here. 6490 // 6491 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 6492 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && 6493 !klass_is_exact() && !is_not_flat_in_array()) { 6494 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()); 6495 } else { 6496 // cannot subclass, so the meet has to fall badly below the centerline 6497 ptr = NotNull; 6498 interfaces = _interfaces->intersection_with(tp->_interfaces); 6499 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat); 6500 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array); 6501 } 6502 case Constant: 6503 case NotNull: 6504 case BotPTR: { // Fall down to object klass 6505 // LCA is object_klass, but if we subclass from the top we can do better 6506 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull ) 6507 // If 'this' (InstPtr) is above the centerline and it is Object class 6508 // then we can subclass in the Java class hierarchy. 6509 // For instances when a subclass meets a superclass we fall 6510 // below the centerline when the superclass is exact. We need 6511 // to do the same here. 6512 // 6513 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 6514 if (klass()->equals(ciEnv::current()->Object_klass()) && tp_interfaces->contains(this_interfaces) && 6515 !klass_is_exact() && !is_not_flat_in_array()) { 6516 // that is, tp's array type is a subtype of my klass 6517 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()); 6518 } 6519 } 6520 // The other case cannot happen, since I cannot be a subtype of an array. 6521 // The meet falls down to Object class below centerline. 6522 if( ptr == Constant ) 6523 ptr = NotNull; 6524 interfaces = this_interfaces->intersection_with(tp_interfaces); 6525 FlatInArray flat_in_array = meet_flat_in_array(_flat_in_array, NotFlat); 6526 return make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array); 6527 } 6528 default: typerr(t); 6529 } 6530 } 6531 6532 } // End of switch 6533 return this; // Return the double constant 6534 } 6535 6536 //------------------------------xdual------------------------------------------ 6537 // Dual: compute field-by-field dual 6538 const Type* TypeInstKlassPtr::xdual() const { 6539 return new TypeInstKlassPtr(dual_ptr(), klass(), _interfaces, dual_offset(), dual_flat_in_array()); 6540 } 6541 6542 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) { 6543 static_assert(std::is_base_of<T2, T1>::value, ""); 6544 if (!this_one->is_loaded() || !other->is_loaded()) { 6545 return false; 6546 } 6547 if (!this_one->is_instance_type(other)) { 6548 return false; 6549 } 6550 6551 if (!other_exact) { 6552 return false; 6553 } 6554 6555 if (other->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->empty()) { 6556 return true; 6557 } 6558 6559 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces); 6560 } 6561 6562 bool TypeInstKlassPtr::might_be_an_array() const { 6563 if (!instance_klass()->is_java_lang_Object()) { 6564 // TypeInstKlassPtr can be an array only if it is java.lang.Object: the only supertype of array types. 6565 return false; 6566 } 6567 if (interfaces()->has_non_array_interface()) { 6568 // Arrays only implement Cloneable and Serializable. If we see any other interface, [this] cannot be an array. 6569 return false; 6570 } 6571 // Cannot prove it's not an array. 6572 return true; 6573 } 6574 6575 bool TypeInstKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 6576 return TypePtr::is_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 6577 } 6578 6579 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_instance(const T1* this_one, const T2* other) { 6580 static_assert(std::is_base_of<T2, T1>::value, ""); 6581 if (!this_one->is_loaded() || !other->is_loaded()) { 6582 return false; 6583 } 6584 if (!this_one->is_instance_type(other)) { 6585 return false; 6586 } 6587 return this_one->klass()->equals(other->klass()) && this_one->_interfaces->eq(other->_interfaces); 6588 } 6589 6590 bool TypeInstKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const { 6591 return TypePtr::is_same_java_type_as_helper_for_instance(this, other); 6592 } 6593 6594 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) { 6595 static_assert(std::is_base_of<T2, T1>::value, ""); 6596 if (!this_one->is_loaded() || !other->is_loaded()) { 6597 return true; 6598 } 6599 6600 if (this_one->is_array_type(other)) { 6601 return !this_exact && this_one->klass()->equals(ciEnv::current()->Object_klass()) && other->_interfaces->contains(this_one->_interfaces); 6602 } 6603 6604 assert(this_one->is_instance_type(other), "unsupported"); 6605 6606 if (this_exact && other_exact) { 6607 return this_one->is_java_subtype_of(other); 6608 } 6609 6610 if (!this_one->klass()->is_subtype_of(other->klass()) && !other->klass()->is_subtype_of(this_one->klass())) { 6611 return false; 6612 } 6613 6614 if (this_exact) { 6615 return this_one->klass()->is_subtype_of(other->klass()) && this_one->_interfaces->contains(other->_interfaces); 6616 } 6617 6618 return true; 6619 } 6620 6621 bool TypeInstKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 6622 return TypePtr::maybe_java_subtype_of_helper_for_instance(this, other, this_exact, other_exact); 6623 } 6624 6625 const TypeKlassPtr* TypeInstKlassPtr::try_improve() const { 6626 if (!UseUniqueSubclasses) { 6627 return this; 6628 } 6629 ciKlass* k = klass(); 6630 Compile* C = Compile::current(); 6631 Dependencies* deps = C->dependencies(); 6632 assert((deps != nullptr) == (C->method() != nullptr && C->method()->code_size() > 0), "sanity"); 6633 if (k->is_loaded()) { 6634 ciInstanceKlass* ik = k->as_instance_klass(); 6635 if (deps != nullptr) { 6636 ciInstanceKlass* sub = ik->unique_concrete_subklass(); 6637 if (sub != nullptr) { 6638 bool improve_to_exact = sub->is_final() && _ptr == NotNull; 6639 const TypeInstKlassPtr* improved = TypeInstKlassPtr::make(improve_to_exact ? Constant : _ptr, sub, _offset); 6640 if (improved->_interfaces->contains(_interfaces)) { 6641 deps->assert_abstract_with_unique_concrete_subtype(ik, sub); 6642 return improved; 6643 } 6644 } 6645 } 6646 } 6647 return this; 6648 } 6649 6650 bool TypeInstKlassPtr::can_be_inline_array() const { 6651 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryKlassPtr::_array_interfaces->contains(_interfaces); 6652 } 6653 6654 #ifndef PRODUCT 6655 void TypeInstKlassPtr::dump2(Dict& d, uint depth, outputStream* st) const { 6656 st->print("instklassptr:"); 6657 klass()->print_name_on(st); 6658 _interfaces->dump(st); 6659 st->print(":%s", ptr_msg[_ptr]); 6660 dump_offset(st); 6661 dump_flat_in_array(_flat_in_array, st); 6662 } 6663 #endif // PRODUCT 6664 6665 bool TypeAryKlassPtr::can_be_inline_array() const { 6666 return _elem->isa_instklassptr() && _elem->is_instklassptr()->_klass->can_be_inline_klass(); 6667 } 6668 6669 bool TypeInstPtr::can_be_inline_array() const { 6670 return _klass->equals(ciEnv::current()->Object_klass()) && TypeAryPtr::_array_interfaces->contains(_interfaces); 6671 } 6672 6673 bool TypeAryPtr::can_be_inline_array() const { 6674 return elem()->make_ptr() && elem()->make_ptr()->isa_instptr() && elem()->make_ptr()->is_instptr()->_klass->can_be_inline_klass(); 6675 } 6676 6677 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) { 6678 return (TypeAryKlassPtr*)(new TypeAryKlassPtr(ptr, elem, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type))->hashcons(); 6679 } 6680 6681 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) { 6682 const Type* etype; 6683 if (k->is_obj_array_klass()) { 6684 // Element is an object array. Recursively call ourself. 6685 ciKlass* eklass = k->as_obj_array_klass()->element_klass(); 6686 etype = TypeKlassPtr::make(eklass, interface_handling)->cast_to_exactness(false); 6687 k = nullptr; 6688 } else if (k->is_type_array_klass()) { 6689 // Element is an typeArray 6690 etype = get_const_basic_type(k->as_type_array_klass()->element_type()); 6691 } else { 6692 ShouldNotReachHere(); 6693 } 6694 6695 return TypeAryKlassPtr::make(ptr, etype, k, offset, not_flat, not_null_free, flat, null_free, atomic, refined_type); 6696 } 6697 6698 const TypeAryKlassPtr* TypeAryKlassPtr::make(ciKlass* klass, InterfaceHandling interface_handling) { 6699 ciArrayKlass* k = klass->as_array_klass(); 6700 if (k->is_refined()) { 6701 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, !k->is_flat_array_klass(), !k->is_elem_null_free(), 6702 k->is_flat_array_klass(), k->is_elem_null_free(), k->is_elem_atomic(), true); 6703 } else { 6704 // Use the default combination to canonicalize all non-refined klass pointers 6705 return TypeAryKlassPtr::make(Constant, k, Offset(0), interface_handling, true, true, false, false, true, false); 6706 } 6707 } 6708 6709 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_non_refined() const { 6710 assert(is_refined_type(), "must be a refined type"); 6711 PTR ptr = _ptr; 6712 // There can be multiple refined array types corresponding to a single unrefined type 6713 if (ptr == NotNull && elem()->is_klassptr()->klass_is_exact()) { 6714 ptr = Constant; 6715 } 6716 return make(ptr, elem(), nullptr, _offset, true, true, false, false, true, false); 6717 } 6718 6719 // Get the (non-)refined array klass ptr 6720 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_refined_array_klass_ptr(bool refined) const { 6721 if ((refined == is_refined_type()) || !klass_is_exact() || !exact_klass()->is_obj_array_klass()) { 6722 return this; 6723 } 6724 ciArrayKlass* k = exact_klass()->as_array_klass(); 6725 k = ciObjArrayKlass::make(k->element_klass(), refined); 6726 return make(k, trust_interfaces); 6727 } 6728 6729 //------------------------------eq--------------------------------------------- 6730 // Structural equality check for Type representations 6731 bool TypeAryKlassPtr::eq(const Type *t) const { 6732 const TypeAryKlassPtr *p = t->is_aryklassptr(); 6733 return 6734 _elem == p->_elem && // Check array 6735 _flat == p->_flat && 6736 _not_flat == p->_not_flat && 6737 _null_free == p->_null_free && 6738 _not_null_free == p->_not_null_free && 6739 _atomic == p->_atomic && 6740 _refined_type == p->_refined_type && 6741 TypeKlassPtr::eq(p); // Check sub-parts 6742 } 6743 6744 //------------------------------hash------------------------------------------- 6745 // Type-specific hashing function. 6746 uint TypeAryKlassPtr::hash(void) const { 6747 return (uint)(uintptr_t)_elem + TypeKlassPtr::hash() + (uint)(_not_flat ? 43 : 0) + 6748 (uint)(_not_null_free ? 44 : 0) + (uint)(_flat ? 45 : 0) + (uint)(_null_free ? 46 : 0) + (uint)(_atomic ? 47 : 0) + (uint)(_refined_type ? 48 : 0); 6749 } 6750 6751 //----------------------compute_klass------------------------------------------ 6752 // Compute the defining klass for this class 6753 ciKlass* TypeAryPtr::compute_klass() const { 6754 // Compute _klass based on element type. 6755 ciKlass* k_ary = nullptr; 6756 const TypeInstPtr *tinst; 6757 const TypeAryPtr *tary; 6758 const Type* el = elem(); 6759 if (el->isa_narrowoop()) { 6760 el = el->make_ptr(); 6761 } 6762 6763 // Get element klass 6764 if ((tinst = el->isa_instptr()) != nullptr) { 6765 // Leave k_ary at nullptr. 6766 } else if ((tary = el->isa_aryptr()) != nullptr) { 6767 // Leave k_ary at nullptr. 6768 } else if ((el->base() == Type::Top) || 6769 (el->base() == Type::Bottom)) { 6770 // element type of Bottom occurs from meet of basic type 6771 // and object; Top occurs when doing join on Bottom. 6772 // Leave k_ary at null. 6773 } else { 6774 assert(!el->isa_int(), "integral arrays must be pre-equipped with a class"); 6775 // Compute array klass directly from basic type 6776 k_ary = ciTypeArrayKlass::make(el->basic_type()); 6777 } 6778 return k_ary; 6779 } 6780 6781 //------------------------------klass------------------------------------------ 6782 // Return the defining klass for this class 6783 ciKlass* TypeAryPtr::klass() const { 6784 if( _klass ) return _klass; // Return cached value, if possible 6785 6786 // Oops, need to compute _klass and cache it 6787 ciKlass* k_ary = compute_klass(); 6788 6789 if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) { 6790 // The _klass field acts as a cache of the underlying 6791 // ciKlass for this array type. In order to set the field, 6792 // we need to cast away const-ness. 6793 // 6794 // IMPORTANT NOTE: we *never* set the _klass field for the 6795 // type TypeAryPtr::OOPS. This Type is shared between all 6796 // active compilations. However, the ciKlass which represents 6797 // this Type is *not* shared between compilations, so caching 6798 // this value would result in fetching a dangling pointer. 6799 // 6800 // Recomputing the underlying ciKlass for each request is 6801 // a bit less efficient than caching, but calls to 6802 // TypeAryPtr::OOPS->klass() are not common enough to matter. 6803 ((TypeAryPtr*)this)->_klass = k_ary; 6804 } 6805 return k_ary; 6806 } 6807 6808 // Is there a single ciKlass* that can represent that type? 6809 ciKlass* TypeAryPtr::exact_klass_helper() const { 6810 if (_ary->_elem->make_ptr() && _ary->_elem->make_ptr()->isa_oopptr()) { 6811 ciKlass* k = _ary->_elem->make_ptr()->is_oopptr()->exact_klass_helper(); 6812 if (k == nullptr) { 6813 return nullptr; 6814 } 6815 if (k->is_array_klass() && k->as_array_klass()->is_refined()) { 6816 // We have no mechanism to create an array of refined arrays 6817 k = ciObjArrayKlass::make(k->as_array_klass()->element_klass(), false); 6818 } 6819 if (klass_is_exact()) { 6820 return ciObjArrayKlass::make(k, true, is_null_free(), is_atomic()); 6821 } else { 6822 // We may reach here if called recursively, must be an unrefined type then 6823 return ciObjArrayKlass::make(k, false); 6824 } 6825 } 6826 6827 return klass(); 6828 } 6829 6830 const Type* TypeAryPtr::base_element_type(int& dims) const { 6831 const Type* elem = this->elem(); 6832 dims = 1; 6833 while (elem->make_ptr() && elem->make_ptr()->isa_aryptr()) { 6834 elem = elem->make_ptr()->is_aryptr()->elem(); 6835 dims++; 6836 } 6837 return elem; 6838 } 6839 6840 //------------------------------add_offset------------------------------------- 6841 // Access internals of klass object 6842 const TypePtr* TypeAryKlassPtr::add_offset(intptr_t offset) const { 6843 return make(_ptr, elem(), klass(), xadd_offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type); 6844 } 6845 6846 const TypeAryKlassPtr* TypeAryKlassPtr::with_offset(intptr_t offset) const { 6847 return make(_ptr, elem(), klass(), Offset(offset), is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type); 6848 } 6849 6850 //------------------------------cast_to_ptr_type------------------------------- 6851 const TypeAryKlassPtr* TypeAryKlassPtr::cast_to_ptr_type(PTR ptr) const { 6852 assert(_base == AryKlassPtr, "subclass must override cast_to_ptr_type"); 6853 if (ptr == _ptr) return this; 6854 return make(ptr, elem(), _klass, _offset, is_not_flat(), is_not_null_free(), _flat, _null_free, _atomic, _refined_type); 6855 } 6856 6857 bool TypeAryKlassPtr::must_be_exact() const { 6858 assert(klass_is_exact(), "precondition"); 6859 if (_elem == Type::BOTTOM || _elem == Type::TOP) { 6860 return false; 6861 } 6862 const TypeKlassPtr* elem = _elem->isa_klassptr(); 6863 if (elem == nullptr) { 6864 // primitive arrays 6865 return true; 6866 } 6867 6868 // refined types are final 6869 return _refined_type; 6870 } 6871 6872 //-----------------------------cast_to_exactness------------------------------- 6873 const TypeKlassPtr *TypeAryKlassPtr::cast_to_exactness(bool klass_is_exact) const { 6874 if (klass_is_exact == this->klass_is_exact()) { 6875 return this; 6876 } 6877 if (!klass_is_exact && must_be_exact()) { 6878 return this; 6879 } 6880 const Type* elem = this->elem(); 6881 if (elem->isa_klassptr() && !klass_is_exact) { 6882 elem = elem->is_klassptr()->cast_to_exactness(klass_is_exact); 6883 } 6884 6885 if (klass_is_exact) { 6886 // cast_to_exactness(true) really means get the LCA of all values represented by this 6887 // TypeAryKlassPtr. As a result, it must be an unrefined klass pointer. 6888 return make(Constant, elem, nullptr, _offset, true, true, false, false, true, false); 6889 } else { 6890 // cast_to_exactness(false) means get the TypeAryKlassPtr representing all values that subtype 6891 // this value 6892 bool not_inline = !_elem->isa_instklassptr() || !_elem->is_instklassptr()->instance_klass()->can_be_inline_klass(); 6893 bool not_flat = !UseArrayFlattening || not_inline || 6894 (_elem->isa_instklassptr() && _elem->is_instklassptr()->instance_klass()->is_inlinetype() && !_elem->is_instklassptr()->instance_klass()->maybe_flat_in_array()); 6895 bool not_null_free = not_inline; 6896 bool atomic = not_flat; 6897 return make(NotNull, elem, nullptr, _offset, not_flat, not_null_free, false, false, atomic, false); 6898 } 6899 } 6900 6901 //-----------------------------as_instance_type-------------------------------- 6902 // Corresponding type for an instance of the given class. 6903 // It will be NotNull, and exact if and only if the klass type is exact. 6904 const TypeOopPtr* TypeAryKlassPtr::as_instance_type(bool klass_change) const { 6905 ciKlass* k = klass(); 6906 bool xk = klass_is_exact(); 6907 const Type* el = nullptr; 6908 if (elem()->isa_klassptr()) { 6909 el = elem()->is_klassptr()->as_instance_type(false)->cast_to_exactness(false); 6910 k = nullptr; 6911 } else { 6912 el = elem(); 6913 } 6914 bool null_free = _null_free; 6915 if (null_free && el->isa_ptr()) { 6916 el = el->is_ptr()->join_speculative(TypePtr::NOTNULL); 6917 } 6918 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)); 6919 } 6920 6921 6922 //------------------------------xmeet------------------------------------------ 6923 // Compute the MEET of two types, return a new Type object. 6924 const Type *TypeAryKlassPtr::xmeet( const Type *t ) const { 6925 // Perform a fast test for common case; meeting the same types together. 6926 if( this == t ) return this; // Meeting same type-rep? 6927 6928 // Current "this->_base" is Pointer 6929 switch (t->base()) { // switch on original type 6930 6931 case Int: // Mixing ints & oops happens when javac 6932 case Long: // reuses local variables 6933 case HalfFloatTop: 6934 case HalfFloatCon: 6935 case HalfFloatBot: 6936 case FloatTop: 6937 case FloatCon: 6938 case FloatBot: 6939 case DoubleTop: 6940 case DoubleCon: 6941 case DoubleBot: 6942 case NarrowOop: 6943 case NarrowKlass: 6944 case Bottom: // Ye Olde Default 6945 return Type::BOTTOM; 6946 case Top: 6947 return this; 6948 6949 default: // All else is a mistake 6950 typerr(t); 6951 6952 case AnyPtr: { // Meeting to AnyPtrs 6953 // Found an AnyPtr type vs self-KlassPtr type 6954 const TypePtr *tp = t->is_ptr(); 6955 Offset offset = meet_offset(tp->offset()); 6956 PTR ptr = meet_ptr(tp->ptr()); 6957 switch (tp->ptr()) { 6958 case TopPTR: 6959 return this; 6960 case Null: 6961 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6962 case AnyNull: 6963 return make(ptr, _elem, klass(), offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type()); 6964 case BotPTR: 6965 case NotNull: 6966 return TypePtr::make(AnyPtr, ptr, offset, tp->speculative(), tp->inline_depth()); 6967 default: typerr(t); 6968 } 6969 } 6970 6971 case RawPtr: 6972 case MetadataPtr: 6973 case OopPtr: 6974 case AryPtr: // Meet with AryPtr 6975 case InstPtr: // Meet with InstPtr 6976 return TypePtr::BOTTOM; 6977 6978 // 6979 // A-top } 6980 // / | \ } Tops 6981 // B-top A-any C-top } 6982 // | / | \ | } Any-nulls 6983 // B-any | C-any } 6984 // | | | 6985 // B-con A-con C-con } constants; not comparable across classes 6986 // | | | 6987 // B-not | C-not } 6988 // | \ | / | } not-nulls 6989 // B-bot A-not C-bot } 6990 // \ | / } Bottoms 6991 // A-bot } 6992 // 6993 6994 case AryKlassPtr: { // Meet two KlassPtr types 6995 const TypeAryKlassPtr *tap = t->is_aryklassptr(); 6996 Offset off = meet_offset(tap->offset()); 6997 const Type* elem = _elem->meet(tap->_elem); 6998 PTR ptr = meet_ptr(tap->ptr()); 6999 ciKlass* res_klass = nullptr; 7000 bool res_xk = false; 7001 bool res_flat = false; 7002 bool res_not_flat = false; 7003 bool res_not_null_free = false; 7004 bool res_atomic = false; 7005 MeetResult res = meet_aryptr(ptr, elem, this, tap, 7006 res_klass, res_xk, res_flat, res_not_flat, res_not_null_free, res_atomic); 7007 assert(res_xk == (ptr == Constant), ""); 7008 bool flat = meet_flat(tap->_flat); 7009 bool null_free = meet_null_free(tap->_null_free); 7010 bool atomic = meet_atomic(tap->_atomic); 7011 bool refined_type = _refined_type && tap->_refined_type; 7012 if (res == NOT_SUBTYPE) { 7013 flat = false; 7014 null_free = false; 7015 atomic = false; 7016 refined_type = false; 7017 } else if (res == SUBTYPE) { 7018 if (above_centerline(tap->ptr()) && !above_centerline(this->ptr())) { 7019 flat = _flat; 7020 null_free = _null_free; 7021 atomic = _atomic; 7022 refined_type = _refined_type; 7023 } else if (above_centerline(this->ptr()) && !above_centerline(tap->ptr())) { 7024 flat = tap->_flat; 7025 null_free = tap->_null_free; 7026 atomic = tap->_atomic; 7027 refined_type = tap->_refined_type; 7028 } else if (above_centerline(this->ptr()) && above_centerline(tap->ptr())) { 7029 flat = _flat || tap->_flat; 7030 null_free = _null_free || tap->_null_free; 7031 atomic = _atomic || tap->_atomic; 7032 refined_type = _refined_type || tap->_refined_type; 7033 } else if (res_xk && _refined_type != tap->_refined_type) { 7034 // This can happen if the phi emitted by LibraryCallKit::load_default_refined_array_klass/load_non_refined_array_klass 7035 // is processed before the typeArray guard is folded. Both inputs are constant but the input corresponding to the 7036 // typeArray will go away. Don't constant fold it yet but wait for the control input to collapse. 7037 ptr = PTR::NotNull; 7038 } 7039 } 7040 return make(ptr, elem, res_klass, off, res_not_flat, res_not_null_free, flat, null_free, atomic, refined_type); 7041 } // End of case KlassPtr 7042 case InstKlassPtr: { 7043 const TypeInstKlassPtr *tp = t->is_instklassptr(); 7044 Offset offset = meet_offset(tp->offset()); 7045 PTR ptr = meet_ptr(tp->ptr()); 7046 const TypeInterfaces* interfaces = meet_interfaces(tp); 7047 const TypeInterfaces* tp_interfaces = tp->_interfaces; 7048 const TypeInterfaces* this_interfaces = _interfaces; 7049 7050 switch (ptr) { 7051 case TopPTR: 7052 case AnyNull: // Fall 'down' to dual of object klass 7053 // For instances when a subclass meets a superclass we fall 7054 // below the centerline when the superclass is exact. We need to 7055 // do the same here. 7056 // 7057 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 7058 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 7059 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 7060 return TypeAryKlassPtr::make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type()); 7061 } else { 7062 // cannot subclass, so the meet has to fall badly below the centerline 7063 ptr = NotNull; 7064 interfaces = this_interfaces->intersection_with(tp->_interfaces); 7065 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 7066 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array); 7067 } 7068 case Constant: 7069 case NotNull: 7070 case BotPTR: { // Fall down to object klass 7071 // LCA is object_klass, but if we subclass from the top we can do better 7072 if (above_centerline(tp->ptr())) { 7073 // If 'tp' is above the centerline and it is Object class 7074 // then we can subclass in the Java class hierarchy. 7075 // For instances when a subclass meets a superclass we fall 7076 // below the centerline when the superclass is exact. We need 7077 // to do the same here. 7078 // 7079 // Flat in array: See explanation for meet with TypeInstPtr in TypeAryPtr::xmeet_helper(). 7080 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && this_interfaces->contains(tp_interfaces) && 7081 !tp->klass_is_exact() && !tp->is_not_flat_in_array()) { 7082 // that is, my array type is a subtype of 'tp' klass 7083 return make(ptr, _elem, _klass, offset, is_not_flat(), is_not_null_free(), is_flat(), is_null_free(), is_atomic(), is_refined_type()); 7084 } 7085 } 7086 // The other case cannot happen, since t cannot be a subtype of an array. 7087 // The meet falls down to Object class below centerline. 7088 if (ptr == Constant) 7089 ptr = NotNull; 7090 interfaces = this_interfaces->intersection_with(tp_interfaces); 7091 FlatInArray flat_in_array = meet_flat_in_array(NotFlat, tp->flat_in_array()); 7092 return TypeInstKlassPtr::make(ptr, ciEnv::current()->Object_klass(), interfaces, offset, flat_in_array); 7093 } 7094 default: typerr(t); 7095 } 7096 } 7097 7098 } // End of switch 7099 return this; // Return the double constant 7100 } 7101 7102 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) { 7103 static_assert(std::is_base_of<T2, T1>::value, ""); 7104 7105 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) { 7106 return true; 7107 } 7108 7109 int dummy; 7110 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 7111 7112 if (!this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) { 7113 return false; 7114 } 7115 7116 if (this_one->is_instance_type(other)) { 7117 return other->klass() == ciEnv::current()->Object_klass() && this_one->_interfaces->contains(other->_interfaces) && 7118 other_exact; 7119 } 7120 7121 assert(this_one->is_array_type(other), ""); 7122 const T1* other_ary = this_one->is_array_type(other); 7123 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 7124 if (other_top_or_bottom) { 7125 return false; 7126 } 7127 7128 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 7129 const TypePtr* this_elem = this_one->elem()->make_ptr(); 7130 if (this_elem != nullptr && other_elem != nullptr) { 7131 if (other->is_null_free() && !this_one->is_null_free()) { 7132 return false; // A nullable array can't be a subtype of a null-free array 7133 } 7134 return this_one->is_reference_type(this_elem)->is_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact); 7135 } 7136 if (this_elem == nullptr && other_elem == nullptr) { 7137 return this_one->klass()->is_subtype_of(other->klass()); 7138 } 7139 return false; 7140 } 7141 7142 bool TypeAryKlassPtr::is_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 7143 return TypePtr::is_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 7144 } 7145 7146 template <class T1, class T2> bool TypePtr::is_same_java_type_as_helper_for_array(const T1* this_one, const T2* other) { 7147 static_assert(std::is_base_of<T2, T1>::value, ""); 7148 7149 int dummy; 7150 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 7151 7152 if (!this_one->is_array_type(other) || 7153 !this_one->is_loaded() || !other->is_loaded() || this_top_or_bottom) { 7154 return false; 7155 } 7156 const T1* other_ary = this_one->is_array_type(other); 7157 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 7158 7159 if (other_top_or_bottom) { 7160 return false; 7161 } 7162 7163 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 7164 const TypePtr* this_elem = this_one->elem()->make_ptr(); 7165 if (other_elem != nullptr && this_elem != nullptr) { 7166 return this_one->is_reference_type(this_elem)->is_same_java_type_as(this_one->is_reference_type(other_elem)); 7167 } 7168 if (other_elem == nullptr && this_elem == nullptr) { 7169 return this_one->klass()->equals(other->klass()); 7170 } 7171 return false; 7172 } 7173 7174 bool TypeAryKlassPtr::is_same_java_type_as_helper(const TypeKlassPtr* other) const { 7175 return TypePtr::is_same_java_type_as_helper_for_array(this, other); 7176 } 7177 7178 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) { 7179 static_assert(std::is_base_of<T2, T1>::value, ""); 7180 if (other->klass() == ciEnv::current()->Object_klass() && other->_interfaces->empty() && other_exact) { 7181 return true; 7182 } 7183 if (!this_one->is_loaded() || !other->is_loaded()) { 7184 return true; 7185 } 7186 if (this_one->is_instance_type(other)) { 7187 return other->klass()->equals(ciEnv::current()->Object_klass()) && 7188 this_one->_interfaces->contains(other->_interfaces); 7189 } 7190 7191 int dummy; 7192 bool this_top_or_bottom = (this_one->base_element_type(dummy) == Type::TOP || this_one->base_element_type(dummy) == Type::BOTTOM); 7193 if (this_top_or_bottom) { 7194 return true; 7195 } 7196 7197 assert(this_one->is_array_type(other), ""); 7198 7199 const T1* other_ary = this_one->is_array_type(other); 7200 bool other_top_or_bottom = (other_ary->base_element_type(dummy) == Type::TOP || other_ary->base_element_type(dummy) == Type::BOTTOM); 7201 if (other_top_or_bottom) { 7202 return true; 7203 } 7204 if (this_exact && other_exact) { 7205 return this_one->is_java_subtype_of(other); 7206 } 7207 7208 const TypePtr* this_elem = this_one->elem()->make_ptr(); 7209 const TypePtr* other_elem = other_ary->elem()->make_ptr(); 7210 if (other_elem != nullptr && this_elem != nullptr) { 7211 return this_one->is_reference_type(this_elem)->maybe_java_subtype_of_helper(this_one->is_reference_type(other_elem), this_exact, other_exact); 7212 } 7213 if (other_elem == nullptr && this_elem == nullptr) { 7214 return this_one->klass()->is_subtype_of(other->klass()); 7215 } 7216 return false; 7217 } 7218 7219 bool TypeAryKlassPtr::maybe_java_subtype_of_helper(const TypeKlassPtr* other, bool this_exact, bool other_exact) const { 7220 return TypePtr::maybe_java_subtype_of_helper_for_array(this, other, this_exact, other_exact); 7221 } 7222 7223 //------------------------------xdual------------------------------------------ 7224 // Dual: compute field-by-field dual 7225 const Type *TypeAryKlassPtr::xdual() const { 7226 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); 7227 } 7228 7229 // Is there a single ciKlass* that can represent that type? 7230 ciKlass* TypeAryKlassPtr::exact_klass_helper() const { 7231 if (elem()->isa_klassptr()) { 7232 ciKlass* k = elem()->is_klassptr()->exact_klass_helper(); 7233 if (k == nullptr) { 7234 return nullptr; 7235 } 7236 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()); 7237 k = ciArrayKlass::make(k, is_null_free(), is_atomic(), _refined_type); 7238 return k; 7239 } 7240 7241 return klass(); 7242 } 7243 7244 ciKlass* TypeAryKlassPtr::klass() const { 7245 if (_klass != nullptr) { 7246 return _klass; 7247 } 7248 ciKlass* k = nullptr; 7249 if (elem()->isa_klassptr()) { 7250 // leave null 7251 } else if ((elem()->base() == Type::Top) || 7252 (elem()->base() == Type::Bottom)) { 7253 } else { 7254 k = ciTypeArrayKlass::make(elem()->basic_type()); 7255 ((TypeAryKlassPtr*)this)->_klass = k; 7256 } 7257 return k; 7258 } 7259 7260 //------------------------------dump2------------------------------------------ 7261 // Dump Klass Type 7262 #ifndef PRODUCT 7263 void TypeAryKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const { 7264 st->print("aryklassptr:["); 7265 _elem->dump2(d, depth, st); 7266 _interfaces->dump(st); 7267 st->print(":%s", ptr_msg[_ptr]); 7268 if (_flat) st->print(":flat"); 7269 if (_null_free) st->print(":null free"); 7270 if (_atomic) st->print(":atomic"); 7271 if (_refined_type) st->print(":refined_type"); 7272 if (Verbose) { 7273 if (_not_flat) st->print(":not flat"); 7274 if (_not_null_free) st->print(":nullable"); 7275 } 7276 dump_offset(st); 7277 } 7278 #endif 7279 7280 const Type* TypeAryKlassPtr::base_element_type(int& dims) const { 7281 const Type* elem = this->elem(); 7282 dims = 1; 7283 while (elem->isa_aryklassptr()) { 7284 elem = elem->is_aryklassptr()->elem(); 7285 dims++; 7286 } 7287 return elem; 7288 } 7289 7290 //============================================================================= 7291 // Convenience common pre-built types. 7292 7293 //------------------------------make------------------------------------------- 7294 const TypeFunc *TypeFunc::make(const TypeTuple *domain_sig, const TypeTuple* domain_cc, 7295 const TypeTuple* range_sig, const TypeTuple* range_cc, 7296 bool scalarized_return) { 7297 return (TypeFunc*)(new TypeFunc(domain_sig, domain_cc, range_sig, range_cc, scalarized_return))->hashcons(); 7298 } 7299 7300 const TypeFunc *TypeFunc::make(const TypeTuple *domain, const TypeTuple *range) { 7301 return make(domain, domain, range, range); 7302 } 7303 7304 //------------------------------osr_domain----------------------------- 7305 const TypeTuple* osr_domain() { 7306 const Type **fields = TypeTuple::fields(2); 7307 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // address of osr buffer 7308 return TypeTuple::make(TypeFunc::Parms+1, fields); 7309 } 7310 7311 // Build a TypeFunc with both the Java-signature view ('sig') and the actual calling- 7312 // convention view ('cc') of inline types. In the signature, an inline type is a single 7313 // oop slot. In the scalarized calling convention, it is expanded to its field 7314 // values (plus null marker and optional oop to the heap buffer). 7315 // The 'is_call' argument distinguishes between the return signature of a method at calls 7316 // vs. at compilation of that method because at calls we return an additional null marker field. 7317 // For OSR and mismatching calls, we fall back to the non-scalarized argument view. 7318 const TypeFunc* TypeFunc::make(ciMethod* method, bool is_call, bool is_osr_compilation) { 7319 Compile* C = Compile::current(); 7320 const TypeFunc* tf = nullptr; 7321 // Inline types are not passed/returned by reference, instead each field of 7322 // the inline type is passed/returned as an argument. We maintain two views of 7323 // the argument/return list here: one based on the signature (with an inline 7324 // type argument/return as a single slot), one based on the actual calling 7325 // convention (with an inline type argument/return as a list of its fields). 7326 bool has_scalar_args = method->has_scalarized_args() && !is_osr_compilation; 7327 // Fall back to the non-scalarized calling convention when compiling a call via a mismatching method 7328 if (is_call && method->mismatch()) { 7329 has_scalar_args = false; 7330 } 7331 ciSignature* sig = method->signature(); 7332 bool has_scalar_ret = !method->is_native() && sig->return_type()->is_inlinetype() && sig->return_type()->as_inline_klass()->can_be_returned_as_fields(); 7333 // Don't cache on scalarized return because the range depends on 'is_call' 7334 if (!is_osr_compilation && !has_scalar_ret) { 7335 tf = C->last_tf(method); // check cache 7336 if (tf != nullptr) return tf; // The hit rate here is almost 50%. 7337 } 7338 const TypeTuple* domain_sig = is_osr_compilation ? osr_domain() : TypeTuple::make_domain(method, ignore_interfaces, false); 7339 const TypeTuple* domain_cc = has_scalar_args ? TypeTuple::make_domain(method, ignore_interfaces, true) : domain_sig; 7340 const TypeTuple* range_sig = TypeTuple::make_range(sig, ignore_interfaces); 7341 const TypeTuple* range_cc = has_scalar_ret ? TypeTuple::make_range(sig, ignore_interfaces, true, is_call) : range_sig; 7342 tf = TypeFunc::make(domain_sig, domain_cc, range_sig, range_cc, has_scalar_ret); 7343 if (!is_osr_compilation && !has_scalar_ret) { 7344 C->set_last_tf(method, tf); // fill cache 7345 } 7346 return tf; 7347 } 7348 7349 //------------------------------meet------------------------------------------- 7350 // Compute the MEET of two types. It returns a new Type object. 7351 const Type *TypeFunc::xmeet( const Type *t ) const { 7352 // Perform a fast test for common case; meeting the same types together. 7353 if( this == t ) return this; // Meeting same type-rep? 7354 7355 // Current "this->_base" is Func 7356 switch (t->base()) { // switch on original type 7357 7358 case Bottom: // Ye Olde Default 7359 return t; 7360 7361 default: // All else is a mistake 7362 typerr(t); 7363 7364 case Top: 7365 break; 7366 } 7367 return this; // Return the double constant 7368 } 7369 7370 //------------------------------xdual------------------------------------------ 7371 // Dual: compute field-by-field dual 7372 const Type *TypeFunc::xdual() const { 7373 return this; 7374 } 7375 7376 //------------------------------eq--------------------------------------------- 7377 // Structural equality check for Type representations 7378 bool TypeFunc::eq( const Type *t ) const { 7379 const TypeFunc *a = (const TypeFunc*)t; 7380 return _domain_sig == a->_domain_sig && 7381 _domain_cc == a->_domain_cc && 7382 _range_sig == a->_range_sig && 7383 _range_cc == a->_range_cc && 7384 _scalarized_return == a->_scalarized_return; 7385 } 7386 7387 //------------------------------hash------------------------------------------- 7388 // Type-specific hashing function. 7389 uint TypeFunc::hash(void) const { 7390 return (uint)(intptr_t)_domain_sig + (uint)(intptr_t)_domain_cc + (uint)(intptr_t)_range_sig + (uint)(intptr_t)_range_cc + (uint)(intptr_t)_scalarized_return; 7391 } 7392 7393 //------------------------------dump2------------------------------------------ 7394 // Dump Function Type 7395 #ifndef PRODUCT 7396 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const { 7397 if( _range_sig->cnt() <= Parms ) 7398 st->print("void"); 7399 else { 7400 uint i; 7401 for (i = Parms; i < _range_sig->cnt()-1; i++) { 7402 _range_sig->field_at(i)->dump2(d,depth,st); 7403 st->print("/"); 7404 } 7405 _range_sig->field_at(i)->dump2(d,depth,st); 7406 } 7407 st->print(" "); 7408 st->print("( "); 7409 if( !depth || d[this] ) { // Check for recursive dump 7410 st->print("...)"); 7411 return; 7412 } 7413 d.Insert((void*)this,(void*)this); // Stop recursion 7414 if (Parms < _domain_sig->cnt()) 7415 _domain_sig->field_at(Parms)->dump2(d,depth-1,st); 7416 for (uint i = Parms+1; i < _domain_sig->cnt(); i++) { 7417 st->print(", "); 7418 _domain_sig->field_at(i)->dump2(d,depth-1,st); 7419 } 7420 st->print(" )"); 7421 } 7422 #endif 7423 7424 //------------------------------singleton-------------------------------------- 7425 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple 7426 // constants (Ldi nodes). Singletons are integer, float or double constants 7427 // or a single symbol. 7428 bool TypeFunc::singleton(void) const { 7429 return false; // Never a singleton 7430 } 7431 7432 bool TypeFunc::empty(void) const { 7433 return false; // Never empty 7434 } 7435 7436 7437 BasicType TypeFunc::return_type() const{ 7438 if (range_sig()->cnt() == TypeFunc::Parms) { 7439 return T_VOID; 7440 } 7441 return range_sig()->field_at(TypeFunc::Parms)->basic_type(); 7442 } --- EOF ---