1 /* 2 * Copyright (c) 1997, 2015, 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 "asm/macroAssembler.hpp" 27 #include "asm/macroAssembler.inline.hpp" 28 #include "ci/ciReplay.hpp" 29 #include "classfile/systemDictionary.hpp" 30 #include "code/exceptionHandlerTable.hpp" 31 #include "code/nmethod.hpp" 32 #include "compiler/compileBroker.hpp" 33 #include "compiler/compileLog.hpp" 34 #include "compiler/disassembler.hpp" 35 #include "compiler/oopMap.hpp" 36 #include "opto/addnode.hpp" 37 #include "opto/block.hpp" 38 #include "opto/c2compiler.hpp" 39 #include "opto/callGenerator.hpp" 40 #include "opto/callnode.hpp" 41 #include "opto/cfgnode.hpp" 42 #include "opto/chaitin.hpp" 43 #include "opto/compile.hpp" 44 #include "opto/connode.hpp" 45 #include "opto/convertnode.hpp" 46 #include "opto/divnode.hpp" 47 #include "opto/escape.hpp" 48 #include "opto/idealGraphPrinter.hpp" 49 #include "opto/loopnode.hpp" 50 #include "opto/machnode.hpp" 51 #include "opto/macro.hpp" 52 #include "opto/matcher.hpp" 53 #include "opto/mathexactnode.hpp" 54 #include "opto/memnode.hpp" 55 #include "opto/mulnode.hpp" 56 #include "opto/narrowptrnode.hpp" 57 #include "opto/node.hpp" 58 #include "opto/opcodes.hpp" 59 #include "opto/output.hpp" 60 #include "opto/parse.hpp" 61 #include "opto/phaseX.hpp" 62 #include "opto/rootnode.hpp" 63 #include "opto/runtime.hpp" 64 #include "opto/stringopts.hpp" 65 #include "opto/type.hpp" 66 #include "opto/vectornode.hpp" 67 #include "runtime/arguments.hpp" 68 #include "runtime/sharedRuntime.hpp" 69 #include "runtime/signature.hpp" 70 #include "runtime/stubRoutines.hpp" 71 #include "runtime/timer.hpp" 72 #include "utilities/copy.hpp" 73 74 75 // -------------------- Compile::mach_constant_base_node ----------------------- 76 // Constant table base node singleton. 77 MachConstantBaseNode* Compile::mach_constant_base_node() { 78 if (_mach_constant_base_node == NULL) { 79 _mach_constant_base_node = new MachConstantBaseNode(); 80 _mach_constant_base_node->add_req(C->root()); 81 } 82 return _mach_constant_base_node; 83 } 84 85 86 /// Support for intrinsics. 87 88 // Return the index at which m must be inserted (or already exists). 89 // The sort order is by the address of the ciMethod, with is_virtual as minor key. 90 int Compile::intrinsic_insertion_index(ciMethod* m, bool is_virtual) { 91 #ifdef ASSERT 92 for (int i = 1; i < _intrinsics->length(); i++) { 93 CallGenerator* cg1 = _intrinsics->at(i-1); 94 CallGenerator* cg2 = _intrinsics->at(i); 95 assert(cg1->method() != cg2->method() 96 ? cg1->method() < cg2->method() 97 : cg1->is_virtual() < cg2->is_virtual(), 98 "compiler intrinsics list must stay sorted"); 99 } 100 #endif 101 // Binary search sorted list, in decreasing intervals [lo, hi]. 102 int lo = 0, hi = _intrinsics->length()-1; 103 while (lo <= hi) { 104 int mid = (uint)(hi + lo) / 2; 105 ciMethod* mid_m = _intrinsics->at(mid)->method(); 106 if (m < mid_m) { 107 hi = mid-1; 108 } else if (m > mid_m) { 109 lo = mid+1; 110 } else { 111 // look at minor sort key 112 bool mid_virt = _intrinsics->at(mid)->is_virtual(); 113 if (is_virtual < mid_virt) { 114 hi = mid-1; 115 } else if (is_virtual > mid_virt) { 116 lo = mid+1; 117 } else { 118 return mid; // exact match 119 } 120 } 121 } 122 return lo; // inexact match 123 } 124 125 void Compile::register_intrinsic(CallGenerator* cg) { 126 if (_intrinsics == NULL) { 127 _intrinsics = new (comp_arena())GrowableArray<CallGenerator*>(comp_arena(), 60, 0, NULL); 128 } 129 // This code is stolen from ciObjectFactory::insert. 130 // Really, GrowableArray should have methods for 131 // insert_at, remove_at, and binary_search. 132 int len = _intrinsics->length(); 133 int index = intrinsic_insertion_index(cg->method(), cg->is_virtual()); 134 if (index == len) { 135 _intrinsics->append(cg); 136 } else { 137 #ifdef ASSERT 138 CallGenerator* oldcg = _intrinsics->at(index); 139 assert(oldcg->method() != cg->method() || oldcg->is_virtual() != cg->is_virtual(), "don't register twice"); 140 #endif 141 _intrinsics->append(_intrinsics->at(len-1)); 142 int pos; 143 for (pos = len-2; pos >= index; pos--) { 144 _intrinsics->at_put(pos+1,_intrinsics->at(pos)); 145 } 146 _intrinsics->at_put(index, cg); 147 } 148 assert(find_intrinsic(cg->method(), cg->is_virtual()) == cg, "registration worked"); 149 } 150 151 CallGenerator* Compile::find_intrinsic(ciMethod* m, bool is_virtual) { 152 assert(m->is_loaded(), "don't try this on unloaded methods"); 153 if (_intrinsics != NULL) { 154 int index = intrinsic_insertion_index(m, is_virtual); 155 if (index < _intrinsics->length() 156 && _intrinsics->at(index)->method() == m 157 && _intrinsics->at(index)->is_virtual() == is_virtual) { 158 return _intrinsics->at(index); 159 } 160 } 161 // Lazily create intrinsics for intrinsic IDs well-known in the runtime. 162 if (m->intrinsic_id() != vmIntrinsics::_none && 163 m->intrinsic_id() <= vmIntrinsics::LAST_COMPILER_INLINE) { 164 CallGenerator* cg = make_vm_intrinsic(m, is_virtual); 165 if (cg != NULL) { 166 // Save it for next time: 167 register_intrinsic(cg); 168 return cg; 169 } else { 170 gather_intrinsic_statistics(m->intrinsic_id(), is_virtual, _intrinsic_disabled); 171 } 172 } 173 return NULL; 174 } 175 176 // Compile:: register_library_intrinsics and make_vm_intrinsic are defined 177 // in library_call.cpp. 178 179 180 #ifndef PRODUCT 181 // statistics gathering... 182 183 juint Compile::_intrinsic_hist_count[vmIntrinsics::ID_LIMIT] = {0}; 184 jubyte Compile::_intrinsic_hist_flags[vmIntrinsics::ID_LIMIT] = {0}; 185 186 bool Compile::gather_intrinsic_statistics(vmIntrinsics::ID id, bool is_virtual, int flags) { 187 assert(id > vmIntrinsics::_none && id < vmIntrinsics::ID_LIMIT, "oob"); 188 int oflags = _intrinsic_hist_flags[id]; 189 assert(flags != 0, "what happened?"); 190 if (is_virtual) { 191 flags |= _intrinsic_virtual; 192 } 193 bool changed = (flags != oflags); 194 if ((flags & _intrinsic_worked) != 0) { 195 juint count = (_intrinsic_hist_count[id] += 1); 196 if (count == 1) { 197 changed = true; // first time 198 } 199 // increment the overall count also: 200 _intrinsic_hist_count[vmIntrinsics::_none] += 1; 201 } 202 if (changed) { 203 if (((oflags ^ flags) & _intrinsic_virtual) != 0) { 204 // Something changed about the intrinsic's virtuality. 205 if ((flags & _intrinsic_virtual) != 0) { 206 // This is the first use of this intrinsic as a virtual call. 207 if (oflags != 0) { 208 // We already saw it as a non-virtual, so note both cases. 209 flags |= _intrinsic_both; 210 } 211 } else if ((oflags & _intrinsic_both) == 0) { 212 // This is the first use of this intrinsic as a non-virtual 213 flags |= _intrinsic_both; 214 } 215 } 216 _intrinsic_hist_flags[id] = (jubyte) (oflags | flags); 217 } 218 // update the overall flags also: 219 _intrinsic_hist_flags[vmIntrinsics::_none] |= (jubyte) flags; 220 return changed; 221 } 222 223 static char* format_flags(int flags, char* buf) { 224 buf[0] = 0; 225 if ((flags & Compile::_intrinsic_worked) != 0) strcat(buf, ",worked"); 226 if ((flags & Compile::_intrinsic_failed) != 0) strcat(buf, ",failed"); 227 if ((flags & Compile::_intrinsic_disabled) != 0) strcat(buf, ",disabled"); 228 if ((flags & Compile::_intrinsic_virtual) != 0) strcat(buf, ",virtual"); 229 if ((flags & Compile::_intrinsic_both) != 0) strcat(buf, ",nonvirtual"); 230 if (buf[0] == 0) strcat(buf, ","); 231 assert(buf[0] == ',', "must be"); 232 return &buf[1]; 233 } 234 235 void Compile::print_intrinsic_statistics() { 236 char flagsbuf[100]; 237 ttyLocker ttyl; 238 if (xtty != NULL) xtty->head("statistics type='intrinsic'"); 239 tty->print_cr("Compiler intrinsic usage:"); 240 juint total = _intrinsic_hist_count[vmIntrinsics::_none]; 241 if (total == 0) total = 1; // avoid div0 in case of no successes 242 #define PRINT_STAT_LINE(name, c, f) \ 243 tty->print_cr(" %4d (%4.1f%%) %s (%s)", (int)(c), ((c) * 100.0) / total, name, f); 244 for (int index = 1 + (int)vmIntrinsics::_none; index < (int)vmIntrinsics::ID_LIMIT; index++) { 245 vmIntrinsics::ID id = (vmIntrinsics::ID) index; 246 int flags = _intrinsic_hist_flags[id]; 247 juint count = _intrinsic_hist_count[id]; 248 if ((flags | count) != 0) { 249 PRINT_STAT_LINE(vmIntrinsics::name_at(id), count, format_flags(flags, flagsbuf)); 250 } 251 } 252 PRINT_STAT_LINE("total", total, format_flags(_intrinsic_hist_flags[vmIntrinsics::_none], flagsbuf)); 253 if (xtty != NULL) xtty->tail("statistics"); 254 } 255 256 void Compile::print_statistics() { 257 { ttyLocker ttyl; 258 if (xtty != NULL) xtty->head("statistics type='opto'"); 259 Parse::print_statistics(); 260 PhaseCCP::print_statistics(); 261 PhaseRegAlloc::print_statistics(); 262 Scheduling::print_statistics(); 263 PhasePeephole::print_statistics(); 264 PhaseIdealLoop::print_statistics(); 265 if (xtty != NULL) xtty->tail("statistics"); 266 } 267 if (_intrinsic_hist_flags[vmIntrinsics::_none] != 0) { 268 // put this under its own <statistics> element. 269 print_intrinsic_statistics(); 270 } 271 } 272 #endif //PRODUCT 273 274 // Support for bundling info 275 Bundle* Compile::node_bundling(const Node *n) { 276 assert(valid_bundle_info(n), "oob"); 277 return &_node_bundling_base[n->_idx]; 278 } 279 280 bool Compile::valid_bundle_info(const Node *n) { 281 return (_node_bundling_limit > n->_idx); 282 } 283 284 285 void Compile::gvn_replace_by(Node* n, Node* nn) { 286 for (DUIterator_Last imin, i = n->last_outs(imin); i >= imin; ) { 287 Node* use = n->last_out(i); 288 bool is_in_table = initial_gvn()->hash_delete(use); 289 uint uses_found = 0; 290 for (uint j = 0; j < use->len(); j++) { 291 if (use->in(j) == n) { 292 if (j < use->req()) 293 use->set_req(j, nn); 294 else 295 use->set_prec(j, nn); 296 uses_found++; 297 } 298 } 299 if (is_in_table) { 300 // reinsert into table 301 initial_gvn()->hash_find_insert(use); 302 } 303 record_for_igvn(use); 304 i -= uses_found; // we deleted 1 or more copies of this edge 305 } 306 } 307 308 309 static inline bool not_a_node(const Node* n) { 310 if (n == NULL) return true; 311 if (((intptr_t)n & 1) != 0) return true; // uninitialized, etc. 312 if (*(address*)n == badAddress) return true; // kill by Node::destruct 313 return false; 314 } 315 316 // Identify all nodes that are reachable from below, useful. 317 // Use breadth-first pass that records state in a Unique_Node_List, 318 // recursive traversal is slower. 319 void Compile::identify_useful_nodes(Unique_Node_List &useful) { 320 int estimated_worklist_size = live_nodes(); 321 useful.map( estimated_worklist_size, NULL ); // preallocate space 322 323 // Initialize worklist 324 if (root() != NULL) { useful.push(root()); } 325 // If 'top' is cached, declare it useful to preserve cached node 326 if( cached_top_node() ) { useful.push(cached_top_node()); } 327 328 // Push all useful nodes onto the list, breadthfirst 329 for( uint next = 0; next < useful.size(); ++next ) { 330 assert( next < unique(), "Unique useful nodes < total nodes"); 331 Node *n = useful.at(next); 332 uint max = n->len(); 333 for( uint i = 0; i < max; ++i ) { 334 Node *m = n->in(i); 335 if (not_a_node(m)) continue; 336 useful.push(m); 337 } 338 } 339 } 340 341 // Update dead_node_list with any missing dead nodes using useful 342 // list. Consider all non-useful nodes to be useless i.e., dead nodes. 343 void Compile::update_dead_node_list(Unique_Node_List &useful) { 344 uint max_idx = unique(); 345 VectorSet& useful_node_set = useful.member_set(); 346 347 for (uint node_idx = 0; node_idx < max_idx; node_idx++) { 348 // If node with index node_idx is not in useful set, 349 // mark it as dead in dead node list. 350 if (! useful_node_set.test(node_idx) ) { 351 record_dead_node(node_idx); 352 } 353 } 354 } 355 356 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) { 357 int shift = 0; 358 for (int i = 0; i < inlines->length(); i++) { 359 CallGenerator* cg = inlines->at(i); 360 CallNode* call = cg->call_node(); 361 if (shift > 0) { 362 inlines->at_put(i-shift, cg); 363 } 364 if (!useful.member(call)) { 365 shift++; 366 } 367 } 368 inlines->trunc_to(inlines->length()-shift); 369 } 370 371 // Disconnect all useless nodes by disconnecting those at the boundary. 372 void Compile::remove_useless_nodes(Unique_Node_List &useful) { 373 uint next = 0; 374 while (next < useful.size()) { 375 Node *n = useful.at(next++); 376 if (n->is_SafePoint()) { 377 // We're done with a parsing phase. Replaced nodes are not valid 378 // beyond that point. 379 n->as_SafePoint()->delete_replaced_nodes(); 380 } 381 // Use raw traversal of out edges since this code removes out edges 382 int max = n->outcnt(); 383 for (int j = 0; j < max; ++j) { 384 Node* child = n->raw_out(j); 385 if (! useful.member(child)) { 386 assert(!child->is_top() || child != top(), 387 "If top is cached in Compile object it is in useful list"); 388 // Only need to remove this out-edge to the useless node 389 n->raw_del_out(j); 390 --j; 391 --max; 392 } 393 } 394 if (n->outcnt() == 1 && n->has_special_unique_user()) { 395 record_for_igvn(n->unique_out()); 396 } 397 } 398 // Remove useless macro and predicate opaq nodes 399 for (int i = C->macro_count()-1; i >= 0; i--) { 400 Node* n = C->macro_node(i); 401 if (!useful.member(n)) { 402 remove_macro_node(n); 403 } 404 } 405 // Remove useless expensive node 406 for (int i = C->expensive_count()-1; i >= 0; i--) { 407 Node* n = C->expensive_node(i); 408 if (!useful.member(n)) { 409 remove_expensive_node(n); 410 } 411 } 412 // clean up the late inline lists 413 remove_useless_late_inlines(&_string_late_inlines, useful); 414 remove_useless_late_inlines(&_boxing_late_inlines, useful); 415 remove_useless_late_inlines(&_late_inlines, useful); 416 debug_only(verify_graph_edges(true/*check for no_dead_code*/);) 417 } 418 419 //------------------------------frame_size_in_words----------------------------- 420 // frame_slots in units of words 421 int Compile::frame_size_in_words() const { 422 // shift is 0 in LP32 and 1 in LP64 423 const int shift = (LogBytesPerWord - LogBytesPerInt); 424 int words = _frame_slots >> shift; 425 assert( words << shift == _frame_slots, "frame size must be properly aligned in LP64" ); 426 return words; 427 } 428 429 // To bang the stack of this compiled method we use the stack size 430 // that the interpreter would need in case of a deoptimization. This 431 // removes the need to bang the stack in the deoptimization blob which 432 // in turn simplifies stack overflow handling. 433 int Compile::bang_size_in_bytes() const { 434 return MAX2(frame_size_in_bytes() + os::extra_bang_size_in_bytes(), _interpreter_frame_size); 435 } 436 437 // ============================================================================ 438 //------------------------------CompileWrapper--------------------------------- 439 class CompileWrapper : public StackObj { 440 Compile *const _compile; 441 public: 442 CompileWrapper(Compile* compile); 443 444 ~CompileWrapper(); 445 }; 446 447 CompileWrapper::CompileWrapper(Compile* compile) : _compile(compile) { 448 // the Compile* pointer is stored in the current ciEnv: 449 ciEnv* env = compile->env(); 450 assert(env == ciEnv::current(), "must already be a ciEnv active"); 451 assert(env->compiler_data() == NULL, "compile already active?"); 452 env->set_compiler_data(compile); 453 assert(compile == Compile::current(), "sanity"); 454 455 compile->set_type_dict(NULL); 456 compile->set_clone_map(new Dict(cmpkey, hashkey, _compile->comp_arena())); 457 compile->clone_map().set_clone_idx(0); 458 compile->set_type_hwm(NULL); 459 compile->set_type_last_size(0); 460 compile->set_last_tf(NULL, NULL); 461 compile->set_indexSet_arena(NULL); 462 compile->set_indexSet_free_block_list(NULL); 463 compile->init_type_arena(); 464 Type::Initialize(compile); 465 _compile->set_scratch_buffer_blob(NULL); 466 _compile->begin_method(); 467 _compile->clone_map().set_debug(_compile->has_method() && _compile->directive()->CloneMapDebugOption); 468 } 469 CompileWrapper::~CompileWrapper() { 470 _compile->end_method(); 471 if (_compile->scratch_buffer_blob() != NULL) 472 BufferBlob::free(_compile->scratch_buffer_blob()); 473 _compile->env()->set_compiler_data(NULL); 474 } 475 476 477 //----------------------------print_compile_messages--------------------------- 478 void Compile::print_compile_messages() { 479 #ifndef PRODUCT 480 // Check if recompiling 481 if (_subsume_loads == false && PrintOpto) { 482 // Recompiling without allowing machine instructions to subsume loads 483 tty->print_cr("*********************************************************"); 484 tty->print_cr("** Bailout: Recompile without subsuming loads **"); 485 tty->print_cr("*********************************************************"); 486 } 487 if (_do_escape_analysis != DoEscapeAnalysis && PrintOpto) { 488 // Recompiling without escape analysis 489 tty->print_cr("*********************************************************"); 490 tty->print_cr("** Bailout: Recompile without escape analysis **"); 491 tty->print_cr("*********************************************************"); 492 } 493 if (_eliminate_boxing != EliminateAutoBox && PrintOpto) { 494 // Recompiling without boxing elimination 495 tty->print_cr("*********************************************************"); 496 tty->print_cr("** Bailout: Recompile without boxing elimination **"); 497 tty->print_cr("*********************************************************"); 498 } 499 if (C->directive()->BreakAtCompileOption) { 500 // Open the debugger when compiling this method. 501 tty->print("### Breaking when compiling: "); 502 method()->print_short_name(); 503 tty->cr(); 504 BREAKPOINT; 505 } 506 507 if( PrintOpto ) { 508 if (is_osr_compilation()) { 509 tty->print("[OSR]%3d", _compile_id); 510 } else { 511 tty->print("%3d", _compile_id); 512 } 513 } 514 #endif 515 } 516 517 518 //-----------------------init_scratch_buffer_blob------------------------------ 519 // Construct a temporary BufferBlob and cache it for this compile. 520 void Compile::init_scratch_buffer_blob(int const_size) { 521 // If there is already a scratch buffer blob allocated and the 522 // constant section is big enough, use it. Otherwise free the 523 // current and allocate a new one. 524 BufferBlob* blob = scratch_buffer_blob(); 525 if ((blob != NULL) && (const_size <= _scratch_const_size)) { 526 // Use the current blob. 527 } else { 528 if (blob != NULL) { 529 BufferBlob::free(blob); 530 } 531 532 ResourceMark rm; 533 _scratch_const_size = const_size; 534 int size = (MAX_inst_size + MAX_stubs_size + _scratch_const_size); 535 blob = BufferBlob::create("Compile::scratch_buffer", size); 536 // Record the buffer blob for next time. 537 set_scratch_buffer_blob(blob); 538 // Have we run out of code space? 539 if (scratch_buffer_blob() == NULL) { 540 // Let CompilerBroker disable further compilations. 541 record_failure("Not enough space for scratch buffer in CodeCache"); 542 return; 543 } 544 } 545 546 // Initialize the relocation buffers 547 relocInfo* locs_buf = (relocInfo*) blob->content_end() - MAX_locs_size; 548 set_scratch_locs_memory(locs_buf); 549 } 550 551 552 //-----------------------scratch_emit_size------------------------------------- 553 // Helper function that computes size by emitting code 554 uint Compile::scratch_emit_size(const Node* n) { 555 // Start scratch_emit_size section. 556 set_in_scratch_emit_size(true); 557 558 // Emit into a trash buffer and count bytes emitted. 559 // This is a pretty expensive way to compute a size, 560 // but it works well enough if seldom used. 561 // All common fixed-size instructions are given a size 562 // method by the AD file. 563 // Note that the scratch buffer blob and locs memory are 564 // allocated at the beginning of the compile task, and 565 // may be shared by several calls to scratch_emit_size. 566 // The allocation of the scratch buffer blob is particularly 567 // expensive, since it has to grab the code cache lock. 568 BufferBlob* blob = this->scratch_buffer_blob(); 569 assert(blob != NULL, "Initialize BufferBlob at start"); 570 assert(blob->size() > MAX_inst_size, "sanity"); 571 relocInfo* locs_buf = scratch_locs_memory(); 572 address blob_begin = blob->content_begin(); 573 address blob_end = (address)locs_buf; 574 assert(blob->content_contains(blob_end), "sanity"); 575 CodeBuffer buf(blob_begin, blob_end - blob_begin); 576 buf.initialize_consts_size(_scratch_const_size); 577 buf.initialize_stubs_size(MAX_stubs_size); 578 assert(locs_buf != NULL, "sanity"); 579 int lsize = MAX_locs_size / 3; 580 buf.consts()->initialize_shared_locs(&locs_buf[lsize * 0], lsize); 581 buf.insts()->initialize_shared_locs( &locs_buf[lsize * 1], lsize); 582 buf.stubs()->initialize_shared_locs( &locs_buf[lsize * 2], lsize); 583 584 // Do the emission. 585 586 Label fakeL; // Fake label for branch instructions. 587 Label* saveL = NULL; 588 uint save_bnum = 0; 589 bool is_branch = n->is_MachBranch(); 590 if (is_branch) { 591 MacroAssembler masm(&buf); 592 masm.bind(fakeL); 593 n->as_MachBranch()->save_label(&saveL, &save_bnum); 594 n->as_MachBranch()->label_set(&fakeL, 0); 595 } 596 n->emit(buf, this->regalloc()); 597 598 // Emitting into the scratch buffer should not fail 599 assert (!failing(), "Must not have pending failure. Reason is: %s", failure_reason()); 600 601 if (is_branch) // Restore label. 602 n->as_MachBranch()->label_set(saveL, save_bnum); 603 604 // End scratch_emit_size section. 605 set_in_scratch_emit_size(false); 606 607 return buf.insts_size(); 608 } 609 610 611 // ============================================================================ 612 //------------------------------Compile standard------------------------------- 613 debug_only( int Compile::_debug_idx = 100000; ) 614 615 // Compile a method. entry_bci is -1 for normal compilations and indicates 616 // the continuation bci for on stack replacement. 617 618 619 Compile::Compile( ciEnv* ci_env, C2Compiler* compiler, ciMethod* target, int osr_bci, 620 bool subsume_loads, bool do_escape_analysis, bool eliminate_boxing, DirectiveSet* directive) 621 : Phase(Compiler), 622 _env(ci_env), 623 _directive(directive), 624 _log(ci_env->log()), 625 _compile_id(ci_env->compile_id()), 626 _save_argument_registers(false), 627 _stub_name(NULL), 628 _stub_function(NULL), 629 _stub_entry_point(NULL), 630 _method(target), 631 _entry_bci(osr_bci), 632 _initial_gvn(NULL), 633 _for_igvn(NULL), 634 _warm_calls(NULL), 635 _subsume_loads(subsume_loads), 636 _do_escape_analysis(do_escape_analysis), 637 _eliminate_boxing(eliminate_boxing), 638 _failure_reason(NULL), 639 _code_buffer("Compile::Fill_buffer"), 640 _orig_pc_slot(0), 641 _orig_pc_slot_offset_in_bytes(0), 642 _has_method_handle_invokes(false), 643 _mach_constant_base_node(NULL), 644 _node_bundling_limit(0), 645 _node_bundling_base(NULL), 646 _java_calls(0), 647 _inner_loops(0), 648 _scratch_const_size(-1), 649 _in_scratch_emit_size(false), 650 _dead_node_list(comp_arena()), 651 _dead_node_count(0), 652 #ifndef PRODUCT 653 _trace_opto_output(directive->TraceOptoOutputOption), 654 _in_dump_cnt(0), 655 _printer(IdealGraphPrinter::printer()), 656 #endif 657 _congraph(NULL), 658 _comp_arena(mtCompiler), 659 _node_arena(mtCompiler), 660 _old_arena(mtCompiler), 661 _Compile_types(mtCompiler), 662 _replay_inline_data(NULL), 663 _late_inlines(comp_arena(), 2, 0, NULL), 664 _string_late_inlines(comp_arena(), 2, 0, NULL), 665 _boxing_late_inlines(comp_arena(), 2, 0, NULL), 666 _late_inlines_pos(0), 667 _number_of_mh_late_inlines(0), 668 _inlining_progress(false), 669 _inlining_incrementally(false), 670 _print_inlining_list(NULL), 671 _print_inlining_stream(NULL), 672 _print_inlining_idx(0), 673 _print_inlining_output(NULL), 674 _interpreter_frame_size(0), 675 _max_node_limit(MaxNodeLimit) { 676 C = this; 677 #ifndef PRODUCT 678 if (_printer != NULL) { 679 _printer->set_compile(this); 680 } 681 #endif 682 CompileWrapper cw(this); 683 684 if (CITimeVerbose) { 685 tty->print(" "); 686 target->holder()->name()->print(); 687 tty->print("."); 688 target->print_short_name(); 689 tty->print(" "); 690 } 691 TraceTime t1("Total compilation time", &_t_totalCompilation, CITime, CITimeVerbose); 692 TraceTime t2(NULL, &_t_methodCompilation, CITime, false); 693 694 #ifndef PRODUCT 695 bool print_opto_assembly = directive->PrintOptoAssemblyOption; 696 if (!print_opto_assembly) { 697 bool print_assembly = directive->PrintAssemblyOption; 698 if (print_assembly && !Disassembler::can_decode()) { 699 tty->print_cr("PrintAssembly request changed to PrintOptoAssembly"); 700 print_opto_assembly = true; 701 } 702 } 703 set_print_assembly(print_opto_assembly); 704 set_parsed_irreducible_loop(false); 705 706 if (directive->ReplayInlineOption) { 707 _replay_inline_data = ciReplay::load_inline_data(method(), entry_bci(), ci_env->comp_level()); 708 } 709 #endif 710 set_print_inlining(directive->PrintInliningOption NOT_PRODUCT( || PrintOptoInlining)); 711 set_print_intrinsics(directive->PrintIntrinsicsOption); 712 set_has_irreducible_loop(true); // conservative until build_loop_tree() reset it 713 714 if (ProfileTraps RTM_OPT_ONLY( || UseRTMLocking )) { 715 // Make sure the method being compiled gets its own MDO, 716 // so we can at least track the decompile_count(). 717 // Need MDO to record RTM code generation state. 718 method()->ensure_method_data(); 719 } 720 721 Init(::AliasLevel); 722 723 724 print_compile_messages(); 725 726 _ilt = InlineTree::build_inline_tree_root(); 727 728 // Even if NO memory addresses are used, MergeMem nodes must have at least 1 slice 729 assert(num_alias_types() >= AliasIdxRaw, ""); 730 731 #define MINIMUM_NODE_HASH 1023 732 // Node list that Iterative GVN will start with 733 Unique_Node_List for_igvn(comp_arena()); 734 set_for_igvn(&for_igvn); 735 736 // GVN that will be run immediately on new nodes 737 uint estimated_size = method()->code_size()*4+64; 738 estimated_size = (estimated_size < MINIMUM_NODE_HASH ? MINIMUM_NODE_HASH : estimated_size); 739 PhaseGVN gvn(node_arena(), estimated_size); 740 set_initial_gvn(&gvn); 741 742 print_inlining_init(); 743 { // Scope for timing the parser 744 TracePhase tp("parse", &timers[_t_parser]); 745 746 // Put top into the hash table ASAP. 747 initial_gvn()->transform_no_reclaim(top()); 748 749 // Set up tf(), start(), and find a CallGenerator. 750 CallGenerator* cg = NULL; 751 if (is_osr_compilation()) { 752 const TypeTuple *domain = StartOSRNode::osr_domain(); 753 const TypeTuple *range = TypeTuple::make_range(method()->signature()); 754 init_tf(TypeFunc::make(domain, range)); 755 StartNode* s = new StartOSRNode(root(), domain); 756 initial_gvn()->set_type_bottom(s); 757 init_start(s); 758 cg = CallGenerator::for_osr(method(), entry_bci()); 759 } else { 760 // Normal case. 761 init_tf(TypeFunc::make(method())); 762 StartNode* s = new StartNode(root(), tf()->domain()); 763 initial_gvn()->set_type_bottom(s); 764 init_start(s); 765 if (method()->intrinsic_id() == vmIntrinsics::_Reference_get && UseG1GC) { 766 // With java.lang.ref.reference.get() we must go through the 767 // intrinsic when G1 is enabled - even when get() is the root 768 // method of the compile - so that, if necessary, the value in 769 // the referent field of the reference object gets recorded by 770 // the pre-barrier code. 771 // Specifically, if G1 is enabled, the value in the referent 772 // field is recorded by the G1 SATB pre barrier. This will 773 // result in the referent being marked live and the reference 774 // object removed from the list of discovered references during 775 // reference processing. 776 cg = find_intrinsic(method(), false); 777 } 778 if (cg == NULL) { 779 float past_uses = method()->interpreter_invocation_count(); 780 float expected_uses = past_uses; 781 cg = CallGenerator::for_inline(method(), expected_uses); 782 } 783 } 784 if (failing()) return; 785 if (cg == NULL) { 786 record_method_not_compilable_all_tiers("cannot parse method"); 787 return; 788 } 789 JVMState* jvms = build_start_state(start(), tf()); 790 if ((jvms = cg->generate(jvms)) == NULL) { 791 if (!failure_reason_is(C2Compiler::retry_class_loading_during_parsing())) { 792 record_method_not_compilable("method parse failed"); 793 } 794 return; 795 } 796 GraphKit kit(jvms); 797 798 if (!kit.stopped()) { 799 // Accept return values, and transfer control we know not where. 800 // This is done by a special, unique ReturnNode bound to root. 801 return_values(kit.jvms()); 802 } 803 804 if (kit.has_exceptions()) { 805 // Any exceptions that escape from this call must be rethrown 806 // to whatever caller is dynamically above us on the stack. 807 // This is done by a special, unique RethrowNode bound to root. 808 rethrow_exceptions(kit.transfer_exceptions_into_jvms()); 809 } 810 811 assert(IncrementalInline || (_late_inlines.length() == 0 && !has_mh_late_inlines()), "incremental inlining is off"); 812 813 if (_late_inlines.length() == 0 && !has_mh_late_inlines() && !failing() && has_stringbuilder()) { 814 inline_string_calls(true); 815 } 816 817 if (failing()) return; 818 819 print_method(PHASE_BEFORE_REMOVEUSELESS, 3); 820 821 // Remove clutter produced by parsing. 822 if (!failing()) { 823 ResourceMark rm; 824 PhaseRemoveUseless pru(initial_gvn(), &for_igvn); 825 } 826 } 827 828 // Note: Large methods are capped off in do_one_bytecode(). 829 if (failing()) return; 830 831 // After parsing, node notes are no longer automagic. 832 // They must be propagated by register_new_node_with_optimizer(), 833 // clone(), or the like. 834 set_default_node_notes(NULL); 835 836 for (;;) { 837 int successes = Inline_Warm(); 838 if (failing()) return; 839 if (successes == 0) break; 840 } 841 842 // Drain the list. 843 Finish_Warm(); 844 #ifndef PRODUCT 845 if (_printer && _printer->should_print(1)) { 846 _printer->print_inlining(); 847 } 848 #endif 849 850 if (failing()) return; 851 NOT_PRODUCT( verify_graph_edges(); ) 852 853 // Now optimize 854 Optimize(); 855 if (failing()) return; 856 NOT_PRODUCT( verify_graph_edges(); ) 857 858 #ifndef PRODUCT 859 if (PrintIdeal) { 860 ttyLocker ttyl; // keep the following output all in one block 861 // This output goes directly to the tty, not the compiler log. 862 // To enable tools to match it up with the compilation activity, 863 // be sure to tag this tty output with the compile ID. 864 if (xtty != NULL) { 865 xtty->head("ideal compile_id='%d'%s", compile_id(), 866 is_osr_compilation() ? " compile_kind='osr'" : 867 ""); 868 } 869 root()->dump(9999); 870 if (xtty != NULL) { 871 xtty->tail("ideal"); 872 } 873 } 874 #endif 875 876 NOT_PRODUCT( verify_barriers(); ) 877 878 // Dump compilation data to replay it. 879 if (directive->DumpReplayOption) { 880 env()->dump_replay_data(_compile_id); 881 } 882 if (directive->DumpInlineOption && (ilt() != NULL)) { 883 env()->dump_inline_data(_compile_id); 884 } 885 886 // Now that we know the size of all the monitors we can add a fixed slot 887 // for the original deopt pc. 888 889 _orig_pc_slot = fixed_slots(); 890 int next_slot = _orig_pc_slot + (sizeof(address) / VMRegImpl::stack_slot_size); 891 set_fixed_slots(next_slot); 892 893 // Compute when to use implicit null checks. Used by matching trap based 894 // nodes and NullCheck optimization. 895 set_allowed_deopt_reasons(); 896 897 // Now generate code 898 Code_Gen(); 899 if (failing()) return; 900 901 // Check if we want to skip execution of all compiled code. 902 { 903 #ifndef PRODUCT 904 if (OptoNoExecute) { 905 record_method_not_compilable("+OptoNoExecute"); // Flag as failed 906 return; 907 } 908 #endif 909 TracePhase tp("install_code", &timers[_t_registerMethod]); 910 911 if (is_osr_compilation()) { 912 _code_offsets.set_value(CodeOffsets::Verified_Entry, 0); 913 _code_offsets.set_value(CodeOffsets::OSR_Entry, _first_block_size); 914 } else { 915 _code_offsets.set_value(CodeOffsets::Verified_Entry, _first_block_size); 916 _code_offsets.set_value(CodeOffsets::OSR_Entry, 0); 917 } 918 919 env()->register_method(_method, _entry_bci, 920 &_code_offsets, 921 _orig_pc_slot_offset_in_bytes, 922 code_buffer(), 923 frame_size_in_words(), _oop_map_set, 924 &_handler_table, &_inc_table, 925 compiler, 926 has_unsafe_access(), 927 SharedRuntime::is_wide_vector(max_vector_size()), 928 _directive, 929 rtm_state() 930 ); 931 932 if (log() != NULL) // Print code cache state into compiler log 933 log()->code_cache_state(); 934 } 935 } 936 937 //------------------------------Compile---------------------------------------- 938 // Compile a runtime stub 939 Compile::Compile( ciEnv* ci_env, 940 TypeFunc_generator generator, 941 address stub_function, 942 const char *stub_name, 943 int is_fancy_jump, 944 bool pass_tls, 945 bool save_arg_registers, 946 bool return_pc, 947 DirectiveSet* directive) 948 : Phase(Compiler), 949 _env(ci_env), 950 _directive(directive), 951 _log(ci_env->log()), 952 _compile_id(0), 953 _save_argument_registers(save_arg_registers), 954 _method(NULL), 955 _stub_name(stub_name), 956 _stub_function(stub_function), 957 _stub_entry_point(NULL), 958 _entry_bci(InvocationEntryBci), 959 _initial_gvn(NULL), 960 _for_igvn(NULL), 961 _warm_calls(NULL), 962 _orig_pc_slot(0), 963 _orig_pc_slot_offset_in_bytes(0), 964 _subsume_loads(true), 965 _do_escape_analysis(false), 966 _eliminate_boxing(false), 967 _failure_reason(NULL), 968 _code_buffer("Compile::Fill_buffer"), 969 _has_method_handle_invokes(false), 970 _mach_constant_base_node(NULL), 971 _node_bundling_limit(0), 972 _node_bundling_base(NULL), 973 _java_calls(0), 974 _inner_loops(0), 975 #ifndef PRODUCT 976 _trace_opto_output(TraceOptoOutput), 977 _in_dump_cnt(0), 978 _printer(NULL), 979 #endif 980 _comp_arena(mtCompiler), 981 _node_arena(mtCompiler), 982 _old_arena(mtCompiler), 983 _Compile_types(mtCompiler), 984 _dead_node_list(comp_arena()), 985 _dead_node_count(0), 986 _congraph(NULL), 987 _replay_inline_data(NULL), 988 _number_of_mh_late_inlines(0), 989 _inlining_progress(false), 990 _inlining_incrementally(false), 991 _print_inlining_list(NULL), 992 _print_inlining_stream(NULL), 993 _print_inlining_idx(0), 994 _print_inlining_output(NULL), 995 _allowed_reasons(0), 996 _interpreter_frame_size(0), 997 _max_node_limit(MaxNodeLimit) { 998 C = this; 999 1000 TraceTime t1(NULL, &_t_totalCompilation, CITime, false); 1001 TraceTime t2(NULL, &_t_stubCompilation, CITime, false); 1002 1003 #ifndef PRODUCT 1004 set_print_assembly(PrintFrameConverterAssembly); 1005 set_parsed_irreducible_loop(false); 1006 #endif 1007 set_has_irreducible_loop(false); // no loops 1008 1009 CompileWrapper cw(this); 1010 Init(/*AliasLevel=*/ 0); 1011 init_tf((*generator)()); 1012 1013 { 1014 // The following is a dummy for the sake of GraphKit::gen_stub 1015 Unique_Node_List for_igvn(comp_arena()); 1016 set_for_igvn(&for_igvn); // not used, but some GraphKit guys push on this 1017 PhaseGVN gvn(Thread::current()->resource_area(),255); 1018 set_initial_gvn(&gvn); // not significant, but GraphKit guys use it pervasively 1019 gvn.transform_no_reclaim(top()); 1020 1021 GraphKit kit; 1022 kit.gen_stub(stub_function, stub_name, is_fancy_jump, pass_tls, return_pc); 1023 } 1024 1025 NOT_PRODUCT( verify_graph_edges(); ) 1026 Code_Gen(); 1027 if (failing()) return; 1028 1029 1030 // Entry point will be accessed using compile->stub_entry_point(); 1031 if (code_buffer() == NULL) { 1032 Matcher::soft_match_failure(); 1033 } else { 1034 if (PrintAssembly && (WizardMode || Verbose)) 1035 tty->print_cr("### Stub::%s", stub_name); 1036 1037 if (!failing()) { 1038 assert(_fixed_slots == 0, "no fixed slots used for runtime stubs"); 1039 1040 // Make the NMethod 1041 // For now we mark the frame as never safe for profile stackwalking 1042 RuntimeStub *rs = RuntimeStub::new_runtime_stub(stub_name, 1043 code_buffer(), 1044 CodeOffsets::frame_never_safe, 1045 // _code_offsets.value(CodeOffsets::Frame_Complete), 1046 frame_size_in_words(), 1047 _oop_map_set, 1048 save_arg_registers); 1049 assert(rs != NULL && rs->is_runtime_stub(), "sanity check"); 1050 1051 _stub_entry_point = rs->entry_point(); 1052 } 1053 } 1054 } 1055 1056 //------------------------------Init------------------------------------------- 1057 // Prepare for a single compilation 1058 void Compile::Init(int aliaslevel) { 1059 _unique = 0; 1060 _regalloc = NULL; 1061 1062 _tf = NULL; // filled in later 1063 _top = NULL; // cached later 1064 _matcher = NULL; // filled in later 1065 _cfg = NULL; // filled in later 1066 1067 set_24_bit_selection_and_mode(Use24BitFP, false); 1068 1069 _node_note_array = NULL; 1070 _default_node_notes = NULL; 1071 DEBUG_ONLY( _modified_nodes = NULL; ) // Used in Optimize() 1072 1073 _immutable_memory = NULL; // filled in at first inquiry 1074 1075 // Globally visible Nodes 1076 // First set TOP to NULL to give safe behavior during creation of RootNode 1077 set_cached_top_node(NULL); 1078 set_root(new RootNode()); 1079 // Now that you have a Root to point to, create the real TOP 1080 set_cached_top_node( new ConNode(Type::TOP) ); 1081 set_recent_alloc(NULL, NULL); 1082 1083 // Create Debug Information Recorder to record scopes, oopmaps, etc. 1084 env()->set_oop_recorder(new OopRecorder(env()->arena())); 1085 env()->set_debug_info(new DebugInformationRecorder(env()->oop_recorder())); 1086 env()->set_dependencies(new Dependencies(env())); 1087 1088 _fixed_slots = 0; 1089 set_has_split_ifs(false); 1090 set_has_loops(has_method() && method()->has_loops()); // first approximation 1091 set_has_stringbuilder(false); 1092 set_has_boxed_value(false); 1093 _trap_can_recompile = false; // no traps emitted yet 1094 _major_progress = true; // start out assuming good things will happen 1095 set_has_unsafe_access(false); 1096 set_max_vector_size(0); 1097 Copy::zero_to_bytes(_trap_hist, sizeof(_trap_hist)); 1098 set_decompile_count(0); 1099 1100 set_do_freq_based_layout(_directive->BlockLayoutByFrequencyOption); 1101 set_num_loop_opts(LoopOptsCount); 1102 set_do_inlining(Inline); 1103 set_max_inline_size(MaxInlineSize); 1104 set_freq_inline_size(FreqInlineSize); 1105 set_do_scheduling(OptoScheduling); 1106 set_do_count_invocations(false); 1107 set_do_method_data_update(false); 1108 1109 set_do_vector_loop(false); 1110 1111 if (AllowVectorizeOnDemand) { 1112 if (has_method() && (_directive->VectorizeOption || _directive->VectorizeDebugOption)) { 1113 set_do_vector_loop(true); 1114 NOT_PRODUCT(if (do_vector_loop() && Verbose) {tty->print("Compile::Init: do vectorized loops (SIMD like) for method %s\n", method()->name()->as_quoted_ascii());}) 1115 } else if (has_method() && method()->name() != 0 && 1116 method()->intrinsic_id() == vmIntrinsics::_forEachRemaining) { 1117 set_do_vector_loop(true); 1118 } 1119 } 1120 set_use_cmove(UseCMoveUnconditionally /* || do_vector_loop()*/); //TODO: consider do_vector_loop() mandate use_cmove unconditionally 1121 NOT_PRODUCT(if (use_cmove() && Verbose && has_method()) {tty->print("Compile::Init: use CMove without profitability tests for method %s\n", method()->name()->as_quoted_ascii());}) 1122 1123 set_age_code(has_method() && method()->profile_aging()); 1124 set_rtm_state(NoRTM); // No RTM lock eliding by default 1125 _max_node_limit = _directive->MaxNodeLimitOption; 1126 1127 #if INCLUDE_RTM_OPT 1128 if (UseRTMLocking && has_method() && (method()->method_data_or_null() != NULL)) { 1129 int rtm_state = method()->method_data()->rtm_state(); 1130 if (method_has_option("NoRTMLockEliding") || ((rtm_state & NoRTM) != 0)) { 1131 // Don't generate RTM lock eliding code. 1132 set_rtm_state(NoRTM); 1133 } else if (method_has_option("UseRTMLockEliding") || ((rtm_state & UseRTM) != 0) || !UseRTMDeopt) { 1134 // Generate RTM lock eliding code without abort ratio calculation code. 1135 set_rtm_state(UseRTM); 1136 } else if (UseRTMDeopt) { 1137 // Generate RTM lock eliding code and include abort ratio calculation 1138 // code if UseRTMDeopt is on. 1139 set_rtm_state(ProfileRTM); 1140 } 1141 } 1142 #endif 1143 if (debug_info()->recording_non_safepoints()) { 1144 set_node_note_array(new(comp_arena()) GrowableArray<Node_Notes*> 1145 (comp_arena(), 8, 0, NULL)); 1146 set_default_node_notes(Node_Notes::make(this)); 1147 } 1148 1149 // // -- Initialize types before each compile -- 1150 // // Update cached type information 1151 // if( _method && _method->constants() ) 1152 // Type::update_loaded_types(_method, _method->constants()); 1153 1154 // Init alias_type map. 1155 if (!_do_escape_analysis && aliaslevel == 3) 1156 aliaslevel = 2; // No unique types without escape analysis 1157 _AliasLevel = aliaslevel; 1158 const int grow_ats = 16; 1159 _max_alias_types = grow_ats; 1160 _alias_types = NEW_ARENA_ARRAY(comp_arena(), AliasType*, grow_ats); 1161 AliasType* ats = NEW_ARENA_ARRAY(comp_arena(), AliasType, grow_ats); 1162 Copy::zero_to_bytes(ats, sizeof(AliasType)*grow_ats); 1163 { 1164 for (int i = 0; i < grow_ats; i++) _alias_types[i] = &ats[i]; 1165 } 1166 // Initialize the first few types. 1167 _alias_types[AliasIdxTop]->Init(AliasIdxTop, NULL); 1168 _alias_types[AliasIdxBot]->Init(AliasIdxBot, TypePtr::BOTTOM); 1169 _alias_types[AliasIdxRaw]->Init(AliasIdxRaw, TypeRawPtr::BOTTOM); 1170 _num_alias_types = AliasIdxRaw+1; 1171 // Zero out the alias type cache. 1172 Copy::zero_to_bytes(_alias_cache, sizeof(_alias_cache)); 1173 // A NULL adr_type hits in the cache right away. Preload the right answer. 1174 probe_alias_cache(NULL)->_index = AliasIdxTop; 1175 1176 _intrinsics = NULL; 1177 _macro_nodes = new(comp_arena()) GrowableArray<Node*>(comp_arena(), 8, 0, NULL); 1178 _predicate_opaqs = new(comp_arena()) GrowableArray<Node*>(comp_arena(), 8, 0, NULL); 1179 _expensive_nodes = new(comp_arena()) GrowableArray<Node*>(comp_arena(), 8, 0, NULL); 1180 register_library_intrinsics(); 1181 } 1182 1183 //---------------------------init_start---------------------------------------- 1184 // Install the StartNode on this compile object. 1185 void Compile::init_start(StartNode* s) { 1186 if (failing()) 1187 return; // already failing 1188 assert(s == start(), ""); 1189 } 1190 1191 /** 1192 * Return the 'StartNode'. We must not have a pending failure, since the ideal graph 1193 * can be in an inconsistent state, i.e., we can get segmentation faults when traversing 1194 * the ideal graph. 1195 */ 1196 StartNode* Compile::start() const { 1197 assert (!failing(), "Must not have pending failure. Reason is: %s", failure_reason()); 1198 for (DUIterator_Fast imax, i = root()->fast_outs(imax); i < imax; i++) { 1199 Node* start = root()->fast_out(i); 1200 if (start->is_Start()) { 1201 return start->as_Start(); 1202 } 1203 } 1204 fatal("Did not find Start node!"); 1205 return NULL; 1206 } 1207 1208 //-------------------------------immutable_memory------------------------------------- 1209 // Access immutable memory 1210 Node* Compile::immutable_memory() { 1211 if (_immutable_memory != NULL) { 1212 return _immutable_memory; 1213 } 1214 StartNode* s = start(); 1215 for (DUIterator_Fast imax, i = s->fast_outs(imax); true; i++) { 1216 Node *p = s->fast_out(i); 1217 if (p != s && p->as_Proj()->_con == TypeFunc::Memory) { 1218 _immutable_memory = p; 1219 return _immutable_memory; 1220 } 1221 } 1222 ShouldNotReachHere(); 1223 return NULL; 1224 } 1225 1226 //----------------------set_cached_top_node------------------------------------ 1227 // Install the cached top node, and make sure Node::is_top works correctly. 1228 void Compile::set_cached_top_node(Node* tn) { 1229 if (tn != NULL) verify_top(tn); 1230 Node* old_top = _top; 1231 _top = tn; 1232 // Calling Node::setup_is_top allows the nodes the chance to adjust 1233 // their _out arrays. 1234 if (_top != NULL) _top->setup_is_top(); 1235 if (old_top != NULL) old_top->setup_is_top(); 1236 assert(_top == NULL || top()->is_top(), ""); 1237 } 1238 1239 #ifdef ASSERT 1240 uint Compile::count_live_nodes_by_graph_walk() { 1241 Unique_Node_List useful(comp_arena()); 1242 // Get useful node list by walking the graph. 1243 identify_useful_nodes(useful); 1244 return useful.size(); 1245 } 1246 1247 void Compile::print_missing_nodes() { 1248 1249 // Return if CompileLog is NULL and PrintIdealNodeCount is false. 1250 if ((_log == NULL) && (! PrintIdealNodeCount)) { 1251 return; 1252 } 1253 1254 // This is an expensive function. It is executed only when the user 1255 // specifies VerifyIdealNodeCount option or otherwise knows the 1256 // additional work that needs to be done to identify reachable nodes 1257 // by walking the flow graph and find the missing ones using 1258 // _dead_node_list. 1259 1260 Unique_Node_List useful(comp_arena()); 1261 // Get useful node list by walking the graph. 1262 identify_useful_nodes(useful); 1263 1264 uint l_nodes = C->live_nodes(); 1265 uint l_nodes_by_walk = useful.size(); 1266 1267 if (l_nodes != l_nodes_by_walk) { 1268 if (_log != NULL) { 1269 _log->begin_head("mismatched_nodes count='%d'", abs((int) (l_nodes - l_nodes_by_walk))); 1270 _log->stamp(); 1271 _log->end_head(); 1272 } 1273 VectorSet& useful_member_set = useful.member_set(); 1274 int last_idx = l_nodes_by_walk; 1275 for (int i = 0; i < last_idx; i++) { 1276 if (useful_member_set.test(i)) { 1277 if (_dead_node_list.test(i)) { 1278 if (_log != NULL) { 1279 _log->elem("mismatched_node_info node_idx='%d' type='both live and dead'", i); 1280 } 1281 if (PrintIdealNodeCount) { 1282 // Print the log message to tty 1283 tty->print_cr("mismatched_node idx='%d' both live and dead'", i); 1284 useful.at(i)->dump(); 1285 } 1286 } 1287 } 1288 else if (! _dead_node_list.test(i)) { 1289 if (_log != NULL) { 1290 _log->elem("mismatched_node_info node_idx='%d' type='neither live nor dead'", i); 1291 } 1292 if (PrintIdealNodeCount) { 1293 // Print the log message to tty 1294 tty->print_cr("mismatched_node idx='%d' type='neither live nor dead'", i); 1295 } 1296 } 1297 } 1298 if (_log != NULL) { 1299 _log->tail("mismatched_nodes"); 1300 } 1301 } 1302 } 1303 void Compile::record_modified_node(Node* n) { 1304 if (_modified_nodes != NULL && !_inlining_incrementally && 1305 n->outcnt() != 0 && !n->is_Con()) { 1306 _modified_nodes->push(n); 1307 } 1308 } 1309 1310 void Compile::remove_modified_node(Node* n) { 1311 if (_modified_nodes != NULL) { 1312 _modified_nodes->remove(n); 1313 } 1314 } 1315 #endif 1316 1317 #ifndef PRODUCT 1318 void Compile::verify_top(Node* tn) const { 1319 if (tn != NULL) { 1320 assert(tn->is_Con(), "top node must be a constant"); 1321 assert(((ConNode*)tn)->type() == Type::TOP, "top node must have correct type"); 1322 assert(tn->in(0) != NULL, "must have live top node"); 1323 } 1324 } 1325 #endif 1326 1327 1328 ///-------------------Managing Per-Node Debug & Profile Info------------------- 1329 1330 void Compile::grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by) { 1331 guarantee(arr != NULL, ""); 1332 int num_blocks = arr->length(); 1333 if (grow_by < num_blocks) grow_by = num_blocks; 1334 int num_notes = grow_by * _node_notes_block_size; 1335 Node_Notes* notes = NEW_ARENA_ARRAY(node_arena(), Node_Notes, num_notes); 1336 Copy::zero_to_bytes(notes, num_notes * sizeof(Node_Notes)); 1337 while (num_notes > 0) { 1338 arr->append(notes); 1339 notes += _node_notes_block_size; 1340 num_notes -= _node_notes_block_size; 1341 } 1342 assert(num_notes == 0, "exact multiple, please"); 1343 } 1344 1345 bool Compile::copy_node_notes_to(Node* dest, Node* source) { 1346 if (source == NULL || dest == NULL) return false; 1347 1348 if (dest->is_Con()) 1349 return false; // Do not push debug info onto constants. 1350 1351 #ifdef ASSERT 1352 // Leave a bread crumb trail pointing to the original node: 1353 if (dest != NULL && dest != source && dest->debug_orig() == NULL) { 1354 dest->set_debug_orig(source); 1355 } 1356 #endif 1357 1358 if (node_note_array() == NULL) 1359 return false; // Not collecting any notes now. 1360 1361 // This is a copy onto a pre-existing node, which may already have notes. 1362 // If both nodes have notes, do not overwrite any pre-existing notes. 1363 Node_Notes* source_notes = node_notes_at(source->_idx); 1364 if (source_notes == NULL || source_notes->is_clear()) return false; 1365 Node_Notes* dest_notes = node_notes_at(dest->_idx); 1366 if (dest_notes == NULL || dest_notes->is_clear()) { 1367 return set_node_notes_at(dest->_idx, source_notes); 1368 } 1369 1370 Node_Notes merged_notes = (*source_notes); 1371 // The order of operations here ensures that dest notes will win... 1372 merged_notes.update_from(dest_notes); 1373 return set_node_notes_at(dest->_idx, &merged_notes); 1374 } 1375 1376 1377 //--------------------------allow_range_check_smearing------------------------- 1378 // Gating condition for coalescing similar range checks. 1379 // Sometimes we try 'speculatively' replacing a series of a range checks by a 1380 // single covering check that is at least as strong as any of them. 1381 // If the optimization succeeds, the simplified (strengthened) range check 1382 // will always succeed. If it fails, we will deopt, and then give up 1383 // on the optimization. 1384 bool Compile::allow_range_check_smearing() const { 1385 // If this method has already thrown a range-check, 1386 // assume it was because we already tried range smearing 1387 // and it failed. 1388 uint already_trapped = trap_count(Deoptimization::Reason_range_check); 1389 return !already_trapped; 1390 } 1391 1392 1393 //------------------------------flatten_alias_type----------------------------- 1394 const TypePtr *Compile::flatten_alias_type( const TypePtr *tj ) const { 1395 int offset = tj->offset(); 1396 TypePtr::PTR ptr = tj->ptr(); 1397 1398 // Known instance (scalarizable allocation) alias only with itself. 1399 bool is_known_inst = tj->isa_oopptr() != NULL && 1400 tj->is_oopptr()->is_known_instance(); 1401 1402 // Process weird unsafe references. 1403 if (offset == Type::OffsetBot && (tj->isa_instptr() /*|| tj->isa_klassptr()*/)) { 1404 assert(InlineUnsafeOps, "indeterminate pointers come only from unsafe ops"); 1405 assert(!is_known_inst, "scalarizable allocation should not have unsafe references"); 1406 tj = TypeOopPtr::BOTTOM; 1407 ptr = tj->ptr(); 1408 offset = tj->offset(); 1409 } 1410 1411 // Array pointers need some flattening 1412 const TypeAryPtr *ta = tj->isa_aryptr(); 1413 if (ta && ta->is_stable()) { 1414 // Erase stability property for alias analysis. 1415 tj = ta = ta->cast_to_stable(false); 1416 } 1417 if( ta && is_known_inst ) { 1418 if ( offset != Type::OffsetBot && 1419 offset > arrayOopDesc::length_offset_in_bytes() ) { 1420 offset = Type::OffsetBot; // Flatten constant access into array body only 1421 tj = ta = TypeAryPtr::make(ptr, ta->ary(), ta->klass(), true, offset, ta->instance_id()); 1422 } 1423 } else if( ta && _AliasLevel >= 2 ) { 1424 // For arrays indexed by constant indices, we flatten the alias 1425 // space to include all of the array body. Only the header, klass 1426 // and array length can be accessed un-aliased. 1427 if( offset != Type::OffsetBot ) { 1428 if( ta->const_oop() ) { // MethodData* or Method* 1429 offset = Type::OffsetBot; // Flatten constant access into array body 1430 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),ta->ary(),ta->klass(),false,offset); 1431 } else if( offset == arrayOopDesc::length_offset_in_bytes() ) { 1432 // range is OK as-is. 1433 tj = ta = TypeAryPtr::RANGE; 1434 } else if( offset == oopDesc::klass_offset_in_bytes() ) { 1435 tj = TypeInstPtr::KLASS; // all klass loads look alike 1436 ta = TypeAryPtr::RANGE; // generic ignored junk 1437 ptr = TypePtr::BotPTR; 1438 } else if( offset == oopDesc::mark_offset_in_bytes() ) { 1439 tj = TypeInstPtr::MARK; 1440 ta = TypeAryPtr::RANGE; // generic ignored junk 1441 ptr = TypePtr::BotPTR; 1442 } else { // Random constant offset into array body 1443 offset = Type::OffsetBot; // Flatten constant access into array body 1444 tj = ta = TypeAryPtr::make(ptr,ta->ary(),ta->klass(),false,offset); 1445 } 1446 } 1447 // Arrays of fixed size alias with arrays of unknown size. 1448 if (ta->size() != TypeInt::POS) { 1449 const TypeAry *tary = TypeAry::make(ta->elem(), TypeInt::POS); 1450 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,ta->klass(),false,offset); 1451 } 1452 // Arrays of known objects become arrays of unknown objects. 1453 if (ta->elem()->isa_narrowoop() && ta->elem() != TypeNarrowOop::BOTTOM) { 1454 const TypeAry *tary = TypeAry::make(TypeNarrowOop::BOTTOM, ta->size()); 1455 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset); 1456 } 1457 if (ta->elem()->isa_oopptr() && ta->elem() != TypeInstPtr::BOTTOM) { 1458 const TypeAry *tary = TypeAry::make(TypeInstPtr::BOTTOM, ta->size()); 1459 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset); 1460 } 1461 // Arrays of bytes and of booleans both use 'bastore' and 'baload' so 1462 // cannot be distinguished by bytecode alone. 1463 if (ta->elem() == TypeInt::BOOL) { 1464 const TypeAry *tary = TypeAry::make(TypeInt::BYTE, ta->size()); 1465 ciKlass* aklass = ciTypeArrayKlass::make(T_BYTE); 1466 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,aklass,false,offset); 1467 } 1468 // During the 2nd round of IterGVN, NotNull castings are removed. 1469 // Make sure the Bottom and NotNull variants alias the same. 1470 // Also, make sure exact and non-exact variants alias the same. 1471 if (ptr == TypePtr::NotNull || ta->klass_is_exact() || ta->speculative() != NULL) { 1472 tj = ta = TypeAryPtr::make(TypePtr::BotPTR,ta->ary(),ta->klass(),false,offset); 1473 } 1474 } 1475 1476 // Oop pointers need some flattening 1477 const TypeInstPtr *to = tj->isa_instptr(); 1478 if( to && _AliasLevel >= 2 && to != TypeOopPtr::BOTTOM ) { 1479 ciInstanceKlass *k = to->klass()->as_instance_klass(); 1480 if( ptr == TypePtr::Constant ) { 1481 if (to->klass() != ciEnv::current()->Class_klass() || 1482 offset < k->size_helper() * wordSize) { 1483 // No constant oop pointers (such as Strings); they alias with 1484 // unknown strings. 1485 assert(!is_known_inst, "not scalarizable allocation"); 1486 tj = to = TypeInstPtr::make(TypePtr::BotPTR,to->klass(),false,0,offset); 1487 } 1488 } else if( is_known_inst ) { 1489 tj = to; // Keep NotNull and klass_is_exact for instance type 1490 } else if( ptr == TypePtr::NotNull || to->klass_is_exact() ) { 1491 // During the 2nd round of IterGVN, NotNull castings are removed. 1492 // Make sure the Bottom and NotNull variants alias the same. 1493 // Also, make sure exact and non-exact variants alias the same. 1494 tj = to = TypeInstPtr::make(TypePtr::BotPTR,to->klass(),false,0,offset); 1495 } 1496 if (to->speculative() != NULL) { 1497 tj = to = TypeInstPtr::make(to->ptr(),to->klass(),to->klass_is_exact(),to->const_oop(),to->offset(), to->instance_id()); 1498 } 1499 // Canonicalize the holder of this field 1500 if (offset >= 0 && offset < instanceOopDesc::base_offset_in_bytes()) { 1501 // First handle header references such as a LoadKlassNode, even if the 1502 // object's klass is unloaded at compile time (4965979). 1503 if (!is_known_inst) { // Do it only for non-instance types 1504 tj = to = TypeInstPtr::make(TypePtr::BotPTR, env()->Object_klass(), false, NULL, offset); 1505 } 1506 } else if (offset < 0 || offset >= k->size_helper() * wordSize) { 1507 // Static fields are in the space above the normal instance 1508 // fields in the java.lang.Class instance. 1509 if (to->klass() != ciEnv::current()->Class_klass()) { 1510 to = NULL; 1511 tj = TypeOopPtr::BOTTOM; 1512 offset = tj->offset(); 1513 } 1514 } else { 1515 ciInstanceKlass *canonical_holder = k->get_canonical_holder(offset); 1516 if (!k->equals(canonical_holder) || tj->offset() != offset) { 1517 if( is_known_inst ) { 1518 tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, true, NULL, offset, to->instance_id()); 1519 } else { 1520 tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, false, NULL, offset); 1521 } 1522 } 1523 } 1524 } 1525 1526 // Klass pointers to object array klasses need some flattening 1527 const TypeKlassPtr *tk = tj->isa_klassptr(); 1528 if( tk ) { 1529 // If we are referencing a field within a Klass, we need 1530 // to assume the worst case of an Object. Both exact and 1531 // inexact types must flatten to the same alias class so 1532 // use NotNull as the PTR. 1533 if ( offset == Type::OffsetBot || (offset >= 0 && (size_t)offset < sizeof(Klass)) ) { 1534 1535 tj = tk = TypeKlassPtr::make(TypePtr::NotNull, 1536 TypeKlassPtr::OBJECT->klass(), 1537 offset); 1538 } 1539 1540 ciKlass* klass = tk->klass(); 1541 if( klass->is_obj_array_klass() ) { 1542 ciKlass* k = TypeAryPtr::OOPS->klass(); 1543 if( !k || !k->is_loaded() ) // Only fails for some -Xcomp runs 1544 k = TypeInstPtr::BOTTOM->klass(); 1545 tj = tk = TypeKlassPtr::make( TypePtr::NotNull, k, offset ); 1546 } 1547 1548 // Check for precise loads from the primary supertype array and force them 1549 // to the supertype cache alias index. Check for generic array loads from 1550 // the primary supertype array and also force them to the supertype cache 1551 // alias index. Since the same load can reach both, we need to merge 1552 // these 2 disparate memories into the same alias class. Since the 1553 // primary supertype array is read-only, there's no chance of confusion 1554 // where we bypass an array load and an array store. 1555 int primary_supers_offset = in_bytes(Klass::primary_supers_offset()); 1556 if (offset == Type::OffsetBot || 1557 (offset >= primary_supers_offset && 1558 offset < (int)(primary_supers_offset + Klass::primary_super_limit() * wordSize)) || 1559 offset == (int)in_bytes(Klass::secondary_super_cache_offset())) { 1560 offset = in_bytes(Klass::secondary_super_cache_offset()); 1561 tj = tk = TypeKlassPtr::make( TypePtr::NotNull, tk->klass(), offset ); 1562 } 1563 } 1564 1565 // Flatten all Raw pointers together. 1566 if (tj->base() == Type::RawPtr) 1567 tj = TypeRawPtr::BOTTOM; 1568 1569 if (tj->base() == Type::AnyPtr) 1570 tj = TypePtr::BOTTOM; // An error, which the caller must check for. 1571 1572 // Flatten all to bottom for now 1573 switch( _AliasLevel ) { 1574 case 0: 1575 tj = TypePtr::BOTTOM; 1576 break; 1577 case 1: // Flatten to: oop, static, field or array 1578 switch (tj->base()) { 1579 //case Type::AryPtr: tj = TypeAryPtr::RANGE; break; 1580 case Type::RawPtr: tj = TypeRawPtr::BOTTOM; break; 1581 case Type::AryPtr: // do not distinguish arrays at all 1582 case Type::InstPtr: tj = TypeInstPtr::BOTTOM; break; 1583 case Type::KlassPtr: tj = TypeKlassPtr::OBJECT; break; 1584 case Type::AnyPtr: tj = TypePtr::BOTTOM; break; // caller checks it 1585 default: ShouldNotReachHere(); 1586 } 1587 break; 1588 case 2: // No collapsing at level 2; keep all splits 1589 case 3: // No collapsing at level 3; keep all splits 1590 break; 1591 default: 1592 Unimplemented(); 1593 } 1594 1595 offset = tj->offset(); 1596 assert( offset != Type::OffsetTop, "Offset has fallen from constant" ); 1597 1598 assert( (offset != Type::OffsetBot && tj->base() != Type::AryPtr) || 1599 (offset == Type::OffsetBot && tj->base() == Type::AryPtr) || 1600 (offset == Type::OffsetBot && tj == TypeOopPtr::BOTTOM) || 1601 (offset == Type::OffsetBot && tj == TypePtr::BOTTOM) || 1602 (offset == oopDesc::mark_offset_in_bytes() && tj->base() == Type::AryPtr) || 1603 (offset == oopDesc::klass_offset_in_bytes() && tj->base() == Type::AryPtr) || 1604 (offset == arrayOopDesc::length_offset_in_bytes() && tj->base() == Type::AryPtr) , 1605 "For oops, klasses, raw offset must be constant; for arrays the offset is never known" ); 1606 assert( tj->ptr() != TypePtr::TopPTR && 1607 tj->ptr() != TypePtr::AnyNull && 1608 tj->ptr() != TypePtr::Null, "No imprecise addresses" ); 1609 // assert( tj->ptr() != TypePtr::Constant || 1610 // tj->base() == Type::RawPtr || 1611 // tj->base() == Type::KlassPtr, "No constant oop addresses" ); 1612 1613 return tj; 1614 } 1615 1616 void Compile::AliasType::Init(int i, const TypePtr* at) { 1617 _index = i; 1618 _adr_type = at; 1619 _field = NULL; 1620 _element = NULL; 1621 _is_rewritable = true; // default 1622 const TypeOopPtr *atoop = (at != NULL) ? at->isa_oopptr() : NULL; 1623 if (atoop != NULL && atoop->is_known_instance()) { 1624 const TypeOopPtr *gt = atoop->cast_to_instance_id(TypeOopPtr::InstanceBot); 1625 _general_index = Compile::current()->get_alias_index(gt); 1626 } else { 1627 _general_index = 0; 1628 } 1629 } 1630 1631 //---------------------------------print_on------------------------------------ 1632 #ifndef PRODUCT 1633 void Compile::AliasType::print_on(outputStream* st) { 1634 if (index() < 10) 1635 st->print("@ <%d> ", index()); 1636 else st->print("@ <%d>", index()); 1637 st->print(is_rewritable() ? " " : " RO"); 1638 int offset = adr_type()->offset(); 1639 if (offset == Type::OffsetBot) 1640 st->print(" +any"); 1641 else st->print(" +%-3d", offset); 1642 st->print(" in "); 1643 adr_type()->dump_on(st); 1644 const TypeOopPtr* tjp = adr_type()->isa_oopptr(); 1645 if (field() != NULL && tjp) { 1646 if (tjp->klass() != field()->holder() || 1647 tjp->offset() != field()->offset_in_bytes()) { 1648 st->print(" != "); 1649 field()->print(); 1650 st->print(" ***"); 1651 } 1652 } 1653 } 1654 1655 void print_alias_types() { 1656 Compile* C = Compile::current(); 1657 tty->print_cr("--- Alias types, AliasIdxBot .. %d", C->num_alias_types()-1); 1658 for (int idx = Compile::AliasIdxBot; idx < C->num_alias_types(); idx++) { 1659 C->alias_type(idx)->print_on(tty); 1660 tty->cr(); 1661 } 1662 } 1663 #endif 1664 1665 1666 //----------------------------probe_alias_cache-------------------------------- 1667 Compile::AliasCacheEntry* Compile::probe_alias_cache(const TypePtr* adr_type) { 1668 intptr_t key = (intptr_t) adr_type; 1669 key ^= key >> logAliasCacheSize; 1670 return &_alias_cache[key & right_n_bits(logAliasCacheSize)]; 1671 } 1672 1673 1674 //-----------------------------grow_alias_types-------------------------------- 1675 void Compile::grow_alias_types() { 1676 const int old_ats = _max_alias_types; // how many before? 1677 const int new_ats = old_ats; // how many more? 1678 const int grow_ats = old_ats+new_ats; // how many now? 1679 _max_alias_types = grow_ats; 1680 _alias_types = REALLOC_ARENA_ARRAY(comp_arena(), AliasType*, _alias_types, old_ats, grow_ats); 1681 AliasType* ats = NEW_ARENA_ARRAY(comp_arena(), AliasType, new_ats); 1682 Copy::zero_to_bytes(ats, sizeof(AliasType)*new_ats); 1683 for (int i = 0; i < new_ats; i++) _alias_types[old_ats+i] = &ats[i]; 1684 } 1685 1686 1687 //--------------------------------find_alias_type------------------------------ 1688 Compile::AliasType* Compile::find_alias_type(const TypePtr* adr_type, bool no_create, ciField* original_field) { 1689 if (_AliasLevel == 0) 1690 return alias_type(AliasIdxBot); 1691 1692 AliasCacheEntry* ace = probe_alias_cache(adr_type); 1693 if (ace->_adr_type == adr_type) { 1694 return alias_type(ace->_index); 1695 } 1696 1697 // Handle special cases. 1698 if (adr_type == NULL) return alias_type(AliasIdxTop); 1699 if (adr_type == TypePtr::BOTTOM) return alias_type(AliasIdxBot); 1700 1701 // Do it the slow way. 1702 const TypePtr* flat = flatten_alias_type(adr_type); 1703 1704 #ifdef ASSERT 1705 assert(flat == flatten_alias_type(flat), "idempotent"); 1706 assert(flat != TypePtr::BOTTOM, "cannot alias-analyze an untyped ptr"); 1707 if (flat->isa_oopptr() && !flat->isa_klassptr()) { 1708 const TypeOopPtr* foop = flat->is_oopptr(); 1709 // Scalarizable allocations have exact klass always. 1710 bool exact = !foop->klass_is_exact() || foop->is_known_instance(); 1711 const TypePtr* xoop = foop->cast_to_exactness(exact)->is_ptr(); 1712 assert(foop == flatten_alias_type(xoop), "exactness must not affect alias type"); 1713 } 1714 assert(flat == flatten_alias_type(flat), "exact bit doesn't matter"); 1715 #endif 1716 1717 int idx = AliasIdxTop; 1718 for (int i = 0; i < num_alias_types(); i++) { 1719 if (alias_type(i)->adr_type() == flat) { 1720 idx = i; 1721 break; 1722 } 1723 } 1724 1725 if (idx == AliasIdxTop) { 1726 if (no_create) return NULL; 1727 // Grow the array if necessary. 1728 if (_num_alias_types == _max_alias_types) grow_alias_types(); 1729 // Add a new alias type. 1730 idx = _num_alias_types++; 1731 _alias_types[idx]->Init(idx, flat); 1732 if (flat == TypeInstPtr::KLASS) alias_type(idx)->set_rewritable(false); 1733 if (flat == TypeAryPtr::RANGE) alias_type(idx)->set_rewritable(false); 1734 if (flat->isa_instptr()) { 1735 if (flat->offset() == java_lang_Class::klass_offset_in_bytes() 1736 && flat->is_instptr()->klass() == env()->Class_klass()) 1737 alias_type(idx)->set_rewritable(false); 1738 } 1739 if (flat->isa_aryptr()) { 1740 #ifdef ASSERT 1741 const int header_size_min = arrayOopDesc::base_offset_in_bytes(T_BYTE); 1742 // (T_BYTE has the weakest alignment and size restrictions...) 1743 assert(flat->offset() < header_size_min, "array body reference must be OffsetBot"); 1744 #endif 1745 if (flat->offset() == TypePtr::OffsetBot) { 1746 alias_type(idx)->set_element(flat->is_aryptr()->elem()); 1747 } 1748 } 1749 if (flat->isa_klassptr()) { 1750 if (flat->offset() == in_bytes(Klass::super_check_offset_offset())) 1751 alias_type(idx)->set_rewritable(false); 1752 if (flat->offset() == in_bytes(Klass::modifier_flags_offset())) 1753 alias_type(idx)->set_rewritable(false); 1754 if (flat->offset() == in_bytes(Klass::access_flags_offset())) 1755 alias_type(idx)->set_rewritable(false); 1756 if (flat->offset() == in_bytes(Klass::java_mirror_offset())) 1757 alias_type(idx)->set_rewritable(false); 1758 } 1759 // %%% (We would like to finalize JavaThread::threadObj_offset(), 1760 // but the base pointer type is not distinctive enough to identify 1761 // references into JavaThread.) 1762 1763 // Check for final fields. 1764 const TypeInstPtr* tinst = flat->isa_instptr(); 1765 if (tinst && tinst->offset() >= instanceOopDesc::base_offset_in_bytes()) { 1766 ciField* field; 1767 if (tinst->const_oop() != NULL && 1768 tinst->klass() == ciEnv::current()->Class_klass() && 1769 tinst->offset() >= (tinst->klass()->as_instance_klass()->size_helper() * wordSize)) { 1770 // static field 1771 ciInstanceKlass* k = tinst->const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass(); 1772 field = k->get_field_by_offset(tinst->offset(), true); 1773 } else { 1774 ciInstanceKlass *k = tinst->klass()->as_instance_klass(); 1775 field = k->get_field_by_offset(tinst->offset(), false); 1776 } 1777 assert(field == NULL || 1778 original_field == NULL || 1779 (field->holder() == original_field->holder() && 1780 field->offset() == original_field->offset() && 1781 field->is_static() == original_field->is_static()), "wrong field?"); 1782 // Set field() and is_rewritable() attributes. 1783 if (field != NULL) alias_type(idx)->set_field(field); 1784 } 1785 } 1786 1787 // Fill the cache for next time. 1788 ace->_adr_type = adr_type; 1789 ace->_index = idx; 1790 assert(alias_type(adr_type) == alias_type(idx), "type must be installed"); 1791 1792 // Might as well try to fill the cache for the flattened version, too. 1793 AliasCacheEntry* face = probe_alias_cache(flat); 1794 if (face->_adr_type == NULL) { 1795 face->_adr_type = flat; 1796 face->_index = idx; 1797 assert(alias_type(flat) == alias_type(idx), "flat type must work too"); 1798 } 1799 1800 return alias_type(idx); 1801 } 1802 1803 1804 Compile::AliasType* Compile::alias_type(ciField* field) { 1805 const TypeOopPtr* t; 1806 if (field->is_static()) 1807 t = TypeInstPtr::make(field->holder()->java_mirror()); 1808 else 1809 t = TypeOopPtr::make_from_klass_raw(field->holder()); 1810 AliasType* atp = alias_type(t->add_offset(field->offset_in_bytes()), field); 1811 assert((field->is_final() || field->is_stable()) == !atp->is_rewritable(), "must get the rewritable bits correct"); 1812 return atp; 1813 } 1814 1815 1816 //------------------------------have_alias_type-------------------------------- 1817 bool Compile::have_alias_type(const TypePtr* adr_type) { 1818 AliasCacheEntry* ace = probe_alias_cache(adr_type); 1819 if (ace->_adr_type == adr_type) { 1820 return true; 1821 } 1822 1823 // Handle special cases. 1824 if (adr_type == NULL) return true; 1825 if (adr_type == TypePtr::BOTTOM) return true; 1826 1827 return find_alias_type(adr_type, true, NULL) != NULL; 1828 } 1829 1830 //-----------------------------must_alias-------------------------------------- 1831 // True if all values of the given address type are in the given alias category. 1832 bool Compile::must_alias(const TypePtr* adr_type, int alias_idx) { 1833 if (alias_idx == AliasIdxBot) return true; // the universal category 1834 if (adr_type == NULL) return true; // NULL serves as TypePtr::TOP 1835 if (alias_idx == AliasIdxTop) return false; // the empty category 1836 if (adr_type->base() == Type::AnyPtr) return false; // TypePtr::BOTTOM or its twins 1837 1838 // the only remaining possible overlap is identity 1839 int adr_idx = get_alias_index(adr_type); 1840 assert(adr_idx != AliasIdxBot && adr_idx != AliasIdxTop, ""); 1841 assert(adr_idx == alias_idx || 1842 (alias_type(alias_idx)->adr_type() != TypeOopPtr::BOTTOM 1843 && adr_type != TypeOopPtr::BOTTOM), 1844 "should not be testing for overlap with an unsafe pointer"); 1845 return adr_idx == alias_idx; 1846 } 1847 1848 //------------------------------can_alias-------------------------------------- 1849 // True if any values of the given address type are in the given alias category. 1850 bool Compile::can_alias(const TypePtr* adr_type, int alias_idx) { 1851 if (alias_idx == AliasIdxTop) return false; // the empty category 1852 if (adr_type == NULL) return false; // NULL serves as TypePtr::TOP 1853 if (alias_idx == AliasIdxBot) return true; // the universal category 1854 if (adr_type->base() == Type::AnyPtr) return true; // TypePtr::BOTTOM or its twins 1855 1856 // the only remaining possible overlap is identity 1857 int adr_idx = get_alias_index(adr_type); 1858 assert(adr_idx != AliasIdxBot && adr_idx != AliasIdxTop, ""); 1859 return adr_idx == alias_idx; 1860 } 1861 1862 1863 1864 //---------------------------pop_warm_call------------------------------------- 1865 WarmCallInfo* Compile::pop_warm_call() { 1866 WarmCallInfo* wci = _warm_calls; 1867 if (wci != NULL) _warm_calls = wci->remove_from(wci); 1868 return wci; 1869 } 1870 1871 //----------------------------Inline_Warm-------------------------------------- 1872 int Compile::Inline_Warm() { 1873 // If there is room, try to inline some more warm call sites. 1874 // %%% Do a graph index compaction pass when we think we're out of space? 1875 if (!InlineWarmCalls) return 0; 1876 1877 int calls_made_hot = 0; 1878 int room_to_grow = NodeCountInliningCutoff - unique(); 1879 int amount_to_grow = MIN2(room_to_grow, (int)NodeCountInliningStep); 1880 int amount_grown = 0; 1881 WarmCallInfo* call; 1882 while (amount_to_grow > 0 && (call = pop_warm_call()) != NULL) { 1883 int est_size = (int)call->size(); 1884 if (est_size > (room_to_grow - amount_grown)) { 1885 // This one won't fit anyway. Get rid of it. 1886 call->make_cold(); 1887 continue; 1888 } 1889 call->make_hot(); 1890 calls_made_hot++; 1891 amount_grown += est_size; 1892 amount_to_grow -= est_size; 1893 } 1894 1895 if (calls_made_hot > 0) set_major_progress(); 1896 return calls_made_hot; 1897 } 1898 1899 1900 //----------------------------Finish_Warm-------------------------------------- 1901 void Compile::Finish_Warm() { 1902 if (!InlineWarmCalls) return; 1903 if (failing()) return; 1904 if (warm_calls() == NULL) return; 1905 1906 // Clean up loose ends, if we are out of space for inlining. 1907 WarmCallInfo* call; 1908 while ((call = pop_warm_call()) != NULL) { 1909 call->make_cold(); 1910 } 1911 } 1912 1913 //---------------------cleanup_loop_predicates----------------------- 1914 // Remove the opaque nodes that protect the predicates so that all unused 1915 // checks and uncommon_traps will be eliminated from the ideal graph 1916 void Compile::cleanup_loop_predicates(PhaseIterGVN &igvn) { 1917 if (predicate_count()==0) return; 1918 for (int i = predicate_count(); i > 0; i--) { 1919 Node * n = predicate_opaque1_node(i-1); 1920 assert(n->Opcode() == Op_Opaque1, "must be"); 1921 igvn.replace_node(n, n->in(1)); 1922 } 1923 assert(predicate_count()==0, "should be clean!"); 1924 } 1925 1926 // StringOpts and late inlining of string methods 1927 void Compile::inline_string_calls(bool parse_time) { 1928 { 1929 // remove useless nodes to make the usage analysis simpler 1930 ResourceMark rm; 1931 PhaseRemoveUseless pru(initial_gvn(), for_igvn()); 1932 } 1933 1934 { 1935 ResourceMark rm; 1936 print_method(PHASE_BEFORE_STRINGOPTS, 3); 1937 PhaseStringOpts pso(initial_gvn(), for_igvn()); 1938 print_method(PHASE_AFTER_STRINGOPTS, 3); 1939 } 1940 1941 // now inline anything that we skipped the first time around 1942 if (!parse_time) { 1943 _late_inlines_pos = _late_inlines.length(); 1944 } 1945 1946 while (_string_late_inlines.length() > 0) { 1947 CallGenerator* cg = _string_late_inlines.pop(); 1948 cg->do_late_inline(); 1949 if (failing()) return; 1950 } 1951 _string_late_inlines.trunc_to(0); 1952 } 1953 1954 // Late inlining of boxing methods 1955 void Compile::inline_boxing_calls(PhaseIterGVN& igvn) { 1956 if (_boxing_late_inlines.length() > 0) { 1957 assert(has_boxed_value(), "inconsistent"); 1958 1959 PhaseGVN* gvn = initial_gvn(); 1960 set_inlining_incrementally(true); 1961 1962 assert( igvn._worklist.size() == 0, "should be done with igvn" ); 1963 for_igvn()->clear(); 1964 gvn->replace_with(&igvn); 1965 1966 _late_inlines_pos = _late_inlines.length(); 1967 1968 while (_boxing_late_inlines.length() > 0) { 1969 CallGenerator* cg = _boxing_late_inlines.pop(); 1970 cg->do_late_inline(); 1971 if (failing()) return; 1972 } 1973 _boxing_late_inlines.trunc_to(0); 1974 1975 { 1976 ResourceMark rm; 1977 PhaseRemoveUseless pru(gvn, for_igvn()); 1978 } 1979 1980 igvn = PhaseIterGVN(gvn); 1981 igvn.optimize(); 1982 1983 set_inlining_progress(false); 1984 set_inlining_incrementally(false); 1985 } 1986 } 1987 1988 void Compile::inline_incrementally_one(PhaseIterGVN& igvn) { 1989 assert(IncrementalInline, "incremental inlining should be on"); 1990 PhaseGVN* gvn = initial_gvn(); 1991 1992 set_inlining_progress(false); 1993 for_igvn()->clear(); 1994 gvn->replace_with(&igvn); 1995 1996 { 1997 TracePhase tp("incrementalInline_inline", &timers[_t_incrInline_inline]); 1998 int i = 0; 1999 for (; i <_late_inlines.length() && !inlining_progress(); i++) { 2000 CallGenerator* cg = _late_inlines.at(i); 2001 _late_inlines_pos = i+1; 2002 cg->do_late_inline(); 2003 if (failing()) return; 2004 } 2005 int j = 0; 2006 for (; i < _late_inlines.length(); i++, j++) { 2007 _late_inlines.at_put(j, _late_inlines.at(i)); 2008 } 2009 _late_inlines.trunc_to(j); 2010 } 2011 2012 { 2013 TracePhase tp("incrementalInline_pru", &timers[_t_incrInline_pru]); 2014 ResourceMark rm; 2015 PhaseRemoveUseless pru(gvn, for_igvn()); 2016 } 2017 2018 { 2019 TracePhase tp("incrementalInline_igvn", &timers[_t_incrInline_igvn]); 2020 igvn = PhaseIterGVN(gvn); 2021 } 2022 } 2023 2024 // Perform incremental inlining until bound on number of live nodes is reached 2025 void Compile::inline_incrementally(PhaseIterGVN& igvn) { 2026 TracePhase tp("incrementalInline", &timers[_t_incrInline]); 2027 2028 PhaseGVN* gvn = initial_gvn(); 2029 2030 set_inlining_incrementally(true); 2031 set_inlining_progress(true); 2032 uint low_live_nodes = 0; 2033 2034 while(inlining_progress() && _late_inlines.length() > 0) { 2035 2036 if (live_nodes() > (uint)LiveNodeCountInliningCutoff) { 2037 if (low_live_nodes < (uint)LiveNodeCountInliningCutoff * 8 / 10) { 2038 TracePhase tp("incrementalInline_ideal", &timers[_t_incrInline_ideal]); 2039 // PhaseIdealLoop is expensive so we only try it once we are 2040 // out of live nodes and we only try it again if the previous 2041 // helped got the number of nodes down significantly 2042 PhaseIdealLoop ideal_loop( igvn, false, true ); 2043 if (failing()) return; 2044 low_live_nodes = live_nodes(); 2045 _major_progress = true; 2046 } 2047 2048 if (live_nodes() > (uint)LiveNodeCountInliningCutoff) { 2049 break; 2050 } 2051 } 2052 2053 inline_incrementally_one(igvn); 2054 2055 if (failing()) return; 2056 2057 { 2058 TracePhase tp("incrementalInline_igvn", &timers[_t_incrInline_igvn]); 2059 igvn.optimize(); 2060 } 2061 2062 if (failing()) return; 2063 } 2064 2065 assert( igvn._worklist.size() == 0, "should be done with igvn" ); 2066 2067 if (_string_late_inlines.length() > 0) { 2068 assert(has_stringbuilder(), "inconsistent"); 2069 for_igvn()->clear(); 2070 initial_gvn()->replace_with(&igvn); 2071 2072 inline_string_calls(false); 2073 2074 if (failing()) return; 2075 2076 { 2077 TracePhase tp("incrementalInline_pru", &timers[_t_incrInline_pru]); 2078 ResourceMark rm; 2079 PhaseRemoveUseless pru(initial_gvn(), for_igvn()); 2080 } 2081 2082 { 2083 TracePhase tp("incrementalInline_igvn", &timers[_t_incrInline_igvn]); 2084 igvn = PhaseIterGVN(gvn); 2085 igvn.optimize(); 2086 } 2087 } 2088 2089 set_inlining_incrementally(false); 2090 } 2091 2092 2093 //------------------------------Optimize--------------------------------------- 2094 // Given a graph, optimize it. 2095 void Compile::Optimize() { 2096 TracePhase tp("optimizer", &timers[_t_optimizer]); 2097 2098 #ifndef PRODUCT 2099 if (_directive->BreakAtCompileOption) { 2100 BREAKPOINT; 2101 } 2102 2103 #endif 2104 2105 ResourceMark rm; 2106 int loop_opts_cnt; 2107 2108 print_inlining_reinit(); 2109 2110 NOT_PRODUCT( verify_graph_edges(); ) 2111 2112 print_method(PHASE_AFTER_PARSING); 2113 2114 { 2115 // Iterative Global Value Numbering, including ideal transforms 2116 // Initialize IterGVN with types and values from parse-time GVN 2117 PhaseIterGVN igvn(initial_gvn()); 2118 #ifdef ASSERT 2119 _modified_nodes = new (comp_arena()) Unique_Node_List(comp_arena()); 2120 #endif 2121 { 2122 TracePhase tp("iterGVN", &timers[_t_iterGVN]); 2123 igvn.optimize(); 2124 } 2125 2126 print_method(PHASE_ITER_GVN1, 2); 2127 2128 if (failing()) return; 2129 2130 inline_incrementally(igvn); 2131 2132 print_method(PHASE_INCREMENTAL_INLINE, 2); 2133 2134 if (failing()) return; 2135 2136 if (eliminate_boxing()) { 2137 // Inline valueOf() methods now. 2138 inline_boxing_calls(igvn); 2139 2140 if (AlwaysIncrementalInline) { 2141 inline_incrementally(igvn); 2142 } 2143 2144 print_method(PHASE_INCREMENTAL_BOXING_INLINE, 2); 2145 2146 if (failing()) return; 2147 } 2148 2149 // Remove the speculative part of types and clean up the graph from 2150 // the extra CastPP nodes whose only purpose is to carry them. Do 2151 // that early so that optimizations are not disrupted by the extra 2152 // CastPP nodes. 2153 remove_speculative_types(igvn); 2154 2155 // No more new expensive nodes will be added to the list from here 2156 // so keep only the actual candidates for optimizations. 2157 cleanup_expensive_nodes(igvn); 2158 2159 if (!failing() && RenumberLiveNodes && live_nodes() + NodeLimitFudgeFactor < unique()) { 2160 initial_gvn()->replace_with(&igvn); 2161 for_igvn()->clear(); 2162 Unique_Node_List new_worklist(C->comp_arena()); 2163 { 2164 ResourceMark rm; 2165 PhaseRenumberLive prl = PhaseRenumberLive(initial_gvn(), for_igvn(), &new_worklist); 2166 } 2167 set_for_igvn(&new_worklist); 2168 igvn = PhaseIterGVN(initial_gvn()); 2169 igvn.optimize(); 2170 } 2171 2172 // Perform escape analysis 2173 if (_do_escape_analysis && ConnectionGraph::has_candidates(this)) { 2174 if (has_loops()) { 2175 // Cleanup graph (remove dead nodes). 2176 TracePhase tp("idealLoop", &timers[_t_idealLoop]); 2177 PhaseIdealLoop ideal_loop( igvn, false, true ); 2178 if (major_progress()) print_method(PHASE_PHASEIDEAL_BEFORE_EA, 2); 2179 if (failing()) return; 2180 } 2181 ConnectionGraph::do_analysis(this, &igvn); 2182 2183 if (failing()) return; 2184 2185 // Optimize out fields loads from scalar replaceable allocations. 2186 igvn.optimize(); 2187 print_method(PHASE_ITER_GVN_AFTER_EA, 2); 2188 2189 if (failing()) return; 2190 2191 if (congraph() != NULL && macro_count() > 0) { 2192 TracePhase tp("macroEliminate", &timers[_t_macroEliminate]); 2193 PhaseMacroExpand mexp(igvn); 2194 mexp.eliminate_macro_nodes(); 2195 igvn.set_delay_transform(false); 2196 2197 igvn.optimize(); 2198 print_method(PHASE_ITER_GVN_AFTER_ELIMINATION, 2); 2199 2200 if (failing()) return; 2201 } 2202 } 2203 2204 // Loop transforms on the ideal graph. Range Check Elimination, 2205 // peeling, unrolling, etc. 2206 2207 // Set loop opts counter 2208 loop_opts_cnt = num_loop_opts(); 2209 if((loop_opts_cnt > 0) && (has_loops() || has_split_ifs())) { 2210 { 2211 TracePhase tp("idealLoop", &timers[_t_idealLoop]); 2212 PhaseIdealLoop ideal_loop( igvn, true ); 2213 loop_opts_cnt--; 2214 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP1, 2); 2215 if (failing()) return; 2216 } 2217 // Loop opts pass if partial peeling occurred in previous pass 2218 if(PartialPeelLoop && major_progress() && (loop_opts_cnt > 0)) { 2219 TracePhase tp("idealLoop", &timers[_t_idealLoop]); 2220 PhaseIdealLoop ideal_loop( igvn, false ); 2221 loop_opts_cnt--; 2222 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP2, 2); 2223 if (failing()) return; 2224 } 2225 // Loop opts pass for loop-unrolling before CCP 2226 if(major_progress() && (loop_opts_cnt > 0)) { 2227 TracePhase tp("idealLoop", &timers[_t_idealLoop]); 2228 PhaseIdealLoop ideal_loop( igvn, false ); 2229 loop_opts_cnt--; 2230 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP3, 2); 2231 } 2232 if (!failing()) { 2233 // Verify that last round of loop opts produced a valid graph 2234 TracePhase tp("idealLoopVerify", &timers[_t_idealLoopVerify]); 2235 PhaseIdealLoop::verify(igvn); 2236 } 2237 } 2238 if (failing()) return; 2239 2240 // Conditional Constant Propagation; 2241 PhaseCCP ccp( &igvn ); 2242 assert( true, "Break here to ccp.dump_nodes_and_types(_root,999,1)"); 2243 { 2244 TracePhase tp("ccp", &timers[_t_ccp]); 2245 ccp.do_transform(); 2246 } 2247 print_method(PHASE_CPP1, 2); 2248 2249 assert( true, "Break here to ccp.dump_old2new_map()"); 2250 2251 // Iterative Global Value Numbering, including ideal transforms 2252 { 2253 TracePhase tp("iterGVN2", &timers[_t_iterGVN2]); 2254 igvn = ccp; 2255 igvn.optimize(); 2256 } 2257 2258 print_method(PHASE_ITER_GVN2, 2); 2259 2260 if (failing()) return; 2261 2262 // Loop transforms on the ideal graph. Range Check Elimination, 2263 // peeling, unrolling, etc. 2264 if(loop_opts_cnt > 0) { 2265 debug_only( int cnt = 0; ); 2266 while(major_progress() && (loop_opts_cnt > 0)) { 2267 TracePhase tp("idealLoop", &timers[_t_idealLoop]); 2268 assert( cnt++ < 40, "infinite cycle in loop optimization" ); 2269 PhaseIdealLoop ideal_loop( igvn, true); 2270 loop_opts_cnt--; 2271 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP_ITERATIONS, 2); 2272 if (failing()) return; 2273 } 2274 } 2275 // Ensure that major progress is now clear 2276 C->clear_major_progress(); 2277 2278 { 2279 // Verify that all previous optimizations produced a valid graph 2280 // at least to this point, even if no loop optimizations were done. 2281 TracePhase tp("idealLoopVerify", &timers[_t_idealLoopVerify]); 2282 PhaseIdealLoop::verify(igvn); 2283 } 2284 2285 { 2286 TracePhase tp("macroExpand", &timers[_t_macroExpand]); 2287 PhaseMacroExpand mex(igvn); 2288 if (mex.expand_macro_nodes()) { 2289 assert(failing(), "must bail out w/ explicit message"); 2290 return; 2291 } 2292 } 2293 2294 DEBUG_ONLY( _modified_nodes = NULL; ) 2295 } // (End scope of igvn; run destructor if necessary for asserts.) 2296 2297 process_print_inlining(); 2298 // A method with only infinite loops has no edges entering loops from root 2299 { 2300 TracePhase tp("graphReshape", &timers[_t_graphReshaping]); 2301 if (final_graph_reshaping()) { 2302 assert(failing(), "must bail out w/ explicit message"); 2303 return; 2304 } 2305 } 2306 2307 print_method(PHASE_OPTIMIZE_FINISHED, 2); 2308 } 2309 2310 2311 //------------------------------Code_Gen--------------------------------------- 2312 // Given a graph, generate code for it 2313 void Compile::Code_Gen() { 2314 if (failing()) { 2315 return; 2316 } 2317 2318 // Perform instruction selection. You might think we could reclaim Matcher 2319 // memory PDQ, but actually the Matcher is used in generating spill code. 2320 // Internals of the Matcher (including some VectorSets) must remain live 2321 // for awhile - thus I cannot reclaim Matcher memory lest a VectorSet usage 2322 // set a bit in reclaimed memory. 2323 2324 // In debug mode can dump m._nodes.dump() for mapping of ideal to machine 2325 // nodes. Mapping is only valid at the root of each matched subtree. 2326 NOT_PRODUCT( verify_graph_edges(); ) 2327 2328 Matcher matcher; 2329 _matcher = &matcher; 2330 { 2331 TracePhase tp("matcher", &timers[_t_matcher]); 2332 matcher.match(); 2333 } 2334 // In debug mode can dump m._nodes.dump() for mapping of ideal to machine 2335 // nodes. Mapping is only valid at the root of each matched subtree. 2336 NOT_PRODUCT( verify_graph_edges(); ) 2337 2338 // If you have too many nodes, or if matching has failed, bail out 2339 check_node_count(0, "out of nodes matching instructions"); 2340 if (failing()) { 2341 return; 2342 } 2343 2344 // Build a proper-looking CFG 2345 PhaseCFG cfg(node_arena(), root(), matcher); 2346 _cfg = &cfg; 2347 { 2348 TracePhase tp("scheduler", &timers[_t_scheduler]); 2349 bool success = cfg.do_global_code_motion(); 2350 if (!success) { 2351 return; 2352 } 2353 2354 print_method(PHASE_GLOBAL_CODE_MOTION, 2); 2355 NOT_PRODUCT( verify_graph_edges(); ) 2356 debug_only( cfg.verify(); ) 2357 } 2358 2359 PhaseChaitin regalloc(unique(), cfg, matcher, false); 2360 _regalloc = ®alloc; 2361 { 2362 TracePhase tp("regalloc", &timers[_t_registerAllocation]); 2363 // Perform register allocation. After Chaitin, use-def chains are 2364 // no longer accurate (at spill code) and so must be ignored. 2365 // Node->LRG->reg mappings are still accurate. 2366 _regalloc->Register_Allocate(); 2367 2368 // Bail out if the allocator builds too many nodes 2369 if (failing()) { 2370 return; 2371 } 2372 } 2373 2374 // Prior to register allocation we kept empty basic blocks in case the 2375 // the allocator needed a place to spill. After register allocation we 2376 // are not adding any new instructions. If any basic block is empty, we 2377 // can now safely remove it. 2378 { 2379 TracePhase tp("blockOrdering", &timers[_t_blockOrdering]); 2380 cfg.remove_empty_blocks(); 2381 if (do_freq_based_layout()) { 2382 PhaseBlockLayout layout(cfg); 2383 } else { 2384 cfg.set_loop_alignment(); 2385 } 2386 cfg.fixup_flow(); 2387 } 2388 2389 // Apply peephole optimizations 2390 if( OptoPeephole ) { 2391 TracePhase tp("peephole", &timers[_t_peephole]); 2392 PhasePeephole peep( _regalloc, cfg); 2393 peep.do_transform(); 2394 } 2395 2396 // Do late expand if CPU requires this. 2397 if (Matcher::require_postalloc_expand) { 2398 TracePhase tp("postalloc_expand", &timers[_t_postalloc_expand]); 2399 cfg.postalloc_expand(_regalloc); 2400 } 2401 2402 // Convert Nodes to instruction bits in a buffer 2403 { 2404 TraceTime tp("output", &timers[_t_output], CITime); 2405 Output(); 2406 } 2407 2408 print_method(PHASE_FINAL_CODE); 2409 2410 // He's dead, Jim. 2411 _cfg = (PhaseCFG*)0xdeadbeef; 2412 _regalloc = (PhaseChaitin*)0xdeadbeef; 2413 } 2414 2415 2416 //------------------------------dump_asm--------------------------------------- 2417 // Dump formatted assembly 2418 #ifndef PRODUCT 2419 void Compile::dump_asm(int *pcs, uint pc_limit) { 2420 bool cut_short = false; 2421 tty->print_cr("#"); 2422 tty->print("# "); _tf->dump(); tty->cr(); 2423 tty->print_cr("#"); 2424 2425 // For all blocks 2426 int pc = 0x0; // Program counter 2427 char starts_bundle = ' '; 2428 _regalloc->dump_frame(); 2429 2430 Node *n = NULL; 2431 for (uint i = 0; i < _cfg->number_of_blocks(); i++) { 2432 if (VMThread::should_terminate()) { 2433 cut_short = true; 2434 break; 2435 } 2436 Block* block = _cfg->get_block(i); 2437 if (block->is_connector() && !Verbose) { 2438 continue; 2439 } 2440 n = block->head(); 2441 if (pcs && n->_idx < pc_limit) { 2442 tty->print("%3.3x ", pcs[n->_idx]); 2443 } else { 2444 tty->print(" "); 2445 } 2446 block->dump_head(_cfg); 2447 if (block->is_connector()) { 2448 tty->print_cr(" # Empty connector block"); 2449 } else if (block->num_preds() == 2 && block->pred(1)->is_CatchProj() && block->pred(1)->as_CatchProj()->_con == CatchProjNode::fall_through_index) { 2450 tty->print_cr(" # Block is sole successor of call"); 2451 } 2452 2453 // For all instructions 2454 Node *delay = NULL; 2455 for (uint j = 0; j < block->number_of_nodes(); j++) { 2456 if (VMThread::should_terminate()) { 2457 cut_short = true; 2458 break; 2459 } 2460 n = block->get_node(j); 2461 if (valid_bundle_info(n)) { 2462 Bundle* bundle = node_bundling(n); 2463 if (bundle->used_in_unconditional_delay()) { 2464 delay = n; 2465 continue; 2466 } 2467 if (bundle->starts_bundle()) { 2468 starts_bundle = '+'; 2469 } 2470 } 2471 2472 if (WizardMode) { 2473 n->dump(); 2474 } 2475 2476 if( !n->is_Region() && // Dont print in the Assembly 2477 !n->is_Phi() && // a few noisely useless nodes 2478 !n->is_Proj() && 2479 !n->is_MachTemp() && 2480 !n->is_SafePointScalarObject() && 2481 !n->is_Catch() && // Would be nice to print exception table targets 2482 !n->is_MergeMem() && // Not very interesting 2483 !n->is_top() && // Debug info table constants 2484 !(n->is_Con() && !n->is_Mach())// Debug info table constants 2485 ) { 2486 if (pcs && n->_idx < pc_limit) 2487 tty->print("%3.3x", pcs[n->_idx]); 2488 else 2489 tty->print(" "); 2490 tty->print(" %c ", starts_bundle); 2491 starts_bundle = ' '; 2492 tty->print("\t"); 2493 n->format(_regalloc, tty); 2494 tty->cr(); 2495 } 2496 2497 // If we have an instruction with a delay slot, and have seen a delay, 2498 // then back up and print it 2499 if (valid_bundle_info(n) && node_bundling(n)->use_unconditional_delay()) { 2500 assert(delay != NULL, "no unconditional delay instruction"); 2501 if (WizardMode) delay->dump(); 2502 2503 if (node_bundling(delay)->starts_bundle()) 2504 starts_bundle = '+'; 2505 if (pcs && n->_idx < pc_limit) 2506 tty->print("%3.3x", pcs[n->_idx]); 2507 else 2508 tty->print(" "); 2509 tty->print(" %c ", starts_bundle); 2510 starts_bundle = ' '; 2511 tty->print("\t"); 2512 delay->format(_regalloc, tty); 2513 tty->cr(); 2514 delay = NULL; 2515 } 2516 2517 // Dump the exception table as well 2518 if( n->is_Catch() && (Verbose || WizardMode) ) { 2519 // Print the exception table for this offset 2520 _handler_table.print_subtable_for(pc); 2521 } 2522 } 2523 2524 if (pcs && n->_idx < pc_limit) 2525 tty->print_cr("%3.3x", pcs[n->_idx]); 2526 else 2527 tty->cr(); 2528 2529 assert(cut_short || delay == NULL, "no unconditional delay branch"); 2530 2531 } // End of per-block dump 2532 tty->cr(); 2533 2534 if (cut_short) tty->print_cr("*** disassembly is cut short ***"); 2535 } 2536 #endif 2537 2538 //------------------------------Final_Reshape_Counts--------------------------- 2539 // This class defines counters to help identify when a method 2540 // may/must be executed using hardware with only 24-bit precision. 2541 struct Final_Reshape_Counts : public StackObj { 2542 int _call_count; // count non-inlined 'common' calls 2543 int _float_count; // count float ops requiring 24-bit precision 2544 int _double_count; // count double ops requiring more precision 2545 int _java_call_count; // count non-inlined 'java' calls 2546 int _inner_loop_count; // count loops which need alignment 2547 VectorSet _visited; // Visitation flags 2548 Node_List _tests; // Set of IfNodes & PCTableNodes 2549 2550 Final_Reshape_Counts() : 2551 _call_count(0), _float_count(0), _double_count(0), 2552 _java_call_count(0), _inner_loop_count(0), 2553 _visited( Thread::current()->resource_area() ) { } 2554 2555 void inc_call_count () { _call_count ++; } 2556 void inc_float_count () { _float_count ++; } 2557 void inc_double_count() { _double_count++; } 2558 void inc_java_call_count() { _java_call_count++; } 2559 void inc_inner_loop_count() { _inner_loop_count++; } 2560 2561 int get_call_count () const { return _call_count ; } 2562 int get_float_count () const { return _float_count ; } 2563 int get_double_count() const { return _double_count; } 2564 int get_java_call_count() const { return _java_call_count; } 2565 int get_inner_loop_count() const { return _inner_loop_count; } 2566 }; 2567 2568 #ifdef ASSERT 2569 static bool oop_offset_is_sane(const TypeInstPtr* tp) { 2570 ciInstanceKlass *k = tp->klass()->as_instance_klass(); 2571 // Make sure the offset goes inside the instance layout. 2572 return k->contains_field_offset(tp->offset()); 2573 // Note that OffsetBot and OffsetTop are very negative. 2574 } 2575 #endif 2576 2577 // Eliminate trivially redundant StoreCMs and accumulate their 2578 // precedence edges. 2579 void Compile::eliminate_redundant_card_marks(Node* n) { 2580 assert(n->Opcode() == Op_StoreCM, "expected StoreCM"); 2581 if (n->in(MemNode::Address)->outcnt() > 1) { 2582 // There are multiple users of the same address so it might be 2583 // possible to eliminate some of the StoreCMs 2584 Node* mem = n->in(MemNode::Memory); 2585 Node* adr = n->in(MemNode::Address); 2586 Node* val = n->in(MemNode::ValueIn); 2587 Node* prev = n; 2588 bool done = false; 2589 // Walk the chain of StoreCMs eliminating ones that match. As 2590 // long as it's a chain of single users then the optimization is 2591 // safe. Eliminating partially redundant StoreCMs would require 2592 // cloning copies down the other paths. 2593 while (mem->Opcode() == Op_StoreCM && mem->outcnt() == 1 && !done) { 2594 if (adr == mem->in(MemNode::Address) && 2595 val == mem->in(MemNode::ValueIn)) { 2596 // redundant StoreCM 2597 if (mem->req() > MemNode::OopStore) { 2598 // Hasn't been processed by this code yet. 2599 n->add_prec(mem->in(MemNode::OopStore)); 2600 } else { 2601 // Already converted to precedence edge 2602 for (uint i = mem->req(); i < mem->len(); i++) { 2603 // Accumulate any precedence edges 2604 if (mem->in(i) != NULL) { 2605 n->add_prec(mem->in(i)); 2606 } 2607 } 2608 // Everything above this point has been processed. 2609 done = true; 2610 } 2611 // Eliminate the previous StoreCM 2612 prev->set_req(MemNode::Memory, mem->in(MemNode::Memory)); 2613 assert(mem->outcnt() == 0, "should be dead"); 2614 mem->disconnect_inputs(NULL, this); 2615 } else { 2616 prev = mem; 2617 } 2618 mem = prev->in(MemNode::Memory); 2619 } 2620 } 2621 } 2622 2623 //------------------------------final_graph_reshaping_impl---------------------- 2624 // Implement items 1-5 from final_graph_reshaping below. 2625 void Compile::final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc) { 2626 2627 if ( n->outcnt() == 0 ) return; // dead node 2628 uint nop = n->Opcode(); 2629 2630 // Check for 2-input instruction with "last use" on right input. 2631 // Swap to left input. Implements item (2). 2632 if( n->req() == 3 && // two-input instruction 2633 n->in(1)->outcnt() > 1 && // left use is NOT a last use 2634 (!n->in(1)->is_Phi() || n->in(1)->in(2) != n) && // it is not data loop 2635 n->in(2)->outcnt() == 1 &&// right use IS a last use 2636 !n->in(2)->is_Con() ) { // right use is not a constant 2637 // Check for commutative opcode 2638 switch( nop ) { 2639 case Op_AddI: case Op_AddF: case Op_AddD: case Op_AddL: 2640 case Op_MaxI: case Op_MinI: 2641 case Op_MulI: case Op_MulF: case Op_MulD: case Op_MulL: 2642 case Op_AndL: case Op_XorL: case Op_OrL: 2643 case Op_AndI: case Op_XorI: case Op_OrI: { 2644 // Move "last use" input to left by swapping inputs 2645 n->swap_edges(1, 2); 2646 break; 2647 } 2648 default: 2649 break; 2650 } 2651 } 2652 2653 #ifdef ASSERT 2654 if( n->is_Mem() ) { 2655 int alias_idx = get_alias_index(n->as_Mem()->adr_type()); 2656 assert( n->in(0) != NULL || alias_idx != Compile::AliasIdxRaw || 2657 // oop will be recorded in oop map if load crosses safepoint 2658 n->is_Load() && (n->as_Load()->bottom_type()->isa_oopptr() || 2659 LoadNode::is_immutable_value(n->in(MemNode::Address))), 2660 "raw memory operations should have control edge"); 2661 } 2662 #endif 2663 // Count FPU ops and common calls, implements item (3) 2664 switch( nop ) { 2665 // Count all float operations that may use FPU 2666 case Op_AddF: 2667 case Op_SubF: 2668 case Op_MulF: 2669 case Op_DivF: 2670 case Op_NegF: 2671 case Op_ModF: 2672 case Op_ConvI2F: 2673 case Op_ConF: 2674 case Op_CmpF: 2675 case Op_CmpF3: 2676 // case Op_ConvL2F: // longs are split into 32-bit halves 2677 frc.inc_float_count(); 2678 break; 2679 2680 case Op_ConvF2D: 2681 case Op_ConvD2F: 2682 frc.inc_float_count(); 2683 frc.inc_double_count(); 2684 break; 2685 2686 // Count all double operations that may use FPU 2687 case Op_AddD: 2688 case Op_SubD: 2689 case Op_MulD: 2690 case Op_DivD: 2691 case Op_NegD: 2692 case Op_ModD: 2693 case Op_ConvI2D: 2694 case Op_ConvD2I: 2695 // case Op_ConvL2D: // handled by leaf call 2696 // case Op_ConvD2L: // handled by leaf call 2697 case Op_ConD: 2698 case Op_CmpD: 2699 case Op_CmpD3: 2700 frc.inc_double_count(); 2701 break; 2702 case Op_Opaque1: // Remove Opaque Nodes before matching 2703 case Op_Opaque2: // Remove Opaque Nodes before matching 2704 case Op_Opaque3: 2705 n->subsume_by(n->in(1), this); 2706 break; 2707 case Op_CallStaticJava: 2708 case Op_CallJava: 2709 case Op_CallDynamicJava: 2710 frc.inc_java_call_count(); // Count java call site; 2711 case Op_CallRuntime: 2712 case Op_CallLeaf: 2713 case Op_CallLeafNoFP: { 2714 assert( n->is_Call(), "" ); 2715 CallNode *call = n->as_Call(); 2716 // Count call sites where the FP mode bit would have to be flipped. 2717 // Do not count uncommon runtime calls: 2718 // uncommon_trap, _complete_monitor_locking, _complete_monitor_unlocking, 2719 // _new_Java, _new_typeArray, _new_objArray, _rethrow_Java, ... 2720 if( !call->is_CallStaticJava() || !call->as_CallStaticJava()->_name ) { 2721 frc.inc_call_count(); // Count the call site 2722 } else { // See if uncommon argument is shared 2723 Node *n = call->in(TypeFunc::Parms); 2724 int nop = n->Opcode(); 2725 // Clone shared simple arguments to uncommon calls, item (1). 2726 if( n->outcnt() > 1 && 2727 !n->is_Proj() && 2728 nop != Op_CreateEx && 2729 nop != Op_CheckCastPP && 2730 nop != Op_DecodeN && 2731 nop != Op_DecodeNKlass && 2732 !n->is_Mem() ) { 2733 Node *x = n->clone(); 2734 call->set_req( TypeFunc::Parms, x ); 2735 } 2736 } 2737 break; 2738 } 2739 2740 case Op_StoreD: 2741 case Op_LoadD: 2742 case Op_LoadD_unaligned: 2743 frc.inc_double_count(); 2744 goto handle_mem; 2745 case Op_StoreF: 2746 case Op_LoadF: 2747 frc.inc_float_count(); 2748 goto handle_mem; 2749 2750 case Op_StoreCM: 2751 { 2752 // Convert OopStore dependence into precedence edge 2753 Node* prec = n->in(MemNode::OopStore); 2754 n->del_req(MemNode::OopStore); 2755 n->add_prec(prec); 2756 eliminate_redundant_card_marks(n); 2757 } 2758 2759 // fall through 2760 2761 case Op_StoreB: 2762 case Op_StoreC: 2763 case Op_StorePConditional: 2764 case Op_StoreI: 2765 case Op_StoreL: 2766 case Op_StoreIConditional: 2767 case Op_StoreLConditional: 2768 case Op_CompareAndSwapI: 2769 case Op_CompareAndSwapL: 2770 case Op_CompareAndSwapP: 2771 case Op_CompareAndSwapN: 2772 case Op_GetAndAddI: 2773 case Op_GetAndAddL: 2774 case Op_GetAndSetI: 2775 case Op_GetAndSetL: 2776 case Op_GetAndSetP: 2777 case Op_GetAndSetN: 2778 case Op_StoreP: 2779 case Op_StoreN: 2780 case Op_StoreNKlass: 2781 case Op_LoadB: 2782 case Op_LoadUB: 2783 case Op_LoadUS: 2784 case Op_LoadI: 2785 case Op_LoadKlass: 2786 case Op_LoadNKlass: 2787 case Op_LoadL: 2788 case Op_LoadL_unaligned: 2789 case Op_LoadPLocked: 2790 case Op_LoadP: 2791 case Op_LoadN: 2792 case Op_LoadRange: 2793 case Op_LoadS: { 2794 handle_mem: 2795 #ifdef ASSERT 2796 if( VerifyOptoOopOffsets ) { 2797 assert( n->is_Mem(), "" ); 2798 MemNode *mem = (MemNode*)n; 2799 // Check to see if address types have grounded out somehow. 2800 const TypeInstPtr *tp = mem->in(MemNode::Address)->bottom_type()->isa_instptr(); 2801 assert( !tp || oop_offset_is_sane(tp), "" ); 2802 } 2803 #endif 2804 break; 2805 } 2806 2807 case Op_AddP: { // Assert sane base pointers 2808 Node *addp = n->in(AddPNode::Address); 2809 assert( !addp->is_AddP() || 2810 addp->in(AddPNode::Base)->is_top() || // Top OK for allocation 2811 addp->in(AddPNode::Base) == n->in(AddPNode::Base), 2812 "Base pointers must match" ); 2813 #ifdef _LP64 2814 if ((UseCompressedOops || UseCompressedClassPointers) && 2815 addp->Opcode() == Op_ConP && 2816 addp == n->in(AddPNode::Base) && 2817 n->in(AddPNode::Offset)->is_Con()) { 2818 // Use addressing with narrow klass to load with offset on x86. 2819 // On sparc loading 32-bits constant and decoding it have less 2820 // instructions (4) then load 64-bits constant (7). 2821 // Do this transformation here since IGVN will convert ConN back to ConP. 2822 const Type* t = addp->bottom_type(); 2823 if (t->isa_oopptr() || t->isa_klassptr()) { 2824 Node* nn = NULL; 2825 2826 int op = t->isa_oopptr() ? Op_ConN : Op_ConNKlass; 2827 2828 // Look for existing ConN node of the same exact type. 2829 Node* r = root(); 2830 uint cnt = r->outcnt(); 2831 for (uint i = 0; i < cnt; i++) { 2832 Node* m = r->raw_out(i); 2833 if (m!= NULL && m->Opcode() == op && 2834 m->bottom_type()->make_ptr() == t) { 2835 nn = m; 2836 break; 2837 } 2838 } 2839 if (nn != NULL) { 2840 // Decode a narrow oop to match address 2841 // [R12 + narrow_oop_reg<<3 + offset] 2842 if (t->isa_oopptr()) { 2843 nn = new DecodeNNode(nn, t); 2844 } else { 2845 nn = new DecodeNKlassNode(nn, t); 2846 } 2847 n->set_req(AddPNode::Base, nn); 2848 n->set_req(AddPNode::Address, nn); 2849 if (addp->outcnt() == 0) { 2850 addp->disconnect_inputs(NULL, this); 2851 } 2852 } 2853 } 2854 } 2855 #endif 2856 break; 2857 } 2858 2859 case Op_CastPP: { 2860 // Remove CastPP nodes to gain more freedom during scheduling but 2861 // keep the dependency they encode as control or precedence edges 2862 // (if control is set already) on memory operations. Some CastPP 2863 // nodes don't have a control (don't carry a dependency): skip 2864 // those. 2865 if (n->in(0) != NULL) { 2866 ResourceMark rm; 2867 Unique_Node_List wq; 2868 wq.push(n); 2869 for (uint next = 0; next < wq.size(); ++next) { 2870 Node *m = wq.at(next); 2871 for (DUIterator_Fast imax, i = m->fast_outs(imax); i < imax; i++) { 2872 Node* use = m->fast_out(i); 2873 if (use->is_Mem() || use->is_EncodeNarrowPtr()) { 2874 use->ensure_control_or_add_prec(n->in(0)); 2875 } else if (use->in(0) == NULL) { 2876 switch(use->Opcode()) { 2877 case Op_AddP: 2878 case Op_DecodeN: 2879 case Op_DecodeNKlass: 2880 case Op_CheckCastPP: 2881 case Op_CastPP: 2882 wq.push(use); 2883 break; 2884 } 2885 } 2886 } 2887 } 2888 } 2889 const bool is_LP64 = LP64_ONLY(true) NOT_LP64(false); 2890 if (is_LP64 && n->in(1)->is_DecodeN() && Matcher::gen_narrow_oop_implicit_null_checks()) { 2891 Node* in1 = n->in(1); 2892 const Type* t = n->bottom_type(); 2893 Node* new_in1 = in1->clone(); 2894 new_in1->as_DecodeN()->set_type(t); 2895 2896 if (!Matcher::narrow_oop_use_complex_address()) { 2897 // 2898 // x86, ARM and friends can handle 2 adds in addressing mode 2899 // and Matcher can fold a DecodeN node into address by using 2900 // a narrow oop directly and do implicit NULL check in address: 2901 // 2902 // [R12 + narrow_oop_reg<<3 + offset] 2903 // NullCheck narrow_oop_reg 2904 // 2905 // On other platforms (Sparc) we have to keep new DecodeN node and 2906 // use it to do implicit NULL check in address: 2907 // 2908 // decode_not_null narrow_oop_reg, base_reg 2909 // [base_reg + offset] 2910 // NullCheck base_reg 2911 // 2912 // Pin the new DecodeN node to non-null path on these platform (Sparc) 2913 // to keep the information to which NULL check the new DecodeN node 2914 // corresponds to use it as value in implicit_null_check(). 2915 // 2916 new_in1->set_req(0, n->in(0)); 2917 } 2918 2919 n->subsume_by(new_in1, this); 2920 if (in1->outcnt() == 0) { 2921 in1->disconnect_inputs(NULL, this); 2922 } 2923 } else { 2924 n->subsume_by(n->in(1), this); 2925 if (n->outcnt() == 0) { 2926 n->disconnect_inputs(NULL, this); 2927 } 2928 } 2929 break; 2930 } 2931 #ifdef _LP64 2932 case Op_CmpP: 2933 // Do this transformation here to preserve CmpPNode::sub() and 2934 // other TypePtr related Ideal optimizations (for example, ptr nullness). 2935 if (n->in(1)->is_DecodeNarrowPtr() || n->in(2)->is_DecodeNarrowPtr()) { 2936 Node* in1 = n->in(1); 2937 Node* in2 = n->in(2); 2938 if (!in1->is_DecodeNarrowPtr()) { 2939 in2 = in1; 2940 in1 = n->in(2); 2941 } 2942 assert(in1->is_DecodeNarrowPtr(), "sanity"); 2943 2944 Node* new_in2 = NULL; 2945 if (in2->is_DecodeNarrowPtr()) { 2946 assert(in2->Opcode() == in1->Opcode(), "must be same node type"); 2947 new_in2 = in2->in(1); 2948 } else if (in2->Opcode() == Op_ConP) { 2949 const Type* t = in2->bottom_type(); 2950 if (t == TypePtr::NULL_PTR) { 2951 assert(in1->is_DecodeN(), "compare klass to null?"); 2952 // Don't convert CmpP null check into CmpN if compressed 2953 // oops implicit null check is not generated. 2954 // This will allow to generate normal oop implicit null check. 2955 if (Matcher::gen_narrow_oop_implicit_null_checks()) 2956 new_in2 = ConNode::make(TypeNarrowOop::NULL_PTR); 2957 // 2958 // This transformation together with CastPP transformation above 2959 // will generated code for implicit NULL checks for compressed oops. 2960 // 2961 // The original code after Optimize() 2962 // 2963 // LoadN memory, narrow_oop_reg 2964 // decode narrow_oop_reg, base_reg 2965 // CmpP base_reg, NULL 2966 // CastPP base_reg // NotNull 2967 // Load [base_reg + offset], val_reg 2968 // 2969 // after these transformations will be 2970 // 2971 // LoadN memory, narrow_oop_reg 2972 // CmpN narrow_oop_reg, NULL 2973 // decode_not_null narrow_oop_reg, base_reg 2974 // Load [base_reg + offset], val_reg 2975 // 2976 // and the uncommon path (== NULL) will use narrow_oop_reg directly 2977 // since narrow oops can be used in debug info now (see the code in 2978 // final_graph_reshaping_walk()). 2979 // 2980 // At the end the code will be matched to 2981 // on x86: 2982 // 2983 // Load_narrow_oop memory, narrow_oop_reg 2984 // Load [R12 + narrow_oop_reg<<3 + offset], val_reg 2985 // NullCheck narrow_oop_reg 2986 // 2987 // and on sparc: 2988 // 2989 // Load_narrow_oop memory, narrow_oop_reg 2990 // decode_not_null narrow_oop_reg, base_reg 2991 // Load [base_reg + offset], val_reg 2992 // NullCheck base_reg 2993 // 2994 } else if (t->isa_oopptr()) { 2995 new_in2 = ConNode::make(t->make_narrowoop()); 2996 } else if (t->isa_klassptr()) { 2997 new_in2 = ConNode::make(t->make_narrowklass()); 2998 } 2999 } 3000 if (new_in2 != NULL) { 3001 Node* cmpN = new CmpNNode(in1->in(1), new_in2); 3002 n->subsume_by(cmpN, this); 3003 if (in1->outcnt() == 0) { 3004 in1->disconnect_inputs(NULL, this); 3005 } 3006 if (in2->outcnt() == 0) { 3007 in2->disconnect_inputs(NULL, this); 3008 } 3009 } 3010 } 3011 break; 3012 3013 case Op_DecodeN: 3014 case Op_DecodeNKlass: 3015 assert(!n->in(1)->is_EncodeNarrowPtr(), "should be optimized out"); 3016 // DecodeN could be pinned when it can't be fold into 3017 // an address expression, see the code for Op_CastPP above. 3018 assert(n->in(0) == NULL || (UseCompressedOops && !Matcher::narrow_oop_use_complex_address()), "no control"); 3019 break; 3020 3021 case Op_EncodeP: 3022 case Op_EncodePKlass: { 3023 Node* in1 = n->in(1); 3024 if (in1->is_DecodeNarrowPtr()) { 3025 n->subsume_by(in1->in(1), this); 3026 } else if (in1->Opcode() == Op_ConP) { 3027 const Type* t = in1->bottom_type(); 3028 if (t == TypePtr::NULL_PTR) { 3029 assert(t->isa_oopptr(), "null klass?"); 3030 n->subsume_by(ConNode::make(TypeNarrowOop::NULL_PTR), this); 3031 } else if (t->isa_oopptr()) { 3032 n->subsume_by(ConNode::make(t->make_narrowoop()), this); 3033 } else if (t->isa_klassptr()) { 3034 n->subsume_by(ConNode::make(t->make_narrowklass()), this); 3035 } 3036 } 3037 if (in1->outcnt() == 0) { 3038 in1->disconnect_inputs(NULL, this); 3039 } 3040 break; 3041 } 3042 3043 case Op_Proj: { 3044 if (OptimizeStringConcat) { 3045 ProjNode* p = n->as_Proj(); 3046 if (p->_is_io_use) { 3047 // Separate projections were used for the exception path which 3048 // are normally removed by a late inline. If it wasn't inlined 3049 // then they will hang around and should just be replaced with 3050 // the original one. 3051 Node* proj = NULL; 3052 // Replace with just one 3053 for (SimpleDUIterator i(p->in(0)); i.has_next(); i.next()) { 3054 Node *use = i.get(); 3055 if (use->is_Proj() && p != use && use->as_Proj()->_con == p->_con) { 3056 proj = use; 3057 break; 3058 } 3059 } 3060 assert(proj != NULL, "must be found"); 3061 p->subsume_by(proj, this); 3062 } 3063 } 3064 break; 3065 } 3066 3067 case Op_Phi: 3068 if (n->as_Phi()->bottom_type()->isa_narrowoop() || n->as_Phi()->bottom_type()->isa_narrowklass()) { 3069 // The EncodeP optimization may create Phi with the same edges 3070 // for all paths. It is not handled well by Register Allocator. 3071 Node* unique_in = n->in(1); 3072 assert(unique_in != NULL, ""); 3073 uint cnt = n->req(); 3074 for (uint i = 2; i < cnt; i++) { 3075 Node* m = n->in(i); 3076 assert(m != NULL, ""); 3077 if (unique_in != m) 3078 unique_in = NULL; 3079 } 3080 if (unique_in != NULL) { 3081 n->subsume_by(unique_in, this); 3082 } 3083 } 3084 break; 3085 3086 #endif 3087 3088 case Op_ModI: 3089 if (UseDivMod) { 3090 // Check if a%b and a/b both exist 3091 Node* d = n->find_similar(Op_DivI); 3092 if (d) { 3093 // Replace them with a fused divmod if supported 3094 if (Matcher::has_match_rule(Op_DivModI)) { 3095 DivModINode* divmod = DivModINode::make(n); 3096 d->subsume_by(divmod->div_proj(), this); 3097 n->subsume_by(divmod->mod_proj(), this); 3098 } else { 3099 // replace a%b with a-((a/b)*b) 3100 Node* mult = new MulINode(d, d->in(2)); 3101 Node* sub = new SubINode(d->in(1), mult); 3102 n->subsume_by(sub, this); 3103 } 3104 } 3105 } 3106 break; 3107 3108 case Op_ModL: 3109 if (UseDivMod) { 3110 // Check if a%b and a/b both exist 3111 Node* d = n->find_similar(Op_DivL); 3112 if (d) { 3113 // Replace them with a fused divmod if supported 3114 if (Matcher::has_match_rule(Op_DivModL)) { 3115 DivModLNode* divmod = DivModLNode::make(n); 3116 d->subsume_by(divmod->div_proj(), this); 3117 n->subsume_by(divmod->mod_proj(), this); 3118 } else { 3119 // replace a%b with a-((a/b)*b) 3120 Node* mult = new MulLNode(d, d->in(2)); 3121 Node* sub = new SubLNode(d->in(1), mult); 3122 n->subsume_by(sub, this); 3123 } 3124 } 3125 } 3126 break; 3127 3128 case Op_LoadVector: 3129 case Op_StoreVector: 3130 break; 3131 3132 case Op_AddReductionVI: 3133 case Op_AddReductionVL: 3134 case Op_AddReductionVF: 3135 case Op_AddReductionVD: 3136 case Op_MulReductionVI: 3137 case Op_MulReductionVL: 3138 case Op_MulReductionVF: 3139 case Op_MulReductionVD: 3140 break; 3141 3142 case Op_PackB: 3143 case Op_PackS: 3144 case Op_PackI: 3145 case Op_PackF: 3146 case Op_PackL: 3147 case Op_PackD: 3148 if (n->req()-1 > 2) { 3149 // Replace many operand PackNodes with a binary tree for matching 3150 PackNode* p = (PackNode*) n; 3151 Node* btp = p->binary_tree_pack(1, n->req()); 3152 n->subsume_by(btp, this); 3153 } 3154 break; 3155 case Op_Loop: 3156 case Op_CountedLoop: 3157 if (n->as_Loop()->is_inner_loop()) { 3158 frc.inc_inner_loop_count(); 3159 } 3160 break; 3161 case Op_LShiftI: 3162 case Op_RShiftI: 3163 case Op_URShiftI: 3164 case Op_LShiftL: 3165 case Op_RShiftL: 3166 case Op_URShiftL: 3167 if (Matcher::need_masked_shift_count) { 3168 // The cpu's shift instructions don't restrict the count to the 3169 // lower 5/6 bits. We need to do the masking ourselves. 3170 Node* in2 = n->in(2); 3171 juint mask = (n->bottom_type() == TypeInt::INT) ? (BitsPerInt - 1) : (BitsPerLong - 1); 3172 const TypeInt* t = in2->find_int_type(); 3173 if (t != NULL && t->is_con()) { 3174 juint shift = t->get_con(); 3175 if (shift > mask) { // Unsigned cmp 3176 n->set_req(2, ConNode::make(TypeInt::make(shift & mask))); 3177 } 3178 } else { 3179 if (t == NULL || t->_lo < 0 || t->_hi > (int)mask) { 3180 Node* shift = new AndINode(in2, ConNode::make(TypeInt::make(mask))); 3181 n->set_req(2, shift); 3182 } 3183 } 3184 if (in2->outcnt() == 0) { // Remove dead node 3185 in2->disconnect_inputs(NULL, this); 3186 } 3187 } 3188 break; 3189 case Op_MemBarStoreStore: 3190 case Op_MemBarRelease: 3191 // Break the link with AllocateNode: it is no longer useful and 3192 // confuses register allocation. 3193 if (n->req() > MemBarNode::Precedent) { 3194 n->set_req(MemBarNode::Precedent, top()); 3195 } 3196 break; 3197 default: 3198 assert( !n->is_Call(), "" ); 3199 assert( !n->is_Mem(), "" ); 3200 assert( nop != Op_ProfileBoolean, "should be eliminated during IGVN"); 3201 break; 3202 } 3203 3204 // Collect CFG split points 3205 if (n->is_MultiBranch()) 3206 frc._tests.push(n); 3207 } 3208 3209 //------------------------------final_graph_reshaping_walk--------------------- 3210 // Replacing Opaque nodes with their input in final_graph_reshaping_impl(), 3211 // requires that the walk visits a node's inputs before visiting the node. 3212 void Compile::final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc ) { 3213 ResourceArea *area = Thread::current()->resource_area(); 3214 Unique_Node_List sfpt(area); 3215 3216 frc._visited.set(root->_idx); // first, mark node as visited 3217 uint cnt = root->req(); 3218 Node *n = root; 3219 uint i = 0; 3220 while (true) { 3221 if (i < cnt) { 3222 // Place all non-visited non-null inputs onto stack 3223 Node* m = n->in(i); 3224 ++i; 3225 if (m != NULL && !frc._visited.test_set(m->_idx)) { 3226 if (m->is_SafePoint() && m->as_SafePoint()->jvms() != NULL) { 3227 // compute worst case interpreter size in case of a deoptimization 3228 update_interpreter_frame_size(m->as_SafePoint()->jvms()->interpreter_frame_size()); 3229 3230 sfpt.push(m); 3231 } 3232 cnt = m->req(); 3233 nstack.push(n, i); // put on stack parent and next input's index 3234 n = m; 3235 i = 0; 3236 } 3237 } else { 3238 // Now do post-visit work 3239 final_graph_reshaping_impl( n, frc ); 3240 if (nstack.is_empty()) 3241 break; // finished 3242 n = nstack.node(); // Get node from stack 3243 cnt = n->req(); 3244 i = nstack.index(); 3245 nstack.pop(); // Shift to the next node on stack 3246 } 3247 } 3248 3249 // Skip next transformation if compressed oops are not used. 3250 if ((UseCompressedOops && !Matcher::gen_narrow_oop_implicit_null_checks()) || 3251 (!UseCompressedOops && !UseCompressedClassPointers)) 3252 return; 3253 3254 // Go over safepoints nodes to skip DecodeN/DecodeNKlass nodes for debug edges. 3255 // It could be done for an uncommon traps or any safepoints/calls 3256 // if the DecodeN/DecodeNKlass node is referenced only in a debug info. 3257 while (sfpt.size() > 0) { 3258 n = sfpt.pop(); 3259 JVMState *jvms = n->as_SafePoint()->jvms(); 3260 assert(jvms != NULL, "sanity"); 3261 int start = jvms->debug_start(); 3262 int end = n->req(); 3263 bool is_uncommon = (n->is_CallStaticJava() && 3264 n->as_CallStaticJava()->uncommon_trap_request() != 0); 3265 for (int j = start; j < end; j++) { 3266 Node* in = n->in(j); 3267 if (in->is_DecodeNarrowPtr()) { 3268 bool safe_to_skip = true; 3269 if (!is_uncommon ) { 3270 // Is it safe to skip? 3271 for (uint i = 0; i < in->outcnt(); i++) { 3272 Node* u = in->raw_out(i); 3273 if (!u->is_SafePoint() || 3274 u->is_Call() && u->as_Call()->has_non_debug_use(n)) { 3275 safe_to_skip = false; 3276 } 3277 } 3278 } 3279 if (safe_to_skip) { 3280 n->set_req(j, in->in(1)); 3281 } 3282 if (in->outcnt() == 0) { 3283 in->disconnect_inputs(NULL, this); 3284 } 3285 } 3286 } 3287 } 3288 } 3289 3290 //------------------------------final_graph_reshaping-------------------------- 3291 // Final Graph Reshaping. 3292 // 3293 // (1) Clone simple inputs to uncommon calls, so they can be scheduled late 3294 // and not commoned up and forced early. Must come after regular 3295 // optimizations to avoid GVN undoing the cloning. Clone constant 3296 // inputs to Loop Phis; these will be split by the allocator anyways. 3297 // Remove Opaque nodes. 3298 // (2) Move last-uses by commutative operations to the left input to encourage 3299 // Intel update-in-place two-address operations and better register usage 3300 // on RISCs. Must come after regular optimizations to avoid GVN Ideal 3301 // calls canonicalizing them back. 3302 // (3) Count the number of double-precision FP ops, single-precision FP ops 3303 // and call sites. On Intel, we can get correct rounding either by 3304 // forcing singles to memory (requires extra stores and loads after each 3305 // FP bytecode) or we can set a rounding mode bit (requires setting and 3306 // clearing the mode bit around call sites). The mode bit is only used 3307 // if the relative frequency of single FP ops to calls is low enough. 3308 // This is a key transform for SPEC mpeg_audio. 3309 // (4) Detect infinite loops; blobs of code reachable from above but not 3310 // below. Several of the Code_Gen algorithms fail on such code shapes, 3311 // so we simply bail out. Happens a lot in ZKM.jar, but also happens 3312 // from time to time in other codes (such as -Xcomp finalizer loops, etc). 3313 // Detection is by looking for IfNodes where only 1 projection is 3314 // reachable from below or CatchNodes missing some targets. 3315 // (5) Assert for insane oop offsets in debug mode. 3316 3317 bool Compile::final_graph_reshaping() { 3318 // an infinite loop may have been eliminated by the optimizer, 3319 // in which case the graph will be empty. 3320 if (root()->req() == 1) { 3321 record_method_not_compilable("trivial infinite loop"); 3322 return true; 3323 } 3324 3325 // Expensive nodes have their control input set to prevent the GVN 3326 // from freely commoning them. There's no GVN beyond this point so 3327 // no need to keep the control input. We want the expensive nodes to 3328 // be freely moved to the least frequent code path by gcm. 3329 assert(OptimizeExpensiveOps || expensive_count() == 0, "optimization off but list non empty?"); 3330 for (int i = 0; i < expensive_count(); i++) { 3331 _expensive_nodes->at(i)->set_req(0, NULL); 3332 } 3333 3334 Final_Reshape_Counts frc; 3335 3336 // Visit everybody reachable! 3337 // Allocate stack of size C->live_nodes()/2 to avoid frequent realloc 3338 Node_Stack nstack(live_nodes() >> 1); 3339 final_graph_reshaping_walk(nstack, root(), frc); 3340 3341 // Check for unreachable (from below) code (i.e., infinite loops). 3342 for( uint i = 0; i < frc._tests.size(); i++ ) { 3343 MultiBranchNode *n = frc._tests[i]->as_MultiBranch(); 3344 // Get number of CFG targets. 3345 // Note that PCTables include exception targets after calls. 3346 uint required_outcnt = n->required_outcnt(); 3347 if (n->outcnt() != required_outcnt) { 3348 // Check for a few special cases. Rethrow Nodes never take the 3349 // 'fall-thru' path, so expected kids is 1 less. 3350 if (n->is_PCTable() && n->in(0) && n->in(0)->in(0)) { 3351 if (n->in(0)->in(0)->is_Call()) { 3352 CallNode *call = n->in(0)->in(0)->as_Call(); 3353 if (call->entry_point() == OptoRuntime::rethrow_stub()) { 3354 required_outcnt--; // Rethrow always has 1 less kid 3355 } else if (call->req() > TypeFunc::Parms && 3356 call->is_CallDynamicJava()) { 3357 // Check for null receiver. In such case, the optimizer has 3358 // detected that the virtual call will always result in a null 3359 // pointer exception. The fall-through projection of this CatchNode 3360 // will not be populated. 3361 Node *arg0 = call->in(TypeFunc::Parms); 3362 if (arg0->is_Type() && 3363 arg0->as_Type()->type()->higher_equal(TypePtr::NULL_PTR)) { 3364 required_outcnt--; 3365 } 3366 } else if (call->entry_point() == OptoRuntime::new_array_Java() && 3367 call->req() > TypeFunc::Parms+1 && 3368 call->is_CallStaticJava()) { 3369 // Check for negative array length. In such case, the optimizer has 3370 // detected that the allocation attempt will always result in an 3371 // exception. There is no fall-through projection of this CatchNode . 3372 Node *arg1 = call->in(TypeFunc::Parms+1); 3373 if (arg1->is_Type() && 3374 arg1->as_Type()->type()->join(TypeInt::POS)->empty()) { 3375 required_outcnt--; 3376 } 3377 } 3378 } 3379 } 3380 // Recheck with a better notion of 'required_outcnt' 3381 if (n->outcnt() != required_outcnt) { 3382 record_method_not_compilable("malformed control flow"); 3383 return true; // Not all targets reachable! 3384 } 3385 } 3386 // Check that I actually visited all kids. Unreached kids 3387 // must be infinite loops. 3388 for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) 3389 if (!frc._visited.test(n->fast_out(j)->_idx)) { 3390 record_method_not_compilable("infinite loop"); 3391 return true; // Found unvisited kid; must be unreach 3392 } 3393 } 3394 3395 // If original bytecodes contained a mixture of floats and doubles 3396 // check if the optimizer has made it homogenous, item (3). 3397 if( Use24BitFPMode && Use24BitFP && UseSSE == 0 && 3398 frc.get_float_count() > 32 && 3399 frc.get_double_count() == 0 && 3400 (10 * frc.get_call_count() < frc.get_float_count()) ) { 3401 set_24_bit_selection_and_mode( false, true ); 3402 } 3403 3404 set_java_calls(frc.get_java_call_count()); 3405 set_inner_loops(frc.get_inner_loop_count()); 3406 3407 // No infinite loops, no reason to bail out. 3408 return false; 3409 } 3410 3411 //-----------------------------too_many_traps---------------------------------- 3412 // Report if there are too many traps at the current method and bci. 3413 // Return true if there was a trap, and/or PerMethodTrapLimit is exceeded. 3414 bool Compile::too_many_traps(ciMethod* method, 3415 int bci, 3416 Deoptimization::DeoptReason reason) { 3417 ciMethodData* md = method->method_data(); 3418 if (md->is_empty()) { 3419 // Assume the trap has not occurred, or that it occurred only 3420 // because of a transient condition during start-up in the interpreter. 3421 return false; 3422 } 3423 ciMethod* m = Deoptimization::reason_is_speculate(reason) ? this->method() : NULL; 3424 if (md->has_trap_at(bci, m, reason) != 0) { 3425 // Assume PerBytecodeTrapLimit==0, for a more conservative heuristic. 3426 // Also, if there are multiple reasons, or if there is no per-BCI record, 3427 // assume the worst. 3428 if (log()) 3429 log()->elem("observe trap='%s' count='%d'", 3430 Deoptimization::trap_reason_name(reason), 3431 md->trap_count(reason)); 3432 return true; 3433 } else { 3434 // Ignore method/bci and see if there have been too many globally. 3435 return too_many_traps(reason, md); 3436 } 3437 } 3438 3439 // Less-accurate variant which does not require a method and bci. 3440 bool Compile::too_many_traps(Deoptimization::DeoptReason reason, 3441 ciMethodData* logmd) { 3442 if (trap_count(reason) >= Deoptimization::per_method_trap_limit(reason)) { 3443 // Too many traps globally. 3444 // Note that we use cumulative trap_count, not just md->trap_count. 3445 if (log()) { 3446 int mcount = (logmd == NULL)? -1: (int)logmd->trap_count(reason); 3447 log()->elem("observe trap='%s' count='0' mcount='%d' ccount='%d'", 3448 Deoptimization::trap_reason_name(reason), 3449 mcount, trap_count(reason)); 3450 } 3451 return true; 3452 } else { 3453 // The coast is clear. 3454 return false; 3455 } 3456 } 3457 3458 //--------------------------too_many_recompiles-------------------------------- 3459 // Report if there are too many recompiles at the current method and bci. 3460 // Consults PerBytecodeRecompilationCutoff and PerMethodRecompilationCutoff. 3461 // Is not eager to return true, since this will cause the compiler to use 3462 // Action_none for a trap point, to avoid too many recompilations. 3463 bool Compile::too_many_recompiles(ciMethod* method, 3464 int bci, 3465 Deoptimization::DeoptReason reason) { 3466 ciMethodData* md = method->method_data(); 3467 if (md->is_empty()) { 3468 // Assume the trap has not occurred, or that it occurred only 3469 // because of a transient condition during start-up in the interpreter. 3470 return false; 3471 } 3472 // Pick a cutoff point well within PerBytecodeRecompilationCutoff. 3473 uint bc_cutoff = (uint) PerBytecodeRecompilationCutoff / 8; 3474 uint m_cutoff = (uint) PerMethodRecompilationCutoff / 2 + 1; // not zero 3475 Deoptimization::DeoptReason per_bc_reason 3476 = Deoptimization::reason_recorded_per_bytecode_if_any(reason); 3477 ciMethod* m = Deoptimization::reason_is_speculate(reason) ? this->method() : NULL; 3478 if ((per_bc_reason == Deoptimization::Reason_none 3479 || md->has_trap_at(bci, m, reason) != 0) 3480 // The trap frequency measure we care about is the recompile count: 3481 && md->trap_recompiled_at(bci, m) 3482 && md->overflow_recompile_count() >= bc_cutoff) { 3483 // Do not emit a trap here if it has already caused recompilations. 3484 // Also, if there are multiple reasons, or if there is no per-BCI record, 3485 // assume the worst. 3486 if (log()) 3487 log()->elem("observe trap='%s recompiled' count='%d' recompiles2='%d'", 3488 Deoptimization::trap_reason_name(reason), 3489 md->trap_count(reason), 3490 md->overflow_recompile_count()); 3491 return true; 3492 } else if (trap_count(reason) != 0 3493 && decompile_count() >= m_cutoff) { 3494 // Too many recompiles globally, and we have seen this sort of trap. 3495 // Use cumulative decompile_count, not just md->decompile_count. 3496 if (log()) 3497 log()->elem("observe trap='%s' count='%d' mcount='%d' decompiles='%d' mdecompiles='%d'", 3498 Deoptimization::trap_reason_name(reason), 3499 md->trap_count(reason), trap_count(reason), 3500 md->decompile_count(), decompile_count()); 3501 return true; 3502 } else { 3503 // The coast is clear. 3504 return false; 3505 } 3506 } 3507 3508 // Compute when not to trap. Used by matching trap based nodes and 3509 // NullCheck optimization. 3510 void Compile::set_allowed_deopt_reasons() { 3511 _allowed_reasons = 0; 3512 if (is_method_compilation()) { 3513 for (int rs = (int)Deoptimization::Reason_none+1; rs < Compile::trapHistLength; rs++) { 3514 assert(rs < BitsPerInt, "recode bit map"); 3515 if (!too_many_traps((Deoptimization::DeoptReason) rs)) { 3516 _allowed_reasons |= nth_bit(rs); 3517 } 3518 } 3519 } 3520 } 3521 3522 #ifndef PRODUCT 3523 //------------------------------verify_graph_edges--------------------------- 3524 // Walk the Graph and verify that there is a one-to-one correspondence 3525 // between Use-Def edges and Def-Use edges in the graph. 3526 void Compile::verify_graph_edges(bool no_dead_code) { 3527 if (VerifyGraphEdges) { 3528 ResourceArea *area = Thread::current()->resource_area(); 3529 Unique_Node_List visited(area); 3530 // Call recursive graph walk to check edges 3531 _root->verify_edges(visited); 3532 if (no_dead_code) { 3533 // Now make sure that no visited node is used by an unvisited node. 3534 bool dead_nodes = false; 3535 Unique_Node_List checked(area); 3536 while (visited.size() > 0) { 3537 Node* n = visited.pop(); 3538 checked.push(n); 3539 for (uint i = 0; i < n->outcnt(); i++) { 3540 Node* use = n->raw_out(i); 3541 if (checked.member(use)) continue; // already checked 3542 if (visited.member(use)) continue; // already in the graph 3543 if (use->is_Con()) continue; // a dead ConNode is OK 3544 // At this point, we have found a dead node which is DU-reachable. 3545 if (!dead_nodes) { 3546 tty->print_cr("*** Dead nodes reachable via DU edges:"); 3547 dead_nodes = true; 3548 } 3549 use->dump(2); 3550 tty->print_cr("---"); 3551 checked.push(use); // No repeats; pretend it is now checked. 3552 } 3553 } 3554 assert(!dead_nodes, "using nodes must be reachable from root"); 3555 } 3556 } 3557 } 3558 3559 // Verify GC barriers consistency 3560 // Currently supported: 3561 // - G1 pre-barriers (see GraphKit::g1_write_barrier_pre()) 3562 void Compile::verify_barriers() { 3563 if (UseG1GC) { 3564 // Verify G1 pre-barriers 3565 const int marking_offset = in_bytes(JavaThread::satb_mark_queue_offset() + PtrQueue::byte_offset_of_active()); 3566 3567 ResourceArea *area = Thread::current()->resource_area(); 3568 Unique_Node_List visited(area); 3569 Node_List worklist(area); 3570 // We're going to walk control flow backwards starting from the Root 3571 worklist.push(_root); 3572 while (worklist.size() > 0) { 3573 Node* x = worklist.pop(); 3574 if (x == NULL || x == top()) continue; 3575 if (visited.member(x)) { 3576 continue; 3577 } else { 3578 visited.push(x); 3579 } 3580 3581 if (x->is_Region()) { 3582 for (uint i = 1; i < x->req(); i++) { 3583 worklist.push(x->in(i)); 3584 } 3585 } else { 3586 worklist.push(x->in(0)); 3587 // We are looking for the pattern: 3588 // /->ThreadLocal 3589 // If->Bool->CmpI->LoadB->AddP->ConL(marking_offset) 3590 // \->ConI(0) 3591 // We want to verify that the If and the LoadB have the same control 3592 // See GraphKit::g1_write_barrier_pre() 3593 if (x->is_If()) { 3594 IfNode *iff = x->as_If(); 3595 if (iff->in(1)->is_Bool() && iff->in(1)->in(1)->is_Cmp()) { 3596 CmpNode *cmp = iff->in(1)->in(1)->as_Cmp(); 3597 if (cmp->Opcode() == Op_CmpI && cmp->in(2)->is_Con() && cmp->in(2)->bottom_type()->is_int()->get_con() == 0 3598 && cmp->in(1)->is_Load()) { 3599 LoadNode* load = cmp->in(1)->as_Load(); 3600 if (load->Opcode() == Op_LoadB && load->in(2)->is_AddP() && load->in(2)->in(2)->Opcode() == Op_ThreadLocal 3601 && load->in(2)->in(3)->is_Con() 3602 && load->in(2)->in(3)->bottom_type()->is_intptr_t()->get_con() == marking_offset) { 3603 3604 Node* if_ctrl = iff->in(0); 3605 Node* load_ctrl = load->in(0); 3606 3607 if (if_ctrl != load_ctrl) { 3608 // Skip possible CProj->NeverBranch in infinite loops 3609 if ((if_ctrl->is_Proj() && if_ctrl->Opcode() == Op_CProj) 3610 && (if_ctrl->in(0)->is_MultiBranch() && if_ctrl->in(0)->Opcode() == Op_NeverBranch)) { 3611 if_ctrl = if_ctrl->in(0)->in(0); 3612 } 3613 } 3614 assert(load_ctrl != NULL && if_ctrl == load_ctrl, "controls must match"); 3615 } 3616 } 3617 } 3618 } 3619 } 3620 } 3621 } 3622 } 3623 3624 #endif 3625 3626 // The Compile object keeps track of failure reasons separately from the ciEnv. 3627 // This is required because there is not quite a 1-1 relation between the 3628 // ciEnv and its compilation task and the Compile object. Note that one 3629 // ciEnv might use two Compile objects, if C2Compiler::compile_method decides 3630 // to backtrack and retry without subsuming loads. Other than this backtracking 3631 // behavior, the Compile's failure reason is quietly copied up to the ciEnv 3632 // by the logic in C2Compiler. 3633 void Compile::record_failure(const char* reason) { 3634 if (log() != NULL) { 3635 log()->elem("failure reason='%s' phase='compile'", reason); 3636 } 3637 if (_failure_reason == NULL) { 3638 // Record the first failure reason. 3639 _failure_reason = reason; 3640 } 3641 3642 if (!C->failure_reason_is(C2Compiler::retry_no_subsuming_loads())) { 3643 C->print_method(PHASE_FAILURE); 3644 } 3645 _root = NULL; // flush the graph, too 3646 } 3647 3648 Compile::TracePhase::TracePhase(const char* name, elapsedTimer* accumulator) 3649 : TraceTime(name, accumulator, CITime, CITimeVerbose), 3650 _phase_name(name), _dolog(CITimeVerbose) 3651 { 3652 if (_dolog) { 3653 C = Compile::current(); 3654 _log = C->log(); 3655 } else { 3656 C = NULL; 3657 _log = NULL; 3658 } 3659 if (_log != NULL) { 3660 _log->begin_head("phase name='%s' nodes='%d' live='%d'", _phase_name, C->unique(), C->live_nodes()); 3661 _log->stamp(); 3662 _log->end_head(); 3663 } 3664 } 3665 3666 Compile::TracePhase::~TracePhase() { 3667 3668 C = Compile::current(); 3669 if (_dolog) { 3670 _log = C->log(); 3671 } else { 3672 _log = NULL; 3673 } 3674 3675 #ifdef ASSERT 3676 if (PrintIdealNodeCount) { 3677 tty->print_cr("phase name='%s' nodes='%d' live='%d' live_graph_walk='%d'", 3678 _phase_name, C->unique(), C->live_nodes(), C->count_live_nodes_by_graph_walk()); 3679 } 3680 3681 if (VerifyIdealNodeCount) { 3682 Compile::current()->print_missing_nodes(); 3683 } 3684 #endif 3685 3686 if (_log != NULL) { 3687 _log->done("phase name='%s' nodes='%d' live='%d'", _phase_name, C->unique(), C->live_nodes()); 3688 } 3689 } 3690 3691 //============================================================================= 3692 // Two Constant's are equal when the type and the value are equal. 3693 bool Compile::Constant::operator==(const Constant& other) { 3694 if (type() != other.type() ) return false; 3695 if (can_be_reused() != other.can_be_reused()) return false; 3696 // For floating point values we compare the bit pattern. 3697 switch (type()) { 3698 case T_FLOAT: return (_v._value.i == other._v._value.i); 3699 case T_LONG: 3700 case T_DOUBLE: return (_v._value.j == other._v._value.j); 3701 case T_OBJECT: 3702 case T_ADDRESS: return (_v._value.l == other._v._value.l); 3703 case T_VOID: return (_v._value.l == other._v._value.l); // jump-table entries 3704 case T_METADATA: return (_v._metadata == other._v._metadata); 3705 default: ShouldNotReachHere(); 3706 } 3707 return false; 3708 } 3709 3710 static int type_to_size_in_bytes(BasicType t) { 3711 switch (t) { 3712 case T_LONG: return sizeof(jlong ); 3713 case T_FLOAT: return sizeof(jfloat ); 3714 case T_DOUBLE: return sizeof(jdouble); 3715 case T_METADATA: return sizeof(Metadata*); 3716 // We use T_VOID as marker for jump-table entries (labels) which 3717 // need an internal word relocation. 3718 case T_VOID: 3719 case T_ADDRESS: 3720 case T_OBJECT: return sizeof(jobject); 3721 } 3722 3723 ShouldNotReachHere(); 3724 return -1; 3725 } 3726 3727 int Compile::ConstantTable::qsort_comparator(Constant* a, Constant* b) { 3728 // sort descending 3729 if (a->freq() > b->freq()) return -1; 3730 if (a->freq() < b->freq()) return 1; 3731 return 0; 3732 } 3733 3734 void Compile::ConstantTable::calculate_offsets_and_size() { 3735 // First, sort the array by frequencies. 3736 _constants.sort(qsort_comparator); 3737 3738 #ifdef ASSERT 3739 // Make sure all jump-table entries were sorted to the end of the 3740 // array (they have a negative frequency). 3741 bool found_void = false; 3742 for (int i = 0; i < _constants.length(); i++) { 3743 Constant con = _constants.at(i); 3744 if (con.type() == T_VOID) 3745 found_void = true; // jump-tables 3746 else 3747 assert(!found_void, "wrong sorting"); 3748 } 3749 #endif 3750 3751 int offset = 0; 3752 for (int i = 0; i < _constants.length(); i++) { 3753 Constant* con = _constants.adr_at(i); 3754 3755 // Align offset for type. 3756 int typesize = type_to_size_in_bytes(con->type()); 3757 offset = align_size_up(offset, typesize); 3758 con->set_offset(offset); // set constant's offset 3759 3760 if (con->type() == T_VOID) { 3761 MachConstantNode* n = (MachConstantNode*) con->get_jobject(); 3762 offset = offset + typesize * n->outcnt(); // expand jump-table 3763 } else { 3764 offset = offset + typesize; 3765 } 3766 } 3767 3768 // Align size up to the next section start (which is insts; see 3769 // CodeBuffer::align_at_start). 3770 assert(_size == -1, "already set?"); 3771 _size = align_size_up(offset, CodeEntryAlignment); 3772 } 3773 3774 void Compile::ConstantTable::emit(CodeBuffer& cb) { 3775 MacroAssembler _masm(&cb); 3776 for (int i = 0; i < _constants.length(); i++) { 3777 Constant con = _constants.at(i); 3778 address constant_addr; 3779 switch (con.type()) { 3780 case T_LONG: constant_addr = _masm.long_constant( con.get_jlong() ); break; 3781 case T_FLOAT: constant_addr = _masm.float_constant( con.get_jfloat() ); break; 3782 case T_DOUBLE: constant_addr = _masm.double_constant(con.get_jdouble()); break; 3783 case T_OBJECT: { 3784 jobject obj = con.get_jobject(); 3785 int oop_index = _masm.oop_recorder()->find_index(obj); 3786 constant_addr = _masm.address_constant((address) obj, oop_Relocation::spec(oop_index)); 3787 break; 3788 } 3789 case T_ADDRESS: { 3790 address addr = (address) con.get_jobject(); 3791 constant_addr = _masm.address_constant(addr); 3792 break; 3793 } 3794 // We use T_VOID as marker for jump-table entries (labels) which 3795 // need an internal word relocation. 3796 case T_VOID: { 3797 MachConstantNode* n = (MachConstantNode*) con.get_jobject(); 3798 // Fill the jump-table with a dummy word. The real value is 3799 // filled in later in fill_jump_table. 3800 address dummy = (address) n; 3801 constant_addr = _masm.address_constant(dummy); 3802 // Expand jump-table 3803 for (uint i = 1; i < n->outcnt(); i++) { 3804 address temp_addr = _masm.address_constant(dummy + i); 3805 assert(temp_addr, "consts section too small"); 3806 } 3807 break; 3808 } 3809 case T_METADATA: { 3810 Metadata* obj = con.get_metadata(); 3811 int metadata_index = _masm.oop_recorder()->find_index(obj); 3812 constant_addr = _masm.address_constant((address) obj, metadata_Relocation::spec(metadata_index)); 3813 break; 3814 } 3815 default: ShouldNotReachHere(); 3816 } 3817 assert(constant_addr, "consts section too small"); 3818 assert((constant_addr - _masm.code()->consts()->start()) == con.offset(), 3819 "must be: %d == %d", (int) (constant_addr - _masm.code()->consts()->start()), (int)(con.offset())); 3820 } 3821 } 3822 3823 int Compile::ConstantTable::find_offset(Constant& con) const { 3824 int idx = _constants.find(con); 3825 assert(idx != -1, "constant must be in constant table"); 3826 int offset = _constants.at(idx).offset(); 3827 assert(offset != -1, "constant table not emitted yet?"); 3828 return offset; 3829 } 3830 3831 void Compile::ConstantTable::add(Constant& con) { 3832 if (con.can_be_reused()) { 3833 int idx = _constants.find(con); 3834 if (idx != -1 && _constants.at(idx).can_be_reused()) { 3835 _constants.adr_at(idx)->inc_freq(con.freq()); // increase the frequency by the current value 3836 return; 3837 } 3838 } 3839 (void) _constants.append(con); 3840 } 3841 3842 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, BasicType type, jvalue value) { 3843 Block* b = Compile::current()->cfg()->get_block_for_node(n); 3844 Constant con(type, value, b->_freq); 3845 add(con); 3846 return con; 3847 } 3848 3849 Compile::Constant Compile::ConstantTable::add(Metadata* metadata) { 3850 Constant con(metadata); 3851 add(con); 3852 return con; 3853 } 3854 3855 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, MachOper* oper) { 3856 jvalue value; 3857 BasicType type = oper->type()->basic_type(); 3858 switch (type) { 3859 case T_LONG: value.j = oper->constantL(); break; 3860 case T_FLOAT: value.f = oper->constantF(); break; 3861 case T_DOUBLE: value.d = oper->constantD(); break; 3862 case T_OBJECT: 3863 case T_ADDRESS: value.l = (jobject) oper->constant(); break; 3864 case T_METADATA: return add((Metadata*)oper->constant()); break; 3865 default: guarantee(false, "unhandled type: %s", type2name(type)); 3866 } 3867 return add(n, type, value); 3868 } 3869 3870 Compile::Constant Compile::ConstantTable::add_jump_table(MachConstantNode* n) { 3871 jvalue value; 3872 // We can use the node pointer here to identify the right jump-table 3873 // as this method is called from Compile::Fill_buffer right before 3874 // the MachNodes are emitted and the jump-table is filled (means the 3875 // MachNode pointers do not change anymore). 3876 value.l = (jobject) n; 3877 Constant con(T_VOID, value, next_jump_table_freq(), false); // Labels of a jump-table cannot be reused. 3878 add(con); 3879 return con; 3880 } 3881 3882 void Compile::ConstantTable::fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const { 3883 // If called from Compile::scratch_emit_size do nothing. 3884 if (Compile::current()->in_scratch_emit_size()) return; 3885 3886 assert(labels.is_nonempty(), "must be"); 3887 assert((uint) labels.length() == n->outcnt(), "must be equal: %d == %d", labels.length(), n->outcnt()); 3888 3889 // Since MachConstantNode::constant_offset() also contains 3890 // table_base_offset() we need to subtract the table_base_offset() 3891 // to get the plain offset into the constant table. 3892 int offset = n->constant_offset() - table_base_offset(); 3893 3894 MacroAssembler _masm(&cb); 3895 address* jump_table_base = (address*) (_masm.code()->consts()->start() + offset); 3896 3897 for (uint i = 0; i < n->outcnt(); i++) { 3898 address* constant_addr = &jump_table_base[i]; 3899 assert(*constant_addr == (((address) n) + i), "all jump-table entries must contain adjusted node pointer: " INTPTR_FORMAT " == " INTPTR_FORMAT, p2i(*constant_addr), p2i(((address) n) + i)); 3900 *constant_addr = cb.consts()->target(*labels.at(i), (address) constant_addr); 3901 cb.consts()->relocate((address) constant_addr, relocInfo::internal_word_type); 3902 } 3903 } 3904 3905 //----------------------------static_subtype_check----------------------------- 3906 // Shortcut important common cases when superklass is exact: 3907 // (0) superklass is java.lang.Object (can occur in reflective code) 3908 // (1) subklass is already limited to a subtype of superklass => always ok 3909 // (2) subklass does not overlap with superklass => always fail 3910 // (3) superklass has NO subtypes and we can check with a simple compare. 3911 int Compile::static_subtype_check(ciKlass* superk, ciKlass* subk) { 3912 if (StressReflectiveCode) { 3913 return SSC_full_test; // Let caller generate the general case. 3914 } 3915 3916 if (superk == env()->Object_klass()) { 3917 return SSC_always_true; // (0) this test cannot fail 3918 } 3919 3920 ciType* superelem = superk; 3921 if (superelem->is_array_klass()) 3922 superelem = superelem->as_array_klass()->base_element_type(); 3923 3924 if (!subk->is_interface()) { // cannot trust static interface types yet 3925 if (subk->is_subtype_of(superk)) { 3926 return SSC_always_true; // (1) false path dead; no dynamic test needed 3927 } 3928 if (!(superelem->is_klass() && superelem->as_klass()->is_interface()) && 3929 !superk->is_subtype_of(subk)) { 3930 return SSC_always_false; 3931 } 3932 } 3933 3934 // If casting to an instance klass, it must have no subtypes 3935 if (superk->is_interface()) { 3936 // Cannot trust interfaces yet. 3937 // %%% S.B. superk->nof_implementors() == 1 3938 } else if (superelem->is_instance_klass()) { 3939 ciInstanceKlass* ik = superelem->as_instance_klass(); 3940 if (!ik->has_subklass() && !ik->is_interface()) { 3941 if (!ik->is_final()) { 3942 // Add a dependency if there is a chance of a later subclass. 3943 dependencies()->assert_leaf_type(ik); 3944 } 3945 return SSC_easy_test; // (3) caller can do a simple ptr comparison 3946 } 3947 } else { 3948 // A primitive array type has no subtypes. 3949 return SSC_easy_test; // (3) caller can do a simple ptr comparison 3950 } 3951 3952 return SSC_full_test; 3953 } 3954 3955 Node* Compile::conv_I2X_index(PhaseGVN *phase, Node* idx, const TypeInt* sizetype) { 3956 #ifdef _LP64 3957 // The scaled index operand to AddP must be a clean 64-bit value. 3958 // Java allows a 32-bit int to be incremented to a negative 3959 // value, which appears in a 64-bit register as a large 3960 // positive number. Using that large positive number as an 3961 // operand in pointer arithmetic has bad consequences. 3962 // On the other hand, 32-bit overflow is rare, and the possibility 3963 // can often be excluded, if we annotate the ConvI2L node with 3964 // a type assertion that its value is known to be a small positive 3965 // number. (The prior range check has ensured this.) 3966 // This assertion is used by ConvI2LNode::Ideal. 3967 int index_max = max_jint - 1; // array size is max_jint, index is one less 3968 if (sizetype != NULL) index_max = sizetype->_hi - 1; 3969 const TypeLong* lidxtype = TypeLong::make(CONST64(0), index_max, Type::WidenMax); 3970 idx = phase->transform(new ConvI2LNode(idx, lidxtype)); 3971 #endif 3972 return idx; 3973 } 3974 3975 // The message about the current inlining is accumulated in 3976 // _print_inlining_stream and transfered into the _print_inlining_list 3977 // once we know whether inlining succeeds or not. For regular 3978 // inlining, messages are appended to the buffer pointed by 3979 // _print_inlining_idx in the _print_inlining_list. For late inlining, 3980 // a new buffer is added after _print_inlining_idx in the list. This 3981 // way we can update the inlining message for late inlining call site 3982 // when the inlining is attempted again. 3983 void Compile::print_inlining_init() { 3984 if (print_inlining() || print_intrinsics()) { 3985 _print_inlining_stream = new stringStream(); 3986 _print_inlining_list = new (comp_arena())GrowableArray<PrintInliningBuffer>(comp_arena(), 1, 1, PrintInliningBuffer()); 3987 } 3988 } 3989 3990 void Compile::print_inlining_reinit() { 3991 if (print_inlining() || print_intrinsics()) { 3992 // Re allocate buffer when we change ResourceMark 3993 _print_inlining_stream = new stringStream(); 3994 } 3995 } 3996 3997 void Compile::print_inlining_reset() { 3998 _print_inlining_stream->reset(); 3999 } 4000 4001 void Compile::print_inlining_commit() { 4002 assert(print_inlining() || print_intrinsics(), "PrintInlining off?"); 4003 // Transfer the message from _print_inlining_stream to the current 4004 // _print_inlining_list buffer and clear _print_inlining_stream. 4005 _print_inlining_list->at(_print_inlining_idx).ss()->write(_print_inlining_stream->as_string(), _print_inlining_stream->size()); 4006 print_inlining_reset(); 4007 } 4008 4009 void Compile::print_inlining_push() { 4010 // Add new buffer to the _print_inlining_list at current position 4011 _print_inlining_idx++; 4012 _print_inlining_list->insert_before(_print_inlining_idx, PrintInliningBuffer()); 4013 } 4014 4015 Compile::PrintInliningBuffer& Compile::print_inlining_current() { 4016 return _print_inlining_list->at(_print_inlining_idx); 4017 } 4018 4019 void Compile::print_inlining_update(CallGenerator* cg) { 4020 if (print_inlining() || print_intrinsics()) { 4021 if (!cg->is_late_inline()) { 4022 if (print_inlining_current().cg() != NULL) { 4023 print_inlining_push(); 4024 } 4025 print_inlining_commit(); 4026 } else { 4027 if (print_inlining_current().cg() != cg && 4028 (print_inlining_current().cg() != NULL || 4029 print_inlining_current().ss()->size() != 0)) { 4030 print_inlining_push(); 4031 } 4032 print_inlining_commit(); 4033 print_inlining_current().set_cg(cg); 4034 } 4035 } 4036 } 4037 4038 void Compile::print_inlining_move_to(CallGenerator* cg) { 4039 // We resume inlining at a late inlining call site. Locate the 4040 // corresponding inlining buffer so that we can update it. 4041 if (print_inlining()) { 4042 for (int i = 0; i < _print_inlining_list->length(); i++) { 4043 if (_print_inlining_list->adr_at(i)->cg() == cg) { 4044 _print_inlining_idx = i; 4045 return; 4046 } 4047 } 4048 ShouldNotReachHere(); 4049 } 4050 } 4051 4052 void Compile::print_inlining_update_delayed(CallGenerator* cg) { 4053 if (print_inlining()) { 4054 assert(_print_inlining_stream->size() > 0, "missing inlining msg"); 4055 assert(print_inlining_current().cg() == cg, "wrong entry"); 4056 // replace message with new message 4057 _print_inlining_list->at_put(_print_inlining_idx, PrintInliningBuffer()); 4058 print_inlining_commit(); 4059 print_inlining_current().set_cg(cg); 4060 } 4061 } 4062 4063 void Compile::print_inlining_assert_ready() { 4064 assert(!_print_inlining || _print_inlining_stream->size() == 0, "loosing data"); 4065 } 4066 4067 void Compile::process_print_inlining() { 4068 bool do_print_inlining = print_inlining() || print_intrinsics(); 4069 if (do_print_inlining || log() != NULL) { 4070 // Print inlining message for candidates that we couldn't inline 4071 // for lack of space 4072 for (int i = 0; i < _late_inlines.length(); i++) { 4073 CallGenerator* cg = _late_inlines.at(i); 4074 if (!cg->is_mh_late_inline()) { 4075 const char* msg = "live nodes > LiveNodeCountInliningCutoff"; 4076 if (do_print_inlining) { 4077 cg->print_inlining_late(msg); 4078 } 4079 log_late_inline_failure(cg, msg); 4080 } 4081 } 4082 } 4083 if (do_print_inlining) { 4084 ResourceMark rm; 4085 stringStream ss; 4086 for (int i = 0; i < _print_inlining_list->length(); i++) { 4087 ss.print("%s", _print_inlining_list->adr_at(i)->ss()->as_string()); 4088 } 4089 size_t end = ss.size(); 4090 _print_inlining_output = NEW_ARENA_ARRAY(comp_arena(), char, end+1); 4091 strncpy(_print_inlining_output, ss.base(), end+1); 4092 _print_inlining_output[end] = 0; 4093 } 4094 } 4095 4096 void Compile::dump_print_inlining() { 4097 if (_print_inlining_output != NULL) { 4098 tty->print_raw(_print_inlining_output); 4099 } 4100 } 4101 4102 void Compile::log_late_inline(CallGenerator* cg) { 4103 if (log() != NULL) { 4104 log()->head("late_inline method='%d' inline_id='" JLONG_FORMAT "'", log()->identify(cg->method()), 4105 cg->unique_id()); 4106 JVMState* p = cg->call_node()->jvms(); 4107 while (p != NULL) { 4108 log()->elem("jvms bci='%d' method='%d'", p->bci(), log()->identify(p->method())); 4109 p = p->caller(); 4110 } 4111 log()->tail("late_inline"); 4112 } 4113 } 4114 4115 void Compile::log_late_inline_failure(CallGenerator* cg, const char* msg) { 4116 log_late_inline(cg); 4117 if (log() != NULL) { 4118 log()->inline_fail(msg); 4119 } 4120 } 4121 4122 void Compile::log_inline_id(CallGenerator* cg) { 4123 if (log() != NULL) { 4124 // The LogCompilation tool needs a unique way to identify late 4125 // inline call sites. This id must be unique for this call site in 4126 // this compilation. Try to have it unique across compilations as 4127 // well because it can be convenient when grepping through the log 4128 // file. 4129 // Distinguish OSR compilations from others in case CICountOSR is 4130 // on. 4131 jlong id = ((jlong)unique()) + (((jlong)compile_id()) << 33) + (CICountOSR && is_osr_compilation() ? ((jlong)1) << 32 : 0); 4132 cg->set_unique_id(id); 4133 log()->elem("inline_id id='" JLONG_FORMAT "'", id); 4134 } 4135 } 4136 4137 void Compile::log_inline_failure(const char* msg) { 4138 if (C->log() != NULL) { 4139 C->log()->inline_fail(msg); 4140 } 4141 } 4142 4143 4144 // Dump inlining replay data to the stream. 4145 // Don't change thread state and acquire any locks. 4146 void Compile::dump_inline_data(outputStream* out) { 4147 InlineTree* inl_tree = ilt(); 4148 if (inl_tree != NULL) { 4149 out->print(" inline %d", inl_tree->count()); 4150 inl_tree->dump_replay_data(out); 4151 } 4152 } 4153 4154 int Compile::cmp_expensive_nodes(Node* n1, Node* n2) { 4155 if (n1->Opcode() < n2->Opcode()) return -1; 4156 else if (n1->Opcode() > n2->Opcode()) return 1; 4157 4158 assert(n1->req() == n2->req(), "can't compare %s nodes: n1->req() = %d, n2->req() = %d", NodeClassNames[n1->Opcode()], n1->req(), n2->req()); 4159 for (uint i = 1; i < n1->req(); i++) { 4160 if (n1->in(i) < n2->in(i)) return -1; 4161 else if (n1->in(i) > n2->in(i)) return 1; 4162 } 4163 4164 return 0; 4165 } 4166 4167 int Compile::cmp_expensive_nodes(Node** n1p, Node** n2p) { 4168 Node* n1 = *n1p; 4169 Node* n2 = *n2p; 4170 4171 return cmp_expensive_nodes(n1, n2); 4172 } 4173 4174 void Compile::sort_expensive_nodes() { 4175 if (!expensive_nodes_sorted()) { 4176 _expensive_nodes->sort(cmp_expensive_nodes); 4177 } 4178 } 4179 4180 bool Compile::expensive_nodes_sorted() const { 4181 for (int i = 1; i < _expensive_nodes->length(); i++) { 4182 if (cmp_expensive_nodes(_expensive_nodes->adr_at(i), _expensive_nodes->adr_at(i-1)) < 0) { 4183 return false; 4184 } 4185 } 4186 return true; 4187 } 4188 4189 bool Compile::should_optimize_expensive_nodes(PhaseIterGVN &igvn) { 4190 if (_expensive_nodes->length() == 0) { 4191 return false; 4192 } 4193 4194 assert(OptimizeExpensiveOps, "optimization off?"); 4195 4196 // Take this opportunity to remove dead nodes from the list 4197 int j = 0; 4198 for (int i = 0; i < _expensive_nodes->length(); i++) { 4199 Node* n = _expensive_nodes->at(i); 4200 if (!n->is_unreachable(igvn)) { 4201 assert(n->is_expensive(), "should be expensive"); 4202 _expensive_nodes->at_put(j, n); 4203 j++; 4204 } 4205 } 4206 _expensive_nodes->trunc_to(j); 4207 4208 // Then sort the list so that similar nodes are next to each other 4209 // and check for at least two nodes of identical kind with same data 4210 // inputs. 4211 sort_expensive_nodes(); 4212 4213 for (int i = 0; i < _expensive_nodes->length()-1; i++) { 4214 if (cmp_expensive_nodes(_expensive_nodes->adr_at(i), _expensive_nodes->adr_at(i+1)) == 0) { 4215 return true; 4216 } 4217 } 4218 4219 return false; 4220 } 4221 4222 void Compile::cleanup_expensive_nodes(PhaseIterGVN &igvn) { 4223 if (_expensive_nodes->length() == 0) { 4224 return; 4225 } 4226 4227 assert(OptimizeExpensiveOps, "optimization off?"); 4228 4229 // Sort to bring similar nodes next to each other and clear the 4230 // control input of nodes for which there's only a single copy. 4231 sort_expensive_nodes(); 4232 4233 int j = 0; 4234 int identical = 0; 4235 int i = 0; 4236 bool modified = false; 4237 for (; i < _expensive_nodes->length()-1; i++) { 4238 assert(j <= i, "can't write beyond current index"); 4239 if (_expensive_nodes->at(i)->Opcode() == _expensive_nodes->at(i+1)->Opcode()) { 4240 identical++; 4241 _expensive_nodes->at_put(j++, _expensive_nodes->at(i)); 4242 continue; 4243 } 4244 if (identical > 0) { 4245 _expensive_nodes->at_put(j++, _expensive_nodes->at(i)); 4246 identical = 0; 4247 } else { 4248 Node* n = _expensive_nodes->at(i); 4249 igvn.replace_input_of(n, 0, NULL); 4250 igvn.hash_insert(n); 4251 modified = true; 4252 } 4253 } 4254 if (identical > 0) { 4255 _expensive_nodes->at_put(j++, _expensive_nodes->at(i)); 4256 } else if (_expensive_nodes->length() >= 1) { 4257 Node* n = _expensive_nodes->at(i); 4258 igvn.replace_input_of(n, 0, NULL); 4259 igvn.hash_insert(n); 4260 modified = true; 4261 } 4262 _expensive_nodes->trunc_to(j); 4263 if (modified) { 4264 igvn.optimize(); 4265 } 4266 } 4267 4268 void Compile::add_expensive_node(Node * n) { 4269 assert(!_expensive_nodes->contains(n), "duplicate entry in expensive list"); 4270 assert(n->is_expensive(), "expensive nodes with non-null control here only"); 4271 assert(!n->is_CFG() && !n->is_Mem(), "no cfg or memory nodes here"); 4272 if (OptimizeExpensiveOps) { 4273 _expensive_nodes->append(n); 4274 } else { 4275 // Clear control input and let IGVN optimize expensive nodes if 4276 // OptimizeExpensiveOps is off. 4277 n->set_req(0, NULL); 4278 } 4279 } 4280 4281 /** 4282 * Remove the speculative part of types and clean up the graph 4283 */ 4284 void Compile::remove_speculative_types(PhaseIterGVN &igvn) { 4285 if (UseTypeSpeculation) { 4286 Unique_Node_List worklist; 4287 worklist.push(root()); 4288 int modified = 0; 4289 // Go over all type nodes that carry a speculative type, drop the 4290 // speculative part of the type and enqueue the node for an igvn 4291 // which may optimize it out. 4292 for (uint next = 0; next < worklist.size(); ++next) { 4293 Node *n = worklist.at(next); 4294 if (n->is_Type()) { 4295 TypeNode* tn = n->as_Type(); 4296 const Type* t = tn->type(); 4297 const Type* t_no_spec = t->remove_speculative(); 4298 if (t_no_spec != t) { 4299 bool in_hash = igvn.hash_delete(n); 4300 assert(in_hash, "node should be in igvn hash table"); 4301 tn->set_type(t_no_spec); 4302 igvn.hash_insert(n); 4303 igvn._worklist.push(n); // give it a chance to go away 4304 modified++; 4305 } 4306 } 4307 uint max = n->len(); 4308 for( uint i = 0; i < max; ++i ) { 4309 Node *m = n->in(i); 4310 if (not_a_node(m)) continue; 4311 worklist.push(m); 4312 } 4313 } 4314 // Drop the speculative part of all types in the igvn's type table 4315 igvn.remove_speculative_types(); 4316 if (modified > 0) { 4317 igvn.optimize(); 4318 } 4319 #ifdef ASSERT 4320 // Verify that after the IGVN is over no speculative type has resurfaced 4321 worklist.clear(); 4322 worklist.push(root()); 4323 for (uint next = 0; next < worklist.size(); ++next) { 4324 Node *n = worklist.at(next); 4325 const Type* t = igvn.type_or_null(n); 4326 assert((t == NULL) || (t == t->remove_speculative()), "no more speculative types"); 4327 if (n->is_Type()) { 4328 t = n->as_Type()->type(); 4329 assert(t == t->remove_speculative(), "no more speculative types"); 4330 } 4331 uint max = n->len(); 4332 for( uint i = 0; i < max; ++i ) { 4333 Node *m = n->in(i); 4334 if (not_a_node(m)) continue; 4335 worklist.push(m); 4336 } 4337 } 4338 igvn.check_no_speculative_types(); 4339 #endif 4340 } 4341 } 4342 4343 // Auxiliary method to support randomized stressing/fuzzing. 4344 // 4345 // This method can be called the arbitrary number of times, with current count 4346 // as the argument. The logic allows selecting a single candidate from the 4347 // running list of candidates as follows: 4348 // int count = 0; 4349 // Cand* selected = null; 4350 // while(cand = cand->next()) { 4351 // if (randomized_select(++count)) { 4352 // selected = cand; 4353 // } 4354 // } 4355 // 4356 // Including count equalizes the chances any candidate is "selected". 4357 // This is useful when we don't have the complete list of candidates to choose 4358 // from uniformly. In this case, we need to adjust the randomicity of the 4359 // selection, or else we will end up biasing the selection towards the latter 4360 // candidates. 4361 // 4362 // Quick back-envelope calculation shows that for the list of n candidates 4363 // the equal probability for the candidate to persist as "best" can be 4364 // achieved by replacing it with "next" k-th candidate with the probability 4365 // of 1/k. It can be easily shown that by the end of the run, the 4366 // probability for any candidate is converged to 1/n, thus giving the 4367 // uniform distribution among all the candidates. 4368 // 4369 // We don't care about the domain size as long as (RANDOMIZED_DOMAIN / count) is large. 4370 #define RANDOMIZED_DOMAIN_POW 29 4371 #define RANDOMIZED_DOMAIN (1 << RANDOMIZED_DOMAIN_POW) 4372 #define RANDOMIZED_DOMAIN_MASK ((1 << (RANDOMIZED_DOMAIN_POW + 1)) - 1) 4373 bool Compile::randomized_select(int count) { 4374 assert(count > 0, "only positive"); 4375 return (os::random() & RANDOMIZED_DOMAIN_MASK) < (RANDOMIZED_DOMAIN / count); 4376 } 4377 4378 CloneMap& Compile::clone_map() { return _clone_map; } 4379 void Compile::set_clone_map(Dict* d) { _clone_map._dict = d; } 4380 4381 void NodeCloneInfo::dump() const { 4382 tty->print(" {%d:%d} ", idx(), gen()); 4383 } 4384 4385 void CloneMap::clone(Node* old, Node* nnn, int gen) { 4386 uint64_t val = value(old->_idx); 4387 NodeCloneInfo cio(val); 4388 assert(val != 0, "old node should be in the map"); 4389 NodeCloneInfo cin(cio.idx(), gen + cio.gen()); 4390 insert(nnn->_idx, cin.get()); 4391 #ifndef PRODUCT 4392 if (is_debug()) { 4393 tty->print_cr("CloneMap::clone inserted node %d info {%d:%d} into CloneMap", nnn->_idx, cin.idx(), cin.gen()); 4394 } 4395 #endif 4396 } 4397 4398 void CloneMap::verify_insert_and_clone(Node* old, Node* nnn, int gen) { 4399 NodeCloneInfo cio(value(old->_idx)); 4400 if (cio.get() == 0) { 4401 cio.set(old->_idx, 0); 4402 insert(old->_idx, cio.get()); 4403 #ifndef PRODUCT 4404 if (is_debug()) { 4405 tty->print_cr("CloneMap::verify_insert_and_clone inserted node %d info {%d:%d} into CloneMap", old->_idx, cio.idx(), cio.gen()); 4406 } 4407 #endif 4408 } 4409 clone(old, nnn, gen); 4410 } 4411 4412 int CloneMap::max_gen() const { 4413 int g = 0; 4414 DictI di(_dict); 4415 for(; di.test(); ++di) { 4416 int t = gen(di._key); 4417 if (g < t) { 4418 g = t; 4419 #ifndef PRODUCT 4420 if (is_debug()) { 4421 tty->print_cr("CloneMap::max_gen() update max=%d from %d", g, _2_node_idx_t(di._key)); 4422 } 4423 #endif 4424 } 4425 } 4426 return g; 4427 } 4428 4429 void CloneMap::dump(node_idx_t key) const { 4430 uint64_t val = value(key); 4431 if (val != 0) { 4432 NodeCloneInfo ni(val); 4433 ni.dump(); 4434 } 4435 }