2 * Copyright (C) 1995-2008 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
44 #include "besched_t.h"
47 #include "beintlive_t.h"
49 static int my_values_interfere(const ir_node *a, const ir_node *b);
51 typedef struct be_verify_register_pressure_env_t_ {
52 ir_graph *irg; /**< the irg to verify */
53 be_lv_t *lv; /**< Liveness information. */
54 const arch_register_class_t *cls; /**< the register class to check for */
55 int registers_available; /**< number of available registers */
56 int problem_found; /**< flag indicating if a problem was found */
57 } be_verify_register_pressure_env_t;
60 * Print all nodes of a pset into a file.
62 static void print_living_values(FILE *F, const ir_nodeset_t *live_nodes) {
63 ir_nodeset_iterator_t iter;
67 foreach_ir_nodeset(live_nodes, node, iter) {
68 ir_fprintf(F, "%+F ", node);
74 * Check if number of live nodes never exceeds the number of available registers.
76 static void verify_liveness_walker(ir_node *block, void *data) {
77 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
78 ir_nodeset_t live_nodes;
82 /* collect register pressure info, start with end of a block */
83 // ir_fprintf(stderr, "liveness check %+F\n", block);
84 ir_nodeset_init(&live_nodes);
85 be_liveness_end_of_block(env->lv, env->cls, block,
88 // print_living_values(stderr, &live_nodes);
89 pressure = ir_nodeset_size(&live_nodes);
90 if(pressure > env->registers_available) {
91 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
92 block, get_irg_dump_name(env->irg), pressure, env->registers_available);
93 print_living_values(stderr, &live_nodes);
94 env->problem_found = 1;
97 sched_foreach_reverse(block, irn) {
101 // print_living_values(stderr, &live_nodes);
102 be_liveness_transfer(env->cls, irn, &live_nodes);
104 pressure = ir_nodeset_size(&live_nodes);
106 if(pressure > env->registers_available) {
107 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
108 irn, block, get_irg_dump_name(env->irg), pressure, env->registers_available);
109 print_living_values(stderr, &live_nodes);
110 env->problem_found = 1;
114 ir_nodeset_destroy(&live_nodes);
118 * Start a walk over the irg and check the register pressure.
120 int be_verify_register_pressure(const be_irg_t *birg,
121 const arch_register_class_t *cls,
123 be_verify_register_pressure_env_t env;
125 env.lv = be_liveness(birg);
128 env.registers_available = env.cls->n_regs - be_put_ignore_regs(birg, env.cls, NULL);
129 env.problem_found = 0;
131 be_liveness_assure_sets(env.lv);
132 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
133 be_liveness_free(env.lv);
135 return ! env.problem_found;
140 /*--------------------------------------------------------------------------- */
144 typedef struct be_verify_schedule_env_t_ {
145 int problem_found; /**< flags indicating if there was a problem */
146 bitset_t *scheduled; /**< bitset of scheduled nodes */
147 ir_graph *irg; /**< the irg to check */
148 } be_verify_schedule_env_t;
151 * Simple schedule checker.
153 static void verify_schedule_walker(ir_node *block, void *data) {
154 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
156 ir_node *non_phi_found = NULL;
157 int cfchange_found = 0;
158 /* TODO ask arch about delay branches */
159 int delay_branches = 0;
160 int last_timestep = INT_MIN;
163 * Tests for the following things:
164 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
165 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
166 * 3. No value is defined after it has been used
167 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
168 * (except mode_X projs)
170 sched_foreach(block, node) {
174 /* this node is scheduled */
175 if(bitset_is_set(env->scheduled, get_irn_idx(node))) {
176 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
177 env->problem_found = 1;
179 bitset_set(env->scheduled, get_irn_idx(node));
181 /* Check that scheduled nodes are in the correct block */
182 if(get_nodes_block(node) != block) {
183 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
184 env->problem_found = 1;
187 /* Check that timesteps are increasing */
188 timestep = sched_get_time_step(node);
189 if(timestep <= last_timestep) {
190 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
192 env->problem_found = 1;
194 last_timestep = timestep;
196 /* Check that phis come before any other node */
198 if (non_phi_found != NULL) {
199 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
200 node, non_phi_found, block, get_irg_dump_name(env->irg));
201 env->problem_found = 1;
204 non_phi_found = node;
207 /* Check for control flow changing nodes */
208 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
209 /* check, that only one CF operation is scheduled */
210 if (cfchange_found == 1) {
211 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
212 node, block, get_irg_dump_name(env->irg));
213 env->problem_found = 1;
216 } else if (cfchange_found) {
217 /* proj and keepany aren't real instructions... */
218 if(!is_Proj(node) && !be_is_Keep(node)) {
219 /* check for delay branches */
220 if (delay_branches == 0) {
221 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
222 node, block, get_irg_dump_name(env->irg));
223 env->problem_found = 1;
230 /* Check that all uses come before their definitions */
232 int nodetime = sched_get_time_step(node);
233 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
234 ir_node *arg = get_irn_n(node, i);
235 if(get_nodes_block(arg) != block
236 || !sched_is_scheduled(arg))
239 if(sched_get_time_step(arg) >= nodetime) {
240 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
241 arg, node, block, get_irg_dump_name(env->irg));
242 env->problem_found = 1;
247 /* Check that no dead nodes are scheduled */
248 if(get_irn_n_edges(node) == 0) {
249 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
250 node, block, get_irg_dump_name(env->irg));
251 env->problem_found = 1;
254 if(be_is_Keep(node)) {
255 /* at least 1 of the keep arguments has to be it schedule
257 int arity = get_irn_arity(node);
259 ir_node *prev = sched_prev(node);
260 while(be_is_Keep(prev))
261 prev = sched_prev(prev);
263 for(i = 0; i < arity; ++i) {
264 ir_node *in = get_irn_n(node, i);
270 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
271 node, block, get_irg_dump_name(env->irg));
272 env->problem_found = 1;
277 /* check that all delay branches are filled (at least with NOPs) */
278 if (cfchange_found && delay_branches != 0) {
279 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
280 block, get_irg_dump_name(env->irg));
281 env->problem_found = 1;
285 static int should_be_scheduled(ir_node *node)
293 if(get_irn_mode(node) == mode_M) {
294 if(is_Phi(node) || is_Sync(node) || is_Pin(node))
297 if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
300 switch(get_irn_opcode(node)) {
310 if (arch_irn_get_flags(node) & arch_irn_flags_ignore)
316 static void check_schedule(ir_node *node, void *data) {
317 be_verify_schedule_env_t *env = data;
321 should_be = should_be_scheduled(node);
325 scheduled = bitset_is_set(env->scheduled, get_irn_idx(node)) ? 1 : 0;
326 should_be = should_be ? 1 : 0;
327 if(should_be != scheduled) {
328 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
329 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
330 env->problem_found = 1;
335 * Start a walk over the irg and check schedule.
337 int be_verify_schedule(const be_irg_t *birg)
339 be_verify_schedule_env_t env;
341 env.problem_found = 0;
342 env.irg = be_get_birg_irg(birg);
343 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
345 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
346 /* check if all nodes are scheduled */
347 irg_walk_graph(env.irg, check_schedule, NULL, &env);
349 return ! env.problem_found;
354 /*--------------------------------------------------------------------------- */
358 typedef struct _spill_t {
368 } be_verify_spillslots_env_t;
370 static int cmp_spill(const void* d1, const void* d2, size_t size) {
371 const spill_t* s1 = d1;
372 const spill_t* s2 = d2;
375 return s1->spill != s2->spill;
378 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
382 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
385 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
387 int hash = HASH_PTR(node);
390 res = set_find(env->spills, &spill, sizeof(spill), hash);
394 res = set_insert(env->spills, &spill, sizeof(spill), hash);
400 static ir_node *get_memory_edge(const ir_node *node) {
402 ir_node *result = NULL;
404 arity = get_irn_arity(node);
405 for(i = arity - 1; i >= 0; --i) {
406 ir_node *arg = get_irn_n(node, i);
407 if(get_irn_mode(arg) == mode_M) {
408 assert(result == NULL);
417 void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
420 void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
422 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
423 node, get_nodes_block(node), get_irg_dump_name(env->irg));
428 void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
429 ir_entity *spillent = arch_get_frame_entity(node);
430 be_check_entity(env, node, spillent);
431 get_spill(env, node, ent);
433 if(spillent != ent) {
434 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
435 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
436 env->problem_found = 1;
440 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
443 int hash = HASH_PTR(node);
448 assert(is_Proj(node));
450 memperm = get_Proj_pred(node);
451 out = get_Proj_proj(node);
453 spillent = be_get_MemPerm_out_entity(memperm, out);
454 be_check_entity(env, memperm, spillent);
455 if(spillent != ent) {
456 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
457 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
458 env->problem_found = 1;
462 res = set_find(env->spills, &spill, sizeof(spill), hash);
467 spill.ent = spillent;
468 res = set_insert(env->spills, &spill, sizeof(spill), hash);
470 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
471 ir_node* arg = get_irn_n(memperm, i + 1);
472 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
474 collect(env, arg, memperm, argent);
478 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
481 int hash = HASH_PTR(node);
483 assert(is_Phi(node));
486 res = set_find(env->spills, &spill, sizeof(spill), hash);
492 res = set_insert(env->spills, &spill, sizeof(spill), hash);
494 /* is 1 of the arguments a spill? */
495 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
496 ir_node* arg = get_irn_n(node, i);
497 collect(env, arg, reload, ent);
501 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
502 if(be_is_Spill(node)) {
503 collect_spill(env, node, reload, ent);
504 } else if(is_Proj(node)) {
505 collect_memperm(env, node, reload, ent);
506 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
507 collect_memphi(env, node, reload, ent);
509 /* Disabled for now, spills might get transformed by the backend */
511 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
512 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
513 env->problem_found = 1;
519 * This walker function searches for reloads and collects all the spills
520 * and memphis attached to them.
522 static void collect_spills_walker(ir_node *node, void *data) {
523 be_verify_spillslots_env_t *env = data;
525 /* @@@ ia32_classify returns classification of Proj_pred :-/ */
529 if (arch_irn_class_is(node, reload)) {
530 ir_node *spill = get_memory_edge(node);
534 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
535 node, get_nodes_block(node), get_irg_dump_name(env->irg));
536 env->problem_found = 1;
539 ent = arch_get_frame_entity(node);
540 be_check_entity(env, node, ent);
542 collect(env, spill, node, ent);
543 ARR_APP1(ir_node*, env->reloads, node);
547 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
548 int spillcount = set_count(env->spills);
549 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
553 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
557 for(i = 0; i < spillcount; ++i) {
558 spill_t *sp1 = spills[i];
561 for(i2 = i+1; i2 < spillcount; ++i2) {
562 spill_t *sp2 = spills[i2];
564 if(sp1->ent != sp2->ent)
567 if(my_values_interfere(sp1->spill, sp2->spill)) {
568 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
569 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
570 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
571 env->problem_found = 1;
572 my_values_interfere(sp1->spill, sp2->spill);
578 static void check_lonely_spills(ir_node *node, void *data) {
579 be_verify_spillslots_env_t *env = data;
581 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
582 spill_t *spill = find_spill(env, node);
583 if(be_is_Spill(node)) {
584 ir_entity *ent = arch_get_frame_entity(node);
585 be_check_entity(env, node, ent);
589 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
590 node, get_nodes_block(node), get_irg_dump_name(env->irg));
595 int be_verify_spillslots(ir_graph *irg)
597 be_verify_spillslots_env_t env;
600 env.spills = new_set(cmp_spill, 10);
601 env.reloads = NEW_ARR_F(ir_node*, 0);
602 env.problem_found = 0;
604 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
605 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
607 check_spillslot_interference(&env);
609 DEL_ARR_F(env.reloads);
612 return ! env.problem_found;
617 /*--------------------------------------------------------------------------- */
622 * Check, if two values interfere.
623 * @param a The first value.
624 * @param b The second value.
625 * @return 1, if a and b interfere, 0 if not.
627 static int my_values_interfere(const ir_node *a, const ir_node *b) {
628 const ir_edge_t *edge;
630 int a2b = value_dominates(a, b);
631 int b2a = value_dominates(b, a);
633 /* If there is no dominance relation, they do not interfere. */
638 * Adjust a and b so, that a dominates b if
639 * a dominates b or vice versa.
642 const ir_node *t = a;
647 bb = get_nodes_block(b);
650 * Look at all usages of a.
651 * If there's one usage of a in the block of b, then
652 * we check, if this use is dominated by b, if that's true
653 * a and b interfere. Note that b must strictly dominate the user,
654 * since if b is the last user of in the block, b and a do not
656 * Uses of a not in b's block can be disobeyed, because the
657 * check for a being live at the end of b's block is already
660 foreach_out_edge(a, edge) {
661 const ir_node *user = get_edge_src_irn(edge);
665 if(get_irn_opcode(user) == iro_End)
668 /* in case of phi arguments we compare with the block the value comes from */
670 ir_node *phiblock = get_nodes_block(user);
673 user = get_irn_n(phiblock, get_edge_src_pos(edge));
676 if(value_dominates(b, user))
685 /*--------------------------------------------------------------------------- */
687 static const arch_env_t *arch_env;
688 static ir_graph *irg;
690 static int problem_found;
691 static const arch_register_class_t *regclass;
692 static ir_node **registers;
694 static void check_register_constraints(ir_node *node)
696 const arch_register_t *reg;
699 /* verify output register */
700 if (arch_get_irn_reg_class(node, -1) != NULL) {
701 reg = arch_get_irn_register(node);
703 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
704 node, get_nodes_block(node), get_irg_dump_name(irg));
706 } else if (!arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(node, -1, reg)) {
707 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
708 reg->name, node, get_nodes_block(node), get_irg_dump_name(irg));
713 /* verify input register */
714 arity = get_irn_arity(node);
715 for (i = 0; i < arity; ++i) {
716 ir_node *pred = get_irn_n(node, i);
718 if (is_Unknown(pred))
722 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
723 node, get_nodes_block(node), get_irg_dump_name(irg), i);
728 if (arch_get_irn_reg_class(node, i) == NULL)
731 reg = arch_get_irn_register(pred);
733 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
734 pred, get_nodes_block(pred), get_irg_dump_name(irg), node);
737 } else if (!arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(node, i, reg)) {
738 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
739 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(irg));
744 /* phis should be NOPs at this point, which means all input regs
745 * must be the same as the output reg */
749 reg = arch_get_irn_register(node);
751 arity = get_irn_arity(node);
752 for (i = 0; i < arity; ++i) {
753 ir_node *pred = get_Phi_pred(node, i);
754 const arch_register_t *pred_reg = arch_get_irn_register(pred);
756 if (reg != pred_reg && !arch_register_type_is(pred_reg, joker)) {
757 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
758 i, node, get_nodes_block(node), get_irg_dump_name(irg), pred_reg->name, reg->name);
765 static void value_used(ir_node *node) {
766 const arch_register_t *reg;
769 if (arch_get_irn_reg_class(node, -1) != regclass)
772 reg = arch_get_irn_register(node);
773 if (reg->type & arch_register_type_virtual)
776 reg_node = registers[reg->index];
777 if (reg_node != NULL && reg_node != node) {
778 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
779 reg->name, get_nodes_block(node), get_irg_dump_name(irg),
784 registers[reg->index] = node;
787 static void value_def(ir_node *node)
789 const arch_register_t *reg;
792 if (arch_get_irn_reg_class(node, -1) != regclass)
795 reg = arch_get_irn_register(node);
796 if (reg->type & arch_register_type_virtual)
799 reg_node = registers[reg->index];
801 if (reg_node != node) {
802 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
803 node, reg->name, reg_node, get_nodes_block(node), get_irg_dump_name(irg));
806 registers[reg->index] = NULL;
809 static void verify_block_register_allocation(ir_node *block, void *data) {
813 nregclasses = arch_env_get_n_reg_class(arch_env);
814 for (i = 0; i < nregclasses; ++i) {
818 regclass = arch_env_get_reg_class(arch_env, i);
820 assert(lv->nodes && "live sets must be computed");
822 n_regs = arch_register_class_n_regs(regclass);
823 registers = alloca(n_regs * sizeof(registers[0]));
824 memset(registers, 0, n_regs * sizeof(registers[0]));
826 be_lv_foreach(lv, block, be_lv_state_end, idx) {
827 ir_node *node = be_lv_get_irn(lv, block, idx);
831 sched_foreach_reverse(block, node) {
834 if (get_irn_mode(node) == mode_T) {
835 const ir_edge_t *edge;
836 foreach_out_edge(node, edge) {
837 ir_node *def = get_edge_src_irn(edge);
844 check_register_constraints(node);
848 arity = get_irn_arity(node);
849 for (i2 = 0; i2 < arity; ++i2) {
850 ir_node *use = get_irn_n(node, i2);
855 be_lv_foreach(lv, block, be_lv_state_in, idx) {
856 ir_node *node = be_lv_get_irn(lv, block, idx);
860 /* set must be empty now */
861 for (i2 = 0; i2 < n_regs; ++i2) {
862 if (registers[i2] == NULL)
865 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
866 registers[i2], block, get_irg_dump_name(irg));
872 int be_verify_register_allocation(const be_irg_t *birg) {
873 arch_env = be_get_birg_arch_env(birg);
874 irg = be_get_birg_irg(birg);
875 lv = be_liveness(birg);
878 be_liveness_assure_sets(lv);
879 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
881 be_liveness_free(lv);
883 return !problem_found;
888 /*--------------------------------------------------------------------------- */
892 typedef struct _verify_out_dead_nodes_env {
896 } verify_out_dead_nodes_env;
898 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
899 ir_graph *irg = env->irg;
900 const ir_edge_t* edge;
902 if (irn_visited_else_mark(node))
905 /* we find too many (uncritical) dead nodes in block out edges */
909 foreach_out_edge(node, edge) {
910 ir_node* src = get_edge_src_irn(edge);
912 if(!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(src)) {
913 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
914 src, get_nodes_block(src), get_irg_dump_name(irg), node);
915 env->problem_found = 1;
919 check_out_edges(src, env);
923 static void set_reachable(ir_node *node, void* data)
925 bitset_t* reachable = data;
926 bitset_set(reachable, get_irn_idx(node));
929 int be_verify_out_edges(ir_graph *irg) {
930 verify_out_dead_nodes_env env;
933 env.reachable = bitset_alloca(get_irg_last_idx(irg));
934 env.problem_found = edges_verify(irg);
936 irg_walk_in_or_dep_graph(irg, set_reachable, NULL, env.reachable);
937 irg_walk_anchors(irg, set_reachable, NULL, env.reachable);
938 inc_irg_visited(irg);
939 check_out_edges(get_irg_start(irg), &env);
941 return ! env.problem_found;