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_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_fprintf(stderr, "liveness check %+F\n", block);
87 ir_nodeset_init(&live_nodes);
88 be_liveness_end_of_block(env->lv, env->arch_env, env->cls, block,
91 // print_living_values(stderr, &live_nodes);
92 pressure = ir_nodeset_size(&live_nodes);
93 if(pressure > env->registers_available) {
94 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
95 block, get_irg_dump_name(env->irg), pressure, env->registers_available);
96 print_living_values(stderr, &live_nodes);
97 env->problem_found = 1;
100 sched_foreach_reverse(block, irn) {
104 // print_living_values(stderr, &live_nodes);
105 be_liveness_transfer(env->arch_env, env->cls, irn, &live_nodes);
107 pressure = ir_nodeset_size(&live_nodes);
109 if(pressure > env->registers_available) {
110 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
111 irn, block, get_irg_dump_name(env->irg), pressure, env->registers_available);
112 print_living_values(stderr, &live_nodes);
113 env->problem_found = 1;
117 ir_nodeset_destroy(&live_nodes);
121 * Start a walk over the irg and check the register pressure.
123 int be_verify_register_pressure(const be_irg_t *birg,
124 const arch_register_class_t *cls,
126 be_verify_register_pressure_env_t env;
128 env.lv = be_liveness(birg);
130 env.arch_env = birg->main_env->arch_env;
132 env.registers_available = env.cls->n_regs - be_put_ignore_regs(birg, env.cls, NULL);
133 env.problem_found = 0;
135 be_liveness_assure_sets(env.lv);
136 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
137 be_liveness_free(env.lv);
139 return ! env.problem_found;
144 /*--------------------------------------------------------------------------- */
148 typedef struct be_verify_schedule_env_t_ {
149 int problem_found; /**< flags indicating if there was a problem */
150 bitset_t *scheduled; /**< bitset of scheduled nodes */
151 ir_graph *irg; /**< the irg to check */
152 const arch_env_t *arch_env; /**< the arch_env */
153 } be_verify_schedule_env_t;
156 * Simple schedule checker.
158 static void verify_schedule_walker(ir_node *block, void *data) {
159 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
161 ir_node *non_phi_found = NULL;
162 int cfchange_found = 0;
163 /* TODO ask arch about delay branches */
164 int delay_branches = 0;
165 int last_timestep = INT_MIN;
168 * Tests for the following things:
169 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
170 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
171 * 3. No value is defined after it has been used
172 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
173 * (except mode_X projs)
175 sched_foreach(block, node) {
179 /* this node is scheduled */
180 if(bitset_is_set(env->scheduled, get_irn_idx(node))) {
181 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
182 env->problem_found = 1;
184 bitset_set(env->scheduled, get_irn_idx(node));
186 /* Check that scheduled nodes are in the correct block */
187 if(get_nodes_block(node) != block) {
188 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
189 env->problem_found = 1;
192 /* Check that timesteps are increasing */
193 timestep = sched_get_time_step(node);
194 if(timestep <= last_timestep) {
195 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
197 env->problem_found = 1;
199 last_timestep = timestep;
201 /* Check that phis come before any other node */
203 if (non_phi_found != NULL) {
204 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
205 node, non_phi_found, block, get_irg_dump_name(env->irg));
206 env->problem_found = 1;
209 non_phi_found = node;
212 /* Check for control flow changing nodes */
213 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
214 /* check, that only one CF operation is scheduled */
215 if (cfchange_found == 1) {
216 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
217 node, block, get_irg_dump_name(env->irg));
218 env->problem_found = 1;
221 } else if (cfchange_found) {
222 /* proj and keepany aren't real instructions... */
223 if(!is_Proj(node) && !be_is_Keep(node)) {
224 /* check for delay branches */
225 if (delay_branches == 0) {
226 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
227 node, block, get_irg_dump_name(env->irg));
228 env->problem_found = 1;
235 /* Check that all uses come before their definitions */
237 int nodetime = sched_get_time_step(node);
238 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
239 ir_node *arg = get_irn_n(node, i);
240 if(get_nodes_block(arg) != block
241 || !sched_is_scheduled(arg))
244 if(sched_get_time_step(arg) >= nodetime) {
245 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
246 arg, node, block, get_irg_dump_name(env->irg));
247 env->problem_found = 1;
252 /* Check that no dead nodes are scheduled */
253 if(get_irn_n_edges(node) == 0) {
254 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
255 node, block, get_irg_dump_name(env->irg));
256 env->problem_found = 1;
259 if(be_is_Keep(node)) {
260 /* at least 1 of the keep arguments has to be it schedule
262 int arity = get_irn_arity(node);
264 ir_node *prev = sched_prev(node);
265 while(be_is_Keep(prev))
266 prev = sched_prev(prev);
268 for(i = 0; i < arity; ++i) {
269 ir_node *in = get_irn_n(node, i);
275 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
276 node, block, get_irg_dump_name(env->irg));
277 env->problem_found = 1;
282 /* check that all delay branches are filled (at least with NOPs) */
283 if (cfchange_found && delay_branches != 0) {
284 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
285 block, get_irg_dump_name(env->irg));
286 env->problem_found = 1;
290 static int should_be_scheduled(ir_node *node)
298 if(get_irn_mode(node) == mode_M) {
299 if(is_Phi(node) || is_Sync(node) || is_Pin(node))
302 if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
305 switch(get_irn_opcode(node)) {
315 if (arch_irn_get_flags(node) & arch_irn_flags_ignore)
321 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));
349 env.arch_env = birg->main_env->arch_env;
351 irg_block_walk_graph(env.irg, verify_schedule_walker, NULL, &env);
352 /* check if all nodes are scheduled */
353 irg_walk_graph(env.irg, check_schedule, NULL, &env);
355 return ! env.problem_found;
360 /*--------------------------------------------------------------------------- */
364 typedef struct _spill_t {
370 const arch_env_t *arch_env;
375 } be_verify_spillslots_env_t;
377 static int cmp_spill(const void* d1, const void* d2, size_t size) {
378 const spill_t* s1 = d1;
379 const spill_t* s2 = d2;
382 return s1->spill != s2->spill;
385 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) {
394 int hash = HASH_PTR(node);
397 res = set_find(env->spills, &spill, sizeof(spill), hash);
401 res = set_insert(env->spills, &spill, sizeof(spill), hash);
407 static ir_node *get_memory_edge(const ir_node *node) {
409 ir_node *result = NULL;
411 arity = get_irn_arity(node);
412 for(i = arity - 1; i >= 0; --i) {
413 ir_node *arg = get_irn_n(node, i);
414 if(get_irn_mode(arg) == mode_M) {
415 assert(result == NULL);
424 void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
427 void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
429 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
430 node, get_nodes_block(node), get_irg_dump_name(env->irg));
435 void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
436 ir_entity *spillent = arch_get_frame_entity(node);
437 be_check_entity(env, node, spillent);
438 get_spill(env, node, ent);
440 if(spillent != ent) {
441 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
442 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
443 env->problem_found = 1;
447 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
450 int hash = HASH_PTR(node);
455 assert(is_Proj(node));
457 memperm = get_Proj_pred(node);
458 out = get_Proj_proj(node);
460 spillent = be_get_MemPerm_out_entity(memperm, out);
461 be_check_entity(env, memperm, spillent);
462 if(spillent != ent) {
463 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
464 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
465 env->problem_found = 1;
469 res = set_find(env->spills, &spill, sizeof(spill), hash);
474 spill.ent = spillent;
475 res = set_insert(env->spills, &spill, sizeof(spill), hash);
477 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
478 ir_node* arg = get_irn_n(memperm, i + 1);
479 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
481 collect(env, arg, memperm, argent);
485 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
488 int hash = HASH_PTR(node);
490 assert(is_Phi(node));
493 res = set_find(env->spills, &spill, sizeof(spill), hash);
499 res = set_insert(env->spills, &spill, sizeof(spill), hash);
501 /* is 1 of the arguments a spill? */
502 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
503 ir_node* arg = get_irn_n(node, i);
504 collect(env, arg, reload, ent);
508 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
509 if(be_is_Spill(node)) {
510 collect_spill(env, node, reload, ent);
511 } else if(is_Proj(node)) {
512 collect_memperm(env, node, reload, ent);
513 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
514 collect_memphi(env, node, reload, ent);
516 /* Disabled for now, spills might get transformed by the backend */
518 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
519 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
520 env->problem_found = 1;
526 * This walker function searches for reloads and collects all the spills
527 * and memphis attached to them.
529 static void collect_spills_walker(ir_node *node, void *data) {
530 be_verify_spillslots_env_t *env = data;
532 /* @@@ ia32_classify returns classification of Proj_pred :-/ */
536 if (arch_irn_class_is(node, reload)) {
537 ir_node *spill = get_memory_edge(node);
541 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
542 node, get_nodes_block(node), get_irg_dump_name(env->irg));
543 env->problem_found = 1;
546 ent = arch_get_frame_entity(node);
547 be_check_entity(env, node, ent);
549 collect(env, spill, node, ent);
550 ARR_APP1(ir_node*, env->reloads, node);
554 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
555 int spillcount = set_count(env->spills);
556 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
560 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
564 for(i = 0; i < spillcount; ++i) {
565 spill_t *sp1 = spills[i];
568 for(i2 = i+1; i2 < spillcount; ++i2) {
569 spill_t *sp2 = spills[i2];
571 if(sp1->ent != sp2->ent)
574 if(my_values_interfere(sp1->spill, sp2->spill)) {
575 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
576 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
577 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
578 env->problem_found = 1;
579 my_values_interfere(sp1->spill, sp2->spill);
585 static void check_lonely_spills(ir_node *node, void *data) {
586 be_verify_spillslots_env_t *env = data;
588 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
589 spill_t *spill = find_spill(env, node);
590 if(be_is_Spill(node)) {
591 ir_entity *ent = arch_get_frame_entity(node);
592 be_check_entity(env, node, ent);
596 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
597 node, get_nodes_block(node), get_irg_dump_name(env->irg));
602 int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg)
604 be_verify_spillslots_env_t env;
606 env.arch_env = arch_env;
608 env.spills = new_set(cmp_spill, 10);
609 env.reloads = NEW_ARR_F(ir_node*, 0);
610 env.problem_found = 0;
612 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
613 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
615 check_spillslot_interference(&env);
617 DEL_ARR_F(env.reloads);
620 return ! env.problem_found;
625 /*--------------------------------------------------------------------------- */
630 * Check, if two values interfere.
631 * @param a The first value.
632 * @param b The second value.
633 * @return 1, if a and b interfere, 0 if not.
635 static int my_values_interfere(const ir_node *a, const ir_node *b) {
636 const ir_edge_t *edge;
638 int a2b = value_dominates(a, b);
639 int b2a = value_dominates(b, a);
641 /* If there is no dominance relation, they do not interfere. */
646 * Adjust a and b so, that a dominates b if
647 * a dominates b or vice versa.
650 const ir_node *t = a;
655 bb = get_nodes_block(b);
658 * Look at all usages of a.
659 * If there's one usage of a in the block of b, then
660 * we check, if this use is dominated by b, if that's true
661 * a and b interfere. Note that b must strictly dominate the user,
662 * since if b is the last user of in the block, b and a do not
664 * Uses of a not in b's block can be disobeyed, because the
665 * check for a being live at the end of b's block is already
668 foreach_out_edge(a, edge) {
669 const ir_node *user = get_edge_src_irn(edge);
673 if(get_irn_opcode(user) == iro_End)
676 /* in case of phi arguments we compare with the block the value comes from */
678 ir_node *phiblock = get_nodes_block(user);
681 user = get_irn_n(phiblock, get_edge_src_pos(edge));
684 if(value_dominates(b, user))
693 /*--------------------------------------------------------------------------- */
695 static const arch_env_t *arch_env;
696 static ir_graph *irg;
698 static int problem_found;
699 static const arch_register_class_t *regclass;
700 static ir_node **registers;
702 static void check_register_constraints(ir_node *node)
704 const arch_register_t *reg;
707 /* verify output register */
708 if (arch_get_irn_reg_class(node, -1) != NULL) {
709 reg = arch_get_irn_register(node);
711 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
712 node, get_nodes_block(node), get_irg_dump_name(irg));
714 } else if (!arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(node, -1, reg)) {
715 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
716 reg->name, node, get_nodes_block(node), get_irg_dump_name(irg));
721 /* verify input register */
722 arity = get_irn_arity(node);
723 for (i = 0; i < arity; ++i) {
724 ir_node *pred = get_irn_n(node, i);
726 if (is_Unknown(pred))
730 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
731 node, get_nodes_block(node), get_irg_dump_name(irg), i);
736 if (arch_get_irn_reg_class(node, i) == NULL)
739 reg = arch_get_irn_register(pred);
741 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
742 pred, get_nodes_block(pred), get_irg_dump_name(irg), node);
745 } else if (!arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(node, i, reg)) {
746 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
747 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(irg));
752 /* phis should be NOPs at this point, which means all input regs
753 * must be the same as the output reg */
757 reg = arch_get_irn_register(node);
759 arity = get_irn_arity(node);
760 for (i = 0; i < arity; ++i) {
761 ir_node *pred = get_Phi_pred(node, i);
762 const arch_register_t *pred_reg = arch_get_irn_register(pred);
764 if (reg != pred_reg && !arch_register_type_is(pred_reg, joker)) {
765 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
766 i, node, get_nodes_block(node), get_irg_dump_name(irg), pred_reg->name, reg->name);
773 static void value_used(ir_node *node) {
774 const arch_register_t *reg;
777 if (arch_get_irn_reg_class(node, -1) != regclass)
780 reg = arch_get_irn_register(node);
781 if (reg->type & arch_register_type_virtual)
784 reg_node = registers[reg->index];
785 if (reg_node != NULL && reg_node != node) {
786 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
787 reg->name, get_nodes_block(node), get_irg_dump_name(irg),
792 registers[reg->index] = node;
795 static void value_def(ir_node *node)
797 const arch_register_t *reg;
800 if (arch_get_irn_reg_class(node, -1) != regclass)
803 reg = arch_get_irn_register(node);
804 if (reg->type & arch_register_type_virtual)
807 reg_node = registers[reg->index];
809 if (reg_node != node) {
810 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
811 node, reg->name, reg_node, get_nodes_block(node), get_irg_dump_name(irg));
814 registers[reg->index] = NULL;
817 static void verify_block_register_allocation(ir_node *block, void *data) {
821 nregclasses = arch_env_get_n_reg_class(arch_env);
822 for (i = 0; i < nregclasses; ++i) {
826 regclass = arch_env_get_reg_class(arch_env, i);
828 assert(lv->nodes && "live sets must be computed");
830 n_regs = arch_register_class_n_regs(regclass);
831 registers = alloca(n_regs * sizeof(registers[0]));
832 memset(registers, 0, n_regs * sizeof(registers[0]));
834 be_lv_foreach(lv, block, be_lv_state_end, idx) {
835 ir_node *node = be_lv_get_irn(lv, block, idx);
839 sched_foreach_reverse(block, node) {
842 if (get_irn_mode(node) == mode_T) {
843 const ir_edge_t *edge;
844 foreach_out_edge(node, edge) {
845 ir_node *def = get_edge_src_irn(edge);
852 check_register_constraints(node);
856 arity = get_irn_arity(node);
857 for (i2 = 0; i2 < arity; ++i2) {
858 ir_node *use = get_irn_n(node, i2);
863 be_lv_foreach(lv, block, be_lv_state_in, idx) {
864 ir_node *node = be_lv_get_irn(lv, block, idx);
868 /* set must be empty now */
869 for (i2 = 0; i2 < n_regs; ++i2) {
870 if (registers[i2] == NULL)
873 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
874 registers[i2], block, get_irg_dump_name(irg));
880 int be_verify_register_allocation(const be_irg_t *birg) {
881 arch_env = be_get_birg_arch_env(birg);
882 irg = be_get_birg_irg(birg);
883 lv = be_liveness(birg);
886 be_liveness_assure_sets(lv);
887 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
889 be_liveness_free(lv);
891 return !problem_found;
896 /*--------------------------------------------------------------------------- */
900 typedef struct _verify_out_dead_nodes_env {
904 } verify_out_dead_nodes_env;
906 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
907 ir_graph *irg = env->irg;
908 const ir_edge_t* edge;
910 if (irn_visited_else_mark(node))
913 /* we find too many (uncritical) dead nodes in block out edges */
917 foreach_out_edge(node, edge) {
918 ir_node* src = get_edge_src_irn(edge);
920 if(!bitset_is_set(env->reachable, get_irn_idx(src)) && !is_Block(src)) {
921 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
922 src, get_nodes_block(src), get_irg_dump_name(irg), node);
923 env->problem_found = 1;
927 check_out_edges(src, env);
931 static void set_reachable(ir_node *node, void* data)
933 bitset_t* reachable = data;
934 bitset_set(reachable, get_irn_idx(node));
937 int be_verify_out_edges(ir_graph *irg) {
938 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;