X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.h;h=33f4ea92f090a9bee7e15e38f64a90547caba57d;hb=b9d45e08e23bcf058fa8f2d9e18dd78e8cccd044;hp=691b53f2e284cded1e92f8dba05366eb4949e31e;hpb=4c66ebcce62ceffb68a891142dd309429e03351a;p=libfirm

diff --git a/ir/be/beirgmod.h b/ir/be/beirgmod.h
index 691b53f2e..33f4ea92f 100644
--- a/ir/be/beirgmod.h
+++ b/ir/be/beirgmod.h
@@ -10,8 +10,11 @@
 #ifndef _BEIRGMOD_H
 #define _BEIRGMOD_H
 
+#include "firm_types.h"
 #include "pset.h"
 
+#include "belive.h"
+
 /*
  * Forward type declaration.
  */
@@ -46,20 +49,81 @@ 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 lv          Liveness information to be updated. If NULL, liveness updating is simply ignored.
+ * @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, be_lv_t *lv, 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, be_lv_t *lv, 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, be_lv_t *lv, 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, be_lv_t *lv, 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, be_lv_t *lv, 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, be_lv_t *lv, 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, be_lv_t *lv, pset *nodes, pset *phis, pset *ignore);
+
+/**
+ * Same as be_ssa_constr_phis_ignore() but without ignore set.
+ */
+void be_ssa_constr_set_phis(dom_front_info_t *info, be_lv_t *lv, pset *nodes, pset *phis);
+
+/**
+ * Insert a Perm which permutes all (non-ignore) live values of a given register class
+ * after a certain instruction.
+ * @param arch_env  The architecture environment.
+ * @param lv        Liveness Information.
+ * @param cls       The register class.
+ * @param dom_front Dominance frontier information.
+ * @param irn       The node to insert the Perm after.
+ * @return          The Perm or NULL if nothing was live before @p irn.
+ */
+ir_node *insert_Perm_after(const arch_env_t *arch_env,
+						   be_lv_t *lv,
+						   const arch_register_class_t *cls,
+						   dom_front_info_t *dom_front,
+						   ir_node *irn);
+
+struct _be_chordal_env_t;
+
+void extreme_liverange_splitting(struct _be_chordal_env_t *cenv);
+
+/**
+ * removes basic blocks that only contain a jump instruction
+ * (this will potentially create critical edges)
  */
-void be_introduce_copies_ignore(dom_front_info_t *info, ir_node *orig,
-    int n, ir_node *copies[], pset *irgore_uses);
+void be_remove_empty_blocks(ir_graph *irg);
 
-void be_introduce_copies(dom_front_info_t *info, ir_node *orig,
-    int n, ir_node *copies[]);
-#endif
+#endif /* _BEIRGMOD_H */