1 /*
2 * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "compiler/compileLog.hpp"
27 #include "interpreter/linkResolver.hpp"
28 #include "memory/resourceArea.hpp"
29 #include "oops/method.hpp"
30 #include "opto/addnode.hpp"
31 #include "opto/c2compiler.hpp"
32 #include "opto/castnode.hpp"
33 #include "opto/idealGraphPrinter.hpp"
34 #include "opto/locknode.hpp"
35 #include "opto/memnode.hpp"
36 #include "opto/opaquenode.hpp"
37 #include "opto/parse.hpp"
38 #include "opto/rootnode.hpp"
39 #include "opto/runtime.hpp"
40 #include "opto/type.hpp"
41 #include "runtime/handles.inline.hpp"
42 #include "runtime/safepointMechanism.hpp"
43 #include "runtime/sharedRuntime.hpp"
44 #include "utilities/bitMap.inline.hpp"
45 #include "utilities/copy.hpp"
46
47 // Static array so we can figure out which bytecodes stop us from compiling
48 // the most. Some of the non-static variables are needed in bytecodeInfo.cpp
49 // and eventually should be encapsulated in a proper class (gri 8/18/98).
50
51 #ifndef PRODUCT
52 uint nodes_created = 0;
53 uint methods_parsed = 0;
54 uint methods_seen = 0;
55 uint blocks_parsed = 0;
56 uint blocks_seen = 0;
57
58 uint explicit_null_checks_inserted = 0;
59 uint explicit_null_checks_elided = 0;
60 uint all_null_checks_found = 0;
61 uint implicit_null_checks = 0;
62
63 bool Parse::BytecodeParseHistogram::_initialized = false;
64 uint Parse::BytecodeParseHistogram::_bytecodes_parsed [Bytecodes::number_of_codes];
65 uint Parse::BytecodeParseHistogram::_nodes_constructed[Bytecodes::number_of_codes];
66 uint Parse::BytecodeParseHistogram::_nodes_transformed[Bytecodes::number_of_codes];
67 uint Parse::BytecodeParseHistogram::_new_values [Bytecodes::number_of_codes];
68
69 //------------------------------print_statistics-------------------------------
70 void Parse::print_statistics() {
71 tty->print_cr("--- Compiler Statistics ---");
72 tty->print("Methods seen: %u Methods parsed: %u", methods_seen, methods_parsed);
73 tty->print(" Nodes created: %u", nodes_created);
74 tty->cr();
75 if (methods_seen != methods_parsed) {
76 tty->print_cr("Reasons for parse failures (NOT cumulative):");
77 }
78 tty->print_cr("Blocks parsed: %u Blocks seen: %u", blocks_parsed, blocks_seen);
79
80 if (explicit_null_checks_inserted) {
81 tty->print_cr("%u original null checks - %u elided (%2u%%); optimizer leaves %u,",
82 explicit_null_checks_inserted, explicit_null_checks_elided,
83 (100*explicit_null_checks_elided)/explicit_null_checks_inserted,
84 all_null_checks_found);
85 }
86 if (all_null_checks_found) {
87 tty->print_cr("%u made implicit (%2u%%)", implicit_null_checks,
88 (100*implicit_null_checks)/all_null_checks_found);
89 }
90 if (SharedRuntime::_implicit_null_throws) {
91 tty->print_cr("%u implicit null exceptions at runtime",
92 SharedRuntime::_implicit_null_throws);
93 }
94
95 if (PrintParseStatistics && BytecodeParseHistogram::initialized()) {
96 BytecodeParseHistogram::print();
97 }
98 }
99 #endif
100
101 //------------------------------ON STACK REPLACEMENT---------------------------
102
103 // Construct a node which can be used to get incoming state for
104 // on stack replacement.
105 Node *Parse::fetch_interpreter_state(int index,
106 BasicType bt,
107 Node *local_addrs,
108 Node *local_addrs_base) {
109 Node *mem = memory(Compile::AliasIdxRaw);
110 Node *adr = basic_plus_adr( local_addrs_base, local_addrs, -index*wordSize );
111 Node *ctl = control();
112
113 // Very similar to LoadNode::make, except we handle un-aligned longs and
114 // doubles on Sparc. Intel can handle them just fine directly.
115 Node *l = nullptr;
116 switch (bt) { // Signature is flattened
117 case T_INT: l = new LoadINode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeInt::INT, MemNode::unordered); break;
118 case T_FLOAT: l = new LoadFNode(ctl, mem, adr, TypeRawPtr::BOTTOM, Type::FLOAT, MemNode::unordered); break;
119 case T_ADDRESS: l = new LoadPNode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM, MemNode::unordered); break;
120 case T_OBJECT: l = new LoadPNode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeInstPtr::BOTTOM, MemNode::unordered); break;
121 case T_LONG:
122 case T_DOUBLE: {
123 // Since arguments are in reverse order, the argument address 'adr'
124 // refers to the back half of the long/double. Recompute adr.
125 adr = basic_plus_adr(local_addrs_base, local_addrs, -(index+1)*wordSize);
126 if (Matcher::misaligned_doubles_ok) {
127 l = (bt == T_DOUBLE)
128 ? (Node*)new LoadDNode(ctl, mem, adr, TypeRawPtr::BOTTOM, Type::DOUBLE, MemNode::unordered)
129 : (Node*)new LoadLNode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeLong::LONG, MemNode::unordered);
130 } else {
131 l = (bt == T_DOUBLE)
132 ? (Node*)new LoadD_unalignedNode(ctl, mem, adr, TypeRawPtr::BOTTOM, MemNode::unordered)
133 : (Node*)new LoadL_unalignedNode(ctl, mem, adr, TypeRawPtr::BOTTOM, MemNode::unordered);
134 }
135 break;
136 }
137 default: ShouldNotReachHere();
138 }
139 return _gvn.transform(l);
140 }
141
142 // Helper routine to prevent the interpreter from handing
143 // unexpected typestate to an OSR method.
144 // The Node l is a value newly dug out of the interpreter frame.
145 // The type is the type predicted by ciTypeFlow. Note that it is
146 // not a general type, but can only come from Type::get_typeflow_type.
147 // The safepoint is a map which will feed an uncommon trap.
148 Node* Parse::check_interpreter_type(Node* l, const Type* type,
149 SafePointNode* &bad_type_exit) {
150
151 const TypeOopPtr* tp = type->isa_oopptr();
152
153 // TypeFlow may assert null-ness if a type appears unloaded.
154 if (type == TypePtr::NULL_PTR ||
155 (tp != nullptr && !tp->is_loaded())) {
156 // Value must be null, not a real oop.
157 Node* chk = _gvn.transform( new CmpPNode(l, null()) );
158 Node* tst = _gvn.transform( new BoolNode(chk, BoolTest::eq) );
159 IfNode* iff = create_and_map_if(control(), tst, PROB_MAX, COUNT_UNKNOWN);
160 set_control(_gvn.transform( new IfTrueNode(iff) ));
161 Node* bad_type = _gvn.transform( new IfFalseNode(iff) );
162 bad_type_exit->control()->add_req(bad_type);
163 l = null();
164 }
165
166 // Typeflow can also cut off paths from the CFG, based on
167 // types which appear unloaded, or call sites which appear unlinked.
168 // When paths are cut off, values at later merge points can rise
169 // toward more specific classes. Make sure these specific classes
170 // are still in effect.
171 if (tp != nullptr && !tp->is_same_java_type_as(TypeInstPtr::BOTTOM)) {
172 // TypeFlow asserted a specific object type. Value must have that type.
173 Node* bad_type_ctrl = nullptr;
174 l = gen_checkcast(l, makecon(tp->as_klass_type()->cast_to_exactness(true)), &bad_type_ctrl);
175 bad_type_exit->control()->add_req(bad_type_ctrl);
176 }
177
178 assert(_gvn.type(l)->higher_equal(type), "must constrain OSR typestate");
179 return l;
180 }
181
182 // Helper routine which sets up elements of the initial parser map when
183 // performing a parse for on stack replacement. Add values into map.
184 // The only parameter contains the address of a interpreter arguments.
185 void Parse::load_interpreter_state(Node* osr_buf) {
186 int index;
187 int max_locals = jvms()->loc_size();
188 int max_stack = jvms()->stk_size();
189
190
191 // Mismatch between method and jvms can occur since map briefly held
192 // an OSR entry state (which takes up one RawPtr word).
193 assert(max_locals == method()->max_locals(), "sanity");
194 assert(max_stack >= method()->max_stack(), "sanity");
195 assert((int)jvms()->endoff() == TypeFunc::Parms + max_locals + max_stack, "sanity");
196 assert((int)jvms()->endoff() == (int)map()->req(), "sanity");
197
198 // Find the start block.
199 Block* osr_block = start_block();
200 assert(osr_block->start() == osr_bci(), "sanity");
201
202 // Set initial BCI.
203 set_parse_bci(osr_block->start());
204
205 // Set initial stack depth.
206 set_sp(osr_block->start_sp());
207
208 // Check bailouts. We currently do not perform on stack replacement
209 // of loops in catch blocks or loops which branch with a non-empty stack.
210 if (sp() != 0) {
211 C->record_method_not_compilable("OSR starts with non-empty stack");
212 return;
213 }
214 // Do not OSR inside finally clauses:
215 if (osr_block->has_trap_at(osr_block->start())) {
216 assert(false, "OSR starts with an immediate trap");
217 C->record_method_not_compilable("OSR starts with an immediate trap");
218 return;
219 }
220
221 // Commute monitors from interpreter frame to compiler frame.
222 assert(jvms()->monitor_depth() == 0, "should be no active locks at beginning of osr");
223 int mcnt = osr_block->flow()->monitor_count();
224 Node *monitors_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals+mcnt*2-1)*wordSize);
225 for (index = 0; index < mcnt; index++) {
226 // Make a BoxLockNode for the monitor.
227 BoxLockNode* osr_box = new BoxLockNode(next_monitor());
228 // Check for bailout after new BoxLockNode
229 if (failing()) { return; }
230
231 // This OSR locking region is unbalanced because it does not have Lock node:
232 // locking was done in Interpreter.
233 // This is similar to Coarsened case when Lock node is eliminated
234 // and as result the region is marked as Unbalanced.
235
236 // Emulate Coarsened state transition from Regular to Unbalanced.
237 osr_box->set_coarsened();
238 osr_box->set_unbalanced();
239
240 Node* box = _gvn.transform(osr_box);
241
242 // Displaced headers and locked objects are interleaved in the
243 // temp OSR buffer. We only copy the locked objects out here.
244 // Fetch the locked object from the OSR temp buffer and copy to our fastlock node.
245 Node *lock_object = fetch_interpreter_state(index*2, T_OBJECT, monitors_addr, osr_buf);
246 // Try and copy the displaced header to the BoxNode
247 Node *displaced_hdr = fetch_interpreter_state((index*2) + 1, T_ADDRESS, monitors_addr, osr_buf);
248
249
250 store_to_memory(control(), box, displaced_hdr, T_ADDRESS, Compile::AliasIdxRaw, MemNode::unordered);
251
252 // Build a bogus FastLockNode (no code will be generated) and push the
253 // monitor into our debug info.
254 const FastLockNode *flock = _gvn.transform(new FastLockNode( 0, lock_object, box ))->as_FastLock();
255 map()->push_monitor(flock);
256
257 // If the lock is our method synchronization lock, tuck it away in
258 // _sync_lock for return and rethrow exit paths.
259 if (index == 0 && method()->is_synchronized()) {
260 _synch_lock = flock;
261 }
262 }
263
264 // Use the raw liveness computation to make sure that unexpected
265 // values don't propagate into the OSR frame.
266 MethodLivenessResult live_locals = method()->liveness_at_bci(osr_bci());
267 if (!live_locals.is_valid()) {
268 // Degenerate or breakpointed method.
269 assert(false, "OSR in empty or breakpointed method");
270 C->record_method_not_compilable("OSR in empty or breakpointed method");
271 return;
272 }
273
274 // Extract the needed locals from the interpreter frame.
275 Node *locals_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals-1)*wordSize);
276
277 // find all the locals that the interpreter thinks contain live oops
278 const ResourceBitMap live_oops = method()->live_local_oops_at_bci(osr_bci());
279 for (index = 0; index < max_locals; index++) {
280
281 if (!live_locals.at(index)) {
282 continue;
283 }
284
285 const Type *type = osr_block->local_type_at(index);
286
287 if (type->isa_oopptr() != nullptr) {
288
289 // 6403625: Verify that the interpreter oopMap thinks that the oop is live
290 // else we might load a stale oop if the MethodLiveness disagrees with the
291 // result of the interpreter. If the interpreter says it is dead we agree
292 // by making the value go to top.
293 //
294
295 if (!live_oops.at(index)) {
296 if (C->log() != nullptr) {
297 C->log()->elem("OSR_mismatch local_index='%d'",index);
298 }
299 set_local(index, null());
300 // and ignore it for the loads
301 continue;
302 }
303 }
304
305 // Filter out TOP, HALF, and BOTTOM. (Cf. ensure_phi.)
306 if (type == Type::TOP || type == Type::HALF) {
307 continue;
308 }
309 // If the type falls to bottom, then this must be a local that
310 // is mixing ints and oops or some such. Forcing it to top
311 // makes it go dead.
312 if (type == Type::BOTTOM) {
313 continue;
314 }
315 // Construct code to access the appropriate local.
316 BasicType bt = type->basic_type();
317 if (type == TypePtr::NULL_PTR) {
318 // Ptr types are mixed together with T_ADDRESS but null is
319 // really for T_OBJECT types so correct it.
320 bt = T_OBJECT;
321 }
322 Node *value = fetch_interpreter_state(index, bt, locals_addr, osr_buf);
323 set_local(index, value);
324 }
325
326 // Extract the needed stack entries from the interpreter frame.
327 for (index = 0; index < sp(); index++) {
328 const Type *type = osr_block->stack_type_at(index);
329 if (type != Type::TOP) {
330 // Currently the compiler bails out when attempting to on stack replace
331 // at a bci with a non-empty stack. We should not reach here.
332 ShouldNotReachHere();
333 }
334 }
335
336 // End the OSR migration
337 make_runtime_call(RC_LEAF, OptoRuntime::osr_end_Type(),
338 CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
339 "OSR_migration_end", TypeRawPtr::BOTTOM,
340 osr_buf);
341
342 // Now that the interpreter state is loaded, make sure it will match
343 // at execution time what the compiler is expecting now:
344 SafePointNode* bad_type_exit = clone_map();
345 bad_type_exit->set_control(new RegionNode(1));
346
347 assert(osr_block->flow()->jsrs()->size() == 0, "should be no jsrs live at osr point");
348 for (index = 0; index < max_locals; index++) {
349 if (stopped()) break;
350 Node* l = local(index);
351 if (l->is_top()) continue; // nothing here
352 const Type *type = osr_block->local_type_at(index);
353 if (type->isa_oopptr() != nullptr) {
354 if (!live_oops.at(index)) {
355 // skip type check for dead oops
356 continue;
357 }
358 }
359 if (osr_block->flow()->local_type_at(index)->is_return_address()) {
360 // In our current system it's illegal for jsr addresses to be
361 // live into an OSR entry point because the compiler performs
362 // inlining of jsrs. ciTypeFlow has a bailout that detect this
363 // case and aborts the compile if addresses are live into an OSR
364 // entry point. Because of that we can assume that any address
365 // locals at the OSR entry point are dead. Method liveness
366 // isn't precise enough to figure out that they are dead in all
367 // cases so simply skip checking address locals all
368 // together. Any type check is guaranteed to fail since the
369 // interpreter type is the result of a load which might have any
370 // value and the expected type is a constant.
371 continue;
372 }
373 set_local(index, check_interpreter_type(l, type, bad_type_exit));
374 }
375
376 for (index = 0; index < sp(); index++) {
377 if (stopped()) break;
378 Node* l = stack(index);
379 if (l->is_top()) continue; // nothing here
380 const Type *type = osr_block->stack_type_at(index);
381 set_stack(index, check_interpreter_type(l, type, bad_type_exit));
382 }
383
384 if (bad_type_exit->control()->req() > 1) {
385 // Build an uncommon trap here, if any inputs can be unexpected.
386 bad_type_exit->set_control(_gvn.transform( bad_type_exit->control() ));
387 record_for_igvn(bad_type_exit->control());
388 SafePointNode* types_are_good = map();
389 set_map(bad_type_exit);
390 // The unexpected type happens because a new edge is active
391 // in the CFG, which typeflow had previously ignored.
392 // E.g., Object x = coldAtFirst() && notReached()? "str": new Integer(123).
393 // This x will be typed as Integer if notReached is not yet linked.
394 // It could also happen due to a problem in ciTypeFlow analysis.
395 uncommon_trap(Deoptimization::Reason_constraint,
396 Deoptimization::Action_reinterpret);
397 set_map(types_are_good);
398 }
399 }
400
401 //------------------------------Parse------------------------------------------
402 // Main parser constructor.
403 Parse::Parse(JVMState* caller, ciMethod* parse_method, float expected_uses)
404 : _exits(caller)
405 {
406 // Init some variables
407 _caller = caller;
408 _method = parse_method;
409 _expected_uses = expected_uses;
410 _depth = 1 + (caller->has_method() ? caller->depth() : 0);
411 _wrote_final = false;
412 _wrote_volatile = false;
413 _wrote_stable = false;
414 _wrote_fields = false;
415 _alloc_with_final = nullptr;
416 _block = nullptr;
417 _first_return = true;
418 _replaced_nodes_for_exceptions = false;
419 _new_idx = C->unique();
420 DEBUG_ONLY(_entry_bci = UnknownBci);
421 DEBUG_ONLY(_block_count = -1);
422 DEBUG_ONLY(_blocks = (Block*)-1);
423 #ifndef PRODUCT
424 if (PrintCompilation || PrintOpto) {
425 // Make sure I have an inline tree, so I can print messages about it.
426 InlineTree::find_subtree_from_root(C->ilt(), caller, parse_method);
427 }
428 _max_switch_depth = 0;
429 _est_switch_depth = 0;
430 #endif
431
432 if (parse_method->has_reserved_stack_access()) {
433 C->set_has_reserved_stack_access(true);
434 }
435
436 if (parse_method->is_synchronized() || parse_method->has_monitor_bytecodes()) {
437 C->set_has_monitors(true);
438 }
439
440 _iter.reset_to_method(method());
441 C->set_has_loops(C->has_loops() || method()->has_loops());
442
443 if (_expected_uses <= 0) {
444 _prof_factor = 1;
445 } else {
446 float prof_total = parse_method->interpreter_invocation_count();
447 if (prof_total <= _expected_uses) {
448 _prof_factor = 1;
449 } else {
450 _prof_factor = _expected_uses / prof_total;
451 }
452 }
453
454 CompileLog* log = C->log();
455 if (log != nullptr) {
456 log->begin_head("parse method='%d' uses='%f'",
457 log->identify(parse_method), expected_uses);
458 if (depth() == 1 && C->is_osr_compilation()) {
459 log->print(" osr_bci='%d'", C->entry_bci());
460 }
461 log->stamp();
462 log->end_head();
463 }
464
465 // Accumulate deoptimization counts.
466 // (The range_check and store_check counts are checked elsewhere.)
467 ciMethodData* md = method()->method_data();
468 for (uint reason = 0; reason < md->trap_reason_limit(); reason++) {
469 uint md_count = md->trap_count(reason);
470 if (md_count != 0) {
471 if (md_count >= md->trap_count_limit()) {
472 md_count = md->trap_count_limit() + md->overflow_trap_count();
473 }
474 uint total_count = C->trap_count(reason);
475 uint old_count = total_count;
476 total_count += md_count;
477 // Saturate the add if it overflows.
478 if (total_count < old_count || total_count < md_count)
479 total_count = (uint)-1;
480 C->set_trap_count(reason, total_count);
481 if (log != nullptr)
482 log->elem("observe trap='%s' count='%d' total='%d'",
483 Deoptimization::trap_reason_name(reason),
484 md_count, total_count);
485 }
486 }
487 // Accumulate total sum of decompilations, also.
488 C->set_decompile_count(C->decompile_count() + md->decompile_count());
489
490 if (log != nullptr && method()->has_exception_handlers()) {
491 log->elem("observe that='has_exception_handlers'");
492 }
493
494 assert(InlineTree::check_can_parse(method()) == nullptr, "Can not parse this method, cutout earlier");
495 assert(method()->has_balanced_monitors(), "Can not parse unbalanced monitors, cutout earlier");
496
497 // Always register dependence if JVMTI is enabled, because
498 // either breakpoint setting or hotswapping of methods may
499 // cause deoptimization.
500 if (C->env()->jvmti_can_hotswap_or_post_breakpoint()) {
501 C->dependencies()->assert_evol_method(method());
502 }
503
504 NOT_PRODUCT(methods_seen++);
505
506 // Do some special top-level things.
507 if (depth() == 1 && C->is_osr_compilation()) {
508 _tf = C->tf(); // the OSR entry type is different
509 _entry_bci = C->entry_bci();
510 _flow = method()->get_osr_flow_analysis(osr_bci());
511 } else {
512 _tf = TypeFunc::make(method());
513 _entry_bci = InvocationEntryBci;
514 _flow = method()->get_flow_analysis();
515 }
516
517 if (_flow->failing()) {
518 assert(false, "type flow analysis failed during parsing");
519 C->record_method_not_compilable(_flow->failure_reason());
520 #ifndef PRODUCT
521 if (PrintOpto && (Verbose || WizardMode)) {
522 if (is_osr_parse()) {
523 tty->print_cr("OSR @%d type flow bailout: %s", _entry_bci, _flow->failure_reason());
524 } else {
525 tty->print_cr("type flow bailout: %s", _flow->failure_reason());
526 }
527 if (Verbose) {
528 method()->print();
529 method()->print_codes();
530 _flow->print();
531 }
532 }
533 #endif
534 }
535
536 #ifdef ASSERT
537 if (depth() == 1) {
538 assert(C->is_osr_compilation() == this->is_osr_parse(), "OSR in sync");
539 } else {
540 assert(!this->is_osr_parse(), "no recursive OSR");
541 }
542 #endif
543
544 #ifndef PRODUCT
545 if (_flow->has_irreducible_entry()) {
546 C->set_parsed_irreducible_loop(true);
547 }
548
549 methods_parsed++;
550 // add method size here to guarantee that inlined methods are added too
551 if (CITime)
552 _total_bytes_compiled += method()->code_size();
553
554 show_parse_info();
555 #endif
556
557 if (failing()) {
558 if (log) log->done("parse");
559 return;
560 }
561
562 gvn().transform(top());
563
564 // Import the results of the ciTypeFlow.
565 init_blocks();
566
567 // Merge point for all normal exits
568 build_exits();
569
570 // Setup the initial JVM state map.
571 SafePointNode* entry_map = create_entry_map();
572
573 // Check for bailouts during map initialization
574 if (failing() || entry_map == nullptr) {
575 if (log) log->done("parse");
576 return;
577 }
578
579 Node_Notes* caller_nn = C->default_node_notes();
580 // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls.
581 if (DebugInlinedCalls || depth() == 1) {
582 C->set_default_node_notes(make_node_notes(caller_nn));
583 }
584
585 if (is_osr_parse()) {
586 Node* osr_buf = entry_map->in(TypeFunc::Parms+0);
587 entry_map->set_req(TypeFunc::Parms+0, top());
588 set_map(entry_map);
589 load_interpreter_state(osr_buf);
590 } else {
591 set_map(entry_map);
592 do_method_entry();
593 }
594
595 if (depth() == 1 && !failing()) {
596 if (C->clinit_barrier_on_entry()) {
597 // Add check to deoptimize the nmethod once the holder class is fully initialized
598 clinit_deopt();
599 }
600
601 // Add check to deoptimize the nmethod if RTM state was changed
602 rtm_deopt();
603 }
604
605 // Check for bailouts during method entry or RTM state check setup.
606 if (failing()) {
607 if (log) log->done("parse");
608 C->set_default_node_notes(caller_nn);
609 return;
610 }
611
612 entry_map = map(); // capture any changes performed by method setup code
613 assert(jvms()->endoff() == map()->req(), "map matches JVMS layout");
614
615 // We begin parsing as if we have just encountered a jump to the
616 // method entry.
617 Block* entry_block = start_block();
618 assert(entry_block->start() == (is_osr_parse() ? osr_bci() : 0), "");
619 set_map_clone(entry_map);
620 merge_common(entry_block, entry_block->next_path_num());
621
622 #ifndef PRODUCT
623 BytecodeParseHistogram *parse_histogram_obj = new (C->env()->arena()) BytecodeParseHistogram(this, C);
624 set_parse_histogram( parse_histogram_obj );
625 #endif
626
627 // Parse all the basic blocks.
628 do_all_blocks();
629
630 // Check for bailouts during conversion to graph
631 if (failing()) {
632 if (log) log->done("parse");
633 return;
634 }
635
636 // Fix up all exiting control flow.
637 set_map(entry_map);
638 do_exits();
639
640 // Only reset this now, to make sure that debug information emitted
641 // for exiting control flow still refers to the inlined method.
642 C->set_default_node_notes(caller_nn);
643
644 if (log) log->done("parse nodes='%d' live='%d' memory='" SIZE_FORMAT "'",
645 C->unique(), C->live_nodes(), C->node_arena()->used());
646 }
647
648 //---------------------------do_all_blocks-------------------------------------
649 void Parse::do_all_blocks() {
650 bool has_irreducible = flow()->has_irreducible_entry();
651
652 // Walk over all blocks in Reverse Post-Order.
653 while (true) {
654 bool progress = false;
655 for (int rpo = 0; rpo < block_count(); rpo++) {
656 Block* block = rpo_at(rpo);
657
658 if (block->is_parsed()) continue;
659
660 if (!block->is_merged()) {
661 // Dead block, no state reaches this block
662 continue;
663 }
664
665 // Prepare to parse this block.
666 load_state_from(block);
667
668 if (stopped()) {
669 // Block is dead.
670 continue;
671 }
672
673 NOT_PRODUCT(blocks_parsed++);
674
675 progress = true;
676 if (block->is_loop_head() || block->is_handler() || (has_irreducible && !block->is_ready())) {
677 // Not all preds have been parsed. We must build phis everywhere.
678 // (Note that dead locals do not get phis built, ever.)
679 ensure_phis_everywhere();
680
681 if (block->is_SEL_head()) {
682 // Add predicate to single entry (not irreducible) loop head.
683 assert(!block->has_merged_backedge(), "only entry paths should be merged for now");
684 // Predicates may have been added after a dominating if
685 if (!block->has_predicates()) {
686 // Need correct bci for predicate.
687 // It is fine to set it here since do_one_block() will set it anyway.
688 set_parse_bci(block->start());
689 add_parse_predicates();
690 }
691 // Add new region for back branches.
692 int edges = block->pred_count() - block->preds_parsed() + 1; // +1 for original region
693 RegionNode *r = new RegionNode(edges+1);
694 _gvn.set_type(r, Type::CONTROL);
695 record_for_igvn(r);
696 r->init_req(edges, control());
697 set_control(r);
698 block->copy_irreducible_status_to(r, jvms());
699 // Add new phis.
700 ensure_phis_everywhere();
701 }
702
703 // Leave behind an undisturbed copy of the map, for future merges.
704 set_map(clone_map());
705 }
706
707 if (control()->is_Region() && !block->is_loop_head() && !has_irreducible && !block->is_handler()) {
708 // In the absence of irreducible loops, the Region and Phis
709 // associated with a merge that doesn't involve a backedge can
710 // be simplified now since the RPO parsing order guarantees
711 // that any path which was supposed to reach here has already
712 // been parsed or must be dead.
713 Node* c = control();
714 Node* result = _gvn.transform(control());
715 if (c != result && TraceOptoParse) {
716 tty->print_cr("Block #%d replace %d with %d", block->rpo(), c->_idx, result->_idx);
717 }
718 if (result != top()) {
719 record_for_igvn(result);
720 }
721 }
722
723 // Parse the block.
724 do_one_block();
725
726 // Check for bailouts.
727 if (failing()) return;
728 }
729
730 // with irreducible loops multiple passes might be necessary to parse everything
731 if (!has_irreducible || !progress) {
732 break;
733 }
734 }
735
736 #ifndef PRODUCT
737 blocks_seen += block_count();
738
739 // Make sure there are no half-processed blocks remaining.
740 // Every remaining unprocessed block is dead and may be ignored now.
741 for (int rpo = 0; rpo < block_count(); rpo++) {
742 Block* block = rpo_at(rpo);
743 if (!block->is_parsed()) {
744 if (TraceOptoParse) {
745 tty->print_cr("Skipped dead block %d at bci:%d", rpo, block->start());
746 }
747 assert(!block->is_merged(), "no half-processed blocks");
748 }
749 }
750 #endif
751 }
752
753 static Node* mask_int_value(Node* v, BasicType bt, PhaseGVN* gvn) {
754 switch (bt) {
755 case T_BYTE:
756 v = gvn->transform(new LShiftINode(v, gvn->intcon(24)));
757 v = gvn->transform(new RShiftINode(v, gvn->intcon(24)));
758 break;
759 case T_SHORT:
760 v = gvn->transform(new LShiftINode(v, gvn->intcon(16)));
761 v = gvn->transform(new RShiftINode(v, gvn->intcon(16)));
762 break;
763 case T_CHAR:
764 v = gvn->transform(new AndINode(v, gvn->intcon(0xFFFF)));
765 break;
766 case T_BOOLEAN:
767 v = gvn->transform(new AndINode(v, gvn->intcon(0x1)));
768 break;
769 default:
770 break;
771 }
772 return v;
773 }
774
775 //-------------------------------build_exits----------------------------------
776 // Build normal and exceptional exit merge points.
777 void Parse::build_exits() {
778 // make a clone of caller to prevent sharing of side-effects
779 _exits.set_map(_exits.clone_map());
780 _exits.clean_stack(_exits.sp());
781 _exits.sync_jvms();
782
783 RegionNode* region = new RegionNode(1);
784 record_for_igvn(region);
785 gvn().set_type_bottom(region);
786 _exits.set_control(region);
787
788 // Note: iophi and memphi are not transformed until do_exits.
789 Node* iophi = new PhiNode(region, Type::ABIO);
790 Node* memphi = new PhiNode(region, Type::MEMORY, TypePtr::BOTTOM);
791 gvn().set_type_bottom(iophi);
792 gvn().set_type_bottom(memphi);
793 _exits.set_i_o(iophi);
794 _exits.set_all_memory(memphi);
795
796 // Add a return value to the exit state. (Do not push it yet.)
797 if (tf()->range()->cnt() > TypeFunc::Parms) {
798 const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms);
799 if (ret_type->isa_int()) {
800 BasicType ret_bt = method()->return_type()->basic_type();
801 if (ret_bt == T_BOOLEAN ||
802 ret_bt == T_CHAR ||
803 ret_bt == T_BYTE ||
804 ret_bt == T_SHORT) {
805 ret_type = TypeInt::INT;
806 }
807 }
808
809 // Don't "bind" an unloaded return klass to the ret_phi. If the klass
810 // becomes loaded during the subsequent parsing, the loaded and unloaded
811 // types will not join when we transform and push in do_exits().
812 const TypeOopPtr* ret_oop_type = ret_type->isa_oopptr();
813 if (ret_oop_type && !ret_oop_type->is_loaded()) {
814 ret_type = TypeOopPtr::BOTTOM;
815 }
816 int ret_size = type2size[ret_type->basic_type()];
817 Node* ret_phi = new PhiNode(region, ret_type);
818 gvn().set_type_bottom(ret_phi);
819 _exits.ensure_stack(ret_size);
820 assert((int)(tf()->range()->cnt() - TypeFunc::Parms) == ret_size, "good tf range");
821 assert(method()->return_type()->size() == ret_size, "tf agrees w/ method");
822 _exits.set_argument(0, ret_phi); // here is where the parser finds it
823 // Note: ret_phi is not yet pushed, until do_exits.
824 }
825 }
826
827
828 //----------------------------build_start_state-------------------------------
829 // Construct a state which contains only the incoming arguments from an
830 // unknown caller. The method & bci will be null & InvocationEntryBci.
831 JVMState* Compile::build_start_state(StartNode* start, const TypeFunc* tf) {
832 int arg_size = tf->domain()->cnt();
833 int max_size = MAX2(arg_size, (int)tf->range()->cnt());
834 JVMState* jvms = new (this) JVMState(max_size - TypeFunc::Parms);
835 SafePointNode* map = new SafePointNode(max_size, jvms);
836 record_for_igvn(map);
837 assert(arg_size == TypeFunc::Parms + (is_osr_compilation() ? 1 : method()->arg_size()), "correct arg_size");
838 Node_Notes* old_nn = default_node_notes();
839 if (old_nn != nullptr && has_method()) {
840 Node_Notes* entry_nn = old_nn->clone(this);
841 JVMState* entry_jvms = new(this) JVMState(method(), old_nn->jvms());
842 entry_jvms->set_offsets(0);
843 entry_jvms->set_bci(entry_bci());
844 entry_nn->set_jvms(entry_jvms);
845 set_default_node_notes(entry_nn);
846 }
847 uint i;
848 for (i = 0; i < (uint)arg_size; i++) {
849 Node* parm = initial_gvn()->transform(new ParmNode(start, i));
850 map->init_req(i, parm);
851 // Record all these guys for later GVN.
852 record_for_igvn(parm);
853 }
854 for (; i < map->req(); i++) {
855 map->init_req(i, top());
856 }
857 assert(jvms->argoff() == TypeFunc::Parms, "parser gets arguments here");
858 set_default_node_notes(old_nn);
859 jvms->set_map(map);
860 return jvms;
861 }
862
863 //-----------------------------make_node_notes---------------------------------
864 Node_Notes* Parse::make_node_notes(Node_Notes* caller_nn) {
865 if (caller_nn == nullptr) return nullptr;
866 Node_Notes* nn = caller_nn->clone(C);
867 JVMState* caller_jvms = nn->jvms();
868 JVMState* jvms = new (C) JVMState(method(), caller_jvms);
869 jvms->set_offsets(0);
870 jvms->set_bci(_entry_bci);
871 nn->set_jvms(jvms);
872 return nn;
873 }
874
875
876 //--------------------------return_values--------------------------------------
877 void Compile::return_values(JVMState* jvms) {
878 GraphKit kit(jvms);
879 Node* ret = new ReturnNode(TypeFunc::Parms,
880 kit.control(),
881 kit.i_o(),
882 kit.reset_memory(),
883 kit.frameptr(),
884 kit.returnadr());
885 // Add zero or 1 return values
886 int ret_size = tf()->range()->cnt() - TypeFunc::Parms;
887 if (ret_size > 0) {
888 kit.inc_sp(-ret_size); // pop the return value(s)
889 kit.sync_jvms();
890 ret->add_req(kit.argument(0));
891 // Note: The second dummy edge is not needed by a ReturnNode.
892 }
893 // bind it to root
894 root()->add_req(ret);
895 record_for_igvn(ret);
896 initial_gvn()->transform(ret);
897 }
898
899 //------------------------rethrow_exceptions-----------------------------------
900 // Bind all exception states in the list into a single RethrowNode.
901 void Compile::rethrow_exceptions(JVMState* jvms) {
902 GraphKit kit(jvms);
903 if (!kit.has_exceptions()) return; // nothing to generate
904 // Load my combined exception state into the kit, with all phis transformed:
905 SafePointNode* ex_map = kit.combine_and_pop_all_exception_states();
906 Node* ex_oop = kit.use_exception_state(ex_map);
907 RethrowNode* exit = new RethrowNode(kit.control(),
908 kit.i_o(), kit.reset_memory(),
909 kit.frameptr(), kit.returnadr(),
910 // like a return but with exception input
911 ex_oop);
912 // bind to root
913 root()->add_req(exit);
914 record_for_igvn(exit);
915 initial_gvn()->transform(exit);
916 }
917
918 //---------------------------do_exceptions-------------------------------------
919 // Process exceptions arising from the current bytecode.
920 // Send caught exceptions to the proper handler within this method.
921 // Unhandled exceptions feed into _exit.
922 void Parse::do_exceptions() {
923 if (!has_exceptions()) return;
924
925 if (failing()) {
926 // Pop them all off and throw them away.
927 while (pop_exception_state() != nullptr) ;
928 return;
929 }
930
931 PreserveJVMState pjvms(this, false);
932
933 SafePointNode* ex_map;
934 while ((ex_map = pop_exception_state()) != nullptr) {
935 if (!method()->has_exception_handlers()) {
936 // Common case: Transfer control outward.
937 // Doing it this early allows the exceptions to common up
938 // even between adjacent method calls.
939 throw_to_exit(ex_map);
940 } else {
941 // Have to look at the exception first.
942 assert(stopped(), "catch_inline_exceptions trashes the map");
943 catch_inline_exceptions(ex_map);
944 stop_and_kill_map(); // we used up this exception state; kill it
945 }
946 }
947
948 // We now return to our regularly scheduled program:
949 }
950
951 //---------------------------throw_to_exit-------------------------------------
952 // Merge the given map into an exception exit from this method.
953 // The exception exit will handle any unlocking of receiver.
954 // The ex_oop must be saved within the ex_map, unlike merge_exception.
955 void Parse::throw_to_exit(SafePointNode* ex_map) {
956 // Pop the JVMS to (a copy of) the caller.
957 GraphKit caller;
958 caller.set_map_clone(_caller->map());
959 caller.set_bci(_caller->bci());
960 caller.set_sp(_caller->sp());
961 // Copy out the standard machine state:
962 for (uint i = 0; i < TypeFunc::Parms; i++) {
963 caller.map()->set_req(i, ex_map->in(i));
964 }
965 if (ex_map->has_replaced_nodes()) {
966 _replaced_nodes_for_exceptions = true;
967 }
968 caller.map()->transfer_replaced_nodes_from(ex_map, _new_idx);
969 // ...and the exception:
970 Node* ex_oop = saved_ex_oop(ex_map);
971 SafePointNode* caller_ex_map = caller.make_exception_state(ex_oop);
972 // Finally, collect the new exception state in my exits:
973 _exits.add_exception_state(caller_ex_map);
974 }
975
976 //------------------------------do_exits---------------------------------------
977 void Parse::do_exits() {
978 set_parse_bci(InvocationEntryBci);
979
980 // Now peephole on the return bits
981 Node* region = _exits.control();
982 _exits.set_control(gvn().transform(region));
983
984 Node* iophi = _exits.i_o();
985 _exits.set_i_o(gvn().transform(iophi));
986
987 // Figure out if we need to emit the trailing barrier. The barrier is only
988 // needed in the constructors, and only in three cases:
989 //
990 // 1. The constructor wrote a final. The effects of all initializations
991 // must be committed to memory before any code after the constructor
992 // publishes the reference to the newly constructed object. Rather
993 // than wait for the publication, we simply block the writes here.
994 // Rather than put a barrier on only those writes which are required
995 // to complete, we force all writes to complete.
996 //
997 // 2. Experimental VM option is used to force the barrier if any field
998 // was written out in the constructor.
999 //
1000 // 3. On processors which are not CPU_MULTI_COPY_ATOMIC (e.g. PPC64),
1001 // support_IRIW_for_not_multiple_copy_atomic_cpu selects that
1002 // MemBarVolatile is used before volatile load instead of after volatile
1003 // store, so there's no barrier after the store.
1004 // We want to guarantee the same behavior as on platforms with total store
1005 // order, although this is not required by the Java memory model.
1006 // In this case, we want to enforce visibility of volatile field
1007 // initializations which are performed in constructors.
1008 // So as with finals, we add a barrier here.
1009 //
1010 // "All bets are off" unless the first publication occurs after a
1011 // normal return from the constructor. We do not attempt to detect
1012 // such unusual early publications. But no barrier is needed on
1013 // exceptional returns, since they cannot publish normally.
1014 //
1015 if (method()->is_initializer() &&
1016 (wrote_final() ||
1017 (AlwaysSafeConstructors && wrote_fields()) ||
1018 (support_IRIW_for_not_multiple_copy_atomic_cpu && wrote_volatile()))) {
1019 _exits.insert_mem_bar(UseStoreStoreForCtor ? Op_MemBarStoreStore : Op_MemBarRelease,
1020 alloc_with_final());
1021
1022 // If Memory barrier is created for final fields write
1023 // and allocation node does not escape the initialize method,
1024 // then barrier introduced by allocation node can be removed.
1025 if (DoEscapeAnalysis && alloc_with_final()) {
1026 AllocateNode* alloc = AllocateNode::Ideal_allocation(alloc_with_final());
1027 alloc->compute_MemBar_redundancy(method());
1028 }
1029 if (PrintOpto && (Verbose || WizardMode)) {
1030 method()->print_name();
1031 tty->print_cr(" writes finals and needs a memory barrier");
1032 }
1033 }
1034
1035 // Any method can write a @Stable field; insert memory barriers
1036 // after those also. Can't bind predecessor allocation node (if any)
1037 // with barrier because allocation doesn't always dominate
1038 // MemBarRelease.
1039 if (wrote_stable()) {
1040 _exits.insert_mem_bar(Op_MemBarRelease);
1041 if (PrintOpto && (Verbose || WizardMode)) {
1042 method()->print_name();
1043 tty->print_cr(" writes @Stable and needs a memory barrier");
1044 }
1045 }
1046
1047 for (MergeMemStream mms(_exits.merged_memory()); mms.next_non_empty(); ) {
1048 // transform each slice of the original memphi:
1049 mms.set_memory(_gvn.transform(mms.memory()));
1050 }
1051 // Clean up input MergeMems created by transforming the slices
1052 _gvn.transform(_exits.merged_memory());
1053
1054 if (tf()->range()->cnt() > TypeFunc::Parms) {
1055 const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms);
1056 Node* ret_phi = _gvn.transform( _exits.argument(0) );
1057 if (!_exits.control()->is_top() && _gvn.type(ret_phi)->empty()) {
1058 // If the type we set for the ret_phi in build_exits() is too optimistic and
1059 // the ret_phi is top now, there's an extremely small chance that it may be due to class
1060 // loading. It could also be due to an error, so mark this method as not compilable because
1061 // otherwise this could lead to an infinite compile loop.
1062 // In any case, this code path is rarely (and never in my testing) reached.
1063 #ifdef ASSERT
1064 tty->print_cr("# Can't determine return type.");
1065 tty->print_cr("# exit control");
1066 _exits.control()->dump(2);
1067 tty->print_cr("# ret phi type");
1068 _gvn.type(ret_phi)->dump();
1069 tty->print_cr("# ret phi");
1070 ret_phi->dump(2);
1071 #endif // ASSERT
1072 assert(false, "Can't determine return type.");
1073 C->record_method_not_compilable("Can't determine return type.");
1074 return;
1075 }
1076 if (ret_type->isa_int()) {
1077 BasicType ret_bt = method()->return_type()->basic_type();
1078 ret_phi = mask_int_value(ret_phi, ret_bt, &_gvn);
1079 }
1080 _exits.push_node(ret_type->basic_type(), ret_phi);
1081 }
1082
1083 // Note: Logic for creating and optimizing the ReturnNode is in Compile.
1084
1085 // Unlock along the exceptional paths.
1086 // This is done late so that we can common up equivalent exceptions
1087 // (e.g., null checks) arising from multiple points within this method.
1088 // See GraphKit::add_exception_state, which performs the commoning.
1089 bool do_synch = method()->is_synchronized() && GenerateSynchronizationCode;
1090
1091 // record exit from a method if compiled while Dtrace is turned on.
1092 if (do_synch || C->env()->dtrace_method_probes() || _replaced_nodes_for_exceptions) {
1093 // First move the exception list out of _exits:
1094 GraphKit kit(_exits.transfer_exceptions_into_jvms());
1095 SafePointNode* normal_map = kit.map(); // keep this guy safe
1096 // Now re-collect the exceptions into _exits:
1097 SafePointNode* ex_map;
1098 while ((ex_map = kit.pop_exception_state()) != nullptr) {
1099 Node* ex_oop = kit.use_exception_state(ex_map);
1100 // Force the exiting JVM state to have this method at InvocationEntryBci.
1101 // The exiting JVM state is otherwise a copy of the calling JVMS.
1102 JVMState* caller = kit.jvms();
1103 JVMState* ex_jvms = caller->clone_shallow(C);
1104 ex_jvms->bind_map(kit.clone_map());
1105 ex_jvms->set_bci( InvocationEntryBci);
1106 kit.set_jvms(ex_jvms);
1107 if (do_synch) {
1108 // Add on the synchronized-method box/object combo
1109 kit.map()->push_monitor(_synch_lock);
1110 // Unlock!
1111 kit.shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node());
1112 }
1113 if (C->env()->dtrace_method_probes()) {
1114 kit.make_dtrace_method_exit(method());
1115 }
1116 if (_replaced_nodes_for_exceptions) {
1117 kit.map()->apply_replaced_nodes(_new_idx);
1118 }
1119 // Done with exception-path processing.
1120 ex_map = kit.make_exception_state(ex_oop);
1121 assert(ex_jvms->same_calls_as(ex_map->jvms()), "sanity");
1122 // Pop the last vestige of this method:
1123 caller->clone_shallow(C)->bind_map(ex_map);
1124 _exits.push_exception_state(ex_map);
1125 }
1126 assert(_exits.map() == normal_map, "keep the same return state");
1127 }
1128
1129 {
1130 // Capture very early exceptions (receiver null checks) from caller JVMS
1131 GraphKit caller(_caller);
1132 SafePointNode* ex_map;
1133 while ((ex_map = caller.pop_exception_state()) != nullptr) {
1134 _exits.add_exception_state(ex_map);
1135 }
1136 }
1137 _exits.map()->apply_replaced_nodes(_new_idx);
1138 }
1139
1140 //-----------------------------create_entry_map-------------------------------
1141 // Initialize our parser map to contain the types at method entry.
1142 // For OSR, the map contains a single RawPtr parameter.
1143 // Initial monitor locking for sync. methods is performed by do_method_entry.
1144 SafePointNode* Parse::create_entry_map() {
1145 // Check for really stupid bail-out cases.
1146 uint len = TypeFunc::Parms + method()->max_locals() + method()->max_stack();
1147 if (len >= 32760) {
1148 // Bailout expected, this is a very rare edge case.
1149 C->record_method_not_compilable("too many local variables");
1150 return nullptr;
1151 }
1152
1153 // clear current replaced nodes that are of no use from here on (map was cloned in build_exits).
1154 _caller->map()->delete_replaced_nodes();
1155
1156 // If this is an inlined method, we may have to do a receiver null check.
1157 if (_caller->has_method() && is_normal_parse() && !method()->is_static()) {
1158 GraphKit kit(_caller);
1159 kit.null_check_receiver_before_call(method());
1160 _caller = kit.transfer_exceptions_into_jvms();
1161 if (kit.stopped()) {
1162 _exits.add_exception_states_from(_caller);
1163 _exits.set_jvms(_caller);
1164 return nullptr;
1165 }
1166 }
1167
1168 assert(method() != nullptr, "parser must have a method");
1169
1170 // Create an initial safepoint to hold JVM state during parsing
1171 JVMState* jvms = new (C) JVMState(method(), _caller->has_method() ? _caller : nullptr);
1172 set_map(new SafePointNode(len, jvms));
1173 jvms->set_map(map());
1174 record_for_igvn(map());
1175 assert(jvms->endoff() == len, "correct jvms sizing");
1176
1177 SafePointNode* inmap = _caller->map();
1178 assert(inmap != nullptr, "must have inmap");
1179 // In case of null check on receiver above
1180 map()->transfer_replaced_nodes_from(inmap, _new_idx);
1181
1182 uint i;
1183
1184 // Pass thru the predefined input parameters.
1185 for (i = 0; i < TypeFunc::Parms; i++) {
1186 map()->init_req(i, inmap->in(i));
1187 }
1188
1189 if (depth() == 1) {
1190 assert(map()->memory()->Opcode() == Op_Parm, "");
1191 // Insert the memory aliasing node
1192 set_all_memory(reset_memory());
1193 }
1194 assert(merged_memory(), "");
1195
1196 // Now add the locals which are initially bound to arguments:
1197 uint arg_size = tf()->domain()->cnt();
1198 ensure_stack(arg_size - TypeFunc::Parms); // OSR methods have funny args
1199 for (i = TypeFunc::Parms; i < arg_size; i++) {
1200 map()->init_req(i, inmap->argument(_caller, i - TypeFunc::Parms));
1201 }
1202
1203 // Clear out the rest of the map (locals and stack)
1204 for (i = arg_size; i < len; i++) {
1205 map()->init_req(i, top());
1206 }
1207
1208 SafePointNode* entry_map = stop();
1209 return entry_map;
1210 }
1211
1212 //-----------------------------do_method_entry--------------------------------
1213 // Emit any code needed in the pseudo-block before BCI zero.
1214 // The main thing to do is lock the receiver of a synchronized method.
1215 void Parse::do_method_entry() {
1216 set_parse_bci(InvocationEntryBci); // Pseudo-BCP
1217 set_sp(0); // Java Stack Pointer
1218
1219 NOT_PRODUCT( count_compiled_calls(true/*at_method_entry*/, false/*is_inline*/); )
1220
1221 if (C->env()->dtrace_method_probes()) {
1222 make_dtrace_method_entry(method());
1223 }
1224
1225 #ifdef ASSERT
1226 // Narrow receiver type when it is too broad for the method being parsed.
1227 if (!method()->is_static()) {
1228 ciInstanceKlass* callee_holder = method()->holder();
1229 const Type* holder_type = TypeInstPtr::make(TypePtr::BotPTR, callee_holder, Type::trust_interfaces);
1230
1231 Node* receiver_obj = local(0);
1232 const TypeInstPtr* receiver_type = _gvn.type(receiver_obj)->isa_instptr();
1233
1234 if (receiver_type != nullptr && !receiver_type->higher_equal(holder_type)) {
1235 // Receiver should always be a subtype of callee holder.
1236 // But, since C2 type system doesn't properly track interfaces,
1237 // the invariant can't be expressed in the type system for default methods.
1238 // Example: for unrelated C <: I and D <: I, (C `meet` D) = Object </: I.
1239 assert(callee_holder->is_interface(), "missing subtype check");
1240
1241 // Perform dynamic receiver subtype check against callee holder class w/ a halt on failure.
1242 Node* holder_klass = _gvn.makecon(TypeKlassPtr::make(callee_holder, Type::trust_interfaces));
1243 Node* not_subtype_ctrl = gen_subtype_check(receiver_obj, holder_klass);
1244 assert(!stopped(), "not a subtype");
1245
1246 Node* halt = _gvn.transform(new HaltNode(not_subtype_ctrl, frameptr(), "failed receiver subtype check"));
1247 C->root()->add_req(halt);
1248 }
1249 }
1250 #endif // ASSERT
1251
1252 // If the method is synchronized, we need to construct a lock node, attach
1253 // it to the Start node, and pin it there.
1254 if (method()->is_synchronized()) {
1255 // Insert a FastLockNode right after the Start which takes as arguments
1256 // the current thread pointer, the "this" pointer & the address of the
1257 // stack slot pair used for the lock. The "this" pointer is a projection
1258 // off the start node, but the locking spot has to be constructed by
1259 // creating a ConLNode of 0, and boxing it with a BoxLockNode. The BoxLockNode
1260 // becomes the second argument to the FastLockNode call. The
1261 // FastLockNode becomes the new control parent to pin it to the start.
1262
1263 // Setup Object Pointer
1264 Node *lock_obj = nullptr;
1265 if (method()->is_static()) {
1266 ciInstance* mirror = _method->holder()->java_mirror();
1267 const TypeInstPtr *t_lock = TypeInstPtr::make(mirror);
1268 lock_obj = makecon(t_lock);
1269 } else { // Else pass the "this" pointer,
1270 lock_obj = local(0); // which is Parm0 from StartNode
1271 }
1272 // Clear out dead values from the debug info.
1273 kill_dead_locals();
1274 // Build the FastLockNode
1275 _synch_lock = shared_lock(lock_obj);
1276 // Check for bailout in shared_lock
1277 if (failing()) { return; }
1278 }
1279
1280 // Feed profiling data for parameters to the type system so it can
1281 // propagate it as speculative types
1282 record_profiled_parameters_for_speculation();
1283 }
1284
1285 //------------------------------init_blocks------------------------------------
1286 // Initialize our parser map to contain the types/monitors at method entry.
1287 void Parse::init_blocks() {
1288 // Create the blocks.
1289 _block_count = flow()->block_count();
1290 _blocks = NEW_RESOURCE_ARRAY(Block, _block_count);
1291
1292 // Initialize the structs.
1293 for (int rpo = 0; rpo < block_count(); rpo++) {
1294 Block* block = rpo_at(rpo);
1295 new(block) Block(this, rpo);
1296 }
1297
1298 // Collect predecessor and successor information.
1299 for (int rpo = 0; rpo < block_count(); rpo++) {
1300 Block* block = rpo_at(rpo);
1301 block->init_graph(this);
1302 }
1303 }
1304
1305 //-------------------------------init_node-------------------------------------
1306 Parse::Block::Block(Parse* outer, int rpo) : _live_locals() {
1307 _flow = outer->flow()->rpo_at(rpo);
1308 _pred_count = 0;
1309 _preds_parsed = 0;
1310 _count = 0;
1311 _is_parsed = false;
1312 _is_handler = false;
1313 _has_merged_backedge = false;
1314 _start_map = nullptr;
1315 _has_predicates = false;
1316 _num_successors = 0;
1317 _all_successors = 0;
1318 _successors = nullptr;
1319 assert(pred_count() == 0 && preds_parsed() == 0, "sanity");
1320 assert(!(is_merged() || is_parsed() || is_handler() || has_merged_backedge()), "sanity");
1321 assert(_live_locals.size() == 0, "sanity");
1322
1323 // entry point has additional predecessor
1324 if (flow()->is_start()) _pred_count++;
1325 assert(flow()->is_start() == (this == outer->start_block()), "");
1326 }
1327
1328 //-------------------------------init_graph------------------------------------
1329 void Parse::Block::init_graph(Parse* outer) {
1330 // Create the successor list for this parser block.
1331 GrowableArray<ciTypeFlow::Block*>* tfs = flow()->successors();
1332 GrowableArray<ciTypeFlow::Block*>* tfe = flow()->exceptions();
1333 int ns = tfs->length();
1334 int ne = tfe->length();
1335 _num_successors = ns;
1336 _all_successors = ns+ne;
1337 _successors = (ns+ne == 0) ? nullptr : NEW_RESOURCE_ARRAY(Block*, ns+ne);
1338 int p = 0;
1339 for (int i = 0; i < ns+ne; i++) {
1340 ciTypeFlow::Block* tf2 = (i < ns) ? tfs->at(i) : tfe->at(i-ns);
1341 Block* block2 = outer->rpo_at(tf2->rpo());
1342 _successors[i] = block2;
1343
1344 // Accumulate pred info for the other block, too.
1345 // Note: We also need to set _pred_count for exception blocks since they could
1346 // also have normal predecessors (reached without athrow by an explicit jump).
1347 // This also means that next_path_num can be called along exception paths.
1348 block2->_pred_count++;
1349 if (i >= ns) {
1350 block2->_is_handler = true;
1351 }
1352
1353 #ifdef ASSERT
1354 // A block's successors must be distinguishable by BCI.
1355 // That is, no bytecode is allowed to branch to two different
1356 // clones of the same code location.
1357 for (int j = 0; j < i; j++) {
1358 Block* block1 = _successors[j];
1359 if (block1 == block2) continue; // duplicates are OK
1360 assert(block1->start() != block2->start(), "successors have unique bcis");
1361 }
1362 #endif
1363 }
1364 }
1365
1366 //---------------------------successor_for_bci---------------------------------
1367 Parse::Block* Parse::Block::successor_for_bci(int bci) {
1368 for (int i = 0; i < all_successors(); i++) {
1369 Block* block2 = successor_at(i);
1370 if (block2->start() == bci) return block2;
1371 }
1372 // We can actually reach here if ciTypeFlow traps out a block
1373 // due to an unloaded class, and concurrently with compilation the
1374 // class is then loaded, so that a later phase of the parser is
1375 // able to see more of the bytecode CFG. Or, the flow pass and
1376 // the parser can have a minor difference of opinion about executability
1377 // of bytecodes. For example, "obj.field = null" is executable even
1378 // if the field's type is an unloaded class; the flow pass used to
1379 // make a trap for such code.
1380 return nullptr;
1381 }
1382
1383
1384 //-----------------------------stack_type_at-----------------------------------
1385 const Type* Parse::Block::stack_type_at(int i) const {
1386 return get_type(flow()->stack_type_at(i));
1387 }
1388
1389
1390 //-----------------------------local_type_at-----------------------------------
1391 const Type* Parse::Block::local_type_at(int i) const {
1392 // Make dead locals fall to bottom.
1393 if (_live_locals.size() == 0) {
1394 MethodLivenessResult live_locals = flow()->outer()->method()->liveness_at_bci(start());
1395 // This bitmap can be zero length if we saw a breakpoint.
1396 // In such cases, pretend they are all live.
1397 ((Block*)this)->_live_locals = live_locals;
1398 }
1399 if (_live_locals.size() > 0 && !_live_locals.at(i))
1400 return Type::BOTTOM;
1401
1402 return get_type(flow()->local_type_at(i));
1403 }
1404
1405
1406 #ifndef PRODUCT
1407
1408 //----------------------------name_for_bc--------------------------------------
1409 // helper method for BytecodeParseHistogram
1410 static const char* name_for_bc(int i) {
1411 return Bytecodes::is_defined(i) ? Bytecodes::name(Bytecodes::cast(i)) : "xxxunusedxxx";
1412 }
1413
1414 //----------------------------BytecodeParseHistogram------------------------------------
1415 Parse::BytecodeParseHistogram::BytecodeParseHistogram(Parse *p, Compile *c) {
1416 _parser = p;
1417 _compiler = c;
1418 if( ! _initialized ) { _initialized = true; reset(); }
1419 }
1420
1421 //----------------------------current_count------------------------------------
1422 int Parse::BytecodeParseHistogram::current_count(BPHType bph_type) {
1423 switch( bph_type ) {
1424 case BPH_transforms: { return _parser->gvn().made_progress(); }
1425 case BPH_values: { return _parser->gvn().made_new_values(); }
1426 default: { ShouldNotReachHere(); return 0; }
1427 }
1428 }
1429
1430 //----------------------------initialized--------------------------------------
1431 bool Parse::BytecodeParseHistogram::initialized() { return _initialized; }
1432
1433 //----------------------------reset--------------------------------------------
1434 void Parse::BytecodeParseHistogram::reset() {
1435 int i = Bytecodes::number_of_codes;
1436 while (i-- > 0) { _bytecodes_parsed[i] = 0; _nodes_constructed[i] = 0; _nodes_transformed[i] = 0; _new_values[i] = 0; }
1437 }
1438
1439 //----------------------------set_initial_state--------------------------------
1440 // Record info when starting to parse one bytecode
1441 void Parse::BytecodeParseHistogram::set_initial_state( Bytecodes::Code bc ) {
1442 if( PrintParseStatistics && !_parser->is_osr_parse() ) {
1443 _initial_bytecode = bc;
1444 _initial_node_count = _compiler->unique();
1445 _initial_transforms = current_count(BPH_transforms);
1446 _initial_values = current_count(BPH_values);
1447 }
1448 }
1449
1450 //----------------------------record_change--------------------------------
1451 // Record results of parsing one bytecode
1452 void Parse::BytecodeParseHistogram::record_change() {
1453 if( PrintParseStatistics && !_parser->is_osr_parse() ) {
1454 ++_bytecodes_parsed[_initial_bytecode];
1455 _nodes_constructed [_initial_bytecode] += (_compiler->unique() - _initial_node_count);
1456 _nodes_transformed [_initial_bytecode] += (current_count(BPH_transforms) - _initial_transforms);
1457 _new_values [_initial_bytecode] += (current_count(BPH_values) - _initial_values);
1458 }
1459 }
1460
1461
1462 //----------------------------print--------------------------------------------
1463 void Parse::BytecodeParseHistogram::print(float cutoff) {
1464 ResourceMark rm;
1465 // print profile
1466 int total = 0;
1467 int i = 0;
1468 for( i = 0; i < Bytecodes::number_of_codes; ++i ) { total += _bytecodes_parsed[i]; }
1469 int abs_sum = 0;
1470 tty->cr(); //0123456789012345678901234567890123456789012345678901234567890123456789
1471 tty->print_cr("Histogram of %d parsed bytecodes:", total);
1472 if( total == 0 ) { return; }
1473 tty->cr();
1474 tty->print_cr("absolute: count of compiled bytecodes of this type");
1475 tty->print_cr("relative: percentage contribution to compiled nodes");
1476 tty->print_cr("nodes : Average number of nodes constructed per bytecode");
1477 tty->print_cr("rnodes : Significance towards total nodes constructed, (nodes*relative)");
1478 tty->print_cr("transforms: Average amount of transform progress per bytecode compiled");
1479 tty->print_cr("values : Average number of node values improved per bytecode");
1480 tty->print_cr("name : Bytecode name");
1481 tty->cr();
1482 tty->print_cr(" absolute relative nodes rnodes transforms values name");
1483 tty->print_cr("----------------------------------------------------------------------");
1484 while (--i > 0) {
1485 int abs = _bytecodes_parsed[i];
1486 float rel = abs * 100.0F / total;
1487 float nodes = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_constructed[i])/_bytecodes_parsed[i];
1488 float rnodes = _bytecodes_parsed[i] == 0 ? 0 : rel * nodes;
1489 float xforms = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_transformed[i])/_bytecodes_parsed[i];
1490 float values = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _new_values [i])/_bytecodes_parsed[i];
1491 if (cutoff <= rel) {
1492 tty->print_cr("%10d %7.2f%% %6.1f %6.2f %6.1f %6.1f %s", abs, rel, nodes, rnodes, xforms, values, name_for_bc(i));
1493 abs_sum += abs;
1494 }
1495 }
1496 tty->print_cr("----------------------------------------------------------------------");
1497 float rel_sum = abs_sum * 100.0F / total;
1498 tty->print_cr("%10d %7.2f%% (cutoff = %.2f%%)", abs_sum, rel_sum, cutoff);
1499 tty->print_cr("----------------------------------------------------------------------");
1500 tty->cr();
1501 }
1502 #endif
1503
1504 //----------------------------load_state_from----------------------------------
1505 // Load block/map/sp. But not do not touch iter/bci.
1506 void Parse::load_state_from(Block* block) {
1507 set_block(block);
1508 // load the block's JVM state:
1509 set_map(block->start_map());
1510 set_sp( block->start_sp());
1511 }
1512
1513
1514 //-----------------------------record_state------------------------------------
1515 void Parse::Block::record_state(Parse* p) {
1516 assert(!is_merged(), "can only record state once, on 1st inflow");
1517 assert(start_sp() == p->sp(), "stack pointer must agree with ciTypeFlow");
1518 set_start_map(p->stop());
1519 }
1520
1521
1522 //------------------------------do_one_block-----------------------------------
1523 void Parse::do_one_block() {
1524 if (TraceOptoParse) {
1525 Block *b = block();
1526 int ns = b->num_successors();
1527 int nt = b->all_successors();
1528
1529 tty->print("Parsing block #%d at bci [%d,%d), successors:",
1530 block()->rpo(), block()->start(), block()->limit());
1531 for (int i = 0; i < nt; i++) {
1532 tty->print((( i < ns) ? " %d" : " %d(exception block)"), b->successor_at(i)->rpo());
1533 }
1534 if (b->is_loop_head()) {
1535 tty->print(" loop head");
1536 }
1537 if (b->is_irreducible_loop_entry()) {
1538 tty->print(" irreducible");
1539 }
1540 tty->cr();
1541 }
1542
1543 assert(block()->is_merged(), "must be merged before being parsed");
1544 block()->mark_parsed();
1545
1546 // Set iterator to start of block.
1547 iter().reset_to_bci(block()->start());
1548
1549 if (ProfileExceptionHandlers && block()->is_handler()) {
1550 ciMethodData* methodData = method()->method_data();
1551 if (methodData->is_mature()) {
1552 ciBitData data = methodData->exception_handler_bci_to_data(block()->start());
1553 if (!data.exception_handler_entered() || StressPrunedExceptionHandlers) {
1554 // dead catch block
1555 // Emit an uncommon trap instead of processing the block.
1556 set_parse_bci(block()->start());
1557 uncommon_trap(Deoptimization::Reason_unreached,
1558 Deoptimization::Action_reinterpret,
1559 nullptr, "dead catch block");
1560 return;
1561 }
1562 }
1563 }
1564
1565 CompileLog* log = C->log();
1566
1567 // Parse bytecodes
1568 while (!stopped() && !failing()) {
1569 iter().next();
1570
1571 // Learn the current bci from the iterator:
1572 set_parse_bci(iter().cur_bci());
1573
1574 if (bci() == block()->limit()) {
1575 // Do not walk into the next block until directed by do_all_blocks.
1576 merge(bci());
1577 break;
1578 }
1579 assert(bci() < block()->limit(), "bci still in block");
1580
1581 if (log != nullptr) {
1582 // Output an optional context marker, to help place actions
1583 // that occur during parsing of this BC. If there is no log
1584 // output until the next context string, this context string
1585 // will be silently ignored.
1586 log->set_context("bc code='%d' bci='%d'", (int)bc(), bci());
1587 }
1588
1589 if (block()->has_trap_at(bci())) {
1590 // We must respect the flow pass's traps, because it will refuse
1591 // to produce successors for trapping blocks.
1592 int trap_index = block()->flow()->trap_index();
1593 assert(trap_index != 0, "trap index must be valid");
1594 uncommon_trap(trap_index);
1595 break;
1596 }
1597
1598 NOT_PRODUCT( parse_histogram()->set_initial_state(bc()); );
1599
1600 #ifdef ASSERT
1601 int pre_bc_sp = sp();
1602 int inputs, depth;
1603 bool have_se = !stopped() && compute_stack_effects(inputs, depth);
1604 assert(!have_se || pre_bc_sp >= inputs, "have enough stack to execute this BC: pre_bc_sp=%d, inputs=%d", pre_bc_sp, inputs);
1605 #endif //ASSERT
1606
1607 do_one_bytecode();
1608 if (failing()) return;
1609
1610 assert(!have_se || stopped() || failing() || (sp() - pre_bc_sp) == depth,
1611 "incorrect depth prediction: sp=%d, pre_bc_sp=%d, depth=%d", sp(), pre_bc_sp, depth);
1612
1613 do_exceptions();
1614
1615 NOT_PRODUCT( parse_histogram()->record_change(); );
1616
1617 if (log != nullptr)
1618 log->clear_context(); // skip marker if nothing was printed
1619
1620 // Fall into next bytecode. Each bytecode normally has 1 sequential
1621 // successor which is typically made ready by visiting this bytecode.
1622 // If the successor has several predecessors, then it is a merge
1623 // point, starts a new basic block, and is handled like other basic blocks.
1624 }
1625 }
1626
1627
1628 //------------------------------merge------------------------------------------
1629 void Parse::set_parse_bci(int bci) {
1630 set_bci(bci);
1631 Node_Notes* nn = C->default_node_notes();
1632 if (nn == nullptr) return;
1633
1634 // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls.
1635 if (!DebugInlinedCalls && depth() > 1) {
1636 return;
1637 }
1638
1639 // Update the JVMS annotation, if present.
1640 JVMState* jvms = nn->jvms();
1641 if (jvms != nullptr && jvms->bci() != bci) {
1642 // Update the JVMS.
1643 jvms = jvms->clone_shallow(C);
1644 jvms->set_bci(bci);
1645 nn->set_jvms(jvms);
1646 }
1647 }
1648
1649 //------------------------------merge------------------------------------------
1650 // Merge the current mapping into the basic block starting at bci
1651 void Parse::merge(int target_bci) {
1652 Block* target = successor_for_bci(target_bci);
1653 if (target == nullptr) { handle_missing_successor(target_bci); return; }
1654 assert(!target->is_ready(), "our arrival must be expected");
1655 int pnum = target->next_path_num();
1656 merge_common(target, pnum);
1657 }
1658
1659 //-------------------------merge_new_path--------------------------------------
1660 // Merge the current mapping into the basic block, using a new path
1661 void Parse::merge_new_path(int target_bci) {
1662 Block* target = successor_for_bci(target_bci);
1663 if (target == nullptr) { handle_missing_successor(target_bci); return; }
1664 assert(!target->is_ready(), "new path into frozen graph");
1665 int pnum = target->add_new_path();
1666 merge_common(target, pnum);
1667 }
1668
1669 //-------------------------merge_exception-------------------------------------
1670 // Merge the current mapping into the basic block starting at bci
1671 // The ex_oop must be pushed on the stack, unlike throw_to_exit.
1672 void Parse::merge_exception(int target_bci) {
1673 #ifdef ASSERT
1674 if (target_bci < bci()) {
1675 C->set_exception_backedge();
1676 }
1677 #endif
1678 assert(sp() == 1, "must have only the throw exception on the stack");
1679 Block* target = successor_for_bci(target_bci);
1680 if (target == nullptr) { handle_missing_successor(target_bci); return; }
1681 assert(target->is_handler(), "exceptions are handled by special blocks");
1682 int pnum = target->add_new_path();
1683 merge_common(target, pnum);
1684 }
1685
1686 //--------------------handle_missing_successor---------------------------------
1687 void Parse::handle_missing_successor(int target_bci) {
1688 #ifndef PRODUCT
1689 Block* b = block();
1690 int trap_bci = b->flow()->has_trap()? b->flow()->trap_bci(): -1;
1691 tty->print_cr("### Missing successor at bci:%d for block #%d (trap_bci:%d)", target_bci, b->rpo(), trap_bci);
1692 #endif
1693 ShouldNotReachHere();
1694 }
1695
1696 //--------------------------merge_common---------------------------------------
1697 void Parse::merge_common(Parse::Block* target, int pnum) {
1698 if (TraceOptoParse) {
1699 tty->print("Merging state at block #%d bci:%d", target->rpo(), target->start());
1700 }
1701
1702 // Zap extra stack slots to top
1703 assert(sp() == target->start_sp(), "");
1704 clean_stack(sp());
1705
1706 if (!target->is_merged()) { // No prior mapping at this bci
1707 if (TraceOptoParse) { tty->print(" with empty state"); }
1708
1709 // If this path is dead, do not bother capturing it as a merge.
1710 // It is "as if" we had 1 fewer predecessors from the beginning.
1711 if (stopped()) {
1712 if (TraceOptoParse) tty->print_cr(", but path is dead and doesn't count");
1713 return;
1714 }
1715
1716 // Make a region if we know there are multiple or unpredictable inputs.
1717 // (Also, if this is a plain fall-through, we might see another region,
1718 // which must not be allowed into this block's map.)
1719 if (pnum > PhiNode::Input // Known multiple inputs.
1720 || target->is_handler() // These have unpredictable inputs.
1721 || target->is_loop_head() // Known multiple inputs
1722 || control()->is_Region()) { // We must hide this guy.
1723
1724 int current_bci = bci();
1725 set_parse_bci(target->start()); // Set target bci
1726 if (target->is_SEL_head()) {
1727 DEBUG_ONLY( target->mark_merged_backedge(block()); )
1728 if (target->start() == 0) {
1729 // Add Parse Predicates for the special case when
1730 // there are backbranches to the method entry.
1731 add_parse_predicates();
1732 }
1733 }
1734 // Add a Region to start the new basic block. Phis will be added
1735 // later lazily.
1736 int edges = target->pred_count();
1737 if (edges < pnum) edges = pnum; // might be a new path!
1738 RegionNode *r = new RegionNode(edges+1);
1739 gvn().set_type(r, Type::CONTROL);
1740 record_for_igvn(r);
1741 // zap all inputs to null for debugging (done in Node(uint) constructor)
1742 // for (int j = 1; j < edges+1; j++) { r->init_req(j, nullptr); }
1743 r->init_req(pnum, control());
1744 set_control(r);
1745 target->copy_irreducible_status_to(r, jvms());
1746 set_parse_bci(current_bci); // Restore bci
1747 }
1748
1749 // Convert the existing Parser mapping into a mapping at this bci.
1750 store_state_to(target);
1751 assert(target->is_merged(), "do not come here twice");
1752
1753 } else { // Prior mapping at this bci
1754 if (TraceOptoParse) { tty->print(" with previous state"); }
1755 #ifdef ASSERT
1756 if (target->is_SEL_head()) {
1757 target->mark_merged_backedge(block());
1758 }
1759 #endif
1760 // We must not manufacture more phis if the target is already parsed.
1761 bool nophi = target->is_parsed();
1762
1763 SafePointNode* newin = map();// Hang on to incoming mapping
1764 Block* save_block = block(); // Hang on to incoming block;
1765 load_state_from(target); // Get prior mapping
1766
1767 assert(newin->jvms()->locoff() == jvms()->locoff(), "JVMS layouts agree");
1768 assert(newin->jvms()->stkoff() == jvms()->stkoff(), "JVMS layouts agree");
1769 assert(newin->jvms()->monoff() == jvms()->monoff(), "JVMS layouts agree");
1770 assert(newin->jvms()->endoff() == jvms()->endoff(), "JVMS layouts agree");
1771
1772 // Iterate over my current mapping and the old mapping.
1773 // Where different, insert Phi functions.
1774 // Use any existing Phi functions.
1775 assert(control()->is_Region(), "must be merging to a region");
1776 RegionNode* r = control()->as_Region();
1777
1778 // Compute where to merge into
1779 // Merge incoming control path
1780 r->init_req(pnum, newin->control());
1781
1782 if (pnum == 1) { // Last merge for this Region?
1783 if (!block()->flow()->is_irreducible_loop_secondary_entry()) {
1784 Node* result = _gvn.transform(r);
1785 if (r != result && TraceOptoParse) {
1786 tty->print_cr("Block #%d replace %d with %d", block()->rpo(), r->_idx, result->_idx);
1787 }
1788 }
1789 record_for_igvn(r);
1790 }
1791
1792 // Update all the non-control inputs to map:
1793 assert(TypeFunc::Parms == newin->jvms()->locoff(), "parser map should contain only youngest jvms");
1794 bool check_elide_phi = target->is_SEL_backedge(save_block);
1795 for (uint j = 1; j < newin->req(); j++) {
1796 Node* m = map()->in(j); // Current state of target.
1797 Node* n = newin->in(j); // Incoming change to target state.
1798 PhiNode* phi;
1799 if (m->is_Phi() && m->as_Phi()->region() == r)
1800 phi = m->as_Phi();
1801 else
1802 phi = nullptr;
1803 if (m != n) { // Different; must merge
1804 switch (j) {
1805 // Frame pointer and Return Address never changes
1806 case TypeFunc::FramePtr:// Drop m, use the original value
1807 case TypeFunc::ReturnAdr:
1808 break;
1809 case TypeFunc::Memory: // Merge inputs to the MergeMem node
1810 assert(phi == nullptr, "the merge contains phis, not vice versa");
1811 merge_memory_edges(n->as_MergeMem(), pnum, nophi);
1812 continue;
1813 default: // All normal stuff
1814 if (phi == nullptr) {
1815 const JVMState* jvms = map()->jvms();
1816 if (EliminateNestedLocks &&
1817 jvms->is_mon(j) && jvms->is_monitor_box(j)) {
1818 // BoxLock nodes are not commoning when EliminateNestedLocks is on.
1819 // Use old BoxLock node as merged box.
1820 assert(newin->jvms()->is_monitor_box(j), "sanity");
1821 // This assert also tests that nodes are BoxLock.
1822 assert(BoxLockNode::same_slot(n, m), "sanity");
1823 BoxLockNode* old_box = m->as_BoxLock();
1824 if (n->as_BoxLock()->is_unbalanced() && !old_box->is_unbalanced()) {
1825 // Preserve Unbalanced status.
1826 //
1827 // `old_box` can have only Regular or Coarsened status
1828 // because this code is executed only during Parse phase and
1829 // Incremental Inlining before EA and Macro nodes elimination.
1830 //
1831 // Incremental Inlining is executed after IGVN optimizations
1832 // during which BoxLock can be marked as Coarsened.
1833 old_box->set_coarsened(); // Verifies state
1834 old_box->set_unbalanced();
1835 }
1836 C->gvn_replace_by(n, m);
1837 } else if (!check_elide_phi || !target->can_elide_SEL_phi(j)) {
1838 phi = ensure_phi(j, nophi);
1839 }
1840 }
1841 break;
1842 }
1843 }
1844 // At this point, n might be top if:
1845 // - there is no phi (because TypeFlow detected a conflict), or
1846 // - the corresponding control edges is top (a dead incoming path)
1847 // It is a bug if we create a phi which sees a garbage value on a live path.
1848
1849 if (phi != nullptr) {
1850 assert(n != top() || r->in(pnum) == top(), "live value must not be garbage");
1851 assert(phi->region() == r, "");
1852 phi->set_req(pnum, n); // Then add 'n' to the merge
1853 if (pnum == PhiNode::Input) {
1854 // Last merge for this Phi.
1855 // So far, Phis have had a reasonable type from ciTypeFlow.
1856 // Now _gvn will join that with the meet of current inputs.
1857 // BOTTOM is never permissible here, 'cause pessimistically
1858 // Phis of pointers cannot lose the basic pointer type.
1859 debug_only(const Type* bt1 = phi->bottom_type());
1860 assert(bt1 != Type::BOTTOM, "should not be building conflict phis");
1861 map()->set_req(j, _gvn.transform(phi));
1862 debug_only(const Type* bt2 = phi->bottom_type());
1863 assert(bt2->higher_equal_speculative(bt1), "must be consistent with type-flow");
1864 record_for_igvn(phi);
1865 }
1866 }
1867 } // End of for all values to be merged
1868
1869 if (pnum == PhiNode::Input &&
1870 !r->in(0)) { // The occasional useless Region
1871 assert(control() == r, "");
1872 set_control(r->nonnull_req());
1873 }
1874
1875 map()->merge_replaced_nodes_with(newin);
1876
1877 // newin has been subsumed into the lazy merge, and is now dead.
1878 set_block(save_block);
1879
1880 stop(); // done with this guy, for now
1881 }
1882
1883 if (TraceOptoParse) {
1884 tty->print_cr(" on path %d", pnum);
1885 }
1886
1887 // Done with this parser state.
1888 assert(stopped(), "");
1889 }
1890
1891
1892 //--------------------------merge_memory_edges---------------------------------
1893 void Parse::merge_memory_edges(MergeMemNode* n, int pnum, bool nophi) {
1894 // (nophi means we must not create phis, because we already parsed here)
1895 assert(n != nullptr, "");
1896 // Merge the inputs to the MergeMems
1897 MergeMemNode* m = merged_memory();
1898
1899 assert(control()->is_Region(), "must be merging to a region");
1900 RegionNode* r = control()->as_Region();
1901
1902 PhiNode* base = nullptr;
1903 MergeMemNode* remerge = nullptr;
1904 for (MergeMemStream mms(m, n); mms.next_non_empty2(); ) {
1905 Node *p = mms.force_memory();
1906 Node *q = mms.memory2();
1907 if (mms.is_empty() && nophi) {
1908 // Trouble: No new splits allowed after a loop body is parsed.
1909 // Instead, wire the new split into a MergeMem on the backedge.
1910 // The optimizer will sort it out, slicing the phi.
1911 if (remerge == nullptr) {
1912 guarantee(base != nullptr, "");
1913 assert(base->in(0) != nullptr, "should not be xformed away");
1914 remerge = MergeMemNode::make(base->in(pnum));
1915 gvn().set_type(remerge, Type::MEMORY);
1916 base->set_req(pnum, remerge);
1917 }
1918 remerge->set_memory_at(mms.alias_idx(), q);
1919 continue;
1920 }
1921 assert(!q->is_MergeMem(), "");
1922 PhiNode* phi;
1923 if (p != q) {
1924 phi = ensure_memory_phi(mms.alias_idx(), nophi);
1925 } else {
1926 if (p->is_Phi() && p->as_Phi()->region() == r)
1927 phi = p->as_Phi();
1928 else
1929 phi = nullptr;
1930 }
1931 // Insert q into local phi
1932 if (phi != nullptr) {
1933 assert(phi->region() == r, "");
1934 p = phi;
1935 phi->set_req(pnum, q);
1936 if (mms.at_base_memory()) {
1937 base = phi; // delay transforming it
1938 } else if (pnum == 1) {
1939 record_for_igvn(phi);
1940 p = _gvn.transform(phi);
1941 }
1942 mms.set_memory(p);// store back through the iterator
1943 }
1944 }
1945 // Transform base last, in case we must fiddle with remerging.
1946 if (base != nullptr && pnum == 1) {
1947 record_for_igvn(base);
1948 m->set_base_memory(_gvn.transform(base));
1949 }
1950 }
1951
1952
1953 //------------------------ensure_phis_everywhere-------------------------------
1954 void Parse::ensure_phis_everywhere() {
1955 ensure_phi(TypeFunc::I_O);
1956
1957 // Ensure a phi on all currently known memories.
1958 for (MergeMemStream mms(merged_memory()); mms.next_non_empty(); ) {
1959 ensure_memory_phi(mms.alias_idx());
1960 debug_only(mms.set_memory()); // keep the iterator happy
1961 }
1962
1963 // Note: This is our only chance to create phis for memory slices.
1964 // If we miss a slice that crops up later, it will have to be
1965 // merged into the base-memory phi that we are building here.
1966 // Later, the optimizer will comb out the knot, and build separate
1967 // phi-loops for each memory slice that matters.
1968
1969 // Monitors must nest nicely and not get confused amongst themselves.
1970 // Phi-ify everything up to the monitors, though.
1971 uint monoff = map()->jvms()->monoff();
1972 uint nof_monitors = map()->jvms()->nof_monitors();
1973
1974 assert(TypeFunc::Parms == map()->jvms()->locoff(), "parser map should contain only youngest jvms");
1975 bool check_elide_phi = block()->is_SEL_head();
1976 for (uint i = TypeFunc::Parms; i < monoff; i++) {
1977 if (!check_elide_phi || !block()->can_elide_SEL_phi(i)) {
1978 ensure_phi(i);
1979 }
1980 }
1981
1982 // Even monitors need Phis, though they are well-structured.
1983 // This is true for OSR methods, and also for the rare cases where
1984 // a monitor object is the subject of a replace_in_map operation.
1985 // See bugs 4426707 and 5043395.
1986 for (uint m = 0; m < nof_monitors; m++) {
1987 ensure_phi(map()->jvms()->monitor_obj_offset(m));
1988 }
1989 }
1990
1991
1992 //-----------------------------add_new_path------------------------------------
1993 // Add a previously unaccounted predecessor to this block.
1994 int Parse::Block::add_new_path() {
1995 // If there is no map, return the lowest unused path number.
1996 if (!is_merged()) return pred_count()+1; // there will be a map shortly
1997
1998 SafePointNode* map = start_map();
1999 if (!map->control()->is_Region())
2000 return pred_count()+1; // there may be a region some day
2001 RegionNode* r = map->control()->as_Region();
2002
2003 // Add new path to the region.
2004 uint pnum = r->req();
2005 r->add_req(nullptr);
2006
2007 for (uint i = 1; i < map->req(); i++) {
2008 Node* n = map->in(i);
2009 if (i == TypeFunc::Memory) {
2010 // Ensure a phi on all currently known memories.
2011 for (MergeMemStream mms(n->as_MergeMem()); mms.next_non_empty(); ) {
2012 Node* phi = mms.memory();
2013 if (phi->is_Phi() && phi->as_Phi()->region() == r) {
2014 assert(phi->req() == pnum, "must be same size as region");
2015 phi->add_req(nullptr);
2016 }
2017 }
2018 } else {
2019 if (n->is_Phi() && n->as_Phi()->region() == r) {
2020 assert(n->req() == pnum, "must be same size as region");
2021 n->add_req(nullptr);
2022 }
2023 }
2024 }
2025
2026 return pnum;
2027 }
2028
2029 //------------------------------ensure_phi-------------------------------------
2030 // Turn the idx'th entry of the current map into a Phi
2031 PhiNode *Parse::ensure_phi(int idx, bool nocreate) {
2032 SafePointNode* map = this->map();
2033 Node* region = map->control();
2034 assert(region->is_Region(), "");
2035
2036 Node* o = map->in(idx);
2037 assert(o != nullptr, "");
2038
2039 if (o == top()) return nullptr; // TOP always merges into TOP
2040
2041 if (o->is_Phi() && o->as_Phi()->region() == region) {
2042 return o->as_Phi();
2043 }
2044
2045 // Now use a Phi here for merging
2046 assert(!nocreate, "Cannot build a phi for a block already parsed.");
2047 const JVMState* jvms = map->jvms();
2048 const Type* t = nullptr;
2049 if (jvms->is_loc(idx)) {
2050 t = block()->local_type_at(idx - jvms->locoff());
2051 } else if (jvms->is_stk(idx)) {
2052 t = block()->stack_type_at(idx - jvms->stkoff());
2053 } else if (jvms->is_mon(idx)) {
2054 assert(!jvms->is_monitor_box(idx), "no phis for boxes");
2055 t = TypeInstPtr::BOTTOM; // this is sufficient for a lock object
2056 } else if ((uint)idx < TypeFunc::Parms) {
2057 t = o->bottom_type(); // Type::RETURN_ADDRESS or such-like.
2058 } else {
2059 assert(false, "no type information for this phi");
2060 }
2061
2062 // If the type falls to bottom, then this must be a local that
2063 // is mixing ints and oops or some such. Forcing it to top
2064 // makes it go dead.
2065 if (t == Type::BOTTOM) {
2066 map->set_req(idx, top());
2067 return nullptr;
2068 }
2069
2070 // Do not create phis for top either.
2071 // A top on a non-null control flow must be an unused even after the.phi.
2072 if (t == Type::TOP || t == Type::HALF) {
2073 map->set_req(idx, top());
2074 return nullptr;
2075 }
2076
2077 PhiNode* phi = PhiNode::make(region, o, t);
2078 gvn().set_type(phi, t);
2079 if (C->do_escape_analysis()) record_for_igvn(phi);
2080 map->set_req(idx, phi);
2081 return phi;
2082 }
2083
2084 //--------------------------ensure_memory_phi----------------------------------
2085 // Turn the idx'th slice of the current memory into a Phi
2086 PhiNode *Parse::ensure_memory_phi(int idx, bool nocreate) {
2087 MergeMemNode* mem = merged_memory();
2088 Node* region = control();
2089 assert(region->is_Region(), "");
2090
2091 Node *o = (idx == Compile::AliasIdxBot)? mem->base_memory(): mem->memory_at(idx);
2092 assert(o != nullptr && o != top(), "");
2093
2094 PhiNode* phi;
2095 if (o->is_Phi() && o->as_Phi()->region() == region) {
2096 phi = o->as_Phi();
2097 if (phi == mem->base_memory() && idx >= Compile::AliasIdxRaw) {
2098 // clone the shared base memory phi to make a new memory split
2099 assert(!nocreate, "Cannot build a phi for a block already parsed.");
2100 const Type* t = phi->bottom_type();
2101 const TypePtr* adr_type = C->get_adr_type(idx);
2102 phi = phi->slice_memory(adr_type);
2103 gvn().set_type(phi, t);
2104 }
2105 return phi;
2106 }
2107
2108 // Now use a Phi here for merging
2109 assert(!nocreate, "Cannot build a phi for a block already parsed.");
2110 const Type* t = o->bottom_type();
2111 const TypePtr* adr_type = C->get_adr_type(idx);
2112 phi = PhiNode::make(region, o, t, adr_type);
2113 gvn().set_type(phi, t);
2114 if (idx == Compile::AliasIdxBot)
2115 mem->set_base_memory(phi);
2116 else
2117 mem->set_memory_at(idx, phi);
2118 return phi;
2119 }
2120
2121 //------------------------------call_register_finalizer-----------------------
2122 // Check the klass of the receiver and call register_finalizer if the
2123 // class need finalization.
2124 void Parse::call_register_finalizer() {
2125 Node* receiver = local(0);
2126 assert(receiver != nullptr && receiver->bottom_type()->isa_instptr() != nullptr,
2127 "must have non-null instance type");
2128
2129 const TypeInstPtr *tinst = receiver->bottom_type()->isa_instptr();
2130 if (tinst != nullptr && tinst->is_loaded() && !tinst->klass_is_exact()) {
2131 // The type isn't known exactly so see if CHA tells us anything.
2132 ciInstanceKlass* ik = tinst->instance_klass();
2133 if (!Dependencies::has_finalizable_subclass(ik)) {
2134 // No finalizable subclasses so skip the dynamic check.
2135 C->dependencies()->assert_has_no_finalizable_subclasses(ik);
2136 return;
2137 }
2138 }
2139
2140 // Insert a dynamic test for whether the instance needs
2141 // finalization. In general this will fold up since the concrete
2142 // class is often visible so the access flags are constant.
2143 Node* klass_addr = basic_plus_adr( receiver, receiver, oopDesc::klass_offset_in_bytes() );
2144 Node* klass = _gvn.transform(LoadKlassNode::make(_gvn, nullptr, immutable_memory(), klass_addr, TypeInstPtr::KLASS));
2145
2146 Node* access_flags_addr = basic_plus_adr(klass, klass, in_bytes(Klass::access_flags_offset()));
2147 Node* access_flags = make_load(nullptr, access_flags_addr, TypeInt::INT, T_INT, MemNode::unordered);
2148
2149 Node* mask = _gvn.transform(new AndINode(access_flags, intcon(JVM_ACC_HAS_FINALIZER)));
2150 Node* check = _gvn.transform(new CmpINode(mask, intcon(0)));
2151 Node* test = _gvn.transform(new BoolNode(check, BoolTest::ne));
2152
2153 IfNode* iff = create_and_map_if(control(), test, PROB_MAX, COUNT_UNKNOWN);
2154
2155 RegionNode* result_rgn = new RegionNode(3);
2156 record_for_igvn(result_rgn);
2157
2158 Node *skip_register = _gvn.transform(new IfFalseNode(iff));
2159 result_rgn->init_req(1, skip_register);
2160
2161 Node *needs_register = _gvn.transform(new IfTrueNode(iff));
2162 set_control(needs_register);
2163 if (stopped()) {
2164 // There is no slow path.
2165 result_rgn->init_req(2, top());
2166 } else {
2167 Node *call = make_runtime_call(RC_NO_LEAF,
2168 OptoRuntime::register_finalizer_Type(),
2169 OptoRuntime::register_finalizer_Java(),
2170 nullptr, TypePtr::BOTTOM,
2171 receiver);
2172 make_slow_call_ex(call, env()->Throwable_klass(), true);
2173
2174 Node* fast_io = call->in(TypeFunc::I_O);
2175 Node* fast_mem = call->in(TypeFunc::Memory);
2176 // These two phis are pre-filled with copies of of the fast IO and Memory
2177 Node* io_phi = PhiNode::make(result_rgn, fast_io, Type::ABIO);
2178 Node* mem_phi = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM);
2179
2180 result_rgn->init_req(2, control());
2181 io_phi ->init_req(2, i_o());
2182 mem_phi ->init_req(2, reset_memory());
2183
2184 set_all_memory( _gvn.transform(mem_phi) );
2185 set_i_o( _gvn.transform(io_phi) );
2186 }
2187
2188 set_control( _gvn.transform(result_rgn) );
2189 }
2190
2191 // Add check to deoptimize once holder klass is fully initialized.
2192 void Parse::clinit_deopt() {
2193 assert(C->has_method(), "only for normal compilations");
2194 assert(depth() == 1, "only for main compiled method");
2195 assert(is_normal_parse(), "no barrier needed on osr entry");
2196 assert(!method()->holder()->is_not_initialized(), "initialization should have been started");
2197
2198 set_parse_bci(0);
2199
2200 Node* holder = makecon(TypeKlassPtr::make(method()->holder(), Type::trust_interfaces));
2201 guard_klass_being_initialized(holder);
2202 }
2203
2204 // Add check to deoptimize if RTM state is not ProfileRTM
2205 void Parse::rtm_deopt() {
2206 #if INCLUDE_RTM_OPT
2207 if (C->profile_rtm()) {
2208 assert(C->has_method(), "only for normal compilations");
2209 assert(!C->method()->method_data()->is_empty(), "MDO is needed to record RTM state");
2210 assert(depth() == 1, "generate check only for main compiled method");
2211
2212 // Set starting bci for uncommon trap.
2213 set_parse_bci(is_osr_parse() ? osr_bci() : 0);
2214
2215 // Load the rtm_state from the MethodData.
2216 const TypePtr* adr_type = TypeMetadataPtr::make(C->method()->method_data());
2217 Node* mdo = makecon(adr_type);
2218 int offset = in_bytes(MethodData::rtm_state_offset());
2219 Node* adr_node = basic_plus_adr(mdo, mdo, offset);
2220 Node* rtm_state = make_load(control(), adr_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
2221
2222 // Separate Load from Cmp by Opaque.
2223 // In expand_macro_nodes() it will be replaced either
2224 // with this load when there are locks in the code
2225 // or with ProfileRTM (cmp->in(2)) otherwise so that
2226 // the check will fold.
2227 Node* profile_state = makecon(TypeInt::make(ProfileRTM));
2228 Node* opq = _gvn.transform( new Opaque3Node(C, rtm_state, Opaque3Node::RTM_OPT) );
2229 Node* chk = _gvn.transform( new CmpINode(opq, profile_state) );
2230 Node* tst = _gvn.transform( new BoolNode(chk, BoolTest::eq) );
2231 // Branch to failure if state was changed
2232 { BuildCutout unless(this, tst, PROB_ALWAYS);
2233 uncommon_trap(Deoptimization::Reason_rtm_state_change,
2234 Deoptimization::Action_make_not_entrant);
2235 }
2236 }
2237 #endif
2238 }
2239
2240 //------------------------------return_current---------------------------------
2241 // Append current _map to _exit_return
2242 void Parse::return_current(Node* value) {
2243 if (method()->intrinsic_id() == vmIntrinsics::_Object_init) {
2244 call_register_finalizer();
2245 }
2246
2247 // Do not set_parse_bci, so that return goo is credited to the return insn.
2248 set_bci(InvocationEntryBci);
2249 if (method()->is_synchronized() && GenerateSynchronizationCode) {
2250 shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node());
2251 }
2252 if (C->env()->dtrace_method_probes()) {
2253 make_dtrace_method_exit(method());
2254 }
2255 SafePointNode* exit_return = _exits.map();
2256 exit_return->in( TypeFunc::Control )->add_req( control() );
2257 exit_return->in( TypeFunc::I_O )->add_req( i_o () );
2258 Node *mem = exit_return->in( TypeFunc::Memory );
2259 for (MergeMemStream mms(mem->as_MergeMem(), merged_memory()); mms.next_non_empty2(); ) {
2260 if (mms.is_empty()) {
2261 // get a copy of the base memory, and patch just this one input
2262 const TypePtr* adr_type = mms.adr_type(C);
2263 Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type);
2264 assert(phi->as_Phi()->region() == mms.base_memory()->in(0), "");
2265 gvn().set_type_bottom(phi);
2266 phi->del_req(phi->req()-1); // prepare to re-patch
2267 mms.set_memory(phi);
2268 }
2269 mms.memory()->add_req(mms.memory2());
2270 }
2271
2272 // frame pointer is always same, already captured
2273 if (value != nullptr) {
2274 // If returning oops to an interface-return, there is a silent free
2275 // cast from oop to interface allowed by the Verifier. Make it explicit
2276 // here.
2277 Node* phi = _exits.argument(0);
2278 phi->add_req(value);
2279 }
2280
2281 if (_first_return) {
2282 _exits.map()->transfer_replaced_nodes_from(map(), _new_idx);
2283 _first_return = false;
2284 } else {
2285 _exits.map()->merge_replaced_nodes_with(map());
2286 }
2287
2288 stop_and_kill_map(); // This CFG path dies here
2289 }
2290
2291
2292 //------------------------------add_safepoint----------------------------------
2293 void Parse::add_safepoint() {
2294 uint parms = TypeFunc::Parms+1;
2295
2296 // Clear out dead values from the debug info.
2297 kill_dead_locals();
2298
2299 // Clone the JVM State
2300 SafePointNode *sfpnt = new SafePointNode(parms, nullptr);
2301
2302 // Capture memory state BEFORE a SafePoint. Since we can block at a
2303 // SafePoint we need our GC state to be safe; i.e. we need all our current
2304 // write barriers (card marks) to not float down after the SafePoint so we
2305 // must read raw memory. Likewise we need all oop stores to match the card
2306 // marks. If deopt can happen, we need ALL stores (we need the correct JVM
2307 // state on a deopt).
2308
2309 // We do not need to WRITE the memory state after a SafePoint. The control
2310 // edge will keep card-marks and oop-stores from floating up from below a
2311 // SafePoint and our true dependency added here will keep them from floating
2312 // down below a SafePoint.
2313
2314 // Clone the current memory state
2315 Node* mem = MergeMemNode::make(map()->memory());
2316
2317 mem = _gvn.transform(mem);
2318
2319 // Pass control through the safepoint
2320 sfpnt->init_req(TypeFunc::Control , control());
2321 // Fix edges normally used by a call
2322 sfpnt->init_req(TypeFunc::I_O , top() );
2323 sfpnt->init_req(TypeFunc::Memory , mem );
2324 sfpnt->init_req(TypeFunc::ReturnAdr, top() );
2325 sfpnt->init_req(TypeFunc::FramePtr , top() );
2326
2327 // Create a node for the polling address
2328 Node *polladr;
2329 Node *thread = _gvn.transform(new ThreadLocalNode());
2330 Node *polling_page_load_addr = _gvn.transform(basic_plus_adr(top(), thread, in_bytes(JavaThread::polling_page_offset())));
2331 polladr = make_load(control(), polling_page_load_addr, TypeRawPtr::BOTTOM, T_ADDRESS, Compile::AliasIdxRaw, MemNode::unordered);
2332 sfpnt->init_req(TypeFunc::Parms+0, _gvn.transform(polladr));
2333
2334 // Fix up the JVM State edges
2335 add_safepoint_edges(sfpnt);
2336 Node *transformed_sfpnt = _gvn.transform(sfpnt);
2337 set_control(transformed_sfpnt);
2338
2339 // Provide an edge from root to safepoint. This makes the safepoint
2340 // appear useful until the parse has completed.
2341 if (transformed_sfpnt->is_SafePoint()) {
2342 assert(C->root() != nullptr, "Expect parse is still valid");
2343 C->root()->add_prec(transformed_sfpnt);
2344 }
2345 }
2346
2347 #ifndef PRODUCT
2348 //------------------------show_parse_info--------------------------------------
2349 void Parse::show_parse_info() {
2350 InlineTree* ilt = nullptr;
2351 if (C->ilt() != nullptr) {
2352 JVMState* caller_jvms = is_osr_parse() ? caller()->caller() : caller();
2353 ilt = InlineTree::find_subtree_from_root(C->ilt(), caller_jvms, method());
2354 }
2355 if (PrintCompilation && Verbose) {
2356 if (depth() == 1) {
2357 if( ilt->count_inlines() ) {
2358 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(),
2359 ilt->count_inline_bcs());
2360 tty->cr();
2361 }
2362 } else {
2363 if (method()->is_synchronized()) tty->print("s");
2364 if (method()->has_exception_handlers()) tty->print("!");
2365 // Check this is not the final compiled version
2366 if (C->trap_can_recompile()) {
2367 tty->print("-");
2368 } else {
2369 tty->print(" ");
2370 }
2371 method()->print_short_name();
2372 if (is_osr_parse()) {
2373 tty->print(" @ %d", osr_bci());
2374 }
2375 tty->print(" (%d bytes)",method()->code_size());
2376 if (ilt->count_inlines()) {
2377 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(),
2378 ilt->count_inline_bcs());
2379 }
2380 tty->cr();
2381 }
2382 }
2383 if (PrintOpto && (depth() == 1 || PrintOptoInlining)) {
2384 // Print that we succeeded; suppress this message on the first osr parse.
2385
2386 if (method()->is_synchronized()) tty->print("s");
2387 if (method()->has_exception_handlers()) tty->print("!");
2388 // Check this is not the final compiled version
2389 if (C->trap_can_recompile() && depth() == 1) {
2390 tty->print("-");
2391 } else {
2392 tty->print(" ");
2393 }
2394 if( depth() != 1 ) { tty->print(" "); } // missing compile count
2395 for (int i = 1; i < depth(); ++i) { tty->print(" "); }
2396 method()->print_short_name();
2397 if (is_osr_parse()) {
2398 tty->print(" @ %d", osr_bci());
2399 }
2400 if (ilt->caller_bci() != -1) {
2401 tty->print(" @ %d", ilt->caller_bci());
2402 }
2403 tty->print(" (%d bytes)",method()->code_size());
2404 if (ilt->count_inlines()) {
2405 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(),
2406 ilt->count_inline_bcs());
2407 }
2408 tty->cr();
2409 }
2410 }
2411
2412
2413 //------------------------------dump-------------------------------------------
2414 // Dump information associated with the bytecodes of current _method
2415 void Parse::dump() {
2416 if( method() != nullptr ) {
2417 // Iterate over bytecodes
2418 ciBytecodeStream iter(method());
2419 for( Bytecodes::Code bc = iter.next(); bc != ciBytecodeStream::EOBC() ; bc = iter.next() ) {
2420 dump_bci( iter.cur_bci() );
2421 tty->cr();
2422 }
2423 }
2424 }
2425
2426 // Dump information associated with a byte code index, 'bci'
2427 void Parse::dump_bci(int bci) {
2428 // Output info on merge-points, cloning, and within _jsr..._ret
2429 // NYI
2430 tty->print(" bci:%d", bci);
2431 }
2432
2433 #endif