408 if (n != NULL) n->add_out((Node *)this); |
408 if (n != NULL) n->add_out((Node *)this); |
409 } |
409 } |
410 // Find first occurrence of n among my edges: |
410 // Find first occurrence of n among my edges: |
411 int find_edge(Node* n); |
411 int find_edge(Node* n); |
412 int replace_edge(Node* old, Node* neww); |
412 int replace_edge(Node* old, Node* neww); |
|
413 int replace_edges_in_range(Node* old, Node* neww, int start, int end); |
413 // NULL out all inputs to eliminate incoming Def-Use edges. |
414 // NULL out all inputs to eliminate incoming Def-Use edges. |
414 // Return the number of edges between 'n' and 'this' |
415 // Return the number of edges between 'n' and 'this' |
415 int disconnect_inputs(Node *n, Compile *c); |
416 int disconnect_inputs(Node *n, Compile *c); |
416 |
417 |
417 // Quickly, return true if and only if I am Compile::current()->top(). |
418 // Quickly, return true if and only if I am Compile::current()->top(). |