X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgopt.h;h=70b48980a6dd229db87a18dbea585708b91849ac;hb=95ea45b6d9050f3638c68dda8c4fcc92a79c81ed;hp=910cbc34d1e253162420cd3f4465503662f39360;hpb=73b13cb6d828609c7a37f3df339ea0717b34e36f;p=libfirm

diff --git a/ir/ir/irgopt.h b/ir/ir/irgopt.h
index 910cbc34d..70b48980a 100644
--- a/ir/ir/irgopt.h
+++ b/ir/ir/irgopt.h
@@ -58,6 +58,28 @@ void local_optimize_graph (ir_graph *irg);
  */
 void dead_node_elimination(ir_graph *irg);
 
+typedef struct _survive_dce_t survive_dce_t;
+
+/**
+ * Make a new Survive DCE environment.
+ */
+survive_dce_t *new_survive_dce(void);
+
+/**
+ * Free a Survive DCE environment.
+ */
+void free_survive_dce(survive_dce_t *sd);
+
+/**
+ * Register a node pointer to be patched upon DCE.
+ * When DCE occurs, the node pointer specified by @p place will be
+ * patched to the new address of the node it is pointing to.
+ *
+ * @param sd    The Survive DCE environment.
+ * @param place The address of the node pointer.
+ */
+void survive_dce_register_irn(survive_dce_t *sd, ir_node **place);
+
 /**  Cleans the control flow from Bad predecesors.
  *
  * Removes Bad predecesors from Blocks and the corresponding
@@ -145,7 +167,7 @@ void inline_leave_functions(int maxsize, int leavesize, int size);
 
 /** Code Placement.
  *
- * Pinns all floating nodes to a block where they
+ * Pins all floating nodes to a block where they
  * will be executed only if needed.   Depends on the flag opt_global_cse.
  * Graph may not be in phase_building.  Does not schedule control dead
  * code.  Uses dominator information which it computes if the irg is not
@@ -168,25 +190,9 @@ void place_code(ir_graph *irg);
  * A critical control flow edge is an edge from a block with several
  * control exits to a block with several control entries (See Muchnic
  * p. 407).
- * Is only executed if flag set_opt_critical_edges() is set.
  *
  * @param irg IR Graph
  */
 void remove_critical_cf_edges(ir_graph *irg);
 
-/**
- * Copies a node to the current_ir_graph. The Ins of the new node point to
- * the predecessors on the graph of the old node.  For block/phi nodes not all
- * predecessors might be copied.
- * For Phi and Block nodes the function allocates in-arrays with an arity
- * only for useful predecessors.  The arity is determined by counting
- * the non-bad predecessors of the block.
- * Does NOT copy Bad nodes, as these are "local" to the graph.
- * Use get_irg_bad() instead.
- *
- * @param n             The node to be copied
- * @param copy_node_nr  if non-NULL, the node number attribute will be copied to the new node
- */
-ir_node *copy_irn(ir_node *n, int copy_node_nr);
-
 # endif /* _IRGOPT_H_ */