Searched refs:new_node (Results 1 - 5 of 5) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dmatcher.hpp105 Node* new_node(const Node* n) const { function in class:Matcher
464 Node* find_old_node(Node* new_node) { argument
465 return _new2old_map[new_node->_idx];
H A Dloopnode.hpp679 // the 'old_node' with 'new_node'. Kill old-node. Add a reference
680 // from old_node to new_node to support the lazy update. Reference
683 void lazy_update( Node *old_node, Node *new_node ) {
684 assert( old_node != new_node, "no cycles please" );
685 //old_node->set_req( 1, new_node /*NO DU INFO*/ );
688 _nodes.map( old_node->_idx, (Node*)((intptr_t)new_node + 1) );
690 void lazy_replace( Node *old_node, Node *new_node ) {
691 _igvn.replace_node( old_node, new_node );
692 lazy_update( old_node, new_node );
694 void lazy_replace_proj( Node *old_node, Node *new_node ) {
[all...]
H A DphaseX.cpp1493 Node *new_node = _nodes[n->_idx]; // Check for transformed node local
1494 if( new_node != NULL )
1495 return new_node; // Been there, done that, return old answer
1496 new_node = transform_once(n); // Check for constant
1497 _nodes.map( n->_idx, new_node ); // Flag as having been cloned
1502 trstack.push(new_node); // Process children of cloned node
1519 return new_node;
1753 void Node::replace_by(Node *new_node) { argument
1761 use->set_req(j, new_node);
1762 else use->set_prec(j, new_node);
[all...]
H A Dnode.hpp456 void replace_by(Node* new_node);
459 void subsume_by(Node* new_node, Compile* c) { argument
460 replace_by(new_node);
H A Dmatcher.cpp339 // Pre-size the new_node table to avoid the need for range checks.
997 m = new_node(n);
1588 Node* xroot = new_node(C->root());
2279 Node* new_val = new_node(val);

Completed in 55 milliseconds