* get_Block_irg for anchor */
res->in[0] = res;
- /* we can't have NULL inputs so reference ourselfes for now */
+ /* we can't have NULL inputs so reference ourselves for now */
for (i = 0; i <= (size_t)anchor_last; ++i) {
set_irn_n(res, i, res);
}
that a control flow edge can never be executed.
The gigo optimisations ensures that nodes with Bad as their block, get
- replaced by Bad themselfes. Nodes with at least 1 Bad input get exchanged
+ replaced by Bad themselves. Nodes with at least 1 Bad input get exchanged
with Bad too. Exception to this rule are Block, Phi, Tuple and End node;
This is because removing inputs from a Block is hairy operation (requiring,
Phis to be shortened too for example). So instead of removing block inputs