1 /* Copyright (C) 2002 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Goetz Lindenmaier
6 ** irdom.c --- Dominator tree.
16 #include "irgraph_t.h" /* To access state field. */
19 /**********************************************************************/
20 /** Accessing the dominator datastructures **/
21 /**********************************************************************/
23 ir_node *get_Block_idom(ir_node *bl) {
24 assert(get_irn_op(bl) == op_Block);
25 return bl->attr.block.dom.idom;
28 void set_Block_idom(ir_node *bl, ir_node *n) {
29 assert(get_irn_op(bl) == op_Block);
30 bl->attr.block.dom.idom = n;
33 int get_Block_pre_num(ir_node *bl) {
34 assert(get_irn_op(bl) == op_Block);
35 return bl->attr.block.dom.pre_num;
38 void set_Block_pre_num(ir_node *bl, int num) {
39 assert(get_irn_op(bl) == op_Block);
40 bl->attr.block.dom.pre_num = num;
43 int get_Block_dom_depth(ir_node *bl) {
44 assert(get_irn_op(bl) == op_Block);
45 return bl->attr.block.dom.dom_depth;
48 void set_Block_dom_depth(ir_node *bl, int depth) {
49 assert(get_irn_op(bl) == op_Block);
50 bl->attr.block.dom.dom_depth = depth;
55 /**********************************************************************/
56 /** Building and Removing the dominator datasturcture **/
71 /**********************************************************************/
73 void count_and_init_blocks(ir_node *bl, void *env) {
74 int *n_blocks = (int *) env;
77 set_Block_idom(bl, NULL);
78 set_Block_pre_num(bl, -1);
79 set_Block_dom_depth(bl, -1);
82 /* temporary type used while constructing the dominator tree. */
83 typedef struct tmp_dom_info {
84 ir_node *block; /* backlink */
86 struct tmp_dom_info *semi; /* semidominator */
87 struct tmp_dom_info *parent;
88 struct tmp_dom_info *label; /* used for LINK and EVAL */
89 struct tmp_dom_info *ancestor;/* used for LINK and EVAL */
90 struct tmp_dom_info *dom; /* After step 3, if the semidominator of w is
91 its immediate dominator, then w->dom is the
92 immediate dominator of w. Otherwise w->dom
93 is a vertex v whose number is smaller than
94 w and whose immediate dominator is also w's
95 immediate dominator. After step 4, w->dom
96 is the immediate dominator of w. */
97 struct tmp_dom_info *bucket; /* set of vertices with same semidominator */
100 /* Struct to pass info through walker. */
108 /* Walks Blocks along the out datastructure. If recursion started with
109 Start block misses control dead blocks. */
110 void init_tmp_dom_info(ir_node *bl, tmp_dom_info *parent,
111 tmp_dom_info *tdi_list, int* used) {
115 assert(get_irn_op(bl) == op_Block);
116 if (get_irg_block_visited(current_ir_graph) == get_Block_block_visited(bl))
118 mark_Block_block_visited(bl);
119 set_Block_pre_num(bl, *used);
121 //printf(" used: %d ", *used); DDMN(bl);
123 tdi = &tdi_list[*used];
128 tdi->ancestor = NULL;
130 tdi->parent = parent;
134 for(i = 0; i < get_Block_n_cfg_outs(bl); i++) {
135 ir_node *pred = get_Block_cfg_out(bl, i);
136 assert(get_irn_opcode(pred) == iro_Block);
137 init_tmp_dom_info(pred, tdi, tdi_list, used);
143 dom_compress (tmp_dom_info *v)
145 assert (v->ancestor);
146 if (v->ancestor->ancestor) {
147 dom_compress (v->ancestor);
148 if (v->ancestor->label->semi < v->label->semi) {
149 v->label = v->ancestor->label;
151 v->ancestor = v->ancestor->ancestor;
155 /* if V is a root, return v, else return the vertex u, not being the
156 root, with minimum u->semi on the path from v to its root. */
157 inline static tmp_dom_info*
158 dom_eval (tmp_dom_info *v)
160 if (!v->ancestor) return v;
165 /* make V W's ancestor */
167 dom_link (tmp_dom_info *v, tmp_dom_info *w)
172 /* Computes the dominator trees. Sets a flag in irg to "dom_consistent".
173 If the control flow of the graph is changed this flag must be set to
174 "dom_inconsistent". */
175 void compute_doms(ir_graph *irg) {
176 ir_graph *rem = current_ir_graph;
177 int n_blocks, used, i, j;
178 tmp_dom_info *tdi_list; /* Ein Golf? */
180 current_ir_graph = irg;
182 /* Update graph state */
183 assert(get_irg_phase_state(current_ir_graph) != phase_building);
184 current_ir_graph->dom_state = dom_consistent;
186 /* Count the number of blocks in the graph. */
188 irg_block_walk(get_irg_end(current_ir_graph), count_and_init_blocks, NULL, &n_blocks);
190 //printf("n_blocks is %d\n", n_blocks);
192 /* Memory for temporary information. */
193 tdi_list = (tmp_dom_info *) calloc(n_blocks, sizeof(tmp_dom_info));
195 /* We need the out datastructure. */
196 if (current_ir_graph->outs_state != outs_consistent)
197 compute_outs(current_ir_graph);
199 /** Initialize the temporary information, add link to parent. We don't do
200 this with a standard walker as passing the parent to the sons isn't
203 inc_irg_block_visited(current_ir_graph);
204 init_tmp_dom_info(get_irg_start_block(current_ir_graph), NULL, tdi_list, &used);
205 /* If not all blocks are reachable from Start by out edges this assertion
207 //assert(used == n_blocks && "Precondition for dom construction violated");
210 //printf("used is %d\n", used);
213 for (i = n_blocks-1; i > 0; i--) { /* Don't iterate the root, it's done. */
214 tmp_dom_info *w = &tdi_list[i];
217 //printf(" cfgpreds: %d ", get_Block_n_cfgpreds(w->block)); DDMN(w->block);
220 for (j = 0; j < get_irn_arity(w->block); j++) {
221 ir_node *pred = get_nodes_Block(get_Block_cfgpred(w->block, j));
224 if ((is_Bad(get_Block_cfgpred(w->block, j))) || (get_Block_pre_num (pred) == -1))
225 continue; /* control-dead */
227 u = dom_eval (&tdi_list[get_Block_pre_num(pred)]);
228 if (u->semi < w->semi) w->semi = u->semi;
230 /* Add w to w->semi's bucket. w is in exactly one bucket, so
231 buckets can ben implemented as linked lists. */
232 w->bucket = w->semi->bucket;
235 dom_link (w->parent, w);
238 while (w->parent->bucket) {
240 v = w->parent->bucket;
241 /* remove v from w->parent->bucket */
242 w->parent->bucket = v->bucket;
246 if (u->semi < v->semi)
253 tdi_list[0].dom = NULL;
254 set_Block_idom(tdi_list[0].block, NULL);
255 set_Block_dom_depth(tdi_list[0].block, 1);
256 for (i = 1; i < n_blocks; i++) {
257 tmp_dom_info *w = &tdi_list[i];
259 if (w->dom != w->semi) w->dom = w->dom->dom;
260 set_Block_idom(w->block, w->dom->block);
261 set_Block_dom_depth(w->block, get_Block_dom_depth(w->dom->block) + 1);
266 current_ir_graph = rem;
269 void free_dom_and_peace(ir_graph *irg) {
270 /* Update graph state */
271 assert(get_irg_phase_state(current_ir_graph) != phase_building);
272 current_ir_graph->dom_state = no_dom;
274 /* With the implementation right now there is nothing to free,
275 but better call it anyways... */