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