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
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_register_class_t *cls; /**< the register class to check for */
57 int registers_available; /**< number of available registers */
58 int problem_found; /**< flag indicating if a problem was found */
59 } be_verify_register_pressure_env_t;
62 * Print all nodes of a pset into a file.
64 static void print_living_values(FILE *F, const ir_nodeset_t *live_nodes) {
65 ir_nodeset_iterator_t iter;
69 foreach_ir_nodeset(live_nodes, node, iter) {
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 ir_nodeset_t live_nodes;
84 /* collect register pressure info, start with end of a block */
85 // ir_fprintf(stderr, "liveness check %+F\n", block);
86 ir_nodeset_init(&live_nodes);
87 be_liveness_end_of_block(env->lv, env->cls, block,
90 // print_living_values(stderr, &live_nodes);
91 pressure = ir_nodeset_size(&live_nodes);
92 if(pressure > env->registers_available) {
93 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
94 block, get_irg_dump_name(env->irg), pressure, env->registers_available);
95 print_living_values(stderr, &live_nodes);
96 env->problem_found = 1;
99 sched_foreach_reverse(block, irn) {
103 // print_living_values(stderr, &live_nodes);
104 be_liveness_transfer(env->cls, irn, &live_nodes);
106 pressure = ir_nodeset_size(&live_nodes);
108 if(pressure > env->registers_available) {
109 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
110 irn, block, get_irg_dump_name(env->irg), pressure, env->registers_available);
111 print_living_values(stderr, &live_nodes);
112 env->problem_found = 1;
116 ir_nodeset_destroy(&live_nodes);
120 * Start a walk over the irg and check the register pressure.
122 int be_verify_register_pressure(const be_irg_t *birg,
123 const arch_register_class_t *cls,
125 be_verify_register_pressure_env_t env;
127 env.lv = be_liveness(birg);
130 env.registers_available = env.cls->n_regs - be_put_ignore_regs(birg, env.cls, NULL);
131 env.problem_found = 0;
133 be_liveness_assure_sets(env.lv);
134 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
135 be_liveness_free(env.lv);
137 return ! env.problem_found;
142 /*--------------------------------------------------------------------------- */
146 typedef struct be_verify_schedule_env_t_ {
147 int problem_found; /**< flags indicating if there was a problem */
148 bitset_t *scheduled; /**< bitset of scheduled nodes */
149 ir_graph *irg; /**< the irg to check */
150 } be_verify_schedule_env_t;
153 * Simple schedule checker.
155 static void verify_schedule_walker(ir_node *block, void *data) {
156 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
158 ir_node *non_phi_found = NULL;
159 int cfchange_found = 0;
160 /* TODO ask arch about delay branches */
161 int delay_branches = 0;
162 int last_timestep = INT_MIN;
165 * Tests for the following things:
166 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
167 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
168 * 3. No value is defined after it has been used
169 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
170 * (except mode_X projs)
172 sched_foreach(block, node) {
176 /* this node is scheduled */
177 if(bitset_is_set(env->scheduled, get_irn_idx(node))) {
178 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
179 env->problem_found = 1;
181 bitset_set(env->scheduled, get_irn_idx(node));
183 /* Check that scheduled nodes are in the correct block */
184 if(get_nodes_block(node) != block) {
185 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
186 env->problem_found = 1;
189 /* Check that timesteps are increasing */
190 timestep = sched_get_time_step(node);
191 if(timestep <= last_timestep) {
192 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
194 env->problem_found = 1;
196 last_timestep = timestep;
198 /* Check that phis come before any other node */
200 if (non_phi_found != NULL) {
201 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
202 node, non_phi_found, block, get_irg_dump_name(env->irg));
203 env->problem_found = 1;
206 non_phi_found = node;
209 /* Check for control flow changing nodes */
210 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
211 /* check, that only one CF operation is scheduled */
212 if (cfchange_found == 1) {
213 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
214 node, block, get_irg_dump_name(env->irg));
215 env->problem_found = 1;
218 } else if (cfchange_found) {
219 /* proj and keepany aren't real instructions... */
220 if(!is_Proj(node) && !be_is_Keep(node)) {
221 /* check for delay branches */
222 if (delay_branches == 0) {
223 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
224 node, block, get_irg_dump_name(env->irg));
225 env->problem_found = 1;
232 /* Check that all uses come before their definitions */
234 int nodetime = sched_get_time_step(node);
235 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
236 ir_node *arg = get_irn_n(node, i);
237 if(get_nodes_block(arg) != block
238 || !sched_is_scheduled(arg))
241 if(sched_get_time_step(arg) >= nodetime) {
242 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
243 arg, node, block, get_irg_dump_name(env->irg));
244 env->problem_found = 1;
249 /* Check that no dead nodes are scheduled */
250 if(get_irn_n_edges(node) == 0) {
251 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
252 node, block, get_irg_dump_name(env->irg));
253 env->problem_found = 1;
256 if(be_is_Keep(node)) {
257 /* at least 1 of the keep arguments has to be it schedule
259 int arity = get_irn_arity(node);
261 ir_node *prev = sched_prev(node);
262 while(be_is_Keep(prev))
263 prev = sched_prev(prev);
265 for(i = 0; i < arity; ++i) {
266 ir_node *in = get_irn_n(node, i);
272 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
273 node, block, get_irg_dump_name(env->irg));
274 env->problem_found = 1;
279 /* check that all delay branches are filled (at least with NOPs) */
280 if (cfchange_found && delay_branches != 0) {
281 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
282 block, get_irg_dump_name(env->irg));
283 env->problem_found = 1;
287 static int should_be_scheduled(ir_node *node)
295 if(get_irn_mode(node) == mode_M) {
296 if(is_Phi(node) || is_Sync(node) || is_Pin(node))
299 if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
302 switch(get_irn_opcode(node)) {
312 if (arch_irn_get_flags(node) & arch_irn_flags_ignore)
318 static void check_schedule(ir_node *node, void *data) {
319 be_verify_schedule_env_t *env = data;
323 should_be = should_be_scheduled(node);
327 scheduled = bitset_is_set(env->scheduled, get_irn_idx(node)) ? 1 : 0;
328 should_be = should_be ? 1 : 0;
329 if(should_be != scheduled) {
330 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
331 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
332 env->problem_found = 1;
337 * Start a walk over the irg and check schedule.
339 int be_verify_schedule(const be_irg_t *birg)
341 be_verify_schedule_env_t env;
343 env.problem_found = 0;
344 env.irg = be_get_birg_irg(birg);
345 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
347 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
348 /* check if all nodes are scheduled */
349 irg_walk_graph(env.irg, check_schedule, NULL, &env);
351 return ! env.problem_found;
356 /*--------------------------------------------------------------------------- */
360 typedef struct _spill_t {
366 const arch_env_t *arch_env;
371 } be_verify_spillslots_env_t;
373 static int cmp_spill(const void* d1, const void* d2, size_t size) {
374 const spill_t* s1 = d1;
375 const spill_t* s2 = d2;
378 return s1->spill != s2->spill;
381 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
385 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
388 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
390 int hash = HASH_PTR(node);
393 res = set_find(env->spills, &spill, sizeof(spill), hash);
397 res = set_insert(env->spills, &spill, sizeof(spill), hash);
403 static ir_node *get_memory_edge(const ir_node *node) {
405 ir_node *result = NULL;
407 arity = get_irn_arity(node);
408 for(i = arity - 1; i >= 0; --i) {
409 ir_node *arg = get_irn_n(node, i);
410 if(get_irn_mode(arg) == mode_M) {
411 assert(result == NULL);
420 void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
423 void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
425 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
426 node, get_nodes_block(node), get_irg_dump_name(env->irg));
431 void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
432 ir_entity *spillent = arch_get_frame_entity(node);
433 be_check_entity(env, node, spillent);
434 get_spill(env, node, ent);
436 if(spillent != ent) {
437 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
438 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
439 env->problem_found = 1;
443 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
446 int hash = HASH_PTR(node);
451 assert(is_Proj(node));
453 memperm = get_Proj_pred(node);
454 out = get_Proj_proj(node);
456 spillent = be_get_MemPerm_out_entity(memperm, out);
457 be_check_entity(env, memperm, spillent);
458 if(spillent != ent) {
459 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
460 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
461 env->problem_found = 1;
465 res = set_find(env->spills, &spill, sizeof(spill), hash);
470 spill.ent = spillent;
471 res = set_insert(env->spills, &spill, sizeof(spill), hash);
473 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
474 ir_node* arg = get_irn_n(memperm, i + 1);
475 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
477 collect(env, arg, memperm, argent);
481 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
484 int hash = HASH_PTR(node);
486 assert(is_Phi(node));
489 res = set_find(env->spills, &spill, sizeof(spill), hash);
495 res = set_insert(env->spills, &spill, sizeof(spill), hash);
497 /* is 1 of the arguments a spill? */
498 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
499 ir_node* arg = get_irn_n(node, i);
500 collect(env, arg, reload, ent);
504 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
505 if(be_is_Spill(node)) {
506 collect_spill(env, node, reload, ent);
507 } else if(is_Proj(node)) {
508 collect_memperm(env, node, reload, ent);
509 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
510 collect_memphi(env, node, reload, ent);
512 /* Disabled for now, spills might get transformed by the backend */
514 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
515 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
516 env->problem_found = 1;
522 * This walker function searches for reloads and collects all the spills
523 * and memphis attached to them.
525 static void collect_spills_walker(ir_node *node, void *data) {
526 be_verify_spillslots_env_t *env = data;
528 /* @@@ ia32_classify returns classification of Proj_pred :-/ */
532 if (arch_irn_class_is(node, reload)) {
533 ir_node *spill = get_memory_edge(node);
537 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
538 node, get_nodes_block(node), get_irg_dump_name(env->irg));
539 env->problem_found = 1;
542 ent = arch_get_frame_entity(node);
543 be_check_entity(env, node, ent);
545 collect(env, spill, node, ent);
546 ARR_APP1(ir_node*, env->reloads, node);
550 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
551 int spillcount = set_count(env->spills);
552 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
556 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
560 for(i = 0; i < spillcount; ++i) {
561 spill_t *sp1 = spills[i];
564 for(i2 = i+1; i2 < spillcount; ++i2) {
565 spill_t *sp2 = spills[i2];
567 if(sp1->ent != sp2->ent)
570 if(my_values_interfere(sp1->spill, sp2->spill)) {
571 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
572 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
573 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
574 env->problem_found = 1;
575 my_values_interfere(sp1->spill, sp2->spill);
581 static void check_lonely_spills(ir_node *node, void *data) {
582 be_verify_spillslots_env_t *env = data;
584 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
585 spill_t *spill = find_spill(env, node);
586 if(be_is_Spill(node)) {
587 ir_entity *ent = arch_get_frame_entity(node);
588 be_check_entity(env, node, ent);
592 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
593 node, get_nodes_block(node), get_irg_dump_name(env->irg));
598 int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg)
600 be_verify_spillslots_env_t env;
602 env.arch_env = arch_env;
604 env.spills = new_set(cmp_spill, 10);
605 env.reloads = NEW_ARR_F(ir_node*, 0);
606 env.problem_found = 0;
608 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
609 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
611 check_spillslot_interference(&env);
613 DEL_ARR_F(env.reloads);
616 return ! env.problem_found;
621 /*--------------------------------------------------------------------------- */
626 * Check, if two values interfere.
627 * @param a The first value.
628 * @param b The second value.
629 * @return 1, if a and b interfere, 0 if not.
631 static int my_values_interfere(const ir_node *a, const ir_node *b) {
632 const ir_edge_t *edge;
634 int a2b = value_dominates(a, b);
635 int b2a = value_dominates(b, a);
637 /* If there is no dominance relation, they do not interfere. */
642 * Adjust a and b so, that a dominates b if
643 * a dominates b or vice versa.
646 const ir_node *t = a;
651 bb = get_nodes_block(b);
654 * Look at all usages of a.
655 * If there's one usage of a in the block of b, then
656 * we check, if this use is dominated by b, if that's true
657 * a and b interfere. Note that b must strictly dominate the user,
658 * since if b is the last user of in the block, b and a do not
660 * Uses of a not in b's block can be disobeyed, because the
661 * check for a being live at the end of b's block is already
664 foreach_out_edge(a, edge) {
665 const ir_node *user = get_edge_src_irn(edge);
669 if(get_irn_opcode(user) == iro_End)
672 /* in case of phi arguments we compare with the block the value comes from */
674 ir_node *phiblock = get_nodes_block(user);
677 user = get_irn_n(phiblock, get_edge_src_pos(edge));
680 if(value_dominates(b, user))
689 /*--------------------------------------------------------------------------- */
691 static const arch_env_t *arch_env;
692 static ir_graph *irg;
694 static int problem_found;
695 static const arch_register_class_t *regclass;
696 static ir_node **registers;
698 static void check_register_constraints(ir_node *node)
700 const arch_register_t *reg;
703 /* verify output register */
704 if (arch_get_irn_reg_class(node, -1) != NULL) {
705 reg = arch_get_irn_register(node);
707 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
708 node, get_nodes_block(node), get_irg_dump_name(irg));
710 } else if (!arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(node, -1, reg)) {
711 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
712 reg->name, node, get_nodes_block(node), get_irg_dump_name(irg));
717 /* verify input register */
718 arity = get_irn_arity(node);
719 for (i = 0; i < arity; ++i) {
720 ir_node *pred = get_irn_n(node, i);
722 if (is_Unknown(pred))
726 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
727 node, get_nodes_block(node), get_irg_dump_name(irg), i);
732 if (arch_get_irn_reg_class(node, i) == NULL)
735 reg = arch_get_irn_register(pred);
737 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
738 pred, get_nodes_block(pred), get_irg_dump_name(irg), node);
741 } else if (!arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(node, i, reg)) {
742 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
743 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(irg));
748 /* phis should be NOPs at this point, which means all input regs
749 * must be the same as the output reg */
753 reg = arch_get_irn_register(node);
755 arity = get_irn_arity(node);
756 for (i = 0; i < arity; ++i) {
757 ir_node *pred = get_Phi_pred(node, i);
758 const arch_register_t *pred_reg = arch_get_irn_register(pred);
760 if (reg != pred_reg && !arch_register_type_is(pred_reg, joker)) {
761 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
762 i, node, get_nodes_block(node), get_irg_dump_name(irg), pred_reg->name, reg->name);
769 static void value_used(ir_node *node) {
770 const arch_register_t *reg;
773 if (arch_get_irn_reg_class(node, -1) != regclass)
776 reg = arch_get_irn_register(node);
777 if (reg->type & arch_register_type_virtual)
780 reg_node = registers[reg->index];
781 if (reg_node != NULL && reg_node != node) {
782 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
783 reg->name, get_nodes_block(node), get_irg_dump_name(irg),
788 registers[reg->index] = node;
791 static void value_def(ir_node *node)
793 const arch_register_t *reg;
796 if (arch_get_irn_reg_class(node, -1) != regclass)
799 reg = arch_get_irn_register(node);
800 if (reg->type & arch_register_type_virtual)
803 reg_node = registers[reg->index];
805 if (reg_node != node) {
806 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
807 node, reg->name, reg_node, get_nodes_block(node), get_irg_dump_name(irg));
810 registers[reg->index] = NULL;
813 static void verify_block_register_allocation(ir_node *block, void *data) {
817 nregclasses = arch_env_get_n_reg_class(arch_env);
818 for (i = 0; i < nregclasses; ++i) {
822 regclass = arch_env_get_reg_class(arch_env, i);
824 assert(lv->nodes && "live sets must be computed");
826 n_regs = arch_register_class_n_regs(regclass);
827 registers = alloca(n_regs * sizeof(registers[0]));
828 memset(registers, 0, n_regs * sizeof(registers[0]));
830 be_lv_foreach(lv, block, be_lv_state_end, idx) {
831 ir_node *node = be_lv_get_irn(lv, block, idx);
835 sched_foreach_reverse(block, node) {
838 if (get_irn_mode(node) == mode_T) {
839 const ir_edge_t *edge;
840 foreach_out_edge(node, edge) {
841 ir_node *def = get_edge_src_irn(edge);
848 check_register_constraints(node);
852 arity = get_irn_arity(node);
853 for (i2 = 0; i2 < arity; ++i2) {
854 ir_node *use = get_irn_n(node, i2);
859 be_lv_foreach(lv, block, be_lv_state_in, idx) {
860 ir_node *node = be_lv_get_irn(lv, block, idx);
864 /* set must be empty now */
865 for (i2 = 0; i2 < n_regs; ++i2) {
866 if (registers[i2] == NULL)
869 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
870 registers[i2], block, get_irg_dump_name(irg));
876 int be_verify_register_allocation(const be_irg_t *birg) {
877 arch_env = be_get_birg_arch_env(birg);
878 irg = be_get_birg_irg(birg);
879 lv = be_liveness(birg);
882 be_liveness_assure_sets(lv);
883 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
885 be_liveness_free(lv);
887 return !problem_found;
892 /*--------------------------------------------------------------------------- */
896 typedef struct _verify_out_dead_nodes_env {
900 } verify_out_dead_nodes_env;
902 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
903 ir_graph *irg = env->irg;
904 const ir_edge_t* edge;
906 if (irn_visited_else_mark(node))
909 /* we find too many (uncritical) dead nodes in block out edges */
913 foreach_out_edge(node, edge) {
914 ir_node* src = get_edge_src_irn(edge);
916 if(!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(src)) {
917 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
918 src, get_nodes_block(src), get_irg_dump_name(irg), node);
919 env->problem_found = 1;
923 check_out_edges(src, env);
927 static void set_reachable(ir_node *node, void* data)
929 bitset_t* reachable = data;
930 bitset_set(reachable, get_irn_idx(node));
933 int be_verify_out_edges(ir_graph *irg) {
934 verify_out_dead_nodes_env env;
937 env.reachable = bitset_alloca(get_irg_last_idx(irg));
938 env.problem_found = edges_verify(irg);
940 irg_walk_in_or_dep_graph(irg, set_reachable, NULL, env.reachable);
941 irg_walk_anchors(irg, set_reachable, NULL, env.reachable);
942 inc_irg_visited(irg);
943 check_out_edges(get_irg_start(irg), &env);
945 return ! env.problem_found;