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)
66 foreach_ir_nodeset(live_nodes, node, iter) {
67 ir_fprintf(F, "%+F ", node);
72 static const char *get_irg_name(ir_graph *irg)
74 ir_entity *entity = get_irg_entity(irg);
75 return get_entity_ld_name(entity);
79 * Check if number of live nodes never exceeds the number of available registers.
81 static void verify_liveness_walker(ir_node *block, void *data)
83 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
84 ir_nodeset_t live_nodes;
87 /* collect register pressure info, start with end of a block */
88 // ir_fprintf(stderr, "liveness check %+F\n", block);
89 ir_nodeset_init(&live_nodes);
90 be_liveness_end_of_block(env->lv, env->cls, block,
93 // print_living_values(stderr, &live_nodes);
94 pressure = ir_nodeset_size(&live_nodes);
95 if (pressure > env->registers_available) {
96 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
97 block, get_irg_name(env->irg), pressure, env->registers_available);
98 print_living_values(stderr, &live_nodes);
99 env->problem_found = 1;
102 sched_foreach_reverse(block, irn) {
106 // print_living_values(stderr, &live_nodes);
107 be_liveness_transfer(env->cls, irn, &live_nodes);
109 pressure = ir_nodeset_size(&live_nodes);
111 if (pressure > env->registers_available) {
112 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
113 irn, block, get_irg_name(env->irg), pressure, env->registers_available);
114 print_living_values(stderr, &live_nodes);
115 env->problem_found = 1;
119 ir_nodeset_destroy(&live_nodes);
123 * Start a walk over the irg and check the register pressure.
125 int be_verify_register_pressure(ir_graph *irg, const arch_register_class_t *cls)
127 be_verify_register_pressure_env_t env;
129 env.lv = be_liveness_new(irg);
132 env.registers_available = be_get_n_allocatable_regs(irg, cls);
133 env.problem_found = 0;
135 be_liveness_compute_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;
142 /*--------------------------------------------------------------------------- */
144 typedef struct be_verify_schedule_env_t_ {
145 int problem_found; /**< flags indicating a problem */
146 bitset_t *scheduled; /**< bitset of scheduled nodes */
147 ir_graph *irg; /**< the irg to check */
148 } be_verify_schedule_env_t;
151 * Simple schedule checker.
153 static void verify_schedule_walker(ir_node *block, void *data)
155 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
156 ir_node *non_phi_found = NULL;
157 ir_node *cfchange_found = NULL;
158 int last_timestep = INT_MIN;
161 * Tests for the following things:
162 * 1. Make sure that all phi nodes are scheduled at the beginning of the
164 * 2. No value is defined after it has been used
165 * 3. mode_T nodes have all projs scheduled behind them followed by Keeps
166 * (except mode_X projs)
168 sched_foreach(block, node) {
171 /* this node is scheduled */
172 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
173 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
174 env->problem_found = 1;
176 bitset_set(env->scheduled, get_irn_idx(node));
178 /* Check that scheduled nodes are in the correct block */
179 if (get_nodes_block(node) != block) {
180 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
181 env->problem_found = 1;
184 /* Check that timesteps are increasing */
185 timestep = sched_get_time_step(node);
186 if (timestep <= last_timestep) {
187 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
189 env->problem_found = 1;
191 last_timestep = timestep;
193 /* Check that phis come before any other node */
195 if (non_phi_found != NULL) {
196 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
197 node, non_phi_found, block, get_irg_name(env->irg));
198 env->problem_found = 1;
201 non_phi_found = node;
204 /* Check for control flow changing nodes */
206 /* check, that only one CF operation is scheduled */
207 if (cfchange_found != NULL) {
208 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
209 node, block, cfchange_found, get_irg_name(env->irg));
210 env->problem_found = 1;
212 cfchange_found = node;
214 } else if (cfchange_found != NULL) {
215 /* proj and keepany aren't real instructions... */
216 if (!is_Proj(node) && !be_is_Keep(node)) {
217 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
218 node, block, get_irg_name(env->irg));
219 env->problem_found = 1;
223 /* Check that all uses come before their definitions */
227 sched_timestep_t nodetime = sched_get_time_step(node);
228 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
229 ir_node *arg = get_irn_n(node, i);
230 if (get_nodes_block(arg) != block
231 || !sched_is_scheduled(arg))
234 if (sched_get_time_step(arg) >= nodetime) {
235 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
236 arg, node, block, get_irg_name(env->irg));
237 env->problem_found = 1;
242 /* Check that no dead nodes are scheduled */
243 if (get_irn_n_edges(node) == 0) {
244 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
245 node, block, get_irg_name(env->irg));
246 env->problem_found = 1;
249 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
250 /* at least 1 of the keep arguments has to be its schedule
252 int arity = get_irn_arity(node);
254 ir_node *prev = sched_prev(node);
255 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
256 prev = sched_prev(prev);
260 for (i = 0; i < arity; ++i) {
261 ir_node *in = get_irn_n(node, i);
268 prev = sched_prev(prev);
273 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
274 node, block, get_irg_name(env->irg));
275 env->problem_found = 1;
281 static void check_schedule(ir_node *node, void *data)
283 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
284 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
285 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
287 if (should_be != scheduled) {
288 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
289 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
290 env->problem_found = 1;
295 * Start a walk over the irg and check schedule.
297 int be_verify_schedule(ir_graph *irg)
299 be_verify_schedule_env_t env;
301 env.problem_found = 0;
303 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
305 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
306 /* check if all nodes are scheduled */
307 irg_walk_graph(irg, check_schedule, NULL, &env);
309 return ! env.problem_found;
314 /*--------------------------------------------------------------------------- */
318 typedef struct spill_t {
328 } be_verify_spillslots_env_t;
330 static int cmp_spill(const void* d1, const void* d2, size_t size)
332 const spill_t* s1 = (const spill_t*)d1;
333 const spill_t* s2 = (const spill_t*)d2;
336 return s1->spill != s2->spill;
339 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
344 return set_find(spill_t, env->spills, &spill, sizeof(spill), hash_ptr(node));
347 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
350 int hash = hash_ptr(node);
353 res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
357 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
363 static ir_node *get_memory_edge(const ir_node *node)
366 ir_node *result = NULL;
368 arity = get_irn_arity(node);
369 for (i = arity - 1; i >= 0; --i) {
370 ir_node *arg = get_irn_n(node, i);
371 if (get_irn_mode(arg) == mode_M) {
372 assert(result == NULL);
380 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
382 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
385 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
386 node, get_nodes_block(node), get_irg_name(env->irg));
390 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
392 ir_entity *spillent = arch_get_frame_entity(node);
393 be_check_entity(env, node, spillent);
394 get_spill(env, node, ent);
396 if (spillent != ent) {
397 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
398 node, reload, get_nodes_block(node), get_irg_name(env->irg));
399 env->problem_found = 1;
403 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
407 int hash = hash_ptr(node);
412 assert(is_Proj(node));
414 memperm = get_Proj_pred(node);
415 out = get_Proj_proj(node);
417 spillent = be_get_MemPerm_out_entity(memperm, out);
418 be_check_entity(env, memperm, spillent);
419 if (spillent != ent) {
420 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
421 node, reload, get_nodes_block(node), get_irg_name(env->irg));
422 env->problem_found = 1;
426 res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
431 spill.ent = spillent;
432 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
434 for (i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
435 ir_node* arg = get_irn_n(memperm, i + 1);
436 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
438 collect(env, arg, memperm, argent);
442 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
446 int hash = hash_ptr(node);
448 assert(is_Phi(node));
451 res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
457 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
459 /* is 1 of the arguments a spill? */
460 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
461 ir_node* arg = get_irn_n(node, i);
462 collect(env, arg, reload, ent);
466 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
468 if (be_is_Spill(node)) {
469 collect_spill(env, node, reload, ent);
470 } else if (is_Proj(node)) {
471 collect_memperm(env, node, reload, ent);
472 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
473 collect_memphi(env, node, reload, ent);
475 /* Disabled for now, spills might get transformed by the backend */
477 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
478 node, reload, get_nodes_block(node), get_irg_name(env->irg));
479 env->problem_found = 1;
485 * This walker function searches for reloads and collects all the spills
486 * and memphis attached to them.
488 static void collect_spills_walker(ir_node *node, void *data)
490 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
492 if (be_is_Reload(node)) {
493 ir_node *spill = get_memory_edge(node);
497 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
498 node, get_nodes_block(node), get_irg_name(env->irg));
499 env->problem_found = 1;
502 ent = arch_get_frame_entity(node);
503 be_check_entity(env, node, ent);
505 collect(env, spill, node, ent);
506 ARR_APP1(ir_node*, env->reloads, node);
510 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
512 int spillcount = set_count(env->spills);
513 spill_t **spills = ALLOCAN(spill_t*, spillcount);
517 foreach_set(env->spills, spill_t, spill) {
521 for (i = 0; i < spillcount; ++i) {
522 spill_t *sp1 = spills[i];
525 for (i2 = i+1; i2 < spillcount; ++i2) {
526 spill_t *sp2 = spills[i2];
528 if (sp1->ent != sp2->ent)
531 if (my_values_interfere(sp1->spill, sp2->spill)) {
532 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
533 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
534 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
535 env->problem_found = 1;
536 my_values_interfere(sp1->spill, sp2->spill);
542 static void check_lonely_spills(ir_node *node, void *data)
544 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
546 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
547 spill_t *spill = find_spill(env, node);
548 if (be_is_Spill(node)) {
549 ir_entity *ent = arch_get_frame_entity(node);
550 be_check_entity(env, node, ent);
554 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
555 node, get_nodes_block(node), get_irg_name(env->irg));
560 int be_verify_spillslots(ir_graph *irg)
562 be_verify_spillslots_env_t env;
565 env.spills = new_set(cmp_spill, 10);
566 env.reloads = NEW_ARR_F(ir_node*, 0);
567 env.problem_found = 0;
569 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
570 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
572 check_spillslot_interference(&env);
574 DEL_ARR_F(env.reloads);
577 return ! env.problem_found;
582 /*--------------------------------------------------------------------------- */
587 * Check, if two values interfere.
588 * @param a The first value.
589 * @param b The second value.
590 * @return 1, if a and b interfere, 0 if not.
592 static int my_values_interfere(const ir_node *a, const ir_node *b)
595 int a2b = value_dominates(a, b);
596 int b2a = value_dominates(b, a);
598 /* If there is no dominance relation, they do not interfere. */
603 * Adjust a and b so, that a dominates b if
604 * a dominates b or vice versa.
607 const ir_node *t = a;
612 bb = get_nodes_block(b);
615 * Look at all usages of a.
616 * If there's one usage of a in the block of b, then
617 * we check, if this use is dominated by b, if that's true
618 * a and b interfere. Note that b must strictly dominate the user,
619 * since if b is the last user of in the block, b and a do not
621 * Uses of a not in b's block can be disobeyed, because the
622 * check for a being live at the end of b's block is already
625 foreach_out_edge(a, edge) {
626 const ir_node *user = get_edge_src_irn(edge);
630 if (get_irn_opcode(user) == iro_End)
633 /* in case of phi arguments we compare with the block the value comes from */
635 ir_node *phiblock = get_nodes_block(user);
638 user = get_irn_n(phiblock, get_edge_src_pos(edge));
641 if (value_dominates(b, user))
650 /*--------------------------------------------------------------------------- */
652 static const arch_env_t *arch_env;
653 static ir_graph *irg;
655 static bool problem_found;
656 static const ir_node **registers;
658 static void check_output_constraints(const ir_node *node)
660 if (arch_get_irn_reg_class(node) == NULL)
663 /* verify output register */
664 const arch_register_req_t *req = arch_get_irn_register_req(node);
665 const arch_register_t *reg = arch_get_irn_register(node);
667 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
668 node, get_nodes_block(node), get_irg_name(irg));
669 problem_found = true;
670 } else if (!arch_reg_is_allocatable(req, reg)) {
671 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
672 reg->name, node, get_nodes_block(node), get_irg_name(irg));
673 problem_found = true;
677 static void check_input_constraints(ir_node *node)
679 const arch_register_t *reg;
682 /* verify input register */
683 arity = get_irn_arity(node);
684 for (i = 0; i < arity; ++i) {
685 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
686 ir_node *pred = get_irn_n(node, i);
687 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
690 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
691 node, get_nodes_block(node), get_irg_name(irg), i);
695 if (req->cls == NULL)
698 if (req->width > pred_req->width) {
699 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
700 node, get_nodes_block(node), get_irg_name(irg), i);
704 reg = arch_get_irn_register(pred);
705 if (req->type & arch_register_req_type_aligned) {
706 if (reg->index % req->width != 0) {
707 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register allignment not fulfilled\n",
708 node, get_nodes_block(node), get_irg_name(irg), i);
714 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
715 pred, get_nodes_block(pred), get_irg_name(irg), node);
718 } else if (!arch_reg_is_allocatable(req, reg)) {
719 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
720 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
725 /* phis should be NOPs at this point, which means all input regs
726 * must be the same as the output reg */
728 reg = arch_get_irn_register(node);
730 arity = get_irn_arity(node);
731 for (i = 0; i < arity; ++i) {
732 ir_node *pred = get_Phi_pred(node, i);
733 const arch_register_t *pred_reg = arch_get_irn_register(pred);
735 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
736 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
737 const char *reg_name = reg != NULL ? reg->name : "(null)";
738 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
739 i, node, get_nodes_block(node),
740 get_irg_name(irg), pred_name, reg_name);
747 static void value_used(const ir_node *block, const ir_node *node)
749 const arch_register_t *reg = arch_get_irn_register(node);
750 const arch_register_req_t *req;
754 if (reg == NULL || reg->type & arch_register_type_virtual)
757 req = arch_get_irn_register_req(node);
758 assert(req->width > 0);
759 idx = reg->global_index;
760 for (i = 0; i < req->width; ++i) {
761 const ir_node *reg_node = registers[idx+i];
762 if (reg_node != NULL && reg_node != node) {
763 const arch_register_t *realreg = &arch_env->registers[idx+i];
764 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
765 realreg->name, block, get_irg_name(irg),
767 problem_found = true;
769 registers[idx+i] = node;
773 static void value_def(const ir_node *node)
775 const arch_register_t *reg = arch_get_irn_register(node);
776 const arch_register_req_t *req;
780 if (reg == NULL || reg->type & arch_register_type_virtual)
783 req = arch_get_irn_register_req(node);
784 assert(req->width > 0);
785 idx = reg->global_index;
786 for (i = 0; i < req->width; ++i) {
787 const ir_node *reg_node = registers[idx+i];
789 /* a little cheat, since its so hard to remove all outedges to dead code
790 * in the backend. This particular case should never be a problem. */
791 if (reg_node == NULL && get_irn_n_edges(node) == 0)
794 if (reg_node != node) {
795 const arch_register_t *realreg = &arch_env->registers[idx+i];
796 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
797 node, realreg->name, reg_node, get_nodes_block(node),
799 problem_found = true;
801 registers[idx+i] = NULL;
805 static void verify_block_register_allocation(ir_node *block, void *data)
812 assert(lv->sets_valid && "live sets must be computed");
814 n_regs = arch_env->n_registers;
815 registers = ALLOCANZ(const ir_node*, n_regs);
817 be_lv_foreach(lv, block, be_lv_state_end, lv_node) {
818 value_used(block, lv_node);
821 sched_foreach_reverse(block, node) {
824 if (get_irn_mode(node) == mode_T) {
825 foreach_out_edge(node, edge) {
826 ir_node *def = get_edge_src_irn(edge);
828 check_output_constraints(def);
832 check_output_constraints(node);
835 check_input_constraints(node);
837 /* process uses. (Phi inputs are no real uses) */
840 arity = get_irn_arity(node);
841 for (in = 0; in < arity; ++in) {
842 ir_node *use = get_irn_n(node, in);
843 value_used(block, use);
848 be_lv_foreach(lv, block, be_lv_state_in, lv_node) {
852 /* set must be empty now */
853 for (i = 0; i < n_regs; ++i) {
854 if (registers[i] == NULL)
857 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
858 registers[i], block, get_irg_name(irg));
859 problem_found = true;
863 bool be_verify_register_allocation(ir_graph *new_irg)
866 arch_env = be_get_irg_arch_env(irg);
867 lv = be_liveness_new(irg);
868 problem_found = false;
870 be_liveness_compute_sets(lv);
871 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
872 be_liveness_free(lv);
874 return !problem_found;
877 /*--------------------------------------------------------------------------- */
880 * Walker: checks that every predecessors of a node dominates the node.
882 static void dom_check(ir_node *irn, void *data)
884 bool *problem_found = (bool*)data;
886 if (!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
888 ir_node *bl = get_nodes_block(irn);
890 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
891 ir_node *op = get_irn_n(irn, i);
892 ir_node *def_bl = get_nodes_block(op);
893 ir_node *use_bl = bl;
896 use_bl = get_Block_cfgpred_block(bl, i);
898 if (get_irn_opcode(use_bl) != iro_Bad
899 && get_irn_opcode(def_bl) != iro_Bad
900 && !block_dominates(def_bl, use_bl)) {
901 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)));
902 *problem_found = true;
908 /* Check, if the SSA dominance property is fulfilled. */
909 bool be_check_dominance(ir_graph *irg)
911 bool problem_found = false;
914 irg_walk_graph(irg, dom_check, NULL, &problem_found);
916 return !problem_found;
919 /*--------------------------------------------------------------------------- */
921 typedef struct lv_walker_t {
926 static const char *lv_flags_to_str(unsigned flags)
928 static const char *states[] = {
939 return states[flags & 7];
942 static void lv_check_walker(ir_node *bl, void *data)
944 lv_walker_t *w = (lv_walker_t*)data;
946 be_lv_t *fresh = (be_lv_t*)w->data;
948 be_lv_info_t *curr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
949 be_lv_info_t *fr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
951 if (!fr && curr && curr[0].head.n_members > 0) {
954 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
955 for (i = 0; i < curr[0].head.n_members; ++i) {
956 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].node.idx));
961 unsigned n_curr = curr[0].head.n_members;
962 unsigned n_fresh = fr[0].head.n_members;
966 if (n_curr != n_fresh) {
967 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
969 ir_fprintf(stderr, "current:\n");
970 for (i = 0; i < n_curr; ++i) {
971 be_lv_info_node_t *n = &curr[1 + i].node;
972 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
975 ir_fprintf(stderr, "correct:\n");
976 for (i = 0; i < n_fresh; ++i) {
977 be_lv_info_node_t *n = &fr[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));
984 void be_liveness_check(be_lv_t *lv)
987 be_lv_t *fresh = be_liveness_new(lv->irg);
991 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
992 be_liveness_free(fresh);