3 * IRG modifications for be routines.
6 * Copyright (C) 2005 Universitaet Karlsruhe.
7 * Released under the GPL.
16 * Forward type declaration.
18 typedef struct _dom_front_info_t dom_front_info_t;
21 * Compute the dominance frontiers for a given graph.
22 * @param irg The graphs.
23 * @return A pointer to the dominance frontier information.
25 dom_front_info_t *be_compute_dominance_frontiers(ir_graph *irg);
28 * Get the dominance frontier of a block.
29 * @param info A pointer to the dominance frontier information.
30 * @param block The block whose dominance frontier you want.
31 * @return A set containing the all blocks in the dominance frontier of @p block.
33 pset *be_get_dominance_frontier(dom_front_info_t *info, ir_node *block);
36 * Free some dominance frontier information.
37 * @param info Some dominance frontier information.
39 void be_free_dominance_frontiers(dom_front_info_t *info);
42 * Introduce several copies for one node.
44 * A copy in this context means, that you want to introduce several new
45 * abstract values (in Firm: nodes) for which you know, that they
46 * represent the same concrete value. This is the case if you
52 * This function reroutes all uses of the original value to the copies in the
53 * corresponding dominance subtrees and creates Phi functions if neccessary.
55 * @param info Dominance frontier information.
56 * @param orig The node for which you want to introduce copies.
57 * @param n The number of copies ypu introduce.
58 * @param copies An array of nodes which are copies of @p orig.
60 void be_introduce_copies_ignore(dom_front_info_t *info, ir_node *orig,
61 int n, ir_node *copies[], pset *irgore_uses);
63 void be_introduce_copies(dom_front_info_t *info, ir_node *orig, int n, ir_node *copies[]);
65 void be_introduce_copies_pset(dom_front_info_t *info, pset *nodes);