nsz Git - libfirm/blob - ir/ana/irdom.c

   1 /*
   2  * Project:     libFIRM
   3  * File name:   ir/ana/irdom.c
   4  * Purpose:     Construct and access dominator tree.
   5  * Author:      Goetz Lindenmaier
   6  * Modified by:
   7  * Created:     2.2002
   8  * CVS-ID:      $Id$
   9  * Copyright:   (c) 2002-2003 Universität Karlsruhe
  10  * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
  11  */
  12
  13 #ifdef HAVE_CONFIG_H
  14 #include "config.h"
  15 #endif
  16
  17 #ifdef HAVE_STRING_H
  18 #include <string.h>
  19 #endif
  20
  21 #include "irouts.h"
  22
  23 #include "xmalloc.h"
  24 #include "irgwalk.h"
  25 #include "irdom_t.h"
  26 #include "irgraph_t.h"   /* To access state field. */
  27 #include "irnode_t.h"
  28 #include "ircons_t.h"
  29
  30 #define get_dom_info(bl) (&(bl)->attr.block.dom)
  31
  32
  33 /*--------------------------------------------------------------------*/
  34 /** Accessing the dominator data structures                          **/
  35 /*--------------------------------------------------------------------*/
  36
  37 ir_node *get_Block_idom(const ir_node *bl) {
  38   assert(is_Block(bl));
  39   if (get_Block_dom_depth(bl) == -1) {
  40     /* This block is not reachable from Start */
  41     return new_Bad();
  42   }
  43   return get_dom_info(bl)->idom;
  44 }
  45
  46 void set_Block_idom(ir_node *bl, ir_node *n) {
  47         dom_info *bli = get_dom_info(bl);
  48
  49   assert(get_irn_op(bl) == op_Block);
  50
  51         /* Set the immediate dominator of bl to n */
  52         bli->idom = n;
  53
  54         /*
  55          * If we don't set the root of the dominator tree
  56          * Append bl to the dominates queue of n.
  57          */
  58         if(n != NULL) {
  59                 dom_info *ni = get_dom_info(n);
  60
  61                 bli->next = ni->first;
  62                 ni->first = bl;
  63         }
  64 }
  65
  66 int get_Block_pre_num(const ir_node *bl) {
  67   assert(get_irn_op(bl) == op_Block);
  68   return bl->attr.block.dom.pre_num;
  69 }
  70
  71 void set_Block_pre_num(ir_node *bl, int num) {
  72   assert(get_irn_op(bl) == op_Block);
  73   bl->attr.block.dom.pre_num = num;
  74 }
  75
  76 int get_Block_dom_depth(const ir_node *bl) {
  77   assert(get_irn_op(bl) == op_Block);
  78   return bl->attr.block.dom.dom_depth;
  79 }
  80
  81 void set_Block_dom_depth(ir_node *bl, int depth) {
  82   assert(get_irn_op(bl) == op_Block);
  83   bl->attr.block.dom.dom_depth = depth;
  84 }
  85
  86 unsigned get_Block_dom_tree_pre_num(const ir_node *bl)
  87 {
  88         assert(is_Block(bl));
  89         return get_dom_info(bl)->tree_pre_num;
  90 }
  91
  92 unsigned get_Block_dom_max_subtree_pre_num(const ir_node *bl)
  93 {
  94         assert(is_Block(bl));
  95         return get_dom_info(bl)->max_subtree_pre_num;
  96 }
  97
  98 int block_dominates(const ir_node *a, const ir_node *b)
  99 {
 100         const dom_info *ai, *bi;
 101
 102         assert(is_Block(a) && is_Block(b));
 103         ai = get_dom_info(a);
 104         bi = get_dom_info(b);
 105         return bi->tree_pre_num - ai->tree_pre_num
 106                 <= ai->max_subtree_pre_num - ai->tree_pre_num;
 107 }
 108
 109 ir_node *get_Block_dominated_first(const ir_node *bl)
 110 {
 111         assert(is_Block(bl));
 112         return get_dom_info(bl)->first;
 113 }
 114
 115 ir_node *get_Block_dominated_next(const ir_node *bl)
 116 {
 117         assert(is_Block(bl));
 118         return get_dom_info(bl)->next;
 119 }
 120
 121 void dom_tree_walk(ir_node *bl, irg_walk_func *pre,
 122                 irg_walk_func *post, void *env)
 123 {
 124         ir_node *p;
 125
 126         if(pre)
 127                 pre(bl, env);
 128
 129         dominates_for_each(bl, p) {
 130                 dom_tree_walk(p, pre, post, env);
 131         }
 132
 133         if(post)
 134                 post(bl, env);
 135 }
 136
 137 void dom_tree_walk_irg(ir_graph *irg, irg_walk_func *pre,
 138                 irg_walk_func *post, void *env)
 139 {
 140         /* The root of the dominator tree should be the start node. */
 141         ir_node *root = get_irg_start_block(irg);
 142
 143   assert(irg->dom_state == dom_consistent
 144                         && "The dominators of the irg must be consistent");
 145         assert(root && "The start block of the graph is NULL?");
 146         assert(get_dom_info(root)->idom == NULL
 147                         && "The start node in the graph must be the root of the dominator tree");
 148         dom_tree_walk(root, pre, post, env);
 149 }
 150
 151 static void assign_tree_pre_order(ir_node *bl, void *data)
 152 {
 153         unsigned *num = data;
 154         dom_info *bi = get_dom_info(bl);
 155
 156         bi->tree_pre_num = (*num)++;
 157 }
 158
 159 static void assign_tree_pre_order_max(ir_node *bl, void *data)
 160 {
 161         dom_info *bi = get_dom_info(bl);
 162         ir_node *p;
 163         unsigned max = 0;
 164         unsigned children = 0;
 165
 166         for(p = bi->first; p; p = get_dom_info(p)->next) {
 167                 unsigned max_p = get_dom_info(p)->max_subtree_pre_num;
 168                 max = max > max_p ? max : max_p;
 169                 children++;
 170         }
 171
 172         bi->max_subtree_pre_num = children > 0 ? max : bi->tree_pre_num;
 173         assert(bi->max_subtree_pre_num >= bi->tree_pre_num);
 174 }
 175
 176 /*--------------------------------------------------------------------*/
 177 /*  Building and Removing the dominator datastructure                 */
 178 /*--------------------------------------------------------------------*/
 179
 180 static void count_and_init_blocks(ir_node *bl, void *env) {
 181   int *n_blocks = (int *) env;
 182   (*n_blocks) ++;
 183
 184         memset(get_dom_info(bl), 0, sizeof(dom_info));
 185   set_Block_idom(bl, NULL);
 186   set_Block_pre_num(bl, -1);
 187   set_Block_dom_depth(bl, -1);
 188 }
 189
 190 /* temporary type used while constructing the dominator tree. */
 191 typedef struct tmp_dom_info {
 192   ir_node *block;               /* backlink */
 193
 194   struct tmp_dom_info *semi;    /* semidominator */
 195   struct tmp_dom_info *parent;
 196   struct tmp_dom_info *label;   /* used for LINK and EVAL */
 197   struct tmp_dom_info *ancestor;/* used for LINK and EVAL */
 198   struct tmp_dom_info *dom;     /* After step 3, if the semidominator of w is
 199                                    its immediate dominator, then w->dom is the
 200                                    immediate dominator of w.  Otherwise w->dom
 201                                    is a vertex v whose number is smaller than
 202                                    w and whose immediate dominator is also w's
 203                                    immediate dominator. After step 4, w->dom
 204                                    is the immediate dominator of w.  */
 205   struct tmp_dom_info *bucket;  /* set of vertices with same semidominator */
 206 } tmp_dom_info;
 207
 208 /* Struct to pass info through walker. */
 209 typedef struct {
 210   tmp_dom_info *d;
 211   int used;
 212
 213 } dom_env;
 214
 215
 216 /* Walks Blocks along the out datastructure.  If recursion started with
 217    Start block misses control dead blocks. */
 218 static void init_tmp_dom_info(ir_node *bl, tmp_dom_info *parent,
 219                               tmp_dom_info *tdi_list, int* used) {
 220   tmp_dom_info *tdi;
 221   int i;
 222
 223   assert(get_irn_op(bl) == op_Block);
 224   if (get_irg_block_visited(current_ir_graph) == get_Block_block_visited(bl))
 225     return;
 226   mark_Block_block_visited(bl);
 227   set_Block_pre_num(bl, *used);
 228
 229   tdi = &tdi_list[*used];
 230   ++(*used);
 231
 232   tdi->semi = tdi;
 233   tdi->label = tdi;
 234   tdi->ancestor = NULL;
 235   tdi->bucket = NULL;
 236   tdi->parent = parent;
 237   tdi->block = bl;
 238
 239   /* Iterate */
 240   for(i = 0; i < get_Block_n_cfg_outs(bl); i++) {
 241     ir_node *pred = get_Block_cfg_out(bl, i);
 242     assert(get_irn_opcode(pred) == iro_Block);
 243     init_tmp_dom_info(pred, tdi, tdi_list, used);
 244   }
 245 }
 246
 247 static void
 248 dom_compress (tmp_dom_info *v)
 249 {
 250   assert (v->ancestor);
 251   if (v->ancestor->ancestor) {
 252     dom_compress (v->ancestor);
 253     if (v->ancestor->label->semi < v->label->semi) {
 254       v->label = v->ancestor->label;
 255     }
 256     v->ancestor = v->ancestor->ancestor;
 257   }
 258 }
 259
 260 /* if V is a root, return v, else return the vertex u, not being the
 261    root, with minimum u->semi on the path from v to its root. */
 262 INLINE static tmp_dom_info*
 263 dom_eval (tmp_dom_info *v)
 264 {
 265   if (!v->ancestor) return v;
 266   dom_compress (v);
 267   return v->label;
 268 }
 269
 270 /* make V W's ancestor */
 271 INLINE static void
 272 dom_link (tmp_dom_info *v, tmp_dom_info *w)
 273 {
 274   w->ancestor = v;
 275 }
 276
 277 /* Computes the dominator trees.  Sets a flag in irg to "dom_consistent".
 278    If the control flow of the graph is changed this flag must be set to
 279    "dom_inconsistent".  */
 280 void compute_doms(ir_graph *irg) {
 281   ir_graph *rem = current_ir_graph;
 282   int n_blocks, used, i, j;
 283   tmp_dom_info *tdi_list;   /* Ein Golf? */
 284
 285   current_ir_graph = irg;
 286
 287   /* Update graph state */
 288   assert(get_irg_phase_state(current_ir_graph) != phase_building);
 289   current_ir_graph->dom_state = dom_consistent;
 290
 291   /* Count the number of blocks in the graph. */
 292   n_blocks = 0;
 293   irg_block_walk(get_irg_end(current_ir_graph), count_and_init_blocks, NULL, &n_blocks);
 294
 295   /* Memory for temporary information. */
 296   tdi_list = xcalloc(n_blocks, sizeof(tdi_list[0]));
 297
 298   /* We need the out datastructure. */
 299   if (current_ir_graph->outs_state != outs_consistent)
 300     compute_outs(current_ir_graph);
 301
 302   /* this with a standard walker as passing the parent to the sons isn't
 303      simple. */
 304   used = 0;
 305   inc_irg_block_visited(current_ir_graph);
 306   init_tmp_dom_info(get_irg_start_block(current_ir_graph), NULL, tdi_list, &used);
 307   /* If not all blocks are reachable from Start by out edges this assertion
 308      fails.
 309      assert(used == n_blocks && "Precondition for dom construction violated"); */
 310   n_blocks = used;
 311
 312
 313   for (i = n_blocks-1; i > 0; i--) {  /* Don't iterate the root, it's done. */
 314     int irn_arity;
 315     tmp_dom_info *w = &tdi_list[i];
 316     tmp_dom_info *v;
 317
 318     /* Step 2 */
 319     irn_arity = get_irn_arity(w->block);
 320     for (j = 0;  j < irn_arity;  j++) {
 321       ir_node *cf_op = get_Block_cfgpred(w->block, j);
 322       ir_node *pred  = get_nodes_block(cf_op);
 323       tmp_dom_info *u;
 324
 325       if ((is_Bad(cf_op)) || (is_Bad(pred)) ||
 326           (get_Block_pre_num (pred) == -1))
 327         continue;       /* control-dead */
 328
 329       u = dom_eval (&tdi_list[get_Block_pre_num(pred)]);
 330       if (u->semi < w->semi) w->semi = u->semi;
 331     }
 332     /* Add w to w->semi's bucket.  w is in exactly one bucket, so
 333        buckets can ben implemented as linked lists. */
 334     w->bucket = w->semi->bucket;
 335     w->semi->bucket = w;
 336
 337     dom_link (w->parent, w);
 338
 339     /* Step 3 */
 340     while (w->parent->bucket) {
 341       tmp_dom_info *u;
 342       v = w->parent->bucket;
 343       /* remove v from w->parent->bucket */
 344       w->parent->bucket = v->bucket;
 345       v->bucket = NULL;
 346
 347       u = dom_eval (v);
 348       if (u->semi < v->semi)
 349         v->dom = u;
 350       else
 351         v->dom = w->parent;
 352     }
 353   }
 354   /* Step 4 */
 355   tdi_list[0].dom = NULL;
 356   set_Block_idom(tdi_list[0].block, NULL);
 357   set_Block_dom_depth(tdi_list[0].block, 1);
 358   for (i = 1;  i < n_blocks;  i++) {
 359     tmp_dom_info *w = &tdi_list[i];
 360
 361     if (w->dom != w->semi) w->dom = w->dom->dom;
 362     set_Block_idom(w->block, w->dom->block);
 363     set_Block_dom_depth(w->block, get_Block_dom_depth(w->dom->block) + 1);
 364   }
 365
 366   /* clean up */
 367   /*  free(tdi_list); @@@ does not work !!?? */
 368   current_ir_graph = rem;
 369
 370         /* Do a walk over the tree and assign the tree pre orders. */
 371         {
 372                 unsigned tree_pre_order = 0;
 373                 dom_tree_walk_irg(irg, assign_tree_pre_order,
 374                                 assign_tree_pre_order_max, &tree_pre_order);
 375         }
 376 }
 377
 378 void free_dom_and_peace(ir_graph *irg) {
 379   /* Update graph state */
 380   assert(get_irg_phase_state(current_ir_graph) != phase_building);
 381   current_ir_graph->dom_state = dom_none;
 382
 383   /* With the implementation right now there is nothing to free,
 384      but better call it anyways... */
 385 }