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
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(irg);
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) || be_is_CopyKeep(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) || be_is_CopyKeep(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)
287 switch(get_irn_opcode(node)) {
298 if (get_irn_mode(node) == mode_M)
309 if (get_irn_mode(node) != mode_T) {
310 if (arch_irn_is_ignore(node))
317 static void check_schedule(ir_node *node, void *data) {
318 be_verify_schedule_env_t *env = data;
322 should_be = should_be_scheduled(node);
326 scheduled = bitset_is_set(env->scheduled, get_irn_idx(node)) ? 1 : 0;
327 should_be = should_be ? 1 : 0;
328 if(should_be != scheduled) {
329 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
330 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
331 env->problem_found = 1;
336 * Start a walk over the irg and check schedule.
338 int be_verify_schedule(const be_irg_t *birg)
340 be_verify_schedule_env_t env;
342 env.problem_found = 0;
343 env.irg = be_get_birg_irg(birg);
344 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
346 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
347 /* check if all nodes are scheduled */
348 irg_walk_graph(env.irg, check_schedule, NULL, &env);
350 return ! env.problem_found;
355 /*--------------------------------------------------------------------------- */
359 typedef struct _spill_t {
369 } be_verify_spillslots_env_t;
371 static int cmp_spill(const void* d1, const void* d2, size_t size) {
372 const spill_t* s1 = d1;
373 const spill_t* s2 = d2;
376 return s1->spill != s2->spill;
379 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
383 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
386 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
388 int hash = HASH_PTR(node);
391 res = set_find(env->spills, &spill, sizeof(spill), hash);
395 res = set_insert(env->spills, &spill, sizeof(spill), hash);
401 static ir_node *get_memory_edge(const ir_node *node) {
403 ir_node *result = NULL;
405 arity = get_irn_arity(node);
406 for(i = arity - 1; i >= 0; --i) {
407 ir_node *arg = get_irn_n(node, i);
408 if(get_irn_mode(arg) == mode_M) {
409 assert(result == NULL);
418 void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
421 void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
423 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
424 node, get_nodes_block(node), get_irg_dump_name(env->irg));
429 void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
430 ir_entity *spillent = arch_get_frame_entity(node);
431 be_check_entity(env, node, spillent);
432 get_spill(env, node, ent);
434 if(spillent != ent) {
435 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
436 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
437 env->problem_found = 1;
441 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
444 int hash = HASH_PTR(node);
449 assert(is_Proj(node));
451 memperm = get_Proj_pred(node);
452 out = get_Proj_proj(node);
454 spillent = be_get_MemPerm_out_entity(memperm, out);
455 be_check_entity(env, memperm, spillent);
456 if(spillent != ent) {
457 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
458 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
459 env->problem_found = 1;
463 res = set_find(env->spills, &spill, sizeof(spill), hash);
468 spill.ent = spillent;
469 res = set_insert(env->spills, &spill, sizeof(spill), hash);
471 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
472 ir_node* arg = get_irn_n(memperm, i + 1);
473 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
475 collect(env, arg, memperm, argent);
479 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
482 int hash = HASH_PTR(node);
484 assert(is_Phi(node));
487 res = set_find(env->spills, &spill, sizeof(spill), hash);
493 res = set_insert(env->spills, &spill, sizeof(spill), hash);
495 /* is 1 of the arguments a spill? */
496 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
497 ir_node* arg = get_irn_n(node, i);
498 collect(env, arg, reload, ent);
502 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
503 if(be_is_Spill(node)) {
504 collect_spill(env, node, reload, ent);
505 } else if(is_Proj(node)) {
506 collect_memperm(env, node, reload, ent);
507 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
508 collect_memphi(env, node, reload, ent);
510 /* Disabled for now, spills might get transformed by the backend */
512 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
513 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
514 env->problem_found = 1;
520 * This walker function searches for reloads and collects all the spills
521 * and memphis attached to them.
523 static void collect_spills_walker(ir_node *node, void *data) {
524 be_verify_spillslots_env_t *env = data;
526 /* @@@ ia32_classify returns classification of Proj_pred :-/ */
530 if (arch_irn_class_is(node, reload)) {
531 ir_node *spill = get_memory_edge(node);
535 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
536 node, get_nodes_block(node), get_irg_dump_name(env->irg));
537 env->problem_found = 1;
540 ent = arch_get_frame_entity(node);
541 be_check_entity(env, node, ent);
543 collect(env, spill, node, ent);
544 ARR_APP1(ir_node*, env->reloads, node);
548 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
550 int spillcount = set_count(env->spills);
551 spill_t **spills = ALLOCAN(spill_t*, spillcount);
555 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
559 for(i = 0; i < spillcount; ++i) {
560 spill_t *sp1 = spills[i];
563 for(i2 = i+1; i2 < spillcount; ++i2) {
564 spill_t *sp2 = spills[i2];
566 if(sp1->ent != sp2->ent)
569 if(my_values_interfere(sp1->spill, sp2->spill)) {
570 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
571 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
572 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
573 env->problem_found = 1;
574 my_values_interfere(sp1->spill, sp2->spill);
580 static void check_lonely_spills(ir_node *node, void *data) {
581 be_verify_spillslots_env_t *env = data;
583 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
584 spill_t *spill = find_spill(env, node);
585 if(be_is_Spill(node)) {
586 ir_entity *ent = arch_get_frame_entity(node);
587 be_check_entity(env, node, ent);
591 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
592 node, get_nodes_block(node), get_irg_dump_name(env->irg));
597 int be_verify_spillslots(ir_graph *irg)
599 be_verify_spillslots_env_t env;
602 env.spills = new_set(cmp_spill, 10);
603 env.reloads = NEW_ARR_F(ir_node*, 0);
604 env.problem_found = 0;
606 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
607 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
609 check_spillslot_interference(&env);
611 DEL_ARR_F(env.reloads);
614 return ! env.problem_found;
619 /*--------------------------------------------------------------------------- */
624 * Check, if two values interfere.
625 * @param a The first value.
626 * @param b The second value.
627 * @return 1, if a and b interfere, 0 if not.
629 static int my_values_interfere(const ir_node *a, const ir_node *b) {
630 const ir_edge_t *edge;
632 int a2b = value_dominates(a, b);
633 int b2a = value_dominates(b, a);
635 /* If there is no dominance relation, they do not interfere. */
640 * Adjust a and b so, that a dominates b if
641 * a dominates b or vice versa.
644 const ir_node *t = a;
649 bb = get_nodes_block(b);
652 * Look at all usages of a.
653 * If there's one usage of a in the block of b, then
654 * we check, if this use is dominated by b, if that's true
655 * a and b interfere. Note that b must strictly dominate the user,
656 * since if b is the last user of in the block, b and a do not
658 * Uses of a not in b's block can be disobeyed, because the
659 * check for a being live at the end of b's block is already
662 foreach_out_edge(a, edge) {
663 const ir_node *user = get_edge_src_irn(edge);
667 if(get_irn_opcode(user) == iro_End)
670 /* in case of phi arguments we compare with the block the value comes from */
672 ir_node *phiblock = get_nodes_block(user);
675 user = get_irn_n(phiblock, get_edge_src_pos(edge));
678 if(value_dominates(b, user))
687 /*--------------------------------------------------------------------------- */
689 static const arch_env_t *arch_env;
690 static ir_graph *irg;
692 static int problem_found;
693 static const arch_register_class_t *regclass;
694 static ir_node **registers;
696 static void check_output_constraints(ir_node *node)
698 /* verify output register */
699 if (arch_get_irn_reg_class_out(node) == regclass) {
700 const arch_register_t *reg = arch_get_irn_register(node);
702 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
703 node, get_nodes_block(node), get_irg_dump_name(irg));
705 } else if (!arch_register_type_is(reg, joker) && !arch_reg_out_is_allocatable(node, reg)) {
706 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
707 reg->name, node, get_nodes_block(node), get_irg_dump_name(irg));
713 static void check_input_constraints(ir_node *node)
715 const arch_register_t *reg;
718 /* verify input register */
719 arity = get_irn_arity(node);
720 for (i = 0; i < arity; ++i) {
721 ir_node *pred = get_irn_n(node, i);
723 if (is_Unknown(pred))
727 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
728 node, get_nodes_block(node), get_irg_dump_name(irg), i);
733 if (arch_get_irn_reg_class(node, i) == NULL)
736 reg = arch_get_irn_register(pred);
738 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
739 pred, get_nodes_block(pred), get_irg_dump_name(irg), node);
742 } else if (!arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(node, i, reg)) {
743 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
744 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(irg));
749 /* phis should be NOPs at this point, which means all input regs
750 * must be the same as the output reg */
754 reg = arch_get_irn_register(node);
756 arity = get_irn_arity(node);
757 for (i = 0; i < arity; ++i) {
758 ir_node *pred = get_Phi_pred(node, i);
759 const arch_register_t *pred_reg = arch_get_irn_register(pred);
761 if (reg != pred_reg && !arch_register_type_is(pred_reg, joker)) {
762 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
763 i, node, get_nodes_block(node), get_irg_dump_name(irg), pred_reg->name, reg->name);
770 static void value_used(ir_node *block, ir_node *node) {
771 const arch_register_t *reg;
774 if (arch_get_irn_reg_class_out(node) != regclass)
777 reg = arch_get_irn_register(node);
778 if (reg == NULL || reg->type & arch_register_type_virtual)
781 reg_node = registers[reg->index];
782 if (reg_node != NULL && reg_node != node) {
783 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
784 reg->name, block, get_irg_dump_name(irg),
789 registers[reg->index] = node;
792 static void value_def(ir_node *node)
794 const arch_register_t *reg;
797 if (arch_get_irn_reg_class_out(node) != regclass)
800 reg = arch_get_irn_register(node);
801 if (reg == NULL || reg->type & arch_register_type_virtual)
804 reg_node = registers[reg->index];
806 if (reg_node != node) {
807 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
808 node, reg->name, reg_node, get_nodes_block(node), get_irg_dump_name(irg));
811 registers[reg->index] = NULL;
814 static void verify_block_register_allocation(ir_node *block, void *data) {
818 nregclasses = arch_env_get_n_reg_class(arch_env);
819 for (i = 0; i < nregclasses; ++i) {
823 regclass = arch_env_get_reg_class(arch_env, i);
825 assert(lv->nodes && "live sets must be computed");
827 n_regs = arch_register_class_n_regs(regclass);
828 registers = ALLOCANZ(ir_node*, n_regs);
830 be_lv_foreach(lv, block, be_lv_state_end, idx) {
831 ir_node *node = be_lv_get_irn(lv, block, idx);
832 value_used(block, node);
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);
843 check_output_constraints(def);
847 check_output_constraints(node);
850 check_input_constraints(node);
852 /* process uses. (Phi inputs are no real uses) */
854 arity = get_irn_arity(node);
855 for (i2 = 0; i2 < arity; ++i2) {
856 ir_node *use = get_irn_n(node, i2);
857 value_used(block, use);
862 be_lv_foreach(lv, block, be_lv_state_in, idx) {
863 ir_node *node = be_lv_get_irn(lv, block, idx);
867 /* set must be empty now */
868 for (i2 = 0; i2 < n_regs; ++i2) {
869 if (registers[i2] == NULL)
872 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
873 registers[i2], block, get_irg_dump_name(irg));
879 int be_verify_register_allocation(const be_irg_t *birg) {
880 arch_env = be_get_birg_arch_env(birg);
881 irg = be_get_birg_irg(birg);
882 lv = be_liveness(irg);
885 be_liveness_assure_sets(lv);
886 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
888 be_liveness_free(lv);
890 return !problem_found;
895 /*--------------------------------------------------------------------------- */
899 typedef struct _verify_out_dead_nodes_env {
903 } verify_out_dead_nodes_env;
905 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
906 ir_graph *irg = env->irg;
907 const ir_edge_t* edge;
909 if (irn_visited_else_mark(node))
912 /* we find too many (uncritical) dead nodes in block out edges */
916 foreach_out_edge(node, edge) {
917 ir_node* src = get_edge_src_irn(edge);
919 if(!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(src)) {
920 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
921 src, get_nodes_block(src), get_irg_dump_name(irg), node);
922 env->problem_found = 1;
926 check_out_edges(src, env);
930 static void set_reachable(ir_node *node, void* data)
932 bitset_t* reachable = data;
933 bitset_set(reachable, get_irn_idx(node));
936 int be_verify_out_edges(ir_graph *irg) {
937 verify_out_dead_nodes_env env;
941 env.reachable = bitset_alloca(get_irg_last_idx(irg));
942 env.problem_found = edges_verify(irg);
944 irg_walk_in_or_dep_graph(irg, set_reachable, NULL, env.reachable);
945 irg_walk_anchors(irg, set_reachable, NULL, env.reachable);
946 inc_irg_visited(irg);
947 check_out_edges(get_irg_start(irg), &env);
949 return ! env.problem_found;