*
* @param irg The graph to be optimized.
*
- * After appliying local_optimize_graph() to a IR-graph, Bad nodes
+ * After applying local_optimize_graph() to a IR-graph, Bad nodes
* only occure as predecessor of Block and Phi nodes.
*/
void local_optimize_graph (ir_graph *irg);
* Removes old attributes of nodes. Sets link field to NULL.
* Callee information must be freed (irg_callee_info_none).
*
- * Attention: the numbers assigned to nodes if the library is compiled for
- * development/debugging are not conserved by copying.
- *
* @param irg The graph to be optimized.
*/
void dead_node_elimination(ir_graph *irg);
* inputs to Phi nodes as in dead_node_elimination but without
* copying the graph.
*
+ * Conserves loop information.
+ *
* @param irg The graph to be optimized.
*/
void remove_bad_predecessors(ir_graph *irg);