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 bool 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) {
169 /* this node is scheduled */
170 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
171 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
172 env->problem_found = 1;
174 bitset_set(env->scheduled, get_irn_idx(node));
176 /* Check that scheduled nodes are in the correct block */
177 if (get_nodes_block(node) != block) {
178 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
179 env->problem_found = 1;
182 /* Check that timesteps are increasing */
183 int timestep = sched_get_time_step(node);
184 if (timestep <= last_timestep) {
185 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
187 env->problem_found = 1;
189 last_timestep = timestep;
191 /* Check that phis come before any other node */
193 if (non_phi_found != NULL) {
194 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
195 node, non_phi_found, block, get_irg_name(env->irg));
196 env->problem_found = 1;
199 non_phi_found = node;
202 /* Check for control flow changing nodes */
204 /* check, that only one CF operation is scheduled */
205 if (cfchange_found != NULL) {
206 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
207 node, block, cfchange_found, get_irg_name(env->irg));
208 env->problem_found = 1;
210 cfchange_found = node;
212 } else if (cfchange_found != NULL) {
213 /* proj and keepany aren't real instructions... */
214 if (!is_Proj(node) && !be_is_Keep(node)) {
215 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
216 node, block, get_irg_name(env->irg));
217 env->problem_found = 1;
221 /* Check that all uses come before their definitions */
223 sched_timestep_t nodetime = sched_get_time_step(node);
224 int arity = get_irn_arity(node);
225 for (int i = 0; i < arity; ++i) {
226 ir_node *arg = get_irn_n(node, i);
227 if (get_nodes_block(arg) != block || !sched_is_scheduled(arg))
230 if (sched_get_time_step(arg) >= nodetime) {
231 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
232 arg, node, block, get_irg_name(env->irg));
233 env->problem_found = 1;
238 /* Check that no dead nodes are scheduled */
239 if (get_irn_n_edges(node) == 0) {
240 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
241 node, block, get_irg_name(env->irg));
242 env->problem_found = 1;
245 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
246 /* at least 1 of the keep arguments has to be its schedule
248 ir_node *prev = sched_prev(node);
249 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
250 prev = sched_prev(prev);
252 int arity = get_irn_arity(node);
255 for (int i = 0; i < arity; ++i) {
256 ir_node *in = get_irn_n(node, i);
263 prev = sched_prev(prev);
268 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
269 node, block, get_irg_name(env->irg));
270 env->problem_found = 1;
276 static void check_schedule(ir_node *node, void *data)
278 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
279 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
280 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
282 if (should_be != scheduled) {
283 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
284 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
285 env->problem_found = 1;
290 * Start a walk over the irg and check schedule.
292 int be_verify_schedule(ir_graph *irg)
294 be_verify_schedule_env_t env;
296 env.problem_found = 0;
298 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
300 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
301 /* check if all nodes are scheduled */
302 irg_walk_graph(irg, check_schedule, NULL, &env);
304 return ! env.problem_found;
307 /*--------------------------------------------------------------------------- */
309 typedef struct spill_t {
319 } be_verify_spillslots_env_t;
321 static int cmp_spill(const void* d1, const void* d2, size_t size)
324 const spill_t* s1 = (const spill_t*)d1;
325 const spill_t* s2 = (const spill_t*)d2;
326 return s1->spill != s2->spill;
329 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
333 return set_find(spill_t, env->spills, &spill, sizeof(spill), hash_ptr(node));
336 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
338 int hash = hash_ptr(node);
341 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
345 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
351 static ir_node *get_memory_edge(const ir_node *node)
353 ir_node *result = NULL;
354 int arity = get_irn_arity(node);
355 for (int i = arity - 1; i >= 0; --i) {
356 ir_node *arg = get_irn_n(node, i);
357 if (get_irn_mode(arg) == mode_M) {
358 assert(result == NULL);
366 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
368 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
371 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
372 node, get_nodes_block(node), get_irg_name(env->irg));
376 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
378 ir_entity *spillent = arch_get_frame_entity(node);
379 be_check_entity(env, node, spillent);
380 get_spill(env, node, ent);
382 if (spillent != ent) {
383 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
384 node, reload, get_nodes_block(node), get_irg_name(env->irg));
385 env->problem_found = 1;
389 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
391 assert(is_Proj(node));
393 ir_node *memperm = get_Proj_pred(node);
394 int out = get_Proj_proj(node);
396 ir_entity *spillent = be_get_MemPerm_out_entity(memperm, out);
397 be_check_entity(env, memperm, spillent);
398 if (spillent != ent) {
399 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
400 node, reload, get_nodes_block(node), get_irg_name(env->irg));
401 env->problem_found = 1;
404 int hash = hash_ptr(node);
407 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
412 spill.ent = spillent;
413 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
415 int arity = be_get_MemPerm_entity_arity(memperm);
416 for (int i = 0; i < arity; ++i) {
417 ir_node* arg = get_irn_n(memperm, i + 1);
418 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
420 collect(env, arg, memperm, argent);
424 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
426 assert(is_Phi(node));
428 int hash = hash_ptr(node);
431 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
437 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
439 /* is 1 of the arguments a spill? */
440 int arity = get_irn_arity(node);
441 for (int i = 0; i < arity; ++i) {
442 ir_node* arg = get_irn_n(node, i);
443 collect(env, arg, reload, ent);
447 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
449 if (be_is_Spill(node)) {
450 collect_spill(env, node, reload, ent);
451 } else if (is_Proj(node)) {
452 collect_memperm(env, node, reload, ent);
453 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
454 collect_memphi(env, node, reload, ent);
456 /* Disabled for now, spills might get transformed by the backend */
458 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
459 node, reload, get_nodes_block(node), get_irg_name(env->irg));
460 env->problem_found = 1;
466 * This walker function searches for reloads and collects all the spills
467 * and memphis attached to them.
469 static void collect_spills_walker(ir_node *node, void *data)
471 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
473 if (be_is_Reload(node)) {
474 ir_node *spill = get_memory_edge(node);
476 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
477 node, get_nodes_block(node), get_irg_name(env->irg));
478 env->problem_found = 1;
481 ir_entity *ent = arch_get_frame_entity(node);
482 be_check_entity(env, node, ent);
484 collect(env, spill, node, ent);
485 ARR_APP1(ir_node*, env->reloads, node);
489 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
491 int spillcount = set_count(env->spills);
492 spill_t **spills = ALLOCAN(spill_t*, spillcount);
495 foreach_set(env->spills, spill_t, spill) {
499 for (int i = 0; i < spillcount; ++i) {
500 spill_t *sp1 = spills[i];
502 for (int i2 = i+1; i2 < spillcount; ++i2) {
503 spill_t *sp2 = spills[i2];
505 if (sp1->ent != sp2->ent)
508 if (my_values_interfere(sp1->spill, sp2->spill)) {
509 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
510 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
511 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
512 env->problem_found = 1;
513 my_values_interfere(sp1->spill, sp2->spill);
519 static void check_lonely_spills(ir_node *node, void *data)
521 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
523 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
524 spill_t *spill = find_spill(env, node);
525 if (be_is_Spill(node)) {
526 ir_entity *ent = arch_get_frame_entity(node);
527 be_check_entity(env, node, ent);
531 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
532 node, get_nodes_block(node), get_irg_name(env->irg));
537 int be_verify_spillslots(ir_graph *irg)
539 be_verify_spillslots_env_t env;
542 env.spills = new_set(cmp_spill, 10);
543 env.reloads = NEW_ARR_F(ir_node*, 0);
544 env.problem_found = 0;
546 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
547 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
549 check_spillslot_interference(&env);
551 DEL_ARR_F(env.reloads);
554 return ! env.problem_found;
557 /*--------------------------------------------------------------------------- */
560 * Check, if two values interfere.
561 * @param a The first value.
562 * @param b The second value.
563 * @return 1, if a and b interfere, 0 if not.
565 static bool my_values_interfere(const ir_node *a, const ir_node *b)
567 int a2b = value_dominates(a, b);
568 int b2a = value_dominates(b, a);
570 /* If there is no dominance relation, they do not interfere. */
575 * Adjust a and b so, that a dominates b if
576 * a dominates b or vice versa.
579 const ir_node *t = a;
584 ir_node *bb = get_nodes_block(b);
587 * Look at all usages of a.
588 * If there's one usage of a in the block of b, then
589 * we check, if this use is dominated by b, if that's true
590 * a and b interfere. Note that b must strictly dominate the user,
591 * since if b is the last user of in the block, b and a do not
593 * Uses of a not in b's block can be disobeyed, because the
594 * check for a being live at the end of b's block is already
597 foreach_out_edge(a, edge) {
598 const ir_node *user = get_edge_src_irn(edge);
602 if (get_irn_opcode(user) == iro_End)
605 /* in case of phi arguments we compare with the block the value comes from */
607 ir_node *phiblock = get_nodes_block(user);
610 user = get_irn_n(phiblock, get_edge_src_pos(edge));
613 if (value_dominates(b, user))
620 /*--------------------------------------------------------------------------- */
622 static const arch_env_t *arch_env;
623 static ir_graph *irg;
625 static bool problem_found;
626 static const ir_node **registers;
628 static void check_output_constraints(const ir_node *node)
630 if (arch_get_irn_reg_class(node) == NULL)
633 /* verify output register */
634 const arch_register_req_t *req = arch_get_irn_register_req(node);
635 const arch_register_t *reg = arch_get_irn_register(node);
637 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
638 node, get_nodes_block(node), get_irg_name(irg));
639 problem_found = true;
640 } else if (!arch_reg_is_allocatable(req, reg)) {
641 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
642 reg->name, node, get_nodes_block(node), get_irg_name(irg));
643 problem_found = true;
647 static void check_input_constraints(ir_node *node)
649 /* verify input register */
650 int arity = get_irn_arity(node);
651 for (int i = 0; i < arity; ++i) {
652 ir_node *pred = get_irn_n(node, i);
654 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
655 node, get_nodes_block(node), get_irg_name(irg), i);
660 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
661 if (req->cls == NULL)
664 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
665 if (req->width > pred_req->width) {
666 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
667 node, get_nodes_block(node), get_irg_name(irg), i);
671 const arch_register_t *reg = arch_get_irn_register(pred);
673 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
674 pred, get_nodes_block(pred), get_irg_name(irg), node);
677 } else if (!arch_reg_is_allocatable(req, reg)) {
678 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
679 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
684 /* phis should be NOPs at this point, which means all input regs
685 * must be the same as the output reg */
687 const arch_register_t *reg = arch_get_irn_register(node);
689 int arity = get_irn_arity(node);
690 for (int i = 0; i < arity; ++i) {
691 ir_node *pred = get_Phi_pred(node, i);
692 const arch_register_t *pred_reg = arch_get_irn_register(pred);
694 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
695 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
696 const char *reg_name = reg != NULL ? reg->name : "(null)";
697 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
698 i, node, get_nodes_block(node),
699 get_irg_name(irg), pred_name, reg_name);
706 static void value_used(const ir_node *block, const ir_node *node)
708 const arch_register_t *reg = arch_get_irn_register(node);
709 if (reg == NULL || reg->type & arch_register_type_virtual)
712 const arch_register_req_t *req = arch_get_irn_register_req(node);
713 assert(req->width > 0);
714 unsigned idx = reg->global_index;
715 for (unsigned i = 0; i < req->width; ++i) {
716 const ir_node *reg_node = registers[idx+i];
717 if (reg_node != NULL && reg_node != node) {
718 const arch_register_t *realreg = &arch_env->registers[idx+i];
719 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
720 realreg->name, block, get_irg_name(irg),
722 problem_found = true;
724 registers[idx+i] = node;
728 static void value_def(const ir_node *node)
730 const arch_register_t *reg = arch_get_irn_register(node);
732 if (reg == NULL || reg->type & arch_register_type_virtual)
735 const arch_register_req_t *req = arch_get_irn_register_req(node);
736 assert(req->width > 0);
737 unsigned idx = reg->global_index;
738 for (unsigned i = 0; i < req->width; ++i) {
739 const ir_node *reg_node = registers[idx+i];
741 /* a little cheat, since its so hard to remove all outedges to dead code
742 * in the backend. This particular case should never be a problem. */
743 if (reg_node == NULL && get_irn_n_edges(node) == 0)
746 if (reg_node != node) {
747 const arch_register_t *realreg = &arch_env->registers[idx+i];
748 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
749 node, realreg->name, reg_node, get_nodes_block(node),
751 problem_found = true;
753 registers[idx+i] = NULL;
757 static void verify_block_register_allocation(ir_node *block, void *data)
761 assert(lv->sets_valid && "live sets must be computed");
763 unsigned n_regs = arch_env->n_registers;
764 registers = ALLOCANZ(const ir_node*, n_regs);
766 be_lv_foreach(lv, block, be_lv_state_end, lv_node) {
767 value_used(block, lv_node);
770 sched_foreach_reverse(block, node) {
772 if (get_irn_mode(node) == mode_T) {
773 foreach_out_edge(node, edge) {
774 ir_node *def = get_edge_src_irn(edge);
776 check_output_constraints(def);
780 check_output_constraints(node);
783 check_input_constraints(node);
785 /* process uses. (Phi inputs are no real uses) */
787 int arity = get_irn_arity(node);
788 for (int in = 0; in < arity; ++in) {
789 ir_node *use = get_irn_n(node, in);
790 value_used(block, use);
795 be_lv_foreach(lv, block, be_lv_state_in, lv_node) {
799 /* set must be empty now */
800 for (unsigned i = 0; i < n_regs; ++i) {
801 if (registers[i] == NULL)
804 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
805 registers[i], block, get_irg_name(irg));
806 problem_found = true;
810 bool be_verify_register_allocation(ir_graph *new_irg)
813 arch_env = be_get_irg_arch_env(irg);
814 lv = be_liveness_new(irg);
815 problem_found = false;
817 be_liveness_compute_sets(lv);
818 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
819 be_liveness_free(lv);
821 return !problem_found;
824 /*--------------------------------------------------------------------------- */
827 * Walker: checks that every predecessors of a node dominates the node.
829 static void dom_check(ir_node *irn, void *data)
831 bool *problem_found = (bool*)data;
833 if (!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
834 ir_node *bl = get_nodes_block(irn);
836 int n = get_irn_arity(irn);
837 for (int i = 0; i < n; ++i) {
838 ir_node *op = get_irn_n(irn, i);
839 ir_node *def_bl = get_nodes_block(op);
840 ir_node *use_bl = bl;
843 use_bl = get_Block_cfgpred_block(bl, i);
845 if (get_irn_opcode(use_bl) != iro_Bad
846 && get_irn_opcode(def_bl) != iro_Bad
847 && !block_dominates(def_bl, use_bl)) {
848 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)));
849 *problem_found = true;
855 /* Check, if the SSA dominance property is fulfilled. */
856 bool be_check_dominance(ir_graph *irg)
858 bool problem_found = false;
861 irg_walk_graph(irg, dom_check, NULL, &problem_found);
863 return !problem_found;
866 /*--------------------------------------------------------------------------- */
868 typedef struct lv_walker_t {
873 static const char *lv_flags_to_str(unsigned flags)
875 static const char *states[] = {
886 return states[flags & 7];
889 static void lv_check_walker(ir_node *bl, void *data)
891 lv_walker_t *w = (lv_walker_t*)data;
893 be_lv_t *fresh = (be_lv_t*)w->data;
895 be_lv_info_t *curr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
896 be_lv_info_t *fr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
898 if (!fr && curr && curr[0].head.n_members > 0) {
899 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
900 for (unsigned i = 0; i < curr[0].head.n_members; ++i) {
901 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].node.idx));
906 unsigned n_curr = curr[0].head.n_members;
907 unsigned n_fresh = fr[0].head.n_members;
909 if (n_curr != n_fresh) {
910 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
912 ir_fprintf(stderr, "current:\n");
913 for (unsigned i = 0; i < n_curr; ++i) {
914 be_lv_info_node_t *n = &curr[1 + i].node;
915 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
918 ir_fprintf(stderr, "correct:\n");
919 for (unsigned i = 0; i < n_fresh; ++i) {
920 be_lv_info_node_t *n = &fr[1 + i].node;
921 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
927 void be_liveness_check(be_lv_t *lv)
930 be_lv_t *fresh = be_liveness_new(lv->irg);
934 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
935 be_liveness_free(fresh);