Cross Reference: /openjdk7/hotspot/src/share/vm/opto/superword.cpp

Lines Matching refs:node
48   _bb_idx(arena(), (int)(1.10 * phase->C->unique()), 0, 0), // node idx to index in bb
53   _node_info(arena(), 8,  0, SWNodeInfo::initial), // info needed per node
57   _visited(arena()),                      // visited node set
58   _post_visited(arena()),                 // post visited node set
59   _n_idx_list(arena(), 8),                // scratch list of (node,index) pairs
62   _lpt(NULL),                             // loop tree node
117 // 3) The maximum depth in the node graph from the beginning of the block
118 //    to each node is computed.  This is used to prune the graph search
428       tty->print("\nVector align to node: ");
507   // First, assign a dependence node to each memory node
588 // Return a memory slice (node list) in predecessor order starting at "start"
619     assert(n->is_Mem(), err_msg_res("unexpected node %s", n->Name()));
1002 // point where a node is only in one pack (after combine_packs).
1340 // Convert packs into vector node operations
1418         tty->print("new Vector node: ");
1479       tty->print("new Vector node: ");
1502     tty->print("new Vector node: ");
1514   assert(_n_idx_list.is_empty(), "empty (node,index) list");
1535     Node* use = _n_idx_list.node();
1593   // create a temporary map from node _idx to bb_idx for use
1632           assert(n_tail->is_Mem(), err_msg_res("unexpected node for memory slice: %s", n_tail->Name()));
1659     Node* n = _stk.top(); // Leave node on stack
1673         // There were no additional uses, post visit node now
1674         _stk.pop(); // Remove node from stack
1682       _stk.pop(); // Remove post-visited node from stack
1714 // Initialize per node info
1734   // Adjust map from node->_idx to _block index
1944 // Return the node executed first in pack p.  Uses the RPO block list
1961 // Return the node executed last in pack p.
1994   // pre-loop Opaque1 node.
2417 // Make a new dependence graph node for an ideal node.
2418 DepMem* DepGraph::make_node(Node* node) {
2419   DepMem* m = new (_arena) DepMem(node);
2420   if (node != NULL) {
2421     assert(_map.at_grow(node->_idx) == NULL, "one init only");
2422     _map.at_put_grow(node->_idx, m);
2457     Node* pred = p->pred()->node();
2462     Node* succ = s->succ()->node();
2474   tty->print_cr("DepEdge: %d [ %d ]", _pred->node()->_idx, _succ->node()->_idx);
2504     _current  = _dep_next->pred()->node();
2539     _current  = _dep_next->succ()->node();