-/* Copyright (C) 2002 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Goetz Lindenmaier
-**
-** irdom.c --- Dominator tree.
-**
-*/
-
-/* $Id$ */
+/*
+ * Project: libFIRM
+ * File name: ir/ana/irdom.c
+ * Purpose: Construct and access dominator tree.
+ * Author: Goetz Lindenmaier
+ * Modified by:
+ * Created: 2.2002
+ * CVS-ID: $Id$
+ * Copyright: (c) 2002-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
#include "irouts.h"
+#include "irgwalk.h"
#include "irdom_t.h"
#include "irgraph_t.h" /* To access state field. */
#include "irnode_t.h"
+#include "ircons_t.h"
-/**********************************************************************/
-/** Accessing the dominator datastructures **/
-/**********************************************************************/
+/*--------------------------------------------------------------------*/
+/** Accessing the dominator data structures **/
+/*--------------------------------------------------------------------*/
ir_node *get_Block_idom(ir_node *bl) {
assert(get_irn_op(bl) == op_Block);
+ if (get_Block_dom_depth(bl) == -1) {
+ /* This block is not reachable from Start */
+ return new_Bad();
+ }
return bl->attr.block.dom.idom;
}
-/**********************************************************************/
-/** Building and Removing the dominator datasturcture **/
-/** **/
-/** **/
-/** **/
-/** **/
-/** **/
-/** **/
-/** **/
-/** .**/
-/** **/
-/** **/
-/** **/
-/** **/
-/** **/
-/** **/
-/**********************************************************************/
-
-void count_and_init_blocks(ir_node *bl, void *env) {
+/*--------------------------------------------------------------------*/
+/* Building and Removing the dominator datastructure */
+/*--------------------------------------------------------------------*/
+
+static void count_and_init_blocks(ir_node *bl, void *env) {
int *n_blocks = (int *) env;
(*n_blocks) ++;
/* Walks Blocks along the out datastructure. If recursion started with
Start block misses control dead blocks. */
-void init_tmp_dom_info(ir_node *bl, tmp_dom_info *parent,
- tmp_dom_info *tdi_list, int* used) {
+static void init_tmp_dom_info(ir_node *bl, tmp_dom_info *parent,
+ tmp_dom_info *tdi_list, int* used) {
tmp_dom_info *tdi;
int i;
mark_Block_block_visited(bl);
set_Block_pre_num(bl, *used);
- //printf(" used: %d ", *used); DDMN(bl);
-
tdi = &tdi_list[*used];
++(*used);
}
}
-
static void
dom_compress (tmp_dom_info *v)
{
/* if V is a root, return v, else return the vertex u, not being the
root, with minimum u->semi on the path from v to its root. */
-inline static tmp_dom_info*
+INLINE static tmp_dom_info*
dom_eval (tmp_dom_info *v)
{
if (!v->ancestor) return v;
}
/* make V W's ancestor */
-inline static void
+INLINE static void
dom_link (tmp_dom_info *v, tmp_dom_info *w)
{
w->ancestor = v;
ir_graph *rem = current_ir_graph;
int n_blocks, used, i, j;
tmp_dom_info *tdi_list; /* Ein Golf? */
- dom_env de;
current_ir_graph = irg;
n_blocks = 0;
irg_block_walk(get_irg_end(current_ir_graph), count_and_init_blocks, NULL, &n_blocks);
- //printf("n_blocks is %d\n", n_blocks);
-
/* Memory for temporary information. */
tdi_list = (tmp_dom_info *) calloc(n_blocks, sizeof(tmp_dom_info));
if (current_ir_graph->outs_state != outs_consistent)
compute_outs(current_ir_graph);
- /** Initialize the temporary information, add link to parent. We don't do
- this with a standard walker as passing the parent to the sons isn't
- simple. **/
+ /* this with a standard walker as passing the parent to the sons isn't
+ simple. */
used = 0;
inc_irg_block_visited(current_ir_graph);
init_tmp_dom_info(get_irg_start_block(current_ir_graph), NULL, tdi_list, &used);
/* If not all blocks are reachable from Start by out edges this assertion
- fails. */
- //assert(used == n_blocks && "Precondition for dom construction violated");
+ fails.
+ assert(used == n_blocks && "Precondition for dom construction violated"); */
n_blocks = used;
- //printf("used is %d\n", used);
-
for (i = n_blocks-1; i > 0; i--) { /* Don't iterate the root, it's done. */
+ int irn_arity;
tmp_dom_info *w = &tdi_list[i];
tmp_dom_info *v;
- //printf(" cfgpreds: %d ", get_Block_n_cfgpreds(w->block)); DDMN(w->block);
-
/* Step 2 */
- for (j = 0; j < get_irn_arity(w->block); j++) {
- ir_node *pred = get_nodes_Block(get_Block_cfgpred(w->block, j));
+ irn_arity = get_irn_arity(w->block);
+ for (j = 0; j < irn_arity; j++) {
+ ir_node *cf_op = get_Block_cfgpred(w->block, j);
+ ir_node *pred = get_nodes_block(cf_op);
tmp_dom_info *u;
- if ((is_Bad(get_Block_cfgpred(w->block, j))) || (get_Block_pre_num (pred) == -1))
+ if ((is_Bad(cf_op)) || (is_Bad(pred)) ||
+ (get_Block_pre_num (pred) == -1))
continue; /* control-dead */
u = dom_eval (&tdi_list[get_Block_pre_num(pred)]);
}
/* clean up */
- free(tdi_list);
+ /* free(tdi_list); @@@ does not work !!?? */
current_ir_graph = rem;
}
void free_dom_and_peace(ir_graph *irg) {
/* Update graph state */
assert(get_irg_phase_state(current_ir_graph) != phase_building);
- current_ir_graph->dom_state = no_dom;
+ current_ir_graph->dom_state = dom_none;
/* With the implementation right now there is nothing to free,
but better call it anyways... */