Lines Matching refs:node
50 // _sentinel must be in the current node space
65 // _sentinel must be in the current node space
75 // nh->_sentinel must be in the current node space
82 // nh->_sentinel must be in the current node space
147 debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
176 debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
212 debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
245 debug_only(((Node*)n)->exit_hash_lock()); // Unlock the node upon removal from table.
288 debug_only(m->exit_hash_lock()); // Unlock the node upon removal from old table.
320 debug_only(n->exit_hash_lock()); // Unlock the node when removed
393 // Update dead node list
480 // Call type_or_null(n) to determine node's type since we might be in
482 // (For example, a phi node at the beginning of loop parsing is not ready.)
621 // Small integer? Check cache! Check that cached node is not dead
637 // Small integer? Check cache! Check that cached node is not dead
666 // Return a node which computes the same function as this node, but in a
673 // Return a node which computes the same function as this node, but
691 // If brand new node, make space in type array.
702 // Do not count initial visit to node as a transformation
728 // Return the pre-existing node
739 // Check for a simple dead loop when a data node references itself directly
740 // or through an other data node excluding cons and phis.
799 assert( false, "Parse::remove_useless_nodes missed this node");
847 // Initialize worklist for each node.
877 // Pull from worklist; transform node;
878 // If node has changed: update edge info and put uses on worklist.
921 // print old node
931 // print new node and/or new type
998 // Register a new node with the optimizer. Update the types array, the def-use
1011 // Register the node but don't optimize for now
1016 // If brand new node, make space in type array, and give it a type.
1090 // If brand new node, make space in type array.
1107 // Move users of node to worklist
1130 i = hash_find_insert(k); // Check for pre-existing node
1132 // Return the pre-existing node if it isn't dead
1161 dead = _stack.node();
1229 // Remove dead node from iterative worklist
1231 // Constant node that has no out-edges and has only one in-edge from
1234 // as dead to be conservative about the dead node count at any
1250 // Remove users from node 'old' and add them to node 'nn'.
1253 assert( old != C->top(), "cannot subsume top node");
1256 // Move users of node 'old' to node 'nn'
1259 // use might need re-hashing (but it won't if it's a new node)
1263 // so as to avoid rehashing any node more than once.
1307 // Move users of node to worklist
1485 assert( C->top(), "missing TOP node" );
1493 Node *new_node = _nodes[n->_idx]; // Check for transformed node
1502 trstack.push(new_node); // Process children of cloned node
1509 Node *new_input = _nodes[input->_idx]; // Check for cloned input node
1531 // cache my top node on the Compile instance
1687 // the node index to live range mappings.)
1692 // install new node after safe_instruction_index
1713 assert( is_not_dead(n), "can not use dead node");
1723 // recursive kill will delete the current node (this) if dead-loop exists
1751 // Using def-use info, replace one node for another. Follow the def-use info
1752 // to all users of the OLD node. Then make all uses point to the NEW node.
1754 assert(!is_top(), "top node has no DU info");