Lines Matching refs:node
42 // Determine if a node is Counted loop induction variable.
43 // The method is declared in node.hpp.
56 // Dump special per-node info
144 // Move node up the dominator tree as high as legal while still beneficial
146 assert(n->in(0) && n->is_expensive(), "expensive node with control input here");
164 // Moving the node out of a loop on the projection of a If
168 // move the node further up.
198 // control). If so, we can try to move the node above the
214 assert(parent_ctl->is_Start() || parent_ctl->is_MemBar() || parent_ctl->is_Call(), "unexpected node");
518 // Replace condition in original predicate but preserve Opaque node
830 // Create new LoopLimit node to get exact limit (final iv value).
839 // Return a node which is more "ideal" than the current node.
851 // Return a node which is more "ideal" than the current node.
858 // Dump special per-node info
909 // Return a node which is more "ideal" than the current node.
956 !Matcher::has_match_rule(Op_LoopLimit)) { // or no specialized Mach node?
991 // If stride == 1 return limit node.
1003 // Return NULL for failure. Success returns the increment node.
1148 // Dump special per-node info
1217 // with the CSE to avoid O(N^2) node blow-up.
1220 p->destruct(); // Recover useless new node
1221 p = p2; // Use old node
1975 // Opaque1 node (see Parse::add_predicate()).
1996 // from commoning them and as a result forcing the resulting node to
2052 // Look for identical expensive node up the dominator chain.
2059 // Both branches have the same expensive node so move it up
2187 // a persistent side array for that info indexed on node->_idx.
2215 // node. For CFG nodes, the _nodes array starts out and remains
2217 // _nodes array holds the earliest legal controlling CFG node.
2664 // the dom tree from each node marked "no depth yet", and computes
2680 // Compute new depth for each node.
2683 // Run up the dom tree to find a node with a depth
2774 n = bltstack.top(); // Leave node on stack
2816 // There were no additional children, post visit node now
2817 (void)bltstack.pop(); // Remove node from stack
2829 (void)bltstack.pop(); // Remove post-visited node from stack
3010 // First pass computes the earliest controlling node possible. This is the
3020 // Get parent node and next input's index from stack's top.
3024 if (i == 0) { // Pre-process the node.
3056 // Get next node from nstack:
3077 nstack.push(n, i); // Save parent node and next input's index.
3102 // Process next node on the worklist.
3105 // Get saved parent node and next input's index.
3106 nstack_top_n = nstack.node();
3199 continue; // Skip the occasional dead node
3270 // true if CFG node d dominates CFG node n
3286 // Tag each index with the node 'tag' currently being processed
3290 // Since get_late_ctrl() is only called once for each node, the tag array
3345 // Tag could be a node's integer index, 32bits instead of 64bits in some cases
3353 assert(_dom_lca_tags[i] == NULL, "Must be distinct from each node pointer");
3359 // Tag could be a node's integer index, 32bits instead of 64bits in some cases
3368 assert(_dom_lca_tags[i] == NULL, "Must be distinct from each node pointer");
3415 // Process next node on the worklist.
3418 // Get saved parent node and next use's index. Visit the rest of uses.
3419 n = nstack.node();
3500 _nodes.map(n->_idx, 0); // This node is useless
3673 // Dump controlling node
3685 // any MultiBranch ctrl node), so apply a similar transform to
3723 Node* m = stk.node();