2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Various verify routines that check a scheduled graph for correctness.
23 * @author Matthias Braun
46 #include "besched_t.h"
49 #include "beintlive_t.h"
51 static int my_values_interfere(const ir_node *a, const ir_node *b);
53 typedef struct be_verify_register_pressure_env_t_ {
54 ir_graph *irg; /**< the irg to verify */
55 be_lv_t *lv; /**< Liveness information. */
56 const arch_env_t *arch_env; /**< an architecture environment */
57 const arch_register_class_t *cls; /**< the register class to check for */
58 int registers_available; /**< number of available registers */
59 int problem_found; /**< flag indicating if a problem was found */
60 } be_verify_register_pressure_env_t;
63 * Print all nodes of a pset into a file.
65 static void print_living_values(FILE *F, pset *live_nodes) {
69 foreach_pset(live_nodes, node) {
70 ir_fprintf(F, "%+F ", node);
76 * Check if number of live nodes never exceeds the number of available registers.
78 static void verify_liveness_walker(ir_node *block, void *data) {
79 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
80 pset *live_nodes = pset_new_ptr_default();
84 /* collect register pressure info, start with end of a block */
85 be_liveness_end_of_block(env->lv, env->arch_env, env->cls, block, live_nodes);
87 pressure = pset_count(live_nodes);
88 if(pressure > env->registers_available) {
89 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
90 block, get_irg_dump_name(env->irg), pressure, env->registers_available);
91 print_living_values(stderr, live_nodes);
92 env->problem_found = 1;
95 sched_foreach_reverse(block, irn) {
99 be_liveness_transfer(env->arch_env, env->cls, irn, live_nodes);
101 pressure = pset_count(live_nodes);
103 if(pressure > env->registers_available) {
104 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
105 irn, block, get_irg_dump_name(env->irg), pressure, env->registers_available);
106 print_living_values(stderr, live_nodes);
107 env->problem_found = 1;
110 del_pset(live_nodes);
114 * Start a walk over the irg and check the register pressure.
116 int be_verify_register_pressure(const be_irg_t *birg,
117 const arch_register_class_t *cls,
119 be_verify_register_pressure_env_t env;
121 env.lv = be_liveness(irg);
123 env.arch_env = birg->main_env->arch_env;
125 env.registers_available = env.cls->n_regs - be_put_ignore_regs(birg, env.cls, NULL);
126 env.problem_found = 0;
128 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
129 be_liveness_free(env.lv);
131 return ! env.problem_found;
136 //---------------------------------------------------------------------------
140 typedef struct be_verify_schedule_env_t_ {
141 int problem_found; /**< flags indicating if there was a problem */
142 bitset_t *scheduled; /**< bitset of scheduled nodes */
143 ir_graph *irg; /**< the irg to check */
144 const arch_env_t *arch_env; /**< the arch_env */
145 } be_verify_schedule_env_t;
148 * Simple schedule checker.
150 static void verify_schedule_walker(ir_node *block, void *data) {
151 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
153 int non_phi_found = 0;
154 int cfchange_found = 0;
155 // TODO ask arch about delay branches
156 int delay_branches = 0;
157 int last_timestep = INT_MIN;
160 * Tests for the following things:
161 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
162 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
163 * 3. No value is defined after it has been used
164 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
165 * (except mode_X projs)
167 sched_foreach(block, node) {
171 // this node is scheduled
172 if(bitset_is_set(env->scheduled, get_irn_idx(node))) {
173 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
174 env->problem_found = 1;
176 bitset_set(env->scheduled, get_irn_idx(node));
178 // Check that scheduled nodes are in the correct block
179 if(get_nodes_block(node) != block) {
180 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
181 env->problem_found = 1;
184 // Check that timesteps are increasing
185 timestep = sched_get_time_step(node);
186 if(timestep <= last_timestep) {
187 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
189 env->problem_found = 1;
191 last_timestep = timestep;
193 // Check that phis come before any other node
196 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes in block %+F (%s)\n",
197 node, block, get_irg_dump_name(env->irg));
198 env->problem_found = 1;
204 // Check for control flow changing nodes
205 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
206 /* check, that only one CF operation is scheduled */
207 if (cfchange_found == 1) {
208 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
209 node, block, get_irg_dump_name(env->irg));
210 env->problem_found = 1;
213 } else if (cfchange_found) {
214 // proj and keepany aren't real instructions...
215 if(!is_Proj(node) && !be_is_Keep(node)) {
216 /* check for delay branches */
217 if (delay_branches == 0) {
218 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
219 node, block, get_irg_dump_name(env->irg));
220 env->problem_found = 1;
227 // Check that all uses come before their definitions
229 int nodetime = sched_get_time_step(node);
230 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
231 ir_node *arg = get_irn_n(node, i);
232 if(get_nodes_block(arg) != block
233 || !sched_is_scheduled(arg))
236 if(sched_get_time_step(arg) >= nodetime) {
237 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
238 arg, node, block, get_irg_dump_name(env->irg));
239 env->problem_found = 1;
244 // Check that no dead nodes are scheduled
245 if(get_irn_n_edges(node) == 0) {
246 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
247 node, block, get_irg_dump_name(env->irg));
248 env->problem_found = 1;
251 // check that all projs/keeps are behind their nodes
253 ir_node *prev = sched_prev(node);
255 prev = sched_prev(prev);
256 if(get_Proj_pred(node) != prev) {
257 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
258 node, block, get_irg_dump_name(env->irg));
259 env->problem_found = 1;
262 if(be_is_Keep(node)) {
263 int arity = get_irn_arity(node);
265 for(i = 0; i < arity; ++i) {
266 ir_node *in = get_irn_n(node, i);
267 ir_node *succ = sched_next(in);
268 while(succ != node && !sched_is_end(succ)) {
269 /* the node in between has to be another input of the
275 succ = sched_next(succ);
279 for(i2 = 0; i2 < arity; ++i2) {
280 ir_node *in2 = get_irn_n(node, i2);
289 succ = sched_next(succ);
293 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
294 node, block, get_irg_dump_name(env->irg));
295 env->problem_found = 1;
300 /* check that all delay branches are filled (at least with NOPs) */
301 if (cfchange_found && delay_branches != 0) {
302 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
303 block, get_irg_dump_name(env->irg));
304 env->problem_found = 1;
308 static int should_be_scheduled(be_verify_schedule_env_t *env, ir_node *node) {
312 if(get_irn_mode(node) == mode_M) {
315 if(is_Phi(node) || is_Sync(node) || is_Pin(node))
319 if(get_irn_mode(node) == mode_X)
321 return should_be_scheduled(env, get_Proj_pred(node));
323 if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
326 switch(get_irn_opcode(node)) {
336 if(arch_irn_get_flags(env->arch_env, node) & arch_irn_flags_ignore)
342 static void check_schedule(ir_node *node, void *data) {
343 be_verify_schedule_env_t *env = data;
347 should_be = should_be_scheduled(env, node);
351 scheduled = bitset_is_set(env->scheduled, get_irn_idx(node)) ? 1 : 0;
352 should_be = should_be ? 1 : 0;
353 if(should_be != scheduled) {
354 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
355 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
356 env->problem_found = 1;
361 * Start a walk over the irg and check schedule.
363 int be_verify_schedule(const be_irg_t *birg)
365 be_verify_schedule_env_t env;
367 env.problem_found = 0;
368 env.irg = be_get_birg_irg(birg);
369 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
370 env.arch_env = birg->main_env->arch_env;
372 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
373 // check if all nodes are scheduled
374 irg_walk_graph(env.irg, check_schedule, NULL, &env);
376 return ! env.problem_found;
381 //---------------------------------------------------------------------------
385 typedef struct _spill_t {
391 const arch_env_t *arch_env;
396 } be_verify_spillslots_env_t;
398 static int cmp_spill(const void* d1, const void* d2, size_t size) {
399 const spill_t* s1 = d1;
400 const spill_t* s2 = d2;
401 return s1->spill != s2->spill;
404 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
408 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
411 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
413 int hash = HASH_PTR(node);
416 res = set_find(env->spills, &spill, sizeof(spill), hash);
420 res = set_insert(env->spills, &spill, sizeof(spill), hash);
426 static ir_node *get_memory_edge(const ir_node *node) {
428 ir_node *result = NULL;
430 arity = get_irn_arity(node);
431 for(i = arity - 1; i >= 0; --i) {
432 ir_node *arg = get_irn_n(node, i);
433 if(get_irn_mode(arg) == mode_M) {
434 assert(result == NULL);
443 void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
446 void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
448 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
449 node, get_nodes_block(node), get_irg_dump_name(env->irg));
454 void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
455 ir_entity *spillent = arch_get_frame_entity(env->arch_env, node);
456 be_check_entity(env, node, spillent);
457 get_spill(env, node, ent);
459 if(spillent != ent) {
460 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
461 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
462 env->problem_found = 1;
466 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
469 int hash = HASH_PTR(node);
474 assert(is_Proj(node));
476 memperm = get_Proj_pred(node);
477 out = get_Proj_proj(node);
479 spillent = be_get_MemPerm_out_entity(memperm, out);
480 be_check_entity(env, memperm, spillent);
481 if(spillent != ent) {
482 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
483 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
484 env->problem_found = 1;
488 res = set_find(env->spills, &spill, sizeof(spill), hash);
493 spill.ent = spillent;
494 res = set_insert(env->spills, &spill, sizeof(spill), hash);
496 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
497 ir_node* arg = get_irn_n(memperm, i + 1);
498 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
500 collect(env, arg, memperm, argent);
504 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
507 int hash = HASH_PTR(node);
509 assert(is_Phi(node));
512 res = set_find(env->spills, &spill, sizeof(spill), hash);
518 res = set_insert(env->spills, &spill, sizeof(spill), hash);
520 // is 1 of the arguments a spill?
521 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
522 ir_node* arg = get_irn_n(node, i);
523 collect(env, arg, reload, ent);
527 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
528 if(be_is_Spill(node)) {
529 collect_spill(env, node, reload, ent);
530 } else if(is_Proj(node)) {
531 collect_memperm(env, node, reload, ent);
532 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
533 collect_memphi(env, node, reload, ent);
535 // Disabled for now, spills might get transformed by the backend
537 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
538 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
539 env->problem_found = 1;
545 * This walker function searches for reloads and collects all the spills
546 * and memphis attached to them.
548 static void collect_spills_walker(ir_node *node, void *data) {
549 be_verify_spillslots_env_t *env = data;
550 const arch_env_t *arch_env = env->arch_env;
552 // @@@ ia32_classify returns classification of Proj_pred :-/
556 if(arch_irn_class_is(arch_env, node, reload)) {
557 ir_node *spill = get_memory_edge(node);
561 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
562 node, get_nodes_block(node), get_irg_dump_name(env->irg));
563 env->problem_found = 1;
566 ent = arch_get_frame_entity(env->arch_env, node);
567 be_check_entity(env, node, ent);
569 collect(env, spill, node, ent);
570 ARR_APP1(ir_node*, env->reloads, node);
574 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
575 int spillcount = set_count(env->spills);
576 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
580 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
584 for(i = 0; i < spillcount; ++i) {
585 spill_t *sp1 = spills[i];
588 for(i2 = i+1; i2 < spillcount; ++i2) {
589 spill_t *sp2 = spills[i2];
591 if(sp1->ent != sp2->ent)
594 if(my_values_interfere(sp1->spill, sp2->spill)) {
595 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
596 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
597 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
598 env->problem_found = 1;
599 my_values_interfere(sp1->spill, sp2->spill);
605 static void check_lonely_spills(ir_node *node, void *data) {
606 be_verify_spillslots_env_t *env = data;
608 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
609 spill_t *spill = find_spill(env, node);
610 if(be_is_Spill(node)) {
611 ir_entity *ent = arch_get_frame_entity(env->arch_env, node);
612 be_check_entity(env, node, ent);
616 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
617 node, get_nodes_block(node), get_irg_dump_name(env->irg));
622 int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg)
624 be_verify_spillslots_env_t env;
626 env.arch_env = arch_env;
628 env.spills = new_set(cmp_spill, 10);
629 env.reloads = NEW_ARR_F(ir_node*, 0);
630 env.problem_found = 0;
632 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
633 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
635 check_spillslot_interference(&env);
637 DEL_ARR_F(env.reloads);
640 return ! env.problem_found;
645 //---------------------------------------------------------------------------
650 * Check, if two values interfere.
651 * @param a The first value.
652 * @param b The second value.
653 * @return 1, if a and b interfere, 0 if not.
655 static int my_values_interfere(const ir_node *a, const ir_node *b) {
656 const ir_edge_t *edge;
658 int a2b = value_dominates(a, b);
659 int b2a = value_dominates(b, a);
661 /* If there is no dominance relation, they do not interfere. */
666 * Adjust a and b so, that a dominates b if
667 * a dominates b or vice versa.
670 const ir_node *t = a;
675 bb = get_nodes_block(b);
678 * Look at all usages of a.
679 * If there's one usage of a in the block of b, then
680 * we check, if this use is dominated by b, if that's true
681 * a and b interfere. Note that b must strictly dominate the user,
682 * since if b is the last user of in the block, b and a do not
684 * Uses of a not in b's block can be disobeyed, because the
685 * check for a being live at the end of b's block is already
688 foreach_out_edge(a, edge) {
689 const ir_node *user = get_edge_src_irn(edge);
693 if(get_irn_opcode(user) == iro_End)
696 // in case of phi arguments we compare with the block the value comes from
698 ir_node *phiblock = get_nodes_block(user);
701 user = get_irn_n(phiblock, get_edge_src_pos(edge));
704 if(value_dominates(b, user))
713 //---------------------------------------------------------------------------
717 typedef struct _be_verify_register_allocation_env_t {
718 const arch_env_t *arch_env;
722 } be_verify_register_allocation_env_t;
724 static void check_register_constraints(ir_node *node, be_verify_register_allocation_env_t *env) {
725 const arch_env_t *arch_env = env->arch_env;
726 const arch_register_t *reg;
729 /* verify output register */
730 if (arch_get_irn_reg_class(arch_env, node, -1) != NULL) {
731 reg = arch_get_irn_register(arch_env, node);
733 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
734 node, get_nodes_block(node), get_irg_dump_name(env->irg));
735 env->problem_found = 1;
737 else if (! arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(arch_env, node, -1, reg)) {
738 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
739 reg->name, node, get_nodes_block(node), get_irg_dump_name(env->irg));
740 env->problem_found = 1;
744 /* verify input register */
745 arity = get_irn_arity(node);
746 for (i = 0; i < arity; ++i) {
747 ir_node *pred = get_irn_n(node, i);
749 if (is_Unknown(pred))
753 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
754 node, get_nodes_block(node), get_irg_dump_name(env->irg), i);
755 env->problem_found = 1;
759 if (arch_get_irn_reg_class(arch_env, node, i) == NULL)
762 reg = arch_get_irn_register(arch_env, pred);
764 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
765 pred, get_nodes_block(pred), get_irg_dump_name(env->irg));
766 env->problem_found = 1;
769 else if (! arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(arch_env, node, i, reg)) {
770 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
771 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(env->irg));
772 env->problem_found = 1;
777 static void check_register_allocation(be_verify_register_allocation_env_t *env,
778 const arch_register_class_t *regclass, pset *nodes) {
779 const arch_env_t *arch_env = env->arch_env;
780 const arch_register_t *reg = NULL;
782 bitset_t *registers = bitset_alloca(arch_register_class_n_regs(regclass));
785 foreach_pset(nodes, node) {
786 if (arch_get_irn_reg_class(arch_env, node, -1) != regclass)
789 reg = arch_get_irn_register(arch_env, node);
791 /* this problem is already reported in 'check_register_constraints' */
795 if (bitset_is_set(registers, reg->index)) {
800 bitset_set(registers, reg->index);
804 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s)\n",
805 reg->name, get_nodes_block(node), get_irg_dump_name(env->irg));
806 env->problem_found = 1;
808 foreach_pset(nodes, node) {
809 if (arch_get_irn_register(arch_env, node) == reg) {
810 ir_fprintf(stderr, " at node %+F\n", node);
816 static void verify_block_register_allocation(ir_node *block, void *data) {
817 be_verify_register_allocation_env_t *env = data;
818 const arch_env_t *arch_env = env->arch_env;
819 const arch_isa_t *isa = arch_env->isa;
822 nregclasses = arch_isa_get_n_reg_class(isa);
823 for (i = 0; i < nregclasses; ++i) {
824 const arch_register_class_t *regclass = arch_isa_get_reg_class(isa, i);
826 pset *live_nodes = pset_new_ptr_default();
828 be_liveness_end_of_block(env->lv, env->arch_env, regclass, block, live_nodes);
829 check_register_allocation(env, regclass, live_nodes);
831 sched_foreach_reverse(block, node) {
835 be_liveness_transfer(env->arch_env, regclass, node, live_nodes);
836 check_register_allocation(env, regclass, live_nodes);
837 check_register_constraints(node, env);
840 del_pset(live_nodes);
844 int be_verify_register_allocation(const arch_env_t *arch_env, ir_graph *irg) {
845 be_verify_register_allocation_env_t env;
847 env.arch_env = arch_env;
849 env.lv = be_liveness(irg);
850 env.problem_found = 0;
852 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, &env);
854 be_liveness_free(env.lv);
856 return !env.problem_found;
861 //---------------------------------------------------------------------------
865 typedef struct _verify_out_dead_nodes_env {
869 } verify_out_dead_nodes_env;
871 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
872 ir_graph *irg = env->irg;
873 const ir_edge_t* edge;
875 if(irn_visited(node))
877 mark_irn_visited(node);
879 foreach_out_edge(node, edge) {
880 ir_node* src = get_edge_src_irn(edge);
882 if(!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(node)) {
883 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
884 src, get_nodes_block(src), get_irg_dump_name(irg), node);
885 env->problem_found = 1;
889 check_out_edges(src, env);
893 static void set_reachable(ir_node *node, void* data)
895 bitset_t* reachable = data;
896 bitset_set(reachable, get_irn_idx(node));
899 int be_verify_out_edges(ir_graph *irg) {
900 verify_out_dead_nodes_env env;
903 env.reachable = bitset_alloca(get_irg_last_idx(irg));
904 env.problem_found = edges_verify(irg);
906 irg_walk_in_or_dep_graph(irg, set_reachable, NULL, env.reachable);
907 irg_walk_anchors(irg, set_reachable, NULL, env.reachable);
908 inc_irg_visited(irg);
909 check_out_edges(get_irg_start(irg), &env);
911 return ! env.problem_found;