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