1 /*
2 * Copyright (c) 1997, 2026, 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 "asm/macroAssembler.hpp"
26 #include "asm/macroAssembler.inline.hpp"
27 #include "ci/ciReplay.hpp"
28 #include "classfile/javaClasses.hpp"
29 #include "code/aotCodeCache.hpp"
30 #include "code/exceptionHandlerTable.hpp"
31 #include "code/nmethod.hpp"
32 #include "compiler/compilationFailureInfo.hpp"
33 #include "compiler/compilationMemoryStatistic.hpp"
34 #include "compiler/compileBroker.hpp"
35 #include "compiler/compileLog.hpp"
36 #include "compiler/compiler_globals.hpp"
37 #include "compiler/compilerDefinitions.hpp"
38 #include "compiler/compilerOracle.hpp"
39 #include "compiler/disassembler.hpp"
40 #include "compiler/oopMap.hpp"
41 #include "gc/shared/barrierSet.hpp"
42 #include "gc/shared/c2/barrierSetC2.hpp"
43 #include "jfr/jfrEvents.hpp"
44 #include "jvm_io.h"
45 #include "memory/allocation.hpp"
46 #include "memory/arena.hpp"
47 #include "memory/resourceArea.hpp"
48 #include "opto/addnode.hpp"
49 #include "opto/block.hpp"
50 #include "opto/c2compiler.hpp"
51 #include "opto/callGenerator.hpp"
52 #include "opto/callnode.hpp"
53 #include "opto/castnode.hpp"
54 #include "opto/cfgnode.hpp"
55 #include "opto/chaitin.hpp"
56 #include "opto/compile.hpp"
57 #include "opto/connode.hpp"
58 #include "opto/convertnode.hpp"
59 #include "opto/divnode.hpp"
60 #include "opto/escape.hpp"
61 #include "opto/idealGraphPrinter.hpp"
62 #include "opto/locknode.hpp"
63 #include "opto/loopnode.hpp"
64 #include "opto/machnode.hpp"
65 #include "opto/macro.hpp"
66 #include "opto/matcher.hpp"
67 #include "opto/mathexactnode.hpp"
68 #include "opto/memnode.hpp"
69 #include "opto/mulnode.hpp"
70 #include "opto/narrowptrnode.hpp"
71 #include "opto/node.hpp"
72 #include "opto/opaquenode.hpp"
73 #include "opto/opcodes.hpp"
74 #include "opto/output.hpp"
75 #include "opto/parse.hpp"
76 #include "opto/phaseX.hpp"
77 #include "opto/rootnode.hpp"
78 #include "opto/runtime.hpp"
79 #include "opto/stringopts.hpp"
80 #include "opto/type.hpp"
81 #include "opto/vector.hpp"
82 #include "opto/vectornode.hpp"
83 #include "runtime/globals_extension.hpp"
84 #include "runtime/sharedRuntime.hpp"
85 #include "runtime/signature.hpp"
86 #include "runtime/stubRoutines.hpp"
87 #include "runtime/timer.hpp"
88 #include "utilities/align.hpp"
89 #include "utilities/copy.hpp"
90 #include "utilities/hashTable.hpp"
91 #include "utilities/macros.hpp"
92
93 // -------------------- Compile::mach_constant_base_node -----------------------
94 // Constant table base node singleton.
95 MachConstantBaseNode* Compile::mach_constant_base_node() {
96 if (_mach_constant_base_node == nullptr) {
97 _mach_constant_base_node = new MachConstantBaseNode();
98 _mach_constant_base_node->add_req(C->root());
99 }
100 return _mach_constant_base_node;
101 }
102
103
104 /// Support for intrinsics.
105
106 // Return the index at which m must be inserted (or already exists).
107 // The sort order is by the address of the ciMethod, with is_virtual as minor key.
108 class IntrinsicDescPair {
109 private:
110 ciMethod* _m;
111 bool _is_virtual;
112 public:
113 IntrinsicDescPair(ciMethod* m, bool is_virtual) : _m(m), _is_virtual(is_virtual) {}
114 static int compare(IntrinsicDescPair* const& key, CallGenerator* const& elt) {
115 ciMethod* m= elt->method();
116 ciMethod* key_m = key->_m;
117 if (key_m < m) return -1;
118 else if (key_m > m) return 1;
119 else {
120 bool is_virtual = elt->is_virtual();
121 bool key_virtual = key->_is_virtual;
122 if (key_virtual < is_virtual) return -1;
123 else if (key_virtual > is_virtual) return 1;
124 else return 0;
125 }
126 }
127 };
128 int Compile::intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found) {
129 #ifdef ASSERT
130 for (int i = 1; i < _intrinsics.length(); i++) {
131 CallGenerator* cg1 = _intrinsics.at(i-1);
132 CallGenerator* cg2 = _intrinsics.at(i);
133 assert(cg1->method() != cg2->method()
134 ? cg1->method() < cg2->method()
135 : cg1->is_virtual() < cg2->is_virtual(),
136 "compiler intrinsics list must stay sorted");
137 }
138 #endif
139 IntrinsicDescPair pair(m, is_virtual);
140 return _intrinsics.find_sorted<IntrinsicDescPair*, IntrinsicDescPair::compare>(&pair, found);
141 }
142
143 void Compile::register_intrinsic(CallGenerator* cg) {
144 bool found = false;
145 int index = intrinsic_insertion_index(cg->method(), cg->is_virtual(), found);
146 assert(!found, "registering twice");
147 _intrinsics.insert_before(index, cg);
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.length() > 0) {
154 bool found = false;
155 int index = intrinsic_insertion_index(m, is_virtual, found);
156 if (found) {
157 return _intrinsics.at(index);
158 }
159 }
160 // Lazily create intrinsics for intrinsic IDs well-known in the runtime.
161 if (m->intrinsic_id() != vmIntrinsics::_none &&
162 m->intrinsic_id() <= vmIntrinsics::LAST_COMPILER_INLINE) {
163 CallGenerator* cg = make_vm_intrinsic(m, is_virtual);
164 if (cg != nullptr) {
165 // Save it for next time:
166 register_intrinsic(cg);
167 return cg;
168 } else {
169 gather_intrinsic_statistics(m->intrinsic_id(), is_virtual, _intrinsic_disabled);
170 }
171 }
172 return nullptr;
173 }
174
175 // Compile::make_vm_intrinsic is defined in library_call.cpp.
176
177 #ifndef PRODUCT
178 // statistics gathering...
179
180 juint Compile::_intrinsic_hist_count[vmIntrinsics::number_of_intrinsics()] = {0};
181 jubyte Compile::_intrinsic_hist_flags[vmIntrinsics::number_of_intrinsics()] = {0};
182
183 inline int as_int(vmIntrinsics::ID id) {
184 return vmIntrinsics::as_int(id);
185 }
186
187 bool Compile::gather_intrinsic_statistics(vmIntrinsics::ID id, bool is_virtual, int flags) {
188 assert(id > vmIntrinsics::_none && id < vmIntrinsics::ID_LIMIT, "oob");
189 int oflags = _intrinsic_hist_flags[as_int(id)];
190 assert(flags != 0, "what happened?");
191 if (is_virtual) {
192 flags |= _intrinsic_virtual;
193 }
194 bool changed = (flags != oflags);
195 if ((flags & _intrinsic_worked) != 0) {
196 juint count = (_intrinsic_hist_count[as_int(id)] += 1);
197 if (count == 1) {
198 changed = true; // first time
199 }
200 // increment the overall count also:
201 _intrinsic_hist_count[as_int(vmIntrinsics::_none)] += 1;
202 }
203 if (changed) {
204 if (((oflags ^ flags) & _intrinsic_virtual) != 0) {
205 // Something changed about the intrinsic's virtuality.
206 if ((flags & _intrinsic_virtual) != 0) {
207 // This is the first use of this intrinsic as a virtual call.
208 if (oflags != 0) {
209 // We already saw it as a non-virtual, so note both cases.
210 flags |= _intrinsic_both;
211 }
212 } else if ((oflags & _intrinsic_both) == 0) {
213 // This is the first use of this intrinsic as a non-virtual
214 flags |= _intrinsic_both;
215 }
216 }
217 _intrinsic_hist_flags[as_int(id)] = (jubyte) (oflags | flags);
218 }
219 // update the overall flags also:
220 _intrinsic_hist_flags[as_int(vmIntrinsics::_none)] |= (jubyte) flags;
221 return changed;
222 }
223
224 static char* format_flags(int flags, char* buf) {
225 buf[0] = 0;
226 if ((flags & Compile::_intrinsic_worked) != 0) strcat(buf, ",worked");
227 if ((flags & Compile::_intrinsic_failed) != 0) strcat(buf, ",failed");
228 if ((flags & Compile::_intrinsic_disabled) != 0) strcat(buf, ",disabled");
229 if ((flags & Compile::_intrinsic_virtual) != 0) strcat(buf, ",virtual");
230 if ((flags & Compile::_intrinsic_both) != 0) strcat(buf, ",nonvirtual");
231 if (buf[0] == 0) strcat(buf, ",");
232 assert(buf[0] == ',', "must be");
233 return &buf[1];
234 }
235
236 void Compile::print_intrinsic_statistics() {
237 char flagsbuf[100];
238 ttyLocker ttyl;
239 if (xtty != nullptr) xtty->head("statistics type='intrinsic'");
240 tty->print_cr("Compiler intrinsic usage:");
241 juint total = _intrinsic_hist_count[as_int(vmIntrinsics::_none)];
242 if (total == 0) total = 1; // avoid div0 in case of no successes
243 #define PRINT_STAT_LINE(name, c, f) \
244 tty->print_cr(" %4d (%4.1f%%) %s (%s)", (int)(c), ((c) * 100.0) / total, name, f);
245 for (auto id : EnumRange<vmIntrinsicID>{}) {
246 int flags = _intrinsic_hist_flags[as_int(id)];
247 juint count = _intrinsic_hist_count[as_int(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[as_int(vmIntrinsics::_none)], flagsbuf));
253 if (xtty != nullptr) xtty->tail("statistics");
254 }
255
256 void Compile::print_statistics() {
257 { ttyLocker ttyl;
258 if (xtty != nullptr) xtty->head("statistics type='opto'");
259 Parse::print_statistics();
260 PhaseStringOpts::print_statistics();
261 PhaseCCP::print_statistics();
262 PhaseRegAlloc::print_statistics();
263 PhaseOutput::print_statistics();
264 PhasePeephole::print_statistics();
265 PhaseIdealLoop::print_statistics();
266 ConnectionGraph::print_statistics();
267 PhaseMacroExpand::print_statistics();
268 if (xtty != nullptr) xtty->tail("statistics");
269 }
270 if (_intrinsic_hist_flags[as_int(vmIntrinsics::_none)] != 0) {
271 // put this under its own <statistics> element.
272 print_intrinsic_statistics();
273 }
274 }
275 #endif //PRODUCT
276
277 void Compile::gvn_replace_by(Node* n, Node* nn) {
278 for (DUIterator_Last imin, i = n->last_outs(imin); i >= imin; ) {
279 Node* use = n->last_out(i);
280 bool is_in_table = initial_gvn()->hash_delete(use);
281 uint uses_found = 0;
282 for (uint j = 0; j < use->len(); j++) {
283 if (use->in(j) == n) {
284 if (j < use->req())
285 use->set_req(j, nn);
286 else
287 use->set_prec(j, nn);
288 uses_found++;
289 }
290 }
291 if (is_in_table) {
292 // reinsert into table
293 initial_gvn()->hash_find_insert(use);
294 }
295 record_for_igvn(use);
296 PhaseIterGVN::add_users_of_use_to_worklist(nn, use, *_igvn_worklist);
297 i -= uses_found; // we deleted 1 or more copies of this edge
298 }
299 }
300
301
302 // Identify all nodes that are reachable from below, useful.
303 // Use breadth-first pass that records state in a Unique_Node_List,
304 // recursive traversal is slower.
305 void Compile::identify_useful_nodes(Unique_Node_List &useful) {
306 int estimated_worklist_size = live_nodes();
307 useful.map( estimated_worklist_size, nullptr ); // preallocate space
308
309 // Initialize worklist
310 if (root() != nullptr) { useful.push(root()); }
311 // If 'top' is cached, declare it useful to preserve cached node
312 if (cached_top_node()) { useful.push(cached_top_node()); }
313
314 // Push all useful nodes onto the list, breadthfirst
315 for( uint next = 0; next < useful.size(); ++next ) {
316 assert( next < unique(), "Unique useful nodes < total nodes");
317 Node *n = useful.at(next);
318 uint max = n->len();
319 for( uint i = 0; i < max; ++i ) {
320 Node *m = n->in(i);
321 if (not_a_node(m)) continue;
322 useful.push(m);
323 }
324 }
325 }
326
327 // Update dead_node_list with any missing dead nodes using useful
328 // list. Consider all non-useful nodes to be useless i.e., dead nodes.
329 void Compile::update_dead_node_list(Unique_Node_List &useful) {
330 uint max_idx = unique();
331 VectorSet& useful_node_set = useful.member_set();
332
333 for (uint node_idx = 0; node_idx < max_idx; node_idx++) {
334 // If node with index node_idx is not in useful set,
335 // mark it as dead in dead node list.
336 if (!useful_node_set.test(node_idx)) {
337 record_dead_node(node_idx);
338 }
339 }
340 }
341
342 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) {
343 int shift = 0;
344 for (int i = 0; i < inlines->length(); i++) {
345 CallGenerator* cg = inlines->at(i);
346 if (useful.member(cg->call_node())) {
347 if (shift > 0) {
348 inlines->at_put(i - shift, cg);
349 }
350 } else {
351 shift++; // skip over the dead element
352 }
353 }
354 if (shift > 0) {
355 inlines->trunc_to(inlines->length() - shift); // remove last elements from compacted array
356 }
357 }
358
359 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Node* dead) {
360 assert(dead != nullptr && dead->is_Call(), "sanity");
361 int found = 0;
362 for (int i = 0; i < inlines->length(); i++) {
363 if (inlines->at(i)->call_node() == dead) {
364 inlines->remove_at(i);
365 found++;
366 NOT_DEBUG( break; ) // elements are unique, so exit early
367 }
368 }
369 assert(found <= 1, "not unique");
370 }
371
372 template<typename N, ENABLE_IF_SDEFN(std::is_base_of<Node, N>::value)>
373 void Compile::remove_useless_nodes(GrowableArray<N*>& node_list, Unique_Node_List& useful) {
374 for (int i = node_list.length() - 1; i >= 0; i--) {
375 N* node = node_list.at(i);
376 if (!useful.member(node)) {
377 node_list.delete_at(i); // replaces i-th with last element which is known to be useful (already processed)
378 }
379 }
380 }
381
382 void Compile::remove_useless_node(Node* dead) {
383 remove_modified_node(dead);
384
385 // Constant node that has no out-edges and has only one in-edge from
386 // root is usually dead. However, sometimes reshaping walk makes
387 // it reachable by adding use edges. So, we will NOT count Con nodes
388 // as dead to be conservative about the dead node count at any
389 // given time.
390 if (!dead->is_Con()) {
391 record_dead_node(dead->_idx);
392 }
393 if (dead->is_macro()) {
394 remove_macro_node(dead);
395 }
396 if (dead->is_expensive()) {
397 remove_expensive_node(dead);
398 }
399 if (dead->is_OpaqueTemplateAssertionPredicate()) {
400 remove_template_assertion_predicate_opaque(dead->as_OpaqueTemplateAssertionPredicate());
401 }
402 if (dead->is_ParsePredicate()) {
403 remove_parse_predicate(dead->as_ParsePredicate());
404 }
405 if (dead->for_post_loop_opts_igvn()) {
406 remove_from_post_loop_opts_igvn(dead);
407 }
408 if (dead->for_merge_stores_igvn()) {
409 remove_from_merge_stores_igvn(dead);
410 }
411 if (dead->is_Call()) {
412 remove_useless_late_inlines( &_late_inlines, dead);
413 remove_useless_late_inlines( &_string_late_inlines, dead);
414 remove_useless_late_inlines( &_boxing_late_inlines, dead);
415 remove_useless_late_inlines(&_vector_reboxing_late_inlines, dead);
416
417 if (dead->is_CallStaticJava()) {
418 remove_unstable_if_trap(dead->as_CallStaticJava(), false);
419 }
420 }
421 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
422 bs->unregister_potential_barrier_node(dead);
423 }
424
425 // Disconnect all useless nodes by disconnecting those at the boundary.
426 void Compile::disconnect_useless_nodes(Unique_Node_List& useful, Unique_Node_List& worklist, const Unique_Node_List* root_and_safepoints) {
427 uint next = 0;
428 while (next < useful.size()) {
429 Node *n = useful.at(next++);
430 if (n->is_SafePoint()) {
431 // We're done with a parsing phase. Replaced nodes are not valid
432 // beyond that point.
433 n->as_SafePoint()->delete_replaced_nodes();
434 }
435 // Use raw traversal of out edges since this code removes out edges
436 int max = n->outcnt();
437 for (int j = 0; j < max; ++j) {
438 Node* child = n->raw_out(j);
439 if (!useful.member(child)) {
440 assert(!child->is_top() || child != top(),
441 "If top is cached in Compile object it is in useful list");
442 // Only need to remove this out-edge to the useless node
443 n->raw_del_out(j);
444 --j;
445 --max;
446 if (child->is_data_proj_of_pure_function(n)) {
447 worklist.push(n);
448 }
449 }
450 }
451 if (n->outcnt() == 1 && n->has_special_unique_user()) {
452 assert(useful.member(n->unique_out()), "do not push a useless node");
453 worklist.push(n->unique_out());
454 }
455 }
456
457 remove_useless_nodes(_macro_nodes, useful); // remove useless macro nodes
458 remove_useless_nodes(_parse_predicates, useful); // remove useless Parse Predicate nodes
459 // Remove useless Template Assertion Predicate opaque nodes
460 remove_useless_nodes(_template_assertion_predicate_opaques, useful);
461 remove_useless_nodes(_expensive_nodes, useful); // remove useless expensive nodes
462 remove_useless_nodes(_for_post_loop_igvn, useful); // remove useless node recorded for post loop opts IGVN pass
463 remove_useless_nodes(_for_merge_stores_igvn, useful); // remove useless node recorded for merge stores IGVN pass
464 remove_useless_unstable_if_traps(useful); // remove useless unstable_if traps
465 remove_useless_coarsened_locks(useful); // remove useless coarsened locks nodes
466 #ifdef ASSERT
467 if (_modified_nodes != nullptr) {
468 _modified_nodes->remove_useless_nodes(useful.member_set());
469 }
470 #endif
471
472 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
473 bs->eliminate_useless_gc_barriers(useful, this);
474 // clean up the late inline lists
475 remove_useless_late_inlines( &_late_inlines, useful);
476 remove_useless_late_inlines( &_string_late_inlines, useful);
477 remove_useless_late_inlines( &_boxing_late_inlines, useful);
478 remove_useless_late_inlines(&_vector_reboxing_late_inlines, useful);
479 DEBUG_ONLY(verify_graph_edges(true /*check for no_dead_code*/, root_and_safepoints);)
480 }
481
482 // ============================================================================
483 //------------------------------CompileWrapper---------------------------------
484 class CompileWrapper : public StackObj {
485 Compile *const _compile;
486 public:
487 CompileWrapper(Compile* compile);
488
489 ~CompileWrapper();
490 };
491
492 CompileWrapper::CompileWrapper(Compile* compile) : _compile(compile) {
493 // the Compile* pointer is stored in the current ciEnv:
494 ciEnv* env = compile->env();
495 assert(env == ciEnv::current(), "must already be a ciEnv active");
496 assert(env->compiler_data() == nullptr, "compile already active?");
497 env->set_compiler_data(compile);
498 assert(compile == Compile::current(), "sanity");
499
500 compile->set_type_dict(nullptr);
501 compile->set_clone_map(new Dict(cmpkey, hashkey, _compile->comp_arena()));
502 compile->clone_map().set_clone_idx(0);
503 compile->set_type_last_size(0);
504 compile->set_last_tf(nullptr, nullptr);
505 compile->set_indexSet_arena(nullptr);
506 compile->set_indexSet_free_block_list(nullptr);
507 compile->init_type_arena();
508 Type::Initialize(compile);
509 _compile->begin_method();
510 _compile->clone_map().set_debug(_compile->has_method() && _compile->directive()->CloneMapDebugOption);
511 }
512 CompileWrapper::~CompileWrapper() {
513 // simulate crash during compilation
514 assert(CICrashAt < 0 || _compile->compile_id() != CICrashAt, "just as planned");
515
516 _compile->end_method();
517 _compile->env()->set_compiler_data(nullptr);
518 }
519
520
521 //----------------------------print_compile_messages---------------------------
522 void Compile::print_compile_messages() {
523 #ifndef PRODUCT
524 // Check if recompiling
525 if (!subsume_loads() && PrintOpto) {
526 // Recompiling without allowing machine instructions to subsume loads
527 tty->print_cr("*********************************************************");
528 tty->print_cr("** Bailout: Recompile without subsuming loads **");
529 tty->print_cr("*********************************************************");
530 }
531 if ((do_escape_analysis() != DoEscapeAnalysis) && PrintOpto) {
532 // Recompiling without escape analysis
533 tty->print_cr("*********************************************************");
534 tty->print_cr("** Bailout: Recompile without escape analysis **");
535 tty->print_cr("*********************************************************");
536 }
537 if (do_iterative_escape_analysis() != DoEscapeAnalysis && PrintOpto) {
538 // Recompiling without iterative escape analysis
539 tty->print_cr("*********************************************************");
540 tty->print_cr("** Bailout: Recompile without iterative escape analysis**");
541 tty->print_cr("*********************************************************");
542 }
543 if (do_reduce_allocation_merges() != ReduceAllocationMerges && PrintOpto) {
544 // Recompiling without reducing allocation merges
545 tty->print_cr("*********************************************************");
546 tty->print_cr("** Bailout: Recompile without reduce allocation merges **");
547 tty->print_cr("*********************************************************");
548 }
549 if ((eliminate_boxing() != EliminateAutoBox) && PrintOpto) {
550 // Recompiling without boxing elimination
551 tty->print_cr("*********************************************************");
552 tty->print_cr("** Bailout: Recompile without boxing elimination **");
553 tty->print_cr("*********************************************************");
554 }
555 if ((do_locks_coarsening() != EliminateLocks) && PrintOpto) {
556 // Recompiling without locks coarsening
557 tty->print_cr("*********************************************************");
558 tty->print_cr("** Bailout: Recompile without locks coarsening **");
559 tty->print_cr("*********************************************************");
560 }
561 if (env()->break_at_compile()) {
562 // Open the debugger when compiling this method.
563 tty->print("### Breaking when compiling: ");
564 method()->print_short_name();
565 tty->cr();
566 BREAKPOINT;
567 }
568
569 if( PrintOpto ) {
570 if (is_osr_compilation()) {
571 tty->print("[OSR]%3d", _compile_id);
572 } else {
573 tty->print("%3d", _compile_id);
574 }
575 }
576 #endif
577 }
578
579 #ifndef PRODUCT
580 void Compile::print_phase(const char* phase_name) {
581 tty->print_cr("%u.\t%s", ++_phase_counter, phase_name);
582 }
583
584 void Compile::print_ideal_ir(const char* compile_phase_name) const {
585 // keep the following output all in one block
586 // This output goes directly to the tty, not the compiler log.
587 // To enable tools to match it up with the compilation activity,
588 // be sure to tag this tty output with the compile ID.
589
590 // Node dumping can cause a safepoint, which can break the tty lock.
591 // Buffer all node dumps, so that all safepoints happen before we lock.
592 ResourceMark rm;
593 stringStream ss;
594
595 if (_output == nullptr) {
596 ss.print_cr("AFTER: %s", compile_phase_name);
597 // Print out all nodes in ascending order of index.
598 // It is important that we traverse both inputs and outputs of nodes,
599 // so that we reach all nodes that are connected to Root.
600 root()->dump_bfs(MaxNodeLimit, nullptr, "-+S$", &ss);
601 } else {
602 // Dump the node blockwise if we have a scheduling
603 _output->print_scheduling(&ss);
604 }
605
606 // Check that the lock is not broken by a safepoint.
607 NoSafepointVerifier nsv;
608 ttyLocker ttyl;
609 if (xtty != nullptr) {
610 xtty->head("ideal compile_id='%d'%s compile_phase='%s'",
611 compile_id(),
612 is_osr_compilation() ? " compile_kind='osr'" : "",
613 compile_phase_name);
614 }
615
616 tty->print("%s", ss.as_string());
617
618 if (xtty != nullptr) {
619 xtty->tail("ideal");
620 }
621 }
622 #endif
623
624 // ============================================================================
625 //------------------------------Compile standard-------------------------------
626
627 // Compile a method. entry_bci is -1 for normal compilations and indicates
628 // the continuation bci for on stack replacement.
629
630
631 Compile::Compile(ciEnv* ci_env, ciMethod* target, int osr_bci,
632 Options options, DirectiveSet* directive)
633 : Phase(Compiler),
634 _compile_id(ci_env->compile_id()),
635 _options(options),
636 _method(target),
637 _entry_bci(osr_bci),
638 _ilt(nullptr),
639 _stub_function(nullptr),
640 _stub_name(nullptr),
641 _stub_id(StubId::NO_STUBID),
642 _stub_entry_point(nullptr),
643 _max_node_limit(MaxNodeLimit),
644 _post_loop_opts_phase(false),
645 _merge_stores_phase(false),
646 _allow_macro_nodes(true),
647 _inlining_progress(false),
648 _inlining_incrementally(false),
649 _do_cleanup(false),
650 _has_reserved_stack_access(target->has_reserved_stack_access()),
651 #ifndef PRODUCT
652 _igv_idx(0),
653 _trace_opto_output(directive->TraceOptoOutputOption),
654 #endif
655 _clinit_barrier_on_entry(false),
656 _stress_seed(0),
657 _comp_arena(mtCompiler, Arena::Tag::tag_comp),
658 _barrier_set_state(BarrierSet::barrier_set()->barrier_set_c2()->create_barrier_state(comp_arena())),
659 _env(ci_env),
660 _directive(directive),
661 _log(ci_env->log()),
662 _first_failure_details(nullptr),
663 _intrinsics(comp_arena(), 0, 0, nullptr),
664 _macro_nodes(comp_arena(), 8, 0, nullptr),
665 _parse_predicates(comp_arena(), 8, 0, nullptr),
666 _template_assertion_predicate_opaques(comp_arena(), 8, 0, nullptr),
667 _expensive_nodes(comp_arena(), 8, 0, nullptr),
668 _for_post_loop_igvn(comp_arena(), 8, 0, nullptr),
669 _for_merge_stores_igvn(comp_arena(), 8, 0, nullptr),
670 _unstable_if_traps(comp_arena(), 8, 0, nullptr),
671 _coarsened_locks(comp_arena(), 8, 0, nullptr),
672 _congraph(nullptr),
673 NOT_PRODUCT(_igv_printer(nullptr) COMMA)
674 _unique(0),
675 _dead_node_count(0),
676 _dead_node_list(comp_arena()),
677 _node_arena_one(mtCompiler, Arena::Tag::tag_node),
678 _node_arena_two(mtCompiler, Arena::Tag::tag_node),
679 _node_arena(&_node_arena_one),
680 _mach_constant_base_node(nullptr),
681 _Compile_types(mtCompiler, Arena::Tag::tag_type),
682 _initial_gvn(nullptr),
683 _igvn_worklist(nullptr),
684 _types(nullptr),
685 _node_hash(nullptr),
686 _late_inlines(comp_arena(), 2, 0, nullptr),
687 _string_late_inlines(comp_arena(), 2, 0, nullptr),
688 _boxing_late_inlines(comp_arena(), 2, 0, nullptr),
689 _vector_reboxing_late_inlines(comp_arena(), 2, 0, nullptr),
690 _late_inlines_pos(0),
691 _has_mh_late_inlines(false),
692 _oom(false),
693 _replay_inline_data(nullptr),
694 _inline_printer(this),
695 _java_calls(0),
696 _inner_loops(0),
697 _FIRST_STACK_mask(comp_arena()),
698 _interpreter_frame_size(0),
699 _regmask_arena(mtCompiler, Arena::Tag::tag_regmask),
700 _output(nullptr)
701 #ifndef PRODUCT
702 ,
703 _in_dump_cnt(0)
704 #endif
705 {
706 C = this;
707 CompileWrapper cw(this);
708
709 TraceTime t1("Total compilation time", &_t_totalCompilation, CITime, CITimeVerbose);
710 TraceTime t2(nullptr, &_t_methodCompilation, CITime, false);
711
712 #if defined(SUPPORT_ASSEMBLY) || defined(SUPPORT_ABSTRACT_ASSEMBLY)
713 bool print_opto_assembly = directive->PrintOptoAssemblyOption;
714 // We can always print a disassembly, either abstract (hex dump) or
715 // with the help of a suitable hsdis library. Thus, we should not
716 // couple print_assembly and print_opto_assembly controls.
717 // But: always print opto and regular assembly on compile command 'print'.
718 bool print_assembly = directive->PrintAssemblyOption;
719 set_print_assembly(print_opto_assembly || print_assembly);
720 #else
721 set_print_assembly(false); // must initialize.
722 #endif
723
724 #ifndef PRODUCT
725 set_parsed_irreducible_loop(false);
726 #endif
727
728 if (directive->ReplayInlineOption) {
729 _replay_inline_data = ciReplay::load_inline_data(method(), entry_bci(), ci_env->comp_level());
730 }
731 set_print_inlining(directive->PrintInliningOption || PrintOptoInlining);
732 set_print_intrinsics(directive->PrintIntrinsicsOption);
733 set_has_irreducible_loop(true); // conservative until build_loop_tree() reset it
734
735 if (ProfileTraps) {
736 // Make sure the method being compiled gets its own MDO,
737 // so we can at least track the decompile_count().
738 method()->ensure_method_data();
739 }
740
741 if (StressLCM || StressGCM || StressIGVN || StressCCP ||
742 StressIncrementalInlining || StressMacroExpansion ||
743 StressMacroElimination || StressUnstableIfTraps ||
744 StressBailout || StressLoopPeeling) {
745 initialize_stress_seed(directive);
746 }
747
748 Init(/*do_aliasing=*/ true);
749
750 print_compile_messages();
751
752 _ilt = InlineTree::build_inline_tree_root();
753
754 // Even if NO memory addresses are used, MergeMem nodes must have at least 1 slice
755 assert(num_alias_types() >= AliasIdxRaw, "");
756
757 #define MINIMUM_NODE_HASH 1023
758
759 // GVN that will be run immediately on new nodes
760 uint estimated_size = method()->code_size()*4+64;
761 estimated_size = (estimated_size < MINIMUM_NODE_HASH ? MINIMUM_NODE_HASH : estimated_size);
762 _igvn_worklist = new (comp_arena()) Unique_Node_List(comp_arena());
763 _types = new (comp_arena()) Type_Array(comp_arena());
764 _node_hash = new (comp_arena()) NodeHash(comp_arena(), estimated_size);
765 PhaseGVN gvn;
766 set_initial_gvn(&gvn);
767
768 { // Scope for timing the parser
769 TracePhase tp(_t_parser);
770
771 // Put top into the hash table ASAP.
772 initial_gvn()->transform(top());
773
774 // Set up tf(), start(), and find a CallGenerator.
775 CallGenerator* cg = nullptr;
776 if (is_osr_compilation()) {
777 const TypeTuple *domain = StartOSRNode::osr_domain();
778 const TypeTuple *range = TypeTuple::make_range(method()->signature());
779 init_tf(TypeFunc::make(domain, range));
780 StartNode* s = new StartOSRNode(root(), domain);
781 initial_gvn()->set_type_bottom(s);
782 verify_start(s);
783 cg = CallGenerator::for_osr(method(), entry_bci());
784 } else {
785 // Normal case.
786 init_tf(TypeFunc::make(method()));
787 StartNode* s = new StartNode(root(), tf()->domain());
788 initial_gvn()->set_type_bottom(s);
789 verify_start(s);
790 float past_uses = method()->interpreter_invocation_count();
791 float expected_uses = past_uses;
792 cg = CallGenerator::for_inline(method(), expected_uses);
793 }
794 if (failing()) return;
795 if (cg == nullptr) {
796 const char* reason = InlineTree::check_can_parse(method());
797 assert(reason != nullptr, "expect reason for parse failure");
798 stringStream ss;
799 ss.print("cannot parse method: %s", reason);
800 record_method_not_compilable(ss.as_string());
801 return;
802 }
803
804 gvn.set_type(root(), root()->bottom_type());
805
806 JVMState* jvms = build_start_state(start(), tf());
807 if ((jvms = cg->generate(jvms)) == nullptr) {
808 assert(failure_reason() != nullptr, "expect reason for parse failure");
809 stringStream ss;
810 ss.print("method parse failed: %s", failure_reason());
811 record_method_not_compilable(ss.as_string() DEBUG_ONLY(COMMA true));
812 return;
813 }
814 GraphKit kit(jvms);
815
816 if (!kit.stopped()) {
817 // Accept return values, and transfer control we know not where.
818 // This is done by a special, unique ReturnNode bound to root.
819 return_values(kit.jvms());
820 }
821
822 if (kit.has_exceptions()) {
823 // Any exceptions that escape from this call must be rethrown
824 // to whatever caller is dynamically above us on the stack.
825 // This is done by a special, unique RethrowNode bound to root.
826 rethrow_exceptions(kit.transfer_exceptions_into_jvms());
827 }
828
829 assert(IncrementalInline || (_late_inlines.length() == 0 && !has_mh_late_inlines()), "incremental inlining is off");
830
831 if (_late_inlines.length() == 0 && !has_mh_late_inlines() && !failing() && has_stringbuilder()) {
832 inline_string_calls(true);
833 }
834
835 if (failing()) return;
836
837 // Remove clutter produced by parsing.
838 if (!failing()) {
839 ResourceMark rm;
840 PhaseRemoveUseless pru(initial_gvn(), *igvn_worklist());
841 }
842 }
843
844 // Note: Large methods are capped off in do_one_bytecode().
845 if (failing()) return;
846
847 // After parsing, node notes are no longer automagic.
848 // They must be propagated by register_new_node_with_optimizer(),
849 // clone(), or the like.
850 set_default_node_notes(nullptr);
851
852 #ifndef PRODUCT
853 if (should_print_igv(1)) {
854 _igv_printer->print_inlining();
855 }
856 #endif
857
858 if (failing()) return;
859 NOT_PRODUCT( verify_graph_edges(); )
860
861 // Now optimize
862 Optimize();
863 if (failing()) return;
864 NOT_PRODUCT( verify_graph_edges(); )
865
866 #ifndef PRODUCT
867 if (should_print_ideal()) {
868 print_ideal_ir("PrintIdeal");
869 }
870 #endif
871
872 #ifdef ASSERT
873 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
874 bs->verify_gc_barriers(this, BarrierSetC2::BeforeCodeGen);
875 #endif
876
877 // Dump compilation data to replay it.
878 if (directive->DumpReplayOption) {
879 env()->dump_replay_data(_compile_id);
880 }
881 if (directive->DumpInlineOption && (ilt() != nullptr)) {
882 env()->dump_inline_data(_compile_id);
883 }
884
885 // Now that we know the size of all the monitors we can add a fixed slot
886 // for the original deopt pc.
887 int next_slot = fixed_slots() + (sizeof(address) / VMRegImpl::stack_slot_size);
888 set_fixed_slots(next_slot);
889
890 // Compute when to use implicit null checks. Used by matching trap based
891 // nodes and NullCheck optimization.
892 set_allowed_deopt_reasons();
893
894 // Now generate code
895 Code_Gen();
896 }
897
898 //------------------------------Compile----------------------------------------
899 // Compile a runtime stub
900 Compile::Compile(ciEnv* ci_env,
901 TypeFunc_generator generator,
902 address stub_function,
903 const char* stub_name,
904 StubId stub_id,
905 int is_fancy_jump,
906 bool pass_tls,
907 bool return_pc,
908 DirectiveSet* directive)
909 : Phase(Compiler),
910 _compile_id(0),
911 _options(Options::for_runtime_stub()),
912 _method(nullptr),
913 _entry_bci(InvocationEntryBci),
914 _stub_function(stub_function),
915 _stub_name(stub_name),
916 _stub_id(stub_id),
917 _stub_entry_point(nullptr),
918 _max_node_limit(MaxNodeLimit),
919 _post_loop_opts_phase(false),
920 _merge_stores_phase(false),
921 _allow_macro_nodes(true),
922 _inlining_progress(false),
923 _inlining_incrementally(false),
924 _has_reserved_stack_access(false),
925 #ifndef PRODUCT
926 _igv_idx(0),
927 _trace_opto_output(directive->TraceOptoOutputOption),
928 #endif
929 _clinit_barrier_on_entry(false),
930 _stress_seed(0),
931 _comp_arena(mtCompiler, Arena::Tag::tag_comp),
932 _barrier_set_state(BarrierSet::barrier_set()->barrier_set_c2()->create_barrier_state(comp_arena())),
933 _env(ci_env),
934 _directive(directive),
935 _log(ci_env->log()),
936 _first_failure_details(nullptr),
937 _for_post_loop_igvn(comp_arena(), 8, 0, nullptr),
938 _for_merge_stores_igvn(comp_arena(), 8, 0, nullptr),
939 _congraph(nullptr),
940 NOT_PRODUCT(_igv_printer(nullptr) COMMA)
941 _unique(0),
942 _dead_node_count(0),
943 _dead_node_list(comp_arena()),
944 _node_arena_one(mtCompiler, Arena::Tag::tag_node),
945 _node_arena_two(mtCompiler, Arena::Tag::tag_node),
946 _node_arena(&_node_arena_one),
947 _mach_constant_base_node(nullptr),
948 _Compile_types(mtCompiler, Arena::Tag::tag_type),
949 _initial_gvn(nullptr),
950 _igvn_worklist(nullptr),
951 _types(nullptr),
952 _node_hash(nullptr),
953 _has_mh_late_inlines(false),
954 _oom(false),
955 _replay_inline_data(nullptr),
956 _inline_printer(this),
957 _java_calls(0),
958 _inner_loops(0),
959 _FIRST_STACK_mask(comp_arena()),
960 _interpreter_frame_size(0),
961 _regmask_arena(mtCompiler, Arena::Tag::tag_regmask),
962 _output(nullptr),
963 #ifndef PRODUCT
964 _in_dump_cnt(0),
965 #endif
966 _allowed_reasons(0) {
967 C = this;
968
969 // try to reuse an existing stub
970 {
971 BlobId blob_id = StubInfo::blob(_stub_id);
972 CodeBlob* blob = AOTCodeCache::load_code_blob(AOTCodeEntry::C2Blob, blob_id);
973 if (blob != nullptr) {
974 RuntimeStub* rs = blob->as_runtime_stub();
975 _stub_entry_point = rs->entry_point();
976 return;
977 }
978 }
979
980 TraceTime t1(nullptr, &_t_totalCompilation, CITime, false);
981 TraceTime t2(nullptr, &_t_stubCompilation, CITime, false);
982
983 #ifndef PRODUCT
984 set_print_assembly(PrintFrameConverterAssembly);
985 set_parsed_irreducible_loop(false);
986 #else
987 set_print_assembly(false); // Must initialize.
988 #endif
989 set_has_irreducible_loop(false); // no loops
990
991 CompileWrapper cw(this);
992 Init(/*do_aliasing=*/ false);
993 init_tf((*generator)());
994
995 _igvn_worklist = new (comp_arena()) Unique_Node_List(comp_arena());
996 _types = new (comp_arena()) Type_Array(comp_arena());
997 _node_hash = new (comp_arena()) NodeHash(comp_arena(), 255);
998
999 if (StressLCM || StressGCM || StressBailout) {
1000 initialize_stress_seed(directive);
1001 }
1002
1003 {
1004 PhaseGVN gvn;
1005 set_initial_gvn(&gvn); // not significant, but GraphKit guys use it pervasively
1006 gvn.transform(top());
1007
1008 GraphKit kit;
1009 kit.gen_stub(stub_function, stub_name, is_fancy_jump, pass_tls, return_pc);
1010 }
1011
1012 NOT_PRODUCT( verify_graph_edges(); )
1013
1014 Code_Gen();
1015 }
1016
1017 Compile::~Compile() {
1018 delete _first_failure_details;
1019 };
1020
1021 //------------------------------Init-------------------------------------------
1022 // Prepare for a single compilation
1023 void Compile::Init(bool aliasing) {
1024 _do_aliasing = aliasing;
1025 _unique = 0;
1026 _regalloc = nullptr;
1027
1028 _tf = nullptr; // filled in later
1029 _top = nullptr; // cached later
1030 _matcher = nullptr; // filled in later
1031 _cfg = nullptr; // filled in later
1032
1033 _node_note_array = nullptr;
1034 _default_node_notes = nullptr;
1035 DEBUG_ONLY( _modified_nodes = nullptr; ) // Used in Optimize()
1036
1037 _immutable_memory = nullptr; // filled in at first inquiry
1038
1039 #ifdef ASSERT
1040 _phase_optimize_finished = false;
1041 _phase_verify_ideal_loop = false;
1042 _exception_backedge = false;
1043 _type_verify = nullptr;
1044 #endif
1045
1046 // Globally visible Nodes
1047 // First set TOP to null to give safe behavior during creation of RootNode
1048 set_cached_top_node(nullptr);
1049 set_root(new RootNode());
1050 // Now that you have a Root to point to, create the real TOP
1051 set_cached_top_node( new ConNode(Type::TOP) );
1052 set_recent_alloc(nullptr, nullptr);
1053
1054 // Create Debug Information Recorder to record scopes, oopmaps, etc.
1055 env()->set_oop_recorder(new OopRecorder(env()->arena()));
1056 env()->set_debug_info(new DebugInformationRecorder(env()->oop_recorder()));
1057 env()->set_dependencies(new Dependencies(env()));
1058
1059 _fixed_slots = 0;
1060 set_has_split_ifs(false);
1061 set_has_loops(false); // first approximation
1062 set_has_stringbuilder(false);
1063 set_has_boxed_value(false);
1064 _trap_can_recompile = false; // no traps emitted yet
1065 _major_progress = true; // start out assuming good things will happen
1066 set_has_unsafe_access(false);
1067 set_max_vector_size(0);
1068 set_clear_upper_avx(false); //false as default for clear upper bits of ymm registers
1069 Copy::zero_to_bytes(_trap_hist, sizeof(_trap_hist));
1070 set_decompile_count(0);
1071
1072 #ifndef PRODUCT
1073 _phase_counter = 0;
1074 Copy::zero_to_bytes(_igv_phase_iter, sizeof(_igv_phase_iter));
1075 #endif
1076
1077 set_do_freq_based_layout(_directive->BlockLayoutByFrequencyOption);
1078 _loop_opts_cnt = LoopOptsCount;
1079 set_do_inlining(Inline);
1080 set_max_inline_size(MaxInlineSize);
1081 set_freq_inline_size(FreqInlineSize);
1082 set_do_scheduling(OptoScheduling);
1083
1084 set_do_vector_loop(false);
1085 set_has_monitors(false);
1086 set_has_scoped_access(false);
1087
1088 if (AllowVectorizeOnDemand) {
1089 if (has_method() && _directive->VectorizeOption) {
1090 set_do_vector_loop(true);
1091 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());})
1092 } else if (has_method() && method()->name() != nullptr &&
1093 method()->intrinsic_id() == vmIntrinsics::_forEachRemaining) {
1094 set_do_vector_loop(true);
1095 }
1096 }
1097 set_use_cmove(UseCMoveUnconditionally /* || do_vector_loop()*/); //TODO: consider do_vector_loop() mandate use_cmove unconditionally
1098 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());})
1099
1100 _max_node_limit = _directive->MaxNodeLimitOption;
1101
1102 if (VM_Version::supports_fast_class_init_checks() && has_method() && !is_osr_compilation() && method()->needs_clinit_barrier()) {
1103 set_clinit_barrier_on_entry(true);
1104 }
1105 if (debug_info()->recording_non_safepoints()) {
1106 set_node_note_array(new(comp_arena()) GrowableArray<Node_Notes*>
1107 (comp_arena(), 8, 0, nullptr));
1108 set_default_node_notes(Node_Notes::make(this));
1109 }
1110
1111 const int grow_ats = 16;
1112 _max_alias_types = grow_ats;
1113 _alias_types = NEW_ARENA_ARRAY(comp_arena(), AliasType*, grow_ats);
1114 AliasType* ats = NEW_ARENA_ARRAY(comp_arena(), AliasType, grow_ats);
1115 Copy::zero_to_bytes(ats, sizeof(AliasType)*grow_ats);
1116 {
1117 for (int i = 0; i < grow_ats; i++) _alias_types[i] = &ats[i];
1118 }
1119 // Initialize the first few types.
1120 _alias_types[AliasIdxTop]->Init(AliasIdxTop, nullptr);
1121 _alias_types[AliasIdxBot]->Init(AliasIdxBot, TypePtr::BOTTOM);
1122 _alias_types[AliasIdxRaw]->Init(AliasIdxRaw, TypeRawPtr::BOTTOM);
1123 _num_alias_types = AliasIdxRaw+1;
1124 // Zero out the alias type cache.
1125 Copy::zero_to_bytes(_alias_cache, sizeof(_alias_cache));
1126 // A null adr_type hits in the cache right away. Preload the right answer.
1127 probe_alias_cache(nullptr)->_index = AliasIdxTop;
1128 }
1129
1130 #ifdef ASSERT
1131 // Verify that the current StartNode is valid.
1132 void Compile::verify_start(StartNode* s) const {
1133 assert(failing_internal() || s == start(), "should be StartNode");
1134 }
1135 #endif
1136
1137 /**
1138 * Return the 'StartNode'. We must not have a pending failure, since the ideal graph
1139 * can be in an inconsistent state, i.e., we can get segmentation faults when traversing
1140 * the ideal graph.
1141 */
1142 StartNode* Compile::start() const {
1143 assert (!failing_internal() || C->failure_is_artificial(), "Must not have pending failure. Reason is: %s", failure_reason());
1144 for (DUIterator_Fast imax, i = root()->fast_outs(imax); i < imax; i++) {
1145 Node* start = root()->fast_out(i);
1146 if (start->is_Start()) {
1147 return start->as_Start();
1148 }
1149 }
1150 fatal("Did not find Start node!");
1151 return nullptr;
1152 }
1153
1154 //-------------------------------immutable_memory-------------------------------------
1155 // Access immutable memory
1156 Node* Compile::immutable_memory() {
1157 if (_immutable_memory != nullptr) {
1158 return _immutable_memory;
1159 }
1160 StartNode* s = start();
1161 for (DUIterator_Fast imax, i = s->fast_outs(imax); true; i++) {
1162 Node *p = s->fast_out(i);
1163 if (p != s && p->as_Proj()->_con == TypeFunc::Memory) {
1164 _immutable_memory = p;
1165 return _immutable_memory;
1166 }
1167 }
1168 ShouldNotReachHere();
1169 return nullptr;
1170 }
1171
1172 //----------------------set_cached_top_node------------------------------------
1173 // Install the cached top node, and make sure Node::is_top works correctly.
1174 void Compile::set_cached_top_node(Node* tn) {
1175 if (tn != nullptr) verify_top(tn);
1176 Node* old_top = _top;
1177 _top = tn;
1178 // Calling Node::setup_is_top allows the nodes the chance to adjust
1179 // their _out arrays.
1180 if (_top != nullptr) _top->setup_is_top();
1181 if (old_top != nullptr) old_top->setup_is_top();
1182 assert(_top == nullptr || top()->is_top(), "");
1183 }
1184
1185 #ifdef ASSERT
1186 uint Compile::count_live_nodes_by_graph_walk() {
1187 Unique_Node_List useful(comp_arena());
1188 // Get useful node list by walking the graph.
1189 identify_useful_nodes(useful);
1190 return useful.size();
1191 }
1192
1193 void Compile::print_missing_nodes() {
1194
1195 // Return if CompileLog is null and PrintIdealNodeCount is false.
1196 if ((_log == nullptr) && (! PrintIdealNodeCount)) {
1197 return;
1198 }
1199
1200 // This is an expensive function. It is executed only when the user
1201 // specifies VerifyIdealNodeCount option or otherwise knows the
1202 // additional work that needs to be done to identify reachable nodes
1203 // by walking the flow graph and find the missing ones using
1204 // _dead_node_list.
1205
1206 Unique_Node_List useful(comp_arena());
1207 // Get useful node list by walking the graph.
1208 identify_useful_nodes(useful);
1209
1210 uint l_nodes = C->live_nodes();
1211 uint l_nodes_by_walk = useful.size();
1212
1213 if (l_nodes != l_nodes_by_walk) {
1214 if (_log != nullptr) {
1215 _log->begin_head("mismatched_nodes count='%d'", abs((int) (l_nodes - l_nodes_by_walk)));
1216 _log->stamp();
1217 _log->end_head();
1218 }
1219 VectorSet& useful_member_set = useful.member_set();
1220 int last_idx = l_nodes_by_walk;
1221 for (int i = 0; i < last_idx; i++) {
1222 if (useful_member_set.test(i)) {
1223 if (_dead_node_list.test(i)) {
1224 if (_log != nullptr) {
1225 _log->elem("mismatched_node_info node_idx='%d' type='both live and dead'", i);
1226 }
1227 if (PrintIdealNodeCount) {
1228 // Print the log message to tty
1229 tty->print_cr("mismatched_node idx='%d' both live and dead'", i);
1230 useful.at(i)->dump();
1231 }
1232 }
1233 }
1234 else if (! _dead_node_list.test(i)) {
1235 if (_log != nullptr) {
1236 _log->elem("mismatched_node_info node_idx='%d' type='neither live nor dead'", i);
1237 }
1238 if (PrintIdealNodeCount) {
1239 // Print the log message to tty
1240 tty->print_cr("mismatched_node idx='%d' type='neither live nor dead'", i);
1241 }
1242 }
1243 }
1244 if (_log != nullptr) {
1245 _log->tail("mismatched_nodes");
1246 }
1247 }
1248 }
1249 void Compile::record_modified_node(Node* n) {
1250 if (_modified_nodes != nullptr && !_inlining_incrementally && !n->is_Con()) {
1251 _modified_nodes->push(n);
1252 }
1253 }
1254
1255 void Compile::remove_modified_node(Node* n) {
1256 if (_modified_nodes != nullptr) {
1257 _modified_nodes->remove(n);
1258 }
1259 }
1260 #endif
1261
1262 #ifndef PRODUCT
1263 void Compile::verify_top(Node* tn) const {
1264 if (tn != nullptr) {
1265 assert(tn->is_Con(), "top node must be a constant");
1266 assert(((ConNode*)tn)->type() == Type::TOP, "top node must have correct type");
1267 assert(tn->in(0) != nullptr, "must have live top node");
1268 }
1269 }
1270 #endif
1271
1272
1273 ///-------------------Managing Per-Node Debug & Profile Info-------------------
1274
1275 void Compile::grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by) {
1276 guarantee(arr != nullptr, "");
1277 int num_blocks = arr->length();
1278 if (grow_by < num_blocks) grow_by = num_blocks;
1279 int num_notes = grow_by * _node_notes_block_size;
1280 Node_Notes* notes = NEW_ARENA_ARRAY(node_arena(), Node_Notes, num_notes);
1281 Copy::zero_to_bytes(notes, num_notes * sizeof(Node_Notes));
1282 while (num_notes > 0) {
1283 arr->append(notes);
1284 notes += _node_notes_block_size;
1285 num_notes -= _node_notes_block_size;
1286 }
1287 assert(num_notes == 0, "exact multiple, please");
1288 }
1289
1290 bool Compile::copy_node_notes_to(Node* dest, Node* source) {
1291 if (source == nullptr || dest == nullptr) return false;
1292
1293 if (dest->is_Con())
1294 return false; // Do not push debug info onto constants.
1295
1296 #ifdef ASSERT
1297 // Leave a bread crumb trail pointing to the original node:
1298 if (dest != nullptr && dest != source && dest->debug_orig() == nullptr) {
1299 dest->set_debug_orig(source);
1300 }
1301 #endif
1302
1303 if (node_note_array() == nullptr)
1304 return false; // Not collecting any notes now.
1305
1306 // This is a copy onto a pre-existing node, which may already have notes.
1307 // If both nodes have notes, do not overwrite any pre-existing notes.
1308 Node_Notes* source_notes = node_notes_at(source->_idx);
1309 if (source_notes == nullptr || source_notes->is_clear()) return false;
1310 Node_Notes* dest_notes = node_notes_at(dest->_idx);
1311 if (dest_notes == nullptr || dest_notes->is_clear()) {
1312 return set_node_notes_at(dest->_idx, source_notes);
1313 }
1314
1315 Node_Notes merged_notes = (*source_notes);
1316 // The order of operations here ensures that dest notes will win...
1317 merged_notes.update_from(dest_notes);
1318 return set_node_notes_at(dest->_idx, &merged_notes);
1319 }
1320
1321
1322 //--------------------------allow_range_check_smearing-------------------------
1323 // Gating condition for coalescing similar range checks.
1324 // Sometimes we try 'speculatively' replacing a series of a range checks by a
1325 // single covering check that is at least as strong as any of them.
1326 // If the optimization succeeds, the simplified (strengthened) range check
1327 // will always succeed. If it fails, we will deopt, and then give up
1328 // on the optimization.
1329 bool Compile::allow_range_check_smearing() const {
1330 // If this method has already thrown a range-check,
1331 // assume it was because we already tried range smearing
1332 // and it failed.
1333 uint already_trapped = trap_count(Deoptimization::Reason_range_check);
1334 return !already_trapped;
1335 }
1336
1337
1338 //------------------------------flatten_alias_type-----------------------------
1339 const TypePtr *Compile::flatten_alias_type( const TypePtr *tj ) const {
1340 assert(do_aliasing(), "Aliasing should be enabled");
1341 int offset = tj->offset();
1342 TypePtr::PTR ptr = tj->ptr();
1343
1344 // Known instance (scalarizable allocation) alias only with itself.
1345 bool is_known_inst = tj->isa_oopptr() != nullptr &&
1346 tj->is_oopptr()->is_known_instance();
1347
1348 // Process weird unsafe references.
1349 if (offset == Type::OffsetBot && (tj->isa_instptr() /*|| tj->isa_klassptr()*/)) {
1350 assert(InlineUnsafeOps || StressReflectiveCode, "indeterminate pointers come only from unsafe ops");
1351 assert(!is_known_inst, "scalarizable allocation should not have unsafe references");
1352 tj = TypeOopPtr::BOTTOM;
1353 ptr = tj->ptr();
1354 offset = tj->offset();
1355 }
1356
1357 // Array pointers need some flattening
1358 const TypeAryPtr* ta = tj->isa_aryptr();
1359 if (ta && ta->is_stable()) {
1360 // Erase stability property for alias analysis.
1361 tj = ta = ta->cast_to_stable(false);
1362 }
1363 if( ta && is_known_inst ) {
1364 if ( offset != Type::OffsetBot &&
1365 offset > arrayOopDesc::length_offset_in_bytes() ) {
1366 offset = Type::OffsetBot; // Flatten constant access into array body only
1367 tj = ta = ta->
1368 remove_speculative()->
1369 cast_to_ptr_type(ptr)->
1370 with_offset(offset);
1371 }
1372 } else if (ta) {
1373 // For arrays indexed by constant indices, we flatten the alias
1374 // space to include all of the array body. Only the header, klass
1375 // and array length can be accessed un-aliased.
1376 if( offset != Type::OffsetBot ) {
1377 if( ta->const_oop() ) { // MethodData* or Method*
1378 offset = Type::OffsetBot; // Flatten constant access into array body
1379 tj = ta = ta->
1380 remove_speculative()->
1381 cast_to_ptr_type(ptr)->
1382 cast_to_exactness(false)->
1383 with_offset(offset);
1384 } else if( offset == arrayOopDesc::length_offset_in_bytes() ) {
1385 // range is OK as-is.
1386 tj = ta = TypeAryPtr::RANGE;
1387 } else if( offset == oopDesc::klass_offset_in_bytes() ) {
1388 tj = TypeInstPtr::KLASS; // all klass loads look alike
1389 ta = TypeAryPtr::RANGE; // generic ignored junk
1390 ptr = TypePtr::BotPTR;
1391 } else if( offset == oopDesc::mark_offset_in_bytes() ) {
1392 tj = TypeInstPtr::MARK;
1393 ta = TypeAryPtr::RANGE; // generic ignored junk
1394 ptr = TypePtr::BotPTR;
1395 } else { // Random constant offset into array body
1396 offset = Type::OffsetBot; // Flatten constant access into array body
1397 tj = ta = ta->
1398 remove_speculative()->
1399 cast_to_ptr_type(ptr)->
1400 cast_to_exactness(false)->
1401 with_offset(offset);
1402 }
1403 }
1404 // Arrays of fixed size alias with arrays of unknown size.
1405 if (ta->size() != TypeInt::POS) {
1406 const TypeAry *tary = TypeAry::make(ta->elem(), TypeInt::POS);
1407 tj = ta = ta->
1408 remove_speculative()->
1409 cast_to_ptr_type(ptr)->
1410 with_ary(tary)->
1411 cast_to_exactness(false);
1412 }
1413 // Arrays of known objects become arrays of unknown objects.
1414 if (ta->elem()->isa_narrowoop() && ta->elem() != TypeNarrowOop::BOTTOM) {
1415 const TypeAry *tary = TypeAry::make(TypeNarrowOop::BOTTOM, ta->size());
1416 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,nullptr,false,offset);
1417 }
1418 if (ta->elem()->isa_oopptr() && ta->elem() != TypeInstPtr::BOTTOM) {
1419 const TypeAry *tary = TypeAry::make(TypeInstPtr::BOTTOM, ta->size());
1420 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,nullptr,false,offset);
1421 }
1422 // Arrays of bytes and of booleans both use 'bastore' and 'baload' so
1423 // cannot be distinguished by bytecode alone.
1424 if (ta->elem() == TypeInt::BOOL) {
1425 const TypeAry *tary = TypeAry::make(TypeInt::BYTE, ta->size());
1426 ciKlass* aklass = ciTypeArrayKlass::make(T_BYTE);
1427 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,aklass,false,offset);
1428 }
1429 // During the 2nd round of IterGVN, NotNull castings are removed.
1430 // Make sure the Bottom and NotNull variants alias the same.
1431 // Also, make sure exact and non-exact variants alias the same.
1432 if (ptr == TypePtr::NotNull || ta->klass_is_exact() || ta->speculative() != nullptr) {
1433 tj = ta = ta->
1434 remove_speculative()->
1435 cast_to_ptr_type(TypePtr::BotPTR)->
1436 cast_to_exactness(false)->
1437 with_offset(offset);
1438 }
1439 }
1440
1441 // Oop pointers need some flattening
1442 const TypeInstPtr *to = tj->isa_instptr();
1443 if (to && to != TypeOopPtr::BOTTOM) {
1444 ciInstanceKlass* ik = to->instance_klass();
1445 if( ptr == TypePtr::Constant ) {
1446 if (ik != ciEnv::current()->Class_klass() ||
1447 offset < ik->layout_helper_size_in_bytes()) {
1448 // No constant oop pointers (such as Strings); they alias with
1449 // unknown strings.
1450 assert(!is_known_inst, "not scalarizable allocation");
1451 tj = to = to->
1452 cast_to_instance_id(TypeOopPtr::InstanceBot)->
1453 remove_speculative()->
1454 cast_to_ptr_type(TypePtr::BotPTR)->
1455 cast_to_exactness(false);
1456 }
1457 } else if( is_known_inst ) {
1458 tj = to; // Keep NotNull and klass_is_exact for instance type
1459 } else if( ptr == TypePtr::NotNull || to->klass_is_exact() ) {
1460 // During the 2nd round of IterGVN, NotNull castings are removed.
1461 // Make sure the Bottom and NotNull variants alias the same.
1462 // Also, make sure exact and non-exact variants alias the same.
1463 tj = to = to->
1464 remove_speculative()->
1465 cast_to_instance_id(TypeOopPtr::InstanceBot)->
1466 cast_to_ptr_type(TypePtr::BotPTR)->
1467 cast_to_exactness(false);
1468 }
1469 if (to->speculative() != nullptr) {
1470 tj = to = to->remove_speculative();
1471 }
1472 // Canonicalize the holder of this field
1473 if (offset >= 0 && offset < instanceOopDesc::base_offset_in_bytes()) {
1474 // First handle header references such as a LoadKlassNode, even if the
1475 // object's klass is unloaded at compile time (4965979).
1476 if (!is_known_inst) { // Do it only for non-instance types
1477 tj = to = TypeInstPtr::make(TypePtr::BotPTR, env()->Object_klass(), false, nullptr, offset);
1478 }
1479 } else if (offset < 0 || offset >= ik->layout_helper_size_in_bytes()) {
1480 // Static fields are in the space above the normal instance
1481 // fields in the java.lang.Class instance.
1482 if (ik != ciEnv::current()->Class_klass()) {
1483 to = nullptr;
1484 tj = TypeOopPtr::BOTTOM;
1485 offset = tj->offset();
1486 }
1487 } else {
1488 ciInstanceKlass *canonical_holder = ik->get_canonical_holder(offset);
1489 assert(offset < canonical_holder->layout_helper_size_in_bytes(), "");
1490 assert(tj->offset() == offset, "no change to offset expected");
1491 bool xk = to->klass_is_exact();
1492 int instance_id = to->instance_id();
1493
1494 // If the input type's class is the holder: if exact, the type only includes interfaces implemented by the holder
1495 // but if not exact, it may include extra interfaces: build new type from the holder class to make sure only
1496 // its interfaces are included.
1497 if (xk && ik->equals(canonical_holder)) {
1498 assert(tj == TypeInstPtr::make(to->ptr(), canonical_holder, is_known_inst, nullptr, offset, instance_id), "exact type should be canonical type");
1499 } else {
1500 assert(xk || !is_known_inst, "Known instance should be exact type");
1501 tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, is_known_inst, nullptr, offset, instance_id);
1502 }
1503 }
1504 }
1505
1506 // Klass pointers to object array klasses need some flattening
1507 const TypeKlassPtr *tk = tj->isa_klassptr();
1508 if( tk ) {
1509 // If we are referencing a field within a Klass, we need
1510 // to assume the worst case of an Object. Both exact and
1511 // inexact types must flatten to the same alias class so
1512 // use NotNull as the PTR.
1513 if ( offset == Type::OffsetBot || (offset >= 0 && (size_t)offset < sizeof(Klass)) ) {
1514 tj = tk = TypeInstKlassPtr::make(TypePtr::NotNull,
1515 env()->Object_klass(),
1516 offset);
1517 }
1518
1519 if (tk->isa_aryklassptr() && tk->is_aryklassptr()->elem()->isa_klassptr()) {
1520 ciKlass* k = ciObjArrayKlass::make(env()->Object_klass());
1521 if (!k || !k->is_loaded()) { // Only fails for some -Xcomp runs
1522 tj = tk = TypeInstKlassPtr::make(TypePtr::NotNull, env()->Object_klass(), offset);
1523 } else {
1524 tj = tk = TypeAryKlassPtr::make(TypePtr::NotNull, tk->is_aryklassptr()->elem(), k, offset);
1525 }
1526 }
1527
1528 // Check for precise loads from the primary supertype array and force them
1529 // to the supertype cache alias index. Check for generic array loads from
1530 // the primary supertype array and also force them to the supertype cache
1531 // alias index. Since the same load can reach both, we need to merge
1532 // these 2 disparate memories into the same alias class. Since the
1533 // primary supertype array is read-only, there's no chance of confusion
1534 // where we bypass an array load and an array store.
1535 int primary_supers_offset = in_bytes(Klass::primary_supers_offset());
1536 if (offset == Type::OffsetBot ||
1537 (offset >= primary_supers_offset &&
1538 offset < (int)(primary_supers_offset + Klass::primary_super_limit() * wordSize)) ||
1539 offset == (int)in_bytes(Klass::secondary_super_cache_offset())) {
1540 offset = in_bytes(Klass::secondary_super_cache_offset());
1541 tj = tk = tk->with_offset(offset);
1542 }
1543 }
1544
1545 // Flatten all Raw pointers together.
1546 if (tj->base() == Type::RawPtr)
1547 tj = TypeRawPtr::BOTTOM;
1548
1549 if (tj->base() == Type::AnyPtr)
1550 tj = TypePtr::BOTTOM; // An error, which the caller must check for.
1551
1552 offset = tj->offset();
1553 assert( offset != Type::OffsetTop, "Offset has fallen from constant" );
1554
1555 assert( (offset != Type::OffsetBot && tj->base() != Type::AryPtr) ||
1556 (offset == Type::OffsetBot && tj->base() == Type::AryPtr) ||
1557 (offset == Type::OffsetBot && tj == TypeOopPtr::BOTTOM) ||
1558 (offset == Type::OffsetBot && tj == TypePtr::BOTTOM) ||
1559 (offset == oopDesc::mark_offset_in_bytes() && tj->base() == Type::AryPtr) ||
1560 (offset == oopDesc::klass_offset_in_bytes() && tj->base() == Type::AryPtr) ||
1561 (offset == arrayOopDesc::length_offset_in_bytes() && tj->base() == Type::AryPtr),
1562 "For oops, klasses, raw offset must be constant; for arrays the offset is never known" );
1563 assert( tj->ptr() != TypePtr::TopPTR &&
1564 tj->ptr() != TypePtr::AnyNull &&
1565 tj->ptr() != TypePtr::Null, "No imprecise addresses" );
1566 // assert( tj->ptr() != TypePtr::Constant ||
1567 // tj->base() == Type::RawPtr ||
1568 // tj->base() == Type::KlassPtr, "No constant oop addresses" );
1569
1570 return tj;
1571 }
1572
1573 void Compile::AliasType::Init(int i, const TypePtr* at) {
1574 assert(AliasIdxTop <= i && i < Compile::current()->_max_alias_types, "Invalid alias index");
1575 _index = i;
1576 _adr_type = at;
1577 _field = nullptr;
1578 _element = nullptr;
1579 _is_rewritable = true; // default
1580 const TypeOopPtr *atoop = (at != nullptr) ? at->isa_oopptr() : nullptr;
1581 if (atoop != nullptr && atoop->is_known_instance()) {
1582 const TypeOopPtr *gt = atoop->cast_to_instance_id(TypeOopPtr::InstanceBot);
1583 _general_index = Compile::current()->get_alias_index(gt);
1584 } else {
1585 _general_index = 0;
1586 }
1587 }
1588
1589 BasicType Compile::AliasType::basic_type() const {
1590 if (element() != nullptr) {
1591 const Type* element = adr_type()->is_aryptr()->elem();
1592 return element->isa_narrowoop() ? T_OBJECT : element->array_element_basic_type();
1593 } if (field() != nullptr) {
1594 return field()->layout_type();
1595 } else {
1596 return T_ILLEGAL; // unknown
1597 }
1598 }
1599
1600 //---------------------------------print_on------------------------------------
1601 #ifndef PRODUCT
1602 void Compile::AliasType::print_on(outputStream* st) {
1603 if (index() < 10)
1604 st->print("@ <%d> ", index());
1605 else st->print("@ <%d>", index());
1606 st->print(is_rewritable() ? " " : " RO");
1607 int offset = adr_type()->offset();
1608 if (offset == Type::OffsetBot)
1609 st->print(" +any");
1610 else st->print(" +%-3d", offset);
1611 st->print(" in ");
1612 adr_type()->dump_on(st);
1613 const TypeOopPtr* tjp = adr_type()->isa_oopptr();
1614 if (field() != nullptr && tjp) {
1615 if (tjp->is_instptr()->instance_klass() != field()->holder() ||
1616 tjp->offset() != field()->offset_in_bytes()) {
1617 st->print(" != ");
1618 field()->print();
1619 st->print(" ***");
1620 }
1621 }
1622 }
1623
1624 void print_alias_types() {
1625 Compile* C = Compile::current();
1626 tty->print_cr("--- Alias types, AliasIdxBot .. %d", C->num_alias_types()-1);
1627 for (int idx = Compile::AliasIdxBot; idx < C->num_alias_types(); idx++) {
1628 C->alias_type(idx)->print_on(tty);
1629 tty->cr();
1630 }
1631 }
1632 #endif
1633
1634
1635 //----------------------------probe_alias_cache--------------------------------
1636 Compile::AliasCacheEntry* Compile::probe_alias_cache(const TypePtr* adr_type) {
1637 intptr_t key = (intptr_t) adr_type;
1638 key ^= key >> logAliasCacheSize;
1639 return &_alias_cache[key & right_n_bits(logAliasCacheSize)];
1640 }
1641
1642
1643 //-----------------------------grow_alias_types--------------------------------
1644 void Compile::grow_alias_types() {
1645 const int old_ats = _max_alias_types; // how many before?
1646 const int new_ats = old_ats; // how many more?
1647 const int grow_ats = old_ats+new_ats; // how many now?
1648 _max_alias_types = grow_ats;
1649 _alias_types = REALLOC_ARENA_ARRAY(comp_arena(), AliasType*, _alias_types, old_ats, grow_ats);
1650 AliasType* ats = NEW_ARENA_ARRAY(comp_arena(), AliasType, new_ats);
1651 Copy::zero_to_bytes(ats, sizeof(AliasType)*new_ats);
1652 for (int i = 0; i < new_ats; i++) _alias_types[old_ats+i] = &ats[i];
1653 }
1654
1655
1656 //--------------------------------find_alias_type------------------------------
1657 Compile::AliasType* Compile::find_alias_type(const TypePtr* adr_type, bool no_create, ciField* original_field) {
1658 if (!do_aliasing()) {
1659 return alias_type(AliasIdxBot);
1660 }
1661
1662 AliasCacheEntry* ace = probe_alias_cache(adr_type);
1663 if (ace->_adr_type == adr_type) {
1664 return alias_type(ace->_index);
1665 }
1666
1667 // Handle special cases.
1668 if (adr_type == nullptr) return alias_type(AliasIdxTop);
1669 if (adr_type == TypePtr::BOTTOM) return alias_type(AliasIdxBot);
1670
1671 // Do it the slow way.
1672 const TypePtr* flat = flatten_alias_type(adr_type);
1673
1674 #ifdef ASSERT
1675 {
1676 ResourceMark rm;
1677 assert(flat == flatten_alias_type(flat), "not idempotent: adr_type = %s; flat = %s => %s",
1678 Type::str(adr_type), Type::str(flat), Type::str(flatten_alias_type(flat)));
1679 assert(flat != TypePtr::BOTTOM, "cannot alias-analyze an untyped ptr: adr_type = %s",
1680 Type::str(adr_type));
1681 if (flat->isa_oopptr() && !flat->isa_klassptr()) {
1682 const TypeOopPtr* foop = flat->is_oopptr();
1683 // Scalarizable allocations have exact klass always.
1684 bool exact = !foop->klass_is_exact() || foop->is_known_instance();
1685 const TypePtr* xoop = foop->cast_to_exactness(exact)->is_ptr();
1686 assert(foop == flatten_alias_type(xoop), "exactness must not affect alias type: foop = %s; xoop = %s",
1687 Type::str(foop), Type::str(xoop));
1688 }
1689 }
1690 #endif
1691
1692 int idx = AliasIdxTop;
1693 for (int i = 0; i < num_alias_types(); i++) {
1694 if (alias_type(i)->adr_type() == flat) {
1695 idx = i;
1696 break;
1697 }
1698 }
1699
1700 if (idx == AliasIdxTop) {
1701 if (no_create) return nullptr;
1702 // Grow the array if necessary.
1703 if (_num_alias_types == _max_alias_types) grow_alias_types();
1704 // Add a new alias type.
1705 idx = _num_alias_types++;
1706 _alias_types[idx]->Init(idx, flat);
1707 if (flat == TypeInstPtr::KLASS) alias_type(idx)->set_rewritable(false);
1708 if (flat == TypeAryPtr::RANGE) alias_type(idx)->set_rewritable(false);
1709 if (flat->isa_instptr()) {
1710 if (flat->offset() == java_lang_Class::klass_offset()
1711 && flat->is_instptr()->instance_klass() == env()->Class_klass())
1712 alias_type(idx)->set_rewritable(false);
1713 }
1714 if (flat->isa_aryptr()) {
1715 #ifdef ASSERT
1716 const int header_size_min = arrayOopDesc::base_offset_in_bytes(T_BYTE);
1717 // (T_BYTE has the weakest alignment and size restrictions...)
1718 assert(flat->offset() < header_size_min, "array body reference must be OffsetBot");
1719 #endif
1720 if (flat->offset() == TypePtr::OffsetBot) {
1721 alias_type(idx)->set_element(flat->is_aryptr()->elem());
1722 }
1723 }
1724 if (flat->isa_klassptr()) {
1725 if (UseCompactObjectHeaders) {
1726 if (flat->offset() == in_bytes(Klass::prototype_header_offset()))
1727 alias_type(idx)->set_rewritable(false);
1728 }
1729 if (flat->offset() == in_bytes(Klass::super_check_offset_offset()))
1730 alias_type(idx)->set_rewritable(false);
1731 if (flat->offset() == in_bytes(Klass::misc_flags_offset()))
1732 alias_type(idx)->set_rewritable(false);
1733 if (flat->offset() == in_bytes(Klass::java_mirror_offset()))
1734 alias_type(idx)->set_rewritable(false);
1735 if (flat->offset() == in_bytes(Klass::secondary_super_cache_offset()))
1736 alias_type(idx)->set_rewritable(false);
1737 }
1738
1739 if (flat->isa_instklassptr()) {
1740 if (flat->offset() == in_bytes(InstanceKlass::access_flags_offset())) {
1741 alias_type(idx)->set_rewritable(false);
1742 }
1743 }
1744 // %%% (We would like to finalize JavaThread::threadObj_offset(),
1745 // but the base pointer type is not distinctive enough to identify
1746 // references into JavaThread.)
1747
1748 // Check for final fields.
1749 const TypeInstPtr* tinst = flat->isa_instptr();
1750 if (tinst && tinst->offset() >= instanceOopDesc::base_offset_in_bytes()) {
1751 ciField* field;
1752 if (tinst->const_oop() != nullptr &&
1753 tinst->instance_klass() == ciEnv::current()->Class_klass() &&
1754 tinst->offset() >= (tinst->instance_klass()->layout_helper_size_in_bytes())) {
1755 // static field
1756 ciInstanceKlass* k = tinst->const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass();
1757 field = k->get_field_by_offset(tinst->offset(), true);
1758 } else {
1759 ciInstanceKlass *k = tinst->instance_klass();
1760 field = k->get_field_by_offset(tinst->offset(), false);
1761 }
1762 assert(field == nullptr ||
1763 original_field == nullptr ||
1764 (field->holder() == original_field->holder() &&
1765 field->offset_in_bytes() == original_field->offset_in_bytes() &&
1766 field->is_static() == original_field->is_static()), "wrong field?");
1767 // Set field() and is_rewritable() attributes.
1768 if (field != nullptr) alias_type(idx)->set_field(field);
1769 }
1770 }
1771
1772 // Fill the cache for next time.
1773 ace->_adr_type = adr_type;
1774 ace->_index = idx;
1775 assert(alias_type(adr_type) == alias_type(idx), "type must be installed");
1776
1777 // Might as well try to fill the cache for the flattened version, too.
1778 AliasCacheEntry* face = probe_alias_cache(flat);
1779 if (face->_adr_type == nullptr) {
1780 face->_adr_type = flat;
1781 face->_index = idx;
1782 assert(alias_type(flat) == alias_type(idx), "flat type must work too");
1783 }
1784
1785 return alias_type(idx);
1786 }
1787
1788
1789 Compile::AliasType* Compile::alias_type(ciField* field) {
1790 const TypeOopPtr* t;
1791 if (field->is_static())
1792 t = TypeInstPtr::make(field->holder()->java_mirror());
1793 else
1794 t = TypeOopPtr::make_from_klass_raw(field->holder());
1795 AliasType* atp = alias_type(t->add_offset(field->offset_in_bytes()), field);
1796 assert((field->is_final() || field->is_stable()) == !atp->is_rewritable(), "must get the rewritable bits correct");
1797 return atp;
1798 }
1799
1800
1801 //------------------------------have_alias_type--------------------------------
1802 bool Compile::have_alias_type(const TypePtr* adr_type) {
1803 AliasCacheEntry* ace = probe_alias_cache(adr_type);
1804 if (ace->_adr_type == adr_type) {
1805 return true;
1806 }
1807
1808 // Handle special cases.
1809 if (adr_type == nullptr) return true;
1810 if (adr_type == TypePtr::BOTTOM) return true;
1811
1812 return find_alias_type(adr_type, true, nullptr) != nullptr;
1813 }
1814
1815 //-----------------------------must_alias--------------------------------------
1816 // True if all values of the given address type are in the given alias category.
1817 bool Compile::must_alias(const TypePtr* adr_type, int alias_idx) {
1818 if (alias_idx == AliasIdxBot) return true; // the universal category
1819 if (adr_type == nullptr) return true; // null serves as TypePtr::TOP
1820 if (alias_idx == AliasIdxTop) return false; // the empty category
1821 if (adr_type->base() == Type::AnyPtr) return false; // TypePtr::BOTTOM or its twins
1822
1823 // the only remaining possible overlap is identity
1824 int adr_idx = get_alias_index(adr_type);
1825 assert(adr_idx != AliasIdxBot && adr_idx != AliasIdxTop, "");
1826 assert(adr_idx == alias_idx ||
1827 (alias_type(alias_idx)->adr_type() != TypeOopPtr::BOTTOM
1828 && adr_type != TypeOopPtr::BOTTOM),
1829 "should not be testing for overlap with an unsafe pointer");
1830 return adr_idx == alias_idx;
1831 }
1832
1833 //------------------------------can_alias--------------------------------------
1834 // True if any values of the given address type are in the given alias category.
1835 bool Compile::can_alias(const TypePtr* adr_type, int alias_idx) {
1836 if (alias_idx == AliasIdxTop) return false; // the empty category
1837 if (adr_type == nullptr) return false; // null serves as TypePtr::TOP
1838 // Known instance doesn't alias with bottom memory
1839 if (alias_idx == AliasIdxBot) return !adr_type->is_known_instance(); // the universal category
1840 if (adr_type->base() == Type::AnyPtr) return !C->get_adr_type(alias_idx)->is_known_instance(); // TypePtr::BOTTOM or its twins
1841
1842 // the only remaining possible overlap is identity
1843 int adr_idx = get_alias_index(adr_type);
1844 assert(adr_idx != AliasIdxBot && adr_idx != AliasIdxTop, "");
1845 return adr_idx == alias_idx;
1846 }
1847
1848 // Mark all ParsePredicateNodes as useless. They will later be removed from the graph in IGVN together with their
1849 // uncommon traps if no Runtime Predicates were created from the Parse Predicates.
1850 void Compile::mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn) {
1851 if (parse_predicate_count() == 0) {
1852 return;
1853 }
1854 for (int i = 0; i < parse_predicate_count(); i++) {
1855 ParsePredicateNode* parse_predicate = _parse_predicates.at(i);
1856 parse_predicate->mark_useless(igvn);
1857 }
1858 _parse_predicates.clear();
1859 }
1860
1861 void Compile::record_for_post_loop_opts_igvn(Node* n) {
1862 if (!n->for_post_loop_opts_igvn()) {
1863 assert(!_for_post_loop_igvn.contains(n), "duplicate");
1864 n->add_flag(Node::NodeFlags::Flag_for_post_loop_opts_igvn);
1865 _for_post_loop_igvn.append(n);
1866 }
1867 }
1868
1869 void Compile::remove_from_post_loop_opts_igvn(Node* n) {
1870 n->remove_flag(Node::NodeFlags::Flag_for_post_loop_opts_igvn);
1871 _for_post_loop_igvn.remove(n);
1872 }
1873
1874 void Compile::process_for_post_loop_opts_igvn(PhaseIterGVN& igvn) {
1875 // Verify that all previous optimizations produced a valid graph
1876 // at least to this point, even if no loop optimizations were done.
1877 PhaseIdealLoop::verify(igvn);
1878
1879 if (_print_phase_loop_opts) {
1880 print_method(PHASE_AFTER_LOOP_OPTS, 2);
1881 }
1882 C->set_post_loop_opts_phase(); // no more loop opts allowed
1883
1884 assert(!C->major_progress(), "not cleared");
1885
1886 if (_for_post_loop_igvn.length() > 0) {
1887 while (_for_post_loop_igvn.length() > 0) {
1888 Node* n = _for_post_loop_igvn.pop();
1889 n->remove_flag(Node::NodeFlags::Flag_for_post_loop_opts_igvn);
1890 igvn._worklist.push(n);
1891 }
1892 igvn.optimize();
1893 if (failing()) return;
1894 assert(_for_post_loop_igvn.length() == 0, "no more delayed nodes allowed");
1895 assert(C->parse_predicate_count() == 0, "all parse predicates should have been removed now");
1896
1897 // Sometimes IGVN sets major progress (e.g., when processing loop nodes).
1898 if (C->major_progress()) {
1899 C->clear_major_progress(); // ensure that major progress is now clear
1900 }
1901 }
1902 }
1903
1904 void Compile::record_for_merge_stores_igvn(Node* n) {
1905 if (!n->for_merge_stores_igvn()) {
1906 assert(!_for_merge_stores_igvn.contains(n), "duplicate");
1907 n->add_flag(Node::NodeFlags::Flag_for_merge_stores_igvn);
1908 _for_merge_stores_igvn.append(n);
1909 }
1910 }
1911
1912 void Compile::remove_from_merge_stores_igvn(Node* n) {
1913 n->remove_flag(Node::NodeFlags::Flag_for_merge_stores_igvn);
1914 _for_merge_stores_igvn.remove(n);
1915 }
1916
1917 // We need to wait with merging stores until RangeCheck smearing has removed the RangeChecks during
1918 // the post loops IGVN phase. If we do it earlier, then there may still be some RangeChecks between
1919 // the stores, and we merge the wrong sequence of stores.
1920 // Example:
1921 // StoreI RangeCheck StoreI StoreI RangeCheck StoreI
1922 // Apply MergeStores:
1923 // StoreI RangeCheck [ StoreL ] RangeCheck StoreI
1924 // Remove more RangeChecks:
1925 // StoreI [ StoreL ] StoreI
1926 // But now it would have been better to do this instead:
1927 // [ StoreL ] [ StoreL ]
1928 //
1929 // Note: we allow stores to merge in this dedicated IGVN round, and any later IGVN round,
1930 // since we never unset _merge_stores_phase.
1931 void Compile::process_for_merge_stores_igvn(PhaseIterGVN& igvn) {
1932 C->set_merge_stores_phase();
1933
1934 if (_for_merge_stores_igvn.length() > 0) {
1935 while (_for_merge_stores_igvn.length() > 0) {
1936 Node* n = _for_merge_stores_igvn.pop();
1937 n->remove_flag(Node::NodeFlags::Flag_for_merge_stores_igvn);
1938 igvn._worklist.push(n);
1939 }
1940 igvn.optimize();
1941 if (failing()) return;
1942 assert(_for_merge_stores_igvn.length() == 0, "no more delayed nodes allowed");
1943 print_method(PHASE_AFTER_MERGE_STORES, 3);
1944 }
1945 }
1946
1947 void Compile::record_unstable_if_trap(UnstableIfTrap* trap) {
1948 if (OptimizeUnstableIf) {
1949 _unstable_if_traps.append(trap);
1950 }
1951 }
1952
1953 void Compile::remove_useless_unstable_if_traps(Unique_Node_List& useful) {
1954 for (int i = _unstable_if_traps.length() - 1; i >= 0; i--) {
1955 UnstableIfTrap* trap = _unstable_if_traps.at(i);
1956 Node* n = trap->uncommon_trap();
1957 if (!useful.member(n)) {
1958 _unstable_if_traps.delete_at(i); // replaces i-th with last element which is known to be useful (already processed)
1959 }
1960 }
1961 }
1962
1963 // Remove the unstable if trap associated with 'unc' from candidates. It is either dead
1964 // or fold-compares case. Return true if succeed or not found.
1965 //
1966 // In rare cases, the found trap has been processed. It is too late to delete it. Return
1967 // false and ask fold-compares to yield.
1968 //
1969 // 'fold-compares' may use the uncommon_trap of the dominating IfNode to cover the fused
1970 // IfNode. This breaks the unstable_if trap invariant: control takes the unstable path
1971 // when deoptimization does happen.
1972 bool Compile::remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield) {
1973 for (int i = 0; i < _unstable_if_traps.length(); ++i) {
1974 UnstableIfTrap* trap = _unstable_if_traps.at(i);
1975 if (trap->uncommon_trap() == unc) {
1976 if (yield && trap->modified()) {
1977 return false;
1978 }
1979 _unstable_if_traps.delete_at(i);
1980 break;
1981 }
1982 }
1983 return true;
1984 }
1985
1986 // Re-calculate unstable_if traps with the liveness of next_bci, which points to the unlikely path.
1987 // It needs to be done after igvn because fold-compares may fuse uncommon_traps and before renumbering.
1988 void Compile::process_for_unstable_if_traps(PhaseIterGVN& igvn) {
1989 for (int i = _unstable_if_traps.length() - 1; i >= 0; --i) {
1990 UnstableIfTrap* trap = _unstable_if_traps.at(i);
1991 CallStaticJavaNode* unc = trap->uncommon_trap();
1992 int next_bci = trap->next_bci();
1993 bool modified = trap->modified();
1994
1995 if (next_bci != -1 && !modified) {
1996 assert(!_dead_node_list.test(unc->_idx), "changing a dead node!");
1997 JVMState* jvms = unc->jvms();
1998 ciMethod* method = jvms->method();
1999 ciBytecodeStream iter(method);
2000
2001 iter.force_bci(jvms->bci());
2002 assert(next_bci == iter.next_bci() || next_bci == iter.get_dest(), "wrong next_bci at unstable_if");
2003 Bytecodes::Code c = iter.cur_bc();
2004 Node* lhs = nullptr;
2005 Node* rhs = nullptr;
2006 if (c == Bytecodes::_if_acmpeq || c == Bytecodes::_if_acmpne) {
2007 lhs = unc->peek_operand(0);
2008 rhs = unc->peek_operand(1);
2009 } else if (c == Bytecodes::_ifnull || c == Bytecodes::_ifnonnull) {
2010 lhs = unc->peek_operand(0);
2011 }
2012
2013 ResourceMark rm;
2014 const MethodLivenessResult& live_locals = method->liveness_at_bci(next_bci);
2015 assert(live_locals.is_valid(), "broken liveness info");
2016 int len = (int)live_locals.size();
2017
2018 for (int i = 0; i < len; i++) {
2019 Node* local = unc->local(jvms, i);
2020 // kill local using the liveness of next_bci.
2021 // give up when the local looks like an operand to secure reexecution.
2022 if (!live_locals.at(i) && !local->is_top() && local != lhs && local!= rhs) {
2023 uint idx = jvms->locoff() + i;
2024 #ifdef ASSERT
2025 if (PrintOpto && Verbose) {
2026 tty->print("[unstable_if] kill local#%d: ", idx);
2027 local->dump();
2028 tty->cr();
2029 }
2030 #endif
2031 igvn.replace_input_of(unc, idx, top());
2032 modified = true;
2033 }
2034 }
2035 }
2036
2037 // keep the mondified trap for late query
2038 if (modified) {
2039 trap->set_modified();
2040 } else {
2041 _unstable_if_traps.delete_at(i);
2042 }
2043 }
2044 igvn.optimize();
2045 }
2046
2047 // StringOpts and late inlining of string methods
2048 void Compile::inline_string_calls(bool parse_time) {
2049 {
2050 // remove useless nodes to make the usage analysis simpler
2051 ResourceMark rm;
2052 PhaseRemoveUseless pru(initial_gvn(), *igvn_worklist());
2053 }
2054
2055 {
2056 ResourceMark rm;
2057 print_method(PHASE_BEFORE_STRINGOPTS, 3);
2058 PhaseStringOpts pso(initial_gvn());
2059 print_method(PHASE_AFTER_STRINGOPTS, 3);
2060 }
2061
2062 // now inline anything that we skipped the first time around
2063 if (!parse_time) {
2064 _late_inlines_pos = _late_inlines.length();
2065 }
2066
2067 while (_string_late_inlines.length() > 0) {
2068 CallGenerator* cg = _string_late_inlines.pop();
2069 cg->do_late_inline();
2070 if (failing()) return;
2071 }
2072 _string_late_inlines.trunc_to(0);
2073 }
2074
2075 // Late inlining of boxing methods
2076 void Compile::inline_boxing_calls(PhaseIterGVN& igvn) {
2077 if (_boxing_late_inlines.length() > 0) {
2078 assert(has_boxed_value(), "inconsistent");
2079
2080 set_inlining_incrementally(true);
2081
2082 igvn_worklist()->ensure_empty(); // should be done with igvn
2083
2084 _late_inlines_pos = _late_inlines.length();
2085
2086 while (_boxing_late_inlines.length() > 0) {
2087 CallGenerator* cg = _boxing_late_inlines.pop();
2088 cg->do_late_inline();
2089 if (failing()) return;
2090 }
2091 _boxing_late_inlines.trunc_to(0);
2092
2093 inline_incrementally_cleanup(igvn);
2094
2095 set_inlining_incrementally(false);
2096 }
2097 }
2098
2099 bool Compile::inline_incrementally_one() {
2100 assert(IncrementalInline, "incremental inlining should be on");
2101 assert(_late_inlines.length() > 0, "should have been checked by caller");
2102
2103 TracePhase tp(_t_incrInline_inline);
2104
2105 set_inlining_progress(false);
2106 set_do_cleanup(false);
2107
2108 for (int i = 0; i < _late_inlines.length(); i++) {
2109 _late_inlines_pos = i+1;
2110 CallGenerator* cg = _late_inlines.at(i);
2111 bool is_scheduled_for_igvn_before = C->igvn_worklist()->member(cg->call_node());
2112 bool does_dispatch = cg->is_virtual_late_inline() || cg->is_mh_late_inline();
2113 if (inlining_incrementally() || does_dispatch) { // a call can be either inlined or strength-reduced to a direct call
2114 if (should_stress_inlining()) {
2115 // randomly add repeated inline attempt if stress-inlining
2116 cg->call_node()->set_generator(cg);
2117 C->igvn_worklist()->push(cg->call_node());
2118 continue;
2119 }
2120 cg->do_late_inline();
2121 assert(_late_inlines.at(i) == cg, "no insertions before current position allowed");
2122 if (failing()) {
2123 return false;
2124 } else if (inlining_progress()) {
2125 _late_inlines_pos = i+1; // restore the position in case new elements were inserted
2126 print_method(PHASE_INCREMENTAL_INLINE_STEP, 3, cg->call_node());
2127 break; // process one call site at a time
2128 } else {
2129 bool is_scheduled_for_igvn_after = C->igvn_worklist()->member(cg->call_node());
2130 if (!is_scheduled_for_igvn_before && is_scheduled_for_igvn_after) {
2131 // Avoid potential infinite loop if node already in the IGVN list
2132 assert(false, "scheduled for IGVN during inlining attempt");
2133 } else {
2134 // Ensure call node has not disappeared from IGVN worklist during a failed inlining attempt
2135 assert(!is_scheduled_for_igvn_before || is_scheduled_for_igvn_after, "call node removed from IGVN list during inlining pass");
2136 cg->call_node()->set_generator(cg);
2137 }
2138 }
2139 } else {
2140 // Ignore late inline direct calls when inlining is not allowed.
2141 // They are left in the late inline list when node budget is exhausted until the list is fully drained.
2142 }
2143 }
2144 // Remove processed elements.
2145 _late_inlines.remove_till(_late_inlines_pos);
2146 _late_inlines_pos = 0;
2147
2148 assert(inlining_progress() || _late_inlines.length() == 0, "no progress");
2149
2150 bool needs_cleanup = do_cleanup() || over_inlining_cutoff();
2151
2152 set_inlining_progress(false);
2153 set_do_cleanup(false);
2154
2155 bool force_cleanup = directive()->IncrementalInlineForceCleanupOption;
2156 return (_late_inlines.length() > 0) && !needs_cleanup && !force_cleanup;
2157 }
2158
2159 void Compile::inline_incrementally_cleanup(PhaseIterGVN& igvn) {
2160 {
2161 TracePhase tp(_t_incrInline_pru);
2162 ResourceMark rm;
2163 PhaseRemoveUseless pru(initial_gvn(), *igvn_worklist());
2164 }
2165 {
2166 TracePhase tp(_t_incrInline_igvn);
2167 igvn.reset();
2168 igvn.optimize();
2169 if (failing()) return;
2170 }
2171 print_method(PHASE_INCREMENTAL_INLINE_CLEANUP, 3);
2172 }
2173
2174 // Perform incremental inlining until bound on number of live nodes is reached
2175 void Compile::inline_incrementally(PhaseIterGVN& igvn) {
2176 TracePhase tp(_t_incrInline);
2177
2178 set_inlining_incrementally(true);
2179 uint low_live_nodes = 0;
2180
2181 while (_late_inlines.length() > 0) {
2182 if (live_nodes() > (uint)LiveNodeCountInliningCutoff) {
2183 if (low_live_nodes < (uint)LiveNodeCountInliningCutoff * 8 / 10) {
2184 TracePhase tp(_t_incrInline_ideal);
2185 // PhaseIdealLoop is expensive so we only try it once we are
2186 // out of live nodes and we only try it again if the previous
2187 // helped got the number of nodes down significantly
2188 PhaseIdealLoop::optimize(igvn, LoopOptsNone);
2189 if (failing()) return;
2190 low_live_nodes = live_nodes();
2191 _major_progress = true;
2192 }
2193
2194 if (live_nodes() > (uint)LiveNodeCountInliningCutoff) {
2195 bool do_print_inlining = print_inlining() || print_intrinsics();
2196 if (do_print_inlining || log() != nullptr) {
2197 // Print inlining message for candidates that we couldn't inline for lack of space.
2198 for (int i = 0; i < _late_inlines.length(); i++) {
2199 CallGenerator* cg = _late_inlines.at(i);
2200 const char* msg = "live nodes > LiveNodeCountInliningCutoff";
2201 if (do_print_inlining) {
2202 inline_printer()->record(cg->method(), cg->call_node()->jvms(), InliningResult::FAILURE, msg);
2203 }
2204 log_late_inline_failure(cg, msg);
2205 }
2206 }
2207 break; // finish
2208 }
2209 }
2210
2211 igvn_worklist()->ensure_empty(); // should be done with igvn
2212
2213 if (_late_inlines.length() == 0) {
2214 break; // no more progress
2215 }
2216
2217 while (inline_incrementally_one()) {
2218 assert(!failing_internal() || failure_is_artificial(), "inconsistent");
2219 }
2220 if (failing()) return;
2221
2222 inline_incrementally_cleanup(igvn);
2223
2224 print_method(PHASE_INCREMENTAL_INLINE_STEP, 3);
2225
2226 if (failing()) return;
2227 }
2228
2229 igvn_worklist()->ensure_empty(); // should be done with igvn
2230
2231 if (_string_late_inlines.length() > 0) {
2232 assert(has_stringbuilder(), "inconsistent");
2233
2234 inline_string_calls(false);
2235
2236 if (failing()) return;
2237
2238 inline_incrementally_cleanup(igvn);
2239 }
2240
2241 set_inlining_incrementally(false);
2242 }
2243
2244 void Compile::process_late_inline_calls_no_inline(PhaseIterGVN& igvn) {
2245 // "inlining_incrementally() == false" is used to signal that no inlining is allowed
2246 // (see LateInlineVirtualCallGenerator::do_late_inline_check() for details).
2247 // Tracking and verification of modified nodes is disabled by setting "_modified_nodes == nullptr"
2248 // as if "inlining_incrementally() == true" were set.
2249 assert(inlining_incrementally() == false, "not allowed");
2250 assert(_modified_nodes == nullptr, "not allowed");
2251 assert(_late_inlines.length() > 0, "sanity");
2252
2253 while (_late_inlines.length() > 0) {
2254 igvn_worklist()->ensure_empty(); // should be done with igvn
2255
2256 while (inline_incrementally_one()) {
2257 assert(!failing_internal() || failure_is_artificial(), "inconsistent");
2258 }
2259 if (failing()) return;
2260
2261 inline_incrementally_cleanup(igvn);
2262 }
2263 }
2264
2265 bool Compile::optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode) {
2266 if (_loop_opts_cnt > 0) {
2267 while (major_progress() && (_loop_opts_cnt > 0)) {
2268 TracePhase tp(_t_idealLoop);
2269 PhaseIdealLoop::optimize(igvn, mode);
2270 _loop_opts_cnt--;
2271 if (failing()) return false;
2272 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP_ITERATIONS, 2);
2273 }
2274 }
2275 return true;
2276 }
2277
2278 // Remove edges from "root" to each SafePoint at a backward branch.
2279 // They were inserted during parsing (see add_safepoint()) to make
2280 // infinite loops without calls or exceptions visible to root, i.e.,
2281 // useful.
2282 void Compile::remove_root_to_sfpts_edges(PhaseIterGVN& igvn) {
2283 Node *r = root();
2284 if (r != nullptr) {
2285 for (uint i = r->req(); i < r->len(); ++i) {
2286 Node *n = r->in(i);
2287 if (n != nullptr && n->is_SafePoint()) {
2288 r->rm_prec(i);
2289 if (n->outcnt() == 0) {
2290 igvn.remove_dead_node(n);
2291 }
2292 --i;
2293 }
2294 }
2295 // Parsing may have added top inputs to the root node (Path
2296 // leading to the Halt node proven dead). Make sure we get a
2297 // chance to clean them up.
2298 igvn._worklist.push(r);
2299 igvn.optimize();
2300 }
2301 }
2302
2303 //------------------------------Optimize---------------------------------------
2304 // Given a graph, optimize it.
2305 void Compile::Optimize() {
2306 TracePhase tp(_t_optimizer);
2307
2308 #ifndef PRODUCT
2309 if (env()->break_at_compile()) {
2310 BREAKPOINT;
2311 }
2312
2313 #endif
2314
2315 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
2316 #ifdef ASSERT
2317 bs->verify_gc_barriers(this, BarrierSetC2::BeforeOptimize);
2318 #endif
2319
2320 ResourceMark rm;
2321
2322 NOT_PRODUCT( verify_graph_edges(); )
2323
2324 print_method(PHASE_AFTER_PARSING, 1);
2325
2326 {
2327 // Iterative Global Value Numbering, including ideal transforms
2328 PhaseIterGVN igvn;
2329 #ifdef ASSERT
2330 _modified_nodes = new (comp_arena()) Unique_Node_List(comp_arena());
2331 #endif
2332 {
2333 TracePhase tp(_t_iterGVN);
2334 igvn.optimize();
2335 }
2336
2337 if (failing()) return;
2338
2339 print_method(PHASE_ITER_GVN1, 2);
2340
2341 process_for_unstable_if_traps(igvn);
2342
2343 if (failing()) return;
2344
2345 inline_incrementally(igvn);
2346
2347 print_method(PHASE_INCREMENTAL_INLINE, 2);
2348
2349 if (failing()) return;
2350
2351 if (eliminate_boxing()) {
2352 // Inline valueOf() methods now.
2353 inline_boxing_calls(igvn);
2354
2355 if (failing()) return;
2356
2357 if (AlwaysIncrementalInline || StressIncrementalInlining) {
2358 inline_incrementally(igvn);
2359 }
2360
2361 print_method(PHASE_INCREMENTAL_BOXING_INLINE, 2);
2362
2363 if (failing()) return;
2364 }
2365
2366 // Remove the speculative part of types and clean up the graph from
2367 // the extra CastPP nodes whose only purpose is to carry them. Do
2368 // that early so that optimizations are not disrupted by the extra
2369 // CastPP nodes.
2370 remove_speculative_types(igvn);
2371
2372 if (failing()) return;
2373
2374 // No more new expensive nodes will be added to the list from here
2375 // so keep only the actual candidates for optimizations.
2376 cleanup_expensive_nodes(igvn);
2377
2378 if (failing()) return;
2379
2380 assert(EnableVectorSupport || !has_vbox_nodes(), "sanity");
2381 if (EnableVectorSupport && has_vbox_nodes()) {
2382 TracePhase tp(_t_vector);
2383 PhaseVector pv(igvn);
2384 pv.optimize_vector_boxes();
2385 if (failing()) return;
2386 print_method(PHASE_ITER_GVN_AFTER_VECTOR, 2);
2387 }
2388 assert(!has_vbox_nodes(), "sanity");
2389
2390 if (!failing() && RenumberLiveNodes && live_nodes() + NodeLimitFudgeFactor < unique()) {
2391 Compile::TracePhase tp(_t_renumberLive);
2392 igvn_worklist()->ensure_empty(); // should be done with igvn
2393 {
2394 ResourceMark rm;
2395 PhaseRenumberLive prl(initial_gvn(), *igvn_worklist());
2396 }
2397 igvn.reset();
2398 igvn.optimize();
2399 if (failing()) return;
2400 }
2401
2402 // Now that all inlining is over and no PhaseRemoveUseless will run, cut edge from root to loop
2403 // safepoints
2404 remove_root_to_sfpts_edges(igvn);
2405
2406 if (failing()) return;
2407
2408 _print_phase_loop_opts = has_loops();
2409 if (_print_phase_loop_opts) {
2410 print_method(PHASE_BEFORE_LOOP_OPTS, 2);
2411 }
2412
2413 // Perform escape analysis
2414 if (do_escape_analysis() && ConnectionGraph::has_candidates(this)) {
2415 if (has_loops()) {
2416 // Cleanup graph (remove dead nodes).
2417 TracePhase tp(_t_idealLoop);
2418 PhaseIdealLoop::optimize(igvn, LoopOptsMaxUnroll);
2419 if (failing()) return;
2420 }
2421 bool progress;
2422 print_method(PHASE_PHASEIDEAL_BEFORE_EA, 2);
2423 do {
2424 ConnectionGraph::do_analysis(this, &igvn);
2425
2426 if (failing()) return;
2427
2428 int mcount = macro_count(); // Record number of allocations and locks before IGVN
2429
2430 // Optimize out fields loads from scalar replaceable allocations.
2431 igvn.optimize();
2432 print_method(PHASE_ITER_GVN_AFTER_EA, 2);
2433
2434 if (failing()) return;
2435
2436 if (congraph() != nullptr && macro_count() > 0) {
2437 TracePhase tp(_t_macroEliminate);
2438 PhaseMacroExpand mexp(igvn);
2439 mexp.eliminate_macro_nodes();
2440 if (failing()) return;
2441 print_method(PHASE_AFTER_MACRO_ELIMINATION, 2);
2442
2443 igvn.set_delay_transform(false);
2444 igvn.optimize();
2445 if (failing()) return;
2446
2447 print_method(PHASE_ITER_GVN_AFTER_ELIMINATION, 2);
2448 }
2449
2450 ConnectionGraph::verify_ram_nodes(this, root());
2451 if (failing()) return;
2452
2453 progress = do_iterative_escape_analysis() &&
2454 (macro_count() < mcount) &&
2455 ConnectionGraph::has_candidates(this);
2456 // Try again if candidates exist and made progress
2457 // by removing some allocations and/or locks.
2458 } while (progress);
2459 }
2460
2461 // Loop transforms on the ideal graph. Range Check Elimination,
2462 // peeling, unrolling, etc.
2463
2464 // Set loop opts counter
2465 if((_loop_opts_cnt > 0) && (has_loops() || has_split_ifs())) {
2466 {
2467 TracePhase tp(_t_idealLoop);
2468 PhaseIdealLoop::optimize(igvn, LoopOptsDefault);
2469 _loop_opts_cnt--;
2470 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP1, 2);
2471 if (failing()) return;
2472 }
2473 // Loop opts pass if partial peeling occurred in previous pass
2474 if(PartialPeelLoop && major_progress() && (_loop_opts_cnt > 0)) {
2475 TracePhase tp(_t_idealLoop);
2476 PhaseIdealLoop::optimize(igvn, LoopOptsSkipSplitIf);
2477 _loop_opts_cnt--;
2478 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP2, 2);
2479 if (failing()) return;
2480 }
2481 // Loop opts pass for loop-unrolling before CCP
2482 if(major_progress() && (_loop_opts_cnt > 0)) {
2483 TracePhase tp(_t_idealLoop);
2484 PhaseIdealLoop::optimize(igvn, LoopOptsSkipSplitIf);
2485 _loop_opts_cnt--;
2486 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP3, 2);
2487 }
2488 if (!failing()) {
2489 // Verify that last round of loop opts produced a valid graph
2490 PhaseIdealLoop::verify(igvn);
2491 }
2492 }
2493 if (failing()) return;
2494
2495 // Conditional Constant Propagation;
2496 print_method(PHASE_BEFORE_CCP1, 2);
2497 PhaseCCP ccp( &igvn );
2498 assert( true, "Break here to ccp.dump_nodes_and_types(_root,999,1)");
2499 {
2500 TracePhase tp(_t_ccp);
2501 ccp.do_transform();
2502 }
2503 print_method(PHASE_CCP1, 2);
2504
2505 assert( true, "Break here to ccp.dump_old2new_map()");
2506
2507 // Iterative Global Value Numbering, including ideal transforms
2508 {
2509 TracePhase tp(_t_iterGVN2);
2510 igvn.reset_from_igvn(&ccp);
2511 igvn.optimize();
2512 }
2513 print_method(PHASE_ITER_GVN2, 2);
2514
2515 if (failing()) return;
2516
2517 // Loop transforms on the ideal graph. Range Check Elimination,
2518 // peeling, unrolling, etc.
2519 if (!optimize_loops(igvn, LoopOptsDefault)) {
2520 return;
2521 }
2522
2523 if (failing()) return;
2524
2525 C->clear_major_progress(); // ensure that major progress is now clear
2526
2527 process_for_post_loop_opts_igvn(igvn);
2528
2529 process_for_merge_stores_igvn(igvn);
2530
2531 if (failing()) return;
2532
2533 #ifdef ASSERT
2534 bs->verify_gc_barriers(this, BarrierSetC2::BeforeMacroExpand);
2535 #endif
2536
2537 {
2538 TracePhase tp(_t_macroExpand);
2539 print_method(PHASE_BEFORE_MACRO_EXPANSION, 3);
2540 PhaseMacroExpand mex(igvn);
2541 // Do not allow new macro nodes once we start to eliminate and expand
2542 C->reset_allow_macro_nodes();
2543 // Last attempt to eliminate macro nodes before expand
2544 mex.eliminate_macro_nodes();
2545 if (failing()) {
2546 return;
2547 }
2548 mex.eliminate_opaque_looplimit_macro_nodes();
2549 if (failing()) {
2550 return;
2551 }
2552 print_method(PHASE_AFTER_MACRO_ELIMINATION, 2);
2553 if (mex.expand_macro_nodes()) {
2554 assert(failing(), "must bail out w/ explicit message");
2555 return;
2556 }
2557 print_method(PHASE_AFTER_MACRO_EXPANSION, 2);
2558 }
2559
2560 {
2561 TracePhase tp(_t_barrierExpand);
2562 if (bs->expand_barriers(this, igvn)) {
2563 assert(failing(), "must bail out w/ explicit message");
2564 return;
2565 }
2566 print_method(PHASE_BARRIER_EXPANSION, 2);
2567 }
2568
2569 if (C->max_vector_size() > 0) {
2570 C->optimize_logic_cones(igvn);
2571 igvn.optimize();
2572 if (failing()) return;
2573 }
2574
2575 DEBUG_ONLY( _modified_nodes = nullptr; )
2576
2577 assert(igvn._worklist.size() == 0, "not empty");
2578
2579 assert(_late_inlines.length() == 0 || IncrementalInlineMH || IncrementalInlineVirtual, "not empty");
2580
2581 if (_late_inlines.length() > 0) {
2582 // More opportunities to optimize virtual and MH calls.
2583 // Though it's maybe too late to perform inlining, strength-reducing them to direct calls is still an option.
2584 process_late_inline_calls_no_inline(igvn);
2585 if (failing()) return;
2586 }
2587 } // (End scope of igvn; run destructor if necessary for asserts.)
2588
2589 check_no_dead_use();
2590
2591 // We will never use the NodeHash table any more. Clear it so that final_graph_reshaping does not have
2592 // to remove hashes to unlock nodes for modifications.
2593 C->node_hash()->clear();
2594
2595 // A method with only infinite loops has no edges entering loops from root
2596 {
2597 TracePhase tp(_t_graphReshaping);
2598 if (final_graph_reshaping()) {
2599 assert(failing(), "must bail out w/ explicit message");
2600 return;
2601 }
2602 }
2603
2604 print_method(PHASE_OPTIMIZE_FINISHED, 2);
2605 DEBUG_ONLY(set_phase_optimize_finished();)
2606 }
2607
2608 #ifdef ASSERT
2609 void Compile::check_no_dead_use() const {
2610 ResourceMark rm;
2611 Unique_Node_List wq;
2612 wq.push(root());
2613 for (uint i = 0; i < wq.size(); ++i) {
2614 Node* n = wq.at(i);
2615 for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
2616 Node* u = n->fast_out(j);
2617 if (u->outcnt() == 0 && !u->is_Con()) {
2618 u->dump();
2619 fatal("no reachable node should have no use");
2620 }
2621 wq.push(u);
2622 }
2623 }
2624 }
2625 #endif
2626
2627 void Compile::inline_vector_reboxing_calls() {
2628 if (C->_vector_reboxing_late_inlines.length() > 0) {
2629 _late_inlines_pos = C->_late_inlines.length();
2630 while (_vector_reboxing_late_inlines.length() > 0) {
2631 CallGenerator* cg = _vector_reboxing_late_inlines.pop();
2632 cg->do_late_inline();
2633 if (failing()) return;
2634 print_method(PHASE_INLINE_VECTOR_REBOX, 3, cg->call_node());
2635 }
2636 _vector_reboxing_late_inlines.trunc_to(0);
2637 }
2638 }
2639
2640 bool Compile::has_vbox_nodes() {
2641 if (C->_vector_reboxing_late_inlines.length() > 0) {
2642 return true;
2643 }
2644 for (int macro_idx = C->macro_count() - 1; macro_idx >= 0; macro_idx--) {
2645 Node * n = C->macro_node(macro_idx);
2646 assert(n->is_macro(), "only macro nodes expected here");
2647 if (n->Opcode() == Op_VectorUnbox || n->Opcode() == Op_VectorBox || n->Opcode() == Op_VectorBoxAllocate) {
2648 return true;
2649 }
2650 }
2651 return false;
2652 }
2653
2654 //---------------------------- Bitwise operation packing optimization ---------------------------
2655
2656 static bool is_vector_unary_bitwise_op(Node* n) {
2657 return n->Opcode() == Op_XorV &&
2658 VectorNode::is_vector_bitwise_not_pattern(n);
2659 }
2660
2661 static bool is_vector_binary_bitwise_op(Node* n) {
2662 switch (n->Opcode()) {
2663 case Op_AndV:
2664 case Op_OrV:
2665 return true;
2666
2667 case Op_XorV:
2668 return !is_vector_unary_bitwise_op(n);
2669
2670 default:
2671 return false;
2672 }
2673 }
2674
2675 static bool is_vector_ternary_bitwise_op(Node* n) {
2676 return n->Opcode() == Op_MacroLogicV;
2677 }
2678
2679 static bool is_vector_bitwise_op(Node* n) {
2680 return is_vector_unary_bitwise_op(n) ||
2681 is_vector_binary_bitwise_op(n) ||
2682 is_vector_ternary_bitwise_op(n);
2683 }
2684
2685 static bool is_vector_bitwise_cone_root(Node* n) {
2686 if (n->bottom_type()->isa_vectmask() || !is_vector_bitwise_op(n)) {
2687 return false;
2688 }
2689 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
2690 if (is_vector_bitwise_op(n->fast_out(i))) {
2691 return false;
2692 }
2693 }
2694 return true;
2695 }
2696
2697 static uint collect_unique_inputs(Node* n, Unique_Node_List& inputs) {
2698 uint cnt = 0;
2699 if (is_vector_bitwise_op(n)) {
2700 uint inp_cnt = n->is_predicated_vector() ? n->req()-1 : n->req();
2701 if (VectorNode::is_vector_bitwise_not_pattern(n)) {
2702 for (uint i = 1; i < inp_cnt; i++) {
2703 Node* in = n->in(i);
2704 bool skip = VectorNode::is_all_ones_vector(in);
2705 if (!skip && !inputs.member(in)) {
2706 inputs.push(in);
2707 cnt++;
2708 }
2709 }
2710 assert(cnt <= 1, "not unary");
2711 } else {
2712 uint last_req = inp_cnt;
2713 if (is_vector_ternary_bitwise_op(n)) {
2714 last_req = inp_cnt - 1; // skip last input
2715 }
2716 for (uint i = 1; i < last_req; i++) {
2717 Node* def = n->in(i);
2718 if (!inputs.member(def)) {
2719 inputs.push(def);
2720 cnt++;
2721 }
2722 }
2723 }
2724 } else { // not a bitwise operations
2725 if (!inputs.member(n)) {
2726 inputs.push(n);
2727 cnt++;
2728 }
2729 }
2730 return cnt;
2731 }
2732
2733 void Compile::collect_logic_cone_roots(Unique_Node_List& list) {
2734 Unique_Node_List useful_nodes;
2735 C->identify_useful_nodes(useful_nodes);
2736
2737 for (uint i = 0; i < useful_nodes.size(); i++) {
2738 Node* n = useful_nodes.at(i);
2739 if (is_vector_bitwise_cone_root(n)) {
2740 list.push(n);
2741 }
2742 }
2743 }
2744
2745 Node* Compile::xform_to_MacroLogicV(PhaseIterGVN& igvn,
2746 const TypeVect* vt,
2747 Unique_Node_List& partition,
2748 Unique_Node_List& inputs) {
2749 assert(partition.size() == 2 || partition.size() == 3, "not supported");
2750 assert(inputs.size() == 2 || inputs.size() == 3, "not supported");
2751 assert(Matcher::match_rule_supported_vector(Op_MacroLogicV, vt->length(), vt->element_basic_type()), "not supported");
2752
2753 Node* in1 = inputs.at(0);
2754 Node* in2 = inputs.at(1);
2755 Node* in3 = (inputs.size() == 3 ? inputs.at(2) : in2);
2756
2757 uint func = compute_truth_table(partition, inputs);
2758
2759 Node* pn = partition.at(partition.size() - 1);
2760 Node* mask = pn->is_predicated_vector() ? pn->in(pn->req()-1) : nullptr;
2761 return igvn.transform(MacroLogicVNode::make(igvn, in1, in2, in3, mask, func, vt));
2762 }
2763
2764 static uint extract_bit(uint func, uint pos) {
2765 return (func & (1 << pos)) >> pos;
2766 }
2767
2768 //
2769 // A macro logic node represents a truth table. It has 4 inputs,
2770 // First three inputs corresponds to 3 columns of a truth table
2771 // and fourth input captures the logic function.
2772 //
2773 // eg. fn = (in1 AND in2) OR in3;
2774 //
2775 // MacroNode(in1,in2,in3,fn)
2776 //
2777 // -----------------
2778 // in1 in2 in3 fn
2779 // -----------------
2780 // 0 0 0 0
2781 // 0 0 1 1
2782 // 0 1 0 0
2783 // 0 1 1 1
2784 // 1 0 0 0
2785 // 1 0 1 1
2786 // 1 1 0 1
2787 // 1 1 1 1
2788 //
2789
2790 uint Compile::eval_macro_logic_op(uint func, uint in1 , uint in2, uint in3) {
2791 int res = 0;
2792 for (int i = 0; i < 8; i++) {
2793 int bit1 = extract_bit(in1, i);
2794 int bit2 = extract_bit(in2, i);
2795 int bit3 = extract_bit(in3, i);
2796
2797 int func_bit_pos = (bit1 << 2 | bit2 << 1 | bit3);
2798 int func_bit = extract_bit(func, func_bit_pos);
2799
2800 res |= func_bit << i;
2801 }
2802 return res;
2803 }
2804
2805 static uint eval_operand(Node* n, HashTable<Node*,uint>& eval_map) {
2806 assert(n != nullptr, "");
2807 assert(eval_map.contains(n), "absent");
2808 return *(eval_map.get(n));
2809 }
2810
2811 static void eval_operands(Node* n,
2812 uint& func1, uint& func2, uint& func3,
2813 HashTable<Node*,uint>& eval_map) {
2814 assert(is_vector_bitwise_op(n), "");
2815
2816 if (is_vector_unary_bitwise_op(n)) {
2817 Node* opnd = n->in(1);
2818 if (VectorNode::is_vector_bitwise_not_pattern(n) && VectorNode::is_all_ones_vector(opnd)) {
2819 opnd = n->in(2);
2820 }
2821 func1 = eval_operand(opnd, eval_map);
2822 } else if (is_vector_binary_bitwise_op(n)) {
2823 func1 = eval_operand(n->in(1), eval_map);
2824 func2 = eval_operand(n->in(2), eval_map);
2825 } else {
2826 assert(is_vector_ternary_bitwise_op(n), "unknown operation");
2827 func1 = eval_operand(n->in(1), eval_map);
2828 func2 = eval_operand(n->in(2), eval_map);
2829 func3 = eval_operand(n->in(3), eval_map);
2830 }
2831 }
2832
2833 uint Compile::compute_truth_table(Unique_Node_List& partition, Unique_Node_List& inputs) {
2834 assert(inputs.size() <= 3, "sanity");
2835 ResourceMark rm;
2836 uint res = 0;
2837 HashTable<Node*,uint> eval_map;
2838
2839 // Populate precomputed functions for inputs.
2840 // Each input corresponds to one column of 3 input truth-table.
2841 uint input_funcs[] = { 0xAA, // (_, _, c) -> c
2842 0xCC, // (_, b, _) -> b
2843 0xF0 }; // (a, _, _) -> a
2844 for (uint i = 0; i < inputs.size(); i++) {
2845 eval_map.put(inputs.at(i), input_funcs[2-i]);
2846 }
2847
2848 for (uint i = 0; i < partition.size(); i++) {
2849 Node* n = partition.at(i);
2850
2851 uint func1 = 0, func2 = 0, func3 = 0;
2852 eval_operands(n, func1, func2, func3, eval_map);
2853
2854 switch (n->Opcode()) {
2855 case Op_OrV:
2856 assert(func3 == 0, "not binary");
2857 res = func1 | func2;
2858 break;
2859 case Op_AndV:
2860 assert(func3 == 0, "not binary");
2861 res = func1 & func2;
2862 break;
2863 case Op_XorV:
2864 if (VectorNode::is_vector_bitwise_not_pattern(n)) {
2865 assert(func2 == 0 && func3 == 0, "not unary");
2866 res = (~func1) & 0xFF;
2867 } else {
2868 assert(func3 == 0, "not binary");
2869 res = func1 ^ func2;
2870 }
2871 break;
2872 case Op_MacroLogicV:
2873 // Ordering of inputs may change during evaluation of sub-tree
2874 // containing MacroLogic node as a child node, thus a re-evaluation
2875 // makes sure that function is evaluated in context of current
2876 // inputs.
2877 res = eval_macro_logic_op(n->in(4)->get_int(), func1, func2, func3);
2878 break;
2879
2880 default: assert(false, "not supported: %s", n->Name());
2881 }
2882 assert(res <= 0xFF, "invalid");
2883 eval_map.put(n, res);
2884 }
2885 return res;
2886 }
2887
2888 // Criteria under which nodes gets packed into a macro logic node:-
2889 // 1) Parent and both child nodes are all unmasked or masked with
2890 // same predicates.
2891 // 2) Masked parent can be packed with left child if it is predicated
2892 // and both have same predicates.
2893 // 3) Masked parent can be packed with right child if its un-predicated
2894 // or has matching predication condition.
2895 // 4) An unmasked parent can be packed with an unmasked child.
2896 bool Compile::compute_logic_cone(Node* n, Unique_Node_List& partition, Unique_Node_List& inputs) {
2897 assert(partition.size() == 0, "not empty");
2898 assert(inputs.size() == 0, "not empty");
2899 if (is_vector_ternary_bitwise_op(n)) {
2900 return false;
2901 }
2902
2903 bool is_unary_op = is_vector_unary_bitwise_op(n);
2904 if (is_unary_op) {
2905 assert(collect_unique_inputs(n, inputs) == 1, "not unary");
2906 return false; // too few inputs
2907 }
2908
2909 bool pack_left_child = true;
2910 bool pack_right_child = true;
2911
2912 bool left_child_LOP = is_vector_bitwise_op(n->in(1));
2913 bool right_child_LOP = is_vector_bitwise_op(n->in(2));
2914
2915 int left_child_input_cnt = 0;
2916 int right_child_input_cnt = 0;
2917
2918 bool parent_is_predicated = n->is_predicated_vector();
2919 bool left_child_predicated = n->in(1)->is_predicated_vector();
2920 bool right_child_predicated = n->in(2)->is_predicated_vector();
2921
2922 Node* parent_pred = parent_is_predicated ? n->in(n->req()-1) : nullptr;
2923 Node* left_child_pred = left_child_predicated ? n->in(1)->in(n->in(1)->req()-1) : nullptr;
2924 Node* right_child_pred = right_child_predicated ? n->in(1)->in(n->in(1)->req()-1) : nullptr;
2925
2926 do {
2927 if (pack_left_child && left_child_LOP &&
2928 ((!parent_is_predicated && !left_child_predicated) ||
2929 ((parent_is_predicated && left_child_predicated &&
2930 parent_pred == left_child_pred)))) {
2931 partition.push(n->in(1));
2932 left_child_input_cnt = collect_unique_inputs(n->in(1), inputs);
2933 } else {
2934 inputs.push(n->in(1));
2935 left_child_input_cnt = 1;
2936 }
2937
2938 if (pack_right_child && right_child_LOP &&
2939 (!right_child_predicated ||
2940 (right_child_predicated && parent_is_predicated &&
2941 parent_pred == right_child_pred))) {
2942 partition.push(n->in(2));
2943 right_child_input_cnt = collect_unique_inputs(n->in(2), inputs);
2944 } else {
2945 inputs.push(n->in(2));
2946 right_child_input_cnt = 1;
2947 }
2948
2949 if (inputs.size() > 3) {
2950 assert(partition.size() > 0, "");
2951 inputs.clear();
2952 partition.clear();
2953 if (left_child_input_cnt > right_child_input_cnt) {
2954 pack_left_child = false;
2955 } else {
2956 pack_right_child = false;
2957 }
2958 } else {
2959 break;
2960 }
2961 } while(true);
2962
2963 if(partition.size()) {
2964 partition.push(n);
2965 }
2966
2967 return (partition.size() == 2 || partition.size() == 3) &&
2968 (inputs.size() == 2 || inputs.size() == 3);
2969 }
2970
2971 void Compile::process_logic_cone_root(PhaseIterGVN &igvn, Node *n, VectorSet &visited) {
2972 assert(is_vector_bitwise_op(n), "not a root");
2973
2974 visited.set(n->_idx);
2975
2976 // 1) Do a DFS walk over the logic cone.
2977 for (uint i = 1; i < n->req(); i++) {
2978 Node* in = n->in(i);
2979 if (!visited.test(in->_idx) && is_vector_bitwise_op(in)) {
2980 process_logic_cone_root(igvn, in, visited);
2981 }
2982 }
2983
2984 // 2) Bottom up traversal: Merge node[s] with
2985 // the parent to form macro logic node.
2986 Unique_Node_List partition;
2987 Unique_Node_List inputs;
2988 if (compute_logic_cone(n, partition, inputs)) {
2989 const TypeVect* vt = n->bottom_type()->is_vect();
2990 Node* pn = partition.at(partition.size() - 1);
2991 Node* mask = pn->is_predicated_vector() ? pn->in(pn->req()-1) : nullptr;
2992 if (mask == nullptr ||
2993 Matcher::match_rule_supported_vector_masked(Op_MacroLogicV, vt->length(), vt->element_basic_type())) {
2994 Node* macro_logic = xform_to_MacroLogicV(igvn, vt, partition, inputs);
2995 VectorNode::trace_new_vector(macro_logic, "MacroLogic");
2996 igvn.replace_node(n, macro_logic);
2997 }
2998 }
2999 }
3000
3001 void Compile::optimize_logic_cones(PhaseIterGVN &igvn) {
3002 ResourceMark rm;
3003 if (Matcher::match_rule_supported(Op_MacroLogicV)) {
3004 Unique_Node_List list;
3005 collect_logic_cone_roots(list);
3006
3007 while (list.size() > 0) {
3008 Node* n = list.pop();
3009 const TypeVect* vt = n->bottom_type()->is_vect();
3010 bool supported = Matcher::match_rule_supported_vector(Op_MacroLogicV, vt->length(), vt->element_basic_type());
3011 if (supported) {
3012 VectorSet visited(comp_arena());
3013 process_logic_cone_root(igvn, n, visited);
3014 }
3015 }
3016 }
3017 }
3018
3019 //------------------------------Code_Gen---------------------------------------
3020 // Given a graph, generate code for it
3021 void Compile::Code_Gen() {
3022 if (failing()) {
3023 return;
3024 }
3025
3026 // Perform instruction selection. You might think we could reclaim Matcher
3027 // memory PDQ, but actually the Matcher is used in generating spill code.
3028 // Internals of the Matcher (including some VectorSets) must remain live
3029 // for awhile - thus I cannot reclaim Matcher memory lest a VectorSet usage
3030 // set a bit in reclaimed memory.
3031
3032 // In debug mode can dump m._nodes.dump() for mapping of ideal to machine
3033 // nodes. Mapping is only valid at the root of each matched subtree.
3034 NOT_PRODUCT( verify_graph_edges(); )
3035
3036 Matcher matcher;
3037 _matcher = &matcher;
3038 {
3039 TracePhase tp(_t_matcher);
3040 matcher.match();
3041 if (failing()) {
3042 return;
3043 }
3044 }
3045 // In debug mode can dump m._nodes.dump() for mapping of ideal to machine
3046 // nodes. Mapping is only valid at the root of each matched subtree.
3047 NOT_PRODUCT( verify_graph_edges(); )
3048
3049 // If you have too many nodes, or if matching has failed, bail out
3050 check_node_count(0, "out of nodes matching instructions");
3051 if (failing()) {
3052 return;
3053 }
3054
3055 print_method(PHASE_MATCHING, 2);
3056
3057 // Build a proper-looking CFG
3058 PhaseCFG cfg(node_arena(), root(), matcher);
3059 if (failing()) {
3060 return;
3061 }
3062 _cfg = &cfg;
3063 {
3064 TracePhase tp(_t_scheduler);
3065 bool success = cfg.do_global_code_motion();
3066 if (!success) {
3067 return;
3068 }
3069
3070 print_method(PHASE_GLOBAL_CODE_MOTION, 2);
3071 NOT_PRODUCT( verify_graph_edges(); )
3072 cfg.verify();
3073 if (failing()) {
3074 return;
3075 }
3076 }
3077
3078 PhaseChaitin regalloc(unique(), cfg, matcher, false);
3079 _regalloc = ®alloc;
3080 {
3081 TracePhase tp(_t_registerAllocation);
3082 // Perform register allocation. After Chaitin, use-def chains are
3083 // no longer accurate (at spill code) and so must be ignored.
3084 // Node->LRG->reg mappings are still accurate.
3085 _regalloc->Register_Allocate();
3086
3087 // Bail out if the allocator builds too many nodes
3088 if (failing()) {
3089 return;
3090 }
3091
3092 print_method(PHASE_REGISTER_ALLOCATION, 2);
3093 }
3094
3095 // Prior to register allocation we kept empty basic blocks in case the
3096 // the allocator needed a place to spill. After register allocation we
3097 // are not adding any new instructions. If any basic block is empty, we
3098 // can now safely remove it.
3099 {
3100 TracePhase tp(_t_blockOrdering);
3101 cfg.remove_empty_blocks();
3102 if (do_freq_based_layout()) {
3103 PhaseBlockLayout layout(cfg);
3104 } else {
3105 cfg.set_loop_alignment();
3106 }
3107 cfg.fixup_flow();
3108 cfg.remove_unreachable_blocks();
3109 cfg.verify_dominator_tree();
3110 print_method(PHASE_BLOCK_ORDERING, 3);
3111 }
3112
3113 // Apply peephole optimizations
3114 if( OptoPeephole ) {
3115 TracePhase tp(_t_peephole);
3116 PhasePeephole peep( _regalloc, cfg);
3117 peep.do_transform();
3118 print_method(PHASE_PEEPHOLE, 3);
3119 }
3120
3121 // Do late expand if CPU requires this.
3122 if (Matcher::require_postalloc_expand) {
3123 TracePhase tp(_t_postalloc_expand);
3124 cfg.postalloc_expand(_regalloc);
3125 print_method(PHASE_POSTALLOC_EXPAND, 3);
3126 }
3127
3128 #ifdef ASSERT
3129 {
3130 CompilationMemoryStatistic::do_test_allocations();
3131 if (failing()) return;
3132 }
3133 #endif
3134
3135 // Convert Nodes to instruction bits in a buffer
3136 {
3137 TracePhase tp(_t_output);
3138 PhaseOutput output;
3139 output.Output();
3140 if (failing()) return;
3141 output.install();
3142 print_method(PHASE_FINAL_CODE, 1); // Compile::_output is not null here
3143 }
3144
3145 // He's dead, Jim.
3146 _cfg = (PhaseCFG*)((intptr_t)0xdeadbeef);
3147 _regalloc = (PhaseChaitin*)((intptr_t)0xdeadbeef);
3148 }
3149
3150 //------------------------------Final_Reshape_Counts---------------------------
3151 // This class defines counters to help identify when a method
3152 // may/must be executed using hardware with only 24-bit precision.
3153 struct Final_Reshape_Counts : public StackObj {
3154 int _call_count; // count non-inlined 'common' calls
3155 int _float_count; // count float ops requiring 24-bit precision
3156 int _double_count; // count double ops requiring more precision
3157 int _java_call_count; // count non-inlined 'java' calls
3158 int _inner_loop_count; // count loops which need alignment
3159 VectorSet _visited; // Visitation flags
3160 Node_List _tests; // Set of IfNodes & PCTableNodes
3161
3162 Final_Reshape_Counts() :
3163 _call_count(0), _float_count(0), _double_count(0),
3164 _java_call_count(0), _inner_loop_count(0) { }
3165
3166 void inc_call_count () { _call_count ++; }
3167 void inc_float_count () { _float_count ++; }
3168 void inc_double_count() { _double_count++; }
3169 void inc_java_call_count() { _java_call_count++; }
3170 void inc_inner_loop_count() { _inner_loop_count++; }
3171
3172 int get_call_count () const { return _call_count ; }
3173 int get_float_count () const { return _float_count ; }
3174 int get_double_count() const { return _double_count; }
3175 int get_java_call_count() const { return _java_call_count; }
3176 int get_inner_loop_count() const { return _inner_loop_count; }
3177 };
3178
3179 //------------------------------final_graph_reshaping_impl----------------------
3180 // Implement items 1-5 from final_graph_reshaping below.
3181 void Compile::final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes) {
3182
3183 if ( n->outcnt() == 0 ) return; // dead node
3184 uint nop = n->Opcode();
3185
3186 // Check for 2-input instruction with "last use" on right input.
3187 // Swap to left input. Implements item (2).
3188 if( n->req() == 3 && // two-input instruction
3189 n->in(1)->outcnt() > 1 && // left use is NOT a last use
3190 (!n->in(1)->is_Phi() || n->in(1)->in(2) != n) && // it is not data loop
3191 n->in(2)->outcnt() == 1 &&// right use IS a last use
3192 !n->in(2)->is_Con() ) { // right use is not a constant
3193 // Check for commutative opcode
3194 switch( nop ) {
3195 case Op_AddI: case Op_AddF: case Op_AddD: case Op_AddL:
3196 case Op_MaxI: case Op_MaxL: case Op_MaxF: case Op_MaxD:
3197 case Op_MinI: case Op_MinL: case Op_MinF: case Op_MinD:
3198 case Op_MulI: case Op_MulF: case Op_MulD: case Op_MulL:
3199 case Op_AndL: case Op_XorL: case Op_OrL:
3200 case Op_AndI: case Op_XorI: case Op_OrI: {
3201 // Move "last use" input to left by swapping inputs
3202 n->swap_edges(1, 2);
3203 break;
3204 }
3205 default:
3206 break;
3207 }
3208 }
3209
3210 #ifdef ASSERT
3211 if( n->is_Mem() ) {
3212 int alias_idx = get_alias_index(n->as_Mem()->adr_type());
3213 assert( n->in(0) != nullptr || alias_idx != Compile::AliasIdxRaw ||
3214 // oop will be recorded in oop map if load crosses safepoint
3215 (n->is_Load() && (n->as_Load()->bottom_type()->isa_oopptr() ||
3216 LoadNode::is_immutable_value(n->in(MemNode::Address)))),
3217 "raw memory operations should have control edge");
3218 }
3219 if (n->is_MemBar()) {
3220 MemBarNode* mb = n->as_MemBar();
3221 if (mb->trailing_store() || mb->trailing_load_store()) {
3222 assert(mb->leading_membar()->trailing_membar() == mb, "bad membar pair");
3223 Node* mem = BarrierSet::barrier_set()->barrier_set_c2()->step_over_gc_barrier(mb->in(MemBarNode::Precedent));
3224 assert((mb->trailing_store() && mem->is_Store() && mem->as_Store()->is_release()) ||
3225 (mb->trailing_load_store() && mem->is_LoadStore()), "missing mem op");
3226 } else if (mb->leading()) {
3227 assert(mb->trailing_membar()->leading_membar() == mb, "bad membar pair");
3228 }
3229 }
3230 #endif
3231 // Count FPU ops and common calls, implements item (3)
3232 bool gc_handled = BarrierSet::barrier_set()->barrier_set_c2()->final_graph_reshaping(this, n, nop, dead_nodes);
3233 if (!gc_handled) {
3234 final_graph_reshaping_main_switch(n, frc, nop, dead_nodes);
3235 }
3236
3237 // Collect CFG split points
3238 if (n->is_MultiBranch() && !n->is_RangeCheck()) {
3239 frc._tests.push(n);
3240 }
3241 }
3242
3243 void Compile::handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned) {
3244 if (!UseDivMod) {
3245 return;
3246 }
3247
3248 // Check if "a % b" and "a / b" both exist
3249 Node* d = n->find_similar(Op_DivIL(bt, is_unsigned));
3250 if (d == nullptr) {
3251 return;
3252 }
3253
3254 // Replace them with a fused divmod if supported
3255 if (Matcher::has_match_rule(Op_DivModIL(bt, is_unsigned))) {
3256 DivModNode* divmod = DivModNode::make(n, bt, is_unsigned);
3257 // If the divisor input for a Div (or Mod etc.) is not zero, then the control input of the Div is set to zero.
3258 // It could be that the divisor input is found not zero because its type is narrowed down by a CastII in the
3259 // subgraph for that input. Range check CastIIs are removed during final graph reshape. To preserve the dependency
3260 // carried by a CastII, precedence edges are added to the Div node. We need to transfer the precedence edges to the
3261 // DivMod node so the dependency is not lost.
3262 divmod->add_prec_from(n);
3263 divmod->add_prec_from(d);
3264 d->subsume_by(divmod->div_proj(), this);
3265 n->subsume_by(divmod->mod_proj(), this);
3266 } else {
3267 // Replace "a % b" with "a - ((a / b) * b)"
3268 Node* mult = MulNode::make(d, d->in(2), bt);
3269 Node* sub = SubNode::make(d->in(1), mult, bt);
3270 n->subsume_by(sub, this);
3271 }
3272 }
3273
3274 void Compile::final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes) {
3275 switch( nop ) {
3276 // Count all float operations that may use FPU
3277 case Op_AddF:
3278 case Op_SubF:
3279 case Op_MulF:
3280 case Op_DivF:
3281 case Op_NegF:
3282 case Op_ModF:
3283 case Op_ConvI2F:
3284 case Op_ConF:
3285 case Op_CmpF:
3286 case Op_CmpF3:
3287 case Op_StoreF:
3288 case Op_LoadF:
3289 // case Op_ConvL2F: // longs are split into 32-bit halves
3290 frc.inc_float_count();
3291 break;
3292
3293 case Op_ConvF2D:
3294 case Op_ConvD2F:
3295 frc.inc_float_count();
3296 frc.inc_double_count();
3297 break;
3298
3299 // Count all double operations that may use FPU
3300 case Op_AddD:
3301 case Op_SubD:
3302 case Op_MulD:
3303 case Op_DivD:
3304 case Op_NegD:
3305 case Op_ModD:
3306 case Op_ConvI2D:
3307 case Op_ConvD2I:
3308 // case Op_ConvL2D: // handled by leaf call
3309 // case Op_ConvD2L: // handled by leaf call
3310 case Op_ConD:
3311 case Op_CmpD:
3312 case Op_CmpD3:
3313 case Op_StoreD:
3314 case Op_LoadD:
3315 case Op_LoadD_unaligned:
3316 frc.inc_double_count();
3317 break;
3318 case Op_Opaque1: // Remove Opaque Nodes before matching
3319 n->subsume_by(n->in(1), this);
3320 break;
3321 case Op_CallLeafPure: {
3322 // If the pure call is not supported, then lower to a CallLeaf.
3323 if (!Matcher::match_rule_supported(Op_CallLeafPure)) {
3324 CallNode* call = n->as_Call();
3325 CallNode* new_call = new CallLeafNode(call->tf(), call->entry_point(),
3326 call->_name, TypeRawPtr::BOTTOM);
3327 new_call->init_req(TypeFunc::Control, call->in(TypeFunc::Control));
3328 new_call->init_req(TypeFunc::I_O, C->top());
3329 new_call->init_req(TypeFunc::Memory, C->top());
3330 new_call->init_req(TypeFunc::ReturnAdr, C->top());
3331 new_call->init_req(TypeFunc::FramePtr, C->top());
3332 for (unsigned int i = TypeFunc::Parms; i < call->tf()->domain()->cnt(); i++) {
3333 new_call->init_req(i, call->in(i));
3334 }
3335 n->subsume_by(new_call, this);
3336 }
3337 frc.inc_call_count();
3338 break;
3339 }
3340 case Op_CallStaticJava:
3341 case Op_CallJava:
3342 case Op_CallDynamicJava:
3343 frc.inc_java_call_count(); // Count java call site;
3344 case Op_CallRuntime:
3345 case Op_CallLeaf:
3346 case Op_CallLeafVector:
3347 case Op_CallLeafNoFP: {
3348 assert (n->is_Call(), "");
3349 CallNode *call = n->as_Call();
3350 // Count call sites where the FP mode bit would have to be flipped.
3351 // Do not count uncommon runtime calls:
3352 // uncommon_trap, _complete_monitor_locking, _complete_monitor_unlocking,
3353 // _new_Java, _new_typeArray, _new_objArray, _rethrow_Java, ...
3354 if (!call->is_CallStaticJava() || !call->as_CallStaticJava()->_name) {
3355 frc.inc_call_count(); // Count the call site
3356 } else { // See if uncommon argument is shared
3357 Node *n = call->in(TypeFunc::Parms);
3358 int nop = n->Opcode();
3359 // Clone shared simple arguments to uncommon calls, item (1).
3360 if (n->outcnt() > 1 &&
3361 !n->is_Proj() &&
3362 nop != Op_CreateEx &&
3363 nop != Op_CheckCastPP &&
3364 nop != Op_DecodeN &&
3365 nop != Op_DecodeNKlass &&
3366 !n->is_Mem() &&
3367 !n->is_Phi()) {
3368 Node *x = n->clone();
3369 call->set_req(TypeFunc::Parms, x);
3370 }
3371 }
3372 break;
3373 }
3374 case Op_StoreB:
3375 case Op_StoreC:
3376 case Op_StoreI:
3377 case Op_StoreL:
3378 case Op_CompareAndSwapB:
3379 case Op_CompareAndSwapS:
3380 case Op_CompareAndSwapI:
3381 case Op_CompareAndSwapL:
3382 case Op_CompareAndSwapP:
3383 case Op_CompareAndSwapN:
3384 case Op_WeakCompareAndSwapB:
3385 case Op_WeakCompareAndSwapS:
3386 case Op_WeakCompareAndSwapI:
3387 case Op_WeakCompareAndSwapL:
3388 case Op_WeakCompareAndSwapP:
3389 case Op_WeakCompareAndSwapN:
3390 case Op_CompareAndExchangeB:
3391 case Op_CompareAndExchangeS:
3392 case Op_CompareAndExchangeI:
3393 case Op_CompareAndExchangeL:
3394 case Op_CompareAndExchangeP:
3395 case Op_CompareAndExchangeN:
3396 case Op_GetAndAddS:
3397 case Op_GetAndAddB:
3398 case Op_GetAndAddI:
3399 case Op_GetAndAddL:
3400 case Op_GetAndSetS:
3401 case Op_GetAndSetB:
3402 case Op_GetAndSetI:
3403 case Op_GetAndSetL:
3404 case Op_GetAndSetP:
3405 case Op_GetAndSetN:
3406 case Op_StoreP:
3407 case Op_StoreN:
3408 case Op_StoreNKlass:
3409 case Op_LoadB:
3410 case Op_LoadUB:
3411 case Op_LoadUS:
3412 case Op_LoadI:
3413 case Op_LoadKlass:
3414 case Op_LoadNKlass:
3415 case Op_LoadL:
3416 case Op_LoadL_unaligned:
3417 case Op_LoadP:
3418 case Op_LoadN:
3419 case Op_LoadRange:
3420 case Op_LoadS:
3421 break;
3422
3423 case Op_AddP: { // Assert sane base pointers
3424 Node *addp = n->in(AddPNode::Address);
3425 assert(n->as_AddP()->address_input_has_same_base(), "Base pointers must match (addp %u)", addp->_idx );
3426 #ifdef _LP64
3427 if ((UseCompressedOops || UseCompressedClassPointers) &&
3428 addp->Opcode() == Op_ConP &&
3429 addp == n->in(AddPNode::Base) &&
3430 n->in(AddPNode::Offset)->is_Con()) {
3431 // If the transformation of ConP to ConN+DecodeN is beneficial depends
3432 // on the platform and on the compressed oops mode.
3433 // Use addressing with narrow klass to load with offset on x86.
3434 // Some platforms can use the constant pool to load ConP.
3435 // Do this transformation here since IGVN will convert ConN back to ConP.
3436 const Type* t = addp->bottom_type();
3437 bool is_oop = t->isa_oopptr() != nullptr;
3438 bool is_klass = t->isa_klassptr() != nullptr;
3439
3440 if ((is_oop && UseCompressedOops && Matcher::const_oop_prefer_decode() ) ||
3441 (is_klass && UseCompressedClassPointers && Matcher::const_klass_prefer_decode() &&
3442 t->isa_klassptr()->exact_klass()->is_in_encoding_range())) {
3443 Node* nn = nullptr;
3444
3445 int op = is_oop ? Op_ConN : Op_ConNKlass;
3446
3447 // Look for existing ConN node of the same exact type.
3448 Node* r = root();
3449 uint cnt = r->outcnt();
3450 for (uint i = 0; i < cnt; i++) {
3451 Node* m = r->raw_out(i);
3452 if (m!= nullptr && m->Opcode() == op &&
3453 m->bottom_type()->make_ptr() == t) {
3454 nn = m;
3455 break;
3456 }
3457 }
3458 if (nn != nullptr) {
3459 // Decode a narrow oop to match address
3460 // [R12 + narrow_oop_reg<<3 + offset]
3461 if (is_oop) {
3462 nn = new DecodeNNode(nn, t);
3463 } else {
3464 nn = new DecodeNKlassNode(nn, t);
3465 }
3466 // Check for succeeding AddP which uses the same Base.
3467 // Otherwise we will run into the assertion above when visiting that guy.
3468 for (uint i = 0; i < n->outcnt(); ++i) {
3469 Node *out_i = n->raw_out(i);
3470 if (out_i && out_i->is_AddP() && out_i->in(AddPNode::Base) == addp) {
3471 out_i->set_req(AddPNode::Base, nn);
3472 #ifdef ASSERT
3473 for (uint j = 0; j < out_i->outcnt(); ++j) {
3474 Node *out_j = out_i->raw_out(j);
3475 assert(out_j == nullptr || !out_j->is_AddP() || out_j->in(AddPNode::Base) != addp,
3476 "more than 2 AddP nodes in a chain (out_j %u)", out_j->_idx);
3477 }
3478 #endif
3479 }
3480 }
3481 n->set_req(AddPNode::Base, nn);
3482 n->set_req(AddPNode::Address, nn);
3483 if (addp->outcnt() == 0) {
3484 addp->disconnect_inputs(this);
3485 }
3486 }
3487 }
3488 }
3489 #endif
3490 break;
3491 }
3492
3493 case Op_CastPP: {
3494 // Remove CastPP nodes to gain more freedom during scheduling but
3495 // keep the dependency they encode as control or precedence edges
3496 // (if control is set already) on memory operations. Some CastPP
3497 // nodes don't have a control (don't carry a dependency): skip
3498 // those.
3499 if (n->in(0) != nullptr) {
3500 ResourceMark rm;
3501 Unique_Node_List wq;
3502 wq.push(n);
3503 for (uint next = 0; next < wq.size(); ++next) {
3504 Node *m = wq.at(next);
3505 for (DUIterator_Fast imax, i = m->fast_outs(imax); i < imax; i++) {
3506 Node* use = m->fast_out(i);
3507 if (use->is_Mem() || use->is_EncodeNarrowPtr()) {
3508 use->ensure_control_or_add_prec(n->in(0));
3509 } else {
3510 switch(use->Opcode()) {
3511 case Op_AddP:
3512 case Op_DecodeN:
3513 case Op_DecodeNKlass:
3514 case Op_CheckCastPP:
3515 case Op_CastPP:
3516 wq.push(use);
3517 break;
3518 }
3519 }
3520 }
3521 }
3522 }
3523 const bool is_LP64 = LP64_ONLY(true) NOT_LP64(false);
3524 if (is_LP64 && n->in(1)->is_DecodeN() && Matcher::gen_narrow_oop_implicit_null_checks()) {
3525 Node* in1 = n->in(1);
3526 const Type* t = n->bottom_type();
3527 Node* new_in1 = in1->clone();
3528 new_in1->as_DecodeN()->set_type(t);
3529
3530 if (!Matcher::narrow_oop_use_complex_address()) {
3531 //
3532 // x86, ARM and friends can handle 2 adds in addressing mode
3533 // and Matcher can fold a DecodeN node into address by using
3534 // a narrow oop directly and do implicit null check in address:
3535 //
3536 // [R12 + narrow_oop_reg<<3 + offset]
3537 // NullCheck narrow_oop_reg
3538 //
3539 // On other platforms (Sparc) we have to keep new DecodeN node and
3540 // use it to do implicit null check in address:
3541 //
3542 // decode_not_null narrow_oop_reg, base_reg
3543 // [base_reg + offset]
3544 // NullCheck base_reg
3545 //
3546 // Pin the new DecodeN node to non-null path on these platform (Sparc)
3547 // to keep the information to which null check the new DecodeN node
3548 // corresponds to use it as value in implicit_null_check().
3549 //
3550 new_in1->set_req(0, n->in(0));
3551 }
3552
3553 n->subsume_by(new_in1, this);
3554 if (in1->outcnt() == 0) {
3555 in1->disconnect_inputs(this);
3556 }
3557 } else {
3558 n->subsume_by(n->in(1), this);
3559 if (n->outcnt() == 0) {
3560 n->disconnect_inputs(this);
3561 }
3562 }
3563 break;
3564 }
3565 case Op_CastII: {
3566 n->as_CastII()->remove_range_check_cast(this);
3567 break;
3568 }
3569 #ifdef _LP64
3570 case Op_CmpP:
3571 // Do this transformation here to preserve CmpPNode::sub() and
3572 // other TypePtr related Ideal optimizations (for example, ptr nullness).
3573 if (n->in(1)->is_DecodeNarrowPtr() || n->in(2)->is_DecodeNarrowPtr()) {
3574 Node* in1 = n->in(1);
3575 Node* in2 = n->in(2);
3576 if (!in1->is_DecodeNarrowPtr()) {
3577 in2 = in1;
3578 in1 = n->in(2);
3579 }
3580 assert(in1->is_DecodeNarrowPtr(), "sanity");
3581
3582 Node* new_in2 = nullptr;
3583 if (in2->is_DecodeNarrowPtr()) {
3584 assert(in2->Opcode() == in1->Opcode(), "must be same node type");
3585 new_in2 = in2->in(1);
3586 } else if (in2->Opcode() == Op_ConP) {
3587 const Type* t = in2->bottom_type();
3588 if (t == TypePtr::NULL_PTR) {
3589 assert(in1->is_DecodeN(), "compare klass to null?");
3590 // Don't convert CmpP null check into CmpN if compressed
3591 // oops implicit null check is not generated.
3592 // This will allow to generate normal oop implicit null check.
3593 if (Matcher::gen_narrow_oop_implicit_null_checks())
3594 new_in2 = ConNode::make(TypeNarrowOop::NULL_PTR);
3595 //
3596 // This transformation together with CastPP transformation above
3597 // will generated code for implicit null checks for compressed oops.
3598 //
3599 // The original code after Optimize()
3600 //
3601 // LoadN memory, narrow_oop_reg
3602 // decode narrow_oop_reg, base_reg
3603 // CmpP base_reg, nullptr
3604 // CastPP base_reg // NotNull
3605 // Load [base_reg + offset], val_reg
3606 //
3607 // after these transformations will be
3608 //
3609 // LoadN memory, narrow_oop_reg
3610 // CmpN narrow_oop_reg, nullptr
3611 // decode_not_null narrow_oop_reg, base_reg
3612 // Load [base_reg + offset], val_reg
3613 //
3614 // and the uncommon path (== nullptr) will use narrow_oop_reg directly
3615 // since narrow oops can be used in debug info now (see the code in
3616 // final_graph_reshaping_walk()).
3617 //
3618 // At the end the code will be matched to
3619 // on x86:
3620 //
3621 // Load_narrow_oop memory, narrow_oop_reg
3622 // Load [R12 + narrow_oop_reg<<3 + offset], val_reg
3623 // NullCheck narrow_oop_reg
3624 //
3625 // and on sparc:
3626 //
3627 // Load_narrow_oop memory, narrow_oop_reg
3628 // decode_not_null narrow_oop_reg, base_reg
3629 // Load [base_reg + offset], val_reg
3630 // NullCheck base_reg
3631 //
3632 } else if (t->isa_oopptr()) {
3633 new_in2 = ConNode::make(t->make_narrowoop());
3634 } else if (t->isa_klassptr()) {
3635 ciKlass* klass = t->is_klassptr()->exact_klass();
3636 if (klass->is_in_encoding_range()) {
3637 new_in2 = ConNode::make(t->make_narrowklass());
3638 }
3639 }
3640 }
3641 if (new_in2 != nullptr) {
3642 Node* cmpN = new CmpNNode(in1->in(1), new_in2);
3643 n->subsume_by(cmpN, this);
3644 if (in1->outcnt() == 0) {
3645 in1->disconnect_inputs(this);
3646 }
3647 if (in2->outcnt() == 0) {
3648 in2->disconnect_inputs(this);
3649 }
3650 }
3651 }
3652 break;
3653
3654 case Op_DecodeN:
3655 case Op_DecodeNKlass:
3656 assert(!n->in(1)->is_EncodeNarrowPtr(), "should be optimized out");
3657 // DecodeN could be pinned when it can't be fold into
3658 // an address expression, see the code for Op_CastPP above.
3659 assert(n->in(0) == nullptr || (UseCompressedOops && !Matcher::narrow_oop_use_complex_address()), "no control");
3660 break;
3661
3662 case Op_EncodeP:
3663 case Op_EncodePKlass: {
3664 Node* in1 = n->in(1);
3665 if (in1->is_DecodeNarrowPtr()) {
3666 n->subsume_by(in1->in(1), this);
3667 } else if (in1->Opcode() == Op_ConP) {
3668 const Type* t = in1->bottom_type();
3669 if (t == TypePtr::NULL_PTR) {
3670 assert(t->isa_oopptr(), "null klass?");
3671 n->subsume_by(ConNode::make(TypeNarrowOop::NULL_PTR), this);
3672 } else if (t->isa_oopptr()) {
3673 n->subsume_by(ConNode::make(t->make_narrowoop()), this);
3674 } else if (t->isa_klassptr()) {
3675 ciKlass* klass = t->is_klassptr()->exact_klass();
3676 if (klass->is_in_encoding_range()) {
3677 n->subsume_by(ConNode::make(t->make_narrowklass()), this);
3678 } else {
3679 assert(false, "unencodable klass in ConP -> EncodeP");
3680 C->record_failure("unencodable klass in ConP -> EncodeP");
3681 }
3682 }
3683 }
3684 if (in1->outcnt() == 0) {
3685 in1->disconnect_inputs(this);
3686 }
3687 break;
3688 }
3689
3690 case Op_Proj: {
3691 if (OptimizeStringConcat || IncrementalInline) {
3692 ProjNode* proj = n->as_Proj();
3693 if (proj->_is_io_use) {
3694 assert(proj->_con == TypeFunc::I_O || proj->_con == TypeFunc::Memory, "");
3695 // Separate projections were used for the exception path which
3696 // are normally removed by a late inline. If it wasn't inlined
3697 // then they will hang around and should just be replaced with
3698 // the original one. Merge them.
3699 Node* non_io_proj = proj->in(0)->as_Multi()->proj_out_or_null(proj->_con, false /*is_io_use*/);
3700 if (non_io_proj != nullptr) {
3701 proj->subsume_by(non_io_proj , this);
3702 }
3703 }
3704 }
3705 break;
3706 }
3707
3708 case Op_Phi:
3709 if (n->as_Phi()->bottom_type()->isa_narrowoop() || n->as_Phi()->bottom_type()->isa_narrowklass()) {
3710 // The EncodeP optimization may create Phi with the same edges
3711 // for all paths. It is not handled well by Register Allocator.
3712 Node* unique_in = n->in(1);
3713 assert(unique_in != nullptr, "");
3714 uint cnt = n->req();
3715 for (uint i = 2; i < cnt; i++) {
3716 Node* m = n->in(i);
3717 assert(m != nullptr, "");
3718 if (unique_in != m)
3719 unique_in = nullptr;
3720 }
3721 if (unique_in != nullptr) {
3722 n->subsume_by(unique_in, this);
3723 }
3724 }
3725 break;
3726
3727 #endif
3728
3729 case Op_ModI:
3730 handle_div_mod_op(n, T_INT, false);
3731 break;
3732
3733 case Op_ModL:
3734 handle_div_mod_op(n, T_LONG, false);
3735 break;
3736
3737 case Op_UModI:
3738 handle_div_mod_op(n, T_INT, true);
3739 break;
3740
3741 case Op_UModL:
3742 handle_div_mod_op(n, T_LONG, true);
3743 break;
3744
3745 case Op_LoadVector:
3746 case Op_StoreVector:
3747 #ifdef ASSERT
3748 // Add VerifyVectorAlignment node between adr and load / store.
3749 if (VerifyAlignVector && Matcher::has_match_rule(Op_VerifyVectorAlignment)) {
3750 bool must_verify_alignment = n->is_LoadVector() ? n->as_LoadVector()->must_verify_alignment() :
3751 n->as_StoreVector()->must_verify_alignment();
3752 if (must_verify_alignment) {
3753 jlong vector_width = n->is_LoadVector() ? n->as_LoadVector()->memory_size() :
3754 n->as_StoreVector()->memory_size();
3755 // The memory access should be aligned to the vector width in bytes.
3756 // However, the underlying array is possibly less well aligned, but at least
3757 // to ObjectAlignmentInBytes. Hence, even if multiple arrays are accessed in
3758 // a loop we can expect at least the following alignment:
3759 jlong guaranteed_alignment = MIN2(vector_width, (jlong)ObjectAlignmentInBytes);
3760 assert(2 <= guaranteed_alignment && guaranteed_alignment <= 64, "alignment must be in range");
3761 assert(is_power_of_2(guaranteed_alignment), "alignment must be power of 2");
3762 // Create mask from alignment. e.g. 0b1000 -> 0b0111
3763 jlong mask = guaranteed_alignment - 1;
3764 Node* mask_con = ConLNode::make(mask);
3765 VerifyVectorAlignmentNode* va = new VerifyVectorAlignmentNode(n->in(MemNode::Address), mask_con);
3766 n->set_req(MemNode::Address, va);
3767 }
3768 }
3769 #endif
3770 break;
3771
3772 case Op_LoadVectorGather:
3773 case Op_StoreVectorScatter:
3774 case Op_LoadVectorGatherMasked:
3775 case Op_StoreVectorScatterMasked:
3776 case Op_VectorCmpMasked:
3777 case Op_VectorMaskGen:
3778 case Op_LoadVectorMasked:
3779 case Op_StoreVectorMasked:
3780 break;
3781
3782 case Op_AddReductionVI:
3783 case Op_AddReductionVL:
3784 case Op_AddReductionVF:
3785 case Op_AddReductionVD:
3786 case Op_MulReductionVI:
3787 case Op_MulReductionVL:
3788 case Op_MulReductionVF:
3789 case Op_MulReductionVD:
3790 case Op_MinReductionV:
3791 case Op_MaxReductionV:
3792 case Op_AndReductionV:
3793 case Op_OrReductionV:
3794 case Op_XorReductionV:
3795 break;
3796
3797 case Op_PackB:
3798 case Op_PackS:
3799 case Op_PackI:
3800 case Op_PackF:
3801 case Op_PackL:
3802 case Op_PackD:
3803 if (n->req()-1 > 2) {
3804 // Replace many operand PackNodes with a binary tree for matching
3805 PackNode* p = (PackNode*) n;
3806 Node* btp = p->binary_tree_pack(1, n->req());
3807 n->subsume_by(btp, this);
3808 }
3809 break;
3810 case Op_Loop:
3811 assert(!n->as_Loop()->is_loop_nest_inner_loop() || _loop_opts_cnt == 0, "should have been turned into a counted loop");
3812 case Op_CountedLoop:
3813 case Op_LongCountedLoop:
3814 case Op_OuterStripMinedLoop:
3815 if (n->as_Loop()->is_inner_loop()) {
3816 frc.inc_inner_loop_count();
3817 }
3818 n->as_Loop()->verify_strip_mined(0);
3819 break;
3820 case Op_LShiftI:
3821 case Op_RShiftI:
3822 case Op_URShiftI:
3823 case Op_LShiftL:
3824 case Op_RShiftL:
3825 case Op_URShiftL:
3826 if (Matcher::need_masked_shift_count) {
3827 // The cpu's shift instructions don't restrict the count to the
3828 // lower 5/6 bits. We need to do the masking ourselves.
3829 Node* in2 = n->in(2);
3830 juint mask = (n->bottom_type() == TypeInt::INT) ? (BitsPerInt - 1) : (BitsPerLong - 1);
3831 const TypeInt* t = in2->find_int_type();
3832 if (t != nullptr && t->is_con()) {
3833 juint shift = t->get_con();
3834 if (shift > mask) { // Unsigned cmp
3835 n->set_req(2, ConNode::make(TypeInt::make(shift & mask)));
3836 }
3837 } else {
3838 if (t == nullptr || t->_lo < 0 || t->_hi > (int)mask) {
3839 Node* shift = new AndINode(in2, ConNode::make(TypeInt::make(mask)));
3840 n->set_req(2, shift);
3841 }
3842 }
3843 if (in2->outcnt() == 0) { // Remove dead node
3844 in2->disconnect_inputs(this);
3845 }
3846 }
3847 break;
3848 case Op_MemBarStoreStore:
3849 case Op_MemBarRelease:
3850 // Break the link with AllocateNode: it is no longer useful and
3851 // confuses register allocation.
3852 if (n->req() > MemBarNode::Precedent) {
3853 n->set_req(MemBarNode::Precedent, top());
3854 }
3855 break;
3856 case Op_MemBarAcquire: {
3857 if (n->as_MemBar()->trailing_load() && n->req() > MemBarNode::Precedent) {
3858 // At parse time, the trailing MemBarAcquire for a volatile load
3859 // is created with an edge to the load. After optimizations,
3860 // that input may be a chain of Phis. If those phis have no
3861 // other use, then the MemBarAcquire keeps them alive and
3862 // register allocation can be confused.
3863 dead_nodes.push(n->in(MemBarNode::Precedent));
3864 n->set_req(MemBarNode::Precedent, top());
3865 }
3866 break;
3867 }
3868 case Op_Blackhole:
3869 break;
3870 case Op_RangeCheck: {
3871 RangeCheckNode* rc = n->as_RangeCheck();
3872 Node* iff = new IfNode(rc->in(0), rc->in(1), rc->_prob, rc->_fcnt);
3873 n->subsume_by(iff, this);
3874 frc._tests.push(iff);
3875 break;
3876 }
3877 case Op_ConvI2L: {
3878 if (!Matcher::convi2l_type_required) {
3879 // Code generation on some platforms doesn't need accurate
3880 // ConvI2L types. Widening the type can help remove redundant
3881 // address computations.
3882 n->as_Type()->set_type(TypeLong::INT);
3883 ResourceMark rm;
3884 Unique_Node_List wq;
3885 wq.push(n);
3886 for (uint next = 0; next < wq.size(); next++) {
3887 Node *m = wq.at(next);
3888
3889 for(;;) {
3890 // Loop over all nodes with identical inputs edges as m
3891 Node* k = m->find_similar(m->Opcode());
3892 if (k == nullptr) {
3893 break;
3894 }
3895 // Push their uses so we get a chance to remove node made
3896 // redundant
3897 for (DUIterator_Fast imax, i = k->fast_outs(imax); i < imax; i++) {
3898 Node* u = k->fast_out(i);
3899 if (u->Opcode() == Op_LShiftL ||
3900 u->Opcode() == Op_AddL ||
3901 u->Opcode() == Op_SubL ||
3902 u->Opcode() == Op_AddP) {
3903 wq.push(u);
3904 }
3905 }
3906 // Replace all nodes with identical edges as m with m
3907 k->subsume_by(m, this);
3908 }
3909 }
3910 }
3911 break;
3912 }
3913 case Op_CmpUL: {
3914 if (!Matcher::has_match_rule(Op_CmpUL)) {
3915 // No support for unsigned long comparisons
3916 ConINode* sign_pos = new ConINode(TypeInt::make(BitsPerLong - 1));
3917 Node* sign_bit_mask = new RShiftLNode(n->in(1), sign_pos);
3918 Node* orl = new OrLNode(n->in(1), sign_bit_mask);
3919 ConLNode* remove_sign_mask = new ConLNode(TypeLong::make(max_jlong));
3920 Node* andl = new AndLNode(orl, remove_sign_mask);
3921 Node* cmp = new CmpLNode(andl, n->in(2));
3922 n->subsume_by(cmp, this);
3923 }
3924 break;
3925 }
3926 #ifdef ASSERT
3927 case Op_ConNKlass: {
3928 const TypePtr* tp = n->as_Type()->type()->make_ptr();
3929 ciKlass* klass = tp->is_klassptr()->exact_klass();
3930 assert(klass->is_in_encoding_range(), "klass cannot be compressed");
3931 break;
3932 }
3933 #endif
3934 default:
3935 assert(!n->is_Call(), "");
3936 assert(!n->is_Mem(), "");
3937 assert(nop != Op_ProfileBoolean, "should be eliminated during IGVN");
3938 break;
3939 }
3940 }
3941
3942 //------------------------------final_graph_reshaping_walk---------------------
3943 // Replacing Opaque nodes with their input in final_graph_reshaping_impl(),
3944 // requires that the walk visits a node's inputs before visiting the node.
3945 void Compile::final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes) {
3946 Unique_Node_List sfpt;
3947
3948 frc._visited.set(root->_idx); // first, mark node as visited
3949 uint cnt = root->req();
3950 Node *n = root;
3951 uint i = 0;
3952 while (true) {
3953 if (i < cnt) {
3954 // Place all non-visited non-null inputs onto stack
3955 Node* m = n->in(i);
3956 ++i;
3957 if (m != nullptr && !frc._visited.test_set(m->_idx)) {
3958 if (m->is_SafePoint() && m->as_SafePoint()->jvms() != nullptr) {
3959 // compute worst case interpreter size in case of a deoptimization
3960 update_interpreter_frame_size(m->as_SafePoint()->jvms()->interpreter_frame_size());
3961
3962 sfpt.push(m);
3963 }
3964 cnt = m->req();
3965 nstack.push(n, i); // put on stack parent and next input's index
3966 n = m;
3967 i = 0;
3968 }
3969 } else {
3970 // Now do post-visit work
3971 final_graph_reshaping_impl(n, frc, dead_nodes);
3972 if (nstack.is_empty())
3973 break; // finished
3974 n = nstack.node(); // Get node from stack
3975 cnt = n->req();
3976 i = nstack.index();
3977 nstack.pop(); // Shift to the next node on stack
3978 }
3979 }
3980
3981 // Skip next transformation if compressed oops are not used.
3982 if ((UseCompressedOops && !Matcher::gen_narrow_oop_implicit_null_checks()) ||
3983 (!UseCompressedOops && !UseCompressedClassPointers))
3984 return;
3985
3986 // Go over safepoints nodes to skip DecodeN/DecodeNKlass nodes for debug edges.
3987 // It could be done for an uncommon traps or any safepoints/calls
3988 // if the DecodeN/DecodeNKlass node is referenced only in a debug info.
3989 while (sfpt.size() > 0) {
3990 n = sfpt.pop();
3991 JVMState *jvms = n->as_SafePoint()->jvms();
3992 assert(jvms != nullptr, "sanity");
3993 int start = jvms->debug_start();
3994 int end = n->req();
3995 bool is_uncommon = (n->is_CallStaticJava() &&
3996 n->as_CallStaticJava()->uncommon_trap_request() != 0);
3997 for (int j = start; j < end; j++) {
3998 Node* in = n->in(j);
3999 if (in->is_DecodeNarrowPtr()) {
4000 bool safe_to_skip = true;
4001 if (!is_uncommon ) {
4002 // Is it safe to skip?
4003 for (uint i = 0; i < in->outcnt(); i++) {
4004 Node* u = in->raw_out(i);
4005 if (!u->is_SafePoint() ||
4006 (u->is_Call() && u->as_Call()->has_non_debug_use(n))) {
4007 safe_to_skip = false;
4008 }
4009 }
4010 }
4011 if (safe_to_skip) {
4012 n->set_req(j, in->in(1));
4013 }
4014 if (in->outcnt() == 0) {
4015 in->disconnect_inputs(this);
4016 }
4017 }
4018 }
4019 }
4020 }
4021
4022 //------------------------------final_graph_reshaping--------------------------
4023 // Final Graph Reshaping.
4024 //
4025 // (1) Clone simple inputs to uncommon calls, so they can be scheduled late
4026 // and not commoned up and forced early. Must come after regular
4027 // optimizations to avoid GVN undoing the cloning. Clone constant
4028 // inputs to Loop Phis; these will be split by the allocator anyways.
4029 // Remove Opaque nodes.
4030 // (2) Move last-uses by commutative operations to the left input to encourage
4031 // Intel update-in-place two-address operations and better register usage
4032 // on RISCs. Must come after regular optimizations to avoid GVN Ideal
4033 // calls canonicalizing them back.
4034 // (3) Count the number of double-precision FP ops, single-precision FP ops
4035 // and call sites. On Intel, we can get correct rounding either by
4036 // forcing singles to memory (requires extra stores and loads after each
4037 // FP bytecode) or we can set a rounding mode bit (requires setting and
4038 // clearing the mode bit around call sites). The mode bit is only used
4039 // if the relative frequency of single FP ops to calls is low enough.
4040 // This is a key transform for SPEC mpeg_audio.
4041 // (4) Detect infinite loops; blobs of code reachable from above but not
4042 // below. Several of the Code_Gen algorithms fail on such code shapes,
4043 // so we simply bail out. Happens a lot in ZKM.jar, but also happens
4044 // from time to time in other codes (such as -Xcomp finalizer loops, etc).
4045 // Detection is by looking for IfNodes where only 1 projection is
4046 // reachable from below or CatchNodes missing some targets.
4047 // (5) Assert for insane oop offsets in debug mode.
4048
4049 bool Compile::final_graph_reshaping() {
4050 // an infinite loop may have been eliminated by the optimizer,
4051 // in which case the graph will be empty.
4052 if (root()->req() == 1) {
4053 // Do not compile method that is only a trivial infinite loop,
4054 // since the content of the loop may have been eliminated.
4055 record_method_not_compilable("trivial infinite loop");
4056 return true;
4057 }
4058
4059 // Expensive nodes have their control input set to prevent the GVN
4060 // from freely commoning them. There's no GVN beyond this point so
4061 // no need to keep the control input. We want the expensive nodes to
4062 // be freely moved to the least frequent code path by gcm.
4063 assert(OptimizeExpensiveOps || expensive_count() == 0, "optimization off but list non empty?");
4064 for (int i = 0; i < expensive_count(); i++) {
4065 _expensive_nodes.at(i)->set_req(0, nullptr);
4066 }
4067
4068 Final_Reshape_Counts frc;
4069
4070 // Visit everybody reachable!
4071 // Allocate stack of size C->live_nodes()/2 to avoid frequent realloc
4072 Node_Stack nstack(live_nodes() >> 1);
4073 Unique_Node_List dead_nodes;
4074 final_graph_reshaping_walk(nstack, root(), frc, dead_nodes);
4075
4076 // Check for unreachable (from below) code (i.e., infinite loops).
4077 for( uint i = 0; i < frc._tests.size(); i++ ) {
4078 MultiBranchNode *n = frc._tests[i]->as_MultiBranch();
4079 // Get number of CFG targets.
4080 // Note that PCTables include exception targets after calls.
4081 uint required_outcnt = n->required_outcnt();
4082 if (n->outcnt() != required_outcnt) {
4083 // Check for a few special cases. Rethrow Nodes never take the
4084 // 'fall-thru' path, so expected kids is 1 less.
4085 if (n->is_PCTable() && n->in(0) && n->in(0)->in(0)) {
4086 if (n->in(0)->in(0)->is_Call()) {
4087 CallNode* call = n->in(0)->in(0)->as_Call();
4088 if (call->entry_point() == OptoRuntime::rethrow_stub()) {
4089 required_outcnt--; // Rethrow always has 1 less kid
4090 } else if (call->req() > TypeFunc::Parms &&
4091 call->is_CallDynamicJava()) {
4092 // Check for null receiver. In such case, the optimizer has
4093 // detected that the virtual call will always result in a null
4094 // pointer exception. The fall-through projection of this CatchNode
4095 // will not be populated.
4096 Node* arg0 = call->in(TypeFunc::Parms);
4097 if (arg0->is_Type() &&
4098 arg0->as_Type()->type()->higher_equal(TypePtr::NULL_PTR)) {
4099 required_outcnt--;
4100 }
4101 } else if (call->entry_point() == OptoRuntime::new_array_Java() ||
4102 call->entry_point() == OptoRuntime::new_array_nozero_Java()) {
4103 // Check for illegal array length. In such case, the optimizer has
4104 // detected that the allocation attempt will always result in an
4105 // exception. There is no fall-through projection of this CatchNode .
4106 assert(call->is_CallStaticJava(), "static call expected");
4107 assert(call->req() == call->jvms()->endoff() + 1, "missing extra input");
4108 uint valid_length_test_input = call->req() - 1;
4109 Node* valid_length_test = call->in(valid_length_test_input);
4110 call->del_req(valid_length_test_input);
4111 if (valid_length_test->find_int_con(1) == 0) {
4112 required_outcnt--;
4113 }
4114 dead_nodes.push(valid_length_test);
4115 assert(n->outcnt() == required_outcnt, "malformed control flow");
4116 continue;
4117 }
4118 }
4119 }
4120
4121 // Recheck with a better notion of 'required_outcnt'
4122 if (n->outcnt() != required_outcnt) {
4123 record_method_not_compilable("malformed control flow");
4124 return true; // Not all targets reachable!
4125 }
4126 } else if (n->is_PCTable() && n->in(0) && n->in(0)->in(0) && n->in(0)->in(0)->is_Call()) {
4127 CallNode* call = n->in(0)->in(0)->as_Call();
4128 if (call->entry_point() == OptoRuntime::new_array_Java() ||
4129 call->entry_point() == OptoRuntime::new_array_nozero_Java()) {
4130 assert(call->is_CallStaticJava(), "static call expected");
4131 assert(call->req() == call->jvms()->endoff() + 1, "missing extra input");
4132 uint valid_length_test_input = call->req() - 1;
4133 dead_nodes.push(call->in(valid_length_test_input));
4134 call->del_req(valid_length_test_input); // valid length test useless now
4135 }
4136 }
4137 // Check that I actually visited all kids. Unreached kids
4138 // must be infinite loops.
4139 for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++)
4140 if (!frc._visited.test(n->fast_out(j)->_idx)) {
4141 record_method_not_compilable("infinite loop");
4142 return true; // Found unvisited kid; must be unreach
4143 }
4144
4145 // Here so verification code in final_graph_reshaping_walk()
4146 // always see an OuterStripMinedLoopEnd
4147 if (n->is_OuterStripMinedLoopEnd() || n->is_LongCountedLoopEnd()) {
4148 IfNode* init_iff = n->as_If();
4149 Node* iff = new IfNode(init_iff->in(0), init_iff->in(1), init_iff->_prob, init_iff->_fcnt);
4150 n->subsume_by(iff, this);
4151 }
4152 }
4153
4154 while (dead_nodes.size() > 0) {
4155 Node* m = dead_nodes.pop();
4156 if (m->outcnt() == 0 && m != top()) {
4157 for (uint j = 0; j < m->req(); j++) {
4158 Node* in = m->in(j);
4159 if (in != nullptr) {
4160 dead_nodes.push(in);
4161 }
4162 }
4163 m->disconnect_inputs(this);
4164 }
4165 }
4166
4167 set_java_calls(frc.get_java_call_count());
4168 set_inner_loops(frc.get_inner_loop_count());
4169
4170 // No infinite loops, no reason to bail out.
4171 return false;
4172 }
4173
4174 //-----------------------------too_many_traps----------------------------------
4175 // Report if there are too many traps at the current method and bci.
4176 // Return true if there was a trap, and/or PerMethodTrapLimit is exceeded.
4177 bool Compile::too_many_traps(ciMethod* method,
4178 int bci,
4179 Deoptimization::DeoptReason reason) {
4180 ciMethodData* md = method->method_data();
4181 if (md->is_empty()) {
4182 // Assume the trap has not occurred, or that it occurred only
4183 // because of a transient condition during start-up in the interpreter.
4184 return false;
4185 }
4186 ciMethod* m = Deoptimization::reason_is_speculate(reason) ? this->method() : nullptr;
4187 if (md->has_trap_at(bci, m, reason) != 0) {
4188 // Assume PerBytecodeTrapLimit==0, for a more conservative heuristic.
4189 // Also, if there are multiple reasons, or if there is no per-BCI record,
4190 // assume the worst.
4191 if (log())
4192 log()->elem("observe trap='%s' count='%d'",
4193 Deoptimization::trap_reason_name(reason),
4194 md->trap_count(reason));
4195 return true;
4196 } else {
4197 // Ignore method/bci and see if there have been too many globally.
4198 return too_many_traps(reason, md);
4199 }
4200 }
4201
4202 // Less-accurate variant which does not require a method and bci.
4203 bool Compile::too_many_traps(Deoptimization::DeoptReason reason,
4204 ciMethodData* logmd) {
4205 if (trap_count(reason) >= Deoptimization::per_method_trap_limit(reason)) {
4206 // Too many traps globally.
4207 // Note that we use cumulative trap_count, not just md->trap_count.
4208 if (log()) {
4209 int mcount = (logmd == nullptr)? -1: (int)logmd->trap_count(reason);
4210 log()->elem("observe trap='%s' count='0' mcount='%d' ccount='%d'",
4211 Deoptimization::trap_reason_name(reason),
4212 mcount, trap_count(reason));
4213 }
4214 return true;
4215 } else {
4216 // The coast is clear.
4217 return false;
4218 }
4219 }
4220
4221 //--------------------------too_many_recompiles--------------------------------
4222 // Report if there are too many recompiles at the current method and bci.
4223 // Consults PerBytecodeRecompilationCutoff and PerMethodRecompilationCutoff.
4224 // Is not eager to return true, since this will cause the compiler to use
4225 // Action_none for a trap point, to avoid too many recompilations.
4226 bool Compile::too_many_recompiles(ciMethod* method,
4227 int bci,
4228 Deoptimization::DeoptReason reason) {
4229 ciMethodData* md = method->method_data();
4230 if (md->is_empty()) {
4231 // Assume the trap has not occurred, or that it occurred only
4232 // because of a transient condition during start-up in the interpreter.
4233 return false;
4234 }
4235 // Pick a cutoff point well within PerBytecodeRecompilationCutoff.
4236 uint bc_cutoff = (uint) PerBytecodeRecompilationCutoff / 8;
4237 uint m_cutoff = (uint) PerMethodRecompilationCutoff / 2 + 1; // not zero
4238 Deoptimization::DeoptReason per_bc_reason
4239 = Deoptimization::reason_recorded_per_bytecode_if_any(reason);
4240 ciMethod* m = Deoptimization::reason_is_speculate(reason) ? this->method() : nullptr;
4241 if ((per_bc_reason == Deoptimization::Reason_none
4242 || md->has_trap_at(bci, m, reason) != 0)
4243 // The trap frequency measure we care about is the recompile count:
4244 && md->trap_recompiled_at(bci, m)
4245 && md->overflow_recompile_count() >= bc_cutoff) {
4246 // Do not emit a trap here if it has already caused recompilations.
4247 // Also, if there are multiple reasons, or if there is no per-BCI record,
4248 // assume the worst.
4249 if (log())
4250 log()->elem("observe trap='%s recompiled' count='%d' recompiles2='%d'",
4251 Deoptimization::trap_reason_name(reason),
4252 md->trap_count(reason),
4253 md->overflow_recompile_count());
4254 return true;
4255 } else if (trap_count(reason) != 0
4256 && decompile_count() >= m_cutoff) {
4257 // Too many recompiles globally, and we have seen this sort of trap.
4258 // Use cumulative decompile_count, not just md->decompile_count.
4259 if (log())
4260 log()->elem("observe trap='%s' count='%d' mcount='%d' decompiles='%d' mdecompiles='%d'",
4261 Deoptimization::trap_reason_name(reason),
4262 md->trap_count(reason), trap_count(reason),
4263 md->decompile_count(), decompile_count());
4264 return true;
4265 } else {
4266 // The coast is clear.
4267 return false;
4268 }
4269 }
4270
4271 // Compute when not to trap. Used by matching trap based nodes and
4272 // NullCheck optimization.
4273 void Compile::set_allowed_deopt_reasons() {
4274 _allowed_reasons = 0;
4275 if (is_method_compilation()) {
4276 for (int rs = (int)Deoptimization::Reason_none+1; rs < Compile::trapHistLength; rs++) {
4277 assert(rs < BitsPerInt, "recode bit map");
4278 if (!too_many_traps((Deoptimization::DeoptReason) rs)) {
4279 _allowed_reasons |= nth_bit(rs);
4280 }
4281 }
4282 }
4283 }
4284
4285 bool Compile::needs_clinit_barrier(ciMethod* method, ciMethod* accessing_method) {
4286 return method->is_static() && needs_clinit_barrier(method->holder(), accessing_method);
4287 }
4288
4289 bool Compile::needs_clinit_barrier(ciField* field, ciMethod* accessing_method) {
4290 return field->is_static() && needs_clinit_barrier(field->holder(), accessing_method);
4291 }
4292
4293 bool Compile::needs_clinit_barrier(ciInstanceKlass* holder, ciMethod* accessing_method) {
4294 if (holder->is_initialized()) {
4295 return false;
4296 }
4297 if (holder->is_being_initialized()) {
4298 if (accessing_method->holder() == holder) {
4299 // Access inside a class. The barrier can be elided when access happens in <clinit>,
4300 // <init>, or a static method. In all those cases, there was an initialization
4301 // barrier on the holder klass passed.
4302 if (accessing_method->is_static_initializer() ||
4303 accessing_method->is_object_initializer() ||
4304 accessing_method->is_static()) {
4305 return false;
4306 }
4307 } else if (accessing_method->holder()->is_subclass_of(holder)) {
4308 // Access from a subclass. The barrier can be elided only when access happens in <clinit>.
4309 // In case of <init> or a static method, the barrier is on the subclass is not enough:
4310 // child class can become fully initialized while its parent class is still being initialized.
4311 if (accessing_method->is_static_initializer()) {
4312 return false;
4313 }
4314 }
4315 ciMethod* root = method(); // the root method of compilation
4316 if (root != accessing_method) {
4317 return needs_clinit_barrier(holder, root); // check access in the context of compilation root
4318 }
4319 }
4320 return true;
4321 }
4322
4323 #ifndef PRODUCT
4324 //------------------------------verify_bidirectional_edges---------------------
4325 // For each input edge to a node (ie - for each Use-Def edge), verify that
4326 // there is a corresponding Def-Use edge.
4327 void Compile::verify_bidirectional_edges(Unique_Node_List& visited, const Unique_Node_List* root_and_safepoints) const {
4328 // Allocate stack of size C->live_nodes()/16 to avoid frequent realloc
4329 uint stack_size = live_nodes() >> 4;
4330 Node_List nstack(MAX2(stack_size, (uint) OptoNodeListSize));
4331 if (root_and_safepoints != nullptr) {
4332 assert(root_and_safepoints->member(_root), "root is not in root_and_safepoints");
4333 for (uint i = 0, limit = root_and_safepoints->size(); i < limit; i++) {
4334 Node* root_or_safepoint = root_and_safepoints->at(i);
4335 // If the node is a safepoint, let's check if it still has a control input
4336 // Lack of control input signifies that this node was killed by CCP or
4337 // recursively by remove_globally_dead_node and it shouldn't be a starting
4338 // point.
4339 if (!root_or_safepoint->is_SafePoint() || root_or_safepoint->in(0) != nullptr) {
4340 nstack.push(root_or_safepoint);
4341 }
4342 }
4343 } else {
4344 nstack.push(_root);
4345 }
4346
4347 while (nstack.size() > 0) {
4348 Node* n = nstack.pop();
4349 if (visited.member(n)) {
4350 continue;
4351 }
4352 visited.push(n);
4353
4354 // Walk over all input edges, checking for correspondence
4355 uint length = n->len();
4356 for (uint i = 0; i < length; i++) {
4357 Node* in = n->in(i);
4358 if (in != nullptr && !visited.member(in)) {
4359 nstack.push(in); // Put it on stack
4360 }
4361 if (in != nullptr && !in->is_top()) {
4362 // Count instances of `next`
4363 int cnt = 0;
4364 for (uint idx = 0; idx < in->_outcnt; idx++) {
4365 if (in->_out[idx] == n) {
4366 cnt++;
4367 }
4368 }
4369 assert(cnt > 0, "Failed to find Def-Use edge.");
4370 // Check for duplicate edges
4371 // walk the input array downcounting the input edges to n
4372 for (uint j = 0; j < length; j++) {
4373 if (n->in(j) == in) {
4374 cnt--;
4375 }
4376 }
4377 assert(cnt == 0, "Mismatched edge count.");
4378 } else if (in == nullptr) {
4379 assert(i == 0 || i >= n->req() ||
4380 n->is_Region() || n->is_Phi() || n->is_ArrayCopy() ||
4381 (n->is_Unlock() && i == (n->req() - 1)) ||
4382 (n->is_MemBar() && i == 5), // the precedence edge to a membar can be removed during macro node expansion
4383 "only region, phi, arraycopy, unlock or membar nodes have null data edges");
4384 } else {
4385 assert(in->is_top(), "sanity");
4386 // Nothing to check.
4387 }
4388 }
4389 }
4390 }
4391
4392 //------------------------------verify_graph_edges---------------------------
4393 // Walk the Graph and verify that there is a one-to-one correspondence
4394 // between Use-Def edges and Def-Use edges in the graph.
4395 void Compile::verify_graph_edges(bool no_dead_code, const Unique_Node_List* root_and_safepoints) const {
4396 if (VerifyGraphEdges) {
4397 Unique_Node_List visited;
4398
4399 // Call graph walk to check edges
4400 verify_bidirectional_edges(visited, root_and_safepoints);
4401 if (no_dead_code) {
4402 // Now make sure that no visited node is used by an unvisited node.
4403 bool dead_nodes = false;
4404 Unique_Node_List checked;
4405 while (visited.size() > 0) {
4406 Node* n = visited.pop();
4407 checked.push(n);
4408 for (uint i = 0; i < n->outcnt(); i++) {
4409 Node* use = n->raw_out(i);
4410 if (checked.member(use)) continue; // already checked
4411 if (visited.member(use)) continue; // already in the graph
4412 if (use->is_Con()) continue; // a dead ConNode is OK
4413 // At this point, we have found a dead node which is DU-reachable.
4414 if (!dead_nodes) {
4415 tty->print_cr("*** Dead nodes reachable via DU edges:");
4416 dead_nodes = true;
4417 }
4418 use->dump(2);
4419 tty->print_cr("---");
4420 checked.push(use); // No repeats; pretend it is now checked.
4421 }
4422 }
4423 assert(!dead_nodes, "using nodes must be reachable from root");
4424 }
4425 }
4426 }
4427 #endif
4428
4429 // The Compile object keeps track of failure reasons separately from the ciEnv.
4430 // This is required because there is not quite a 1-1 relation between the
4431 // ciEnv and its compilation task and the Compile object. Note that one
4432 // ciEnv might use two Compile objects, if C2Compiler::compile_method decides
4433 // to backtrack and retry without subsuming loads. Other than this backtracking
4434 // behavior, the Compile's failure reason is quietly copied up to the ciEnv
4435 // by the logic in C2Compiler.
4436 void Compile::record_failure(const char* reason DEBUG_ONLY(COMMA bool allow_multiple_failures)) {
4437 if (log() != nullptr) {
4438 log()->elem("failure reason='%s' phase='compile'", reason);
4439 }
4440 if (_failure_reason.get() == nullptr) {
4441 // Record the first failure reason.
4442 _failure_reason.set(reason);
4443 if (CaptureBailoutInformation) {
4444 _first_failure_details = new CompilationFailureInfo(reason);
4445 }
4446 } else {
4447 assert(!StressBailout || allow_multiple_failures, "should have handled previous failure.");
4448 }
4449
4450 if (!C->failure_reason_is(C2Compiler::retry_no_subsuming_loads())) {
4451 C->print_method(PHASE_FAILURE, 1);
4452 }
4453 _root = nullptr; // flush the graph, too
4454 }
4455
4456 Compile::TracePhase::TracePhase(const char* name, PhaseTraceId id)
4457 : TraceTime(name, &Phase::timers[id], CITime, CITimeVerbose),
4458 _compile(Compile::current()),
4459 _log(nullptr),
4460 _dolog(CITimeVerbose)
4461 {
4462 assert(_compile != nullptr, "sanity check");
4463 assert(id != PhaseTraceId::_t_none, "Don't use none");
4464 if (_dolog) {
4465 _log = _compile->log();
4466 }
4467 if (_log != nullptr) {
4468 _log->begin_head("phase name='%s' nodes='%d' live='%d'", phase_name(), _compile->unique(), _compile->live_nodes());
4469 _log->stamp();
4470 _log->end_head();
4471 }
4472
4473 // Inform memory statistic, if enabled
4474 if (CompilationMemoryStatistic::enabled()) {
4475 CompilationMemoryStatistic::on_phase_start((int)id, name);
4476 }
4477 }
4478
4479 Compile::TracePhase::TracePhase(PhaseTraceId id)
4480 : TracePhase(Phase::get_phase_trace_id_text(id), id) {}
4481
4482 Compile::TracePhase::~TracePhase() {
4483
4484 // Inform memory statistic, if enabled
4485 if (CompilationMemoryStatistic::enabled()) {
4486 CompilationMemoryStatistic::on_phase_end();
4487 }
4488
4489 if (_compile->failing_internal()) {
4490 if (_log != nullptr) {
4491 _log->done("phase");
4492 }
4493 return; // timing code, not stressing bailouts.
4494 }
4495 #ifdef ASSERT
4496 if (PrintIdealNodeCount) {
4497 tty->print_cr("phase name='%s' nodes='%d' live='%d' live_graph_walk='%d'",
4498 phase_name(), _compile->unique(), _compile->live_nodes(), _compile->count_live_nodes_by_graph_walk());
4499 }
4500
4501 if (VerifyIdealNodeCount) {
4502 _compile->print_missing_nodes();
4503 }
4504 #endif
4505
4506 if (_log != nullptr) {
4507 _log->done("phase name='%s' nodes='%d' live='%d'", phase_name(), _compile->unique(), _compile->live_nodes());
4508 }
4509 }
4510
4511 //----------------------------static_subtype_check-----------------------------
4512 // Shortcut important common cases when superklass is exact:
4513 // (0) superklass is java.lang.Object (can occur in reflective code)
4514 // (1) subklass is already limited to a subtype of superklass => always ok
4515 // (2) subklass does not overlap with superklass => always fail
4516 // (3) superklass has NO subtypes and we can check with a simple compare.
4517 Compile::SubTypeCheckResult Compile::static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip) {
4518 if (skip) {
4519 return SSC_full_test; // Let caller generate the general case.
4520 }
4521
4522 if (subk->is_java_subtype_of(superk)) {
4523 return SSC_always_true; // (0) and (1) this test cannot fail
4524 }
4525
4526 if (!subk->maybe_java_subtype_of(superk)) {
4527 return SSC_always_false; // (2) true path dead; no dynamic test needed
4528 }
4529
4530 const Type* superelem = superk;
4531 if (superk->isa_aryklassptr()) {
4532 int ignored;
4533 superelem = superk->is_aryklassptr()->base_element_type(ignored);
4534 }
4535
4536 if (superelem->isa_instklassptr()) {
4537 ciInstanceKlass* ik = superelem->is_instklassptr()->instance_klass();
4538 if (!ik->has_subklass()) {
4539 if (!ik->is_final()) {
4540 // Add a dependency if there is a chance of a later subclass.
4541 dependencies()->assert_leaf_type(ik);
4542 }
4543 if (!superk->maybe_java_subtype_of(subk)) {
4544 return SSC_always_false;
4545 }
4546 return SSC_easy_test; // (3) caller can do a simple ptr comparison
4547 }
4548 } else {
4549 // A primitive array type has no subtypes.
4550 return SSC_easy_test; // (3) caller can do a simple ptr comparison
4551 }
4552
4553 return SSC_full_test;
4554 }
4555
4556 Node* Compile::conv_I2X_index(PhaseGVN* phase, Node* idx, const TypeInt* sizetype, Node* ctrl) {
4557 #ifdef _LP64
4558 // The scaled index operand to AddP must be a clean 64-bit value.
4559 // Java allows a 32-bit int to be incremented to a negative
4560 // value, which appears in a 64-bit register as a large
4561 // positive number. Using that large positive number as an
4562 // operand in pointer arithmetic has bad consequences.
4563 // On the other hand, 32-bit overflow is rare, and the possibility
4564 // can often be excluded, if we annotate the ConvI2L node with
4565 // a type assertion that its value is known to be a small positive
4566 // number. (The prior range check has ensured this.)
4567 // This assertion is used by ConvI2LNode::Ideal.
4568 int index_max = max_jint - 1; // array size is max_jint, index is one less
4569 if (sizetype != nullptr && sizetype->_hi > 0) {
4570 index_max = sizetype->_hi - 1;
4571 }
4572 const TypeInt* iidxtype = TypeInt::make(0, index_max, Type::WidenMax);
4573 idx = constrained_convI2L(phase, idx, iidxtype, ctrl);
4574 #endif
4575 return idx;
4576 }
4577
4578 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
4579 Node* Compile::constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency) {
4580 if (ctrl != nullptr) {
4581 // Express control dependency by a CastII node with a narrow type.
4582 // Make the CastII node dependent on the control input to prevent the narrowed ConvI2L
4583 // node from floating above the range check during loop optimizations. Otherwise, the
4584 // ConvI2L node may be eliminated independently of the range check, causing the data path
4585 // to become TOP while the control path is still there (although it's unreachable).
4586 value = new CastIINode(ctrl, value, itype, carry_dependency ? ConstraintCastNode::DependencyType::NonFloatingNarrowing : ConstraintCastNode::DependencyType::FloatingNarrowing, true /* range check dependency */);
4587 value = phase->transform(value);
4588 }
4589 const TypeLong* ltype = TypeLong::make(itype->_lo, itype->_hi, itype->_widen);
4590 return phase->transform(new ConvI2LNode(value, ltype));
4591 }
4592
4593 void Compile::dump_print_inlining() {
4594 inline_printer()->print_on(tty);
4595 }
4596
4597 void Compile::log_late_inline(CallGenerator* cg) {
4598 if (log() != nullptr) {
4599 log()->head("late_inline method='%d' inline_id='" JLONG_FORMAT "'", log()->identify(cg->method()),
4600 cg->unique_id());
4601 JVMState* p = cg->call_node()->jvms();
4602 while (p != nullptr) {
4603 log()->elem("jvms bci='%d' method='%d'", p->bci(), log()->identify(p->method()));
4604 p = p->caller();
4605 }
4606 log()->tail("late_inline");
4607 }
4608 }
4609
4610 void Compile::log_late_inline_failure(CallGenerator* cg, const char* msg) {
4611 log_late_inline(cg);
4612 if (log() != nullptr) {
4613 log()->inline_fail(msg);
4614 }
4615 }
4616
4617 void Compile::log_inline_id(CallGenerator* cg) {
4618 if (log() != nullptr) {
4619 // The LogCompilation tool needs a unique way to identify late
4620 // inline call sites. This id must be unique for this call site in
4621 // this compilation. Try to have it unique across compilations as
4622 // well because it can be convenient when grepping through the log
4623 // file.
4624 // Distinguish OSR compilations from others in case CICountOSR is
4625 // on.
4626 jlong id = ((jlong)unique()) + (((jlong)compile_id()) << 33) + (CICountOSR && is_osr_compilation() ? ((jlong)1) << 32 : 0);
4627 cg->set_unique_id(id);
4628 log()->elem("inline_id id='" JLONG_FORMAT "'", id);
4629 }
4630 }
4631
4632 void Compile::log_inline_failure(const char* msg) {
4633 if (C->log() != nullptr) {
4634 C->log()->inline_fail(msg);
4635 }
4636 }
4637
4638
4639 // Dump inlining replay data to the stream.
4640 // Don't change thread state and acquire any locks.
4641 void Compile::dump_inline_data(outputStream* out) {
4642 InlineTree* inl_tree = ilt();
4643 if (inl_tree != nullptr) {
4644 out->print(" inline %d", inl_tree->count());
4645 inl_tree->dump_replay_data(out);
4646 }
4647 }
4648
4649 void Compile::dump_inline_data_reduced(outputStream* out) {
4650 assert(ReplayReduce, "");
4651
4652 InlineTree* inl_tree = ilt();
4653 if (inl_tree == nullptr) {
4654 return;
4655 }
4656 // Enable iterative replay file reduction
4657 // Output "compile" lines for depth 1 subtrees,
4658 // simulating that those trees were compiled
4659 // instead of inlined.
4660 for (int i = 0; i < inl_tree->subtrees().length(); ++i) {
4661 InlineTree* sub = inl_tree->subtrees().at(i);
4662 if (sub->inline_level() != 1) {
4663 continue;
4664 }
4665
4666 ciMethod* method = sub->method();
4667 int entry_bci = -1;
4668 int comp_level = env()->task()->comp_level();
4669 out->print("compile ");
4670 method->dump_name_as_ascii(out);
4671 out->print(" %d %d", entry_bci, comp_level);
4672 out->print(" inline %d", sub->count());
4673 sub->dump_replay_data(out, -1);
4674 out->cr();
4675 }
4676 }
4677
4678 int Compile::cmp_expensive_nodes(Node* n1, Node* n2) {
4679 if (n1->Opcode() < n2->Opcode()) return -1;
4680 else if (n1->Opcode() > n2->Opcode()) return 1;
4681
4682 assert(n1->req() == n2->req(), "can't compare %s nodes: n1->req() = %d, n2->req() = %d", NodeClassNames[n1->Opcode()], n1->req(), n2->req());
4683 for (uint i = 1; i < n1->req(); i++) {
4684 if (n1->in(i) < n2->in(i)) return -1;
4685 else if (n1->in(i) > n2->in(i)) return 1;
4686 }
4687
4688 return 0;
4689 }
4690
4691 int Compile::cmp_expensive_nodes(Node** n1p, Node** n2p) {
4692 Node* n1 = *n1p;
4693 Node* n2 = *n2p;
4694
4695 return cmp_expensive_nodes(n1, n2);
4696 }
4697
4698 void Compile::sort_expensive_nodes() {
4699 if (!expensive_nodes_sorted()) {
4700 _expensive_nodes.sort(cmp_expensive_nodes);
4701 }
4702 }
4703
4704 bool Compile::expensive_nodes_sorted() const {
4705 for (int i = 1; i < _expensive_nodes.length(); i++) {
4706 if (cmp_expensive_nodes(_expensive_nodes.adr_at(i), _expensive_nodes.adr_at(i-1)) < 0) {
4707 return false;
4708 }
4709 }
4710 return true;
4711 }
4712
4713 bool Compile::should_optimize_expensive_nodes(PhaseIterGVN &igvn) {
4714 if (_expensive_nodes.length() == 0) {
4715 return false;
4716 }
4717
4718 assert(OptimizeExpensiveOps, "optimization off?");
4719
4720 // Take this opportunity to remove dead nodes from the list
4721 int j = 0;
4722 for (int i = 0; i < _expensive_nodes.length(); i++) {
4723 Node* n = _expensive_nodes.at(i);
4724 if (!n->is_unreachable(igvn)) {
4725 assert(n->is_expensive(), "should be expensive");
4726 _expensive_nodes.at_put(j, n);
4727 j++;
4728 }
4729 }
4730 _expensive_nodes.trunc_to(j);
4731
4732 // Then sort the list so that similar nodes are next to each other
4733 // and check for at least two nodes of identical kind with same data
4734 // inputs.
4735 sort_expensive_nodes();
4736
4737 for (int i = 0; i < _expensive_nodes.length()-1; i++) {
4738 if (cmp_expensive_nodes(_expensive_nodes.adr_at(i), _expensive_nodes.adr_at(i+1)) == 0) {
4739 return true;
4740 }
4741 }
4742
4743 return false;
4744 }
4745
4746 void Compile::cleanup_expensive_nodes(PhaseIterGVN &igvn) {
4747 if (_expensive_nodes.length() == 0) {
4748 return;
4749 }
4750
4751 assert(OptimizeExpensiveOps, "optimization off?");
4752
4753 // Sort to bring similar nodes next to each other and clear the
4754 // control input of nodes for which there's only a single copy.
4755 sort_expensive_nodes();
4756
4757 int j = 0;
4758 int identical = 0;
4759 int i = 0;
4760 bool modified = false;
4761 for (; i < _expensive_nodes.length()-1; i++) {
4762 assert(j <= i, "can't write beyond current index");
4763 if (_expensive_nodes.at(i)->Opcode() == _expensive_nodes.at(i+1)->Opcode()) {
4764 identical++;
4765 _expensive_nodes.at_put(j++, _expensive_nodes.at(i));
4766 continue;
4767 }
4768 if (identical > 0) {
4769 _expensive_nodes.at_put(j++, _expensive_nodes.at(i));
4770 identical = 0;
4771 } else {
4772 Node* n = _expensive_nodes.at(i);
4773 igvn.replace_input_of(n, 0, nullptr);
4774 igvn.hash_insert(n);
4775 modified = true;
4776 }
4777 }
4778 if (identical > 0) {
4779 _expensive_nodes.at_put(j++, _expensive_nodes.at(i));
4780 } else if (_expensive_nodes.length() >= 1) {
4781 Node* n = _expensive_nodes.at(i);
4782 igvn.replace_input_of(n, 0, nullptr);
4783 igvn.hash_insert(n);
4784 modified = true;
4785 }
4786 _expensive_nodes.trunc_to(j);
4787 if (modified) {
4788 igvn.optimize();
4789 }
4790 }
4791
4792 void Compile::add_expensive_node(Node * n) {
4793 assert(!_expensive_nodes.contains(n), "duplicate entry in expensive list");
4794 assert(n->is_expensive(), "expensive nodes with non-null control here only");
4795 assert(!n->is_CFG() && !n->is_Mem(), "no cfg or memory nodes here");
4796 if (OptimizeExpensiveOps) {
4797 _expensive_nodes.append(n);
4798 } else {
4799 // Clear control input and let IGVN optimize expensive nodes if
4800 // OptimizeExpensiveOps is off.
4801 n->set_req(0, nullptr);
4802 }
4803 }
4804
4805 /**
4806 * Track coarsened Lock and Unlock nodes.
4807 */
4808
4809 class Lock_List : public Node_List {
4810 uint _origin_cnt;
4811 public:
4812 Lock_List(Arena *a, uint cnt) : Node_List(a), _origin_cnt(cnt) {}
4813 uint origin_cnt() const { return _origin_cnt; }
4814 };
4815
4816 void Compile::add_coarsened_locks(GrowableArray<AbstractLockNode*>& locks) {
4817 int length = locks.length();
4818 if (length > 0) {
4819 // Have to keep this list until locks elimination during Macro nodes elimination.
4820 Lock_List* locks_list = new (comp_arena()) Lock_List(comp_arena(), length);
4821 AbstractLockNode* alock = locks.at(0);
4822 BoxLockNode* box = alock->box_node()->as_BoxLock();
4823 for (int i = 0; i < length; i++) {
4824 AbstractLockNode* lock = locks.at(i);
4825 assert(lock->is_coarsened(), "expecting only coarsened AbstractLock nodes, but got '%s'[%d] node", lock->Name(), lock->_idx);
4826 locks_list->push(lock);
4827 BoxLockNode* this_box = lock->box_node()->as_BoxLock();
4828 if (this_box != box) {
4829 // Locking regions (BoxLock) could be Unbalanced here:
4830 // - its coarsened locks were eliminated in earlier
4831 // macro nodes elimination followed by loop unroll
4832 // - it is OSR locking region (no Lock node)
4833 // Preserve Unbalanced status in such cases.
4834 if (!this_box->is_unbalanced()) {
4835 this_box->set_coarsened();
4836 }
4837 if (!box->is_unbalanced()) {
4838 box->set_coarsened();
4839 }
4840 }
4841 }
4842 _coarsened_locks.append(locks_list);
4843 }
4844 }
4845
4846 void Compile::remove_useless_coarsened_locks(Unique_Node_List& useful) {
4847 int count = coarsened_count();
4848 for (int i = 0; i < count; i++) {
4849 Node_List* locks_list = _coarsened_locks.at(i);
4850 for (uint j = 0; j < locks_list->size(); j++) {
4851 Node* lock = locks_list->at(j);
4852 assert(lock->is_AbstractLock(), "sanity");
4853 if (!useful.member(lock)) {
4854 locks_list->yank(lock);
4855 }
4856 }
4857 }
4858 }
4859
4860 void Compile::remove_coarsened_lock(Node* n) {
4861 if (n->is_AbstractLock()) {
4862 int count = coarsened_count();
4863 for (int i = 0; i < count; i++) {
4864 Node_List* locks_list = _coarsened_locks.at(i);
4865 locks_list->yank(n);
4866 }
4867 }
4868 }
4869
4870 bool Compile::coarsened_locks_consistent() {
4871 int count = coarsened_count();
4872 for (int i = 0; i < count; i++) {
4873 bool unbalanced = false;
4874 bool modified = false; // track locks kind modifications
4875 Lock_List* locks_list = (Lock_List*)_coarsened_locks.at(i);
4876 uint size = locks_list->size();
4877 if (size == 0) {
4878 unbalanced = false; // All locks were eliminated - good
4879 } else if (size != locks_list->origin_cnt()) {
4880 unbalanced = true; // Some locks were removed from list
4881 } else {
4882 for (uint j = 0; j < size; j++) {
4883 Node* lock = locks_list->at(j);
4884 // All nodes in group should have the same state (modified or not)
4885 if (!lock->as_AbstractLock()->is_coarsened()) {
4886 if (j == 0) {
4887 // first on list was modified, the rest should be too for consistency
4888 modified = true;
4889 } else if (!modified) {
4890 // this lock was modified but previous locks on the list were not
4891 unbalanced = true;
4892 break;
4893 }
4894 } else if (modified) {
4895 // previous locks on list were modified but not this lock
4896 unbalanced = true;
4897 break;
4898 }
4899 }
4900 }
4901 if (unbalanced) {
4902 // unbalanced monitor enter/exit - only some [un]lock nodes were removed or modified
4903 #ifdef ASSERT
4904 if (PrintEliminateLocks) {
4905 tty->print_cr("=== unbalanced coarsened locks ===");
4906 for (uint l = 0; l < size; l++) {
4907 locks_list->at(l)->dump();
4908 }
4909 }
4910 #endif
4911 record_failure(C2Compiler::retry_no_locks_coarsening());
4912 return false;
4913 }
4914 }
4915 return true;
4916 }
4917
4918 // Mark locking regions (identified by BoxLockNode) as unbalanced if
4919 // locks coarsening optimization removed Lock/Unlock nodes from them.
4920 // Such regions become unbalanced because coarsening only removes part
4921 // of Lock/Unlock nodes in region. As result we can't execute other
4922 // locks elimination optimizations which assume all code paths have
4923 // corresponding pair of Lock/Unlock nodes - they are balanced.
4924 void Compile::mark_unbalanced_boxes() const {
4925 int count = coarsened_count();
4926 for (int i = 0; i < count; i++) {
4927 Node_List* locks_list = _coarsened_locks.at(i);
4928 uint size = locks_list->size();
4929 if (size > 0) {
4930 AbstractLockNode* alock = locks_list->at(0)->as_AbstractLock();
4931 BoxLockNode* box = alock->box_node()->as_BoxLock();
4932 if (alock->is_coarsened()) {
4933 // coarsened_locks_consistent(), which is called before this method, verifies
4934 // that the rest of Lock/Unlock nodes on locks_list are also coarsened.
4935 assert(!box->is_eliminated(), "regions with coarsened locks should not be marked as eliminated");
4936 for (uint j = 1; j < size; j++) {
4937 assert(locks_list->at(j)->as_AbstractLock()->is_coarsened(), "only coarsened locks are expected here");
4938 BoxLockNode* this_box = locks_list->at(j)->as_AbstractLock()->box_node()->as_BoxLock();
4939 if (box != this_box) {
4940 assert(!this_box->is_eliminated(), "regions with coarsened locks should not be marked as eliminated");
4941 box->set_unbalanced();
4942 this_box->set_unbalanced();
4943 }
4944 }
4945 }
4946 }
4947 }
4948 }
4949
4950 /**
4951 * Remove the speculative part of types and clean up the graph
4952 */
4953 void Compile::remove_speculative_types(PhaseIterGVN &igvn) {
4954 if (UseTypeSpeculation) {
4955 Unique_Node_List worklist;
4956 worklist.push(root());
4957 int modified = 0;
4958 // Go over all type nodes that carry a speculative type, drop the
4959 // speculative part of the type and enqueue the node for an igvn
4960 // which may optimize it out.
4961 for (uint next = 0; next < worklist.size(); ++next) {
4962 Node *n = worklist.at(next);
4963 if (n->is_Type()) {
4964 TypeNode* tn = n->as_Type();
4965 const Type* t = tn->type();
4966 const Type* t_no_spec = t->remove_speculative();
4967 if (t_no_spec != t) {
4968 bool in_hash = igvn.hash_delete(n);
4969 assert(in_hash || n->hash() == Node::NO_HASH, "node should be in igvn hash table");
4970 tn->set_type(t_no_spec);
4971 igvn.hash_insert(n);
4972 igvn._worklist.push(n); // give it a chance to go away
4973 modified++;
4974 }
4975 }
4976 // Iterate over outs - endless loops is unreachable from below
4977 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
4978 Node *m = n->fast_out(i);
4979 if (not_a_node(m)) {
4980 continue;
4981 }
4982 worklist.push(m);
4983 }
4984 }
4985 // Drop the speculative part of all types in the igvn's type table
4986 igvn.remove_speculative_types();
4987 if (modified > 0) {
4988 igvn.optimize();
4989 if (failing()) return;
4990 }
4991 #ifdef ASSERT
4992 // Verify that after the IGVN is over no speculative type has resurfaced
4993 worklist.clear();
4994 worklist.push(root());
4995 for (uint next = 0; next < worklist.size(); ++next) {
4996 Node *n = worklist.at(next);
4997 const Type* t = igvn.type_or_null(n);
4998 assert((t == nullptr) || (t == t->remove_speculative()), "no more speculative types");
4999 if (n->is_Type()) {
5000 t = n->as_Type()->type();
5001 assert(t == t->remove_speculative(), "no more speculative types");
5002 }
5003 // Iterate over outs - endless loops is unreachable from below
5004 for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
5005 Node *m = n->fast_out(i);
5006 if (not_a_node(m)) {
5007 continue;
5008 }
5009 worklist.push(m);
5010 }
5011 }
5012 igvn.check_no_speculative_types();
5013 #endif
5014 }
5015 }
5016
5017 // Auxiliary methods to support randomized stressing/fuzzing.
5018
5019 void Compile::initialize_stress_seed(const DirectiveSet* directive) {
5020 if (FLAG_IS_DEFAULT(StressSeed) || (FLAG_IS_ERGO(StressSeed) && directive->RepeatCompilationOption)) {
5021 _stress_seed = static_cast<uint>(Ticks::now().nanoseconds());
5022 FLAG_SET_ERGO(StressSeed, _stress_seed);
5023 } else {
5024 _stress_seed = StressSeed;
5025 }
5026 if (_log != nullptr) {
5027 _log->elem("stress_test seed='%u'", _stress_seed);
5028 }
5029 }
5030
5031 int Compile::random() {
5032 _stress_seed = os::next_random(_stress_seed);
5033 return static_cast<int>(_stress_seed);
5034 }
5035
5036 // This method can be called the arbitrary number of times, with current count
5037 // as the argument. The logic allows selecting a single candidate from the
5038 // running list of candidates as follows:
5039 // int count = 0;
5040 // Cand* selected = null;
5041 // while(cand = cand->next()) {
5042 // if (randomized_select(++count)) {
5043 // selected = cand;
5044 // }
5045 // }
5046 //
5047 // Including count equalizes the chances any candidate is "selected".
5048 // This is useful when we don't have the complete list of candidates to choose
5049 // from uniformly. In this case, we need to adjust the randomicity of the
5050 // selection, or else we will end up biasing the selection towards the latter
5051 // candidates.
5052 //
5053 // Quick back-envelope calculation shows that for the list of n candidates
5054 // the equal probability for the candidate to persist as "best" can be
5055 // achieved by replacing it with "next" k-th candidate with the probability
5056 // of 1/k. It can be easily shown that by the end of the run, the
5057 // probability for any candidate is converged to 1/n, thus giving the
5058 // uniform distribution among all the candidates.
5059 //
5060 // We don't care about the domain size as long as (RANDOMIZED_DOMAIN / count) is large.
5061 #define RANDOMIZED_DOMAIN_POW 29
5062 #define RANDOMIZED_DOMAIN (1 << RANDOMIZED_DOMAIN_POW)
5063 #define RANDOMIZED_DOMAIN_MASK ((1 << (RANDOMIZED_DOMAIN_POW + 1)) - 1)
5064 bool Compile::randomized_select(int count) {
5065 assert(count > 0, "only positive");
5066 return (random() & RANDOMIZED_DOMAIN_MASK) < (RANDOMIZED_DOMAIN / count);
5067 }
5068
5069 #ifdef ASSERT
5070 // Failures are geometrically distributed with probability 1/StressBailoutMean.
5071 bool Compile::fail_randomly() {
5072 if ((random() % StressBailoutMean) != 0) {
5073 return false;
5074 }
5075 record_failure("StressBailout");
5076 return true;
5077 }
5078
5079 bool Compile::failure_is_artificial() {
5080 return C->failure_reason_is("StressBailout");
5081 }
5082 #endif
5083
5084 CloneMap& Compile::clone_map() { return _clone_map; }
5085 void Compile::set_clone_map(Dict* d) { _clone_map._dict = d; }
5086
5087 void NodeCloneInfo::dump_on(outputStream* st) const {
5088 st->print(" {%d:%d} ", idx(), gen());
5089 }
5090
5091 void CloneMap::clone(Node* old, Node* nnn, int gen) {
5092 uint64_t val = value(old->_idx);
5093 NodeCloneInfo cio(val);
5094 assert(val != 0, "old node should be in the map");
5095 NodeCloneInfo cin(cio.idx(), gen + cio.gen());
5096 insert(nnn->_idx, cin.get());
5097 #ifndef PRODUCT
5098 if (is_debug()) {
5099 tty->print_cr("CloneMap::clone inserted node %d info {%d:%d} into CloneMap", nnn->_idx, cin.idx(), cin.gen());
5100 }
5101 #endif
5102 }
5103
5104 void CloneMap::verify_insert_and_clone(Node* old, Node* nnn, int gen) {
5105 NodeCloneInfo cio(value(old->_idx));
5106 if (cio.get() == 0) {
5107 cio.set(old->_idx, 0);
5108 insert(old->_idx, cio.get());
5109 #ifndef PRODUCT
5110 if (is_debug()) {
5111 tty->print_cr("CloneMap::verify_insert_and_clone inserted node %d info {%d:%d} into CloneMap", old->_idx, cio.idx(), cio.gen());
5112 }
5113 #endif
5114 }
5115 clone(old, nnn, gen);
5116 }
5117
5118 int CloneMap::max_gen() const {
5119 int g = 0;
5120 DictI di(_dict);
5121 for(; di.test(); ++di) {
5122 int t = gen(di._key);
5123 if (g < t) {
5124 g = t;
5125 #ifndef PRODUCT
5126 if (is_debug()) {
5127 tty->print_cr("CloneMap::max_gen() update max=%d from %d", g, _2_node_idx_t(di._key));
5128 }
5129 #endif
5130 }
5131 }
5132 return g;
5133 }
5134
5135 void CloneMap::dump(node_idx_t key, outputStream* st) const {
5136 uint64_t val = value(key);
5137 if (val != 0) {
5138 NodeCloneInfo ni(val);
5139 ni.dump_on(st);
5140 }
5141 }
5142
5143 void Compile::shuffle_macro_nodes() {
5144 if (_macro_nodes.length() < 2) {
5145 return;
5146 }
5147 for (uint i = _macro_nodes.length() - 1; i >= 1; i--) {
5148 uint j = C->random() % (i + 1);
5149 swap(_macro_nodes.at(i), _macro_nodes.at(j));
5150 }
5151 }
5152
5153 // Move Allocate nodes to the start of the list
5154 void Compile::sort_macro_nodes() {
5155 int count = macro_count();
5156 int allocates = 0;
5157 for (int i = 0; i < count; i++) {
5158 Node* n = macro_node(i);
5159 if (n->is_Allocate()) {
5160 if (i != allocates) {
5161 Node* tmp = macro_node(allocates);
5162 _macro_nodes.at_put(allocates, n);
5163 _macro_nodes.at_put(i, tmp);
5164 }
5165 allocates++;
5166 }
5167 }
5168 }
5169
5170 void Compile::print_method(CompilerPhaseType compile_phase, int level, Node* n) {
5171 if (failing_internal()) { return; } // failing_internal to not stress bailouts from printing code.
5172 EventCompilerPhase event(UNTIMED);
5173 if (event.should_commit()) {
5174 CompilerEvent::PhaseEvent::post(event, C->_latest_stage_start_counter, compile_phase, C->_compile_id, level);
5175 }
5176 #ifndef PRODUCT
5177 ResourceMark rm;
5178 stringStream ss;
5179 ss.print_raw(CompilerPhaseTypeHelper::to_description(compile_phase));
5180 int iter = ++_igv_phase_iter[compile_phase];
5181 if (iter > 1) {
5182 ss.print(" %d", iter);
5183 }
5184 if (n != nullptr) {
5185 ss.print(": %d %s", n->_idx, NodeClassNames[n->Opcode()]);
5186 if (n->is_Call()) {
5187 CallNode* call = n->as_Call();
5188 if (call->_name != nullptr) {
5189 // E.g. uncommon traps etc.
5190 ss.print(" - %s", call->_name);
5191 } else if (call->is_CallJava()) {
5192 CallJavaNode* call_java = call->as_CallJava();
5193 if (call_java->method() != nullptr) {
5194 ss.print(" -");
5195 call_java->method()->print_short_name(&ss);
5196 }
5197 }
5198 }
5199 }
5200
5201 const char* name = ss.as_string();
5202 if (should_print_igv(level)) {
5203 _igv_printer->print_graph(name);
5204 }
5205 if (should_print_phase(level)) {
5206 print_phase(name);
5207 }
5208 if (should_print_ideal_phase(compile_phase)) {
5209 print_ideal_ir(CompilerPhaseTypeHelper::to_name(compile_phase));
5210 }
5211 #endif
5212 C->_latest_stage_start_counter.stamp();
5213 }
5214
5215 // Only used from CompileWrapper
5216 void Compile::begin_method() {
5217 #ifndef PRODUCT
5218 if (_method != nullptr && should_print_igv(1)) {
5219 _igv_printer->begin_method();
5220 }
5221 #endif
5222 C->_latest_stage_start_counter.stamp();
5223 }
5224
5225 // Only used from CompileWrapper
5226 void Compile::end_method() {
5227 EventCompilerPhase event(UNTIMED);
5228 if (event.should_commit()) {
5229 CompilerEvent::PhaseEvent::post(event, C->_latest_stage_start_counter, PHASE_END, C->_compile_id, 1);
5230 }
5231
5232 #ifndef PRODUCT
5233 if (_method != nullptr && should_print_igv(1)) {
5234 _igv_printer->end_method();
5235 }
5236 #endif
5237 }
5238
5239 #ifndef PRODUCT
5240 bool Compile::should_print_phase(const int level) const {
5241 return PrintPhaseLevel >= 0 && directive()->PhasePrintLevelOption >= level &&
5242 _method != nullptr; // Do not print phases for stubs.
5243 }
5244
5245 bool Compile::should_print_ideal_phase(CompilerPhaseType cpt) const {
5246 return _directive->should_print_ideal_phase(cpt);
5247 }
5248
5249 void Compile::init_igv() {
5250 if (_igv_printer == nullptr) {
5251 _igv_printer = IdealGraphPrinter::printer();
5252 _igv_printer->set_compile(this);
5253 }
5254 }
5255
5256 bool Compile::should_print_igv(const int level) {
5257 PRODUCT_RETURN_(return false;);
5258
5259 if (PrintIdealGraphLevel < 0) { // disabled by the user
5260 return false;
5261 }
5262
5263 bool need = directive()->IGVPrintLevelOption >= level;
5264 if (need) {
5265 Compile::init_igv();
5266 }
5267 return need;
5268 }
5269
5270 IdealGraphPrinter* Compile::_debug_file_printer = nullptr;
5271 IdealGraphPrinter* Compile::_debug_network_printer = nullptr;
5272
5273 // Called from debugger. Prints method to the default file with the default phase name.
5274 // This works regardless of any Ideal Graph Visualizer flags set or not.
5275 // Use in debugger (gdb/rr): p igv_print($sp, $fp, $pc).
5276 void igv_print(void* sp, void* fp, void* pc) {
5277 frame fr(sp, fp, pc);
5278 Compile::current()->igv_print_method_to_file(nullptr, false, &fr);
5279 }
5280
5281 // Same as igv_print() above but with a specified phase name.
5282 void igv_print(const char* phase_name, void* sp, void* fp, void* pc) {
5283 frame fr(sp, fp, pc);
5284 Compile::current()->igv_print_method_to_file(phase_name, false, &fr);
5285 }
5286
5287 // Called from debugger. Prints method with the default phase name to the default network or the one specified with
5288 // the network flags for the Ideal Graph Visualizer, or to the default file depending on the 'network' argument.
5289 // This works regardless of any Ideal Graph Visualizer flags set or not.
5290 // Use in debugger (gdb/rr): p igv_print(true, $sp, $fp, $pc).
5291 void igv_print(bool network, void* sp, void* fp, void* pc) {
5292 frame fr(sp, fp, pc);
5293 if (network) {
5294 Compile::current()->igv_print_method_to_network(nullptr, &fr);
5295 } else {
5296 Compile::current()->igv_print_method_to_file(nullptr, false, &fr);
5297 }
5298 }
5299
5300 // Same as igv_print(bool network, ...) above but with a specified phase name.
5301 // Use in debugger (gdb/rr): p igv_print(true, "MyPhase", $sp, $fp, $pc).
5302 void igv_print(bool network, const char* phase_name, void* sp, void* fp, void* pc) {
5303 frame fr(sp, fp, pc);
5304 if (network) {
5305 Compile::current()->igv_print_method_to_network(phase_name, &fr);
5306 } else {
5307 Compile::current()->igv_print_method_to_file(phase_name, false, &fr);
5308 }
5309 }
5310
5311 // Called from debugger. Normal write to the default _printer. Only works if Ideal Graph Visualizer printing flags are set.
5312 void igv_print_default() {
5313 Compile::current()->print_method(PHASE_DEBUG, 0);
5314 }
5315
5316 // Called from debugger, especially when replaying a trace in which the program state cannot be altered like with rr replay.
5317 // A method is appended to an existing default file with the default phase name. This means that igv_append() must follow
5318 // an earlier igv_print(*) call which sets up the file. This works regardless of any Ideal Graph Visualizer flags set or not.
5319 // Use in debugger (gdb/rr): p igv_append($sp, $fp, $pc).
5320 void igv_append(void* sp, void* fp, void* pc) {
5321 frame fr(sp, fp, pc);
5322 Compile::current()->igv_print_method_to_file(nullptr, true, &fr);
5323 }
5324
5325 // Same as igv_append(...) above but with a specified phase name.
5326 // Use in debugger (gdb/rr): p igv_append("MyPhase", $sp, $fp, $pc).
5327 void igv_append(const char* phase_name, void* sp, void* fp, void* pc) {
5328 frame fr(sp, fp, pc);
5329 Compile::current()->igv_print_method_to_file(phase_name, true, &fr);
5330 }
5331
5332 void Compile::igv_print_method_to_file(const char* phase_name, bool append, const frame* fr) {
5333 const char* file_name = "custom_debug.xml";
5334 if (_debug_file_printer == nullptr) {
5335 _debug_file_printer = new IdealGraphPrinter(C, file_name, append);
5336 } else {
5337 _debug_file_printer->update_compiled_method(C->method());
5338 }
5339 tty->print_cr("Method %s to %s", append ? "appended" : "printed", file_name);
5340 _debug_file_printer->print_graph(phase_name, fr);
5341 }
5342
5343 void Compile::igv_print_method_to_network(const char* phase_name, const frame* fr) {
5344 ResourceMark rm;
5345 GrowableArray<const Node*> empty_list;
5346 igv_print_graph_to_network(phase_name, empty_list, fr);
5347 }
5348
5349 void Compile::igv_print_graph_to_network(const char* name, GrowableArray<const Node*>& visible_nodes, const frame* fr) {
5350 if (_debug_network_printer == nullptr) {
5351 _debug_network_printer = new IdealGraphPrinter(C);
5352 } else {
5353 _debug_network_printer->update_compiled_method(C->method());
5354 }
5355 tty->print_cr("Method printed over network stream to IGV");
5356 _debug_network_printer->print(name, C->root(), visible_nodes, fr);
5357 }
5358 #endif // !PRODUCT
5359
5360 Node* Compile::narrow_value(BasicType bt, Node* value, const Type* type, PhaseGVN* phase, bool transform_res) {
5361 if (type != nullptr && phase->type(value)->higher_equal(type)) {
5362 return value;
5363 }
5364 Node* result = nullptr;
5365 if (bt == T_BYTE) {
5366 result = phase->transform(new LShiftINode(value, phase->intcon(24)));
5367 result = new RShiftINode(result, phase->intcon(24));
5368 } else if (bt == T_BOOLEAN) {
5369 result = new AndINode(value, phase->intcon(0xFF));
5370 } else if (bt == T_CHAR) {
5371 result = new AndINode(value,phase->intcon(0xFFFF));
5372 } else {
5373 assert(bt == T_SHORT, "unexpected narrow type");
5374 result = phase->transform(new LShiftINode(value, phase->intcon(16)));
5375 result = new RShiftINode(result, phase->intcon(16));
5376 }
5377 if (transform_res) {
5378 result = phase->transform(result);
5379 }
5380 return result;
5381 }
5382
5383 void Compile::record_method_not_compilable_oom() {
5384 record_method_not_compilable(CompilationMemoryStatistic::failure_reason_memlimit());
5385 }
5386
5387 #ifndef PRODUCT
5388 // Collects all the control inputs from nodes on the worklist and from their data dependencies
5389 static void find_candidate_control_inputs(Unique_Node_List& worklist, Unique_Node_List& candidates) {
5390 // Follow non-control edges until we reach CFG nodes
5391 for (uint i = 0; i < worklist.size(); i++) {
5392 const Node* n = worklist.at(i);
5393 for (uint j = 0; j < n->req(); j++) {
5394 Node* in = n->in(j);
5395 if (in == nullptr || in->is_Root()) {
5396 continue;
5397 }
5398 if (in->is_CFG()) {
5399 if (in->is_Call()) {
5400 // The return value of a call is only available if the call did not result in an exception
5401 Node* control_proj_use = in->as_Call()->proj_out(TypeFunc::Control)->unique_out();
5402 if (control_proj_use->is_Catch()) {
5403 Node* fall_through = control_proj_use->as_Catch()->proj_out(CatchProjNode::fall_through_index);
5404 candidates.push(fall_through);
5405 continue;
5406 }
5407 }
5408
5409 if (in->is_Multi()) {
5410 // We got here by following data inputs so we should only have one control use
5411 // (no IfNode, etc)
5412 assert(!n->is_MultiBranch(), "unexpected node type: %s", n->Name());
5413 candidates.push(in->as_Multi()->proj_out(TypeFunc::Control));
5414 } else {
5415 candidates.push(in);
5416 }
5417 } else {
5418 worklist.push(in);
5419 }
5420 }
5421 }
5422 }
5423
5424 // Returns the candidate node that is a descendant to all the other candidates
5425 static Node* pick_control(Unique_Node_List& candidates) {
5426 Unique_Node_List worklist;
5427 worklist.copy(candidates);
5428
5429 // Traverse backwards through the CFG
5430 for (uint i = 0; i < worklist.size(); i++) {
5431 const Node* n = worklist.at(i);
5432 if (n->is_Root()) {
5433 continue;
5434 }
5435 for (uint j = 0; j < n->req(); j++) {
5436 // Skip backedge of loops to avoid cycles
5437 if (n->is_Loop() && j == LoopNode::LoopBackControl) {
5438 continue;
5439 }
5440
5441 Node* pred = n->in(j);
5442 if (pred != nullptr && pred != n && pred->is_CFG()) {
5443 worklist.push(pred);
5444 // if pred is an ancestor of n, then pred is an ancestor to at least one candidate
5445 candidates.remove(pred);
5446 }
5447 }
5448 }
5449
5450 assert(candidates.size() == 1, "unexpected control flow");
5451 return candidates.at(0);
5452 }
5453
5454 // Initialize a parameter input for a debug print call, using a placeholder for jlong and jdouble
5455 static void debug_print_init_parm(Node* call, Node* parm, Node* half, int* pos) {
5456 call->init_req((*pos)++, parm);
5457 const BasicType bt = parm->bottom_type()->basic_type();
5458 if (bt == T_LONG || bt == T_DOUBLE) {
5459 call->init_req((*pos)++, half);
5460 }
5461 }
5462
5463 Node* Compile::make_debug_print_call(const char* str, address call_addr, PhaseGVN* gvn,
5464 Node* parm0, Node* parm1,
5465 Node* parm2, Node* parm3,
5466 Node* parm4, Node* parm5,
5467 Node* parm6) const {
5468 Node* str_node = gvn->transform(new ConPNode(TypeRawPtr::make(((address) str))));
5469 const TypeFunc* type = OptoRuntime::debug_print_Type(parm0, parm1, parm2, parm3, parm4, parm5, parm6);
5470 Node* call = new CallLeafNode(type, call_addr, "debug_print", TypeRawPtr::BOTTOM);
5471
5472 // find the most suitable control input
5473 Unique_Node_List worklist, candidates;
5474 if (parm0 != nullptr) { worklist.push(parm0);
5475 if (parm1 != nullptr) { worklist.push(parm1);
5476 if (parm2 != nullptr) { worklist.push(parm2);
5477 if (parm3 != nullptr) { worklist.push(parm3);
5478 if (parm4 != nullptr) { worklist.push(parm4);
5479 if (parm5 != nullptr) { worklist.push(parm5);
5480 if (parm6 != nullptr) { worklist.push(parm6);
5481 /* close each nested if ===> */ } } } } } } }
5482 find_candidate_control_inputs(worklist, candidates);
5483 Node* control = nullptr;
5484 if (candidates.size() == 0) {
5485 control = C->start()->proj_out(TypeFunc::Control);
5486 } else {
5487 control = pick_control(candidates);
5488 }
5489
5490 // find all the previous users of the control we picked
5491 GrowableArray<Node*> users_of_control;
5492 for (DUIterator_Fast kmax, i = control->fast_outs(kmax); i < kmax; i++) {
5493 Node* use = control->fast_out(i);
5494 if (use->is_CFG() && use != control) {
5495 users_of_control.push(use);
5496 }
5497 }
5498
5499 // we do not actually care about IO and memory as it uses neither
5500 call->init_req(TypeFunc::Control, control);
5501 call->init_req(TypeFunc::I_O, top());
5502 call->init_req(TypeFunc::Memory, top());
5503 call->init_req(TypeFunc::FramePtr, C->start()->proj_out(TypeFunc::FramePtr));
5504 call->init_req(TypeFunc::ReturnAdr, top());
5505
5506 int pos = TypeFunc::Parms;
5507 call->init_req(pos++, str_node);
5508 if (parm0 != nullptr) { debug_print_init_parm(call, parm0, top(), &pos);
5509 if (parm1 != nullptr) { debug_print_init_parm(call, parm1, top(), &pos);
5510 if (parm2 != nullptr) { debug_print_init_parm(call, parm2, top(), &pos);
5511 if (parm3 != nullptr) { debug_print_init_parm(call, parm3, top(), &pos);
5512 if (parm4 != nullptr) { debug_print_init_parm(call, parm4, top(), &pos);
5513 if (parm5 != nullptr) { debug_print_init_parm(call, parm5, top(), &pos);
5514 if (parm6 != nullptr) { debug_print_init_parm(call, parm6, top(), &pos);
5515 /* close each nested if ===> */ } } } } } } }
5516 assert(call->in(call->req()-1) != nullptr, "must initialize all parms");
5517
5518 call = gvn->transform(call);
5519 Node* call_control_proj = gvn->transform(new ProjNode(call, TypeFunc::Control));
5520
5521 // rewire previous users to have the new call as control instead
5522 PhaseIterGVN* igvn = gvn->is_IterGVN();
5523 for (int i = 0; i < users_of_control.length(); i++) {
5524 Node* use = users_of_control.at(i);
5525 for (uint j = 0; j < use->req(); j++) {
5526 if (use->in(j) == control) {
5527 if (igvn != nullptr) {
5528 igvn->replace_input_of(use, j, call_control_proj);
5529 } else {
5530 gvn->hash_delete(use);
5531 use->set_req(j, call_control_proj);
5532 gvn->hash_insert(use);
5533 }
5534 }
5535 }
5536 }
5537
5538 return call;
5539 }
5540 #endif // !PRODUCT