2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Implementation of interval analysis
30 #include "interval_analysis.h"
31 #include "execution_frequency.h"
32 #include "firm_common_t.h"
44 DEBUG_ONLY(static firm_dbg_module_t *dbg);
46 /*------------------------------------------------------------------*/
47 /* A new in array via a hashmap. */
48 /* The in array refers to the loop the block is contained in if the */
49 /* block is not in blocks loop. */
50 /*------------------------------------------------------------------*/
60 static set *region_attr_set = NULL;
62 int region_attr_cmp(const void *e1, const void *e2, size_t size) {
63 region_attr *ra1 = (region_attr *)e1;
64 region_attr *ra2 = (region_attr *)e2;
66 return (ra1->reg != ra2->reg);
69 static inline int attr_set_hash(region_attr *a) {
70 return HASH_PTR(a->reg);
73 static inline region_attr *get_region_attr(void *region) {
74 region_attr r_attr, *res;
77 res = set_find(region_attr_set, &r_attr, sizeof(r_attr), attr_set_hash(&r_attr));
80 r_attr.in_array = NEW_ARR_F(void *, 0);
81 if (is_ir_loop(region))
82 r_attr.op_array = NEW_ARR_F(void *, 0);
84 r_attr.op_array = NULL;
86 r_attr.n_exc_outs = 0;
87 res = set_insert(region_attr_set, &r_attr, sizeof(r_attr), attr_set_hash(&r_attr));
93 int get_region_n_ins(void *region) {
94 return ARR_LEN(get_region_attr(region)->in_array);
97 void *get_region_in(void *region, int pos) {
98 assert(0 <= pos && pos < get_region_n_ins(region));
99 return ((get_region_attr(region)->in_array)[pos]);
102 void add_region_in(void *region, void *in) {
103 ARR_APP1(void *, get_region_attr(region)->in_array, in);
104 get_region_attr(in)->n_outs++;
107 int get_region_n_outs(void *region) {
108 return get_region_attr(region)->n_outs;
111 int get_region_n_exc_outs(void *region) {
112 return get_region_attr(region)->n_exc_outs;
115 void inc_region_n_exc_outs(void *region) {
116 (get_region_attr(region)->n_exc_outs)++;
119 void *get_loop_cfop(void *region, int pos) {
120 assert(0 <= pos && pos < get_region_n_ins(region));
121 return ((get_region_attr(region)->op_array)[pos]);
124 static inline void add_loop_cfop(void *region, void *cfop) {
126 ARR_APP1(void *, get_region_attr(region)->op_array, cfop);
129 static inline void exc_outs(void *reg, ir_node *cfop) {
130 if (is_fragile_op(cfop) || (is_fragile_Proj(cfop)))
131 inc_region_n_exc_outs(reg);
134 /*------------------------------------------------------------------*/
135 /* Algorithm to construct the interval edges based on a loop tree. */
136 /* Walk a loop and add all edges. Walk inner loops by recursion. */
137 /*------------------------------------------------------------------*/
139 /* return non-zero if outer can be reached from inner via the outer loop relation */
140 static int find_outer_loop(ir_loop *inner, ir_loop *outer, ir_node *b, ir_node *cfop) {
141 if (get_loop_outer_loop(inner) == outer) {
142 add_region_in(inner, b);
143 add_loop_cfop(inner, cfop);
151 * Check if a given block can be found in a given loop
152 * or its nesting loops.
157 static int test_loop_nest(ir_node *blk, ir_loop *loop) {
158 int i, n_elems = get_loop_n_elements(loop);
160 for (i = 0; i < n_elems; ++i) {
161 loop_element e = get_loop_element(loop, i);
168 if (test_loop_nest(blk, e.son))
180 * @param l the loop of blk
181 * @param pred a predecessor block of blk
182 * @param cfop the control flow op from pred to blk
184 static int find_inner_loop(ir_node *blk, ir_loop *l, ir_node *pred, ir_node *cfop) {
185 int i, n_elems = get_loop_n_elements(l);
188 for (i = 0; i < n_elems; ++i) {
189 loop_element e = get_loop_element(l, i);
196 found = test_loop_nest(pred, e.son);
198 add_region_in(blk, e.son);
199 exc_outs(e.son, cfop);
200 //if (is_fragile_op(cfop)) inc_region_n_exc_outs(b);
212 static int find_previous_loop(ir_loop *l, ir_loop *pred_l, ir_node *b,
213 ir_node *pred_b, ir_node *cfop)
215 ir_loop *outer = get_loop_outer_loop(l);
217 int l_pos = get_loop_element_pos(outer, l);
220 assert(l_pos > 0 && "Is this a necessary condition? There could be a perfect nest ...");
222 for (i = l_pos -1, found = 0; i > -1 && !found; --i) {
223 ir_loop *k = get_loop_element(outer, i).son;
225 found = test_loop_nest(pred_b, k);
228 //if (is_fragile_op(cfop)) inc_region_n_exc_outs(k);
230 add_loop_cfop(l, cfop);
231 add_region_in(b, NULL);
241 * Compute the edges for the interval graph.
243 * @param blk The block for which to construct the edges.
244 * @param l The loop of blk.
246 * There are four cases:
247 * - A predecessor block is in the same loop. Add a normal block-block edge.
248 * - A predecessor block is in a loop contained in this loop, somewhere down in
249 * the nesting. The predecessor of this block is the outermost loop of the nest
250 * directly contained in l.
251 * - A predecessor block is in the outer loop of l. l gets an edge to the predecessor block.
252 * - The outer loop of l contains another loop k just before l. The control flow
253 * branches directly from loop k to loop l. Add an edge l->k. Watch it: k must
254 * not be a direct predecessor of l in the loop tree!
256 static void construct_interval_block(ir_node *blk, ir_loop *l) {
259 if (blk == get_irg_start_block(current_ir_graph))
262 n_cfgpreds = get_Block_n_cfgpreds(blk);
263 /* We want nice blocks. */
264 assert(n_cfgpreds > 0);
266 for (i = 0; i < n_cfgpreds; ++i) {
267 ir_node *cfop, *pred;
270 if (is_backedge(blk, i)) {
271 if (blk != get_loop_element(l, 0).node) {
272 DB((dbg, LEVEL_1, "Loophead not at loop position 0. %+F\n", blk));
274 /* There are no backedges in the interval decomposition. */
275 add_region_in(blk, NULL);
279 cfop = get_Block_cfgpred(blk, i);
281 if (!is_Cond(get_Proj_pred(cfop))) {
282 cfop = skip_Proj(cfop);
284 assert(get_nodes_block(cfop) == get_nodes_block(skip_Proj(cfop)));
288 pred = skip_Proj(get_nodes_block(cfop));
289 /* We want nice blocks. */
290 assert(!is_Bad(pred) && !is_Bad(skip_Proj(get_Block_cfgpred(blk, i))));
291 pred_l = get_irn_loop(pred);
293 add_region_in(blk, pred);
294 //if (is_fragile_op(cfop)) inc_region_n_exc_outs(blk);
295 exc_outs(pred, cfop);
297 int found = find_inner_loop(blk, l, pred, cfop);
299 if (blk != get_loop_element(l, 0).node) {
300 DB((dbg, LEVEL_1, "Loop entry not at loop position 0. %+F\n", blk));
302 found = find_outer_loop(l, pred_l, pred, cfop);
304 add_region_in(blk, NULL); /* placeholder */
307 found = find_previous_loop(l, pred_l, blk, pred, cfop);
310 assert(is_backedge(blk, i));
311 assert(found && "backedge from inner loop");
315 if (blk != get_loop_element(l, 0).node) {
316 /* Check for improper region */
317 if (has_backedges(blk)) {
318 ir_fprintf(stderr, "Improper Region!!!!!! %+F\n", blk);
325 * Construct interval edges for a given (control flow) loop.
327 * @param l the cf loop
329 static void construct_interval_edges(ir_loop *l) {
330 int i, n_elems = get_loop_n_elements(l);
331 for (i = 0; i < n_elems; ++i) {
332 loop_element e = get_loop_element(l, i);
335 construct_interval_block(e.node, l);
338 construct_interval_edges(e.son);
346 void construct_intervals(ir_graph *irg) {
348 ir_graph *rem = current_ir_graph;
349 current_ir_graph = irg;
351 FIRM_DBG_REGISTER(dbg, "firm.ana.interval");
353 if (!region_attr_set)
354 region_attr_set = new_set(region_attr_cmp, 256);
356 construct_cf_backedges(current_ir_graph);
358 l = get_irg_loop(current_ir_graph);
360 construct_interval_edges(l);
362 current_ir_graph = rem;
365 void free_intervals(void) {
367 if (!region_attr_set) return;
369 for (ins = (void **)pmap_first(region_in_map);
371 ins = (void **)pmap_next(region_in_map)) {
375 del_set(region_attr_set);
376 region_attr_set = NULL;
379 /*------------------------------------------------------------------*/
380 /* A vcg dumper showing an interval decomposition of a cfg. */
382 /*------------------------------------------------------------------*/
384 void dump_region_edges(FILE *F, void *reg) {
385 int i, n_ins = get_region_n_ins(reg);
387 if (is_ir_node(reg) && get_Block_n_cfgpreds((ir_node *)reg) > get_region_n_ins(reg)) {
388 for (i = n_ins; i < get_Block_n_cfgpreds((ir_node *)reg); ++i) {
389 if (is_backedge((ir_node *)reg, i))
390 fprintf (F, "backedge: { sourcename: \"");
392 fprintf (F, "edge: { sourcename: \"");
393 PRINT_NODEID(((ir_node *)reg));
394 fprintf (F, "\" targetname: \"");
395 PRINT_NODEID(get_nodes_block(skip_Proj(get_Block_cfgpred((ir_node *)reg, i))));
396 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
400 for (i = 0; i < n_ins; ++i) {
401 void *target = get_region_in(reg, i);
403 if (is_ir_node(reg)) {
404 if (get_Block_n_cfgpreds((ir_node *)reg) != get_region_n_ins(reg)) {
405 ir_printf("n_cfgpreds = %d, n_ins = %d\n %+F\n", get_Block_n_cfgpreds((ir_node *)reg), get_region_n_ins(reg), (ir_node*) reg);
409 if ((!target || (is_ir_node(reg) && !is_ir_node(target))) && i < get_Block_n_cfgpreds((ir_node *)reg)) {
410 assert(is_ir_node(reg));
411 if (is_backedge((ir_node *)reg, i))
412 fprintf (F, "backedge: { sourcename: \"");
414 fprintf (F, "edge: { sourcename: \"");
415 PRINT_NODEID(((ir_node *)reg));
416 fprintf (F, "\" targetname: \"");
417 PRINT_NODEID(get_nodes_block(skip_Proj(get_Block_cfgpred((ir_node *)reg, i))));
418 fprintf (F, "\" " BLOCK_EDGE_ATTR "}\n");
420 if (!target) continue;
423 fprintf (F, "edge: { sourcename: \"");
424 if (is_ir_node(reg)) {
425 PRINT_NODEID(((ir_node *)reg));
427 PRINT_LOOPID(((ir_loop *)reg));
429 fprintf (F, "\" targetname: \"");
430 if (is_ir_node(target)) {
431 PRINT_NODEID(((ir_node *)target));
433 PRINT_LOOPID(((ir_loop *)target));
436 if (is_ir_node(reg) && is_fragile_op(skip_Proj(get_Block_cfgpred(reg, i))))
437 fprintf(F, EXC_CF_EDGE_ATTR);
442 #include "execution_frequency.h"
444 static void dump_interval_block(FILE *F, ir_node *block) {
446 /* This is a block. Dump a node for the block. */
447 fprintf (F, "node: {title: \""); PRINT_NODEID(block);
448 fprintf (F, "\" label: \"");
449 if (block == get_irg_start_block(get_irn_irg(block)))
450 fprintf(F, "Start ");
451 if (block == get_irg_end_block(get_irn_irg(block)))
454 fprintf (F, "%s ", get_op_name(get_irn_op(block)));
456 fprintf(F, " freq: %9.4lf", get_region_exec_freq(block));
457 fprintf(F, " n_outs: %d", get_region_n_outs(block));
458 fprintf(F, " n_exc_outs: %d", get_region_n_exc_outs(block));
460 fprintf(F, "info1:\"");
461 if (dump_dominator_information_flag)
462 fprintf(F, "dom depth %d\n", get_Block_dom_depth(block));
464 /* show arity and possible Bad predecessors of the block */
465 fprintf(F, "arity: %d\n", get_Block_n_cfgpreds(block));
466 for (fl = i = 0; i < get_Block_n_cfgpreds(block); ++i) {
467 ir_node *pred = get_Block_cfgpred(block, i);
470 fprintf(F, "Bad pred at pos: ");
471 fprintf(F, "%d ", i);
478 fprintf (F, "\""); /* closing quote of info */
480 if ((block == get_irg_start_block(get_irn_irg(block))) ||
481 (block == get_irg_end_block(get_irn_irg(block))) )
482 fprintf(F, " color:blue ");
484 fprintf(F, " color:yellow ");
489 static void dump_interval_loop(FILE *F, ir_loop *l) {
490 int i, n_elems = get_loop_n_elements(l);
492 fprintf(F, "graph: { title: \"");
494 fprintf(F, "\" label: \"loop %d", get_loop_loop_nr(l));
495 fprintf(F, " freq: %9.4lf", get_region_exec_freq(l));
496 fprintf(F, " n_outs: %d", get_region_n_outs(l));
497 fprintf(F, " n_exc_outs: %d", get_region_n_exc_outs(l));
498 fprintf(F, "\" status:clustered color:white \n");
500 for (i = 0; i < n_elems; ++i) {
501 loop_element e = get_loop_element(l, i);
502 dump_region_edges(F, e.node);
505 dump_interval_block(F, e.node);
508 dump_interval_loop(F, e.son);
519 void dump_interval_graph(ir_graph *irg, const char *suffix) {
522 if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg))))
525 f = vcg_open(irg, suffix, "-intervals");
526 dump_vcg_header(f, get_irg_dump_name(irg), NULL, NULL);
528 current_ir_graph = irg;
530 dump_interval_loop(f, get_irg_loop(current_ir_graph));