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