1 /*
2 * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2024, 2025, Alibaba Group Holding Limited. All rights reserved.
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
6 * This code is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 only, as
8 * published by the Free Software Foundation.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 *
24 */
25
26 #include "gc/shared/barrierSet.hpp"
27 #include "gc/shared/c2/barrierSetC2.hpp"
28 #include "libadt/vectset.hpp"
29 #include "memory/allocation.inline.hpp"
30 #include "memory/resourceArea.hpp"
31 #include "opto/ad.hpp"
32 #include "opto/callGenerator.hpp"
33 #include "opto/castnode.hpp"
34 #include "opto/cfgnode.hpp"
35 #include "opto/connode.hpp"
36 #include "opto/loopnode.hpp"
37 #include "opto/machnode.hpp"
38 #include "opto/matcher.hpp"
39 #include "opto/node.hpp"
40 #include "opto/opcodes.hpp"
41 #include "opto/regmask.hpp"
42 #include "opto/rootnode.hpp"
43 #include "opto/type.hpp"
44 #include "utilities/copy.hpp"
45 #include "utilities/macros.hpp"
46 #include "utilities/powerOfTwo.hpp"
47 #include "utilities/stringUtils.hpp"
48
49 class RegMask;
50 // #include "phase.hpp"
51 class PhaseTransform;
52 class PhaseGVN;
53
54 // Arena we are currently building Nodes in
55 const uint Node::NotAMachineReg = 0xffff0000;
56
57 #ifndef PRODUCT
58 extern uint nodes_created;
59 #endif
60 #ifdef __clang__
61 #pragma clang diagnostic push
62 #pragma GCC diagnostic ignored "-Wuninitialized"
63 #endif
64
65 #ifdef ASSERT
66
67 //-------------------------- construct_node------------------------------------
68 // Set a breakpoint here to identify where a particular node index is built.
69 void Node::verify_construction() {
70 _debug_orig = nullptr;
71 // The decimal digits of _debug_idx are <compile_id> followed by 10 digits of <_idx>
72 Compile* C = Compile::current();
73 assert(C->unique() < (INT_MAX - 1), "Node limit exceeded INT_MAX");
74 uint64_t new_debug_idx = (uint64_t)C->compile_id() * 10000000000 + _idx;
75 set_debug_idx(new_debug_idx);
76 if (!C->phase_optimize_finished()) {
77 // Only check assert during parsing and optimization phase. Skip it while generating code.
78 assert(C->live_nodes() <= C->max_node_limit(), "Live Node limit exceeded limit");
79 }
80 if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (uint64_t)_idx == BreakAtNode)) {
81 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=" UINT64_FORMAT, _idx, _debug_idx);
82 BREAKPOINT;
83 }
84 #if OPTO_DU_ITERATOR_ASSERT
85 _last_del = nullptr;
86 _del_tick = 0;
87 #endif
88 _hash_lock = 0;
89 }
90
91
92 // #ifdef ASSERT ...
93
94 #if OPTO_DU_ITERATOR_ASSERT
95 void DUIterator_Common::sample(const Node* node) {
96 _vdui = VerifyDUIterators;
97 _node = node;
98 _outcnt = node->_outcnt;
99 _del_tick = node->_del_tick;
100 _last = nullptr;
101 }
102
103 void DUIterator_Common::verify(const Node* node, bool at_end_ok) {
104 assert(_node == node, "consistent iterator source");
105 assert(_del_tick == node->_del_tick, "no unexpected deletions allowed");
106 }
107
108 void DUIterator_Common::verify_resync() {
109 // Ensure that the loop body has just deleted the last guy produced.
110 const Node* node = _node;
111 // Ensure that at least one copy of the last-seen edge was deleted.
112 // Note: It is OK to delete multiple copies of the last-seen edge.
113 // Unfortunately, we have no way to verify that all the deletions delete
114 // that same edge. On this point we must use the Honor System.
115 assert(node->_del_tick >= _del_tick+1, "must have deleted an edge");
116 assert(node->_last_del == _last, "must have deleted the edge just produced");
117 // We liked this deletion, so accept the resulting outcnt and tick.
118 _outcnt = node->_outcnt;
119 _del_tick = node->_del_tick;
120 }
121
122 void DUIterator_Common::reset(const DUIterator_Common& that) {
123 if (this == &that) return; // ignore assignment to self
124 if (!_vdui) {
125 // We need to initialize everything, overwriting garbage values.
126 _last = that._last;
127 _vdui = that._vdui;
128 }
129 // Note: It is legal (though odd) for an iterator over some node x
130 // to be reassigned to iterate over another node y. Some doubly-nested
131 // progress loops depend on being able to do this.
132 const Node* node = that._node;
133 // Re-initialize everything, except _last.
134 _node = node;
135 _outcnt = node->_outcnt;
136 _del_tick = node->_del_tick;
137 }
138
139 void DUIterator::sample(const Node* node) {
140 DUIterator_Common::sample(node); // Initialize the assertion data.
141 _refresh_tick = 0; // No refreshes have happened, as yet.
142 }
143
144 void DUIterator::verify(const Node* node, bool at_end_ok) {
145 DUIterator_Common::verify(node, at_end_ok);
146 assert(_idx < node->_outcnt + (uint)at_end_ok, "idx in range");
147 }
148
149 void DUIterator::verify_increment() {
150 if (_refresh_tick & 1) {
151 // We have refreshed the index during this loop.
152 // Fix up _idx to meet asserts.
153 if (_idx > _outcnt) _idx = _outcnt;
154 }
155 verify(_node, true);
156 }
157
158 void DUIterator::verify_resync() {
159 // Note: We do not assert on _outcnt, because insertions are OK here.
160 DUIterator_Common::verify_resync();
161 // Make sure we are still in sync, possibly with no more out-edges:
162 verify(_node, true);
163 }
164
165 void DUIterator::reset(const DUIterator& that) {
166 if (this == &that) return; // self assignment is always a no-op
167 assert(that._refresh_tick == 0, "assign only the result of Node::outs()");
168 assert(that._idx == 0, "assign only the result of Node::outs()");
169 assert(_idx == that._idx, "already assigned _idx");
170 if (!_vdui) {
171 // We need to initialize everything, overwriting garbage values.
172 sample(that._node);
173 } else {
174 DUIterator_Common::reset(that);
175 if (_refresh_tick & 1) {
176 _refresh_tick++; // Clear the "was refreshed" flag.
177 }
178 assert(_refresh_tick < 2*100000, "DU iteration must converge quickly");
179 }
180 }
181
182 void DUIterator::refresh() {
183 DUIterator_Common::sample(_node); // Re-fetch assertion data.
184 _refresh_tick |= 1; // Set the "was refreshed" flag.
185 }
186
187 void DUIterator::verify_finish() {
188 // If the loop has killed the node, do not require it to re-run.
189 if (_node->_outcnt == 0) _refresh_tick &= ~1;
190 // If this assert triggers, it means that a loop used refresh_out_pos
191 // to re-synch an iteration index, but the loop did not correctly
192 // re-run itself, using a "while (progress)" construct.
193 // This iterator enforces the rule that you must keep trying the loop
194 // until it "runs clean" without any need for refreshing.
195 assert(!(_refresh_tick & 1), "the loop must run once with no refreshing");
196 }
197
198
199 void DUIterator_Fast::verify(const Node* node, bool at_end_ok) {
200 DUIterator_Common::verify(node, at_end_ok);
201 Node** out = node->_out;
202 uint cnt = node->_outcnt;
203 assert(cnt == _outcnt, "no insertions allowed");
204 assert(_outp >= out && _outp <= out + cnt - !at_end_ok, "outp in range");
205 // This last check is carefully designed to work for NO_OUT_ARRAY.
206 }
207
208 void DUIterator_Fast::verify_limit() {
209 const Node* node = _node;
210 verify(node, true);
211 assert(_outp == node->_out + node->_outcnt, "limit still correct");
212 }
213
214 void DUIterator_Fast::verify_resync() {
215 const Node* node = _node;
216 if (_outp == node->_out + _outcnt) {
217 // Note that the limit imax, not the pointer i, gets updated with the
218 // exact count of deletions. (For the pointer it's always "--i".)
219 assert(node->_outcnt+node->_del_tick == _outcnt+_del_tick, "no insertions allowed with deletion(s)");
220 // This is a limit pointer, with a name like "imax".
221 // Fudge the _last field so that the common assert will be happy.
222 _last = (Node*) node->_last_del;
223 DUIterator_Common::verify_resync();
224 } else {
225 assert(node->_outcnt < _outcnt, "no insertions allowed with deletion(s)");
226 // A normal internal pointer.
227 DUIterator_Common::verify_resync();
228 // Make sure we are still in sync, possibly with no more out-edges:
229 verify(node, true);
230 }
231 }
232
233 void DUIterator_Fast::verify_relimit(uint n) {
234 const Node* node = _node;
235 assert((int)n > 0, "use imax -= n only with a positive count");
236 // This must be a limit pointer, with a name like "imax".
237 assert(_outp == node->_out + node->_outcnt, "apply -= only to a limit (imax)");
238 // The reported number of deletions must match what the node saw.
239 assert(node->_del_tick == _del_tick + n, "must have deleted n edges");
240 // Fudge the _last field so that the common assert will be happy.
241 _last = (Node*) node->_last_del;
242 DUIterator_Common::verify_resync();
243 }
244
245 void DUIterator_Fast::reset(const DUIterator_Fast& that) {
246 assert(_outp == that._outp, "already assigned _outp");
247 DUIterator_Common::reset(that);
248 }
249
250 void DUIterator_Last::verify(const Node* node, bool at_end_ok) {
251 // at_end_ok means the _outp is allowed to underflow by 1
252 _outp += at_end_ok;
253 DUIterator_Fast::verify(node, at_end_ok); // check _del_tick, etc.
254 _outp -= at_end_ok;
255 assert(_outp == (node->_out + node->_outcnt) - 1, "pointer must point to end of nodes");
256 }
257
258 void DUIterator_Last::verify_limit() {
259 // Do not require the limit address to be resynched.
260 //verify(node, true);
261 assert(_outp == _node->_out, "limit still correct");
262 }
263
264 void DUIterator_Last::verify_step(uint num_edges) {
265 assert((int)num_edges > 0, "need non-zero edge count for loop progress");
266 _outcnt -= num_edges;
267 _del_tick += num_edges;
268 // Make sure we are still in sync, possibly with no more out-edges:
269 const Node* node = _node;
270 verify(node, true);
271 assert(node->_last_del == _last, "must have deleted the edge just produced");
272 }
273
274 #endif //OPTO_DU_ITERATOR_ASSERT
275
276
277 #endif //ASSERT
278
279
280 // This constant used to initialize _out may be any non-null value.
281 // The value null is reserved for the top node only.
282 #define NO_OUT_ARRAY ((Node**)-1)
283
284 // Out-of-line code from node constructors.
285 // Executed only when extra debug info. is being passed around.
286 static void init_node_notes(Compile* C, int idx, Node_Notes* nn) {
287 C->set_node_notes_at(idx, nn);
288 }
289
290 // Shared initialization code.
291 inline int Node::Init(int req) {
292 Compile* C = Compile::current();
293 int idx = C->next_unique();
294 NOT_PRODUCT(_igv_idx = C->next_igv_idx());
295
296 // Allocate memory for the necessary number of edges.
297 if (req > 0) {
298 // Allocate space for _in array to have double alignment.
299 _in = (Node **) ((char *) (C->node_arena()->AmallocWords(req * sizeof(void*))));
300 }
301 // If there are default notes floating around, capture them:
302 Node_Notes* nn = C->default_node_notes();
303 if (nn != nullptr) init_node_notes(C, idx, nn);
304
305 // Note: At this point, C is dead,
306 // and we begin to initialize the new Node.
307
308 _cnt = _max = req;
309 _outcnt = _outmax = 0;
310 _class_id = Class_Node;
311 _flags = 0;
312 _out = NO_OUT_ARRAY;
313 return idx;
314 }
315
316 //------------------------------Node-------------------------------------------
317 // Create a Node, with a given number of required edges.
318 Node::Node(uint req)
319 : _idx(Init(req))
320 #ifdef ASSERT
321 , _parse_idx(_idx)
322 #endif
323 {
324 assert( req < Compile::current()->max_node_limit() - NodeLimitFudgeFactor, "Input limit exceeded" );
325 DEBUG_ONLY( verify_construction() );
326 NOT_PRODUCT(nodes_created++);
327 if (req == 0) {
328 _in = nullptr;
329 } else {
330 Node** to = _in;
331 for(uint i = 0; i < req; i++) {
332 to[i] = nullptr;
333 }
334 }
335 }
336
337 //------------------------------Node-------------------------------------------
338 Node::Node(Node *n0)
339 : _idx(Init(1))
340 #ifdef ASSERT
341 , _parse_idx(_idx)
342 #endif
343 {
344 DEBUG_ONLY( verify_construction() );
345 NOT_PRODUCT(nodes_created++);
346 assert( is_not_dead(n0), "can not use dead node");
347 _in[0] = n0; if (n0 != nullptr) n0->add_out((Node *)this);
348 }
349
350 //------------------------------Node-------------------------------------------
351 Node::Node(Node *n0, Node *n1)
352 : _idx(Init(2))
353 #ifdef ASSERT
354 , _parse_idx(_idx)
355 #endif
356 {
357 DEBUG_ONLY( verify_construction() );
358 NOT_PRODUCT(nodes_created++);
359 assert( is_not_dead(n0), "can not use dead node");
360 assert( is_not_dead(n1), "can not use dead node");
361 _in[0] = n0; if (n0 != nullptr) n0->add_out((Node *)this);
362 _in[1] = n1; if (n1 != nullptr) n1->add_out((Node *)this);
363 }
364
365 //------------------------------Node-------------------------------------------
366 Node::Node(Node *n0, Node *n1, Node *n2)
367 : _idx(Init(3))
368 #ifdef ASSERT
369 , _parse_idx(_idx)
370 #endif
371 {
372 DEBUG_ONLY( verify_construction() );
373 NOT_PRODUCT(nodes_created++);
374 assert( is_not_dead(n0), "can not use dead node");
375 assert( is_not_dead(n1), "can not use dead node");
376 assert( is_not_dead(n2), "can not use dead node");
377 _in[0] = n0; if (n0 != nullptr) n0->add_out((Node *)this);
378 _in[1] = n1; if (n1 != nullptr) n1->add_out((Node *)this);
379 _in[2] = n2; if (n2 != nullptr) n2->add_out((Node *)this);
380 }
381
382 //------------------------------Node-------------------------------------------
383 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3)
384 : _idx(Init(4))
385 #ifdef ASSERT
386 , _parse_idx(_idx)
387 #endif
388 {
389 DEBUG_ONLY( verify_construction() );
390 NOT_PRODUCT(nodes_created++);
391 assert( is_not_dead(n0), "can not use dead node");
392 assert( is_not_dead(n1), "can not use dead node");
393 assert( is_not_dead(n2), "can not use dead node");
394 assert( is_not_dead(n3), "can not use dead node");
395 _in[0] = n0; if (n0 != nullptr) n0->add_out((Node *)this);
396 _in[1] = n1; if (n1 != nullptr) n1->add_out((Node *)this);
397 _in[2] = n2; if (n2 != nullptr) n2->add_out((Node *)this);
398 _in[3] = n3; if (n3 != nullptr) n3->add_out((Node *)this);
399 }
400
401 //------------------------------Node-------------------------------------------
402 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4)
403 : _idx(Init(5))
404 #ifdef ASSERT
405 , _parse_idx(_idx)
406 #endif
407 {
408 DEBUG_ONLY( verify_construction() );
409 NOT_PRODUCT(nodes_created++);
410 assert( is_not_dead(n0), "can not use dead node");
411 assert( is_not_dead(n1), "can not use dead node");
412 assert( is_not_dead(n2), "can not use dead node");
413 assert( is_not_dead(n3), "can not use dead node");
414 assert( is_not_dead(n4), "can not use dead node");
415 _in[0] = n0; if (n0 != nullptr) n0->add_out((Node *)this);
416 _in[1] = n1; if (n1 != nullptr) n1->add_out((Node *)this);
417 _in[2] = n2; if (n2 != nullptr) n2->add_out((Node *)this);
418 _in[3] = n3; if (n3 != nullptr) n3->add_out((Node *)this);
419 _in[4] = n4; if (n4 != nullptr) n4->add_out((Node *)this);
420 }
421
422 //------------------------------Node-------------------------------------------
423 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3,
424 Node *n4, Node *n5)
425 : _idx(Init(6))
426 #ifdef ASSERT
427 , _parse_idx(_idx)
428 #endif
429 {
430 DEBUG_ONLY( verify_construction() );
431 NOT_PRODUCT(nodes_created++);
432 assert( is_not_dead(n0), "can not use dead node");
433 assert( is_not_dead(n1), "can not use dead node");
434 assert( is_not_dead(n2), "can not use dead node");
435 assert( is_not_dead(n3), "can not use dead node");
436 assert( is_not_dead(n4), "can not use dead node");
437 assert( is_not_dead(n5), "can not use dead node");
438 _in[0] = n0; if (n0 != nullptr) n0->add_out((Node *)this);
439 _in[1] = n1; if (n1 != nullptr) n1->add_out((Node *)this);
440 _in[2] = n2; if (n2 != nullptr) n2->add_out((Node *)this);
441 _in[3] = n3; if (n3 != nullptr) n3->add_out((Node *)this);
442 _in[4] = n4; if (n4 != nullptr) n4->add_out((Node *)this);
443 _in[5] = n5; if (n5 != nullptr) n5->add_out((Node *)this);
444 }
445
446 //------------------------------Node-------------------------------------------
447 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3,
448 Node *n4, Node *n5, Node *n6)
449 : _idx(Init(7))
450 #ifdef ASSERT
451 , _parse_idx(_idx)
452 #endif
453 {
454 DEBUG_ONLY( verify_construction() );
455 NOT_PRODUCT(nodes_created++);
456 assert( is_not_dead(n0), "can not use dead node");
457 assert( is_not_dead(n1), "can not use dead node");
458 assert( is_not_dead(n2), "can not use dead node");
459 assert( is_not_dead(n3), "can not use dead node");
460 assert( is_not_dead(n4), "can not use dead node");
461 assert( is_not_dead(n5), "can not use dead node");
462 assert( is_not_dead(n6), "can not use dead node");
463 _in[0] = n0; if (n0 != nullptr) n0->add_out((Node *)this);
464 _in[1] = n1; if (n1 != nullptr) n1->add_out((Node *)this);
465 _in[2] = n2; if (n2 != nullptr) n2->add_out((Node *)this);
466 _in[3] = n3; if (n3 != nullptr) n3->add_out((Node *)this);
467 _in[4] = n4; if (n4 != nullptr) n4->add_out((Node *)this);
468 _in[5] = n5; if (n5 != nullptr) n5->add_out((Node *)this);
469 _in[6] = n6; if (n6 != nullptr) n6->add_out((Node *)this);
470 }
471
472 #ifdef __clang__
473 #pragma clang diagnostic pop
474 #endif
475
476
477 //------------------------------clone------------------------------------------
478 // Clone a Node.
479 Node *Node::clone() const {
480 Compile* C = Compile::current();
481 uint s = size_of(); // Size of inherited Node
482 Node *n = (Node*)C->node_arena()->AmallocWords(size_of() + _max*sizeof(Node*));
483 Copy::conjoint_words_to_lower((HeapWord*)this, (HeapWord*)n, s);
484 // Set the new input pointer array
485 n->_in = (Node**)(((char*)n)+s);
486 // Cannot share the old output pointer array, so kill it
487 n->_out = NO_OUT_ARRAY;
488 // And reset the counters to 0
489 n->_outcnt = 0;
490 n->_outmax = 0;
491 // Unlock this guy, since he is not in any hash table.
492 DEBUG_ONLY(n->_hash_lock = 0);
493 // Walk the old node's input list to duplicate its edges
494 uint i;
495 for( i = 0; i < len(); i++ ) {
496 Node *x = in(i);
497 n->_in[i] = x;
498 if (x != nullptr) x->add_out(n);
499 }
500 if (is_macro()) {
501 C->add_macro_node(n);
502 }
503 if (is_expensive()) {
504 C->add_expensive_node(n);
505 }
506 if (for_post_loop_opts_igvn()) {
507 // Don't add cloned node to Compile::_for_post_loop_opts_igvn list automatically.
508 // If it is applicable, it will happen anyway when the cloned node is registered with IGVN.
509 n->remove_flag(Node::NodeFlags::Flag_for_post_loop_opts_igvn);
510 }
511 if (for_merge_stores_igvn()) {
512 // Don't add cloned node to Compile::_for_merge_stores_igvn list automatically.
513 // If it is applicable, it will happen anyway when the cloned node is registered with IGVN.
514 n->remove_flag(Node::NodeFlags::Flag_for_merge_stores_igvn);
515 }
516 if (n->is_ParsePredicate()) {
517 C->add_parse_predicate(n->as_ParsePredicate());
518 }
519 if (n->is_OpaqueTemplateAssertionPredicate()) {
520 C->add_template_assertion_predicate_opaque(n->as_OpaqueTemplateAssertionPredicate());
521 }
522
523 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
524 bs->register_potential_barrier_node(n);
525
526 n->set_idx(C->next_unique()); // Get new unique index as well
527 NOT_PRODUCT(n->_igv_idx = C->next_igv_idx());
528 DEBUG_ONLY( n->verify_construction() );
529 NOT_PRODUCT(nodes_created++);
530 // Do not patch over the debug_idx of a clone, because it makes it
531 // impossible to break on the clone's moment of creation.
532 //DEBUG_ONLY( n->set_debug_idx( debug_idx() ) );
533
534 C->copy_node_notes_to(n, (Node*) this);
535
536 // MachNode clone
537 uint nopnds;
538 if (this->is_Mach() && (nopnds = this->as_Mach()->num_opnds()) > 0) {
539 MachNode *mach = n->as_Mach();
540 MachNode *mthis = this->as_Mach();
541 // Get address of _opnd_array.
542 // It should be the same offset since it is the clone of this node.
543 MachOper **from = mthis->_opnds;
544 MachOper **to = (MachOper **)((size_t)(&mach->_opnds) +
545 pointer_delta((const void*)from,
546 (const void*)(&mthis->_opnds), 1));
547 mach->_opnds = to;
548 for ( uint i = 0; i < nopnds; ++i ) {
549 to[i] = from[i]->clone();
550 }
551 }
552 if (this->is_MachProj()) {
553 // MachProjNodes contain register masks that may contain pointers to
554 // externally allocated memory. Make sure to use a proper constructor
555 // instead of just shallowly copying.
556 MachProjNode* mach = n->as_MachProj();
557 MachProjNode* mthis = this->as_MachProj();
558 new (&mach->_rout) RegMask(mthis->_rout);
559 }
560 if (n->is_Call()) {
561 // CallGenerator is linked to the original node.
562 CallGenerator* cg = n->as_Call()->generator();
563 if (cg != nullptr) {
564 CallGenerator* cloned_cg = cg->with_call_node(n->as_Call());
565 n->as_Call()->set_generator(cloned_cg);
566 }
567 }
568 if (n->is_SafePoint()) {
569 // Scalar replacement and macro expansion might modify the JVMState.
570 // Clone it to make sure it's not shared between SafePointNodes.
571 n->as_SafePoint()->clone_jvms(C);
572 n->as_SafePoint()->clone_replaced_nodes();
573 }
574 Compile::current()->record_modified_node(n);
575 return n; // Return the clone
576 }
577
578 //---------------------------setup_is_top--------------------------------------
579 // Call this when changing the top node, to reassert the invariants
580 // required by Node::is_top. See Compile::set_cached_top_node.
581 void Node::setup_is_top() {
582 if (this == (Node*)Compile::current()->top()) {
583 // This node has just become top. Kill its out array.
584 _outcnt = _outmax = 0;
585 _out = nullptr; // marker value for top
586 assert(is_top(), "must be top");
587 } else {
588 if (_out == nullptr) _out = NO_OUT_ARRAY;
589 assert(!is_top(), "must not be top");
590 }
591 }
592
593 //------------------------------~Node------------------------------------------
594 // Fancy destructor; eagerly attempt to reclaim Node numberings and storage
595 void Node::destruct(PhaseValues* phase) {
596 Compile* compile = (phase != nullptr) ? phase->C : Compile::current();
597 if (phase != nullptr && phase->is_IterGVN()) {
598 phase->is_IterGVN()->_worklist.remove(this);
599 }
600 // If this is the most recently created node, reclaim its index. Otherwise,
601 // record the node as dead to keep liveness information accurate.
602 if ((uint)_idx+1 == compile->unique()) {
603 compile->set_unique(compile->unique()-1);
604 } else {
605 compile->record_dead_node(_idx);
606 }
607 // Clear debug info:
608 Node_Notes* nn = compile->node_notes_at(_idx);
609 if (nn != nullptr) nn->clear();
610 // Walk the input array, freeing the corresponding output edges
611 _cnt = _max; // forget req/prec distinction
612 uint i;
613 for( i = 0; i < _max; i++ ) {
614 set_req(i, nullptr);
615 //assert(def->out(def->outcnt()-1) == (Node *)this,"bad def-use hacking in reclaim");
616 }
617 assert(outcnt() == 0, "deleting a node must not leave a dangling use");
618
619 if (is_macro()) {
620 compile->remove_macro_node(this);
621 }
622 if (is_expensive()) {
623 compile->remove_expensive_node(this);
624 }
625 if (is_OpaqueTemplateAssertionPredicate()) {
626 compile->remove_template_assertion_predicate_opaque(as_OpaqueTemplateAssertionPredicate());
627 }
628 if (is_ParsePredicate()) {
629 compile->remove_parse_predicate(as_ParsePredicate());
630 }
631 if (for_post_loop_opts_igvn()) {
632 compile->remove_from_post_loop_opts_igvn(this);
633 }
634 if (for_merge_stores_igvn()) {
635 compile->remove_from_merge_stores_igvn(this);
636 }
637
638 if (is_SafePoint()) {
639 as_SafePoint()->delete_replaced_nodes();
640
641 if (is_CallStaticJava()) {
642 compile->remove_unstable_if_trap(as_CallStaticJava(), false);
643 }
644 }
645 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
646 bs->unregister_potential_barrier_node(this);
647
648 // See if the input array was allocated just prior to the object
649 int edge_size = _max*sizeof(void*);
650 int out_edge_size = _outmax*sizeof(void*);
651 char *in_array = ((char*)_in);
652 char *edge_end = in_array + edge_size;
653 char *out_array = (char*)(_out == NO_OUT_ARRAY? nullptr: _out);
654 int node_size = size_of();
655
656 #ifdef ASSERT
657 // We will not actually delete the storage, but we'll make the node unusable.
658 compile->remove_modified_node(this);
659 *(address*)this = badAddress; // smash the C++ vtbl, probably
660 _in = _out = (Node**) badAddress;
661 _max = _cnt = _outmax = _outcnt = 0;
662 #endif
663
664 // Free the output edge array
665 if (out_edge_size > 0) {
666 compile->node_arena()->Afree(out_array, out_edge_size);
667 }
668
669 // Free the input edge array and the node itself
670 if( edge_end == (char*)this ) {
671 // It was; free the input array and object all in one hit
672 #ifndef ASSERT
673 compile->node_arena()->Afree(in_array, edge_size+node_size);
674 #endif
675 } else {
676 // Free just the input array
677 compile->node_arena()->Afree(in_array, edge_size);
678
679 // Free just the object
680 #ifndef ASSERT
681 compile->node_arena()->Afree(this, node_size);
682 #endif
683 }
684 }
685
686 // Resize input or output array to grow it to the next larger power-of-2 bigger
687 // than len.
688 void Node::resize_array(Node**& array, node_idx_t& max_size, uint len, bool needs_clearing) {
689 Arena* arena = Compile::current()->node_arena();
690 uint new_max = max_size;
691 if (new_max == 0) {
692 max_size = 4;
693 array = (Node**)arena->Amalloc(4 * sizeof(Node*));
694 if (needs_clearing) {
695 array[0] = nullptr;
696 array[1] = nullptr;
697 array[2] = nullptr;
698 array[3] = nullptr;
699 }
700 return;
701 }
702 new_max = next_power_of_2(len);
703 assert(needs_clearing || (array != nullptr && array != NO_OUT_ARRAY), "out must have sensible value");
704 array = (Node**)arena->Arealloc(array, max_size * sizeof(Node*), new_max * sizeof(Node*));
705 if (needs_clearing) {
706 Copy::zero_to_bytes(&array[max_size], (new_max - max_size) * sizeof(Node*)); // null all new space
707 }
708 max_size = new_max; // Record new max length
709 // This assertion makes sure that Node::_max is wide enough to
710 // represent the numerical value of new_max.
711 assert(max_size > len, "int width of _max or _outmax is too small");
712 }
713
714 //------------------------------grow-------------------------------------------
715 // Grow the input array, making space for more edges
716 void Node::grow(uint len) {
717 resize_array(_in, _max, len, true);
718 }
719
720 //-----------------------------out_grow----------------------------------------
721 // Grow the input array, making space for more edges
722 void Node::out_grow(uint len) {
723 assert(!is_top(), "cannot grow a top node's out array");
724 resize_array(_out, _outmax, len, false);
725 }
726
727 #ifdef ASSERT
728 //------------------------------is_dead----------------------------------------
729 bool Node::is_dead() const {
730 // Mach and pinch point nodes may look like dead.
731 if( is_top() || is_Mach() || (Opcode() == Op_Node && _outcnt > 0) )
732 return false;
733 for( uint i = 0; i < _max; i++ )
734 if( _in[i] != nullptr )
735 return false;
736 return true;
737 }
738
739 bool Node::is_not_dead(const Node* n) {
740 return n == nullptr || !PhaseIterGVN::is_verify_def_use() || !(n->is_dead());
741 }
742
743 bool Node::is_reachable_from_root() const {
744 ResourceMark rm;
745 Unique_Node_List wq;
746 wq.push((Node*)this);
747 RootNode* root = Compile::current()->root();
748 for (uint i = 0; i < wq.size(); i++) {
749 Node* m = wq.at(i);
750 if (m == root) {
751 return true;
752 }
753 for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) {
754 Node* u = m->fast_out(j);
755 wq.push(u);
756 }
757 }
758 return false;
759 }
760 #endif
761
762 //------------------------------is_unreachable---------------------------------
763 bool Node::is_unreachable(PhaseIterGVN &igvn) const {
764 assert(!is_Mach(), "doesn't work with MachNodes");
765 return outcnt() == 0 || igvn.type(this) == Type::TOP || (in(0) != nullptr && in(0)->is_top());
766 }
767
768 //------------------------------add_req----------------------------------------
769 // Add a new required input at the end
770 void Node::add_req( Node *n ) {
771 assert( is_not_dead(n), "can not use dead node");
772
773 // Look to see if I can move precedence down one without reallocating
774 if( (_cnt >= _max) || (in(_max-1) != nullptr) )
775 grow( _max+1 );
776
777 // Find a precedence edge to move
778 if( in(_cnt) != nullptr ) { // Next precedence edge is busy?
779 uint i;
780 for( i=_cnt; i<_max; i++ )
781 if( in(i) == nullptr ) // Find the null at end of prec edge list
782 break; // There must be one, since we grew the array
783 _in[i] = in(_cnt); // Move prec over, making space for req edge
784 }
785 _in[_cnt++] = n; // Stuff over old prec edge
786 if (n != nullptr) n->add_out((Node *)this);
787 Compile::current()->record_modified_node(this);
788 }
789
790 //---------------------------add_req_batch-------------------------------------
791 // Add a new required input at the end
792 void Node::add_req_batch( Node *n, uint m ) {
793 assert( is_not_dead(n), "can not use dead node");
794 // check various edge cases
795 if ((int)m <= 1) {
796 assert((int)m >= 0, "oob");
797 if (m != 0) add_req(n);
798 return;
799 }
800
801 // Look to see if I can move precedence down one without reallocating
802 if( (_cnt+m) > _max || _in[_max-m] )
803 grow( _max+m );
804
805 // Find a precedence edge to move
806 if( _in[_cnt] != nullptr ) { // Next precedence edge is busy?
807 uint i;
808 for( i=_cnt; i<_max; i++ )
809 if( _in[i] == nullptr ) // Find the null at end of prec edge list
810 break; // There must be one, since we grew the array
811 // Slide all the precs over by m positions (assume #prec << m).
812 Copy::conjoint_words_to_higher((HeapWord*)&_in[_cnt], (HeapWord*)&_in[_cnt+m], ((i-_cnt)*sizeof(Node*)));
813 }
814
815 // Stuff over the old prec edges
816 for(uint i=0; i<m; i++ ) {
817 _in[_cnt++] = n;
818 }
819
820 // Insert multiple out edges on the node.
821 if (n != nullptr && !n->is_top()) {
822 for(uint i=0; i<m; i++ ) {
823 n->add_out((Node *)this);
824 }
825 }
826 Compile::current()->record_modified_node(this);
827 }
828
829 //------------------------------del_req----------------------------------------
830 // Delete the required edge and compact the edge array
831 void Node::del_req( uint idx ) {
832 assert( idx < _cnt, "oob");
833 assert( !VerifyHashTableKeys || _hash_lock == 0,
834 "remove node from hash table before modifying it");
835 // First remove corresponding def-use edge
836 Node *n = in(idx);
837 if (n != nullptr) n->del_out((Node *)this);
838 _in[idx] = in(--_cnt); // Compact the array
839 // Avoid spec violation: Gap in prec edges.
840 close_prec_gap_at(_cnt);
841 Compile::current()->record_modified_node(this);
842 }
843
844 //------------------------------del_req_ordered--------------------------------
845 // Delete the required edge and compact the edge array with preserved order
846 void Node::del_req_ordered( uint idx ) {
847 assert( idx < _cnt, "oob");
848 assert( !VerifyHashTableKeys || _hash_lock == 0,
849 "remove node from hash table before modifying it");
850 // First remove corresponding def-use edge
851 Node *n = in(idx);
852 if (n != nullptr) n->del_out((Node *)this);
853 if (idx < --_cnt) { // Not last edge ?
854 Copy::conjoint_words_to_lower((HeapWord*)&_in[idx+1], (HeapWord*)&_in[idx], ((_cnt-idx)*sizeof(Node*)));
855 }
856 // Avoid spec violation: Gap in prec edges.
857 close_prec_gap_at(_cnt);
858 Compile::current()->record_modified_node(this);
859 }
860
861 //------------------------------ins_req----------------------------------------
862 // Insert a new required input at the end
863 void Node::ins_req( uint idx, Node *n ) {
864 assert( is_not_dead(n), "can not use dead node");
865 add_req(nullptr); // Make space
866 assert( idx < _max, "Must have allocated enough space");
867 // Slide over
868 if(_cnt-idx-1 > 0) {
869 Copy::conjoint_words_to_higher((HeapWord*)&_in[idx], (HeapWord*)&_in[idx+1], ((_cnt-idx-1)*sizeof(Node*)));
870 }
871 _in[idx] = n; // Stuff over old required edge
872 if (n != nullptr) n->add_out((Node *)this); // Add reciprocal def-use edge
873 Compile::current()->record_modified_node(this);
874 }
875
876 //-----------------------------find_edge---------------------------------------
877 int Node::find_edge(Node* n) {
878 for (uint i = 0; i < len(); i++) {
879 if (_in[i] == n) return i;
880 }
881 return -1;
882 }
883
884 //----------------------------replace_edge-------------------------------------
885 int Node::replace_edge(Node* old, Node* neww, PhaseGVN* gvn) {
886 if (old == neww) return 0; // nothing to do
887 uint nrep = 0;
888 for (uint i = 0; i < len(); i++) {
889 if (in(i) == old) {
890 if (i < req()) {
891 if (gvn != nullptr) {
892 set_req_X(i, neww, gvn);
893 } else {
894 set_req(i, neww);
895 }
896 } else {
897 assert(gvn == nullptr || gvn->is_IterGVN() == nullptr, "no support for igvn here");
898 assert(find_prec_edge(neww) == -1, "spec violation: duplicated prec edge (node %d -> %d)", _idx, neww->_idx);
899 set_prec(i, neww);
900 }
901 nrep++;
902 }
903 }
904 return nrep;
905 }
906
907 /**
908 * Replace input edges in the range pointing to 'old' node.
909 */
910 int Node::replace_edges_in_range(Node* old, Node* neww, int start, int end, PhaseGVN* gvn) {
911 if (old == neww) return 0; // nothing to do
912 uint nrep = 0;
913 for (int i = start; i < end; i++) {
914 if (in(i) == old) {
915 set_req_X(i, neww, gvn);
916 nrep++;
917 }
918 }
919 return nrep;
920 }
921
922 //-------------------------disconnect_inputs-----------------------------------
923 // null out all inputs to eliminate incoming Def-Use edges.
924 void Node::disconnect_inputs(Compile* C) {
925 // the layout of Node::_in
926 // r: a required input, null is allowed
927 // p: a precedence, null values are all at the end
928 // -----------------------------------
929 // |r|...|r|p|...|p|null|...|null|
930 // | |
931 // req() len()
932 // -----------------------------------
933 for (uint i = 0; i < req(); ++i) {
934 if (in(i) != nullptr) {
935 set_req(i, nullptr);
936 }
937 }
938
939 // Remove precedence edges if any exist
940 // Note: Safepoints may have precedence edges, even during parsing
941 for (uint i = len(); i > req(); ) {
942 rm_prec(--i); // no-op if _in[i] is null
943 }
944
945 #ifdef ASSERT
946 // sanity check
947 for (uint i = 0; i < len(); ++i) {
948 assert(_in[i] == nullptr, "disconnect_inputs() failed!");
949 }
950 #endif
951
952 // Node::destruct requires all out edges be deleted first
953 // DEBUG_ONLY(destruct();) // no reuse benefit expected
954 C->record_dead_node(_idx);
955 }
956
957 //-----------------------------uncast---------------------------------------
958 // %%% Temporary, until we sort out CheckCastPP vs. CastPP.
959 // Strip away casting. (It is depth-limited.)
960 // Optionally, keep casts with dependencies.
961 Node* Node::uncast(bool keep_deps) const {
962 // Should be inline:
963 //return is_ConstraintCast() ? uncast_helper(this) : (Node*) this;
964 if (is_ConstraintCast()) {
965 return uncast_helper(this, keep_deps);
966 } else {
967 return (Node*) this;
968 }
969 }
970
971 // Find out of current node that matches opcode.
972 Node* Node::find_out_with(int opcode) {
973 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
974 Node* use = fast_out(i);
975 if (use->Opcode() == opcode) {
976 return use;
977 }
978 }
979 return nullptr;
980 }
981
982 // Return true if the current node has an out that matches opcode.
983 bool Node::has_out_with(int opcode) {
984 return (find_out_with(opcode) != nullptr);
985 }
986
987 // Return true if the current node has an out that matches any of the opcodes.
988 bool Node::has_out_with(int opcode1, int opcode2, int opcode3, int opcode4) {
989 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
990 int opcode = fast_out(i)->Opcode();
991 if (opcode == opcode1 || opcode == opcode2 || opcode == opcode3 || opcode == opcode4) {
992 return true;
993 }
994 }
995 return false;
996 }
997
998
999 //---------------------------uncast_helper-------------------------------------
1000 Node* Node::uncast_helper(const Node* p, bool keep_deps) {
1001 #ifdef ASSERT
1002 // If we end up traversing more nodes than we actually have,
1003 // it is definitely an infinite loop.
1004 uint max_depth = Compile::current()->unique();
1005 uint depth_count = 0;
1006 const Node* orig_p = p;
1007 #endif
1008
1009 while (true) {
1010 #ifdef ASSERT
1011 if (depth_count++ >= max_depth) {
1012 orig_p->dump(4);
1013 if (p != orig_p) {
1014 p->dump(1);
1015 }
1016 fatal("infinite loop in Node::uncast_helper");
1017 }
1018 #endif
1019 if (p == nullptr || p->req() != 2) {
1020 break;
1021 } else if (p->is_ConstraintCast()) {
1022 if (keep_deps && p->as_ConstraintCast()->carry_dependency()) {
1023 break; // stop at casts with dependencies
1024 }
1025 p = p->in(1);
1026 } else {
1027 break;
1028 }
1029 }
1030 return (Node*) p;
1031 }
1032
1033 //------------------------------add_prec---------------------------------------
1034 // Add a new precedence input. Precedence inputs are unordered, with
1035 // duplicates removed and nulls packed down at the end.
1036 void Node::add_prec( Node *n ) {
1037 assert( is_not_dead(n), "can not use dead node");
1038
1039 // Check for null at end
1040 if( _cnt >= _max || in(_max-1) )
1041 grow( _max+1 );
1042
1043 // Find a precedence edge to move
1044 uint i = _cnt;
1045 while( in(i) != nullptr ) {
1046 if (in(i) == n) return; // Avoid spec violation: duplicated prec edge.
1047 i++;
1048 }
1049 _in[i] = n; // Stuff prec edge over null
1050 if ( n != nullptr) n->add_out((Node *)this); // Add mirror edge
1051
1052 #ifdef ASSERT
1053 while ((++i)<_max) { assert(_in[i] == nullptr, "spec violation: Gap in prec edges (node %d)", _idx); }
1054 #endif
1055 Compile::current()->record_modified_node(this);
1056 }
1057
1058 //------------------------------rm_prec----------------------------------------
1059 // Remove a precedence input. Precedence inputs are unordered, with
1060 // duplicates removed and nulls packed down at the end.
1061 void Node::rm_prec( uint j ) {
1062 assert(j < _max, "oob: i=%d, _max=%d", j, _max);
1063 assert(j >= _cnt, "not a precedence edge");
1064 if (_in[j] == nullptr) return; // Avoid spec violation: Gap in prec edges.
1065 _in[j]->del_out((Node *)this);
1066 close_prec_gap_at(j);
1067 Compile::current()->record_modified_node(this);
1068 }
1069
1070 //------------------------------size_of----------------------------------------
1071 uint Node::size_of() const { return sizeof(*this); }
1072
1073 //------------------------------ideal_reg--------------------------------------
1074 uint Node::ideal_reg() const { return 0; }
1075
1076 //------------------------------jvms-------------------------------------------
1077 JVMState* Node::jvms() const { return nullptr; }
1078
1079 #ifdef ASSERT
1080 //------------------------------jvms-------------------------------------------
1081 bool Node::verify_jvms(const JVMState* using_jvms) const {
1082 for (JVMState* jvms = this->jvms(); jvms != nullptr; jvms = jvms->caller()) {
1083 if (jvms == using_jvms) return true;
1084 }
1085 return false;
1086 }
1087
1088 //------------------------------init_NodeProperty------------------------------
1089 void Node::init_NodeProperty() {
1090 assert(_max_classes <= max_juint, "too many NodeProperty classes");
1091 assert(max_flags() <= max_juint, "too many NodeProperty flags");
1092 }
1093
1094 //-----------------------------max_flags---------------------------------------
1095 juint Node::max_flags() {
1096 return (PD::_last_flag << 1) - 1; // allow flags combination
1097 }
1098 #endif
1099
1100 //------------------------------format-----------------------------------------
1101 // Print as assembly
1102 void Node::format( PhaseRegAlloc *, outputStream *st ) const {}
1103 //------------------------------emit-------------------------------------------
1104 // Emit bytes using C2_MacroAssembler
1105 void Node::emit(C2_MacroAssembler *masm, PhaseRegAlloc *ra_) const {}
1106 //------------------------------size-------------------------------------------
1107 // Size of instruction in bytes
1108 uint Node::size(PhaseRegAlloc *ra_) const { return 0; }
1109
1110 //------------------------------CFG Construction-------------------------------
1111 // Nodes that end basic blocks, e.g. IfTrue/IfFalse, JumpProjNode, Root,
1112 // Goto and Return.
1113 const Node *Node::is_block_proj() const { return nullptr; }
1114
1115 // Minimum guaranteed type
1116 const Type *Node::bottom_type() const { return Type::BOTTOM; }
1117
1118
1119 //------------------------------raise_bottom_type------------------------------
1120 // Get the worst-case Type output for this Node.
1121 void Node::raise_bottom_type(const Type* new_type) {
1122 if (is_Type()) {
1123 TypeNode *n = this->as_Type();
1124 if (VerifyAliases) {
1125 assert(new_type->higher_equal_speculative(n->type()), "new type must refine old type");
1126 }
1127 n->set_type(new_type);
1128 } else if (is_Load()) {
1129 LoadNode *n = this->as_Load();
1130 if (VerifyAliases) {
1131 assert(new_type->higher_equal_speculative(n->type()), "new type must refine old type");
1132 }
1133 n->set_type(new_type);
1134 }
1135 }
1136
1137 //------------------------------Identity---------------------------------------
1138 // Return a node that the given node is equivalent to.
1139 Node* Node::Identity(PhaseGVN* phase) {
1140 return this; // Default to no identities
1141 }
1142
1143 //------------------------------Value------------------------------------------
1144 // Compute a new Type for a node using the Type of the inputs.
1145 const Type* Node::Value(PhaseGVN* phase) const {
1146 return bottom_type(); // Default to worst-case Type
1147 }
1148
1149 //------------------------------Ideal------------------------------------------
1150 //
1151 // 'Idealize' the graph rooted at this Node.
1152 //
1153 // In order to be efficient and flexible there are some subtle invariants
1154 // these Ideal calls need to hold. Some of the flag bits for '-XX:VerifyIterativeGVN'
1155 // can help with validating these invariants, although they are too slow to have on by default:
1156 // - '-XX:VerifyIterativeGVN=1' checks the def-use info
1157 // - '-XX:VerifyIterativeGVN=100000' checks the return value
1158 // If you are hacking an Ideal call, be sure to use these.
1159 //
1160 // The Ideal call almost arbitrarily reshape the graph rooted at the 'this'
1161 // pointer. If ANY change is made, it must return the root of the reshaped
1162 // graph - even if the root is the same Node. Example: swapping the inputs
1163 // to an AddINode gives the same answer and same root, but you still have to
1164 // return the 'this' pointer instead of null. If the node was already dead
1165 // before the Ideal call, this rule does not apply, and it is fine to return
1166 // nullptr even if modifications were made.
1167 //
1168 // You cannot return an OLD Node, except for the 'this' pointer. Use the
1169 // Identity call to return an old Node; basically if Identity can find
1170 // another Node have the Ideal call make no change and return null.
1171 // Example: AddINode::Ideal must check for add of zero; in this case it
1172 // returns null instead of doing any graph reshaping.
1173 //
1174 // You cannot modify any old Nodes except for the 'this' pointer. Due to
1175 // sharing there may be other users of the old Nodes relying on their current
1176 // semantics. Modifying them will break the other users.
1177 // Example: when reshape "(X+3)+4" into "X+7" you must leave the Node for
1178 // "X+3" unchanged in case it is shared.
1179 //
1180 // If you modify the 'this' pointer's inputs, you should use
1181 // 'set_req'. If you are making a new Node (either as the new root or
1182 // some new internal piece) you may use 'init_req' to set the initial
1183 // value. You can make a new Node with either 'new' or 'clone'. In
1184 // either case, def-use info is correctly maintained.
1185 //
1186 // Example: reshape "(X+3)+4" into "X+7":
1187 // set_req(1, in(1)->in(1));
1188 // set_req(2, phase->intcon(7));
1189 // return this;
1190 // Example: reshape "X*4" into "X<<2"
1191 // return new LShiftINode(in(1), phase->intcon(2));
1192 //
1193 // You must call 'phase->transform(X)' on any new Nodes X you make, except
1194 // for the returned root node. Example: reshape "X*31" with "(X<<5)-X".
1195 // Node *shift=phase->transform(new LShiftINode(in(1),phase->intcon(5)));
1196 // return new AddINode(shift, in(1));
1197 //
1198 // When making a Node for a constant use 'phase->makecon' or 'phase->intcon'.
1199 // These forms are faster than 'phase->transform(new ConNode())' and Do
1200 // The Right Thing with def-use info.
1201 //
1202 // You cannot bury the 'this' Node inside of a graph reshape. If the reshaped
1203 // graph uses the 'this' Node it must be the root. If you want a Node with
1204 // the same Opcode as the 'this' pointer use 'clone'.
1205 //
1206 Node *Node::Ideal(PhaseGVN *phase, bool can_reshape) {
1207 return nullptr; // Default to being Ideal already
1208 }
1209
1210 // Some nodes have specific Ideal subgraph transformations only if they are
1211 // unique users of specific nodes. Such nodes should be put on IGVN worklist
1212 // for the transformations to happen.
1213 bool Node::has_special_unique_user() const {
1214 assert(outcnt() == 1, "match only for unique out");
1215 Node* n = unique_out();
1216 int op = Opcode();
1217 if (this->is_Store()) {
1218 // Condition for back-to-back stores folding.
1219 return n->Opcode() == op && n->in(MemNode::Memory) == this;
1220 } else if ((this->is_Load() || this->is_DecodeN() || this->is_Phi() || this->is_Con()) && n->Opcode() == Op_MemBarAcquire) {
1221 // Condition for removing an unused LoadNode or DecodeNNode from the MemBarAcquire precedence input
1222 return true;
1223 } else if (this->is_Load() && n->is_Move()) {
1224 // Condition for MoveX2Y (LoadX mem) => LoadY mem
1225 return true;
1226 } else if (op == Op_AddL) {
1227 // Condition for convL2I(addL(x,y)) ==> addI(convL2I(x),convL2I(y))
1228 return n->Opcode() == Op_ConvL2I && n->in(1) == this;
1229 } else if (op == Op_SubI || op == Op_SubL) {
1230 // Condition for subI(x,subI(y,z)) ==> subI(addI(x,z),y)
1231 return n->Opcode() == op && n->in(2) == this;
1232 } else if (is_If() && (n->is_IfFalse() || n->is_IfTrue())) {
1233 // See IfProjNode::Identity()
1234 return true;
1235 } else if ((is_IfFalse() || is_IfTrue()) && n->is_If()) {
1236 // See IfNode::fold_compares
1237 return true;
1238 } else if (n->Opcode() == Op_XorV || n->Opcode() == Op_XorVMask) {
1239 // Condition for XorVMask(VectorMaskCmp(x,y,cond), MaskAll(true)) ==> VectorMaskCmp(x,y,ncond)
1240 return true;
1241 } else {
1242 return false;
1243 }
1244 };
1245
1246 //--------------------------find_exact_control---------------------------------
1247 // Skip Proj and CatchProj nodes chains. Check for Null and Top.
1248 Node* Node::find_exact_control(Node* ctrl) {
1249 if (ctrl == nullptr && this->is_Region())
1250 ctrl = this->as_Region()->is_copy();
1251
1252 if (ctrl != nullptr && ctrl->is_CatchProj()) {
1253 if (ctrl->as_CatchProj()->_con == CatchProjNode::fall_through_index)
1254 ctrl = ctrl->in(0);
1255 if (ctrl != nullptr && !ctrl->is_top())
1256 ctrl = ctrl->in(0);
1257 }
1258
1259 if (ctrl != nullptr && ctrl->is_Proj())
1260 ctrl = ctrl->in(0);
1261
1262 return ctrl;
1263 }
1264
1265 //--------------------------dominates------------------------------------------
1266 // Helper function for MemNode::all_controls_dominate().
1267 // Check if 'this' control node dominates or equal to 'sub' control node.
1268 // We already know that if any path back to Root or Start reaches 'this',
1269 // then all paths so, so this is a simple search for one example,
1270 // not an exhaustive search for a counterexample.
1271 Node::DomResult Node::dominates(Node* sub, Node_List &nlist) {
1272 assert(this->is_CFG(), "expecting control");
1273 assert(sub != nullptr && sub->is_CFG(), "expecting control");
1274
1275 // detect dead cycle without regions
1276 int iterations_without_region_limit = DominatorSearchLimit;
1277
1278 Node* orig_sub = sub;
1279 Node* dom = this;
1280 bool met_dom = false;
1281 nlist.clear();
1282
1283 // Walk 'sub' backward up the chain to 'dom', watching for regions.
1284 // After seeing 'dom', continue up to Root or Start.
1285 // If we hit a region (backward split point), it may be a loop head.
1286 // Keep going through one of the region's inputs. If we reach the
1287 // same region again, go through a different input. Eventually we
1288 // will either exit through the loop head, or give up.
1289 // (If we get confused, break out and return a conservative 'false'.)
1290 while (sub != nullptr) {
1291 if (sub->is_top()) {
1292 // Conservative answer for dead code.
1293 return DomResult::EncounteredDeadCode;
1294 }
1295 if (sub == dom) {
1296 if (nlist.size() == 0) {
1297 // No Region nodes except loops were visited before and the EntryControl
1298 // path was taken for loops: it did not walk in a cycle.
1299 return DomResult::Dominate;
1300 } else if (met_dom) {
1301 break; // already met before: walk in a cycle
1302 } else {
1303 // Region nodes were visited. Continue walk up to Start or Root
1304 // to make sure that it did not walk in a cycle.
1305 met_dom = true; // first time meet
1306 iterations_without_region_limit = DominatorSearchLimit; // Reset
1307 }
1308 }
1309 if (sub->is_Start() || sub->is_Root()) {
1310 // Success if we met 'dom' along a path to Start or Root.
1311 // We assume there are no alternative paths that avoid 'dom'.
1312 // (This assumption is up to the caller to ensure!)
1313 return met_dom ? DomResult::Dominate : DomResult::NotDominate;
1314 }
1315 Node* up = sub->in(0);
1316 // Normalize simple pass-through regions and projections:
1317 up = sub->find_exact_control(up);
1318 // If sub == up, we found a self-loop. Try to push past it.
1319 if (sub == up && sub->is_Loop()) {
1320 // Take loop entry path on the way up to 'dom'.
1321 up = sub->in(1); // in(LoopNode::EntryControl);
1322 } else if (sub == up && sub->is_Region() && sub->req() == 2) {
1323 // Take in(1) path on the way up to 'dom' for regions with only one input
1324 up = sub->in(1);
1325 } else if (sub == up && sub->is_Region()) {
1326 // Try both paths for Regions with 2 input paths (it may be a loop head).
1327 // It could give conservative 'false' answer without information
1328 // which region's input is the entry path.
1329 iterations_without_region_limit = DominatorSearchLimit; // Reset
1330
1331 bool region_was_visited_before = false;
1332 // Was this Region node visited before?
1333 // If so, we have reached it because we accidentally took a
1334 // loop-back edge from 'sub' back into the body of the loop,
1335 // and worked our way up again to the loop header 'sub'.
1336 // So, take the first unexplored path on the way up to 'dom'.
1337 for (int j = nlist.size() - 1; j >= 0; j--) {
1338 intptr_t ni = (intptr_t)nlist.at(j);
1339 Node* visited = (Node*)(ni & ~1);
1340 bool visited_twice_already = ((ni & 1) != 0);
1341 if (visited == sub) {
1342 if (visited_twice_already) {
1343 // Visited 2 paths, but still stuck in loop body. Give up.
1344 return DomResult::NotDominate;
1345 }
1346 // The Region node was visited before only once.
1347 // (We will repush with the low bit set, below.)
1348 nlist.remove(j);
1349 // We will find a new edge and re-insert.
1350 region_was_visited_before = true;
1351 break;
1352 }
1353 }
1354
1355 // Find an incoming edge which has not been seen yet; walk through it.
1356 assert(up == sub, "");
1357 uint skip = region_was_visited_before ? 1 : 0;
1358 for (uint i = 1; i < sub->req(); i++) {
1359 Node* in = sub->in(i);
1360 if (in != nullptr && !in->is_top() && in != sub) {
1361 if (skip == 0) {
1362 up = in;
1363 break;
1364 }
1365 --skip; // skip this nontrivial input
1366 }
1367 }
1368
1369 // Set 0 bit to indicate that both paths were taken.
1370 nlist.push((Node*)((intptr_t)sub + (region_was_visited_before ? 1 : 0)));
1371 }
1372
1373 if (up == sub) {
1374 break; // some kind of tight cycle
1375 }
1376 if (up == orig_sub && met_dom) {
1377 // returned back after visiting 'dom'
1378 break; // some kind of cycle
1379 }
1380 if (--iterations_without_region_limit < 0) {
1381 break; // dead cycle
1382 }
1383 sub = up;
1384 }
1385
1386 // Did not meet Root or Start node in pred. chain.
1387 return DomResult::NotDominate;
1388 }
1389
1390 //------------------------------remove_dead_region-----------------------------
1391 // This control node is dead. Follow the subgraph below it making everything
1392 // using it dead as well. This will happen normally via the usual IterGVN
1393 // worklist but this call is more efficient. Do not update use-def info
1394 // inside the dead region, just at the borders.
1395 static void kill_dead_code( Node *dead, PhaseIterGVN *igvn ) {
1396 // Con's are a popular node to re-hit in the hash table again.
1397 if( dead->is_Con() ) return;
1398
1399 ResourceMark rm;
1400 Node_List nstack;
1401 VectorSet dead_set; // notify uses only once
1402
1403 Node *top = igvn->C->top();
1404 nstack.push(dead);
1405 bool has_irreducible_loop = igvn->C->has_irreducible_loop();
1406
1407 while (nstack.size() > 0) {
1408 dead = nstack.pop();
1409 if (!dead_set.test_set(dead->_idx)) {
1410 // If dead has any live uses, those are now still attached. Notify them before we lose them.
1411 igvn->add_users_to_worklist(dead);
1412 }
1413 if (dead->Opcode() == Op_SafePoint) {
1414 dead->as_SafePoint()->disconnect_from_root(igvn);
1415 }
1416 if (dead->outcnt() > 0) {
1417 // Keep dead node on stack until all uses are processed.
1418 nstack.push(dead);
1419 // For all Users of the Dead... ;-)
1420 for (DUIterator_Last kmin, k = dead->last_outs(kmin); k >= kmin; ) {
1421 Node* use = dead->last_out(k);
1422 igvn->hash_delete(use); // Yank from hash table prior to mod
1423 if (use->in(0) == dead) { // Found another dead node
1424 assert (!use->is_Con(), "Control for Con node should be Root node.");
1425 use->set_req(0, top); // Cut dead edge to prevent processing
1426 nstack.push(use); // the dead node again.
1427 } else if (!has_irreducible_loop && // Backedge could be alive in irreducible loop
1428 use->is_Loop() && !use->is_Root() && // Don't kill Root (RootNode extends LoopNode)
1429 use->in(LoopNode::EntryControl) == dead) { // Dead loop if its entry is dead
1430 use->set_req(LoopNode::EntryControl, top); // Cut dead edge to prevent processing
1431 use->set_req(0, top); // Cut self edge
1432 nstack.push(use);
1433 } else { // Else found a not-dead user
1434 // Dead if all inputs are top or null
1435 bool dead_use = !use->is_Root(); // Keep empty graph alive
1436 for (uint j = 1; j < use->req(); j++) {
1437 Node* in = use->in(j);
1438 if (in == dead) { // Turn all dead inputs into TOP
1439 use->set_req(j, top);
1440 } else if (in != nullptr && !in->is_top()) {
1441 dead_use = false;
1442 }
1443 }
1444 if (dead_use) {
1445 if (use->is_Region()) {
1446 use->set_req(0, top); // Cut self edge
1447 }
1448 nstack.push(use);
1449 } else {
1450 igvn->_worklist.push(use);
1451 }
1452 }
1453 // Refresh the iterator, since any number of kills might have happened.
1454 k = dead->last_outs(kmin);
1455 }
1456 } else { // (dead->outcnt() == 0)
1457 // Done with outputs.
1458 igvn->hash_delete(dead);
1459 igvn->_worklist.remove(dead);
1460 igvn->set_type(dead, Type::TOP);
1461 // Kill all inputs to the dead guy
1462 for (uint i=0; i < dead->req(); i++) {
1463 Node *n = dead->in(i); // Get input to dead guy
1464 if (n != nullptr && !n->is_top()) { // Input is valid?
1465 dead->set_req(i, top); // Smash input away
1466 if (n->outcnt() == 0) { // Input also goes dead?
1467 if (!n->is_Con())
1468 nstack.push(n); // Clear it out as well
1469 } else if (n->outcnt() == 1 &&
1470 n->has_special_unique_user()) {
1471 igvn->add_users_to_worklist( n );
1472 } else if (n->outcnt() <= 2 && n->is_Store()) {
1473 // Push store's uses on worklist to enable folding optimization for
1474 // store/store and store/load to the same address.
1475 // The restriction (outcnt() <= 2) is the same as in set_req_X()
1476 // and remove_globally_dead_node().
1477 igvn->add_users_to_worklist( n );
1478 } else if (dead->is_data_proj_of_pure_function(n)) {
1479 igvn->_worklist.push(n);
1480 } else {
1481 BarrierSet::barrier_set()->barrier_set_c2()->enqueue_useful_gc_barrier(igvn, n);
1482 }
1483 }
1484 }
1485 igvn->C->remove_useless_node(dead);
1486 } // (dead->outcnt() == 0)
1487 } // while (nstack.size() > 0) for outputs
1488 return;
1489 }
1490
1491 //------------------------------remove_dead_region-----------------------------
1492 bool Node::remove_dead_region(PhaseGVN *phase, bool can_reshape) {
1493 Node *n = in(0);
1494 if( !n ) return false;
1495 // Lost control into this guy? I.e., it became unreachable?
1496 // Aggressively kill all unreachable code.
1497 if (can_reshape && n->is_top()) {
1498 kill_dead_code(this, phase->is_IterGVN());
1499 return false; // Node is dead.
1500 }
1501
1502 if( n->is_Region() && n->as_Region()->is_copy() ) {
1503 Node *m = n->nonnull_req();
1504 set_req(0, m);
1505 return true;
1506 }
1507 return false;
1508 }
1509
1510 //------------------------------hash-------------------------------------------
1511 // Hash function over Nodes.
1512 uint Node::hash() const {
1513 uint sum = 0;
1514 for( uint i=0; i<_cnt; i++ ) // Add in all inputs
1515 sum = (sum<<1)-(uintptr_t)in(i); // Ignore embedded nulls
1516 return (sum>>2) + _cnt + Opcode();
1517 }
1518
1519 //------------------------------cmp--------------------------------------------
1520 // Compare special parts of simple Nodes
1521 bool Node::cmp( const Node &n ) const {
1522 return true; // Must be same
1523 }
1524
1525 //------------------------------rematerialize-----------------------------------
1526 // Should we clone rather than spill this instruction?
1527 bool Node::rematerialize() const {
1528 if ( is_Mach() )
1529 return this->as_Mach()->rematerialize();
1530 else
1531 return (_flags & Flag_rematerialize) != 0;
1532 }
1533
1534 //------------------------------needs_anti_dependence_check---------------------
1535 // Nodes which use memory without consuming it, hence need antidependences.
1536 bool Node::needs_anti_dependence_check() const {
1537 if (req() < 2 || (_flags & Flag_needs_anti_dependence_check) == 0) {
1538 return false;
1539 }
1540 return in(1)->bottom_type()->has_memory();
1541 }
1542
1543 // Get an integer constant from a ConNode (or CastIINode).
1544 // Return a default value if there is no apparent constant here.
1545 const TypeInt* Node::find_int_type() const {
1546 if (this->is_Type()) {
1547 return this->as_Type()->type()->isa_int();
1548 } else if (this->is_Con()) {
1549 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode");
1550 return this->bottom_type()->isa_int();
1551 }
1552 return nullptr;
1553 }
1554
1555 const TypeInteger* Node::find_integer_type(BasicType bt) const {
1556 if (this->is_Type()) {
1557 return this->as_Type()->type()->isa_integer(bt);
1558 } else if (this->is_Con()) {
1559 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode");
1560 return this->bottom_type()->isa_integer(bt);
1561 }
1562 return nullptr;
1563 }
1564
1565 // Get a pointer constant from a ConstNode.
1566 // Returns the constant if it is a pointer ConstNode
1567 intptr_t Node::get_ptr() const {
1568 assert( Opcode() == Op_ConP, "" );
1569 return ((ConPNode*)this)->type()->is_ptr()->get_con();
1570 }
1571
1572 // Get a narrow oop constant from a ConNNode.
1573 intptr_t Node::get_narrowcon() const {
1574 assert( Opcode() == Op_ConN, "" );
1575 return ((ConNNode*)this)->type()->is_narrowoop()->get_con();
1576 }
1577
1578 // Get a long constant from a ConNode.
1579 // Return a default value if there is no apparent constant here.
1580 const TypeLong* Node::find_long_type() const {
1581 if (this->is_Type()) {
1582 return this->as_Type()->type()->isa_long();
1583 } else if (this->is_Con()) {
1584 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode");
1585 return this->bottom_type()->isa_long();
1586 }
1587 return nullptr;
1588 }
1589
1590
1591 /**
1592 * Return a ptr type for nodes which should have it.
1593 */
1594 const TypePtr* Node::get_ptr_type() const {
1595 const TypePtr* tp = this->bottom_type()->make_ptr();
1596 #ifdef ASSERT
1597 if (tp == nullptr) {
1598 this->dump(1);
1599 assert((tp != nullptr), "unexpected node type");
1600 }
1601 #endif
1602 return tp;
1603 }
1604
1605 // Get a double constant from a ConstNode.
1606 // Returns the constant if it is a double ConstNode
1607 jdouble Node::getd() const {
1608 assert( Opcode() == Op_ConD, "" );
1609 return ((ConDNode*)this)->type()->is_double_constant()->getd();
1610 }
1611
1612 // Get a float constant from a ConstNode.
1613 // Returns the constant if it is a float ConstNode
1614 jfloat Node::getf() const {
1615 assert( Opcode() == Op_ConF, "" );
1616 return ((ConFNode*)this)->type()->is_float_constant()->getf();
1617 }
1618
1619 // Get a half float constant from a ConstNode.
1620 // Returns the constant if it is a float ConstNode
1621 jshort Node::geth() const {
1622 assert( Opcode() == Op_ConH, "" );
1623 return ((ConHNode*)this)->type()->is_half_float_constant()->geth();
1624 }
1625
1626 #ifndef PRODUCT
1627
1628 // Call this from debugger:
1629 Node* old_root() {
1630 Matcher* matcher = Compile::current()->matcher();
1631 if (matcher != nullptr) {
1632 Node* new_root = Compile::current()->root();
1633 Node* old_root = matcher->find_old_node(new_root);
1634 if (old_root != nullptr) {
1635 return old_root;
1636 }
1637 }
1638 tty->print("old_root: not found.\n");
1639 return nullptr;
1640 }
1641
1642 // BFS traverse all reachable nodes from start, call callback on them
1643 template <typename Callback>
1644 void visit_nodes(Node* start, Callback callback, bool traverse_output, bool only_ctrl) {
1645 Unique_Mixed_Node_List worklist;
1646 worklist.add(start);
1647 for (uint i = 0; i < worklist.size(); i++) {
1648 Node* n = worklist[i];
1649 callback(n);
1650 for (uint i = 0; i < n->len(); i++) {
1651 if (!only_ctrl || n->is_Region() || (n->Opcode() == Op_Root) || (i == TypeFunc::Control)) {
1652 // If only_ctrl is set: Add regions, the root node, or control inputs only
1653 worklist.add(n->in(i));
1654 }
1655 }
1656 if (traverse_output && !only_ctrl) {
1657 for (uint i = 0; i < n->outcnt(); i++) {
1658 worklist.add(n->raw_out(i));
1659 }
1660 }
1661 }
1662 }
1663
1664 // BFS traverse from start, return node with idx
1665 static Node* find_node_by_idx(Node* start, uint idx, bool traverse_output, bool only_ctrl) {
1666 ResourceMark rm;
1667 Node* result = nullptr;
1668 auto callback = [&] (Node* n) {
1669 if (n->_idx == idx) {
1670 if (result != nullptr) {
1671 tty->print("find_node_by_idx: " INTPTR_FORMAT " and " INTPTR_FORMAT " both have idx==%d\n",
1672 (uintptr_t)result, (uintptr_t)n, idx);
1673 }
1674 result = n;
1675 }
1676 };
1677 visit_nodes(start, callback, traverse_output, only_ctrl);
1678 return result;
1679 }
1680
1681 static int node_idx_cmp(const Node** n1, const Node** n2) {
1682 return (*n1)->_idx - (*n2)->_idx;
1683 }
1684
1685 static void find_nodes_by_name(Node* start, const char* name) {
1686 ResourceMark rm;
1687 GrowableArray<const Node*> ns;
1688 auto callback = [&] (const Node* n) {
1689 if (StringUtils::is_star_match(name, n->Name())) {
1690 ns.push(n);
1691 }
1692 };
1693 visit_nodes(start, callback, true, false);
1694 ns.sort(node_idx_cmp);
1695 for (int i = 0; i < ns.length(); i++) {
1696 ns.at(i)->dump();
1697 }
1698 }
1699
1700 static void find_nodes_by_dump(Node* start, const char* pattern) {
1701 ResourceMark rm;
1702 GrowableArray<const Node*> ns;
1703 auto callback = [&] (const Node* n) {
1704 stringStream stream;
1705 n->dump("", false, &stream);
1706 if (StringUtils::is_star_match(pattern, stream.base())) {
1707 ns.push(n);
1708 }
1709 };
1710 visit_nodes(start, callback, true, false);
1711 ns.sort(node_idx_cmp);
1712 for (int i = 0; i < ns.length(); i++) {
1713 ns.at(i)->dump();
1714 }
1715 }
1716
1717 // call from debugger: find node with name pattern in new/current graph
1718 // name can contain "*" in match pattern to match any characters
1719 // the matching is case insensitive
1720 void find_nodes_by_name(const char* name) {
1721 Node* root = Compile::current()->root();
1722 find_nodes_by_name(root, name);
1723 }
1724
1725 // call from debugger: find node with name pattern in old graph
1726 // name can contain "*" in match pattern to match any characters
1727 // the matching is case insensitive
1728 void find_old_nodes_by_name(const char* name) {
1729 Node* root = old_root();
1730 find_nodes_by_name(root, name);
1731 }
1732
1733 // call from debugger: find node with dump pattern in new/current graph
1734 // can contain "*" in match pattern to match any characters
1735 // the matching is case insensitive
1736 void find_nodes_by_dump(const char* pattern) {
1737 Node* root = Compile::current()->root();
1738 find_nodes_by_dump(root, pattern);
1739 }
1740
1741 // call from debugger: find node with name pattern in old graph
1742 // can contain "*" in match pattern to match any characters
1743 // the matching is case insensitive
1744 void find_old_nodes_by_dump(const char* pattern) {
1745 Node* root = old_root();
1746 find_nodes_by_dump(root, pattern);
1747 }
1748
1749 // Call this from debugger, search in same graph as n:
1750 Node* find_node(Node* n, const int idx) {
1751 return n->find(idx);
1752 }
1753
1754 // Call this from debugger, search in new nodes:
1755 Node* find_node(const int idx) {
1756 return Compile::current()->root()->find(idx);
1757 }
1758
1759 // Call this from debugger, search in old nodes:
1760 Node* find_old_node(const int idx) {
1761 Node* root = old_root();
1762 return (root == nullptr) ? nullptr : root->find(idx);
1763 }
1764
1765 // Call this from debugger, search in same graph as n:
1766 Node* find_ctrl(Node* n, const int idx) {
1767 return n->find_ctrl(idx);
1768 }
1769
1770 // Call this from debugger, search in new nodes:
1771 Node* find_ctrl(const int idx) {
1772 return Compile::current()->root()->find_ctrl(idx);
1773 }
1774
1775 // Call this from debugger, search in old nodes:
1776 Node* find_old_ctrl(const int idx) {
1777 Node* root = old_root();
1778 return (root == nullptr) ? nullptr : root->find_ctrl(idx);
1779 }
1780
1781 //------------------------------find_ctrl--------------------------------------
1782 // Find an ancestor to this node in the control history with given _idx
1783 Node* Node::find_ctrl(int idx) {
1784 return find(idx, true);
1785 }
1786
1787 //------------------------------find-------------------------------------------
1788 // Tries to find the node with the index |idx| starting from this node. If idx is negative,
1789 // the search also includes forward (out) edges. Returns null if not found.
1790 // If only_ctrl is set, the search will only be done on control nodes. Returns null if
1791 // not found or if the node to be found is not a control node (search will not find it).
1792 Node* Node::find(const int idx, bool only_ctrl) {
1793 ResourceMark rm;
1794 return find_node_by_idx(this, abs(idx), (idx < 0), only_ctrl);
1795 }
1796
1797 class PrintBFS {
1798 public:
1799 PrintBFS(const Node* start, const int max_distance, const Node* target, const char* options, outputStream* st, const frame* fr)
1800 : _start(start), _max_distance(max_distance), _target(target), _options(options), _output(st), _frame(fr),
1801 _dcc(this), _info_uid(cmpkey, hashkey) {}
1802
1803 void run();
1804 private:
1805 // pipeline steps
1806 bool configure();
1807 void collect();
1808 void select();
1809 void select_all();
1810 void select_all_paths();
1811 void select_shortest_path();
1812 void sort();
1813 void print();
1814
1815 // inputs
1816 const Node* _start;
1817 const int _max_distance;
1818 const Node* _target;
1819 const char* _options;
1820 outputStream* _output;
1821 const frame* _frame;
1822
1823 // options
1824 bool _traverse_inputs = false;
1825 bool _traverse_outputs = false;
1826 struct Filter {
1827 bool _control = false;
1828 bool _memory = false;
1829 bool _data = false;
1830 bool _mixed = false;
1831 bool _other = false;
1832 bool is_empty() const {
1833 return !(_control || _memory || _data || _mixed || _other);
1834 }
1835 void set_all() {
1836 _control = true;
1837 _memory = true;
1838 _data = true;
1839 _mixed = true;
1840 _other = true;
1841 }
1842 // Check if the filter accepts the node. Go by the type categories, but also all CFG nodes
1843 // are considered to have control.
1844 bool accepts(const Node* n) {
1845 const Type* t = n->bottom_type();
1846 return ( _data && t->has_category(Type::Category::Data) ) ||
1847 ( _memory && t->has_category(Type::Category::Memory) ) ||
1848 ( _mixed && t->has_category(Type::Category::Mixed) ) ||
1849 ( _control && (t->has_category(Type::Category::Control) || n->is_CFG()) ) ||
1850 ( _other && t->has_category(Type::Category::Other) );
1851 }
1852 };
1853 Filter _filter_visit;
1854 Filter _filter_boundary;
1855 bool _sort_idx = false;
1856 bool _all_paths = false;
1857 bool _use_color = false;
1858 bool _print_blocks = false;
1859 bool _print_old = false;
1860 bool _dump_only = false;
1861 bool _print_igv = false;
1862
1863 void print_options_help(bool print_examples);
1864 bool parse_options();
1865
1866 public:
1867 class DumpConfigColored : public Node::DumpConfig {
1868 public:
1869 DumpConfigColored(PrintBFS* bfs) : _bfs(bfs) {};
1870 virtual void pre_dump(outputStream* st, const Node* n);
1871 virtual void post_dump(outputStream* st);
1872 private:
1873 PrintBFS* _bfs;
1874 };
1875 private:
1876 DumpConfigColored _dcc;
1877
1878 // node info
1879 static Node* old_node(const Node* n); // mach node -> prior IR node
1880 void print_node_idx(const Node* n);
1881 void print_block_id(const Block* b);
1882 void print_node_block(const Node* n); // _pre_order, head idx, _idom, _dom_depth
1883
1884 // traversal data structures
1885 GrowableArray<const Node*> _worklist; // BFS queue
1886 void maybe_traverse(const Node* src, const Node* dst);
1887
1888 // node info annotation
1889 class Info {
1890 public:
1891 Info() : Info(nullptr, 0) {};
1892 Info(const Node* node, int distance)
1893 : _node(node), _distance_from_start(distance) {};
1894 const Node* node() const { return _node; };
1895 int distance() const { return _distance_from_start; };
1896 int distance_from_target() const { return _distance_from_target; }
1897 void set_distance_from_target(int d) { _distance_from_target = d; }
1898 GrowableArray<const Node*> edge_bwd; // pointing toward _start
1899 bool is_marked() const { return _mark; } // marked to keep during select
1900 void set_mark() { _mark = true; }
1901 private:
1902 const Node* _node;
1903 int _distance_from_start; // distance from _start
1904 int _distance_from_target = 0; // distance from _target if _all_paths
1905 bool _mark = false;
1906 };
1907 Dict _info_uid; // Node -> uid
1908 GrowableArray<Info> _info; // uid -> info
1909
1910 Info* find_info(const Node* n) {
1911 size_t uid = (size_t)_info_uid[n];
1912 if (uid == 0) {
1913 return nullptr;
1914 }
1915 return &_info.at((int)uid);
1916 }
1917
1918 void make_info(const Node* node, const int distance) {
1919 assert(find_info(node) == nullptr, "node does not yet have info");
1920 size_t uid = _info.length() + 1;
1921 _info_uid.Insert((void*)node, (void*)uid);
1922 _info.at_put_grow((int)uid, Info(node, distance));
1923 assert(find_info(node)->node() == node, "stored correct node");
1924 };
1925
1926 // filled by sort, printed by print
1927 GrowableArray<const Node*> _print_list;
1928
1929 // print header + node table
1930 void print_header() const;
1931 void print_node(const Node* n);
1932 };
1933
1934 void PrintBFS::run() {
1935 if (!configure()) {
1936 return;
1937 }
1938 collect();
1939 select();
1940 sort();
1941 print();
1942 }
1943
1944 // set up configuration for BFS and print
1945 bool PrintBFS::configure() {
1946 if (_max_distance < 0) {
1947 _output->print_cr("dump_bfs: max_distance must be non-negative!");
1948 return false;
1949 }
1950 return parse_options();
1951 }
1952
1953 // BFS traverse according to configuration, fill worklist and info
1954 void PrintBFS::collect() {
1955 maybe_traverse(_start, _start);
1956 int pos = 0;
1957 while (pos < _worklist.length()) {
1958 const Node* n = _worklist.at(pos++); // next node to traverse
1959 Info* info = find_info(n);
1960 if (!_filter_visit.accepts(n) && n != _start) {
1961 continue; // we hit boundary, do not traverse further
1962 }
1963 if (n != _start && n->is_Root()) {
1964 continue; // traversing through root node would lead to unrelated nodes
1965 }
1966 if (_traverse_inputs && _max_distance > info->distance()) {
1967 for (uint i = 0; i < n->req(); i++) {
1968 maybe_traverse(n, n->in(i));
1969 }
1970 }
1971 if (_traverse_outputs && _max_distance > info->distance()) {
1972 for (uint i = 0; i < n->outcnt(); i++) {
1973 maybe_traverse(n, n->raw_out(i));
1974 }
1975 }
1976 }
1977 }
1978
1979 // go through work list, mark those that we want to print
1980 void PrintBFS::select() {
1981 if (_target == nullptr ) {
1982 select_all();
1983 } else {
1984 if (find_info(_target) == nullptr) {
1985 _output->print_cr("Could not find target in BFS.");
1986 return;
1987 }
1988 if (_all_paths) {
1989 select_all_paths();
1990 } else {
1991 select_shortest_path();
1992 }
1993 }
1994 }
1995
1996 // take all nodes from BFS
1997 void PrintBFS::select_all() {
1998 for (int i = 0; i < _worklist.length(); i++) {
1999 const Node* n = _worklist.at(i);
2000 Info* info = find_info(n);
2001 info->set_mark();
2002 }
2003 }
2004
2005 // traverse backward from target, along edges found in BFS
2006 void PrintBFS::select_all_paths() {
2007 int pos = 0;
2008 GrowableArray<const Node*> backtrace;
2009 // start from target
2010 backtrace.push(_target);
2011 find_info(_target)->set_mark();
2012 // traverse backward
2013 while (pos < backtrace.length()) {
2014 const Node* n = backtrace.at(pos++);
2015 Info* info = find_info(n);
2016 for (int i = 0; i < info->edge_bwd.length(); i++) {
2017 // all backward edges
2018 const Node* back = info->edge_bwd.at(i);
2019 Info* back_info = find_info(back);
2020 if (!back_info->is_marked()) {
2021 // not yet found this on way back.
2022 back_info->set_distance_from_target(info->distance_from_target() + 1);
2023 if (back_info->distance_from_target() + back_info->distance() <= _max_distance) {
2024 // total distance is small enough
2025 back_info->set_mark();
2026 backtrace.push(back);
2027 }
2028 }
2029 }
2030 }
2031 }
2032
2033 void PrintBFS::select_shortest_path() {
2034 const Node* current = _target;
2035 while (true) {
2036 Info* info = find_info(current);
2037 info->set_mark();
2038 if (current == _start) {
2039 break;
2040 }
2041 // first edge -> leads us one step closer to _start
2042 current = info->edge_bwd.at(0);
2043 }
2044 }
2045
2046 // go through worklist in desired order, put the marked ones in print list
2047 void PrintBFS::sort() {
2048 if (_traverse_inputs && !_traverse_outputs) {
2049 // reverse order
2050 for (int i = _worklist.length() - 1; i >= 0; i--) {
2051 const Node* n = _worklist.at(i);
2052 Info* info = find_info(n);
2053 if (info->is_marked()) {
2054 _print_list.push(n);
2055 }
2056 }
2057 } else {
2058 // same order as worklist
2059 for (int i = 0; i < _worklist.length(); i++) {
2060 const Node* n = _worklist.at(i);
2061 Info* info = find_info(n);
2062 if (info->is_marked()) {
2063 _print_list.push(n);
2064 }
2065 }
2066 }
2067 if (_sort_idx) {
2068 _print_list.sort(node_idx_cmp);
2069 }
2070 }
2071
2072 // go through printlist and print
2073 void PrintBFS::print() {
2074 if (_print_list.length() > 0 ) {
2075 print_header();
2076 for (int i = 0; i < _print_list.length(); i++) {
2077 const Node* n = _print_list.at(i);
2078 print_node(n);
2079 }
2080 if (_print_igv) {
2081 Compile* C = Compile::current();
2082 C->init_igv();
2083 C->igv_print_graph_to_network(nullptr, _print_list, _frame);
2084 }
2085 } else {
2086 _output->print_cr("No nodes to print.");
2087 }
2088 }
2089
2090 void PrintBFS::print_options_help(bool print_examples) {
2091 _output->print_cr("Usage: node->dump_bfs(int max_distance, Node* target, char* options)");
2092 _output->print_cr("");
2093 _output->print_cr("Use cases:");
2094 _output->print_cr(" BFS traversal: no target required");
2095 _output->print_cr(" shortest path: set target");
2096 _output->print_cr(" all paths: set target and put 'A' in options");
2097 _output->print_cr(" detect loop: subcase of all paths, have start==target");
2098 _output->print_cr("");
2099 _output->print_cr("Arguments:");
2100 _output->print_cr(" this/start: staring point of BFS");
2101 _output->print_cr(" target:");
2102 _output->print_cr(" if null: simple BFS");
2103 _output->print_cr(" else: shortest path or all paths between this/start and target");
2104 _output->print_cr(" options:");
2105 _output->print_cr(" if null: same as \"cdmox@B\"");
2106 _output->print_cr(" else: use combination of following characters");
2107 _output->print_cr(" h: display this help info");
2108 _output->print_cr(" H: display this help info, with examples");
2109 _output->print_cr(" +: traverse in-edges (on if neither + nor -)");
2110 _output->print_cr(" -: traverse out-edges");
2111 _output->print_cr(" c: visit control nodes");
2112 _output->print_cr(" d: visit data nodes");
2113 _output->print_cr(" m: visit memory nodes");
2114 _output->print_cr(" o: visit other nodes");
2115 _output->print_cr(" x: visit mixed nodes");
2116 _output->print_cr(" C: boundary control nodes");
2117 _output->print_cr(" D: boundary data nodes");
2118 _output->print_cr(" M: boundary memory nodes");
2119 _output->print_cr(" O: boundary other nodes");
2120 _output->print_cr(" X: boundary mixed nodes");
2121 _output->print_cr(" #: display node category in color (not supported in all terminals)");
2122 _output->print_cr(" S: sort displayed nodes by node idx");
2123 _output->print_cr(" A: all paths (not just shortest path to target)");
2124 _output->print_cr(" @: print old nodes - before matching (if available)");
2125 _output->print_cr(" B: print scheduling blocks (if available)");
2126 _output->print_cr(" $: dump only, no header, no other columns");
2127 _output->print_cr(" !: show nodes on IGV (sent over network stream)");
2128 _output->print_cr(" (use preferably with dump_bfs(int, Node*, char*, void*, void*, void*)");
2129 _output->print_cr(" to produce a C2 stack trace along with the graph dump, see examples below)");
2130 _output->print_cr("");
2131 _output->print_cr("recursively follow edges to nodes with permitted visit types,");
2132 _output->print_cr("on the boundary additionally display nodes allowed in boundary types");
2133 _output->print_cr("Note: the categories can be overlapping. For example a mixed node");
2134 _output->print_cr(" can contain control and memory output. Some from the other");
2135 _output->print_cr(" category are also control (Halt, Return, etc).");
2136 _output->print_cr("");
2137 _output->print_cr("output columns:");
2138 _output->print_cr(" dist: BFS distance to this/start");
2139 _output->print_cr(" apd: all paths distance (d_outputart + d_target)");
2140 _output->print_cr(" block: block identifier, based on _pre_order");
2141 _output->print_cr(" head: first node in block");
2142 _output->print_cr(" idom: head node of idom block");
2143 _output->print_cr(" depth: depth of block (_dom_depth)");
2144 _output->print_cr(" old: old IR node - before matching");
2145 _output->print_cr(" dump: node->dump()");
2146 _output->print_cr("");
2147 _output->print_cr("Note: if none of the \"cmdxo\" characters are in the options string");
2148 _output->print_cr(" then we set all of them.");
2149 _output->print_cr(" This allows for short strings like \"#\" for colored input traversal");
2150 _output->print_cr(" or \"-#\" for colored output traversal.");
2151 if (print_examples) {
2152 _output->print_cr("");
2153 _output->print_cr("Examples:");
2154 _output->print_cr(" if->dump_bfs(10, 0, \"+cxo\")");
2155 _output->print_cr(" starting at some if node, traverse inputs recursively");
2156 _output->print_cr(" only along control (mixed and other can also be control)");
2157 _output->print_cr(" phi->dump_bfs(5, 0, \"-dxo\")");
2158 _output->print_cr(" starting at phi node, traverse outputs recursively");
2159 _output->print_cr(" only along data (mixed and other can also have data flow)");
2160 _output->print_cr(" find_node(385)->dump_bfs(3, 0, \"cdmox+#@B\")");
2161 _output->print_cr(" find inputs of node 385, up to 3 nodes up (+)");
2162 _output->print_cr(" traverse all nodes (cdmox), use colors (#)");
2163 _output->print_cr(" display old nodes and blocks, if they exist");
2164 _output->print_cr(" useful call to start with");
2165 _output->print_cr(" find_node(102)->dump_bfs(10, 0, \"dCDMOX-\")");
2166 _output->print_cr(" find non-data dependencies of a data node");
2167 _output->print_cr(" follow data node outputs until we find another category");
2168 _output->print_cr(" node as the boundary");
2169 _output->print_cr(" x->dump_bfs(10, y, 0)");
2170 _output->print_cr(" find shortest path from x to y, along any edge or node");
2171 _output->print_cr(" will not find a path if it is longer than 10");
2172 _output->print_cr(" useful to find how x and y are related");
2173 _output->print_cr(" find_node(741)->dump_bfs(20, find_node(746), \"c+\")");
2174 _output->print_cr(" find shortest control path between two nodes");
2175 _output->print_cr(" find_node(741)->dump_bfs(8, find_node(746), \"cdmox+A\")");
2176 _output->print_cr(" find all paths (A) between two nodes of length at most 8");
2177 _output->print_cr(" find_node(741)->dump_bfs(7, find_node(741), \"c+A\")");
2178 _output->print_cr(" find all control loops for this node");
2179 _output->print_cr(" find_node(741)->dump_bfs(7, find_node(741), \"c+A!\", $sp, $fp, $pc)");
2180 _output->print_cr(" same as above, but printing the resulting subgraph");
2181 _output->print_cr(" along with a C2 stack trace on IGV");
2182 }
2183 }
2184
2185 bool PrintBFS::parse_options() {
2186 if (_options == nullptr) {
2187 _options = "cdmox@B"; // default options
2188 }
2189 size_t len = strlen(_options);
2190 for (size_t i = 0; i < len; i++) {
2191 switch (_options[i]) {
2192 case '+':
2193 _traverse_inputs = true;
2194 break;
2195 case '-':
2196 _traverse_outputs = true;
2197 break;
2198 case 'c':
2199 _filter_visit._control = true;
2200 break;
2201 case 'm':
2202 _filter_visit._memory = true;
2203 break;
2204 case 'd':
2205 _filter_visit._data = true;
2206 break;
2207 case 'x':
2208 _filter_visit._mixed = true;
2209 break;
2210 case 'o':
2211 _filter_visit._other = true;
2212 break;
2213 case 'C':
2214 _filter_boundary._control = true;
2215 break;
2216 case 'M':
2217 _filter_boundary._memory = true;
2218 break;
2219 case 'D':
2220 _filter_boundary._data = true;
2221 break;
2222 case 'X':
2223 _filter_boundary._mixed = true;
2224 break;
2225 case 'O':
2226 _filter_boundary._other = true;
2227 break;
2228 case 'S':
2229 _sort_idx = true;
2230 break;
2231 case 'A':
2232 _all_paths = true;
2233 break;
2234 case '#':
2235 _use_color = true;
2236 break;
2237 case 'B':
2238 _print_blocks = true;
2239 break;
2240 case '@':
2241 _print_old = true;
2242 break;
2243 case '$':
2244 _dump_only = true;
2245 break;
2246 case '!':
2247 _print_igv = true;
2248 break;
2249 case 'h':
2250 print_options_help(false);
2251 return false;
2252 case 'H':
2253 print_options_help(true);
2254 return false;
2255 default:
2256 _output->print_cr("dump_bfs: Unrecognized option \'%c\'", _options[i]);
2257 _output->print_cr("for help, run: find_node(0)->dump_bfs(0,0,\"H\")");
2258 return false;
2259 }
2260 }
2261 if (!_traverse_inputs && !_traverse_outputs) {
2262 _traverse_inputs = true;
2263 }
2264 if (_filter_visit.is_empty()) {
2265 _filter_visit.set_all();
2266 }
2267 Compile* C = Compile::current();
2268 _print_old &= (C->matcher() != nullptr); // only show old if there are new
2269 _print_blocks &= (C->cfg() != nullptr); // only show blocks if available
2270 return true;
2271 }
2272
2273 void PrintBFS::DumpConfigColored::pre_dump(outputStream* st, const Node* n) {
2274 if (!_bfs->_use_color) {
2275 return;
2276 }
2277 Info* info = _bfs->find_info(n);
2278 if (info == nullptr || !info->is_marked()) {
2279 return;
2280 }
2281
2282 const Type* t = n->bottom_type();
2283 switch (t->category()) {
2284 case Type::Category::Data:
2285 st->print("\u001b[34m");
2286 break;
2287 case Type::Category::Memory:
2288 st->print("\u001b[32m");
2289 break;
2290 case Type::Category::Mixed:
2291 st->print("\u001b[35m");
2292 break;
2293 case Type::Category::Control:
2294 st->print("\u001b[31m");
2295 break;
2296 case Type::Category::Other:
2297 st->print("\u001b[33m");
2298 break;
2299 case Type::Category::Undef:
2300 n->dump();
2301 assert(false, "category undef ??");
2302 break;
2303 default:
2304 n->dump();
2305 assert(false, "not covered");
2306 break;
2307 }
2308 }
2309
2310 void PrintBFS::DumpConfigColored::post_dump(outputStream* st) {
2311 if (!_bfs->_use_color) {
2312 return;
2313 }
2314 st->print("\u001b[0m"); // white
2315 }
2316
2317 Node* PrintBFS::old_node(const Node* n) {
2318 Compile* C = Compile::current();
2319 if (C->matcher() == nullptr || !C->node_arena()->contains(n)) {
2320 return (Node*)nullptr;
2321 } else {
2322 return C->matcher()->find_old_node(n);
2323 }
2324 }
2325
2326 void PrintBFS::print_node_idx(const Node* n) {
2327 Compile* C = Compile::current();
2328 char buf[30];
2329 if (n == nullptr) {
2330 os::snprintf_checked(buf, sizeof(buf), "_"); // null
2331 } else if (C->node_arena()->contains(n)) {
2332 os::snprintf_checked(buf, sizeof(buf), "%d", n->_idx); // new node
2333 } else {
2334 os::snprintf_checked(buf, sizeof(buf), "o%d", n->_idx); // old node
2335 }
2336 _output->print("%6s", buf);
2337 }
2338
2339 void PrintBFS::print_block_id(const Block* b) {
2340 Compile* C = Compile::current();
2341 char buf[30];
2342 os::snprintf_checked(buf, sizeof(buf), "B%d", b->_pre_order);
2343 _output->print("%7s", buf);
2344 }
2345
2346 void PrintBFS::print_node_block(const Node* n) {
2347 Compile* C = Compile::current();
2348 Block* b = C->node_arena()->contains(n)
2349 ? C->cfg()->get_block_for_node(n)
2350 : nullptr; // guard against old nodes
2351 if (b == nullptr) {
2352 _output->print(" _"); // Block
2353 _output->print(" _"); // head
2354 _output->print(" _"); // idom
2355 _output->print(" _"); // depth
2356 } else {
2357 print_block_id(b);
2358 print_node_idx(b->head());
2359 if (b->_idom) {
2360 print_node_idx(b->_idom->head());
2361 } else {
2362 _output->print(" _"); // idom
2363 }
2364 _output->print("%6d ", b->_dom_depth);
2365 }
2366 }
2367
2368 // filter, and add to worklist, add info, note traversal edges
2369 void PrintBFS::maybe_traverse(const Node* src, const Node* dst) {
2370 if (dst != nullptr &&
2371 (_filter_visit.accepts(dst) ||
2372 _filter_boundary.accepts(dst) ||
2373 dst == _start)) { // correct category or start?
2374 if (find_info(dst) == nullptr) {
2375 // never visited - set up info
2376 _worklist.push(dst);
2377 int d = 0;
2378 if (dst != _start) {
2379 d = find_info(src)->distance() + 1;
2380 }
2381 make_info(dst, d);
2382 }
2383 if (src != dst) {
2384 // traversal edges useful during select
2385 find_info(dst)->edge_bwd.push(src);
2386 }
2387 }
2388 }
2389
2390 void PrintBFS::print_header() const {
2391 if (_dump_only) {
2392 return; // no header in dump only mode
2393 }
2394 _output->print("dist"); // distance
2395 if (_all_paths) {
2396 _output->print(" apd"); // all paths distance
2397 }
2398 if (_print_blocks) {
2399 _output->print(" [block head idom depth]"); // block
2400 }
2401 if (_print_old) {
2402 _output->print(" old"); // old node
2403 }
2404 _output->print(" dump\n"); // node dump
2405 _output->print_cr("---------------------------------------------");
2406 }
2407
2408 void PrintBFS::print_node(const Node* n) {
2409 if (_dump_only) {
2410 n->dump("\n", false, _output, &_dcc);
2411 return;
2412 }
2413 _output->print("%4d", find_info(n)->distance());// distance
2414 if (_all_paths) {
2415 Info* info = find_info(n);
2416 int apd = info->distance() + info->distance_from_target();
2417 _output->print("%4d", apd); // all paths distance
2418 }
2419 if (_print_blocks) {
2420 print_node_block(n); // block
2421 }
2422 if (_print_old) {
2423 print_node_idx(old_node(n)); // old node
2424 }
2425 _output->print(" ");
2426 n->dump("\n", false, _output, &_dcc); // node dump
2427 }
2428
2429 //------------------------------dump_bfs--------------------------------------
2430 // Call this from debugger
2431 // Useful for BFS traversal, shortest path, all path, loop detection, etc
2432 // Designed to be more readable, and provide additional info
2433 // To find all options, run:
2434 // find_node(0)->dump_bfs(0,0,"H")
2435 void Node::dump_bfs(const int max_distance, Node* target, const char* options) const {
2436 dump_bfs(max_distance, target, options, tty);
2437 }
2438
2439 // Used to dump to stream.
2440 void Node::dump_bfs(const int max_distance, Node* target, const char* options, outputStream* st, const frame* fr) const {
2441 PrintBFS bfs(this, max_distance, target, options, st, fr);
2442 bfs.run();
2443 }
2444
2445 // Call this from debugger, with default arguments
2446 void Node::dump_bfs(const int max_distance) const {
2447 dump_bfs(max_distance, nullptr, nullptr);
2448 }
2449
2450 // Call this from debugger, with stack handling register arguments for IGV dumps.
2451 // Example: p find_node(741)->dump_bfs(7, find_node(741), "c+A!", $sp, $fp, $pc).
2452 void Node::dump_bfs(const int max_distance, Node* target, const char* options, void* sp, void* fp, void* pc) const {
2453 frame fr(sp, fp, pc);
2454 dump_bfs(max_distance, target, options, tty, &fr);
2455 }
2456
2457 // -----------------------------dump_idx---------------------------------------
2458 void Node::dump_idx(bool align, outputStream* st, DumpConfig* dc) const {
2459 if (dc != nullptr) {
2460 dc->pre_dump(st, this);
2461 }
2462 Compile* C = Compile::current();
2463 bool is_new = C->node_arena()->contains(this);
2464 if (align) { // print prefix empty spaces$
2465 // +1 for leading digit, +1 for "o"
2466 uint max_width = (C->unique() == 0 ? 0 : static_cast<uint>(log10(static_cast<double>(C->unique())))) + 2;
2467 // +1 for leading digit, maybe +1 for "o"
2468 uint width = (_idx == 0 ? 0 : static_cast<uint>(log10(static_cast<double>(_idx)))) + 1 + (is_new ? 0 : 1);
2469 while (max_width > width) {
2470 st->print(" ");
2471 width++;
2472 }
2473 }
2474 if (!is_new) {
2475 st->print("o");
2476 }
2477 st->print("%d", _idx);
2478 if (dc != nullptr) {
2479 dc->post_dump(st);
2480 }
2481 }
2482
2483 // -----------------------------dump_name--------------------------------------
2484 void Node::dump_name(outputStream* st, DumpConfig* dc) const {
2485 if (dc != nullptr) {
2486 dc->pre_dump(st, this);
2487 }
2488 st->print("%s", Name());
2489 if (dc != nullptr) {
2490 dc->post_dump(st);
2491 }
2492 }
2493
2494 // -----------------------------Name-------------------------------------------
2495 extern const char *NodeClassNames[];
2496 const char *Node::Name() const { return NodeClassNames[Opcode()]; }
2497
2498 static bool is_disconnected(const Node* n) {
2499 for (uint i = 0; i < n->req(); i++) {
2500 if (n->in(i) != nullptr) return false;
2501 }
2502 return true;
2503 }
2504
2505 #ifdef ASSERT
2506 void Node::dump_orig(outputStream *st, bool print_key) const {
2507 Compile* C = Compile::current();
2508 Node* orig = _debug_orig;
2509 if (not_a_node(orig)) orig = nullptr;
2510 if (orig != nullptr && !C->node_arena()->contains(orig)) orig = nullptr;
2511 if (orig == nullptr) return;
2512 if (print_key) {
2513 st->print(" !orig=");
2514 }
2515 Node* fast = orig->debug_orig(); // tortoise & hare algorithm to detect loops
2516 if (not_a_node(fast)) fast = nullptr;
2517 while (orig != nullptr) {
2518 bool discon = is_disconnected(orig); // if discon, print [123] else 123
2519 if (discon) st->print("[");
2520 if (!Compile::current()->node_arena()->contains(orig))
2521 st->print("o");
2522 st->print("%d", orig->_idx);
2523 if (discon) st->print("]");
2524 orig = orig->debug_orig();
2525 if (not_a_node(orig)) orig = nullptr;
2526 if (orig != nullptr && !C->node_arena()->contains(orig)) orig = nullptr;
2527 if (orig != nullptr) st->print(",");
2528 if (fast != nullptr) {
2529 // Step fast twice for each single step of orig:
2530 fast = fast->debug_orig();
2531 if (not_a_node(fast)) fast = nullptr;
2532 if (fast != nullptr && fast != orig) {
2533 fast = fast->debug_orig();
2534 if (not_a_node(fast)) fast = nullptr;
2535 }
2536 if (fast == orig) {
2537 st->print("...");
2538 break;
2539 }
2540 }
2541 }
2542 }
2543
2544 void Node::set_debug_orig(Node* orig) {
2545 _debug_orig = orig;
2546 if (BreakAtNode == 0) return;
2547 if (not_a_node(orig)) orig = nullptr;
2548 int trip = 10;
2549 while (orig != nullptr) {
2550 if (orig->debug_idx() == BreakAtNode || (uintx)orig->_idx == BreakAtNode) {
2551 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=" UINT64_FORMAT " orig._idx=%d orig._debug_idx=" UINT64_FORMAT,
2552 this->_idx, this->debug_idx(), orig->_idx, orig->debug_idx());
2553 BREAKPOINT;
2554 }
2555 orig = orig->debug_orig();
2556 if (not_a_node(orig)) orig = nullptr;
2557 if (trip-- <= 0) break;
2558 }
2559 }
2560 #endif //ASSERT
2561
2562 //------------------------------dump------------------------------------------
2563 // Dump a Node
2564 void Node::dump(const char* suffix, bool mark, outputStream* st, DumpConfig* dc) const {
2565 Compile* C = Compile::current();
2566 bool is_new = C->node_arena()->contains(this);
2567 C->_in_dump_cnt++;
2568
2569 // idx mark name ===
2570 dump_idx(true, st, dc);
2571 st->print(mark ? " >" : " ");
2572 dump_name(st, dc);
2573 st->print(" === ");
2574
2575 // Dump the required and precedence inputs
2576 dump_req(st, dc);
2577 dump_prec(st, dc);
2578 // Dump the outputs
2579 dump_out(st, dc);
2580
2581 if (is_disconnected(this)) {
2582 #ifdef ASSERT
2583 st->print(" [" UINT64_FORMAT "]", debug_idx());
2584 dump_orig(st);
2585 #endif
2586 st->cr();
2587 C->_in_dump_cnt--;
2588 return; // don't process dead nodes
2589 }
2590
2591 if (C->clone_map().value(_idx) != 0) {
2592 C->clone_map().dump(_idx, st);
2593 }
2594 // Dump node-specific info
2595 dump_spec(st);
2596 #ifdef ASSERT
2597 // Dump the non-reset _debug_idx
2598 if (Verbose && WizardMode) {
2599 st->print(" [" UINT64_FORMAT "]", debug_idx());
2600 }
2601 #endif
2602
2603 const Type *t = bottom_type();
2604
2605 if (t != nullptr && (t->isa_instptr() || t->isa_instklassptr())) {
2606 const TypeInstPtr *toop = t->isa_instptr();
2607 const TypeInstKlassPtr *tkls = t->isa_instklassptr();
2608 if (toop) {
2609 st->print(" Oop:");
2610 } else if (tkls) {
2611 st->print(" Klass:");
2612 }
2613 t->dump_on(st);
2614 } else if (t == Type::MEMORY) {
2615 st->print(" Memory:");
2616 MemNode::dump_adr_type(adr_type(), st);
2617 } else if (Verbose || WizardMode) {
2618 st->print(" Type:");
2619 if (t) {
2620 t->dump_on(st);
2621 } else {
2622 st->print("no type");
2623 }
2624 } else if (t->isa_vect() && this->is_MachSpillCopy()) {
2625 // Dump MachSpillcopy vector type.
2626 t->dump_on(st);
2627 }
2628 if (is_new) {
2629 DEBUG_ONLY(dump_orig(st));
2630 Node_Notes* nn = C->node_notes_at(_idx);
2631 if (nn != nullptr && !nn->is_clear()) {
2632 if (nn->jvms() != nullptr) {
2633 st->print(" !jvms:");
2634 nn->jvms()->dump_spec(st);
2635 }
2636 }
2637 }
2638 if (suffix) st->print("%s", suffix);
2639 C->_in_dump_cnt--;
2640 }
2641
2642 // call from debugger: dump node to tty with newline
2643 void Node::dump() const {
2644 dump("\n");
2645 }
2646
2647 //------------------------------dump_req--------------------------------------
2648 void Node::dump_req(outputStream* st, DumpConfig* dc) const {
2649 // Dump the required input edges
2650 for (uint i = 0; i < req(); i++) { // For all required inputs
2651 Node* d = in(i);
2652 if (d == nullptr) {
2653 st->print("_ ");
2654 } else if (not_a_node(d)) {
2655 st->print("not_a_node "); // uninitialized, sentinel, garbage, etc.
2656 } else {
2657 d->dump_idx(false, st, dc);
2658 st->print(" ");
2659 }
2660 }
2661 }
2662
2663
2664 //------------------------------dump_prec-------------------------------------
2665 void Node::dump_prec(outputStream* st, DumpConfig* dc) const {
2666 // Dump the precedence edges
2667 int any_prec = 0;
2668 for (uint i = req(); i < len(); i++) { // For all precedence inputs
2669 Node* p = in(i);
2670 if (p != nullptr) {
2671 if (!any_prec++) st->print(" |");
2672 if (not_a_node(p)) { st->print("not_a_node "); continue; }
2673 p->dump_idx(false, st, dc);
2674 st->print(" ");
2675 }
2676 }
2677 }
2678
2679 //------------------------------dump_out--------------------------------------
2680 void Node::dump_out(outputStream* st, DumpConfig* dc) const {
2681 // Delimit the output edges
2682 st->print(" [[ ");
2683 // Dump the output edges
2684 for (uint i = 0; i < _outcnt; i++) { // For all outputs
2685 Node* u = _out[i];
2686 if (u == nullptr) {
2687 st->print("_ ");
2688 } else if (not_a_node(u)) {
2689 st->print("not_a_node ");
2690 } else {
2691 u->dump_idx(false, st, dc);
2692 st->print(" ");
2693 }
2694 }
2695 st->print("]] ");
2696 }
2697
2698 //------------------------------dump-------------------------------------------
2699 // call from debugger: dump Node's inputs (or outputs if d negative)
2700 void Node::dump(int d) const {
2701 dump_bfs(abs(d), nullptr, (d > 0) ? "+$" : "-$");
2702 }
2703
2704 //------------------------------dump_ctrl--------------------------------------
2705 // call from debugger: dump Node's control inputs (or outputs if d negative)
2706 void Node::dump_ctrl(int d) const {
2707 dump_bfs(abs(d), nullptr, (d > 0) ? "+$c" : "-$c");
2708 }
2709
2710 //-----------------------------dump_compact------------------------------------
2711 void Node::dump_comp() const {
2712 this->dump_comp("\n");
2713 }
2714
2715 //-----------------------------dump_compact------------------------------------
2716 // Dump a Node in compact representation, i.e., just print its name and index.
2717 // Nodes can specify additional specifics to print in compact representation by
2718 // implementing dump_compact_spec.
2719 void Node::dump_comp(const char* suffix, outputStream *st) const {
2720 Compile* C = Compile::current();
2721 C->_in_dump_cnt++;
2722 st->print("%s(%d)", Name(), _idx);
2723 this->dump_compact_spec(st);
2724 if (suffix) {
2725 st->print("%s", suffix);
2726 }
2727 C->_in_dump_cnt--;
2728 }
2729
2730 // VERIFICATION CODE
2731 // Verify all nodes if verify_depth is negative
2732 void Node::verify(int verify_depth, VectorSet& visited, Node_List& worklist) {
2733 assert(verify_depth != 0, "depth should not be 0");
2734 Compile* C = Compile::current();
2735 uint last_index_on_current_depth = worklist.size() - 1;
2736 verify_depth--; // Visiting the first node on depth 1
2737 // Only add nodes to worklist if verify_depth is negative (visit all nodes) or greater than 0
2738 bool add_to_worklist = verify_depth != 0;
2739
2740 for (uint list_index = 0; list_index < worklist.size(); list_index++) {
2741 Node* n = worklist[list_index];
2742
2743 if (n->is_Con() && n->bottom_type() == Type::TOP) {
2744 if (C->cached_top_node() == nullptr) {
2745 C->set_cached_top_node((Node*)n);
2746 }
2747 assert(C->cached_top_node() == n, "TOP node must be unique");
2748 }
2749
2750 uint in_len = n->len();
2751 for (uint i = 0; i < in_len; i++) {
2752 Node* x = n->_in[i];
2753 if (!x || x->is_top()) {
2754 continue;
2755 }
2756
2757 // Verify my input has a def-use edge to me
2758 // Count use-def edges from n to x
2759 int cnt = 1;
2760 for (uint j = 0; j < i; j++) {
2761 if (n->_in[j] == x) {
2762 cnt++;
2763 break;
2764 }
2765 }
2766 if (cnt == 2) {
2767 // x is already checked as n's previous input, skip its duplicated def-use count checking
2768 continue;
2769 }
2770 for (uint j = i + 1; j < in_len; j++) {
2771 if (n->_in[j] == x) {
2772 cnt++;
2773 }
2774 }
2775
2776 // Count def-use edges from x to n
2777 uint max = x->_outcnt;
2778 for (uint k = 0; k < max; k++) {
2779 if (x->_out[k] == n) {
2780 cnt--;
2781 }
2782 }
2783 assert(cnt == 0, "mismatched def-use edge counts");
2784
2785 if (add_to_worklist && !visited.test_set(x->_idx)) {
2786 worklist.push(x);
2787 }
2788 }
2789
2790 if (verify_depth > 0 && list_index == last_index_on_current_depth) {
2791 // All nodes on this depth were processed and its inputs are on the worklist. Decrement verify_depth and
2792 // store the current last list index which is the last node in the list with the new depth. All nodes
2793 // added afterwards will have a new depth again. Stop adding new nodes if depth limit is reached (=0).
2794 verify_depth--;
2795 if (verify_depth == 0) {
2796 add_to_worklist = false;
2797 }
2798 last_index_on_current_depth = worklist.size() - 1;
2799 }
2800 }
2801 }
2802 #endif // not PRODUCT
2803
2804 //------------------------------Registers--------------------------------------
2805 // Do we Match on this edge index or not? Generally false for Control
2806 // and true for everything else. Weird for calls & returns.
2807 uint Node::match_edge(uint idx) const {
2808 return idx; // True for other than index 0 (control)
2809 }
2810
2811 // Register classes are defined for specific machines
2812 const RegMask &Node::out_RegMask() const {
2813 ShouldNotCallThis();
2814 return RegMask::EMPTY;
2815 }
2816
2817 const RegMask &Node::in_RegMask(uint) const {
2818 ShouldNotCallThis();
2819 return RegMask::EMPTY;
2820 }
2821
2822 void Node_Array::grow(uint i) {
2823 assert(i >= _max, "Should have been checked before, use maybe_grow?");
2824 assert(_max > 0, "invariant");
2825 uint old = _max;
2826 _max = next_power_of_2(i);
2827 _nodes = (Node**)_a->Arealloc( _nodes, old*sizeof(Node*),_max*sizeof(Node*));
2828 Copy::zero_to_bytes( &_nodes[old], (_max-old)*sizeof(Node*) );
2829 }
2830
2831 void Node_Array::insert(uint i, Node* n) {
2832 if (_nodes[_max - 1]) {
2833 grow(_max);
2834 }
2835 Copy::conjoint_words_to_higher((HeapWord*)&_nodes[i], (HeapWord*)&_nodes[i + 1], ((_max - i - 1) * sizeof(Node*)));
2836 _nodes[i] = n;
2837 }
2838
2839 void Node_Array::remove(uint i) {
2840 Copy::conjoint_words_to_lower((HeapWord*)&_nodes[i + 1], (HeapWord*)&_nodes[i], ((_max - i - 1) * sizeof(Node*)));
2841 _nodes[_max - 1] = nullptr;
2842 }
2843
2844 void Node_Array::dump() const {
2845 #ifndef PRODUCT
2846 for (uint i = 0; i < _max; i++) {
2847 Node* nn = _nodes[i];
2848 if (nn != nullptr) {
2849 tty->print("%5d--> ",i); nn->dump();
2850 }
2851 }
2852 #endif
2853 }
2854
2855 //--------------------------is_iteratively_computed------------------------------
2856 // Operation appears to be iteratively computed (such as an induction variable)
2857 // It is possible for this operation to return false for a loop-varying
2858 // value, if it appears (by local graph inspection) to be computed by a simple conditional.
2859 bool Node::is_iteratively_computed() {
2860 if (ideal_reg()) { // does operation have a result register?
2861 for (uint i = 1; i < req(); i++) {
2862 Node* n = in(i);
2863 if (n != nullptr && n->is_Phi()) {
2864 for (uint j = 1; j < n->req(); j++) {
2865 if (n->in(j) == this) {
2866 return true;
2867 }
2868 }
2869 }
2870 }
2871 }
2872 return false;
2873 }
2874
2875 //--------------------------find_similar------------------------------
2876 // Return a node with opcode "opc" and same inputs as "this" if one can
2877 // be found; Otherwise return null;
2878 Node* Node::find_similar(int opc) {
2879 if (req() >= 2) {
2880 Node* def = in(1);
2881 if (def && def->outcnt() >= 2) {
2882 for (DUIterator_Fast dmax, i = def->fast_outs(dmax); i < dmax; i++) {
2883 Node* use = def->fast_out(i);
2884 if (use != this &&
2885 use->Opcode() == opc &&
2886 use->req() == req() &&
2887 has_same_inputs_as(use)) {
2888 return use;
2889 }
2890 }
2891 }
2892 }
2893 return nullptr;
2894 }
2895
2896 bool Node::has_same_inputs_as(const Node* other) const {
2897 assert(req() == other->req(), "should have same number of inputs");
2898 for (uint j = 0; j < other->req(); j++) {
2899 if (in(j) != other->in(j)) {
2900 return false;
2901 }
2902 }
2903 return true;
2904 }
2905
2906 Node* Node::unique_multiple_edges_out_or_null() const {
2907 Node* use = nullptr;
2908 for (DUIterator_Fast kmax, k = fast_outs(kmax); k < kmax; k++) {
2909 Node* u = fast_out(k);
2910 if (use == nullptr) {
2911 use = u; // first use
2912 } else if (u != use) {
2913 return nullptr; // not unique
2914 } else {
2915 // secondary use
2916 }
2917 }
2918 return use;
2919 }
2920
2921 //--------------------------unique_ctrl_out_or_null-------------------------
2922 // Return the unique control out if only one. Null if none or more than one.
2923 Node* Node::unique_ctrl_out_or_null() const {
2924 Node* found = nullptr;
2925 for (uint i = 0; i < outcnt(); i++) {
2926 Node* use = raw_out(i);
2927 if (use->is_CFG() && use != this) {
2928 if (found != nullptr) {
2929 return nullptr;
2930 }
2931 found = use;
2932 }
2933 }
2934 return found;
2935 }
2936
2937 //--------------------------unique_ctrl_out------------------------------
2938 // Return the unique control out. Asserts if none or more than one control out.
2939 Node* Node::unique_ctrl_out() const {
2940 Node* ctrl = unique_ctrl_out_or_null();
2941 assert(ctrl != nullptr, "control out is assumed to be unique");
2942 return ctrl;
2943 }
2944
2945 void Node::ensure_control_or_add_prec(Node* c) {
2946 if (in(0) == nullptr) {
2947 set_req(0, c);
2948 } else if (in(0) != c) {
2949 add_prec(c);
2950 }
2951 }
2952
2953 void Node::add_prec_from(Node* n) {
2954 for (uint i = n->req(); i < n->len(); i++) {
2955 Node* prec = n->in(i);
2956 if (prec != nullptr) {
2957 add_prec(prec);
2958 }
2959 }
2960 }
2961
2962 bool Node::is_dead_loop_safe() const {
2963 if (is_Phi()) {
2964 return true;
2965 }
2966 if (is_Proj() && in(0) == nullptr) {
2967 return true;
2968 }
2969 if ((_flags & (Flag_is_dead_loop_safe | Flag_is_Con)) != 0) {
2970 if (!is_Proj()) {
2971 return true;
2972 }
2973 if (in(0)->is_Allocate()) {
2974 return false;
2975 }
2976 // MemNode::can_see_stored_value() peeks through the boxing call
2977 if (in(0)->is_CallStaticJava() && in(0)->as_CallStaticJava()->is_boxing_method()) {
2978 return false;
2979 }
2980 return true;
2981 }
2982 return false;
2983 }
2984
2985 bool Node::is_div_or_mod(BasicType bt) const { return Opcode() == Op_Div(bt) || Opcode() == Op_Mod(bt) ||
2986 Opcode() == Op_UDiv(bt) || Opcode() == Op_UMod(bt); }
2987
2988 // `maybe_pure_function` is assumed to be the input of `this`. This is a bit redundant,
2989 // but we already have and need maybe_pure_function in all the call sites, so
2990 // it makes it obvious that the `maybe_pure_function` is the same node as in the caller,
2991 // while it takes more thinking to realize that a locally computed in(0) must be equal to
2992 // the local in the caller.
2993 bool Node::is_data_proj_of_pure_function(const Node* maybe_pure_function) const {
2994 return Opcode() == Op_Proj && as_Proj()->_con == TypeFunc::Parms && maybe_pure_function->is_CallLeafPure();
2995 }
2996
2997 //=============================================================================
2998 //------------------------------yank-------------------------------------------
2999 // Find and remove
3000 void Node_List::yank( Node *n ) {
3001 uint i;
3002 for (i = 0; i < _cnt; i++) {
3003 if (_nodes[i] == n) {
3004 break;
3005 }
3006 }
3007
3008 if (i < _cnt) {
3009 _nodes[i] = _nodes[--_cnt];
3010 }
3011 }
3012
3013 //------------------------------dump-------------------------------------------
3014 void Node_List::dump() const {
3015 #ifndef PRODUCT
3016 for (uint i = 0; i < _cnt; i++) {
3017 if (_nodes[i]) {
3018 tty->print("%5d--> ", i);
3019 _nodes[i]->dump();
3020 }
3021 }
3022 #endif
3023 }
3024
3025 void Node_List::dump_simple() const {
3026 #ifndef PRODUCT
3027 for (uint i = 0; i < _cnt; i++) {
3028 if( _nodes[i] ) {
3029 tty->print(" %d", _nodes[i]->_idx);
3030 } else {
3031 tty->print(" null");
3032 }
3033 }
3034 #endif
3035 }
3036
3037 //=============================================================================
3038 //------------------------------remove-----------------------------------------
3039 void Unique_Node_List::remove(Node* n) {
3040 if (_in_worklist.test(n->_idx)) {
3041 for (uint i = 0; i < size(); i++) {
3042 if (_nodes[i] == n) {
3043 map(i, Node_List::pop());
3044 _in_worklist.remove(n->_idx);
3045 return;
3046 }
3047 }
3048 ShouldNotReachHere();
3049 }
3050 }
3051
3052 //-----------------------remove_useless_nodes----------------------------------
3053 // Remove useless nodes from worklist
3054 void Unique_Node_List::remove_useless_nodes(VectorSet &useful) {
3055 for (uint i = 0; i < size(); ++i) {
3056 Node *n = at(i);
3057 assert( n != nullptr, "Did not expect null entries in worklist");
3058 if (!useful.test(n->_idx)) {
3059 _in_worklist.remove(n->_idx);
3060 map(i, Node_List::pop());
3061 --i; // Visit popped node
3062 // If it was last entry, loop terminates since size() was also reduced
3063 }
3064 }
3065 }
3066
3067 //=============================================================================
3068 void Node_Stack::grow() {
3069 size_t old_top = pointer_delta(_inode_top,_inodes,sizeof(INode)); // save _top
3070 size_t old_max = pointer_delta(_inode_max,_inodes,sizeof(INode));
3071 size_t max = old_max << 1; // max * 2
3072 _inodes = REALLOC_ARENA_ARRAY(_a, INode, _inodes, old_max, max);
3073 _inode_max = _inodes + max;
3074 _inode_top = _inodes + old_top; // restore _top
3075 }
3076
3077 // Node_Stack is used to map nodes.
3078 Node* Node_Stack::find(uint idx) const {
3079 uint sz = size();
3080 for (uint i = 0; i < sz; i++) {
3081 if (idx == index_at(i)) {
3082 return node_at(i);
3083 }
3084 }
3085 return nullptr;
3086 }
3087
3088 //=============================================================================
3089 uint TypeNode::size_of() const { return sizeof(*this); }
3090 #ifndef PRODUCT
3091 void TypeNode::dump_spec(outputStream *st) const {
3092 if (!Verbose && !WizardMode) {
3093 // standard dump does this in Verbose and WizardMode
3094 st->print(" #"); _type->dump_on(st);
3095 }
3096 }
3097
3098 void TypeNode::dump_compact_spec(outputStream *st) const {
3099 st->print("#");
3100 _type->dump_on(st);
3101 }
3102 #endif
3103 uint TypeNode::hash() const {
3104 return Node::hash() + _type->hash();
3105 }
3106 bool TypeNode::cmp(const Node& n) const {
3107 return Type::equals(_type, n.as_Type()->_type);
3108 }
3109 const Type* TypeNode::bottom_type() const { return _type; }
3110 const Type* TypeNode::Value(PhaseGVN* phase) const { return _type; }
3111
3112 //------------------------------ideal_reg--------------------------------------
3113 uint TypeNode::ideal_reg() const {
3114 return _type->ideal_reg();
3115 }
3116
3117 void TypeNode::make_path_dead(PhaseIterGVN* igvn, PhaseIdealLoop* loop, Node* ctrl_use, uint j, const char* phase_str) {
3118 Node* c = ctrl_use->in(j);
3119 if (igvn->type(c) != Type::TOP) {
3120 igvn->replace_input_of(ctrl_use, j, igvn->C->top());
3121 create_halt_path(igvn, c, loop, phase_str);
3122 }
3123 }
3124
3125 // This Type node is dead. It could be because the type that it captures and the type of the node computed from its
3126 // inputs do not intersect anymore. That node has some uses along some control flow paths. Those control flow paths must
3127 // be unreachable as using a dead value makes no sense. For the Type node to capture a narrowed down type, some control
3128 // flow construct must guard the Type node (an If node usually). When the Type node becomes dead, the guard usually
3129 // constant folds and the control flow that leads to the Type node becomes unreachable. There are cases where that
3130 // doesn't happen, however. They are handled here by following uses of the Type node until a CFG or a Phi to find dead
3131 // paths. The dead paths are then replaced by a Halt node.
3132 void TypeNode::make_paths_from_here_dead(PhaseIterGVN* igvn, PhaseIdealLoop* loop, const char* phase_str) {
3133 Unique_Node_List wq;
3134 wq.push(this);
3135 for (uint i = 0; i < wq.size(); ++i) {
3136 Node* n = wq.at(i);
3137 for (DUIterator_Fast kmax, k = n->fast_outs(kmax); k < kmax; k++) {
3138 Node* u = n->fast_out(k);
3139 if (u->is_CFG()) {
3140 assert(!u->is_Region(), "Can't reach a Region without going through a Phi");
3141 make_path_dead(igvn, loop, u, 0, phase_str);
3142 } else if (u->is_Phi()) {
3143 Node* r = u->in(0);
3144 assert(r->is_Region() || r->is_top(), "unexpected Phi's control");
3145 if (r->is_Region()) {
3146 for (uint j = 1; j < u->req(); ++j) {
3147 if (u->in(j) == n && r->in(j) != nullptr) {
3148 make_path_dead(igvn, loop, r, j, phase_str);
3149 }
3150 }
3151 }
3152 } else {
3153 wq.push(u);
3154 }
3155 }
3156 }
3157 }
3158
3159 void TypeNode::create_halt_path(PhaseIterGVN* igvn, Node* c, PhaseIdealLoop* loop, const char* phase_str) const {
3160 Node* frame = new ParmNode(igvn->C->start(), TypeFunc::FramePtr);
3161 if (loop == nullptr) {
3162 igvn->register_new_node_with_optimizer(frame);
3163 } else {
3164 loop->register_new_node(frame, igvn->C->start());
3165 }
3166
3167 stringStream ss;
3168 ss.print("dead path discovered by TypeNode during %s", phase_str);
3169
3170 Node* halt = new HaltNode(c, frame, ss.as_string(igvn->C->comp_arena()));
3171 if (loop == nullptr) {
3172 igvn->register_new_node_with_optimizer(halt);
3173 } else {
3174 loop->register_control(halt, loop->ltree_root(), c);
3175 }
3176 igvn->add_input_to(igvn->C->root(), halt);
3177 }
3178
3179 Node* TypeNode::Ideal(PhaseGVN* phase, bool can_reshape) {
3180 if (KillPathsReachableByDeadTypeNode && can_reshape && Value(phase) == Type::TOP) {
3181 PhaseIterGVN* igvn = phase->is_IterGVN();
3182 Node* top = igvn->C->top();
3183 ResourceMark rm;
3184 make_paths_from_here_dead(igvn, nullptr, "igvn");
3185 return top;
3186 }
3187
3188 return Node::Ideal(phase, can_reshape);
3189 }
3190