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, const ir_nodeset_t *live_nodes) {
66 ir_nodeset_iterator_t iter;
70 foreach_ir_nodeset(live_nodes, node, iter) {
71 ir_fprintf(F, "%+F ", node);
77 * Check if number of live nodes never exceeds the number of available registers.
79 static void verify_liveness_walker(ir_node *block, void *data) {
80 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
81 ir_nodeset_t live_nodes;
85 /* collect register pressure info, start with end of a block */
86 ir_nodeset_init(&live_nodes);
87 be_liveness_end_of_block(env->lv, env->arch_env, env->cls, block,
90 pressure = ir_nodeset_size(&live_nodes);
91 if(pressure > env->registers_available) {
92 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
93 block, get_irg_dump_name(env->irg), pressure, env->registers_available);
94 print_living_values(stderr, &live_nodes);
95 env->problem_found = 1;
98 sched_foreach_reverse(block, irn) {
102 be_liveness_transfer(env->arch_env, 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;
113 ir_nodeset_destroy(&live_nodes);
117 * Start a walk over the irg and check the register pressure.
119 int be_verify_register_pressure(const be_irg_t *birg,
120 const arch_register_class_t *cls,
122 be_verify_register_pressure_env_t env;
124 env.lv = be_liveness(irg);
126 env.arch_env = birg->main_env->arch_env;
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 const arch_env_t *arch_env; /**< the arch_env */
149 } be_verify_schedule_env_t;
152 * Simple schedule checker.
154 static void verify_schedule_walker(ir_node *block, void *data) {
155 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
157 int non_phi_found = 0;
158 int cfchange_found = 0;
159 /* TODO ask arch about delay branches */
160 int delay_branches = 0;
161 int last_timestep = INT_MIN;
164 * Tests for the following things:
165 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
166 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
167 * 3. No value is defined after it has been used
168 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
169 * (except mode_X projs)
171 sched_foreach(block, node) {
175 /* this node is scheduled */
176 if(bitset_is_set(env->scheduled, get_irn_idx(node))) {
177 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
178 env->problem_found = 1;
180 bitset_set(env->scheduled, get_irn_idx(node));
182 /* Check that scheduled nodes are in the correct block */
183 if(get_nodes_block(node) != block) {
184 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
185 env->problem_found = 1;
188 /* Check that timesteps are increasing */
189 timestep = sched_get_time_step(node);
190 if(timestep <= last_timestep) {
191 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
193 env->problem_found = 1;
195 last_timestep = timestep;
197 /* Check that phis come before any other node */
200 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes in block %+F (%s)\n",
201 node, block, get_irg_dump_name(env->irg));
202 env->problem_found = 1;
208 /* Check for control flow changing nodes */
209 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
210 /* check, that only one CF operation is scheduled */
211 if (cfchange_found == 1) {
212 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
213 node, block, get_irg_dump_name(env->irg));
214 env->problem_found = 1;
217 } else if (cfchange_found) {
218 /* proj and keepany aren't real instructions... */
219 if(!is_Proj(node) && !be_is_Keep(node)) {
220 /* check for delay branches */
221 if (delay_branches == 0) {
222 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
223 node, block, get_irg_dump_name(env->irg));
224 env->problem_found = 1;
231 /* Check that all uses come before their definitions */
233 int nodetime = sched_get_time_step(node);
234 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
235 ir_node *arg = get_irn_n(node, i);
236 if(get_nodes_block(arg) != block
237 || !sched_is_scheduled(arg))
240 if(sched_get_time_step(arg) >= nodetime) {
241 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
242 arg, node, block, get_irg_dump_name(env->irg));
243 env->problem_found = 1;
248 /* Check that no dead nodes are scheduled */
249 if(get_irn_n_edges(node) == 0) {
250 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
251 node, block, get_irg_dump_name(env->irg));
252 env->problem_found = 1;
255 #ifdef SCHEDULE_PROJS
256 /* check that all projs/keeps are behind their nodes */
258 ir_node *prev = sched_prev(node);
260 prev = sched_prev(prev);
261 if(get_Proj_pred(node) != prev) {
262 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
263 node, block, get_irg_dump_name(env->irg));
264 env->problem_found = 1;
268 if(be_is_Keep(node)) {
269 int arity = get_irn_arity(node);
271 for(i = 0; i < arity; ++i) {
272 ir_node *in = get_irn_n(node, i);
273 ir_node *succ = sched_next(in);
274 while(succ != node && !sched_is_end(succ)) {
275 /* the node in between has to be another input of the
281 succ = sched_next(succ);
285 for(i2 = 0; i2 < arity; ++i2) {
286 ir_node *in2 = get_irn_n(node, i2);
295 succ = sched_next(succ);
299 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
300 node, block, get_irg_dump_name(env->irg));
301 env->problem_found = 1;
306 /* check that all delay branches are filled (at least with NOPs) */
307 if (cfchange_found && delay_branches != 0) {
308 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
309 block, get_irg_dump_name(env->irg));
310 env->problem_found = 1;
314 static int should_be_scheduled(be_verify_schedule_env_t *env, ir_node *node) {
318 if(get_irn_mode(node) == mode_M) {
321 if(is_Phi(node) || is_Sync(node) || is_Pin(node))
324 #ifdef SCHEDULE_PROJS
326 if(get_irn_mode(node) == mode_X)
328 return should_be_scheduled(env, get_Proj_pred(node));
334 if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
337 switch(get_irn_opcode(node)) {
347 if(arch_irn_get_flags(env->arch_env, node) & arch_irn_flags_ignore)
353 static void check_schedule(ir_node *node, void *data) {
354 be_verify_schedule_env_t *env = data;
358 should_be = should_be_scheduled(env, node);
362 scheduled = bitset_is_set(env->scheduled, get_irn_idx(node)) ? 1 : 0;
363 should_be = should_be ? 1 : 0;
364 if(should_be != scheduled) {
365 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
366 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
367 env->problem_found = 1;
372 * Start a walk over the irg and check schedule.
374 int be_verify_schedule(const be_irg_t *birg)
376 be_verify_schedule_env_t env;
378 env.problem_found = 0;
379 env.irg = be_get_birg_irg(birg);
380 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
381 env.arch_env = birg->main_env->arch_env;
383 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
384 /* check if all nodes are scheduled */
385 irg_walk_graph(env.irg, check_schedule, NULL, &env);
387 return ! env.problem_found;
392 /*--------------------------------------------------------------------------- */
396 typedef struct _spill_t {
402 const arch_env_t *arch_env;
407 } be_verify_spillslots_env_t;
409 static int cmp_spill(const void* d1, const void* d2, size_t size) {
410 const spill_t* s1 = d1;
411 const spill_t* s2 = d2;
414 return s1->spill != s2->spill;
417 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
421 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
424 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
426 int hash = HASH_PTR(node);
429 res = set_find(env->spills, &spill, sizeof(spill), hash);
433 res = set_insert(env->spills, &spill, sizeof(spill), hash);
439 static ir_node *get_memory_edge(const ir_node *node) {
441 ir_node *result = NULL;
443 arity = get_irn_arity(node);
444 for(i = arity - 1; i >= 0; --i) {
445 ir_node *arg = get_irn_n(node, i);
446 if(get_irn_mode(arg) == mode_M) {
447 assert(result == NULL);
456 void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
459 void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
461 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
462 node, get_nodes_block(node), get_irg_dump_name(env->irg));
467 void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
468 ir_entity *spillent = arch_get_frame_entity(env->arch_env, node);
469 be_check_entity(env, node, spillent);
470 get_spill(env, node, ent);
472 if(spillent != ent) {
473 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
474 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
475 env->problem_found = 1;
479 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
482 int hash = HASH_PTR(node);
487 assert(is_Proj(node));
489 memperm = get_Proj_pred(node);
490 out = get_Proj_proj(node);
492 spillent = be_get_MemPerm_out_entity(memperm, out);
493 be_check_entity(env, memperm, spillent);
494 if(spillent != ent) {
495 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
496 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
497 env->problem_found = 1;
501 res = set_find(env->spills, &spill, sizeof(spill), hash);
506 spill.ent = spillent;
507 res = set_insert(env->spills, &spill, sizeof(spill), hash);
509 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
510 ir_node* arg = get_irn_n(memperm, i + 1);
511 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
513 collect(env, arg, memperm, argent);
517 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
520 int hash = HASH_PTR(node);
522 assert(is_Phi(node));
525 res = set_find(env->spills, &spill, sizeof(spill), hash);
531 res = set_insert(env->spills, &spill, sizeof(spill), hash);
533 /* is 1 of the arguments a spill? */
534 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
535 ir_node* arg = get_irn_n(node, i);
536 collect(env, arg, reload, ent);
540 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
541 if(be_is_Spill(node)) {
542 collect_spill(env, node, reload, ent);
543 } else if(is_Proj(node)) {
544 collect_memperm(env, node, reload, ent);
545 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
546 collect_memphi(env, node, reload, ent);
548 /* Disabled for now, spills might get transformed by the backend */
550 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
551 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
552 env->problem_found = 1;
558 * This walker function searches for reloads and collects all the spills
559 * and memphis attached to them.
561 static void collect_spills_walker(ir_node *node, void *data) {
562 be_verify_spillslots_env_t *env = data;
563 const arch_env_t *arch_env = env->arch_env;
565 /* @@@ ia32_classify returns classification of Proj_pred :-/ */
569 if(arch_irn_class_is(arch_env, node, reload)) {
570 ir_node *spill = get_memory_edge(node);
574 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
575 node, get_nodes_block(node), get_irg_dump_name(env->irg));
576 env->problem_found = 1;
579 ent = arch_get_frame_entity(env->arch_env, node);
580 be_check_entity(env, node, ent);
582 collect(env, spill, node, ent);
583 ARR_APP1(ir_node*, env->reloads, node);
587 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
588 int spillcount = set_count(env->spills);
589 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
593 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
597 for(i = 0; i < spillcount; ++i) {
598 spill_t *sp1 = spills[i];
601 for(i2 = i+1; i2 < spillcount; ++i2) {
602 spill_t *sp2 = spills[i2];
604 if(sp1->ent != sp2->ent)
607 if(my_values_interfere(sp1->spill, sp2->spill)) {
608 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
609 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
610 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
611 env->problem_found = 1;
612 my_values_interfere(sp1->spill, sp2->spill);
618 static void check_lonely_spills(ir_node *node, void *data) {
619 be_verify_spillslots_env_t *env = data;
621 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
622 spill_t *spill = find_spill(env, node);
623 if(be_is_Spill(node)) {
624 ir_entity *ent = arch_get_frame_entity(env->arch_env, node);
625 be_check_entity(env, node, ent);
629 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
630 node, get_nodes_block(node), get_irg_dump_name(env->irg));
635 int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg)
637 be_verify_spillslots_env_t env;
639 env.arch_env = arch_env;
641 env.spills = new_set(cmp_spill, 10);
642 env.reloads = NEW_ARR_F(ir_node*, 0);
643 env.problem_found = 0;
645 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
646 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
648 check_spillslot_interference(&env);
650 DEL_ARR_F(env.reloads);
653 return ! env.problem_found;
658 /*--------------------------------------------------------------------------- */
663 * Check, if two values interfere.
664 * @param a The first value.
665 * @param b The second value.
666 * @return 1, if a and b interfere, 0 if not.
668 static int my_values_interfere(const ir_node *a, const ir_node *b) {
669 const ir_edge_t *edge;
671 int a2b = value_dominates(a, b);
672 int b2a = value_dominates(b, a);
674 /* If there is no dominance relation, they do not interfere. */
679 * Adjust a and b so, that a dominates b if
680 * a dominates b or vice versa.
683 const ir_node *t = a;
688 bb = get_nodes_block(b);
691 * Look at all usages of a.
692 * If there's one usage of a in the block of b, then
693 * we check, if this use is dominated by b, if that's true
694 * a and b interfere. Note that b must strictly dominate the user,
695 * since if b is the last user of in the block, b and a do not
697 * Uses of a not in b's block can be disobeyed, because the
698 * check for a being live at the end of b's block is already
701 foreach_out_edge(a, edge) {
702 const ir_node *user = get_edge_src_irn(edge);
706 if(get_irn_opcode(user) == iro_End)
709 /* in case of phi arguments we compare with the block the value comes from */
711 ir_node *phiblock = get_nodes_block(user);
714 user = get_irn_n(phiblock, get_edge_src_pos(edge));
717 if(value_dominates(b, user))
726 /*--------------------------------------------------------------------------- */
730 typedef struct _be_verify_register_allocation_env_t {
731 const arch_env_t *arch_env;
735 } be_verify_register_allocation_env_t;
737 static void check_register_constraints(ir_node *node,
738 be_verify_register_allocation_env_t *env)
740 const arch_env_t *arch_env = env->arch_env;
741 const arch_register_t *reg;
744 /* verify output register */
745 if (arch_get_irn_reg_class(arch_env, node, -1) != NULL) {
746 reg = arch_get_irn_register(arch_env, node);
748 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
749 node, get_nodes_block(node), get_irg_dump_name(env->irg));
750 env->problem_found = 1;
752 else if (! arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(arch_env, node, -1, reg)) {
753 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
754 reg->name, node, get_nodes_block(node), get_irg_dump_name(env->irg));
755 env->problem_found = 1;
759 /* verify input register */
760 arity = get_irn_arity(node);
761 for (i = 0; i < arity; ++i) {
762 ir_node *pred = get_irn_n(node, i);
764 if (is_Unknown(pred))
768 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
769 node, get_nodes_block(node), get_irg_dump_name(env->irg), i);
770 env->problem_found = 1;
774 if (arch_get_irn_reg_class(arch_env, node, i) == NULL)
777 reg = arch_get_irn_register(arch_env, pred);
779 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
780 pred, get_nodes_block(pred), get_irg_dump_name(env->irg));
781 env->problem_found = 1;
784 else if (! arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(arch_env, node, i, reg)) {
785 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
786 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(env->irg));
787 env->problem_found = 1;
792 static void check_register_allocation(be_verify_register_allocation_env_t *env,
793 const arch_register_class_t *regclass,
796 const arch_env_t *arch_env = env->arch_env;
797 const arch_register_t *reg = NULL;
799 bitset_t *registers = bitset_alloca(arch_register_class_n_regs(regclass));
801 ir_nodeset_iterator_t iter;
803 foreach_ir_nodeset(nodes, node, iter) {
804 if (arch_get_irn_reg_class(arch_env, node, -1) != regclass)
807 reg = arch_get_irn_register(arch_env, node);
809 /* this problem is already reported in 'check_register_constraints' */
813 if (bitset_is_set(registers, reg->index)) {
817 bitset_set(registers, reg->index);
821 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s)\n",
822 reg->name, get_nodes_block(node), get_irg_dump_name(env->irg));
823 env->problem_found = 1;
825 foreach_ir_nodeset(nodes, node, iter) {
826 if (arch_get_irn_register(arch_env, node) == reg) {
827 ir_fprintf(stderr, " at node %+F\n", node);
833 static void verify_block_register_allocation(ir_node *block, void *data) {
834 be_verify_register_allocation_env_t *env = data;
835 const arch_env_t *arch_env = env->arch_env;
836 const arch_isa_t *isa = arch_env->isa;
839 nregclasses = arch_isa_get_n_reg_class(isa);
840 for (i = 0; i < nregclasses; ++i) {
841 const arch_register_class_t *regclass = arch_isa_get_reg_class(isa, i);
843 ir_nodeset_t live_nodes;
845 ir_nodeset_init(&live_nodes);
847 be_liveness_end_of_block(env->lv, env->arch_env, regclass, block,
849 check_register_allocation(env, regclass, &live_nodes);
851 sched_foreach_reverse(block, node) {
855 be_liveness_transfer(env->arch_env, regclass, node, &live_nodes);
856 check_register_allocation(env, regclass, &live_nodes);
857 check_register_constraints(node, env);
860 ir_nodeset_destroy(&live_nodes);
864 int be_verify_register_allocation(const arch_env_t *arch_env, ir_graph *irg) {
865 be_verify_register_allocation_env_t env;
867 env.arch_env = arch_env;
869 env.lv = be_liveness(irg);
870 env.problem_found = 0;
872 be_liveness_assure_sets(env.lv);
873 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, &env);
875 be_liveness_free(env.lv);
877 return !env.problem_found;
882 /*--------------------------------------------------------------------------- */
886 typedef struct _verify_out_dead_nodes_env {
890 } verify_out_dead_nodes_env;
892 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
893 ir_graph *irg = env->irg;
894 const ir_edge_t* edge;
896 if(irn_visited(node))
898 mark_irn_visited(node);
900 foreach_out_edge(node, edge) {
901 ir_node* src = get_edge_src_irn(edge);
903 if(!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(node)) {
904 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
905 src, get_nodes_block(src), get_irg_dump_name(irg), node);
906 env->problem_found = 1;
910 check_out_edges(src, env);
914 static void set_reachable(ir_node *node, void* data)
916 bitset_t* reachable = data;
917 bitset_set(reachable, get_irn_idx(node));
920 int be_verify_out_edges(ir_graph *irg) {
921 verify_out_dead_nodes_env env;
924 env.reachable = bitset_alloca(get_irg_last_idx(irg));
925 env.problem_found = edges_verify(irg);
927 irg_walk_in_or_dep_graph(irg, set_reachable, NULL, env.reachable);
928 irg_walk_anchors(irg, set_reachable, NULL, env.reachable);
929 inc_irg_visited(irg);
930 check_out_edges(get_irg_start(irg), &env);
932 return ! env.problem_found;