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