X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.h;h=ac6956820bc6d9c08071f4079ce28fc9e99fcedc;hb=7ac90687a76ac7f73c98dca2881b641f2f77ed55;hp=15b7de7bf80080d96046c70066de21cdd3061f21;hpb=9b24fe0ec0f4412c790ee4a7c6fc022fd28064a1;p=libfirm

diff --git a/ir/be/beirgmod.h b/ir/be/beirgmod.h
index 15b7de7bf..ac6956820 100644
--- a/ir/be/beirgmod.h
+++ b/ir/be/beirgmod.h
@@ -10,6 +10,9 @@
 #ifndef _BEIRGMOD_H
 #define _BEIRGMOD_H
 
+#include "firm_types.h"
+#include "pset.h"
+
 /*
  * Forward type declaration.
  */
@@ -44,18 +47,54 @@ void be_free_dominance_frontiers(dom_front_info_t *info);
  * represent the same concrete value. This is the case if you
  * - copy
  * - spill and reload
- * - rematerialize
+ * - re-materialize
  * a value.
  *
  * This function reroutes all uses of the original value to the copies in the
- * corresponding dominance subtrees and creates Phi functions if neccessary.
+ * corresponding dominance subtrees and creates Phi functions if necessary.
  *
- * @param info		Dominance frontier information.
- * @param orig		The node for which you want to introduce copies.
- * @param n			The number of copies ypu introduce.
- * @param copies	An array of nodes which are copies of @p orig.
+ * @param info		  Dominance frontier information.
+ * @param n           Length of nodes array.
+ * @param nodes       The nodes which shall represent the same SSA value.
+ * @param phis        A set to which all inserted Phis are added.
+ * @param ignore_uses A set of nodes probably using one of the nodes in @p nodes.
+ *                    Their usage will not adjusted. They remain untouched by this function.
+ */
+void be_ssa_constr_phis_ignore(dom_front_info_t *info, int n, ir_node *nodes[], pset *phis, pset *ignore_uses);
+
+/**
+ * Same as be_ssa_constr_phis_ignore() but without the ignore set.
+ */
+void be_ssa_constr_phis(dom_front_info_t *info, int n, ir_node *nodes[], pset *phis);
+
+/**
+ * Same as be_ssa_constr_phis_ignore() but without the Phi set.
+ */
+void be_ssa_constr_ignore(dom_front_info_t *info, int n, ir_node *nodes[], pset *ignore_uses);
+
+/**
+ * Same as be_ssa_constr_ignore() but with empty ignore set.
+ */
+void be_ssa_constr(dom_front_info_t *info, int n, ir_node *nodes[]);
+
+/**
+ * Same as be_ssa_constr_ignore() but with pset instead of array.
+ */
+void be_ssa_constr_set_ignore(dom_front_info_t *df, pset *nodes, pset *ignore_uses);
+
+/**
+ * Same as be_ssa_constr() but with pset instead of array.
+ */
+void be_ssa_constr_set(dom_front_info_t *info, pset *nodes);
+
+/**
+ * Same as be_ssa_constr_phis_ignore() but with set instead of array.
+ */
+void be_ssa_constr_set_phis_ignore(dom_front_info_t *info, pset *nodes, pset *phis, pset *ignore);
+
+/**
+ * Same as be_ssa_constr_phis_ignore() but without ignore set.
  */
-void be_introduce_copies(dom_front_info_t *info, ir_node *orig,
-    int n, ir_node *copies[]);
+void be_ssa_constr_set_phis(dom_front_info_t *info, pset *nodes, pset *phis);
 
-#endif
+#endif /* _BEIRGMOD_H */