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(), method(), 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 Node* con = make_constant_from_field(field, obj); 153 if (con != NULL) { 154 push_node(field->layout_type(), con); 155 return; 156 } 157 } 158 159 ciType* field_klass = field->type(); 160 bool is_vol = field->is_volatile(); 161 162 // Compute address and memory type. 163 int offset = field->offset_in_bytes(); 164 const TypePtr* adr_type = C->alias_type(field)->adr_type(); 165 Node *adr = basic_plus_adr(obj, obj, offset); 166 BasicType bt = field->layout_type(); 167 168 // Build the resultant type of the load 169 const Type *type; 170 171 bool must_assert_null = false; 172 173 if( bt == T_OBJECT ) { 174 if (!field->type()->is_loaded()) { 175 type = TypeInstPtr::BOTTOM; 176 must_assert_null = true; 177 } else if (field->is_static_constant()) { 178 // This can happen if the constant oop is non-perm. 179 ciObject* con = field->constant_value().as_object(); 180 // Do not "join" in the previous type; it doesn't add value, 181 // and may yield a vacuous result if the field is of interface type. 182 if (con->is_null_object()) { 183 type = TypePtr::NULL_PTR; 184 } else { 185 type = TypeOopPtr::make_from_constant(con)->isa_oopptr(); 186 } 187 assert(type != NULL, "field singleton type must be consistent"); 188 } else { 189 type = TypeOopPtr::make_from_klass(field_klass->as_klass()); 190 } 191 } else { 192 type = Type::get_const_basic_type(bt); 193 } 194 if (support_IRIW_for_not_multiple_copy_atomic_cpu && field->is_volatile()) { 195 insert_mem_bar(Op_MemBarVolatile); // StoreLoad barrier 196 } 197 // Build the load. 198 // 199 MemNode::MemOrd mo = is_vol ? MemNode::acquire : MemNode::unordered; 200 bool needs_atomic_access = is_vol || AlwaysAtomicAccesses; 201 Node* ld = make_load(NULL, adr, type, bt, adr_type, mo, LoadNode::DependsOnlyOnTest, needs_atomic_access); 202 203 // Adjust Java stack 204 if (type2size[bt] == 1) 205 push(ld); 206 else 207 push_pair(ld); 208 209 if (must_assert_null) { 210 // Do not take a trap here. It's possible that the program 211 // will never load the field's class, and will happily see 212 // null values in this field forever. Don't stumble into a 213 // trap for such a program, or we might get a long series 214 // of useless recompilations. (Or, we might load a class 215 // which should not be loaded.) If we ever see a non-null 216 // value, we will then trap and recompile. (The trap will 217 // not need to mention the class index, since the class will 218 // already have been loaded if we ever see a non-null value.) 219 // uncommon_trap(iter().get_field_signature_index()); 220 if (PrintOpto && (Verbose || WizardMode)) { 221 method()->print_name(); tty->print_cr(" asserting nullness of field at bci: %d", bci()); 222 } 223 if (C->log() != NULL) { 224 C->log()->elem("assert_null reason='field' klass='%d'", 225 C->log()->identify(field->type())); 226 } 227 // If there is going to be a trap, put it at the next bytecode: 228 set_bci(iter().next_bci()); 229 null_assert(peek()); 230 set_bci(iter().cur_bci()); // put it back 231 } 232 233 // If reference is volatile, prevent following memory ops from 234 // floating up past the volatile read. Also prevents commoning 235 // another volatile read. 236 if (field->is_volatile()) { 237 // Memory barrier includes bogus read of value to force load BEFORE membar 238 insert_mem_bar(Op_MemBarAcquire, ld); 239 } 240 } 241 242 void Parse::do_put_xxx(Node* obj, ciField* field, bool is_field) { 243 bool is_vol = field->is_volatile(); 244 // If reference is volatile, prevent following memory ops from 245 // floating down past the volatile write. Also prevents commoning 246 // another volatile read. 247 if (is_vol) insert_mem_bar(Op_MemBarRelease); 248 249 // Compute address and memory type. 250 int offset = field->offset_in_bytes(); 251 const TypePtr* adr_type = C->alias_type(field)->adr_type(); 252 Node* adr = basic_plus_adr(obj, obj, offset); 253 BasicType bt = field->layout_type(); 254 // Value to be stored 255 Node* val = type2size[bt] == 1 ? pop() : pop_pair(); 256 // Round doubles before storing 257 if (bt == T_DOUBLE) val = dstore_rounding(val); 258 259 // Conservatively release stores of object references. 260 const MemNode::MemOrd mo = 261 is_vol ? 262 // Volatile fields need releasing stores. 263 MemNode::release : 264 // Non-volatile fields also need releasing stores if they hold an 265 // object reference, because the object reference might point to 266 // a freshly created object. 267 StoreNode::release_if_reference(bt); 268 269 // Store the value. 270 Node* store; 271 if (bt == T_OBJECT) { 272 const TypeOopPtr* field_type; 273 if (!field->type()->is_loaded()) { 274 field_type = TypeInstPtr::BOTTOM; 275 } else { 276 field_type = TypeOopPtr::make_from_klass(field->type()->as_klass()); 277 } 278 store = store_oop_to_object(control(), obj, adr, adr_type, val, field_type, bt, mo); 279 } else { 280 bool needs_atomic_access = is_vol || AlwaysAtomicAccesses; 281 store = store_to_memory(control(), adr, val, bt, adr_type, mo, needs_atomic_access); 282 } 283 284 // If reference is volatile, prevent following volatiles ops from 285 // floating up before the volatile write. 286 if (is_vol) { 287 // If not multiple copy atomic, we do the MemBarVolatile before the load. 288 if (!support_IRIW_for_not_multiple_copy_atomic_cpu) { 289 insert_mem_bar(Op_MemBarVolatile); // Use fat membar 290 } 291 // Remember we wrote a volatile field. 292 // For not multiple copy atomic cpu (ppc64) a barrier should be issued 293 // in constructors which have such stores. See do_exits() in parse1.cpp. 294 if (is_field) { 295 set_wrote_volatile(true); 296 } 297 } 298 299 if (is_field) { 300 set_wrote_fields(true); 301 } 302 303 // If the field is final, the rules of Java say we are in <init> or <clinit>. 304 // Note the presence of writes to final non-static fields, so that we 305 // can insert a memory barrier later on to keep the writes from floating 306 // out of the constructor. 307 // Any method can write a @Stable field; insert memory barriers after those also. 308 if (is_field && (field->is_final() || field->is_stable())) { 309 if (field->is_final()) { 310 set_wrote_final(true); 311 } 312 if (field->is_stable()) { 313 set_wrote_stable(true); 314 } 315 316 // Preserve allocation ptr to create precedent edge to it in membar 317 // generated on exit from constructor. 318 // Can't bind stable with its allocation, only record allocation for final field. 319 if (field->is_final() && AllocateNode::Ideal_allocation(obj, &_gvn) != NULL) { 320 set_alloc_with_final(obj); 321 } 322 } 323 } 324 325 //============================================================================= 326 void Parse::do_anewarray() { 327 bool will_link; 328 ciKlass* klass = iter().get_klass(will_link); 329 330 // Uncommon Trap when class that array contains is not loaded 331 // we need the loaded class for the rest of graph; do not 332 // initialize the container class (see Java spec)!!! 333 assert(will_link, "anewarray: typeflow responsibility"); 334 335 ciObjArrayKlass* array_klass = ciObjArrayKlass::make(klass); 336 // Check that array_klass object is loaded 337 if (!array_klass->is_loaded()) { 338 // Generate uncommon_trap for unloaded array_class 339 uncommon_trap(Deoptimization::Reason_unloaded, 340 Deoptimization::Action_reinterpret, 341 array_klass); 342 return; 343 } 344 345 kill_dead_locals(); 346 347 const TypeKlassPtr* array_klass_type = TypeKlassPtr::make(array_klass); 348 Node* count_val = pop(); 349 Node* obj = new_array(makecon(array_klass_type), count_val, 1); 350 push(obj); 351 } 352 353 354 void Parse::do_newarray(BasicType elem_type) { 355 kill_dead_locals(); 356 357 Node* count_val = pop(); 358 const TypeKlassPtr* array_klass = TypeKlassPtr::make(ciTypeArrayKlass::make(elem_type)); 359 Node* obj = new_array(makecon(array_klass), count_val, 1); 360 // Push resultant oop onto stack 361 push(obj); 362 } 363 364 // Expand simple expressions like new int[3][5] and new Object[2][nonConLen]. 365 // Also handle the degenerate 1-dimensional case of anewarray. 366 Node* Parse::expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs) { 367 Node* length = lengths[0]; 368 assert(length != NULL, ""); 369 Node* array = new_array(makecon(TypeKlassPtr::make(array_klass)), length, nargs); 370 if (ndimensions > 1) { 371 jint length_con = find_int_con(length, -1); 372 guarantee(length_con >= 0, "non-constant multianewarray"); 373 ciArrayKlass* array_klass_1 = array_klass->as_obj_array_klass()->element_klass()->as_array_klass(); 374 const TypePtr* adr_type = TypeAryPtr::OOPS; 375 const TypeOopPtr* elemtype = _gvn.type(array)->is_aryptr()->elem()->make_oopptr(); 376 const intptr_t header = arrayOopDesc::base_offset_in_bytes(T_OBJECT); 377 for (jint i = 0; i < length_con; i++) { 378 Node* elem = expand_multianewarray(array_klass_1, &lengths[1], ndimensions-1, nargs); 379 intptr_t offset = header + ((intptr_t)i << LogBytesPerHeapOop); 380 Node* eaddr = basic_plus_adr(array, offset); 381 store_oop_to_array(control(), array, eaddr, adr_type, elem, elemtype, T_OBJECT, MemNode::unordered); 382 } 383 } 384 return array; 385 } 386 387 void Parse::do_multianewarray() { 388 int ndimensions = iter().get_dimensions(); 389 390 // the m-dimensional array 391 bool will_link; 392 ciArrayKlass* array_klass = iter().get_klass(will_link)->as_array_klass(); 393 assert(will_link, "multianewarray: typeflow responsibility"); 394 395 // Note: Array classes are always initialized; no is_initialized check. 396 397 kill_dead_locals(); 398 399 // get the lengths from the stack (first dimension is on top) 400 Node** length = NEW_RESOURCE_ARRAY(Node*, ndimensions + 1); 401 length[ndimensions] = NULL; // terminating null for make_runtime_call 402 int j; 403 for (j = ndimensions-1; j >= 0 ; j--) length[j] = pop(); 404 405 // The original expression was of this form: new T[length0][length1]... 406 // It is often the case that the lengths are small (except the last). 407 // If that happens, use the fast 1-d creator a constant number of times. 408 const jint expand_limit = MIN2((jint)MultiArrayExpandLimit, 100); 409 jint expand_count = 1; // count of allocations in the expansion 410 jint expand_fanout = 1; // running total fanout 411 for (j = 0; j < ndimensions-1; j++) { 412 jint dim_con = find_int_con(length[j], -1); 413 expand_fanout *= dim_con; 414 expand_count += expand_fanout; // count the level-J sub-arrays 415 if (dim_con <= 0 416 || dim_con > expand_limit 417 || expand_count > expand_limit) { 418 expand_count = 0; 419 break; 420 } 421 } 422 423 // Can use multianewarray instead of [a]newarray if only one dimension, 424 // or if all non-final dimensions are small constants. 425 if (ndimensions == 1 || (1 <= expand_count && expand_count <= expand_limit)) { 426 Node* obj = NULL; 427 // Set the original stack and the reexecute bit for the interpreter 428 // to reexecute the multianewarray bytecode if deoptimization happens. 429 // Do it unconditionally even for one dimension multianewarray. 430 // Note: the reexecute bit will be set in GraphKit::add_safepoint_edges() 431 // when AllocateArray node for newarray is created. 432 { PreserveReexecuteState preexecs(this); 433 inc_sp(ndimensions); 434 // Pass 0 as nargs since uncommon trap code does not need to restore stack. 435 obj = expand_multianewarray(array_klass, &length[0], ndimensions, 0); 436 } //original reexecute and sp are set back here 437 push(obj); 438 return; 439 } 440 441 address fun = NULL; 442 switch (ndimensions) { 443 case 1: ShouldNotReachHere(); break; 444 case 2: fun = OptoRuntime::multianewarray2_Java(); break; 445 case 3: fun = OptoRuntime::multianewarray3_Java(); break; 446 case 4: fun = OptoRuntime::multianewarray4_Java(); break; 447 case 5: fun = OptoRuntime::multianewarray5_Java(); break; 448 }; 449 Node* c = NULL; 450 451 if (fun != NULL) { 452 c = make_runtime_call(RC_NO_LEAF | RC_NO_IO, 453 OptoRuntime::multianewarray_Type(ndimensions), 454 fun, NULL, TypeRawPtr::BOTTOM, 455 makecon(TypeKlassPtr::make(array_klass)), 456 length[0], length[1], length[2], 457 (ndimensions > 2) ? length[3] : NULL, 458 (ndimensions > 3) ? length[4] : NULL); 459 } else { 460 // Create a java array for dimension sizes 461 Node* dims = NULL; 462 { PreserveReexecuteState preexecs(this); 463 inc_sp(ndimensions); 464 Node* dims_array_klass = makecon(TypeKlassPtr::make(ciArrayKlass::make(ciType::make(T_INT)))); 465 dims = new_array(dims_array_klass, intcon(ndimensions), 0); 466 467 // Fill-in it with values 468 for (j = 0; j < ndimensions; j++) { 469 Node *dims_elem = array_element_address(dims, intcon(j), T_INT); 470 store_to_memory(control(), dims_elem, length[j], T_INT, TypeAryPtr::INTS, MemNode::unordered); 471 } 472 } 473 474 c = make_runtime_call(RC_NO_LEAF | RC_NO_IO, 475 OptoRuntime::multianewarrayN_Type(), 476 OptoRuntime::multianewarrayN_Java(), NULL, TypeRawPtr::BOTTOM, 477 makecon(TypeKlassPtr::make(array_klass)), 478 dims); 479 } 480 make_slow_call_ex(c, env()->Throwable_klass(), false); 481 482 Node* res = _gvn.transform(new ProjNode(c, TypeFunc::Parms)); 483 484 const Type* type = TypeOopPtr::make_from_klass_raw(array_klass); 485 486 // Improve the type: We know it's not null, exact, and of a given length. 487 type = type->is_ptr()->cast_to_ptr_type(TypePtr::NotNull); 488 type = type->is_aryptr()->cast_to_exactness(true); 489 490 const TypeInt* ltype = _gvn.find_int_type(length[0]); 491 if (ltype != NULL) 492 type = type->is_aryptr()->cast_to_size(ltype); 493 494 // We cannot sharpen the nested sub-arrays, since the top level is mutable. 495 496 Node* cast = _gvn.transform( new CheckCastPPNode(control(), res, type) ); 497 push(cast); 498 499 // Possible improvements: 500 // - Make a fast path for small multi-arrays. (W/ implicit init. loops.) 501 // - Issue CastII against length[*] values, to TypeInt::POS. 502 }