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;
91 /* collect register pressure info, start with end of a block */
92 // ir_fprintf(stderr, "liveness check %+F\n", block);
93 ir_nodeset_init(&live_nodes);
94 be_liveness_end_of_block(env->lv, env->cls, block,
97 // print_living_values(stderr, &live_nodes);
98 pressure = ir_nodeset_size(&live_nodes);
99 if (pressure > env->registers_available) {
100 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
101 block, get_irg_name(env->irg), pressure, env->registers_available);
102 print_living_values(stderr, &live_nodes);
103 env->problem_found = 1;
106 sched_foreach_reverse(block, irn) {
110 // print_living_values(stderr, &live_nodes);
111 be_liveness_transfer(env->cls, irn, &live_nodes);
113 pressure = ir_nodeset_size(&live_nodes);
115 if (pressure > env->registers_available) {
116 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
117 irn, block, get_irg_name(env->irg), pressure, env->registers_available);
118 print_living_values(stderr, &live_nodes);
119 env->problem_found = 1;
123 ir_nodeset_destroy(&live_nodes);
127 * Start a walk over the irg and check the register pressure.
129 int be_verify_register_pressure(ir_graph *irg, const arch_register_class_t *cls)
131 be_verify_register_pressure_env_t env;
133 env.lv = be_liveness_new(irg);
136 env.registers_available = be_get_n_allocatable_regs(irg, cls);
137 env.problem_found = 0;
139 be_liveness_compute_sets(env.lv);
140 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
141 be_liveness_free(env.lv);
143 return ! env.problem_found;
146 /*--------------------------------------------------------------------------- */
148 typedef struct be_verify_schedule_env_t_ {
149 int problem_found; /**< flags indicating a problem */
150 bitset_t *scheduled; /**< bitset of scheduled nodes */
151 ir_graph *irg; /**< the irg to check */
152 } be_verify_schedule_env_t;
155 * Simple schedule checker.
157 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 ir_node *cfchange_found = NULL;
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
169 * 2. No value is defined after it has been used
170 * 3. mode_T nodes have all projs scheduled behind them followed by Keeps
171 * (except mode_X projs)
173 sched_foreach(block, node) {
176 /* this node is scheduled */
177 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
178 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
179 env->problem_found = 1;
181 bitset_set(env->scheduled, get_irn_idx(node));
183 /* Check that scheduled nodes are in the correct block */
184 if (get_nodes_block(node) != block) {
185 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
186 env->problem_found = 1;
189 /* Check that timesteps are increasing */
190 timestep = sched_get_time_step(node);
191 if (timestep <= last_timestep) {
192 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
194 env->problem_found = 1;
196 last_timestep = timestep;
198 /* Check that phis come before any other node */
200 if (non_phi_found != NULL) {
201 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
202 node, non_phi_found, block, get_irg_name(env->irg));
203 env->problem_found = 1;
206 non_phi_found = node;
209 /* Check for control flow changing nodes */
211 /* check, that only one CF operation is scheduled */
212 if (cfchange_found != NULL) {
213 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
214 node, block, cfchange_found, get_irg_name(env->irg));
215 env->problem_found = 1;
217 cfchange_found = node;
219 } else if (cfchange_found != NULL) {
220 /* proj and keepany aren't real instructions... */
221 if (!is_Proj(node) && !be_is_Keep(node)) {
222 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
223 node, block, get_irg_name(env->irg));
224 env->problem_found = 1;
228 /* Check that all uses come before their definitions */
232 sched_timestep_t nodetime = sched_get_time_step(node);
233 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
234 ir_node *arg = get_irn_n(node, i);
235 if (get_nodes_block(arg) != block
236 || !sched_is_scheduled(arg))
239 if (sched_get_time_step(arg) >= nodetime) {
240 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
241 arg, node, block, get_irg_name(env->irg));
242 env->problem_found = 1;
247 /* Check that no dead nodes are scheduled */
248 if (get_irn_n_edges(node) == 0) {
249 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
250 node, block, get_irg_name(env->irg));
251 env->problem_found = 1;
254 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
255 /* at least 1 of the keep arguments has to be its schedule
257 int arity = get_irn_arity(node);
259 ir_node *prev = sched_prev(node);
260 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
261 prev = sched_prev(prev);
265 for (i = 0; i < arity; ++i) {
266 ir_node *in = get_irn_n(node, i);
273 prev = sched_prev(prev);
278 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
279 node, block, get_irg_name(env->irg));
280 env->problem_found = 1;
286 static void check_schedule(ir_node *node, void *data)
288 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
289 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
290 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
292 if (should_be != scheduled) {
293 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
294 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
295 env->problem_found = 1;
300 * Start a walk over the irg and check schedule.
302 int be_verify_schedule(ir_graph *irg)
304 be_verify_schedule_env_t env;
306 env.problem_found = 0;
308 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
310 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
311 /* check if all nodes are scheduled */
312 irg_walk_graph(irg, check_schedule, NULL, &env);
314 return ! env.problem_found;
319 /*--------------------------------------------------------------------------- */
323 typedef struct spill_t {
333 } be_verify_spillslots_env_t;
335 static int cmp_spill(const void* d1, const void* d2, size_t size)
337 const spill_t* s1 = (const spill_t*)d1;
338 const spill_t* s2 = (const spill_t*)d2;
341 return s1->spill != s2->spill;
344 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
349 return (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash_ptr(node));
352 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
355 int hash = hash_ptr(node);
358 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
362 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
368 static ir_node *get_memory_edge(const ir_node *node)
371 ir_node *result = NULL;
373 arity = get_irn_arity(node);
374 for (i = arity - 1; i >= 0; --i) {
375 ir_node *arg = get_irn_n(node, i);
376 if (get_irn_mode(arg) == mode_M) {
377 assert(result == NULL);
385 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
387 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
390 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
391 node, get_nodes_block(node), get_irg_name(env->irg));
395 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
397 ir_entity *spillent = arch_get_frame_entity(node);
398 be_check_entity(env, node, spillent);
399 get_spill(env, node, ent);
401 if (spillent != ent) {
402 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
403 node, reload, get_nodes_block(node), get_irg_name(env->irg));
404 env->problem_found = 1;
408 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
412 int hash = hash_ptr(node);
417 assert(is_Proj(node));
419 memperm = get_Proj_pred(node);
420 out = get_Proj_proj(node);
422 spillent = be_get_MemPerm_out_entity(memperm, out);
423 be_check_entity(env, memperm, spillent);
424 if (spillent != ent) {
425 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
426 node, reload, get_nodes_block(node), get_irg_name(env->irg));
427 env->problem_found = 1;
431 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
436 spill.ent = spillent;
437 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
439 for (i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
440 ir_node* arg = get_irn_n(memperm, i + 1);
441 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
443 collect(env, arg, memperm, argent);
447 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
451 int hash = hash_ptr(node);
453 assert(is_Phi(node));
456 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
462 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
464 /* is 1 of the arguments a spill? */
465 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
466 ir_node* arg = get_irn_n(node, i);
467 collect(env, arg, reload, ent);
471 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
473 if (be_is_Spill(node)) {
474 collect_spill(env, node, reload, ent);
475 } else if (is_Proj(node)) {
476 collect_memperm(env, node, reload, ent);
477 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
478 collect_memphi(env, node, reload, ent);
480 /* Disabled for now, spills might get transformed by the backend */
482 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
483 node, reload, get_nodes_block(node), get_irg_name(env->irg));
484 env->problem_found = 1;
490 * This walker function searches for reloads and collects all the spills
491 * and memphis attached to them.
493 static void collect_spills_walker(ir_node *node, void *data)
495 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
497 if (be_is_Reload(node)) {
498 ir_node *spill = get_memory_edge(node);
502 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
503 node, get_nodes_block(node), get_irg_name(env->irg));
504 env->problem_found = 1;
507 ent = arch_get_frame_entity(node);
508 be_check_entity(env, node, ent);
510 collect(env, spill, node, ent);
511 ARR_APP1(ir_node*, env->reloads, node);
515 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
517 int spillcount = set_count(env->spills);
518 spill_t **spills = ALLOCAN(spill_t*, spillcount);
523 foreach_set(env->spills, spill_t*, spill) {
527 for (i = 0; i < spillcount; ++i) {
528 spill_t *sp1 = spills[i];
531 for (i2 = i+1; i2 < spillcount; ++i2) {
532 spill_t *sp2 = spills[i2];
534 if (sp1->ent != sp2->ent)
537 if (my_values_interfere(sp1->spill, sp2->spill)) {
538 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
539 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
540 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
541 env->problem_found = 1;
542 my_values_interfere(sp1->spill, sp2->spill);
548 static void check_lonely_spills(ir_node *node, void *data)
550 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
552 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
553 spill_t *spill = find_spill(env, node);
554 if (be_is_Spill(node)) {
555 ir_entity *ent = arch_get_frame_entity(node);
556 be_check_entity(env, node, ent);
560 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
561 node, get_nodes_block(node), get_irg_name(env->irg));
566 int be_verify_spillslots(ir_graph *irg)
568 be_verify_spillslots_env_t env;
571 env.spills = new_set(cmp_spill, 10);
572 env.reloads = NEW_ARR_F(ir_node*, 0);
573 env.problem_found = 0;
575 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
576 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
578 check_spillslot_interference(&env);
580 DEL_ARR_F(env.reloads);
583 return ! env.problem_found;
588 /*--------------------------------------------------------------------------- */
593 * Check, if two values interfere.
594 * @param a The first value.
595 * @param b The second value.
596 * @return 1, if a and b interfere, 0 if not.
598 static int my_values_interfere(const ir_node *a, const ir_node *b)
600 const ir_edge_t *edge;
602 int a2b = value_dominates(a, b);
603 int b2a = value_dominates(b, a);
605 /* If there is no dominance relation, they do not interfere. */
610 * Adjust a and b so, that a dominates b if
611 * a dominates b or vice versa.
614 const ir_node *t = a;
619 bb = get_nodes_block(b);
622 * Look at all usages of a.
623 * If there's one usage of a in the block of b, then
624 * we check, if this use is dominated by b, if that's true
625 * a and b interfere. Note that b must strictly dominate the user,
626 * since if b is the last user of in the block, b and a do not
628 * Uses of a not in b's block can be disobeyed, because the
629 * check for a being live at the end of b's block is already
632 foreach_out_edge(a, edge) {
633 const ir_node *user = get_edge_src_irn(edge);
637 if (get_irn_opcode(user) == iro_End)
640 /* in case of phi arguments we compare with the block the value comes from */
642 ir_node *phiblock = get_nodes_block(user);
645 user = get_irn_n(phiblock, get_edge_src_pos(edge));
648 if (value_dominates(b, user))
657 /*--------------------------------------------------------------------------- */
659 static const arch_env_t *arch_env;
660 static ir_graph *irg;
662 static bool problem_found;
663 static const ir_node **registers;
665 static void check_output_constraints(const ir_node *node)
667 if (arch_get_irn_reg_class(node) == NULL)
670 /* verify output register */
671 const arch_register_req_t *req = arch_get_irn_register_req(node);
672 const arch_register_t *reg = arch_get_irn_register(node);
674 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
675 node, get_nodes_block(node), get_irg_name(irg));
676 problem_found = true;
677 } else if (!arch_reg_is_allocatable(req, reg)) {
678 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
679 reg->name, node, get_nodes_block(node), get_irg_name(irg));
680 problem_found = true;
684 static void check_input_constraints(ir_node *node)
686 const arch_register_t *reg;
689 /* verify input register */
690 arity = get_irn_arity(node);
691 for (i = 0; i < arity; ++i) {
692 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
693 ir_node *pred = get_irn_n(node, i);
694 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
697 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
698 node, get_nodes_block(node), get_irg_name(irg), i);
702 if (req->cls == NULL)
705 if (req->width > pred_req->width) {
706 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
707 node, get_nodes_block(node), get_irg_name(irg), i);
711 reg = arch_get_irn_register(pred);
712 if (req->type & arch_register_req_type_aligned) {
713 if (reg->index % req->width != 0) {
714 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register allignment not fulfilled\n",
715 node, get_nodes_block(node), get_irg_name(irg), i);
721 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
722 pred, get_nodes_block(pred), get_irg_name(irg), node);
725 } else if (!arch_reg_is_allocatable(req, reg)) {
726 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
727 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
732 /* phis should be NOPs at this point, which means all input regs
733 * must be the same as the output reg */
735 reg = arch_get_irn_register(node);
737 arity = get_irn_arity(node);
738 for (i = 0; i < arity; ++i) {
739 ir_node *pred = get_Phi_pred(node, i);
740 const arch_register_t *pred_reg = arch_get_irn_register(pred);
742 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
743 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
744 const char *reg_name = reg != NULL ? reg->name : "(null)";
745 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
746 i, node, get_nodes_block(node),
747 get_irg_name(irg), pred_name, reg_name);
754 static void value_used(const ir_node *block, const ir_node *node)
756 const arch_register_t *reg = arch_get_irn_register(node);
757 const arch_register_req_t *req;
761 if (reg == NULL || reg->type & arch_register_type_virtual)
764 req = arch_get_irn_register_req(node);
765 assert(req->width > 0);
766 idx = reg->global_index;
767 for (i = 0; i < req->width; ++i) {
768 const ir_node *reg_node = registers[idx+i];
769 if (reg_node != NULL && reg_node != node) {
770 const arch_register_t *realreg = &arch_env->registers[idx+i];
771 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
772 realreg->name, block, get_irg_name(irg),
774 problem_found = true;
776 registers[idx+i] = node;
780 static void value_def(const ir_node *node)
782 const arch_register_t *reg = arch_get_irn_register(node);
783 const arch_register_req_t *req;
787 if (reg == NULL || reg->type & arch_register_type_virtual)
790 req = arch_get_irn_register_req(node);
791 assert(req->width > 0);
792 idx = reg->global_index;
793 for (i = 0; i < req->width; ++i) {
794 const ir_node *reg_node = registers[idx+i];
796 /* a little cheat, since its so hard to remove all outedges to dead code
797 * in the backend. This particular case should never be a problem. */
798 if (reg_node == NULL && get_irn_n_edges(node) == 0)
801 if (reg_node != node) {
802 const arch_register_t *realreg = &arch_env->registers[idx+i];
803 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
804 node, realreg->name, reg_node, get_nodes_block(node),
806 problem_found = true;
808 registers[idx+i] = NULL;
812 static void verify_block_register_allocation(ir_node *block, void *data)
821 assert(lv->nodes && "live sets must be computed");
823 n_regs = arch_env->n_registers;
824 registers = ALLOCANZ(const ir_node*, n_regs);
826 be_lv_foreach(lv, block, be_lv_state_end, idx) {
827 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
828 value_used(block, lv_node);
831 sched_foreach_reverse(block, node) {
834 if (get_irn_mode(node) == mode_T) {
835 const ir_edge_t *edge;
836 foreach_out_edge(node, edge) {
837 ir_node *def = get_edge_src_irn(edge);
839 check_output_constraints(def);
843 check_output_constraints(node);
846 check_input_constraints(node);
848 /* process uses. (Phi inputs are no real uses) */
851 arity = get_irn_arity(node);
852 for (in = 0; in < arity; ++in) {
853 ir_node *use = get_irn_n(node, in);
854 value_used(block, use);
859 be_lv_foreach(lv, block, be_lv_state_in, idx) {
860 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
864 /* set must be empty now */
865 for (i = 0; i < n_regs; ++i) {
866 if (registers[i] == NULL)
869 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
870 registers[i], block, get_irg_name(irg));
871 problem_found = true;
875 bool be_verify_register_allocation(ir_graph *new_irg)
878 arch_env = be_get_irg_arch_env(irg);
879 lv = be_liveness_new(irg);
880 problem_found = false;
882 be_liveness_compute_sets(lv);
883 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
884 be_liveness_free(lv);
886 return !problem_found;
889 /*--------------------------------------------------------------------------- */
892 * Walker: checks that every predecessors of a node dominates the node.
894 static void dom_check(ir_node *irn, void *data)
896 bool *problem_found = (bool*)data;
898 if (!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
900 ir_node *bl = get_nodes_block(irn);
902 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
903 ir_node *op = get_irn_n(irn, i);
904 ir_node *def_bl = get_nodes_block(op);
905 ir_node *use_bl = bl;
908 use_bl = get_Block_cfgpred_block(bl, i);
910 if (get_irn_opcode(use_bl) != iro_Bad
911 && get_irn_opcode(def_bl) != iro_Bad
912 && !block_dominates(def_bl, use_bl)) {
913 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)));
914 *problem_found = true;
920 /* Check, if the SSA dominance property is fulfilled. */
921 bool be_check_dominance(ir_graph *irg)
923 bool problem_found = false;
926 irg_walk_graph(irg, dom_check, NULL, &problem_found);
928 return !problem_found;
931 /*--------------------------------------------------------------------------- */
933 typedef struct lv_walker_t {
938 static const char *lv_flags_to_str(unsigned flags)
940 static const char *states[] = {
951 return states[flags & 7];
954 static void lv_check_walker(ir_node *bl, void *data)
956 lv_walker_t *w = (lv_walker_t*)data;
958 be_lv_t *fresh = (be_lv_t*)w->data;
960 be_lv_info_t *curr = (be_lv_info_t*)ir_nodehashmap_get(&fresh->map, bl);
961 be_lv_info_t *fr = (be_lv_info_t*)ir_nodehashmap_get(&fresh->map, bl);
963 if (!fr && curr && curr[0].head.n_members > 0) {
966 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
967 for (i = 0; i < curr[0].head.n_members; ++i) {
968 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].node.idx));
973 unsigned n_curr = curr[0].head.n_members;
974 unsigned n_fresh = fr[0].head.n_members;
978 if (n_curr != n_fresh) {
979 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
981 ir_fprintf(stderr, "current:\n");
982 for (i = 0; i < n_curr; ++i) {
983 be_lv_info_node_t *n = &curr[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));
987 ir_fprintf(stderr, "correct:\n");
988 for (i = 0; i < n_fresh; ++i) {
989 be_lv_info_node_t *n = &fr[1 + i].node;
990 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
996 void be_liveness_check(be_lv_t *lv)
999 be_lv_t *fresh = be_liveness_new(lv->irg);
1003 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
1004 be_liveness_free(fresh);