2 * Copyright (C) 1995-2010 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"
48 #include "belistsched.h"
50 static int my_values_interfere(const ir_node *a, const ir_node *b);
52 typedef struct be_verify_register_pressure_env_t_ {
53 ir_graph *irg; /**< the irg to verify */
54 be_lv_t *lv; /**< Liveness information. */
55 const arch_register_class_t *cls; /**< the register class to check for */
56 int registers_available; /**< number of available registers */
57 int problem_found; /**< flag indicating if a problem was found */
58 } be_verify_register_pressure_env_t;
61 * Print all nodes of a pset into a file.
63 static void print_living_values(FILE *F, const ir_nodeset_t *live_nodes)
65 ir_nodeset_iterator_t iter;
69 foreach_ir_nodeset(live_nodes, node, iter) {
70 ir_fprintf(F, "%+F ", node);
75 static const char *get_irg_name(ir_graph *irg)
77 ir_entity *entity = get_irg_entity(irg);
78 return get_entity_ld_name(entity);
82 * Check if number of live nodes never exceeds the number of available registers.
84 static void verify_liveness_walker(ir_node *block, void *data)
86 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
87 ir_nodeset_t live_nodes;
90 /* collect register pressure info, start with end of a block */
91 // ir_fprintf(stderr, "liveness check %+F\n", block);
92 ir_nodeset_init(&live_nodes);
93 be_liveness_end_of_block(env->lv, env->cls, block,
96 // print_living_values(stderr, &live_nodes);
97 pressure = ir_nodeset_size(&live_nodes);
98 if (pressure > env->registers_available) {
99 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
100 block, get_irg_name(env->irg), pressure, env->registers_available);
101 print_living_values(stderr, &live_nodes);
102 env->problem_found = 1;
105 sched_foreach_reverse(block, irn) {
109 // print_living_values(stderr, &live_nodes);
110 be_liveness_transfer(env->cls, irn, &live_nodes);
112 pressure = ir_nodeset_size(&live_nodes);
114 if (pressure > env->registers_available) {
115 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
116 irn, block, get_irg_name(env->irg), pressure, env->registers_available);
117 print_living_values(stderr, &live_nodes);
118 env->problem_found = 1;
122 ir_nodeset_destroy(&live_nodes);
126 * Start a walk over the irg and check the register pressure.
128 int be_verify_register_pressure(ir_graph *irg, const arch_register_class_t *cls)
130 be_verify_register_pressure_env_t env;
132 env.lv = be_liveness_new(irg);
135 env.registers_available = be_get_n_allocatable_regs(irg, cls);
136 env.problem_found = 0;
138 be_liveness_compute_sets(env.lv);
139 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
140 be_liveness_free(env.lv);
142 return ! env.problem_found;
145 /*--------------------------------------------------------------------------- */
147 typedef struct be_verify_schedule_env_t_ {
148 int problem_found; /**< flags indicating a problem */
149 bitset_t *scheduled; /**< bitset of scheduled nodes */
150 ir_graph *irg; /**< the irg to check */
151 } be_verify_schedule_env_t;
154 * Simple schedule checker.
156 static void verify_schedule_walker(ir_node *block, void *data)
158 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
159 ir_node *non_phi_found = NULL;
160 ir_node *cfchange_found = NULL;
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
167 * 2. No value is defined after it has been used
168 * 3. mode_T nodes have all projs scheduled behind them followed by Keeps
169 * (except mode_X projs)
171 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_name(env->irg));
201 env->problem_found = 1;
204 non_phi_found = node;
207 /* Check for control flow changing nodes */
209 /* check, that only one CF operation is scheduled */
210 if (cfchange_found != NULL) {
211 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
212 node, block, cfchange_found, get_irg_name(env->irg));
213 env->problem_found = 1;
215 cfchange_found = node;
217 } else if (cfchange_found != NULL) {
218 /* proj and keepany aren't real instructions... */
219 if (!is_Proj(node) && !be_is_Keep(node)) {
220 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
221 node, block, get_irg_name(env->irg));
222 env->problem_found = 1;
226 /* Check that all uses come before their definitions */
230 sched_timestep_t nodetime = sched_get_time_step(node);
231 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
232 ir_node *arg = get_irn_n(node, i);
233 if (get_nodes_block(arg) != block
234 || !sched_is_scheduled(arg))
237 if (sched_get_time_step(arg) >= nodetime) {
238 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
239 arg, node, block, get_irg_name(env->irg));
240 env->problem_found = 1;
245 /* Check that no dead nodes are scheduled */
246 if (get_irn_n_edges(node) == 0) {
247 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
248 node, block, get_irg_name(env->irg));
249 env->problem_found = 1;
252 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
253 /* at least 1 of the keep arguments has to be its schedule
255 int arity = get_irn_arity(node);
257 ir_node *prev = sched_prev(node);
258 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
259 prev = sched_prev(prev);
263 for (i = 0; i < arity; ++i) {
264 ir_node *in = get_irn_n(node, i);
271 prev = sched_prev(prev);
276 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
277 node, block, get_irg_name(env->irg));
278 env->problem_found = 1;
284 static void check_schedule(ir_node *node, void *data)
286 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
287 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
288 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
290 if (should_be != scheduled) {
291 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
292 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
293 env->problem_found = 1;
298 * Start a walk over the irg and check schedule.
300 int be_verify_schedule(ir_graph *irg)
302 be_verify_schedule_env_t env;
304 env.problem_found = 0;
306 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
308 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
309 /* check if all nodes are scheduled */
310 irg_walk_graph(irg, check_schedule, NULL, &env);
312 return ! env.problem_found;
317 /*--------------------------------------------------------------------------- */
321 typedef struct spill_t {
331 } be_verify_spillslots_env_t;
333 static int cmp_spill(const void* d1, const void* d2, size_t size)
335 const spill_t* s1 = (const spill_t*)d1;
336 const spill_t* s2 = (const spill_t*)d2;
339 return s1->spill != s2->spill;
342 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
347 return set_find(spill_t, env->spills, &spill, sizeof(spill), hash_ptr(node));
350 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
353 int hash = hash_ptr(node);
356 res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
360 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
366 static ir_node *get_memory_edge(const ir_node *node)
369 ir_node *result = NULL;
371 arity = get_irn_arity(node);
372 for (i = arity - 1; i >= 0; --i) {
373 ir_node *arg = get_irn_n(node, i);
374 if (get_irn_mode(arg) == mode_M) {
375 assert(result == NULL);
383 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
385 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
388 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
389 node, get_nodes_block(node), get_irg_name(env->irg));
393 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
395 ir_entity *spillent = arch_get_frame_entity(node);
396 be_check_entity(env, node, spillent);
397 get_spill(env, node, ent);
399 if (spillent != ent) {
400 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
401 node, reload, get_nodes_block(node), get_irg_name(env->irg));
402 env->problem_found = 1;
406 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
410 int hash = hash_ptr(node);
415 assert(is_Proj(node));
417 memperm = get_Proj_pred(node);
418 out = get_Proj_proj(node);
420 spillent = be_get_MemPerm_out_entity(memperm, out);
421 be_check_entity(env, memperm, spillent);
422 if (spillent != ent) {
423 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
424 node, reload, get_nodes_block(node), get_irg_name(env->irg));
425 env->problem_found = 1;
429 res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
434 spill.ent = spillent;
435 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
437 for (i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
438 ir_node* arg = get_irn_n(memperm, i + 1);
439 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
441 collect(env, arg, memperm, argent);
445 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
449 int hash = hash_ptr(node);
451 assert(is_Phi(node));
454 res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
460 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
462 /* is 1 of the arguments a spill? */
463 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
464 ir_node* arg = get_irn_n(node, i);
465 collect(env, arg, reload, ent);
469 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
471 if (be_is_Spill(node)) {
472 collect_spill(env, node, reload, ent);
473 } else if (is_Proj(node)) {
474 collect_memperm(env, node, reload, ent);
475 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
476 collect_memphi(env, node, reload, ent);
478 /* Disabled for now, spills might get transformed by the backend */
480 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
481 node, reload, get_nodes_block(node), get_irg_name(env->irg));
482 env->problem_found = 1;
488 * This walker function searches for reloads and collects all the spills
489 * and memphis attached to them.
491 static void collect_spills_walker(ir_node *node, void *data)
493 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
495 if (be_is_Reload(node)) {
496 ir_node *spill = get_memory_edge(node);
500 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
501 node, get_nodes_block(node), get_irg_name(env->irg));
502 env->problem_found = 1;
505 ent = arch_get_frame_entity(node);
506 be_check_entity(env, node, ent);
508 collect(env, spill, node, ent);
509 ARR_APP1(ir_node*, env->reloads, node);
513 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
515 int spillcount = set_count(env->spills);
516 spill_t **spills = ALLOCAN(spill_t*, spillcount);
520 foreach_set(env->spills, spill_t, spill) {
524 for (i = 0; i < spillcount; ++i) {
525 spill_t *sp1 = spills[i];
528 for (i2 = i+1; i2 < spillcount; ++i2) {
529 spill_t *sp2 = spills[i2];
531 if (sp1->ent != sp2->ent)
534 if (my_values_interfere(sp1->spill, sp2->spill)) {
535 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
536 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
537 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
538 env->problem_found = 1;
539 my_values_interfere(sp1->spill, sp2->spill);
545 static void check_lonely_spills(ir_node *node, void *data)
547 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
549 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
550 spill_t *spill = find_spill(env, node);
551 if (be_is_Spill(node)) {
552 ir_entity *ent = arch_get_frame_entity(node);
553 be_check_entity(env, node, ent);
557 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
558 node, get_nodes_block(node), get_irg_name(env->irg));
563 int be_verify_spillslots(ir_graph *irg)
565 be_verify_spillslots_env_t env;
568 env.spills = new_set(cmp_spill, 10);
569 env.reloads = NEW_ARR_F(ir_node*, 0);
570 env.problem_found = 0;
572 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
573 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
575 check_spillslot_interference(&env);
577 DEL_ARR_F(env.reloads);
580 return ! env.problem_found;
585 /*--------------------------------------------------------------------------- */
590 * Check, if two values interfere.
591 * @param a The first value.
592 * @param b The second value.
593 * @return 1, if a and b interfere, 0 if not.
595 static int my_values_interfere(const ir_node *a, const ir_node *b)
598 int a2b = value_dominates(a, b);
599 int b2a = value_dominates(b, a);
601 /* If there is no dominance relation, they do not interfere. */
606 * Adjust a and b so, that a dominates b if
607 * a dominates b or vice versa.
610 const ir_node *t = a;
615 bb = get_nodes_block(b);
618 * Look at all usages of a.
619 * If there's one usage of a in the block of b, then
620 * we check, if this use is dominated by b, if that's true
621 * a and b interfere. Note that b must strictly dominate the user,
622 * since if b is the last user of in the block, b and a do not
624 * Uses of a not in b's block can be disobeyed, because the
625 * check for a being live at the end of b's block is already
628 foreach_out_edge(a, edge) {
629 const ir_node *user = get_edge_src_irn(edge);
633 if (get_irn_opcode(user) == iro_End)
636 /* in case of phi arguments we compare with the block the value comes from */
638 ir_node *phiblock = get_nodes_block(user);
641 user = get_irn_n(phiblock, get_edge_src_pos(edge));
644 if (value_dominates(b, user))
653 /*--------------------------------------------------------------------------- */
655 static const arch_env_t *arch_env;
656 static ir_graph *irg;
658 static bool problem_found;
659 static const ir_node **registers;
661 static void check_output_constraints(const ir_node *node)
663 if (arch_get_irn_reg_class(node) == NULL)
666 /* verify output register */
667 const arch_register_req_t *req = arch_get_irn_register_req(node);
668 const arch_register_t *reg = arch_get_irn_register(node);
670 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
671 node, get_nodes_block(node), get_irg_name(irg));
672 problem_found = true;
673 } else if (!arch_reg_is_allocatable(req, reg)) {
674 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
675 reg->name, node, get_nodes_block(node), get_irg_name(irg));
676 problem_found = true;
680 static void check_input_constraints(ir_node *node)
682 const arch_register_t *reg;
685 /* verify input register */
686 arity = get_irn_arity(node);
687 for (i = 0; i < arity; ++i) {
688 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
689 ir_node *pred = get_irn_n(node, i);
690 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
693 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
694 node, get_nodes_block(node), get_irg_name(irg), i);
698 if (req->cls == NULL)
701 if (req->width > pred_req->width) {
702 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
703 node, get_nodes_block(node), get_irg_name(irg), i);
707 reg = arch_get_irn_register(pred);
708 if (req->type & arch_register_req_type_aligned) {
709 if (reg->index % req->width != 0) {
710 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register allignment not fulfilled\n",
711 node, get_nodes_block(node), get_irg_name(irg), i);
717 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
718 pred, get_nodes_block(pred), get_irg_name(irg), node);
721 } else if (!arch_reg_is_allocatable(req, reg)) {
722 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
723 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
728 /* phis should be NOPs at this point, which means all input regs
729 * must be the same as the output reg */
731 reg = arch_get_irn_register(node);
733 arity = get_irn_arity(node);
734 for (i = 0; i < arity; ++i) {
735 ir_node *pred = get_Phi_pred(node, i);
736 const arch_register_t *pred_reg = arch_get_irn_register(pred);
738 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
739 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
740 const char *reg_name = reg != NULL ? reg->name : "(null)";
741 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
742 i, node, get_nodes_block(node),
743 get_irg_name(irg), pred_name, reg_name);
750 static void value_used(const ir_node *block, const ir_node *node)
752 const arch_register_t *reg = arch_get_irn_register(node);
753 const arch_register_req_t *req;
757 if (reg == NULL || reg->type & arch_register_type_virtual)
760 req = arch_get_irn_register_req(node);
761 assert(req->width > 0);
762 idx = reg->global_index;
763 for (i = 0; i < req->width; ++i) {
764 const ir_node *reg_node = registers[idx+i];
765 if (reg_node != NULL && reg_node != node) {
766 const arch_register_t *realreg = &arch_env->registers[idx+i];
767 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
768 realreg->name, block, get_irg_name(irg),
770 problem_found = true;
772 registers[idx+i] = node;
776 static void value_def(const ir_node *node)
778 const arch_register_t *reg = arch_get_irn_register(node);
779 const arch_register_req_t *req;
783 if (reg == NULL || reg->type & arch_register_type_virtual)
786 req = arch_get_irn_register_req(node);
787 assert(req->width > 0);
788 idx = reg->global_index;
789 for (i = 0; i < req->width; ++i) {
790 const ir_node *reg_node = registers[idx+i];
792 /* a little cheat, since its so hard to remove all outedges to dead code
793 * in the backend. This particular case should never be a problem. */
794 if (reg_node == NULL && get_irn_n_edges(node) == 0)
797 if (reg_node != node) {
798 const arch_register_t *realreg = &arch_env->registers[idx+i];
799 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
800 node, realreg->name, reg_node, get_nodes_block(node),
802 problem_found = true;
804 registers[idx+i] = NULL;
808 static void verify_block_register_allocation(ir_node *block, void *data)
816 assert(lv->sets_valid && "live sets must be computed");
818 n_regs = arch_env->n_registers;
819 registers = ALLOCANZ(const ir_node*, n_regs);
821 be_lv_foreach(lv, block, be_lv_state_end, idx) {
822 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
823 value_used(block, lv_node);
826 sched_foreach_reverse(block, node) {
829 if (get_irn_mode(node) == mode_T) {
830 foreach_out_edge(node, edge) {
831 ir_node *def = get_edge_src_irn(edge);
833 check_output_constraints(def);
837 check_output_constraints(node);
840 check_input_constraints(node);
842 /* process uses. (Phi inputs are no real uses) */
845 arity = get_irn_arity(node);
846 for (in = 0; in < arity; ++in) {
847 ir_node *use = get_irn_n(node, in);
848 value_used(block, use);
853 be_lv_foreach(lv, block, be_lv_state_in, idx) {
854 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
858 /* set must be empty now */
859 for (i = 0; i < n_regs; ++i) {
860 if (registers[i] == NULL)
863 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
864 registers[i], block, get_irg_name(irg));
865 problem_found = true;
869 bool be_verify_register_allocation(ir_graph *new_irg)
872 arch_env = be_get_irg_arch_env(irg);
873 lv = be_liveness_new(irg);
874 problem_found = false;
876 be_liveness_compute_sets(lv);
877 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
878 be_liveness_free(lv);
880 return !problem_found;
883 /*--------------------------------------------------------------------------- */
886 * Walker: checks that every predecessors of a node dominates the node.
888 static void dom_check(ir_node *irn, void *data)
890 bool *problem_found = (bool*)data;
892 if (!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
894 ir_node *bl = get_nodes_block(irn);
896 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
897 ir_node *op = get_irn_n(irn, i);
898 ir_node *def_bl = get_nodes_block(op);
899 ir_node *use_bl = bl;
902 use_bl = get_Block_cfgpred_block(bl, i);
904 if (get_irn_opcode(use_bl) != iro_Bad
905 && get_irn_opcode(def_bl) != iro_Bad
906 && !block_dominates(def_bl, use_bl)) {
907 ir_fprintf(stderr, "Verify warning: %+F in %+F must dominate %+F for user %+F (%s)\n", op, def_bl, use_bl, irn, get_irg_name(get_irn_irg(op)));
908 *problem_found = true;
914 /* Check, if the SSA dominance property is fulfilled. */
915 bool be_check_dominance(ir_graph *irg)
917 bool problem_found = false;
920 irg_walk_graph(irg, dom_check, NULL, &problem_found);
922 return !problem_found;
925 /*--------------------------------------------------------------------------- */
927 typedef struct lv_walker_t {
932 static const char *lv_flags_to_str(unsigned flags)
934 static const char *states[] = {
945 return states[flags & 7];
948 static void lv_check_walker(ir_node *bl, void *data)
950 lv_walker_t *w = (lv_walker_t*)data;
952 be_lv_t *fresh = (be_lv_t*)w->data;
954 be_lv_info_t *curr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
955 be_lv_info_t *fr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
957 if (!fr && curr && curr[0].head.n_members > 0) {
960 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
961 for (i = 0; i < curr[0].head.n_members; ++i) {
962 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].node.idx));
967 unsigned n_curr = curr[0].head.n_members;
968 unsigned n_fresh = fr[0].head.n_members;
972 if (n_curr != n_fresh) {
973 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
975 ir_fprintf(stderr, "current:\n");
976 for (i = 0; i < n_curr; ++i) {
977 be_lv_info_node_t *n = &curr[1 + i].node;
978 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
981 ir_fprintf(stderr, "correct:\n");
982 for (i = 0; i < n_fresh; ++i) {
983 be_lv_info_node_t *n = &fr[1 + i].node;
984 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
990 void be_liveness_check(be_lv_t *lv)
993 be_lv_t *fresh = be_liveness_new(lv->irg);
997 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
998 be_liveness_free(fresh);