fix weak external functions

[libfirm] / ir / ir / irgwalk.c

diff --git a/ir/ir/irgwalk.c b/ir/ir/irgwalk.c
index 78daade..baef5bf 100644 (file)
--- a/ir/ir/irgwalk.c
+++ b/ir/ir/irgwalk.c
@@ -22,7 +22,7 @@
  * @brief   Functions for traversing ir graphs
  * @author  Boris Boesler, Goetz Lindenmaier, Michael Beck
  * @version $Id$
- * @summary
+ * @brief
  *  traverse an ir graph
  *  - execute the pre function before recursion
  *  - execute the post function after recursion
@@ -43,13 +43,15 @@
 #include "pset_new.h"
 #include "array.h"
 
+#ifdef INTERPROCEDURAL_VIEW
 /**
  * Walk over an interprocedural graph (callgraph).
  * Visits only graphs in irg_set.
  */
 static void irg_walk_cg(ir_node * node, ir_visited_t visited,
                         pset_new_t *irg_set, irg_walk_func *pre,
-                        irg_walk_func *post, void * env) {
+                        irg_walk_func *post, void * env)
+{
        int i;
        ir_graph * rem = current_ir_graph;
        ir_node * pred;
@@ -118,7 +120,6 @@ static void irg_walk_cg(ir_node * node, ir_visited_t visited,
        current_ir_graph = rem;
 }
 
-
 /**
  * Insert all ir_graphs in irg_set, that are (transitive) reachable.
  */
@@ -135,6 +136,7 @@ static void collect_irgs(ir_node * node, pset_new_t *irg_set) {
                }
        }
 }
+#endif
 
 /**
  * specialized version of irg_walk_2, called if only pre callback exists
@@ -229,8 +231,8 @@ irg_walk_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * e
  *
  * @return number of visited nodes
  */
-static unsigned
-irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
+unsigned irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
+                    void *env)
 {
        if (node->visited < current_ir_graph->visited) {
                if      (!post) return irg_walk_2_pre (node, pre, env);
@@ -468,6 +470,7 @@ switch_irg(ir_node *n, int index) {
        return old_current;
 }
 
+#ifdef INTERPROCEDURAL_VIEW
 static void
 cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
 {
@@ -493,7 +496,6 @@ cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
        }
 }
 
-#ifdef INTERPROCEDURAL_VIEW
 /* Walks all irgs in interprocedural view.  Visits each node only once. */
 void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
        int i;
@@ -574,13 +576,13 @@ static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *p
        if (!Block_block_visited(node)) {
                mark_Block_block_visited(node);
 
-               if(pre) pre(node, env);
+               if (pre) pre(node, env);
 
                for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
                        /* find the corresponding predecessor block. */
                        ir_node *pred = get_cf_op(get_Block_cfgpred(node, i));
                        pred = get_nodes_block(pred);
-                       if(get_irn_opcode(pred) == iro_Block) {
+                       if (get_irn_opcode(pred) == iro_Block) {
                                /* recursion */
                                irg_block_walk_2(pred, pre, post, env);
                        }
@@ -589,7 +591,7 @@ static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *p
                        }
                }
 
-               if(post) post(node, env);
+               if (post) post(node, env);
        }
 }
 
@@ -606,7 +608,7 @@ void irg_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void
 
        assert(node);
        assert(!get_interprocedural_view());   /* interprocedural_view not implemented, because it
-                                              * interleaves with irg_walk */
+                                               * interleaves with irg_walk */
        ir_reserve_resources(irg, IR_RESOURCE_BLOCK_VISITED);
        inc_irg_block_visited(irg);
        block = is_Block(node) ? node : get_nodes_block(node);
@@ -618,19 +620,16 @@ void irg_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void
                int arity = get_irn_arity(node);
                for (i = 0; i < arity; i++) {
                        pred = get_irn_n(node, i);
-                       if (is_Block(pred))
-                               irg_block_walk_2(pred, pre, post, env);
-               }
-               /* Sometimes the blocks died, but are still reachable through Phis.
-               * Make sure the algorithms that try to remove these reach them. */
-               for (i = 0; i < arity; i++) {
-                       pred = get_irn_n(node, i);
-                       if (get_irn_op(pred) == op_Phi) {
-                               ir_node *block = get_nodes_block(pred);
-
-                               if (! is_Bad(block))
-                                       irg_block_walk_2(block, pre, post, env);
+                       if (!is_Block(pred)) {
+                               pred = get_nodes_block(pred);
+                               if (!is_Block(pred)) {
+                                       /* if rare cases a kept node might have a bad block input */
+                                       continue;
+                               }
                        }
+                       /* Sometimes the blocks died, but are still reachable through kept nodes.
+                        * Make sure the algorithms that try to remove these reach them. */
+                       irg_block_walk_2(pred, pre, post, env);
                }
        }
 
@@ -699,17 +698,13 @@ static void walk_entity(ir_entity *ent, void *env)
 {
        walk_env *my_env = (walk_env *)env;
 
-       if (get_entity_variability(ent) != variability_uninitialized) {
-               if (ent->has_initializer) {
-                       walk_initializer(ent->attr.initializer, my_env);
-               } else if (is_atomic_entity(ent)) {
-                       irg_walk(get_atomic_ent_value(ent), my_env->pre, my_env->post, my_env->env);
-               } else {
-                       int i, n_vals = get_compound_ent_n_values(ent);
+       if (ent->initializer != NULL) {
+               walk_initializer(ent->initializer, my_env);
+       } else if (entity_has_compound_ent_values(ent)) {
+               int i, n_vals = get_compound_ent_n_values(ent);
 
-                       for (i = 0; i < n_vals; i++)
-                               irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env);
-               }
+               for (i = 0; i < n_vals; i++)
+                       irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env);
        }
 }
 
@@ -717,6 +712,7 @@ static void walk_entity(ir_entity *ent, void *env)
 void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) {
        int i, j, n_types;
        walk_env my_env;
+       ir_segment_t s;
 
        ir_graph *rem = current_ir_graph;
        current_ir_graph = get_const_code_irg();
@@ -727,7 +723,8 @@ void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) {
        my_env.env = env;
 
        /* Walk all types that can contain constant entities.  */
-       walk_types_entities(get_glob_type(), &walk_entity, &my_env);
+       for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; s++)
+               walk_types_entities(get_segment_type(s), &walk_entity, &my_env);
        n_types = get_irp_n_types();
        for (i = 0; i < n_types; i++)
                walk_types_entities(get_irp_type(i), &walk_entity, &my_env);