1 /*
2 * Copyright (c) 1997, 2016, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "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/castnode.hpp"
32 #include "opto/cfgnode.hpp"
33 #include "opto/connode.hpp"
34 #include "opto/loopnode.hpp"
35 #include "opto/machnode.hpp"
36 #include "opto/matcher.hpp"
37 #include "opto/node.hpp"
38 #include "opto/opcodes.hpp"
39 #include "opto/regmask.hpp"
40 #include "opto/type.hpp"
41 #include "utilities/copy.hpp"
42 #include "utilities/macros.hpp"
43
44 class RegMask;
45 // #include "phase.hpp"
46 class PhaseTransform;
47 class PhaseGVN;
48
49 // Arena we are currently building Nodes in
50 const uint Node::NotAMachineReg = 0xffff0000;
51
52 #ifndef PRODUCT
53 extern int nodes_created;
54 #endif
55 #ifdef __clang__
56 #pragma clang diagnostic push
57 #pragma GCC diagnostic ignored "-Wuninitialized"
58 #endif
59
60 #ifdef ASSERT
61
62 //-------------------------- construct_node------------------------------------
63 // Set a breakpoint here to identify where a particular node index is built.
64 void Node::verify_construction() {
65 _debug_orig = NULL;
66 int old_debug_idx = Compile::debug_idx();
67 int new_debug_idx = old_debug_idx+1;
68 if (new_debug_idx > 0) {
69 // Arrange that the lowest five decimal digits of _debug_idx
70 // will repeat those of _idx. In case this is somehow pathological,
71 // we continue to assign negative numbers (!) consecutively.
72 const int mod = 100000;
73 int bump = (int)(_idx - new_debug_idx) % mod;
74 if (bump < 0) bump += mod;
75 assert(bump >= 0 && bump < mod, "");
76 new_debug_idx += bump;
77 }
78 Compile::set_debug_idx(new_debug_idx);
79 set_debug_idx( new_debug_idx );
80 assert(Compile::current()->unique() < (INT_MAX - 1), "Node limit exceeded INT_MAX");
81 assert(Compile::current()->live_nodes() < Compile::current()->max_node_limit(), "Live Node limit exceeded limit");
82 if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (int)_idx == BreakAtNode)) {
83 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d", _idx, _debug_idx);
84 BREAKPOINT;
85 }
86 #if OPTO_DU_ITERATOR_ASSERT
87 _last_del = NULL;
88 _del_tick = 0;
89 #endif
90 _hash_lock = 0;
91 }
92
93
94 // #ifdef ASSERT ...
95
96 #if OPTO_DU_ITERATOR_ASSERT
97 void DUIterator_Common::sample(const Node* node) {
98 _vdui = VerifyDUIterators;
99 _node = node;
100 _outcnt = node->_outcnt;
101 _del_tick = node->_del_tick;
102 _last = NULL;
103 }
104
105 void DUIterator_Common::verify(const Node* node, bool at_end_ok) {
106 assert(_node == node, "consistent iterator source");
107 assert(_del_tick == node->_del_tick, "no unexpected deletions allowed");
108 }
109
110 void DUIterator_Common::verify_resync() {
111 // Ensure that the loop body has just deleted the last guy produced.
112 const Node* node = _node;
113 // Ensure that at least one copy of the last-seen edge was deleted.
114 // Note: It is OK to delete multiple copies of the last-seen edge.
115 // Unfortunately, we have no way to verify that all the deletions delete
116 // that same edge. On this point we must use the Honor System.
117 assert(node->_del_tick >= _del_tick+1, "must have deleted an edge");
118 assert(node->_last_del == _last, "must have deleted the edge just produced");
119 // We liked this deletion, so accept the resulting outcnt and tick.
120 _outcnt = node->_outcnt;
121 _del_tick = node->_del_tick;
122 }
123
124 void DUIterator_Common::reset(const DUIterator_Common& that) {
125 if (this == &that) return; // ignore assignment to self
126 if (!_vdui) {
127 // We need to initialize everything, overwriting garbage values.
128 _last = that._last;
129 _vdui = that._vdui;
130 }
131 // Note: It is legal (though odd) for an iterator over some node x
132 // to be reassigned to iterate over another node y. Some doubly-nested
133 // progress loops depend on being able to do this.
134 const Node* node = that._node;
135 // Re-initialize everything, except _last.
136 _node = node;
137 _outcnt = node->_outcnt;
138 _del_tick = node->_del_tick;
139 }
140
141 void DUIterator::sample(const Node* node) {
142 DUIterator_Common::sample(node); // Initialize the assertion data.
143 _refresh_tick = 0; // No refreshes have happened, as yet.
144 }
145
146 void DUIterator::verify(const Node* node, bool at_end_ok) {
147 DUIterator_Common::verify(node, at_end_ok);
148 assert(_idx < node->_outcnt + (uint)at_end_ok, "idx in range");
149 }
150
151 void DUIterator::verify_increment() {
152 if (_refresh_tick & 1) {
153 // We have refreshed the index during this loop.
154 // Fix up _idx to meet asserts.
155 if (_idx > _outcnt) _idx = _outcnt;
156 }
157 verify(_node, true);
158 }
159
160 void DUIterator::verify_resync() {
161 // Note: We do not assert on _outcnt, because insertions are OK here.
162 DUIterator_Common::verify_resync();
163 // Make sure we are still in sync, possibly with no more out-edges:
164 verify(_node, true);
165 }
166
167 void DUIterator::reset(const DUIterator& that) {
168 if (this == &that) return; // self assignment is always a no-op
169 assert(that._refresh_tick == 0, "assign only the result of Node::outs()");
170 assert(that._idx == 0, "assign only the result of Node::outs()");
171 assert(_idx == that._idx, "already assigned _idx");
172 if (!_vdui) {
173 // We need to initialize everything, overwriting garbage values.
174 sample(that._node);
175 } else {
176 DUIterator_Common::reset(that);
177 if (_refresh_tick & 1) {
178 _refresh_tick++; // Clear the "was refreshed" flag.
179 }
180 assert(_refresh_tick < 2*100000, "DU iteration must converge quickly");
181 }
182 }
183
184 void DUIterator::refresh() {
185 DUIterator_Common::sample(_node); // Re-fetch assertion data.
186 _refresh_tick |= 1; // Set the "was refreshed" flag.
187 }
188
189 void DUIterator::verify_finish() {
190 // If the loop has killed the node, do not require it to re-run.
191 if (_node->_outcnt == 0) _refresh_tick &= ~1;
192 // If this assert triggers, it means that a loop used refresh_out_pos
193 // to re-synch an iteration index, but the loop did not correctly
194 // re-run itself, using a "while (progress)" construct.
195 // This iterator enforces the rule that you must keep trying the loop
196 // until it "runs clean" without any need for refreshing.
197 assert(!(_refresh_tick & 1), "the loop must run once with no refreshing");
198 }
199
200
201 void DUIterator_Fast::verify(const Node* node, bool at_end_ok) {
202 DUIterator_Common::verify(node, at_end_ok);
203 Node** out = node->_out;
204 uint cnt = node->_outcnt;
205 assert(cnt == _outcnt, "no insertions allowed");
206 assert(_outp >= out && _outp <= out + cnt - !at_end_ok, "outp in range");
207 // This last check is carefully designed to work for NO_OUT_ARRAY.
208 }
209
210 void DUIterator_Fast::verify_limit() {
211 const Node* node = _node;
212 verify(node, true);
213 assert(_outp == node->_out + node->_outcnt, "limit still correct");
214 }
215
216 void DUIterator_Fast::verify_resync() {
217 const Node* node = _node;
218 if (_outp == node->_out + _outcnt) {
219 // Note that the limit imax, not the pointer i, gets updated with the
220 // exact count of deletions. (For the pointer it's always "--i".)
221 assert(node->_outcnt+node->_del_tick == _outcnt+_del_tick, "no insertions allowed with deletion(s)");
222 // This is a limit pointer, with a name like "imax".
223 // Fudge the _last field so that the common assert will be happy.
224 _last = (Node*) node->_last_del;
225 DUIterator_Common::verify_resync();
226 } else {
227 assert(node->_outcnt < _outcnt, "no insertions allowed with deletion(s)");
228 // A normal internal pointer.
229 DUIterator_Common::verify_resync();
230 // Make sure we are still in sync, possibly with no more out-edges:
231 verify(node, true);
232 }
233 }
234
235 void DUIterator_Fast::verify_relimit(uint n) {
236 const Node* node = _node;
237 assert((int)n > 0, "use imax -= n only with a positive count");
238 // This must be a limit pointer, with a name like "imax".
239 assert(_outp == node->_out + node->_outcnt, "apply -= only to a limit (imax)");
240 // The reported number of deletions must match what the node saw.
241 assert(node->_del_tick == _del_tick + n, "must have deleted n edges");
242 // Fudge the _last field so that the common assert will be happy.
243 _last = (Node*) node->_last_del;
244 DUIterator_Common::verify_resync();
245 }
246
247 void DUIterator_Fast::reset(const DUIterator_Fast& that) {
248 assert(_outp == that._outp, "already assigned _outp");
249 DUIterator_Common::reset(that);
250 }
251
252 void DUIterator_Last::verify(const Node* node, bool at_end_ok) {
253 // at_end_ok means the _outp is allowed to underflow by 1
254 _outp += at_end_ok;
255 DUIterator_Fast::verify(node, at_end_ok); // check _del_tick, etc.
256 _outp -= at_end_ok;
257 assert(_outp == (node->_out + node->_outcnt) - 1, "pointer must point to end of nodes");
258 }
259
260 void DUIterator_Last::verify_limit() {
261 // Do not require the limit address to be resynched.
262 //verify(node, true);
263 assert(_outp == _node->_out, "limit still correct");
264 }
265
266 void DUIterator_Last::verify_step(uint num_edges) {
267 assert((int)num_edges > 0, "need non-zero edge count for loop progress");
268 _outcnt -= num_edges;
269 _del_tick += num_edges;
270 // Make sure we are still in sync, possibly with no more out-edges:
271 const Node* node = _node;
272 verify(node, true);
273 assert(node->_last_del == _last, "must have deleted the edge just produced");
274 }
275
276 #endif //OPTO_DU_ITERATOR_ASSERT
277
278
279 #endif //ASSERT
280
281
282 // This constant used to initialize _out may be any non-null value.
283 // The value NULL is reserved for the top node only.
284 #define NO_OUT_ARRAY ((Node**)-1)
285
286 // Out-of-line code from node constructors.
287 // Executed only when extra debug info. is being passed around.
288 static void init_node_notes(Compile* C, int idx, Node_Notes* nn) {
289 C->set_node_notes_at(idx, nn);
290 }
291
292 // Shared initialization code.
293 inline int Node::Init(int req) {
294 Compile* C = Compile::current();
295 int idx = C->next_unique();
296
297 // Allocate memory for the necessary number of edges.
298 if (req > 0) {
299 // Allocate space for _in array to have double alignment.
300 _in = (Node **) ((char *) (C->node_arena()->Amalloc_D(req * sizeof(void*))));
301 }
302 // If there are default notes floating around, capture them:
303 Node_Notes* nn = C->default_node_notes();
304 if (nn != NULL) init_node_notes(C, idx, nn);
305
306 // Note: At this point, C is dead,
307 // and we begin to initialize the new Node.
308
309 _cnt = _max = req;
310 _outcnt = _outmax = 0;
311 _class_id = Class_Node;
312 _flags = 0;
313 _out = NO_OUT_ARRAY;
314 return idx;
315 }
316
317 //------------------------------Node-------------------------------------------
318 // Create a Node, with a given number of required edges.
319 Node::Node(uint req)
320 : _idx(Init(req))
321 #ifdef ASSERT
322 , _parse_idx(_idx)
323 #endif
324 {
325 assert( req < Compile::current()->max_node_limit() - NodeLimitFudgeFactor, "Input limit exceeded" );
326 debug_only( verify_construction() );
327 NOT_PRODUCT(nodes_created++);
328 if (req == 0) {
329 _in = NULL;
330 } else {
331 Node** to = _in;
332 for(uint i = 0; i < req; i++) {
333 to[i] = NULL;
334 }
335 }
336 }
337
338 //------------------------------Node-------------------------------------------
339 Node::Node(Node *n0)
340 : _idx(Init(1))
341 #ifdef ASSERT
342 , _parse_idx(_idx)
343 #endif
344 {
345 debug_only( verify_construction() );
346 NOT_PRODUCT(nodes_created++);
347 assert( is_not_dead(n0), "can not use dead node");
348 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this);
349 }
350
351 //------------------------------Node-------------------------------------------
352 Node::Node(Node *n0, Node *n1)
353 : _idx(Init(2))
354 #ifdef ASSERT
355 , _parse_idx(_idx)
356 #endif
357 {
358 debug_only( verify_construction() );
359 NOT_PRODUCT(nodes_created++);
360 assert( is_not_dead(n0), "can not use dead node");
361 assert( is_not_dead(n1), "can not use dead node");
362 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this);
363 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this);
364 }
365
366 //------------------------------Node-------------------------------------------
367 Node::Node(Node *n0, Node *n1, Node *n2)
368 : _idx(Init(3))
369 #ifdef ASSERT
370 , _parse_idx(_idx)
371 #endif
372 {
373 debug_only( verify_construction() );
374 NOT_PRODUCT(nodes_created++);
375 assert( is_not_dead(n0), "can not use dead node");
376 assert( is_not_dead(n1), "can not use dead node");
377 assert( is_not_dead(n2), "can not use dead node");
378 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this);
379 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this);
380 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this);
381 }
382
383 //------------------------------Node-------------------------------------------
384 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3)
385 : _idx(Init(4))
386 #ifdef ASSERT
387 , _parse_idx(_idx)
388 #endif
389 {
390 debug_only( verify_construction() );
391 NOT_PRODUCT(nodes_created++);
392 assert( is_not_dead(n0), "can not use dead node");
393 assert( is_not_dead(n1), "can not use dead node");
394 assert( is_not_dead(n2), "can not use dead node");
395 assert( is_not_dead(n3), "can not use dead node");
396 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this);
397 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this);
398 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this);
399 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this);
400 }
401
402 //------------------------------Node-------------------------------------------
403 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4)
404 : _idx(Init(5))
405 #ifdef ASSERT
406 , _parse_idx(_idx)
407 #endif
408 {
409 debug_only( verify_construction() );
410 NOT_PRODUCT(nodes_created++);
411 assert( is_not_dead(n0), "can not use dead node");
412 assert( is_not_dead(n1), "can not use dead node");
413 assert( is_not_dead(n2), "can not use dead node");
414 assert( is_not_dead(n3), "can not use dead node");
415 assert( is_not_dead(n4), "can not use dead node");
416 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this);
417 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this);
418 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this);
419 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this);
420 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this);
421 }
422
423 //------------------------------Node-------------------------------------------
424 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3,
425 Node *n4, Node *n5)
426 : _idx(Init(6))
427 #ifdef ASSERT
428 , _parse_idx(_idx)
429 #endif
430 {
431 debug_only( verify_construction() );
432 NOT_PRODUCT(nodes_created++);
433 assert( is_not_dead(n0), "can not use dead node");
434 assert( is_not_dead(n1), "can not use dead node");
435 assert( is_not_dead(n2), "can not use dead node");
436 assert( is_not_dead(n3), "can not use dead node");
437 assert( is_not_dead(n4), "can not use dead node");
438 assert( is_not_dead(n5), "can not use dead node");
439 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this);
440 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this);
441 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this);
442 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this);
443 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this);
444 _in[5] = n5; if (n5 != NULL) n5->add_out((Node *)this);
445 }
446
447 //------------------------------Node-------------------------------------------
448 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3,
449 Node *n4, Node *n5, Node *n6)
450 : _idx(Init(7))
451 #ifdef ASSERT
452 , _parse_idx(_idx)
453 #endif
454 {
455 debug_only( verify_construction() );
456 NOT_PRODUCT(nodes_created++);
457 assert( is_not_dead(n0), "can not use dead node");
458 assert( is_not_dead(n1), "can not use dead node");
459 assert( is_not_dead(n2), "can not use dead node");
460 assert( is_not_dead(n3), "can not use dead node");
461 assert( is_not_dead(n4), "can not use dead node");
462 assert( is_not_dead(n5), "can not use dead node");
463 assert( is_not_dead(n6), "can not use dead node");
464 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this);
465 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this);
466 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this);
467 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this);
468 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this);
469 _in[5] = n5; if (n5 != NULL) n5->add_out((Node *)this);
470 _in[6] = n6; if (n6 != NULL) n6->add_out((Node *)this);
471 }
472
473 #ifdef __clang__
474 #pragma clang diagnostic pop
475 #endif
476
477
478 //------------------------------clone------------------------------------------
479 // Clone a Node.
480 Node *Node::clone() const {
481 Compile* C = Compile::current();
482 uint s = size_of(); // Size of inherited Node
483 Node *n = (Node*)C->node_arena()->Amalloc_D(size_of() + _max*sizeof(Node*));
484 Copy::conjoint_words_to_lower((HeapWord*)this, (HeapWord*)n, s);
485 // Set the new input pointer array
486 n->_in = (Node**)(((char*)n)+s);
487 // Cannot share the old output pointer array, so kill it
488 n->_out = NO_OUT_ARRAY;
489 // And reset the counters to 0
490 n->_outcnt = 0;
491 n->_outmax = 0;
492 // Unlock this guy, since he is not in any hash table.
493 debug_only(n->_hash_lock = 0);
494 // Walk the old node's input list to duplicate its edges
495 uint i;
496 for( i = 0; i < len(); i++ ) {
497 Node *x = in(i);
498 n->_in[i] = x;
499 if (x != NULL) x->add_out(n);
500 }
501 if (is_macro())
502 C->add_macro_node(n);
503 if (is_expensive())
504 C->add_expensive_node(n);
505 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
506 bs->register_potential_barrier_node(n);
507 // If the cloned node is a range check dependent CastII, add it to the list.
508 CastIINode* cast = n->isa_CastII();
509 if (cast != NULL && cast->has_range_check()) {
510 C->add_range_check_cast(cast);
511 }
512 if (n->Opcode() == Op_Opaque4) {
513 C->add_opaque4_node(n);
514 }
515
516 n->set_idx(C->next_unique()); // Get new unique index as well
517 debug_only( n->verify_construction() );
518 NOT_PRODUCT(nodes_created++);
519 // Do not patch over the debug_idx of a clone, because it makes it
520 // impossible to break on the clone's moment of creation.
521 //debug_only( n->set_debug_idx( debug_idx() ) );
522
523 C->copy_node_notes_to(n, (Node*) this);
524
525 // MachNode clone
526 uint nopnds;
527 if (this->is_Mach() && (nopnds = this->as_Mach()->num_opnds()) > 0) {
528 MachNode *mach = n->as_Mach();
529 MachNode *mthis = this->as_Mach();
530 // Get address of _opnd_array.
531 // It should be the same offset since it is the clone of this node.
532 MachOper **from = mthis->_opnds;
533 MachOper **to = (MachOper **)((size_t)(&mach->_opnds) +
534 pointer_delta((const void*)from,
535 (const void*)(&mthis->_opnds), 1));
536 mach->_opnds = to;
537 for ( uint i = 0; i < nopnds; ++i ) {
538 to[i] = from[i]->clone();
539 }
540 }
541 // cloning CallNode may need to clone JVMState
542 if (n->is_Call()) {
543 n->as_Call()->clone_jvms(C);
544 }
545 if (n->is_SafePoint()) {
546 n->as_SafePoint()->clone_replaced_nodes();
547 }
548 return n; // Return the clone
549 }
550
551 //---------------------------setup_is_top--------------------------------------
552 // Call this when changing the top node, to reassert the invariants
553 // required by Node::is_top. See Compile::set_cached_top_node.
554 void Node::setup_is_top() {
555 if (this == (Node*)Compile::current()->top()) {
556 // This node has just become top. Kill its out array.
557 _outcnt = _outmax = 0;
558 _out = NULL; // marker value for top
559 assert(is_top(), "must be top");
560 } else {
561 if (_out == NULL) _out = NO_OUT_ARRAY;
562 assert(!is_top(), "must not be top");
563 }
564 }
565
566
567 //------------------------------~Node------------------------------------------
568 // Fancy destructor; eagerly attempt to reclaim Node numberings and storage
569 void Node::destruct() {
570 // Eagerly reclaim unique Node numberings
571 Compile* compile = Compile::current();
572 if ((uint)_idx+1 == compile->unique()) {
573 compile->set_unique(compile->unique()-1);
574 }
575 // Clear debug info:
576 Node_Notes* nn = compile->node_notes_at(_idx);
577 if (nn != NULL) nn->clear();
578 // Walk the input array, freeing the corresponding output edges
579 _cnt = _max; // forget req/prec distinction
580 uint i;
581 for( i = 0; i < _max; i++ ) {
582 set_req(i, NULL);
583 //assert(def->out(def->outcnt()-1) == (Node *)this,"bad def-use hacking in reclaim");
584 }
585 assert(outcnt() == 0, "deleting a node must not leave a dangling use");
586 // See if the input array was allocated just prior to the object
587 int edge_size = _max*sizeof(void*);
588 int out_edge_size = _outmax*sizeof(void*);
589 char *edge_end = ((char*)_in) + edge_size;
590 char *out_array = (char*)(_out == NO_OUT_ARRAY? NULL: _out);
591 int node_size = size_of();
592
593 // Free the output edge array
594 if (out_edge_size > 0) {
595 compile->node_arena()->Afree(out_array, out_edge_size);
596 }
597
598 // Free the input edge array and the node itself
599 if( edge_end == (char*)this ) {
600 // It was; free the input array and object all in one hit
601 #ifndef ASSERT
602 compile->node_arena()->Afree(_in,edge_size+node_size);
603 #endif
604 } else {
605 // Free just the input array
606 compile->node_arena()->Afree(_in,edge_size);
607
608 // Free just the object
609 #ifndef ASSERT
610 compile->node_arena()->Afree(this,node_size);
611 #endif
612 }
613 if (is_macro()) {
614 compile->remove_macro_node(this);
615 }
616 if (is_expensive()) {
617 compile->remove_expensive_node(this);
618 }
619 CastIINode* cast = isa_CastII();
620 if (cast != NULL && cast->has_range_check()) {
621 compile->remove_range_check_cast(cast);
622 }
623 if (Opcode() == Op_Opaque4) {
624 compile->remove_opaque4_node(this);
625 }
626
627 if (is_SafePoint()) {
628 as_SafePoint()->delete_replaced_nodes();
629 }
630 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
631 bs->unregister_potential_barrier_node(this);
632 #ifdef ASSERT
633 // We will not actually delete the storage, but we'll make the node unusable.
634 *(address*)this = badAddress; // smash the C++ vtbl, probably
635 _in = _out = (Node**) badAddress;
636 _max = _cnt = _outmax = _outcnt = 0;
637 compile->remove_modified_node(this);
638 #endif
639 }
640
641 //------------------------------grow-------------------------------------------
642 // Grow the input array, making space for more edges
643 void Node::grow( uint len ) {
644 Arena* arena = Compile::current()->node_arena();
645 uint new_max = _max;
646 if( new_max == 0 ) {
647 _max = 4;
648 _in = (Node**)arena->Amalloc(4*sizeof(Node*));
649 Node** to = _in;
650 to[0] = NULL;
651 to[1] = NULL;
652 to[2] = NULL;
653 to[3] = NULL;
654 return;
655 }
656 while( new_max <= len ) new_max <<= 1; // Find next power-of-2
657 // Trimming to limit allows a uint8 to handle up to 255 edges.
658 // Previously I was using only powers-of-2 which peaked at 128 edges.
659 //if( new_max >= limit ) new_max = limit-1;
660 _in = (Node**)arena->Arealloc(_in, _max*sizeof(Node*), new_max*sizeof(Node*));
661 Copy::zero_to_bytes(&_in[_max], (new_max-_max)*sizeof(Node*)); // NULL all new space
662 _max = new_max; // Record new max length
663 // This assertion makes sure that Node::_max is wide enough to
664 // represent the numerical value of new_max.
665 assert(_max == new_max && _max > len, "int width of _max is too small");
666 }
667
668 //-----------------------------out_grow----------------------------------------
669 // Grow the input array, making space for more edges
670 void Node::out_grow( uint len ) {
671 assert(!is_top(), "cannot grow a top node's out array");
672 Arena* arena = Compile::current()->node_arena();
673 uint new_max = _outmax;
674 if( new_max == 0 ) {
675 _outmax = 4;
676 _out = (Node **)arena->Amalloc(4*sizeof(Node*));
677 return;
678 }
679 while( new_max <= len ) new_max <<= 1; // Find next power-of-2
680 // Trimming to limit allows a uint8 to handle up to 255 edges.
681 // Previously I was using only powers-of-2 which peaked at 128 edges.
682 //if( new_max >= limit ) new_max = limit-1;
683 assert(_out != NULL && _out != NO_OUT_ARRAY, "out must have sensible value");
684 _out = (Node**)arena->Arealloc(_out,_outmax*sizeof(Node*),new_max*sizeof(Node*));
685 //Copy::zero_to_bytes(&_out[_outmax], (new_max-_outmax)*sizeof(Node*)); // NULL all new space
686 _outmax = new_max; // Record new max length
687 // This assertion makes sure that Node::_max is wide enough to
688 // represent the numerical value of new_max.
689 assert(_outmax == new_max && _outmax > len, "int width of _outmax is too small");
690 }
691
692 #ifdef ASSERT
693 //------------------------------is_dead----------------------------------------
694 bool Node::is_dead() const {
695 // Mach and pinch point nodes may look like dead.
696 if( is_top() || is_Mach() || (Opcode() == Op_Node && _outcnt > 0) )
697 return false;
698 for( uint i = 0; i < _max; i++ )
699 if( _in[i] != NULL )
700 return false;
701 dump();
702 return true;
703 }
704 #endif
705
706
707 //------------------------------is_unreachable---------------------------------
708 bool Node::is_unreachable(PhaseIterGVN &igvn) const {
709 assert(!is_Mach(), "doesn't work with MachNodes");
710 return outcnt() == 0 || igvn.type(this) == Type::TOP || (in(0) != NULL && in(0)->is_top());
711 }
712
713 //------------------------------add_req----------------------------------------
714 // Add a new required input at the end
715 void Node::add_req( Node *n ) {
716 assert( is_not_dead(n), "can not use dead node");
717
718 // Look to see if I can move precedence down one without reallocating
719 if( (_cnt >= _max) || (in(_max-1) != NULL) )
720 grow( _max+1 );
721
722 // Find a precedence edge to move
723 if( in(_cnt) != NULL ) { // Next precedence edge is busy?
724 uint i;
725 for( i=_cnt; i<_max; i++ )
726 if( in(i) == NULL ) // Find the NULL at end of prec edge list
727 break; // There must be one, since we grew the array
728 _in[i] = in(_cnt); // Move prec over, making space for req edge
729 }
730 _in[_cnt++] = n; // Stuff over old prec edge
731 if (n != NULL) n->add_out((Node *)this);
732 }
733
734 //---------------------------add_req_batch-------------------------------------
735 // Add a new required input at the end
736 void Node::add_req_batch( Node *n, uint m ) {
737 assert( is_not_dead(n), "can not use dead node");
738 // check various edge cases
739 if ((int)m <= 1) {
740 assert((int)m >= 0, "oob");
741 if (m != 0) add_req(n);
742 return;
743 }
744
745 // Look to see if I can move precedence down one without reallocating
746 if( (_cnt+m) > _max || _in[_max-m] )
747 grow( _max+m );
748
749 // Find a precedence edge to move
750 if( _in[_cnt] != NULL ) { // Next precedence edge is busy?
751 uint i;
752 for( i=_cnt; i<_max; i++ )
753 if( _in[i] == NULL ) // Find the NULL at end of prec edge list
754 break; // There must be one, since we grew the array
755 // Slide all the precs over by m positions (assume #prec << m).
756 Copy::conjoint_words_to_higher((HeapWord*)&_in[_cnt], (HeapWord*)&_in[_cnt+m], ((i-_cnt)*sizeof(Node*)));
757 }
758
759 // Stuff over the old prec edges
760 for(uint i=0; i<m; i++ ) {
761 _in[_cnt++] = n;
762 }
763
764 // Insert multiple out edges on the node.
765 if (n != NULL && !n->is_top()) {
766 for(uint i=0; i<m; i++ ) {
767 n->add_out((Node *)this);
768 }
769 }
770 }
771
772 //------------------------------del_req----------------------------------------
773 // Delete the required edge and compact the edge array
774 void Node::del_req( uint idx ) {
775 assert( idx < _cnt, "oob");
776 assert( !VerifyHashTableKeys || _hash_lock == 0,
777 "remove node from hash table before modifying it");
778 // First remove corresponding def-use edge
779 Node *n = in(idx);
780 if (n != NULL) n->del_out((Node *)this);
781 _in[idx] = in(--_cnt); // Compact the array
782 // Avoid spec violation: Gap in prec edges.
783 close_prec_gap_at(_cnt);
784 Compile::current()->record_modified_node(this);
785 }
786
787 //------------------------------del_req_ordered--------------------------------
788 // Delete the required edge and compact the edge array with preserved order
789 void Node::del_req_ordered( uint idx ) {
790 assert( idx < _cnt, "oob");
791 assert( !VerifyHashTableKeys || _hash_lock == 0,
792 "remove node from hash table before modifying it");
793 // First remove corresponding def-use edge
794 Node *n = in(idx);
795 if (n != NULL) n->del_out((Node *)this);
796 if (idx < --_cnt) { // Not last edge ?
797 Copy::conjoint_words_to_lower((HeapWord*)&_in[idx+1], (HeapWord*)&_in[idx], ((_cnt-idx)*sizeof(Node*)));
798 }
799 // Avoid spec violation: Gap in prec edges.
800 close_prec_gap_at(_cnt);
801 Compile::current()->record_modified_node(this);
802 }
803
804 //------------------------------ins_req----------------------------------------
805 // Insert a new required input at the end
806 void Node::ins_req( uint idx, Node *n ) {
807 assert( is_not_dead(n), "can not use dead node");
808 add_req(NULL); // Make space
809 assert( idx < _max, "Must have allocated enough space");
810 // Slide over
811 if(_cnt-idx-1 > 0) {
812 Copy::conjoint_words_to_higher((HeapWord*)&_in[idx], (HeapWord*)&_in[idx+1], ((_cnt-idx-1)*sizeof(Node*)));
813 }
814 _in[idx] = n; // Stuff over old required edge
815 if (n != NULL) n->add_out((Node *)this); // Add reciprocal def-use edge
816 }
817
818 //-----------------------------find_edge---------------------------------------
819 int Node::find_edge(Node* n) {
820 for (uint i = 0; i < len(); i++) {
821 if (_in[i] == n) return i;
822 }
823 return -1;
824 }
825
826 //----------------------------replace_edge-------------------------------------
827 int Node::replace_edge(Node* old, Node* neww) {
828 if (old == neww) return 0; // nothing to do
829 uint nrep = 0;
830 for (uint i = 0; i < len(); i++) {
831 if (in(i) == old) {
832 if (i < req()) {
833 set_req(i, neww);
834 } else {
835 assert(find_prec_edge(neww) == -1, "spec violation: duplicated prec edge (node %d -> %d)", _idx, neww->_idx);
836 set_prec(i, neww);
837 }
838 nrep++;
839 }
840 }
841 return nrep;
842 }
843
844 /**
845 * Replace input edges in the range pointing to 'old' node.
846 */
847 int Node::replace_edges_in_range(Node* old, Node* neww, int start, int end) {
848 if (old == neww) return 0; // nothing to do
849 uint nrep = 0;
850 for (int i = start; i < end; i++) {
851 if (in(i) == old) {
852 set_req(i, neww);
853 nrep++;
854 }
855 }
856 return nrep;
857 }
858
859 //-------------------------disconnect_inputs-----------------------------------
860 // NULL out all inputs to eliminate incoming Def-Use edges.
861 // Return the number of edges between 'n' and 'this'
862 int Node::disconnect_inputs(Node *n, Compile* C) {
863 int edges_to_n = 0;
864
865 uint cnt = req();
866 for( uint i = 0; i < cnt; ++i ) {
867 if( in(i) == 0 ) continue;
868 if( in(i) == n ) ++edges_to_n;
869 set_req(i, NULL);
870 }
871 // Remove precedence edges if any exist
872 // Note: Safepoints may have precedence edges, even during parsing
873 if( (req() != len()) && (in(req()) != NULL) ) {
874 uint max = len();
875 for( uint i = 0; i < max; ++i ) {
876 if( in(i) == 0 ) continue;
877 if( in(i) == n ) ++edges_to_n;
878 set_prec(i, NULL);
879 }
880 }
881
882 // Node::destruct requires all out edges be deleted first
883 // debug_only(destruct();) // no reuse benefit expected
884 if (edges_to_n == 0) {
885 C->record_dead_node(_idx);
886 }
887 return edges_to_n;
888 }
889
890 //-----------------------------uncast---------------------------------------
891 // %%% Temporary, until we sort out CheckCastPP vs. CastPP.
892 // Strip away casting. (It is depth-limited.)
893 Node* Node::uncast() const {
894 // Should be inline:
895 //return is_ConstraintCast() ? uncast_helper(this) : (Node*) this;
896 if (is_ConstraintCast())
897 return uncast_helper(this);
898 else
899 return (Node*) this;
900 }
901
902 // Find out of current node that matches opcode.
903 Node* Node::find_out_with(int opcode) {
904 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
905 Node* use = fast_out(i);
906 if (use->Opcode() == opcode) {
907 return use;
908 }
909 }
910 return NULL;
911 }
912
913 // Return true if the current node has an out that matches opcode.
914 bool Node::has_out_with(int opcode) {
915 return (find_out_with(opcode) != NULL);
916 }
917
918 // Return true if the current node has an out that matches any of the opcodes.
919 bool Node::has_out_with(int opcode1, int opcode2, int opcode3, int opcode4) {
920 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
921 int opcode = fast_out(i)->Opcode();
922 if (opcode == opcode1 || opcode == opcode2 || opcode == opcode3 || opcode == opcode4) {
923 return true;
924 }
925 }
926 return false;
927 }
928
929
930 //---------------------------uncast_helper-------------------------------------
931 Node* Node::uncast_helper(const Node* p) {
932 #ifdef ASSERT
933 uint depth_count = 0;
934 const Node* orig_p = p;
935 #endif
936
937 while (true) {
938 #ifdef ASSERT
939 if (depth_count >= K) {
940 orig_p->dump(4);
941 if (p != orig_p)
942 p->dump(1);
943 }
944 assert(depth_count++ < K, "infinite loop in Node::uncast_helper");
945 #endif
946 if (p == NULL || p->req() != 2) {
947 break;
948 } else if (p->is_ConstraintCast()) {
949 p = p->in(1);
950 } else {
951 break;
952 }
953 }
954 return (Node*) p;
955 }
956
957 //------------------------------add_prec---------------------------------------
958 // Add a new precedence input. Precedence inputs are unordered, with
959 // duplicates removed and NULLs packed down at the end.
960 void Node::add_prec( Node *n ) {
961 assert( is_not_dead(n), "can not use dead node");
962
963 // Check for NULL at end
964 if( _cnt >= _max || in(_max-1) )
965 grow( _max+1 );
966
967 // Find a precedence edge to move
968 uint i = _cnt;
969 while( in(i) != NULL ) {
970 if (in(i) == n) return; // Avoid spec violation: duplicated prec edge.
971 i++;
972 }
973 _in[i] = n; // Stuff prec edge over NULL
974 if ( n != NULL) n->add_out((Node *)this); // Add mirror edge
975
976 #ifdef ASSERT
977 while ((++i)<_max) { assert(_in[i] == NULL, "spec violation: Gap in prec edges (node %d)", _idx); }
978 #endif
979 }
980
981 //------------------------------rm_prec----------------------------------------
982 // Remove a precedence input. Precedence inputs are unordered, with
983 // duplicates removed and NULLs packed down at the end.
984 void Node::rm_prec( uint j ) {
985 assert(j < _max, "oob: i=%d, _max=%d", j, _max);
986 assert(j >= _cnt, "not a precedence edge");
987 if (_in[j] == NULL) return; // Avoid spec violation: Gap in prec edges.
988 _in[j]->del_out((Node *)this);
989 close_prec_gap_at(j);
990 }
991
992 //------------------------------size_of----------------------------------------
993 uint Node::size_of() const { return sizeof(*this); }
994
995 //------------------------------ideal_reg--------------------------------------
996 uint Node::ideal_reg() const { return 0; }
997
998 //------------------------------jvms-------------------------------------------
999 JVMState* Node::jvms() const { return NULL; }
1000
1001 #ifdef ASSERT
1002 //------------------------------jvms-------------------------------------------
1003 bool Node::verify_jvms(const JVMState* using_jvms) const {
1004 for (JVMState* jvms = this->jvms(); jvms != NULL; jvms = jvms->caller()) {
1005 if (jvms == using_jvms) return true;
1006 }
1007 return false;
1008 }
1009
1010 //------------------------------init_NodeProperty------------------------------
1011 void Node::init_NodeProperty() {
1012 assert(_max_classes <= max_jushort, "too many NodeProperty classes");
1013 assert(_max_flags <= max_jushort, "too many NodeProperty flags");
1014 }
1015 #endif
1016
1017 //------------------------------format-----------------------------------------
1018 // Print as assembly
1019 void Node::format( PhaseRegAlloc *, outputStream *st ) const {}
1020 //------------------------------emit-------------------------------------------
1021 // Emit bytes starting at parameter 'ptr'.
1022 void Node::emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const {}
1023 //------------------------------size-------------------------------------------
1024 // Size of instruction in bytes
1025 uint Node::size(PhaseRegAlloc *ra_) const { return 0; }
1026
1027 //------------------------------CFG Construction-------------------------------
1028 // Nodes that end basic blocks, e.g. IfTrue/IfFalse, JumpProjNode, Root,
1029 // Goto and Return.
1030 const Node *Node::is_block_proj() const { return 0; }
1031
1032 // Minimum guaranteed type
1033 const Type *Node::bottom_type() const { return Type::BOTTOM; }
1034
1035
1036 //------------------------------raise_bottom_type------------------------------
1037 // Get the worst-case Type output for this Node.
1038 void Node::raise_bottom_type(const Type* new_type) {
1039 if (is_Type()) {
1040 TypeNode *n = this->as_Type();
1041 if (VerifyAliases) {
1042 assert(new_type->higher_equal_speculative(n->type()), "new type must refine old type");
1043 }
1044 n->set_type(new_type);
1045 } else if (is_Load()) {
1046 LoadNode *n = this->as_Load();
1047 if (VerifyAliases) {
1048 assert(new_type->higher_equal_speculative(n->type()), "new type must refine old type");
1049 }
1050 n->set_type(new_type);
1051 }
1052 }
1053
1054 //------------------------------Identity---------------------------------------
1055 // Return a node that the given node is equivalent to.
1056 Node* Node::Identity(PhaseGVN* phase) {
1057 return this; // Default to no identities
1058 }
1059
1060 //------------------------------Value------------------------------------------
1061 // Compute a new Type for a node using the Type of the inputs.
1062 const Type* Node::Value(PhaseGVN* phase) const {
1063 return bottom_type(); // Default to worst-case Type
1064 }
1065
1066 //------------------------------Ideal------------------------------------------
1067 //
1068 // 'Idealize' the graph rooted at this Node.
1069 //
1070 // In order to be efficient and flexible there are some subtle invariants
1071 // these Ideal calls need to hold. Running with '+VerifyIterativeGVN' checks
1072 // these invariants, although its too slow to have on by default. If you are
1073 // hacking an Ideal call, be sure to test with +VerifyIterativeGVN!
1074 //
1075 // The Ideal call almost arbitrarily reshape the graph rooted at the 'this'
1076 // pointer. If ANY change is made, it must return the root of the reshaped
1077 // graph - even if the root is the same Node. Example: swapping the inputs
1078 // to an AddINode gives the same answer and same root, but you still have to
1079 // return the 'this' pointer instead of NULL.
1080 //
1081 // You cannot return an OLD Node, except for the 'this' pointer. Use the
1082 // Identity call to return an old Node; basically if Identity can find
1083 // another Node have the Ideal call make no change and return NULL.
1084 // Example: AddINode::Ideal must check for add of zero; in this case it
1085 // returns NULL instead of doing any graph reshaping.
1086 //
1087 // You cannot modify any old Nodes except for the 'this' pointer. Due to
1088 // sharing there may be other users of the old Nodes relying on their current
1089 // semantics. Modifying them will break the other users.
1090 // Example: when reshape "(X+3)+4" into "X+7" you must leave the Node for
1091 // "X+3" unchanged in case it is shared.
1092 //
1093 // If you modify the 'this' pointer's inputs, you should use
1094 // 'set_req'. If you are making a new Node (either as the new root or
1095 // some new internal piece) you may use 'init_req' to set the initial
1096 // value. You can make a new Node with either 'new' or 'clone'. In
1097 // either case, def-use info is correctly maintained.
1098 //
1099 // Example: reshape "(X+3)+4" into "X+7":
1100 // set_req(1, in(1)->in(1));
1101 // set_req(2, phase->intcon(7));
1102 // return this;
1103 // Example: reshape "X*4" into "X<<2"
1104 // return new LShiftINode(in(1), phase->intcon(2));
1105 //
1106 // You must call 'phase->transform(X)' on any new Nodes X you make, except
1107 // for the returned root node. Example: reshape "X*31" with "(X<<5)-X".
1108 // Node *shift=phase->transform(new LShiftINode(in(1),phase->intcon(5)));
1109 // return new AddINode(shift, in(1));
1110 //
1111 // When making a Node for a constant use 'phase->makecon' or 'phase->intcon'.
1112 // These forms are faster than 'phase->transform(new ConNode())' and Do
1113 // The Right Thing with def-use info.
1114 //
1115 // You cannot bury the 'this' Node inside of a graph reshape. If the reshaped
1116 // graph uses the 'this' Node it must be the root. If you want a Node with
1117 // the same Opcode as the 'this' pointer use 'clone'.
1118 //
1119 Node *Node::Ideal(PhaseGVN *phase, bool can_reshape) {
1120 return NULL; // Default to being Ideal already
1121 }
1122
1123 // Some nodes have specific Ideal subgraph transformations only if they are
1124 // unique users of specific nodes. Such nodes should be put on IGVN worklist
1125 // for the transformations to happen.
1126 bool Node::has_special_unique_user() const {
1127 assert(outcnt() == 1, "match only for unique out");
1128 Node* n = unique_out();
1129 int op = Opcode();
1130 if (this->is_Store()) {
1131 // Condition for back-to-back stores folding.
1132 return n->Opcode() == op && n->in(MemNode::Memory) == this;
1133 } else if (this->is_Load() || this->is_DecodeN() || this->is_Phi()) {
1134 // Condition for removing an unused LoadNode or DecodeNNode from the MemBarAcquire precedence input
1135 return n->Opcode() == Op_MemBarAcquire;
1136 } else if (op == Op_AddL) {
1137 // Condition for convL2I(addL(x,y)) ==> addI(convL2I(x),convL2I(y))
1138 return n->Opcode() == Op_ConvL2I && n->in(1) == this;
1139 } else if (op == Op_SubI || op == Op_SubL) {
1140 // Condition for subI(x,subI(y,z)) ==> subI(addI(x,z),y)
1141 return n->Opcode() == op && n->in(2) == this;
1142 } else if (is_If() && (n->is_IfFalse() || n->is_IfTrue())) {
1143 // See IfProjNode::Identity()
1144 return true;
1145 } else {
1146 return BarrierSet::barrier_set()->barrier_set_c2()->has_special_unique_user(this);
1147 }
1148 };
1149
1150 //--------------------------find_exact_control---------------------------------
1151 // Skip Proj and CatchProj nodes chains. Check for Null and Top.
1152 Node* Node::find_exact_control(Node* ctrl) {
1153 if (ctrl == NULL && this->is_Region())
1154 ctrl = this->as_Region()->is_copy();
1155
1156 if (ctrl != NULL && ctrl->is_CatchProj()) {
1157 if (ctrl->as_CatchProj()->_con == CatchProjNode::fall_through_index)
1158 ctrl = ctrl->in(0);
1159 if (ctrl != NULL && !ctrl->is_top())
1160 ctrl = ctrl->in(0);
1161 }
1162
1163 if (ctrl != NULL && ctrl->is_Proj())
1164 ctrl = ctrl->in(0);
1165
1166 return ctrl;
1167 }
1168
1169 //--------------------------dominates------------------------------------------
1170 // Helper function for MemNode::all_controls_dominate().
1171 // Check if 'this' control node dominates or equal to 'sub' control node.
1172 // We already know that if any path back to Root or Start reaches 'this',
1173 // then all paths so, so this is a simple search for one example,
1174 // not an exhaustive search for a counterexample.
1175 bool Node::dominates(Node* sub, Node_List &nlist) {
1176 assert(this->is_CFG(), "expecting control");
1177 assert(sub != NULL && sub->is_CFG(), "expecting control");
1178
1179 // detect dead cycle without regions
1180 int iterations_without_region_limit = DominatorSearchLimit;
1181
1182 Node* orig_sub = sub;
1183 Node* dom = this;
1184 bool met_dom = false;
1185 nlist.clear();
1186
1187 // Walk 'sub' backward up the chain to 'dom', watching for regions.
1188 // After seeing 'dom', continue up to Root or Start.
1189 // If we hit a region (backward split point), it may be a loop head.
1190 // Keep going through one of the region's inputs. If we reach the
1191 // same region again, go through a different input. Eventually we
1192 // will either exit through the loop head, or give up.
1193 // (If we get confused, break out and return a conservative 'false'.)
1194 while (sub != NULL) {
1195 if (sub->is_top()) break; // Conservative answer for dead code.
1196 if (sub == dom) {
1197 if (nlist.size() == 0) {
1198 // No Region nodes except loops were visited before and the EntryControl
1199 // path was taken for loops: it did not walk in a cycle.
1200 return true;
1201 } else if (met_dom) {
1202 break; // already met before: walk in a cycle
1203 } else {
1204 // Region nodes were visited. Continue walk up to Start or Root
1205 // to make sure that it did not walk in a cycle.
1206 met_dom = true; // first time meet
1207 iterations_without_region_limit = DominatorSearchLimit; // Reset
1208 }
1209 }
1210 if (sub->is_Start() || sub->is_Root()) {
1211 // Success if we met 'dom' along a path to Start or Root.
1212 // We assume there are no alternative paths that avoid 'dom'.
1213 // (This assumption is up to the caller to ensure!)
1214 return met_dom;
1215 }
1216 Node* up = sub->in(0);
1217 // Normalize simple pass-through regions and projections:
1218 up = sub->find_exact_control(up);
1219 // If sub == up, we found a self-loop. Try to push past it.
1220 if (sub == up && sub->is_Loop()) {
1221 // Take loop entry path on the way up to 'dom'.
1222 up = sub->in(1); // in(LoopNode::EntryControl);
1223 } else if (sub == up && sub->is_Region() && sub->req() != 3) {
1224 // Always take in(1) path on the way up to 'dom' for clone regions
1225 // (with only one input) or regions which merge > 2 paths
1226 // (usually used to merge fast/slow paths).
1227 up = sub->in(1);
1228 } else if (sub == up && sub->is_Region()) {
1229 // Try both paths for Regions with 2 input paths (it may be a loop head).
1230 // It could give conservative 'false' answer without information
1231 // which region's input is the entry path.
1232 iterations_without_region_limit = DominatorSearchLimit; // Reset
1233
1234 bool region_was_visited_before = false;
1235 // Was this Region node visited before?
1236 // If so, we have reached it because we accidentally took a
1237 // loop-back edge from 'sub' back into the body of the loop,
1238 // and worked our way up again to the loop header 'sub'.
1239 // So, take the first unexplored path on the way up to 'dom'.
1240 for (int j = nlist.size() - 1; j >= 0; j--) {
1241 intptr_t ni = (intptr_t)nlist.at(j);
1242 Node* visited = (Node*)(ni & ~1);
1243 bool visited_twice_already = ((ni & 1) != 0);
1244 if (visited == sub) {
1245 if (visited_twice_already) {
1246 // Visited 2 paths, but still stuck in loop body. Give up.
1247 return false;
1248 }
1249 // The Region node was visited before only once.
1250 // (We will repush with the low bit set, below.)
1251 nlist.remove(j);
1252 // We will find a new edge and re-insert.
1253 region_was_visited_before = true;
1254 break;
1255 }
1256 }
1257
1258 // Find an incoming edge which has not been seen yet; walk through it.
1259 assert(up == sub, "");
1260 uint skip = region_was_visited_before ? 1 : 0;
1261 for (uint i = 1; i < sub->req(); i++) {
1262 Node* in = sub->in(i);
1263 if (in != NULL && !in->is_top() && in != sub) {
1264 if (skip == 0) {
1265 up = in;
1266 break;
1267 }
1268 --skip; // skip this nontrivial input
1269 }
1270 }
1271
1272 // Set 0 bit to indicate that both paths were taken.
1273 nlist.push((Node*)((intptr_t)sub + (region_was_visited_before ? 1 : 0)));
1274 }
1275
1276 if (up == sub) {
1277 break; // some kind of tight cycle
1278 }
1279 if (up == orig_sub && met_dom) {
1280 // returned back after visiting 'dom'
1281 break; // some kind of cycle
1282 }
1283 if (--iterations_without_region_limit < 0) {
1284 break; // dead cycle
1285 }
1286 sub = up;
1287 }
1288
1289 // Did not meet Root or Start node in pred. chain.
1290 // Conservative answer for dead code.
1291 return false;
1292 }
1293
1294 //------------------------------remove_dead_region-----------------------------
1295 // This control node is dead. Follow the subgraph below it making everything
1296 // using it dead as well. This will happen normally via the usual IterGVN
1297 // worklist but this call is more efficient. Do not update use-def info
1298 // inside the dead region, just at the borders.
1299 static void kill_dead_code( Node *dead, PhaseIterGVN *igvn ) {
1300 // Con's are a popular node to re-hit in the hash table again.
1301 if( dead->is_Con() ) return;
1302
1303 // Can't put ResourceMark here since igvn->_worklist uses the same arena
1304 // for verify pass with +VerifyOpto and we add/remove elements in it here.
1305 Node_List nstack(Thread::current()->resource_area());
1306
1307 Node *top = igvn->C->top();
1308 nstack.push(dead);
1309 bool has_irreducible_loop = igvn->C->has_irreducible_loop();
1310
1311 while (nstack.size() > 0) {
1312 dead = nstack.pop();
1313 if (dead->outcnt() > 0) {
1314 // Keep dead node on stack until all uses are processed.
1315 nstack.push(dead);
1316 // For all Users of the Dead... ;-)
1317 for (DUIterator_Last kmin, k = dead->last_outs(kmin); k >= kmin; ) {
1318 Node* use = dead->last_out(k);
1319 igvn->hash_delete(use); // Yank from hash table prior to mod
1320 if (use->in(0) == dead) { // Found another dead node
1321 assert (!use->is_Con(), "Control for Con node should be Root node.");
1322 use->set_req(0, top); // Cut dead edge to prevent processing
1323 nstack.push(use); // the dead node again.
1324 } else if (!has_irreducible_loop && // Backedge could be alive in irreducible loop
1325 use->is_Loop() && !use->is_Root() && // Don't kill Root (RootNode extends LoopNode)
1326 use->in(LoopNode::EntryControl) == dead) { // Dead loop if its entry is dead
1327 use->set_req(LoopNode::EntryControl, top); // Cut dead edge to prevent processing
1328 use->set_req(0, top); // Cut self edge
1329 nstack.push(use);
1330 } else { // Else found a not-dead user
1331 // Dead if all inputs are top or null
1332 bool dead_use = !use->is_Root(); // Keep empty graph alive
1333 for (uint j = 1; j < use->req(); j++) {
1334 Node* in = use->in(j);
1335 if (in == dead) { // Turn all dead inputs into TOP
1336 use->set_req(j, top);
1337 } else if (in != NULL && !in->is_top()) {
1338 dead_use = false;
1339 }
1340 }
1341 if (dead_use) {
1342 if (use->is_Region()) {
1343 use->set_req(0, top); // Cut self edge
1344 }
1345 nstack.push(use);
1346 } else {
1347 igvn->_worklist.push(use);
1348 }
1349 }
1350 // Refresh the iterator, since any number of kills might have happened.
1351 k = dead->last_outs(kmin);
1352 }
1353 } else { // (dead->outcnt() == 0)
1354 // Done with outputs.
1355 igvn->hash_delete(dead);
1356 igvn->_worklist.remove(dead);
1357 igvn->C->remove_modified_node(dead);
1358 igvn->set_type(dead, Type::TOP);
1359 if (dead->is_macro()) {
1360 igvn->C->remove_macro_node(dead);
1361 }
1362 if (dead->is_expensive()) {
1363 igvn->C->remove_expensive_node(dead);
1364 }
1365 CastIINode* cast = dead->isa_CastII();
1366 if (cast != NULL && cast->has_range_check()) {
1367 igvn->C->remove_range_check_cast(cast);
1368 }
1369 if (dead->Opcode() == Op_Opaque4) {
1370 igvn->C->remove_opaque4_node(dead);
1371 }
1372 BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
1373 bs->unregister_potential_barrier_node(dead);
1374 igvn->C->record_dead_node(dead->_idx);
1375 // Kill all inputs to the dead guy
1376 for (uint i=0; i < dead->req(); i++) {
1377 Node *n = dead->in(i); // Get input to dead guy
1378 if (n != NULL && !n->is_top()) { // Input is valid?
1379 dead->set_req(i, top); // Smash input away
1380 if (n->outcnt() == 0) { // Input also goes dead?
1381 if (!n->is_Con())
1382 nstack.push(n); // Clear it out as well
1383 } else if (n->outcnt() == 1 &&
1384 n->has_special_unique_user()) {
1385 igvn->add_users_to_worklist( n );
1386 } else if (n->outcnt() <= 2 && n->is_Store()) {
1387 // Push store's uses on worklist to enable folding optimization for
1388 // store/store and store/load to the same address.
1389 // The restriction (outcnt() <= 2) is the same as in set_req_X()
1390 // and remove_globally_dead_node().
1391 igvn->add_users_to_worklist( n );
1392 } else {
1393 BarrierSet::barrier_set()->barrier_set_c2()->enqueue_useful_gc_barrier(igvn, n);
1394 }
1395 }
1396 }
1397 } // (dead->outcnt() == 0)
1398 } // while (nstack.size() > 0) for outputs
1399 return;
1400 }
1401
1402 //------------------------------remove_dead_region-----------------------------
1403 bool Node::remove_dead_region(PhaseGVN *phase, bool can_reshape) {
1404 Node *n = in(0);
1405 if( !n ) return false;
1406 // Lost control into this guy? I.e., it became unreachable?
1407 // Aggressively kill all unreachable code.
1408 if (can_reshape && n->is_top()) {
1409 kill_dead_code(this, phase->is_IterGVN());
1410 return false; // Node is dead.
1411 }
1412
1413 if( n->is_Region() && n->as_Region()->is_copy() ) {
1414 Node *m = n->nonnull_req();
1415 set_req(0, m);
1416 return true;
1417 }
1418 return false;
1419 }
1420
1421 //------------------------------hash-------------------------------------------
1422 // Hash function over Nodes.
1423 uint Node::hash() const {
1424 uint sum = 0;
1425 for( uint i=0; i<_cnt; i++ ) // Add in all inputs
1426 sum = (sum<<1)-(uintptr_t)in(i); // Ignore embedded NULLs
1427 return (sum>>2) + _cnt + Opcode();
1428 }
1429
1430 //------------------------------cmp--------------------------------------------
1431 // Compare special parts of simple Nodes
1432 uint Node::cmp( const Node &n ) const {
1433 return 1; // Must be same
1434 }
1435
1436 //------------------------------rematerialize-----------------------------------
1437 // Should we clone rather than spill this instruction?
1438 bool Node::rematerialize() const {
1439 if ( is_Mach() )
1440 return this->as_Mach()->rematerialize();
1441 else
1442 return (_flags & Flag_rematerialize) != 0;
1443 }
1444
1445 //------------------------------needs_anti_dependence_check---------------------
1446 // Nodes which use memory without consuming it, hence need antidependences.
1447 bool Node::needs_anti_dependence_check() const {
1448 if( req() < 2 || (_flags & Flag_needs_anti_dependence_check) == 0 )
1449 return false;
1450 else
1451 return in(1)->bottom_type()->has_memory();
1452 }
1453
1454
1455 // Get an integer constant from a ConNode (or CastIINode).
1456 // Return a default value if there is no apparent constant here.
1457 const TypeInt* Node::find_int_type() const {
1458 if (this->is_Type()) {
1459 return this->as_Type()->type()->isa_int();
1460 } else if (this->is_Con()) {
1461 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode");
1462 return this->bottom_type()->isa_int();
1463 }
1464 return NULL;
1465 }
1466
1467 // Get a pointer constant from a ConstNode.
1468 // Returns the constant if it is a pointer ConstNode
1469 intptr_t Node::get_ptr() const {
1470 assert( Opcode() == Op_ConP, "" );
1471 return ((ConPNode*)this)->type()->is_ptr()->get_con();
1472 }
1473
1474 // Get a narrow oop constant from a ConNNode.
1475 intptr_t Node::get_narrowcon() const {
1476 assert( Opcode() == Op_ConN, "" );
1477 return ((ConNNode*)this)->type()->is_narrowoop()->get_con();
1478 }
1479
1480 // Get a long constant from a ConNode.
1481 // Return a default value if there is no apparent constant here.
1482 const TypeLong* Node::find_long_type() const {
1483 if (this->is_Type()) {
1484 return this->as_Type()->type()->isa_long();
1485 } else if (this->is_Con()) {
1486 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode");
1487 return this->bottom_type()->isa_long();
1488 }
1489 return NULL;
1490 }
1491
1492
1493 /**
1494 * Return a ptr type for nodes which should have it.
1495 */
1496 const TypePtr* Node::get_ptr_type() const {
1497 const TypePtr* tp = this->bottom_type()->make_ptr();
1498 #ifdef ASSERT
1499 if (tp == NULL) {
1500 this->dump(1);
1501 assert((tp != NULL), "unexpected node type");
1502 }
1503 #endif
1504 return tp;
1505 }
1506
1507 // Get a double constant from a ConstNode.
1508 // Returns the constant if it is a double ConstNode
1509 jdouble Node::getd() const {
1510 assert( Opcode() == Op_ConD, "" );
1511 return ((ConDNode*)this)->type()->is_double_constant()->getd();
1512 }
1513
1514 // Get a float constant from a ConstNode.
1515 // Returns the constant if it is a float ConstNode
1516 jfloat Node::getf() const {
1517 assert( Opcode() == Op_ConF, "" );
1518 return ((ConFNode*)this)->type()->is_float_constant()->getf();
1519 }
1520
1521 #ifndef PRODUCT
1522
1523 //------------------------------find------------------------------------------
1524 // Find a neighbor of this Node with the given _idx
1525 // If idx is negative, find its absolute value, following both _in and _out.
1526 static void find_recur(Compile* C, Node* &result, Node *n, int idx, bool only_ctrl,
1527 VectorSet* old_space, VectorSet* new_space ) {
1528 int node_idx = (idx >= 0) ? idx : -idx;
1529 if (NotANode(n)) return; // Gracefully handle NULL, -1, 0xabababab, etc.
1530 // Contained in new_space or old_space? Check old_arena first since it's mostly empty.
1531 VectorSet *v = C->old_arena()->contains(n) ? old_space : new_space;
1532 if( v->test(n->_idx) ) return;
1533 if( (int)n->_idx == node_idx
1534 debug_only(|| n->debug_idx() == node_idx) ) {
1535 if (result != NULL)
1536 tty->print("find: " INTPTR_FORMAT " and " INTPTR_FORMAT " both have idx==%d\n",
1537 (uintptr_t)result, (uintptr_t)n, node_idx);
1538 result = n;
1539 }
1540 v->set(n->_idx);
1541 for( uint i=0; i<n->len(); i++ ) {
1542 if( only_ctrl && !(n->is_Region()) && (n->Opcode() != Op_Root) && (i != TypeFunc::Control) ) continue;
1543 find_recur(C, result, n->in(i), idx, only_ctrl, old_space, new_space );
1544 }
1545 // Search along forward edges also:
1546 if (idx < 0 && !only_ctrl) {
1547 for( uint j=0; j<n->outcnt(); j++ ) {
1548 find_recur(C, result, n->raw_out(j), idx, only_ctrl, old_space, new_space );
1549 }
1550 }
1551 #ifdef ASSERT
1552 // Search along debug_orig edges last, checking for cycles
1553 Node* orig = n->debug_orig();
1554 if (orig != NULL) {
1555 do {
1556 if (NotANode(orig)) break;
1557 find_recur(C, result, orig, idx, only_ctrl, old_space, new_space );
1558 orig = orig->debug_orig();
1559 } while (orig != NULL && orig != n->debug_orig());
1560 }
1561 #endif //ASSERT
1562 }
1563
1564 // call this from debugger:
1565 Node* find_node(Node* n, int idx) {
1566 return n->find(idx);
1567 }
1568
1569 //------------------------------find-------------------------------------------
1570 Node* Node::find(int idx) const {
1571 ResourceArea *area = Thread::current()->resource_area();
1572 VectorSet old_space(area), new_space(area);
1573 Node* result = NULL;
1574 find_recur(Compile::current(), result, (Node*) this, idx, false, &old_space, &new_space );
1575 return result;
1576 }
1577
1578 //------------------------------find_ctrl--------------------------------------
1579 // Find an ancestor to this node in the control history with given _idx
1580 Node* Node::find_ctrl(int idx) const {
1581 ResourceArea *area = Thread::current()->resource_area();
1582 VectorSet old_space(area), new_space(area);
1583 Node* result = NULL;
1584 find_recur(Compile::current(), result, (Node*) this, idx, true, &old_space, &new_space );
1585 return result;
1586 }
1587 #endif
1588
1589
1590
1591 #ifndef PRODUCT
1592
1593 // -----------------------------Name-------------------------------------------
1594 extern const char *NodeClassNames[];
1595 const char *Node::Name() const { return NodeClassNames[Opcode()]; }
1596
1597 static bool is_disconnected(const Node* n) {
1598 for (uint i = 0; i < n->req(); i++) {
1599 if (n->in(i) != NULL) return false;
1600 }
1601 return true;
1602 }
1603
1604 #ifdef ASSERT
1605 static void dump_orig(Node* orig, outputStream *st) {
1606 Compile* C = Compile::current();
1607 if (NotANode(orig)) orig = NULL;
1608 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
1609 if (orig == NULL) return;
1610 st->print(" !orig=");
1611 Node* fast = orig->debug_orig(); // tortoise & hare algorithm to detect loops
1612 if (NotANode(fast)) fast = NULL;
1613 while (orig != NULL) {
1614 bool discon = is_disconnected(orig); // if discon, print [123] else 123
1615 if (discon) st->print("[");
1616 if (!Compile::current()->node_arena()->contains(orig))
1617 st->print("o");
1618 st->print("%d", orig->_idx);
1619 if (discon) st->print("]");
1620 orig = orig->debug_orig();
1621 if (NotANode(orig)) orig = NULL;
1622 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
1623 if (orig != NULL) st->print(",");
1624 if (fast != NULL) {
1625 // Step fast twice for each single step of orig:
1626 fast = fast->debug_orig();
1627 if (NotANode(fast)) fast = NULL;
1628 if (fast != NULL && fast != orig) {
1629 fast = fast->debug_orig();
1630 if (NotANode(fast)) fast = NULL;
1631 }
1632 if (fast == orig) {
1633 st->print("...");
1634 break;
1635 }
1636 }
1637 }
1638 }
1639
1640 void Node::set_debug_orig(Node* orig) {
1641 _debug_orig = orig;
1642 if (BreakAtNode == 0) return;
1643 if (NotANode(orig)) orig = NULL;
1644 int trip = 10;
1645 while (orig != NULL) {
1646 if (orig->debug_idx() == BreakAtNode || (int)orig->_idx == BreakAtNode) {
1647 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d orig._idx=%d orig._debug_idx=%d",
1648 this->_idx, this->debug_idx(), orig->_idx, orig->debug_idx());
1649 BREAKPOINT;
1650 }
1651 orig = orig->debug_orig();
1652 if (NotANode(orig)) orig = NULL;
1653 if (trip-- <= 0) break;
1654 }
1655 }
1656 #endif //ASSERT
1657
1658 //------------------------------dump------------------------------------------
1659 // Dump a Node
1660 void Node::dump(const char* suffix, bool mark, outputStream *st) const {
1661 Compile* C = Compile::current();
1662 bool is_new = C->node_arena()->contains(this);
1663 C->_in_dump_cnt++;
1664 st->print("%c%d%s\t%s\t=== ", is_new ? ' ' : 'o', _idx, mark ? " >" : "", Name());
1665
1666 // Dump the required and precedence inputs
1667 dump_req(st);
1668 dump_prec(st);
1669 // Dump the outputs
1670 dump_out(st);
1671
1672 if (is_disconnected(this)) {
1673 #ifdef ASSERT
1674 st->print(" [%d]",debug_idx());
1675 dump_orig(debug_orig(), st);
1676 #endif
1677 st->cr();
1678 C->_in_dump_cnt--;
1679 return; // don't process dead nodes
1680 }
1681
1682 if (C->clone_map().value(_idx) != 0) {
1683 C->clone_map().dump(_idx);
1684 }
1685 // Dump node-specific info
1686 dump_spec(st);
1687 #ifdef ASSERT
1688 // Dump the non-reset _debug_idx
1689 if (Verbose && WizardMode) {
1690 st->print(" [%d]",debug_idx());
1691 }
1692 #endif
1693
1694 const Type *t = bottom_type();
1695
1696 if (t != NULL && (t->isa_instptr() || t->isa_klassptr())) {
1697 const TypeInstPtr *toop = t->isa_instptr();
1698 const TypeKlassPtr *tkls = t->isa_klassptr();
1699 ciKlass* klass = toop ? toop->klass() : (tkls ? tkls->klass() : NULL );
1700 if (klass && klass->is_loaded() && klass->is_interface()) {
1701 st->print(" Interface:");
1702 } else if (toop) {
1703 st->print(" Oop:");
1704 } else if (tkls) {
1705 st->print(" Klass:");
1706 }
1707 t->dump_on(st);
1708 } else if (t == Type::MEMORY) {
1709 st->print(" Memory:");
1710 MemNode::dump_adr_type(this, adr_type(), st);
1711 } else if (Verbose || WizardMode) {
1712 st->print(" Type:");
1713 if (t) {
1714 t->dump_on(st);
1715 } else {
1716 st->print("no type");
1717 }
1718 } else if (t->isa_vect() && this->is_MachSpillCopy()) {
1719 // Dump MachSpillcopy vector type.
1720 t->dump_on(st);
1721 }
1722 if (is_new) {
1723 debug_only(dump_orig(debug_orig(), st));
1724 Node_Notes* nn = C->node_notes_at(_idx);
1725 if (nn != NULL && !nn->is_clear()) {
1726 if (nn->jvms() != NULL) {
1727 st->print(" !jvms:");
1728 nn->jvms()->dump_spec(st);
1729 }
1730 }
1731 }
1732 if (suffix) st->print("%s", suffix);
1733 C->_in_dump_cnt--;
1734 }
1735
1736 //------------------------------dump_req--------------------------------------
1737 void Node::dump_req(outputStream *st) const {
1738 // Dump the required input edges
1739 for (uint i = 0; i < req(); i++) { // For all required inputs
1740 Node* d = in(i);
1741 if (d == NULL) {
1742 st->print("_ ");
1743 } else if (NotANode(d)) {
1744 st->print("NotANode "); // uninitialized, sentinel, garbage, etc.
1745 } else {
1746 st->print("%c%d ", Compile::current()->node_arena()->contains(d) ? ' ' : 'o', d->_idx);
1747 }
1748 }
1749 }
1750
1751
1752 //------------------------------dump_prec-------------------------------------
1753 void Node::dump_prec(outputStream *st) const {
1754 // Dump the precedence edges
1755 int any_prec = 0;
1756 for (uint i = req(); i < len(); i++) { // For all precedence inputs
1757 Node* p = in(i);
1758 if (p != NULL) {
1759 if (!any_prec++) st->print(" |");
1760 if (NotANode(p)) { st->print("NotANode "); continue; }
1761 st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
1762 }
1763 }
1764 }
1765
1766 //------------------------------dump_out--------------------------------------
1767 void Node::dump_out(outputStream *st) const {
1768 // Delimit the output edges
1769 st->print(" [[");
1770 // Dump the output edges
1771 for (uint i = 0; i < _outcnt; i++) { // For all outputs
1772 Node* u = _out[i];
1773 if (u == NULL) {
1774 st->print("_ ");
1775 } else if (NotANode(u)) {
1776 st->print("NotANode ");
1777 } else {
1778 st->print("%c%d ", Compile::current()->node_arena()->contains(u) ? ' ' : 'o', u->_idx);
1779 }
1780 }
1781 st->print("]] ");
1782 }
1783
1784 //----------------------------collect_nodes_i----------------------------------
1785 // Collects nodes from an Ideal graph, starting from a given start node and
1786 // moving in a given direction until a certain depth (distance from the start
1787 // node) is reached. Duplicates are ignored.
1788 // Arguments:
1789 // nstack: the nodes are collected into this array.
1790 // start: the node at which to start collecting.
1791 // direction: if this is a positive number, collect input nodes; if it is
1792 // a negative number, collect output nodes.
1793 // depth: collect nodes up to this distance from the start node.
1794 // include_start: whether to include the start node in the result collection.
1795 // only_ctrl: whether to regard control edges only during traversal.
1796 // only_data: whether to regard data edges only during traversal.
1797 static void collect_nodes_i(GrowableArray<Node*> *nstack, const Node* start, int direction, uint depth, bool include_start, bool only_ctrl, bool only_data) {
1798 Node* s = (Node*) start; // remove const
1799 nstack->append(s);
1800 int begin = 0;
1801 int end = 0;
1802 for(uint i = 0; i < depth; i++) {
1803 end = nstack->length();
1804 for(int j = begin; j < end; j++) {
1805 Node* tp = nstack->at(j);
1806 uint limit = direction > 0 ? tp->len() : tp->outcnt();
1807 for(uint k = 0; k < limit; k++) {
1808 Node* n = direction > 0 ? tp->in(k) : tp->raw_out(k);
1809
1810 if (NotANode(n)) continue;
1811 // do not recurse through top or the root (would reach unrelated stuff)
1812 if (n->is_Root() || n->is_top()) continue;
1813 if (only_ctrl && !n->is_CFG()) continue;
1814 if (only_data && n->is_CFG()) continue;
1815
1816 bool on_stack = nstack->contains(n);
1817 if (!on_stack) {
1818 nstack->append(n);
1819 }
1820 }
1821 }
1822 begin = end;
1823 }
1824 if (!include_start) {
1825 nstack->remove(s);
1826 }
1827 }
1828
1829 //------------------------------dump_nodes-------------------------------------
1830 static void dump_nodes(const Node* start, int d, bool only_ctrl) {
1831 if (NotANode(start)) return;
1832
1833 GrowableArray <Node *> nstack(Compile::current()->live_nodes());
1834 collect_nodes_i(&nstack, start, d, (uint) ABS(d), true, only_ctrl, false);
1835
1836 int end = nstack.length();
1837 if (d > 0) {
1838 for(int j = end-1; j >= 0; j--) {
1839 nstack.at(j)->dump();
1840 }
1841 } else {
1842 for(int j = 0; j < end; j++) {
1843 nstack.at(j)->dump();
1844 }
1845 }
1846 }
1847
1848 //------------------------------dump-------------------------------------------
1849 void Node::dump(int d) const {
1850 dump_nodes(this, d, false);
1851 }
1852
1853 //------------------------------dump_ctrl--------------------------------------
1854 // Dump a Node's control history to depth
1855 void Node::dump_ctrl(int d) const {
1856 dump_nodes(this, d, true);
1857 }
1858
1859 //-----------------------------dump_compact------------------------------------
1860 void Node::dump_comp() const {
1861 this->dump_comp("\n");
1862 }
1863
1864 //-----------------------------dump_compact------------------------------------
1865 // Dump a Node in compact representation, i.e., just print its name and index.
1866 // Nodes can specify additional specifics to print in compact representation by
1867 // implementing dump_compact_spec.
1868 void Node::dump_comp(const char* suffix, outputStream *st) const {
1869 Compile* C = Compile::current();
1870 C->_in_dump_cnt++;
1871 st->print("%s(%d)", Name(), _idx);
1872 this->dump_compact_spec(st);
1873 if (suffix) {
1874 st->print("%s", suffix);
1875 }
1876 C->_in_dump_cnt--;
1877 }
1878
1879 //----------------------------dump_related-------------------------------------
1880 // Dump a Node's related nodes - the notion of "related" depends on the Node at
1881 // hand and is determined by the implementation of the virtual method rel.
1882 void Node::dump_related() const {
1883 Compile* C = Compile::current();
1884 GrowableArray <Node *> in_rel(C->unique());
1885 GrowableArray <Node *> out_rel(C->unique());
1886 this->related(&in_rel, &out_rel, false);
1887 for (int i = in_rel.length() - 1; i >= 0; i--) {
1888 in_rel.at(i)->dump();
1889 }
1890 this->dump("\n", true);
1891 for (int i = 0; i < out_rel.length(); i++) {
1892 out_rel.at(i)->dump();
1893 }
1894 }
1895
1896 //----------------------------dump_related-------------------------------------
1897 // Dump a Node's related nodes up to a given depth (distance from the start
1898 // node).
1899 // Arguments:
1900 // d_in: depth for input nodes.
1901 // d_out: depth for output nodes (note: this also is a positive number).
1902 void Node::dump_related(uint d_in, uint d_out) const {
1903 Compile* C = Compile::current();
1904 GrowableArray <Node *> in_rel(C->unique());
1905 GrowableArray <Node *> out_rel(C->unique());
1906
1907 // call collect_nodes_i directly
1908 collect_nodes_i(&in_rel, this, 1, d_in, false, false, false);
1909 collect_nodes_i(&out_rel, this, -1, d_out, false, false, false);
1910
1911 for (int i = in_rel.length() - 1; i >= 0; i--) {
1912 in_rel.at(i)->dump();
1913 }
1914 this->dump("\n", true);
1915 for (int i = 0; i < out_rel.length(); i++) {
1916 out_rel.at(i)->dump();
1917 }
1918 }
1919
1920 //------------------------dump_related_compact---------------------------------
1921 // Dump a Node's related nodes in compact representation. The notion of
1922 // "related" depends on the Node at hand and is determined by the implementation
1923 // of the virtual method rel.
1924 void Node::dump_related_compact() const {
1925 Compile* C = Compile::current();
1926 GrowableArray <Node *> in_rel(C->unique());
1927 GrowableArray <Node *> out_rel(C->unique());
1928 this->related(&in_rel, &out_rel, true);
1929 int n_in = in_rel.length();
1930 int n_out = out_rel.length();
1931
1932 this->dump_comp(n_in == 0 ? "\n" : " ");
1933 for (int i = 0; i < n_in; i++) {
1934 in_rel.at(i)->dump_comp(i == n_in - 1 ? "\n" : " ");
1935 }
1936 for (int i = 0; i < n_out; i++) {
1937 out_rel.at(i)->dump_comp(i == n_out - 1 ? "\n" : " ");
1938 }
1939 }
1940
1941 //------------------------------related----------------------------------------
1942 // Collect a Node's related nodes. The default behaviour just collects the
1943 // inputs and outputs at depth 1, including both control and data flow edges,
1944 // regardless of whether the presentation is compact or not. For data nodes,
1945 // the default is to collect all data inputs (till level 1 if compact), and
1946 // outputs till level 1.
1947 void Node::related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const {
1948 if (this->is_CFG()) {
1949 collect_nodes_i(in_rel, this, 1, 1, false, false, false);
1950 collect_nodes_i(out_rel, this, -1, 1, false, false, false);
1951 } else {
1952 if (compact) {
1953 this->collect_nodes(in_rel, 1, false, true);
1954 } else {
1955 this->collect_nodes_in_all_data(in_rel, false);
1956 }
1957 this->collect_nodes(out_rel, -1, false, false);
1958 }
1959 }
1960
1961 //---------------------------collect_nodes-------------------------------------
1962 // An entry point to the low-level node collection facility, to start from a
1963 // given node in the graph. The start node is by default not included in the
1964 // result.
1965 // Arguments:
1966 // ns: collect the nodes into this data structure.
1967 // d: the depth (distance from start node) to which nodes should be
1968 // collected. A value >0 indicates input nodes, a value <0, output
1969 // nodes.
1970 // ctrl: include only control nodes.
1971 // data: include only data nodes.
1972 void Node::collect_nodes(GrowableArray<Node*> *ns, int d, bool ctrl, bool data) const {
1973 if (ctrl && data) {
1974 // ignore nonsensical combination
1975 return;
1976 }
1977 collect_nodes_i(ns, this, d, (uint) ABS(d), false, ctrl, data);
1978 }
1979
1980 //--------------------------collect_nodes_in-----------------------------------
1981 static void collect_nodes_in(Node* start, GrowableArray<Node*> *ns, bool primary_is_data, bool collect_secondary) {
1982 // The maximum depth is determined using a BFS that visits all primary (data
1983 // or control) inputs and increments the depth at each level.
1984 uint d_in = 0;
1985 GrowableArray<Node*> nodes(Compile::current()->unique());
1986 nodes.push(start);
1987 int nodes_at_current_level = 1;
1988 int n_idx = 0;
1989 while (nodes_at_current_level > 0) {
1990 // Add all primary inputs reachable from the current level to the list, and
1991 // increase the depth if there were any.
1992 int nodes_at_next_level = 0;
1993 bool nodes_added = false;
1994 while (nodes_at_current_level > 0) {
1995 nodes_at_current_level--;
1996 Node* current = nodes.at(n_idx++);
1997 for (uint i = 0; i < current->len(); i++) {
1998 Node* n = current->in(i);
1999 if (NotANode(n)) {
2000 continue;
2001 }
2002 if ((primary_is_data && n->is_CFG()) || (!primary_is_data && !n->is_CFG())) {
2003 continue;
2004 }
2005 if (!nodes.contains(n)) {
2006 nodes.push(n);
2007 nodes_added = true;
2008 nodes_at_next_level++;
2009 }
2010 }
2011 }
2012 if (nodes_added) {
2013 d_in++;
2014 }
2015 nodes_at_current_level = nodes_at_next_level;
2016 }
2017 start->collect_nodes(ns, d_in, !primary_is_data, primary_is_data);
2018 if (collect_secondary) {
2019 // Now, iterate over the secondary nodes in ns and add the respective
2020 // boundary reachable from them.
2021 GrowableArray<Node*> sns(Compile::current()->unique());
2022 for (GrowableArrayIterator<Node*> it = ns->begin(); it != ns->end(); ++it) {
2023 Node* n = *it;
2024 n->collect_nodes(&sns, 1, primary_is_data, !primary_is_data);
2025 for (GrowableArrayIterator<Node*> d = sns.begin(); d != sns.end(); ++d) {
2026 ns->append_if_missing(*d);
2027 }
2028 sns.clear();
2029 }
2030 }
2031 }
2032
2033 //---------------------collect_nodes_in_all_data-------------------------------
2034 // Collect the entire data input graph. Include the control boundary if
2035 // requested.
2036 // Arguments:
2037 // ns: collect the nodes into this data structure.
2038 // ctrl: if true, include the control boundary.
2039 void Node::collect_nodes_in_all_data(GrowableArray<Node*> *ns, bool ctrl) const {
2040 collect_nodes_in((Node*) this, ns, true, ctrl);
2041 }
2042
2043 //--------------------------collect_nodes_in_all_ctrl--------------------------
2044 // Collect the entire control input graph. Include the data boundary if
2045 // requested.
2046 // ns: collect the nodes into this data structure.
2047 // data: if true, include the control boundary.
2048 void Node::collect_nodes_in_all_ctrl(GrowableArray<Node*> *ns, bool data) const {
2049 collect_nodes_in((Node*) this, ns, false, data);
2050 }
2051
2052 //------------------collect_nodes_out_all_ctrl_boundary------------------------
2053 // Collect the entire output graph until hitting control node boundaries, and
2054 // include those.
2055 void Node::collect_nodes_out_all_ctrl_boundary(GrowableArray<Node*> *ns) const {
2056 // Perform a BFS and stop at control nodes.
2057 GrowableArray<Node*> nodes(Compile::current()->unique());
2058 nodes.push((Node*) this);
2059 while (nodes.length() > 0) {
2060 Node* current = nodes.pop();
2061 if (NotANode(current)) {
2062 continue;
2063 }
2064 ns->append_if_missing(current);
2065 if (!current->is_CFG()) {
2066 for (DUIterator i = current->outs(); current->has_out(i); i++) {
2067 nodes.push(current->out(i));
2068 }
2069 }
2070 }
2071 ns->remove((Node*) this);
2072 }
2073
2074 // VERIFICATION CODE
2075 // For each input edge to a node (ie - for each Use-Def edge), verify that
2076 // there is a corresponding Def-Use edge.
2077 //------------------------------verify_edges-----------------------------------
2078 void Node::verify_edges(Unique_Node_List &visited) {
2079 uint i, j, idx;
2080 int cnt;
2081 Node *n;
2082
2083 // Recursive termination test
2084 if (visited.member(this)) return;
2085 visited.push(this);
2086
2087 // Walk over all input edges, checking for correspondence
2088 for( i = 0; i < len(); i++ ) {
2089 n = in(i);
2090 if (n != NULL && !n->is_top()) {
2091 // Count instances of (Node *)this
2092 cnt = 0;
2093 for (idx = 0; idx < n->_outcnt; idx++ ) {
2094 if (n->_out[idx] == (Node *)this) cnt++;
2095 }
2096 assert( cnt > 0,"Failed to find Def-Use edge." );
2097 // Check for duplicate edges
2098 // walk the input array downcounting the input edges to n
2099 for( j = 0; j < len(); j++ ) {
2100 if( in(j) == n ) cnt--;
2101 }
2102 assert( cnt == 0,"Mismatched edge count.");
2103 } else if (n == NULL) {
2104 assert(i >= req() || i == 0 || is_Region() || is_Phi(), "only regions or phis have null data edges");
2105 } else {
2106 assert(n->is_top(), "sanity");
2107 // Nothing to check.
2108 }
2109 }
2110 // Recursive walk over all input edges
2111 for( i = 0; i < len(); i++ ) {
2112 n = in(i);
2113 if( n != NULL )
2114 in(i)->verify_edges(visited);
2115 }
2116 }
2117
2118 //------------------------------verify_recur-----------------------------------
2119 static const Node *unique_top = NULL;
2120
2121 void Node::verify_recur(const Node *n, int verify_depth,
2122 VectorSet &old_space, VectorSet &new_space) {
2123 if ( verify_depth == 0 ) return;
2124 if (verify_depth > 0) --verify_depth;
2125
2126 Compile* C = Compile::current();
2127
2128 // Contained in new_space or old_space?
2129 VectorSet *v = C->node_arena()->contains(n) ? &new_space : &old_space;
2130 // Check for visited in the proper space. Numberings are not unique
2131 // across spaces so we need a separate VectorSet for each space.
2132 if( v->test_set(n->_idx) ) return;
2133
2134 if (n->is_Con() && n->bottom_type() == Type::TOP) {
2135 if (C->cached_top_node() == NULL)
2136 C->set_cached_top_node((Node*)n);
2137 assert(C->cached_top_node() == n, "TOP node must be unique");
2138 }
2139
2140 for( uint i = 0; i < n->len(); i++ ) {
2141 Node *x = n->in(i);
2142 if (!x || x->is_top()) continue;
2143
2144 // Verify my input has a def-use edge to me
2145 if (true /*VerifyDefUse*/) {
2146 // Count use-def edges from n to x
2147 int cnt = 0;
2148 for( uint j = 0; j < n->len(); j++ )
2149 if( n->in(j) == x )
2150 cnt++;
2151 // Count def-use edges from x to n
2152 uint max = x->_outcnt;
2153 for( uint k = 0; k < max; k++ )
2154 if (x->_out[k] == n)
2155 cnt--;
2156 assert( cnt == 0, "mismatched def-use edge counts" );
2157 }
2158
2159 verify_recur(x, verify_depth, old_space, new_space);
2160 }
2161
2162 }
2163
2164 //------------------------------verify-----------------------------------------
2165 // Check Def-Use info for my subgraph
2166 void Node::verify() const {
2167 Compile* C = Compile::current();
2168 Node* old_top = C->cached_top_node();
2169 ResourceMark rm;
2170 ResourceArea *area = Thread::current()->resource_area();
2171 VectorSet old_space(area), new_space(area);
2172 verify_recur(this, -1, old_space, new_space);
2173 C->set_cached_top_node(old_top);
2174 }
2175 #endif
2176
2177
2178 //------------------------------walk-------------------------------------------
2179 // Graph walk, with both pre-order and post-order functions
2180 void Node::walk(NFunc pre, NFunc post, void *env) {
2181 VectorSet visited(Thread::current()->resource_area()); // Setup for local walk
2182 walk_(pre, post, env, visited);
2183 }
2184
2185 void Node::walk_(NFunc pre, NFunc post, void *env, VectorSet &visited) {
2186 if( visited.test_set(_idx) ) return;
2187 pre(*this,env); // Call the pre-order walk function
2188 for( uint i=0; i<_max; i++ )
2189 if( in(i) ) // Input exists and is not walked?
2190 in(i)->walk_(pre,post,env,visited); // Walk it with pre & post functions
2191 post(*this,env); // Call the post-order walk function
2192 }
2193
2194 void Node::nop(Node &, void*) {}
2195
2196 //------------------------------Registers--------------------------------------
2197 // Do we Match on this edge index or not? Generally false for Control
2198 // and true for everything else. Weird for calls & returns.
2199 uint Node::match_edge(uint idx) const {
2200 return idx; // True for other than index 0 (control)
2201 }
2202
2203 static RegMask _not_used_at_all;
2204 // Register classes are defined for specific machines
2205 const RegMask &Node::out_RegMask() const {
2206 ShouldNotCallThis();
2207 return _not_used_at_all;
2208 }
2209
2210 const RegMask &Node::in_RegMask(uint) const {
2211 ShouldNotCallThis();
2212 return _not_used_at_all;
2213 }
2214
2215 //=============================================================================
2216 //-----------------------------------------------------------------------------
2217 void Node_Array::reset( Arena *new_arena ) {
2218 _a->Afree(_nodes,_max*sizeof(Node*));
2219 _max = 0;
2220 _nodes = NULL;
2221 _a = new_arena;
2222 }
2223
2224 //------------------------------clear------------------------------------------
2225 // Clear all entries in _nodes to NULL but keep storage
2226 void Node_Array::clear() {
2227 Copy::zero_to_bytes( _nodes, _max*sizeof(Node*) );
2228 }
2229
2230 //-----------------------------------------------------------------------------
2231 void Node_Array::grow( uint i ) {
2232 if( !_max ) {
2233 _max = 1;
2234 _nodes = (Node**)_a->Amalloc( _max * sizeof(Node*) );
2235 _nodes[0] = NULL;
2236 }
2237 uint old = _max;
2238 while( i >= _max ) _max <<= 1; // Double to fit
2239 _nodes = (Node**)_a->Arealloc( _nodes, old*sizeof(Node*),_max*sizeof(Node*));
2240 Copy::zero_to_bytes( &_nodes[old], (_max-old)*sizeof(Node*) );
2241 }
2242
2243 //-----------------------------------------------------------------------------
2244 void Node_Array::insert( uint i, Node *n ) {
2245 if( _nodes[_max-1] ) grow(_max); // Get more space if full
2246 Copy::conjoint_words_to_higher((HeapWord*)&_nodes[i], (HeapWord*)&_nodes[i+1], ((_max-i-1)*sizeof(Node*)));
2247 _nodes[i] = n;
2248 }
2249
2250 //-----------------------------------------------------------------------------
2251 void Node_Array::remove( uint i ) {
2252 Copy::conjoint_words_to_lower((HeapWord*)&_nodes[i+1], (HeapWord*)&_nodes[i], ((_max-i-1)*sizeof(Node*)));
2253 _nodes[_max-1] = NULL;
2254 }
2255
2256 //-----------------------------------------------------------------------------
2257 void Node_Array::sort( C_sort_func_t func) {
2258 qsort( _nodes, _max, sizeof( Node* ), func );
2259 }
2260
2261 //-----------------------------------------------------------------------------
2262 void Node_Array::dump() const {
2263 #ifndef PRODUCT
2264 for( uint i = 0; i < _max; i++ ) {
2265 Node *nn = _nodes[i];
2266 if( nn != NULL ) {
2267 tty->print("%5d--> ",i); nn->dump();
2268 }
2269 }
2270 #endif
2271 }
2272
2273 //--------------------------is_iteratively_computed------------------------------
2274 // Operation appears to be iteratively computed (such as an induction variable)
2275 // It is possible for this operation to return false for a loop-varying
2276 // value, if it appears (by local graph inspection) to be computed by a simple conditional.
2277 bool Node::is_iteratively_computed() {
2278 if (ideal_reg()) { // does operation have a result register?
2279 for (uint i = 1; i < req(); i++) {
2280 Node* n = in(i);
2281 if (n != NULL && n->is_Phi()) {
2282 for (uint j = 1; j < n->req(); j++) {
2283 if (n->in(j) == this) {
2284 return true;
2285 }
2286 }
2287 }
2288 }
2289 }
2290 return false;
2291 }
2292
2293 //--------------------------find_similar------------------------------
2294 // Return a node with opcode "opc" and same inputs as "this" if one can
2295 // be found; Otherwise return NULL;
2296 Node* Node::find_similar(int opc) {
2297 if (req() >= 2) {
2298 Node* def = in(1);
2299 if (def && def->outcnt() >= 2) {
2300 for (DUIterator_Fast dmax, i = def->fast_outs(dmax); i < dmax; i++) {
2301 Node* use = def->fast_out(i);
2302 if (use != this &&
2303 use->Opcode() == opc &&
2304 use->req() == req()) {
2305 uint j;
2306 for (j = 0; j < use->req(); j++) {
2307 if (use->in(j) != in(j)) {
2308 break;
2309 }
2310 }
2311 if (j == use->req()) {
2312 return use;
2313 }
2314 }
2315 }
2316 }
2317 }
2318 return NULL;
2319 }
2320
2321
2322 //--------------------------unique_ctrl_out------------------------------
2323 // Return the unique control out if only one. Null if none or more than one.
2324 Node* Node::unique_ctrl_out() const {
2325 Node* found = NULL;
2326 for (uint i = 0; i < outcnt(); i++) {
2327 Node* use = raw_out(i);
2328 if (use->is_CFG() && use != this) {
2329 if (found != NULL) return NULL;
2330 found = use;
2331 }
2332 }
2333 return found;
2334 }
2335
2336 void Node::ensure_control_or_add_prec(Node* c) {
2337 if (in(0) == NULL) {
2338 set_req(0, c);
2339 } else if (in(0) != c) {
2340 add_prec(c);
2341 }
2342 }
2343
2344 //=============================================================================
2345 //------------------------------yank-------------------------------------------
2346 // Find and remove
2347 void Node_List::yank( Node *n ) {
2348 uint i;
2349 for( i = 0; i < _cnt; i++ )
2350 if( _nodes[i] == n )
2351 break;
2352
2353 if( i < _cnt )
2354 _nodes[i] = _nodes[--_cnt];
2355 }
2356
2357 //------------------------------dump-------------------------------------------
2358 void Node_List::dump() const {
2359 #ifndef PRODUCT
2360 for( uint i = 0; i < _cnt; i++ )
2361 if( _nodes[i] ) {
2362 tty->print("%5d--> ",i);
2363 _nodes[i]->dump();
2364 }
2365 #endif
2366 }
2367
2368 void Node_List::dump_simple() const {
2369 #ifndef PRODUCT
2370 for( uint i = 0; i < _cnt; i++ )
2371 if( _nodes[i] ) {
2372 tty->print(" %d", _nodes[i]->_idx);
2373 } else {
2374 tty->print(" NULL");
2375 }
2376 #endif
2377 }
2378
2379 //=============================================================================
2380 //------------------------------remove-----------------------------------------
2381 void Unique_Node_List::remove( Node *n ) {
2382 if( _in_worklist[n->_idx] ) {
2383 for( uint i = 0; i < size(); i++ )
2384 if( _nodes[i] == n ) {
2385 map(i,Node_List::pop());
2386 _in_worklist >>= n->_idx;
2387 return;
2388 }
2389 ShouldNotReachHere();
2390 }
2391 }
2392
2393 //-----------------------remove_useless_nodes----------------------------------
2394 // Remove useless nodes from worklist
2395 void Unique_Node_List::remove_useless_nodes(VectorSet &useful) {
2396
2397 for( uint i = 0; i < size(); ++i ) {
2398 Node *n = at(i);
2399 assert( n != NULL, "Did not expect null entries in worklist");
2400 if( ! useful.test(n->_idx) ) {
2401 _in_worklist >>= n->_idx;
2402 map(i,Node_List::pop());
2403 // Node *replacement = Node_List::pop();
2404 // if( i != size() ) { // Check if removing last entry
2405 // _nodes[i] = replacement;
2406 // }
2407 --i; // Visit popped node
2408 // If it was last entry, loop terminates since size() was also reduced
2409 }
2410 }
2411 }
2412
2413 //=============================================================================
2414 void Node_Stack::grow() {
2415 size_t old_top = pointer_delta(_inode_top,_inodes,sizeof(INode)); // save _top
2416 size_t old_max = pointer_delta(_inode_max,_inodes,sizeof(INode));
2417 size_t max = old_max << 1; // max * 2
2418 _inodes = REALLOC_ARENA_ARRAY(_a, INode, _inodes, old_max, max);
2419 _inode_max = _inodes + max;
2420 _inode_top = _inodes + old_top; // restore _top
2421 }
2422
2423 // Node_Stack is used to map nodes.
2424 Node* Node_Stack::find(uint idx) const {
2425 uint sz = size();
2426 for (uint i=0; i < sz; i++) {
2427 if (idx == index_at(i) )
2428 return node_at(i);
2429 }
2430 return NULL;
2431 }
2432
2433 //=============================================================================
2434 uint TypeNode::size_of() const { return sizeof(*this); }
2435 #ifndef PRODUCT
2436 void TypeNode::dump_spec(outputStream *st) const {
2437 if( !Verbose && !WizardMode ) {
2438 // standard dump does this in Verbose and WizardMode
2439 st->print(" #"); _type->dump_on(st);
2440 }
2441 }
2442
2443 void TypeNode::dump_compact_spec(outputStream *st) const {
2444 st->print("#");
2445 _type->dump_on(st);
2446 }
2447 #endif
2448 uint TypeNode::hash() const {
2449 return Node::hash() + _type->hash();
2450 }
2451 uint TypeNode::cmp( const Node &n ) const
2452 { return !Type::cmp( _type, ((TypeNode&)n)._type ); }
2453 const Type *TypeNode::bottom_type() const { return _type; }
2454 const Type* TypeNode::Value(PhaseGVN* phase) const { return _type; }
2455
2456 //------------------------------ideal_reg--------------------------------------
2457 uint TypeNode::ideal_reg() const {
2458 return _type->ideal_reg();
2459 }