/* Copyright (C) 2002 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Goetz Lindenmaier
-**
-** irdom.c --- Dominator tree.
-**
+* All rights reserved.
+*
+* Authors: Goetz Lindenmaier
+*
+* irdom.c --- Dominator tree.
+*
*/
/* $Id$ */
/** **/
/**********************************************************************/
-void count_and_init_blocks(ir_node *bl, void *env) {
+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;
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. **/
used = 0;
}
/* clean up */
- /* free(tdi_list); @@@ doew not work !!?? */
+ /* free(tdi_list); @@@ does not work !!?? */
current_ir_graph = rem;
}