1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Author: Christian Schaefer
6 ** dead node elemination
7 ** walks one time through the whole graph and copies it into another graph,
8 ** so unreachable nodes will be lost.
17 void local_optimize_graph (ir_graph *irg);
19 void dead_node_elemination(ir_graph *irg);
21 # endif /* _IRGOPT_H_ */