X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgwalk.c;h=ceba7511fadc357a8cba191b7e7759e6837b16a1;hb=d904350bc3a4b3b9c77a71d683be6c44b041a33d;hp=1cead63dd6db313d62e5abe56d04ea1f77be6079;hpb=b71b36fa29f0a0242d90c1e8d1db585c5b302d7f;p=libfirm diff --git a/ir/ir/irgwalk.c b/ir/ir/irgwalk.c index 1cead63dd..ceba7511f 100644 --- a/ir/ir/irgwalk.c +++ b/ir/ir/irgwalk.c @@ -116,7 +116,7 @@ static void irg_walk_cg(ir_node * node, unsigned long visited, eset * irg_set, * Insert all ir_graphs in irg_set, that are (transitive) reachable. */ static void collect_irgs(ir_node * node, eset * irg_set) { - if (get_irn_op(node) == op_Call) { + if (is_Call(node)) { int i; for (i = get_Call_n_callees(node) - 1; i >= 0; --i) { entity * ent = get_Call_callee(node, i); @@ -238,7 +238,7 @@ static unsigned nodes_touched = 0; */ void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) { - assert(node && node->kind==k_ir_node); + assert(is_ir_node(node)); if (get_interprocedural_view()) { eset * irg_set = eset_create(); @@ -246,10 +246,10 @@ void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) ir_graph * irg; assert(get_irp_ip_view_state() == ip_view_valid); - set_interprocedural_view(false); + set_interprocedural_view(0); eset_insert(irg_set, current_ir_graph); irg_walk(node, (irg_walk_func *) collect_irgs, NULL, irg_set); - set_interprocedural_view(true); + set_interprocedural_view(1); visited = get_max_irg_visited() + 1; for (irg = eset_first(irg_set); irg; irg = eset_next(irg_set)) { set_irg_visited(irg, visited); @@ -351,7 +351,7 @@ void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) { ir_graph *rem = current_ir_graph; int rem_view = get_interprocedural_view(); - set_interprocedural_view(true); + set_interprocedural_view(1); inc_max_irg_visited(); /* Fix all irg_visited flags */ @@ -551,7 +551,7 @@ void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) { /* Walk constant array bounds. */ for (i = 0; i < get_irp_n_types(); i++) { - type *tp = get_irp_type(i); + ir_type *tp = get_irp_type(i); if (is_Array_type(tp)) { for (j = 0; j < get_array_n_dimensions(tp); j++) { ir_node *n = get_array_lower_bound(tp, j);