-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
+/* Copyright (C) 1998 - 2001 by Universitaet Karlsruhe
** All rights reserved.
**
-** Author: Christian Schaefer
+** Author: Christian Schaefer, Goetz Lindenmaier
**
-** dead node elimination
-** 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_
# include "irgraph.h"
-/* Applies local optimizations (see iropt) to all nodes in the graph. */
+/* Applies local optimizations (see iropt.h) to all nodes in the graph. */
void local_optimize_graph (ir_graph *irg);
-/* Performs dead node elimination by copying the ir graph to a new obstack. */
+/* Performs dead node elimination by copying the ir graph to a new obstack.
+ Further removes Bad predecesors from Blocks and the corresponding
+ inputs to Phi nodes.
+ Attention: the numbers assigned to nodes if the library is compiled for
+ development/debugging are not conserved by copying. */
void dead_node_elimination(ir_graph *irg);
# endif /* _IRGOPT_H_ */