Lines Matching refs:node
65 // Insert node n into block b. Look for projections of n and make sure they
98 assert(!n->pinned() || n->is_MachConstantBase(), "only pinned MachConstantBase node is expected here");
124 // Allocate node stack of size C->unique()+8 to avoid frequent realloc
129 if( !visited.test_set(n->_idx) ) { // Test node and flag it as visited
170 tty->print("Failing node: ");
218 // Get parent node and next input's index from stack's top.
251 nstack.push(n, i); // Save parent node and next input's index.
275 // Process next node on the worklist 'roots'.
278 // Get saved parent node and next input's index.
279 nstack_top_n = nstack.node();
385 // point of the node. We compute this earlier block as a more permissive
461 // If some particular type of node validly consumes all of memory,
547 || op == Op_MergeMem // internal node of tree we are searching
866 // Compute the latency impact of this node on all defs. This computes
872 tty->print("# latency_to_inputs: node_latency[%d] = %d for node",
993 tty->print("# latency_from_outputs: node_latency[%d] = %d for node",
1011 // Pick a block for node self, between early and LCA, that is a cheaper
1132 // Top node goes in bb #2 with other constants.
1144 // If node is pinned in the block, then no scheduling can be done.
1234 // Put the node into target block