-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
+ * - rematerialize
+ * 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.
+ *
+ * @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.
+ */
+void be_introduce_copies_ignore(dom_front_info_t *info, ir_node *orig,
+ int n, ir_node *copies[], pset *irgore_uses);
+
+void be_introduce_copies(dom_front_info_t *info, ir_node *orig, int n, ir_node *copies[]);
+
+void be_introduce_copies_pset(dom_front_info_t *info, pset *nodes);