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 be_liveness_assure_sets(env.lv);
129 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
130 be_liveness_free(env.lv);
132 return ! env.problem_found;
137 /*--------------------------------------------------------------------------- */
141 typedef struct be_verify_schedule_env_t_ {
142 int problem_found; /**< flags indicating if there was a problem */
143 bitset_t *scheduled; /**< bitset of scheduled nodes */
144 ir_graph *irg; /**< the irg to check */
145 const arch_env_t *arch_env; /**< the arch_env */
146 } be_verify_schedule_env_t;
149 * Simple schedule checker.
151 static void verify_schedule_walker(ir_node *block, void *data) {
152 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
154 int non_phi_found = 0;
155 int cfchange_found = 0;
156 /* TODO ask arch about delay branches */
157 int delay_branches = 0;
158 int last_timestep = INT_MIN;
161 * Tests for the following things:
162 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
163 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
164 * 3. No value is defined after it has been used
165 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
166 * (except mode_X projs)
168 sched_foreach(block, node) {
172 /* this node is scheduled */
173 if(bitset_is_set(env->scheduled, get_irn_idx(node))) {
174 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
175 env->problem_found = 1;
177 bitset_set(env->scheduled, get_irn_idx(node));
179 /* Check that scheduled nodes are in the correct block */
180 if(get_nodes_block(node) != block) {
181 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
182 env->problem_found = 1;
185 /* Check that timesteps are increasing */
186 timestep = sched_get_time_step(node);
187 if(timestep <= last_timestep) {
188 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
190 env->problem_found = 1;
192 last_timestep = timestep;
194 /* Check that phis come before any other node */
197 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes in block %+F (%s)\n",
198 node, block, get_irg_dump_name(env->irg));
199 env->problem_found = 1;
205 /* Check for control flow changing nodes */
206 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
207 /* check, that only one CF operation is scheduled */
208 if (cfchange_found == 1) {
209 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
210 node, block, get_irg_dump_name(env->irg));
211 env->problem_found = 1;
214 } else if (cfchange_found) {
215 /* proj and keepany aren't real instructions... */
216 if(!is_Proj(node) && !be_is_Keep(node)) {
217 /* check for delay branches */
218 if (delay_branches == 0) {
219 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
220 node, block, get_irg_dump_name(env->irg));
221 env->problem_found = 1;
228 /* Check that all uses come before their definitions */
230 int nodetime = sched_get_time_step(node);
231 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
232 ir_node *arg = get_irn_n(node, i);
233 if(get_nodes_block(arg) != block
234 || !sched_is_scheduled(arg))
237 if(sched_get_time_step(arg) >= nodetime) {
238 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
239 arg, node, block, get_irg_dump_name(env->irg));
240 env->problem_found = 1;
245 /* Check that no dead nodes are scheduled */
246 if(get_irn_n_edges(node) == 0) {
247 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
248 node, block, get_irg_dump_name(env->irg));
249 env->problem_found = 1;
252 #ifdef SCHEDULE_PROJS
253 /* check that all projs/keeps are behind their nodes */
255 ir_node *prev = sched_prev(node);
257 prev = sched_prev(prev);
258 if(get_Proj_pred(node) != prev) {
259 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
260 node, block, get_irg_dump_name(env->irg));
261 env->problem_found = 1;
265 if(be_is_Keep(node)) {
266 int arity = get_irn_arity(node);
268 for(i = 0; i < arity; ++i) {
269 ir_node *in = get_irn_n(node, i);
270 ir_node *succ = sched_next(in);
271 while(succ != node && !sched_is_end(succ)) {
272 /* the node in between has to be another input of the
278 succ = sched_next(succ);
282 for(i2 = 0; i2 < arity; ++i2) {
283 ir_node *in2 = get_irn_n(node, i2);
292 succ = sched_next(succ);
296 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
297 node, block, get_irg_dump_name(env->irg));
298 env->problem_found = 1;
303 /* check that all delay branches are filled (at least with NOPs) */
304 if (cfchange_found && delay_branches != 0) {
305 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
306 block, get_irg_dump_name(env->irg));
307 env->problem_found = 1;
311 static int should_be_scheduled(be_verify_schedule_env_t *env, ir_node *node) {
315 if(get_irn_mode(node) == mode_M) {
318 if(is_Phi(node) || is_Sync(node) || is_Pin(node))
321 #ifdef SCHEDULE_PROJS
323 if(get_irn_mode(node) == mode_X)
325 return should_be_scheduled(env, get_Proj_pred(node));
331 if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
334 switch(get_irn_opcode(node)) {
344 if(arch_irn_get_flags(env->arch_env, node) & arch_irn_flags_ignore)
350 static void check_schedule(ir_node *node, void *data) {
351 be_verify_schedule_env_t *env = data;
355 should_be = should_be_scheduled(env, node);
359 scheduled = bitset_is_set(env->scheduled, get_irn_idx(node)) ? 1 : 0;
360 should_be = should_be ? 1 : 0;
361 if(should_be != scheduled) {
362 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
363 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
364 env->problem_found = 1;
369 * Start a walk over the irg and check schedule.
371 int be_verify_schedule(const be_irg_t *birg)
373 be_verify_schedule_env_t env;
375 env.problem_found = 0;
376 env.irg = be_get_birg_irg(birg);
377 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
378 env.arch_env = birg->main_env->arch_env;
380 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
381 /* check if all nodes are scheduled */
382 irg_walk_graph(env.irg, check_schedule, NULL, &env);
384 return ! env.problem_found;
389 /*--------------------------------------------------------------------------- */
393 typedef struct _spill_t {
399 const arch_env_t *arch_env;
404 } be_verify_spillslots_env_t;
406 static int cmp_spill(const void* d1, const void* d2, size_t size) {
407 const spill_t* s1 = d1;
408 const spill_t* s2 = d2;
411 return s1->spill != s2->spill;
414 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
418 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
421 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
423 int hash = HASH_PTR(node);
426 res = set_find(env->spills, &spill, sizeof(spill), hash);
430 res = set_insert(env->spills, &spill, sizeof(spill), hash);
436 static ir_node *get_memory_edge(const ir_node *node) {
438 ir_node *result = NULL;
440 arity = get_irn_arity(node);
441 for(i = arity - 1; i >= 0; --i) {
442 ir_node *arg = get_irn_n(node, i);
443 if(get_irn_mode(arg) == mode_M) {
444 assert(result == NULL);
453 void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
456 void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
458 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
459 node, get_nodes_block(node), get_irg_dump_name(env->irg));
464 void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
465 ir_entity *spillent = arch_get_frame_entity(env->arch_env, node);
466 be_check_entity(env, node, spillent);
467 get_spill(env, node, ent);
469 if(spillent != ent) {
470 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
471 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
472 env->problem_found = 1;
476 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
479 int hash = HASH_PTR(node);
484 assert(is_Proj(node));
486 memperm = get_Proj_pred(node);
487 out = get_Proj_proj(node);
489 spillent = be_get_MemPerm_out_entity(memperm, out);
490 be_check_entity(env, memperm, spillent);
491 if(spillent != ent) {
492 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
493 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
494 env->problem_found = 1;
498 res = set_find(env->spills, &spill, sizeof(spill), hash);
503 spill.ent = spillent;
504 res = set_insert(env->spills, &spill, sizeof(spill), hash);
506 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
507 ir_node* arg = get_irn_n(memperm, i + 1);
508 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
510 collect(env, arg, memperm, argent);
514 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
517 int hash = HASH_PTR(node);
519 assert(is_Phi(node));
522 res = set_find(env->spills, &spill, sizeof(spill), hash);
528 res = set_insert(env->spills, &spill, sizeof(spill), hash);
530 /* is 1 of the arguments a spill? */
531 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
532 ir_node* arg = get_irn_n(node, i);
533 collect(env, arg, reload, ent);
537 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
538 if(be_is_Spill(node)) {
539 collect_spill(env, node, reload, ent);
540 } else if(is_Proj(node)) {
541 collect_memperm(env, node, reload, ent);
542 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
543 collect_memphi(env, node, reload, ent);
545 /* Disabled for now, spills might get transformed by the backend */
547 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
548 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
549 env->problem_found = 1;
555 * This walker function searches for reloads and collects all the spills
556 * and memphis attached to them.
558 static void collect_spills_walker(ir_node *node, void *data) {
559 be_verify_spillslots_env_t *env = data;
560 const arch_env_t *arch_env = env->arch_env;
562 /* @@@ ia32_classify returns classification of Proj_pred :-/ */
566 if(arch_irn_class_is(arch_env, node, reload)) {
567 ir_node *spill = get_memory_edge(node);
571 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
572 node, get_nodes_block(node), get_irg_dump_name(env->irg));
573 env->problem_found = 1;
576 ent = arch_get_frame_entity(env->arch_env, node);
577 be_check_entity(env, node, ent);
579 collect(env, spill, node, ent);
580 ARR_APP1(ir_node*, env->reloads, node);
584 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
585 int spillcount = set_count(env->spills);
586 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
590 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
594 for(i = 0; i < spillcount; ++i) {
595 spill_t *sp1 = spills[i];
598 for(i2 = i+1; i2 < spillcount; ++i2) {
599 spill_t *sp2 = spills[i2];
601 if(sp1->ent != sp2->ent)
604 if(my_values_interfere(sp1->spill, sp2->spill)) {
605 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
606 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
607 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
608 env->problem_found = 1;
609 my_values_interfere(sp1->spill, sp2->spill);
615 static void check_lonely_spills(ir_node *node, void *data) {
616 be_verify_spillslots_env_t *env = data;
618 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
619 spill_t *spill = find_spill(env, node);
620 if(be_is_Spill(node)) {
621 ir_entity *ent = arch_get_frame_entity(env->arch_env, node);
622 be_check_entity(env, node, ent);
626 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
627 node, get_nodes_block(node), get_irg_dump_name(env->irg));
632 int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg)
634 be_verify_spillslots_env_t env;
636 env.arch_env = arch_env;
638 env.spills = new_set(cmp_spill, 10);
639 env.reloads = NEW_ARR_F(ir_node*, 0);
640 env.problem_found = 0;
642 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
643 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
645 check_spillslot_interference(&env);
647 DEL_ARR_F(env.reloads);
650 return ! env.problem_found;
655 /*--------------------------------------------------------------------------- */
660 * Check, if two values interfere.
661 * @param a The first value.
662 * @param b The second value.
663 * @return 1, if a and b interfere, 0 if not.
665 static int my_values_interfere(const ir_node *a, const ir_node *b) {
666 const ir_edge_t *edge;
668 int a2b = value_dominates(a, b);
669 int b2a = value_dominates(b, a);
671 /* If there is no dominance relation, they do not interfere. */
676 * Adjust a and b so, that a dominates b if
677 * a dominates b or vice versa.
680 const ir_node *t = a;
685 bb = get_nodes_block(b);
688 * Look at all usages of a.
689 * If there's one usage of a in the block of b, then
690 * we check, if this use is dominated by b, if that's true
691 * a and b interfere. Note that b must strictly dominate the user,
692 * since if b is the last user of in the block, b and a do not
694 * Uses of a not in b's block can be disobeyed, because the
695 * check for a being live at the end of b's block is already
698 foreach_out_edge(a, edge) {
699 const ir_node *user = get_edge_src_irn(edge);
703 if(get_irn_opcode(user) == iro_End)
706 /* in case of phi arguments we compare with the block the value comes from */
708 ir_node *phiblock = get_nodes_block(user);
711 user = get_irn_n(phiblock, get_edge_src_pos(edge));
714 if(value_dominates(b, user))
723 /*--------------------------------------------------------------------------- */
727 typedef struct _be_verify_register_allocation_env_t {
728 const arch_env_t *arch_env;
732 } be_verify_register_allocation_env_t;
734 static void check_register_constraints(ir_node *node, be_verify_register_allocation_env_t *env) {
735 const arch_env_t *arch_env = env->arch_env;
736 const arch_register_t *reg;
739 /* verify output register */
740 if (arch_get_irn_reg_class(arch_env, node, -1) != NULL) {
741 reg = arch_get_irn_register(arch_env, node);
743 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
744 node, get_nodes_block(node), get_irg_dump_name(env->irg));
745 env->problem_found = 1;
747 else if (! arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(arch_env, node, -1, reg)) {
748 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
749 reg->name, node, get_nodes_block(node), get_irg_dump_name(env->irg));
750 env->problem_found = 1;
754 /* verify input register */
755 arity = get_irn_arity(node);
756 for (i = 0; i < arity; ++i) {
757 ir_node *pred = get_irn_n(node, i);
759 if (is_Unknown(pred))
763 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
764 node, get_nodes_block(node), get_irg_dump_name(env->irg), i);
765 env->problem_found = 1;
769 if (arch_get_irn_reg_class(arch_env, node, i) == NULL)
772 reg = arch_get_irn_register(arch_env, pred);
774 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
775 pred, get_nodes_block(pred), get_irg_dump_name(env->irg));
776 env->problem_found = 1;
779 else if (! arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(arch_env, node, i, reg)) {
780 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
781 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(env->irg));
782 env->problem_found = 1;
787 static void check_register_allocation(be_verify_register_allocation_env_t *env,
788 const arch_register_class_t *regclass, pset *nodes) {
789 const arch_env_t *arch_env = env->arch_env;
790 const arch_register_t *reg = NULL;
792 bitset_t *registers = bitset_alloca(arch_register_class_n_regs(regclass));
795 foreach_pset(nodes, node) {
796 if (arch_get_irn_reg_class(arch_env, node, -1) != regclass)
799 reg = arch_get_irn_register(arch_env, node);
801 /* this problem is already reported in 'check_register_constraints' */
805 if (bitset_is_set(registers, reg->index)) {
810 bitset_set(registers, reg->index);
814 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s)\n",
815 reg->name, get_nodes_block(node), get_irg_dump_name(env->irg));
816 env->problem_found = 1;
818 foreach_pset(nodes, node) {
819 if (arch_get_irn_register(arch_env, node) == reg) {
820 ir_fprintf(stderr, " at node %+F\n", node);
826 static void verify_block_register_allocation(ir_node *block, void *data) {
827 be_verify_register_allocation_env_t *env = data;
828 const arch_env_t *arch_env = env->arch_env;
829 const arch_isa_t *isa = arch_env->isa;
832 nregclasses = arch_isa_get_n_reg_class(isa);
833 for (i = 0; i < nregclasses; ++i) {
834 const arch_register_class_t *regclass = arch_isa_get_reg_class(isa, i);
836 pset *live_nodes = pset_new_ptr_default();
838 be_liveness_end_of_block(env->lv, env->arch_env, regclass, block, live_nodes);
839 check_register_allocation(env, regclass, live_nodes);
841 sched_foreach_reverse(block, node) {
845 be_liveness_transfer(env->arch_env, regclass, node, live_nodes);
846 check_register_allocation(env, regclass, live_nodes);
847 check_register_constraints(node, env);
850 del_pset(live_nodes);
854 int be_verify_register_allocation(const arch_env_t *arch_env, ir_graph *irg) {
855 be_verify_register_allocation_env_t env;
857 env.arch_env = arch_env;
859 env.lv = be_liveness(irg);
860 env.problem_found = 0;
862 be_liveness_assure_sets(env.lv);
863 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, &env);
865 be_liveness_free(env.lv);
867 return !env.problem_found;
872 /*--------------------------------------------------------------------------- */
876 typedef struct _verify_out_dead_nodes_env {
880 } verify_out_dead_nodes_env;
882 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
883 ir_graph *irg = env->irg;
884 const ir_edge_t* edge;
886 if(irn_visited(node))
888 mark_irn_visited(node);
890 foreach_out_edge(node, edge) {
891 ir_node* src = get_edge_src_irn(edge);
893 if(!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(node)) {
894 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
895 src, get_nodes_block(src), get_irg_dump_name(irg), node);
896 env->problem_found = 1;
900 check_out_edges(src, env);
904 static void set_reachable(ir_node *node, void* data)
906 bitset_t* reachable = data;
907 bitset_set(reachable, get_irn_idx(node));
910 int be_verify_out_edges(ir_graph *irg) {
911 verify_out_dead_nodes_env env;
914 env.reachable = bitset_alloca(get_irg_last_idx(irg));
915 env.problem_found = edges_verify(irg);
917 irg_walk_in_or_dep_graph(irg, set_reachable, NULL, env.reachable);
918 irg_walk_anchors(irg, set_reachable, NULL, env.reachable);
919 inc_irg_visited(irg);
920 check_out_edges(get_irg_start(irg), &env);
922 return ! env.problem_found;