1 /* 2 * Copyright (c) 2001, 2016, 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 "gc/g1/g1SATBCardTableModRefBS.hpp" 28 #include "gc/g1/heapRegion.hpp" 29 #include "gc/shared/barrierSet.hpp" 30 #include "gc/shared/cardTableModRefBS.hpp" 31 #include "gc/shared/collectedHeap.hpp" 32 #include "memory/resourceArea.hpp" 33 #include "opto/addnode.hpp" 34 #include "opto/castnode.hpp" 35 #include "opto/convertnode.hpp" 36 #include "opto/graphKit.hpp" 37 #include "opto/idealKit.hpp" 38 #include "opto/intrinsicnode.hpp" 39 #include "opto/locknode.hpp" 40 #include "opto/machnode.hpp" 41 #include "opto/opaquenode.hpp" 42 #include "opto/parse.hpp" 43 #include "opto/rootnode.hpp" 44 #include "opto/runtime.hpp" 45 #include "runtime/deoptimization.hpp" 46 #include "runtime/sharedRuntime.hpp" 47 48 //----------------------------GraphKit----------------------------------------- 49 // Main utility constructor. 50 GraphKit::GraphKit(JVMState* jvms) 51 : Phase(Phase::Parser), 52 _env(C->env()), 53 _gvn(*C->initial_gvn()) 54 { 55 _exceptions = jvms->map()->next_exception(); 56 if (_exceptions != NULL) jvms->map()->set_next_exception(NULL); 57 set_jvms(jvms); 58 } 59 60 // Private constructor for parser. 61 GraphKit::GraphKit() 62 : Phase(Phase::Parser), 63 _env(C->env()), 64 _gvn(*C->initial_gvn()) 65 { 66 _exceptions = NULL; 67 set_map(NULL); 68 debug_only(_sp = -99); 69 debug_only(set_bci(-99)); 70 } 71 72 73 74 //---------------------------clean_stack--------------------------------------- 75 // Clear away rubbish from the stack area of the JVM state. 76 // This destroys any arguments that may be waiting on the stack. 77 void GraphKit::clean_stack(int from_sp) { 78 SafePointNode* map = this->map(); 79 JVMState* jvms = this->jvms(); 80 int stk_size = jvms->stk_size(); 81 int stkoff = jvms->stkoff(); 82 Node* top = this->top(); 83 for (int i = from_sp; i < stk_size; i++) { 84 if (map->in(stkoff + i) != top) { 85 map->set_req(stkoff + i, top); 86 } 87 } 88 } 89 90 91 //--------------------------------sync_jvms----------------------------------- 92 // Make sure our current jvms agrees with our parse state. 93 JVMState* GraphKit::sync_jvms() const { 94 JVMState* jvms = this->jvms(); 95 jvms->set_bci(bci()); // Record the new bci in the JVMState 96 jvms->set_sp(sp()); // Record the new sp in the JVMState 97 assert(jvms_in_sync(), "jvms is now in sync"); 98 return jvms; 99 } 100 101 //--------------------------------sync_jvms_for_reexecute--------------------- 102 // Make sure our current jvms agrees with our parse state. This version 103 // uses the reexecute_sp for reexecuting bytecodes. 104 JVMState* GraphKit::sync_jvms_for_reexecute() { 105 JVMState* jvms = this->jvms(); 106 jvms->set_bci(bci()); // Record the new bci in the JVMState 107 jvms->set_sp(reexecute_sp()); // Record the new sp in the JVMState 108 return jvms; 109 } 110 111 #ifdef ASSERT 112 bool GraphKit::jvms_in_sync() const { 113 Parse* parse = is_Parse(); 114 if (parse == NULL) { 115 if (bci() != jvms()->bci()) return false; 116 if (sp() != (int)jvms()->sp()) return false; 117 return true; 118 } 119 if (jvms()->method() != parse->method()) return false; 120 if (jvms()->bci() != parse->bci()) return false; 121 int jvms_sp = jvms()->sp(); 122 if (jvms_sp != parse->sp()) return false; 123 int jvms_depth = jvms()->depth(); 124 if (jvms_depth != parse->depth()) return false; 125 return true; 126 } 127 128 // Local helper checks for special internal merge points 129 // used to accumulate and merge exception states. 130 // They are marked by the region's in(0) edge being the map itself. 131 // Such merge points must never "escape" into the parser at large, 132 // until they have been handed to gvn.transform. 133 static bool is_hidden_merge(Node* reg) { 134 if (reg == NULL) return false; 135 if (reg->is_Phi()) { 136 reg = reg->in(0); 137 if (reg == NULL) return false; 138 } 139 return reg->is_Region() && reg->in(0) != NULL && reg->in(0)->is_Root(); 140 } 141 142 void GraphKit::verify_map() const { 143 if (map() == NULL) return; // null map is OK 144 assert(map()->req() <= jvms()->endoff(), "no extra garbage on map"); 145 assert(!map()->has_exceptions(), "call add_exception_states_from 1st"); 146 assert(!is_hidden_merge(control()), "call use_exception_state, not set_map"); 147 } 148 149 void GraphKit::verify_exception_state(SafePointNode* ex_map) { 150 assert(ex_map->next_exception() == NULL, "not already part of a chain"); 151 assert(has_saved_ex_oop(ex_map), "every exception state has an ex_oop"); 152 } 153 #endif 154 155 //---------------------------stop_and_kill_map--------------------------------- 156 // Set _map to NULL, signalling a stop to further bytecode execution. 157 // First smash the current map's control to a constant, to mark it dead. 158 void GraphKit::stop_and_kill_map() { 159 SafePointNode* dead_map = stop(); 160 if (dead_map != NULL) { 161 dead_map->disconnect_inputs(NULL, C); // Mark the map as killed. 162 assert(dead_map->is_killed(), "must be so marked"); 163 } 164 } 165 166 167 //--------------------------------stopped-------------------------------------- 168 // Tell if _map is NULL, or control is top. 169 bool GraphKit::stopped() { 170 if (map() == NULL) return true; 171 else if (control() == top()) return true; 172 else return false; 173 } 174 175 176 //-----------------------------has_ex_handler---------------------------------- 177 // Tell if this method or any caller method has exception handlers. 178 bool GraphKit::has_ex_handler() { 179 for (JVMState* jvmsp = jvms(); jvmsp != NULL; jvmsp = jvmsp->caller()) { 180 if (jvmsp->has_method() && jvmsp->method()->has_exception_handlers()) { 181 return true; 182 } 183 } 184 return false; 185 } 186 187 //------------------------------save_ex_oop------------------------------------ 188 // Save an exception without blowing stack contents or other JVM state. 189 void GraphKit::set_saved_ex_oop(SafePointNode* ex_map, Node* ex_oop) { 190 assert(!has_saved_ex_oop(ex_map), "clear ex-oop before setting again"); 191 ex_map->add_req(ex_oop); 192 debug_only(verify_exception_state(ex_map)); 193 } 194 195 inline static Node* common_saved_ex_oop(SafePointNode* ex_map, bool clear_it) { 196 assert(GraphKit::has_saved_ex_oop(ex_map), "ex_oop must be there"); 197 Node* ex_oop = ex_map->in(ex_map->req()-1); 198 if (clear_it) ex_map->del_req(ex_map->req()-1); 199 return ex_oop; 200 } 201 202 //-----------------------------saved_ex_oop------------------------------------ 203 // Recover a saved exception from its map. 204 Node* GraphKit::saved_ex_oop(SafePointNode* ex_map) { 205 return common_saved_ex_oop(ex_map, false); 206 } 207 208 //--------------------------clear_saved_ex_oop--------------------------------- 209 // Erase a previously saved exception from its map. 210 Node* GraphKit::clear_saved_ex_oop(SafePointNode* ex_map) { 211 return common_saved_ex_oop(ex_map, true); 212 } 213 214 #ifdef ASSERT 215 //---------------------------has_saved_ex_oop---------------------------------- 216 // Erase a previously saved exception from its map. 217 bool GraphKit::has_saved_ex_oop(SafePointNode* ex_map) { 218 return ex_map->req() == ex_map->jvms()->endoff()+1; 219 } 220 #endif 221 222 //-------------------------make_exception_state-------------------------------- 223 // Turn the current JVM state into an exception state, appending the ex_oop. 224 SafePointNode* GraphKit::make_exception_state(Node* ex_oop) { 225 sync_jvms(); 226 SafePointNode* ex_map = stop(); // do not manipulate this map any more 227 set_saved_ex_oop(ex_map, ex_oop); 228 return ex_map; 229 } 230 231 232 //--------------------------add_exception_state-------------------------------- 233 // Add an exception to my list of exceptions. 234 void GraphKit::add_exception_state(SafePointNode* ex_map) { 235 if (ex_map == NULL || ex_map->control() == top()) { 236 return; 237 } 238 #ifdef ASSERT 239 verify_exception_state(ex_map); 240 if (has_exceptions()) { 241 assert(ex_map->jvms()->same_calls_as(_exceptions->jvms()), "all collected exceptions must come from the same place"); 242 } 243 #endif 244 245 // If there is already an exception of exactly this type, merge with it. 246 // In particular, null-checks and other low-level exceptions common up here. 247 Node* ex_oop = saved_ex_oop(ex_map); 248 const Type* ex_type = _gvn.type(ex_oop); 249 if (ex_oop == top()) { 250 // No action needed. 251 return; 252 } 253 assert(ex_type->isa_instptr(), "exception must be an instance"); 254 for (SafePointNode* e2 = _exceptions; e2 != NULL; e2 = e2->next_exception()) { 255 const Type* ex_type2 = _gvn.type(saved_ex_oop(e2)); 256 // We check sp also because call bytecodes can generate exceptions 257 // both before and after arguments are popped! 258 if (ex_type2 == ex_type 259 && e2->_jvms->sp() == ex_map->_jvms->sp()) { 260 combine_exception_states(ex_map, e2); 261 return; 262 } 263 } 264 265 // No pre-existing exception of the same type. Chain it on the list. 266 push_exception_state(ex_map); 267 } 268 269 //-----------------------add_exception_states_from----------------------------- 270 void GraphKit::add_exception_states_from(JVMState* jvms) { 271 SafePointNode* ex_map = jvms->map()->next_exception(); 272 if (ex_map != NULL) { 273 jvms->map()->set_next_exception(NULL); 274 for (SafePointNode* next_map; ex_map != NULL; ex_map = next_map) { 275 next_map = ex_map->next_exception(); 276 ex_map->set_next_exception(NULL); 277 add_exception_state(ex_map); 278 } 279 } 280 } 281 282 //-----------------------transfer_exceptions_into_jvms------------------------- 283 JVMState* GraphKit::transfer_exceptions_into_jvms() { 284 if (map() == NULL) { 285 // We need a JVMS to carry the exceptions, but the map has gone away. 286 // Create a scratch JVMS, cloned from any of the exception states... 287 if (has_exceptions()) { 288 _map = _exceptions; 289 _map = clone_map(); 290 _map->set_next_exception(NULL); 291 clear_saved_ex_oop(_map); 292 debug_only(verify_map()); 293 } else { 294 // ...or created from scratch 295 JVMState* jvms = new (C) JVMState(_method, NULL); 296 jvms->set_bci(_bci); 297 jvms->set_sp(_sp); 298 jvms->set_map(new SafePointNode(TypeFunc::Parms, jvms)); 299 set_jvms(jvms); 300 for (uint i = 0; i < map()->req(); i++) map()->init_req(i, top()); 301 set_all_memory(top()); 302 while (map()->req() < jvms->endoff()) map()->add_req(top()); 303 } 304 // (This is a kludge, in case you didn't notice.) 305 set_control(top()); 306 } 307 JVMState* jvms = sync_jvms(); 308 assert(!jvms->map()->has_exceptions(), "no exceptions on this map yet"); 309 jvms->map()->set_next_exception(_exceptions); 310 _exceptions = NULL; // done with this set of exceptions 311 return jvms; 312 } 313 314 static inline void add_n_reqs(Node* dstphi, Node* srcphi) { 315 assert(is_hidden_merge(dstphi), "must be a special merge node"); 316 assert(is_hidden_merge(srcphi), "must be a special merge node"); 317 uint limit = srcphi->req(); 318 for (uint i = PhiNode::Input; i < limit; i++) { 319 dstphi->add_req(srcphi->in(i)); 320 } 321 } 322 static inline void add_one_req(Node* dstphi, Node* src) { 323 assert(is_hidden_merge(dstphi), "must be a special merge node"); 324 assert(!is_hidden_merge(src), "must not be a special merge node"); 325 dstphi->add_req(src); 326 } 327 328 //-----------------------combine_exception_states------------------------------ 329 // This helper function combines exception states by building phis on a 330 // specially marked state-merging region. These regions and phis are 331 // untransformed, and can build up gradually. The region is marked by 332 // having a control input of its exception map, rather than NULL. Such 333 // regions do not appear except in this function, and in use_exception_state. 334 void GraphKit::combine_exception_states(SafePointNode* ex_map, SafePointNode* phi_map) { 335 if (failing()) return; // dying anyway... 336 JVMState* ex_jvms = ex_map->_jvms; 337 assert(ex_jvms->same_calls_as(phi_map->_jvms), "consistent call chains"); 338 assert(ex_jvms->stkoff() == phi_map->_jvms->stkoff(), "matching locals"); 339 assert(ex_jvms->sp() == phi_map->_jvms->sp(), "matching stack sizes"); 340 assert(ex_jvms->monoff() == phi_map->_jvms->monoff(), "matching JVMS"); 341 assert(ex_jvms->scloff() == phi_map->_jvms->scloff(), "matching scalar replaced objects"); 342 assert(ex_map->req() == phi_map->req(), "matching maps"); 343 uint tos = ex_jvms->stkoff() + ex_jvms->sp(); 344 Node* hidden_merge_mark = root(); 345 Node* region = phi_map->control(); 346 MergeMemNode* phi_mem = phi_map->merged_memory(); 347 MergeMemNode* ex_mem = ex_map->merged_memory(); 348 if (region->in(0) != hidden_merge_mark) { 349 // The control input is not (yet) a specially-marked region in phi_map. 350 // Make it so, and build some phis. 351 region = new RegionNode(2); 352 _gvn.set_type(region, Type::CONTROL); 353 region->set_req(0, hidden_merge_mark); // marks an internal ex-state 354 region->init_req(1, phi_map->control()); 355 phi_map->set_control(region); 356 Node* io_phi = PhiNode::make(region, phi_map->i_o(), Type::ABIO); 357 record_for_igvn(io_phi); 358 _gvn.set_type(io_phi, Type::ABIO); 359 phi_map->set_i_o(io_phi); 360 for (MergeMemStream mms(phi_mem); mms.next_non_empty(); ) { 361 Node* m = mms.memory(); 362 Node* m_phi = PhiNode::make(region, m, Type::MEMORY, mms.adr_type(C)); 363 record_for_igvn(m_phi); 364 _gvn.set_type(m_phi, Type::MEMORY); 365 mms.set_memory(m_phi); 366 } 367 } 368 369 // Either or both of phi_map and ex_map might already be converted into phis. 370 Node* ex_control = ex_map->control(); 371 // if there is special marking on ex_map also, we add multiple edges from src 372 bool add_multiple = (ex_control->in(0) == hidden_merge_mark); 373 // how wide was the destination phi_map, originally? 374 uint orig_width = region->req(); 375 376 if (add_multiple) { 377 add_n_reqs(region, ex_control); 378 add_n_reqs(phi_map->i_o(), ex_map->i_o()); 379 } else { 380 // ex_map has no merges, so we just add single edges everywhere 381 add_one_req(region, ex_control); 382 add_one_req(phi_map->i_o(), ex_map->i_o()); 383 } 384 for (MergeMemStream mms(phi_mem, ex_mem); mms.next_non_empty2(); ) { 385 if (mms.is_empty()) { 386 // get a copy of the base memory, and patch some inputs into it 387 const TypePtr* adr_type = mms.adr_type(C); 388 Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type); 389 assert(phi->as_Phi()->region() == mms.base_memory()->in(0), ""); 390 mms.set_memory(phi); 391 // Prepare to append interesting stuff onto the newly sliced phi: 392 while (phi->req() > orig_width) phi->del_req(phi->req()-1); 393 } 394 // Append stuff from ex_map: 395 if (add_multiple) { 396 add_n_reqs(mms.memory(), mms.memory2()); 397 } else { 398 add_one_req(mms.memory(), mms.memory2()); 399 } 400 } 401 uint limit = ex_map->req(); 402 for (uint i = TypeFunc::Parms; i < limit; i++) { 403 // Skip everything in the JVMS after tos. (The ex_oop follows.) 404 if (i == tos) i = ex_jvms->monoff(); 405 Node* src = ex_map->in(i); 406 Node* dst = phi_map->in(i); 407 if (src != dst) { 408 PhiNode* phi; 409 if (dst->in(0) != region) { 410 dst = phi = PhiNode::make(region, dst, _gvn.type(dst)); 411 record_for_igvn(phi); 412 _gvn.set_type(phi, phi->type()); 413 phi_map->set_req(i, dst); 414 // Prepare to append interesting stuff onto the new phi: 415 while (dst->req() > orig_width) dst->del_req(dst->req()-1); 416 } else { 417 assert(dst->is_Phi(), "nobody else uses a hidden region"); 418 phi = dst->as_Phi(); 419 } 420 if (add_multiple && src->in(0) == ex_control) { 421 // Both are phis. 422 add_n_reqs(dst, src); 423 } else { 424 while (dst->req() < region->req()) add_one_req(dst, src); 425 } 426 const Type* srctype = _gvn.type(src); 427 if (phi->type() != srctype) { 428 const Type* dsttype = phi->type()->meet_speculative(srctype); 429 if (phi->type() != dsttype) { 430 phi->set_type(dsttype); 431 _gvn.set_type(phi, dsttype); 432 } 433 } 434 } 435 } 436 phi_map->merge_replaced_nodes_with(ex_map); 437 } 438 439 //--------------------------use_exception_state-------------------------------- 440 Node* GraphKit::use_exception_state(SafePointNode* phi_map) { 441 if (failing()) { stop(); return top(); } 442 Node* region = phi_map->control(); 443 Node* hidden_merge_mark = root(); 444 assert(phi_map->jvms()->map() == phi_map, "sanity: 1-1 relation"); 445 Node* ex_oop = clear_saved_ex_oop(phi_map); 446 if (region->in(0) == hidden_merge_mark) { 447 // Special marking for internal ex-states. Process the phis now. 448 region->set_req(0, region); // now it's an ordinary region 449 set_jvms(phi_map->jvms()); // ...so now we can use it as a map 450 // Note: Setting the jvms also sets the bci and sp. 451 set_control(_gvn.transform(region)); 452 uint tos = jvms()->stkoff() + sp(); 453 for (uint i = 1; i < tos; i++) { 454 Node* x = phi_map->in(i); 455 if (x->in(0) == region) { 456 assert(x->is_Phi(), "expected a special phi"); 457 phi_map->set_req(i, _gvn.transform(x)); 458 } 459 } 460 for (MergeMemStream mms(merged_memory()); mms.next_non_empty(); ) { 461 Node* x = mms.memory(); 462 if (x->in(0) == region) { 463 assert(x->is_Phi(), "nobody else uses a hidden region"); 464 mms.set_memory(_gvn.transform(x)); 465 } 466 } 467 if (ex_oop->in(0) == region) { 468 assert(ex_oop->is_Phi(), "expected a special phi"); 469 ex_oop = _gvn.transform(ex_oop); 470 } 471 } else { 472 set_jvms(phi_map->jvms()); 473 } 474 475 assert(!is_hidden_merge(phi_map->control()), "hidden ex. states cleared"); 476 assert(!is_hidden_merge(phi_map->i_o()), "hidden ex. states cleared"); 477 return ex_oop; 478 } 479 480 //---------------------------------java_bc------------------------------------- 481 Bytecodes::Code GraphKit::java_bc() const { 482 ciMethod* method = this->method(); 483 int bci = this->bci(); 484 if (method != NULL && bci != InvocationEntryBci) 485 return method->java_code_at_bci(bci); 486 else 487 return Bytecodes::_illegal; 488 } 489 490 void GraphKit::uncommon_trap_if_should_post_on_exceptions(Deoptimization::DeoptReason reason, 491 bool must_throw) { 492 // if the exception capability is set, then we will generate code 493 // to check the JavaThread.should_post_on_exceptions flag to see 494 // if we actually need to report exception events (for this 495 // thread). If we don't need to report exception events, we will 496 // take the normal fast path provided by add_exception_events. If 497 // exception event reporting is enabled for this thread, we will 498 // take the uncommon_trap in the BuildCutout below. 499 500 // first must access the should_post_on_exceptions_flag in this thread's JavaThread 501 Node* jthread = _gvn.transform(new ThreadLocalNode()); 502 Node* adr = basic_plus_adr(top(), jthread, in_bytes(JavaThread::should_post_on_exceptions_flag_offset())); 503 Node* should_post_flag = make_load(control(), adr, TypeInt::INT, T_INT, Compile::AliasIdxRaw, MemNode::unordered); 504 505 // Test the should_post_on_exceptions_flag vs. 0 506 Node* chk = _gvn.transform( new CmpINode(should_post_flag, intcon(0)) ); 507 Node* tst = _gvn.transform( new BoolNode(chk, BoolTest::eq) ); 508 509 // Branch to slow_path if should_post_on_exceptions_flag was true 510 { BuildCutout unless(this, tst, PROB_MAX); 511 // Do not try anything fancy if we're notifying the VM on every throw. 512 // Cf. case Bytecodes::_athrow in parse2.cpp. 513 uncommon_trap(reason, Deoptimization::Action_none, 514 (ciKlass*)NULL, (char*)NULL, must_throw); 515 } 516 517 } 518 519 //------------------------------builtin_throw---------------------------------- 520 void GraphKit::builtin_throw(Deoptimization::DeoptReason reason, Node* arg) { 521 bool must_throw = true; 522 523 if (env()->jvmti_can_post_on_exceptions()) { 524 // check if we must post exception events, take uncommon trap if so 525 uncommon_trap_if_should_post_on_exceptions(reason, must_throw); 526 // here if should_post_on_exceptions is false 527 // continue on with the normal codegen 528 } 529 530 // If this particular condition has not yet happened at this 531 // bytecode, then use the uncommon trap mechanism, and allow for 532 // a future recompilation if several traps occur here. 533 // If the throw is hot, try to use a more complicated inline mechanism 534 // which keeps execution inside the compiled code. 535 bool treat_throw_as_hot = false; 536 ciMethodData* md = method()->method_data(); 537 538 if (ProfileTraps) { 539 if (too_many_traps(reason)) { 540 treat_throw_as_hot = true; 541 } 542 // (If there is no MDO at all, assume it is early in 543 // execution, and that any deopts are part of the 544 // startup transient, and don't need to be remembered.) 545 546 // Also, if there is a local exception handler, treat all throws 547 // as hot if there has been at least one in this method. 548 if (C->trap_count(reason) != 0 549 && method()->method_data()->trap_count(reason) != 0 550 && has_ex_handler()) { 551 treat_throw_as_hot = true; 552 } 553 } 554 555 // If this throw happens frequently, an uncommon trap might cause 556 // a performance pothole. If there is a local exception handler, 557 // and if this particular bytecode appears to be deoptimizing often, 558 // let us handle the throw inline, with a preconstructed instance. 559 // Note: If the deopt count has blown up, the uncommon trap 560 // runtime is going to flush this nmethod, not matter what. 561 if (treat_throw_as_hot 562 && (!StackTraceInThrowable || OmitStackTraceInFastThrow)) { 563 // If the throw is local, we use a pre-existing instance and 564 // punt on the backtrace. This would lead to a missing backtrace 565 // (a repeat of 4292742) if the backtrace object is ever asked 566 // for its backtrace. 567 // Fixing this remaining case of 4292742 requires some flavor of 568 // escape analysis. Leave that for the future. 569 ciInstance* ex_obj = NULL; 570 switch (reason) { 571 case Deoptimization::Reason_null_check: 572 ex_obj = env()->NullPointerException_instance(); 573 break; 574 case Deoptimization::Reason_div0_check: 575 ex_obj = env()->ArithmeticException_instance(); 576 break; 577 case Deoptimization::Reason_range_check: 578 ex_obj = env()->ArrayIndexOutOfBoundsException_instance(); 579 break; 580 case Deoptimization::Reason_class_check: 581 if (java_bc() == Bytecodes::_aastore) { 582 ex_obj = env()->ArrayStoreException_instance(); 583 } else { 584 ex_obj = env()->ClassCastException_instance(); 585 } 586 break; 587 } 588 if (failing()) { stop(); return; } // exception allocation might fail 589 if (ex_obj != NULL) { 590 // Cheat with a preallocated exception object. 591 if (C->log() != NULL) 592 C->log()->elem("hot_throw preallocated='1' reason='%s'", 593 Deoptimization::trap_reason_name(reason)); 594 const TypeInstPtr* ex_con = TypeInstPtr::make(ex_obj); 595 Node* ex_node = _gvn.transform(ConNode::make(ex_con)); 596 597 // Clear the detail message of the preallocated exception object. 598 // Weblogic sometimes mutates the detail message of exceptions 599 // using reflection. 600 int offset = java_lang_Throwable::get_detailMessage_offset(); 601 const TypePtr* adr_typ = ex_con->add_offset(offset); 602 603 Node *adr = basic_plus_adr(ex_node, ex_node, offset); 604 const TypeOopPtr* val_type = TypeOopPtr::make_from_klass(env()->String_klass()); 605 // Conservatively release stores of object references. 606 Node *store = store_oop_to_object(control(), ex_node, adr, adr_typ, null(), val_type, T_OBJECT, MemNode::release); 607 608 add_exception_state(make_exception_state(ex_node)); 609 return; 610 } 611 } 612 613 // %%% Maybe add entry to OptoRuntime which directly throws the exc.? 614 // It won't be much cheaper than bailing to the interp., since we'll 615 // have to pass up all the debug-info, and the runtime will have to 616 // create the stack trace. 617 618 // Usual case: Bail to interpreter. 619 // Reserve the right to recompile if we haven't seen anything yet. 620 621 ciMethod* m = Deoptimization::reason_is_speculate(reason) ? C->method() : NULL; 622 Deoptimization::DeoptAction action = Deoptimization::Action_maybe_recompile; 623 if (treat_throw_as_hot 624 && (method()->method_data()->trap_recompiled_at(bci(), m) 625 || C->too_many_traps(reason))) { 626 // We cannot afford to take more traps here. Suffer in the interpreter. 627 if (C->log() != NULL) 628 C->log()->elem("hot_throw preallocated='0' reason='%s' mcount='%d'", 629 Deoptimization::trap_reason_name(reason), 630 C->trap_count(reason)); 631 action = Deoptimization::Action_none; 632 } 633 634 // "must_throw" prunes the JVM state to include only the stack, if there 635 // are no local exception handlers. This should cut down on register 636 // allocation time and code size, by drastically reducing the number 637 // of in-edges on the call to the uncommon trap. 638 639 uncommon_trap(reason, action, (ciKlass*)NULL, (char*)NULL, must_throw); 640 } 641 642 643 //----------------------------PreserveJVMState--------------------------------- 644 PreserveJVMState::PreserveJVMState(GraphKit* kit, bool clone_map) { 645 debug_only(kit->verify_map()); 646 _kit = kit; 647 _map = kit->map(); // preserve the map 648 _sp = kit->sp(); 649 kit->set_map(clone_map ? kit->clone_map() : NULL); 650 #ifdef ASSERT 651 _bci = kit->bci(); 652 Parse* parser = kit->is_Parse(); 653 int block = (parser == NULL || parser->block() == NULL) ? -1 : parser->block()->rpo(); 654 _block = block; 655 #endif 656 } 657 PreserveJVMState::~PreserveJVMState() { 658 GraphKit* kit = _kit; 659 #ifdef ASSERT 660 assert(kit->bci() == _bci, "bci must not shift"); 661 Parse* parser = kit->is_Parse(); 662 int block = (parser == NULL || parser->block() == NULL) ? -1 : parser->block()->rpo(); 663 assert(block == _block, "block must not shift"); 664 #endif 665 kit->set_map(_map); 666 kit->set_sp(_sp); 667 } 668 669 670 //-----------------------------BuildCutout------------------------------------- 671 BuildCutout::BuildCutout(GraphKit* kit, Node* p, float prob, float cnt) 672 : PreserveJVMState(kit) 673 { 674 assert(p->is_Con() || p->is_Bool(), "test must be a bool"); 675 SafePointNode* outer_map = _map; // preserved map is caller's 676 SafePointNode* inner_map = kit->map(); 677 IfNode* iff = kit->create_and_map_if(outer_map->control(), p, prob, cnt); 678 outer_map->set_control(kit->gvn().transform( new IfTrueNode(iff) )); 679 inner_map->set_control(kit->gvn().transform( new IfFalseNode(iff) )); 680 } 681 BuildCutout::~BuildCutout() { 682 GraphKit* kit = _kit; 683 assert(kit->stopped(), "cutout code must stop, throw, return, etc."); 684 } 685 686 //---------------------------PreserveReexecuteState---------------------------- 687 PreserveReexecuteState::PreserveReexecuteState(GraphKit* kit) { 688 assert(!kit->stopped(), "must call stopped() before"); 689 _kit = kit; 690 _sp = kit->sp(); 691 _reexecute = kit->jvms()->_reexecute; 692 } 693 PreserveReexecuteState::~PreserveReexecuteState() { 694 if (_kit->stopped()) return; 695 _kit->jvms()->_reexecute = _reexecute; 696 _kit->set_sp(_sp); 697 } 698 699 //------------------------------clone_map-------------------------------------- 700 // Implementation of PreserveJVMState 701 // 702 // Only clone_map(...) here. If this function is only used in the 703 // PreserveJVMState class we may want to get rid of this extra 704 // function eventually and do it all there. 705 706 SafePointNode* GraphKit::clone_map() { 707 if (map() == NULL) return NULL; 708 709 // Clone the memory edge first 710 Node* mem = MergeMemNode::make(map()->memory()); 711 gvn().set_type_bottom(mem); 712 713 SafePointNode *clonemap = (SafePointNode*)map()->clone(); 714 JVMState* jvms = this->jvms(); 715 JVMState* clonejvms = jvms->clone_shallow(C); 716 clonemap->set_memory(mem); 717 clonemap->set_jvms(clonejvms); 718 clonejvms->set_map(clonemap); 719 record_for_igvn(clonemap); 720 gvn().set_type_bottom(clonemap); 721 return clonemap; 722 } 723 724 725 //-----------------------------set_map_clone----------------------------------- 726 void GraphKit::set_map_clone(SafePointNode* m) { 727 _map = m; 728 _map = clone_map(); 729 _map->set_next_exception(NULL); 730 debug_only(verify_map()); 731 } 732 733 734 //----------------------------kill_dead_locals--------------------------------- 735 // Detect any locals which are known to be dead, and force them to top. 736 void GraphKit::kill_dead_locals() { 737 // Consult the liveness information for the locals. If any 738 // of them are unused, then they can be replaced by top(). This 739 // should help register allocation time and cut down on the size 740 // of the deoptimization information. 741 742 // This call is made from many of the bytecode handling 743 // subroutines called from the Big Switch in do_one_bytecode. 744 // Every bytecode which might include a slow path is responsible 745 // for killing its dead locals. The more consistent we 746 // are about killing deads, the fewer useless phis will be 747 // constructed for them at various merge points. 748 749 // bci can be -1 (InvocationEntryBci). We return the entry 750 // liveness for the method. 751 752 if (method() == NULL || method()->code_size() == 0) { 753 // We are building a graph for a call to a native method. 754 // All locals are live. 755 return; 756 } 757 758 ResourceMark rm; 759 760 // Consult the liveness information for the locals. If any 761 // of them are unused, then they can be replaced by top(). This 762 // should help register allocation time and cut down on the size 763 // of the deoptimization information. 764 MethodLivenessResult live_locals = method()->liveness_at_bci(bci()); 765 766 int len = (int)live_locals.size(); 767 assert(len <= jvms()->loc_size(), "too many live locals"); 768 for (int local = 0; local < len; local++) { 769 if (!live_locals.at(local)) { 770 set_local(local, top()); 771 } 772 } 773 } 774 775 #ifdef ASSERT 776 //-------------------------dead_locals_are_killed------------------------------ 777 // Return true if all dead locals are set to top in the map. 778 // Used to assert "clean" debug info at various points. 779 bool GraphKit::dead_locals_are_killed() { 780 if (method() == NULL || method()->code_size() == 0) { 781 // No locals need to be dead, so all is as it should be. 782 return true; 783 } 784 785 // Make sure somebody called kill_dead_locals upstream. 786 ResourceMark rm; 787 for (JVMState* jvms = this->jvms(); jvms != NULL; jvms = jvms->caller()) { 788 if (jvms->loc_size() == 0) continue; // no locals to consult 789 SafePointNode* map = jvms->map(); 790 ciMethod* method = jvms->method(); 791 int bci = jvms->bci(); 792 if (jvms == this->jvms()) { 793 bci = this->bci(); // it might not yet be synched 794 } 795 MethodLivenessResult live_locals = method->liveness_at_bci(bci); 796 int len = (int)live_locals.size(); 797 if (!live_locals.is_valid() || len == 0) 798 // This method is trivial, or is poisoned by a breakpoint. 799 return true; 800 assert(len == jvms->loc_size(), "live map consistent with locals map"); 801 for (int local = 0; local < len; local++) { 802 if (!live_locals.at(local) && map->local(jvms, local) != top()) { 803 if (PrintMiscellaneous && (Verbose || WizardMode)) { 804 tty->print_cr("Zombie local %d: ", local); 805 jvms->dump(); 806 } 807 return false; 808 } 809 } 810 } 811 return true; 812 } 813 814 #endif //ASSERT 815 816 // Helper function for enforcing certain bytecodes to reexecute if 817 // deoptimization happens 818 static bool should_reexecute_implied_by_bytecode(JVMState *jvms, bool is_anewarray) { 819 ciMethod* cur_method = jvms->method(); 820 int cur_bci = jvms->bci(); 821 if (cur_method != NULL && cur_bci != InvocationEntryBci) { 822 Bytecodes::Code code = cur_method->java_code_at_bci(cur_bci); 823 return Interpreter::bytecode_should_reexecute(code) || 824 is_anewarray && code == Bytecodes::_multianewarray; 825 // Reexecute _multianewarray bytecode which was replaced with 826 // sequence of [a]newarray. See Parse::do_multianewarray(). 827 // 828 // Note: interpreter should not have it set since this optimization 829 // is limited by dimensions and guarded by flag so in some cases 830 // multianewarray() runtime calls will be generated and 831 // the bytecode should not be reexecutes (stack will not be reset). 832 } else 833 return false; 834 } 835 836 // Helper function for adding JVMState and debug information to node 837 void GraphKit::add_safepoint_edges(SafePointNode* call, bool must_throw) { 838 // Add the safepoint edges to the call (or other safepoint). 839 840 // Make sure dead locals are set to top. This 841 // should help register allocation time and cut down on the size 842 // of the deoptimization information. 843 assert(dead_locals_are_killed(), "garbage in debug info before safepoint"); 844 845 // Walk the inline list to fill in the correct set of JVMState's 846 // Also fill in the associated edges for each JVMState. 847 848 // If the bytecode needs to be reexecuted we need to put 849 // the arguments back on the stack. 850 const bool should_reexecute = jvms()->should_reexecute(); 851 JVMState* youngest_jvms = should_reexecute ? sync_jvms_for_reexecute() : sync_jvms(); 852 853 // NOTE: set_bci (called from sync_jvms) might reset the reexecute bit to 854 // undefined if the bci is different. This is normal for Parse but it 855 // should not happen for LibraryCallKit because only one bci is processed. 856 assert(!is_LibraryCallKit() || (jvms()->should_reexecute() == should_reexecute), 857 "in LibraryCallKit the reexecute bit should not change"); 858 859 // If we are guaranteed to throw, we can prune everything but the 860 // input to the current bytecode. 861 bool can_prune_locals = false; 862 uint stack_slots_not_pruned = 0; 863 int inputs = 0, depth = 0; 864 if (must_throw) { 865 assert(method() == youngest_jvms->method(), "sanity"); 866 if (compute_stack_effects(inputs, depth)) { 867 can_prune_locals = true; 868 stack_slots_not_pruned = inputs; 869 } 870 } 871 872 if (env()->should_retain_local_variables()) { 873 // At any safepoint, this method can get breakpointed, which would 874 // then require an immediate deoptimization. 875 can_prune_locals = false; // do not prune locals 876 stack_slots_not_pruned = 0; 877 } 878 879 // do not scribble on the input jvms 880 JVMState* out_jvms = youngest_jvms->clone_deep(C); 881 call->set_jvms(out_jvms); // Start jvms list for call node 882 883 // For a known set of bytecodes, the interpreter should reexecute them if 884 // deoptimization happens. We set the reexecute state for them here 885 if (out_jvms->is_reexecute_undefined() && //don't change if already specified 886 should_reexecute_implied_by_bytecode(out_jvms, call->is_AllocateArray())) { 887 out_jvms->set_should_reexecute(true); //NOTE: youngest_jvms not changed 888 } 889 890 // Presize the call: 891 DEBUG_ONLY(uint non_debug_edges = call->req()); 892 call->add_req_batch(top(), youngest_jvms->debug_depth()); 893 assert(call->req() == non_debug_edges + youngest_jvms->debug_depth(), ""); 894 895 // Set up edges so that the call looks like this: 896 // Call [state:] ctl io mem fptr retadr 897 // [parms:] parm0 ... parmN 898 // [root:] loc0 ... locN stk0 ... stkSP mon0 obj0 ... monN objN 899 // [...mid:] loc0 ... locN stk0 ... stkSP mon0 obj0 ... monN objN [...] 900 // [young:] loc0 ... locN stk0 ... stkSP mon0 obj0 ... monN objN 901 // Note that caller debug info precedes callee debug info. 902 903 // Fill pointer walks backwards from "young:" to "root:" in the diagram above: 904 uint debug_ptr = call->req(); 905 906 // Loop over the map input edges associated with jvms, add them 907 // to the call node, & reset all offsets to match call node array. 908 for (JVMState* in_jvms = youngest_jvms; in_jvms != NULL; ) { 909 uint debug_end = debug_ptr; 910 uint debug_start = debug_ptr - in_jvms->debug_size(); 911 debug_ptr = debug_start; // back up the ptr 912 913 uint p = debug_start; // walks forward in [debug_start, debug_end) 914 uint j, k, l; 915 SafePointNode* in_map = in_jvms->map(); 916 out_jvms->set_map(call); 917 918 if (can_prune_locals) { 919 assert(in_jvms->method() == out_jvms->method(), "sanity"); 920 // If the current throw can reach an exception handler in this JVMS, 921 // then we must keep everything live that can reach that handler. 922 // As a quick and dirty approximation, we look for any handlers at all. 923 if (in_jvms->method()->has_exception_handlers()) { 924 can_prune_locals = false; 925 } 926 } 927 928 // Add the Locals 929 k = in_jvms->locoff(); 930 l = in_jvms->loc_size(); 931 out_jvms->set_locoff(p); 932 if (!can_prune_locals) { 933 for (j = 0; j < l; j++) 934 call->set_req(p++, in_map->in(k+j)); 935 } else { 936 p += l; // already set to top above by add_req_batch 937 } 938 939 // Add the Expression Stack 940 k = in_jvms->stkoff(); 941 l = in_jvms->sp(); 942 out_jvms->set_stkoff(p); 943 if (!can_prune_locals) { 944 for (j = 0; j < l; j++) 945 call->set_req(p++, in_map->in(k+j)); 946 } else if (can_prune_locals && stack_slots_not_pruned != 0) { 947 // Divide stack into {S0,...,S1}, where S0 is set to top. 948 uint s1 = stack_slots_not_pruned; 949 stack_slots_not_pruned = 0; // for next iteration 950 if (s1 > l) s1 = l; 951 uint s0 = l - s1; 952 p += s0; // skip the tops preinstalled by add_req_batch 953 for (j = s0; j < l; j++) 954 call->set_req(p++, in_map->in(k+j)); 955 } else { 956 p += l; // already set to top above by add_req_batch 957 } 958 959 // Add the Monitors 960 k = in_jvms->monoff(); 961 l = in_jvms->mon_size(); 962 out_jvms->set_monoff(p); 963 for (j = 0; j < l; j++) 964 call->set_req(p++, in_map->in(k+j)); 965 966 // Copy any scalar object fields. 967 k = in_jvms->scloff(); 968 l = in_jvms->scl_size(); 969 out_jvms->set_scloff(p); 970 for (j = 0; j < l; j++) 971 call->set_req(p++, in_map->in(k+j)); 972 973 // Finish the new jvms. 974 out_jvms->set_endoff(p); 975 976 assert(out_jvms->endoff() == debug_end, "fill ptr must match"); 977 assert(out_jvms->depth() == in_jvms->depth(), "depth must match"); 978 assert(out_jvms->loc_size() == in_jvms->loc_size(), "size must match"); 979 assert(out_jvms->mon_size() == in_jvms->mon_size(), "size must match"); 980 assert(out_jvms->scl_size() == in_jvms->scl_size(), "size must match"); 981 assert(out_jvms->debug_size() == in_jvms->debug_size(), "size must match"); 982 983 // Update the two tail pointers in parallel. 984 out_jvms = out_jvms->caller(); 985 in_jvms = in_jvms->caller(); 986 } 987 988 assert(debug_ptr == non_debug_edges, "debug info must fit exactly"); 989 990 // Test the correctness of JVMState::debug_xxx accessors: 991 assert(call->jvms()->debug_start() == non_debug_edges, ""); 992 assert(call->jvms()->debug_end() == call->req(), ""); 993 assert(call->jvms()->debug_depth() == call->req() - non_debug_edges, ""); 994 } 995 996 bool GraphKit::compute_stack_effects(int& inputs, int& depth) { 997 Bytecodes::Code code = java_bc(); 998 if (code == Bytecodes::_wide) { 999 code = method()->java_code_at_bci(bci() + 1); 1000 } 1001 1002 BasicType rtype = T_ILLEGAL; 1003 int rsize = 0; 1004 1005 if (code != Bytecodes::_illegal) { 1006 depth = Bytecodes::depth(code); // checkcast=0, athrow=-1 1007 rtype = Bytecodes::result_type(code); // checkcast=P, athrow=V 1008 if (rtype < T_CONFLICT) 1009 rsize = type2size[rtype]; 1010 } 1011 1012 switch (code) { 1013 case Bytecodes::_illegal: 1014 return false; 1015 1016 case Bytecodes::_ldc: 1017 case Bytecodes::_ldc_w: 1018 case Bytecodes::_ldc2_w: 1019 inputs = 0; 1020 break; 1021 1022 case Bytecodes::_dup: inputs = 1; break; 1023 case Bytecodes::_dup_x1: inputs = 2; break; 1024 case Bytecodes::_dup_x2: inputs = 3; break; 1025 case Bytecodes::_dup2: inputs = 2; break; 1026 case Bytecodes::_dup2_x1: inputs = 3; break; 1027 case Bytecodes::_dup2_x2: inputs = 4; break; 1028 case Bytecodes::_swap: inputs = 2; break; 1029 case Bytecodes::_arraylength: inputs = 1; break; 1030 1031 case Bytecodes::_getstatic: 1032 case Bytecodes::_putstatic: 1033 case Bytecodes::_getfield: 1034 case Bytecodes::_putfield: 1035 { 1036 bool ignored_will_link; 1037 ciField* field = method()->get_field_at_bci(bci(), ignored_will_link); 1038 int size = field->type()->size(); 1039 bool is_get = (depth >= 0), is_static = (depth & 1); 1040 inputs = (is_static ? 0 : 1); 1041 if (is_get) { 1042 depth = size - inputs; 1043 } else { 1044 inputs += size; // putxxx pops the value from the stack 1045 depth = - inputs; 1046 } 1047 } 1048 break; 1049 1050 case Bytecodes::_invokevirtual: 1051 case Bytecodes::_invokespecial: 1052 case Bytecodes::_invokestatic: 1053 case Bytecodes::_invokedynamic: 1054 case Bytecodes::_invokeinterface: 1055 { 1056 bool ignored_will_link; 1057 ciSignature* declared_signature = NULL; 1058 ciMethod* ignored_callee = method()->get_method_at_bci(bci(), ignored_will_link, &declared_signature); 1059 assert(declared_signature != NULL, "cannot be null"); 1060 inputs = declared_signature->arg_size_for_bc(code); 1061 int size = declared_signature->return_type()->size(); 1062 depth = size - inputs; 1063 } 1064 break; 1065 1066 case Bytecodes::_multianewarray: 1067 { 1068 ciBytecodeStream iter(method()); 1069 iter.reset_to_bci(bci()); 1070 iter.next(); 1071 inputs = iter.get_dimensions(); 1072 assert(rsize == 1, ""); 1073 depth = rsize - inputs; 1074 } 1075 break; 1076 1077 case Bytecodes::_ireturn: 1078 case Bytecodes::_lreturn: 1079 case Bytecodes::_freturn: 1080 case Bytecodes::_dreturn: 1081 case Bytecodes::_areturn: 1082 assert(rsize == -depth, ""); 1083 inputs = rsize; 1084 break; 1085 1086 case Bytecodes::_jsr: 1087 case Bytecodes::_jsr_w: 1088 inputs = 0; 1089 depth = 1; // S.B. depth=1, not zero 1090 break; 1091 1092 default: 1093 // bytecode produces a typed result 1094 inputs = rsize - depth; 1095 assert(inputs >= 0, ""); 1096 break; 1097 } 1098 1099 #ifdef ASSERT 1100 // spot check 1101 int outputs = depth + inputs; 1102 assert(outputs >= 0, "sanity"); 1103 switch (code) { 1104 case Bytecodes::_checkcast: assert(inputs == 1 && outputs == 1, ""); break; 1105 case Bytecodes::_athrow: assert(inputs == 1 && outputs == 0, ""); break; 1106 case Bytecodes::_aload_0: assert(inputs == 0 && outputs == 1, ""); break; 1107 case Bytecodes::_return: assert(inputs == 0 && outputs == 0, ""); break; 1108 case Bytecodes::_drem: assert(inputs == 4 && outputs == 2, ""); break; 1109 } 1110 #endif //ASSERT 1111 1112 return true; 1113 } 1114 1115 1116 1117 //------------------------------basic_plus_adr--------------------------------- 1118 Node* GraphKit::basic_plus_adr(Node* base, Node* ptr, Node* offset) { 1119 // short-circuit a common case 1120 if (offset == intcon(0)) return ptr; 1121 return _gvn.transform( new AddPNode(base, ptr, offset) ); 1122 } 1123 1124 Node* GraphKit::ConvI2L(Node* offset) { 1125 // short-circuit a common case 1126 jint offset_con = find_int_con(offset, Type::OffsetBot); 1127 if (offset_con != Type::OffsetBot) { 1128 return longcon((jlong) offset_con); 1129 } 1130 return _gvn.transform( new ConvI2LNode(offset)); 1131 } 1132 1133 Node* GraphKit::ConvI2UL(Node* offset) { 1134 juint offset_con = (juint) find_int_con(offset, Type::OffsetBot); 1135 if (offset_con != (juint) Type::OffsetBot) { 1136 return longcon((julong) offset_con); 1137 } 1138 Node* conv = _gvn.transform( new ConvI2LNode(offset)); 1139 Node* mask = _gvn.transform(ConLNode::make((julong) max_juint)); 1140 return _gvn.transform( new AndLNode(conv, mask) ); 1141 } 1142 1143 Node* GraphKit::ConvL2I(Node* offset) { 1144 // short-circuit a common case 1145 jlong offset_con = find_long_con(offset, (jlong)Type::OffsetBot); 1146 if (offset_con != (jlong)Type::OffsetBot) { 1147 return intcon((int) offset_con); 1148 } 1149 return _gvn.transform( new ConvL2INode(offset)); 1150 } 1151 1152 //-------------------------load_object_klass----------------------------------- 1153 Node* GraphKit::load_object_klass(Node* obj) { 1154 // Special-case a fresh allocation to avoid building nodes: 1155 Node* akls = AllocateNode::Ideal_klass(obj, &_gvn); 1156 if (akls != NULL) return akls; 1157 Node* k_adr = basic_plus_adr(obj, oopDesc::klass_offset_in_bytes()); 1158 return _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), k_adr, TypeInstPtr::KLASS)); 1159 } 1160 1161 //-------------------------load_array_length----------------------------------- 1162 Node* GraphKit::load_array_length(Node* array) { 1163 // Special-case a fresh allocation to avoid building nodes: 1164 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(array, &_gvn); 1165 Node *alen; 1166 if (alloc == NULL) { 1167 Node *r_adr = basic_plus_adr(array, arrayOopDesc::length_offset_in_bytes()); 1168 alen = _gvn.transform( new LoadRangeNode(0, immutable_memory(), r_adr, TypeInt::POS)); 1169 } else { 1170 alen = alloc->Ideal_length(); 1171 Node* ccast = alloc->make_ideal_length(_gvn.type(array)->is_oopptr(), &_gvn); 1172 if (ccast != alen) { 1173 alen = _gvn.transform(ccast); 1174 } 1175 } 1176 return alen; 1177 } 1178 1179 //------------------------------do_null_check---------------------------------- 1180 // Helper function to do a NULL pointer check. Returned value is 1181 // the incoming address with NULL casted away. You are allowed to use the 1182 // not-null value only if you are control dependent on the test. 1183 #ifndef PRODUCT 1184 extern int explicit_null_checks_inserted, 1185 explicit_null_checks_elided; 1186 #endif 1187 Node* GraphKit::null_check_common(Node* value, BasicType type, 1188 // optional arguments for variations: 1189 bool assert_null, 1190 Node* *null_control, 1191 bool speculative) { 1192 assert(!assert_null || null_control == NULL, "not both at once"); 1193 if (stopped()) return top(); 1194 NOT_PRODUCT(explicit_null_checks_inserted++); 1195 1196 // Construct NULL check 1197 Node *chk = NULL; 1198 switch(type) { 1199 case T_LONG : chk = new CmpLNode(value, _gvn.zerocon(T_LONG)); break; 1200 case T_INT : chk = new CmpINode(value, _gvn.intcon(0)); break; 1201 case T_ARRAY : // fall through 1202 type = T_OBJECT; // simplify further tests 1203 case T_OBJECT : { 1204 const Type *t = _gvn.type( value ); 1205 1206 const TypeOopPtr* tp = t->isa_oopptr(); 1207 if (tp != NULL && tp->klass() != NULL && !tp->klass()->is_loaded() 1208 // Only for do_null_check, not any of its siblings: 1209 && !assert_null && null_control == NULL) { 1210 // Usually, any field access or invocation on an unloaded oop type 1211 // will simply fail to link, since the statically linked class is 1212 // likely also to be unloaded. However, in -Xcomp mode, sometimes 1213 // the static class is loaded but the sharper oop type is not. 1214 // Rather than checking for this obscure case in lots of places, 1215 // we simply observe that a null check on an unloaded class 1216 // will always be followed by a nonsense operation, so we 1217 // can just issue the uncommon trap here. 1218 // Our access to the unloaded class will only be correct 1219 // after it has been loaded and initialized, which requires 1220 // a trip through the interpreter. 1221 #ifndef PRODUCT 1222 if (WizardMode) { tty->print("Null check of unloaded "); tp->klass()->print(); tty->cr(); } 1223 #endif 1224 uncommon_trap(Deoptimization::Reason_unloaded, 1225 Deoptimization::Action_reinterpret, 1226 tp->klass(), "!loaded"); 1227 return top(); 1228 } 1229 1230 if (assert_null) { 1231 // See if the type is contained in NULL_PTR. 1232 // If so, then the value is already null. 1233 if (t->higher_equal(TypePtr::NULL_PTR)) { 1234 NOT_PRODUCT(explicit_null_checks_elided++); 1235 return value; // Elided null assert quickly! 1236 } 1237 } else { 1238 // See if mixing in the NULL pointer changes type. 1239 // If so, then the NULL pointer was not allowed in the original 1240 // type. In other words, "value" was not-null. 1241 if (t->meet(TypePtr::NULL_PTR) != t->remove_speculative()) { 1242 // same as: if (!TypePtr::NULL_PTR->higher_equal(t)) ... 1243 NOT_PRODUCT(explicit_null_checks_elided++); 1244 return value; // Elided null check quickly! 1245 } 1246 } 1247 chk = new CmpPNode( value, null() ); 1248 break; 1249 } 1250 1251 default: 1252 fatal("unexpected type: %s", type2name(type)); 1253 } 1254 assert(chk != NULL, "sanity check"); 1255 chk = _gvn.transform(chk); 1256 1257 BoolTest::mask btest = assert_null ? BoolTest::eq : BoolTest::ne; 1258 BoolNode *btst = new BoolNode( chk, btest); 1259 Node *tst = _gvn.transform( btst ); 1260 1261 //----------- 1262 // if peephole optimizations occurred, a prior test existed. 1263 // If a prior test existed, maybe it dominates as we can avoid this test. 1264 if (tst != btst && type == T_OBJECT) { 1265 // At this point we want to scan up the CFG to see if we can 1266 // find an identical test (and so avoid this test altogether). 1267 Node *cfg = control(); 1268 int depth = 0; 1269 while( depth < 16 ) { // Limit search depth for speed 1270 if( cfg->Opcode() == Op_IfTrue && 1271 cfg->in(0)->in(1) == tst ) { 1272 // Found prior test. Use "cast_not_null" to construct an identical 1273 // CastPP (and hence hash to) as already exists for the prior test. 1274 // Return that casted value. 1275 if (assert_null) { 1276 replace_in_map(value, null()); 1277 return null(); // do not issue the redundant test 1278 } 1279 Node *oldcontrol = control(); 1280 set_control(cfg); 1281 Node *res = cast_not_null(value); 1282 set_control(oldcontrol); 1283 NOT_PRODUCT(explicit_null_checks_elided++); 1284 return res; 1285 } 1286 cfg = IfNode::up_one_dom(cfg, /*linear_only=*/ true); 1287 if (cfg == NULL) break; // Quit at region nodes 1288 depth++; 1289 } 1290 } 1291 1292 //----------- 1293 // Branch to failure if null 1294 float ok_prob = PROB_MAX; // a priori estimate: nulls never happen 1295 Deoptimization::DeoptReason reason; 1296 if (assert_null) { 1297 reason = Deoptimization::Reason_null_assert; 1298 } else if (type == T_OBJECT) { 1299 reason = Deoptimization::reason_null_check(speculative); 1300 } else { 1301 reason = Deoptimization::Reason_div0_check; 1302 } 1303 // %%% Since Reason_unhandled is not recorded on a per-bytecode basis, 1304 // ciMethodData::has_trap_at will return a conservative -1 if any 1305 // must-be-null assertion has failed. This could cause performance 1306 // problems for a method after its first do_null_assert failure. 1307 // Consider using 'Reason_class_check' instead? 1308 1309 // To cause an implicit null check, we set the not-null probability 1310 // to the maximum (PROB_MAX). For an explicit check the probability 1311 // is set to a smaller value. 1312 if (null_control != NULL || too_many_traps(reason)) { 1313 // probability is less likely 1314 ok_prob = PROB_LIKELY_MAG(3); 1315 } else if (!assert_null && 1316 (ImplicitNullCheckThreshold > 0) && 1317 method() != NULL && 1318 (method()->method_data()->trap_count(reason) 1319 >= (uint)ImplicitNullCheckThreshold)) { 1320 ok_prob = PROB_LIKELY_MAG(3); 1321 } 1322 1323 if (null_control != NULL) { 1324 IfNode* iff = create_and_map_if(control(), tst, ok_prob, COUNT_UNKNOWN); 1325 Node* null_true = _gvn.transform( new IfFalseNode(iff)); 1326 set_control( _gvn.transform( new IfTrueNode(iff))); 1327 #ifndef PRODUCT 1328 if (null_true == top()) { 1329 explicit_null_checks_elided++; 1330 } 1331 #endif 1332 (*null_control) = null_true; 1333 } else { 1334 BuildCutout unless(this, tst, ok_prob); 1335 // Check for optimizer eliding test at parse time 1336 if (stopped()) { 1337 // Failure not possible; do not bother making uncommon trap. 1338 NOT_PRODUCT(explicit_null_checks_elided++); 1339 } else if (assert_null) { 1340 uncommon_trap(reason, 1341 Deoptimization::Action_make_not_entrant, 1342 NULL, "assert_null"); 1343 } else { 1344 replace_in_map(value, zerocon(type)); 1345 builtin_throw(reason); 1346 } 1347 } 1348 1349 // Must throw exception, fall-thru not possible? 1350 if (stopped()) { 1351 return top(); // No result 1352 } 1353 1354 if (assert_null) { 1355 // Cast obj to null on this path. 1356 replace_in_map(value, zerocon(type)); 1357 return zerocon(type); 1358 } 1359 1360 // Cast obj to not-null on this path, if there is no null_control. 1361 // (If there is a null_control, a non-null value may come back to haunt us.) 1362 if (type == T_OBJECT) { 1363 Node* cast = cast_not_null(value, false); 1364 if (null_control == NULL || (*null_control) == top()) 1365 replace_in_map(value, cast); 1366 value = cast; 1367 } 1368 1369 return value; 1370 } 1371 1372 1373 //------------------------------cast_not_null---------------------------------- 1374 // Cast obj to not-null on this path 1375 Node* GraphKit::cast_not_null(Node* obj, bool do_replace_in_map) { 1376 const Type *t = _gvn.type(obj); 1377 const Type *t_not_null = t->join_speculative(TypePtr::NOTNULL); 1378 // Object is already not-null? 1379 if( t == t_not_null ) return obj; 1380 1381 Node *cast = new CastPPNode(obj,t_not_null); 1382 cast->init_req(0, control()); 1383 cast = _gvn.transform( cast ); 1384 1385 // Scan for instances of 'obj' in the current JVM mapping. 1386 // These instances are known to be not-null after the test. 1387 if (do_replace_in_map) 1388 replace_in_map(obj, cast); 1389 1390 return cast; // Return casted value 1391 } 1392 1393 1394 //--------------------------replace_in_map------------------------------------- 1395 void GraphKit::replace_in_map(Node* old, Node* neww) { 1396 if (old == neww) { 1397 return; 1398 } 1399 1400 map()->replace_edge(old, neww); 1401 1402 // Note: This operation potentially replaces any edge 1403 // on the map. This includes locals, stack, and monitors 1404 // of the current (innermost) JVM state. 1405 1406 // don't let inconsistent types from profiling escape this 1407 // method 1408 1409 const Type* told = _gvn.type(old); 1410 const Type* tnew = _gvn.type(neww); 1411 1412 if (!tnew->higher_equal(told)) { 1413 return; 1414 } 1415 1416 map()->record_replaced_node(old, neww); 1417 } 1418 1419 1420 //============================================================================= 1421 //--------------------------------memory--------------------------------------- 1422 Node* GraphKit::memory(uint alias_idx) { 1423 MergeMemNode* mem = merged_memory(); 1424 Node* p = mem->memory_at(alias_idx); 1425 _gvn.set_type(p, Type::MEMORY); // must be mapped 1426 return p; 1427 } 1428 1429 //-----------------------------reset_memory------------------------------------ 1430 Node* GraphKit::reset_memory() { 1431 Node* mem = map()->memory(); 1432 // do not use this node for any more parsing! 1433 debug_only( map()->set_memory((Node*)NULL) ); 1434 return _gvn.transform( mem ); 1435 } 1436 1437 //------------------------------set_all_memory--------------------------------- 1438 void GraphKit::set_all_memory(Node* newmem) { 1439 Node* mergemem = MergeMemNode::make(newmem); 1440 gvn().set_type_bottom(mergemem); 1441 map()->set_memory(mergemem); 1442 } 1443 1444 //------------------------------set_all_memory_call---------------------------- 1445 void GraphKit::set_all_memory_call(Node* call, bool separate_io_proj) { 1446 Node* newmem = _gvn.transform( new ProjNode(call, TypeFunc::Memory, separate_io_proj) ); 1447 set_all_memory(newmem); 1448 } 1449 1450 //============================================================================= 1451 // 1452 // parser factory methods for MemNodes 1453 // 1454 // These are layered on top of the factory methods in LoadNode and StoreNode, 1455 // and integrate with the parser's memory state and _gvn engine. 1456 // 1457 1458 // factory methods in "int adr_idx" 1459 Node* GraphKit::make_load(Node* ctl, Node* adr, const Type* t, BasicType bt, 1460 int adr_idx, 1461 MemNode::MemOrd mo, 1462 LoadNode::ControlDependency control_dependency, 1463 bool require_atomic_access, 1464 bool unaligned, 1465 bool mismatched) { 1466 assert(adr_idx != Compile::AliasIdxTop, "use other make_load factory" ); 1467 const TypePtr* adr_type = NULL; // debug-mode-only argument 1468 debug_only(adr_type = C->get_adr_type(adr_idx)); 1469 Node* mem = memory(adr_idx); 1470 Node* ld; 1471 if (require_atomic_access && bt == T_LONG) { 1472 ld = LoadLNode::make_atomic(ctl, mem, adr, adr_type, t, mo, control_dependency, unaligned, mismatched); 1473 } else if (require_atomic_access && bt == T_DOUBLE) { 1474 ld = LoadDNode::make_atomic(ctl, mem, adr, adr_type, t, mo, control_dependency, unaligned, mismatched); 1475 } else { 1476 ld = LoadNode::make(_gvn, ctl, mem, adr, adr_type, t, bt, mo, control_dependency, unaligned, mismatched); 1477 } 1478 ld = _gvn.transform(ld); 1479 if ((bt == T_OBJECT) && C->do_escape_analysis() || C->eliminate_boxing()) { 1480 // Improve graph before escape analysis and boxing elimination. 1481 record_for_igvn(ld); 1482 } 1483 return ld; 1484 } 1485 1486 Node* GraphKit::store_to_memory(Node* ctl, Node* adr, Node *val, BasicType bt, 1487 int adr_idx, 1488 MemNode::MemOrd mo, 1489 bool require_atomic_access, 1490 bool unaligned, 1491 bool mismatched) { 1492 assert(adr_idx != Compile::AliasIdxTop, "use other store_to_memory factory" ); 1493 const TypePtr* adr_type = NULL; 1494 debug_only(adr_type = C->get_adr_type(adr_idx)); 1495 Node *mem = memory(adr_idx); 1496 Node* st; 1497 if (require_atomic_access && bt == T_LONG) { 1498 st = StoreLNode::make_atomic(ctl, mem, adr, adr_type, val, mo); 1499 } else if (require_atomic_access && bt == T_DOUBLE) { 1500 st = StoreDNode::make_atomic(ctl, mem, adr, adr_type, val, mo); 1501 } else { 1502 st = StoreNode::make(_gvn, ctl, mem, adr, adr_type, val, bt, mo); 1503 } 1504 if (unaligned) { 1505 st->as_Store()->set_unaligned_access(); 1506 } 1507 if (mismatched) { 1508 st->as_Store()->set_mismatched_access(); 1509 } 1510 st = _gvn.transform(st); 1511 set_memory(st, adr_idx); 1512 // Back-to-back stores can only remove intermediate store with DU info 1513 // so push on worklist for optimizer. 1514 if (mem->req() > MemNode::Address && adr == mem->in(MemNode::Address)) 1515 record_for_igvn(st); 1516 1517 return st; 1518 } 1519 1520 1521 void GraphKit::pre_barrier(bool do_load, 1522 Node* ctl, 1523 Node* obj, 1524 Node* adr, 1525 uint adr_idx, 1526 Node* val, 1527 const TypeOopPtr* val_type, 1528 Node* pre_val, 1529 BasicType bt) { 1530 1531 BarrierSet* bs = Universe::heap()->barrier_set(); 1532 set_control(ctl); 1533 switch (bs->kind()) { 1534 case BarrierSet::G1SATBCTLogging: 1535 g1_write_barrier_pre(do_load, obj, adr, adr_idx, val, val_type, pre_val, bt); 1536 break; 1537 1538 case BarrierSet::CardTableForRS: 1539 case BarrierSet::CardTableExtension: 1540 case BarrierSet::ModRef: 1541 case BarrierSet::Epsilon: 1542 break; 1543 1544 default : 1545 ShouldNotReachHere(); 1546 1547 } 1548 } 1549 1550 bool GraphKit::can_move_pre_barrier() const { 1551 BarrierSet* bs = Universe::heap()->barrier_set(); 1552 switch (bs->kind()) { 1553 case BarrierSet::G1SATBCTLogging: 1554 return true; // Can move it if no safepoint 1555 1556 case BarrierSet::CardTableForRS: 1557 case BarrierSet::CardTableExtension: 1558 case BarrierSet::ModRef: 1559 case BarrierSet::Epsilon: 1560 return true; // There is no pre-barrier 1561 1562 default : 1563 ShouldNotReachHere(); 1564 } 1565 return false; 1566 } 1567 1568 void GraphKit::post_barrier(Node* ctl, 1569 Node* store, 1570 Node* obj, 1571 Node* adr, 1572 uint adr_idx, 1573 Node* val, 1574 BasicType bt, 1575 bool use_precise) { 1576 BarrierSet* bs = Universe::heap()->barrier_set(); 1577 set_control(ctl); 1578 switch (bs->kind()) { 1579 case BarrierSet::G1SATBCTLogging: 1580 g1_write_barrier_post(store, obj, adr, adr_idx, val, bt, use_precise); 1581 break; 1582 1583 case BarrierSet::CardTableForRS: 1584 case BarrierSet::CardTableExtension: 1585 write_barrier_post(store, obj, adr, adr_idx, val, use_precise); 1586 break; 1587 1588 case BarrierSet::ModRef: 1589 case BarrierSet::Epsilon: 1590 break; 1591 1592 default : 1593 ShouldNotReachHere(); 1594 1595 } 1596 } 1597 1598 Node* GraphKit::store_oop(Node* ctl, 1599 Node* obj, 1600 Node* adr, 1601 const TypePtr* adr_type, 1602 Node* val, 1603 const TypeOopPtr* val_type, 1604 BasicType bt, 1605 bool use_precise, 1606 MemNode::MemOrd mo, 1607 bool mismatched) { 1608 // Transformation of a value which could be NULL pointer (CastPP #NULL) 1609 // could be delayed during Parse (for example, in adjust_map_after_if()). 1610 // Execute transformation here to avoid barrier generation in such case. 1611 if (_gvn.type(val) == TypePtr::NULL_PTR) 1612 val = _gvn.makecon(TypePtr::NULL_PTR); 1613 1614 set_control(ctl); 1615 if (stopped()) return top(); // Dead path ? 1616 1617 assert(bt == T_OBJECT, "sanity"); 1618 assert(val != NULL, "not dead path"); 1619 uint adr_idx = C->get_alias_index(adr_type); 1620 assert(adr_idx != Compile::AliasIdxTop, "use other store_to_memory factory" ); 1621 1622 pre_barrier(true /* do_load */, 1623 control(), obj, adr, adr_idx, val, val_type, 1624 NULL /* pre_val */, 1625 bt); 1626 1627 Node* store = store_to_memory(control(), adr, val, bt, adr_idx, mo, mismatched); 1628 post_barrier(control(), store, obj, adr, adr_idx, val, bt, use_precise); 1629 return store; 1630 } 1631 1632 // Could be an array or object we don't know at compile time (unsafe ref.) 1633 Node* GraphKit::store_oop_to_unknown(Node* ctl, 1634 Node* obj, // containing obj 1635 Node* adr, // actual adress to store val at 1636 const TypePtr* adr_type, 1637 Node* val, 1638 BasicType bt, 1639 MemNode::MemOrd mo, 1640 bool mismatched) { 1641 Compile::AliasType* at = C->alias_type(adr_type); 1642 const TypeOopPtr* val_type = NULL; 1643 if (adr_type->isa_instptr()) { 1644 if (at->field() != NULL) { 1645 // known field. This code is a copy of the do_put_xxx logic. 1646 ciField* field = at->field(); 1647 if (!field->type()->is_loaded()) { 1648 val_type = TypeInstPtr::BOTTOM; 1649 } else { 1650 val_type = TypeOopPtr::make_from_klass(field->type()->as_klass()); 1651 } 1652 } 1653 } else if (adr_type->isa_aryptr()) { 1654 val_type = adr_type->is_aryptr()->elem()->make_oopptr(); 1655 } 1656 if (val_type == NULL) { 1657 val_type = TypeInstPtr::BOTTOM; 1658 } 1659 return store_oop(ctl, obj, adr, adr_type, val, val_type, bt, true, mo, mismatched); 1660 } 1661 1662 1663 //-------------------------array_element_address------------------------- 1664 Node* GraphKit::array_element_address(Node* ary, Node* idx, BasicType elembt, 1665 const TypeInt* sizetype, Node* ctrl) { 1666 uint shift = exact_log2(type2aelembytes(elembt)); 1667 uint header = arrayOopDesc::base_offset_in_bytes(elembt); 1668 1669 // short-circuit a common case (saves lots of confusing waste motion) 1670 jint idx_con = find_int_con(idx, -1); 1671 if (idx_con >= 0) { 1672 intptr_t offset = header + ((intptr_t)idx_con << shift); 1673 return basic_plus_adr(ary, offset); 1674 } 1675 1676 // must be correct type for alignment purposes 1677 Node* base = basic_plus_adr(ary, header); 1678 idx = Compile::conv_I2X_index(&_gvn, idx, sizetype, ctrl); 1679 Node* scale = _gvn.transform( new LShiftXNode(idx, intcon(shift)) ); 1680 return basic_plus_adr(ary, base, scale); 1681 } 1682 1683 //-------------------------load_array_element------------------------- 1684 Node* GraphKit::load_array_element(Node* ctl, Node* ary, Node* idx, const TypeAryPtr* arytype) { 1685 const Type* elemtype = arytype->elem(); 1686 BasicType elembt = elemtype->array_element_basic_type(); 1687 Node* adr = array_element_address(ary, idx, elembt, arytype->size()); 1688 if (elembt == T_NARROWOOP) { 1689 elembt = T_OBJECT; // To satisfy switch in LoadNode::make() 1690 } 1691 Node* ld = make_load(ctl, adr, elemtype, elembt, arytype, MemNode::unordered); 1692 return ld; 1693 } 1694 1695 //-------------------------set_arguments_for_java_call------------------------- 1696 // Arguments (pre-popped from the stack) are taken from the JVMS. 1697 void GraphKit::set_arguments_for_java_call(CallJavaNode* call) { 1698 // Add the call arguments: 1699 uint nargs = call->method()->arg_size(); 1700 for (uint i = 0; i < nargs; i++) { 1701 Node* arg = argument(i); 1702 call->init_req(i + TypeFunc::Parms, arg); 1703 } 1704 } 1705 1706 //---------------------------set_edges_for_java_call--------------------------- 1707 // Connect a newly created call into the current JVMS. 1708 // A return value node (if any) is returned from set_edges_for_java_call. 1709 void GraphKit::set_edges_for_java_call(CallJavaNode* call, bool must_throw, bool separate_io_proj) { 1710 1711 // Add the predefined inputs: 1712 call->init_req( TypeFunc::Control, control() ); 1713 call->init_req( TypeFunc::I_O , i_o() ); 1714 call->init_req( TypeFunc::Memory , reset_memory() ); 1715 call->init_req( TypeFunc::FramePtr, frameptr() ); 1716 call->init_req( TypeFunc::ReturnAdr, top() ); 1717 1718 add_safepoint_edges(call, must_throw); 1719 1720 Node* xcall = _gvn.transform(call); 1721 1722 if (xcall == top()) { 1723 set_control(top()); 1724 return; 1725 } 1726 assert(xcall == call, "call identity is stable"); 1727 1728 // Re-use the current map to produce the result. 1729 1730 set_control(_gvn.transform(new ProjNode(call, TypeFunc::Control))); 1731 set_i_o( _gvn.transform(new ProjNode(call, TypeFunc::I_O , separate_io_proj))); 1732 set_all_memory_call(xcall, separate_io_proj); 1733 1734 //return xcall; // no need, caller already has it 1735 } 1736 1737 Node* GraphKit::set_results_for_java_call(CallJavaNode* call, bool separate_io_proj) { 1738 if (stopped()) return top(); // maybe the call folded up? 1739 1740 // Capture the return value, if any. 1741 Node* ret; 1742 if (call->method() == NULL || 1743 call->method()->return_type()->basic_type() == T_VOID) 1744 ret = top(); 1745 else ret = _gvn.transform(new ProjNode(call, TypeFunc::Parms)); 1746 1747 // Note: Since any out-of-line call can produce an exception, 1748 // we always insert an I_O projection from the call into the result. 1749 1750 make_slow_call_ex(call, env()->Throwable_klass(), separate_io_proj); 1751 1752 if (separate_io_proj) { 1753 // The caller requested separate projections be used by the fall 1754 // through and exceptional paths, so replace the projections for 1755 // the fall through path. 1756 set_i_o(_gvn.transform( new ProjNode(call, TypeFunc::I_O) )); 1757 set_all_memory(_gvn.transform( new ProjNode(call, TypeFunc::Memory) )); 1758 } 1759 return ret; 1760 } 1761 1762 //--------------------set_predefined_input_for_runtime_call-------------------- 1763 // Reading and setting the memory state is way conservative here. 1764 // The real problem is that I am not doing real Type analysis on memory, 1765 // so I cannot distinguish card mark stores from other stores. Across a GC 1766 // point the Store Barrier and the card mark memory has to agree. I cannot 1767 // have a card mark store and its barrier split across the GC point from 1768 // either above or below. Here I get that to happen by reading ALL of memory. 1769 // A better answer would be to separate out card marks from other memory. 1770 // For now, return the input memory state, so that it can be reused 1771 // after the call, if this call has restricted memory effects. 1772 Node* GraphKit::set_predefined_input_for_runtime_call(SafePointNode* call) { 1773 // Set fixed predefined input arguments 1774 Node* memory = reset_memory(); 1775 call->init_req( TypeFunc::Control, control() ); 1776 call->init_req( TypeFunc::I_O, top() ); // does no i/o 1777 call->init_req( TypeFunc::Memory, memory ); // may gc ptrs 1778 call->init_req( TypeFunc::FramePtr, frameptr() ); 1779 call->init_req( TypeFunc::ReturnAdr, top() ); 1780 return memory; 1781 } 1782 1783 //-------------------set_predefined_output_for_runtime_call-------------------- 1784 // Set control and memory (not i_o) from the call. 1785 // If keep_mem is not NULL, use it for the output state, 1786 // except for the RawPtr output of the call, if hook_mem is TypeRawPtr::BOTTOM. 1787 // If hook_mem is NULL, this call produces no memory effects at all. 1788 // If hook_mem is a Java-visible memory slice (such as arraycopy operands), 1789 // then only that memory slice is taken from the call. 1790 // In the last case, we must put an appropriate memory barrier before 1791 // the call, so as to create the correct anti-dependencies on loads 1792 // preceding the call. 1793 void GraphKit::set_predefined_output_for_runtime_call(Node* call, 1794 Node* keep_mem, 1795 const TypePtr* hook_mem) { 1796 // no i/o 1797 set_control(_gvn.transform( new ProjNode(call,TypeFunc::Control) )); 1798 if (keep_mem) { 1799 // First clone the existing memory state 1800 set_all_memory(keep_mem); 1801 if (hook_mem != NULL) { 1802 // Make memory for the call 1803 Node* mem = _gvn.transform( new ProjNode(call, TypeFunc::Memory) ); 1804 // Set the RawPtr memory state only. This covers all the heap top/GC stuff 1805 // We also use hook_mem to extract specific effects from arraycopy stubs. 1806 set_memory(mem, hook_mem); 1807 } 1808 // ...else the call has NO memory effects. 1809 1810 // Make sure the call advertises its memory effects precisely. 1811 // This lets us build accurate anti-dependences in gcm.cpp. 1812 assert(C->alias_type(call->adr_type()) == C->alias_type(hook_mem), 1813 "call node must be constructed correctly"); 1814 } else { 1815 assert(hook_mem == NULL, ""); 1816 // This is not a "slow path" call; all memory comes from the call. 1817 set_all_memory_call(call); 1818 } 1819 } 1820 1821 1822 // Replace the call with the current state of the kit. 1823 void GraphKit::replace_call(CallNode* call, Node* result, bool do_replaced_nodes) { 1824 JVMState* ejvms = NULL; 1825 if (has_exceptions()) { 1826 ejvms = transfer_exceptions_into_jvms(); 1827 } 1828 1829 ReplacedNodes replaced_nodes = map()->replaced_nodes(); 1830 ReplacedNodes replaced_nodes_exception; 1831 Node* ex_ctl = top(); 1832 1833 SafePointNode* final_state = stop(); 1834 1835 // Find all the needed outputs of this call 1836 CallProjections callprojs; 1837 call->extract_projections(&callprojs, true); 1838 1839 Node* init_mem = call->in(TypeFunc::Memory); 1840 Node* final_mem = final_state->in(TypeFunc::Memory); 1841 Node* final_ctl = final_state->in(TypeFunc::Control); 1842 Node* final_io = final_state->in(TypeFunc::I_O); 1843 1844 // Replace all the old call edges with the edges from the inlining result 1845 if (callprojs.fallthrough_catchproj != NULL) { 1846 C->gvn_replace_by(callprojs.fallthrough_catchproj, final_ctl); 1847 } 1848 if (callprojs.fallthrough_memproj != NULL) { 1849 if (final_mem->is_MergeMem()) { 1850 // Parser's exits MergeMem was not transformed but may be optimized 1851 final_mem = _gvn.transform(final_mem); 1852 } 1853 C->gvn_replace_by(callprojs.fallthrough_memproj, final_mem); 1854 } 1855 if (callprojs.fallthrough_ioproj != NULL) { 1856 C->gvn_replace_by(callprojs.fallthrough_ioproj, final_io); 1857 } 1858 1859 // Replace the result with the new result if it exists and is used 1860 if (callprojs.resproj != NULL && result != NULL) { 1861 C->gvn_replace_by(callprojs.resproj, result); 1862 } 1863 1864 if (ejvms == NULL) { 1865 // No exception edges to simply kill off those paths 1866 if (callprojs.catchall_catchproj != NULL) { 1867 C->gvn_replace_by(callprojs.catchall_catchproj, C->top()); 1868 } 1869 if (callprojs.catchall_memproj != NULL) { 1870 C->gvn_replace_by(callprojs.catchall_memproj, C->top()); 1871 } 1872 if (callprojs.catchall_ioproj != NULL) { 1873 C->gvn_replace_by(callprojs.catchall_ioproj, C->top()); 1874 } 1875 // Replace the old exception object with top 1876 if (callprojs.exobj != NULL) { 1877 C->gvn_replace_by(callprojs.exobj, C->top()); 1878 } 1879 } else { 1880 GraphKit ekit(ejvms); 1881 1882 // Load my combined exception state into the kit, with all phis transformed: 1883 SafePointNode* ex_map = ekit.combine_and_pop_all_exception_states(); 1884 replaced_nodes_exception = ex_map->replaced_nodes(); 1885 1886 Node* ex_oop = ekit.use_exception_state(ex_map); 1887 1888 if (callprojs.catchall_catchproj != NULL) { 1889 C->gvn_replace_by(callprojs.catchall_catchproj, ekit.control()); 1890 ex_ctl = ekit.control(); 1891 } 1892 if (callprojs.catchall_memproj != NULL) { 1893 C->gvn_replace_by(callprojs.catchall_memproj, ekit.reset_memory()); 1894 } 1895 if (callprojs.catchall_ioproj != NULL) { 1896 C->gvn_replace_by(callprojs.catchall_ioproj, ekit.i_o()); 1897 } 1898 1899 // Replace the old exception object with the newly created one 1900 if (callprojs.exobj != NULL) { 1901 C->gvn_replace_by(callprojs.exobj, ex_oop); 1902 } 1903 } 1904 1905 // Disconnect the call from the graph 1906 call->disconnect_inputs(NULL, C); 1907 C->gvn_replace_by(call, C->top()); 1908 1909 // Clean up any MergeMems that feed other MergeMems since the 1910 // optimizer doesn't like that. 1911 if (final_mem->is_MergeMem()) { 1912 Node_List wl; 1913 for (SimpleDUIterator i(final_mem); i.has_next(); i.next()) { 1914 Node* m = i.get(); 1915 if (m->is_MergeMem() && !wl.contains(m)) { 1916 wl.push(m); 1917 } 1918 } 1919 while (wl.size() > 0) { 1920 _gvn.transform(wl.pop()); 1921 } 1922 } 1923 1924 if (callprojs.fallthrough_catchproj != NULL && !final_ctl->is_top() && do_replaced_nodes) { 1925 replaced_nodes.apply(C, final_ctl); 1926 } 1927 if (!ex_ctl->is_top() && do_replaced_nodes) { 1928 replaced_nodes_exception.apply(C, ex_ctl); 1929 } 1930 } 1931 1932 1933 //------------------------------increment_counter------------------------------ 1934 // for statistics: increment a VM counter by 1 1935 1936 void GraphKit::increment_counter(address counter_addr) { 1937 Node* adr1 = makecon(TypeRawPtr::make(counter_addr)); 1938 increment_counter(adr1); 1939 } 1940 1941 void GraphKit::increment_counter(Node* counter_addr) { 1942 int adr_type = Compile::AliasIdxRaw; 1943 Node* ctrl = control(); 1944 Node* cnt = make_load(ctrl, counter_addr, TypeInt::INT, T_INT, adr_type, MemNode::unordered); 1945 Node* incr = _gvn.transform(new AddINode(cnt, _gvn.intcon(1))); 1946 store_to_memory(ctrl, counter_addr, incr, T_INT, adr_type, MemNode::unordered); 1947 } 1948 1949 1950 //------------------------------uncommon_trap---------------------------------- 1951 // Bail out to the interpreter in mid-method. Implemented by calling the 1952 // uncommon_trap blob. This helper function inserts a runtime call with the 1953 // right debug info. 1954 void GraphKit::uncommon_trap(int trap_request, 1955 ciKlass* klass, const char* comment, 1956 bool must_throw, 1957 bool keep_exact_action) { 1958 if (failing()) stop(); 1959 if (stopped()) return; // trap reachable? 1960 1961 // Note: If ProfileTraps is true, and if a deopt. actually 1962 // occurs here, the runtime will make sure an MDO exists. There is 1963 // no need to call method()->ensure_method_data() at this point. 1964 1965 // Set the stack pointer to the right value for reexecution: 1966 set_sp(reexecute_sp()); 1967 1968 #ifdef ASSERT 1969 if (!must_throw) { 1970 // Make sure the stack has at least enough depth to execute 1971 // the current bytecode. 1972 int inputs, ignored_depth; 1973 if (compute_stack_effects(inputs, ignored_depth)) { 1974 assert(sp() >= inputs, "must have enough JVMS stack to execute %s: sp=%d, inputs=%d", 1975 Bytecodes::name(java_bc()), sp(), inputs); 1976 } 1977 } 1978 #endif 1979 1980 Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(trap_request); 1981 Deoptimization::DeoptAction action = Deoptimization::trap_request_action(trap_request); 1982 1983 switch (action) { 1984 case Deoptimization::Action_maybe_recompile: 1985 case Deoptimization::Action_reinterpret: 1986 // Temporary fix for 6529811 to allow virtual calls to be sure they 1987 // get the chance to go from mono->bi->mega 1988 if (!keep_exact_action && 1989 Deoptimization::trap_request_index(trap_request) < 0 && 1990 too_many_recompiles(reason)) { 1991 // This BCI is causing too many recompilations. 1992 if (C->log() != NULL) { 1993 C->log()->elem("observe that='trap_action_change' reason='%s' from='%s' to='none'", 1994 Deoptimization::trap_reason_name(reason), 1995 Deoptimization::trap_action_name(action)); 1996 } 1997 action = Deoptimization::Action_none; 1998 trap_request = Deoptimization::make_trap_request(reason, action); 1999 } else { 2000 C->set_trap_can_recompile(true); 2001 } 2002 break; 2003 case Deoptimization::Action_make_not_entrant: 2004 C->set_trap_can_recompile(true); 2005 break; 2006 #ifdef ASSERT 2007 case Deoptimization::Action_none: 2008 case Deoptimization::Action_make_not_compilable: 2009 break; 2010 default: 2011 fatal("unknown action %d: %s", action, Deoptimization::trap_action_name(action)); 2012 break; 2013 #endif 2014 } 2015 2016 if (TraceOptoParse) { 2017 char buf[100]; 2018 tty->print_cr("Uncommon trap %s at bci:%d", 2019 Deoptimization::format_trap_request(buf, sizeof(buf), 2020 trap_request), bci()); 2021 } 2022 2023 CompileLog* log = C->log(); 2024 if (log != NULL) { 2025 int kid = (klass == NULL)? -1: log->identify(klass); 2026 log->begin_elem("uncommon_trap bci='%d'", bci()); 2027 char buf[100]; 2028 log->print(" %s", Deoptimization::format_trap_request(buf, sizeof(buf), 2029 trap_request)); 2030 if (kid >= 0) log->print(" klass='%d'", kid); 2031 if (comment != NULL) log->print(" comment='%s'", comment); 2032 log->end_elem(); 2033 } 2034 2035 // Make sure any guarding test views this path as very unlikely 2036 Node *i0 = control()->in(0); 2037 if (i0 != NULL && i0->is_If()) { // Found a guarding if test? 2038 IfNode *iff = i0->as_If(); 2039 float f = iff->_prob; // Get prob 2040 if (control()->Opcode() == Op_IfTrue) { 2041 if (f > PROB_UNLIKELY_MAG(4)) 2042 iff->_prob = PROB_MIN; 2043 } else { 2044 if (f < PROB_LIKELY_MAG(4)) 2045 iff->_prob = PROB_MAX; 2046 } 2047 } 2048 2049 // Clear out dead values from the debug info. 2050 kill_dead_locals(); 2051 2052 // Now insert the uncommon trap subroutine call 2053 address call_addr = SharedRuntime::uncommon_trap_blob()->entry_point(); 2054 const TypePtr* no_memory_effects = NULL; 2055 // Pass the index of the class to be loaded 2056 Node* call = make_runtime_call(RC_NO_LEAF | RC_UNCOMMON | 2057 (must_throw ? RC_MUST_THROW : 0), 2058 OptoRuntime::uncommon_trap_Type(), 2059 call_addr, "uncommon_trap", no_memory_effects, 2060 intcon(trap_request)); 2061 assert(call->as_CallStaticJava()->uncommon_trap_request() == trap_request, 2062 "must extract request correctly from the graph"); 2063 assert(trap_request != 0, "zero value reserved by uncommon_trap_request"); 2064 2065 call->set_req(TypeFunc::ReturnAdr, returnadr()); 2066 // The debug info is the only real input to this call. 2067 2068 // Halt-and-catch fire here. The above call should never return! 2069 HaltNode* halt = new HaltNode(control(), frameptr()); 2070 _gvn.set_type_bottom(halt); 2071 root()->add_req(halt); 2072 2073 stop_and_kill_map(); 2074 } 2075 2076 2077 //--------------------------just_allocated_object------------------------------ 2078 // Report the object that was just allocated. 2079 // It must be the case that there are no intervening safepoints. 2080 // We use this to determine if an object is so "fresh" that 2081 // it does not require card marks. 2082 Node* GraphKit::just_allocated_object(Node* current_control) { 2083 if (C->recent_alloc_ctl() == current_control) 2084 return C->recent_alloc_obj(); 2085 return NULL; 2086 } 2087 2088 2089 void GraphKit::round_double_arguments(ciMethod* dest_method) { 2090 // (Note: TypeFunc::make has a cache that makes this fast.) 2091 const TypeFunc* tf = TypeFunc::make(dest_method); 2092 int nargs = tf->domain()->cnt() - TypeFunc::Parms; 2093 for (int j = 0; j < nargs; j++) { 2094 const Type *targ = tf->domain()->field_at(j + TypeFunc::Parms); 2095 if( targ->basic_type() == T_DOUBLE ) { 2096 // If any parameters are doubles, they must be rounded before 2097 // the call, dstore_rounding does gvn.transform 2098 Node *arg = argument(j); 2099 arg = dstore_rounding(arg); 2100 set_argument(j, arg); 2101 } 2102 } 2103 } 2104 2105 /** 2106 * Record profiling data exact_kls for Node n with the type system so 2107 * that it can propagate it (speculation) 2108 * 2109 * @param n node that the type applies to 2110 * @param exact_kls type from profiling 2111 * @param maybe_null did profiling see null? 2112 * 2113 * @return node with improved type 2114 */ 2115 Node* GraphKit::record_profile_for_speculation(Node* n, ciKlass* exact_kls, bool maybe_null) { 2116 const Type* current_type = _gvn.type(n); 2117 assert(UseTypeSpeculation, "type speculation must be on"); 2118 2119 const TypePtr* speculative = current_type->speculative(); 2120 2121 // Should the klass from the profile be recorded in the speculative type? 2122 if (current_type->would_improve_type(exact_kls, jvms()->depth())) { 2123 const TypeKlassPtr* tklass = TypeKlassPtr::make(exact_kls); 2124 const TypeOopPtr* xtype = tklass->as_instance_type(); 2125 assert(xtype->klass_is_exact(), "Should be exact"); 2126 // Any reason to believe n is not null (from this profiling or a previous one)? 2127 const TypePtr* ptr = (maybe_null && current_type->speculative_maybe_null()) ? TypePtr::BOTTOM : TypePtr::NOTNULL; 2128 // record the new speculative type's depth 2129 speculative = xtype->cast_to_ptr_type(ptr->ptr())->is_ptr(); 2130 speculative = speculative->with_inline_depth(jvms()->depth()); 2131 } else if (current_type->would_improve_ptr(maybe_null)) { 2132 // Profiling report that null was never seen so we can change the 2133 // speculative type to non null ptr. 2134 assert(!maybe_null, "nothing to improve"); 2135 if (speculative == NULL) { 2136 speculative = TypePtr::NOTNULL; 2137 } else { 2138 const TypePtr* ptr = TypePtr::NOTNULL; 2139 speculative = speculative->cast_to_ptr_type(ptr->ptr())->is_ptr(); 2140 } 2141 } 2142 2143 if (speculative != current_type->speculative()) { 2144 // Build a type with a speculative type (what we think we know 2145 // about the type but will need a guard when we use it) 2146 const TypeOopPtr* spec_type = TypeOopPtr::make(TypePtr::BotPTR, Type::OffsetBot, TypeOopPtr::InstanceBot, speculative); 2147 // We're changing the type, we need a new CheckCast node to carry 2148 // the new type. The new type depends on the control: what 2149 // profiling tells us is only valid from here as far as we can 2150 // tell. 2151 Node* cast = new CheckCastPPNode(control(), n, current_type->remove_speculative()->join_speculative(spec_type)); 2152 cast = _gvn.transform(cast); 2153 replace_in_map(n, cast); 2154 n = cast; 2155 } 2156 2157 return n; 2158 } 2159 2160 /** 2161 * Record profiling data from receiver profiling at an invoke with the 2162 * type system so that it can propagate it (speculation) 2163 * 2164 * @param n receiver node 2165 * 2166 * @return node with improved type 2167 */ 2168 Node* GraphKit::record_profiled_receiver_for_speculation(Node* n) { 2169 if (!UseTypeSpeculation) { 2170 return n; 2171 } 2172 ciKlass* exact_kls = profile_has_unique_klass(); 2173 bool maybe_null = true; 2174 if (java_bc() == Bytecodes::_checkcast || 2175 java_bc() == Bytecodes::_instanceof || 2176 java_bc() == Bytecodes::_aastore) { 2177 ciProfileData* data = method()->method_data()->bci_to_data(bci()); 2178 maybe_null = data == NULL ? true : data->as_BitData()->null_seen(); 2179 } 2180 return record_profile_for_speculation(n, exact_kls, maybe_null); 2181 } 2182 2183 /** 2184 * Record profiling data from argument profiling at an invoke with the 2185 * type system so that it can propagate it (speculation) 2186 * 2187 * @param dest_method target method for the call 2188 * @param bc what invoke bytecode is this? 2189 */ 2190 void GraphKit::record_profiled_arguments_for_speculation(ciMethod* dest_method, Bytecodes::Code bc) { 2191 if (!UseTypeSpeculation) { 2192 return; 2193 } 2194 const TypeFunc* tf = TypeFunc::make(dest_method); 2195 int nargs = tf->domain()->cnt() - TypeFunc::Parms; 2196 int skip = Bytecodes::has_receiver(bc) ? 1 : 0; 2197 for (int j = skip, i = 0; j < nargs && i < TypeProfileArgsLimit; j++) { 2198 const Type *targ = tf->domain()->field_at(j + TypeFunc::Parms); 2199 if (targ->basic_type() == T_OBJECT || targ->basic_type() == T_ARRAY) { 2200 bool maybe_null = true; 2201 ciKlass* better_type = NULL; 2202 if (method()->argument_profiled_type(bci(), i, better_type, maybe_null)) { 2203 record_profile_for_speculation(argument(j), better_type, maybe_null); 2204 } 2205 i++; 2206 } 2207 } 2208 } 2209 2210 /** 2211 * Record profiling data from parameter profiling at an invoke with 2212 * the type system so that it can propagate it (speculation) 2213 */ 2214 void GraphKit::record_profiled_parameters_for_speculation() { 2215 if (!UseTypeSpeculation) { 2216 return; 2217 } 2218 for (int i = 0, j = 0; i < method()->arg_size() ; i++) { 2219 if (_gvn.type(local(i))->isa_oopptr()) { 2220 bool maybe_null = true; 2221 ciKlass* better_type = NULL; 2222 if (method()->parameter_profiled_type(j, better_type, maybe_null)) { 2223 record_profile_for_speculation(local(i), better_type, maybe_null); 2224 } 2225 j++; 2226 } 2227 } 2228 } 2229 2230 /** 2231 * Record profiling data from return value profiling at an invoke with 2232 * the type system so that it can propagate it (speculation) 2233 */ 2234 void GraphKit::record_profiled_return_for_speculation() { 2235 if (!UseTypeSpeculation) { 2236 return; 2237 } 2238 bool maybe_null = true; 2239 ciKlass* better_type = NULL; 2240 if (method()->return_profiled_type(bci(), better_type, maybe_null)) { 2241 // If profiling reports a single type for the return value, 2242 // feed it to the type system so it can propagate it as a 2243 // speculative type 2244 record_profile_for_speculation(stack(sp()-1), better_type, maybe_null); 2245 } 2246 } 2247 2248 void GraphKit::round_double_result(ciMethod* dest_method) { 2249 // A non-strict method may return a double value which has an extended 2250 // exponent, but this must not be visible in a caller which is 'strict' 2251 // If a strict caller invokes a non-strict callee, round a double result 2252 2253 BasicType result_type = dest_method->return_type()->basic_type(); 2254 assert( method() != NULL, "must have caller context"); 2255 if( result_type == T_DOUBLE && method()->is_strict() && !dest_method->is_strict() ) { 2256 // Destination method's return value is on top of stack 2257 // dstore_rounding() does gvn.transform 2258 Node *result = pop_pair(); 2259 result = dstore_rounding(result); 2260 push_pair(result); 2261 } 2262 } 2263 2264 // rounding for strict float precision conformance 2265 Node* GraphKit::precision_rounding(Node* n) { 2266 return UseStrictFP && _method->flags().is_strict() 2267 && UseSSE == 0 && Matcher::strict_fp_requires_explicit_rounding 2268 ? _gvn.transform( new RoundFloatNode(0, n) ) 2269 : n; 2270 } 2271 2272 // rounding for strict double precision conformance 2273 Node* GraphKit::dprecision_rounding(Node *n) { 2274 return UseStrictFP && _method->flags().is_strict() 2275 && UseSSE <= 1 && Matcher::strict_fp_requires_explicit_rounding 2276 ? _gvn.transform( new RoundDoubleNode(0, n) ) 2277 : n; 2278 } 2279 2280 // rounding for non-strict double stores 2281 Node* GraphKit::dstore_rounding(Node* n) { 2282 return Matcher::strict_fp_requires_explicit_rounding 2283 && UseSSE <= 1 2284 ? _gvn.transform( new RoundDoubleNode(0, n) ) 2285 : n; 2286 } 2287 2288 //============================================================================= 2289 // Generate a fast path/slow path idiom. Graph looks like: 2290 // [foo] indicates that 'foo' is a parameter 2291 // 2292 // [in] NULL 2293 // \ / 2294 // CmpP 2295 // Bool ne 2296 // If 2297 // / \ 2298 // True False-<2> 2299 // / | 2300 // / cast_not_null 2301 // Load | | ^ 2302 // [fast_test] | | 2303 // gvn to opt_test | | 2304 // / \ | <1> 2305 // True False | 2306 // | \\ | 2307 // [slow_call] \[fast_result] 2308 // Ctl Val \ \ 2309 // | \ \ 2310 // Catch <1> \ \ 2311 // / \ ^ \ \ 2312 // Ex No_Ex | \ \ 2313 // | \ \ | \ <2> \ 2314 // ... \ [slow_res] | | \ [null_result] 2315 // \ \--+--+--- | | 2316 // \ | / \ | / 2317 // --------Region Phi 2318 // 2319 //============================================================================= 2320 // Code is structured as a series of driver functions all called 'do_XXX' that 2321 // call a set of helper functions. Helper functions first, then drivers. 2322 2323 //------------------------------null_check_oop--------------------------------- 2324 // Null check oop. Set null-path control into Region in slot 3. 2325 // Make a cast-not-nullness use the other not-null control. Return cast. 2326 Node* GraphKit::null_check_oop(Node* value, Node* *null_control, 2327 bool never_see_null, 2328 bool safe_for_replace, 2329 bool speculative) { 2330 // Initial NULL check taken path 2331 (*null_control) = top(); 2332 Node* cast = null_check_common(value, T_OBJECT, false, null_control, speculative); 2333 2334 // Generate uncommon_trap: 2335 if (never_see_null && (*null_control) != top()) { 2336 // If we see an unexpected null at a check-cast we record it and force a 2337 // recompile; the offending check-cast will be compiled to handle NULLs. 2338 // If we see more than one offending BCI, then all checkcasts in the 2339 // method will be compiled to handle NULLs. 2340 PreserveJVMState pjvms(this); 2341 set_control(*null_control); 2342 replace_in_map(value, null()); 2343 Deoptimization::DeoptReason reason = Deoptimization::reason_null_check(speculative); 2344 uncommon_trap(reason, 2345 Deoptimization::Action_make_not_entrant); 2346 (*null_control) = top(); // NULL path is dead 2347 } 2348 if ((*null_control) == top() && safe_for_replace) { 2349 replace_in_map(value, cast); 2350 } 2351 2352 // Cast away null-ness on the result 2353 return cast; 2354 } 2355 2356 //------------------------------opt_iff---------------------------------------- 2357 // Optimize the fast-check IfNode. Set the fast-path region slot 2. 2358 // Return slow-path control. 2359 Node* GraphKit::opt_iff(Node* region, Node* iff) { 2360 IfNode *opt_iff = _gvn.transform(iff)->as_If(); 2361 2362 // Fast path taken; set region slot 2 2363 Node *fast_taken = _gvn.transform( new IfFalseNode(opt_iff) ); 2364 region->init_req(2,fast_taken); // Capture fast-control 2365 2366 // Fast path not-taken, i.e. slow path 2367 Node *slow_taken = _gvn.transform( new IfTrueNode(opt_iff) ); 2368 return slow_taken; 2369 } 2370 2371 //-----------------------------make_runtime_call------------------------------- 2372 Node* GraphKit::make_runtime_call(int flags, 2373 const TypeFunc* call_type, address call_addr, 2374 const char* call_name, 2375 const TypePtr* adr_type, 2376 // The following parms are all optional. 2377 // The first NULL ends the list. 2378 Node* parm0, Node* parm1, 2379 Node* parm2, Node* parm3, 2380 Node* parm4, Node* parm5, 2381 Node* parm6, Node* parm7) { 2382 // Slow-path call 2383 bool is_leaf = !(flags & RC_NO_LEAF); 2384 bool has_io = (!is_leaf && !(flags & RC_NO_IO)); 2385 if (call_name == NULL) { 2386 assert(!is_leaf, "must supply name for leaf"); 2387 call_name = OptoRuntime::stub_name(call_addr); 2388 } 2389 CallNode* call; 2390 if (!is_leaf) { 2391 call = new CallStaticJavaNode(call_type, call_addr, call_name, 2392 bci(), adr_type); 2393 } else if (flags & RC_NO_FP) { 2394 call = new CallLeafNoFPNode(call_type, call_addr, call_name, adr_type); 2395 } else { 2396 call = new CallLeafNode(call_type, call_addr, call_name, adr_type); 2397 } 2398 2399 // The following is similar to set_edges_for_java_call, 2400 // except that the memory effects of the call are restricted to AliasIdxRaw. 2401 2402 // Slow path call has no side-effects, uses few values 2403 bool wide_in = !(flags & RC_NARROW_MEM); 2404 bool wide_out = (C->get_alias_index(adr_type) == Compile::AliasIdxBot); 2405 2406 Node* prev_mem = NULL; 2407 if (wide_in) { 2408 prev_mem = set_predefined_input_for_runtime_call(call); 2409 } else { 2410 assert(!wide_out, "narrow in => narrow out"); 2411 Node* narrow_mem = memory(adr_type); 2412 prev_mem = reset_memory(); 2413 map()->set_memory(narrow_mem); 2414 set_predefined_input_for_runtime_call(call); 2415 } 2416 2417 // Hook each parm in order. Stop looking at the first NULL. 2418 if (parm0 != NULL) { call->init_req(TypeFunc::Parms+0, parm0); 2419 if (parm1 != NULL) { call->init_req(TypeFunc::Parms+1, parm1); 2420 if (parm2 != NULL) { call->init_req(TypeFunc::Parms+2, parm2); 2421 if (parm3 != NULL) { call->init_req(TypeFunc::Parms+3, parm3); 2422 if (parm4 != NULL) { call->init_req(TypeFunc::Parms+4, parm4); 2423 if (parm5 != NULL) { call->init_req(TypeFunc::Parms+5, parm5); 2424 if (parm6 != NULL) { call->init_req(TypeFunc::Parms+6, parm6); 2425 if (parm7 != NULL) { call->init_req(TypeFunc::Parms+7, parm7); 2426 /* close each nested if ===> */ } } } } } } } } 2427 assert(call->in(call->req()-1) != NULL, "must initialize all parms"); 2428 2429 if (!is_leaf) { 2430 // Non-leaves can block and take safepoints: 2431 add_safepoint_edges(call, ((flags & RC_MUST_THROW) != 0)); 2432 } 2433 // Non-leaves can throw exceptions: 2434 if (has_io) { 2435 call->set_req(TypeFunc::I_O, i_o()); 2436 } 2437 2438 if (flags & RC_UNCOMMON) { 2439 // Set the count to a tiny probability. Cf. Estimate_Block_Frequency. 2440 // (An "if" probability corresponds roughly to an unconditional count. 2441 // Sort of.) 2442 call->set_cnt(PROB_UNLIKELY_MAG(4)); 2443 } 2444 2445 Node* c = _gvn.transform(call); 2446 assert(c == call, "cannot disappear"); 2447 2448 if (wide_out) { 2449 // Slow path call has full side-effects. 2450 set_predefined_output_for_runtime_call(call); 2451 } else { 2452 // Slow path call has few side-effects, and/or sets few values. 2453 set_predefined_output_for_runtime_call(call, prev_mem, adr_type); 2454 } 2455 2456 if (has_io) { 2457 set_i_o(_gvn.transform(new ProjNode(call, TypeFunc::I_O))); 2458 } 2459 return call; 2460 2461 } 2462 2463 //------------------------------merge_memory----------------------------------- 2464 // Merge memory from one path into the current memory state. 2465 void GraphKit::merge_memory(Node* new_mem, Node* region, int new_path) { 2466 for (MergeMemStream mms(merged_memory(), new_mem->as_MergeMem()); mms.next_non_empty2(); ) { 2467 Node* old_slice = mms.force_memory(); 2468 Node* new_slice = mms.memory2(); 2469 if (old_slice != new_slice) { 2470 PhiNode* phi; 2471 if (old_slice->is_Phi() && old_slice->as_Phi()->region() == region) { 2472 if (mms.is_empty()) { 2473 // clone base memory Phi's inputs for this memory slice 2474 assert(old_slice == mms.base_memory(), "sanity"); 2475 phi = PhiNode::make(region, NULL, Type::MEMORY, mms.adr_type(C)); 2476 _gvn.set_type(phi, Type::MEMORY); 2477 for (uint i = 1; i < phi->req(); i++) { 2478 phi->init_req(i, old_slice->in(i)); 2479 } 2480 } else { 2481 phi = old_slice->as_Phi(); // Phi was generated already 2482 } 2483 } else { 2484 phi = PhiNode::make(region, old_slice, Type::MEMORY, mms.adr_type(C)); 2485 _gvn.set_type(phi, Type::MEMORY); 2486 } 2487 phi->set_req(new_path, new_slice); 2488 mms.set_memory(phi); 2489 } 2490 } 2491 } 2492 2493 //------------------------------make_slow_call_ex------------------------------ 2494 // Make the exception handler hookups for the slow call 2495 void GraphKit::make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize) { 2496 if (stopped()) return; 2497 2498 // Make a catch node with just two handlers: fall-through and catch-all 2499 Node* i_o = _gvn.transform( new ProjNode(call, TypeFunc::I_O, separate_io_proj) ); 2500 Node* catc = _gvn.transform( new CatchNode(control(), i_o, 2) ); 2501 Node* norm = _gvn.transform( new CatchProjNode(catc, CatchProjNode::fall_through_index, CatchProjNode::no_handler_bci) ); 2502 Node* excp = _gvn.transform( new CatchProjNode(catc, CatchProjNode::catch_all_index, CatchProjNode::no_handler_bci) ); 2503 2504 { PreserveJVMState pjvms(this); 2505 set_control(excp); 2506 set_i_o(i_o); 2507 2508 if (excp != top()) { 2509 if (deoptimize) { 2510 // Deoptimize if an exception is caught. Don't construct exception state in this case. 2511 uncommon_trap(Deoptimization::Reason_unhandled, 2512 Deoptimization::Action_none); 2513 } else { 2514 // Create an exception state also. 2515 // Use an exact type if the caller has specified a specific exception. 2516 const Type* ex_type = TypeOopPtr::make_from_klass_unique(ex_klass)->cast_to_ptr_type(TypePtr::NotNull); 2517 Node* ex_oop = new CreateExNode(ex_type, control(), i_o); 2518 add_exception_state(make_exception_state(_gvn.transform(ex_oop))); 2519 } 2520 } 2521 } 2522 2523 // Get the no-exception control from the CatchNode. 2524 set_control(norm); 2525 } 2526 2527 static IfNode* gen_subtype_check_compare(Node* ctrl, Node* in1, Node* in2, BoolTest::mask test, float p, PhaseGVN* gvn, BasicType bt) { 2528 Node* cmp = NULL; 2529 switch(bt) { 2530 case T_INT: cmp = new CmpINode(in1, in2); break; 2531 case T_ADDRESS: cmp = new CmpPNode(in1, in2); break; 2532 default: fatal("unexpected comparison type %s", type2name(bt)); 2533 } 2534 gvn->transform(cmp); 2535 Node* bol = gvn->transform(new BoolNode(cmp, test)); 2536 IfNode* iff = new IfNode(ctrl, bol, p, COUNT_UNKNOWN); 2537 gvn->transform(iff); 2538 if (!bol->is_Con()) gvn->record_for_igvn(iff); 2539 return iff; 2540 } 2541 2542 2543 //-------------------------------gen_subtype_check----------------------------- 2544 // Generate a subtyping check. Takes as input the subtype and supertype. 2545 // Returns 2 values: sets the default control() to the true path and returns 2546 // the false path. Only reads invariant memory; sets no (visible) memory. 2547 // The PartialSubtypeCheckNode sets the hidden 1-word cache in the encoding 2548 // but that's not exposed to the optimizer. This call also doesn't take in an 2549 // Object; if you wish to check an Object you need to load the Object's class 2550 // prior to coming here. 2551 Node* Phase::gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, MergeMemNode* mem, PhaseGVN* gvn) { 2552 Compile* C = gvn->C; 2553 2554 if ((*ctrl)->is_top()) { 2555 return C->top(); 2556 } 2557 2558 // Fast check for identical types, perhaps identical constants. 2559 // The types can even be identical non-constants, in cases 2560 // involving Array.newInstance, Object.clone, etc. 2561 if (subklass == superklass) 2562 return C->top(); // false path is dead; no test needed. 2563 2564 if (gvn->type(superklass)->singleton()) { 2565 ciKlass* superk = gvn->type(superklass)->is_klassptr()->klass(); 2566 ciKlass* subk = gvn->type(subklass)->is_klassptr()->klass(); 2567 2568 // In the common case of an exact superklass, try to fold up the 2569 // test before generating code. You may ask, why not just generate 2570 // the code and then let it fold up? The answer is that the generated 2571 // code will necessarily include null checks, which do not always 2572 // completely fold away. If they are also needless, then they turn 2573 // into a performance loss. Example: 2574 // Foo[] fa = blah(); Foo x = fa[0]; fa[1] = x; 2575 // Here, the type of 'fa' is often exact, so the store check 2576 // of fa[1]=x will fold up, without testing the nullness of x. 2577 switch (C->static_subtype_check(superk, subk)) { 2578 case Compile::SSC_always_false: 2579 { 2580 Node* always_fail = *ctrl; 2581 *ctrl = gvn->C->top(); 2582 return always_fail; 2583 } 2584 case Compile::SSC_always_true: 2585 return C->top(); 2586 case Compile::SSC_easy_test: 2587 { 2588 // Just do a direct pointer compare and be done. 2589 IfNode* iff = gen_subtype_check_compare(*ctrl, subklass, superklass, BoolTest::eq, PROB_STATIC_FREQUENT, gvn, T_ADDRESS); 2590 *ctrl = gvn->transform(new IfTrueNode(iff)); 2591 return gvn->transform(new IfFalseNode(iff)); 2592 } 2593 case Compile::SSC_full_test: 2594 break; 2595 default: 2596 ShouldNotReachHere(); 2597 } 2598 } 2599 2600 // %%% Possible further optimization: Even if the superklass is not exact, 2601 // if the subklass is the unique subtype of the superklass, the check 2602 // will always succeed. We could leave a dependency behind to ensure this. 2603 2604 // First load the super-klass's check-offset 2605 Node *p1 = gvn->transform(new AddPNode(superklass, superklass, gvn->MakeConX(in_bytes(Klass::super_check_offset_offset())))); 2606 Node* m = mem->memory_at(C->get_alias_index(gvn->type(p1)->is_ptr())); 2607 Node *chk_off = gvn->transform(new LoadINode(NULL, m, p1, gvn->type(p1)->is_ptr(), TypeInt::INT, MemNode::unordered)); 2608 int cacheoff_con = in_bytes(Klass::secondary_super_cache_offset()); 2609 bool might_be_cache = (gvn->find_int_con(chk_off, cacheoff_con) == cacheoff_con); 2610 2611 // Load from the sub-klass's super-class display list, or a 1-word cache of 2612 // the secondary superclass list, or a failing value with a sentinel offset 2613 // if the super-klass is an interface or exceptionally deep in the Java 2614 // hierarchy and we have to scan the secondary superclass list the hard way. 2615 // Worst-case type is a little odd: NULL is allowed as a result (usually 2616 // klass loads can never produce a NULL). 2617 Node *chk_off_X = chk_off; 2618 #ifdef _LP64 2619 chk_off_X = gvn->transform(new ConvI2LNode(chk_off_X)); 2620 #endif 2621 Node *p2 = gvn->transform(new AddPNode(subklass,subklass,chk_off_X)); 2622 // For some types like interfaces the following loadKlass is from a 1-word 2623 // cache which is mutable so can't use immutable memory. Other 2624 // types load from the super-class display table which is immutable. 2625 m = mem->memory_at(C->get_alias_index(gvn->type(p2)->is_ptr())); 2626 Node *kmem = might_be_cache ? m : C->immutable_memory(); 2627 Node *nkls = gvn->transform(LoadKlassNode::make(*gvn, NULL, kmem, p2, gvn->type(p2)->is_ptr(), TypeKlassPtr::OBJECT_OR_NULL)); 2628 2629 // Compile speed common case: ARE a subtype and we canNOT fail 2630 if( superklass == nkls ) 2631 return C->top(); // false path is dead; no test needed. 2632 2633 // See if we get an immediate positive hit. Happens roughly 83% of the 2634 // time. Test to see if the value loaded just previously from the subklass 2635 // is exactly the superklass. 2636 IfNode *iff1 = gen_subtype_check_compare(*ctrl, superklass, nkls, BoolTest::eq, PROB_LIKELY(0.83f), gvn, T_ADDRESS); 2637 Node *iftrue1 = gvn->transform( new IfTrueNode (iff1)); 2638 *ctrl = gvn->transform(new IfFalseNode(iff1)); 2639 2640 // Compile speed common case: Check for being deterministic right now. If 2641 // chk_off is a constant and not equal to cacheoff then we are NOT a 2642 // subklass. In this case we need exactly the 1 test above and we can 2643 // return those results immediately. 2644 if (!might_be_cache) { 2645 Node* not_subtype_ctrl = *ctrl; 2646 *ctrl = iftrue1; // We need exactly the 1 test above 2647 return not_subtype_ctrl; 2648 } 2649 2650 // Gather the various success & failures here 2651 RegionNode *r_ok_subtype = new RegionNode(4); 2652 gvn->record_for_igvn(r_ok_subtype); 2653 RegionNode *r_not_subtype = new RegionNode(3); 2654 gvn->record_for_igvn(r_not_subtype); 2655 2656 r_ok_subtype->init_req(1, iftrue1); 2657 2658 // Check for immediate negative hit. Happens roughly 11% of the time (which 2659 // is roughly 63% of the remaining cases). Test to see if the loaded 2660 // check-offset points into the subklass display list or the 1-element 2661 // cache. If it points to the display (and NOT the cache) and the display 2662 // missed then it's not a subtype. 2663 Node *cacheoff = gvn->intcon(cacheoff_con); 2664 IfNode *iff2 = gen_subtype_check_compare(*ctrl, chk_off, cacheoff, BoolTest::ne, PROB_LIKELY(0.63f), gvn, T_INT); 2665 r_not_subtype->init_req(1, gvn->transform(new IfTrueNode (iff2))); 2666 *ctrl = gvn->transform(new IfFalseNode(iff2)); 2667 2668 // Check for self. Very rare to get here, but it is taken 1/3 the time. 2669 // No performance impact (too rare) but allows sharing of secondary arrays 2670 // which has some footprint reduction. 2671 IfNode *iff3 = gen_subtype_check_compare(*ctrl, subklass, superklass, BoolTest::eq, PROB_LIKELY(0.36f), gvn, T_ADDRESS); 2672 r_ok_subtype->init_req(2, gvn->transform(new IfTrueNode(iff3))); 2673 *ctrl = gvn->transform(new IfFalseNode(iff3)); 2674 2675 // -- Roads not taken here: -- 2676 // We could also have chosen to perform the self-check at the beginning 2677 // of this code sequence, as the assembler does. This would not pay off 2678 // the same way, since the optimizer, unlike the assembler, can perform 2679 // static type analysis to fold away many successful self-checks. 2680 // Non-foldable self checks work better here in second position, because 2681 // the initial primary superclass check subsumes a self-check for most 2682 // types. An exception would be a secondary type like array-of-interface, 2683 // which does not appear in its own primary supertype display. 2684 // Finally, we could have chosen to move the self-check into the 2685 // PartialSubtypeCheckNode, and from there out-of-line in a platform 2686 // dependent manner. But it is worthwhile to have the check here, 2687 // where it can be perhaps be optimized. The cost in code space is 2688 // small (register compare, branch). 2689 2690 // Now do a linear scan of the secondary super-klass array. Again, no real 2691 // performance impact (too rare) but it's gotta be done. 2692 // Since the code is rarely used, there is no penalty for moving it 2693 // out of line, and it can only improve I-cache density. 2694 // The decision to inline or out-of-line this final check is platform 2695 // dependent, and is found in the AD file definition of PartialSubtypeCheck. 2696 Node* psc = gvn->transform( 2697 new PartialSubtypeCheckNode(*ctrl, subklass, superklass)); 2698 2699 IfNode *iff4 = gen_subtype_check_compare(*ctrl, psc, gvn->zerocon(T_OBJECT), BoolTest::ne, PROB_FAIR, gvn, T_ADDRESS); 2700 r_not_subtype->init_req(2, gvn->transform(new IfTrueNode (iff4))); 2701 r_ok_subtype ->init_req(3, gvn->transform(new IfFalseNode(iff4))); 2702 2703 // Return false path; set default control to true path. 2704 *ctrl = gvn->transform(r_ok_subtype); 2705 return gvn->transform(r_not_subtype); 2706 } 2707 2708 // Profile-driven exact type check: 2709 Node* GraphKit::type_check_receiver(Node* receiver, ciKlass* klass, 2710 float prob, 2711 Node* *casted_receiver) { 2712 const TypeKlassPtr* tklass = TypeKlassPtr::make(klass); 2713 Node* recv_klass = load_object_klass(receiver); 2714 Node* want_klass = makecon(tklass); 2715 Node* cmp = _gvn.transform( new CmpPNode(recv_klass, want_klass) ); 2716 Node* bol = _gvn.transform( new BoolNode(cmp, BoolTest::eq) ); 2717 IfNode* iff = create_and_xform_if(control(), bol, prob, COUNT_UNKNOWN); 2718 set_control( _gvn.transform( new IfTrueNode (iff) )); 2719 Node* fail = _gvn.transform( new IfFalseNode(iff) ); 2720 2721 const TypeOopPtr* recv_xtype = tklass->as_instance_type(); 2722 assert(recv_xtype->klass_is_exact(), ""); 2723 2724 // Subsume downstream occurrences of receiver with a cast to 2725 // recv_xtype, since now we know what the type will be. 2726 Node* cast = new CheckCastPPNode(control(), receiver, recv_xtype); 2727 (*casted_receiver) = _gvn.transform(cast); 2728 // (User must make the replace_in_map call.) 2729 2730 return fail; 2731 } 2732 2733 2734 //------------------------------seems_never_null------------------------------- 2735 // Use null_seen information if it is available from the profile. 2736 // If we see an unexpected null at a type check we record it and force a 2737 // recompile; the offending check will be recompiled to handle NULLs. 2738 // If we see several offending BCIs, then all checks in the 2739 // method will be recompiled. 2740 bool GraphKit::seems_never_null(Node* obj, ciProfileData* data, bool& speculating) { 2741 speculating = !_gvn.type(obj)->speculative_maybe_null(); 2742 Deoptimization::DeoptReason reason = Deoptimization::reason_null_check(speculating); 2743 if (UncommonNullCast // Cutout for this technique 2744 && obj != null() // And not the -Xcomp stupid case? 2745 && !too_many_traps(reason) 2746 ) { 2747 if (speculating) { 2748 return true; 2749 } 2750 if (data == NULL) 2751 // Edge case: no mature data. Be optimistic here. 2752 return true; 2753 // If the profile has not seen a null, assume it won't happen. 2754 assert(java_bc() == Bytecodes::_checkcast || 2755 java_bc() == Bytecodes::_instanceof || 2756 java_bc() == Bytecodes::_aastore, "MDO must collect null_seen bit here"); 2757 return !data->as_BitData()->null_seen(); 2758 } 2759 speculating = false; 2760 return false; 2761 } 2762 2763 //------------------------maybe_cast_profiled_receiver------------------------- 2764 // If the profile has seen exactly one type, narrow to exactly that type. 2765 // Subsequent type checks will always fold up. 2766 Node* GraphKit::maybe_cast_profiled_receiver(Node* not_null_obj, 2767 ciKlass* require_klass, 2768 ciKlass* spec_klass, 2769 bool safe_for_replace) { 2770 if (!UseTypeProfile || !TypeProfileCasts) return NULL; 2771 2772 Deoptimization::DeoptReason reason = Deoptimization::reason_class_check(spec_klass != NULL); 2773 2774 // Make sure we haven't already deoptimized from this tactic. 2775 if (too_many_traps(reason) || too_many_recompiles(reason)) 2776 return NULL; 2777 2778 // (No, this isn't a call, but it's enough like a virtual call 2779 // to use the same ciMethod accessor to get the profile info...) 2780 // If we have a speculative type use it instead of profiling (which 2781 // may not help us) 2782 ciKlass* exact_kls = spec_klass == NULL ? profile_has_unique_klass() : spec_klass; 2783 if (exact_kls != NULL) {// no cast failures here 2784 if (require_klass == NULL || 2785 C->static_subtype_check(require_klass, exact_kls) == Compile::SSC_always_true) { 2786 // If we narrow the type to match what the type profile sees or 2787 // the speculative type, we can then remove the rest of the 2788 // cast. 2789 // This is a win, even if the exact_kls is very specific, 2790 // because downstream operations, such as method calls, 2791 // will often benefit from the sharper type. 2792 Node* exact_obj = not_null_obj; // will get updated in place... 2793 Node* slow_ctl = type_check_receiver(exact_obj, exact_kls, 1.0, 2794 &exact_obj); 2795 { PreserveJVMState pjvms(this); 2796 set_control(slow_ctl); 2797 uncommon_trap_exact(reason, Deoptimization::Action_maybe_recompile); 2798 } 2799 if (safe_for_replace) { 2800 replace_in_map(not_null_obj, exact_obj); 2801 } 2802 return exact_obj; 2803 } 2804 // assert(ssc == Compile::SSC_always_true)... except maybe the profile lied to us. 2805 } 2806 2807 return NULL; 2808 } 2809 2810 /** 2811 * Cast obj to type and emit guard unless we had too many traps here 2812 * already 2813 * 2814 * @param obj node being casted 2815 * @param type type to cast the node to 2816 * @param not_null true if we know node cannot be null 2817 */ 2818 Node* GraphKit::maybe_cast_profiled_obj(Node* obj, 2819 ciKlass* type, 2820 bool not_null) { 2821 if (stopped()) { 2822 return obj; 2823 } 2824 2825 // type == NULL if profiling tells us this object is always null 2826 if (type != NULL) { 2827 Deoptimization::DeoptReason class_reason = Deoptimization::Reason_speculate_class_check; 2828 Deoptimization::DeoptReason null_reason = Deoptimization::Reason_speculate_null_check; 2829 2830 if (!too_many_traps(null_reason) && !too_many_recompiles(null_reason) && 2831 !too_many_traps(class_reason) && 2832 !too_many_recompiles(class_reason)) { 2833 Node* not_null_obj = NULL; 2834 // not_null is true if we know the object is not null and 2835 // there's no need for a null check 2836 if (!not_null) { 2837 Node* null_ctl = top(); 2838 not_null_obj = null_check_oop(obj, &null_ctl, true, true, true); 2839 assert(null_ctl->is_top(), "no null control here"); 2840 } else { 2841 not_null_obj = obj; 2842 } 2843 2844 Node* exact_obj = not_null_obj; 2845 ciKlass* exact_kls = type; 2846 Node* slow_ctl = type_check_receiver(exact_obj, exact_kls, 1.0, 2847 &exact_obj); 2848 { 2849 PreserveJVMState pjvms(this); 2850 set_control(slow_ctl); 2851 uncommon_trap_exact(class_reason, Deoptimization::Action_maybe_recompile); 2852 } 2853 replace_in_map(not_null_obj, exact_obj); 2854 obj = exact_obj; 2855 } 2856 } else { 2857 if (!too_many_traps(Deoptimization::Reason_null_assert) && 2858 !too_many_recompiles(Deoptimization::Reason_null_assert)) { 2859 Node* exact_obj = null_assert(obj); 2860 replace_in_map(obj, exact_obj); 2861 obj = exact_obj; 2862 } 2863 } 2864 return obj; 2865 } 2866 2867 //-------------------------------gen_instanceof-------------------------------- 2868 // Generate an instance-of idiom. Used by both the instance-of bytecode 2869 // and the reflective instance-of call. 2870 Node* GraphKit::gen_instanceof(Node* obj, Node* superklass, bool safe_for_replace) { 2871 kill_dead_locals(); // Benefit all the uncommon traps 2872 assert( !stopped(), "dead parse path should be checked in callers" ); 2873 assert(!TypePtr::NULL_PTR->higher_equal(_gvn.type(superklass)->is_klassptr()), 2874 "must check for not-null not-dead klass in callers"); 2875 2876 // Make the merge point 2877 enum { _obj_path = 1, _fail_path, _null_path, PATH_LIMIT }; 2878 RegionNode* region = new RegionNode(PATH_LIMIT); 2879 Node* phi = new PhiNode(region, TypeInt::BOOL); 2880 C->set_has_split_ifs(true); // Has chance for split-if optimization 2881 2882 ciProfileData* data = NULL; 2883 if (java_bc() == Bytecodes::_instanceof) { // Only for the bytecode 2884 data = method()->method_data()->bci_to_data(bci()); 2885 } 2886 bool speculative_not_null = false; 2887 bool never_see_null = (ProfileDynamicTypes // aggressive use of profile 2888 && seems_never_null(obj, data, speculative_not_null)); 2889 2890 // Null check; get casted pointer; set region slot 3 2891 Node* null_ctl = top(); 2892 Node* not_null_obj = null_check_oop(obj, &null_ctl, never_see_null, safe_for_replace, speculative_not_null); 2893 2894 // If not_null_obj is dead, only null-path is taken 2895 if (stopped()) { // Doing instance-of on a NULL? 2896 set_control(null_ctl); 2897 return intcon(0); 2898 } 2899 region->init_req(_null_path, null_ctl); 2900 phi ->init_req(_null_path, intcon(0)); // Set null path value 2901 if (null_ctl == top()) { 2902 // Do this eagerly, so that pattern matches like is_diamond_phi 2903 // will work even during parsing. 2904 assert(_null_path == PATH_LIMIT-1, "delete last"); 2905 region->del_req(_null_path); 2906 phi ->del_req(_null_path); 2907 } 2908 2909 // Do we know the type check always succeed? 2910 bool known_statically = false; 2911 if (_gvn.type(superklass)->singleton()) { 2912 ciKlass* superk = _gvn.type(superklass)->is_klassptr()->klass(); 2913 ciKlass* subk = _gvn.type(obj)->is_oopptr()->klass(); 2914 if (subk != NULL && subk->is_loaded()) { 2915 int static_res = C->static_subtype_check(superk, subk); 2916 known_statically = (static_res == Compile::SSC_always_true || static_res == Compile::SSC_always_false); 2917 } 2918 } 2919 2920 if (known_statically && UseTypeSpeculation) { 2921 // If we know the type check always succeeds then we don't use the 2922 // profiling data at this bytecode. Don't lose it, feed it to the 2923 // type system as a speculative type. 2924 not_null_obj = record_profiled_receiver_for_speculation(not_null_obj); 2925 } else { 2926 const TypeOopPtr* obj_type = _gvn.type(obj)->is_oopptr(); 2927 // We may not have profiling here or it may not help us. If we 2928 // have a speculative type use it to perform an exact cast. 2929 ciKlass* spec_obj_type = obj_type->speculative_type(); 2930 if (spec_obj_type != NULL || (ProfileDynamicTypes && data != NULL)) { 2931 Node* cast_obj = maybe_cast_profiled_receiver(not_null_obj, NULL, spec_obj_type, safe_for_replace); 2932 if (stopped()) { // Profile disagrees with this path. 2933 set_control(null_ctl); // Null is the only remaining possibility. 2934 return intcon(0); 2935 } 2936 if (cast_obj != NULL) { 2937 not_null_obj = cast_obj; 2938 } 2939 } 2940 } 2941 2942 // Load the object's klass 2943 Node* obj_klass = load_object_klass(not_null_obj); 2944 2945 // Generate the subtype check 2946 Node* not_subtype_ctrl = gen_subtype_check(obj_klass, superklass); 2947 2948 // Plug in the success path to the general merge in slot 1. 2949 region->init_req(_obj_path, control()); 2950 phi ->init_req(_obj_path, intcon(1)); 2951 2952 // Plug in the failing path to the general merge in slot 2. 2953 region->init_req(_fail_path, not_subtype_ctrl); 2954 phi ->init_req(_fail_path, intcon(0)); 2955 2956 // Return final merged results 2957 set_control( _gvn.transform(region) ); 2958 record_for_igvn(region); 2959 return _gvn.transform(phi); 2960 } 2961 2962 //-------------------------------gen_checkcast--------------------------------- 2963 // Generate a checkcast idiom. Used by both the checkcast bytecode and the 2964 // array store bytecode. Stack must be as-if BEFORE doing the bytecode so the 2965 // uncommon-trap paths work. Adjust stack after this call. 2966 // If failure_control is supplied and not null, it is filled in with 2967 // the control edge for the cast failure. Otherwise, an appropriate 2968 // uncommon trap or exception is thrown. 2969 Node* GraphKit::gen_checkcast(Node *obj, Node* superklass, 2970 Node* *failure_control) { 2971 kill_dead_locals(); // Benefit all the uncommon traps 2972 const TypeKlassPtr *tk = _gvn.type(superklass)->is_klassptr(); 2973 const Type *toop = TypeOopPtr::make_from_klass(tk->klass()); 2974 2975 // Fast cutout: Check the case that the cast is vacuously true. 2976 // This detects the common cases where the test will short-circuit 2977 // away completely. We do this before we perform the null check, 2978 // because if the test is going to turn into zero code, we don't 2979 // want a residual null check left around. (Causes a slowdown, 2980 // for example, in some objArray manipulations, such as a[i]=a[j].) 2981 if (tk->singleton()) { 2982 const TypeOopPtr* objtp = _gvn.type(obj)->isa_oopptr(); 2983 if (objtp != NULL && objtp->klass() != NULL) { 2984 switch (C->static_subtype_check(tk->klass(), objtp->klass())) { 2985 case Compile::SSC_always_true: 2986 // If we know the type check always succeed then we don't use 2987 // the profiling data at this bytecode. Don't lose it, feed it 2988 // to the type system as a speculative type. 2989 return record_profiled_receiver_for_speculation(obj); 2990 case Compile::SSC_always_false: 2991 // It needs a null check because a null will *pass* the cast check. 2992 // A non-null value will always produce an exception. 2993 return null_assert(obj); 2994 } 2995 } 2996 } 2997 2998 ciProfileData* data = NULL; 2999 bool safe_for_replace = false; 3000 if (failure_control == NULL) { // use MDO in regular case only 3001 assert(java_bc() == Bytecodes::_aastore || 3002 java_bc() == Bytecodes::_checkcast, 3003 "interpreter profiles type checks only for these BCs"); 3004 data = method()->method_data()->bci_to_data(bci()); 3005 safe_for_replace = true; 3006 } 3007 3008 // Make the merge point 3009 enum { _obj_path = 1, _null_path, PATH_LIMIT }; 3010 RegionNode* region = new RegionNode(PATH_LIMIT); 3011 Node* phi = new PhiNode(region, toop); 3012 C->set_has_split_ifs(true); // Has chance for split-if optimization 3013 3014 // Use null-cast information if it is available 3015 bool speculative_not_null = false; 3016 bool never_see_null = ((failure_control == NULL) // regular case only 3017 && seems_never_null(obj, data, speculative_not_null)); 3018 3019 // Null check; get casted pointer; set region slot 3 3020 Node* null_ctl = top(); 3021 Node* not_null_obj = null_check_oop(obj, &null_ctl, never_see_null, safe_for_replace, speculative_not_null); 3022 3023 // If not_null_obj is dead, only null-path is taken 3024 if (stopped()) { // Doing instance-of on a NULL? 3025 set_control(null_ctl); 3026 return null(); 3027 } 3028 region->init_req(_null_path, null_ctl); 3029 phi ->init_req(_null_path, null()); // Set null path value 3030 if (null_ctl == top()) { 3031 // Do this eagerly, so that pattern matches like is_diamond_phi 3032 // will work even during parsing. 3033 assert(_null_path == PATH_LIMIT-1, "delete last"); 3034 region->del_req(_null_path); 3035 phi ->del_req(_null_path); 3036 } 3037 3038 Node* cast_obj = NULL; 3039 if (tk->klass_is_exact()) { 3040 // The following optimization tries to statically cast the speculative type of the object 3041 // (for example obtained during profiling) to the type of the superklass and then do a 3042 // dynamic check that the type of the object is what we expect. To work correctly 3043 // for checkcast and aastore the type of superklass should be exact. 3044 const TypeOopPtr* obj_type = _gvn.type(obj)->is_oopptr(); 3045 // We may not have profiling here or it may not help us. If we have 3046 // a speculative type use it to perform an exact cast. 3047 ciKlass* spec_obj_type = obj_type->speculative_type(); 3048 if (spec_obj_type != NULL || data != NULL) { 3049 cast_obj = maybe_cast_profiled_receiver(not_null_obj, tk->klass(), spec_obj_type, safe_for_replace); 3050 if (cast_obj != NULL) { 3051 if (failure_control != NULL) // failure is now impossible 3052 (*failure_control) = top(); 3053 // adjust the type of the phi to the exact klass: 3054 phi->raise_bottom_type(_gvn.type(cast_obj)->meet_speculative(TypePtr::NULL_PTR)); 3055 } 3056 } 3057 } 3058 3059 if (cast_obj == NULL) { 3060 // Load the object's klass 3061 Node* obj_klass = load_object_klass(not_null_obj); 3062 3063 // Generate the subtype check 3064 Node* not_subtype_ctrl = gen_subtype_check( obj_klass, superklass ); 3065 3066 // Plug in success path into the merge 3067 cast_obj = _gvn.transform(new CheckCastPPNode(control(), not_null_obj, toop)); 3068 // Failure path ends in uncommon trap (or may be dead - failure impossible) 3069 if (failure_control == NULL) { 3070 if (not_subtype_ctrl != top()) { // If failure is possible 3071 PreserveJVMState pjvms(this); 3072 set_control(not_subtype_ctrl); 3073 builtin_throw(Deoptimization::Reason_class_check, obj_klass); 3074 } 3075 } else { 3076 (*failure_control) = not_subtype_ctrl; 3077 } 3078 } 3079 3080 region->init_req(_obj_path, control()); 3081 phi ->init_req(_obj_path, cast_obj); 3082 3083 // A merge of NULL or Casted-NotNull obj 3084 Node* res = _gvn.transform(phi); 3085 3086 // Note I do NOT always 'replace_in_map(obj,result)' here. 3087 // if( tk->klass()->can_be_primary_super() ) 3088 // This means that if I successfully store an Object into an array-of-String 3089 // I 'forget' that the Object is really now known to be a String. I have to 3090 // do this because we don't have true union types for interfaces - if I store 3091 // a Baz into an array-of-Interface and then tell the optimizer it's an 3092 // Interface, I forget that it's also a Baz and cannot do Baz-like field 3093 // references to it. FIX THIS WHEN UNION TYPES APPEAR! 3094 // replace_in_map( obj, res ); 3095 3096 // Return final merged results 3097 set_control( _gvn.transform(region) ); 3098 record_for_igvn(region); 3099 return res; 3100 } 3101 3102 //------------------------------next_monitor----------------------------------- 3103 // What number should be given to the next monitor? 3104 int GraphKit::next_monitor() { 3105 int current = jvms()->monitor_depth()* C->sync_stack_slots(); 3106 int next = current + C->sync_stack_slots(); 3107 // Keep the toplevel high water mark current: 3108 if (C->fixed_slots() < next) C->set_fixed_slots(next); 3109 return current; 3110 } 3111 3112 //------------------------------insert_mem_bar--------------------------------- 3113 // Memory barrier to avoid floating things around 3114 // The membar serves as a pinch point between both control and all memory slices. 3115 Node* GraphKit::insert_mem_bar(int opcode, Node* precedent) { 3116 MemBarNode* mb = MemBarNode::make(C, opcode, Compile::AliasIdxBot, precedent); 3117 mb->init_req(TypeFunc::Control, control()); 3118 mb->init_req(TypeFunc::Memory, reset_memory()); 3119 Node* membar = _gvn.transform(mb); 3120 set_control(_gvn.transform(new ProjNode(membar, TypeFunc::Control))); 3121 set_all_memory_call(membar); 3122 return membar; 3123 } 3124 3125 //-------------------------insert_mem_bar_volatile---------------------------- 3126 // Memory barrier to avoid floating things around 3127 // The membar serves as a pinch point between both control and memory(alias_idx). 3128 // If you want to make a pinch point on all memory slices, do not use this 3129 // function (even with AliasIdxBot); use insert_mem_bar() instead. 3130 Node* GraphKit::insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent) { 3131 // When Parse::do_put_xxx updates a volatile field, it appends a series 3132 // of MemBarVolatile nodes, one for *each* volatile field alias category. 3133 // The first membar is on the same memory slice as the field store opcode. 3134 // This forces the membar to follow the store. (Bug 6500685 broke this.) 3135 // All the other membars (for other volatile slices, including AliasIdxBot, 3136 // which stands for all unknown volatile slices) are control-dependent 3137 // on the first membar. This prevents later volatile loads or stores 3138 // from sliding up past the just-emitted store. 3139 3140 MemBarNode* mb = MemBarNode::make(C, opcode, alias_idx, precedent); 3141 mb->set_req(TypeFunc::Control,control()); 3142 if (alias_idx == Compile::AliasIdxBot) { 3143 mb->set_req(TypeFunc::Memory, merged_memory()->base_memory()); 3144 } else { 3145 assert(!(opcode == Op_Initialize && alias_idx != Compile::AliasIdxRaw), "fix caller"); 3146 mb->set_req(TypeFunc::Memory, memory(alias_idx)); 3147 } 3148 Node* membar = _gvn.transform(mb); 3149 set_control(_gvn.transform(new ProjNode(membar, TypeFunc::Control))); 3150 if (alias_idx == Compile::AliasIdxBot) { 3151 merged_memory()->set_base_memory(_gvn.transform(new ProjNode(membar, TypeFunc::Memory))); 3152 } else { 3153 set_memory(_gvn.transform(new ProjNode(membar, TypeFunc::Memory)),alias_idx); 3154 } 3155 return membar; 3156 } 3157 3158 void GraphKit::insert_store_load_for_barrier() { 3159 Node* mem = reset_memory(); 3160 MemBarNode* mb = MemBarNode::make(C, Op_MemBarVolatile, Compile::AliasIdxBot); 3161 mb->init_req(TypeFunc::Control, control()); 3162 mb->init_req(TypeFunc::Memory, mem); 3163 Node* membar = _gvn.transform(mb); 3164 set_control(_gvn.transform(new ProjNode(membar, TypeFunc::Control))); 3165 Node* newmem = _gvn.transform(new ProjNode(membar, TypeFunc::Memory)); 3166 set_all_memory(mem); 3167 set_memory(newmem, Compile::AliasIdxRaw); 3168 } 3169 3170 3171 //------------------------------shared_lock------------------------------------ 3172 // Emit locking code. 3173 FastLockNode* GraphKit::shared_lock(Node* obj) { 3174 // bci is either a monitorenter bc or InvocationEntryBci 3175 // %%% SynchronizationEntryBCI is redundant; use InvocationEntryBci in interfaces 3176 assert(SynchronizationEntryBCI == InvocationEntryBci, ""); 3177 3178 if( !GenerateSynchronizationCode ) 3179 return NULL; // Not locking things? 3180 if (stopped()) // Dead monitor? 3181 return NULL; 3182 3183 assert(dead_locals_are_killed(), "should kill locals before sync. point"); 3184 3185 // Box the stack location 3186 Node* box = _gvn.transform(new BoxLockNode(next_monitor())); 3187 Node* mem = reset_memory(); 3188 3189 FastLockNode * flock = _gvn.transform(new FastLockNode(0, obj, box) )->as_FastLock(); 3190 if (UseBiasedLocking && PrintPreciseBiasedLockingStatistics) { 3191 // Create the counters for this fast lock. 3192 flock->create_lock_counter(sync_jvms()); // sync_jvms used to get current bci 3193 } 3194 3195 // Create the rtm counters for this fast lock if needed. 3196 flock->create_rtm_lock_counter(sync_jvms()); // sync_jvms used to get current bci 3197 3198 // Add monitor to debug info for the slow path. If we block inside the 3199 // slow path and de-opt, we need the monitor hanging around 3200 map()->push_monitor( flock ); 3201 3202 const TypeFunc *tf = LockNode::lock_type(); 3203 LockNode *lock = new LockNode(C, tf); 3204 3205 lock->init_req( TypeFunc::Control, control() ); 3206 lock->init_req( TypeFunc::Memory , mem ); 3207 lock->init_req( TypeFunc::I_O , top() ) ; // does no i/o 3208 lock->init_req( TypeFunc::FramePtr, frameptr() ); 3209 lock->init_req( TypeFunc::ReturnAdr, top() ); 3210 3211 lock->init_req(TypeFunc::Parms + 0, obj); 3212 lock->init_req(TypeFunc::Parms + 1, box); 3213 lock->init_req(TypeFunc::Parms + 2, flock); 3214 add_safepoint_edges(lock); 3215 3216 lock = _gvn.transform( lock )->as_Lock(); 3217 3218 // lock has no side-effects, sets few values 3219 set_predefined_output_for_runtime_call(lock, mem, TypeRawPtr::BOTTOM); 3220 3221 insert_mem_bar(Op_MemBarAcquireLock); 3222 3223 // Add this to the worklist so that the lock can be eliminated 3224 record_for_igvn(lock); 3225 3226 #ifndef PRODUCT 3227 if (PrintLockStatistics) { 3228 // Update the counter for this lock. Don't bother using an atomic 3229 // operation since we don't require absolute accuracy. 3230 lock->create_lock_counter(map()->jvms()); 3231 increment_counter(lock->counter()->addr()); 3232 } 3233 #endif 3234 3235 return flock; 3236 } 3237 3238 3239 //------------------------------shared_unlock---------------------------------- 3240 // Emit unlocking code. 3241 void GraphKit::shared_unlock(Node* box, Node* obj) { 3242 // bci is either a monitorenter bc or InvocationEntryBci 3243 // %%% SynchronizationEntryBCI is redundant; use InvocationEntryBci in interfaces 3244 assert(SynchronizationEntryBCI == InvocationEntryBci, ""); 3245 3246 if( !GenerateSynchronizationCode ) 3247 return; 3248 if (stopped()) { // Dead monitor? 3249 map()->pop_monitor(); // Kill monitor from debug info 3250 return; 3251 } 3252 3253 // Memory barrier to avoid floating things down past the locked region 3254 insert_mem_bar(Op_MemBarReleaseLock); 3255 3256 const TypeFunc *tf = OptoRuntime::complete_monitor_exit_Type(); 3257 UnlockNode *unlock = new UnlockNode(C, tf); 3258 #ifdef ASSERT 3259 unlock->set_dbg_jvms(sync_jvms()); 3260 #endif 3261 uint raw_idx = Compile::AliasIdxRaw; 3262 unlock->init_req( TypeFunc::Control, control() ); 3263 unlock->init_req( TypeFunc::Memory , memory(raw_idx) ); 3264 unlock->init_req( TypeFunc::I_O , top() ) ; // does no i/o 3265 unlock->init_req( TypeFunc::FramePtr, frameptr() ); 3266 unlock->init_req( TypeFunc::ReturnAdr, top() ); 3267 3268 unlock->init_req(TypeFunc::Parms + 0, obj); 3269 unlock->init_req(TypeFunc::Parms + 1, box); 3270 unlock = _gvn.transform(unlock)->as_Unlock(); 3271 3272 Node* mem = reset_memory(); 3273 3274 // unlock has no side-effects, sets few values 3275 set_predefined_output_for_runtime_call(unlock, mem, TypeRawPtr::BOTTOM); 3276 3277 // Kill monitor from debug info 3278 map()->pop_monitor( ); 3279 } 3280 3281 //-------------------------------get_layout_helper----------------------------- 3282 // If the given klass is a constant or known to be an array, 3283 // fetch the constant layout helper value into constant_value 3284 // and return (Node*)NULL. Otherwise, load the non-constant 3285 // layout helper value, and return the node which represents it. 3286 // This two-faced routine is useful because allocation sites 3287 // almost always feature constant types. 3288 Node* GraphKit::get_layout_helper(Node* klass_node, jint& constant_value) { 3289 const TypeKlassPtr* inst_klass = _gvn.type(klass_node)->isa_klassptr(); 3290 if (!StressReflectiveCode && inst_klass != NULL) { 3291 ciKlass* klass = inst_klass->klass(); 3292 bool xklass = inst_klass->klass_is_exact(); 3293 if (xklass || klass->is_array_klass()) { 3294 jint lhelper = klass->layout_helper(); 3295 if (lhelper != Klass::_lh_neutral_value) { 3296 constant_value = lhelper; 3297 return (Node*) NULL; 3298 } 3299 } 3300 } 3301 constant_value = Klass::_lh_neutral_value; // put in a known value 3302 Node* lhp = basic_plus_adr(klass_node, klass_node, in_bytes(Klass::layout_helper_offset())); 3303 return make_load(NULL, lhp, TypeInt::INT, T_INT, MemNode::unordered); 3304 } 3305 3306 // We just put in an allocate/initialize with a big raw-memory effect. 3307 // Hook selected additional alias categories on the initialization. 3308 static void hook_memory_on_init(GraphKit& kit, int alias_idx, 3309 MergeMemNode* init_in_merge, 3310 Node* init_out_raw) { 3311 DEBUG_ONLY(Node* init_in_raw = init_in_merge->base_memory()); 3312 assert(init_in_merge->memory_at(alias_idx) == init_in_raw, ""); 3313 3314 Node* prevmem = kit.memory(alias_idx); 3315 init_in_merge->set_memory_at(alias_idx, prevmem); 3316 kit.set_memory(init_out_raw, alias_idx); 3317 } 3318 3319 //---------------------------set_output_for_allocation------------------------- 3320 Node* GraphKit::set_output_for_allocation(AllocateNode* alloc, 3321 const TypeOopPtr* oop_type, 3322 bool deoptimize_on_exception) { 3323 int rawidx = Compile::AliasIdxRaw; 3324 alloc->set_req( TypeFunc::FramePtr, frameptr() ); 3325 add_safepoint_edges(alloc); 3326 Node* allocx = _gvn.transform(alloc); 3327 set_control( _gvn.transform(new ProjNode(allocx, TypeFunc::Control) ) ); 3328 // create memory projection for i_o 3329 set_memory ( _gvn.transform( new ProjNode(allocx, TypeFunc::Memory, true) ), rawidx ); 3330 make_slow_call_ex(allocx, env()->Throwable_klass(), true, deoptimize_on_exception); 3331 3332 // create a memory projection as for the normal control path 3333 Node* malloc = _gvn.transform(new ProjNode(allocx, TypeFunc::Memory)); 3334 set_memory(malloc, rawidx); 3335 3336 // a normal slow-call doesn't change i_o, but an allocation does 3337 // we create a separate i_o projection for the normal control path 3338 set_i_o(_gvn.transform( new ProjNode(allocx, TypeFunc::I_O, false) ) ); 3339 Node* rawoop = _gvn.transform( new ProjNode(allocx, TypeFunc::Parms) ); 3340 3341 // put in an initialization barrier 3342 InitializeNode* init = insert_mem_bar_volatile(Op_Initialize, rawidx, 3343 rawoop)->as_Initialize(); 3344 assert(alloc->initialization() == init, "2-way macro link must work"); 3345 assert(init ->allocation() == alloc, "2-way macro link must work"); 3346 { 3347 // Extract memory strands which may participate in the new object's 3348 // initialization, and source them from the new InitializeNode. 3349 // This will allow us to observe initializations when they occur, 3350 // and link them properly (as a group) to the InitializeNode. 3351 assert(init->in(InitializeNode::Memory) == malloc, ""); 3352 MergeMemNode* minit_in = MergeMemNode::make(malloc); 3353 init->set_req(InitializeNode::Memory, minit_in); 3354 record_for_igvn(minit_in); // fold it up later, if possible 3355 Node* minit_out = memory(rawidx); 3356 assert(minit_out->is_Proj() && minit_out->in(0) == init, ""); 3357 if (oop_type->isa_aryptr()) { 3358 const TypePtr* telemref = oop_type->add_offset(Type::OffsetBot); 3359 int elemidx = C->get_alias_index(telemref); 3360 hook_memory_on_init(*this, elemidx, minit_in, minit_out); 3361 } else if (oop_type->isa_instptr()) { 3362 ciInstanceKlass* ik = oop_type->klass()->as_instance_klass(); 3363 for (int i = 0, len = ik->nof_nonstatic_fields(); i < len; i++) { 3364 ciField* field = ik->nonstatic_field_at(i); 3365 if (field->offset() >= TrackedInitializationLimit * HeapWordSize) 3366 continue; // do not bother to track really large numbers of fields 3367 // Find (or create) the alias category for this field: 3368 int fieldidx = C->alias_type(field)->index(); 3369 hook_memory_on_init(*this, fieldidx, minit_in, minit_out); 3370 } 3371 } 3372 } 3373 3374 // Cast raw oop to the real thing... 3375 Node* javaoop = new CheckCastPPNode(control(), rawoop, oop_type); 3376 javaoop = _gvn.transform(javaoop); 3377 C->set_recent_alloc(control(), javaoop); 3378 assert(just_allocated_object(control()) == javaoop, "just allocated"); 3379 3380 #ifdef ASSERT 3381 { // Verify that the AllocateNode::Ideal_allocation recognizers work: 3382 assert(AllocateNode::Ideal_allocation(rawoop, &_gvn) == alloc, 3383 "Ideal_allocation works"); 3384 assert(AllocateNode::Ideal_allocation(javaoop, &_gvn) == alloc, 3385 "Ideal_allocation works"); 3386 if (alloc->is_AllocateArray()) { 3387 assert(AllocateArrayNode::Ideal_array_allocation(rawoop, &_gvn) == alloc->as_AllocateArray(), 3388 "Ideal_allocation works"); 3389 assert(AllocateArrayNode::Ideal_array_allocation(javaoop, &_gvn) == alloc->as_AllocateArray(), 3390 "Ideal_allocation works"); 3391 } else { 3392 assert(alloc->in(AllocateNode::ALength)->is_top(), "no length, please"); 3393 } 3394 } 3395 #endif //ASSERT 3396 3397 return javaoop; 3398 } 3399 3400 //---------------------------new_instance-------------------------------------- 3401 // This routine takes a klass_node which may be constant (for a static type) 3402 // or may be non-constant (for reflective code). It will work equally well 3403 // for either, and the graph will fold nicely if the optimizer later reduces 3404 // the type to a constant. 3405 // The optional arguments are for specialized use by intrinsics: 3406 // - If 'extra_slow_test' if not null is an extra condition for the slow-path. 3407 // - If 'return_size_val', report the the total object size to the caller. 3408 // - deoptimize_on_exception controls how Java exceptions are handled (rethrow vs deoptimize) 3409 Node* GraphKit::new_instance(Node* klass_node, 3410 Node* extra_slow_test, 3411 Node* *return_size_val, 3412 bool deoptimize_on_exception) { 3413 // Compute size in doublewords 3414 // The size is always an integral number of doublewords, represented 3415 // as a positive bytewise size stored in the klass's layout_helper. 3416 // The layout_helper also encodes (in a low bit) the need for a slow path. 3417 jint layout_con = Klass::_lh_neutral_value; 3418 Node* layout_val = get_layout_helper(klass_node, layout_con); 3419 int layout_is_con = (layout_val == NULL); 3420 3421 if (extra_slow_test == NULL) extra_slow_test = intcon(0); 3422 // Generate the initial go-slow test. It's either ALWAYS (return a 3423 // Node for 1) or NEVER (return a NULL) or perhaps (in the reflective 3424 // case) a computed value derived from the layout_helper. 3425 Node* initial_slow_test = NULL; 3426 if (layout_is_con) { 3427 assert(!StressReflectiveCode, "stress mode does not use these paths"); 3428 bool must_go_slow = Klass::layout_helper_needs_slow_path(layout_con); 3429 initial_slow_test = must_go_slow ? intcon(1) : extra_slow_test; 3430 } else { // reflective case 3431 // This reflective path is used by Unsafe.allocateInstance. 3432 // (It may be stress-tested by specifying StressReflectiveCode.) 3433 // Basically, we want to get into the VM is there's an illegal argument. 3434 Node* bit = intcon(Klass::_lh_instance_slow_path_bit); 3435 initial_slow_test = _gvn.transform( new AndINode(layout_val, bit) ); 3436 if (extra_slow_test != intcon(0)) { 3437 initial_slow_test = _gvn.transform( new OrINode(initial_slow_test, extra_slow_test) ); 3438 } 3439 // (Macro-expander will further convert this to a Bool, if necessary.) 3440 } 3441 3442 // Find the size in bytes. This is easy; it's the layout_helper. 3443 // The size value must be valid even if the slow path is taken. 3444 Node* size = NULL; 3445 if (layout_is_con) { 3446 size = MakeConX(Klass::layout_helper_size_in_bytes(layout_con)); 3447 } else { // reflective case 3448 // This reflective path is used by clone and Unsafe.allocateInstance. 3449 size = ConvI2X(layout_val); 3450 3451 // Clear the low bits to extract layout_helper_size_in_bytes: 3452 assert((int)Klass::_lh_instance_slow_path_bit < BytesPerLong, "clear bit"); 3453 Node* mask = MakeConX(~ (intptr_t)right_n_bits(LogBytesPerLong)); 3454 size = _gvn.transform( new AndXNode(size, mask) ); 3455 } 3456 if (return_size_val != NULL) { 3457 (*return_size_val) = size; 3458 } 3459 3460 // This is a precise notnull oop of the klass. 3461 // (Actually, it need not be precise if this is a reflective allocation.) 3462 // It's what we cast the result to. 3463 const TypeKlassPtr* tklass = _gvn.type(klass_node)->isa_klassptr(); 3464 if (!tklass) tklass = TypeKlassPtr::OBJECT; 3465 const TypeOopPtr* oop_type = tklass->as_instance_type(); 3466 3467 // Now generate allocation code 3468 3469 // The entire memory state is needed for slow path of the allocation 3470 // since GC and deoptimization can happened. 3471 Node *mem = reset_memory(); 3472 set_all_memory(mem); // Create new memory state 3473 3474 AllocateNode* alloc = new AllocateNode(C, AllocateNode::alloc_type(Type::TOP), 3475 control(), mem, i_o(), 3476 size, klass_node, 3477 initial_slow_test); 3478 3479 return set_output_for_allocation(alloc, oop_type, deoptimize_on_exception); 3480 } 3481 3482 //-------------------------------new_array------------------------------------- 3483 // helper for both newarray and anewarray 3484 // The 'length' parameter is (obviously) the length of the array. 3485 // See comments on new_instance for the meaning of the other arguments. 3486 Node* GraphKit::new_array(Node* klass_node, // array klass (maybe variable) 3487 Node* length, // number of array elements 3488 int nargs, // number of arguments to push back for uncommon trap 3489 Node* *return_size_val, 3490 bool deoptimize_on_exception) { 3491 jint layout_con = Klass::_lh_neutral_value; 3492 Node* layout_val = get_layout_helper(klass_node, layout_con); 3493 int layout_is_con = (layout_val == NULL); 3494 3495 if (!layout_is_con && !StressReflectiveCode && 3496 !too_many_traps(Deoptimization::Reason_class_check)) { 3497 // This is a reflective array creation site. 3498 // Optimistically assume that it is a subtype of Object[], 3499 // so that we can fold up all the address arithmetic. 3500 layout_con = Klass::array_layout_helper(T_OBJECT); 3501 Node* cmp_lh = _gvn.transform( new CmpINode(layout_val, intcon(layout_con)) ); 3502 Node* bol_lh = _gvn.transform( new BoolNode(cmp_lh, BoolTest::eq) ); 3503 { BuildCutout unless(this, bol_lh, PROB_MAX); 3504 inc_sp(nargs); 3505 uncommon_trap(Deoptimization::Reason_class_check, 3506 Deoptimization::Action_maybe_recompile); 3507 } 3508 layout_val = NULL; 3509 layout_is_con = true; 3510 } 3511 3512 // Generate the initial go-slow test. Make sure we do not overflow 3513 // if length is huge (near 2Gig) or negative! We do not need 3514 // exact double-words here, just a close approximation of needed 3515 // double-words. We can't add any offset or rounding bits, lest we 3516 // take a size -1 of bytes and make it positive. Use an unsigned 3517 // compare, so negative sizes look hugely positive. 3518 int fast_size_limit = FastAllocateSizeLimit; 3519 if (layout_is_con) { 3520 assert(!StressReflectiveCode, "stress mode does not use these paths"); 3521 // Increase the size limit if we have exact knowledge of array type. 3522 int log2_esize = Klass::layout_helper_log2_element_size(layout_con); 3523 fast_size_limit <<= (LogBytesPerLong - log2_esize); 3524 } 3525 3526 Node* initial_slow_cmp = _gvn.transform( new CmpUNode( length, intcon( fast_size_limit ) ) ); 3527 Node* initial_slow_test = _gvn.transform( new BoolNode( initial_slow_cmp, BoolTest::gt ) ); 3528 3529 // --- Size Computation --- 3530 // array_size = round_to_heap(array_header + (length << elem_shift)); 3531 // where round_to_heap(x) == round_to(x, MinObjAlignmentInBytes) 3532 // and round_to(x, y) == ((x + y-1) & ~(y-1)) 3533 // The rounding mask is strength-reduced, if possible. 3534 int round_mask = MinObjAlignmentInBytes - 1; 3535 Node* header_size = NULL; 3536 int header_size_min = arrayOopDesc::base_offset_in_bytes(T_BYTE); 3537 // (T_BYTE has the weakest alignment and size restrictions...) 3538 if (layout_is_con) { 3539 int hsize = Klass::layout_helper_header_size(layout_con); 3540 int eshift = Klass::layout_helper_log2_element_size(layout_con); 3541 BasicType etype = Klass::layout_helper_element_type(layout_con); 3542 if ((round_mask & ~right_n_bits(eshift)) == 0) 3543 round_mask = 0; // strength-reduce it if it goes away completely 3544 assert((hsize & right_n_bits(eshift)) == 0, "hsize is pre-rounded"); 3545 assert(header_size_min <= hsize, "generic minimum is smallest"); 3546 header_size_min = hsize; 3547 header_size = intcon(hsize + round_mask); 3548 } else { 3549 Node* hss = intcon(Klass::_lh_header_size_shift); 3550 Node* hsm = intcon(Klass::_lh_header_size_mask); 3551 Node* hsize = _gvn.transform( new URShiftINode(layout_val, hss) ); 3552 hsize = _gvn.transform( new AndINode(hsize, hsm) ); 3553 Node* mask = intcon(round_mask); 3554 header_size = _gvn.transform( new AddINode(hsize, mask) ); 3555 } 3556 3557 Node* elem_shift = NULL; 3558 if (layout_is_con) { 3559 int eshift = Klass::layout_helper_log2_element_size(layout_con); 3560 if (eshift != 0) 3561 elem_shift = intcon(eshift); 3562 } else { 3563 // There is no need to mask or shift this value. 3564 // The semantics of LShiftINode include an implicit mask to 0x1F. 3565 assert(Klass::_lh_log2_element_size_shift == 0, "use shift in place"); 3566 elem_shift = layout_val; 3567 } 3568 3569 // Transition to native address size for all offset calculations: 3570 Node* lengthx = ConvI2X(length); 3571 Node* headerx = ConvI2X(header_size); 3572 #ifdef _LP64 3573 { const TypeInt* tilen = _gvn.find_int_type(length); 3574 if (tilen != NULL && tilen->_lo < 0) { 3575 // Add a manual constraint to a positive range. Cf. array_element_address. 3576 jint size_max = fast_size_limit; 3577 if (size_max > tilen->_hi) size_max = tilen->_hi; 3578 const TypeInt* tlcon = TypeInt::make(0, size_max, Type::WidenMin); 3579 3580 // Only do a narrow I2L conversion if the range check passed. 3581 IfNode* iff = new IfNode(control(), initial_slow_test, PROB_MIN, COUNT_UNKNOWN); 3582 _gvn.transform(iff); 3583 RegionNode* region = new RegionNode(3); 3584 _gvn.set_type(region, Type::CONTROL); 3585 lengthx = new PhiNode(region, TypeLong::LONG); 3586 _gvn.set_type(lengthx, TypeLong::LONG); 3587 3588 // Range check passed. Use ConvI2L node with narrow type. 3589 Node* passed = IfFalse(iff); 3590 region->init_req(1, passed); 3591 // Make I2L conversion control dependent to prevent it from 3592 // floating above the range check during loop optimizations. 3593 lengthx->init_req(1, C->constrained_convI2L(&_gvn, length, tlcon, passed)); 3594 3595 // Range check failed. Use ConvI2L with wide type because length may be invalid. 3596 region->init_req(2, IfTrue(iff)); 3597 lengthx->init_req(2, ConvI2X(length)); 3598 3599 set_control(region); 3600 record_for_igvn(region); 3601 record_for_igvn(lengthx); 3602 } 3603 } 3604 #endif 3605 3606 // Combine header size (plus rounding) and body size. Then round down. 3607 // This computation cannot overflow, because it is used only in two 3608 // places, one where the length is sharply limited, and the other 3609 // after a successful allocation. 3610 Node* abody = lengthx; 3611 if (elem_shift != NULL) 3612 abody = _gvn.transform( new LShiftXNode(lengthx, elem_shift) ); 3613 Node* size = _gvn.transform( new AddXNode(headerx, abody) ); 3614 if (round_mask != 0) { 3615 Node* mask = MakeConX(~round_mask); 3616 size = _gvn.transform( new AndXNode(size, mask) ); 3617 } 3618 // else if round_mask == 0, the size computation is self-rounding 3619 3620 if (return_size_val != NULL) { 3621 // This is the size 3622 (*return_size_val) = size; 3623 } 3624 3625 // Now generate allocation code 3626 3627 // The entire memory state is needed for slow path of the allocation 3628 // since GC and deoptimization can happened. 3629 Node *mem = reset_memory(); 3630 set_all_memory(mem); // Create new memory state 3631 3632 if (initial_slow_test->is_Bool()) { 3633 // Hide it behind a CMoveI, or else PhaseIdealLoop::split_up will get sick. 3634 initial_slow_test = initial_slow_test->as_Bool()->as_int_value(&_gvn); 3635 } 3636 3637 // Create the AllocateArrayNode and its result projections 3638 AllocateArrayNode* alloc 3639 = new AllocateArrayNode(C, AllocateArrayNode::alloc_type(TypeInt::INT), 3640 control(), mem, i_o(), 3641 size, klass_node, 3642 initial_slow_test, 3643 length); 3644 3645 // Cast to correct type. Note that the klass_node may be constant or not, 3646 // and in the latter case the actual array type will be inexact also. 3647 // (This happens via a non-constant argument to inline_native_newArray.) 3648 // In any case, the value of klass_node provides the desired array type. 3649 const TypeInt* length_type = _gvn.find_int_type(length); 3650 const TypeOopPtr* ary_type = _gvn.type(klass_node)->is_klassptr()->as_instance_type(); 3651 if (ary_type->isa_aryptr() && length_type != NULL) { 3652 // Try to get a better type than POS for the size 3653 ary_type = ary_type->is_aryptr()->cast_to_size(length_type); 3654 } 3655 3656 Node* javaoop = set_output_for_allocation(alloc, ary_type, deoptimize_on_exception); 3657 3658 // Cast length on remaining path to be as narrow as possible 3659 if (map()->find_edge(length) >= 0) { 3660 Node* ccast = alloc->make_ideal_length(ary_type, &_gvn); 3661 if (ccast != length) { 3662 _gvn.set_type_bottom(ccast); 3663 record_for_igvn(ccast); 3664 replace_in_map(length, ccast); 3665 } 3666 } 3667 3668 return javaoop; 3669 } 3670 3671 // The following "Ideal_foo" functions are placed here because they recognize 3672 // the graph shapes created by the functions immediately above. 3673 3674 //---------------------------Ideal_allocation---------------------------------- 3675 // Given an oop pointer or raw pointer, see if it feeds from an AllocateNode. 3676 AllocateNode* AllocateNode::Ideal_allocation(Node* ptr, PhaseTransform* phase) { 3677 if (ptr == NULL) { // reduce dumb test in callers 3678 return NULL; 3679 } 3680 if (ptr->is_CheckCastPP()) { // strip only one raw-to-oop cast 3681 ptr = ptr->in(1); 3682 if (ptr == NULL) return NULL; 3683 } 3684 // Return NULL for allocations with several casts: 3685 // j.l.reflect.Array.newInstance(jobject, jint) 3686 // Object.clone() 3687 // to keep more precise type from last cast. 3688 if (ptr->is_Proj()) { 3689 Node* allo = ptr->in(0); 3690 if (allo != NULL && allo->is_Allocate()) { 3691 return allo->as_Allocate(); 3692 } 3693 } 3694 // Report failure to match. 3695 return NULL; 3696 } 3697 3698 // Fancy version which also strips off an offset (and reports it to caller). 3699 AllocateNode* AllocateNode::Ideal_allocation(Node* ptr, PhaseTransform* phase, 3700 intptr_t& offset) { 3701 Node* base = AddPNode::Ideal_base_and_offset(ptr, phase, offset); 3702 if (base == NULL) return NULL; 3703 return Ideal_allocation(base, phase); 3704 } 3705 3706 // Trace Initialize <- Proj[Parm] <- Allocate 3707 AllocateNode* InitializeNode::allocation() { 3708 Node* rawoop = in(InitializeNode::RawAddress); 3709 if (rawoop->is_Proj()) { 3710 Node* alloc = rawoop->in(0); 3711 if (alloc->is_Allocate()) { 3712 return alloc->as_Allocate(); 3713 } 3714 } 3715 return NULL; 3716 } 3717 3718 // Trace Allocate -> Proj[Parm] -> Initialize 3719 InitializeNode* AllocateNode::initialization() { 3720 ProjNode* rawoop = proj_out(AllocateNode::RawAddress); 3721 if (rawoop == NULL) return NULL; 3722 for (DUIterator_Fast imax, i = rawoop->fast_outs(imax); i < imax; i++) { 3723 Node* init = rawoop->fast_out(i); 3724 if (init->is_Initialize()) { 3725 assert(init->as_Initialize()->allocation() == this, "2-way link"); 3726 return init->as_Initialize(); 3727 } 3728 } 3729 return NULL; 3730 } 3731 3732 //----------------------------- loop predicates --------------------------- 3733 3734 //------------------------------add_predicate_impl---------------------------- 3735 void GraphKit::add_predicate_impl(Deoptimization::DeoptReason reason, int nargs) { 3736 // Too many traps seen? 3737 if (too_many_traps(reason)) { 3738 #ifdef ASSERT 3739 if (TraceLoopPredicate) { 3740 int tc = C->trap_count(reason); 3741 tty->print("too many traps=%s tcount=%d in ", 3742 Deoptimization::trap_reason_name(reason), tc); 3743 method()->print(); // which method has too many predicate traps 3744 tty->cr(); 3745 } 3746 #endif 3747 // We cannot afford to take more traps here, 3748 // do not generate predicate. 3749 return; 3750 } 3751 3752 Node *cont = _gvn.intcon(1); 3753 Node* opq = _gvn.transform(new Opaque1Node(C, cont)); 3754 Node *bol = _gvn.transform(new Conv2BNode(opq)); 3755 IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN); 3756 Node* iffalse = _gvn.transform(new IfFalseNode(iff)); 3757 C->add_predicate_opaq(opq); 3758 { 3759 PreserveJVMState pjvms(this); 3760 set_control(iffalse); 3761 inc_sp(nargs); 3762 uncommon_trap(reason, Deoptimization::Action_maybe_recompile); 3763 } 3764 Node* iftrue = _gvn.transform(new IfTrueNode(iff)); 3765 set_control(iftrue); 3766 } 3767 3768 //------------------------------add_predicate--------------------------------- 3769 void GraphKit::add_predicate(int nargs) { 3770 if (UseLoopPredicate) { 3771 add_predicate_impl(Deoptimization::Reason_predicate, nargs); 3772 } 3773 // loop's limit check predicate should be near the loop. 3774 add_predicate_impl(Deoptimization::Reason_loop_limit_check, nargs); 3775 } 3776 3777 //----------------------------- store barriers ---------------------------- 3778 #define __ ideal. 3779 3780 void GraphKit::sync_kit(IdealKit& ideal) { 3781 set_all_memory(__ merged_memory()); 3782 set_i_o(__ i_o()); 3783 set_control(__ ctrl()); 3784 } 3785 3786 void GraphKit::final_sync(IdealKit& ideal) { 3787 // Final sync IdealKit and graphKit. 3788 sync_kit(ideal); 3789 } 3790 3791 Node* GraphKit::byte_map_base_node() { 3792 // Get base of card map 3793 CardTableModRefBS* ct = 3794 barrier_set_cast<CardTableModRefBS>(Universe::heap()->barrier_set()); 3795 assert(sizeof(*ct->byte_map_base) == sizeof(jbyte), "adjust users of this code"); 3796 if (ct->byte_map_base != NULL) { 3797 return makecon(TypeRawPtr::make((address)ct->byte_map_base)); 3798 } else { 3799 return null(); 3800 } 3801 } 3802 3803 // vanilla/CMS post barrier 3804 // Insert a write-barrier store. This is to let generational GC work; we have 3805 // to flag all oop-stores before the next GC point. 3806 void GraphKit::write_barrier_post(Node* oop_store, 3807 Node* obj, 3808 Node* adr, 3809 uint adr_idx, 3810 Node* val, 3811 bool use_precise) { 3812 // No store check needed if we're storing a NULL or an old object 3813 // (latter case is probably a string constant). The concurrent 3814 // mark sweep garbage collector, however, needs to have all nonNull 3815 // oop updates flagged via card-marks. 3816 if (val != NULL && val->is_Con()) { 3817 // must be either an oop or NULL 3818 const Type* t = val->bottom_type(); 3819 if (t == TypePtr::NULL_PTR || t == Type::TOP) 3820 // stores of null never (?) need barriers 3821 return; 3822 } 3823 3824 if (use_ReduceInitialCardMarks() 3825 && obj == just_allocated_object(control())) { 3826 // We can skip marks on a freshly-allocated object in Eden. 3827 // Keep this code in sync with new_store_pre_barrier() in runtime.cpp. 3828 // That routine informs GC to take appropriate compensating steps, 3829 // upon a slow-path allocation, so as to make this card-mark 3830 // elision safe. 3831 return; 3832 } 3833 3834 if (!use_precise) { 3835 // All card marks for a (non-array) instance are in one place: 3836 adr = obj; 3837 } 3838 // (Else it's an array (or unknown), and we want more precise card marks.) 3839 assert(adr != NULL, ""); 3840 3841 IdealKit ideal(this, true); 3842 3843 // Convert the pointer to an int prior to doing math on it 3844 Node* cast = __ CastPX(__ ctrl(), adr); 3845 3846 // Divide by card size 3847 assert(Universe::heap()->barrier_set()->is_a(BarrierSet::CardTableModRef), 3848 "Only one we handle so far."); 3849 Node* card_offset = __ URShiftX( cast, __ ConI(CardTableModRefBS::card_shift) ); 3850 3851 // Combine card table base and card offset 3852 Node* card_adr = __ AddP(__ top(), byte_map_base_node(), card_offset ); 3853 3854 // Get the alias_index for raw card-mark memory 3855 int adr_type = Compile::AliasIdxRaw; 3856 Node* zero = __ ConI(0); // Dirty card value 3857 BasicType bt = T_BYTE; 3858 3859 if (UseConcMarkSweepGC && UseCondCardMark) { 3860 insert_store_load_for_barrier(); 3861 __ sync_kit(this); 3862 } 3863 3864 if (UseCondCardMark) { 3865 // The classic GC reference write barrier is typically implemented 3866 // as a store into the global card mark table. Unfortunately 3867 // unconditional stores can result in false sharing and excessive 3868 // coherence traffic as well as false transactional aborts. 3869 // UseCondCardMark enables MP "polite" conditional card mark 3870 // stores. In theory we could relax the load from ctrl() to 3871 // no_ctrl, but that doesn't buy much latitude. 3872 Node* card_val = __ load( __ ctrl(), card_adr, TypeInt::BYTE, bt, adr_type); 3873 __ if_then(card_val, BoolTest::ne, zero); 3874 } 3875 3876 // Smash zero into card 3877 if( !UseConcMarkSweepGC ) { 3878 __ store(__ ctrl(), card_adr, zero, bt, adr_type, MemNode::unordered); 3879 } else { 3880 // Specialized path for CM store barrier 3881 __ storeCM(__ ctrl(), card_adr, zero, oop_store, adr_idx, bt, adr_type); 3882 } 3883 3884 if (UseCondCardMark) { 3885 __ end_if(); 3886 } 3887 3888 // Final sync IdealKit and GraphKit. 3889 final_sync(ideal); 3890 } 3891 /* 3892 * Determine if the G1 pre-barrier can be removed. The pre-barrier is 3893 * required by SATB to make sure all objects live at the start of the 3894 * marking are kept alive, all reference updates need to any previous 3895 * reference stored before writing. 3896 * 3897 * If the previous value is NULL there is no need to save the old value. 3898 * References that are NULL are filtered during runtime by the barrier 3899 * code to avoid unnecessary queuing. 3900 * 3901 * However in the case of newly allocated objects it might be possible to 3902 * prove that the reference about to be overwritten is NULL during compile 3903 * time and avoid adding the barrier code completely. 3904 * 3905 * The compiler needs to determine that the object in which a field is about 3906 * to be written is newly allocated, and that no prior store to the same field 3907 * has happened since the allocation. 3908 * 3909 * Returns true if the pre-barrier can be removed 3910 */ 3911 bool GraphKit::g1_can_remove_pre_barrier(PhaseTransform* phase, Node* adr, 3912 BasicType bt, uint adr_idx) { 3913 intptr_t offset = 0; 3914 Node* base = AddPNode::Ideal_base_and_offset(adr, phase, offset); 3915 AllocateNode* alloc = AllocateNode::Ideal_allocation(base, phase); 3916 3917 if (offset == Type::OffsetBot) { 3918 return false; // cannot unalias unless there are precise offsets 3919 } 3920 3921 if (alloc == NULL) { 3922 return false; // No allocation found 3923 } 3924 3925 intptr_t size_in_bytes = type2aelembytes(bt); 3926 3927 Node* mem = memory(adr_idx); // start searching here... 3928 3929 for (int cnt = 0; cnt < 50; cnt++) { 3930 3931 if (mem->is_Store()) { 3932 3933 Node* st_adr = mem->in(MemNode::Address); 3934 intptr_t st_offset = 0; 3935 Node* st_base = AddPNode::Ideal_base_and_offset(st_adr, phase, st_offset); 3936 3937 if (st_base == NULL) { 3938 break; // inscrutable pointer 3939 } 3940 3941 // Break we have found a store with same base and offset as ours so break 3942 if (st_base == base && st_offset == offset) { 3943 break; 3944 } 3945 3946 if (st_offset != offset && st_offset != Type::OffsetBot) { 3947 const int MAX_STORE = BytesPerLong; 3948 if (st_offset >= offset + size_in_bytes || 3949 st_offset <= offset - MAX_STORE || 3950 st_offset <= offset - mem->as_Store()->memory_size()) { 3951 // Success: The offsets are provably independent. 3952 // (You may ask, why not just test st_offset != offset and be done? 3953 // The answer is that stores of different sizes can co-exist 3954 // in the same sequence of RawMem effects. We sometimes initialize 3955 // a whole 'tile' of array elements with a single jint or jlong.) 3956 mem = mem->in(MemNode::Memory); 3957 continue; // advance through independent store memory 3958 } 3959 } 3960 3961 if (st_base != base 3962 && MemNode::detect_ptr_independence(base, alloc, st_base, 3963 AllocateNode::Ideal_allocation(st_base, phase), 3964 phase)) { 3965 // Success: The bases are provably independent. 3966 mem = mem->in(MemNode::Memory); 3967 continue; // advance through independent store memory 3968 } 3969 } else if (mem->is_Proj() && mem->in(0)->is_Initialize()) { 3970 3971 InitializeNode* st_init = mem->in(0)->as_Initialize(); 3972 AllocateNode* st_alloc = st_init->allocation(); 3973 3974 // Make sure that we are looking at the same allocation site. 3975 // The alloc variable is guaranteed to not be null here from earlier check. 3976 if (alloc == st_alloc) { 3977 // Check that the initialization is storing NULL so that no previous store 3978 // has been moved up and directly write a reference 3979 Node* captured_store = st_init->find_captured_store(offset, 3980 type2aelembytes(T_OBJECT), 3981 phase); 3982 if (captured_store == NULL || captured_store == st_init->zero_memory()) { 3983 return true; 3984 } 3985 } 3986 } 3987 3988 // Unless there is an explicit 'continue', we must bail out here, 3989 // because 'mem' is an inscrutable memory state (e.g., a call). 3990 break; 3991 } 3992 3993 return false; 3994 } 3995 3996 // G1 pre/post barriers 3997 void GraphKit::g1_write_barrier_pre(bool do_load, 3998 Node* obj, 3999 Node* adr, 4000 uint alias_idx, 4001 Node* val, 4002 const TypeOopPtr* val_type, 4003 Node* pre_val, 4004 BasicType bt) { 4005 4006 // Some sanity checks 4007 // Note: val is unused in this routine. 4008 4009 if (do_load) { 4010 // We need to generate the load of the previous value 4011 assert(obj != NULL, "must have a base"); 4012 assert(adr != NULL, "where are loading from?"); 4013 assert(pre_val == NULL, "loaded already?"); 4014 assert(val_type != NULL, "need a type"); 4015 4016 if (use_ReduceInitialCardMarks() 4017 && g1_can_remove_pre_barrier(&_gvn, adr, bt, alias_idx)) { 4018 return; 4019 } 4020 4021 } else { 4022 // In this case both val_type and alias_idx are unused. 4023 assert(pre_val != NULL, "must be loaded already"); 4024 // Nothing to be done if pre_val is null. 4025 if (pre_val->bottom_type() == TypePtr::NULL_PTR) return; 4026 assert(pre_val->bottom_type()->basic_type() == T_OBJECT, "or we shouldn't be here"); 4027 } 4028 assert(bt == T_OBJECT, "or we shouldn't be here"); 4029 4030 IdealKit ideal(this, true); 4031 4032 Node* tls = __ thread(); // ThreadLocalStorage 4033 4034 Node* no_ctrl = NULL; 4035 Node* no_base = __ top(); 4036 Node* zero = __ ConI(0); 4037 Node* zeroX = __ ConX(0); 4038 4039 float likely = PROB_LIKELY(0.999); 4040 float unlikely = PROB_UNLIKELY(0.999); 4041 4042 BasicType active_type = in_bytes(SATBMarkQueue::byte_width_of_active()) == 4 ? T_INT : T_BYTE; 4043 assert(in_bytes(SATBMarkQueue::byte_width_of_active()) == 4 || in_bytes(SATBMarkQueue::byte_width_of_active()) == 1, "flag width"); 4044 4045 // Offsets into the thread 4046 const int marking_offset = in_bytes(JavaThread::satb_mark_queue_offset() + // 648 4047 SATBMarkQueue::byte_offset_of_active()); 4048 const int index_offset = in_bytes(JavaThread::satb_mark_queue_offset() + // 656 4049 SATBMarkQueue::byte_offset_of_index()); 4050 const int buffer_offset = in_bytes(JavaThread::satb_mark_queue_offset() + // 652 4051 SATBMarkQueue::byte_offset_of_buf()); 4052 4053 // Now the actual pointers into the thread 4054 Node* marking_adr = __ AddP(no_base, tls, __ ConX(marking_offset)); 4055 Node* buffer_adr = __ AddP(no_base, tls, __ ConX(buffer_offset)); 4056 Node* index_adr = __ AddP(no_base, tls, __ ConX(index_offset)); 4057 4058 // Now some of the values 4059 Node* marking = __ load(__ ctrl(), marking_adr, TypeInt::INT, active_type, Compile::AliasIdxRaw); 4060 4061 // if (!marking) 4062 __ if_then(marking, BoolTest::ne, zero, unlikely); { 4063 BasicType index_bt = TypeX_X->basic_type(); 4064 assert(sizeof(size_t) == type2aelembytes(index_bt), "Loading G1 SATBMarkQueue::_index with wrong size."); 4065 Node* index = __ load(__ ctrl(), index_adr, TypeX_X, index_bt, Compile::AliasIdxRaw); 4066 4067 if (do_load) { 4068 // load original value 4069 // alias_idx correct?? 4070 pre_val = __ load(__ ctrl(), adr, val_type, bt, alias_idx); 4071 } 4072 4073 // if (pre_val != NULL) 4074 __ if_then(pre_val, BoolTest::ne, null()); { 4075 Node* buffer = __ load(__ ctrl(), buffer_adr, TypeRawPtr::NOTNULL, T_ADDRESS, Compile::AliasIdxRaw); 4076 4077 // is the queue for this thread full? 4078 __ if_then(index, BoolTest::ne, zeroX, likely); { 4079 4080 // decrement the index 4081 Node* next_index = _gvn.transform(new SubXNode(index, __ ConX(sizeof(intptr_t)))); 4082 4083 // Now get the buffer location we will log the previous value into and store it 4084 Node *log_addr = __ AddP(no_base, buffer, next_index); 4085 __ store(__ ctrl(), log_addr, pre_val, T_OBJECT, Compile::AliasIdxRaw, MemNode::unordered); 4086 // update the index 4087 __ store(__ ctrl(), index_adr, next_index, index_bt, Compile::AliasIdxRaw, MemNode::unordered); 4088 4089 } __ else_(); { 4090 4091 // logging buffer is full, call the runtime 4092 const TypeFunc *tf = OptoRuntime::g1_wb_pre_Type(); 4093 __ make_leaf_call(tf, CAST_FROM_FN_PTR(address, SharedRuntime::g1_wb_pre), "g1_wb_pre", pre_val, tls); 4094 } __ end_if(); // (!index) 4095 } __ end_if(); // (pre_val != NULL) 4096 } __ end_if(); // (!marking) 4097 4098 // Final sync IdealKit and GraphKit. 4099 final_sync(ideal); 4100 } 4101 4102 /* 4103 * G1 similar to any GC with a Young Generation requires a way to keep track of 4104 * references from Old Generation to Young Generation to make sure all live 4105 * objects are found. G1 also requires to keep track of object references 4106 * between different regions to enable evacuation of old regions, which is done 4107 * as part of mixed collections. References are tracked in remembered sets and 4108 * is continuously updated as reference are written to with the help of the 4109 * post-barrier. 4110 * 4111 * To reduce the number of updates to the remembered set the post-barrier 4112 * filters updates to fields in objects located in the Young Generation, 4113 * the same region as the reference, when the NULL is being written or 4114 * if the card is already marked as dirty by an earlier write. 4115 * 4116 * Under certain circumstances it is possible to avoid generating the 4117 * post-barrier completely if it is possible during compile time to prove 4118 * the object is newly allocated and that no safepoint exists between the 4119 * allocation and the store. 4120 * 4121 * In the case of slow allocation the allocation code must handle the barrier 4122 * as part of the allocation in the case the allocated object is not located 4123 * in the nursery, this would happen for humongous objects. This is similar to 4124 * how CMS is required to handle this case, see the comments for the method 4125 * CollectedHeap::new_store_pre_barrier and OptoRuntime::new_store_pre_barrier. 4126 * A deferred card mark is required for these objects and handled in the above 4127 * mentioned methods. 4128 * 4129 * Returns true if the post barrier can be removed 4130 */ 4131 bool GraphKit::g1_can_remove_post_barrier(PhaseTransform* phase, Node* store, 4132 Node* adr) { 4133 intptr_t offset = 0; 4134 Node* base = AddPNode::Ideal_base_and_offset(adr, phase, offset); 4135 AllocateNode* alloc = AllocateNode::Ideal_allocation(base, phase); 4136 4137 if (offset == Type::OffsetBot) { 4138 return false; // cannot unalias unless there are precise offsets 4139 } 4140 4141 if (alloc == NULL) { 4142 return false; // No allocation found 4143 } 4144 4145 // Start search from Store node 4146 Node* mem = store->in(MemNode::Control); 4147 if (mem->is_Proj() && mem->in(0)->is_Initialize()) { 4148 4149 InitializeNode* st_init = mem->in(0)->as_Initialize(); 4150 AllocateNode* st_alloc = st_init->allocation(); 4151 4152 // Make sure we are looking at the same allocation 4153 if (alloc == st_alloc) { 4154 return true; 4155 } 4156 } 4157 4158 return false; 4159 } 4160 4161 // 4162 // Update the card table and add card address to the queue 4163 // 4164 void GraphKit::g1_mark_card(IdealKit& ideal, 4165 Node* card_adr, 4166 Node* oop_store, 4167 uint oop_alias_idx, 4168 Node* index, 4169 Node* index_adr, 4170 Node* buffer, 4171 const TypeFunc* tf) { 4172 4173 Node* zero = __ ConI(0); 4174 Node* zeroX = __ ConX(0); 4175 Node* no_base = __ top(); 4176 BasicType card_bt = T_BYTE; 4177 // Smash zero into card. MUST BE ORDERED WRT TO STORE 4178 __ storeCM(__ ctrl(), card_adr, zero, oop_store, oop_alias_idx, card_bt, Compile::AliasIdxRaw); 4179 4180 // Now do the queue work 4181 __ if_then(index, BoolTest::ne, zeroX); { 4182 4183 Node* next_index = _gvn.transform(new SubXNode(index, __ ConX(sizeof(intptr_t)))); 4184 Node* log_addr = __ AddP(no_base, buffer, next_index); 4185 4186 // Order, see storeCM. 4187 __ store(__ ctrl(), log_addr, card_adr, T_ADDRESS, Compile::AliasIdxRaw, MemNode::unordered); 4188 __ store(__ ctrl(), index_adr, next_index, TypeX_X->basic_type(), Compile::AliasIdxRaw, MemNode::unordered); 4189 4190 } __ else_(); { 4191 __ make_leaf_call(tf, CAST_FROM_FN_PTR(address, SharedRuntime::g1_wb_post), "g1_wb_post", card_adr, __ thread()); 4192 } __ end_if(); 4193 4194 } 4195 4196 void GraphKit::g1_write_barrier_post(Node* oop_store, 4197 Node* obj, 4198 Node* adr, 4199 uint alias_idx, 4200 Node* val, 4201 BasicType bt, 4202 bool use_precise) { 4203 // If we are writing a NULL then we need no post barrier 4204 4205 if (val != NULL && val->is_Con() && val->bottom_type() == TypePtr::NULL_PTR) { 4206 // Must be NULL 4207 const Type* t = val->bottom_type(); 4208 assert(t == Type::TOP || t == TypePtr::NULL_PTR, "must be NULL"); 4209 // No post barrier if writing NULLx 4210 return; 4211 } 4212 4213 if (use_ReduceInitialCardMarks() && obj == just_allocated_object(control())) { 4214 // We can skip marks on a freshly-allocated object in Eden. 4215 // Keep this code in sync with new_store_pre_barrier() in runtime.cpp. 4216 // That routine informs GC to take appropriate compensating steps, 4217 // upon a slow-path allocation, so as to make this card-mark 4218 // elision safe. 4219 return; 4220 } 4221 4222 if (use_ReduceInitialCardMarks() 4223 && g1_can_remove_post_barrier(&_gvn, oop_store, adr)) { 4224 return; 4225 } 4226 4227 if (!use_precise) { 4228 // All card marks for a (non-array) instance are in one place: 4229 adr = obj; 4230 } 4231 // (Else it's an array (or unknown), and we want more precise card marks.) 4232 assert(adr != NULL, ""); 4233 4234 IdealKit ideal(this, true); 4235 4236 Node* tls = __ thread(); // ThreadLocalStorage 4237 4238 Node* no_base = __ top(); 4239 float likely = PROB_LIKELY(0.999); 4240 float unlikely = PROB_UNLIKELY(0.999); 4241 Node* young_card = __ ConI((jint)G1SATBCardTableModRefBS::g1_young_card_val()); 4242 Node* dirty_card = __ ConI((jint)CardTableModRefBS::dirty_card_val()); 4243 Node* zeroX = __ ConX(0); 4244 4245 // Get the alias_index for raw card-mark memory 4246 const TypePtr* card_type = TypeRawPtr::BOTTOM; 4247 4248 const TypeFunc *tf = OptoRuntime::g1_wb_post_Type(); 4249 4250 // Offsets into the thread 4251 const int index_offset = in_bytes(JavaThread::dirty_card_queue_offset() + 4252 DirtyCardQueue::byte_offset_of_index()); 4253 const int buffer_offset = in_bytes(JavaThread::dirty_card_queue_offset() + 4254 DirtyCardQueue::byte_offset_of_buf()); 4255 4256 // Pointers into the thread 4257 4258 Node* buffer_adr = __ AddP(no_base, tls, __ ConX(buffer_offset)); 4259 Node* index_adr = __ AddP(no_base, tls, __ ConX(index_offset)); 4260 4261 // Now some values 4262 // Use ctrl to avoid hoisting these values past a safepoint, which could 4263 // potentially reset these fields in the JavaThread. 4264 Node* index = __ load(__ ctrl(), index_adr, TypeX_X, TypeX_X->basic_type(), Compile::AliasIdxRaw); 4265 Node* buffer = __ load(__ ctrl(), buffer_adr, TypeRawPtr::NOTNULL, T_ADDRESS, Compile::AliasIdxRaw); 4266 4267 // Convert the store obj pointer to an int prior to doing math on it 4268 // Must use ctrl to prevent "integerized oop" existing across safepoint 4269 Node* cast = __ CastPX(__ ctrl(), adr); 4270 4271 // Divide pointer by card size 4272 Node* card_offset = __ URShiftX( cast, __ ConI(CardTableModRefBS::card_shift) ); 4273 4274 // Combine card table base and card offset 4275 Node* card_adr = __ AddP(no_base, byte_map_base_node(), card_offset ); 4276 4277 // If we know the value being stored does it cross regions? 4278 4279 if (val != NULL) { 4280 // Does the store cause us to cross regions? 4281 4282 // Should be able to do an unsigned compare of region_size instead of 4283 // and extra shift. Do we have an unsigned compare?? 4284 // Node* region_size = __ ConI(1 << HeapRegion::LogOfHRGrainBytes); 4285 Node* xor_res = __ URShiftX ( __ XorX( cast, __ CastPX(__ ctrl(), val)), __ ConI(HeapRegion::LogOfHRGrainBytes)); 4286 4287 // if (xor_res == 0) same region so skip 4288 __ if_then(xor_res, BoolTest::ne, zeroX); { 4289 4290 // No barrier if we are storing a NULL 4291 __ if_then(val, BoolTest::ne, null(), unlikely); { 4292 4293 // Ok must mark the card if not already dirty 4294 4295 // load the original value of the card 4296 Node* card_val = __ load(__ ctrl(), card_adr, TypeInt::INT, T_BYTE, Compile::AliasIdxRaw); 4297 4298 __ if_then(card_val, BoolTest::ne, young_card); { 4299 sync_kit(ideal); 4300 insert_store_load_for_barrier(); 4301 __ sync_kit(this); 4302 4303 Node* card_val_reload = __ load(__ ctrl(), card_adr, TypeInt::INT, T_BYTE, Compile::AliasIdxRaw); 4304 __ if_then(card_val_reload, BoolTest::ne, dirty_card); { 4305 g1_mark_card(ideal, card_adr, oop_store, alias_idx, index, index_adr, buffer, tf); 4306 } __ end_if(); 4307 } __ end_if(); 4308 } __ end_if(); 4309 } __ end_if(); 4310 } else { 4311 // The Object.clone() intrinsic uses this path if !ReduceInitialCardMarks. 4312 // We don't need a barrier here if the destination is a newly allocated object 4313 // in Eden. Otherwise, GC verification breaks because we assume that cards in Eden 4314 // are set to 'g1_young_gen' (see G1SATBCardTableModRefBS::verify_g1_young_region()). 4315 assert(!use_ReduceInitialCardMarks(), "can only happen with card marking"); 4316 Node* card_val = __ load(__ ctrl(), card_adr, TypeInt::INT, T_BYTE, Compile::AliasIdxRaw); 4317 __ if_then(card_val, BoolTest::ne, young_card); { 4318 g1_mark_card(ideal, card_adr, oop_store, alias_idx, index, index_adr, buffer, tf); 4319 } __ end_if(); 4320 } 4321 4322 // Final sync IdealKit and GraphKit. 4323 final_sync(ideal); 4324 } 4325 #undef __ 4326 4327 4328 Node* GraphKit::load_String_length(Node* ctrl, Node* str) { 4329 Node* len = load_array_length(load_String_value(ctrl, str)); 4330 Node* coder = load_String_coder(ctrl, str); 4331 // Divide length by 2 if coder is UTF16 4332 return _gvn.transform(new RShiftINode(len, coder)); 4333 } 4334 4335 Node* GraphKit::load_String_value(Node* ctrl, Node* str) { 4336 int value_offset = java_lang_String::value_offset_in_bytes(); 4337 const TypeInstPtr* string_type = TypeInstPtr::make(TypePtr::NotNull, C->env()->String_klass(), 4338 false, NULL, 0); 4339 const TypePtr* value_field_type = string_type->add_offset(value_offset); 4340 const TypeAryPtr* value_type = TypeAryPtr::make(TypePtr::NotNull, 4341 TypeAry::make(TypeInt::BYTE, TypeInt::POS), 4342 ciTypeArrayKlass::make(T_BYTE), true, 0); 4343 int value_field_idx = C->get_alias_index(value_field_type); 4344 Node* load = make_load(ctrl, basic_plus_adr(str, str, value_offset), 4345 value_type, T_OBJECT, value_field_idx, MemNode::unordered); 4346 // String.value field is known to be @Stable. 4347 if (UseImplicitStableValues) { 4348 load = cast_array_to_stable(load, value_type); 4349 } 4350 return load; 4351 } 4352 4353 Node* GraphKit::load_String_coder(Node* ctrl, Node* str) { 4354 if (java_lang_String::has_coder_field()) { 4355 if (!CompactStrings) { 4356 return intcon(java_lang_String::CODER_UTF16); 4357 } 4358 int coder_offset = java_lang_String::coder_offset_in_bytes(); 4359 const TypeInstPtr* string_type = TypeInstPtr::make(TypePtr::NotNull, C->env()->String_klass(), 4360 false, NULL, 0); 4361 const TypePtr* coder_field_type = string_type->add_offset(coder_offset); 4362 int coder_field_idx = C->get_alias_index(coder_field_type); 4363 return make_load(ctrl, basic_plus_adr(str, str, coder_offset), 4364 TypeInt::BYTE, T_BYTE, coder_field_idx, MemNode::unordered); 4365 } else { 4366 return intcon(0); // false 4367 } 4368 } 4369 4370 void GraphKit::store_String_value(Node* ctrl, Node* str, Node* value) { 4371 int value_offset = java_lang_String::value_offset_in_bytes(); 4372 const TypeInstPtr* string_type = TypeInstPtr::make(TypePtr::NotNull, C->env()->String_klass(), 4373 false, NULL, 0); 4374 const TypePtr* value_field_type = string_type->add_offset(value_offset); 4375 store_oop_to_object(ctrl, str, basic_plus_adr(str, value_offset), value_field_type, 4376 value, TypeAryPtr::BYTES, T_OBJECT, MemNode::unordered); 4377 } 4378 4379 void GraphKit::store_String_coder(Node* ctrl, Node* str, Node* value) { 4380 int coder_offset = java_lang_String::coder_offset_in_bytes(); 4381 const TypeInstPtr* string_type = TypeInstPtr::make(TypePtr::NotNull, C->env()->String_klass(), 4382 false, NULL, 0); 4383 const TypePtr* coder_field_type = string_type->add_offset(coder_offset); 4384 int coder_field_idx = C->get_alias_index(coder_field_type); 4385 store_to_memory(ctrl, basic_plus_adr(str, coder_offset), 4386 value, T_BYTE, coder_field_idx, MemNode::unordered); 4387 } 4388 4389 // Capture src and dst memory state with a MergeMemNode 4390 Node* GraphKit::capture_memory(const TypePtr* src_type, const TypePtr* dst_type) { 4391 if (src_type == dst_type) { 4392 // Types are equal, we don't need a MergeMemNode 4393 return memory(src_type); 4394 } 4395 MergeMemNode* merge = MergeMemNode::make(map()->memory()); 4396 record_for_igvn(merge); // fold it up later, if possible 4397 int src_idx = C->get_alias_index(src_type); 4398 int dst_idx = C->get_alias_index(dst_type); 4399 merge->set_memory_at(src_idx, memory(src_idx)); 4400 merge->set_memory_at(dst_idx, memory(dst_idx)); 4401 return merge; 4402 } 4403 4404 Node* GraphKit::compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count) { 4405 assert(Matcher::match_rule_supported(Op_StrCompressedCopy), "Intrinsic not supported"); 4406 assert(src_type == TypeAryPtr::BYTES || src_type == TypeAryPtr::CHARS, "invalid source type"); 4407 // If input and output memory types differ, capture both states to preserve 4408 // the dependency between preceding and subsequent loads/stores. 4409 // For example, the following program: 4410 // StoreB 4411 // compress_string 4412 // LoadB 4413 // has this memory graph (use->def): 4414 // LoadB -> compress_string -> CharMem 4415 // ... -> StoreB -> ByteMem 4416 // The intrinsic hides the dependency between LoadB and StoreB, causing 4417 // the load to read from memory not containing the result of the StoreB. 4418 // The correct memory graph should look like this: 4419 // LoadB -> compress_string -> MergeMem(CharMem, StoreB(ByteMem)) 4420 Node* mem = capture_memory(src_type, TypeAryPtr::BYTES); 4421 StrCompressedCopyNode* str = new StrCompressedCopyNode(control(), mem, src, dst, count); 4422 Node* res_mem = _gvn.transform(new SCMemProjNode(str)); 4423 set_memory(res_mem, TypeAryPtr::BYTES); 4424 return str; 4425 } 4426 4427 void GraphKit::inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count) { 4428 assert(Matcher::match_rule_supported(Op_StrInflatedCopy), "Intrinsic not supported"); 4429 assert(dst_type == TypeAryPtr::BYTES || dst_type == TypeAryPtr::CHARS, "invalid dest type"); 4430 // Capture src and dst memory (see comment in 'compress_string'). 4431 Node* mem = capture_memory(TypeAryPtr::BYTES, dst_type); 4432 StrInflatedCopyNode* str = new StrInflatedCopyNode(control(), mem, src, dst, count); 4433 set_memory(_gvn.transform(str), dst_type); 4434 } 4435 4436 void GraphKit::inflate_string_slow(Node* src, Node* dst, Node* start, Node* count) { 4437 /** 4438 * int i_char = start; 4439 * for (int i_byte = 0; i_byte < count; i_byte++) { 4440 * dst[i_char++] = (char)(src[i_byte] & 0xff); 4441 * } 4442 */ 4443 add_predicate(); 4444 RegionNode* head = new RegionNode(3); 4445 head->init_req(1, control()); 4446 gvn().set_type(head, Type::CONTROL); 4447 record_for_igvn(head); 4448 4449 Node* i_byte = new PhiNode(head, TypeInt::INT); 4450 i_byte->init_req(1, intcon(0)); 4451 gvn().set_type(i_byte, TypeInt::INT); 4452 record_for_igvn(i_byte); 4453 4454 Node* i_char = new PhiNode(head, TypeInt::INT); 4455 i_char->init_req(1, start); 4456 gvn().set_type(i_char, TypeInt::INT); 4457 record_for_igvn(i_char); 4458 4459 Node* mem = PhiNode::make(head, memory(TypeAryPtr::BYTES), Type::MEMORY, TypeAryPtr::BYTES); 4460 gvn().set_type(mem, Type::MEMORY); 4461 record_for_igvn(mem); 4462 set_control(head); 4463 set_memory(mem, TypeAryPtr::BYTES); 4464 Node* ch = load_array_element(control(), src, i_byte, TypeAryPtr::BYTES); 4465 Node* st = store_to_memory(control(), array_element_address(dst, i_char, T_BYTE), 4466 AndI(ch, intcon(0xff)), T_CHAR, TypeAryPtr::BYTES, MemNode::unordered, 4467 false, false, true /* mismatched */); 4468 4469 IfNode* iff = create_and_map_if(head, Bool(CmpI(i_byte, count), BoolTest::lt), PROB_FAIR, COUNT_UNKNOWN); 4470 head->init_req(2, IfTrue(iff)); 4471 mem->init_req(2, st); 4472 i_byte->init_req(2, AddI(i_byte, intcon(1))); 4473 i_char->init_req(2, AddI(i_char, intcon(2))); 4474 4475 set_control(IfFalse(iff)); 4476 set_memory(st, TypeAryPtr::BYTES); 4477 } 4478 4479 Node* GraphKit::make_constant_from_field(ciField* field, Node* obj) { 4480 if (!field->is_constant()) { 4481 return NULL; // Field not marked as constant. 4482 } 4483 ciInstance* holder = NULL; 4484 if (!field->is_static()) { 4485 ciObject* const_oop = obj->bottom_type()->is_oopptr()->const_oop(); 4486 if (const_oop != NULL && const_oop->is_instance()) { 4487 holder = const_oop->as_instance(); 4488 } 4489 } 4490 const Type* con_type = Type::make_constant_from_field(field, holder, field->layout_type(), 4491 /*is_unsigned_load=*/false); 4492 if (con_type != NULL) { 4493 return makecon(con_type); 4494 } 4495 return NULL; 4496 } 4497 4498 Node* GraphKit::cast_array_to_stable(Node* ary, const TypeAryPtr* ary_type) { 4499 // Reify the property as a CastPP node in Ideal graph to comply with monotonicity 4500 // assumption of CCP analysis. 4501 return _gvn.transform(new CastPPNode(ary, ary_type->cast_to_stable(true))); 4502 }