-void be_introduce_copies(dom_front_info_t *info, ir_node *orig,
- int n, ir_node *copy_nodes[]);
+/**
+ * Introduce several copies for one node.
+ *
+ * A copy in this context means, that you want to introduce several new
+ * abstract values (in Firm: nodes) for which you know, that they
+ * represent the same concrete value. This is the case if you
+ * - copy
+ * - spill and reload
+ * - 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 necessary.
+ *
+ * @param info Dominance frontier information.
+ * @param n Length of nodes array.
+ * @param nodes The nodes which shall represent the same SSA value.
+ * @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_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);