(int idx)
| 200 | // shuffles the order deterministically - which is suitable for Region and |
| 201 | // Phi, but not for every Node. |
| 202 | void delDef(int idx) { |
| 203 | Node old_def = in(idx); |
| 204 | if( old_def != null && // If the old def exists, remove a def->use edge |
| 205 | old_def.delUse(this) ) // If we removed the last use, the old def is now dead |
| 206 | old_def.kill(); // Kill old def |
| 207 | Utils.del(_inputs, idx); |
| 208 | } |
| 209 | |
| 210 | /** |
| 211 | * Add a new def to an existing Node. Keep the edges correct by |