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)
64 ir_nodeset_iterator_t iter;
68 foreach_ir_nodeset(live_nodes, node, iter) {
69 ir_fprintf(F, "%+F ", node);
75 * Check if number of live nodes never exceeds the number of available registers.
77 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, ir_graph *irg)
125 be_verify_register_pressure_env_t env;
127 env.lv = be_liveness(irg);
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)
157 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
159 ir_node *non_phi_found = NULL;
160 int cfchange_found = 0;
161 /* TODO ask arch about delay branches */
162 int delay_branches = 0;
163 int last_timestep = INT_MIN;
166 * Tests for the following things:
167 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
168 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
169 * 3. No value is defined after it has been used
170 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
171 * (except mode_X projs)
173 sched_foreach(block, node) {
177 /* this node is scheduled */
178 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
179 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
180 env->problem_found = 1;
182 bitset_set(env->scheduled, get_irn_idx(node));
184 /* Check that scheduled nodes are in the correct block */
185 if (get_nodes_block(node) != block) {
186 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
187 env->problem_found = 1;
190 /* Check that timesteps are increasing */
191 timestep = sched_get_time_step(node);
192 if (timestep <= last_timestep) {
193 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
195 env->problem_found = 1;
197 last_timestep = timestep;
199 /* Check that phis come before any other node */
201 if (non_phi_found != NULL) {
202 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
203 node, non_phi_found, block, get_irg_dump_name(env->irg));
204 env->problem_found = 1;
207 non_phi_found = node;
210 /* Check for control flow changing nodes */
211 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
212 /* check, that only one CF operation is scheduled */
213 if (cfchange_found == 1) {
214 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
215 node, block, get_irg_dump_name(env->irg));
216 env->problem_found = 1;
219 } else if (cfchange_found) {
220 /* proj and keepany aren't real instructions... */
221 if (!is_Proj(node) && !be_is_Keep(node)) {
222 /* check for delay branches */
223 if (delay_branches == 0) {
224 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
225 node, block, get_irg_dump_name(env->irg));
226 env->problem_found = 1;
233 /* Check that all uses come before their definitions */
235 int nodetime = sched_get_time_step(node);
236 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
237 ir_node *arg = get_irn_n(node, i);
238 if (get_nodes_block(arg) != block
239 || !sched_is_scheduled(arg))
242 if (sched_get_time_step(arg) >= nodetime) {
243 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
244 arg, node, block, get_irg_dump_name(env->irg));
245 env->problem_found = 1;
250 /* Check that no dead nodes are scheduled */
251 if (get_irn_n_edges(node) == 0) {
252 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
253 node, block, get_irg_dump_name(env->irg));
254 env->problem_found = 1;
257 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
258 /* at least 1 of the keep arguments has to be it schedule
260 int arity = get_irn_arity(node);
262 ir_node *prev = sched_prev(node);
263 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
264 prev = sched_prev(prev);
266 for (i = 0; i < arity; ++i) {
267 ir_node *in = get_irn_n(node, i);
273 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
274 node, block, get_irg_dump_name(env->irg));
275 env->problem_found = 1;
280 /* check that all delay branches are filled (at least with NOPs) */
281 if (cfchange_found && delay_branches != 0) {
282 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
283 block, get_irg_dump_name(env->irg));
284 env->problem_found = 1;
288 static int should_be_scheduled(ir_node *node)
290 switch (get_irn_opcode(node)) {
301 if (get_irn_mode(node) == mode_M)
312 if (get_irn_mode(node) != mode_T) {
313 if (arch_irn_is_ignore(node))
320 static void check_schedule(ir_node *node, void *data)
322 be_verify_schedule_env_t *env = data;
326 should_be = should_be_scheduled(node);
330 scheduled = bitset_is_set(env->scheduled, get_irn_idx(node)) ? 1 : 0;
331 should_be = should_be ? 1 : 0;
332 if (should_be != scheduled) {
333 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
334 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
335 env->problem_found = 1;
340 * Start a walk over the irg and check schedule.
342 int be_verify_schedule(const be_irg_t *birg)
344 be_verify_schedule_env_t env;
346 env.problem_found = 0;
347 env.irg = be_get_birg_irg(birg);
348 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
350 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
351 /* check if all nodes are scheduled */
352 irg_walk_graph(env.irg, check_schedule, NULL, &env);
354 return ! env.problem_found;
359 /*--------------------------------------------------------------------------- */
363 typedef struct _spill_t {
373 } be_verify_spillslots_env_t;
375 static int cmp_spill(const void* d1, const void* d2, size_t size)
377 const spill_t* s1 = d1;
378 const spill_t* s2 = d2;
381 return s1->spill != s2->spill;
384 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
389 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
392 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
395 int hash = HASH_PTR(node);
398 res = set_find(env->spills, &spill, sizeof(spill), hash);
402 res = set_insert(env->spills, &spill, sizeof(spill), hash);
408 static ir_node *get_memory_edge(const ir_node *node)
411 ir_node *result = NULL;
413 arity = get_irn_arity(node);
414 for (i = arity - 1; i >= 0; --i) {
415 ir_node *arg = get_irn_n(node, i);
416 if (get_irn_mode(arg) == mode_M) {
417 assert(result == NULL);
425 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
427 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
430 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
431 node, get_nodes_block(node), get_irg_dump_name(env->irg));
435 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
437 ir_entity *spillent = arch_get_frame_entity(node);
438 be_check_entity(env, node, spillent);
439 get_spill(env, node, ent);
441 if (spillent != ent) {
442 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
443 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
444 env->problem_found = 1;
448 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
452 int hash = HASH_PTR(node);
457 assert(is_Proj(node));
459 memperm = get_Proj_pred(node);
460 out = get_Proj_proj(node);
462 spillent = be_get_MemPerm_out_entity(memperm, out);
463 be_check_entity(env, memperm, spillent);
464 if (spillent != ent) {
465 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
466 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
467 env->problem_found = 1;
471 res = set_find(env->spills, &spill, sizeof(spill), hash);
476 spill.ent = spillent;
477 res = set_insert(env->spills, &spill, sizeof(spill), hash);
479 for (i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
480 ir_node* arg = get_irn_n(memperm, i + 1);
481 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
483 collect(env, arg, memperm, argent);
487 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
491 int hash = HASH_PTR(node);
493 assert(is_Phi(node));
496 res = set_find(env->spills, &spill, sizeof(spill), hash);
502 res = set_insert(env->spills, &spill, sizeof(spill), hash);
504 /* is 1 of the arguments a spill? */
505 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
506 ir_node* arg = get_irn_n(node, i);
507 collect(env, arg, reload, ent);
511 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
513 if (be_is_Spill(node)) {
514 collect_spill(env, node, reload, ent);
515 } else if (is_Proj(node)) {
516 collect_memperm(env, node, reload, ent);
517 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
518 collect_memphi(env, node, reload, ent);
520 /* Disabled for now, spills might get transformed by the backend */
522 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
523 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
524 env->problem_found = 1;
530 * This walker function searches for reloads and collects all the spills
531 * and memphis attached to them.
533 static void collect_spills_walker(ir_node *node, void *data)
535 be_verify_spillslots_env_t *env = data;
537 /* @@@ ia32_classify returns classification of Proj_pred :-/ */
541 if (arch_irn_class_is(node, reload)) {
542 ir_node *spill = get_memory_edge(node);
546 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
547 node, get_nodes_block(node), get_irg_dump_name(env->irg));
548 env->problem_found = 1;
551 ent = arch_get_frame_entity(node);
552 be_check_entity(env, node, ent);
554 collect(env, spill, node, ent);
555 ARR_APP1(ir_node*, env->reloads, node);
559 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
561 int spillcount = set_count(env->spills);
562 spill_t **spills = ALLOCAN(spill_t*, spillcount);
566 for (spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
570 for (i = 0; i < spillcount; ++i) {
571 spill_t *sp1 = spills[i];
574 for (i2 = i+1; i2 < spillcount; ++i2) {
575 spill_t *sp2 = spills[i2];
577 if (sp1->ent != sp2->ent)
580 if (my_values_interfere(sp1->spill, sp2->spill)) {
581 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
582 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
583 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
584 env->problem_found = 1;
585 my_values_interfere(sp1->spill, sp2->spill);
591 static void check_lonely_spills(ir_node *node, void *data)
593 be_verify_spillslots_env_t *env = data;
595 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
596 spill_t *spill = find_spill(env, node);
597 if (be_is_Spill(node)) {
598 ir_entity *ent = arch_get_frame_entity(node);
599 be_check_entity(env, node, ent);
603 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
604 node, get_nodes_block(node), get_irg_dump_name(env->irg));
609 int be_verify_spillslots(ir_graph *irg)
611 be_verify_spillslots_env_t env;
614 env.spills = new_set(cmp_spill, 10);
615 env.reloads = NEW_ARR_F(ir_node*, 0);
616 env.problem_found = 0;
618 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
619 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
621 check_spillslot_interference(&env);
623 DEL_ARR_F(env.reloads);
626 return ! env.problem_found;
631 /*--------------------------------------------------------------------------- */
636 * Check, if two values interfere.
637 * @param a The first value.
638 * @param b The second value.
639 * @return 1, if a and b interfere, 0 if not.
641 static int my_values_interfere(const ir_node *a, const ir_node *b)
643 const ir_edge_t *edge;
645 int a2b = value_dominates(a, b);
646 int b2a = value_dominates(b, a);
648 /* If there is no dominance relation, they do not interfere. */
653 * Adjust a and b so, that a dominates b if
654 * a dominates b or vice versa.
657 const ir_node *t = a;
662 bb = get_nodes_block(b);
665 * Look at all usages of a.
666 * If there's one usage of a in the block of b, then
667 * we check, if this use is dominated by b, if that's true
668 * a and b interfere. Note that b must strictly dominate the user,
669 * since if b is the last user of in the block, b and a do not
671 * Uses of a not in b's block can be disobeyed, because the
672 * check for a being live at the end of b's block is already
675 foreach_out_edge(a, edge) {
676 const ir_node *user = get_edge_src_irn(edge);
680 if (get_irn_opcode(user) == iro_End)
683 /* in case of phi arguments we compare with the block the value comes from */
685 ir_node *phiblock = get_nodes_block(user);
688 user = get_irn_n(phiblock, get_edge_src_pos(edge));
691 if (value_dominates(b, user))
700 /*--------------------------------------------------------------------------- */
702 static const arch_env_t *arch_env;
703 static ir_graph *irg;
705 static int problem_found;
706 static const arch_register_class_t *regclass;
707 static ir_node **registers;
709 static void check_output_constraints(ir_node *node)
711 /* verify output register */
712 if (arch_get_irn_reg_class_out(node) == regclass) {
713 const arch_register_t *reg = arch_get_irn_register(node);
715 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
716 node, get_nodes_block(node), get_irg_dump_name(irg));
718 } else if (!arch_register_type_is(reg, joker) && !arch_reg_out_is_allocatable(node, reg)) {
719 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
720 reg->name, node, get_nodes_block(node), get_irg_dump_name(irg));
726 static void check_input_constraints(ir_node *node)
728 const arch_register_t *reg;
731 /* verify input register */
732 arity = get_irn_arity(node);
733 for (i = 0; i < arity; ++i) {
734 ir_node *pred = get_irn_n(node, i);
736 if (is_Unknown(pred))
740 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
741 node, get_nodes_block(node), get_irg_dump_name(irg), i);
746 if (arch_get_irn_reg_class(node, i) == NULL)
749 reg = arch_get_irn_register(pred);
751 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
752 pred, get_nodes_block(pred), get_irg_dump_name(irg), node);
755 } else if (!arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(node, i, reg)) {
756 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
757 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(irg));
762 /* phis should be NOPs at this point, which means all input regs
763 * must be the same as the output reg */
767 reg = arch_get_irn_register(node);
769 arity = get_irn_arity(node);
770 for (i = 0; i < arity; ++i) {
771 ir_node *pred = get_Phi_pred(node, i);
772 const arch_register_t *pred_reg = arch_get_irn_register(pred);
774 if (reg != pred_reg && !arch_register_type_is(pred_reg, joker)) {
775 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
776 const char *reg_name = reg != NULL ? reg->name : "(null)";
777 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
778 i, node, get_nodes_block(node),
779 get_irg_dump_name(irg), pred_name, reg_name);
786 static void value_used(ir_node *block, ir_node *node)
788 const arch_register_t *reg;
791 if (arch_get_irn_reg_class_out(node) != regclass)
794 reg = arch_get_irn_register(node);
795 if (reg == NULL || reg->type & arch_register_type_virtual)
798 reg_node = registers[reg->index];
799 if (reg_node != NULL && reg_node != node) {
800 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
801 reg->name, block, get_irg_dump_name(irg),
806 registers[reg->index] = node;
809 static void value_def(ir_node *node)
811 const arch_register_t *reg;
814 if (arch_get_irn_reg_class_out(node) != regclass)
817 reg = arch_get_irn_register(node);
818 if (reg == NULL || reg->type & arch_register_type_virtual)
821 reg_node = registers[reg->index];
823 if (reg_node != node) {
824 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
825 node, reg->name, reg_node, get_nodes_block(node), get_irg_dump_name(irg));
828 registers[reg->index] = NULL;
831 static void verify_block_register_allocation(ir_node *block, void *data)
836 nregclasses = arch_env_get_n_reg_class(arch_env);
837 for (i = 0; i < nregclasses; ++i) {
841 regclass = arch_env_get_reg_class(arch_env, i);
843 assert(lv->nodes && "live sets must be computed");
845 n_regs = arch_register_class_n_regs(regclass);
846 registers = ALLOCANZ(ir_node*, n_regs);
848 be_lv_foreach(lv, block, be_lv_state_end, idx) {
849 ir_node *node = be_lv_get_irn(lv, block, idx);
850 value_used(block, node);
853 sched_foreach_reverse(block, node) {
856 if (get_irn_mode(node) == mode_T) {
857 const ir_edge_t *edge;
858 foreach_out_edge(node, edge) {
859 ir_node *def = get_edge_src_irn(edge);
861 check_output_constraints(def);
865 check_output_constraints(node);
868 check_input_constraints(node);
870 /* process uses. (Phi inputs are no real uses) */
872 arity = get_irn_arity(node);
873 for (i2 = 0; i2 < arity; ++i2) {
874 ir_node *use = get_irn_n(node, i2);
875 value_used(block, use);
880 be_lv_foreach(lv, block, be_lv_state_in, idx) {
881 ir_node *node = be_lv_get_irn(lv, block, idx);
885 /* set must be empty now */
886 for (i2 = 0; i2 < n_regs; ++i2) {
887 if (registers[i2] == NULL)
890 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
891 registers[i2], block, get_irg_dump_name(irg));
897 int be_verify_register_allocation(const be_irg_t *birg)
899 arch_env = be_get_birg_arch_env(birg);
900 irg = be_get_birg_irg(birg);
901 lv = be_liveness(irg);
904 be_liveness_assure_sets(lv);
905 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
907 be_liveness_free(lv);
909 return !problem_found;
914 /*--------------------------------------------------------------------------- */
918 typedef struct _verify_out_dead_nodes_env {
922 } verify_out_dead_nodes_env;
924 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env)
926 ir_graph *irg = env->irg;
927 const ir_edge_t* edge;
929 if (irn_visited_else_mark(node))
932 /* we find too many (uncritical) dead nodes in block out edges */
936 foreach_out_edge(node, edge) {
937 ir_node* src = get_edge_src_irn(edge);
939 if (!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(src)) {
940 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
941 src, get_nodes_block(src), get_irg_dump_name(irg), node);
942 env->problem_found = 1;
946 check_out_edges(src, env);
950 static void set_reachable(ir_node *node, void* data)
952 bitset_t* reachable = data;
953 bitset_set(reachable, get_irn_idx(node));
956 int be_verify_out_edges(ir_graph *irg)
958 verify_out_dead_nodes_env env;
962 env.reachable = bitset_alloca(get_irg_last_idx(irg));
963 env.problem_found = edges_verify(irg);
965 irg_walk_in_or_dep_graph(irg, set_reachable, NULL, env.reachable);
966 irg_walk_anchors(irg, set_reachable, NULL, env.reachable);
967 inc_irg_visited(irg);
968 check_out_edges(get_irg_start(irg), &env);
970 return ! env.problem_found;