Change a def into a Node. Keeps the edges correct, by removing the corresponding use->def edge. This may make the original def go dead. This function is co-recursive with #kill. This method is the normal path for altering a Node, because it does the proper d
(int idx, N new_def )
| 153 | * @return new_def for flow coding |
| 154 | */ |
| 155 | public <N extends Node> N setDef(int idx, N new_def ) { |
| 156 | unlock(); |
| 157 | Node old_def = in(idx); |
| 158 | if( old_def == new_def ) return new_def; // No change |
| 159 | // If new def is not null, add the corresponding def->use edge |
| 160 | // This needs to happen before removing the old node's def->use edge as |
| 161 | // the new_def might get killed if the old node kills it recursively. |
| 162 | if( new_def != null ) |
| 163 | new_def.addUse(this); |
| 164 | // Set the new_def over the old (killed) edge |
| 165 | _inputs.set(idx,new_def); |
| 166 | if( old_def != null ) { // If the old def exists, remove a def->use edge |
| 167 | if( old_def.delUse(this) ) // If we removed the last use, the old def is now dead |
| 168 | old_def.kill(); // Kill old def |
| 169 | else IterPeeps.add(old_def);// Else old lost a use, so onto worklist |
| 170 | } |
| 171 | moveDepsToWorklist(); |
| 172 | // Return new_def for easy flow-coding |
| 173 | return new_def; |
| 174 | } |
| 175 | |
| 176 | // Remove the numbered input, compressing the inputs in-place. This |
| 177 | // shuffles the order deterministically - which is suitable for Region and |
no test coverage detected