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