**
** Author: Christian Schaefer
**
-** dead node elemination
-** walks one time through the whole graph and copies it into another graph,
-** so unreachable nodes will be lost.
+** Optimizations for a whole ir graph, i.e., a procedure.
*/
# ifndef _IRGOPT_H_
void local_optimize_graph (ir_graph *irg);
/* Performs dead node elimination by copying the ir graph to a new obstack. */
-void dead_node_elemination(ir_graph *irg);
+void dead_node_elimination(ir_graph *irg);
# endif /* _IRGOPT_H_ */