1 /* 2 * Copyright (c) 1998, 2013, 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 "precompiled.hpp" 26 #include "compiler/compileLog.hpp" 27 #include "interpreter/linkResolver.hpp" 28 #include "memory/universe.inline.hpp" 29 #include "oops/objArrayKlass.hpp" 30 #include "opto/addnode.hpp" 31 #include "opto/castnode.hpp" 32 #include "opto/memnode.hpp" 33 #include "opto/parse.hpp" 34 #include "opto/rootnode.hpp" 35 #include "opto/runtime.hpp" 36 #include "opto/subnode.hpp" 37 #include "runtime/deoptimization.hpp" 38 #include "runtime/handles.inline.hpp" 39 40 //============================================================================= 41 // Helper methods for _get* and _put* bytecodes 42 //============================================================================= 43 bool Parse::static_field_ok_in_clinit(ciField *field, ciMethod *method) { 44 // Could be the field_holder's <clinit> method, or <clinit> for a subklass. 45 // Better to check now than to Deoptimize as soon as we execute 46 assert( field->is_static(), "Only check if field is static"); 47 // is_being_initialized() is too generous. It allows access to statics 48 // by threads that are not running the <clinit> before the <clinit> finishes. 49 // return field->holder()->is_being_initialized(); 50 51 // The following restriction is correct but conservative. 52 // It is also desirable to allow compilation of methods called from <clinit> 53 // but this generated code will need to be made safe for execution by 54 // other threads, or the transition from interpreted to compiled code would 55 // need to be guarded. 56 ciInstanceKlass *field_holder = field->holder(); 57 58 bool access_OK = false; 59 if (method->holder()->is_subclass_of(field_holder)) { 60 if (method->is_static()) { 61 if (method->name() == ciSymbol::class_initializer_name()) { 62 // OK to access static fields inside initializer 63 access_OK = true; 64 } 65 } else { 66 if (method->name() == ciSymbol::object_initializer_name()) { 67 // It's also OK to access static fields inside a constructor, 68 // because any thread calling the constructor must first have 69 // synchronized on the class by executing a '_new' bytecode. 70 access_OK = true; 71 } 72 } 73 } 74 75 return access_OK; 76 77 } 78 79 80 void Parse::do_field_access(bool is_get, bool is_field) { 81 bool will_link; 82 ciField* field = iter().get_field(will_link); 83 assert(will_link, "getfield: typeflow responsibility"); 84 85 ciInstanceKlass* field_holder = field->holder(); 86 87 if (is_field == field->is_static()) { 88 // Interpreter will throw java_lang_IncompatibleClassChangeError 89 // Check this before allowing <clinit> methods to access static fields 90 uncommon_trap(Deoptimization::Reason_unhandled, 91 Deoptimization::Action_none); 92 return; 93 } 94 95 if (!is_field && !field_holder->is_initialized()) { 96 if (!static_field_ok_in_clinit(field, method())) { 97 uncommon_trap(Deoptimization::Reason_uninitialized, 98 Deoptimization::Action_reinterpret, 99 NULL, "!static_field_ok_in_clinit"); 100 return; 101 } 102 } 103 104 // Deoptimize on putfield writes to call site target field. 105 if (!is_get && field->is_call_site_target()) { 106 uncommon_trap(Deoptimization::Reason_unhandled, 107 Deoptimization::Action_reinterpret, 108 NULL, "put to call site target field"); 109 return; 110 } 111 112 assert(field->will_link(method()->holder(), bc()), "getfield: typeflow responsibility"); 113 114 // Note: We do not check for an unloaded field type here any more. 115 116 // Generate code for the object pointer. 117 Node* obj; 118 if (is_field) { 119 int obj_depth = is_get ? 0 : field->type()->size(); 120 obj = null_check(peek(obj_depth)); 121 // Compile-time detect of null-exception? 122 if (stopped()) return; 123 124 #ifdef ASSERT 125 const TypeInstPtr *tjp = TypeInstPtr::make(TypePtr::NotNull, iter().get_declared_field_holder()); 126 assert(_gvn.type(obj)->higher_equal(tjp), "cast_up is no longer needed"); 127 #endif 128 129 if (is_get) { 130 (void) pop(); // pop receiver before getting 131 do_get_xxx(obj, field, is_field); 132 } else { 133 do_put_xxx(obj, field, is_field); 134 (void) pop(); // pop receiver after putting 135 } 136 } else { 137 const TypeInstPtr* tip = TypeInstPtr::make(field_holder->java_mirror()); 138 obj = _gvn.makecon(tip); 139 if (is_get) { 140 do_get_xxx(obj, field, is_field); 141 } else { 142 do_put_xxx(obj, field, is_field); 143 } 144 } 145 } 146 147 148 void Parse::do_get_xxx(Node* obj, ciField* field, bool is_field) { 149 // Does this field have a constant value? If so, just push the value. 150 if (field->is_constant()) { 151 // final or stable field 152 const Type* stable_type = NULL; 153 if (FoldStableValues && field->is_stable()) { 154 stable_type = Type::get_const_type(field->type()); 155 if (field->type()->is_array_klass()) { 156 int stable_dimension = field->type()->as_array_klass()->dimension(); 157 stable_type = stable_type->is_aryptr()->cast_to_stable(true, stable_dimension); 158 } 159 } 160 if (field->is_static()) { 161 // final static field 162 if (C->eliminate_boxing()) { 163 // The pointers in the autobox arrays are always non-null. 164 ciSymbol* klass_name = field->holder()->name(); 165 if (field->name() == ciSymbol::cache_field_name() && 166 field->holder()->uses_default_loader() && 167 (klass_name == ciSymbol::java_lang_Character_CharacterCache() || 168 klass_name == ciSymbol::java_lang_Byte_ByteCache() || 169 klass_name == ciSymbol::java_lang_Short_ShortCache() || 170 klass_name == ciSymbol::java_lang_Integer_IntegerCache() || 171 klass_name == ciSymbol::java_lang_Long_LongCache())) { 172 bool require_const = true; 173 bool autobox_cache = true; 174 if (push_constant(field->constant_value(), require_const, autobox_cache)) { 175 return; 176 } 177 } 178 } 179 if (push_constant(field->constant_value(), false, false, stable_type)) 180 return; 181 } else { 182 // final or stable non-static field 183 // Treat final non-static fields of trusted classes (classes in 184 // java.lang.invoke and sun.invoke packages and subpackages) as 185 // compile time constants. 186 if (obj->is_Con()) { 187 const TypeOopPtr* oop_ptr = obj->bottom_type()->isa_oopptr(); 188 ciObject* constant_oop = oop_ptr->const_oop(); 189 ciConstant constant = field->constant_value_of(constant_oop); 190 if (FoldStableValues && field->is_stable() && constant.is_null_or_zero()) { 191 // fall through to field load; the field is not yet initialized 192 } else { 193 if (push_constant(constant, true, false, stable_type)) 194 return; 195 } 196 } 197 } 198 } 199 200 ciType* field_klass = field->type(); 201 bool is_vol = field->is_volatile(); 202 203 // Compute address and memory type. 204 int offset = field->offset_in_bytes(); 205 const TypePtr* adr_type = C->alias_type(field)->adr_type(); 206 Node *adr = basic_plus_adr(obj, obj, offset); 207 BasicType bt = field->layout_type(); 208 209 // Build the resultant type of the load 210 const Type *type; 211 212 bool must_assert_null = false; 213 214 if( bt == T_OBJECT ) { 215 if (!field->type()->is_loaded()) { 216 type = TypeInstPtr::BOTTOM; 217 must_assert_null = true; 218 } else if (field->is_constant() && field->is_static()) { 219 // This can happen if the constant oop is non-perm. 220 ciObject* con = field->constant_value().as_object(); 221 // Do not "join" in the previous type; it doesn't add value, 222 // and may yield a vacuous result if the field is of interface type. 223 type = TypeOopPtr::make_from_constant(con)->isa_oopptr(); 224 assert(type != NULL, "field singleton type must be consistent"); 225 } else { 226 type = TypeOopPtr::make_from_klass(field_klass->as_klass()); 227 } 228 } else { 229 type = Type::get_const_basic_type(bt); 230 } 231 if (support_IRIW_for_not_multiple_copy_atomic_cpu && field->is_volatile()) { 232 insert_mem_bar(Op_MemBarVolatile); // StoreLoad barrier 233 } 234 // Build the load. 235 // 236 MemNode::MemOrd mo = is_vol ? MemNode::acquire : MemNode::unordered; 237 bool needs_atomic_access = is_vol || AlwaysAtomicAccesses; 238 Node* ld = make_load(NULL, adr, type, bt, adr_type, mo, needs_atomic_access); 239 240 // Adjust Java stack 241 if (type2size[bt] == 1) 242 push(ld); 243 else 244 push_pair(ld); 245 246 if (must_assert_null) { 247 // Do not take a trap here. It's possible that the program 248 // will never load the field's class, and will happily see 249 // null values in this field forever. Don't stumble into a 250 // trap for such a program, or we might get a long series 251 // of useless recompilations. (Or, we might load a class 252 // which should not be loaded.) If we ever see a non-null 253 // value, we will then trap and recompile. (The trap will 254 // not need to mention the class index, since the class will 255 // already have been loaded if we ever see a non-null value.) 256 // uncommon_trap(iter().get_field_signature_index()); 257 #ifndef PRODUCT 258 if (PrintOpto && (Verbose || WizardMode)) { 259 method()->print_name(); tty->print_cr(" asserting nullness of field at bci: %d", bci()); 260 } 261 #endif 262 if (C->log() != NULL) { 263 C->log()->elem("assert_null reason='field' klass='%d'", 264 C->log()->identify(field->type())); 265 } 266 // If there is going to be a trap, put it at the next bytecode: 267 set_bci(iter().next_bci()); 268 null_assert(peek()); 269 set_bci(iter().cur_bci()); // put it back 270 } 271 272 // If reference is volatile, prevent following memory ops from 273 // floating up past the volatile read. Also prevents commoning 274 // another volatile read. 275 if (field->is_volatile()) { 276 // Memory barrier includes bogus read of value to force load BEFORE membar 277 insert_mem_bar(Op_MemBarAcquire, ld); 278 } 279 } 280 281 void Parse::do_put_xxx(Node* obj, ciField* field, bool is_field) { 282 bool is_vol = field->is_volatile(); 283 // If reference is volatile, prevent following memory ops from 284 // floating down past the volatile write. Also prevents commoning 285 // another volatile read. 286 if (is_vol) insert_mem_bar(Op_MemBarRelease); 287 288 // Compute address and memory type. 289 int offset = field->offset_in_bytes(); 290 const TypePtr* adr_type = C->alias_type(field)->adr_type(); 291 Node* adr = basic_plus_adr(obj, obj, offset); 292 BasicType bt = field->layout_type(); 293 // Value to be stored 294 Node* val = type2size[bt] == 1 ? pop() : pop_pair(); 295 // Round doubles before storing 296 if (bt == T_DOUBLE) val = dstore_rounding(val); 297 298 // Conservatively release stores of object references. 299 const MemNode::MemOrd mo = 300 is_vol ? 301 // Volatile fields need releasing stores. 302 MemNode::release : 303 // Non-volatile fields also need releasing stores if they hold an 304 // object reference, because the object reference might point to 305 // a freshly created object. 306 StoreNode::release_if_reference(bt); 307 308 // Store the value. 309 Node* store; 310 if (bt == T_OBJECT) { 311 const TypeOopPtr* field_type; 312 if (!field->type()->is_loaded()) { 313 field_type = TypeInstPtr::BOTTOM; 314 } else { 315 field_type = TypeOopPtr::make_from_klass(field->type()->as_klass()); 316 } 317 store = store_oop_to_object(control(), obj, adr, adr_type, val, field_type, bt, mo); 318 } else { 319 bool needs_atomic_access = is_vol || AlwaysAtomicAccesses; 320 store = store_to_memory(control(), adr, val, bt, adr_type, mo, needs_atomic_access); 321 } 322 323 // If reference is volatile, prevent following volatiles ops from 324 // floating up before the volatile write. 325 if (is_vol) { 326 // If not multiple copy atomic, we do the MemBarVolatile before the load. 327 if (!support_IRIW_for_not_multiple_copy_atomic_cpu) { 328 insert_mem_bar(Op_MemBarVolatile); // Use fat membar 329 } 330 // Remember we wrote a volatile field. 331 // For not multiple copy atomic cpu (ppc64) a barrier should be issued 332 // in constructors which have such stores. See do_exits() in parse1.cpp. 333 if (is_field) { 334 set_wrote_volatile(true); 335 } 336 } 337 338 if (is_field) { 339 set_wrote_fields(true); 340 } 341 342 // If the field is final, the rules of Java say we are in <init> or <clinit>. 343 // Note the presence of writes to final non-static fields, so that we 344 // can insert a memory barrier later on to keep the writes from floating 345 // out of the constructor. 346 // Any method can write a @Stable field; insert memory barriers after those also. 347 if (is_field && (field->is_final() || field->is_stable())) { 348 if (field->is_final()) { 349 set_wrote_final(true); 350 } 351 if (field->is_stable()) { 352 set_wrote_stable(true); 353 } 354 355 // Preserve allocation ptr to create precedent edge to it in membar 356 // generated on exit from constructor. 357 if (C->eliminate_boxing() && 358 adr_type->isa_oopptr() && adr_type->is_oopptr()->is_ptr_to_boxed_value() && 359 AllocateNode::Ideal_allocation(obj, &_gvn) != NULL) { 360 set_alloc_with_final(obj); 361 } 362 } 363 } 364 365 366 367 bool Parse::push_constant(ciConstant constant, bool require_constant, bool is_autobox_cache, const Type* stable_type) { 368 const Type* con_type = Type::make_from_constant(constant, require_constant, is_autobox_cache); 369 switch (constant.basic_type()) { 370 case T_ARRAY: 371 case T_OBJECT: 372 // cases: 373 // can_be_constant = (oop not scavengable || ScavengeRootsInCode != 0) 374 // should_be_constant = (oop not scavengable || ScavengeRootsInCode >= 2) 375 // An oop is not scavengable if it is in the perm gen. 376 if (stable_type != NULL && con_type != NULL && con_type->isa_oopptr()) 377 con_type = con_type->join_speculative(stable_type); 378 break; 379 380 case T_ILLEGAL: 381 // Invalid ciConstant returned due to OutOfMemoryError in the CI 382 assert(C->env()->failing(), "otherwise should not see this"); 383 // These always occur because of object types; we are going to 384 // bail out anyway, so make the stack depths match up 385 push( zerocon(T_OBJECT) ); 386 return false; 387 } 388 389 if (con_type == NULL) 390 // we cannot inline the oop, but we can use it later to narrow a type 391 return false; 392 393 push_node(constant.basic_type(), makecon(con_type)); 394 return true; 395 } 396 397 398 //============================================================================= 399 void Parse::do_anewarray() { 400 bool will_link; 401 ciKlass* klass = iter().get_klass(will_link); 402 403 // Uncommon Trap when class that array contains is not loaded 404 // we need the loaded class for the rest of graph; do not 405 // initialize the container class (see Java spec)!!! 406 assert(will_link, "anewarray: typeflow responsibility"); 407 408 ciObjArrayKlass* array_klass = ciObjArrayKlass::make(klass); 409 // Check that array_klass object is loaded 410 if (!array_klass->is_loaded()) { 411 // Generate uncommon_trap for unloaded array_class 412 uncommon_trap(Deoptimization::Reason_unloaded, 413 Deoptimization::Action_reinterpret, 414 array_klass); 415 return; 416 } 417 418 kill_dead_locals(); 419 420 const TypeKlassPtr* array_klass_type = TypeKlassPtr::make(array_klass); 421 Node* count_val = pop(); 422 Node* obj = new_array(makecon(array_klass_type), count_val, 1); 423 push(obj); 424 } 425 426 427 void Parse::do_newarray(BasicType elem_type) { 428 kill_dead_locals(); 429 430 Node* count_val = pop(); 431 const TypeKlassPtr* array_klass = TypeKlassPtr::make(ciTypeArrayKlass::make(elem_type)); 432 Node* obj = new_array(makecon(array_klass), count_val, 1); 433 // Push resultant oop onto stack 434 push(obj); 435 } 436 437 // Expand simple expressions like new int[3][5] and new Object[2][nonConLen]. 438 // Also handle the degenerate 1-dimensional case of anewarray. 439 Node* Parse::expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs) { 440 Node* length = lengths[0]; 441 assert(length != NULL, ""); 442 Node* array = new_array(makecon(TypeKlassPtr::make(array_klass)), length, nargs); 443 if (ndimensions > 1) { 444 jint length_con = find_int_con(length, -1); 445 guarantee(length_con >= 0, "non-constant multianewarray"); 446 ciArrayKlass* array_klass_1 = array_klass->as_obj_array_klass()->element_klass()->as_array_klass(); 447 const TypePtr* adr_type = TypeAryPtr::OOPS; 448 const TypeOopPtr* elemtype = _gvn.type(array)->is_aryptr()->elem()->make_oopptr(); 449 const intptr_t header = arrayOopDesc::base_offset_in_bytes(T_OBJECT); 450 for (jint i = 0; i < length_con; i++) { 451 Node* elem = expand_multianewarray(array_klass_1, &lengths[1], ndimensions-1, nargs); 452 intptr_t offset = header + ((intptr_t)i << LogBytesPerHeapOop); 453 Node* eaddr = basic_plus_adr(array, offset); 454 store_oop_to_array(control(), array, eaddr, adr_type, elem, elemtype, T_OBJECT, MemNode::unordered); 455 } 456 } 457 return array; 458 } 459 460 void Parse::do_multianewarray() { 461 int ndimensions = iter().get_dimensions(); 462 463 // the m-dimensional array 464 bool will_link; 465 ciArrayKlass* array_klass = iter().get_klass(will_link)->as_array_klass(); 466 assert(will_link, "multianewarray: typeflow responsibility"); 467 468 // Note: Array classes are always initialized; no is_initialized check. 469 470 kill_dead_locals(); 471 472 // get the lengths from the stack (first dimension is on top) 473 Node** length = NEW_RESOURCE_ARRAY(Node*, ndimensions + 1); 474 length[ndimensions] = NULL; // terminating null for make_runtime_call 475 int j; 476 for (j = ndimensions-1; j >= 0 ; j--) length[j] = pop(); 477 478 // The original expression was of this form: new T[length0][length1]... 479 // It is often the case that the lengths are small (except the last). 480 // If that happens, use the fast 1-d creator a constant number of times. 481 const jint expand_limit = MIN2((juint)MultiArrayExpandLimit, (juint)100); 482 jint expand_count = 1; // count of allocations in the expansion 483 jint expand_fanout = 1; // running total fanout 484 for (j = 0; j < ndimensions-1; j++) { 485 jint dim_con = find_int_con(length[j], -1); 486 expand_fanout *= dim_con; 487 expand_count += expand_fanout; // count the level-J sub-arrays 488 if (dim_con <= 0 489 || dim_con > expand_limit 490 || expand_count > expand_limit) { 491 expand_count = 0; 492 break; 493 } 494 } 495 496 // Can use multianewarray instead of [a]newarray if only one dimension, 497 // or if all non-final dimensions are small constants. 498 if (ndimensions == 1 || (1 <= expand_count && expand_count <= expand_limit)) { 499 Node* obj = NULL; 500 // Set the original stack and the reexecute bit for the interpreter 501 // to reexecute the multianewarray bytecode if deoptimization happens. 502 // Do it unconditionally even for one dimension multianewarray. 503 // Note: the reexecute bit will be set in GraphKit::add_safepoint_edges() 504 // when AllocateArray node for newarray is created. 505 { PreserveReexecuteState preexecs(this); 506 inc_sp(ndimensions); 507 // Pass 0 as nargs since uncommon trap code does not need to restore stack. 508 obj = expand_multianewarray(array_klass, &length[0], ndimensions, 0); 509 } //original reexecute and sp are set back here 510 push(obj); 511 return; 512 } 513 514 address fun = NULL; 515 switch (ndimensions) { 516 case 1: ShouldNotReachHere(); break; 517 case 2: fun = OptoRuntime::multianewarray2_Java(); break; 518 case 3: fun = OptoRuntime::multianewarray3_Java(); break; 519 case 4: fun = OptoRuntime::multianewarray4_Java(); break; 520 case 5: fun = OptoRuntime::multianewarray5_Java(); break; 521 }; 522 Node* c = NULL; 523 524 if (fun != NULL) { 525 c = make_runtime_call(RC_NO_LEAF | RC_NO_IO, 526 OptoRuntime::multianewarray_Type(ndimensions), 527 fun, NULL, TypeRawPtr::BOTTOM, 528 makecon(TypeKlassPtr::make(array_klass)), 529 length[0], length[1], length[2], 530 (ndimensions > 2) ? length[3] : NULL, 531 (ndimensions > 3) ? length[4] : NULL); 532 } else { 533 // Create a java array for dimension sizes 534 Node* dims = NULL; 535 { PreserveReexecuteState preexecs(this); 536 inc_sp(ndimensions); 537 Node* dims_array_klass = makecon(TypeKlassPtr::make(ciArrayKlass::make(ciType::make(T_INT)))); 538 dims = new_array(dims_array_klass, intcon(ndimensions), 0); 539 540 // Fill-in it with values 541 for (j = 0; j < ndimensions; j++) { 542 Node *dims_elem = array_element_address(dims, intcon(j), T_INT); 543 store_to_memory(control(), dims_elem, length[j], T_INT, TypeAryPtr::INTS, MemNode::unordered); 544 } 545 } 546 547 c = make_runtime_call(RC_NO_LEAF | RC_NO_IO, 548 OptoRuntime::multianewarrayN_Type(), 549 OptoRuntime::multianewarrayN_Java(), NULL, TypeRawPtr::BOTTOM, 550 makecon(TypeKlassPtr::make(array_klass)), 551 dims); 552 } 553 make_slow_call_ex(c, env()->Throwable_klass(), false); 554 555 Node* res = _gvn.transform(new (C) ProjNode(c, TypeFunc::Parms)); 556 557 const Type* type = TypeOopPtr::make_from_klass_raw(array_klass); 558 559 // Improve the type: We know it's not null, exact, and of a given length. 560 type = type->is_ptr()->cast_to_ptr_type(TypePtr::NotNull); 561 type = type->is_aryptr()->cast_to_exactness(true); 562 563 const TypeInt* ltype = _gvn.find_int_type(length[0]); 564 if (ltype != NULL) 565 type = type->is_aryptr()->cast_to_size(ltype); 566 567 // We cannot sharpen the nested sub-arrays, since the top level is mutable. 568 569 Node* cast = _gvn.transform( new (C) CheckCastPPNode(control(), res, type) ); 570 push(cast); 571 572 // Possible improvements: 573 // - Make a fast path for small multi-arrays. (W/ implicit init. loops.) 574 // - Issue CastII against length[*] values, to TypeInt::POS. 575 }