* 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);
*/
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();
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);
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 */
current_ir_graph = rem;
}
+/*
+ * Additionally walk over all anchors. Do NOT increase the visit flag.
+ */
+void irg_walk_anchors(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
+ int i;
+ ir_graph * rem = current_ir_graph;
+ current_ir_graph = irg;
+
+ for (i = 0; i < anchor_max; ++i) {
+ ir_node *anchor = irg->anchors[i];
+
+ irg_walk_2(anchor, pre, post, env);
+ }
+ current_ir_graph = rem;
+}
+
/********************************************************************/
typedef struct walk_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);