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(irg);
136 env.registers_available = be_get_n_allocatable_regs(irg, cls);
137 env.problem_found = 0;
139 be_liveness_assure_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;
148 /*--------------------------------------------------------------------------- */
152 typedef struct be_verify_schedule_env_t_ {
153 int problem_found; /**< flags indicating a problem */
154 bitset_t *scheduled; /**< bitset of scheduled nodes */
155 ir_graph *irg; /**< the irg to check */
156 } be_verify_schedule_env_t;
159 * Simple schedule checker.
161 static void verify_schedule_walker(ir_node *block, void *data)
163 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
165 ir_node *non_phi_found = NULL;
166 ir_node *cfchange_found = NULL;
167 int last_timestep = INT_MIN;
170 * Tests for the following things:
171 * 1. Make sure that all phi nodes are scheduled at the beginning of the
173 * 2. No value is defined after it has been used
174 * 3. mode_T nodes have all projs scheduled behind them followed by Keeps
175 * (except mode_X projs)
177 sched_foreach(block, node) {
180 /* this node is scheduled */
181 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
182 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
183 env->problem_found = 1;
185 bitset_set(env->scheduled, get_irn_idx(node));
187 /* Check that scheduled nodes are in the correct block */
188 if (get_nodes_block(node) != block) {
189 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
190 env->problem_found = 1;
193 /* Check that timesteps are increasing */
194 timestep = sched_get_time_step(node);
195 if (timestep <= last_timestep) {
196 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
198 env->problem_found = 1;
200 last_timestep = timestep;
202 /* Check that phis come before any other node */
204 if (non_phi_found != NULL) {
205 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
206 node, non_phi_found, block, get_irg_name(env->irg));
207 env->problem_found = 1;
210 non_phi_found = node;
213 /* Check for control flow changing nodes */
215 /* check, that only one CF operation is scheduled */
216 if (cfchange_found != NULL) {
217 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
218 node, block, cfchange_found, get_irg_name(env->irg));
219 env->problem_found = 1;
221 cfchange_found = node;
223 } else if (cfchange_found != NULL) {
224 /* proj and keepany aren't real instructions... */
225 if (!is_Proj(node) && !be_is_Keep(node)) {
226 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
227 node, block, get_irg_name(env->irg));
228 env->problem_found = 1;
232 /* Check that all uses come before their definitions */
236 sched_timestep_t nodetime = sched_get_time_step(node);
237 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
238 ir_node *arg = get_irn_n(node, i);
239 if (get_nodes_block(arg) != block
240 || !sched_is_scheduled(arg))
243 if (sched_get_time_step(arg) >= nodetime) {
244 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
245 arg, node, block, get_irg_name(env->irg));
246 env->problem_found = 1;
251 /* Check that no dead nodes are scheduled */
252 if (get_irn_n_edges(node) == 0) {
253 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
254 node, block, get_irg_name(env->irg));
255 env->problem_found = 1;
258 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
259 /* at least 1 of the keep arguments has to be its schedule
261 int arity = get_irn_arity(node);
263 ir_node *prev = sched_prev(node);
264 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
265 prev = sched_prev(prev);
269 for (i = 0; i < arity; ++i) {
270 ir_node *in = get_irn_n(node, i);
277 prev = sched_prev(prev);
282 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
283 node, block, get_irg_name(env->irg));
284 env->problem_found = 1;
290 static void check_schedule(ir_node *node, void *data)
292 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
293 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
294 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
296 if (should_be != scheduled) {
297 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
298 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
299 env->problem_found = 1;
304 * Start a walk over the irg and check schedule.
306 int be_verify_schedule(ir_graph *irg)
308 be_verify_schedule_env_t env;
310 env.problem_found = 0;
312 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
314 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
315 /* check if all nodes are scheduled */
316 irg_walk_graph(irg, check_schedule, NULL, &env);
318 return ! env.problem_found;
323 /*--------------------------------------------------------------------------- */
327 typedef struct spill_t {
337 } be_verify_spillslots_env_t;
339 static int cmp_spill(const void* d1, const void* d2, size_t size)
341 const spill_t* s1 = (const spill_t*)d1;
342 const spill_t* s2 = (const spill_t*)d2;
345 return s1->spill != s2->spill;
348 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
353 return (spill_t*)set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
356 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
359 int hash = HASH_PTR(node);
362 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
366 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
372 static ir_node *get_memory_edge(const ir_node *node)
375 ir_node *result = NULL;
377 arity = get_irn_arity(node);
378 for (i = arity - 1; i >= 0; --i) {
379 ir_node *arg = get_irn_n(node, i);
380 if (get_irn_mode(arg) == mode_M) {
381 assert(result == NULL);
389 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
391 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
394 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
395 node, get_nodes_block(node), get_irg_name(env->irg));
399 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
401 ir_entity *spillent = arch_get_frame_entity(node);
402 be_check_entity(env, node, spillent);
403 get_spill(env, node, ent);
405 if (spillent != ent) {
406 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
407 node, reload, get_nodes_block(node), get_irg_name(env->irg));
408 env->problem_found = 1;
412 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
416 int hash = HASH_PTR(node);
421 assert(is_Proj(node));
423 memperm = get_Proj_pred(node);
424 out = get_Proj_proj(node);
426 spillent = be_get_MemPerm_out_entity(memperm, out);
427 be_check_entity(env, memperm, spillent);
428 if (spillent != ent) {
429 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
430 node, reload, get_nodes_block(node), get_irg_name(env->irg));
431 env->problem_found = 1;
435 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
440 spill.ent = spillent;
441 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
443 for (i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
444 ir_node* arg = get_irn_n(memperm, i + 1);
445 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
447 collect(env, arg, memperm, argent);
451 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
455 int hash = HASH_PTR(node);
457 assert(is_Phi(node));
460 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
466 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
468 /* is 1 of the arguments a spill? */
469 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
470 ir_node* arg = get_irn_n(node, i);
471 collect(env, arg, reload, ent);
475 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
477 if (be_is_Spill(node)) {
478 collect_spill(env, node, reload, ent);
479 } else if (is_Proj(node)) {
480 collect_memperm(env, node, reload, ent);
481 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
482 collect_memphi(env, node, reload, ent);
484 /* Disabled for now, spills might get transformed by the backend */
486 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
487 node, reload, get_nodes_block(node), get_irg_name(env->irg));
488 env->problem_found = 1;
494 * This walker function searches for reloads and collects all the spills
495 * and memphis attached to them.
497 static void collect_spills_walker(ir_node *node, void *data)
499 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
501 if (be_is_Reload(node)) {
502 ir_node *spill = get_memory_edge(node);
506 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
507 node, get_nodes_block(node), get_irg_name(env->irg));
508 env->problem_found = 1;
511 ent = arch_get_frame_entity(node);
512 be_check_entity(env, node, ent);
514 collect(env, spill, node, ent);
515 ARR_APP1(ir_node*, env->reloads, node);
519 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
521 int spillcount = set_count(env->spills);
522 spill_t **spills = ALLOCAN(spill_t*, spillcount);
527 foreach_set(env->spills, spill_t*, spill) {
531 for (i = 0; i < spillcount; ++i) {
532 spill_t *sp1 = spills[i];
535 for (i2 = i+1; i2 < spillcount; ++i2) {
536 spill_t *sp2 = spills[i2];
538 if (sp1->ent != sp2->ent)
541 if (my_values_interfere(sp1->spill, sp2->spill)) {
542 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
543 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
544 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
545 env->problem_found = 1;
546 my_values_interfere(sp1->spill, sp2->spill);
552 static void check_lonely_spills(ir_node *node, void *data)
554 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
556 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
557 spill_t *spill = find_spill(env, node);
558 if (be_is_Spill(node)) {
559 ir_entity *ent = arch_get_frame_entity(node);
560 be_check_entity(env, node, ent);
564 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
565 node, get_nodes_block(node), get_irg_name(env->irg));
570 int be_verify_spillslots(ir_graph *irg)
572 be_verify_spillslots_env_t env;
575 env.spills = new_set(cmp_spill, 10);
576 env.reloads = NEW_ARR_F(ir_node*, 0);
577 env.problem_found = 0;
579 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
580 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
582 check_spillslot_interference(&env);
584 DEL_ARR_F(env.reloads);
587 return ! env.problem_found;
592 /*--------------------------------------------------------------------------- */
597 * Check, if two values interfere.
598 * @param a The first value.
599 * @param b The second value.
600 * @return 1, if a and b interfere, 0 if not.
602 static int my_values_interfere(const ir_node *a, const ir_node *b)
604 const ir_edge_t *edge;
606 int a2b = value_dominates(a, b);
607 int b2a = value_dominates(b, a);
609 /* If there is no dominance relation, they do not interfere. */
614 * Adjust a and b so, that a dominates b if
615 * a dominates b or vice versa.
618 const ir_node *t = a;
623 bb = get_nodes_block(b);
626 * Look at all usages of a.
627 * If there's one usage of a in the block of b, then
628 * we check, if this use is dominated by b, if that's true
629 * a and b interfere. Note that b must strictly dominate the user,
630 * since if b is the last user of in the block, b and a do not
632 * Uses of a not in b's block can be disobeyed, because the
633 * check for a being live at the end of b's block is already
636 foreach_out_edge(a, edge) {
637 const ir_node *user = get_edge_src_irn(edge);
641 if (get_irn_opcode(user) == iro_End)
644 /* in case of phi arguments we compare with the block the value comes from */
646 ir_node *phiblock = get_nodes_block(user);
649 user = get_irn_n(phiblock, get_edge_src_pos(edge));
652 if (value_dominates(b, user))
661 /*--------------------------------------------------------------------------- */
663 static const arch_env_t *arch_env;
664 static ir_graph *irg;
666 static bool problem_found;
667 static const ir_node **registers;
669 static void check_output_constraints(const ir_node *node)
671 if (arch_get_irn_reg_class(node) == NULL)
674 /* verify output register */
675 const arch_register_req_t *req = arch_get_irn_register_req(node);
676 const arch_register_t *reg = arch_get_irn_register(node);
678 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
679 node, get_nodes_block(node), get_irg_name(irg));
680 problem_found = true;
681 } else if (!arch_reg_is_allocatable(req, reg)) {
682 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
683 reg->name, node, get_nodes_block(node), get_irg_name(irg));
684 problem_found = true;
688 static void check_input_constraints(ir_node *node)
690 const arch_register_t *reg;
693 /* verify input register */
694 arity = get_irn_arity(node);
695 for (i = 0; i < arity; ++i) {
696 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
697 ir_node *pred = get_irn_n(node, i);
698 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
701 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
702 node, get_nodes_block(node), get_irg_name(irg), i);
706 if (req->cls == NULL)
709 if (req->width > pred_req->width) {
710 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
711 node, get_nodes_block(node), get_irg_name(irg), i);
715 reg = arch_get_irn_register(pred);
716 if (req->type & arch_register_req_type_aligned) {
717 if (reg->index % req->width != 0) {
718 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register allignment not fulfilled\n",
719 node, get_nodes_block(node), get_irg_name(irg), i);
725 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
726 pred, get_nodes_block(pred), get_irg_name(irg), node);
729 } else if (!arch_reg_is_allocatable(req, reg)) {
730 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
731 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
736 /* phis should be NOPs at this point, which means all input regs
737 * must be the same as the output reg */
739 reg = arch_get_irn_register(node);
741 arity = get_irn_arity(node);
742 for (i = 0; i < arity; ++i) {
743 ir_node *pred = get_Phi_pred(node, i);
744 const arch_register_t *pred_reg = arch_get_irn_register(pred);
746 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
747 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
748 const char *reg_name = reg != NULL ? reg->name : "(null)";
749 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
750 i, node, get_nodes_block(node),
751 get_irg_name(irg), pred_name, reg_name);
758 static void value_used(const ir_node *block, const ir_node *node)
760 const arch_register_t *reg = arch_get_irn_register(node);
761 const arch_register_req_t *req;
765 if (reg == NULL || reg->type & arch_register_type_virtual)
768 req = arch_get_irn_register_req(node);
769 assert(req->width > 0);
770 idx = reg->global_index;
771 for (i = 0; i < req->width; ++i) {
772 const ir_node *reg_node = registers[idx+i];
773 if (reg_node != NULL && reg_node != node) {
774 const arch_register_t *realreg = &arch_env->registers[idx+i];
775 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
776 realreg->name, block, get_irg_name(irg),
778 problem_found = true;
780 registers[idx+i] = node;
784 static void value_def(const ir_node *node)
786 const arch_register_t *reg = arch_get_irn_register(node);
787 const arch_register_req_t *req;
791 if (reg == NULL || reg->type & arch_register_type_virtual)
794 req = arch_get_irn_register_req(node);
795 assert(req->width > 0);
796 idx = reg->global_index;
797 for (i = 0; i < req->width; ++i) {
798 const ir_node *reg_node = registers[idx+i];
800 /* a little cheat, since its so hard to remove all outedges to dead code
801 * in the backend. This particular case should never be a problem. */
802 if (reg_node == NULL && get_irn_n_edges(node) == 0)
805 if (reg_node != node) {
806 const arch_register_t *realreg = &arch_env->registers[idx+i];
807 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
808 node, realreg->name, reg_node, get_nodes_block(node),
810 problem_found = true;
812 registers[idx+i] = NULL;
816 static void verify_block_register_allocation(ir_node *block, void *data)
825 assert(lv->nodes && "live sets must be computed");
827 n_regs = arch_env->n_registers;
828 registers = ALLOCANZ(const ir_node*, n_regs);
830 be_lv_foreach(lv, block, be_lv_state_end, idx) {
831 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
832 value_used(block, lv_node);
835 sched_foreach_reverse(block, node) {
838 if (get_irn_mode(node) == mode_T) {
839 const ir_edge_t *edge;
840 foreach_out_edge(node, edge) {
841 ir_node *def = get_edge_src_irn(edge);
843 check_output_constraints(def);
847 check_output_constraints(node);
850 check_input_constraints(node);
852 /* process uses. (Phi inputs are no real uses) */
855 arity = get_irn_arity(node);
856 for (in = 0; in < arity; ++in) {
857 ir_node *use = get_irn_n(node, in);
858 value_used(block, use);
863 be_lv_foreach(lv, block, be_lv_state_in, idx) {
864 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
868 /* set must be empty now */
869 for (i = 0; i < n_regs; ++i) {
870 if (registers[i] == NULL)
873 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
874 registers[i], block, get_irg_name(irg));
875 problem_found = true;
879 bool be_verify_register_allocation(ir_graph *new_irg)
882 arch_env = be_get_irg_arch_env(irg);
883 lv = be_liveness(irg);
884 problem_found = false;
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;
894 /*--------------------------------------------------------------------------- */
897 * Walker: checks that every predecessors of a node dominates the node.
899 static void dom_check(ir_node *irn, void *data)
901 bool *problem_found = (bool*)data;
903 if (!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
905 ir_node *bl = get_nodes_block(irn);
907 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
908 ir_node *op = get_irn_n(irn, i);
909 ir_node *def_bl = get_nodes_block(op);
910 ir_node *use_bl = bl;
913 use_bl = get_Block_cfgpred_block(bl, i);
915 if (get_irn_opcode(use_bl) != iro_Bad
916 && get_irn_opcode(def_bl) != iro_Bad
917 && !block_dominates(def_bl, use_bl)) {
918 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)));
919 *problem_found = true;
925 /* Check, if the SSA dominance property is fulfilled. */
926 bool be_check_dominance(ir_graph *irg)
928 bool problem_found = false;
931 irg_walk_graph(irg, dom_check, NULL, &problem_found);
933 return !problem_found;
936 /*--------------------------------------------------------------------------- */
938 typedef struct lv_walker_t {
943 static const char *lv_flags_to_str(unsigned flags)
945 static const char *states[] = {
956 return states[flags & 7];
959 static void lv_check_walker(ir_node *bl, void *data)
961 lv_walker_t *w = (lv_walker_t*)data;
963 be_lv_t *fresh = (be_lv_t*)w->data;
965 be_lv_info_t *curr = (be_lv_info_t*)ir_nodehashmap_get(&fresh->map, bl);
966 be_lv_info_t *fr = (be_lv_info_t*)ir_nodehashmap_get(&fresh->map, bl);
968 if (!fr && curr && curr[0].head.n_members > 0) {
971 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
972 for (i = 0; i < curr[0].head.n_members; ++i) {
973 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].node.idx));
978 unsigned n_curr = curr[0].head.n_members;
979 unsigned n_fresh = fr[0].head.n_members;
983 if (n_curr != n_fresh) {
984 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
986 ir_fprintf(stderr, "current:\n");
987 for (i = 0; i < n_curr; ++i) {
988 be_lv_info_node_t *n = &curr[1 + i].node;
989 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
992 ir_fprintf(stderr, "correct:\n");
993 for (i = 0; i < n_fresh; ++i) {
994 be_lv_info_node_t *n = &fr[1 + i].node;
995 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
1001 void be_liveness_check(be_lv_t *lv)
1004 be_lv_t *fresh = be_liveness(lv->irg);
1008 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
1009 be_liveness_free(fresh);